FoxIntermediateBackend.Mod 575 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067140681406914070140711407214073140741407514076140771407814079140801408114082140831408414085140861408714088140891409014091140921409314094140951409614097140981409914100141011410214103141041410514106141071410814109141101411114112141131411414115141161411714118141191412014121141221412314124141251412614127141281412914130141311413214133141341413514136141371413814139141401414114142141431414414145141461414714148141491415014151141521415314154141551415614157141581415914160141611416214163141641416514166141671416814169141701417114172141731417414175141761417714178141791418014181141821418314184141851418614187141881418914190141911419214193141941419514196141971419814199142001420114202142031420414205142061420714208142091421014211142121421314214142151421614217142181421914220142211422214223142241422514226142271422814229142301423114232142331423414235142361423714238142391424014241142421424314244142451424614247142481424914250142511425214253142541425514256142571425814259142601426114262142631426414265142661426714268142691427014271142721427314274142751427614277142781427914280142811428214283142841428514286142871428814289142901429114292142931429414295142961429714298142991430014301143021430314304143051430614307143081430914310143111431214313143141431514316143171431814319143201432114322143231432414325143261432714328143291433014331143321433314334143351433614337143381433914340143411434214343143441434514346143471434814349143501435114352143531435414355143561435714358143591436014361143621436314364143651436614367143681436914370143711437214373143741437514376143771437814379143801438114382143831438414385143861438714388143891439014391143921439314394143951439614397143981439914400144011440214403144041440514406144071440814409144101441114412144131441414415144161441714418144191442014421144221442314424144251442614427144281442914430144311443214433144341443514436144371443814439144401444114442144431444414445144461444714448144491445014451144521445314454144551445614457144581445914460144611446214463144641446514466144671446814469144701447114472144731447414475144761447714478144791448014481144821448314484144851448614487144881448914490144911449214493144941449514496144971449814499145001450114502145031450414505145061450714508145091451014511145121451314514145151451614517145181451914520145211452214523145241452514526145271452814529145301453114532145331453414535145361453714538145391454014541145421454314544145451454614547145481454914550145511455214553145541455514556145571455814559145601456114562145631456414565145661456714568145691457014571145721457314574145751457614577145781457914580145811458214583145841458514586145871458814589145901459114592145931459414595145961459714598145991460014601146021460314604146051460614607146081460914610146111461214613146141461514616146171461814619146201462114622146231462414625146261462714628146291463014631146321463314634146351463614637146381463914640146411464214643146441464514646146471464814649146501465114652146531465414655146561465714658146591466014661146621466314664146651466614667146681466914670146711467214673146741467514676146771467814679146801468114682146831468414685146861468714688146891469014691146921469314694146951469614697146981469914700147011470214703147041470514706147071470814709147101471114712147131471414715147161471714718147191472014721147221472314724147251472614727147281472914730147311473214733147341473514736
  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. Trace = FALSE;
  42. TraceRegisterUsageCount=TRUE;
  43. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  44. (** system call numbers *)
  45. NumberSystemCalls* = 12;
  46. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  47. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  48. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  49. DefaultRuntimeModuleName ="Runtime";
  50. DefaultTraceModuleName ="KernelLog";
  51. ChannelModuleName = "Channels";
  52. NonPointer = -1; (* special pointer values *)
  53. NoType = 0; (* special type info values *)
  54. LhsIsPointer = 0; (* for the operator kind *)
  55. RhsIsPointer = 1;
  56. (* priority values, lower means higher priority *)
  57. EntryPriority=-4;
  58. FirstPriority=-3;
  59. InitPriority=-2;
  60. ExitPriority=-1;
  61. BasePointerTypeSize = 5;
  62. BaseArrayTypeSize = BasePointerTypeSize + 3;
  63. LengthOffset = BasePointerTypeSize + 0;
  64. DataOffset = BasePointerTypeSize + 1;
  65. DescriptorOffset = BasePointerTypeSize + 2;
  66. BaseRecordTypeSize = BasePointerTypeSize + 2;
  67. ActionOffset = BasePointerTypeSize + 0;
  68. MonitorOffset = BasePointerTypeSize + 1;
  69. BaseObjectTypeSize = BaseRecordTypeSize;
  70. ActionTypeSize = 3;
  71. MonitorTypeSize = 7;
  72. ProcessorOffset = BaseObjectTypeSize + 1;
  73. StackLimitOffset* = BaseObjectTypeSize + 3;
  74. QuantumOffset = BaseObjectTypeSize + 4;
  75. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  76. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  77. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  78. Size2Flag = 4; (* size = 2 *)
  79. Size3Flag = 5; (* size = 3 *)
  80. Size4Flag = 6; (* size = 4 *)
  81. Size5Flag = 7; (* size = 5 *)
  82. Size6Flag = 8; (* size = 6 *)
  83. Size7Flag = 9; (* size = 7 *)
  84. Size8Flag = 10; (* size = 8 *)
  85. ReflectionSupport = TRUE;
  86. (* 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:
  87. 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
  88. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  89. *)
  90. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  91. ProtectModulesPointers = FALSE;
  92. CreateProcedureDescInfo = TRUE;
  93. WarningDynamicLoading = FALSE;
  94. TYPE
  95. Position=SyntaxTree.Position;
  96. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  97. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  98. Operand = RECORD
  99. mode: SHORTINT;
  100. op: IntermediateCode.Operand;
  101. tag: IntermediateCode.Operand;
  102. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  103. dimOffset: LONGINT;
  104. END;
  105. Fixup= POINTER TO RECORD
  106. pc: LONGINT;
  107. nextFixup: Fixup;
  108. END;
  109. WriteBackCall = POINTER TO RECORD
  110. call: SyntaxTree.ProcedureCallDesignator;
  111. next: WriteBackCall;
  112. END;
  113. Label= OBJECT
  114. VAR
  115. fixups: Fixup;
  116. section: IntermediateCode.Section;
  117. pc: LONGINT;
  118. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  119. BEGIN
  120. SELF.section := section; pc := -1;
  121. END InitLabel;
  122. PROCEDURE Resolve(pc: LONGINT);
  123. VAR at: LONGINT;
  124. BEGIN
  125. SELF.pc := pc;
  126. WHILE(fixups # NIL) DO
  127. at := fixups.pc;
  128. section.PatchAddress(at,pc);
  129. fixups := fixups.nextFixup;
  130. END;
  131. END Resolve;
  132. PROCEDURE AddFixup(at: LONGINT);
  133. VAR fixup: Fixup;
  134. BEGIN
  135. ASSERT(pc=-1);
  136. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  137. END AddFixup;
  138. END Label;
  139. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  140. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  141. VAR
  142. backend: IntermediateBackend;
  143. implementationVisitor: ImplementationVisitor;
  144. meta: MetaDataGenerator;
  145. system: Global.System;
  146. currentScope: SyntaxTree.Scope;
  147. module: Sections.Module;
  148. moduleSelf: SyntaxTree.Variable;
  149. dump: BOOLEAN;
  150. forceModuleBody: BOOLEAN;
  151. addressType: IntermediateCode.Type;
  152. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  153. BEGIN
  154. currentScope := NIL; module := NIL; moduleSelf := NIL;
  155. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  156. SELF.dump := dump;
  157. SELF.backend := backend;
  158. SELF.forceModuleBody := forceModuleBody;
  159. addressType := IntermediateCode.GetType(system,system.addressType)
  160. END Init;
  161. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  162. BEGIN
  163. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  164. END Error;
  165. PROCEDURE Type(x: SyntaxTree.Type);
  166. BEGIN
  167. x.Accept(SELF);
  168. END Type;
  169. (** types **)
  170. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  171. BEGIN (* no code emission *) END VisitBasicType;
  172. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  173. BEGIN (* no code emission *) END VisitCharacterType;
  174. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  175. BEGIN (* no code emission *) END VisitIntegerType;
  176. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  177. BEGIN (* no code emission *) END VisitFloatType;
  178. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  179. BEGIN (* no code emission *) END VisitComplexType;
  180. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  181. VAR type: SyntaxTree.Type;
  182. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  183. type := x.resolved;
  184. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  185. meta.CheckTypeDeclaration(type);
  186. END;
  187. END VisitQualifiedType;
  188. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  189. BEGIN (* no code emission *) END VisitStringType;
  190. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  191. BEGIN (* no code emission *)
  192. END VisitArrayRangeType;
  193. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  194. BEGIN (* no code emission *) END VisitArrayType;
  195. PROCEDURE VisitPortType(x: SyntaxTree.PortType);
  196. BEGIN (* no code emission *) END VisitPortType;
  197. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  198. BEGIN
  199. meta.CheckTypeDeclaration(x);
  200. END VisitMathArrayType;
  201. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  202. BEGIN
  203. meta.CheckTypeDeclaration(x);
  204. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  205. END VisitPointerType;
  206. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  207. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  208. BEGIN (* no code emission *)
  209. meta.CheckTypeDeclaration(x);
  210. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  211. IF x.pointerType.typeDeclaration # NIL THEN
  212. td := x.pointerType.typeDeclaration
  213. ELSE
  214. td := x.typeDeclaration
  215. END;
  216. Global.GetSymbolName(td,name);
  217. (* code section for object *)
  218. END;
  219. Scope(x.recordScope);
  220. END VisitRecordType;
  221. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  222. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  223. BEGIN
  224. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  225. WHILE (this # NIL) & (this.identifier# id) DO
  226. this := this.nextModifier;
  227. END;
  228. RETURN this # NIL
  229. END HasFlag;
  230. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  231. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  232. BEGIN
  233. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  234. capabilities := {};
  235. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  236. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  237. backend.SetCapabilities(capabilities);
  238. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  239. Scope(x.cellScope);
  240. END;
  241. END VisitCellType;
  242. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  243. BEGIN (* no code emission *) END VisitProcedureType;
  244. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  245. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  246. END VisitEnumerationType;
  247. (* symbols *)
  248. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  249. BEGIN
  250. Procedure(x);
  251. END VisitProcedure;
  252. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  253. BEGIN
  254. Procedure(x);
  255. END VisitOperator;
  256. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  257. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  258. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  259. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  260. BEGIN
  261. type := type.resolved;
  262. IF type IS SyntaxTree.RecordType THEN
  263. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  264. ELSIF (type IS SyntaxTree.ArrayType) THEN
  265. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  266. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  267. END;
  268. ELSIF type IS SyntaxTree.MathArrayType THEN
  269. WITH type: SyntaxTree.MathArrayType DO
  270. IF type.form = SyntaxTree.Open THEN
  271. RETURN TRUE
  272. ELSIF type.form = SyntaxTree.Static THEN
  273. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  274. END;
  275. END;
  276. END;
  277. RETURN FALSE
  278. END TypeNeedsInitialization;
  279. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  280. VAR variable: SyntaxTree.Variable;
  281. BEGIN
  282. variable := scope.firstVariable;
  283. WHILE variable # NIL DO
  284. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  285. IF variable.initializer # NIL THEN RETURN TRUE END;
  286. variable := variable.nextVariable;
  287. END;
  288. RETURN FALSE
  289. END ScopeNeedsInitialization;
  290. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  291. VAR size: LONGINT;
  292. BEGIN
  293. size := offset - lastUpdated;
  294. IF size > 0 THEN
  295. irv.Emit(Reserve(x.position,size));
  296. END;
  297. irv.Emit(Data(x.position, op));
  298. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  299. END SingleInitialize;
  300. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  301. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  302. BEGIN
  303. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  304. WITH type: SyntaxTree.RecordType DO
  305. baseType := type.baseType;
  306. IF baseType # NIL THEN
  307. baseType := baseType.resolved;
  308. IF baseType IS SyntaxTree.PointerType THEN
  309. baseType := baseType(SyntaxTree.PointerType).pointerBase
  310. END;
  311. Initialize(baseType,NIL, offset);
  312. END;
  313. variable := type.recordScope.firstVariable;
  314. WHILE variable # NIL DO
  315. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  316. variable := variable.nextVariable
  317. END;
  318. | type: SyntaxTree.ArrayType DO
  319. IF type.form = SyntaxTree.Static THEN
  320. baseType := type.arrayBase;
  321. IF TypeNeedsInitialization(baseType) THEN
  322. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  323. FOR i := 0 TO type.staticLength-1 DO
  324. Initialize(baseType,NIL,offset+i*size);
  325. END;
  326. END;
  327. END;
  328. | type: SyntaxTree.MathArrayType DO
  329. IF type.form = SyntaxTree.Open THEN
  330. dim := DynamicDim(type);
  331. baseType := SemanticChecker.ArrayBase(type,dim);
  332. imm := IntermediateCode.Immediate(addressType,dim);
  333. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  334. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  335. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  336. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  337. (* flags remain empty (=0) for open array *)
  338. ELSIF type.form = SyntaxTree.Static THEN
  339. baseType := type.arrayBase;
  340. IF TypeNeedsInitialization(baseType) THEN
  341. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  342. ASSERT(type.staticLength < 1024*1024*1024);
  343. FOR i := 0 TO type.staticLength-1 DO
  344. Initialize(baseType,NIL,offset+i*size);
  345. END;
  346. END;
  347. END;
  348. ELSE
  349. IF initializer # NIL THEN
  350. implementationVisitor.Evaluate(initializer, op);
  351. SingleInitialize(op.op, offset);
  352. END;
  353. END;
  354. END Initialize;
  355. BEGIN
  356. IF x.externalName # NIL THEN RETURN END;
  357. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  358. (* code section for variable *)
  359. Global.GetSymbolSegmentedName(x,name);
  360. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  361. irv.SetExported(IsExported(x));
  362. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  363. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  364. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  365. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  366. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  367. FOR i := 0 TO DynamicDim(x.type)-1 DO
  368. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  369. END;
  370. ELSE
  371. lastUpdated:= 0;
  372. IF implementationVisitor.newObjectFile & ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  373. Initialize(x.type, x.initializer, 0);
  374. END;
  375. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  376. IF size > 0 THEN
  377. irv.Emit(Reserve(x.position,size));
  378. END;
  379. IF ~x.fixed THEN
  380. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  381. ELSE
  382. align := x.alignment;
  383. END;
  384. irv.SetPositionOrAlignment(x.fixed, align);
  385. meta.CheckTypeDeclaration(x.type);
  386. END;
  387. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  388. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  389. END;
  390. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  391. END VisitVariable;
  392. PROCEDURE VisitProperty(x: SyntaxTree.Property);
  393. BEGIN
  394. VisitVariable(x)
  395. END VisitProperty;
  396. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  397. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  398. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  399. BEGIN
  400. ASSERT(currentScope IS SyntaxTree.CellScope);
  401. Global.GetSymbolSegmentedName(x,name);
  402. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  403. irv.SetExported(IsExported(x));
  404. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  405. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  406. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  407. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  408. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  409. FOR i := 0 TO DynamicDim(x.type)-1 DO
  410. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  411. END;
  412. ELSE
  413. lastUpdated:= 0;
  414. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  415. IF size > 0 THEN
  416. irv.Emit(Reserve(x.position,size));
  417. END;
  418. IF ~x.fixed THEN
  419. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  420. ELSE
  421. align := x.alignment;
  422. END;
  423. irv.SetPositionOrAlignment(x.fixed, align);
  424. meta.CheckTypeDeclaration(x.type);
  425. END;
  426. END VisitParameter;
  427. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  428. BEGIN
  429. Type(x.declaredType); (* => code in objects *)
  430. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  431. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  432. END;
  433. END VisitTypeDeclaration;
  434. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  435. BEGIN
  436. IF (SyntaxTree.Public * x.access # {}) THEN
  437. implementationVisitor.VisitConstant(x);
  438. END;
  439. END VisitConstant;
  440. PROCEDURE Scope(x: SyntaxTree.Scope);
  441. VAR procedure: SyntaxTree.Procedure;
  442. constant: SyntaxTree.Constant;
  443. variable: SyntaxTree.Variable;
  444. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  445. cell: SyntaxTree.CellType;
  446. parameter: SyntaxTree.Parameter;
  447. property: SyntaxTree.Property;
  448. BEGIN
  449. prevScope := currentScope;
  450. currentScope := x;
  451. (* constants treated in implementation visitor *)
  452. WITH x: SyntaxTree.CellScope DO
  453. cell := x.ownerCell;
  454. parameter := cell.firstParameter;
  455. WHILE parameter # NIL DO
  456. VisitParameter(parameter);
  457. parameter := parameter.nextParameter;
  458. END;
  459. property := cell.firstProperty;
  460. WHILE property # NIL DO
  461. VisitProperty(property);
  462. property := property.nextProperty;
  463. END;
  464. ELSE
  465. END;
  466. typeDeclaration := x.firstTypeDeclaration;
  467. WHILE typeDeclaration # NIL DO
  468. VisitTypeDeclaration(typeDeclaration);
  469. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  470. END;
  471. variable := x.firstVariable;
  472. WHILE variable # NIL DO
  473. VisitVariable(variable);
  474. variable := variable.nextVariable;
  475. END;
  476. procedure := x.firstProcedure;
  477. WHILE procedure # NIL DO
  478. VisitProcedure(procedure);
  479. procedure := procedure.nextProcedure;
  480. END;
  481. constant := x.firstConstant;
  482. WHILE constant # NIL DO
  483. VisitConstant(constant);
  484. constant := constant.nextConstant;
  485. END;
  486. currentScope := prevScope;
  487. END Scope;
  488. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  489. VAR parameter: SyntaxTree.Parameter;
  490. BEGIN
  491. parameter := first;
  492. WHILE parameter # NIL DO
  493. VisitParameter(parameter);
  494. parameter := parameter.nextParameter;
  495. END;
  496. END Parameters;
  497. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  498. VAR scope: SyntaxTree.ProcedureScope;
  499. prevScope: SyntaxTree.Scope;
  500. inline, finalizer: BOOLEAN;
  501. procedureType: SyntaxTree.ProcedureType;
  502. pc: LONGINT;
  503. stackSize: LONGINT;
  504. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  505. null,size,src,dest,fp,res: IntermediateCode.Operand;
  506. cc: LONGINT;
  507. cellType: SyntaxTree.CellType;
  508. registerNumber: LONGINT;
  509. registerParameter: Backend.Registers;
  510. registerParameters: LONGINT;
  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. PROCEDURE Signature;
  519. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  520. BEGIN
  521. procedureType := x.type(SyntaxTree.ProcedureType);
  522. returnType := procedureType.returnType;
  523. IF returnType # NIL THEN
  524. meta.CheckTypeDeclaration(returnType)
  525. END;
  526. parameter := procedureType.firstParameter;
  527. WHILE parameter # NIL DO
  528. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  529. parameter := parameter.nextParameter;
  530. END;
  531. END Signature;
  532. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  533. VAR result: BOOLEAN;
  534. BEGIN
  535. result := FALSE;
  536. IF x = SyntaxTree.invalidExpression THEN
  537. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  538. result := TRUE;
  539. value := x.resolved(SyntaxTree.IntegerValue).value;
  540. ELSE
  541. Error(x.position,"expression is not an integer constant");
  542. END;
  543. RETURN result;
  544. END CheckIntegerValue;
  545. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  546. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  547. BEGIN
  548. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  549. WHILE (this # NIL) & (this.identifier # id) DO
  550. this := this.nextModifier;
  551. END;
  552. IF this # NIL THEN
  553. IF this.expression = NIL THEN
  554. Error(this.position,"expected expression value");
  555. ELSIF CheckIntegerValue(this.expression,value) THEN
  556. END;
  557. RETURN TRUE
  558. ELSE RETURN FALSE
  559. END;
  560. END HasValue;
  561. CONST DefaultDataMemorySize=512;
  562. BEGIN
  563. IF x.externalName # NIL THEN RETURN END;
  564. (*
  565. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  566. *)
  567. (* code section for this procedure *)
  568. position := x.position.start;
  569. scope := x.procedureScope;
  570. prevScope := currentScope;
  571. currentScope := scope;
  572. procedureType := x.type(SyntaxTree.ProcedureType);
  573. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  574. implementationVisitor.temporaries.Init;
  575. implementationVisitor.usedRegisters := NIL;
  576. implementationVisitor.registerUsageCount.Init;
  577. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  578. IF (scope.body # NIL) & (x.isInline) THEN
  579. inline := TRUE;
  580. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  581. ir.SetExported(IsExported(x));
  582. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  583. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  584. IF backend.cellsAreObjects THEN
  585. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  586. ir.SetExported(IsExported(x));
  587. ELSE
  588. RETURN; (* cellnet cannot be compiled for final static hardware *)
  589. END;
  590. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  591. inline := FALSE;
  592. AddBodyCallStub(x);
  593. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  594. ir.SetExported(IsExported(x));
  595. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  596. inline := FALSE;
  597. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  598. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  599. AddBodyCallStub(x);
  600. AddStackAllocation(x,stackSize);
  601. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  602. ir.SetExported(IsExported(x));
  603. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  604. inline := FALSE;
  605. Parameters(procedureType.firstParameter);
  606. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  607. ir.SetExported(IsExported(x));
  608. ELSE
  609. inline := FALSE;
  610. IF x.isEntry OR x.isExit THEN
  611. IF x.isEntry THEN
  612. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  613. ELSE
  614. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  615. END;
  616. ir.SetExported(TRUE);
  617. ELSE
  618. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  619. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  620. END;
  621. END;
  622. cc := procedureType.callingConvention;
  623. IF cc = SyntaxTree.WinAPICallingConvention THEN
  624. parametersSize := ProcedureParametersSize(backend.system,x);
  625. ELSE
  626. parametersSize := 0;
  627. END;
  628. IF scope.body # NIL THEN
  629. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  630. registerNumber := 0;
  631. IF ~inline THEN
  632. IF scope.lastVariable = NIL THEN
  633. stackSize := 0
  634. ELSE
  635. stackSize := scope.lastVariable.offsetInBits;
  636. IF stackSize <0 THEN stackSize := -stackSize END;
  637. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  638. END;
  639. (*
  640. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  641. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  642. *)
  643. (*
  644. ir.Emit(Nop(position)); (* placeholder for fill *)
  645. *)
  646. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  647. registerParameter := backend.GetParameterRegisters(procedureType.callingConvention);
  648. IF registerParameter = NIL THEN registerParameters := 0
  649. ELSE registerParameters := LEN(registerParameter)
  650. END;
  651. (* assumption: registers are passed left to right and left parameters are in registers *)
  652. formalParameter := procedureType.firstParameter;
  653. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  654. IF ~PassInRegister(formalParameter) THEN
  655. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  656. ELSE
  657. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, registerParameter[registerNumber]);
  658. IF formalParameter.type.IsRecordType() THEN
  659. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  660. type := addressType;
  661. ELSE
  662. type := GetType(system, formalParameter.type);
  663. END;
  664. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  665. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  666. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  667. implementationVisitor.ReleaseIntermediateOperand(src);
  668. INC(registerNumber);
  669. formalParameter := formalParameter.nextParameter;
  670. END;
  671. END;
  672. END;
  673. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  674. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  675. END;
  676. pc := ir.pc-1;
  677. END;
  678. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  679. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  680. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  681. IF scope.lastVariable # NIL THEN
  682. stackSize := scope.lastVariable.offsetInBits;
  683. IF stackSize <0 THEN stackSize := -stackSize END;
  684. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  685. END;
  686. END;
  687. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  688. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  689. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  690. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  691. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  692. ir.EmitAt(pc,Push(size));
  693. implementationVisitor.StaticCallOperand(result,procedure);
  694. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  695. END;
  696. *)
  697. END;
  698. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  699. IF stackSize > 0 THEN
  700. IF (stackSize MOD system.addressSize = 0) THEN
  701. null := IntermediateCode.Immediate(addressType,0);
  702. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  703. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  704. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  705. ELSE
  706. null := IntermediateCode.Immediate(int8,0);
  707. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  708. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  709. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  710. END;
  711. (*! should potentially be called by backend -- enter might initialize
  712. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  713. *)
  714. END;
  715. IF procedureType.callingConvention = SyntaxTree.WinAPICallingConvention THEN
  716. parametersSize := ProcedureParametersSize(backend.system,x);
  717. ELSE
  718. parametersSize := 0;
  719. END;
  720. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  721. finalizer := FALSE;
  722. IF backend.cooperative & x.isFinalizer THEN
  723. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  724. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  725. GetRecordTypeName(recordType,name);
  726. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  727. END;
  728. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  729. IF backend.cooperative THEN
  730. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  731. IF implementationVisitor.profile & ~isModuleBody THEN
  732. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  733. END;
  734. END;
  735. implementationVisitor.EmitLeave(ir, x.position,x,cc);
  736. IF finalizer THEN
  737. IF backend.hasLinkRegister THEN
  738. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  739. END;
  740. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  741. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  742. ir.Emit(Br(x.position,dest));
  743. ELSE
  744. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  745. END;
  746. ELSE
  747. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  748. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  749. END;
  750. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  751. IF backend.cooperative THEN
  752. IF HasPointers (scope) THEN
  753. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  754. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  755. ir.Emit(Result(x.position, res));
  756. ir.Emit(Push(x.position, res));
  757. implementationVisitor.ResetVariables(scope);
  758. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  759. ir.Emit(Pop(x.position, res));
  760. ir.Emit(Return(x.position, res));
  761. ELSE
  762. implementationVisitor.ResetVariables(scope);
  763. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  764. END;
  765. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  766. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  767. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  768. ir.Emit(Result(x.position, res));
  769. ir.Emit(Push(x.position, res));
  770. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  771. ir.Emit(Pop(x.position, res));
  772. ir.Emit(Return(x.position, res));
  773. ELSE
  774. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  775. END;
  776. END;
  777. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  778. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  779. ELSE
  780. ir.Emit(Nop(x.position));
  781. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  782. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  783. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  784. END;
  785. END;
  786. END
  787. END;
  788. ELSE (* force body for procedures *)
  789. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  790. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  791. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  792. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  793. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  794. END;
  795. Scope(scope);
  796. Signature;
  797. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  798. currentScope := prevScope;
  799. END Procedure;
  800. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  801. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  802. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  803. BEGIN
  804. ASSERT (bodyProcedure # NIL);
  805. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  806. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  807. procedure.SetScope(bodyProcedure.scope);
  808. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  809. procedure.SetAccess(SyntaxTree.Hidden);
  810. Global.GetSymbolSegmentedName (procedure,name);
  811. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  812. ir.SetExported(TRUE);
  813. Global.GetSymbolSegmentedName (bodyProcedure,name);
  814. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  815. implementationVisitor.currentScope := module.module.moduleScope;
  816. implementationVisitor.section := ir;
  817. implementationVisitor.PushSelfPointer();
  818. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  819. ELSIF backend.preregisterStatic THEN
  820. implementationVisitor.currentScope := module.module.moduleScope;
  821. implementationVisitor.section := ir;
  822. implementationVisitor.PushSelfPointer();
  823. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  824. ELSE
  825. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  826. ir.Emit(Call(bodyProcedure.position,op, 0));
  827. END;
  828. END AddBodyCallStub;
  829. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  830. VAR name: Basic.SegmentedName;
  831. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  832. BEGIN
  833. Global.GetSymbolSegmentedName (symbol,name);
  834. Basic.RemoveSuffix(name);
  835. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  836. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  837. ir.SetExported(TRUE);
  838. IntermediateCode.InitImmediate(op,addressType,initStack);
  839. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  840. END AddStackAllocation;
  841. (** entry function to visit a complete module *)
  842. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  843. VAR
  844. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  845. hasDynamicOperatorDeclarations: BOOLEAN;
  846. operator: SyntaxTree.Operator;
  847. import: SyntaxTree.Import;
  848. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  849. BEGIN
  850. type := type.resolved;
  851. IF type IS SyntaxTree.RecordType THEN
  852. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  853. ELSIF (type IS SyntaxTree.ArrayType) THEN
  854. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  855. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  856. END;
  857. ELSIF type IS SyntaxTree.MathArrayType THEN
  858. WITH type: SyntaxTree.MathArrayType DO
  859. IF type.form = SyntaxTree.Open THEN
  860. RETURN TRUE
  861. ELSIF type.form = SyntaxTree.Static THEN
  862. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  863. END;
  864. END;
  865. END;
  866. RETURN FALSE
  867. END TypeNeedsInitialization;
  868. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  869. VAR variable: SyntaxTree.Variable;
  870. BEGIN
  871. variable := scope.firstVariable;
  872. WHILE variable # NIL DO
  873. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  874. IF variable.initializer # NIL THEN RETURN TRUE END;
  875. variable := variable.nextVariable;
  876. END;
  877. RETURN FALSE
  878. END ScopeNeedsInitialization;
  879. BEGIN
  880. ASSERT(x # NIL); ASSERT(module # NIL);
  881. SELF.module := module;
  882. (* add import names to the generated Sections.Module *)
  883. import := x.moduleScope.firstImport;
  884. WHILE import # NIL DO
  885. import.module.GetName(idstr);
  886. module.imports.AddName(idstr);
  887. import := import.nextImport
  888. END;
  889. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  890. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  891. moduleSelf := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@moduleSelf"));
  892. moduleSelf.SetType(system.anyType);
  893. moduleSelf.SetScope(x.moduleScope);
  894. moduleSelf.SetUntraced(TRUE);
  895. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  896. ir.SetExported(TRUE);
  897. IntermediateCode.InitImmediate(op,addressType,0);
  898. ir.Emit(Data(Basic.invalidPosition,op));
  899. END;
  900. implementationVisitor.module := module;
  901. implementationVisitor.moduleScope := x.moduleScope;
  902. implementationVisitor.moduleSelf := moduleSelf;
  903. implementationVisitor.canBeLoaded := TRUE;
  904. meta.SetModule(module);
  905. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  906. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  907. END;
  908. IF backend.profile THEN
  909. EnsureBodyProcedure(x.moduleScope);
  910. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  911. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  912. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  913. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  914. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  915. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  916. Global.GetModuleName(module.module,idstr);
  917. implementationVisitor.ProfilerAddModule(idstr);
  918. implementationVisitor.numberProcedures := 0;
  919. END;
  920. implementationVisitor.profile := backend.profile;
  921. (* check if there is at least one dynamic operator locally defined *)
  922. hasDynamicOperatorDeclarations := FALSE;
  923. operator := x.moduleScope.firstOperator;
  924. WHILE operator # NIL DO
  925. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  926. operator := operator.nextOperator
  927. END;
  928. (* add operator initialization code section *)
  929. IF hasDynamicOperatorDeclarations THEN
  930. EnsureBodyProcedure(x.moduleScope);
  931. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  932. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  933. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  934. END;
  935. Scope(x.moduleScope);
  936. IF hasDynamicOperatorDeclarations THEN
  937. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  938. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  939. END;
  940. IF backend.profile THEN
  941. implementationVisitor.ProfilerPatchInit;
  942. END;
  943. END Module;
  944. END DeclarationVisitor;
  945. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  946. RegisterUsageCount*=OBJECT
  947. VAR used: UsedArray; count: LONGINT;
  948. PROCEDURE &Init;
  949. VAR i: LONGINT;
  950. BEGIN
  951. count := 0;
  952. IF used = NIL THEN NEW(used,64); END;
  953. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  954. END Init;
  955. PROCEDURE Grow;
  956. VAR new: UsedArray; size,i: LONGINT;
  957. BEGIN
  958. size := LEN(used)*2;
  959. NEW(new,size);
  960. FOR i := 0 TO LEN(used)-1 DO
  961. new[i].count := used[i].count;
  962. new[i].type := used[i].type;
  963. new[i].map := used[i].map
  964. END;
  965. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  966. used := new
  967. END Grow;
  968. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  969. BEGIN
  970. INC(count);
  971. IF count = LEN(used) THEN Grow END;
  972. used[count].type := type;
  973. used[count].class := class;
  974. used[count].map := count;
  975. RETURN count;
  976. END Next;
  977. PROCEDURE IncUse(register: LONGINT);
  978. BEGIN
  979. INC(used[register].count);
  980. (*
  981. IF (register = 1) & (count > 30) THEN
  982. D.TraceBack;
  983. END;
  984. *)
  985. END IncUse;
  986. PROCEDURE DecUse(register: LONGINT);
  987. BEGIN
  988. DEC(used[register].count);
  989. END DecUse;
  990. PROCEDURE Map(register: LONGINT): LONGINT;
  991. VAR map : LONGINT;
  992. BEGIN
  993. IF register > 0 THEN
  994. map := used[register].map;
  995. WHILE register # map DO register := map; map := used[register].map END;
  996. END;
  997. RETURN register
  998. END Map;
  999. PROCEDURE Use(register: LONGINT): LONGINT;
  1000. BEGIN
  1001. IF register< LEN(used) THEN
  1002. RETURN used[register].count
  1003. ELSE
  1004. RETURN 0
  1005. END
  1006. END Use;
  1007. END RegisterUsageCount;
  1008. RegisterEntry = POINTER TO RECORD
  1009. prev,next: RegisterEntry;
  1010. register: LONGINT;
  1011. registerClass: IntermediateCode.RegisterClass;
  1012. type: IntermediateCode.Type;
  1013. END;
  1014. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1015. Variables = OBJECT (Basic.List)
  1016. VAR
  1017. inUse: VariableUse;
  1018. registerIndex: LONGINT;
  1019. nameIndex: LONGINT;
  1020. PROCEDURE & Init;
  1021. VAR i: LONGINT;
  1022. BEGIN
  1023. InitList(16);
  1024. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1025. registerIndex := 1024;
  1026. nameIndex := 0;
  1027. END Init;
  1028. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1029. VAR string: SyntaxTree.IdentifierString ;
  1030. BEGIN
  1031. COPY("@hiddenIRVar",string);
  1032. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1033. RETURN SyntaxTree.NewIdentifier(string);
  1034. END GetUID;
  1035. PROCEDURE GetUsage(VAR use: VariableUse);
  1036. BEGIN
  1037. use := inUse;
  1038. END GetUsage;
  1039. PROCEDURE SetUsage(CONST use: VariableUse);
  1040. BEGIN
  1041. inUse := use;
  1042. END SetUsage;
  1043. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1044. VAR any: ANY;
  1045. BEGIN
  1046. any := Get(i);;
  1047. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1048. END GetVariable;
  1049. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1050. BEGIN
  1051. Set(pos, v);
  1052. END SetVariable;
  1053. PROCEDURE Occupy(pos: LONGINT);
  1054. BEGIN
  1055. INCL(inUse[pos DIV 32], pos MOD 32);
  1056. END Occupy;
  1057. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1058. BEGIN
  1059. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1060. END Occupied;
  1061. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1062. BEGIN
  1063. Occupy(Length());
  1064. Add(v);
  1065. END AddVariable;
  1066. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1067. BEGIN
  1068. t1 := t1.resolved;
  1069. t2 := t2.resolved;
  1070. RETURN t1.SameType(t2);
  1071. (*
  1072. the following needs testing
  1073. RETURN
  1074. (t1.SameType(t2))
  1075. OR
  1076. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1077. OR
  1078. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits = t2.sizeInBits)
  1079. OR
  1080. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1081. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1082. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1083. OR
  1084. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1085. (DynamicDim(t1) = DynamicDim(t2))
  1086. );
  1087. *)
  1088. END CompatibleType;
  1089. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1090. VAR var : SyntaxTree.Variable; i: LONGINT;
  1091. BEGIN
  1092. pos := Length();
  1093. FOR i := 0 TO pos-1 DO
  1094. IF ~(Occupied(i)) THEN
  1095. var := GetVariable(i);
  1096. IF CompatibleType(type, var.type) & (var.untraced = untraced) & ~(var.type.NeedsTrace()) THEN
  1097. pos := i;
  1098. Occupy(i);
  1099. RETURN var;
  1100. END;
  1101. END;
  1102. END;
  1103. RETURN NIL
  1104. END GetFreeVariable;
  1105. END Variables;
  1106. SymbolMap = POINTER TO RECORD
  1107. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1108. isAddress: BOOLEAN;
  1109. END;
  1110. SymbolMapper = OBJECT
  1111. VAR
  1112. first: SymbolMap;
  1113. PROCEDURE & Init;
  1114. BEGIN
  1115. first := NIL;
  1116. END Init;
  1117. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1118. VAR new: SymbolMap;
  1119. BEGIN
  1120. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1121. new.next := first; first := new;
  1122. END Add;
  1123. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1124. VAR s: SymbolMap;
  1125. BEGIN
  1126. s := first;
  1127. WHILE (s # NIL) & (s.this # this) DO
  1128. s := s.next
  1129. END;
  1130. RETURN s
  1131. END Get;
  1132. END SymbolMapper;
  1133. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1134. VAR
  1135. system: Global.System;
  1136. section: IntermediateCode.Section;
  1137. module: Sections.Module;
  1138. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1139. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1140. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1141. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1142. checker: SemanticChecker.Checker;
  1143. backend: IntermediateBackend;
  1144. meta: MetaDataGenerator;
  1145. position: Position;
  1146. moduleSelf: SyntaxTree.Variable;
  1147. (* variables for hand over of variables / temporary state *)
  1148. currentScope: SyntaxTree.Scope;
  1149. constantDeclaration : SyntaxTree.Symbol;
  1150. result: Operand; (* result of the most recent expression / statement *)
  1151. destination: IntermediateCode.Operand;
  1152. arrayDestinationTag: IntermediateCode.Operand;
  1153. arrayDestinationDimension:LONGINT;
  1154. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1155. conditional: BOOLEAN;
  1156. trueLabel, falseLabel, exitLabel: Label;
  1157. locked: BOOLEAN;
  1158. (*
  1159. usedRegisters: Registers;
  1160. *)
  1161. registerUsageCount: RegisterUsageCount;
  1162. usedRegisters: RegisterEntry;
  1163. (* useful operands and types *)
  1164. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1165. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1166. commentPrintout: Printout.Printer;
  1167. dump: Streams.Writer;
  1168. tagsAvailable : BOOLEAN;
  1169. supportedInstruction: SupportedInstructionProcedure;
  1170. supportedImmediate: SupportedImmediateProcedure;
  1171. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1172. emitLabels: BOOLEAN;
  1173. runtimeModuleName : SyntaxTree.IdentifierString;
  1174. newObjectFile: BOOLEAN;
  1175. indexCounter: LONGINT;
  1176. profile: BOOLEAN;
  1177. profileId, profileInit: IntermediateCode.Section;
  1178. profileInitPatchPosition: LONGINT;
  1179. numberProcedures: LONGINT;
  1180. procedureResultDesignator : SyntaxTree.Designator;
  1181. operatorInitializationCodeSection: IntermediateCode.Section;
  1182. fingerPrinter: FingerPrinter.FingerPrinter;
  1183. temporaries: Variables;
  1184. canBeLoaded : BOOLEAN;
  1185. currentIsInline: BOOLEAN;
  1186. currentMapper: SymbolMapper;
  1187. currentInlineExit: Label;
  1188. moduleBodySection: IntermediateCode.Section;
  1189. NeedDescriptor : BOOLEAN;
  1190. cooperativeSwitches: BOOLEAN;
  1191. lastSwitchPC: LONGINT;
  1192. isUnchecked: BOOLEAN;
  1193. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1194. newObjectFile: BOOLEAN);
  1195. BEGIN
  1196. SELF.system := system;
  1197. SELF.runtimeModuleName := runtime;
  1198. currentScope := NIL;
  1199. hiddenPointerType := NIL;
  1200. delegatePointerType := NIL;
  1201. awaitProcCounter := 0;
  1202. labelId := 0; constId := 0; labelId := 0;
  1203. SELF.checker := checker;
  1204. SELF.backend := backend;
  1205. position := Basic.invalidPosition;
  1206. conditional := FALSE;
  1207. locked := FALSE;
  1208. InitOperand(result,ModeUndefined);
  1209. addressType := IntermediateCode.GetType(system,system.addressType);
  1210. setType := IntermediateCode.GetType(system,system.setType);
  1211. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1212. lenType := IntermediateCode.GetType(system, system.lenType);
  1213. byteType := IntermediateCode.GetType(system, system.byteType);
  1214. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1215. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1216. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1217. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1218. nil := IntermediateCode.Immediate(addressType,0);
  1219. one := IntermediateCode.Immediate(addressType,1);
  1220. IntermediateCode.InitOperand(destination);
  1221. tagsAvailable := TRUE;
  1222. supportedInstruction := supportedInstructionProcedure;
  1223. supportedImmediate := supportedImmediateProcedure;
  1224. inData := FALSE;
  1225. SELF.emitLabels := emitLabels;
  1226. IntermediateCode.InitOperand(arrayDestinationTag);
  1227. bool := IntermediateCode.GetType(system,system.booleanType);
  1228. IntermediateCode.InitImmediate(false,bool,0);
  1229. IntermediateCode.InitImmediate(true,bool,1);
  1230. SELF.newObjectFile := newObjectFile;
  1231. indexCounter := 0;
  1232. NEW(registerUsageCount);
  1233. usedRegisters := NIL;
  1234. procedureResultDesignator := NIL;
  1235. NEW(fingerPrinter);
  1236. NEW(temporaries);
  1237. currentIsInline := FALSE;
  1238. NeedDescriptor := FALSE;
  1239. isUnchecked := backend.noRuntimeChecks;
  1240. END Init;
  1241. TYPE Context = RECORD
  1242. section: IntermediateCode.Section;
  1243. registerUsageCount: RegisterUsageCount;
  1244. usedRegisters: RegisterEntry;
  1245. temporaries: Variables;
  1246. END;
  1247. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1248. VAR context: Context;
  1249. BEGIN
  1250. context.section := section;
  1251. context.registerUsageCount := registerUsageCount;
  1252. context.usedRegisters := usedRegisters;
  1253. context.temporaries := temporaries;
  1254. section := new;
  1255. NEW(registerUsageCount);
  1256. NEW(temporaries);
  1257. usedRegisters := NIL;
  1258. RETURN context;
  1259. END SwitchContext;
  1260. PROCEDURE ReturnToContext(context: Context);
  1261. BEGIN
  1262. section := context.section;
  1263. registerUsageCount := context.registerUsageCount;
  1264. usedRegisters := context.usedRegisters;
  1265. temporaries := context.temporaries;
  1266. END ReturnToContext;
  1267. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1268. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1269. BEGIN
  1270. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1271. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1272. END;
  1273. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1274. section.SetExported(IsExported(syntaxTreeSymbol));
  1275. RETURN section
  1276. END NewSection;
  1277. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1278. VAR new: LONGINT;
  1279. BEGIN
  1280. new := registerUsageCount.Next(type,class);
  1281. UseRegister(new);
  1282. RETURN new
  1283. END AcquireRegister;
  1284. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1285. VAR
  1286. fingerPrint: SyntaxTree.FingerPrint;
  1287. fingerPrintString: ARRAY 32 OF CHAR;
  1288. BEGIN
  1289. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1290. string := "[";
  1291. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1292. Strings.Append(string, fingerPrintString);
  1293. Strings.Append(string, "]");
  1294. END GetFingerprintString;
  1295. (** get the name for the code section that represens a certain symbol
  1296. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1297. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1298. VAR string: ARRAY 32 OF CHAR;
  1299. BEGIN
  1300. Global.GetSymbolSegmentedName(symbol, name);
  1301. (* if the symbol is an operator, then append the fingerprint to the name *)
  1302. IF symbol IS SyntaxTree.Operator THEN
  1303. GetFingerprintString(symbol, string);
  1304. Basic.AppendToSegmentedName(name,string);
  1305. END
  1306. END GetCodeSectionNameForSymbol;
  1307. (** get the name for the code section that represens a certain symbol
  1308. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1309. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1310. VAR string: ARRAY 32 OF CHAR;
  1311. BEGIN
  1312. Global.GetSymbolNameInScope(symbol, scope, name);
  1313. (* if the symbol is an operator, then append the fingerprint to the name *)
  1314. IF symbol IS SyntaxTree.Operator THEN
  1315. GetFingerprintString(symbol, string);
  1316. Strings.Append(name, string);
  1317. END
  1318. END GetCodeSectionNameForSymbolInScope;
  1319. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1320. BEGIN
  1321. IF dump # NIL THEN
  1322. dump.String("enter "); dump.String(s); dump.Ln;
  1323. END;
  1324. END TraceEnter;
  1325. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1326. BEGIN
  1327. IF dump # NIL THEN
  1328. dump.String("exit "); dump.String(s); dump.Ln;
  1329. END;
  1330. END TraceExit;
  1331. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1332. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1333. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1334. VAR i: LONGINT;
  1335. BEGIN
  1336. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1337. IF op.rule # NIL THEN
  1338. FOR i := 0 TO LEN(op.rule)-1 DO
  1339. CheckRegister(op.rule[i])
  1340. END;
  1341. END;
  1342. END CheckRegister;
  1343. BEGIN
  1344. CheckRegister(instruction.op1);
  1345. CheckRegister(instruction.op2);
  1346. CheckRegister(instruction.op3);
  1347. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1348. ELSE section.Emit(instruction);
  1349. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1350. END;
  1351. END Emit;
  1352. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1353. BEGIN
  1354. IF backend.cooperative THEN
  1355. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1356. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1357. ELSE
  1358. Emit(Trap(position,trapNo));
  1359. END;
  1360. END EmitTrap;
  1361. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1362. VAR name: Basic.SegmentedName;
  1363. VAR op1, op2, reg: IntermediateCode.Operand;
  1364. VAR call, nocall: Label;
  1365. VAR parametersSize: LONGINT;
  1366. VAR prevSection: IntermediateCode.Section;
  1367. VAR prevDump: Streams.Writer;
  1368. VAR body: SyntaxTree.Body;
  1369. VAR procedureType: SyntaxTree.ProcedureType;
  1370. BEGIN
  1371. IF procedure # NIL THEN
  1372. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1373. ELSE procedureType := NIL;
  1374. END;
  1375. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1376. prevSection := SELF.section;
  1377. SELF.section := section;
  1378. prevDump := dump;
  1379. dump := section.comments;
  1380. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1381. IF backend.hasLinkRegister THEN
  1382. Emit(Push(Basic.invalidPosition, lr));
  1383. END;
  1384. Emit(Push(Basic.invalidPosition,fp));
  1385. IF procedure # NIL THEN
  1386. body := procedure.procedureScope.body;
  1387. ELSE
  1388. body := NIL;
  1389. END;
  1390. IF backend.cooperative THEN
  1391. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1392. GetCodeSectionNameForSymbol(procedure, name);
  1393. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1394. ELSE
  1395. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1396. END;
  1397. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1398. IntermediateCode.AddOffset(op1, 1);
  1399. Emit(Push(Basic.invalidPosition,op1));
  1400. Emit(Mov(Basic.invalidPosition,fp, sp));
  1401. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1402. NEW(call, section);
  1403. NEW(nocall, section);
  1404. reg := NewRegisterOperand(addressType);
  1405. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1406. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1407. BrltL(call, sp, reg);
  1408. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1409. BrgeL(nocall, sp, op2);
  1410. call.Resolve(section.pc);
  1411. Emit(Push(Basic.invalidPosition, reg));
  1412. ReleaseIntermediateOperand(reg);
  1413. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1414. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1415. Emit(Push(Basic.invalidPosition, op2));
  1416. CallThis(position, "Activities","ExpandStack",2);
  1417. Emit(Result(Basic.invalidPosition, sp));
  1418. nocall.Resolve(section.pc);
  1419. END;
  1420. ELSE
  1421. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1422. Emit(Push(Basic.invalidPosition, one)) ;
  1423. procedureType.SetParametersOffset(1);
  1424. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1425. END;
  1426. Emit(Mov(Basic.invalidPosition, fp, sp));
  1427. END;
  1428. END;
  1429. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1430. SELF.section := prevSection;
  1431. dump := prevDump;
  1432. END EmitEnter;
  1433. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1434. VAR op1,op2: IntermediateCode.Operand;
  1435. VAR instruction: IntermediateCode.Instruction;
  1436. BEGIN
  1437. IntermediateCode.InitNumber(op1,callconv);
  1438. IntermediateCode.InitNumber(op2,varSize);
  1439. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1440. RETURN instruction
  1441. END Enter;
  1442. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1443. VAR op1: IntermediateCode.Operand;
  1444. VAR instruction: IntermediateCode.Instruction;
  1445. BEGIN
  1446. IntermediateCode.InitNumber(op1,callconv);
  1447. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1448. RETURN instruction
  1449. END Leave;
  1450. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1451. VAR prevSection: IntermediateCode.Section;
  1452. VAR op2, size: IntermediateCode.Operand;
  1453. VAR body: SyntaxTree.Body;
  1454. BEGIN
  1455. prevSection := SELF.section;
  1456. SELF.section := section;
  1457. Emit(Leave(position, callconv));
  1458. IF procedure # NIL THEN
  1459. body := procedure.procedureScope.body;
  1460. ELSE
  1461. body := NIL;
  1462. END;
  1463. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1464. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1465. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1466. Emit(Add(position, sp, fp, op2));
  1467. ELSE
  1468. Emit(Mov(position, sp, fp));
  1469. END;
  1470. Emit(Pop(position, fp));
  1471. END;
  1472. SELF.section := prevSection;
  1473. END EmitLeave;
  1474. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1475. VAR m: SymbolMap;
  1476. BEGIN
  1477. position := x.position;
  1478. IF currentIsInline THEN
  1479. m := currentMapper.Get(x);
  1480. IF m # NIL THEN
  1481. (*
  1482. Printout.Info("mapping from", x);
  1483. Printout.Info("mapping to ", m.to);
  1484. *)
  1485. m.to.Accept(SELF);
  1486. op := result;
  1487. IF m.tag # NIL THEN
  1488. ReleaseIntermediateOperand(result.tag);
  1489. m.tag.Accept(SELF);
  1490. op.tag := result.op;
  1491. ReleaseIntermediateOperand(result.tag);
  1492. END;
  1493. RETURN
  1494. END;
  1495. END;
  1496. x.Accept(SELF);
  1497. op := result;
  1498. END Symbol;
  1499. PROCEDURE Expression(x: SyntaxTree.Expression);
  1500. BEGIN
  1501. position := x.position;
  1502. constantDeclaration := NIL;
  1503. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1504. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1505. END;
  1506. IF x.resolved # NIL THEN
  1507. x.resolved.Accept(SELF)
  1508. ELSE
  1509. x.Accept(SELF)
  1510. END;
  1511. (* check this, was commented out in ActiveCells3 *)
  1512. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1513. Error(x.position, "unsupported modifier");
  1514. END;
  1515. END Expression;
  1516. (*
  1517. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1518. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1519. BEGIN
  1520. temporaries.GetUsage(current);
  1521. FOR i := 0 TO LEN(current)-1 DO
  1522. set := current[i] - previous[i];
  1523. IF set # {} THEN
  1524. FOR j := 0 TO MAX(SET)-1 DO
  1525. IF j IN set THEN
  1526. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1527. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1528. Symbol(variable, op);
  1529. MakeMemory(tmp,op.op,addressType,0);
  1530. ReleaseOperand(op);
  1531. Emit(Mov(position,tmp, nil ) );
  1532. ReleaseIntermediateOperand(tmp);
  1533. END;
  1534. END;
  1535. END;
  1536. END;
  1537. END;
  1538. END ResetUsedTemporaries;
  1539. *)
  1540. PROCEDURE Statement(x: SyntaxTree.Statement);
  1541. VAR use: VariableUse;
  1542. BEGIN
  1543. temporaries.GetUsage(use);
  1544. position := x.position;
  1545. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1546. IF commentPrintout # NIL THEN
  1547. commentPrintout.Statement(x);
  1548. dump.Ln;
  1549. (*dump.Update;*)
  1550. END;
  1551. x.Accept(SELF);
  1552. (*
  1553. CheckRegistersFree();
  1554. *)
  1555. (*ResetUsedTemporaries(use);*)
  1556. temporaries.SetUsage(use);
  1557. END Statement;
  1558. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1559. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1560. *)
  1561. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1562. BEGIN
  1563. ASSERT(op.mode # IntermediateCode.Undefined);
  1564. IF op.mode = IntermediateCode.ModeMemory THEN
  1565. ReuseCopy(res,op);
  1566. ELSE
  1567. res := op;
  1568. UseIntermediateOperand(res);
  1569. END;
  1570. IntermediateCode.AddOffset(res,offset);
  1571. IntermediateCode.MakeMemory(res,type);
  1572. END MakeMemory;
  1573. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1574. VAR mem: IntermediateCode.Operand;
  1575. BEGIN
  1576. MakeMemory(mem,res,type,offset);
  1577. ReleaseIntermediateOperand(res);
  1578. res := mem;
  1579. END ToMemory;
  1580. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1581. VAR mem: IntermediateCode.Operand;
  1582. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1583. componentType: SyntaxTree.Type;
  1584. BEGIN
  1585. type := type.resolved;
  1586. IF operand.mode = ModeReference THEN
  1587. IF type IS SyntaxTree.RangeType THEN
  1588. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1589. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1590. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1591. ReleaseOperand(operand);
  1592. operand.op := firstOp;
  1593. operand.tag := lastOp;
  1594. operand.extra := stepOp;
  1595. ELSIF type IS SyntaxTree.ComplexType THEN
  1596. componentType := type(SyntaxTree.ComplexType).componentType;
  1597. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1598. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1599. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1600. ReleaseOperand(operand);
  1601. operand.op := firstOp;
  1602. operand.tag := lastOp
  1603. ELSE
  1604. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1605. ReleaseIntermediateOperand(operand.op);
  1606. operand.op := mem;
  1607. END;
  1608. operand.mode := ModeValue;
  1609. END;
  1610. ASSERT(operand.mode = ModeValue);
  1611. END LoadValue;
  1612. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1613. VAR prevConditional: BOOLEAN;
  1614. BEGIN
  1615. prevConditional := conditional;
  1616. conditional := FALSE;
  1617. InitOperand(result, ModeUndefined);
  1618. Expression(x);
  1619. op := result;
  1620. LoadValue(op,x.type.resolved);
  1621. conditional := prevConditional;
  1622. END Evaluate;
  1623. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1624. VAR prevConditional: BOOLEAN;
  1625. BEGIN
  1626. prevConditional := conditional;
  1627. conditional := FALSE;
  1628. InitOperand(result,ModeUndefined);
  1629. Expression(x);
  1630. op := result;
  1631. (*
  1632. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1633. *)
  1634. conditional := prevConditional;
  1635. END Designate;
  1636. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1637. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1638. BEGIN
  1639. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1640. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1641. conditional := TRUE;
  1642. trueLabel := trueL; falseLabel := falseL;
  1643. Expression(x);
  1644. trueL := trueLabel; falseL := falseLabel;
  1645. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1646. END Condition;
  1647. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1648. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1649. BEGIN
  1650. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1651. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1652. RETURN op
  1653. END NewRegisterOperand;
  1654. PROCEDURE UnuseRegister(register: LONGINT);
  1655. BEGIN
  1656. IF (register > 0) THEN
  1657. register := registerUsageCount.Map(register);
  1658. registerUsageCount.DecUse(register);
  1659. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1660. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1661. END;
  1662. IF registerUsageCount.Use(register)=0 THEN
  1663. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1664. Warning(position, "register cannot be removed");
  1665. END;
  1666. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1667. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1668. END;
  1669. ELSIF registerUsageCount.Use(register)<0 THEN
  1670. Warning(position, "register removed too often");
  1671. IF dump # NIL THEN
  1672. dump.String("register removed too often"); dump.Ln; dump.Update;
  1673. END;
  1674. END;
  1675. END;
  1676. END UnuseRegister;
  1677. PROCEDURE UseRegister(register: LONGINT);
  1678. BEGIN
  1679. IF (register > 0) THEN
  1680. register := registerUsageCount.Map(register);
  1681. registerUsageCount.IncUse(register);
  1682. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1683. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1684. END;
  1685. IF registerUsageCount.Use(register)=1 THEN
  1686. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1687. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1688. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1689. END;
  1690. END;
  1691. END;
  1692. END UseRegister;
  1693. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1694. BEGIN
  1695. UnuseRegister(op.register)
  1696. END ReleaseIntermediateOperand;
  1697. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1698. BEGIN
  1699. UseRegister(op.register)
  1700. END UseIntermediateOperand;
  1701. PROCEDURE ReleaseOperand(CONST op: Operand);
  1702. BEGIN
  1703. UnuseRegister(op.op.register);
  1704. UnuseRegister(op.tag.register);
  1705. UnuseRegister(op.extra.register);
  1706. END ReleaseOperand;
  1707. (* save registers marked in array "markedRegisters" to the stack
  1708. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1709. *)
  1710. PROCEDURE SaveRegisters();
  1711. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1712. BEGIN
  1713. entry := usedRegisters;
  1714. WHILE entry # NIL DO
  1715. type := registerUsageCount.used[entry.register].type;
  1716. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1717. Emit(Push(position,op));
  1718. entry := entry.next;
  1719. END;
  1720. END SaveRegisters;
  1721. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1722. BEGIN
  1723. saved := usedRegisters;
  1724. usedRegisters := NIL;
  1725. END ReleaseUsedRegisters;
  1726. (** remove parameter registers from used queue *)
  1727. PROCEDURE ReleaseParameterRegisters;
  1728. VAR entry,prev,next: RegisterEntry;
  1729. BEGIN
  1730. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1731. WHILE entry # NIL DO
  1732. next := entry.next;
  1733. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1734. registerUsageCount.DecUse(entry.register);
  1735. ASSERT(registerUsageCount.Use(entry.register)=0);
  1736. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1737. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1738. END;
  1739. ELSIF prev = NIL THEN
  1740. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1741. ELSE
  1742. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1743. END;
  1744. entry := next;
  1745. END;
  1746. END ReleaseParameterRegisters;
  1747. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1748. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1749. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1750. BEGIN
  1751. entry := saved;
  1752. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1753. entry := prev;
  1754. WHILE entry # NIL DO
  1755. prev := entry.prev;
  1756. type := entry.type;
  1757. class := entry.registerClass;
  1758. IntermediateCode.InitRegister(op,type,class,entry.register);
  1759. (*
  1760. new := registerUsageCount.Next(type,class);
  1761. registerUsageCount.Remap(entry.register,new);
  1762. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1763. dump.String("remap register "); dump.Int(entry.register,1);
  1764. dump.String("to "); dump.Int(new,1);
  1765. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1766. END;
  1767. entry.register := new;
  1768. *)
  1769. Emit(Pop(position,op));
  1770. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1771. entry := prev;
  1772. END;
  1773. (*
  1774. usedRegisters := saved;
  1775. *)
  1776. END RestoreRegisters;
  1777. PROCEDURE CheckRegistersFree;
  1778. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1779. BEGIN
  1780. IF usedRegisters # NIL THEN
  1781. r := usedRegisters;
  1782. WHILE r # NIL DO
  1783. warning := "register ";
  1784. Strings.AppendInt(warning, r.register);
  1785. Strings.Append(warning, " not released.");
  1786. Warning(position,warning);
  1787. r := r .next;
  1788. END;
  1789. END;
  1790. FOR i := 0 TO registerUsageCount.count-1 DO
  1791. IF registerUsageCount.used[i].count < 0 THEN
  1792. warning := "register ";
  1793. Strings.AppendInt(warning, i);
  1794. Strings.Append(warning, " unused too often.");
  1795. Warning(position,warning);
  1796. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1797. warning := "register ";
  1798. Strings.AppendInt(warning, i);
  1799. Strings.Append(warning, " not unused often enough.");
  1800. Warning(position,warning);
  1801. END;
  1802. END;
  1803. END CheckRegistersFree;
  1804. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1805. Otherwise allocate a new register.
  1806. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1807. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1808. BEGIN
  1809. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1810. UseIntermediateOperand(result);
  1811. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1812. UseIntermediateOperand(result);
  1813. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1814. END;
  1815. END Reuse2;
  1816. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1817. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1818. If not then allocate a new register.
  1819. Does NOT necessarily keep the content of src1 or src2 in result!
  1820. *)
  1821. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1822. BEGIN
  1823. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1824. UseIntermediateOperand(result);
  1825. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1826. UseIntermediateOperand(result);
  1827. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1828. result := alternative; alternative := emptyOperand;
  1829. UseIntermediateOperand(result);
  1830. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1831. END;
  1832. END Reuse2a;
  1833. (* like reuse2 but only one source *)
  1834. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1835. BEGIN
  1836. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1837. UseIntermediateOperand(result);
  1838. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1839. END;
  1840. END Reuse1;
  1841. (* like reuse2a but only one source *)
  1842. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1843. BEGIN
  1844. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1845. UseIntermediateOperand(result);
  1846. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1847. UseIntermediateOperand(result);
  1848. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1849. END;
  1850. END Reuse1a;
  1851. (* like reuse1 but guarantees that content of src1 is in result *)
  1852. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1853. BEGIN
  1854. IF ReusableRegister(src1) THEN
  1855. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1856. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1857. UseIntermediateOperand(result);
  1858. ELSE
  1859. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1860. Emit(Mov(position,result,src1));
  1861. END
  1862. END ReuseCopy;
  1863. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1864. BEGIN
  1865. IF ReusableRegister(src) THEN
  1866. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1867. ELSE
  1868. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1869. Emit(Mov(position,result,src));
  1870. ReleaseIntermediateOperand(src);
  1871. END
  1872. END TransferToRegister;
  1873. (** labels and branches **)
  1874. PROCEDURE NewLabel(): Label;
  1875. VAR label: Label;
  1876. BEGIN
  1877. NEW(label,section); RETURN label;
  1878. END NewLabel;
  1879. PROCEDURE SetLabel(label: Label);
  1880. BEGIN label.Resolve(section.pc);
  1881. END SetLabel;
  1882. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1883. BEGIN
  1884. ASSERT(label # NIL);
  1885. IF label.pc < 0 THEN (* label not yet set *)
  1886. label.AddFixup(section.pc);
  1887. END;
  1888. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1889. END LabelOperand;
  1890. PROCEDURE BrL(label: Label);
  1891. BEGIN
  1892. Emit(Br(position,LabelOperand(label)));
  1893. END BrL;
  1894. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1895. BEGIN
  1896. Emit(Brge(position,LabelOperand(label),left,right));
  1897. END BrgeL;
  1898. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1899. BEGIN
  1900. Emit(Brlt(position,LabelOperand(label),left,right));
  1901. END BrltL;
  1902. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1903. BEGIN
  1904. Emit(Breq(position,LabelOperand(label),left,right));
  1905. END BreqL;
  1906. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1907. BEGIN
  1908. Emit(Brne(position,LabelOperand(label),left,right));
  1909. END BrneL;
  1910. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1911. VAR new: IntermediateCode.Operand;
  1912. BEGIN
  1913. IF Trace THEN TraceEnter("Convert") END;
  1914. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1915. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1916. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1917. & (operand.offset = 0)
  1918. THEN
  1919. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1920. Emit(Conv(position,new,operand));
  1921. ELSE
  1922. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1923. Emit(Conv(position,new,operand));
  1924. ReleaseIntermediateOperand(operand);
  1925. END;
  1926. operand := new;
  1927. 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
  1928. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1929. ELSE
  1930. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1931. Emit(Conv(position,new,operand));
  1932. ReleaseIntermediateOperand(operand);
  1933. operand := new;
  1934. END;
  1935. IF Trace THEN TraceExit("Convert") END;
  1936. END Convert;
  1937. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1938. VAR exit: Label;
  1939. BEGIN
  1940. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1941. exit := NewLabel();
  1942. br(exit,left,right);
  1943. EmitTrap(position,trapNo);
  1944. SetLabel(exit);
  1945. END TrapC;
  1946. (** expressions *)
  1947. (** emit necessary runtime check for set elements **)
  1948. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1949. VAR max: IntermediateCode.Operand;
  1950. BEGIN
  1951. IF isUnchecked THEN RETURN END;
  1952. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1953. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1954. TrapC(BrgeL, max, o, SetElementTrap);
  1955. END;
  1956. END CheckSetElement;
  1957. (** the set that a range represents **)
  1958. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1959. VAR
  1960. operand: Operand;
  1961. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1962. BEGIN
  1963. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1964. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1965. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1966. one := IntermediateCode.Immediate(setType, 1);
  1967. Evaluate(x, operand);
  1968. Convert(operand.op, setType);
  1969. Convert(operand.tag, setType);
  1970. CheckSetElement(operand.op);
  1971. CheckSetElement(operand.tag);
  1972. (* create mask for lower bound
  1973. i.e. shift 11111111 to the left by the value of the lower bound
  1974. *)
  1975. Reuse1(temp, operand.op);
  1976. Emit(Shl(position,temp, allBits, operand.op));
  1977. ReleaseIntermediateOperand(operand.op);
  1978. operand.op := temp;
  1979. (* create mask for upper bound
  1980. i.e. shift 11111111 to the right by the difference between the
  1981. upper bound and the maximum number of set elements
  1982. *)
  1983. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1984. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1985. Reuse1(temp, operand.tag);
  1986. ELSE
  1987. Reuse1(temp, operand.tag);
  1988. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1989. Emit(Sub(position,temp, size, operand.tag));
  1990. END;
  1991. Emit(Shr(position,temp, allBits, operand.tag));
  1992. ReleaseIntermediateOperand(operand.tag);
  1993. operand.tag := temp;
  1994. Reuse2(resultingSet, operand.op, operand.tag);
  1995. (* intersect the two masks *)
  1996. Emit(And(position,resultingSet, operand.op, operand.tag));
  1997. ReleaseOperand(operand);
  1998. RETURN resultingSet
  1999. END SetFromRange;
  2000. PROCEDURE VisitSet(x: SyntaxTree.Set);
  2001. VAR
  2002. res, operand: Operand;
  2003. temp, one, noBits, dest: IntermediateCode.Operand;
  2004. expression: SyntaxTree.Expression;
  2005. i: LONGINT;
  2006. BEGIN
  2007. IF Trace THEN TraceEnter("VisitSet") END;
  2008. dest := destination;
  2009. destination := emptyOperand;
  2010. noBits := IntermediateCode.Immediate(setType, 0);
  2011. one := IntermediateCode.Immediate(setType, 1);
  2012. (* start off with the empty set *)
  2013. InitOperand(res, ModeValue);
  2014. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2015. Emit(Mov(position,res.op, noBits));
  2016. FOR i := 0 TO x.elements.Length() - 1 DO
  2017. expression := x.elements.GetExpression(i);
  2018. IF expression IS SyntaxTree.RangeExpression THEN
  2019. (* range of set elements *)
  2020. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2021. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2022. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2023. ReleaseIntermediateOperand(temp)
  2024. ELSE
  2025. (* singelton element *)
  2026. Evaluate(expression, operand);
  2027. Convert(operand.op, setType);
  2028. CheckSetElement(operand.op);
  2029. (* create subset containing single element *)
  2030. Reuse1(temp, operand.op);
  2031. Emit(Shl(position,temp, one, operand.op));
  2032. ReleaseOperand(operand);
  2033. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2034. ReleaseIntermediateOperand(temp);
  2035. END
  2036. END;
  2037. result := res;
  2038. destination := dest;
  2039. IF Trace THEN TraceExit("VisitSet") END;
  2040. END VisitSet;
  2041. (* math arrays of the form [a,b,c]
  2042. x is a static array and thus does not provide any pointers
  2043. *)
  2044. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  2045. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2046. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2047. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2048. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2049. element: SyntaxTree.IntegerValue;
  2050. BEGIN
  2051. numberElements := x.elements.Length();
  2052. expression := index.parameters.GetExpression(dim);
  2053. element := expression(SyntaxTree.IntegerValue);
  2054. FOR i := 0 TO numberElements-1 DO
  2055. expression := x.elements.GetExpression(i);
  2056. element.SetValue(i);
  2057. IF expression IS SyntaxTree.MathArrayExpression THEN
  2058. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2059. ELSE
  2060. Assign(index,expression);
  2061. END;
  2062. END;
  2063. END RecursiveAssignment;
  2064. BEGIN
  2065. (*static math array not providing pointers anyway *)
  2066. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2067. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2068. designator.SetType(variable.type);
  2069. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  2070. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2071. FOR i := 0 TO dim-1 DO
  2072. element := SyntaxTree.NewIntegerValue(x.position,0);
  2073. element.SetType(system.longintType);
  2074. index.parameters.AddExpression(element);
  2075. END;
  2076. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2077. RecursiveAssignment(x,0);
  2078. Expression(designator);
  2079. END VisitMathArrayExpression;
  2080. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  2081. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2082. BEGIN
  2083. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2084. dest := destination; destination := emptyOperand;
  2085. IF x.operator = Scanner.Not THEN
  2086. IF conditional THEN
  2087. Condition(x.left,falseLabel,trueLabel)
  2088. ELSE
  2089. Evaluate(x.left,operand);
  2090. InitOperand(result,ModeValue);
  2091. Reuse1a(result.op,operand.op,dest);
  2092. Emit(Xor(position,result.op,operand.op,true));
  2093. ReleaseOperand(operand);
  2094. END;
  2095. ELSIF x.operator = Scanner.Minus THEN
  2096. Evaluate(x.left,operand);
  2097. InitOperand(result,ModeValue);
  2098. Reuse1a(result.op,operand.op,dest);
  2099. type := x.left.type.resolved;
  2100. IF type IS SyntaxTree.SetType THEN
  2101. Emit(Not(position,result.op,operand.op));
  2102. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2103. Reuse1(result.tag,operand.tag);
  2104. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2105. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2106. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2107. Emit(Neg(position,result.op,operand.op));
  2108. ELSE HALT(200)
  2109. END;
  2110. ReleaseOperand(operand);
  2111. ELSIF x.operator = Scanner.Address THEN
  2112. Designate(x.left,operand);
  2113. operand.mode := ModeValue;
  2114. t0 := x.left.type.resolved;
  2115. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2116. ReleaseIntermediateOperand(operand.op);
  2117. operand.op := operand.tag;
  2118. IntermediateCode.InitOperand(operand.tag);
  2119. END;
  2120. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2121. result := operand;
  2122. ELSE HALT(100)
  2123. END;
  2124. destination := dest;
  2125. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2126. END VisitUnaryExpression;
  2127. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2128. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2129. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2130. BEGIN
  2131. type := type.resolved;
  2132. originalType := type;
  2133. IF type IS SyntaxTree.PointerType THEN
  2134. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2135. END;
  2136. IF type IS SyntaxTree.ObjectType THEN
  2137. BrL(trueL);
  2138. ELSE
  2139. ASSERT(type IS SyntaxTree.RecordType);
  2140. (*
  2141. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2142. *)
  2143. ReuseCopy(left,tag);
  2144. right := TypeDescriptorAdr(type);
  2145. IF ~newObjectFile THEN
  2146. IntermediateCode.MakeMemory(right,addressType);
  2147. END;
  2148. IF backend.cooperative THEN
  2149. repeatL := NewLabel();
  2150. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2151. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2152. END;
  2153. SetLabel(repeatL);
  2154. BreqL(trueL,left,right);
  2155. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2156. BrneL(repeatL,left,nil);
  2157. ELSIF meta.simple THEN
  2158. level := type(SyntaxTree.RecordType).Level();
  2159. (* get type desc tag of level relative to base tag *)
  2160. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2161. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2162. IntermediateCode.MakeMemory(left,addressType);
  2163. BreqL(trueL,left,right);
  2164. ELSE
  2165. level := type(SyntaxTree.RecordType).Level();
  2166. (* get type desc tag of level relative to base tag *)
  2167. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2168. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2169. IntermediateCode.MakeMemory(left,addressType);
  2170. BreqL(trueL,left,right);
  2171. END;
  2172. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2173. BrL(falseL);
  2174. END;
  2175. END TypeTest;
  2176. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2177. BEGIN
  2178. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2179. IF dump # NIL THEN
  2180. dump.String(s); dump.Ln;
  2181. END;
  2182. END Error;
  2183. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2184. BEGIN
  2185. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2186. IF dump # NIL THEN
  2187. dump.String(s); dump.Ln; dump.Update;
  2188. END;
  2189. END Warning;
  2190. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2191. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2192. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2193. operand:Operand;
  2194. BEGIN
  2195. previousSection := section;
  2196. Global.GetModuleName(mod,name);
  2197. Strings.Append(name,".@Trace");
  2198. Basic.ToSegmentedName(name, pooledName);
  2199. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2200. IF dump # NIL THEN dump := section.comments END;
  2201. IF backend.hasLinkRegister THEN
  2202. Emit(Push(Basic.invalidPosition, lr));
  2203. END;
  2204. variable := mod.moduleScope.firstVariable;
  2205. WHILE variable # NIL DO
  2206. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2207. Symbol(variable, operand);
  2208. register := operand.op;
  2209. CallTraceMethod(register, variable.type);
  2210. ReleaseIntermediateOperand(register);
  2211. END;
  2212. variable := variable.nextVariable;
  2213. END;
  2214. IF backend.hasLinkRegister THEN
  2215. Emit(Pop(Basic.invalidPosition, lr));
  2216. END;
  2217. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2218. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2219. Emit(Br(position,op));
  2220. INC(statCoopTraceModule, section.pc);
  2221. section := previousSection;
  2222. IF dump # NIL THEN dump := section.comments END;
  2223. END CreateTraceModuleMethod;
  2224. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2225. BEGIN
  2226. Emit (Push(position, dst));
  2227. Emit (Push(position, src));
  2228. CallThis(position,"GarbageCollector","Assign", 2);
  2229. END CallAssignPointer;
  2230. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2231. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2232. BEGIN
  2233. IF SemanticChecker.IsPointerType (type) THEN
  2234. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2235. ELSIF type.IsRecordType() THEN
  2236. Emit (Push(position,dst));
  2237. Emit (Push(position,src));
  2238. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2239. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2240. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2241. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2242. ELSIF IsStaticArray(type) THEN
  2243. size := StaticArrayNumElements(type);
  2244. base := StaticArrayBaseType(type);
  2245. IF base.IsRecordType() THEN
  2246. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2247. Emit (Push(position, dst));
  2248. Emit (Push(position, src));
  2249. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2250. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2251. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2252. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2253. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2254. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2255. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2256. Emit (Push(position, dst));
  2257. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2258. Emit (Push(position, src));
  2259. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2260. ELSE
  2261. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2262. Emit (Push(position, dst));
  2263. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2264. Emit (Push(position, src));
  2265. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2266. ASSERT(StaticArrayBaseType(type).IsPointer());
  2267. END;
  2268. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2269. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2270. Emit (Push(position, dst));
  2271. Emit (Push(position, src));
  2272. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2273. ELSE HALT(100); (* missing ? *)
  2274. END;
  2275. END CallAssignMethod;
  2276. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2277. VAR name: Basic.SegmentedName;
  2278. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2279. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2280. context: Context;
  2281. BEGIN
  2282. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2283. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2284. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2285. GetRecordTypeName (recordType,name);
  2286. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2287. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2288. IF dump # NIL THEN dump := section.comments END;
  2289. IF backend.hasLinkRegister THEN
  2290. Emit(Push(Basic.invalidPosition, lr));
  2291. END;
  2292. variable := recordType.recordScope.firstVariable;
  2293. WHILE variable # NIL DO
  2294. IF variable.NeedsTrace() THEN
  2295. dst := NewRegisterOperand (addressType);
  2296. src := NewRegisterOperand (addressType);
  2297. Emit (Mov(position, dst, parameter1));
  2298. Emit (Mov(position, src, parameter2));
  2299. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2300. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2301. CallAssignMethod(dst, src, variable.type);
  2302. ReleaseIntermediateOperand(src);
  2303. ReleaseIntermediateOperand(dst);
  2304. END;
  2305. variable := variable.nextVariable;
  2306. END;
  2307. recordBase := recordType.GetBaseRecord();
  2308. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2309. IF backend.hasLinkRegister THEN
  2310. Emit(Pop(Basic.invalidPosition, lr));
  2311. END;
  2312. GetRecordTypeName (recordBase,name);
  2313. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2314. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2315. Emit(Br(position,op));
  2316. ELSE
  2317. Emit(Exit(position,0,0, 0));
  2318. END;
  2319. IF ~recordType.isObject THEN
  2320. GetRecordTypeName (recordType,name);
  2321. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2322. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2323. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2324. NEW(registerUsageCount);
  2325. usedRegisters := NIL;
  2326. dst := NewRegisterOperand (addressType);
  2327. src := NewRegisterOperand (addressType);
  2328. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2329. Emit(Mov(position, dst, parameter1));
  2330. Emit(Mov(position, src, parameter2));
  2331. label := NewLabel();
  2332. SetLabel(label);
  2333. Emit(Push(position, dst));
  2334. Emit(Push(position, src));
  2335. GetRecordTypeName (recordType,name);
  2336. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2337. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2338. Emit(Call(position, op, 0));
  2339. Emit(Pop(position, src));
  2340. Emit(Pop(position, dst));
  2341. Emit(Add(position, dst, dst, ofs));
  2342. Emit(Add(position, src, src, ofs));
  2343. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2344. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2345. Emit(Exit(position,0,0, 0));
  2346. END;
  2347. INC(statCoopAssignProcedure, section.pc);
  2348. ReturnToContext(context);
  2349. IF dump # NIL THEN dump := section.comments END;
  2350. END CreateAssignProcedure;
  2351. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2352. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2353. BEGIN
  2354. IF IsUnsafePointer (type) THEN
  2355. skip := NewLabel();
  2356. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2357. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2358. BreqL (skip, op, nil);
  2359. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2360. SetLabel (skip);
  2361. ELSIF SemanticChecker.IsPointerType (type) THEN
  2362. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2363. CallThis(position,"GarbageCollector","Mark", 1);
  2364. ELSIF type.IsRecordType() THEN
  2365. Emit (Push(position,register));
  2366. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2367. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2368. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2369. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2370. ELSIF IsStaticArray(type) THEN
  2371. size := StaticArrayNumElements(type);
  2372. base := StaticArrayBaseType(type);
  2373. IF base.IsRecordType() THEN
  2374. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2375. Emit (Push(position, register));
  2376. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2377. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2378. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2379. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2380. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2381. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2382. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2383. Emit (Push(position, register));
  2384. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2385. ELSE
  2386. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2387. Emit (Push(position, register));
  2388. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2389. ASSERT(base.IsPointer());
  2390. END;
  2391. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2392. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2393. CallThis(position,"GarbageCollector","Mark", 1);
  2394. ELSE HALT(100); (* missing ? *)
  2395. END;
  2396. END CallTraceMethod;
  2397. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2398. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2399. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2400. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2401. BEGIN
  2402. previousSection := section;
  2403. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2404. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2405. GetRecordTypeName (recordType,name);
  2406. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2407. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2408. IF dump # NIL THEN dump := section.comments END;
  2409. IF backend.hasLinkRegister THEN
  2410. Emit(Push(Basic.invalidPosition, lr));
  2411. END;
  2412. variable := recordType.recordScope.firstVariable;
  2413. WHILE variable # NIL DO
  2414. IF variable.NeedsTrace() THEN
  2415. register := NewRegisterOperand (addressType);
  2416. Emit (Mov(position,register,parameter1));
  2417. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2418. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2419. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2420. END;
  2421. CallTraceMethod(register, variable.type);
  2422. ReleaseIntermediateOperand(register);
  2423. END;
  2424. variable := variable.nextVariable;
  2425. END;
  2426. recordBase := recordType.GetBaseRecord();
  2427. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2428. recordBase := recordBase.GetBaseRecord();
  2429. END;
  2430. IF recordBase # NIL THEN
  2431. IF backend.hasLinkRegister THEN
  2432. Emit(Pop(Basic.invalidPosition, lr));
  2433. END;
  2434. GetRecordTypeName (recordBase,name);
  2435. IF HasExplicitTraceMethod (recordBase) THEN
  2436. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2437. ELSE
  2438. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2439. END;
  2440. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2441. Emit(Br(position,op));
  2442. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2443. Emit(Exit(position,0,0,0));
  2444. ELSE
  2445. IF backend.hasLinkRegister THEN
  2446. Emit(Pop(Basic.invalidPosition, lr));
  2447. END;
  2448. IF recordType.isObject THEN
  2449. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2450. ELSE
  2451. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2452. END;
  2453. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2454. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2455. Emit(Br(position,op));
  2456. END;
  2457. IF ~recordType.isObject THEN
  2458. GetRecordTypeName (recordType,name);
  2459. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2460. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2461. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2462. NEW(registerUsageCount);
  2463. usedRegisters := NIL;
  2464. IF dump # NIL THEN dump := section.comments END;
  2465. register := NewRegisterOperand (addressType);
  2466. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2467. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2468. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2469. END;
  2470. Emit (Push(position,register));
  2471. GetRecordTypeName (recordType,name);
  2472. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2473. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2474. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2475. ReleaseIntermediateOperand(register);
  2476. Emit(Exit(position,0,0,0));
  2477. GetRecordTypeName (recordType,name);
  2478. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2479. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2480. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2481. NEW(registerUsageCount);
  2482. usedRegisters := NIL;
  2483. register := NewRegisterOperand (addressType);
  2484. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2485. Emit(Mov(position, register, parameter1));
  2486. label := NewLabel();
  2487. SetLabel(label);
  2488. Emit(Push(position, register));
  2489. GetRecordTypeName (recordType,name);
  2490. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2491. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2492. Emit(Call(position, op, 0));
  2493. Emit(Pop(position, register));
  2494. Emit(Add(position, register, register, ofs));
  2495. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2496. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2497. Emit(Exit(position,0,0,0));
  2498. END;
  2499. INC(statCoopTraceMethod, section.pc);
  2500. ReturnToContext(context);
  2501. IF dump # NIL THEN dump := section.comments END;
  2502. END CreateTraceMethod;
  2503. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2504. VAR name: Basic.SegmentedName;
  2505. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2506. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2507. context: Context;
  2508. BEGIN
  2509. IF recordType.isObject THEN RETURN END;
  2510. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2511. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2512. GetRecordTypeName (recordType,name);
  2513. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2514. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2515. IF dump # NIL THEN dump := section.comments END;
  2516. IF backend.hasLinkRegister THEN
  2517. Emit(Push(Basic.invalidPosition, lr));
  2518. END;
  2519. variable := recordType.recordScope.firstVariable;
  2520. WHILE variable # NIL DO
  2521. IF variable.NeedsTrace() THEN
  2522. dst := NewRegisterOperand (addressType);
  2523. Emit (Mov(position, dst, parameter1));
  2524. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2525. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2526. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2527. END;
  2528. CallResetProcedure(dst, nil, variable.type);
  2529. ReleaseIntermediateOperand(dst);
  2530. END;
  2531. variable := variable.nextVariable;
  2532. END;
  2533. recordBase := recordType.GetBaseRecord();
  2534. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2535. IF backend.hasLinkRegister THEN
  2536. Emit(Pop(Basic.invalidPosition, lr));
  2537. END;
  2538. GetRecordTypeName (recordBase,name);
  2539. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2540. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2541. Emit(Br(position,op));
  2542. ELSE
  2543. Emit(Exit(position,0,0, 0));
  2544. END;
  2545. GetRecordTypeName (recordType,name);
  2546. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2547. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2548. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2549. NEW(registerUsageCount);
  2550. usedRegisters := NIL;
  2551. dst := NewRegisterOperand (addressType);
  2552. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2553. Emit(Mov(position, dst, parameter1));
  2554. label := NewLabel();
  2555. SetLabel(label);
  2556. Emit(Push(position, dst));
  2557. GetRecordTypeName (recordType,name);
  2558. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2559. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2560. Emit(Call(position, op, 0));
  2561. Emit(Pop(position, dst));
  2562. Emit(Add(position, dst, dst, ofs));
  2563. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2564. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2565. Emit(Exit(position,0,0, 0));
  2566. INC(statCoopResetProcedure, section.pc);
  2567. ReturnToContext(context);
  2568. IF dump # NIL THEN dump := section.comments END;
  2569. END CreateResetProcedure;
  2570. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2571. VAR name: Basic.SegmentedName; context: Context;
  2572. BEGIN
  2573. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2574. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2575. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2576. IF dump # NIL THEN dump := section.comments END;
  2577. IF backend.hasLinkRegister THEN
  2578. Emit(Push(Basic.invalidPosition, lr));
  2579. END;
  2580. Emit(Push(position,fp));
  2581. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2582. ResetVariables(scope);
  2583. Emit(Pop(position,fp));
  2584. Emit(Exit(position,0,0, 0));
  2585. ReturnToContext(context);
  2586. IF dump # NIL THEN dump := section.comments END;
  2587. END CreateResetMethod;
  2588. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2589. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2590. BEGIN
  2591. IF SemanticChecker.IsPointerType (type) THEN
  2592. Emit (Push(position, dest));
  2593. CallThis(position,"GarbageCollector","Reset", 1);
  2594. ELSIF type.IsRecordType() THEN
  2595. Emit (Push(position, dest));
  2596. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2597. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2598. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2599. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2600. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2601. size := GetArrayLength(type, tag);
  2602. base := ArrayBaseType(type);
  2603. IF base.IsRecordType() THEN
  2604. Emit (Push(position, size));
  2605. Emit (Push(position, dest));
  2606. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2607. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2608. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2609. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2610. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2611. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2612. Emit (Push(position, size));
  2613. Emit (Push(position, dest));
  2614. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2615. ELSE
  2616. Emit (Push(position, size));
  2617. Emit (Push(position, dest));
  2618. CallThis(position,"GarbageCollector","ResetArray", 2);
  2619. ASSERT(ArrayBaseType(type).IsPointer());
  2620. END;
  2621. ReleaseIntermediateOperand(size);
  2622. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2623. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2624. Emit (Push(position, dest));
  2625. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2626. ELSE HALT(100); (* missing ? *)
  2627. END;
  2628. END CallResetProcedure;
  2629. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2630. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2631. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2632. VAR operand: Operand;
  2633. BEGIN
  2634. Symbol (symbol, operand);
  2635. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2636. ReleaseOperand(operand);
  2637. END Reset;
  2638. BEGIN
  2639. previousScope := currentScope;
  2640. currentScope := scope;
  2641. pc := section.pc;
  2642. variable := scope.firstVariable;
  2643. WHILE variable # NIL DO
  2644. IF variable.NeedsTrace() THEN
  2645. Reset (variable);
  2646. END;
  2647. variable := variable.nextVariable;
  2648. END;
  2649. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2650. WHILE parameter # NIL DO
  2651. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2652. Reset (parameter);
  2653. END;
  2654. parameter := parameter.nextParameter;
  2655. END;
  2656. INC(statCoopResetVariables, section.pc - pc);
  2657. currentScope := previousScope;
  2658. END ResetVariables;
  2659. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2660. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2661. VAR op: IntermediateCode.Operand; context: Context;
  2662. BEGIN
  2663. previousSection := section;
  2664. GetCodeSectionNameForSymbol(procedure, name);
  2665. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2666. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2667. IF dump # NIL THEN dump := section.comments END;
  2668. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2669. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2670. Emit(Data(position,op));
  2671. Emit(Data(position,nil));
  2672. IF HasPointers (procedure.procedureScope) THEN
  2673. GetCodeSectionNameForSymbol(procedure, name);
  2674. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2675. ELSE
  2676. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2677. END;
  2678. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2679. Emit(Data(position,op));
  2680. ReturnToContext(context);
  2681. IF dump # NIL THEN dump := section.comments END;
  2682. END CreateProcedureDescriptor;
  2683. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2684. VAR import: SyntaxTree.Import;
  2685. s: Basic.MessageString;
  2686. selfName: SyntaxTree.IdentifierString;
  2687. BEGIN
  2688. moduleScope.ownerModule.GetName(selfName);
  2689. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2690. module := moduleScope.ownerModule
  2691. ELSE
  2692. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2693. IF import = NIL THEN
  2694. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2695. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2696. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2697. s := "Module ";
  2698. Strings.Append(s,moduleName);
  2699. Strings.Append(s," cannot be imported.");
  2700. IF force THEN
  2701. Error(position,s);
  2702. ELSIF canBeLoaded THEN
  2703. IF WarningDynamicLoading THEN
  2704. Strings.Append(s, "=> no dynamic linking.");
  2705. Warning(position, s);
  2706. END;
  2707. canBeLoaded := FALSE;
  2708. END;
  2709. RETURN FALSE
  2710. ELSE
  2711. SELF.module.imports.AddName(moduleName)
  2712. END;
  2713. ELSIF import.module = NIL THEN (* already tried *)
  2714. RETURN FALSE
  2715. END;
  2716. module := import.module;
  2717. END;
  2718. RETURN TRUE
  2719. END AddImport;
  2720. (* needed for old binary object file format*)
  2721. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2722. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2723. BEGIN
  2724. IF AddImport(moduleName,module,TRUE) THEN
  2725. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2726. IF procedure = NIL THEN
  2727. s := "Instruction not supported on target, emulation procedure ";
  2728. Strings.Append(s,moduleName);
  2729. Strings.Append(s,".");
  2730. Strings.Append(s,procedureName);
  2731. Strings.Append(s," not present");
  2732. Error(position,s);
  2733. ELSE
  2734. StaticCallOperand(r,procedure);
  2735. ReleaseOperand(r);
  2736. fp := GetFingerprint(procedure);
  2737. END;
  2738. END;
  2739. END EnsureSymbol;
  2740. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2741. VAR exit: Label; trueL,falseL: Label;
  2742. BEGIN
  2743. trueL := NewLabel();
  2744. falseL := NewLabel();
  2745. exit := NewLabel();
  2746. Condition(x,trueL,falseL);
  2747. InitOperand(result,ModeValue);
  2748. SetLabel(trueL);
  2749. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2750. Emit(Mov(position,result.op,true));
  2751. BrL(exit);
  2752. SetLabel(falseL);
  2753. Emit(MovReplace(position,result.op,false));
  2754. SetLabel(exit);
  2755. END ConditionToValue;
  2756. PROCEDURE ValueToCondition(VAR op: Operand);
  2757. BEGIN
  2758. LoadValue(op,system.booleanType);
  2759. BrneL(trueLabel,op.op, false);
  2760. ReleaseOperand(op);
  2761. BrL(falseLabel);
  2762. END ValueToCondition;
  2763. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2764. VAR size: LONGINT;
  2765. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2766. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2767. BEGIN
  2768. ASSERT(type.form = SyntaxTree.Open);
  2769. baseType := type.arrayBase.resolved;
  2770. IF IsOpenArray(baseType) THEN
  2771. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2772. ELSE
  2773. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2774. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2775. END;
  2776. len := tag;
  2777. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2778. IntermediateCode.MakeMemory(len,addressType);
  2779. UseIntermediateOperand(len);
  2780. Reuse2(res,sizeOperand,len);
  2781. Emit(Mul(position,res,sizeOperand,len));
  2782. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2783. RETURN res
  2784. END GetArraySize;
  2785. BEGIN
  2786. type := type.resolved;
  2787. IF IsOpenArray(type) THEN
  2788. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2789. RETURN tag
  2790. ELSE
  2791. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2792. END;
  2793. ELSE
  2794. size := ToMemoryUnits(system,system.SizeOf(type));
  2795. RETURN IntermediateCode.Immediate(addressType,size)
  2796. END;
  2797. END GetDynamicSize;
  2798. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2799. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2800. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2801. BEGIN
  2802. ASSERT(type.form = SyntaxTree.Open);
  2803. baseType := type.arrayBase.resolved;
  2804. IF IsOpenArray(baseType) THEN
  2805. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2806. ELSE
  2807. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2808. END;
  2809. len := tag;
  2810. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2811. IntermediateCode.MakeMemory(len,addressType);
  2812. UseIntermediateOperand(len);
  2813. Reuse2(res,sizeOperand,len);
  2814. Emit(Mul(position,res,sizeOperand,len));
  2815. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2816. RETURN res
  2817. END GetLength;
  2818. BEGIN
  2819. type := type.resolved;
  2820. IF IsOpenArray(type) THEN
  2821. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2822. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2823. ELSIF type IS SyntaxTree.StringType THEN
  2824. RETURN tag;
  2825. ELSE
  2826. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2827. END;
  2828. END GetArrayLength;
  2829. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2830. VAR result: IntermediateCode.Operand;
  2831. BEGIN
  2832. IF backend.cooperative THEN
  2833. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2834. ELSE
  2835. MakeMemory(result, tag, addressType, 0);
  2836. END;
  2837. RETURN result
  2838. END GetSizeFromTag;
  2839. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2840. VAR parameter: SyntaxTree.Parameter;
  2841. BEGIN
  2842. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2843. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2844. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2845. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2846. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2847. END;
  2848. RETURN GetDynamicSize(e.type, tag);
  2849. END GetArrayOfBytesSize;
  2850. (*
  2851. to find imported symbol. not needed ?
  2852. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2853. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2854. BEGIN
  2855. IF AddImport(moduleName,importedModule,FALSE) THEN
  2856. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2857. RETURN symbol
  2858. ELSE
  2859. RETURN NIL
  2860. END
  2861. END SymbolByName;
  2862. *)
  2863. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2864. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2865. BEGIN
  2866. IF AddImport(moduleName,runtimeModule,force) THEN
  2867. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2868. IF procedure = NIL THEN
  2869. s := "Procedure ";
  2870. Strings.Append(s,moduleName);
  2871. Strings.Append(s,".");
  2872. Strings.Append(s,procedureName);
  2873. Strings.Append(s," not present");
  2874. Error(position,s);
  2875. RETURN FALSE
  2876. ELSE
  2877. RETURN TRUE
  2878. END;
  2879. ELSE RETURN FALSE
  2880. END;
  2881. END GetRuntimeProcedure;
  2882. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2883. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2884. s: Basic.MessageString;
  2885. BEGIN
  2886. Basic.InitSegmentedName(name);
  2887. name[0] := Basic.MakeString(moduleName);
  2888. name[1] := Basic.MakeString(typeName);
  2889. name[2] := -1;
  2890. IF AddImport(moduleName,importedModule, FALSE) THEN
  2891. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2892. IF symbol = NIL THEN
  2893. s := "type ";
  2894. Strings.Append(s,moduleName);
  2895. Strings.Append(s,".");
  2896. Strings.Append(s,typeName);
  2897. Strings.Append(s," not present");
  2898. Error(position,s);
  2899. END;
  2900. ELSE symbol := NIL;
  2901. END;
  2902. IF importedModule = moduleScope.ownerModule THEN
  2903. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2904. ELSE
  2905. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2906. END;
  2907. RETURN symbol
  2908. END GetTypeDescriptor;
  2909. (* 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. *)
  2910. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2911. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2912. pooledName: Basic.SegmentedName; size: LONGINT;
  2913. BEGIN
  2914. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2915. StaticCallOperand(result,procedure);
  2916. IF numberParameters < 0 THEN
  2917. size := ProcedureParametersSize(system,procedure);
  2918. ELSE
  2919. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2920. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2921. Error(position,"runtime call parameter count mismatch");
  2922. END;
  2923. END;
  2924. Emit(Call(position, result.op, size));
  2925. ReleaseOperand(result);
  2926. ELSE (* only static linking possible *)
  2927. ASSERT(numberParameters >= 0);
  2928. Basic.InitSegmentedName(pooledName);
  2929. pooledName[0] := Basic.MakeString(moduleName);
  2930. pooledName[1] := Basic.MakeString(procedureName);
  2931. pooledName[2] := -1;
  2932. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2933. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2934. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2935. END;
  2936. END CallThisChecked;
  2937. (* 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. *)
  2938. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2939. BEGIN
  2940. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2941. END CallThis;
  2942. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2943. VAR
  2944. left,right: Operand;
  2945. leftSize, rightSize: IntermediateCode.Operand;
  2946. saved: RegisterEntry;
  2947. reg: IntermediateCode.Operand;
  2948. procedureName: SyntaxTree.IdentifierString;
  2949. BEGIN
  2950. procedureName := "CompareString";
  2951. SaveRegisters();ReleaseUsedRegisters(saved);
  2952. Designate(leftExpression,left);
  2953. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2954. Emit(Push(position,leftSize));
  2955. ReleaseIntermediateOperand(leftSize);
  2956. Emit(Push(position,left.op));
  2957. ReleaseOperand(left);
  2958. Designate(rightExpression,right);
  2959. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2960. Emit(Push(position,rightSize));
  2961. ReleaseIntermediateOperand(rightSize);
  2962. Emit(Push(position,right.op));
  2963. ReleaseOperand(right);
  2964. IF backend.cooperative THEN
  2965. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2966. ELSE
  2967. CallThis(position,runtimeModuleName,procedureName, 4);
  2968. END;
  2969. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2970. Emit(Result(position,reg));
  2971. (*
  2972. AcquireThisRegister(int8,IntermediateCode.Result);
  2973. *)
  2974. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2975. (*
  2976. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2977. *)
  2978. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2979. ReleaseIntermediateOperand(reg);
  2980. BrL(falseLabel);
  2981. END CompareString;
  2982. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2983. VAR
  2984. left,right: Operand;
  2985. leftSize, rightSize: IntermediateCode.Operand;
  2986. saved: RegisterEntry;
  2987. procedureName: SyntaxTree.IdentifierString;
  2988. BEGIN
  2989. procedureName := "CopyString";
  2990. SaveRegisters();ReleaseUsedRegisters(saved);
  2991. Designate(leftExpression,left);
  2992. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2993. Emit(Push(position,leftSize));
  2994. ReleaseIntermediateOperand(leftSize);
  2995. Emit(Push(position,left.op));
  2996. ReleaseOperand(left);
  2997. Designate(rightExpression,right);
  2998. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2999. Emit(Push(position,rightSize));
  3000. ReleaseIntermediateOperand(rightSize);
  3001. Emit(Push(position,right.op));
  3002. ReleaseOperand(right);
  3003. IF backend.cooperative THEN
  3004. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  3005. ELSE
  3006. CallThis(position,runtimeModuleName,procedureName,4);
  3007. END;
  3008. RestoreRegisters(saved);
  3009. END CopyString;
  3010. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  3011. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3012. leftType,rightType: SyntaxTree.Type;
  3013. leftExpression,rightExpression : SyntaxTree.Expression;
  3014. componentType: IntermediateCode.Type;
  3015. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3016. size: LONGINT;
  3017. BEGIN
  3018. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3019. dest := destination; destination := emptyOperand;
  3020. leftType := x.left.type.resolved;
  3021. rightType := x.right.type.resolved;
  3022. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3023. CASE x.operator OF
  3024. Scanner.Or:
  3025. (* shortcut evaluation of left OR right *)
  3026. IF ~conditional THEN ConditionToValue(x);
  3027. ELSE
  3028. next := NewLabel();
  3029. Condition(x.left,trueLabel,next);
  3030. SetLabel(next);
  3031. Condition(x.right,trueLabel,falseLabel);
  3032. END;
  3033. |Scanner.And:
  3034. (* shortcut evaluation of left & right *)
  3035. IF ~conditional THEN ConditionToValue(x);
  3036. ELSE
  3037. next := NewLabel();
  3038. Condition(x.left,next,falseLabel);
  3039. SetLabel(next);
  3040. Condition(x.right,trueLabel,falseLabel);
  3041. END;
  3042. |Scanner.Is:
  3043. IF ~conditional THEN ConditionToValue(x);
  3044. ELSE
  3045. (* get type desc tag *)
  3046. IF IsPointerToRecord(leftType,recordType) THEN
  3047. Evaluate(x.left,left);
  3048. Dereference(left,recordType,IsUnsafePointer(leftType))
  3049. ELSE
  3050. Designate(x.left,left);
  3051. END;
  3052. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3053. ReleaseOperand(left);
  3054. END;
  3055. |Scanner.Plus:
  3056. Evaluate(x.left,left);
  3057. Evaluate(x.right,right);
  3058. IF leftType IS SyntaxTree.SetType THEN
  3059. InitOperand(result,ModeValue);
  3060. Reuse2a(result.op,left.op,right.op,dest);
  3061. Emit(Or(position,result.op,left.op,right.op));
  3062. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3063. InitOperand(result,ModeValue);
  3064. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3065. Reuse2(result.tag,left.tag,right.tag);
  3066. Emit(Add(position,result.op,left.op,right.op));
  3067. Emit(Add(position,result.tag,left.tag,right.tag))
  3068. ELSE
  3069. InitOperand(result,ModeValue);
  3070. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3071. AddInt(result.op, left.op, right.op) ;
  3072. ELSE
  3073. *)
  3074. Reuse2a(result.op,left.op,right.op,dest);
  3075. Emit(Add(position,result.op,left.op,right.op));
  3076. (*
  3077. END;
  3078. *)
  3079. END;
  3080. ReleaseOperand(left); ReleaseOperand(right);
  3081. |Scanner.Minus:
  3082. Evaluate(x.left,left);
  3083. Evaluate(x.right,right);
  3084. IF leftType IS SyntaxTree.SetType THEN
  3085. InitOperand(result,ModeValue);
  3086. Reuse1(result.op,right.op);
  3087. Emit(Not(position,result.op,right.op));
  3088. ReleaseOperand(right);
  3089. Emit(And(position,result.op,result.op,left.op));
  3090. ReleaseOperand(left);
  3091. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3092. InitOperand(result,ModeValue);
  3093. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3094. Reuse2(result.tag,left.tag,right.tag);
  3095. Emit(Sub(position,result.op,left.op,right.op));
  3096. Emit(Sub(position,result.tag,left.tag,right.tag));
  3097. ReleaseOperand(left); ReleaseOperand(right)
  3098. ELSE
  3099. InitOperand(result,ModeValue);
  3100. Reuse2a(result.op,left.op,right.op,dest);
  3101. Emit(Sub(position,result.op,left.op,right.op));
  3102. ReleaseOperand(left); ReleaseOperand(right);
  3103. END;
  3104. |Scanner.Times:
  3105. Evaluate(x.left,left);
  3106. Evaluate(x.right,right);
  3107. IF leftType IS SyntaxTree.SetType THEN
  3108. InitOperand(result,ModeValue);
  3109. Reuse2a(result.op,left.op,right.op,dest);
  3110. Emit(And(position,result.op,left.op,right.op));
  3111. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3112. InitOperand(result, ModeValue);
  3113. componentType := left.op.type;
  3114. (* TODO: review this *)
  3115. (*
  3116. result.op = left.op * right.op - left.tag * right.tag
  3117. result.tag = left.tag * right.op + left.op * right.tag
  3118. *)
  3119. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3120. Emit(Mul(position,result.op, left.op, right.op));
  3121. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3122. Emit(Mul(position,tempReg, left.tag, right.tag));
  3123. Emit(Sub(position,result.op, result.op, tempReg));
  3124. Reuse2(result.tag, left.tag, right.op);
  3125. Emit(Mul(position,result.tag, left.tag, right.op));
  3126. Emit(Mul(position,tempReg, left.op, right.tag));
  3127. Emit(Add(position,result.tag, result.tag, tempReg));
  3128. ReleaseIntermediateOperand(tempReg)
  3129. ELSE
  3130. InitOperand(result,ModeValue);
  3131. Reuse2a(result.op,left.op,right.op,dest);
  3132. Emit(Mul(position,result.op,left.op,right.op));
  3133. END;
  3134. ReleaseOperand(left); ReleaseOperand(right);
  3135. |Scanner.Div:
  3136. Evaluate(x.left,left);
  3137. Evaluate(x.right,right);
  3138. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3139. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3140. IF ~isUnchecked THEN
  3141. exit := NewLabel();
  3142. BrltL(exit,zero,right.op);
  3143. EmitTrap(position,NegativeDivisorTrap);
  3144. SetLabel(exit);
  3145. END;
  3146. END;
  3147. InitOperand(result,ModeValue);
  3148. Reuse2a(result.op,left.op,right.op,dest);
  3149. Emit(Div(position,result.op,left.op,right.op));
  3150. ReleaseOperand(left); ReleaseOperand(right);
  3151. |Scanner.Mod:
  3152. Evaluate(x.left,left);
  3153. Evaluate(x.right,right);
  3154. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3155. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3156. IF ~isUnchecked THEN
  3157. exit := NewLabel();
  3158. BrltL(exit,zero,right.op);
  3159. EmitTrap(position,NegativeDivisorTrap);
  3160. SetLabel(exit);
  3161. END;
  3162. END;
  3163. InitOperand(result,ModeValue);
  3164. Reuse2a(result.op,left.op,right.op,dest);
  3165. Emit(Mod(position,result.op,left.op,right.op));
  3166. ReleaseOperand(left); ReleaseOperand(right);
  3167. |Scanner.Slash:
  3168. Evaluate(x.left,left);
  3169. Evaluate(x.right,right);
  3170. IF leftType IS SyntaxTree.SetType THEN
  3171. InitOperand(result,ModeValue);
  3172. Reuse2a(result.op,left.op,right.op,dest);
  3173. Emit(Xor(position,result.op,left.op,right.op));
  3174. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3175. InitOperand(result,ModeValue);
  3176. componentType := left.op.type;
  3177. (* review this *)
  3178. (*
  3179. divisor = right.op * right.op + right.tag * right.tag
  3180. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3181. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3182. *)
  3183. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3184. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3185. Emit(Mul(position,tempReg, right.op, right.op));
  3186. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3187. Emit(Add(position,tempReg, tempReg, tempReg2));
  3188. result.op := tempReg2;
  3189. Emit(Mul(position,result.op, left.op, right.op));
  3190. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3191. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3192. Emit(Add(position,result.op, result.op, tempReg2));
  3193. Emit(Div(position,result.op, result.op, tempReg));
  3194. Reuse2(result.tag, left.tag, right.op);
  3195. Emit(Mul(position,result.tag, left.tag, right.op));
  3196. Emit(Mul(position,tempReg2, left.op, right.tag));
  3197. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3198. Emit(Div(position,result.tag, result.tag, tempReg));
  3199. ReleaseIntermediateOperand(tempReg);
  3200. ReleaseIntermediateOperand(tempReg2)
  3201. ELSE
  3202. InitOperand(result,ModeValue);
  3203. Reuse2a(result.op,left.op,right.op,dest);
  3204. Emit(Div(position,result.op,left.op,right.op));
  3205. END;
  3206. ReleaseOperand(left); ReleaseOperand(right);
  3207. |Scanner.Equal:
  3208. IF ~conditional THEN ConditionToValue(x);
  3209. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3210. CompareString(BreqL,x.left,x.right);
  3211. ELSE
  3212. Evaluate(x.left,left);
  3213. Evaluate(x.right,right);
  3214. IF leftType IS SyntaxTree.RangeType THEN
  3215. ASSERT(rightType IS SyntaxTree.RangeType);
  3216. BrneL(falseLabel, left.op, right.op); (* first *)
  3217. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3218. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3219. ReleaseOperand(left); ReleaseOperand(right);
  3220. BrL(trueLabel)
  3221. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3222. BrneL(falseLabel, left.op, right.op); (* first *)
  3223. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3224. ReleaseOperand(left); ReleaseOperand(right);
  3225. BrL(trueLabel)
  3226. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3227. (* TODO: review this *)
  3228. BrneL(falseLabel, left.op, right.op); (* real part *)
  3229. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3230. ReleaseOperand(left); ReleaseOperand(right);
  3231. BrL(trueLabel)
  3232. ELSE
  3233. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3234. ReleaseOperand(left); ReleaseOperand(right);
  3235. BrL(trueLabel);
  3236. END;
  3237. END;
  3238. |Scanner.LessEqual:
  3239. IF ~conditional THEN ConditionToValue(x);
  3240. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3241. CompareString(BrgeL,x.right,x.left);
  3242. ELSE
  3243. Evaluate(x.left,left);
  3244. Evaluate(x.right,right);
  3245. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3246. Reuse1(temp.op,right.op);
  3247. Emit(And(position,temp.op,left.op,right.op));
  3248. ReleaseOperand(right);
  3249. BreqL(trueLabel,temp.op,left.op);
  3250. BrL(falseLabel);
  3251. ReleaseOperand(temp);ReleaseOperand(left);
  3252. ELSE
  3253. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3254. ReleaseOperand(left); ReleaseOperand(right);
  3255. BrL(trueLabel);
  3256. END;
  3257. END;
  3258. |Scanner.Less:
  3259. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3260. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3261. leftExpression.SetType(system.booleanType);
  3262. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3263. rightExpression.SetType(system.booleanType);
  3264. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3265. leftExpression.SetType(system.booleanType);
  3266. Expression(leftExpression);
  3267. ELSIF ~conditional THEN ConditionToValue(x);
  3268. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3269. CompareString(BrltL,x.left,x.right);
  3270. ELSE
  3271. Evaluate(x.left,left);
  3272. Evaluate(x.right,right);
  3273. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3274. ReleaseOperand(left); ReleaseOperand(right);
  3275. BrL(trueLabel);
  3276. END;
  3277. |Scanner.Greater:
  3278. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3279. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3280. leftExpression.SetType(system.booleanType);
  3281. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3282. rightExpression.SetType(system.booleanType);
  3283. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3284. leftExpression.SetType(system.booleanType);
  3285. Expression(leftExpression);
  3286. ELSIF ~conditional THEN ConditionToValue(x);
  3287. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3288. CompareString(BrltL,x.right,x.left);
  3289. ELSE
  3290. Evaluate(x.left,left);
  3291. Evaluate(x.right,right);
  3292. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3293. ReleaseOperand(left); ReleaseOperand(right);
  3294. BrL(trueLabel);
  3295. END;
  3296. |Scanner.GreaterEqual:
  3297. IF ~conditional THEN ConditionToValue(x);
  3298. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3299. CompareString(BrgeL,x.left,x.right);
  3300. ELSE
  3301. Evaluate(x.left,left);
  3302. Evaluate(x.right,right);
  3303. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3304. Reuse1(temp.op,left.op);
  3305. Emit(And(position,temp.op,left.op,right.op));
  3306. ReleaseOperand(left);
  3307. BreqL(trueLabel, temp.op,right.op);
  3308. ReleaseOperand(temp); ReleaseOperand(right);
  3309. BrL(falseLabel);
  3310. ELSE
  3311. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3312. ReleaseOperand(left); ReleaseOperand(right);
  3313. BrL(trueLabel);
  3314. END;
  3315. END;
  3316. |Scanner.Unequal:
  3317. IF ~conditional THEN ConditionToValue(x);
  3318. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3319. CompareString(BrneL,x.left,x.right);
  3320. ELSE
  3321. Evaluate(x.left,left);
  3322. Evaluate(x.right,right);
  3323. IF leftType IS SyntaxTree.RangeType THEN
  3324. ASSERT(rightType IS SyntaxTree.RangeType);
  3325. BrneL(trueLabel, left.op, right.op); (* first *)
  3326. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3327. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3328. ReleaseOperand(left); ReleaseOperand(right);
  3329. BrL(falseLabel)
  3330. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3331. BrneL(trueLabel, left.op, right.op); (* first *)
  3332. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3333. ReleaseOperand(left); ReleaseOperand(right);
  3334. BrL(falseLabel)
  3335. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3336. (* TODO: review this *)
  3337. BrneL(trueLabel, left.op, right.op); (* real part *)
  3338. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3339. ReleaseOperand(left); ReleaseOperand(right);
  3340. BrL(falseLabel)
  3341. ELSE
  3342. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3343. ReleaseOperand(left); ReleaseOperand(right);
  3344. BrL(trueLabel);
  3345. END;
  3346. END;
  3347. |Scanner.In:
  3348. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3349. Evaluate(x.left,left);
  3350. Evaluate(x.right,right);
  3351. Convert(left.op,setType);
  3352. ReuseCopy(temp.op,right.op);
  3353. Emit(Shr(position,temp.op,temp.op,left.op));
  3354. ReleaseOperand(right); ReleaseOperand(left);
  3355. IntermediateCode.InitImmediate(one,setType,1);
  3356. Emit(And(position,temp.op,temp.op,one));
  3357. IF conditional THEN
  3358. IntermediateCode.InitImmediate(zero,setType,0);
  3359. BrneL(trueLabel,temp.op,zero);
  3360. ReleaseOperand(temp);
  3361. BrL(falseLabel);
  3362. ELSE
  3363. Convert(temp.op,bool);
  3364. result.mode := ModeValue;
  3365. result.op := temp.op;
  3366. result.tag := nil; (* may be left over from calls to evaluate *)
  3367. END;
  3368. ELSE
  3369. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3370. IF x.operator = Scanner.Questionmarks THEN
  3371. leftExpression := x.left;
  3372. rightExpression := x.right;
  3373. ELSE
  3374. leftExpression := x.right;
  3375. rightExpression := x.left;
  3376. END;
  3377. Evaluate(leftExpression, left);
  3378. Emit(Push(position,left.op));
  3379. ReleaseOperand(left);
  3380. Designate(rightExpression, right);
  3381. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3382. IF ~backend.cellsAreObjects THEN
  3383. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3384. END;
  3385. Emit(Push(position,right.op));
  3386. ReleaseOperand(right);
  3387. IF backend.cellsAreObjects THEN
  3388. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3389. ELSE
  3390. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3391. END;
  3392. InitOperand(result, ModeValue);
  3393. result.op := NewRegisterOperand(bool);
  3394. Emit(Result(position,result.op));
  3395. IF conditional THEN
  3396. IntermediateCode.InitImmediate(zero,setType,0);
  3397. BrneL(trueLabel,result.op,zero);
  3398. ReleaseOperand(result);
  3399. BrL(falseLabel);
  3400. END;
  3401. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3402. leftExpression := x.left;
  3403. rightExpression := x.right;
  3404. Evaluate(leftExpression, left);
  3405. Emit(Push(position,left.op));
  3406. ReleaseOperand(left);
  3407. Evaluate(rightExpression, right);
  3408. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3409. IF ~backend.cellsAreObjects THEN
  3410. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3411. END;
  3412. Emit(Push(position,right.op));
  3413. ReleaseOperand(right);
  3414. IF backend.cellsAreObjects THEN
  3415. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3416. ELSE
  3417. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3418. END;
  3419. InitOperand(result, ModeValue);
  3420. result.op := NewRegisterOperand(bool);
  3421. Emit(Result(position,result.op));
  3422. IF conditional THEN
  3423. IntermediateCode.InitImmediate(zero,setType,0);
  3424. BrneL(trueLabel,result.op,zero);
  3425. ReleaseOperand(result);
  3426. BrL(falseLabel);
  3427. END;
  3428. ELSE
  3429. HALT(100);
  3430. END;
  3431. END;
  3432. destination := dest;
  3433. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3434. END VisitBinaryExpression;
  3435. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3436. VAR localResult, operand: Operand;
  3437. BEGIN
  3438. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3439. InitOperand(localResult, ModeValue);
  3440. ASSERT(x.first # NIL);
  3441. Evaluate(x.first, operand);
  3442. localResult.op := operand.op;
  3443. ReleaseOperand(operand);
  3444. UseIntermediateOperand(localResult.op);
  3445. ASSERT(x.last # NIL);
  3446. Evaluate(x.last, operand);
  3447. localResult.tag := operand.op;
  3448. ReleaseOperand(operand);
  3449. UseIntermediateOperand(localResult.tag);
  3450. IF x.step # NIL THEN
  3451. Evaluate(x.step, operand);
  3452. localResult.extra := operand.op;
  3453. ReleaseOperand(operand);
  3454. UseIntermediateOperand(localResult.extra);
  3455. END;
  3456. result := localResult;
  3457. IF Trace THEN TraceExit("VisitRangeExpression") END
  3458. END VisitRangeExpression;
  3459. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3460. BEGIN
  3461. HALT(100); (* should never be evaluated *)
  3462. END VisitTensorRangeExpression;
  3463. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3464. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3465. BEGIN
  3466. IF Trace THEN TraceEnter("VisitConversion") END;
  3467. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3468. dest := destination; destination := emptyOperand;
  3469. Evaluate(x.expression,old);
  3470. InitOperand(result,ModeValue);
  3471. result.op := old.op;
  3472. ASSERT(result.op.mode # 0);
  3473. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3474. (* convert TO a complex number *)
  3475. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3476. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3477. ASSERT(result.op.mode # 0);
  3478. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3479. (* convert FROM a complex number TO a complex number*)
  3480. result.tag := old.tag;
  3481. ASSERT(result.tag.mode # 0);
  3482. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3483. ASSERT(result.tag.mode # 0)
  3484. ELSE
  3485. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3486. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3487. END
  3488. ELSE
  3489. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3490. ASSERT(result.op.mode # 0);
  3491. result.tag := old.tag; (*! probably never used *)
  3492. END;
  3493. destination := dest;
  3494. IF Trace THEN TraceExit("VisitConversion") END;
  3495. END VisitConversion;
  3496. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3497. BEGIN
  3498. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3499. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3500. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3501. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3502. END VisitTypeDeclaration;
  3503. (** designators (expressions) *)
  3504. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3505. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3506. BEGIN
  3507. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3508. IF x.left # NIL THEN Expression(x.left) END;
  3509. Symbol(x.symbol,result);
  3510. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3511. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3512. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3513. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3514. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3515. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3516. END;
  3517. END;
  3518. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3519. END VisitSymbolDesignator;
  3520. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3521. BEGIN
  3522. IF isUnchecked THEN RETURN END;
  3523. IF tagsAvailable THEN
  3524. TrapC(BrltL,index,length,IndexCheckTrap);
  3525. END;
  3526. END BoundCheck;
  3527. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3528. VAR d: IntermediateCode.Operand;
  3529. BEGIN
  3530. IF isUnchecked THEN RETURN END;
  3531. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3532. TrapC(op,dim,d,ArraySizeTrap);
  3533. ReleaseIntermediateOperand(d);
  3534. END DimensionCheck;
  3535. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3536. VAR
  3537. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3538. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3539. expression: SyntaxTree.Expression;
  3540. resultingType, leftType, baseType: SyntaxTree.Type;
  3541. skipLabel1: Label;
  3542. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3543. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3544. variableOp: Operand;
  3545. variable: SyntaxTree.Variable;
  3546. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3547. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3548. VAR e: SyntaxTree.Expression; i: LONGINT;
  3549. BEGIN
  3550. tensorFound := FALSE;
  3551. FOR i := 0 TO parameters.Length()-1 DO
  3552. e := parameters.GetExpression(i);
  3553. IF e IS SyntaxTree.TensorRangeExpression THEN
  3554. ASSERT(~tensorFound);
  3555. tensorFound := TRUE;
  3556. ELSIF e IS SyntaxTree.RangeExpression THEN
  3557. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3558. ELSE
  3559. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3560. END;
  3561. END;
  3562. END CountIndices;
  3563. BEGIN
  3564. ASSERT(tagsAvailable);
  3565. resultingType := x.type.resolved; (* resulting type *)
  3566. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3567. InitOperand(localResult, ModeReference);
  3568. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3569. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3570. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3571. (* a globally defined array destination tag is available -> use and invalidate it*)
  3572. localResult.tag := arrayDestinationTag;
  3573. IntermediateCode.InitOperand(arrayDestinationTag)
  3574. ELSE
  3575. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3576. (* the result is of array range type and thus does not provide any collectable pointers *)
  3577. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3578. Symbol(variable, variableOp);
  3579. ReuseCopy(localResult.tag, variableOp.op);
  3580. ReleaseOperand(variableOp);
  3581. END
  3582. END;
  3583. indexListSize := x.parameters.Length();
  3584. CountIndices(x.parameters);
  3585. (*ASSERT(tensorRangeCount <= 1);*)
  3586. (* designate the array to be indexed over, perform tensor range check if known *)
  3587. Designate(x.left, array);
  3588. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3589. Dereference(array, leftType,FALSE);
  3590. IF ~tensorFound THEN
  3591. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3592. END
  3593. END;
  3594. (* default base offset *)
  3595. srcDimOffset := 0;
  3596. destDimOffset := 0;
  3597. indexDim := 0;
  3598. (* use address of source array as basis *)
  3599. localResult.op := array.op;
  3600. UseIntermediateOperand(localResult.op);
  3601. (* go through the index list *)
  3602. FOR i := 0 TO indexListSize - 1 DO
  3603. expression := x.parameters.GetExpression(i);
  3604. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3605. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3606. srcDimOffset := -indexListSize;
  3607. destDimOffset := -suffixRanges;
  3608. ELSE
  3609. (* determine which dimension of source array is currently looked at *)
  3610. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3611. (* get the memory operand pointing to array descriptor dimension *)
  3612. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3613. (* make a reusable register from it *)
  3614. ReuseCopy(srcDim, tmp);
  3615. ReleaseIntermediateOperand(tmp);
  3616. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3617. ELSE
  3618. srcDim := IntermediateCode.Immediate(sizeType, i);
  3619. END;
  3620. (* get length and increment of source array for current dimension *)
  3621. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3622. Convert(sourceLength.op, sizeType);
  3623. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3624. Convert(sourceIncrement.op, sizeType);
  3625. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3626. ReleaseIntermediateOperand(srcDim);
  3627. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3628. (* SINGLE INDEX *)
  3629. Evaluate(expression, index);
  3630. ReleaseIntermediateOperand(index.tag);
  3631. index.tag := emptyOperand;
  3632. Convert(index.op, sizeType);
  3633. (* lower bound check *)
  3634. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3635. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3636. ELSIF isUnchecked THEN (* do nothing *)
  3637. ELSE
  3638. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3639. END;
  3640. (* upper bound check *)
  3641. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3642. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3643. ELSIF isUnchecked THEN (* do nothing *)
  3644. ELSE
  3645. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3646. END;
  3647. ReleaseOperand(sourceLength);
  3648. Convert(index.op, addressType);
  3649. summand := index.op;
  3650. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3651. (* RANGE OF INDICES *)
  3652. Evaluate(expression, range);
  3653. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3654. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3655. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3656. ReleaseOperand(range);
  3657. Convert(firstIndex, sizeType);
  3658. Convert(lastIndex, sizeType);
  3659. Convert(stepSize, sizeType);
  3660. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3661. if it is 'MAX(LONGINT)' *)
  3662. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3663. TransferToRegister(lastIndex, lastIndex);
  3664. skipLabel1 := NewLabel();
  3665. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3666. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3667. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3668. SetLabel(skipLabel1)
  3669. END;
  3670. (* check if step size is valid *)
  3671. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3672. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3673. ELSIF isUnchecked THEN (* do nothing *)
  3674. ELSE
  3675. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3676. END;
  3677. (* check lower bound check *)
  3678. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3679. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3680. ELSIF isUnchecked THEN (* do nothing *)
  3681. ELSE
  3682. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3683. END;
  3684. (* check upper bound check *)
  3685. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3686. (* statically open range: nothing to do *)
  3687. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3688. ASSERT(staticLastIndex < staticSourceLength)
  3689. ELSIF isUnchecked THEN (* do nothing *)
  3690. ELSE
  3691. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3692. END;
  3693. (* determine length of target array for current dimension *)
  3694. (* 1. incorporate last index: *)
  3695. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3696. (* last index is static *)
  3697. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3698. targetLength := sourceLength.op
  3699. ELSE
  3700. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3701. END;
  3702. UseIntermediateOperand(targetLength);
  3703. ELSE
  3704. (* targetLength := lastIndex + 1
  3705. Reuse1(targetLength, lastIndex);
  3706. *)
  3707. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3708. END;
  3709. ReleaseOperand(sourceLength);
  3710. ReleaseIntermediateOperand(lastIndex);
  3711. (* 2. incorporate first index: *)
  3712. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3713. (* first index and current target length are static *)
  3714. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3715. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3716. (* first index = 0: nothing to do *)
  3717. ELSE
  3718. (* targetLength := targetLength - firstIndex *)
  3719. TransferToRegister(targetLength, targetLength);
  3720. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3721. END;
  3722. (* clip negative lengths to 0 *)
  3723. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3724. IF staticTargetLength < 0 THEN
  3725. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3726. END
  3727. ELSE
  3728. skipLabel1 := NewLabel();
  3729. TransferToRegister(targetLength, targetLength);
  3730. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3731. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3732. SetLabel(skipLabel1)
  3733. END;
  3734. (* 3. incorporate index step size: *)
  3735. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3736. (*step size and current target length are static *)
  3737. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3738. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3739. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3740. (* step size = 1: nothing to do *)
  3741. ELSE
  3742. (* emit code for this:
  3743. targetLength := (targetLength-1) DIV stepSize +1;
  3744. *)
  3745. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3746. DivInt(targetLength, targetLength, stepSize);
  3747. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3748. END;
  3749. (* determine increment of target array for current dimension *)
  3750. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3751. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3752. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3753. (* step size = 1 *)
  3754. targetIncrement := sourceIncrement.op;
  3755. UseIntermediateOperand(targetIncrement)
  3756. ELSE
  3757. (* targetIncrement := sourceIncrement * stepSize *)
  3758. Reuse1(targetIncrement, stepSize);
  3759. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3760. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3761. END;
  3762. ReleaseIntermediateOperand(stepSize);
  3763. (* write length and increment of target array to descriptor *)
  3764. IF destDimOffset < 0 THEN
  3765. (* determine which dimension of target array is currently looked at *)
  3766. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3767. TransferToRegister(destDim, tmp);
  3768. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3769. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3770. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3771. ReleaseIntermediateOperand(destDim);
  3772. INC(destDimOffset);
  3773. ELSE
  3774. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3775. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3776. END;
  3777. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3778. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3779. INC(indexDim);
  3780. Convert(firstIndex, addressType);
  3781. TransferToRegister(summand, firstIndex);
  3782. ELSE HALT(100);
  3783. END;
  3784. (*
  3785. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3786. *)
  3787. Convert(sourceIncrement.op, addressType);
  3788. Convert(summand, addressType);
  3789. MulInt(summand, summand, sourceIncrement.op);
  3790. ReleaseIntermediateOperand(sourceIncrement.op);
  3791. AddInt(localResult.op, localResult.op, summand);
  3792. ReleaseIntermediateOperand(summand);
  3793. END
  3794. END;
  3795. result := localResult;
  3796. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3797. ReleaseIntermediateOperand(result.tag);
  3798. result.tag := TypeDescriptorAdr(resultingType);
  3799. IF ~newObjectFile THEN
  3800. IntermediateCode.MakeMemory(result.tag,addressType);
  3801. END;
  3802. ELSIF IsDelegate(resultingType) THEN
  3803. ReleaseIntermediateOperand(result.tag);
  3804. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3805. UseIntermediateOperand(result.tag);
  3806. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3807. ReleaseIntermediateOperand(result.tag);
  3808. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3809. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3810. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3811. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3812. (* finalize target array descriptor *)
  3813. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3814. (* write lengths and increments of target array for remaining dimensions *)
  3815. i := indexListSize;
  3816. WHILE indexDim < targetArrayDimensionality DO
  3817. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3818. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3819. ReleaseOperand(sourceLength);
  3820. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3821. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3822. ReleaseOperand(sourceIncrement);
  3823. INC(i); INC(indexDim);
  3824. END;
  3825. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3826. tmp := nil;
  3827. ELSE
  3828. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3829. END;
  3830. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3831. ReleaseIntermediateOperand(tmp);
  3832. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3833. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3834. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3835. ELSE
  3836. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3837. END;
  3838. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3839. ReleaseIntermediateOperand(tmp);
  3840. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3841. (* write dimensionality *)
  3842. IF targetArrayDimensionality # 0 THEN
  3843. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3844. END;
  3845. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3846. END;
  3847. ReleaseOperand(array);
  3848. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3849. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3850. END;
  3851. END MathIndexDesignator;
  3852. (* get the length of an array , trying to make use of static information *)
  3853. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3854. VAR res: IntermediateCode.Operand; size: LONGINT;
  3855. BEGIN
  3856. type := type.resolved;
  3857. IF type IS SyntaxTree.ArrayType THEN
  3858. WITH type: SyntaxTree.ArrayType DO
  3859. IF type.form = SyntaxTree.Static THEN
  3860. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3861. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3862. Evaluate(type.length, op);
  3863. ReleaseIntermediateOperand(op.tag);
  3864. RETURN op.op;*)
  3865. ELSE
  3866. res := tag;
  3867. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3868. IntermediateCode.MakeMemory(res,addressType);
  3869. UseIntermediateOperand(res);
  3870. RETURN res
  3871. END
  3872. END;
  3873. ELSE
  3874. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3875. RETURN IntermediateCode.Immediate(addressType,size);
  3876. END;
  3877. END ArrayLength;
  3878. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  3879. BEGIN
  3880. IF IsImmediate(x) THEN
  3881. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  3882. ELSE
  3883. IF ~ReusableRegister(res) THEN
  3884. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3885. ELSE
  3886. UseIntermediateOperand(res);
  3887. END;
  3888. Emit(Mov(position,res,x))
  3889. END;
  3890. END CopyInt;
  3891. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3892. BEGIN
  3893. ReleaseIntermediateOperand(res);
  3894. IF IsImmediate(x) & IsImmediate(y) THEN
  3895. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3896. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3897. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3898. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3899. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3900. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3901. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3902. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3903. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3904. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3905. UseIntermediateOperand(res);
  3906. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3907. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3908. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3909. UseIntermediateOperand(res);
  3910. ELSE
  3911. IF ~ReusableRegister(res) THEN
  3912. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3913. ELSE
  3914. UseIntermediateOperand(res);
  3915. END;
  3916. IF IsImmediate(x) & (x.intValue = 0) THEN
  3917. Emit(Mov(position,res,y))
  3918. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3919. Emit(Mov(position,res,x))
  3920. ELSE
  3921. Emit(Add(position,res, x, y));
  3922. END;
  3923. END;
  3924. END AddInt;
  3925. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3926. BEGIN
  3927. ReleaseIntermediateOperand(res);
  3928. IF IsImmediate(x) & IsImmediate(y) THEN
  3929. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3930. ELSE
  3931. IF ~ReusableRegister(res) THEN
  3932. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3933. ELSE UseIntermediateOperand(res);
  3934. END;
  3935. IF IsImmediate(x) & (x.intValue = 1) THEN
  3936. Emit(Mov(position,res,y))
  3937. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3938. Emit(Mov(position,res,x))
  3939. ELSE
  3940. Emit(Mul(position,res, x, y));
  3941. END;
  3942. END;
  3943. END MulInt;
  3944. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3945. BEGIN
  3946. ReleaseIntermediateOperand(res);
  3947. IF IsImmediate(x) & IsImmediate(y) THEN
  3948. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3949. ELSE
  3950. IF ~ReusableRegister(res) THEN
  3951. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3952. ELSE UseIntermediateOperand(res);
  3953. END;
  3954. IF IsImmediate(x) & (x.intValue = 1) THEN
  3955. Emit(Mov(position,res,y))
  3956. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3957. Emit(Mov(position,res,x))
  3958. ELSE
  3959. Emit(Div(position,res, x, y));
  3960. END;
  3961. END;
  3962. END DivInt;
  3963. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3964. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3965. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3966. BEGIN
  3967. type := x.left.type.resolved;
  3968. IF type IS SyntaxTree.StringType THEN
  3969. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  3970. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3971. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  3972. type := atype;
  3973. x.left.SetType(type);
  3974. END;
  3975. IntermediateCode.InitImmediate(res,addressType,0);
  3976. maxDim := x.parameters.Length()-1;
  3977. (*
  3978. computation rule:
  3979. a: ARRAY X,Y,Z OF Element with size S
  3980. a[i,j,k] -->
  3981. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  3982. *)
  3983. FOR i := 0 TO maxDim DO
  3984. e := x.parameters.GetExpression(i);
  3985. Evaluate(e,index);
  3986. Convert(index.op,addressType);
  3987. AddInt(res, res, index.op);
  3988. IF i = 0 THEN
  3989. (*
  3990. ReuseCopy(res, index.op);
  3991. *)
  3992. Designate(x.left,array);
  3993. type := x.left.type.resolved;
  3994. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3995. Dereference(array, type, FALSE);
  3996. END;
  3997. (*
  3998. ELSE AddInt(res, res, index.op);
  3999. *)
  4000. END;
  4001. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4002. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4003. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4004. BoundCheck(index.op, length);
  4005. END;
  4006. ReleaseIntermediateOperand(length);
  4007. END;
  4008. ReleaseOperand(index);
  4009. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4010. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4011. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4012. MulInt(res,res,length);
  4013. END;
  4014. ReleaseIntermediateOperand(length);
  4015. END;
  4016. (* remaining open dimensions -- compute address *)
  4017. i := maxDim+1;
  4018. IF type IS SyntaxTree.ArrayType THEN
  4019. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4020. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4021. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4022. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4023. MulInt(res,res,length);
  4024. END;
  4025. ReleaseIntermediateOperand(length);
  4026. INC(i);
  4027. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4028. END;
  4029. END;
  4030. IF (type IS SyntaxTree.ArrayType) THEN
  4031. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4032. size := StaticSize(system, type);
  4033. IF size # 1 THEN
  4034. length := IntermediateCode.Immediate(addressType,size);
  4035. MulInt(res,res,length);
  4036. END;
  4037. ELSE
  4038. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4039. IF size # 1 THEN
  4040. length := IntermediateCode.Immediate(addressType,size);
  4041. MulInt(res,res,length);
  4042. END;
  4043. END;
  4044. END;
  4045. AddInt(res,res,array.op);
  4046. InitOperand(result,ModeReference);
  4047. result.op := res;
  4048. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4049. ReleaseIntermediateOperand(result.tag);
  4050. result.tag := TypeDescriptorAdr(type);
  4051. IF ~newObjectFile THEN
  4052. IntermediateCode.MakeMemory(result.tag,addressType);
  4053. END
  4054. ELSIF IsDelegate(type) THEN
  4055. ReleaseIntermediateOperand(result.tag);
  4056. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4057. UseIntermediateOperand(result.tag);
  4058. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4059. ReleaseIntermediateOperand(result.tag);
  4060. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4061. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4062. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4063. END;
  4064. ReleaseOperand(array);
  4065. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4066. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4067. END;
  4068. END IndexDesignator;
  4069. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  4070. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4071. BEGIN
  4072. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4073. dest := destination; destination := emptyOperand;
  4074. type := x.left.type.resolved;
  4075. IF type IS SyntaxTree.MathArrayType THEN
  4076. MathIndexDesignator(x);
  4077. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4078. IndexDesignator(x);
  4079. END;
  4080. destination := dest;
  4081. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4082. END VisitIndexDesignator;
  4083. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4084. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4085. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4086. procedure: SyntaxTree.Procedure;
  4087. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4088. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4089. BEGIN
  4090. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4091. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4092. parameters := expression.parameters;
  4093. moduleName := "FoxArrayBase";
  4094. procedureName := "CopyDescriptor";
  4095. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4096. SaveRegisters();ReleaseUsedRegisters(saved);
  4097. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4098. IF procedure = NIL THEN
  4099. s := "procedure ";
  4100. Strings.Append(s,moduleName);
  4101. Strings.Append(s,".");
  4102. Strings.Append(s,procedureName);
  4103. Strings.Append(s," not present");
  4104. Error(position,s);
  4105. ELSE
  4106. (* push address of temporary variable *)
  4107. Symbol(variable,destOperand);
  4108. Emit(Push(position,destOperand.op));
  4109. ReleaseOperand(destOperand);
  4110. (* push src *)
  4111. Evaluate(expression.left,srcOperand);
  4112. (*
  4113. Dereference(srcOperand,expression.type.resolved);
  4114. Emit(Push(position,srcOperand.tag));
  4115. *)
  4116. Emit(Push(position,srcOperand.op));
  4117. ReleaseOperand(srcOperand);
  4118. tensorFound := FALSE;
  4119. FOR i := 0 TO parameters.Length()-1 DO
  4120. e := parameters.GetExpression(i);
  4121. IF e IS SyntaxTree.TensorRangeExpression THEN
  4122. tensorFound := TRUE;
  4123. ELSIF e IS SyntaxTree.RangeExpression THEN
  4124. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4125. ELSE
  4126. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4127. END;
  4128. END;
  4129. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4130. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4131. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4132. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4133. StaticCallOperand(procOp,procedure);
  4134. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4135. ReleaseOperand(procOp);
  4136. END;
  4137. RestoreRegisters(saved);
  4138. END;
  4139. RETURN variable
  4140. END PrepareTensorDescriptor;
  4141. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4142. VAR
  4143. type, descriptorType, baseType: SyntaxTree.Type;
  4144. operand, tmpOperand, variableOp, variable2Op: Operand;
  4145. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4146. variable, variable2: SyntaxTree.Variable;
  4147. dim, i, size: LONGINT;
  4148. (* TODO: needed? *)
  4149. oldArrayDestinationTag: IntermediateCode.Operand;
  4150. oldArrayDestinationDimension: LONGINT;
  4151. position: Position;
  4152. saved: RegisterEntry;
  4153. arrayFlags: SET;
  4154. m, n: LONGINT;
  4155. PROCEDURE Pass(op: IntermediateCode.Operand);
  4156. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4157. BEGIN
  4158. IF numberRegister >= 0 THEN
  4159. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  4160. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4161. Emit(Mov(position,parameterRegister, op));
  4162. ELSE
  4163. Emit(Push(position,op))
  4164. END
  4165. END Pass;
  4166. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4167. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4168. BEGIN
  4169. formalType := formalType.resolved; actualType := actualType.resolved;
  4170. IF IsOpenArray(formalType)THEN
  4171. IF actualType IS SyntaxTree.StringType THEN
  4172. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4173. RETURN;
  4174. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4175. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4176. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4177. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4178. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4179. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4180. ELSE
  4181. tmp := baseReg;
  4182. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4183. IntermediateCode.MakeMemory(tmp,addressType);
  4184. Pass((tmp));
  4185. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4186. END;
  4187. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4188. END;
  4189. END PushArrayLens;
  4190. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4191. BEGIN
  4192. CASE size OF
  4193. |2: INCL(flags,Size2Flag);
  4194. |3: INCL(flags,Size3Flag);
  4195. |4: INCL(flags,Size4Flag);
  4196. |5: INCL(flags,Size5Flag);
  4197. |6: INCL(flags,Size6Flag);
  4198. |7: INCL(flags,Size7Flag);
  4199. |8: INCL(flags,Size8Flag);
  4200. END;
  4201. END SetSmallArraySizeFlag;
  4202. BEGIN
  4203. IF Trace THEN TraceEnter("PushParameter") END;
  4204. position := expression.position;
  4205. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4206. type := expression.type.resolved;
  4207. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4208. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4209. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4210. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4211. );
  4212. (* TODO: needed? *)
  4213. oldArrayDestinationTag := arrayDestinationTag;
  4214. oldArrayDestinationDimension := arrayDestinationDimension;
  4215. IF IsArrayOfSystemByte(parameter.type) THEN
  4216. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4217. Designate(expression,operand);
  4218. ELSE
  4219. Evaluate(expression, tmpOperand);
  4220. (* array of system byte does not provide any pointers *)
  4221. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4222. Symbol(variable, operand);
  4223. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4224. Emit(Mov(position,tmp, tmpOperand.op));
  4225. ReleaseOperand(tmpOperand);
  4226. END;
  4227. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4228. ReleaseIntermediateOperand(operand.tag);
  4229. operand.tag := tmp;
  4230. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4231. Pass((operand.tag));
  4232. END;
  4233. Pass((operand.op));
  4234. ELSIF IsOpenArray(parameter.type) THEN
  4235. Designate(expression,operand);
  4236. baseReg := operand.tag;
  4237. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4238. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4239. END;
  4240. Pass((operand.op)); (* address of the array *)
  4241. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4242. (* case 1
  4243. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4244. *)
  4245. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4246. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4247. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4248. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4249. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4250. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4251. arrayDestinationTag := sp;
  4252. (* case 1b
  4253. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4254. *)
  4255. IF expression IS SyntaxTree.IndexDesignator THEN
  4256. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4257. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4258. arrayDestinationDimension := dim;
  4259. Designate(expression,operand);
  4260. (* case 1a
  4261. P(...,A,...) push: push array descriptor to stack
  4262. *)
  4263. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4264. Designate(expression,operand);
  4265. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4266. i := 0;
  4267. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4268. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4269. INC(i);
  4270. END;
  4271. type := expression.type.resolved;
  4272. WHILE (i<dim) DO (* remaining static dimensions *)
  4273. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4274. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4275. ReleaseOperand(tmpOperand);
  4276. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4277. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4278. ReleaseOperand(tmpOperand);
  4279. INC(i);
  4280. END;
  4281. dimOp := IntermediateCode.Immediate(addressType,dim);
  4282. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4283. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4284. (* case 1d
  4285. P(...,T,...) push: process left arguments, create array descriptor with given number of dimensions from T on stack
  4286. + case 1e
  4287. P(.. PT() ... );
  4288. *)
  4289. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4290. Designate(expression,operand);
  4291. Dereference(operand,type.resolved,FALSE);
  4292. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4293. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4294. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4295. (* case 1f
  4296. P(...,S,...) push: create array descriptor to S on stack
  4297. case 1g
  4298. P(... PS()...)
  4299. *)
  4300. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4301. Designate(expression,operand);
  4302. FOR i := 0 TO dim-1 DO
  4303. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4304. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4305. ReleaseOperand(tmpOperand);
  4306. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4307. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4308. ReleaseOperand(tmpOperand);
  4309. END;
  4310. (*******
  4311. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4312. *)
  4313. arrayFlags := {StaticFlag};
  4314. IF dim = 1 THEN
  4315. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4316. ReleaseOperand(tmpOperand);
  4317. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4318. m := LONGINT(tmpOperand.op.intValue);
  4319. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4320. ELSIF dim = 2 THEN
  4321. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4322. ReleaseOperand(tmpOperand);
  4323. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4324. m := LONGINT(tmpOperand.op.intValue);
  4325. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4326. ReleaseOperand(tmpOperand);
  4327. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4328. n := LONGINT(tmpOperand.op.intValue);
  4329. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4330. INCL(arrayFlags,SmallMatrixFlag);
  4331. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4332. END;
  4333. END;
  4334. (*******)
  4335. dimOp := IntermediateCode.Immediate(addressType,dim);
  4336. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4337. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4338. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4339. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4340. baseType := SemanticChecker.ArrayBase(type,dim);
  4341. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4342. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4343. ELSE HALT(100);
  4344. END;
  4345. (* case 2
  4346. procedure P([left args], var A: array [*,*] of Type, [right args])
  4347. *)
  4348. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4349. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4350. (* case 2b
  4351. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4352. push: push reference to pushed array descriptor
  4353. post: remove array descriptor.
  4354. *)
  4355. IF expression IS SyntaxTree.IndexDesignator THEN
  4356. descriptorType := GetMathArrayDescriptorType(dim);
  4357. (* range type : no allocation possible, should be untraced *)
  4358. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4359. Symbol(variable,variableOp);
  4360. arrayDestinationTag := variableOp.op;
  4361. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4362. arrayDestinationDimension := dim;
  4363. NeedDescriptor := TRUE;
  4364. Designate(expression,operand);
  4365. Pass((operand.tag));
  4366. NeedDescriptor := FALSE;
  4367. (* case 2a
  4368. P(...,A,...)
  4369. push: push reference to array descriptor on stack
  4370. *)
  4371. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4372. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4373. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4374. INC(i);
  4375. END;
  4376. IF i = dim THEN
  4377. Designate(expression,operand);
  4378. Pass((operand.tag));
  4379. ELSE (* open-static *)
  4380. type := expression.type.resolved;
  4381. descriptorType := GetMathArrayDescriptorType(dim);
  4382. (* static array , cannot be reallocated, untraced !*)
  4383. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4384. Symbol(variable,variableOp);
  4385. arrayDestinationTag := variableOp.op;
  4386. Designate(expression,operand);
  4387. FOR i := 0 TO dim-1 DO
  4388. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4389. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4390. ReleaseOperand(tmpOperand);
  4391. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4392. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4393. ReleaseOperand(tmpOperand);
  4394. END;
  4395. dimOp := IntermediateCode.Immediate(addressType,dim);
  4396. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4397. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4398. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4399. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4400. baseType := SemanticChecker.ArrayBase(type,dim);
  4401. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4402. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4403. Pass((arrayDestinationTag));
  4404. END;
  4405. (* case 2d
  4406. P(...,T,...) push: emit dimension check, push T
  4407. *)
  4408. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4409. Designate(expression,operand);
  4410. Dereference(operand,type.resolved,FALSE);
  4411. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4412. Pass((operand.tag));
  4413. (* case 2f
  4414. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4415. push: push reference to pushed array descriptor
  4416. post: remove array descriptor
  4417. *)
  4418. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4419. descriptorType := GetMathArrayDescriptorType(dim);
  4420. (* static array -- cannot be reallocatated, untraced *)
  4421. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4422. Symbol(variable,variableOp);
  4423. arrayDestinationTag := variableOp.op;
  4424. Designate(expression,operand);
  4425. FOR i := 0 TO dim-1 DO
  4426. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4427. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4428. ReleaseOperand(tmpOperand);
  4429. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4430. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4431. ReleaseOperand(tmpOperand);
  4432. END;
  4433. (*
  4434. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4435. *)
  4436. arrayFlags := {StaticFlag};
  4437. IF dim = 1 THEN
  4438. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4439. ReleaseOperand(tmpOperand);
  4440. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4441. m := LONGINT(tmpOperand.op.intValue);
  4442. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4443. ELSIF dim = 2 THEN
  4444. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4445. ReleaseOperand(tmpOperand);
  4446. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4447. m := LONGINT(tmpOperand.op.intValue);
  4448. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4449. ReleaseOperand(tmpOperand);
  4450. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4451. n := LONGINT(tmpOperand.op.intValue);
  4452. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4453. INCL(arrayFlags,SmallMatrixFlag);
  4454. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4455. END;
  4456. END;
  4457. (*******)
  4458. dimOp := IntermediateCode.Immediate(addressType,dim);
  4459. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4460. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4461. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4462. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4463. baseType := SemanticChecker.ArrayBase(type,dim);
  4464. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4465. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4466. Pass((arrayDestinationTag));
  4467. ELSE HALT(100);
  4468. END;
  4469. (* case 3
  4470. procedure P([left args], [const] A: array [?] of Type, [right args])
  4471. *)
  4472. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4473. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4474. (* case 3b
  4475. P(...,A[a..b,c..d],...)
  4476. *)
  4477. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4478. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4479. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4480. Symbol(variable,variableOp);
  4481. LoadValue(variableOp,system.addressType);
  4482. ELSE
  4483. descriptorType := GetMathArrayDescriptorType(dim);
  4484. (* range -- cannot be reallocated *)
  4485. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4486. Symbol(variable,variableOp);
  4487. END;
  4488. arrayDestinationTag := variableOp.op;
  4489. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4490. arrayDestinationDimension := 0;
  4491. Designate(expression,operand);
  4492. Pass((operand.tag));
  4493. (* case 3a
  4494. P(...,A,...)
  4495. *)
  4496. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4497. i := 0;
  4498. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4499. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4500. INC(i);
  4501. END;
  4502. IF i = dim THEN
  4503. Designate(expression,operand);
  4504. Pass((operand.tag));
  4505. ELSE (* open-static *)
  4506. type := expression.type.resolved;
  4507. descriptorType := GetMathArrayDescriptorType(dim);
  4508. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4509. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4510. Symbol(variable,variableOp);
  4511. arrayDestinationTag := variableOp.op;
  4512. Designate(expression,operand);
  4513. FOR i := 0 TO dim-1 DO
  4514. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4515. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4516. ReleaseOperand(tmpOperand);
  4517. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4518. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4519. ReleaseOperand(tmpOperand);
  4520. END;
  4521. dimOp := IntermediateCode.Immediate(addressType,dim);
  4522. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4523. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4524. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4525. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4526. baseType := SemanticChecker.ArrayBase(type,dim);
  4527. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4528. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4529. Pass((arrayDestinationTag));
  4530. END;
  4531. (* case 3d
  4532. P(...,T,...)
  4533. case 3e
  4534. P(...,PT(...),...)
  4535. *)
  4536. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4537. Designate(expression,operand);
  4538. Dereference(operand,type.resolved,FALSE);
  4539. Pass((operand.tag));
  4540. (* case 3f
  4541. P(...,S,...)
  4542. case 3g
  4543. P(...,PS(...),...)
  4544. *)
  4545. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4546. descriptorType := GetMathArrayDescriptorType(dim);
  4547. (* static array does not need to be traced *)
  4548. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4549. Symbol(variable,variableOp);
  4550. arrayDestinationTag := variableOp.op;
  4551. Designate(expression,operand);
  4552. IF operand.op.type.length >1 THEN (* vector register *)
  4553. (* static array does not need to be traced *)
  4554. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4555. Symbol(variable2, variable2Op);
  4556. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4557. Emit(Mov(position,tmp, operand.op));
  4558. ReleaseOperand(operand);
  4559. Symbol(variable2, operand);
  4560. END;
  4561. FOR i := 0 TO dim-1 DO
  4562. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4563. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4564. ReleaseOperand(tmpOperand);
  4565. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4566. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4567. ReleaseOperand(tmpOperand);
  4568. END;
  4569. dimOp := IntermediateCode.Immediate(addressType,dim);
  4570. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4571. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4572. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4573. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4574. baseType := SemanticChecker.ArrayBase(type,dim);
  4575. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4576. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4577. Pass((arrayDestinationTag));
  4578. ELSE HALT(100);
  4579. END;
  4580. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4581. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4582. (* case 4b
  4583. P(...,A[a..b,c..d],...)
  4584. *)
  4585. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4586. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4587. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4588. Symbol(variable,variableOp);
  4589. LoadValue(variableOp,system.addressType);
  4590. ELSE
  4591. descriptorType := GetMathArrayDescriptorType(dim);
  4592. (* range array -- cannot be allocated *)
  4593. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4594. Symbol(variable,variableOp);
  4595. END;
  4596. arrayDestinationTag := variableOp.op;
  4597. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4598. arrayDestinationDimension := 0;
  4599. Designate(expression,operand);
  4600. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4601. Symbol(variable,variableOp);
  4602. ELSE
  4603. (* alias to range -- untraced *)
  4604. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4605. Symbol(variable,variableOp);
  4606. MakeMemory(tmp,variableOp.op,addressType,0);
  4607. Emit(Mov(position,tmp,operand.tag));
  4608. ReleaseIntermediateOperand(tmp);
  4609. END;
  4610. Pass((variableOp.op));
  4611. ReleaseOperand(variableOp);
  4612. (* case 4a
  4613. P(...,A,...)
  4614. *)
  4615. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4616. i := 0;
  4617. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4618. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4619. INC(i);
  4620. END;
  4621. IF i = dim THEN
  4622. Designate(expression,operand);
  4623. arrayDestinationTag := operand.tag;
  4624. ELSE (* open-static *)
  4625. type := expression.type.resolved;
  4626. descriptorType := GetMathArrayDescriptorType(dim);
  4627. (* static array -- untraced *)
  4628. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4629. Symbol(variable,variableOp);
  4630. arrayDestinationTag := variableOp.op;
  4631. Designate(expression,operand);
  4632. FOR i := 0 TO dim-1 DO
  4633. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4634. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4635. ReleaseOperand(tmpOperand);
  4636. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4637. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4638. ReleaseOperand(tmpOperand);
  4639. END;
  4640. dimOp := IntermediateCode.Immediate(addressType,dim);
  4641. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4642. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4643. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4644. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4645. baseType := SemanticChecker.ArrayBase(type,dim);
  4646. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4647. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4648. END;
  4649. (* tensor alias to open array -- untraced *)
  4650. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4651. Symbol(variable,variableOp);
  4652. MakeMemory(tmp,variableOp.op,addressType,0);
  4653. Emit(Mov(position,tmp,arrayDestinationTag));
  4654. ReleaseIntermediateOperand(tmp);
  4655. Pass((variableOp.op));
  4656. ReleaseOperand(variableOp);
  4657. (* case 4d
  4658. P(...,T,...)
  4659. *)
  4660. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4661. Designate(expression,operand);
  4662. Pass((operand.op));
  4663. (* case 4f
  4664. P(...,S,...)
  4665. *)
  4666. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4667. descriptorType := GetMathArrayDescriptorType(dim);
  4668. (* static array -- cannot be reallocated, untraced *)
  4669. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4670. Symbol(variable,variableOp);
  4671. arrayDestinationTag := variableOp.op;
  4672. Designate(expression,operand);
  4673. FOR i := 0 TO dim-1 DO
  4674. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4675. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4676. ReleaseOperand(tmpOperand);
  4677. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4678. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4679. ReleaseOperand(tmpOperand);
  4680. END;
  4681. dimOp := IntermediateCode.Immediate(addressType,dim);
  4682. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4683. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4684. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4685. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4686. baseType := SemanticChecker.ArrayBase(type,dim);
  4687. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4688. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4689. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4690. Symbol(variable,variableOp);
  4691. MakeMemory(tmp,variableOp.op,addressType,0);
  4692. Emit(Mov(position,tmp,arrayDestinationTag));
  4693. ReleaseIntermediateOperand(tmp);
  4694. Pass((variableOp.op));
  4695. ReleaseOperand(variableOp);
  4696. ELSE HALT(100);
  4697. END;
  4698. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4699. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4700. Designate(expression,operand);
  4701. IF operand.op.type.length > 1 THEN
  4702. Emit(Push(position, operand.op));
  4703. ELSE
  4704. size := system.SizeOf(type);
  4705. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4706. size := ToMemoryUnits(system,size);
  4707. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4708. arrayDestinationTag := sp;
  4709. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4710. END;
  4711. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4712. Designate(expression,operand);
  4713. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4714. (* static array no pointer *)
  4715. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4716. Symbol(variable,variableOp);
  4717. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4718. Emit(Mov(position,tmp,operand.op));
  4719. Emit(Push(position,variableOp.op));
  4720. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4721. Pass((operand.op));
  4722. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4723. END;
  4724. ELSE HALT(200)
  4725. END;
  4726. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4727. IF parameter.kind = SyntaxTree.VarParameter THEN
  4728. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4729. Designate(expression, operand);
  4730. Pass((operand.op));
  4731. ELSE
  4732. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4733. Evaluate(expression, operand);
  4734. Pass((operand.extra)); (* step *)
  4735. Pass((operand.tag)); (* last *)
  4736. Pass((operand.op)) (* first *)
  4737. END
  4738. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4739. IF parameter.kind = SyntaxTree.VarParameter THEN
  4740. Designate(expression, operand);
  4741. Pass((operand.op));
  4742. ELSE
  4743. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4744. Evaluate(expression, operand);
  4745. Pass((operand.tag)); (* real part *)
  4746. Pass((operand.op)) (* imaginary part *)
  4747. END
  4748. ELSE
  4749. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4750. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4751. Designate(expression,operand);
  4752. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4753. (* stack allocation *)
  4754. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4755. (*! parameter alignment to be discussed ... *)
  4756. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4757. size := type(SyntaxTree.StringType).length;
  4758. END;
  4759. IF backend.cooperative & parameter.NeedsTrace() THEN
  4760. dst := NewRegisterOperand (addressType);
  4761. Emit(Mov(position,dst, sp));
  4762. IntermediateCode.InitImmediate(null, byteType, 0);
  4763. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4764. ReleaseIntermediateOperand(dst);
  4765. SaveRegisters();ReleaseUsedRegisters(saved);
  4766. (* register dst has been freed before SaveRegisters already *)
  4767. CallAssignMethod(dst, operand.op, parameter.type);
  4768. RestoreRegisters(saved);
  4769. END;
  4770. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4771. ELSIF IsOpenArray(parameter.type) THEN
  4772. Designate(expression,operand);
  4773. baseReg := operand.tag;
  4774. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4775. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4776. END;
  4777. Pass((operand.op)); (* address of the array *)
  4778. ELSIF IsDelegate(parameter.type) THEN
  4779. Evaluate(expression,operand);
  4780. IF backend.cooperative & parameter.NeedsTrace() THEN
  4781. Emit(Push(position, nil));
  4782. dst := NewRegisterOperand (addressType);
  4783. Emit(Mov(position,dst, sp));
  4784. ReleaseIntermediateOperand(dst);
  4785. SaveRegisters();ReleaseUsedRegisters(saved);
  4786. Emit(Push(position, dst));
  4787. (* register dst has been freed before SaveRegisters already *)
  4788. Emit(Push(position, operand.tag));
  4789. CallThis(position,"GarbageCollector","Assign",2);
  4790. RestoreRegisters(saved);
  4791. ELSE
  4792. Pass((operand.tag));
  4793. END;
  4794. Pass((operand.op));
  4795. ELSE
  4796. Evaluate(expression,operand);
  4797. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4798. Emit(Push(position, nil));
  4799. dst := NewRegisterOperand (addressType);
  4800. Emit(Mov(position,dst, sp));
  4801. ReleaseIntermediateOperand(dst);
  4802. SaveRegisters();ReleaseUsedRegisters(saved);
  4803. Emit(Push(position, dst));
  4804. (* register dst has been freed before SaveRegisters already *)
  4805. Emit(Push(position, operand.op));
  4806. CallThis(position,"GarbageCollector","Assign",2);
  4807. RestoreRegisters(saved);
  4808. ELSE
  4809. Pass((operand.op));
  4810. END;
  4811. END;
  4812. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4813. Evaluate(expression,operand);
  4814. Pass((operand.op));
  4815. ELSE (* var parameter *)
  4816. Designate(expression,operand);
  4817. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4818. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4819. Pass((operand.tag));
  4820. END;
  4821. END;
  4822. Pass((operand.op));
  4823. END;
  4824. END;
  4825. (* TODO: needed? *)
  4826. arrayDestinationTag := oldArrayDestinationTag;
  4827. arrayDestinationDimension := oldArrayDestinationDimension;
  4828. IF needsParameterBackup THEN
  4829. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4830. ReuseCopy(parameterBackup, operand.op)
  4831. END;
  4832. ReleaseOperand(operand);
  4833. IF Trace THEN TraceExit("PushParameter") END;
  4834. END PushParameter;
  4835. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4836. VAR prevConditional: BOOLEAN;
  4837. BEGIN
  4838. prevConditional := conditional;
  4839. conditional := FALSE;
  4840. 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
  4841. Expression(x.result); (* use register *)
  4842. END;
  4843. Statement(x.statement);
  4844. conditional := prevConditional;
  4845. IF x.result # NIL THEN Expression(x.result) END;
  4846. 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
  4847. ReleaseIntermediateOperand(result.op);
  4848. END;
  4849. END VisitStatementDesignator;
  4850. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4851. VAR
  4852. procedure: SyntaxTree.Procedure;
  4853. procedureType: SyntaxTree.ProcedureType;
  4854. wasInline: BOOLEAN;
  4855. actualParameters: SyntaxTree.ExpressionList;
  4856. formalParameter: SyntaxTree.Parameter;
  4857. actualParameter: SyntaxTree.Expression;
  4858. i: LONGINT;
  4859. localVariable: SyntaxTree.Variable;
  4860. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4861. src, dest: Operand;
  4862. prevInlineExit : Label;
  4863. prevMapper: SymbolMapper;
  4864. tooComplex: BOOLEAN;
  4865. resultDesignator: SyntaxTree.Expression;
  4866. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4867. BEGIN
  4868. IF e = NIL THEN RETURN TRUE
  4869. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4870. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4871. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4872. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4873. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4874. ELSE RETURN FALSE
  4875. END;
  4876. END SimpleExpression;
  4877. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4878. BEGIN
  4879. RETURN checker.CanPassInRegister(type)
  4880. END FitsInRegister;
  4881. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4882. VAR
  4883. variable: SyntaxTree.Variable;
  4884. variableDesignator: SyntaxTree.Designator;
  4885. BEGIN
  4886. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  4887. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  4888. variableDesignator.SetType(type);
  4889. RETURN variableDesignator
  4890. END GetTemp;
  4891. BEGIN
  4892. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4893. wasInline := currentIsInline;
  4894. prevInlineExit := currentInlineExit;
  4895. prevMapper := currentMapper;
  4896. currentInlineExit := NewLabel();
  4897. tooComplex := FALSE;
  4898. NEW(currentMapper);
  4899. currentIsInline := TRUE;
  4900. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4901. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4902. formalParameter := procedureType.firstParameter;
  4903. actualParameters := x.parameters;
  4904. i := 0;
  4905. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4906. actualParameter := actualParameters.GetExpression(i);
  4907. IF actualParameter.resolved # NIL THEN
  4908. actualParameter := actualParameter.resolved
  4909. END;
  4910. (*
  4911. if expression is simple and can be passed immediately
  4912. or if type fits in register then we can proceed
  4913. otherwise we escape to ordinary procedure call.
  4914. *)
  4915. (* cases where the expression can be mapped identically *)
  4916. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4917. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  4918. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4919. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4920. (*
  4921. Assign(variableDesignator, actualParameter);
  4922. *)
  4923. Evaluate(actualParameter, src);
  4924. Designate(variableDesignator, dest);
  4925. Emit(Mov(x.position, dest.op, src.op));
  4926. ReleaseOperand(dest);
  4927. ReleaseOperand(src);
  4928. (* the src operand should now have been completely released ! *)
  4929. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  4930. ELSE tooComplex := TRUE
  4931. END;
  4932. (*
  4933. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4934. currentMapper.Add(formalParameter, actualParameter, NIL);
  4935. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4936. variableDesignator := GetTemp(system.addressType, FALSE);
  4937. Designate(actualParameter, src);
  4938. Designate(variableDesignator, dest);
  4939. IntermediateCode.MakeMemory(dest.op,addressType);
  4940. Emit(Mov(x.position, dest.op, src.op));
  4941. ReleaseOperand(dest);
  4942. IF src.tag.mode # IntermediateCode.Undefined THEN
  4943. tagDesignator := GetTemp(system.addressType, FALSE);
  4944. Designate(tagDesignator, dest);
  4945. IntermediateCode.MakeMemory(dest.op,addressType);
  4946. Emit(Mov(x.position, dest.op, src.op));
  4947. END;
  4948. ReleaseOperand(dest); ReleaseOperand(src);
  4949. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4950. END;
  4951. *)
  4952. formalParameter := formalParameter.nextParameter;
  4953. INC(i);
  4954. END;
  4955. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4956. IF resultDesignator # NIL THEN
  4957. returnDesignator := resultDesignator
  4958. ELSE
  4959. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4960. END;
  4961. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  4962. END;
  4963. localVariable := procedure.procedureScope.firstVariable;
  4964. WHILE ~tooComplex & (localVariable # NIL) DO
  4965. variableDesignator := GetTemp(localVariable.type, FALSE);
  4966. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  4967. localVariable := localVariable.nextVariable;
  4968. END;
  4969. IF ~tooComplex THEN
  4970. VisitStatementBlock(procedure.procedureScope.body);
  4971. SetLabel(currentInlineExit);
  4972. IF procedureType.returnType # NIL THEN
  4973. Designate(returnDesignator, result);
  4974. IF conditional THEN
  4975. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4976. ValueToCondition(result)
  4977. END;
  4978. END;
  4979. END;
  4980. currentMapper := prevMapper;
  4981. currentInlineExit := prevInlineExit;
  4982. currentIsInline := wasInline;
  4983. RETURN ~tooComplex
  4984. END InlineProcedureCall;
  4985. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4986. VAR
  4987. parameters: SyntaxTree.ExpressionList;
  4988. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4989. designator: SyntaxTree.Designator;
  4990. procedureType: SyntaxTree.ProcedureType;
  4991. formalParameter: SyntaxTree.Parameter;
  4992. operand, returnValue: Operand;
  4993. reg, size, mask, dest: IntermediateCode.Operand;
  4994. saved,saved2: RegisterEntry;
  4995. symbol: SyntaxTree.Symbol;
  4996. variable: SyntaxTree.Variable;
  4997. i, parametersSize, returnTypeSize : LONGINT;
  4998. structuredReturnType: BOOLEAN;
  4999. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5000. tempVariableDesignator: SyntaxTree.Designator;
  5001. gap, alignment: LONGINT; (*fld*)
  5002. (* TODO: remove unnecessary backup variables *)
  5003. oldResult: Operand;
  5004. oldCurrentScope: SyntaxTree.Scope;
  5005. oldArrayDestinationTag: IntermediateCode.Operand;
  5006. oldArrayDestinationDimension: LONGINT;
  5007. oldConstantDeclaration: SyntaxTree.Symbol;
  5008. oldDestination: IntermediateCode.Operand;
  5009. oldCurrentLoop: Label;
  5010. oldConditional: BOOLEAN;
  5011. oldTrueLabel, oldFalseLabel: Label;
  5012. oldLocked: BOOLEAN;
  5013. usedRegisters,oldUsedRegisters: RegisterEntry;
  5014. return: IntermediateCode.Operand;
  5015. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5016. arg: IntermediateCode.Operand;
  5017. dummy: IntermediateCode.Operand;
  5018. recordType: SyntaxTree.RecordType;
  5019. operatorSelectionProcedureOperand: Operand;
  5020. operatorSelectionProcedure: SyntaxTree.Procedure;
  5021. fingerPrint: SyntaxTree.FingerPrint;
  5022. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5023. identifierNumber: LONGINT;
  5024. parameterRegister: Backend.Registers;
  5025. parameterRegisters: LONGINT;
  5026. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5027. procedure: SyntaxTree.Procedure;
  5028. PROCEDURE BackupGlobalState;
  5029. BEGIN
  5030. oldResult := result;
  5031. oldCurrentScope := currentScope;
  5032. oldArrayDestinationTag := arrayDestinationTag;
  5033. oldArrayDestinationDimension := arrayDestinationDimension;
  5034. oldConstantDeclaration := constantDeclaration;
  5035. oldDestination := destination;
  5036. oldCurrentLoop := currentLoop;
  5037. oldConditional := conditional;
  5038. oldTrueLabel := trueLabel;
  5039. oldFalseLabel := falseLabel;
  5040. oldLocked := locked;
  5041. oldUsedRegisters := usedRegisters
  5042. END BackupGlobalState;
  5043. PROCEDURE RestoreGlobalState;
  5044. BEGIN
  5045. result := oldResult;
  5046. currentScope := oldCurrentScope;
  5047. arrayDestinationTag := oldArrayDestinationTag;
  5048. arrayDestinationDimension := oldArrayDestinationDimension;
  5049. constantDeclaration := oldConstantDeclaration;
  5050. destination := oldDestination;
  5051. currentLoop := oldCurrentLoop;
  5052. conditional := oldConditional;
  5053. trueLabel := oldTrueLabel;
  5054. falseLabel := oldFalseLabel;
  5055. locked := oldLocked;
  5056. usedRegisters := oldUsedRegisters
  5057. END RestoreGlobalState;
  5058. (** do preparations before parameter push for array-structured object types (ASOTs):
  5059. if ASOT is passed as VAR parameter:
  5060. - allocate temporary variable of math array type
  5061. - copy contents of ASOT to be passed to temporary variable
  5062. - use temporary variable as the actual parameter instead
  5063. - 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)
  5064. **)
  5065. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5066. VAR
  5067. expression: SyntaxTree.Expression;
  5068. BEGIN
  5069. IF actualParameter IS SyntaxTree.Designator THEN
  5070. designator := actualParameter(SyntaxTree.Designator);
  5071. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5072. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5073. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5074. ASSERT(checker # NIL);
  5075. checker.SetCurrentScope(currentScope);
  5076. (* allocate temporary variable *)
  5077. ASSERT(actualParameter.type # NIL);
  5078. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5079. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5080. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5081. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5082. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5083. ASSERT(tempVariableDesignator.type # NIL);
  5084. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5085. (* copy math array stored in actual parameter to temporary variable *)
  5086. BackupGlobalState;
  5087. AssignMathArray(tempVariableDesignator, actualParameter);
  5088. RestoreGlobalState;
  5089. (* use temporary variable as actual parameter instead of the original one *)
  5090. actualParameter := tempVariableDesignator;
  5091. (* create write-back call and store it in linked list *)
  5092. (* create new list entry *)
  5093. IF firstWriteBackCall = NIL THEN
  5094. NEW(firstWriteBackCall);
  5095. currentWriteBackCall := firstWriteBackCall
  5096. ELSE
  5097. ASSERT(currentWriteBackCall # NIL);
  5098. NEW(currentWriteBackCall.next);
  5099. currentWriteBackCall := currentWriteBackCall.next
  5100. END;
  5101. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5102. ASSERT(expression.type = NIL);
  5103. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5104. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5105. (* prepare writeback for any other "normal" indexer *)
  5106. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5107. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5108. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5109. Assign(tempVariableDesignator, actualParameter);
  5110. actualParameter := tempVariableDesignator;
  5111. IF firstWriteBackCall = NIL THEN
  5112. NEW(firstWriteBackCall);
  5113. currentWriteBackCall := firstWriteBackCall
  5114. ELSE
  5115. ASSERT(currentWriteBackCall # NIL);
  5116. NEW(currentWriteBackCall.next);
  5117. currentWriteBackCall := currentWriteBackCall.next
  5118. END;
  5119. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5120. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5121. END
  5122. END
  5123. END PrepareParameter;
  5124. BEGIN
  5125. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5126. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5127. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5128. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5129. IF InlineProcedureCall(x) THEN
  5130. RETURN
  5131. ELSE
  5132. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5133. END
  5134. END;
  5135. END;
  5136. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5137. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5138. dest := destination; destination := emptyOperand;
  5139. SaveRegisters();ReleaseUsedRegisters(saved);
  5140. parameters := x.parameters;
  5141. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5142. (* an operator is called *)
  5143. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5144. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  5145. (* check if a dynamic operator call should be performed *)
  5146. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5147. ELSE
  5148. isCallOfDynamicOperator := FALSE
  5149. END;
  5150. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5151. Emit(Push(position, ap));
  5152. END;
  5153. alignment := procedureType.stackAlignment;
  5154. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize = 64) THEN
  5155. alignment := 16 (* bytes *);
  5156. END;
  5157. IF alignment > 1 THEN
  5158. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5159. Emit(Mov(position,reg, sp));
  5160. gap := ParametersSize(system, procedureType, FALSE);
  5161. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5162. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN
  5163. gap := 4*ToMemoryUnits(system,system.addressSize); (* at least four registers get pushed*)
  5164. END;
  5165. END;
  5166. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  5167. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5168. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5169. Emit(And(position,sp, sp, mask));
  5170. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5171. Emit(Push(position,reg));
  5172. (*
  5173. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  5174. Emit(Mov(position,mem,reg));
  5175. *)
  5176. ReleaseIntermediateOperand(reg);
  5177. END;
  5178. IF SysvABI(procedureType.callingConvention) & (system.addressSize = 32) THEN
  5179. (* align stack to 16-byte boundary *)
  5180. IntermediateCode.InitImmediate(mask,addressType,-16);
  5181. Emit(And(position,sp, sp, mask));
  5182. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5183. IF gap # 0 THEN
  5184. IntermediateCode.InitImmediate(size,addressType,gap);
  5185. Emit(Sub(position,sp,sp,size))
  5186. END;
  5187. END;
  5188. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5189. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5190. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5191. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5192. ELSE
  5193. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5194. END;
  5195. Evaluate(x.left, operand);
  5196. IF symbol IS SyntaxTree.Procedure THEN
  5197. IF (procedureType.selfParameter # NIL) THEN
  5198. Emit(Push(position,operand.tag));
  5199. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5200. Emit(Push(position,operand.tag));
  5201. ELSIF (procedureType.isDelegate) THEN
  5202. Emit(Push(position,operand.tag));
  5203. END;
  5204. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5205. IF (procedureType.selfParameter # NIL) THEN
  5206. Emit(Push(position,operand.tag));
  5207. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5208. Emit(Push(position,operand.tag));
  5209. END;
  5210. ELSE HALT(200);
  5211. END;
  5212. ReleaseIntermediateOperand(operand.tag);
  5213. operand.tag := emptyOperand;
  5214. (* determine if a structured return type is needed *)
  5215. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5216. IF structuredReturnType THEN
  5217. IF resultDesignator # NIL THEN
  5218. d := resultDesignator;
  5219. ELSE
  5220. (* temporary result that might be allocated, must potentially be traced *)
  5221. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5222. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5223. d.SetType(variable.type);
  5224. END;
  5225. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5226. Designate(d,returnValue);
  5227. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5228. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5229. Emit(Push(position,size));
  5230. Emit(Push(position,returnValue.op));
  5231. ReleaseOperand(returnValue);
  5232. ELSE*)
  5233. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5234. (*
  5235. END;
  5236. *)
  5237. END;
  5238. firstWriteBackCall := NIL; (* reset write-back call list *)
  5239. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5240. parameterRegister := backend.GetParameterRegisters(procedureType.callingConvention);
  5241. IF parameterRegister = NIL THEN parameterRegisters := 0
  5242. ELSE parameterRegisters := LEN(parameterRegister)
  5243. END;
  5244. passByRegister := parameterRegisters > 0;
  5245. registerNumber := 0;
  5246. formalParameter := procedureType.lastParameter;
  5247. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5248. actualParameter := parameters.GetExpression(i);
  5249. PrepareParameter(actualParameter, formalParameter);
  5250. IF passByRegister & (i < parameterRegisters) THEN
  5251. IF ~PassInRegister(formalParameter) THEN
  5252. Error(actualParameter.position,"cannot be passed by register")
  5253. ELSE
  5254. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,parameterRegister[i]);
  5255. END;
  5256. INC(registerNumber);
  5257. ELSE
  5258. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5259. END;
  5260. formalParameter := formalParameter.prevParameter;
  5261. END;
  5262. IF passByRegister (* & (registerNumber > 0)*) & ~SysvABI(procedureType.callingConvention) THEN
  5263. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5264. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5265. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5266. END;
  5267. ELSE
  5268. hasDynamicOperands := FALSE;
  5269. formalParameter := procedureType.firstParameter;
  5270. FOR i := 0 TO parameters.Length() - 1 DO
  5271. actualParameter := parameters.GetExpression(i);
  5272. IF formalParameter # NIL THEN (* TENTATIVE *)
  5273. PrepareParameter(actualParameter, formalParameter);
  5274. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5275. ASSERT(i < 2);
  5276. hasDynamicOperands := TRUE;
  5277. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5278. ELSE
  5279. IF passByRegister & (registerNumber > 0) THEN
  5280. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5281. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5282. END;
  5283. passByRegister := FALSE;
  5284. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5285. END;
  5286. formalParameter := formalParameter.nextParameter;
  5287. END;
  5288. END;
  5289. END;
  5290. IF symbol IS SyntaxTree.Procedure THEN
  5291. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5292. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5293. Emit(Push(position,reg));
  5294. ReleaseIntermediateOperand(reg);
  5295. END;
  5296. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5297. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5298. parametersSize := ParametersSize(system,procedureType,FALSE);
  5299. END;
  5300. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5301. (*
  5302. dynamic operator overloading:
  5303. first push parameters, regularly:
  5304. [self]
  5305. par1
  5306. par2
  5307. then push parameters for GetOperator
  5308. identifier
  5309. ptr1
  5310. tag
  5311. ptr2
  5312. tag
  5313. call GetOperatorRuntimeProc
  5314. call Operator
  5315. *)
  5316. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5317. (* push ID *)
  5318. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5319. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5320. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5321. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5322. formalParameter := procedureType.firstParameter;
  5323. FOR i := 0 TO parameters.Length() - 1 DO
  5324. IF formalParameter.access # SyntaxTree.Hidden THEN
  5325. ASSERT(i < 2);
  5326. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5327. (* push pointer *)
  5328. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5329. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5330. (* add dereference *)
  5331. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5332. (*! better: do refer to stack above than using parameter backups !!*)
  5333. ReleaseIntermediateOperand(parameterBackups[i]);
  5334. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5335. END;
  5336. Emit(Push(position,parameterBackups[i]));
  5337. ReleaseIntermediateOperand(parameterBackups[i]);
  5338. (* push typetag *)
  5339. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5340. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5341. arg := TypeDescriptorAdr(recordType);
  5342. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5343. Emit(Push(position,arg));
  5344. ELSE
  5345. (* push 'NonPointer' *)
  5346. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5347. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5348. (* push fingerprint *)
  5349. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5350. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5351. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5352. END
  5353. END;
  5354. formalParameter := formalParameter.nextParameter
  5355. END;
  5356. (* for unary operators: complete the information for the second parameter *)
  5357. IF procedureType.numberParameters < 2 THEN
  5358. (* push 'NonPointer' *)
  5359. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5360. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5361. (* push 'NoType' *)
  5362. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5363. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5364. END;
  5365. (* call operator selection procedure *)
  5366. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5367. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5368. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5369. ReleaseOperand(operatorSelectionProcedureOperand);
  5370. (* use the address that the operator selection procedure returned as the target address of the call *)
  5371. InitOperand(operand, ModeValue);
  5372. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5373. Emit(Result(position,operand.op))
  5374. END
  5375. END;
  5376. ReleaseParameterRegisters();
  5377. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5378. SaveRegisters();ReleaseUsedRegisters(saved2);
  5379. CallThis(position,"Objects","LeaveA2",0);
  5380. RestoreRegisters(saved2);
  5381. END;
  5382. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR SysvABI(procedureType.callingConvention) THEN
  5383. Emit(Call(position,operand.op,0));
  5384. ELSE
  5385. Emit(Call(position,operand.op,parametersSize));
  5386. END;
  5387. ReleaseOperand(operand);
  5388. IF procedureType.noReturn THEN
  5389. EmitTrap(position,NoReturnTrap);
  5390. END;
  5391. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5392. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5393. Emit(Result(position,return));
  5394. END;
  5395. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5396. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5397. Emit(Push(position, return));
  5398. CallThis(position,"Objects","ReenterA2",0);
  5399. Emit(Pop(position, return));
  5400. ELSE
  5401. CallThis(position,"Objects","ReenterA2",0);
  5402. END;
  5403. END;
  5404. (* === return parameter space === *)
  5405. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5406. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5407. (* cleanup all space for all parameters *)
  5408. IF parametersSize < 32 THEN
  5409. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5410. parametersSize := 32
  5411. END;
  5412. size := IntermediateCode.Immediate(addressType,parametersSize);
  5413. Emit(Add(position,sp,sp,size))
  5414. END;
  5415. IF SysvABI(procedureType.callingConvention) THEN
  5416. IF passByRegister THEN
  5417. IF parameters.Length() > parameterRegisters THEN
  5418. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5419. ELSE
  5420. parametersSize := 0
  5421. END;
  5422. ELSE
  5423. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5424. INC( parametersSize, (-parametersSize) MOD 16 )
  5425. END;
  5426. IF parametersSize > 0 THEN
  5427. size := IntermediateCode.Immediate(addressType,parametersSize);
  5428. Emit(Add(position,sp,sp,size))
  5429. END;
  5430. END;
  5431. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5432. IF structuredReturnType THEN
  5433. (* stack pointer rewinding done by callee
  5434. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5435. Emit(Add(position,sp,sp,size));
  5436. *)
  5437. RestoreRegisters(saved);
  5438. InitOperand(result,ModeReference);
  5439. Symbol(variable,result);
  5440. ELSE
  5441. RestoreRegisters(saved);
  5442. InitOperand(result,ModeValue);
  5443. result.op := return;
  5444. END;
  5445. END;
  5446. IF alignment > 1 THEN
  5447. Emit(Pop(position,sp));
  5448. END;
  5449. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5450. Emit(Pop(position, ap));
  5451. END;
  5452. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5453. ValueToCondition(result);
  5454. END;
  5455. destination := dest;
  5456. (* perform all write-back calls in the list *)
  5457. BackupGlobalState;
  5458. currentWriteBackCall := firstWriteBackCall;
  5459. WHILE currentWriteBackCall # NIL DO
  5460. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5461. currentWriteBackCall := currentWriteBackCall.next
  5462. END;
  5463. RestoreGlobalState;
  5464. (* TENATIVE *)
  5465. (*
  5466. IF isOperatorCall THEN
  5467. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5468. END;
  5469. *)
  5470. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5471. END VisitProcedureCallDesignator;
  5472. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5473. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5474. td: SyntaxTree.Symbol;
  5475. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5476. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5477. BEGIN
  5478. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5479. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5480. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5481. variable.SetType(system.anyType);
  5482. scope.AddVariable(variable);
  5483. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5484. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5485. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5486. typeDeclaration.SetScope(module.module.moduleScope);
  5487. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5488. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5489. END;
  5490. RETURN hiddenPointerType;
  5491. END GetHiddenPointerType;
  5492. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5493. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5494. BEGIN
  5495. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5496. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5497. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5498. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5499. scope.AddVariable(variable);
  5500. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5501. variable.SetType(system.anyType);
  5502. scope.AddVariable(variable);
  5503. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5504. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5505. typeDeclaration.SetDeclaredType(delegatePointerType);
  5506. typeDeclaration.SetScope(module.module.moduleScope);
  5507. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5508. delegatePointerType.SetState(SyntaxTree.Resolved);
  5509. END;
  5510. RETURN delegatePointerType
  5511. END GetDelegateType;
  5512. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5513. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5514. such as in VAR a: RECORD ... END;
  5515. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5516. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5517. *)
  5518. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5519. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5520. BEGIN (* no code emission *)
  5521. source := NIL;
  5522. x := x.resolved;
  5523. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5524. x := GetHiddenPointerType();
  5525. ELSIF IsDelegate(x) THEN
  5526. x := GetDelegateType();
  5527. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5528. ELSE HALT(200);
  5529. END;
  5530. td := x.typeDeclaration;
  5531. IF td = NIL THEN
  5532. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5533. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5534. ASSERT(td # NIL);
  5535. END;
  5536. IF newObjectFile THEN
  5537. GetCodeSectionNameForSymbol(td,name);
  5538. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5539. meta.CheckTypeDeclaration(x);
  5540. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5541. ELSE
  5542. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5543. END;
  5544. IF backend.cooperative OR meta.simple THEN
  5545. offset := 0;
  5546. ELSE
  5547. IF x IS SyntaxTree.CellType THEN
  5548. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5549. IF baseRecord = NIL THEN
  5550. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5551. ELSE
  5552. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5553. END;
  5554. ELSE
  5555. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5556. END;
  5557. END;
  5558. ELSE
  5559. offset := 0;
  5560. source := module.allSections.FindBySymbol(td); (*TODO*)
  5561. IF source = NIL THEN
  5562. null := 0;
  5563. GetCodeSectionNameForSymbol(td,name);
  5564. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5565. Basic.SuffixSegmentedName (name, module.module.name);
  5566. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5567. IntermediateCode.InitImmediate(op,addressType,0);
  5568. source(IntermediateCode.Section).Emit(Data(position,op));
  5569. source.SetReferenced(FALSE)
  5570. ELSE
  5571. name := source.name;
  5572. END;
  5573. END;
  5574. RETURN td
  5575. END GetBackendType;
  5576. BEGIN
  5577. (*td := t.typeDeclaration;*)
  5578. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5579. (*
  5580. IF t IS SyntaxTree.PointerType THEN
  5581. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5582. ELSE
  5583. source := GetBackendType(t);
  5584. END;
  5585. *)
  5586. IF newObjectFile THEN
  5587. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5588. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5589. IntermediateCode.SetOffset(res,offset);
  5590. ELSE
  5591. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5592. END;
  5593. (*
  5594. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5595. make memory should be used when tag is used, not earlier
  5596. *)
  5597. RETURN res
  5598. END TypeDescriptorAdr;
  5599. (*
  5600. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5601. VAR result: IntermediateCode.Operand;
  5602. BEGIN
  5603. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5604. operand.tag := TypeDescriptorAdr(operand.type);
  5605. IntermediateCode.MakeMemory(operand.tag,addressType);
  5606. UseIntermediateOperand(operand.tag);
  5607. END;
  5608. END MakeTypeTag;
  5609. *)
  5610. PROCEDURE ProfilerInit;
  5611. VAR reg: IntermediateCode.Operand;
  5612. BEGIN
  5613. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5614. Emit(Call(position,reg,0));
  5615. END ProfilerInit;
  5616. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5617. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5618. BEGIN
  5619. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5620. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5621. THEN
  5622. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5623. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5624. Emit(Push(position,reg));
  5625. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5626. Emit(Push(position,reg));
  5627. StaticCallOperand(result,procedure);
  5628. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5629. ReleaseOperand(result);
  5630. END;
  5631. END ProfilerEnterExit;
  5632. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5633. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5634. BEGIN
  5635. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5636. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5637. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5638. profileInit.Emit(Push(position,reg));
  5639. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5640. profileInit.Emit(Push(position,reg));
  5641. NEW(string, LEN(name)); COPY(name, string^);
  5642. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5643. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5644. sv.SetType(type);
  5645. Designate(sv,result);
  5646. profileInit.Emit(Push(position,result.tag));
  5647. profileInit.Emit(Push(position,result.op));
  5648. StaticCallOperand(result,procedure);
  5649. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5650. ReleaseOperand(result);
  5651. END;
  5652. END ProfilerAddProcedure;
  5653. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5654. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5655. BEGIN
  5656. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5657. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5658. profileInit.Emit(Push(position,reg));
  5659. profileInitPatchPosition := profileInit.pc;
  5660. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5661. NEW(string, LEN(name)); COPY(name, string^);
  5662. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5663. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5664. sv.SetType(type);
  5665. Designate(sv,result);
  5666. profileInit.Emit(Push(position,result.tag));
  5667. profileInit.Emit(Push(position,result.op));
  5668. StaticCallOperand(result,procedure);
  5669. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5670. ReleaseOperand(result);
  5671. END;
  5672. END ProfilerAddModule;
  5673. PROCEDURE ProfilerPatchInit;
  5674. VAR reg: IntermediateCode.Operand;
  5675. BEGIN
  5676. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5677. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5678. EmitLeave(profileInit,position,NIL,0);
  5679. profileInit.Emit(Exit(position,0,0,0));
  5680. END ProfilerPatchInit;
  5681. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5682. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5683. VAR
  5684. id: LONGINT;
  5685. leftType, rightType: SyntaxTree.Type;
  5686. procedureType: SyntaxTree.ProcedureType;
  5687. runtimeProcedure: SyntaxTree.Procedure;
  5688. runtimeProcedureOperand, operatorOperand: Operand;
  5689. kind: SET;
  5690. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5691. VAR
  5692. arg: IntermediateCode.Operand;
  5693. recordType: SyntaxTree.RecordType;
  5694. fingerPrint: SyntaxTree.FingerPrint;
  5695. BEGIN
  5696. IF type = NIL THEN
  5697. (* no type: push 'NoType' *)
  5698. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5699. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5700. ELSIF IsStrictlyPointerToRecord(type) THEN
  5701. (* pointer to record type: push typetag *)
  5702. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5703. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5704. arg := TypeDescriptorAdr(recordType);
  5705. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5706. ELSE
  5707. (* non-pointer to record type: push fingerprint *)
  5708. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5709. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5710. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5711. END;
  5712. operatorInitializationCodeSection.Emit(Push(position,arg))
  5713. END PushTypeInfo;
  5714. BEGIN
  5715. ASSERT(operatorInitializationCodeSection # NIL);
  5716. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5717. procedureType := operator.type(SyntaxTree.ProcedureType);
  5718. (* determine types *)
  5719. leftType := procedureType.firstParameter.type;
  5720. IF procedureType.numberParameters = 2 THEN
  5721. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5722. rightType := procedureType.firstParameter.nextParameter.type;
  5723. ELSE
  5724. rightType := NIL
  5725. END;
  5726. (* determine operator kind *)
  5727. IF IsStrictlyPointerToRecord(leftType) THEN
  5728. kind := {LhsIsPointer}
  5729. ELSE
  5730. kind := {}
  5731. END;
  5732. IF IsStrictlyPointerToRecord(rightType) THEN
  5733. kind := kind + {RhsIsPointer}
  5734. END;
  5735. IF kind # {} THEN (* TODO: to be removed later on *)
  5736. (* at least one of the types is a pointer to record *)
  5737. (* emit a code that registers this specific operator in the runtime *)
  5738. dump := operatorInitializationCodeSection.comments;
  5739. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5740. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5741. (* push ID *)
  5742. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5743. id := Global.GetSymbol(module.module.case, operator.name);
  5744. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5745. (* push kind *)
  5746. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5747. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5748. (* push type infos *)
  5749. PushTypeInfo(leftType);
  5750. PushTypeInfo(rightType);
  5751. (* push operator address *)
  5752. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5753. StaticCallOperand(operatorOperand, operator);
  5754. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5755. ReleaseOperand(operatorOperand);
  5756. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5757. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5758. ReleaseOperand(runtimeProcedureOperand)
  5759. END
  5760. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5761. END
  5762. END RegisterDynamicOperator;
  5763. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5764. VAR
  5765. traceModule: SyntaxTree.Module;
  5766. procedure: SyntaxTree.Procedure;
  5767. procedureVariable: SyntaxTree.Variable;
  5768. s,msg: Basic.MessageString;
  5769. res: Operand;
  5770. i: LONGINT;
  5771. sv: SyntaxTree.StringValue;
  5772. type: SyntaxTree.Type;
  5773. recordType: SyntaxTree.RecordType;
  5774. printout: Printout.Printer;
  5775. stringWriter: Streams.StringWriter;
  5776. expression: SyntaxTree.Expression;
  5777. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5778. BEGIN
  5779. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5780. IF procedure = NIL THEN
  5781. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5782. END;
  5783. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5784. s := "procedure ";
  5785. Strings.Append(s,backend.traceModuleName);
  5786. Strings.Append(s,".");
  5787. Strings.Append(s,procedureName);
  5788. Strings.Append(s," not present");
  5789. Error(position,s);
  5790. RETURN FALSE
  5791. ELSE
  5792. RETURN TRUE
  5793. END;
  5794. END GetProcedure;
  5795. PROCEDURE CallProcedure;
  5796. VAR size: LONGINT;
  5797. BEGIN
  5798. IF procedure # NIL THEN
  5799. StaticCallOperand(result,procedure);
  5800. size := ProcedureParametersSize(system,procedure);
  5801. ELSE
  5802. Symbol(procedureVariable, result);
  5803. LoadValue(result, procedureVariable.type.resolved);
  5804. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5805. END;
  5806. Emit(Call(position,result.op,size));
  5807. END CallProcedure;
  5808. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5809. VAR res: Operand; string: SyntaxTree.String;
  5810. BEGIN
  5811. IF GetProcedure("String") THEN
  5812. NEW(string, LEN(s)); COPY(s, string^);
  5813. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5814. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5815. sv.SetType(type);
  5816. Designate(sv,res);
  5817. Emit(Push(position,res.tag));
  5818. Emit(Push(position,res.op));
  5819. ReleaseOperand(res);
  5820. CallProcedure;
  5821. END;
  5822. END String;
  5823. PROCEDURE Integer(op: IntermediateCode.Operand);
  5824. BEGIN
  5825. IF GetProcedure("Int") THEN
  5826. Emit(Push(position,op));
  5827. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5828. CallProcedure;
  5829. END;
  5830. END Integer;
  5831. PROCEDURE Float(op: IntermediateCode.Operand);
  5832. BEGIN
  5833. IF GetProcedure("HIntHex") THEN
  5834. Emit(Push(position,op));
  5835. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5836. CallProcedure;
  5837. END;
  5838. END Float;
  5839. PROCEDURE Set(op: IntermediateCode.Operand);
  5840. BEGIN
  5841. IF GetProcedure("Set") THEN
  5842. Emit(Push(position,op));
  5843. (*
  5844. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5845. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5846. *)
  5847. CallProcedure;
  5848. END;
  5849. END Set;
  5850. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5851. BEGIN
  5852. IF GetProcedure("Boolean") THEN
  5853. Emit(Push(position,op));
  5854. CallProcedure;
  5855. END;
  5856. END Boolean;
  5857. PROCEDURE Char(op: IntermediateCode.Operand);
  5858. BEGIN
  5859. IF GetProcedure("Char") THEN
  5860. Emit(Push(position,op));
  5861. CallProcedure;
  5862. END;
  5863. END Char;
  5864. PROCEDURE Address(op: IntermediateCode.Operand);
  5865. BEGIN
  5866. IF GetProcedure("Address") THEN
  5867. Emit(Push(position,op));
  5868. CallProcedure;
  5869. END;
  5870. END Address;
  5871. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  5872. VAR len: IntermediateCode.Operand;
  5873. BEGIN
  5874. IF GetProcedure("String") THEN
  5875. len := GetArrayLength(type, op.tag);
  5876. Emit(Push(position,len));
  5877. ReleaseIntermediateOperand(len);
  5878. Emit(Push(position,op.op));
  5879. CallProcedure;
  5880. END;
  5881. END StringOperand;
  5882. PROCEDURE Ln;
  5883. BEGIN
  5884. IF GetProcedure("Ln") THEN
  5885. CallProcedure;
  5886. END;
  5887. END Ln;
  5888. BEGIN
  5889. IF backend.traceModuleName = "" THEN RETURN END;
  5890. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5891. IF GetProcedure("Enter") THEN
  5892. CallProcedure
  5893. END;
  5894. NEW(stringWriter,LEN(s));
  5895. FOR i := 0 TO x.Length()-1 DO
  5896. msg := "";
  5897. expression := x.GetExpression(i);
  5898. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5899. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5900. ELSE
  5901. Global.GetModuleName(module.module, s);
  5902. END;
  5903. IF i = 0 THEN
  5904. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  5905. stringWriter.String(":");
  5906. END;
  5907. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5908. IF ~(expression IS SyntaxTree.StringValue) THEN
  5909. printout.Expression(expression);
  5910. stringWriter.Get(s);
  5911. Strings.Append(msg,s);
  5912. Strings.Append(msg,"= ");
  5913. ELSE stringWriter.Get(s); (* remove from string writer *)
  5914. Strings.Append(msg, s);
  5915. END;
  5916. String(msg);
  5917. IF SemanticChecker.IsStringType(expression.type) THEN
  5918. Designate(expression,res);
  5919. StringOperand(res, expression.type);
  5920. ELSE
  5921. Evaluate(expression,res);
  5922. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5923. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5924. Convert(res.op,int64);
  5925. END;
  5926. Integer(res.op);
  5927. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5928. Boolean(res.op);
  5929. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5930. Set(res.op);
  5931. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5932. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5933. Convert(res.op,float64);
  5934. END;
  5935. Float(res.op);
  5936. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5937. Char(res.op);
  5938. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5939. Address(res.op);String("H");
  5940. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5941. Address(res.op);String("H");
  5942. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5943. Address(res.op);String("H");
  5944. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5945. Address(res.op);String("H");
  5946. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5947. String("NIL");
  5948. ELSE HALT(200);
  5949. END;
  5950. END;
  5951. ReleaseOperand(res);
  5952. String("; ");
  5953. END;
  5954. IF GetProcedure("Exit") THEN
  5955. CallProcedure
  5956. ELSE
  5957. Ln;
  5958. END;
  5959. END;
  5960. END SystemTrace;
  5961. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5962. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5963. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5964. BEGIN
  5965. type := type.resolved;
  5966. IF type IS SyntaxTree.RecordType THEN
  5967. WITH type: SyntaxTree.RecordType DO
  5968. baseType := type.baseType;
  5969. IF baseType # NIL THEN
  5970. baseType := baseType.resolved;
  5971. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5972. InitFields(baseType,adr,offset);
  5973. END;
  5974. variable := type.recordScope.firstVariable;
  5975. WHILE variable # NIL DO
  5976. IF variable.initializer # NIL THEN
  5977. Evaluate(variable.initializer,initializerOp);
  5978. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5979. Emit(Mov(position,mem,initializerOp.op));
  5980. ReleaseOperand(initializerOp);
  5981. ReleaseIntermediateOperand(mem);
  5982. END;
  5983. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5984. variable := variable.nextVariable
  5985. END;
  5986. END;
  5987. ELSIF type IS SyntaxTree.CellType THEN
  5988. WITH type: SyntaxTree.CellType DO
  5989. baseType := type.baseType;
  5990. IF baseType # NIL THEN
  5991. baseType := baseType.resolved;
  5992. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5993. InitFields(baseType,adr,offset);
  5994. END;
  5995. variable := type.cellScope.firstVariable;
  5996. WHILE variable # NIL DO
  5997. IF variable.initializer # NIL THEN
  5998. Evaluate(variable.initializer,initializerOp);
  5999. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6000. Emit(Mov(position,mem,initializerOp.op));
  6001. ReleaseOperand(initializerOp);
  6002. ReleaseIntermediateOperand(mem);
  6003. END;
  6004. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6005. variable := variable.nextVariable
  6006. END;
  6007. END;
  6008. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6009. WITH type: SyntaxTree.ArrayType DO
  6010. IF type.form = SyntaxTree.Static THEN
  6011. baseType := type.arrayBase;
  6012. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6013. FOR i := 0 TO type.staticLength-1 DO
  6014. InitFields(baseType,adr,offset+i*size);
  6015. END;
  6016. END;
  6017. END;
  6018. ELSIF type IS SyntaxTree.MathArrayType THEN
  6019. WITH type: SyntaxTree.MathArrayType DO
  6020. IF type.form = SyntaxTree.Open THEN
  6021. dim := DynamicDim(type);
  6022. imm := IntermediateCode.Immediate(addressType,dim);
  6023. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6024. baseType := SemanticChecker.ArrayBase(type,dim);
  6025. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6026. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6027. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6028. ReleaseIntermediateOperand(imm);
  6029. (* flags remain empty (=0) for open array *)
  6030. ELSIF type.form = SyntaxTree.Static THEN
  6031. baseType := type.arrayBase;
  6032. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6033. ASSERT(type.staticLength < 1024*1024*1024);
  6034. FOR i := 0 TO type.staticLength-1 DO
  6035. InitFields(baseType,adr,offset+i*size);
  6036. END;
  6037. END;
  6038. END;
  6039. END;
  6040. END InitFields;
  6041. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6042. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6043. BEGIN
  6044. type := variable.type.resolved;
  6045. IF (type IS SyntaxTree.MathArrayType) THEN
  6046. WITH type: SyntaxTree.MathArrayType DO
  6047. IF type.form = SyntaxTree.Open THEN
  6048. Symbol(variable,operand);
  6049. InitFields(type, operand.tag,0);
  6050. IF temporary THEN
  6051. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6052. END;
  6053. ELSIF type.form = SyntaxTree.Tensor THEN
  6054. Symbol(variable, operand);
  6055. MakeMemory(tmp,operand.op,addressType,0);
  6056. ReleaseOperand(operand);
  6057. IF temporary THEN
  6058. (* trick -- temporary object from array base *)
  6059. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6060. Symbol(symbol,operand);
  6061. MakeMemory(mem,operand.op,addressType,0);
  6062. ReleaseOperand(operand);
  6063. Emit(Mov(position,tmp, mem) );
  6064. ReleaseOperand(operand);
  6065. ELSE
  6066. Emit(Mov(position,tmp, nil ) );
  6067. END;
  6068. ReleaseIntermediateOperand(tmp);
  6069. END;
  6070. END;
  6071. ELSE
  6072. Symbol(variable,operand);
  6073. IF variable.initializer # NIL THEN
  6074. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6075. reference.SetType(variable.type.resolved);
  6076. reference.SetAssignable(TRUE);
  6077. Assign(reference,variable.initializer);
  6078. ELSIF temporary THEN
  6079. IF SemanticChecker.IsPointerType(variable.type) THEN
  6080. Symbol(variable, operand);
  6081. MakeMemory(tmp,operand.op,addressType,0);
  6082. ReleaseOperand(operand);
  6083. Emit(Mov(position,tmp, nil ) );
  6084. ReleaseIntermediateOperand(tmp);
  6085. END;
  6086. END;
  6087. InitFields(type, operand.op,0);
  6088. ReleaseOperand(operand);
  6089. END;
  6090. END InitVariable;
  6091. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6092. VAR end: Label;
  6093. BEGIN
  6094. IF type.form = SyntaxTree.Tensor THEN
  6095. InitOperand(result,ModeValue);
  6096. ReuseCopy(result.op,base);
  6097. end := NewLabel();
  6098. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6099. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6100. SetLabel(end);
  6101. Convert(result.op,lenType);
  6102. ELSE
  6103. InitOperand(result,ModeValue);
  6104. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6105. END
  6106. END MathArrayDim;
  6107. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6108. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6109. BEGIN
  6110. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6111. MakeMemory(mem,base,addressType,offset);
  6112. Emit(Mov(position,mem,value));
  6113. ReleaseIntermediateOperand(mem);
  6114. END PutMathArrayField;
  6115. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6116. VAR mem: IntermediateCode.Operand;
  6117. BEGIN
  6118. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6119. MakeMemory(mem,base,addressType,offset);
  6120. Emit(Mov(position,mem,value));
  6121. ReleaseIntermediateOperand(mem);
  6122. END PutMathArrayFieldOffset;
  6123. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6124. BEGIN
  6125. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6126. MakeMemory(value,base,addressType,offset);
  6127. END GetMathArrayField;
  6128. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6129. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6130. BEGIN
  6131. IF incr THEN
  6132. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6133. ELSE
  6134. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6135. END;
  6136. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6137. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6138. ELSE
  6139. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6140. Emit(Mov(position,reg,dim));
  6141. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6142. Emit(Add(position,reg,reg,base));
  6143. MakeMemory(mem, reg, addressType, offset);
  6144. ReleaseIntermediateOperand(reg);
  6145. Emit(Mov(position,mem,value));
  6146. ReleaseIntermediateOperand(mem);
  6147. END;
  6148. END PutMathArrayLenOrIncr;
  6149. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6150. BEGIN
  6151. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6152. END PutMathArrayLength;
  6153. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6154. BEGIN
  6155. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6156. END PutMathArrayIncrement;
  6157. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6158. BEGIN
  6159. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6160. END GetMathArrayIncrement;
  6161. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6162. BEGIN
  6163. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6164. END GetMathArrayLength;
  6165. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6166. VAR dimOp: IntermediateCode.Operand;
  6167. BEGIN
  6168. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6169. GetMathArrayLength(type, operand, dimOp, check, result);
  6170. END GetMathArrayLengthAt;
  6171. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6172. VAR dimOp: IntermediateCode.Operand;
  6173. BEGIN
  6174. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6175. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6176. END GetMathArrayIncrementAt;
  6177. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6178. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6179. offset: LONGINT;
  6180. BEGIN
  6181. IF increment THEN
  6182. offset := MathIncrOffset;
  6183. ELSE
  6184. offset := MathLenOffset;
  6185. END;
  6186. INC(offset,operand.dimOffset*2);
  6187. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6188. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6189. END;
  6190. (* static dimension *)
  6191. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6192. IF check & (type.form = SyntaxTree.Tensor) THEN
  6193. DimensionCheck(operand.tag,dim,BrltL);
  6194. END;
  6195. val := SHORT(dim.intValue);
  6196. IF type.form # SyntaxTree.Tensor THEN
  6197. t := SemanticChecker.ArrayBase(type,val);
  6198. type := t.resolved(SyntaxTree.MathArrayType);
  6199. IF type.form = SyntaxTree.Static THEN
  6200. IF increment THEN
  6201. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6202. ELSE
  6203. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6204. END;
  6205. InitOperand(result,ModeValue);
  6206. result.op := res;
  6207. RETURN;
  6208. END;
  6209. END;
  6210. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6211. MakeMemory(res,operand.tag,addressType,offset);
  6212. (*
  6213. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6214. *)
  6215. InitOperand(result,ModeValue);
  6216. result.op := res;
  6217. ELSE
  6218. Convert(dim,addressType);
  6219. IF check THEN
  6220. IF type.form = SyntaxTree.Tensor THEN
  6221. DimensionCheck(operand.tag,dim,BrltL);
  6222. ELSIF isUnchecked THEN (* do nothing *)
  6223. ELSE
  6224. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6225. END;
  6226. END;
  6227. end := NewLabel(); next := NIL;
  6228. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6229. Emit(Mov(position,res,dim));
  6230. Convert(res,sizeType);
  6231. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6232. WHILE t IS SyntaxTree.MathArrayType DO
  6233. type := t(SyntaxTree.MathArrayType);
  6234. IF type.form = SyntaxTree.Static THEN
  6235. imm := IntermediateCode.Immediate(sizeType,val);
  6236. next := NewLabel();
  6237. BrneL(next,imm,res);
  6238. IF increment THEN
  6239. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6240. ELSE
  6241. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6242. END;
  6243. Emit(MovReplace(position,res,imm));
  6244. BrL(end);
  6245. ELSE hasDynamicPart := TRUE;
  6246. END;
  6247. t := type.arrayBase.resolved;
  6248. val := val + 1;
  6249. IF next # NIL THEN SetLabel(next) END;
  6250. END;
  6251. IF hasDynamicPart THEN
  6252. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6253. Emit(Mov(position,res2,dim));
  6254. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6255. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6256. Emit(Add(position,res2,res2,imm));
  6257. Emit(Add(position,res2,res2,operand.tag));
  6258. IntermediateCode.MakeMemory(res2,sizeType);
  6259. Emit(MovReplace(position,res,res2));
  6260. ReleaseIntermediateOperand(res2);
  6261. END;
  6262. SetLabel(end);
  6263. Convert(res,sizeType);
  6264. InitOperand(result,ModeValue);
  6265. result.op := res;
  6266. END;
  6267. END MathArrayLenOrIncr;
  6268. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6269. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6270. offset: LONGINT;
  6271. BEGIN
  6272. offset := operand.dimOffset+DynamicDim(type)-1;
  6273. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6274. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6275. val := SHORT(dim.intValue);
  6276. t := SemanticChecker.ArrayBase(type,val);
  6277. type := t.resolved(SyntaxTree.ArrayType);
  6278. IF type.form = SyntaxTree.Static THEN
  6279. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6280. ELSE
  6281. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6282. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6283. END;
  6284. UseIntermediateOperand(res);
  6285. InitOperand(result,ModeValue);
  6286. result.op := res;
  6287. ELSE
  6288. Convert(dim,addressType);
  6289. IF ~isUnchecked THEN
  6290. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6291. END;
  6292. end := NewLabel(); next := NIL;
  6293. (* ReuseCopy(dim,res); *)
  6294. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6295. Emit(Mov(position,res,dim));
  6296. Convert(res,sizeType);
  6297. Convert(res,sizeType);
  6298. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6299. WHILE t IS SyntaxTree.ArrayType DO
  6300. type := t(SyntaxTree.ArrayType);
  6301. IF type.form = SyntaxTree.Static THEN
  6302. imm := IntermediateCode.Immediate(sizeType,val);
  6303. next := NewLabel();
  6304. BrneL(next,imm,res);
  6305. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6306. Emit(MovReplace(position,res,imm));
  6307. BrL(end);
  6308. ELSE hasDynamicPart := TRUE;
  6309. END;
  6310. t := type.arrayBase.resolved;
  6311. val := val + 1;
  6312. IF next # NIL THEN SetLabel(next) END;
  6313. END;
  6314. IF hasDynamicPart THEN
  6315. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6316. Convert(res2,addressType);
  6317. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6318. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6319. Emit(Sub(position,res2,imm,res2));
  6320. Emit(Add(position,res2,res2,operand.tag));
  6321. IntermediateCode.MakeMemory(res2,sizeType);
  6322. Emit(MovReplace(position,res,res2));
  6323. ReleaseIntermediateOperand(res2);
  6324. END;
  6325. SetLabel(end);
  6326. Convert(res,sizeType);
  6327. InitOperand(result,ModeValue);
  6328. result.op := res;
  6329. END;
  6330. END ArrayLen;
  6331. (**
  6332. create a temporary variable in current scope
  6333. **)
  6334. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6335. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6336. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6337. BEGIN
  6338. IF ~register THEN
  6339. v := temporaries.GetFreeVariable(type, untraced, index);
  6340. ELSE
  6341. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6342. END;
  6343. scope := currentScope;
  6344. (*
  6345. variable := NIL; (* disable free variable managemenet for the time being -- does not work *)
  6346. *)
  6347. name := temporaries.GetUID();
  6348. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6349. variable.SetType(type);
  6350. variable.SetAccess(SyntaxTree.Hidden);
  6351. variable.SetUntraced(untraced);
  6352. IF v = NIL THEN
  6353. temporaries.AddVariable(variable);
  6354. IF ~register THEN
  6355. IF scope.lastVariable # NIL THEN
  6356. offset := scope.lastVariable.offsetInBits;
  6357. ELSE
  6358. offset := 0;
  6359. END;
  6360. DEC(offset,system.SizeOf(variable.type));
  6361. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6362. variable(SyntaxTree.Variable).SetOffset(offset);
  6363. scope.AddVariable(variable(SyntaxTree.Variable));
  6364. scope.EnterSymbol(variable, duplicate);
  6365. ASSERT(~duplicate);
  6366. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6367. ELSE
  6368. variable.SetUseRegister(TRUE);
  6369. variable(SyntaxTree.Variable).SetOffset(0);
  6370. END;
  6371. ELSE (* v # NIL *)
  6372. (* reuse slot for new variable, do not create new slot ! *)
  6373. temporaries.SetVariable(index, variable);
  6374. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6375. ASSERT(~register);
  6376. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6377. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6378. scope.EnterSymbol(variable, duplicate);
  6379. ASSERT(~duplicate);
  6380. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6381. END;
  6382. RETURN variable(SyntaxTree.Variable)
  6383. END GetTemporaryVariable;
  6384. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6385. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6386. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6387. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6388. i: LONGINT; duplicate: BOOLEAN;
  6389. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6390. VAR variable: SyntaxTree.Variable;
  6391. BEGIN
  6392. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6393. variable.SetType(type);
  6394. recordScope.AddVariable(variable);
  6395. END AddVariable;
  6396. BEGIN
  6397. name := "@ArrayDescriptor";
  6398. Basic.AppendNumber(name,dimensions);
  6399. identifier := SyntaxTree.NewIdentifier(name);
  6400. parentScope := module.module.moduleScope;
  6401. symbol := parentScope.FindSymbol(identifier);
  6402. IF symbol # NIL THEN
  6403. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6404. type := typeDeclaration.declaredType;
  6405. ELSE
  6406. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6407. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6408. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6409. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6410. recordType.SetTypeDeclaration(typeDeclaration);
  6411. recordType.SetState(SyntaxTree.Resolved);
  6412. typeDeclaration.SetDeclaredType(recordType);
  6413. AddVariable("@ptr",system.anyType);
  6414. AddVariable("@adr",system.addressType);
  6415. AddVariable("@flags",system.addressType);
  6416. AddVariable("@dim",system.addressType);
  6417. AddVariable("@elementSize",system.addressType);
  6418. FOR i := 0 TO dimensions-1 DO
  6419. name := "@len";
  6420. Basic.AppendNumber(name,i);
  6421. AddVariable(name,system.addressType);
  6422. name := "@incr";
  6423. Basic.AppendNumber(name,i);
  6424. AddVariable(name,system.addressType);
  6425. END;
  6426. parentScope.AddTypeDeclaration(typeDeclaration);
  6427. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6428. ASSERT(~duplicate);
  6429. type := recordType;
  6430. END;
  6431. RETURN type
  6432. END GetMathArrayDescriptorType;
  6433. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6434. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6435. BEGIN
  6436. type := GetMathArrayDescriptorType(dimensions);
  6437. Emit(Push(position,op.op));
  6438. (* push type descriptor *)
  6439. reg := TypeDescriptorAdr(type);
  6440. IF ~newObjectFile THEN
  6441. IntermediateCode.MakeMemory(reg,addressType);
  6442. END;
  6443. Emit(Push(position,reg));
  6444. ReleaseIntermediateOperand(reg);
  6445. (* push realtime flag: false by default *)
  6446. Emit(Push(position,false));
  6447. CallThis(position,"Heaps","NewRec",3);
  6448. END NewMathArrayDescriptor;
  6449. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6450. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6451. BEGIN
  6452. NEW(string, LEN(s)); COPY(s, string^);
  6453. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6454. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6455. sv.SetType(type);
  6456. Designate(sv,res);
  6457. Emit(Push(position,res.tag));
  6458. Emit(Push(position,res.op));
  6459. ReleaseOperand(res);
  6460. END PushConstString;
  6461. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6462. BEGIN
  6463. IF b THEN
  6464. Emit(Push(Basic.invalidPosition, true));
  6465. ELSE
  6466. Emit(Push(Basic.invalidPosition, false));
  6467. END;
  6468. END PushConstBoolean;
  6469. PROCEDURE PushConstSet(v: SET);
  6470. VAR value: SyntaxTree.Value; op: Operand;
  6471. BEGIN
  6472. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6473. value.SetType(system.setType);
  6474. Evaluate(value, op);
  6475. Emit(Push(Basic.invalidPosition, op.op));
  6476. ReleaseOperand(op);
  6477. END PushConstSet;
  6478. PROCEDURE PushConstInteger(v: LONGINT);
  6479. VAR value: SyntaxTree.Value; op: Operand;
  6480. BEGIN
  6481. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6482. value.SetType(system.longintType);
  6483. Evaluate(value, op);
  6484. Emit(Push(Basic.invalidPosition, op.op));
  6485. ReleaseOperand(op);
  6486. END PushConstInteger;
  6487. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6488. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6489. section: IntermediateCode.Section;
  6490. BEGIN
  6491. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6492. Global.GetSymbolSegmentedName(symbol, name);
  6493. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6494. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6495. procedure.SetScope(moduleScope);
  6496. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6497. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6498. procedure.SetAccess(SyntaxTree.Hidden);
  6499. currentScope := procedureScope;
  6500. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6501. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6502. RETURN section;
  6503. END OpenInitializer;
  6504. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6505. BEGIN
  6506. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6507. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6508. section := prev;
  6509. END CloseInitializer;
  6510. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6511. VAR name: SyntaxTree.IdentifierString;
  6512. variable: SyntaxTree.Variable;
  6513. parameter: SyntaxTree.Parameter;
  6514. type: SyntaxTree.Type;
  6515. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6516. BEGIN
  6517. InitOperand(op,ModeReference);
  6518. op.op := fp;
  6519. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6520. Dereference(op, x, FALSE);
  6521. result := op;
  6522. Symbol(symbol, op);
  6523. END Field;
  6524. PROCEDURE Direction(direction: LONGINT): SET;
  6525. BEGIN
  6526. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6527. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6528. ELSE HALT(100);
  6529. END;
  6530. END Direction;
  6531. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6532. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6533. BEGIN
  6534. Field(port, op);
  6535. ToMemory(op.op,addressType,0);
  6536. Emit(Push(Basic.invalidPosition, op.op));
  6537. ReleaseOperand(op);
  6538. Basic.GetString(modifier.identifier, name);
  6539. PushConstString(name);
  6540. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6541. ASSERT(SemanticChecker.IsStringType(value.type));
  6542. Designate(value, op);
  6543. Emit(Push(modifier.position, op.tag));
  6544. Emit(Push(modifier.position, op.op));
  6545. ReleaseOperand(op);
  6546. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6547. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6548. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6549. Evaluate(value, op);
  6550. Emit(Push(modifier.position, op.op));
  6551. ReleaseOperand(op);
  6552. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6553. ELSE
  6554. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6555. END;
  6556. END AddPortProperty;
  6557. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6558. VAR modifier: SyntaxTree.Modifier;
  6559. BEGIN
  6560. modifier := parameter.modifiers;
  6561. WHILE modifier # NIL DO
  6562. AddPortProperty(parameter,modifier, modifier.expression);
  6563. modifier := modifier.nextModifier;
  6564. END;
  6565. END AddPortProperties;
  6566. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6567. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6568. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6569. PROCEDURE PushLens(type: SyntaxTree.Type);
  6570. BEGIN
  6571. IF IsSemiDynamicArray(type) THEN
  6572. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6573. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6574. Emit(Push(Basic.invalidPosition, op.op));
  6575. ReleaseOperand(op);
  6576. INC(dim);
  6577. ELSIF IsStaticArray(type) THEN
  6578. len := len * type(SyntaxTree.ArrayType).staticLength;
  6579. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6580. INC(dim);
  6581. ELSE
  6582. baseType := type;
  6583. END;
  6584. END PushLens;
  6585. BEGIN
  6586. (* cell *)
  6587. IF parameter.type IS SyntaxTree.ArrayType THEN
  6588. type := parameter.type;
  6589. dim := 0;
  6590. len := 1;
  6591. PushLens(type);
  6592. portType := baseType.resolved(SyntaxTree.PortType);
  6593. ELSE
  6594. portType := parameter.type(SyntaxTree.PortType);
  6595. END;
  6596. PushSelfPointer();
  6597. (* port / array of ports *)
  6598. IF IsStaticArray(type) THEN
  6599. PushConstInteger(len);
  6600. END;
  6601. Field(parameter, op);
  6602. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6603. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6604. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6605. Designate(d, op);*)
  6606. Emit(Push(Basic.invalidPosition, op.op));
  6607. ReleaseOperand(op);
  6608. (* name *)
  6609. PushConstString(name);
  6610. (* inout *)
  6611. PushConstSet(Direction(portType.direction));
  6612. (* width *)
  6613. PushConstInteger(portType.sizeInBits);
  6614. IF parameter.type IS SyntaxTree.PortType THEN
  6615. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6616. AddPortProperties(parameter);
  6617. ELSIF IsStaticArray(type)THEN
  6618. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6619. ELSIF IsSemiDynamicArray(type) THEN
  6620. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6621. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6622. Emit(Add(position,reg, sp, size));
  6623. (* dim *)
  6624. PushConstInteger(dim);
  6625. (* len array *)
  6626. Emit(Push(position, reg));
  6627. ReleaseIntermediateOperand(reg);
  6628. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6629. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6630. Emit(Add(position, sp,sp, size));
  6631. ELSE
  6632. HALT(100);
  6633. END;
  6634. END Parameter;
  6635. BEGIN
  6636. IF backend.cellsAreObjects THEN
  6637. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6638. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6639. END;
  6640. parameter := x.firstParameter;
  6641. WHILE (parameter # NIL) DO
  6642. type := parameter.type.resolved;
  6643. WHILE (type IS SyntaxTree.ArrayType) DO
  6644. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6645. END;
  6646. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6647. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6648. Parameter(name,parameter);
  6649. END;
  6650. parameter := parameter.nextParameter;
  6651. END;
  6652. ELSE HALT(200)
  6653. END;
  6654. END AddPorts;
  6655. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6656. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6657. BEGIN
  6658. Symbol(cell,op);
  6659. ToMemory(op.op,addressType,0);
  6660. Emit(Push(position,op.op));
  6661. ReleaseOperand(op);
  6662. property.GetName(name);
  6663. (* does not work when inheritance is used:
  6664. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6665. *)
  6666. PushConstString(name);
  6667. IF (value # NIL) THEN
  6668. ASSERT(
  6669. SemanticChecker.IsStringType(property.type)
  6670. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6671. OR (property.type.resolved IS SyntaxTree.FloatType)
  6672. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6673. OR (property.type.resolved IS SyntaxTree.SetType)
  6674. );
  6675. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6676. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6677. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6678. Designate(d, op);
  6679. IF SemanticChecker.IsStringType(property.type) THEN
  6680. Emit(Push(Basic.invalidPosition, op.tag))
  6681. END;
  6682. Emit(Push(Basic.invalidPosition, op.op));
  6683. ReleaseOperand(op);
  6684. END;
  6685. IF value = NIL THEN
  6686. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6687. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6688. ASSERT(SemanticChecker.IsStringType(value.type));
  6689. Designate(value, op);
  6690. PushString(op, value.type);
  6691. ReleaseOperand(op);
  6692. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6693. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6694. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6695. Evaluate(value, op);
  6696. Emit(Push(property.position, op.op));
  6697. ReleaseOperand(op);
  6698. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6699. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6700. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6701. Evaluate(value, op);
  6702. Emit(Push(property.position, op.op));
  6703. ReleaseOperand(op);
  6704. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6705. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6706. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6707. Evaluate(value, op);
  6708. Emit(Push(property.position, op.op));
  6709. ReleaseOperand(op);
  6710. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6711. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6712. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6713. Evaluate(value, op);
  6714. Emit(Push(property.position, op.op));
  6715. ReleaseOperand(op);
  6716. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6717. ELSE
  6718. HALT(200);
  6719. END;
  6720. END AddProperty;
  6721. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6722. VAR symbol: SyntaxTree.Symbol;
  6723. BEGIN
  6724. WHILE modifier # NIL DO
  6725. symbol := cellType.FindProperty(modifier.identifier);
  6726. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6727. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6728. modifier := modifier.nextModifier;
  6729. END;
  6730. END AddModifiers;
  6731. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6732. VAR last: SyntaxTree.Modifier;
  6733. BEGIN
  6734. IF to = NIL THEN
  6735. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6736. ELSE
  6737. last := to;
  6738. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6739. last := last.nextModifier;
  6740. END;
  6741. IF last.identifier # this.identifier THEN
  6742. ASSERT(last.nextModifier = NIL);
  6743. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6744. END;
  6745. END;
  6746. END AppendModifier;
  6747. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6748. BEGIN
  6749. WHILE this # NIL DO
  6750. AppendModifier(to, this);
  6751. this := this.nextModifier;
  6752. END;
  6753. END AppendModifiers;
  6754. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6755. VAR base: SyntaxTree.Type;
  6756. BEGIN
  6757. AppendModifiers(to, c.modifiers);
  6758. base := c.GetBaseValueType();
  6759. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6760. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6761. END;
  6762. END AppendCellTypeModifiers;
  6763. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6764. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6765. BEGIN
  6766. Basic.GetString(modifier.identifier, name);
  6767. PushConstString(name);
  6768. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6769. ASSERT(SemanticChecker.IsStringType(value.type));
  6770. Designate(value, op);
  6771. PushString(op, value.type);
  6772. ReleaseOperand(op);
  6773. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6774. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6775. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6776. Evaluate(value, op);
  6777. Emit(Push(modifier.position, op.op));
  6778. ReleaseOperand(op);
  6779. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6780. ELSE
  6781. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6782. END;
  6783. END AddPortProperty;
  6784. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6785. BEGIN
  6786. WHILE modifier # NIL DO
  6787. AddPortProperty(modifier, modifier.expression);
  6788. modifier := modifier.nextModifier;
  6789. END;
  6790. END AddPortProperties;
  6791. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6792. VAR op: Operand;
  6793. BEGIN
  6794. Evaluate(p, op);
  6795. Emit(Push(p.position, op.op));
  6796. ReleaseOperand(op);
  6797. IF p IS SyntaxTree.Designator THEN
  6798. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6799. END;
  6800. END PushPort;
  6801. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6802. VAR tmp: IntermediateCode.Operand;
  6803. BEGIN
  6804. actualType := actualType.resolved;
  6805. IF actualType IS SyntaxTree.StringType THEN
  6806. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6807. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6808. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6809. ELSE
  6810. tmp := op.tag;
  6811. IntermediateCode.MakeMemory(tmp,addressType);
  6812. Emit(Push(position,tmp));
  6813. END;
  6814. Emit(Push(position,op.op))
  6815. END PushString;
  6816. (* conservative check if x is potentially on the heap, excluding the module heap
  6817. required for generational garbage collector
  6818. *)
  6819. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6820. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6821. BEGIN
  6822. RETURN TRUE;
  6823. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6824. passed by reference.
  6825. pos := x.position.start;
  6826. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6827. x := x(SyntaxTree.Designator).left;
  6828. END;
  6829. RETURN x # NIL;
  6830. *)
  6831. END OnHeap;
  6832. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6833. VAR
  6834. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6835. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6836. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6837. tmp:IntermediateCode.Operand;
  6838. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6839. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6840. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6841. dest: IntermediateCode.Operand;
  6842. staticLength: LONGINT; itype: IntermediateCode.Type;
  6843. convert,isTensor: BOOLEAN;
  6844. recordType: SyntaxTree.RecordType;
  6845. baseType: SyntaxTree.Type;
  6846. flags: SET;
  6847. left: SyntaxTree.Expression;
  6848. call: SyntaxTree.Designator;
  6849. procedure: SyntaxTree.Procedure;
  6850. temporaryVariable: SyntaxTree.Variable;
  6851. dummy: IntermediateCode.Operand;
  6852. customBuiltin: SyntaxTree.CustomBuiltin;
  6853. isVarPar: ARRAY 3 OF BOOLEAN;
  6854. callsection: Sections.Section;
  6855. segmentedName: Basic.SegmentedName;
  6856. needsTrace: BOOLEAN;
  6857. n: ARRAY 256 OF CHAR;
  6858. modifier: SyntaxTree.Modifier;
  6859. previous, init: IntermediateCode.Section;
  6860. prevScope: SyntaxTree.Scope;
  6861. firstPar: LONGINT;
  6862. saved: RegisterEntry;
  6863. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6864. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6865. priority: IntermediateCode.Operand;
  6866. op,callop: Operand;
  6867. BEGIN
  6868. IF type = NIL THEN RETURN END;
  6869. type := type.resolved;
  6870. IF type IS SyntaxTree.PointerType THEN
  6871. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6872. END;
  6873. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6874. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6875. recordScope := type(SyntaxTree.RecordType).recordScope;
  6876. IF recordScope.bodyProcedure # NIL THEN
  6877. procedure := recordScope.bodyProcedure;
  6878. body := procedure.procedureScope.body;
  6879. Emit(Push(position,self));
  6880. IF body.isActive THEN
  6881. StaticCallOperand(callop,procedure);
  6882. Emit(Push(position,callop.op));
  6883. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6884. Convert(priority,sizeType);
  6885. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6886. END;
  6887. Emit(Push(position,priority));
  6888. ReleaseIntermediateOperand(priority);
  6889. IF backend.cooperative THEN
  6890. Emit(Push(position,self));
  6891. CallThis(position,"Activities","Create",3)
  6892. ELSE
  6893. flags := 0;
  6894. IF body.isSafe THEN
  6895. flags := 1;
  6896. END;
  6897. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6898. Emit(Push(position,self));
  6899. CallThis(position,"Objects","CreateProcess",4)
  6900. END;
  6901. ELSE
  6902. Emit(Push(position,self));
  6903. StaticCallOperand(callop,procedure);
  6904. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6905. END;
  6906. Emit(Pop(position,self));
  6907. END;
  6908. END CallBodies;
  6909. PROCEDURE PushTD(type: SyntaxTree.Type);
  6910. VAR op: IntermediateCode.Operand;
  6911. BEGIN
  6912. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6913. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6914. ELSE
  6915. IF type.resolved IS SyntaxTree.PointerType THEN
  6916. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6917. END;
  6918. op := TypeDescriptorAdr(type.resolved);
  6919. IF ~newObjectFile THEN
  6920. IntermediateCode.MakeMemory(op,addressType);
  6921. END;
  6922. Emit(Push(position,op));
  6923. END
  6924. END PushTD;
  6925. BEGIN
  6926. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6927. dest := destination; destination := emptyOperand;
  6928. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6929. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6930. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6931. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6932. CASE x.id OF
  6933. (* ---- COPY ----- *)
  6934. |Global.Copy:
  6935. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6936. (* ---- EXCL, INCL----- *)
  6937. |Global.Excl,Global.Incl:
  6938. Evaluate(p0,s0);
  6939. Evaluate(p1,s1);
  6940. Convert(s1.op,setType);
  6941. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6942. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6943. END;
  6944. ReuseCopy(res,s0.op);
  6945. ReleaseOperand(s0);
  6946. Reuse1(tmp,s1.op);
  6947. ReleaseOperand(s1);
  6948. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6949. IF x.id = Global.Excl THEN
  6950. Emit(Not(position,tmp,tmp));
  6951. Emit(And(position,res,res,tmp));
  6952. ELSE
  6953. Emit(Or(position,res,res,tmp));
  6954. END;
  6955. ReleaseIntermediateOperand(tmp);
  6956. Designate(p0,s0);
  6957. ToMemory(s0.op,setType,0);
  6958. Emit(Mov(position,s0.op,res));
  6959. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6960. (* ---- DISPOSE ----- *)
  6961. |Global.Dispose:
  6962. Designate(p0,s0);
  6963. Emit(Push(position,s0.op));
  6964. ReleaseOperand(s0);
  6965. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6966. (* ---- GETPROCEDURE ----- *)
  6967. |Global.GetProcedure:
  6968. Designate(p0,s0);
  6969. PushString(s0,p0.type);
  6970. Designate(p1,s1);
  6971. PushString(s1,p1.type);
  6972. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6973. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6974. ELSE PushTD(procedureType.firstParameter.type)
  6975. END;
  6976. PushTD(procedureType.returnType);
  6977. Designate(p2,s2);
  6978. Emit(Push(position,s2.op));
  6979. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6980. CallThis(position,"Modules","GetProcedure", 7);
  6981. (* ---- ASH, LSH, ROT ----- *)
  6982. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6983. Evaluate(p0,s0);
  6984. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6985. (* make unsigned arguments in order to produced a logical shift *)
  6986. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6987. convert:= TRUE;
  6988. itype := s0.op.type;
  6989. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6990. Convert(s0.op,itype);
  6991. ELSE
  6992. convert := FALSE;
  6993. END;
  6994. END;
  6995. Evaluate(p1,s1);
  6996. IF IsIntegerConstant(p1,hint) THEN
  6997. ReuseCopy(reg,s0.op);
  6998. IF hint > 0 THEN
  6999. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7000. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7001. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7002. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7003. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7004. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7005. END;
  7006. ELSIF hint < 0 THEN
  7007. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7008. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7009. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7010. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7011. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7012. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7013. END;
  7014. END;
  7015. ReleaseOperand(s0); ReleaseOperand(s1);
  7016. ELSE
  7017. exit := NewLabel();
  7018. end := NewLabel();
  7019. ReuseCopy(reg,s0.op);
  7020. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7021. Reuse1(tmp,s1.op);
  7022. Emit(Neg(position,tmp,s1.op));
  7023. Convert(tmp,s1.op.type);
  7024. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7025. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7026. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7027. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7028. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7029. END;
  7030. ReleaseIntermediateOperand(tmp);
  7031. BrL(end);
  7032. SetLabel(exit);
  7033. ReuseCopy(tmp,s1.op);
  7034. Convert(tmp,s1.op.type);
  7035. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7036. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7037. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7038. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7039. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7040. END;
  7041. ReleaseIntermediateOperand(tmp);
  7042. SetLabel(end);
  7043. ReleaseOperand(s0); ReleaseOperand(s1);
  7044. END;
  7045. InitOperand(result,ModeValue);
  7046. IF convert THEN
  7047. itype := reg.type;
  7048. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7049. Convert(reg,itype);
  7050. END;
  7051. result.op := reg;
  7052. (* ---- CAP ----- *)
  7053. |Global.Cap:
  7054. Evaluate(p0,result);
  7055. ReuseCopy(reg,result.op);
  7056. ReleaseIntermediateOperand(result.op);
  7057. ignore := NewLabel();
  7058. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7059. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7060. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7061. SetLabel(ignore);
  7062. result.op := reg;
  7063. (* ---- CHR ----- *)
  7064. |Global.Chr, Global.Chr32:
  7065. Evaluate(p0,result);
  7066. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7067. |Global.Entier, Global.EntierH:
  7068. Evaluate(p0,result);
  7069. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7070. (* ---- MIN and MAX ----- *)
  7071. |Global.Max,Global.Min:
  7072. Evaluate(p0,s0);
  7073. Evaluate(p1,s1);
  7074. Reuse2(res,s0.op,s1.op);
  7075. else := NewLabel();
  7076. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7077. ELSE BrltL(else,s1.op,s0.op) END;
  7078. Emit(Mov(position,res,s0.op));
  7079. ReleaseOperand(s0);
  7080. end := NewLabel();
  7081. BrL(end);
  7082. SetLabel(else);
  7083. Emit(MovReplace(position,res,s1.op));
  7084. SetLabel(end);
  7085. ReleaseOperand(s1);
  7086. InitOperand(result,ModeValue);
  7087. result.op := res;
  7088. (* ---- ODD ----- *)
  7089. |Global.Odd:
  7090. IF ~conditional THEN
  7091. ConditionToValue(x)
  7092. ELSE
  7093. Evaluate(p0,result);
  7094. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7095. Reuse1(res,result.op);
  7096. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7097. ReleaseIntermediateOperand(result.op);
  7098. result.op := res;
  7099. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7100. ReleaseOperand(result);
  7101. BrL(falseLabel);
  7102. END;
  7103. (* ---- ORD ----- *)
  7104. |Global.Ord, Global.Ord32:
  7105. Evaluate(p0,result);
  7106. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7107. (* ---- SHORT, LONG ----- *)
  7108. |Global.Short, Global.Long:
  7109. Evaluate(p0,result);
  7110. IF x.type IS SyntaxTree.ComplexType THEN
  7111. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7112. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7113. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7114. ELSE
  7115. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7116. END
  7117. (* ---- HALT, SYSTEM.HALT----- *)
  7118. |Global.Halt, Global.systemHalt:
  7119. val := p0.resolved(SyntaxTree.IntegerValue).value;
  7120. EmitTrap (position, val);
  7121. (* ---- ASSERT ----- *)
  7122. |Global.Assert:
  7123. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7124. trueL := NewLabel();
  7125. falseL := NewLabel();
  7126. Condition(p0,trueL,falseL);
  7127. IF p1 = NIL THEN val := AssertTrap
  7128. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  7129. END;
  7130. SetLabel(falseL);
  7131. EmitTrap(position,val);
  7132. SetLabel(trueL);
  7133. END;
  7134. (*
  7135. Emit(TrapC(result.op,val);
  7136. *)
  7137. (* ---- INC, DEC----- *)
  7138. |Global.Inc,Global.Dec:
  7139. Expression(p0); adr := result.op;
  7140. LoadValue(result,p0.type); l := result;
  7141. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7142. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7143. END;
  7144. IF x.id = Global.Inc THEN
  7145. Emit(Add(position,l.op,l.op,r.op));
  7146. ELSE
  7147. Emit(Sub(position,l.op,l.op,r.op));
  7148. END;
  7149. ReleaseOperand(l); ReleaseOperand(r);
  7150. (* ---- LEN ----- *)
  7151. |Global.Len: (* dynamic length, static length done by checker *)
  7152. Designate(p0,operand);
  7153. IF p1 = NIL THEN
  7154. InitOperand(l,ModeValue);
  7155. l.op := IntermediateCode.Immediate(sizeType,0);
  7156. ELSE
  7157. Evaluate(p1,l);
  7158. END;
  7159. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7160. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7161. Dereference(operand, p0.type.resolved, FALSE);
  7162. END;
  7163. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7164. ReleaseOperand(operand); ReleaseOperand(l);
  7165. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7166. ASSERT(p1 # NIL);
  7167. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7168. Dereference(operand,p0.type.resolved,FALSE);
  7169. END;
  7170. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7171. ReleaseOperand(operand); ReleaseOperand(l);
  7172. ELSE HALT(100);
  7173. END;
  7174. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7175. (* ---- FIRST ---- *)
  7176. |Global.First:
  7177. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7178. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7179. ELSE
  7180. Designate(p0, result)
  7181. END
  7182. (* ---- LAST ---- *)
  7183. |Global.Last:
  7184. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7185. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7186. ELSE
  7187. Designate(p0, result);
  7188. (* make sure result.op is a register *)
  7189. tmp := result.op;
  7190. ReuseCopy(result.op, result.op);
  7191. ReleaseIntermediateOperand(tmp);
  7192. (* add offset to result.op *)
  7193. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7194. END
  7195. (* ---- STEP ---- *)
  7196. |Global.Step:
  7197. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7198. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7199. ELSE
  7200. Designate(p0, result);
  7201. (* make sure result.op is a register *)
  7202. tmp := result.op;
  7203. ReuseCopy(result.op, result.op);
  7204. ReleaseIntermediateOperand(tmp);
  7205. (* add offset to result.op *)
  7206. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7207. END
  7208. (* ---- RE ---- *)
  7209. |Global.Re:
  7210. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7211. Designate(p0, result)
  7212. ELSE
  7213. Evaluate(p0, result)
  7214. END
  7215. (* ---- IM ---- *)
  7216. |Global.Im:
  7217. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7218. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7219. Designate(p0, result);
  7220. (* make sure result.op is a register *)
  7221. tmp := result.op;
  7222. ReuseCopy(result.op, result.op);
  7223. ReleaseIntermediateOperand(tmp);
  7224. (* add offset to result.op *)
  7225. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7226. (* ---- ABS ----- *)
  7227. |Global.Abs:
  7228. Evaluate(p0,operand);
  7229. type := p0.type.resolved;
  7230. InitOperand(result,ModeValue);
  7231. Reuse1a(result.op,operand.op,dest);
  7232. Emit(Abs(position,result.op,operand.op));
  7233. ReleaseOperand(operand);
  7234. (* ---- WAIT ----- *)
  7235. |Global.Wait:
  7236. Evaluate(p0,operand);
  7237. Emit(Push(position,operand.op));
  7238. ReleaseOperand(operand);
  7239. CallThis(position,"Activities","Wait", 1);
  7240. (* ---- NEW ----- *)
  7241. |Global.New:
  7242. (*! the following code is only correct for "standard" Oberon calling convention *)
  7243. IF x.type # NIL THEN
  7244. type := x.type.resolved;
  7245. firstPar := 0;
  7246. ELSE
  7247. type := p0.type.resolved;
  7248. firstPar := 1;
  7249. END;
  7250. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7251. THEN
  7252. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7253. IF backend.cooperative THEN
  7254. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7255. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7256. IF recordType.isObject THEN
  7257. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7258. IF recordType.IsActive() THEN
  7259. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7260. END;
  7261. IF recordType.IsProtected() THEN
  7262. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7263. END;
  7264. ELSE
  7265. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7266. END;
  7267. END;
  7268. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7269. CallThis(position,"Runtime","New", 1);
  7270. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7271. Emit(Result(position, pointer));
  7272. exit := NewLabel();
  7273. BreqL(exit,pointer,nil);
  7274. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7275. GetRecordTypeName (recordType,name);
  7276. IF ~recordType.isObject THEN
  7277. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7278. END;
  7279. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7280. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7281. IF recordType.isObject THEN
  7282. IF recordType.IsProtected() THEN
  7283. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7284. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7285. END;
  7286. IF recordType.IsActive() THEN
  7287. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7288. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7289. END;
  7290. END;
  7291. END;
  7292. (* initialize fields *)
  7293. IF type(SyntaxTree.PointerType).isPlain THEN
  7294. size := 0;
  7295. ELSIF recordType.isObject THEN
  7296. size := BaseObjectTypeSize;
  7297. ELSE
  7298. size := BaseRecordTypeSize;
  7299. END;
  7300. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7301. (* call initializer *)
  7302. constructor := GetConstructor(recordType);
  7303. IF constructor # NIL THEN
  7304. (*! should be unified with ProcedureCallDesignator *)
  7305. Emit(Push(position,pointer));
  7306. ReleaseIntermediateOperand(pointer);
  7307. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7308. FOR i := firstPar TO x.parameters.Length()-1 DO
  7309. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7310. formalParameter := formalParameter.nextParameter;
  7311. END;
  7312. (* static call of the constructor *)
  7313. GetCodeSectionNameForSymbol(constructor,name);
  7314. ASSERT(~constructor.isInline);
  7315. IF constructor.scope.ownerModule # module.module THEN
  7316. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7317. ELSE
  7318. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7319. END;
  7320. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7321. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7322. Emit(Pop(position,pointer));
  7323. END;
  7324. (* call bodies *)
  7325. CallBodies(pointer,type);
  7326. SetLabel(exit);
  7327. needsTrace := p0.NeedsTrace();
  7328. IF needsTrace THEN ModifyAssignments(true) END;
  7329. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7330. Emit(Push(position, pointer));
  7331. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7332. Emit(Pop(position, pointer));
  7333. END;
  7334. Designate(p0,l);
  7335. IF needsTrace THEN
  7336. CallAssignPointer(l.op, pointer);
  7337. ELSE
  7338. ToMemory(l.op,addressType,0);
  7339. Emit(Mov(position,l.op,pointer));
  7340. END;
  7341. ReleaseIntermediateOperand(pointer);
  7342. ReleaseOperand(l);
  7343. IF needsTrace THEN ModifyAssignments(false) END;
  7344. ELSE (* not cooperative backend *)
  7345. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7346. IF temporaryVariable # NIL THEN
  7347. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7348. ELSE
  7349. Designate(p0,l);
  7350. END;
  7351. (* l.op contains address of pointer to record *)
  7352. Emit(Push(position,l.op)); (* address for use after syscall *)
  7353. Emit(Push(position,l.op));
  7354. ReleaseOperand(l);
  7355. (* push type descriptor *)
  7356. reg := TypeDescriptorAdr(recordType);
  7357. IF ~newObjectFile THEN
  7358. IntermediateCode.MakeMemory(reg,addressType);
  7359. END;
  7360. Emit(Push(position,reg));
  7361. ReleaseIntermediateOperand(reg);
  7362. (* push realtime flag *)
  7363. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7364. ELSE Emit(Push(position,false));
  7365. END;
  7366. CallThis(position,"Heaps","NewRec", 3);
  7367. (* check allocation success, if not successful then do not call initializers and bodies *)
  7368. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7369. Emit(Pop(position,pointer));
  7370. MakeMemory(reg,pointer,addressType,0);
  7371. ReleaseIntermediateOperand(pointer);
  7372. pointer := reg;
  7373. exit := NewLabel();
  7374. BreqL(exit,pointer,nil);
  7375. Emit(Push(position,pointer));
  7376. (* initialize fields *)
  7377. InitFields(recordType, pointer,0);
  7378. (* call initializer *)
  7379. constructor := GetConstructor(recordType);
  7380. IF constructor # NIL THEN
  7381. (*! should be unified with ProcedureCallDesignator *)
  7382. Emit(Push(position,pointer));
  7383. ReleaseIntermediateOperand(pointer);
  7384. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7385. FOR i := firstPar TO x.parameters.Length()-1 DO
  7386. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7387. formalParameter := formalParameter.nextParameter;
  7388. END;
  7389. (* static call of the constructor *)
  7390. GetCodeSectionNameForSymbol(constructor,name);
  7391. ASSERT(~constructor.isInline);
  7392. IF constructor.scope.ownerModule # module.module THEN
  7393. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7394. ELSE
  7395. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7396. END;
  7397. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7398. ELSE
  7399. ReleaseIntermediateOperand(pointer);
  7400. END;
  7401. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7402. Emit(Pop(position,pointer));
  7403. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7404. Designate(p0,l);
  7405. IF backend.writeBarriers & OnHeap(p0) THEN
  7406. SaveRegisters();ReleaseUsedRegisters(saved);
  7407. Emit(Push(position,l.op));
  7408. Emit(Push(position,pointer));
  7409. CallThis(position,"Heaps","Assign",2);
  7410. RestoreRegisters(saved);
  7411. ELSE
  7412. ToMemory(l.op,addressType,0);
  7413. Emit(Mov(position,l.op,pointer));
  7414. END;
  7415. ReleaseOperand(l);
  7416. result.tag := emptyOperand;
  7417. ELSIF (x.type # NIL) THEN
  7418. result := l; (* temporary variable is the result of NEW Type() *)
  7419. END;
  7420. (* call bodies *)
  7421. CallBodies(pointer,type);
  7422. ReleaseIntermediateOperand(pointer);
  7423. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7424. end := NewLabel();
  7425. BrL(end);
  7426. SetLabel(exit);
  7427. Designate(p0,l);
  7428. ToMemory(l.op,addressType,0);
  7429. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7430. ReleaseOperand(l);
  7431. SetLabel(end);
  7432. ELSE
  7433. SetLabel(exit);
  7434. END;
  7435. END;
  7436. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7437. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7438. IF ~backend.cooperative THEN (* simpler version *)
  7439. (*
  7440. push len0
  7441. push len1
  7442. push len2
  7443. push len_size
  7444. push len_adr
  7445. push tag
  7446. push static elements
  7447. push element size
  7448. push adr
  7449. *)
  7450. dim := 0;
  7451. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7452. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7453. parameter := x.parameters.GetExpression(i);
  7454. Evaluate(parameter,r);
  7455. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7456. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7457. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7458. END;
  7459. Emit(Push(position,r.op));
  7460. ReleaseOperand(r);
  7461. INC(dim);
  7462. END;
  7463. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7464. Emit(Mov(position, adr, sp));
  7465. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7466. Emit(Push(position, adr));
  7467. ReleaseIntermediateOperand(adr);
  7468. openDim := dim;
  7469. staticLength := 1;
  7470. IF type IS SyntaxTree.ArrayType THEN
  7471. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7472. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7473. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7474. END;
  7475. END;
  7476. IF SemanticChecker.ContainsPointer(type) THEN
  7477. tmp := TypeDescriptorAdr(type);
  7478. IF ~newObjectFile THEN
  7479. IntermediateCode.MakeMemory(tmp,addressType);
  7480. END;
  7481. ELSE
  7482. tmp := nil;
  7483. END;
  7484. Emit(Push(position,tmp)); (* type descriptor *)
  7485. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7486. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7487. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7488. Designate(p0,l);
  7489. Emit(Push(position,l.op)); (* address *)
  7490. ReleaseOperand(l);
  7491. CallThis(position,"Heaps","NewArray", 6);
  7492. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7493. Emit(Add(position,sp,sp,tmp));
  7494. ELSE
  7495. dim := 0;
  7496. IntermediateCode.InitOperand(reg);
  7497. IF p1 # NIL THEN
  7498. FOR i := firstPar TO x.parameters.Length()-1 DO
  7499. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7500. parameter := x.parameters.GetExpression(i);
  7501. Evaluate(parameter,r);
  7502. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7503. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7504. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7505. END;
  7506. Emit(Push(position,r.op));
  7507. IF i=1 THEN
  7508. CopyInt(reg,r.op);
  7509. ELSE
  7510. MulInt(reg, reg, r.op);
  7511. END;
  7512. ReleaseOperand(r);
  7513. INC(dim);
  7514. END;
  7515. Convert(reg,addressType);
  7516. ELSE
  7517. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7518. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7519. END;
  7520. openDim := dim;
  7521. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7522. IF backend.cooperative THEN
  7523. size := ToMemoryUnits(system,system.SizeOf(type));
  7524. WHILE type IS SyntaxTree.ArrayType DO
  7525. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7526. END;
  7527. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7528. IF (size # 1) THEN
  7529. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7530. END;
  7531. Emit(Push(position,reg));
  7532. size := ToMemoryUnits(system,system.SizeOf(type));
  7533. IF (size # 1) THEN
  7534. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7535. END;
  7536. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7537. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7538. Emit(Push(position,reg));
  7539. ReleaseIntermediateOperand(reg);
  7540. CallThis(position,"Runtime","New", 1);
  7541. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7542. Emit(Result(position, pointer));
  7543. exit := NewLabel();
  7544. else := NewLabel();
  7545. BreqL(else,pointer,nil);
  7546. IF ~type.hasPointers THEN
  7547. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7548. ELSIF type IS SyntaxTree.RecordType THEN
  7549. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7550. ELSIF type IS SyntaxTree.ProcedureType THEN
  7551. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7552. ELSE
  7553. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7554. END;
  7555. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7556. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7557. 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))));
  7558. IF type IS SyntaxTree.RecordType THEN
  7559. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7560. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7561. ELSE
  7562. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7563. END;
  7564. i := openDim;
  7565. WHILE i > 0 DO
  7566. DEC (i);
  7567. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7568. END;
  7569. needsTrace := p0.NeedsTrace();
  7570. IF needsTrace THEN ModifyAssignments(true) END;
  7571. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7572. Emit(Push(position, pointer));
  7573. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7574. Emit(Pop(position, pointer));
  7575. END;
  7576. Designate(p0,l);
  7577. IF needsTrace THEN
  7578. CallAssignPointer(l.op, pointer);
  7579. ModifyAssignments(false);
  7580. ELSE
  7581. ToMemory(l.op,addressType,0);
  7582. Emit(Mov(position,l.op,pointer));
  7583. END;
  7584. ReleaseIntermediateOperand(pointer);
  7585. ReleaseOperand(l);
  7586. BrL(exit);
  7587. SetLabel(else);
  7588. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7589. Designate(p0,l);
  7590. IF needsTrace THEN
  7591. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7592. ELSE
  7593. ToMemory(l.op,addressType,0);
  7594. Emit(Mov(position,l.op,pointer));
  7595. END;
  7596. ReleaseOperand(l);
  7597. SetLabel(exit);
  7598. ELSE
  7599. (*! the following code is only correct for "standard" Oberon calling convention *)
  7600. IF SemanticChecker.ContainsPointer(type) THEN
  7601. IF type IS SyntaxTree.ArrayType THEN
  7602. staticLength := 1;
  7603. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7604. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7605. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7606. END;
  7607. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7608. MulInt(reg,reg,tmp);
  7609. END;
  7610. Designate(p0,l);
  7611. IF openDim > 0 THEN
  7612. Emit(Push(position,l.op)); (* address for use after syscall *)
  7613. END;
  7614. Emit(Push(position,l.op)); (* address *)
  7615. ReleaseOperand(l);
  7616. tmp := TypeDescriptorAdr(type);
  7617. IF ~newObjectFile THEN
  7618. IntermediateCode.MakeMemory(tmp,addressType);
  7619. END;
  7620. Emit(Push(position,tmp)); (* type descriptor *)
  7621. ReleaseIntermediateOperand(tmp);
  7622. Emit(Push(position,reg)); (* number Elements *)
  7623. ReleaseIntermediateOperand(reg);
  7624. tmp := IntermediateCode.Immediate(addressType,dim);
  7625. Emit(Push(position,tmp)); (* dimensions *)
  7626. (* push realtime flag *)
  7627. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7628. ELSE Emit(Push(position,false));
  7629. END;
  7630. CallThis(position,"Heaps","NewArr",5)
  7631. ELSE
  7632. size := ToMemoryUnits(system,system.SizeOf(type));
  7633. IF (size # 1) THEN
  7634. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7635. (*
  7636. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7637. *)
  7638. END;
  7639. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7640. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7641. AddInt(reg, reg, tmp);
  7642. (*
  7643. Emit(Add(position,reg,reg,tmp));
  7644. *)
  7645. Designate(p0,l);
  7646. IF openDim >0 THEN
  7647. Emit(Push(position,l.op)); (* address for use after syscall *)
  7648. END;
  7649. Emit(Push(position,l.op)); (* address for syscall *)
  7650. ReleaseOperand(l); (* pointer address *)
  7651. Emit(Push(position,reg)); (* size *)
  7652. ReleaseIntermediateOperand(reg);
  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","NewSys", 3)
  7658. END;
  7659. IF openDim > 0 THEN
  7660. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7661. Emit(Pop(position,adr));
  7662. ToMemory(adr,addressType,0);
  7663. ReuseCopy(tmp,adr);
  7664. ReleaseIntermediateOperand(adr);
  7665. adr := tmp;
  7666. else := NewLabel();
  7667. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7668. i := openDim-1;
  7669. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7670. WHILE (i >= 0) DO
  7671. Emit(Pop(position,reg));
  7672. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7673. Emit(Mov(position,res,reg));
  7674. DEC(i);
  7675. END;
  7676. ReleaseIntermediateOperand(adr);
  7677. ReleaseIntermediateOperand(reg);
  7678. exit := NewLabel();
  7679. BrL(exit);
  7680. SetLabel(else);
  7681. (* else part: array could not be allocated *)
  7682. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7683. Emit(Add(position,sp,sp,tmp));
  7684. SetLabel(exit);
  7685. END;
  7686. END;
  7687. END;
  7688. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7689. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7690. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7691. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7692. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7693. left.SetType(procedure.type);
  7694. formalParameter := procedureType.firstParameter;
  7695. (* push array to allocate *)
  7696. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7697. formalParameter :=formalParameter.nextParameter;
  7698. (* push length array *)
  7699. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7700. (* push size *)
  7701. type := t0;
  7702. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7703. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7704. END;
  7705. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7706. Emit(Push(position,tmp));
  7707. (* *)
  7708. IF SemanticChecker.ContainsPointer(type) THEN
  7709. tmp := TypeDescriptorAdr(type);
  7710. IF ~newObjectFile THEN
  7711. IntermediateCode.MakeMemory(tmp,addressType);
  7712. END;
  7713. ELSE
  7714. tmp := IntermediateCode.Immediate(addressType, 0);
  7715. END;
  7716. Emit(Push(position,tmp)); (* type descriptor *)
  7717. StaticCallOperand(result,procedure);
  7718. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7719. ReleaseOperand(result);
  7720. END;
  7721. (*
  7722. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7723. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7724. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7725. *)
  7726. ELSE
  7727. (*
  7728. push len0
  7729. push len1
  7730. push len2
  7731. push size
  7732. push len_adr
  7733. push element_size
  7734. push tag
  7735. push adr
  7736. *)
  7737. dim := 0;
  7738. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7739. isTensor := TRUE;
  7740. ELSE
  7741. isTensor := FALSE;
  7742. END;
  7743. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7744. IF ~isTensor THEN
  7745. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7746. END;
  7747. parameter := x.parameters.GetExpression(i);
  7748. Evaluate(parameter,r);
  7749. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7750. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7751. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7752. END;
  7753. Emit(Push(position,r.op));
  7754. ReleaseOperand(r);
  7755. INC(dim);
  7756. END;
  7757. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7758. Emit(Mov(position, adr, sp));
  7759. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7760. Emit(Push(position, adr));
  7761. ReleaseIntermediateOperand(adr);
  7762. openDim := dim;
  7763. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7764. IF isTensor THEN
  7765. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7766. ELSE
  7767. baseType := SemanticChecker.ArrayBase(type,openDim);
  7768. END;
  7769. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7770. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7771. IF SemanticChecker.ContainsPointer(baseType) THEN
  7772. tmp := TypeDescriptorAdr(baseType);
  7773. IF ~newObjectFile THEN
  7774. IntermediateCode.MakeMemory(tmp,addressType);
  7775. END;
  7776. ELSE
  7777. tmp := nil;
  7778. END;
  7779. Emit(Push(position,tmp)); (* type descriptor *)
  7780. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7781. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7782. ELSE (* error message has already been emited *)
  7783. RETURN;
  7784. END;
  7785. Designate(p0,l);
  7786. IF isTensor THEN
  7787. Emit(Push(position,l.op)); (* address *)
  7788. ELSE
  7789. Emit(Push(position,l.tag)); (* address *)
  7790. END;
  7791. ReleaseOperand(l);
  7792. StaticCallOperand(result,procedure);
  7793. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7794. ReleaseOperand(result);
  7795. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7796. Emit(Add(position,sp,sp,tmp));
  7797. END;
  7798. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7799. THEN
  7800. IF ~backend.cellsAreObjects THEN RETURN END;
  7801. IF InCellScope(currentScope) THEN
  7802. PushSelfPointer()
  7803. ELSE
  7804. Emit(Push(position, nil));
  7805. END;
  7806. (* push temp address *)
  7807. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7808. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7809. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7810. (* l.op contains address of pointer to record *)
  7811. Emit(Push(position,l.op)); (* address for use after syscall *)
  7812. ReleaseOperand(l);
  7813. (* push type descriptor *)
  7814. reg := TypeDescriptorAdr(baseType);
  7815. IF ~newObjectFile THEN
  7816. IntermediateCode.MakeMemory(reg,addressType);
  7817. END;
  7818. Emit(Push(position,reg));
  7819. ReleaseIntermediateOperand(reg);
  7820. (* push name *)
  7821. (*Global.GetSymbolName(p0, n);*)
  7822. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7823. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7824. ELSE
  7825. Global.GetModuleName(module.module, n);
  7826. END;
  7827. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7828. (*type.typeDeclaration.GetName(n);*)
  7829. PushConstString(n);
  7830. (* push cellnet boolean *)
  7831. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7832. (* push engine boolean *)
  7833. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7834. (* allocate *)
  7835. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7836. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7837. (* l.op contains address of pointer to record *)
  7838. ToMemory(l.op,addressType,0);
  7839. (* l.op contains value of pointer to record *)
  7840. InitFields(baseType, l.op,0);
  7841. (* add capabilities *)
  7842. modifier := p0(SyntaxTree.Designator).modifiers;
  7843. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7844. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7845. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7846. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7847. END;
  7848. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7849. (*
  7850. modifier := baseType(SyntaxTree.CellType).modifiers;
  7851. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7852. modifier := p0(SyntaxTree.Designator).modifiers;
  7853. *)
  7854. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7855. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7856. (* l.op contains address of pointer to record *)
  7857. ToMemory(l.op,addressType,0);
  7858. (* l.op contains value of pointer to record *)
  7859. Emit(Push(position,l.op)); (* address for use after syscall *)
  7860. ReleaseOperand(l);
  7861. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7862. prevScope := currentScope;
  7863. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7864. previous := section;
  7865. section := init;
  7866. (* add ports *)
  7867. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7868. CloseInitializer(previous);
  7869. currentScope := prevScope;
  7870. Symbol(temporaryVariable,l);
  7871. ToMemory(l.op,addressType,0);
  7872. Emit(Push(position,l.op));
  7873. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7874. (*
  7875. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7876. IF constructor # NIL THEN
  7877. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7878. FOR i := 1 TO x.parameters.Length()-1 DO
  7879. p := x.parameters.GetExpression(i);
  7880. Global.GetSymbolName(parameter,name);
  7881. Evaluate(p, value);
  7882. ASSERT(value.type # NIL);
  7883. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7884. par := instance.AddParameter(name);
  7885. par.SetInteger(value.integer);
  7886. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7887. par := instance.AddParameter(name);
  7888. par.SetBoolean(value.boolean);
  7889. ELSE Error(x.position,NotYetImplemented)
  7890. END;
  7891. parameter := parameter.nextParameter
  7892. END;
  7893. END;
  7894. *)
  7895. (* call initializer *)
  7896. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7897. IF constructor # NIL THEN
  7898. (*! should be unified with ProcedureCallDesignator *)
  7899. IF backend.cellsAreObjects THEN
  7900. Symbol(temporaryVariable,l);
  7901. ToMemory(l.op,addressType,0);
  7902. Emit(Push(position,l.op));
  7903. ReleaseOperand(l);
  7904. END;
  7905. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7906. FOR i := firstPar TO x.parameters.Length()-1 DO
  7907. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7908. formalParameter := formalParameter.nextParameter;
  7909. END;
  7910. (* static call of the constructor *)
  7911. Global.GetSymbolSegmentedName(constructor,name);
  7912. ASSERT(~constructor.isInline);
  7913. IF constructor.scope.ownerModule # module.module THEN
  7914. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7915. ELSE
  7916. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7917. END;
  7918. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7919. (*ELSE
  7920. ReleaseIntermediateOperand(pointer);*)
  7921. END;
  7922. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7923. ToMemory(l.op, addressType, 0);
  7924. Designate(p0,s0);
  7925. ToMemory(s0.op,addressType,0);
  7926. Emit(Mov(position,s0.op,l.op));
  7927. ReleaseOperand(l);
  7928. ReleaseOperand(s0);
  7929. result.tag := emptyOperand;
  7930. (* start *)
  7931. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7932. (* push cell *)
  7933. Symbol(temporaryVariable, l);
  7934. ToMemory(l.op,addressType,0);
  7935. Emit(Push(Basic.invalidPosition,l.op));
  7936. (* push delegate *)
  7937. Emit(Push(Basic.invalidPosition,l.op));
  7938. ReleaseOperand(l);
  7939. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7940. Emit(Push(position, s1.op));
  7941. ReleaseOperand(s1);
  7942. CallThis(position,"ActiveCellsRuntime","Start",3);
  7943. END;
  7944. (*IF temporaryVariable # NIL THEN
  7945. end := NewLabel();
  7946. BrL(end);
  7947. SetLabel(exit);
  7948. Designate(p0,l);
  7949. ToMemory(l.op,addressType,0);
  7950. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7951. ReleaseOperand(l);
  7952. SetLabel(end);
  7953. ELSE
  7954. SetLabel(exit);
  7955. END;
  7956. *)
  7957. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7958. ELSE (* no pointer to record, no pointer to array *)
  7959. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7960. (* ignore new statement *)
  7961. Warning(p0.position, "cannot run on final hardware");
  7962. ELSE
  7963. HALT(200);
  7964. END;
  7965. END;
  7966. (* ---- ADDRESSOF----- *)
  7967. |Global.systemAdr:
  7968. Designate(p0,s0);
  7969. s0.mode := ModeValue;
  7970. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7971. ReleaseIntermediateOperand(s0.op);
  7972. s0.op := s0.tag;
  7973. IntermediateCode.InitOperand(s0.tag);
  7974. END;
  7975. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7976. result := s0;
  7977. (* ---- BIT ----- *)
  7978. |Global.systemBit:
  7979. Evaluate(p0,s0);
  7980. ToMemory(s0.op,addressType,0);
  7981. ReuseCopy(res,s0.op);
  7982. ReleaseOperand(s0);
  7983. Evaluate(p1,s1);
  7984. Emit(Ror(position,res,res,s1.op));
  7985. ReleaseOperand(s1);
  7986. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7987. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7988. IF ~conditional THEN
  7989. InitOperand(result,ModeValue); result.op := res;
  7990. ELSE
  7991. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7992. BrL(falseLabel);
  7993. ReleaseIntermediateOperand(res);
  7994. END;
  7995. (* --- MSK ----*)
  7996. |Global.systemMsk:
  7997. Evaluate(p0,s0);
  7998. Evaluate(p1,s1);
  7999. ReuseCopy(res,s0.op);
  8000. ReleaseOperand(s0);
  8001. Emit(And(position,res,res,s1.op));
  8002. ReleaseOperand(s1);
  8003. InitOperand(result,ModeValue);
  8004. result.op := res;
  8005. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8006. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8007. Evaluate(p0,s0);
  8008. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8009. ReleaseOperand(s0);
  8010. InitOperand(result,ModeValue);
  8011. result.op := res;
  8012. (* ---- SYSTEM.GetStackPointer ----- *)
  8013. |Global.systemGetStackPointer:
  8014. InitOperand(result,ModeValue);
  8015. result.op := sp;
  8016. (* ---- SYSTEM.GetFramePointer ----- *)
  8017. |Global.systemGetFramePointer:
  8018. InitOperand(result,ModeValue);
  8019. result.op := fp;
  8020. (* ---- SYSTEM.GetActivity ----- *)
  8021. |Global.systemGetActivity:
  8022. ASSERT(backend.cooperative);
  8023. InitOperand(result,ModeValue);
  8024. result.op := ap;
  8025. (* ---- SYSTEM.SetStackPointer ----- *)
  8026. |Global.systemSetStackPointer:
  8027. Evaluate(p0,s0); (* *)
  8028. Emit(Mov(position,sp,s0.op));
  8029. ReleaseOperand(s0);
  8030. (* ---- SYSTEM.SetFramePointer ----- *)
  8031. |Global.systemSetFramePointer:
  8032. Evaluate(p0,s0); (* *)
  8033. Emit(Mov(position,fp,s0.op));
  8034. ReleaseOperand(s0);
  8035. (* ---- SYSTEM.Activity ----- *)
  8036. |Global.systemSetActivity:
  8037. ASSERT(backend.cooperative);
  8038. Evaluate(p0,s0); (* *)
  8039. Emit(Mov(position,ap,s0.op));
  8040. ReleaseOperand(s0);
  8041. (* ---- SYSTEM.VAL ----- *)
  8042. |Global.systemVal:
  8043. Expression(p1);
  8044. s1 := result;
  8045. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8046. IF s1.mode = ModeReference THEN
  8047. (* nothing to be done if not record type, just take over new type *)
  8048. IF (type IS SyntaxTree.RecordType) THEN
  8049. ReleaseIntermediateOperand(s1.tag);
  8050. s1.tag := TypeDescriptorAdr(type);
  8051. IF ~newObjectFile THEN
  8052. IntermediateCode.MakeMemory(s1.tag,addressType);
  8053. END;
  8054. UseIntermediateOperand(s1.tag);
  8055. END;
  8056. result := s1;
  8057. ELSE (* copy over result to different type, may not use convert *)
  8058. itype := IntermediateCode.GetType(system,type);
  8059. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8060. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8061. Emit(Mov(position,s0.op,s1.op));
  8062. ReleaseOperand(s1);
  8063. InitOperand(result,ModeValue);
  8064. result.op := s0.op;
  8065. ELSE (* different size, must convert *)
  8066. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8067. Convert(s1.op, IntermediateCode.GetType(system,type));
  8068. result := s1;
  8069. END;
  8070. END;
  8071. (* ---- SYSTEM.GET ----- *)
  8072. |Global.systemGet:
  8073. Evaluate(p0,s0); (* adr *)
  8074. Designate(p1,s1); (* variable *)
  8075. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8076. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8077. Emit(Mov(position,s1.op,s0.op));
  8078. ReleaseOperand(s1);
  8079. ReleaseOperand(s0);
  8080. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8081. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8082. Evaluate(p0,s0); (* *)
  8083. Evaluate(p1,s1); (* variable *)
  8084. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8085. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8086. (* real part *)
  8087. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8088. Emit(Mov(position,res, s1.op));
  8089. ReleaseIntermediateOperand(res);
  8090. (* imaginary part *)
  8091. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8092. Emit(Mov(position,res, s1.tag));
  8093. ReleaseIntermediateOperand(res);
  8094. ReleaseOperand(s1);
  8095. ReleaseOperand(s0);
  8096. ELSE
  8097. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8098. ReleaseOperand(s0);
  8099. Emit(Mov(position,res,s1.op));
  8100. ReleaseIntermediateOperand(res);
  8101. ReleaseOperand(s1);
  8102. END;
  8103. (* ---- SYSTEM.MOVE ----- *)
  8104. |Global.systemMove:
  8105. Evaluate(p0,s0);
  8106. Evaluate(p1,s1);
  8107. Evaluate(p2,s2);
  8108. Emit(Copy(position,s1.op,s0.op,s2.op));
  8109. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8110. (* ---- SYSTEM.NEW ----- *)
  8111. |Global.systemNew:
  8112. Designate(p0,s0);
  8113. Emit(Push(position,s0.op));
  8114. ReleaseOperand(s0);
  8115. Evaluate(p1,s1);
  8116. Emit(Push(position,s1.op));
  8117. ReleaseOperand(s1);
  8118. (* push realtime flag: false by default *)
  8119. Emit(Push(position,false));
  8120. CallThis(position,"Heaps","NewSys",3);
  8121. (* ---- SYSTEM.CALL ----- *)
  8122. |Global.systemRef:
  8123. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8124. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8125. s0.mode := ModeValue;
  8126. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8127. result := s0
  8128. (* ---- INCR ----- *)
  8129. |Global.Incr:
  8130. Designate(p0,operand);
  8131. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8132. Dereference(operand,p0.type.resolved,FALSE);
  8133. END;
  8134. ASSERT(p1 # NIL);
  8135. Evaluate(p1,l);
  8136. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8137. ReleaseOperand(operand); ReleaseOperand(l);
  8138. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8139. (* ---- SUM ----- *)
  8140. |Global.Sum: HALT(200);
  8141. (* ---- ALL ----- *)
  8142. |Global.All: HALT(200);
  8143. (* ---- CAS ----- *)
  8144. |Global.Cas:
  8145. needsTrace := p0.NeedsTrace();
  8146. IF needsTrace THEN ModifyAssignments(true) END;
  8147. Designate(p0,s0);
  8148. Evaluate(p1,s1);
  8149. Evaluate(p2,s2);
  8150. IF needsTrace THEN
  8151. Emit(Push(position, s0.op));
  8152. Emit(Push(position, s1.op));
  8153. Emit(Push(position, s2.op));
  8154. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8155. ELSE
  8156. Emit(Cas(position,s0.op,s1.op,s2.op));
  8157. END;
  8158. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8159. IF needsTrace THEN ModifyAssignments(false) END;
  8160. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8161. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8162. IF conditional THEN
  8163. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8164. BrL(falseLabel);
  8165. ReleaseIntermediateOperand(res);
  8166. END;
  8167. (* ---- DIM ----- *)
  8168. |Global.Dim:
  8169. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8170. Designate(p0,s0);
  8171. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8172. Dereference(s0,p0.type.resolved,FALSE);
  8173. END;
  8174. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8175. ReleaseOperand(s0);
  8176. (* ---- RESHAPE ----- *)
  8177. |Global.Reshape:
  8178. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8179. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8180. left.SetType(procedure.type);
  8181. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8182. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8183. END;
  8184. (* ---- SYSTEM.TYPECODE ----- *)
  8185. |Global.systemTypeCode:
  8186. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8187. IF type.resolved IS SyntaxTree.PointerType THEN
  8188. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8189. END;
  8190. result.op := TypeDescriptorAdr(type);
  8191. IF ~newObjectFile THEN
  8192. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  8193. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  8194. END;
  8195. result.mode := ModeValue;
  8196. (* ---- SYSTEM.TRACE ----- *)
  8197. |Global.systemTrace:
  8198. SystemTrace(x.parameters, x.position);
  8199. (* ----- CONNECT ------*)
  8200. |Global.Connect:
  8201. IF backend.cellsAreObjects THEN
  8202. PushPort(p0);
  8203. PushPort(p1);
  8204. IF p2 # NIL THEN
  8205. Evaluate(p2, s2);
  8206. Emit(Push(p2.position, s2.op));
  8207. ReleaseOperand(s2);
  8208. ELSE
  8209. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8210. END;
  8211. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8212. ELSE
  8213. Warning(x.position, "cannot run on final hardware");
  8214. END;
  8215. (* ----- DELEGATE ------*)
  8216. |Global.Delegate:
  8217. IF backend.cellsAreObjects THEN
  8218. PushPort(p0);
  8219. PushPort(p1);
  8220. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8221. ELSE
  8222. Warning(x.position, "cannot run on final hardware");
  8223. END;
  8224. (* ----- SEND ------*)
  8225. |Global.Send:
  8226. Evaluate(p0,s0);
  8227. Evaluate(p1,s1);
  8228. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8229. Emit(Push(position,s0.op));
  8230. Emit(Push(position,s1.op));
  8231. (*
  8232. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8233. *)
  8234. IF ~backend.cellsAreObjects THEN
  8235. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8236. END;
  8237. ReleaseOperand(s0);
  8238. ReleaseOperand(s1);
  8239. IF backend.cellsAreObjects THEN
  8240. CallThis(position,"ActiveCellsRuntime","Send",2);
  8241. ELSE
  8242. CallThis(position,ChannelModuleName,"Send",2);
  8243. END;
  8244. (* ----- RECEIVE ------*)
  8245. |Global.Receive:
  8246. Evaluate(p0,s0);
  8247. Emit(Push(position,s0.op));
  8248. Designate(p1,s1);
  8249. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8250. Emit(Push(position,s1.op));
  8251. IF p2 # NIL THEN
  8252. Designate(p2,s2);
  8253. Emit(Push(position,s2.op));
  8254. END;
  8255. (*
  8256. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8257. *)
  8258. IF ~backend.cellsAreObjects THEN
  8259. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8260. END;
  8261. ReleaseOperand(s0);
  8262. ReleaseOperand(s1);
  8263. ReleaseOperand(s2);
  8264. IF backend.cellsAreObjects THEN
  8265. IF p2 = NIL THEN
  8266. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8267. ELSE
  8268. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8269. END;
  8270. ELSE
  8271. IF p2 = NIL THEN
  8272. CallThis(position,ChannelModuleName,"Receive",2)
  8273. ELSE
  8274. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8275. END;
  8276. END;
  8277. | Global.systemSpecial:
  8278. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8279. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8280. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8281. (* determine if parameters are of the VAR kind *)
  8282. ASSERT(x.parameters.Length() <= 3);
  8283. formalParameter := procedureType.firstParameter;
  8284. FOR i := 0 TO x.parameters.Length() - 1 DO
  8285. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8286. formalParameter := formalParameter.nextParameter
  8287. END;
  8288. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8289. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8290. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8291. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8292. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8293. IF procedureType.returnType # NIL THEN
  8294. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8295. Emit(Result(position, res));
  8296. (*InitOperand(result,ModeValue);
  8297. result.op := res;
  8298. *)
  8299. IF ~conditional THEN
  8300. InitOperand(result,ModeValue); result.op := res;
  8301. ELSE
  8302. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8303. BrL(falseLabel);
  8304. ReleaseIntermediateOperand(res);
  8305. END;
  8306. END
  8307. ELSE (* function not yet implemented *)
  8308. Error(position,"not yet implemented");
  8309. END;
  8310. destination := dest;
  8311. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8312. END VisitBuiltinCallDesignator;
  8313. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  8314. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8315. BEGIN
  8316. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8317. dest := destination; destination := emptyOperand;
  8318. Expression(x.left);
  8319. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8320. ELSIF isUnchecked THEN (* no check *)
  8321. ELSE
  8322. trueL := NewLabel();
  8323. falseL := NewLabel();
  8324. IF IsPointerToRecord(x.left.type,recordType) THEN
  8325. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8326. Emit(Mov(position,tag, result.op));
  8327. IF result.mode # ModeValue THEN
  8328. ptr := tag;
  8329. IntermediateCode.MakeMemory(ptr,addressType);
  8330. Emit(Mov(position,tag, ptr));
  8331. END;
  8332. IF ~backend.cooperative THEN
  8333. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8334. END;
  8335. IntermediateCode.MakeMemory(tag,addressType);
  8336. ELSE
  8337. tag := result.tag;
  8338. UseIntermediateOperand(tag);
  8339. END;
  8340. TypeTest(tag,x.type,trueL,falseL);
  8341. ReleaseIntermediateOperand(tag);
  8342. SetLabel(falseL);
  8343. EmitTrap(position,TypeCheckTrap);
  8344. SetLabel(trueL);
  8345. END;
  8346. destination := dest;
  8347. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8348. END VisitTypeGuardDesignator;
  8349. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8350. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8351. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8352. VAR label: Label; pc: LONGINT;
  8353. BEGIN
  8354. IF backend.cooperative & ~isUnchecked THEN
  8355. pc := section.pc;
  8356. label := NewLabel();
  8357. BrneL(label, operand.op, nil);
  8358. EmitTrap(position, NilPointerTrap);
  8359. SetLabel(label);
  8360. INC(statCoopNilCheck, section.pc - pc);
  8361. END;
  8362. END NilCheck;
  8363. BEGIN
  8364. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8365. ReuseCopy(dereferenced,operand.op);
  8366. ReleaseOperand(operand);
  8367. operand.mode := ModeReference;
  8368. operand.op := dereferenced;
  8369. operand.tag := dereferenced;
  8370. UseIntermediateOperand(operand.tag);
  8371. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8372. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8373. ReleaseIntermediateOperand(operand.tag);
  8374. operand.tag := TypeDescriptorAdr(type);
  8375. IF ~newObjectFile THEN
  8376. IntermediateCode.MakeMemory(operand.tag,addressType);
  8377. END;
  8378. ELSE
  8379. IF ~backend.cooperative THEN
  8380. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8381. END;
  8382. IntermediateCode.MakeMemory(operand.tag,addressType);
  8383. END;
  8384. NilCheck(operand.op);
  8385. ELSIF type IS SyntaxTree.ArrayType THEN
  8386. IF isUnsafe THEN
  8387. NilCheck(operand.op);
  8388. ReleaseIntermediateOperand(operand.tag);
  8389. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8390. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8391. ELSE
  8392. operand.tag := emptyOperand;
  8393. END;
  8394. ELSE
  8395. NilCheck(operand.op);
  8396. IF backend.cooperative THEN
  8397. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8398. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8399. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8400. ELSE
  8401. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8402. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8403. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8404. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8405. END;
  8406. END;
  8407. ELSIF type IS SyntaxTree.MathArrayType THEN
  8408. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8409. IntermediateCode.MakeMemory(operand.op,addressType);
  8410. ELSE HALT(100);
  8411. END;
  8412. END Dereference;
  8413. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8414. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8415. BEGIN
  8416. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8417. dest := destination; destination := emptyOperand;
  8418. Evaluate(x.left,d);
  8419. type := x.type.resolved;
  8420. prevIsUnchecked := isUnchecked;
  8421. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8422. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8423. END;
  8424. Dereference(d,type,IsUnsafePointer(x.left.type));
  8425. isUnchecked := prevIsUnchecked;
  8426. result := d;
  8427. 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
  8428. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8429. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8430. END;
  8431. END;
  8432. destination := dest;
  8433. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8434. END VisitDereferenceDesignator;
  8435. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8436. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8437. BEGIN
  8438. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8439. dest := destination; destination := emptyOperand;
  8440. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8441. tag := result.op;
  8442. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8443. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8444. StaticCallOperand(result,procedure.super);
  8445. ReleaseIntermediateOperand(result.tag);
  8446. UseIntermediateOperand(tag); (* necessary ? *)
  8447. result.tag := tag;
  8448. destination := dest;
  8449. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8450. END VisitSupercallDesignator;
  8451. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8452. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8453. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8454. name: Basic.SegmentedName;
  8455. procedure: SyntaxTree.Procedure;
  8456. procedureType: SyntaxTree.ProcedureType;
  8457. BEGIN
  8458. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8459. dest := destination; destination := emptyOperand;
  8460. scope := currentScope;
  8461. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8462. scope := scope.outerScope;
  8463. END;
  8464. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8465. IF newObjectFile THEN
  8466. moduleSection := meta.ModuleSection();
  8467. IF backend.cooperative THEN
  8468. moduleOffset := 0;
  8469. ELSE
  8470. moduleOffset := moduleSection.pc;
  8471. END;
  8472. result.mode := ModeValue;
  8473. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8474. ELSE
  8475. Symbol(moduleSelf,result);
  8476. IntermediateCode.MakeMemory(result.op,addressType);
  8477. END
  8478. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8479. result.mode := ModeValue;
  8480. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8481. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8482. ELSE
  8483. GetBaseRegister(basereg,currentScope,scope);
  8484. InitOperand(result,ModeReference);
  8485. result.op := basereg;
  8486. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8487. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8488. parametersSize := ProcedureParametersSize(system,procedure);
  8489. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8490. IF backend.cooperative THEN
  8491. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8492. END;
  8493. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8494. MakeMemory(result.op, result.op, addressType, 0);
  8495. END;
  8496. (* tag must be loaded when dereferencing SELF pointer *)
  8497. END;
  8498. destination := dest;
  8499. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8500. END VisitSelfDesignator;
  8501. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8502. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8503. BEGIN
  8504. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8505. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8506. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8507. parameter := procedureType.returnParameter;
  8508. IF currentIsInline THEN
  8509. map := currentMapper.Get(NIL);
  8510. IF map # NIL THEN
  8511. Designate(map.to, result);
  8512. ELSE
  8513. HALT(200);
  8514. END;
  8515. RETURN;
  8516. END;
  8517. VisitParameter(parameter);
  8518. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8519. END VisitResultDesignator;
  8520. (** values *)
  8521. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8522. BEGIN
  8523. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8524. IF conditional THEN
  8525. IF x.value THEN BrL(trueLabel)
  8526. ELSE BrL(falseLabel)
  8527. END;
  8528. ELSE
  8529. InitOperand(result,ModeValue);
  8530. IF x.value THEN result.op := true ELSE result.op := false END;
  8531. END;
  8532. END VisitBooleanValue;
  8533. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8534. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8535. BEGIN
  8536. Global.GetModuleSegmentedName(module.module, name);
  8537. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8538. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8539. RETURN section
  8540. END GetDataSection;
  8541. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8542. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8543. BEGIN
  8544. type := vop.type;
  8545. data := GetDataSection();
  8546. pc := EnterImmediate(data,vop);
  8547. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8548. IntermediateCode.MakeMemory(vop, type);
  8549. END GetImmediateMem;
  8550. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8551. BEGIN
  8552. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8553. InitOperand(result,ModeValue);
  8554. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8555. IF ~supportedImmediate(result.op) &~inData THEN
  8556. GetImmediateMem(result.op)
  8557. END;
  8558. END VisitIntegerValue;
  8559. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8560. BEGIN
  8561. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8562. InitOperand(result,ModeValue);
  8563. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8564. END VisitCharacterValue;
  8565. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8566. BEGIN
  8567. IF Trace THEN TraceEnter("VisitSetValue") END;
  8568. InitOperand(result,ModeValue);
  8569. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8570. END VisitSetValue;
  8571. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8572. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8573. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8574. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8575. BEGIN
  8576. numberElements := x.elements.Length();
  8577. FOR i := 0 TO numberElements-1 DO
  8578. expression := x.elements.GetExpression(i);
  8579. IF expression IS SyntaxTree.MathArrayExpression THEN
  8580. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8581. ELSE
  8582. inData := TRUE;
  8583. Evaluate(expression,op);
  8584. irv.Emit(Data(position,op.op));
  8585. inData := FALSE;
  8586. ReleaseOperand(op);
  8587. END;
  8588. END;
  8589. END RecursiveData;
  8590. BEGIN
  8591. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8592. IF ~TryConstantDeclaration() THEN
  8593. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8594. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8595. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8596. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8597. ELSE
  8598. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8599. END;
  8600. RecursiveData(x.array);
  8601. InitOperand(result,ModeReference);
  8602. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8603. END
  8604. END VisitMathArrayValue;
  8605. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8606. VAR constant: Sections.Section;
  8607. BEGIN
  8608. IF constantDeclaration = NIL THEN
  8609. RETURN FALSE
  8610. ELSE
  8611. (* Is a constant in this module: did we generate it already? *)
  8612. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8613. IF constant # NIL THEN
  8614. InitOperand(result,ModeReference);
  8615. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8616. RETURN TRUE;
  8617. END;
  8618. END;
  8619. RETURN FALSE
  8620. END TryConstantDeclaration;
  8621. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8622. BEGIN
  8623. constantDeclaration := x;
  8624. x.value.resolved.Accept(SELF);
  8625. END VisitConstant;
  8626. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8627. BEGIN
  8628. IF Trace THEN TraceEnter("VisitRealValue") END;
  8629. InitOperand(result,ModeValue);
  8630. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8631. END VisitRealValue;
  8632. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8633. VAR
  8634. componentType: SyntaxTree.Type;
  8635. BEGIN
  8636. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8637. ASSERT(x.type IS SyntaxTree.ComplexType);
  8638. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8639. InitOperand(result,ModeValue);
  8640. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8641. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8642. END VisitComplexValue;
  8643. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8644. VAR i: LONGINT; name: Basic.SegmentedName;
  8645. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8646. BEGIN
  8647. IF Trace THEN TraceEnter("VisitStringValue") END;
  8648. IF ~TryConstantDeclaration() THEN
  8649. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8650. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8651. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8652. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8653. ELSE
  8654. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8655. END;
  8656. FOR i := 0 TO x.length-1 DO
  8657. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8658. irv.Emit(Data(position,op));
  8659. END;
  8660. InitOperand(result,ModeReference);
  8661. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8662. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8663. END
  8664. END VisitStringValue;
  8665. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8666. BEGIN
  8667. IF Trace THEN TraceEnter("VisitNilValue") END;
  8668. InitOperand(result,ModeValue);
  8669. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8670. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8671. END VisitNilValue;
  8672. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8673. BEGIN
  8674. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8675. InitOperand(result,ModeValue);
  8676. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8677. END VisitEnumerationValue;
  8678. (** symbols *)
  8679. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8680. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8681. END VisitImport;
  8682. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8683. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8684. BEGIN
  8685. IF scope # baseScope THEN
  8686. (* left := [fp+8] *)
  8687. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8688. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8689. ReuseCopy(left,right);
  8690. ReleaseIntermediateOperand(right);
  8691. scope := scope.outerScope; DEC(level);
  8692. (* { left := [left+8] } *)
  8693. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8694. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8695. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8696. Emit(Mov(position,left,right));
  8697. scope := scope.outerScope; DEC(level);
  8698. END;
  8699. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8700. result := left;
  8701. ELSE
  8702. result := fp;
  8703. END;
  8704. END GetBaseRegister;
  8705. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8706. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8707. BEGIN
  8708. IF Trace THEN TraceEnter("VisitVariable"); END;
  8709. type := x.type.resolved;
  8710. IF (x.useRegister) THEN
  8711. InitOperand(result, ModeValue);
  8712. IF x.registerNumber < 0 THEN
  8713. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8714. reg := x.registerNumber;
  8715. ELSE
  8716. reg := registerUsageCount.Map(x.registerNumber);
  8717. UseRegister(reg);
  8718. END;
  8719. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8720. ELSIF x.externalName # NIL THEN
  8721. InitOperand(result,ModeReference);
  8722. Basic.ToSegmentedName(x.externalName^, name);
  8723. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8724. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8725. InitOperand(result,ModeReference);
  8726. GetBaseRegister(result.op,currentScope,x.scope);
  8727. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8728. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8729. InitOperand(result,ModeReference);
  8730. GetCodeSectionNameForSymbol(x,name);
  8731. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8732. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8733. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8734. InitOperand(result,ModeReference);
  8735. GetCodeSectionNameForSymbol(x,name);
  8736. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8737. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8738. ELSE (* field, left designator must have been emitted *)
  8739. ASSERT(result.mode = ModeReference);
  8740. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8741. ReuseCopy(temp,result.op);
  8742. ReleaseIntermediateOperand(result.op);
  8743. result.op := temp;
  8744. END;
  8745. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8746. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8747. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8748. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8749. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8750. END;
  8751. END;
  8752. END;
  8753. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8754. ValueToCondition(result);
  8755. ELSIF type IS SyntaxTree.ProcedureType THEN
  8756. ReleaseIntermediateOperand(result.tag);
  8757. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8758. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8759. UseIntermediateOperand(result.tag);
  8760. ELSE
  8761. result.tag := nil; (* nil *)
  8762. END;
  8763. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8764. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8765. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8766. ReleaseIntermediateOperand(result.tag);
  8767. Global.GetSymbolSegmentedName(x,name);
  8768. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8769. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8770. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8771. ELSE
  8772. END;
  8773. ELSE
  8774. ReleaseIntermediateOperand(result.tag);
  8775. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8776. END;
  8777. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8778. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8779. ReleaseIntermediateOperand(result.tag);
  8780. result.tag := result.op;
  8781. UseIntermediateOperand(result.tag);
  8782. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8783. IntermediateCode.MakeMemory(result.op,addressType);
  8784. END;
  8785. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8786. ReleaseIntermediateOperand(result.tag);
  8787. result.tag := TypeDescriptorAdr(type);
  8788. IF ~newObjectFile THEN
  8789. IntermediateCode.MakeMemory(result.tag,addressType);
  8790. END;
  8791. UseIntermediateOperand(result.tag);
  8792. (* tag for pointer type computed not here but during dereferencing *)
  8793. END;
  8794. IF Trace THEN TraceExit("VisitVariable") END;
  8795. END VisitVariable;
  8796. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8797. BEGIN
  8798. VisitVariable(property);
  8799. END VisitProperty;
  8800. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8801. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8802. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8803. BEGIN
  8804. type := x.type.resolved;
  8805. IF Trace THEN TraceEnter("VisitParameter") END;
  8806. IF x.ownerType IS SyntaxTree.CellType THEN
  8807. ptype := x.type.resolved;
  8808. IF backend.cellsAreObjects THEN
  8809. ASSERT(result.mode = ModeReference);
  8810. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8811. ReuseCopy(temp,result.op);
  8812. ReleaseIntermediateOperand(result.op);
  8813. result.op := temp;
  8814. END;
  8815. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8816. RETURN;
  8817. ELSE
  8818. InitOperand(result,ModeReference);
  8819. GetCodeSectionNameForSymbol(x,name);
  8820. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8821. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8822. RETURN;
  8823. END;
  8824. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8825. InitOperand(result,ModeReference);
  8826. GetCodeSectionNameForSymbol(x,name);
  8827. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8828. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8829. RETURN
  8830. ELSE
  8831. GetBaseRegister(basereg,currentScope,x.scope);
  8832. InitOperand(result,ModeReference);
  8833. result.op := basereg;
  8834. END;
  8835. IF IsOpenArray(type) THEN
  8836. result.tag := basereg;
  8837. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8838. IntermediateCode.MakeMemory(result.op,addressType);
  8839. IF Global.IsOberonProcedure(x.ownerType) THEN
  8840. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8841. UseIntermediateOperand(result.tag);
  8842. ELSE
  8843. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8844. END;
  8845. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8846. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8847. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8848. ELSIF IsStaticArray(type) THEN
  8849. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8850. IntermediateCode.MakeMemory(result.op,addressType);
  8851. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8852. ELSIF type IS SyntaxTree.MathArrayType THEN
  8853. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8854. WITH type: SyntaxTree.MathArrayType DO
  8855. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8856. IF type.form = SyntaxTree.Tensor THEN
  8857. ELSIF type.form = SyntaxTree.Open THEN
  8858. result.tag := result.op;
  8859. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8860. IntermediateCode.MakeMemory(result.op,addressType);
  8861. UseIntermediateOperand(result.tag);
  8862. ELSIF type.form = SyntaxTree.Static THEN
  8863. IF x.kind = SyntaxTree.ConstParameter THEN
  8864. IntermediateCode.MakeMemory(result.op,addressType);
  8865. END;
  8866. ELSE HALT(100)
  8867. END;
  8868. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8869. IF type.form = SyntaxTree.Tensor THEN
  8870. ToMemory(result.op,addressType,0);
  8871. ELSIF type.form = SyntaxTree.Open THEN
  8872. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8873. ReuseCopy(result.tag, mem);
  8874. ReleaseIntermediateOperand(mem);
  8875. ReleaseIntermediateOperand(result.op);
  8876. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8877. ELSIF type.form = SyntaxTree.Static THEN
  8878. IntermediateCode.MakeMemory(result.op,addressType);
  8879. ELSE HALT(100)
  8880. END;
  8881. ELSE HALT(100)
  8882. END;
  8883. END;
  8884. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8885. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8886. IntermediateCode.MakeMemory(result.op,addressType);
  8887. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8888. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8889. END;
  8890. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8891. ValueToCondition(result);
  8892. ELSIF type IS SyntaxTree.ProcedureType THEN
  8893. ReleaseIntermediateOperand(result.tag);
  8894. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8895. IF x.kind = SyntaxTree.VarParameter THEN
  8896. ReuseCopy(result.tag,result.op);
  8897. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8898. IntermediateCode.MakeMemory(result.tag,addressType);
  8899. ELSE
  8900. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8901. UseIntermediateOperand(result.tag);
  8902. END;
  8903. ELSE
  8904. result.tag := nil;
  8905. END;
  8906. (* tag for pointer type computed not here but during dereferencing *)
  8907. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  8908. ReleaseIntermediateOperand(result.tag);
  8909. result.tag := basereg;
  8910. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8911. IntermediateCode.MakeMemory(result.tag,addressType);
  8912. UseIntermediateOperand(result.tag);
  8913. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  8914. ReleaseIntermediateOperand(result.tag);
  8915. result.tag := TypeDescriptorAdr(type);
  8916. IF ~newObjectFile THEN
  8917. IntermediateCode.MakeMemory(result.tag,addressType);
  8918. END;
  8919. UseIntermediateOperand(result.tag);
  8920. END;
  8921. IF Trace THEN TraceExit("VisitParameter") END;
  8922. END VisitParameter;
  8923. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8924. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8925. BEGIN
  8926. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8927. (* left.p: left already emitted *)
  8928. tag := result.op; (* value of pointer to left *)
  8929. (* get type desc *)
  8930. tmp := result.tag;
  8931. IntermediateCode.MakeMemory(tmp,addressType);
  8932. (* get method adr *)
  8933. Reuse1(reg,tmp);
  8934. ReleaseIntermediateOperand(tmp);
  8935. IF backend.cooperative THEN
  8936. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8937. WHILE recordType.baseType # NIL DO
  8938. recordType := recordType.GetBaseRecord ();
  8939. END;
  8940. GetRecordTypeName (recordType,name);
  8941. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8942. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8943. offset := 0;
  8944. ELSE
  8945. offset := 2;
  8946. END;
  8947. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8948. ELSE
  8949. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8950. END;
  8951. InitOperand(operand,ModeReference);
  8952. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8953. operand.op := reg;
  8954. operand.tag := tag;
  8955. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8956. END DynamicCallOperand;
  8957. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8958. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8959. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8960. BEGIN
  8961. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8962. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8963. tag := operand.op;
  8964. ReleaseIntermediateOperand(operand.tag);
  8965. ELSE tag := nil
  8966. END;
  8967. IF x.isInline THEN
  8968. sectionType := Sections.InlineCodeSection;
  8969. ELSE
  8970. sectionType := Sections.CodeSection;
  8971. END;
  8972. IF x.externalName # NIL THEN
  8973. Basic.ToSegmentedName(x.externalName^, name);
  8974. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8975. ELSE
  8976. GetCodeSectionNameForSymbol(x, name);
  8977. IF (x.scope.ownerModule = module.module) THEN
  8978. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8979. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8980. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8981. IF source.pc = 0 THEN (* no code yet *)
  8982. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8983. END;
  8984. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8985. bits := x.procedureScope.body.code.inlineCode;
  8986. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8987. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  8988. binary.CopyBits(bits, 0, bits.GetSize());
  8989. source.SetResolved(binary);
  8990. ELSE
  8991. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8992. END;
  8993. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8994. END;
  8995. InitOperand(operand,ModeValue);
  8996. operand.op := reg;
  8997. operand.tag := tag;
  8998. IF Trace THEN TraceExit("StaticCallOperand") END;
  8999. END StaticCallOperand;
  9000. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  9001. (* handle expressions of the form designator.procedure or procedure *)
  9002. BEGIN
  9003. IF Trace THEN TraceEnter("VisitProcedure") END;
  9004. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9005. DynamicCallOperand(result,x);
  9006. ELSIF x.isInline THEN
  9007. StaticCallOperand(result,x);
  9008. ELSE
  9009. StaticCallOperand(result,x);
  9010. END;
  9011. IF Trace THEN TraceExit("VisitProcedure") END;
  9012. END VisitProcedure;
  9013. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  9014. BEGIN
  9015. VisitProcedure(x);
  9016. END VisitOperator;
  9017. (** statements *)
  9018. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  9019. BEGIN
  9020. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9021. Expression(x.call);
  9022. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9023. ReleaseOperand(result)
  9024. END;
  9025. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9026. END VisitProcedureCallStatement;
  9027. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9028. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9029. leftBase, rightBase: SyntaxTree.Type;
  9030. procedureName,s: SyntaxTree.IdentifierString;
  9031. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9032. size: LONGINT; rightKind: LONGINT;
  9033. dummy: IntermediateCode.Operand;
  9034. CONST moduleName = "FoxArrayBase";
  9035. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9036. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9037. BEGIN
  9038. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9039. IF base IS SyntaxTree.MathArrayType THEN
  9040. base := OpenArray(base(SyntaxTree.MathArrayType));
  9041. END;
  9042. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9043. result.SetArrayBase(base);
  9044. RETURN result
  9045. END OpenArray;
  9046. BEGIN
  9047. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9048. SaveRegisters();ReleaseUsedRegisters(saved);
  9049. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9050. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9051. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9052. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9053. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9054. IF leftType.form = SyntaxTree.Tensor THEN
  9055. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9056. ELSIF leftType.form = SyntaxTree.Open THEN
  9057. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9058. ELSIF leftType.form = SyntaxTree.Static THEN
  9059. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9060. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9061. END;
  9062. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9063. IF procedure = NIL THEN
  9064. s := "Instruction not supported on target, emulation procedure ";
  9065. Strings.Append(s,moduleName);
  9066. Strings.Append(s,".");
  9067. Strings.Append(s,procedureName);
  9068. Strings.Append(s," not present");
  9069. Error(position,s);
  9070. ELSE
  9071. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9072. parameter.SetType(leftType);
  9073. parameter.SetAccess(SyntaxTree.Internal);
  9074. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9075. parameter.SetKind(rightKind);
  9076. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9077. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9078. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9079. StaticCallOperand(result,procedure);
  9080. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  9081. ReleaseOperand(result);
  9082. END;
  9083. RestoreRegisters(saved);
  9084. END;
  9085. END AssignMathArray;
  9086. VAR modifyAssignmentCounter := 0: LONGINT;
  9087. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9088. VAR processor,mem,dst: IntermediateCode.Operand;
  9089. BEGIN
  9090. IF value.intValue = true.intValue THEN
  9091. INC(modifyAssignmentCounter);
  9092. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9093. modifyAssignmentsPC := section.pc;
  9094. ELSE
  9095. DEC(modifyAssignmentCounter);
  9096. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9097. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9098. END;
  9099. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9100. dst := NewRegisterOperand (addressType);
  9101. Emit(Mov(position,dst, processor));
  9102. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9103. Emit(Mov(position,mem, value));
  9104. ReleaseIntermediateOperand(dst);
  9105. END ModifyAssignments;
  9106. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9107. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9108. BEGIN
  9109. type := left.type.resolved;
  9110. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9111. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9112. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9113. IF procedureType.returnParameter = parameter THEN
  9114. (* this is the only case where the destination can be dynamically smaller than the source
  9115. in all other cases the dynamic size has to be taken
  9116. *)
  9117. IF backend.cooperative THEN
  9118. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9119. ELSE
  9120. MakeMemory(mem, tag, addressType, 0);
  9121. END;
  9122. RETURN mem;
  9123. END;
  9124. END;
  9125. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9126. END CopySize;
  9127. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9128. VAR
  9129. leftO, rightO: Operand;
  9130. arg,mem, sizeOp: IntermediateCode.Operand;
  9131. leftType, rightType, componentType, base: SyntaxTree.Type;
  9132. size: LONGINT;
  9133. parameters: SyntaxTree.ExpressionList;
  9134. procedure: SyntaxTree.Procedure;
  9135. call: SyntaxTree.ProcedureCallDesignator;
  9136. designator: SyntaxTree.Designator;
  9137. saved: RegisterEntry;
  9138. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9139. VAR procedureType: SyntaxTree.ProcedureType;
  9140. BEGIN
  9141. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9142. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9143. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9144. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9145. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9146. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9147. IF right.id = Global.Reshape THEN RETURN TRUE
  9148. END;
  9149. END;
  9150. END;
  9151. END;
  9152. RETURN FALSE
  9153. END CanPassAsResultParameter;
  9154. BEGIN
  9155. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9156. leftType := left.type.resolved; rightType:= right.type.resolved;
  9157. IF backend.cooperative & left.NeedsTrace() THEN
  9158. ModifyAssignments(true);
  9159. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9160. Designate(right, rightO);
  9161. Designate(left, leftO);
  9162. ASSERT(leftO.mode = ModeReference);
  9163. TransferToRegister(leftO.op, leftO.op);
  9164. TransferToRegister(rightO.op, rightO.op);
  9165. Emit(Push(position, leftO.op));
  9166. Emit(Push(position, rightO.op));
  9167. CallAssignMethod(leftO.op, rightO.op, left.type);
  9168. Emit(Pop(position, rightO.op));
  9169. Emit(Pop(position, leftO.op));
  9170. sizeOp := CopySize(left, leftO.tag);
  9171. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9172. ReleaseIntermediateOperand(sizeOp);
  9173. ReleaseOperand(leftO);
  9174. ReleaseOperand(rightO);
  9175. ELSE
  9176. Evaluate(right,rightO);
  9177. Designate(left,leftO);
  9178. ASSERT(leftO.mode = ModeReference);
  9179. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9180. (* copy procedure address first *)
  9181. MakeMemory(mem,leftO.op,addressType,0);
  9182. Emit(Mov(position,mem,rightO.op));
  9183. ReleaseIntermediateOperand(mem);
  9184. (* copy pointer address *)
  9185. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9186. CallAssignPointer(leftO.tag, rightO.tag);
  9187. ELSE
  9188. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9189. CallAssignPointer(leftO.op, rightO.op);
  9190. END;
  9191. ReleaseOperand(leftO);
  9192. ReleaseOperand(rightO);
  9193. END;
  9194. ModifyAssignments(false);
  9195. RETURN;
  9196. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9197. SaveRegisters();ReleaseUsedRegisters(saved);
  9198. IF SemanticChecker.IsPointerType(leftType) THEN
  9199. Evaluate(right,rightO);
  9200. Designate(left,leftO);
  9201. Emit(Push(position,leftO.op));
  9202. ReleaseOperand(leftO);
  9203. Emit(Push(position,rightO.op));
  9204. ReleaseOperand(rightO);
  9205. CallThis(position,"Heaps","Assign",2);
  9206. ELSIF leftType.IsRecordType() THEN
  9207. Designate(right,rightO);
  9208. Designate(left,leftO);
  9209. Emit(Push(position,leftO.op));
  9210. Emit(Push(position,leftO.tag)); (* type desc *)
  9211. ReleaseOperand(leftO);
  9212. Emit(Push(position,rightO.op));
  9213. ReleaseOperand(rightO);
  9214. CallThis(position,"Heaps","AssignRecord",3);
  9215. ELSIF IsStaticArray(leftType) THEN
  9216. size := StaticArrayNumElements(leftType);
  9217. base := StaticArrayBaseType(leftType);
  9218. Designate(right,rightO);
  9219. Designate(left,leftO);
  9220. Emit(Push(position,leftO.op));
  9221. ReleaseOperand(leftO);
  9222. arg := TypeDescriptorAdr(base);
  9223. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9224. Emit(Push(position,arg));
  9225. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9226. Emit(Push(position,rightO.op));
  9227. ReleaseOperand(rightO);
  9228. CallThis(position,"Heaps","AssignArray",4);
  9229. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9230. size := StaticMathArrayNumElements(leftType);
  9231. base := StaticMathArrayBaseType(leftType);
  9232. Designate(right,rightO);
  9233. Designate(left,leftO);
  9234. Emit(Push(position,leftO.op));
  9235. ReleaseOperand(leftO);
  9236. arg := TypeDescriptorAdr(base);
  9237. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9238. Emit(Push(position,arg));
  9239. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9240. Emit(Push(position,rightO.op));
  9241. ReleaseOperand(rightO);
  9242. CallThis(position,"Heaps","AssignArray",4);
  9243. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9244. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9245. Evaluate(right,rightO);
  9246. Designate(left,leftO);
  9247. MakeMemory(mem,leftO.op,addressType,0);
  9248. Emit(Mov(position,mem,rightO.op));
  9249. ReleaseIntermediateOperand(mem);
  9250. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9251. Emit (Push(position, leftO.tag));
  9252. ReleaseOperand(leftO);
  9253. Emit (Push(position, rightO.tag));
  9254. ReleaseOperand(rightO);
  9255. CallThis(position,"Heaps","Assign", 2);
  9256. ELSE HALT(100); (* missing ? *)
  9257. END;
  9258. RestoreRegisters(saved);
  9259. RETURN;
  9260. END;
  9261. IF CanPassAsResultParameter(right) THEN
  9262. procedureResultDesignator := left(SyntaxTree.Designator);
  9263. Expression(right);
  9264. procedureResultDesignator := NIL;
  9265. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9266. (* left <-- ALIAS OF right: zerocopy *)
  9267. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9268. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9269. designator.SetType(procedure.type);
  9270. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9271. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9272. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9273. END;
  9274. ELSIF leftType IS SyntaxTree.RangeType THEN
  9275. (* LHS is of array range type *)
  9276. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9277. Evaluate(right, rightO);
  9278. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9279. (* first *)
  9280. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9281. Emit(Mov(position,mem, rightO.op));
  9282. ReleaseIntermediateOperand(mem);
  9283. (* last *)
  9284. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9285. Emit(Mov(position,mem, rightO.tag));
  9286. ReleaseIntermediateOperand(mem);
  9287. (* step *)
  9288. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9289. Emit(Mov(position,mem, rightO.extra));
  9290. ReleaseIntermediateOperand(mem);
  9291. ReleaseOperand(rightO);
  9292. ReleaseOperand(leftO)
  9293. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9294. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9295. Evaluate(right, rightO);
  9296. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9297. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9298. (* real part *)
  9299. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9300. Emit(Mov(position,mem, rightO.op));
  9301. ReleaseIntermediateOperand(mem);
  9302. (* imaginary part *)
  9303. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9304. Emit(Mov(position,mem, rightO.tag));
  9305. ReleaseIntermediateOperand(mem);
  9306. ReleaseOperand(rightO);
  9307. ReleaseOperand(leftO)
  9308. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9309. OR (leftType IS SyntaxTree.PortType) THEN
  9310. (* rightO := leftO;*)
  9311. Evaluate(right,rightO);
  9312. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9313. Designate(left,leftO);
  9314. IF leftO.mode = ModeReference THEN
  9315. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9316. destination := mem;
  9317. ELSE
  9318. destination := leftO.op;
  9319. END;
  9320. ReleaseOperand(leftO);
  9321. IF destination.mode # IntermediateCode.Undefined THEN
  9322. Emit(Mov(position,destination,rightO.op));
  9323. END;
  9324. ReleaseOperand(rightO);
  9325. ReleaseIntermediateOperand(mem);
  9326. IntermediateCode.InitOperand(destination);
  9327. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9328. Evaluate(right,rightO);
  9329. Designate(left,leftO);
  9330. MakeMemory(mem,leftO.op,addressType,0);
  9331. Emit(Mov(position,mem,rightO.op));
  9332. ReleaseIntermediateOperand(mem);
  9333. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9334. (* delegate *)
  9335. (*
  9336. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9337. *)
  9338. Emit(Mov(position,leftO.tag,rightO.tag));
  9339. END;
  9340. ReleaseOperand(leftO);
  9341. ReleaseOperand(rightO);
  9342. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9343. Designate(right,rightO);
  9344. Designate(left,leftO);
  9345. sizeOp := CopySize(left, leftO.tag);
  9346. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9347. ReleaseIntermediateOperand(sizeOp);
  9348. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9349. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9350. IF (rightType IS SyntaxTree.StringType) THEN
  9351. CopyString(left,right);
  9352. 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
  9353. Designate(right,rightO);
  9354. Designate(left,leftO);
  9355. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9356. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9357. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9358. ELSE
  9359. HALT(201)
  9360. END;
  9361. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9362. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9363. Designate(right,rightO);
  9364. Designate(left,leftO);
  9365. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9366. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9367. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9368. ELSE
  9369. AssignMathArray(left,right);
  9370. END;
  9371. ELSE
  9372. HALT(200);
  9373. END;
  9374. END Assign;
  9375. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  9376. BEGIN
  9377. IF Trace THEN TraceEnter("VisitAssignment") END;
  9378. Assign(x.left,x.right);
  9379. IF Trace THEN TraceExit("VisitAssignment") END;
  9380. END VisitAssignment;
  9381. PROCEDURE EmitCooperativeSwitch;
  9382. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9383. BEGIN
  9384. ASSERT (cooperativeSwitches);
  9385. pc := section.pc;
  9386. IF lastSwitchPC = section.pc THEN RETURN END;
  9387. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9388. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9389. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9390. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9391. INC(statCoopSwitch, section.pc - pc);
  9392. END EmitCooperativeSwitch;
  9393. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  9394. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9395. BEGIN
  9396. p0 := communication.left; p1 := communication.right;
  9397. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9398. Evaluate(p0,s0);
  9399. Evaluate(p1,s1);
  9400. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9401. Emit(Push(position,s0.op));
  9402. Emit(Push(position,s1.op));
  9403. (*
  9404. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9405. *)
  9406. IF ~backend.cellsAreObjects THEN
  9407. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9408. END;
  9409. ReleaseOperand(s0);
  9410. ReleaseOperand(s1);
  9411. IF backend.cellsAreObjects THEN
  9412. CallThis(position,"ActiveCellsRuntime","Send",2);
  9413. ELSE
  9414. CallThis(position,ChannelModuleName,"Send",2);
  9415. END;
  9416. (* ----- RECEIVE ------*)
  9417. ELSE
  9418. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9419. tmp := p0; p0 := p1; p1 := tmp;
  9420. END;
  9421. Evaluate(p0,s0);
  9422. Emit(Push(position,s0.op));
  9423. Designate(p1,s1);
  9424. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9425. Emit(Push(position,s1.op));
  9426. (*
  9427. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9428. *)
  9429. IF ~backend.cellsAreObjects THEN
  9430. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9431. END;
  9432. ReleaseOperand(s0);
  9433. ReleaseOperand(s1);
  9434. IF backend.cellsAreObjects THEN
  9435. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9436. ELSE
  9437. CallThis(position,ChannelModuleName,"Receive",2)
  9438. END;
  9439. END;
  9440. END VisitCommunicationStatement;
  9441. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  9442. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9443. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9444. VAR true, false: Label; condition, value: BOOLEAN;
  9445. BEGIN
  9446. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9447. IF condition THEN
  9448. true := NewLabel();
  9449. false := NewLabel();
  9450. Condition(if.condition,true,false);
  9451. SetLabel(true);
  9452. StatementSequence(if.statements);
  9453. BrL(end);
  9454. SetLabel(false);
  9455. ELSE
  9456. IF value THEN (* always true *)
  9457. escape := TRUE;
  9458. StatementSequence(if.statements);
  9459. (* no branch necessary -- rest skipped *)
  9460. END;
  9461. END;
  9462. END IfPart;
  9463. BEGIN
  9464. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9465. end := NewLabel();
  9466. elsifs := x.ElsifParts();
  9467. IfPart(x.ifPart);
  9468. FOR i := 0 TO elsifs-1 DO
  9469. IF ~escape THEN
  9470. elsif := x.GetElsifPart(i);
  9471. IfPart(elsif);
  9472. END;
  9473. END;
  9474. IF (x.elsePart # NIL) & ~escape THEN
  9475. StatementSequence(x.elsePart);
  9476. END;
  9477. SetLabel(end);
  9478. IF Trace THEN TraceExit("VisitIfStatement") END;
  9479. END VisitIfStatement;
  9480. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9481. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9482. BEGIN
  9483. (*IF x.variable.type.resolved = x.type.resolved THEN
  9484. (* always true, do nothing *)
  9485. ELSE*)
  9486. Designate(x.variable,res);
  9487. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9488. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9489. END;
  9490. trueL := NewLabel();
  9491. TypeTest(res.tag,x.type,trueL,falseL);
  9492. ReleaseOperand(res);
  9493. SetLabel(trueL);
  9494. StatementSequence(x.statements);
  9495. BrL(endL);
  9496. END WithPart;
  9497. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9498. VAR endL,falseL: Label;i: LONGINT;
  9499. BEGIN
  9500. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9501. endL := NewLabel();
  9502. FOR i := 0 TO x.WithParts()-1 DO
  9503. falseL := NewLabel();
  9504. WithPart(x.GetWithPart(i),falseL,endL);
  9505. SetLabel(falseL);
  9506. END;
  9507. IF x.elsePart = NIL THEN
  9508. IF ~isUnchecked THEN
  9509. EmitTrap(position,WithTrap);
  9510. END;
  9511. ELSE
  9512. StatementSequence(x.elsePart)
  9513. END;
  9514. SetLabel(endL);
  9515. IF Trace THEN TraceExit("VisitWithStatement") END;
  9516. END VisitWithStatement;
  9517. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9518. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9519. out,else: Label; label: Label;
  9520. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9521. symbol: SyntaxTree.Symbol;
  9522. BEGIN
  9523. (*! split case statement into if-elsif statements for large case label lists *)
  9524. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9525. size := x.max-x.min+1;
  9526. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9527. END;
  9528. Evaluate(x.variable,var);
  9529. ReuseCopy(tmp,var.op);
  9530. ReleaseIntermediateOperand(var.op);
  9531. var.op := tmp;
  9532. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9533. Convert(var.op,addressType);
  9534. size := x.max-x.min+1;
  9535. else := NewLabel();
  9536. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9537. (*
  9538. UniqueId(name,module.module,"case",caseId);
  9539. *)
  9540. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9541. Global.GetModuleSegmentedName(module.module, name);
  9542. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9543. symbol := SyntaxTree.NewSymbol(name[1]);
  9544. symbol.SetScope(moduleScope);
  9545. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9546. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9547. section.isCaseTable := TRUE;
  9548. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9549. ReuseCopy(res,var.op);
  9550. ReleaseOperand(var);
  9551. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9552. Emit(Add(position,res,res,jmp));
  9553. IntermediateCode.MakeMemory(res,addressType);
  9554. Emit(Br(position,res));
  9555. ReleaseIntermediateOperand(res);
  9556. out := NewLabel();
  9557. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9558. part := x.GetCasePart(i);
  9559. constant := part.firstConstant;
  9560. label := NewLabel();
  9561. SetLabel(label);
  9562. WHILE(constant # NIL) DO (* case labels for this case part *)
  9563. FOR j := constant.min TO constant.max DO
  9564. fixups[j-x.min] := label;
  9565. END;
  9566. constant := constant.next;
  9567. END;
  9568. StatementSequence(part.statements);
  9569. BrL(out);
  9570. END;
  9571. SetLabel(else);
  9572. FOR i := 0 TO size-1 DO
  9573. IF fixups[i] = NIL THEN
  9574. fixups[i] := else;
  9575. END;
  9576. END;
  9577. IF x.elsePart # NIL THEN
  9578. StatementSequence(x.elsePart);
  9579. ELSIF ~isUnchecked THEN
  9580. EmitTrap(position,CaseTrap);
  9581. END;
  9582. SetLabel(out);
  9583. FOR i := 0 TO size-1 DO
  9584. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9585. section.Emit(Data(position,op));
  9586. END;
  9587. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9588. END VisitCaseStatement;
  9589. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9590. VAR start: Label; true,false: Label;
  9591. BEGIN
  9592. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9593. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9594. start := NewLabel();
  9595. true := NewLabel();
  9596. false := NewLabel();
  9597. SetLabel(start);
  9598. Condition(x.condition,true,false);
  9599. SetLabel(true);
  9600. StatementSequence(x.statements);
  9601. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9602. BrL(start);
  9603. SetLabel(false);
  9604. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9605. END VisitWhileStatement;
  9606. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9607. VAR false,true: Label;
  9608. BEGIN
  9609. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9610. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9611. true := NewLabel();
  9612. false := NewLabel();
  9613. SetLabel(false);
  9614. StatementSequence(x.statements);
  9615. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9616. Condition(x.condition,true,false);
  9617. SetLabel(true);
  9618. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9619. END VisitRepeatStatement;
  9620. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9621. VAR
  9622. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9623. temporaryVariable: SyntaxTree.Variable;
  9624. temporaryVariableDesignator : SyntaxTree.Designator;
  9625. BEGIN
  9626. IF Trace THEN TraceEnter("VisitForStatement") END;
  9627. true := NewLabel();
  9628. false := NewLabel();
  9629. start := NewLabel();
  9630. Assign(x.variable,x.from);
  9631. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9632. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9633. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9634. Assign(temporaryVariableDesignator,x.to);
  9635. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9636. IF by > 0 THEN
  9637. cmp := Scanner.LessEqual
  9638. ELSE
  9639. cmp := Scanner.GreaterEqual
  9640. END;
  9641. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9642. binary.SetType(system.booleanType);
  9643. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9644. SetLabel(start);
  9645. Condition(binary,true,false);
  9646. SetLabel(true);
  9647. StatementSequence(x.statements);
  9648. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9649. binary.SetType(x.variable.type);
  9650. Assign(x.variable,binary);
  9651. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9652. BrL(start);
  9653. SetLabel(false);
  9654. IF Trace THEN TraceExit("VisitForStatement") END;
  9655. END VisitForStatement;
  9656. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9657. VAR prevLoop: Label;
  9658. BEGIN
  9659. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9660. prevLoop := currentLoop;
  9661. currentLoop := NewLabel();
  9662. StatementSequence(x.statements);
  9663. SetLabel(currentLoop);
  9664. currentLoop := prevLoop;
  9665. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9666. END VisitExitableBlock;
  9667. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9668. VAR prevLoop,start: Label;
  9669. BEGIN
  9670. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9671. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9672. start := NewLabel();
  9673. prevLoop := currentLoop;
  9674. SetLabel(start);
  9675. currentLoop := NewLabel();
  9676. StatementSequence(x.statements);
  9677. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9678. BrL(start);
  9679. SetLabel(currentLoop);
  9680. currentLoop := prevLoop;
  9681. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9682. END VisitLoopStatement;
  9683. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9684. VAR outer: SyntaxTree.Statement;
  9685. BEGIN
  9686. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9687. IF locked THEN (* r if we jump out of an exclusive block *)
  9688. outer := x.outer;
  9689. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9690. outer := outer.outer;
  9691. END;
  9692. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9693. Lock(FALSE);
  9694. END;
  9695. END;
  9696. BrL(currentLoop);
  9697. IF Trace THEN TraceExit("VisitExitStatement") END;
  9698. END VisitExitStatement;
  9699. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9700. VAR
  9701. expression, parameterDesignator: SyntaxTree.Expression;
  9702. type, componentType: SyntaxTree.Type;
  9703. res, right: Operand;
  9704. left, mem, reg: IntermediateCode.Operand;
  9705. parameter: SyntaxTree.Parameter;
  9706. procedure: SyntaxTree.Procedure;
  9707. procedureType: SyntaxTree.ProcedureType;
  9708. returnTypeOffset: LONGINT;
  9709. delegate: BOOLEAN;
  9710. map: SymbolMap;
  9711. cc, parametersSize: LONGINT;
  9712. BEGIN
  9713. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9714. expression := x.returnValue;
  9715. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9716. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9717. IF currentIsInline THEN
  9718. IF expression # NIL THEN
  9719. map := currentMapper.Get(NIL);
  9720. IF map # NIL THEN
  9721. Assign(map.to, expression);
  9722. ELSE
  9723. Evaluate(expression,res);
  9724. Emit(Return(position,res.op));
  9725. ReleaseOperand(res);
  9726. END;
  9727. END;
  9728. BrL(currentInlineExit);
  9729. RETURN;
  9730. END;
  9731. IF expression # NIL THEN
  9732. type := expression.type.resolved;
  9733. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9734. IF locked THEN Lock(FALSE) END;
  9735. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9736. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9737. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9738. (* return without structured return parameter *)
  9739. Evaluate(expression,res);
  9740. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9741. IF locked OR profile THEN
  9742. Emit(Push(position,res.op));
  9743. IF delegate THEN HALT(200) END;
  9744. ReleaseOperand(res);
  9745. IF locked THEN Lock(FALSE) END;
  9746. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9747. reg := NewRegisterOperand(res.op.type);
  9748. Emit(Pop(position,reg));
  9749. Emit(Return(position,reg));
  9750. ReleaseIntermediateOperand(reg);
  9751. ELSE
  9752. Emit(Return(position,res.op));
  9753. ReleaseOperand(res);
  9754. END;
  9755. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9756. THEN
  9757. (* return using structured return parameter *)
  9758. 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)
  9759. OR SemanticChecker.IsPointerType(type));
  9760. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9761. parameter :=procedureType.returnParameter;
  9762. ASSERT(parameter # NIL);
  9763. returnTypeOffset := parameter.offsetInBits;
  9764. (*
  9765. IF parameter# NIL THEN
  9766. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9767. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9768. ELSE
  9769. returnTypeOffset := system.offsetFirstParameter
  9770. END;
  9771. *)
  9772. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9773. IF type IS SyntaxTree.RangeType THEN
  9774. (* array range type *)
  9775. Evaluate(expression, right);
  9776. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9777. Emit(Mov(position,mem, right.op)); (* first *)
  9778. ReleaseIntermediateOperand(mem);
  9779. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9780. Emit(Mov(position,mem, right.tag)); (* last *)
  9781. ReleaseIntermediateOperand(mem);
  9782. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9783. Emit(Mov(position,mem, right.extra)); (* step *)
  9784. ReleaseIntermediateOperand(mem);
  9785. ReleaseOperand(right);
  9786. ELSIF type IS SyntaxTree.ComplexType THEN
  9787. Evaluate(expression, right);
  9788. componentType := type(SyntaxTree.ComplexType).componentType;
  9789. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9790. Emit(Mov(position,mem, right.op)); (* real part *)
  9791. ReleaseIntermediateOperand(mem);
  9792. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9793. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9794. ReleaseIntermediateOperand(mem);
  9795. ReleaseOperand(right);
  9796. ELSE (* covers cases: pointer / record / array *)
  9797. parameter := procedureType.returnParameter;
  9798. checker.SetCurrentScope(currentScope);
  9799. ASSERT(parameter # NIL);
  9800. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9801. Assign(parameterDesignator,expression);
  9802. END;
  9803. ReleaseIntermediateOperand(left);
  9804. IF locked THEN Lock(FALSE) END;
  9805. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9806. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9807. parameter := procedureType.returnParameter;
  9808. checker.SetCurrentScope(currentScope);
  9809. IF parameter = NIL THEN
  9810. Error(procedure.position, "structured return of parameter of procedure not found");
  9811. ELSE
  9812. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9813. Assign(parameterDesignator,expression);
  9814. END;
  9815. IF locked THEN Lock(FALSE) END;
  9816. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9817. ELSE
  9818. HALT(200);
  9819. END;
  9820. ELSE
  9821. IF locked THEN Lock(FALSE) END;
  9822. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9823. END;
  9824. IF backend.cooperative THEN
  9825. BrL(exitLabel);
  9826. ELSE
  9827. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  9828. IF cc = SyntaxTree.WinAPICallingConvention THEN
  9829. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9830. ELSE
  9831. parametersSize := 0;
  9832. END;
  9833. EmitLeave(section, position,procedure, procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9834. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention, parametersSize));
  9835. END;
  9836. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9837. END VisitReturnStatement;
  9838. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9839. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9840. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9841. statements: SyntaxTree.StatementSequence;
  9842. name, suffix: SyntaxTree.IdentifierString;
  9843. BEGIN
  9844. Strings.IntToStr(awaitProcCounter,suffix);
  9845. Strings.Concat("@AwaitProcedure",suffix,name);
  9846. identifier := SyntaxTree.NewIdentifier(name);
  9847. INC(awaitProcCounter);
  9848. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9849. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9850. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9851. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9852. procedure.SetAccess(SyntaxTree.Hidden);
  9853. procedure.SetScope(currentScope);
  9854. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9855. procedureType.SetReturnType(system.booleanType);
  9856. procedure.SetType(procedureType);
  9857. body := SyntaxTree.NewBody(x.position,procedureScope);
  9858. procedureScope.SetBody(body);
  9859. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9860. returnStatement.SetReturnValue(x.condition);
  9861. statements := SyntaxTree.NewStatementSequence();
  9862. statements.AddStatement(returnStatement);
  9863. body.SetStatementSequence(statements);
  9864. currentScope.AddProcedure(procedure);
  9865. RETURN procedure
  9866. END MakeAwaitProcedure;
  9867. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9868. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9869. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9870. BEGIN
  9871. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9872. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9873. IF backend.cooperative THEN
  9874. start := NewLabel();
  9875. true := NewLabel();
  9876. false := NewLabel();
  9877. SetLabel(start);
  9878. Condition(x.condition,true,false);
  9879. SetLabel(false);
  9880. PushSelfPointer();
  9881. CallThis(position,"ExclusiveBlocks","Await",1);
  9882. BrL(start);
  9883. SetLabel(true);
  9884. PushSelfPointer();
  9885. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9886. ELSE
  9887. proc := MakeAwaitProcedure(x);
  9888. Emit(Push(position,fp));
  9889. GetCodeSectionNameForSymbol(proc,name);
  9890. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9891. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9892. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9893. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9894. Emit(Result(position,res));
  9895. (*
  9896. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9897. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9898. *)
  9899. InitOperand(result,ModeValue);
  9900. result.op := res;
  9901. label := NewLabel();
  9902. BreqL(label, result.op, SELF.true);
  9903. ReleaseOperand(result);
  9904. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9905. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9906. Emit(Push(position,res));
  9907. Emit(Push(position,fp));
  9908. PushSelfPointer();
  9909. Emit(Push(position,nil));
  9910. CallThis(position,"Objects","Await",4);
  9911. SetLabel(label);
  9912. END;
  9913. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9914. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9915. END VisitAwaitStatement;
  9916. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9917. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9918. BEGIN
  9919. FOR i := 0 TO x.Length() - 1 DO
  9920. statement := x.GetStatement( i );
  9921. Statement(statement);
  9922. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9923. END;
  9924. END StatementSequence;
  9925. PROCEDURE PushSelfPointer;
  9926. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  9927. procedureType: SyntaxTree.ProcedureType;
  9928. BEGIN
  9929. scope := currentScope;
  9930. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9931. scope := scope.outerScope;
  9932. END;
  9933. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9934. IF ~newObjectFile THEN
  9935. Symbol(moduleSelf,op);
  9936. IntermediateCode.MakeMemory(op.op,addressType);
  9937. ELSE
  9938. moduleSection := meta.ModuleSection();
  9939. IF backend.cooperative THEN
  9940. moduleOffset := 0;
  9941. ELSE
  9942. moduleOffset := moduleSection.pc;
  9943. END;
  9944. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9945. END;
  9946. ELSE
  9947. GetBaseRegister(op.op,currentScope,scope);
  9948. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9949. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9950. parametersSize := ProcedureParametersSize(system,procedure);
  9951. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9952. IF backend.cooperative THEN
  9953. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9954. END;
  9955. IntermediateCode.MakeMemory(op.op,addressType);
  9956. END;
  9957. Emit(Push(position,op.op));
  9958. ReleaseOperand(op);
  9959. END PushSelfPointer;
  9960. PROCEDURE Lock(lock: BOOLEAN);
  9961. BEGIN
  9962. IF Trace THEN TraceEnter("Lock") END;
  9963. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9964. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9965. ASSERT(modifyAssignmentCounter = 0);
  9966. IF dump # NIL THEN
  9967. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9968. dump.Ln;dump.Update;
  9969. END;
  9970. PushSelfPointer;
  9971. IF backend.cooperative THEN
  9972. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9973. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9974. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9975. END;
  9976. ELSE
  9977. Emit(Push(position,true));
  9978. IF lock THEN CallThis(position,"Objects","Lock",2)
  9979. ELSE CallThis(position,"Objects","Unlock",2);
  9980. END;
  9981. END;
  9982. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9983. IF Trace THEN TraceExit("Lock") END;
  9984. END Lock;
  9985. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9986. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9987. BEGIN
  9988. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9989. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9990. previouslyUnchecked := isUnchecked;
  9991. isUnchecked := isUnchecked OR x.isUnchecked;
  9992. previouslyCooperativeSwitches := cooperativeSwitches;
  9993. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9994. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9995. IF x.statements # NIL THEN
  9996. StatementSequence(x.statements);
  9997. END;
  9998. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9999. isUnchecked := previouslyUnchecked;
  10000. cooperativeSwitches := previouslyCooperativeSwitches;
  10001. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10002. END VisitStatementBlock;
  10003. PROCEDURE VisitCode(x: SyntaxTree.Code);
  10004. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10005. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10006. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10007. procedure: SyntaxTree.Procedure;
  10008. map: SymbolMap;
  10009. cc, parametersSize: LONGINT;
  10010. BEGIN
  10011. scope := currentScope;
  10012. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10013. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10014. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10015. return := emptyOperand;
  10016. IF Trace THEN TraceEnter("VisitCode") END;
  10017. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10018. NEW(in, x.inRules.Length());
  10019. FOR i := 0 TO LEN(in)-1 DO
  10020. statement := x.inRules.GetStatement(i);
  10021. WITH statement: SyntaxTree.Assignment DO
  10022. Evaluate(statement.right, operand);
  10023. result := operand.op;
  10024. NEW(str, 64);
  10025. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10026. in[i] := result; IntermediateCode.SetString(in[i], str);
  10027. ReleaseIntermediateOperand(operand.tag);
  10028. END;
  10029. END;
  10030. ELSE in := NIL
  10031. END;
  10032. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10033. NEW(out, x.outRules.Length());
  10034. FOR i := 0 TO LEN(out)-1 DO
  10035. statement := x.outRules.GetStatement(i);
  10036. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10037. WITH statement: SyntaxTree.Assignment DO
  10038. Designate(statement.left, operand);
  10039. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10040. NEW(str, 64);
  10041. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10042. out[i] := result; IntermediateCode.SetString(out[i], str);
  10043. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10044. |statement: SyntaxTree.ReturnStatement DO
  10045. NEW(str, 64);
  10046. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10047. IF currentIsInline THEN
  10048. map := currentMapper.Get(NIL);
  10049. Designate(map.to, operand);
  10050. IF map.isAddress THEN
  10051. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10052. ELSE
  10053. result := operand.op;
  10054. END;
  10055. (*! only if it does not fit into register
  10056. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10057. *)
  10058. (*Evaluate(map.to, operand);*)
  10059. out[i] := result;
  10060. ELSE
  10061. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10062. END;
  10063. IntermediateCode.SetString(out[i], str);
  10064. ReleaseIntermediateOperand(operand.tag);
  10065. return := out[i];
  10066. ELSE
  10067. END;
  10068. END;
  10069. ELSE out := NIL
  10070. END;
  10071. Emit(Asm(x.position,x.sourceCode, in, out));
  10072. IF in # NIL THEN
  10073. FOR i := 0 TO LEN(in)-1 DO
  10074. ReleaseIntermediateOperand(in[i]);
  10075. END;
  10076. END;
  10077. IF out # NIL THEN
  10078. FOR i := 0 TO LEN(out)-1 DO
  10079. WITH statement: SyntaxTree.Assignment DO
  10080. ReleaseIntermediateOperand(out[i]);
  10081. |statement: SyntaxTree.ReturnStatement DO
  10082. (* release happens below *)
  10083. ELSE
  10084. END;
  10085. statement := x.outRules.GetStatement(i);
  10086. END;
  10087. END;
  10088. IF return.mode # IntermediateCode.Undefined THEN
  10089. IF currentIsInline THEN
  10090. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10091. Symbol(procedureType.returnParameter, par);
  10092. MakeMemory(mem, par.op, return.type, 0);
  10093. ReleaseOperand(par);
  10094. Emit(Mov(position, mem, return));
  10095. ReleaseIntermediateOperand(mem);
  10096. ELSE
  10097. Emit(Return(position,return));
  10098. END;
  10099. ReleaseIntermediateOperand(return);
  10100. IF currentIsInline THEN RETURN END;
  10101. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10102. IF cc = SyntaxTree.WinAPICallingConvention THEN
  10103. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10104. ELSE
  10105. parametersSize := 0;
  10106. END;
  10107. EmitLeave(section, position,procedure, cc);
  10108. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,cc, parametersSize));
  10109. END;
  10110. IF Trace THEN TraceExit("VisitCode") END;
  10111. END VisitCode;
  10112. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10113. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10114. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10115. const, call: IntermediateCode.Operand;
  10116. parameterDesignator: SyntaxTree.Expression;
  10117. saved: RegisterEntry;
  10118. name: Basic.SegmentedName;
  10119. BEGIN
  10120. IF Trace THEN TraceEnter("ParameterCopies") END;
  10121. parameter := x.firstParameter;
  10122. WHILE parameter # NIL DO
  10123. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10124. type := parameter.type.resolved;
  10125. IF IsOpenArray(type) THEN
  10126. VisitParameter(parameter);
  10127. op := result;
  10128. IF backend.cooperative & parameter.NeedsTrace() THEN
  10129. length := GetArrayLength(type, op.tag);
  10130. size := NewRegisterOperand(addressType);
  10131. base := ArrayBaseType(type);
  10132. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10133. Emit(Mul(position, size, length, const));
  10134. dst := NewRegisterOperand (addressType);
  10135. Emit(Mov(position, dst, size));
  10136. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10137. Emit(Sub(position,dst,sp,dst));
  10138. Emit(And(position,dst,dst,const));
  10139. Emit(Mov(position,sp,dst));
  10140. par := fp;
  10141. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10142. IntermediateCode.InitImmediate(null, byteType, 0);
  10143. Emit(Fill(position, dst, size, null));
  10144. ReleaseIntermediateOperand(dst);
  10145. ReleaseIntermediateOperand(length);
  10146. SaveRegisters();ReleaseUsedRegisters(saved);
  10147. (* register dst has been freed before SaveRegisters already *)
  10148. base := ArrayBaseType(type);
  10149. (* assign method of open array *)
  10150. IF base.IsRecordType() THEN
  10151. Emit (Push(position, length));
  10152. Emit (Push(position, dst));
  10153. Emit (Push(position, op.op));
  10154. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10155. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10156. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10157. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10158. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10159. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10160. Emit (Push(position,length));
  10161. Emit (Push(position, dst));
  10162. Emit (Push(position, length));
  10163. Emit (Push(position, op.op));
  10164. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10165. ELSE
  10166. Emit (Push(position, length));
  10167. Emit (Push(position, dst));
  10168. Emit (Push(position, length));
  10169. Emit (Push(position, op.op));
  10170. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10171. ASSERT(ArrayBaseType(type).IsPointer());
  10172. END;
  10173. RestoreRegisters(saved);
  10174. ELSE
  10175. temp := GetDynamicSize(type,op.tag);
  10176. ReuseCopy(size,temp);
  10177. ReleaseIntermediateOperand(temp);
  10178. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10179. Emit(Sub(position,size,sp,size));
  10180. Emit(And(position,size,size,const));
  10181. Emit(Mov(position,sp,size));
  10182. par := fp;
  10183. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10184. ReleaseIntermediateOperand(size);
  10185. size := GetDynamicSize(type,op.tag);
  10186. END;
  10187. Emit(Copy(position,sp,op.op,size));
  10188. ReleaseIntermediateOperand(size);
  10189. ReleaseOperand(op);
  10190. IntermediateCode.MakeMemory(par,addressType);
  10191. Emit(Mov(position,par,sp));
  10192. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10193. checker.SetCurrentScope(currentScope);
  10194. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10195. Assign(parameterDesignator,parameterDesignator);
  10196. END;
  10197. END;
  10198. parameter := parameter.nextParameter;
  10199. END;
  10200. IF Trace THEN TraceExit("ParameterCopies") END;
  10201. END ParameterCopies;
  10202. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10203. VAR x: SyntaxTree.Variable;
  10204. BEGIN
  10205. x := scope.firstVariable;
  10206. WHILE x # NIL DO
  10207. InitVariable(x,FALSE);
  10208. x := x.nextVariable;
  10209. END;
  10210. END InitVariables;
  10211. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10212. BEGIN
  10213. IF (symbol # NIL) THEN
  10214. RETURN fingerPrinter.SymbolFP(symbol).public
  10215. ELSE
  10216. RETURN 0
  10217. END;
  10218. END GetFingerprint;
  10219. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10220. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10221. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10222. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10223. name: Basic.SegmentedName;
  10224. offset: LONGINT;
  10225. BEGIN
  10226. IF Trace THEN TraceEnter("Body") END;
  10227. ReleaseUsedRegisters(saved); (* just in case ... *)
  10228. section := ir;
  10229. exitLabel := NewLabel ();
  10230. IF moduleBody THEN moduleBodySection := section END;
  10231. IF ir.comments # NIL THEN
  10232. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10233. commentPrintout.SingleStatement(TRUE);
  10234. dump := ir.comments;
  10235. ELSE
  10236. commentPrintout := NIL;
  10237. dump := NIL;
  10238. END;
  10239. prevScope := currentScope;
  10240. currentScope := scope;
  10241. lastSwitchPC := 0;
  10242. cooperativeSwitches := backend.cooperative;
  10243. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10244. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10245. IF x # NIL THEN
  10246. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10247. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10248. IF moduleBody THEN
  10249. ProfilerInit();
  10250. ELSE
  10251. Basic.SegmentedNameToString(ir.name, string);
  10252. ProfilerAddProcedure(numberProcedures,string);
  10253. ProfilerEnterExit(numberProcedures,TRUE);
  10254. END;
  10255. END;
  10256. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10257. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10258. END;
  10259. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10260. IF moduleBody & ~newObjectFile THEN
  10261. InitVariables(moduleScope)
  10262. END;
  10263. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10264. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10265. IF procedure = cellScope.bodyProcedure THEN
  10266. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10267. StaticCallOperand(op, cellScope.constructor);
  10268. Emit(Call(position,op.op,0));
  10269. END;
  10270. END;
  10271. END;
  10272. InitVariables(scope);
  10273. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10274. GetCodeSectionNameForSymbol(procedure, name);
  10275. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10276. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10277. IF ProtectModulesPointers THEN
  10278. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10279. ELSE
  10280. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10281. END;
  10282. IntermediateCode.SetOffset(right,offset); (* tag *)
  10283. IntermediateCode.InitMemory(left,addressType,fp,0);
  10284. Emit(Mov(position, left, right));
  10285. END;
  10286. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10287. ParameterCopies(procedureType);
  10288. IF x.code = NIL THEN
  10289. VisitStatementBlock(x);
  10290. ELSE
  10291. VisitCode(x.code)
  10292. END;
  10293. IF x.finally # NIL THEN (*! mark finally block for object file *)
  10294. ir.SetFinally(ir.pc);
  10295. StatementSequence(x.finally)
  10296. END;
  10297. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10298. IF ~backend.cooperative THEN
  10299. ProfilerEnterExit(numberProcedures,FALSE);
  10300. END;
  10301. INC(numberProcedures);
  10302. END;
  10303. END;
  10304. IF backend.cooperative THEN
  10305. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10306. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10307. END;
  10308. IF x # NIL THEN
  10309. SELF.position := x.position;
  10310. END;
  10311. CheckRegistersFree();
  10312. ASSERT(modifyAssignmentCounter = 0);
  10313. currentScope := prevScope;
  10314. IF Trace THEN TraceExit("Body") END;
  10315. END Body;
  10316. END ImplementationVisitor;
  10317. MetaDataGenerator=OBJECT
  10318. VAR
  10319. implementationVisitor: ImplementationVisitor;
  10320. declarationVisitor: DeclarationVisitor;
  10321. module: Sections.Module;
  10322. moduleName: ARRAY 128 OF CHAR;
  10323. moduleNamePool: Basic.HashTableInt;
  10324. moduleNamePoolSection: IntermediateCode.Section;
  10325. modulePointerSection: IntermediateCode.Section;
  10326. modulePointerSizePC: LONGINT;
  10327. modulePointerSectionOffset: LONGINT;
  10328. modulePointers: LONGINT;
  10329. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  10330. RecordBaseOffset: LONGINT;
  10331. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10332. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10333. TypeTags: LONGINT; (* type extension level support *)
  10334. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10335. patchInfoPC: LONGINT;
  10336. patchCRC: LONGINT;
  10337. CONST
  10338. EmptyBlockOffset = 2;
  10339. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10340. BEGIN
  10341. IF implementationVisitor.backend.cooperative THEN
  10342. TypeTags := MAX(LONGINT);
  10343. BaseTypesTableOffset := 0;
  10344. MethodTableOffset := 2;
  10345. TypeRecordBaseOffset := 0;
  10346. RecordBaseOffset := 0;
  10347. ELSIF simple THEN
  10348. TypeTags := 3; (* only 3 extensions allowed *)
  10349. BaseTypesTableOffset := 1;
  10350. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10351. TypeRecordBaseOffset := 0;
  10352. RecordBaseOffset := 1;
  10353. ELSE
  10354. TypeTags := 16;
  10355. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10356. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10357. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10358. (* change this when Heaps.HeapBlock is modified *)
  10359. RecordBaseOffset := 8;
  10360. END;
  10361. SELF.simple := simple;
  10362. SELF.implementationVisitor := implementationVisitor;
  10363. SELF.declarationVisitor := declarationVisitor;
  10364. implementationVisitor.meta := SELF;
  10365. declarationVisitor.meta := SELF;
  10366. END InitMetaDataGenerator;
  10367. PROCEDURE SetModule(module: Sections.Module);
  10368. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10369. BEGIN
  10370. SELF.module := module;
  10371. Global.GetModuleName(module.module,moduleName);
  10372. Global.GetSymbolSegmentedName(module.module, name);
  10373. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple & ~implementationVisitor.backend.cooperative THEN
  10374. NEW(moduleNamePool, 32);
  10375. (*! require GC protection *)
  10376. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10377. IF ProtectModulesPointers THEN
  10378. name := "Heaps.AnyPtr";
  10379. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10380. (* set base pointer *)
  10381. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10382. END;
  10383. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10384. modulePointers := 0;
  10385. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10386. AddPointer(moduleNamePoolSection, namePoolOffset);
  10387. END;
  10388. END SetModule;
  10389. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10390. BEGIN
  10391. IF ~implementationVisitor.backend.cooperative THEN
  10392. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10393. INC(modulePointers);
  10394. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10395. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10396. END;
  10397. END AddPointer;
  10398. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10399. BEGIN
  10400. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10401. END GetTypeRecordBaseOffset;
  10402. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10403. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10404. BEGIN
  10405. (* change this when Heaps.HeapBlock is modified *)
  10406. INC(dataAdrOffset,6);
  10407. Info(section,"headerAdr");
  10408. Address(section,0);
  10409. Info(section,"typeDesc");
  10410. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10411. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10412. NamedSymbol(section, name, symbol, 0, offset);
  10413. Info(section,"mark: LONGINT;");
  10414. Longint(section,-1);
  10415. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10416. Info(section,"dataAdr-: ADDRESS");
  10417. Symbol(section,section, dataAdrOffset,0);
  10418. Info(section,"size-: SIZE");
  10419. Address(section,0);
  10420. Info(section,"nextMark: HeapBlock;");
  10421. Address(section,0);
  10422. END HeapBlock;
  10423. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10424. VAR i: LONGINT;
  10425. BEGIN
  10426. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10427. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10428. Info(section,"count*: LONGINT");
  10429. Longint(section,0);
  10430. Info(section,"locked*: BOOLEAN");
  10431. Longint(section,0);
  10432. Info(section,"awaitingLock*: ProcessQueue");
  10433. Address(section,0);
  10434. Address(section,0);
  10435. Info(section,"awaitingCond*: ProcessQueue");
  10436. Address(section,0);
  10437. Address(section,0);
  10438. Info(section,"lockedBy*: ANY");
  10439. Address(section,0);
  10440. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10441. Longint(section,1);
  10442. FOR i := 2 TO 6 DO
  10443. Longint(section,0);
  10444. END;
  10445. Info(section,"lock*: ANY");
  10446. Address(section,0);
  10447. END ProtectedHeapBlock;
  10448. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10449. BEGIN
  10450. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10451. END Info;
  10452. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10453. VAR op: IntermediateCode.Operand;
  10454. BEGIN
  10455. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10456. section.Emit(Data(Basic.invalidPosition,op));
  10457. END Address;
  10458. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10459. VAR op: IntermediateCode.Operand;
  10460. BEGIN
  10461. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10462. section.Emit(Data(Basic.invalidPosition,op));
  10463. END Size;
  10464. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10465. VAR op: IntermediateCode.Operand;
  10466. BEGIN
  10467. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10468. section.Emit(Data(Basic.invalidPosition,op));
  10469. END Set;
  10470. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10471. VAR op: IntermediateCode.Operand;
  10472. BEGIN
  10473. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10474. section.Emit(Data(Basic.invalidPosition,op));
  10475. END Longint;
  10476. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10477. VAR op,noOperand: IntermediateCode.Operand;
  10478. BEGIN
  10479. IntermediateCode.InitOperand(noOperand);
  10480. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10481. section.PatchOperands(pc,op,noOperand,noOperand);
  10482. END PatchAddress;
  10483. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10484. VAR op,noOperand: IntermediateCode.Operand;
  10485. BEGIN
  10486. IntermediateCode.InitOperand(noOperand);
  10487. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10488. section.PatchOperands(pc,op,noOperand,noOperand);
  10489. END PatchSize;
  10490. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10491. VAR op,noOperand: IntermediateCode.Operand;
  10492. BEGIN
  10493. IntermediateCode.InitOperand(noOperand);
  10494. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10495. section.PatchOperands(pc,op,noOperand,noOperand);
  10496. END PatchLongint;
  10497. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10498. VAR op, noOperand: IntermediateCode.Operand;
  10499. BEGIN
  10500. IntermediateCode.InitOperand(noOperand);
  10501. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10502. section.PatchOperands(pc,op,noOperand,noOperand);
  10503. END PatchSymbol;
  10504. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10505. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10506. BEGIN
  10507. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10508. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10509. section.Emit(Data(Basic.invalidPosition,op));
  10510. END Boolean;
  10511. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10512. VAR op: IntermediateCode.Operand;
  10513. BEGIN
  10514. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10515. section.Emit(Data(Basic.invalidPosition,op));
  10516. END Char;
  10517. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10518. VAR op: IntermediateCode.Operand;
  10519. BEGIN
  10520. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10521. section.Emit(Data(Basic.invalidPosition,op));
  10522. END Integer;
  10523. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10524. VAR i: LONGINT;
  10525. BEGIN
  10526. Info(section,str);
  10527. i := 0;
  10528. WHILE(str[i] # 0X) DO
  10529. Char(section,str[i]);
  10530. INC(i);
  10531. END;
  10532. Char(section,0X);
  10533. END String;
  10534. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10535. VAR s: Basic.SectionName;
  10536. BEGIN
  10537. StringPool.GetString(str, s);
  10538. String(section, s);
  10539. END String0;
  10540. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10541. VAR op: IntermediateCode.Operand;
  10542. BEGIN
  10543. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10544. IntermediateCode.SetOffset(op,realOffset);
  10545. section.Emit(Data(Basic.invalidPosition,op));
  10546. END NamedSymbol;
  10547. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10548. VAR op: IntermediateCode.Operand;
  10549. BEGIN
  10550. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10551. IntermediateCode.SetOffset(op,realOffset);
  10552. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10553. END NamedSymbolAt;
  10554. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10555. BEGIN
  10556. IF symbol= NIL THEN
  10557. Address( section, realOffset);
  10558. ASSERT(virtualOffset = 0);
  10559. ELSE
  10560. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10561. END;
  10562. END Symbol;
  10563. (* OutPointers delivers
  10564. {pointerOffset}
  10565. *)
  10566. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10567. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10568. BEGIN
  10569. type := type.resolved;
  10570. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10571. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10572. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10573. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10574. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10575. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10576. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10577. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10578. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10579. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10580. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10581. ELSIF (type IS SyntaxTree.RecordType) THEN
  10582. (* never treat a record like a pointer, even if the pointer field is set! *)
  10583. WITH type: SyntaxTree.RecordType DO
  10584. base := type.GetBaseRecord();
  10585. IF base # NIL THEN
  10586. Pointers(offset,symbol,section, base,numberPointers);
  10587. END;
  10588. variable := type.recordScope.firstVariable;
  10589. WHILE(variable # NIL) DO
  10590. IF ~(variable.untraced) THEN
  10591. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10592. END;
  10593. variable := variable.nextVariable;
  10594. END;
  10595. END;
  10596. ELSIF (type IS SyntaxTree.CellType) THEN
  10597. WITH type: SyntaxTree.CellType DO
  10598. base := type.GetBaseRecord();
  10599. IF base # NIL THEN
  10600. Pointers(offset,symbol,section, base,numberPointers);
  10601. END;
  10602. variable := type.cellScope.firstVariable;
  10603. WHILE(variable # NIL) DO
  10604. IF ~(variable.untraced) THEN
  10605. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10606. END;
  10607. variable := variable.nextVariable;
  10608. END;
  10609. property := type.firstProperty;
  10610. WHILE(property # NIL) DO
  10611. IF ~(property.untraced) THEN
  10612. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10613. END;
  10614. property := property.nextProperty;
  10615. END;
  10616. parameter := type.firstParameter;
  10617. WHILE(parameter # NIL) DO
  10618. IF ~(parameter.untraced) THEN
  10619. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10620. END;
  10621. parameter := parameter.nextParameter;
  10622. END;
  10623. END;
  10624. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10625. WITH type: SyntaxTree.ArrayType DO
  10626. IF type.form= SyntaxTree.Static THEN
  10627. n := type.staticLength;
  10628. base := type.arrayBase.resolved;
  10629. WHILE(base IS SyntaxTree.ArrayType) DO
  10630. type := base(SyntaxTree.ArrayType);
  10631. n := n* type.staticLength;
  10632. base := type.arrayBase.resolved;
  10633. END;
  10634. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10635. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10636. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10637. FOR i := 0 TO n-1 DO
  10638. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10639. END;
  10640. END;
  10641. ELSE
  10642. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10643. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10644. END;
  10645. END;
  10646. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10647. WITH type: SyntaxTree.MathArrayType DO
  10648. IF type.form = SyntaxTree.Static THEN
  10649. n := type.staticLength;
  10650. base := type.arrayBase.resolved;
  10651. WHILE(base IS SyntaxTree.MathArrayType) DO
  10652. type := base(SyntaxTree.MathArrayType);
  10653. n := n* type.staticLength;
  10654. base := type.arrayBase.resolved;
  10655. END;
  10656. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10657. IF SemanticChecker.ContainsPointer(base) THEN
  10658. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10659. FOR i := 0 TO n-1 DO
  10660. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10661. END;
  10662. END;
  10663. ELSE
  10664. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10665. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10666. END
  10667. END;
  10668. (* ELSE no pointers in type *)
  10669. END;
  10670. END Pointers;
  10671. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10672. VAR position,i: LONGINT; ch: CHAR;
  10673. BEGIN
  10674. IF pool.Has(index) THEN
  10675. RETURN pool.GetInt(index)
  10676. ELSE
  10677. position := source.pc;
  10678. pool.PutInt(index, position);
  10679. Info(source, name);
  10680. i := 0;
  10681. REPEAT
  10682. ch := name[i]; INC(i);
  10683. Char( source, ch);
  10684. UNTIL ch = 0X;
  10685. END;
  10686. RETURN position;
  10687. END EnterDynamicName;
  10688. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10689. VAR name: Basic.SectionName; position: LONGINT;
  10690. BEGIN
  10691. IF pool.Has(index) THEN
  10692. RETURN pool.GetInt(index)
  10693. ELSE
  10694. StringPool.GetString(index, name);
  10695. position := EnterDynamicName(source,name,index, pool);
  10696. END;
  10697. RETURN position;
  10698. END DynamicName;
  10699. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10700. VAR section: IntermediateCode.Section;
  10701. BEGIN
  10702. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10703. IF implementationVisitor.backend.cooperative THEN
  10704. Info(section, "TypeDescriptor");
  10705. Basic.ToSegmentedName("BaseTypes.Array", name);
  10706. NamedSymbol(section, name,NIL, 0, 0);
  10707. BasePointer(section);
  10708. offset := 0;
  10709. ELSE
  10710. IF ProtectModulesPointers THEN
  10711. HeapBlock(mName,typeName,section,2);
  10712. END;
  10713. Info(section, "HeapBlock");
  10714. IF ProtectModulesPointers THEN
  10715. Symbol(section,section,2,0);
  10716. ELSE
  10717. Address(section,0);
  10718. END;
  10719. Info(section, "TypeDescriptor");
  10720. Address(section,0);
  10721. offset := section.pc;
  10722. END;
  10723. RETURN section
  10724. END NamedBlock;
  10725. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10726. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10727. BEGIN
  10728. COPY(moduleName,name);
  10729. Strings.Append(name,suffix);
  10730. Basic.ToSegmentedName(name, pooledName);
  10731. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10732. END Block;
  10733. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10734. VAR name: Basic.SegmentedName;
  10735. BEGIN
  10736. Info(source,"ArrayHeader");
  10737. IF implementationVisitor.backend.cooperative THEN
  10738. sizePC := source.pc;
  10739. Address(source,0);
  10740. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10741. IF baseType # "" THEN
  10742. Basic.ToSegmentedName(baseType, name);
  10743. NamedSymbol(source, name,NIL, 0, 0);
  10744. ELSE
  10745. Address(source,0);
  10746. END;
  10747. Address(source,0);
  10748. ELSE
  10749. Address(source,0);
  10750. Address(source,0);
  10751. (* first pointer for GC *)
  10752. IF hasPointer THEN
  10753. (* points to first element in the array, this is NOT the base type descriptor *)
  10754. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10755. ELSE
  10756. Address(source,0);
  10757. END;
  10758. sizePC := source.pc;
  10759. Address(source,0);
  10760. Info(source,"array data");
  10761. END;
  10762. END ArrayBlock;
  10763. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10764. BEGIN
  10765. IF implementationVisitor.backend.cooperative THEN
  10766. PatchSize(section, pc, size);
  10767. PatchSize(section, pc + 3, size);
  10768. ELSE
  10769. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10770. PatchSize(section, pc, size);
  10771. END;
  10772. END PatchArray;
  10773. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10774. VAR
  10775. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10776. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10777. poolMap: Basic.HashTableInt;
  10778. namePool: IntermediateCode.Section;
  10779. namePoolOffset: LONGINT;
  10780. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10781. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10782. BEGIN
  10783. Basic.SegmentedNameToString(s1.name,n1);
  10784. Basic.SegmentedNameToString(s2.name,n2);
  10785. index := 0;
  10786. ch1 := n1[index];
  10787. ch2 := n2[index];
  10788. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10789. INC(index);
  10790. ch1 := n1[index];
  10791. ch2 := n2[index];
  10792. END;
  10793. RETURN ch1 < ch2;
  10794. END Compare;
  10795. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10796. VAR
  10797. i, j: LONGINT;
  10798. x, t: Sections.Section;
  10799. BEGIN
  10800. IF lo < hi THEN
  10801. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10802. WHILE i <= j DO
  10803. WHILE Compare(list[i], x) DO INC(i) END;
  10804. WHILE Compare(x, list[j]) DO DEC(j) END;
  10805. IF i <= j THEN
  10806. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10807. INC(i); DEC(j)
  10808. END
  10809. END;
  10810. IF lo < j THEN QuickSort(list, lo, j) END;
  10811. IF i < hi THEN QuickSort(list, i, hi) END
  10812. END;
  10813. END QuickSort;
  10814. (*
  10815. ExportDesc* = RECORD
  10816. fp*: ADDRESS;
  10817. name* {UNTRACED}: DynamicName;
  10818. adr*: ADDRESS;
  10819. exports*: LONGINT;
  10820. dsc* {UNTRACED}: ExportArray
  10821. END;
  10822. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10823. *)
  10824. PROCEDURE ExportDesc2(
  10825. source: IntermediateCode.Section;
  10826. namePool: IntermediateCode.Section;
  10827. fingerPrinter: FingerPrinter.FingerPrinter;
  10828. symbol: Sections.Section;
  10829. name: StringPool.Index;
  10830. VAR patchAdr: LONGINT
  10831. ): BOOLEAN;
  10832. VAR fingerPrint: SyntaxTree.FingerPrint;
  10833. BEGIN
  10834. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10835. & (symbol.type # Sections.InlineCodeSection)
  10836. THEN
  10837. *)
  10838. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10839. & (symbol.type # Sections.InlineCodeSection))
  10840. THEN
  10841. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10842. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10843. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10844. Longint(source,fingerPrint.public);
  10845. ELSE
  10846. Longint(source, 0);
  10847. END;
  10848. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10849. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10850. Symbol(source, symbol,0,0);
  10851. patchAdr := source.pc;
  10852. Longint(source, 0);
  10853. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10854. Address(source,0);
  10855. END;
  10856. RETURN TRUE
  10857. ELSE
  10858. RETURN FALSE
  10859. END;
  10860. END ExportDesc2;
  10861. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10862. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10863. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10864. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  10865. nextPatch: LONGINT;
  10866. TYPE
  10867. Scope = RECORD
  10868. elements: LONGINT;
  10869. gelements: LONGINT;
  10870. section: IntermediateCode.Section;
  10871. patchAdr: LONGINT;
  10872. arraySizePC: LONGINT;
  10873. beginPC: LONGINT; (* current scope start pc *)
  10874. END;
  10875. BEGIN
  10876. Basic.InitSegmentedName(prev);
  10877. olevel := -1;
  10878. scopes[0].section := source;
  10879. scopes[0].arraySizePC := MIN(LONGINT);
  10880. FOR s := 0 TO LEN(sections)-1 DO
  10881. symbol := sections[s];
  10882. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10883. this := sections[s].name;
  10884. level := 0;
  10885. WHILE (this[level] > 0) DO
  10886. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10887. INC(level);
  10888. END;
  10889. WHILE level < olevel DO
  10890. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10891. IF olevel > 0 THEN
  10892. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10893. nextPatch := scopes[olevel-1].patchAdr+1;
  10894. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10895. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10896. END;
  10897. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10898. DEC(olevel);
  10899. END;
  10900. IF (this[level] > 0) THEN
  10901. IF level > olevel THEN
  10902. (*TRACE("opening",level); *)
  10903. IF scopes[level].section = NIL THEN
  10904. arrayName := ".@ExportArray";
  10905. Strings.AppendInt(arrayName, level);
  10906. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  10907. AddPointer(scopes[level].section,offset);
  10908. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  10909. END;
  10910. scopes[level].beginPC := scopes[level].section.pc;
  10911. olevel := level;
  10912. scopes[olevel].elements := 0;
  10913. END;
  10914. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10915. sym := sections[s];
  10916. ELSE
  10917. sym := NIL;
  10918. END;
  10919. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10920. THEN
  10921. INC(scopes[olevel].elements);
  10922. END;
  10923. (* enter string in scope *)
  10924. INC(level);
  10925. END;
  10926. END;
  10927. Basic.SegmentedNameToString(this, name);
  10928. prev := this;
  10929. END;
  10930. END;
  10931. WHILE 0 <= olevel DO
  10932. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10933. IF olevel > 0 THEN
  10934. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10935. nextPatch := scopes[olevel-1].patchAdr+1;
  10936. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10937. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10938. END;
  10939. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10940. DEC(olevel);
  10941. END;
  10942. level := 0;
  10943. WHILE (level < LEN(scopes)) DO
  10944. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  10945. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10946. END;
  10947. INC(level);
  10948. END;
  10949. END Export;
  10950. BEGIN
  10951. NEW(fingerPrinter);
  10952. NEW(poolMap, 64);
  10953. (* 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 *)
  10954. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10955. NEW(sectionArray, module.allSections.Length());
  10956. FOR i := 0 TO module.allSections.Length() - 1 DO
  10957. section := module.allSections.GetSection(i);
  10958. sectionArray[i] := section;
  10959. END;
  10960. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10961. Export(sectionArray^);
  10962. END ExportDesc;
  10963. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10964. VAR
  10965. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10966. BEGIN
  10967. Info(source, "exception table offsets array descriptor");
  10968. size := 0;
  10969. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  10970. Info(source, "exception table content");
  10971. FOR i := 0 TO module.allSections.Length() - 1 DO
  10972. p := module.allSections.GetSection(i);
  10973. IF p.type = Sections.CodeSection THEN
  10974. finallyPC := p(IntermediateCode.Section).finally;
  10975. IF finallyPC>=0 THEN
  10976. Symbol( source, p, 0,0);
  10977. Symbol( source, p, finallyPC, 0);
  10978. Symbol( source, p, finallyPC,0);
  10979. INC(size);
  10980. END;
  10981. END
  10982. END;
  10983. PatchArray(source,sizePC,size);
  10984. END ExceptionArray;
  10985. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10986. VAR i: LONGINT; ch: CHAR;
  10987. BEGIN
  10988. i := 0;
  10989. REPEAT
  10990. ch := name[i]; INC(i);
  10991. Char( section, ch);
  10992. UNTIL ch = 0X;
  10993. WHILE i < 32 DO
  10994. Char( section, 0X); INC(i);
  10995. END;
  10996. END Name;
  10997. PROCEDURE References(section: IntermediateCode.Section);
  10998. CONST
  10999. sfTypeNone = 0X;
  11000. sfTypeCHAR = 01X;
  11001. sfTypeCHAR8 = 02X;
  11002. sfTypeCHAR16 = 03X;
  11003. sfTypeCHAR32 = 04X;
  11004. sfTypeRANGE = 05X;
  11005. sfTypeSHORTINT = 06X;
  11006. sfTypeINTEGER = 07X;
  11007. sfTypeLONGINT = 08X;
  11008. sfTypeHUGEINT = 09X;
  11009. sfTypeWORD = 0AX;
  11010. sfTypeLONGWORD = 0BX;
  11011. sfTypeSIGNED8 = 0CX;
  11012. sfTypeSIGNED16 = 0DX;
  11013. sfTypeSIGNED32 = 0EX;
  11014. sfTypeSIGNED64 = 0FX;
  11015. sfTypeUNSIGNED8 = 10X;
  11016. sfTypeUNSIGNED16 = 11X;
  11017. sfTypeUNSIGNED32 = 12X;
  11018. sfTypeUNSIGNED64 = 13X;
  11019. sfTypeREAL = 14X;
  11020. sfTypeLONGREAL = 15X;
  11021. sfTypeCOMPLEX = 16X;
  11022. sfTypeLONGCOMPLEX = 17X;
  11023. sfTypeBOOLEAN = 18X;
  11024. sfTypeSET = 19X;
  11025. sfTypeANY = 1AX;
  11026. sfTypeOBJECT = 1BX;
  11027. sfTypeBYTE = 1CX;
  11028. sfTypeADDRESS = 1DX;
  11029. sfTypeSIZE = 1EX;
  11030. sfTypeIndirect = 1FX;
  11031. sfTypeRecord = 20X;
  11032. sfTypePointerToRecord = 21X;
  11033. sfTypePointerToArray = 22X;
  11034. sfTypeOpenArray = 23X;
  11035. sfTypeStaticArray = 24X;
  11036. sfTypeDynamicArray = 25X;
  11037. sfTypeMathStaticArray = 26X;
  11038. sfTypeMathOpenArray = 27X;
  11039. sfTypeMathTensor = 28X;
  11040. sfTypeDelegate = 29X;
  11041. sfTypeENUM = 2AX;
  11042. sfTypeCELL = 2BX;
  11043. sfTypePORT = 2CX;
  11044. sfIN = 0X;
  11045. sfOUT = 1X;
  11046. flagDelegate = 0;
  11047. flagConstructor = 1;
  11048. (* variable / parameter addressing modes *)
  11049. sfAbsolute = 0X; (* global vars *)
  11050. sfRelative = 1X; (* variables, value parameters *)
  11051. sfIndirect = 2X; (* var parameters *)
  11052. sfScopeBegin = 0F0X;
  11053. sfScopeEnd = 0F1X;
  11054. sfProcedure = 0F2X;
  11055. sfVariable = 0F3X;
  11056. sfTypeDeclaration = 0F4X;
  11057. sfModule = 0FFX;
  11058. RefInfo = TRUE;
  11059. VAR
  11060. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11061. indirectTypes: Basic.HashTable;
  11062. PROCEDURE CurrentIndex(): LONGINT;
  11063. VAR i: LONGINT;
  11064. BEGIN
  11065. FOR i := startPC TO section.pc -1 DO
  11066. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11067. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11068. END;
  11069. startPC := section.pc;
  11070. RETURN lastOffset;
  11071. END CurrentIndex;
  11072. (*
  11073. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11074. Module = sfModule prevSymbol:SIZE name:String Scope.
  11075. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11076. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11077. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11078. Type =
  11079. sfTypePointerToRecord
  11080. | sfTypePointerToArray Type
  11081. | sfTypeOpenArray Type
  11082. | sfTypeDynamicArray Type
  11083. | sfTypeStaticArray length:SIZE Type
  11084. | sfTypeMathOpenArray Type
  11085. | sfTypeMathStaticArray length:SIZE Type
  11086. | sfTypeMathTensor Type
  11087. | sfTypeRecord tdAdr:ADDRESS
  11088. | sfTypeDelegate {Parameter} return:Type
  11089. | sfTypePort (sfIN | sfOUT)
  11090. | sfTypeBOOLEAN
  11091. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11092. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11093. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11094. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11095. | sfTypeWORD | sfTypeLONGWORD
  11096. | sfTypeREAL | sfTypeLONGREAL
  11097. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11098. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11099. | sfTypeIndirect offset:SIZE.
  11100. *)
  11101. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11102. VAR offset: SIZE;
  11103. BEGIN
  11104. IF indirectTypes.Has(type) THEN
  11105. offset := indirectTypes.GetInt(type);
  11106. Char(section, sfTypeIndirect);
  11107. Size(section, offset);
  11108. RETURN TRUE;
  11109. ELSE
  11110. indirectTypes.PutInt(type, CurrentIndex());
  11111. RETURN FALSE;
  11112. END;
  11113. END Indirect;
  11114. PROCEDURE NType(type: SyntaxTree.Type);
  11115. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11116. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11117. BEGIN
  11118. IF type = NIL THEN
  11119. Char(section, sfTypeNone)
  11120. ELSE
  11121. type := type.resolved;
  11122. size := type.sizeInBits;
  11123. WITH type:SyntaxTree.PointerType DO
  11124. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11125. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11126. Char(section, sfTypePointerToRecord);
  11127. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11128. ELSE
  11129. IF RefInfo THEN Info(section,"PointerToArray") END;
  11130. Char(section, sfTypePointerToArray);
  11131. NType(type.pointerBase);
  11132. END;
  11133. | type: SyntaxTree.ArrayType DO
  11134. IF ~Indirect(type) THEN
  11135. IF type.form = SyntaxTree.Open THEN
  11136. IF RefInfo THEN Info(section,"OpenArray") END;
  11137. Char(section, sfTypeOpenArray);
  11138. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11139. IF RefInfo THEN Info(section,"DynamicArray") END;
  11140. Char(section, sfTypeDynamicArray);
  11141. ELSIF type.form = SyntaxTree.Static THEN
  11142. IF RefInfo THEN Info(section,"StaticArray") END;
  11143. Char(section, sfTypeStaticArray);
  11144. Size(section, type.staticLength);
  11145. ELSE
  11146. HALT(100);
  11147. END;
  11148. NType(type.arrayBase);
  11149. END;
  11150. | type: SyntaxTree.MathArrayType DO
  11151. IF ~Indirect(type) THEN
  11152. IF type.form = SyntaxTree.Open THEN
  11153. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11154. Char(section, sfTypeMathOpenArray);
  11155. ELSIF type.form = SyntaxTree.Static THEN
  11156. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11157. Char(section, sfTypeMathStaticArray);
  11158. Size(section, type.staticLength);
  11159. ELSIF type.form = SyntaxTree.Tensor THEN
  11160. IF RefInfo THEN Info(section,"MathTensor") END;
  11161. Char(section, sfTypeMathTensor);
  11162. ELSE
  11163. HALT(100);
  11164. END;
  11165. NType(type.arrayBase);
  11166. END;
  11167. | type: SyntaxTree.RecordType DO
  11168. IF ~Indirect(type) THEN
  11169. IF type.pointerType # NIL (* OBJECT *) THEN
  11170. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11171. Char(section, sfTypePointerToRecord)
  11172. ELSE
  11173. IF RefInfo THEN Info(section,"Record") END;
  11174. Char(section, sfTypeRecord);
  11175. td := type.typeDeclaration;
  11176. IF RefInfo THEN Info(section,"TD") END;
  11177. IF (td # NIL) THEN
  11178. Global.GetSymbolSegmentedName(td,segmentedName);
  11179. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11180. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11181. ELSE
  11182. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11183. END;
  11184. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11185. Symbol(section, tir, 0, offset);
  11186. ELSE
  11187. Address(section, 0);
  11188. END;
  11189. END;
  11190. END;
  11191. | type: SyntaxTree.CellType DO
  11192. IF ~Indirect(type) THEN
  11193. IF RefInfo THEN Info(section,"Record") END;
  11194. Char(section, sfTypeRecord);
  11195. td := type.typeDeclaration;
  11196. IF RefInfo THEN Info(section,"TD") END;
  11197. IF (td # NIL) THEN
  11198. Global.GetSymbolSegmentedName(td,segmentedName);
  11199. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11200. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11201. ELSE
  11202. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11203. END;
  11204. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11205. Symbol(section, tir, 0, offset);
  11206. ELSE
  11207. Address(section, 0);
  11208. END;
  11209. END;
  11210. | type: SyntaxTree.PortType DO
  11211. Char(section, sfTypePORT);
  11212. IF type.direction = SyntaxTree.OutPort THEN
  11213. Char(section, sfOUT)
  11214. ELSE
  11215. Char(section, sfIN)
  11216. END;
  11217. | type: SyntaxTree.ProcedureType DO
  11218. IF ~Indirect(type) THEN
  11219. Char(section, sfTypeDelegate);
  11220. parameter := type.firstParameter;
  11221. WHILE(parameter # NIL) DO
  11222. NParameter(parameter, -1);
  11223. parameter := parameter.nextParameter;
  11224. END;
  11225. NType(type.returnType);
  11226. END;
  11227. | type:SyntaxTree.EnumerationType DO
  11228. Char(section, sfTypeENUM);
  11229. | type: SyntaxTree.BasicType DO
  11230. WITH type: SyntaxTree.BooleanType DO
  11231. IF RefInfo THEN Info(section,"Boolean") END;
  11232. Char(section, sfTypeBOOLEAN);
  11233. | type: SyntaxTree.CharacterType DO
  11234. IF type = module.system.characterType THEN
  11235. IF RefInfo THEN Info(section,"CHAR") END;
  11236. Char(section, sfTypeCHAR);
  11237. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11238. IF RefInfo THEN Info(section,"CHAR8") END;
  11239. Char(section, sfTypeCHAR8)
  11240. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11241. IF RefInfo THEN Info(section,"CHAR16") END;
  11242. Char(section, sfTypeCHAR16);
  11243. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11244. IF RefInfo THEN Info(section,"CHAR32") END;
  11245. Char(section, sfTypeCHAR32);
  11246. ELSE
  11247. HALT(100);
  11248. END;
  11249. |type: SyntaxTree.IntegerType DO
  11250. IF type(SyntaxTree.IntegerType).signed THEN
  11251. IF (type = module.system.shortintType) THEN
  11252. IF RefInfo THEN Info(section,"SHORTINT") END;
  11253. Char(section, sfTypeSHORTINT)
  11254. ELSIF (type = module.system.integerType) THEN
  11255. IF RefInfo THEN Info(section,"INTEGER") END;
  11256. Char(section, sfTypeINTEGER)
  11257. ELSIF (type = module.system.longintType) THEN
  11258. IF RefInfo THEN Info(section,"LONGINT") END;
  11259. Char(section, sfTypeLONGINT)
  11260. ELSIF (type = module.system.hugeintType) THEN
  11261. IF RefInfo THEN Info(section,"HUGEINT") END;
  11262. Char(section, sfTypeHUGEINT)
  11263. ELSIF (type = module.system.wordType) THEN
  11264. IF RefInfo THEN Info(section,"WORD") END;
  11265. Char(section, sfTypeWORD)
  11266. ELSIF (type = module.system.longWordType) THEN
  11267. IF RefInfo THEN Info(section,"LONGWORD") END;
  11268. Char(section, sfTypeLONGWORD);
  11269. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11270. IF RefInfo THEN Info(section,"SIGNED8") END;
  11271. Char(section, sfTypeSIGNED8)
  11272. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11273. IF RefInfo THEN Info(section,"SIGNED16") END;
  11274. Char(section, sfTypeSIGNED16)
  11275. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11276. IF RefInfo THEN Info(section,"SIGNED32") END;
  11277. Char(section, sfTypeSIGNED32)
  11278. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11279. IF RefInfo THEN Info(section,"SIGNED64") END;
  11280. Char(section, sfTypeSIGNED64)
  11281. ELSE
  11282. HALT(100);
  11283. END
  11284. ELSE (* unsigned *)
  11285. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11286. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11287. Char(section, sfTypeUNSIGNED8)
  11288. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11289. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11290. Char(section, sfTypeUNSIGNED16)
  11291. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11292. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11293. Char(section, sfTypeUNSIGNED32)
  11294. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11295. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11296. Char(section, sfTypeUNSIGNED64)
  11297. ELSE
  11298. HALT(100)
  11299. END
  11300. END;
  11301. | type: SyntaxTree.FloatType DO
  11302. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11303. IF RefInfo THEN Info(section,"REAL") END;
  11304. Char(section, sfTypeREAL);
  11305. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11306. IF RefInfo THEN Info(section,"LONGREAL") END;
  11307. Char(section, sfTypeLONGREAL);
  11308. ELSE
  11309. HALT(100);
  11310. END;
  11311. |type: SyntaxTree.ComplexType DO
  11312. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11313. IF RefInfo THEN Info(section,"COMPLEX") END;
  11314. Char(section, sfTypeCOMPLEX);
  11315. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11316. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11317. Char(section, sfTypeLONGCOMPLEX);
  11318. ELSE
  11319. HALT(100);
  11320. END;
  11321. |type:SyntaxTree.SetType DO
  11322. IF RefInfo THEN Info(section,"SET") END;
  11323. Char(section, sfTypeSET);
  11324. |type:SyntaxTree.AnyType DO
  11325. IF RefInfo THEN Info(section,"ANY") END;
  11326. Char(section, sfTypeANY);
  11327. |type:SyntaxTree.ObjectType DO
  11328. IF RefInfo THEN Info(section,"OBJECT") END;
  11329. Char(section, sfTypeOBJECT);
  11330. |type:SyntaxTree.ByteType DO
  11331. IF RefInfo THEN Info(section,"BYTE") END;
  11332. Char(section, sfTypeBYTE);
  11333. |type:SyntaxTree.RangeType DO
  11334. IF RefInfo THEN Info(section,"RANGE") END;
  11335. Char(section, sfTypeRANGE)
  11336. |type:SyntaxTree.AddressType DO
  11337. IF RefInfo THEN Info(section,"ADDRESS") END;
  11338. Char(section, sfTypeADDRESS)
  11339. |type:SyntaxTree.SizeType DO
  11340. IF RefInfo THEN Info(section,"SIZE") END;
  11341. Char(section, sfTypeSIZE)
  11342. ELSE
  11343. HALT(100)
  11344. END;
  11345. ELSE HALT(101);
  11346. END;
  11347. END;
  11348. END NType;
  11349. (*
  11350. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11351. *)
  11352. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11353. VAR pos: LONGINT; type: SyntaxTree.Type;
  11354. BEGIN
  11355. IF RefInfo THEN Info(section, "Parameter") END;
  11356. Char(section, sfVariable);
  11357. Size(section, procOffset);
  11358. String0(section, parameter.name);
  11359. type := parameter.type.resolved;
  11360. IF parameter.kind = SyntaxTree.VarParameter THEN
  11361. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11362. ELSE Char(section, sfIndirect)
  11363. END;
  11364. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11365. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11366. Char(section, sfIndirect);
  11367. ELSE
  11368. Char(section, sfRelative);
  11369. END;
  11370. ELSE
  11371. Char(section, sfRelative);
  11372. END;
  11373. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11374. NType(parameter.type);
  11375. END NParameter;
  11376. (*
  11377. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11378. *)
  11379. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11380. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11381. flags: SET;
  11382. BEGIN
  11383. IF procedure.externalName # NIL THEN RETURN END;
  11384. IF RefInfo THEN Info(section, "Procedure") END;
  11385. pos := CurrentIndex();
  11386. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11387. Char(section, sfProcedure);
  11388. Size(section, scopeOffset);
  11389. String0(section,procedure.name);
  11390. s := module.allSections.FindBySymbol(procedure);
  11391. Symbol(section,s,0,0); (* start *)
  11392. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11393. flags := {};
  11394. IF procedureType.isDelegate THEN
  11395. INCL(flags, flagDelegate);
  11396. END;
  11397. IF procedure.isConstructor THEN
  11398. INCL(flags, flagConstructor);
  11399. END;
  11400. Set(section, flags);
  11401. IF RefInfo THEN Info(section, "Parameters") END;
  11402. parameter := procedureType.firstParameter;
  11403. WHILE(parameter # NIL) DO
  11404. NParameter(parameter, pos);
  11405. parameter := parameter.nextParameter;
  11406. END;
  11407. IF procedureType.returnParameter # NIL THEN
  11408. NParameter(procedureType.returnParameter, pos);
  11409. END;
  11410. IF procedureType.selfParameter # NIL THEN
  11411. NParameter(procedureType.selfParameter, pos);
  11412. END;
  11413. IF RefInfo THEN Info(section, "ReturnType") END;
  11414. NType(procedureType.returnType);
  11415. NScope(procedure.procedureScope, pos);
  11416. END NProcedure;
  11417. (*
  11418. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11419. *)
  11420. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11421. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11422. BEGIN
  11423. IF RefInfo THEN Info(section, "Variable") END;
  11424. pos := CurrentIndex();
  11425. Char(section, sfVariable);
  11426. Size(section, scopeOffset);
  11427. String0(section, variable.name);
  11428. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11429. Char(section, sfAbsolute);
  11430. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11431. NamedSymbol(section, sn,variable, 0,0);
  11432. ELSE
  11433. Char(section, sfRelative);
  11434. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11435. END;
  11436. NType(variable.type);
  11437. s := module.allSections.FindBySymbol(variable);
  11438. END NVariable;
  11439. (*
  11440. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11441. *)
  11442. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11443. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11444. BEGIN
  11445. IF typeDeclaration = NIL THEN RETURN END;
  11446. pos := CurrentIndex();
  11447. s := module.allSections.FindBySymbol(typeDeclaration);
  11448. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11449. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11450. Char(section, sfTypeDeclaration);
  11451. Size(section, scopeOffset);
  11452. String0(section, typeDeclaration.name);
  11453. declared := typeDeclaration.declaredType.resolved;
  11454. IF (declared IS SyntaxTree.PointerType) THEN
  11455. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11456. END;
  11457. WITH declared: SyntaxTree.RecordType DO
  11458. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11459. Symbol(section, s, 0, offset);
  11460. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11461. Basic.AppendToSegmentedName(name,".@Info");
  11462. s := module.allSections.FindByName(name);
  11463. IF s # NIL THEN (* does not work for coop *)
  11464. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11465. END;
  11466. NScope(declared.recordScope, pos);
  11467. |declared: SyntaxTree.CellType DO
  11468. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11469. Symbol(section, s, 0, offset);
  11470. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11471. Basic.AppendToSegmentedName(name,".@Info");
  11472. s := module.allSections.FindByName(name);
  11473. IF s # NIL THEN
  11474. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11475. END;
  11476. NScope(declared.cellScope, pos);
  11477. ELSE
  11478. Address(section, 0);
  11479. END;
  11480. END NTypeDeclaration;
  11481. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11482. VAR pos: LONGINT;
  11483. BEGIN
  11484. pos := CurrentIndex();
  11485. Char(section,sfModule);
  11486. Size(section, prevSymbol);
  11487. String0(section, module.name);
  11488. NScope(module.moduleScope, pos);
  11489. END NModule;
  11490. (*
  11491. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11492. *)
  11493. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11494. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11495. BEGIN
  11496. IF scope = NIL THEN RETURN END;
  11497. IF RefInfo THEN Info(section, "Scope") END;
  11498. Char(section, sfScopeBegin);
  11499. variable := scope.firstVariable;
  11500. WHILE (variable # NIL) DO
  11501. NVariable(variable, prevSymbol);
  11502. variable := variable.nextVariable;
  11503. END;
  11504. WITH scope: SyntaxTree.ModuleScope DO
  11505. bodyProcedure := scope.bodyProcedure;
  11506. |scope: SyntaxTree.RecordScope DO
  11507. bodyProcedure := scope.bodyProcedure;
  11508. ELSE
  11509. bodyProcedure := NIL;
  11510. END;
  11511. IF bodyProcedure # NIL THEN
  11512. NProcedure(bodyProcedure, prevSymbol)
  11513. END;
  11514. procedure := scope.firstProcedure;
  11515. WHILE procedure # NIL DO
  11516. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11517. procedure := procedure.nextProcedure;
  11518. END;
  11519. typeDeclaration := scope.firstTypeDeclaration;
  11520. WHILE typeDeclaration # NIL DO
  11521. NTypeDeclaration(typeDeclaration, prevSymbol);
  11522. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11523. END;
  11524. Char(section, sfScopeEnd); (* scope ends *)
  11525. END NScope;
  11526. BEGIN
  11527. NEW(indirectTypes, 32);
  11528. ArrayBlock(section,sizePC,"", FALSE);
  11529. startPC := section.pc;
  11530. NModule(module.module, -1);
  11531. PatchArray(section,sizePC,CurrentIndex());
  11532. END References;
  11533. (*
  11534. Command* = RECORD
  11535. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11536. name*: Name; (* name of the procedure *)
  11537. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11538. entryAdr* : ADDRESS; (* entry address of procedure *)
  11539. END;
  11540. *)
  11541. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11542. VAR
  11543. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11544. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11545. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11546. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11547. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11548. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11549. BEGIN
  11550. RETURN
  11551. (type = NIL) OR
  11552. (type.resolved IS SyntaxTree.RecordType) OR
  11553. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11554. (type.resolved IS SyntaxTree.AnyType);
  11555. END TypeAllowed;
  11556. BEGIN
  11557. numberParameters := procedureType.numberParameters;
  11558. RETURN
  11559. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11560. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11561. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11562. END GetProcedureAllowed;
  11563. PROCEDURE WriteType(type : SyntaxTree.Type);
  11564. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11565. name: Basic.SegmentedName; offset: LONGINT;
  11566. BEGIN
  11567. IF type = NIL THEN
  11568. Address(source,0);
  11569. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11570. Address(source,1);
  11571. ELSE
  11572. type := type.resolved;
  11573. IF type IS SyntaxTree.PointerType THEN
  11574. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11575. END;
  11576. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11577. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11578. name[0] := typeDeclaration.name; name[1] := -1;
  11579. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11580. ASSERT(section # NIL);
  11581. ELSE
  11582. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11583. (* TODO *)
  11584. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11585. END;
  11586. IF implementationVisitor.backend.cooperative THEN
  11587. offset := 0;
  11588. ELSE
  11589. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11590. END;
  11591. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11592. END;
  11593. END WriteType;
  11594. BEGIN
  11595. Info(source, "command array descriptor");
  11596. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11597. numberCommands := 0;
  11598. Info(source, "command array content");
  11599. FOR i := 0 TO module.allSections.Length() - 1 DO
  11600. p := module.allSections.GetSection(i);
  11601. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11602. procedure := p.symbol(SyntaxTree.Procedure);
  11603. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11604. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11605. procedure.GetName(name);
  11606. Name(source,name);
  11607. numberParameters := procedureType.numberParameters;
  11608. (* offset of type of first parameter *)
  11609. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11610. ELSE WriteType(procedureType.firstParameter.type)
  11611. END;
  11612. (* offset of type of return parameter *)
  11613. WriteType(procedureType.returnType);
  11614. (* command name *)
  11615. (* command code offset *)
  11616. Symbol(source,p,0,0);
  11617. INC(numberCommands);
  11618. IF Trace THEN
  11619. D.Ln;
  11620. END;
  11621. END;
  11622. END
  11623. END;
  11624. PatchArray(source,sizePC,numberCommands);
  11625. END CommandArray;
  11626. (* to prevent from double import of different module aliases *)
  11627. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11628. VAR i: SyntaxTree.Import;
  11629. BEGIN
  11630. i := module.module.moduleScope.firstImport;
  11631. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11632. i := i.nextImport;
  11633. END;
  11634. RETURN i = import
  11635. END IsFirstDirectOccurence;
  11636. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11637. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11638. BEGIN
  11639. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11640. ArrayBlock(source,pc,"", FALSE);
  11641. Info(source, "import module array data");
  11642. IF implementationVisitor.backend.cooperative THEN
  11643. offset := 0;
  11644. ELSE
  11645. IF module.system.addressType.sizeInBits = 64 THEN
  11646. (* change this when Heaps.HeapBlock is modified *)
  11647. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11648. ELSE
  11649. (* change this when Heaps.HeapBlock is modified *)
  11650. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11651. END;
  11652. END;
  11653. import := module.module.moduleScope.firstImport;
  11654. numberImports := 0;
  11655. WHILE import # NIL DO
  11656. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11657. Global.GetModuleSegmentedName(import.module,name);
  11658. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11659. NamedSymbol(source, name, NIL, 0, offset);
  11660. INC(numberImports);
  11661. END;
  11662. import := import.nextImport
  11663. END;
  11664. PatchArray(source,pc,numberImports);
  11665. END ImportsArray;
  11666. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11667. VAR
  11668. p: Sections.Section; sizePC, size, i: LONGINT;
  11669. BEGIN
  11670. Info(source, "Type info section");
  11671. size := 0;
  11672. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11673. FOR i := 0 TO module.allSections.Length() - 1 DO
  11674. p := module.allSections.GetSection(i);
  11675. WITH p: IntermediateCode.Section DO
  11676. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11677. Symbol(source,p,EmptyBlockOffset,0);
  11678. INC(size);
  11679. END;
  11680. END
  11681. END;
  11682. PatchArray(source,sizePC,size);
  11683. END TypeInfoSection;
  11684. (*
  11685. ProcTableEntry* = RECORD
  11686. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11687. noPtr*: LONGINT;
  11688. END;
  11689. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11690. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11691. *)
  11692. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11693. VAR
  11694. numberPointers: LONGINT;
  11695. procedure: SyntaxTree.Procedure;
  11696. BEGIN
  11697. Info(section,"pcFrom");
  11698. Symbol(section,procedureSection,0,0);
  11699. Info(section,"pcTo");
  11700. Symbol(section, procedureSection, procedureSection.pc, 0);
  11701. Info(section,"pointer to offsets array");
  11702. Symbol(section, section,section.pc+1,0);
  11703. Info(section,"offsets array");
  11704. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11705. PointerArray(section, procedure.procedureScope, numberPointers);
  11706. END ProcedureDescriptor;
  11707. (* only for tracing, the descriptor is otherwise not complete ! *)
  11708. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11709. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11710. BEGIN
  11711. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11712. name := procedureSection.name;
  11713. Basic.AppendToSegmentedName(name,".@Info");
  11714. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11715. Address(section,0);
  11716. Symbol(section,section,2,0);
  11717. (*
  11718. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11719. descSize: SIZE;
  11720. sentinel: ADDRESS; (* = MPO-4 *)
  11721. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11722. flags*: SET;
  11723. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11724. name*: Name;
  11725. END;
  11726. *)
  11727. Size(section, 0);
  11728. Address(section,0);
  11729. Address(section,0);
  11730. Set(section,{});
  11731. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); END;
  11732. moduleSection := ModuleSection();
  11733. Symbol( section, moduleSection, moduleSection.pc,0);
  11734. IF procedureSection.symbol = NIL THEN
  11735. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11736. ELSE
  11737. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11738. END;
  11739. Name(section, infoName);
  11740. Size(section, 0);
  11741. RETURN section;
  11742. END MakeProcedureDescriptorTag;
  11743. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11744. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11745. BEGIN
  11746. name := procedureSection.name;
  11747. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11748. IF implementationVisitor.backend.cooperative THEN
  11749. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11750. Info(section, "TypeDescriptor");
  11751. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11752. NamedSymbol(dest, name,NIL, 0, 0);
  11753. BaseRecord(dest);
  11754. offset := 0;
  11755. ELSIF CreateProcedureDescInfo THEN
  11756. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11757. Address(dest,0);
  11758. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11759. offset := dest.pc;
  11760. ELSE
  11761. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11762. END;
  11763. ProcedureDescriptor(dest, procedureSection);
  11764. Symbol(section, dest, offset, 0);
  11765. END ProcedureDescriptorPointer;
  11766. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11767. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11768. BEGIN
  11769. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11770. numberProcs := 0;
  11771. FOR i := 0 TO module.allSections.Length() - 1 DO
  11772. destination := module.allSections.GetSection(i);
  11773. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11774. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11775. INC(numberProcs);
  11776. END
  11777. END;
  11778. PatchArray(section, sizePC, numberProcs);
  11779. END ProcedureDescriptorArray;
  11780. (*
  11781. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11782. VAR
  11783. next*: Module; (** once a module is published, all fields are read-only *)
  11784. name*: Name;
  11785. init, published: BOOLEAN;
  11786. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11787. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11788. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11789. command*: POINTER TO ARRAY OF Command;
  11790. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11791. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11792. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11793. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11794. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11795. data*, code*: Bytes;
  11796. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11797. export*: ExportDesc;
  11798. term*: TerminationHandler;
  11799. exTable*: ExceptionTable;
  11800. noProcs*: LONGINT;
  11801. firstProc*: ADDRESS; <- done by loader
  11802. maxPtrs*: LONGINT;
  11803. crc*: LONGINT;
  11804. *)
  11805. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11806. BEGIN
  11807. Info(section, "cycle");
  11808. Size(section,0);
  11809. Info(section, "references");
  11810. Size(section,0);
  11811. Info(section, "nextMarked");
  11812. Address(section,0);
  11813. Info(section, "nextWatched");
  11814. Address(section,0);
  11815. END BasePointer;
  11816. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11817. BEGIN
  11818. BasePointer(section);
  11819. Info(section, "action");
  11820. Address(section,0);
  11821. Info(section, "monitor");
  11822. Address(section,0);
  11823. END BaseObject;
  11824. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11825. BEGIN
  11826. BasePointer(section);
  11827. Info(section, "action");
  11828. Address(section,0);
  11829. Info(section, "monitor");
  11830. Address(section,0);
  11831. END BaseRecord;
  11832. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11833. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11834. pooledName: Basic.SegmentedName;
  11835. symbol: SyntaxTree.Symbol;
  11836. BEGIN
  11837. Global.GetModuleName(module.module,name);
  11838. Strings.Append(name,".@Module.@Descriptor");
  11839. Basic.ToSegmentedName(name, pooledName);
  11840. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11841. Symbol(section,descriptorSection,0,0);
  11842. Info(descriptorSection, "descriptor");
  11843. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11844. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11845. Address(descriptorSection,0);
  11846. Global.GetModuleName(module.module,name);
  11847. Strings.Append(name,".@Trace");
  11848. Basic.ToSegmentedName(name, pooledName);
  11849. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11850. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11851. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11852. END ModuleDescriptor;
  11853. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11854. VAR name: ARRAY 128 OF CHAR;
  11855. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11856. symbol: SyntaxTree.Symbol;
  11857. BEGIN
  11858. ASSERT(implementationVisitor.backend.newObjectFile);
  11859. Global.GetModuleName(module.module,name);
  11860. Strings.Append(name,".@Module");
  11861. Basic.ToSegmentedName(name, pooledName);
  11862. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11863. moduleSection.SetExported(TRUE);
  11864. IF moduleSection.pc = 0 THEN
  11865. IF implementationVisitor.backend.cooperative THEN
  11866. Info(moduleSection, "descriptor");
  11867. ModuleDescriptor(moduleSection);
  11868. BaseObject(moduleSection);
  11869. implementationVisitor.CreateTraceModuleMethod(module.module);
  11870. ELSE
  11871. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11872. Info(moduleSection, "HeapBlock");
  11873. Symbol(moduleSection,moduleSection,2,0);
  11874. Info(moduleSection, "TypeDescriptor");
  11875. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11876. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11877. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11878. END;
  11879. END;
  11880. RETURN moduleSection;
  11881. END ModuleSection;
  11882. PROCEDURE NewModuleInfo();
  11883. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11884. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11885. sectionName: Basic.SectionName;
  11886. CONST MPO=-40000000H;
  11887. BEGIN
  11888. (*
  11889. TypeDesc* = POINTER TO RECORD
  11890. descSize: SIZE;
  11891. sentinel: LONGINT; (* = MPO-4 *)
  11892. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11893. flags*: SET;
  11894. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11895. name*: Name;
  11896. refsOffset: SIZE;
  11897. END;
  11898. *)
  11899. (*name is missing prefixes sometimes*)
  11900. Global.GetModuleSegmentedName(module.module,name);
  11901. Basic.AppendToSegmentedName(name,".@Info");
  11902. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11903. IF ~implementationVisitor.backend.cooperative THEN
  11904. Info(source, "HeapBlock");
  11905. Address(source,0); (* an empty heap block prevents GC marking *)
  11906. Info(source, "TypeDescriptor");
  11907. Address(source,0);
  11908. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  11909. END;
  11910. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11911. Address(source,MPO-4);
  11912. Info(source, "type tag pointer");
  11913. Address( source,0);
  11914. Info(source, "type flags");
  11915. flags := {};
  11916. Set( source, flags);
  11917. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11918. Info(source, "pointer to module");
  11919. moduleSection := ModuleSection();
  11920. Symbol( source, moduleSection, moduleSection.pc,0);
  11921. Info(source, "type name");
  11922. i := 0;
  11923. sectionName := "@Self";
  11924. (*
  11925. Global.GetSymbolSegmentedName(td,name);
  11926. Basic.SegmentedNameToString(name, sectionName);
  11927. *)
  11928. Name(source,sectionName);
  11929. source.SetReferenced(FALSE);
  11930. patchInfoPC := source.pc;
  11931. Size(source, 0);
  11932. END NewModuleInfo;
  11933. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11934. VAR
  11935. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11936. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  11937. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11938. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  11939. referenceSectionOffset : LONGINT;
  11940. name: Basic.SegmentedName; offset: LONGINT;
  11941. flags: SET;
  11942. BEGIN
  11943. NewModuleInfo();
  11944. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11945. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11946. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11947. ImportsArray(importSection);
  11948. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11949. CommandArray(commandsSection);
  11950. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11951. ExceptionArray(exceptionSection);
  11952. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11953. AddPointer(typeInfoSection, typeInfoSectionOffset);
  11954. TypeInfoSection(typeInfoSection);
  11955. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11956. References(referenceSection);
  11957. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11958. ProcedureDescriptorArray(procTableSection, numberProcs);
  11959. IF ProtectModulesPointers THEN
  11960. name := "Heaps.AnyPtr";
  11961. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11962. (* set base pointer *)
  11963. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  11964. END;
  11965. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11966. ArrayBlock(emptyArraySection,temp,"", FALSE);
  11967. moduleSection := ModuleSection();
  11968. Info(moduleSection, "nextRoot*: RootObject");
  11969. Address(moduleSection,0);
  11970. Info(moduleSection, "next*: Module");
  11971. Address(moduleSection,0);
  11972. Info(moduleSection, "name*: Name");
  11973. Name(moduleSection,moduleName);
  11974. Info(moduleSection, "init, published: BOOLEAN");
  11975. Boolean(moduleSection,FALSE);
  11976. Boolean(moduleSection,FALSE);
  11977. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11978. Boolean(moduleSection,FALSE);
  11979. Boolean(moduleSection,FALSE);
  11980. Info(moduleSection, "refcnt*: LONGINT");
  11981. Longint(moduleSection,0);
  11982. Info(moduleSection, "sb*: ADDRESS");
  11983. Address(moduleSection,0);
  11984. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11985. Address(moduleSection,0);
  11986. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11987. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11988. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11989. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11990. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11991. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11992. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11993. Symbol(moduleSection,importSection,importSectionOffset,0);
  11994. Info(moduleSection, "procTable*: ProcTable");
  11995. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11996. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11997. Address(moduleSection,0);
  11998. Address(moduleSection,0);
  11999. Address(moduleSection,0);
  12000. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12001. Info(moduleSection, "export*: ExportDesc");
  12002. ExportDesc(moduleSection);
  12003. Info(moduleSection, "term*: TerminationHandler");
  12004. Address(moduleSection,0);
  12005. Info(moduleSection, "exTable*: ExceptionTable");
  12006. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12007. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12008. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12009. Info(moduleSection, "crc*: LONGINT");
  12010. patchCRC:= moduleSection.pc;
  12011. Longint(moduleSection, 0); (*! must be implemented *)
  12012. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12013. Info(moduleSection, "body*: ADDRESS");
  12014. Symbol(moduleSection, bodyProc, 0,0);
  12015. Info(moduleSection, "module flags");
  12016. flags := {};
  12017. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12018. Set( moduleSection, flags);
  12019. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END;
  12020. IF implementationVisitor.backend.cooperative THEN
  12021. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12022. Info(moduleSection, "monitor.owner");
  12023. Address(moduleSection,0);
  12024. Info(moduleSection, "monitor.nestingLevel");
  12025. Address(moduleSection,0);
  12026. Info(moduleSection, "monitor.blockedQueue");
  12027. Address(moduleSection,0); Address(moduleSection,0);
  12028. Info(moduleSection, "monitor.waitingQueue");
  12029. Address(moduleSection,0); Address(moduleSection,0);
  12030. Info(moduleSection, "monitor.waitingSentinel");
  12031. Address(moduleSection,0);
  12032. END;
  12033. END Module;
  12034. PROCEDURE PatchCRC(crc: LONGINT);
  12035. BEGIN
  12036. IF implementationVisitor.newObjectFile & ~simple THEN
  12037. PatchLongint(ModuleSection(), patchCRC, crc);
  12038. END;
  12039. END PatchCRC;
  12040. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12041. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12042. BEGIN
  12043. ArrayBlock(source,pc,"",FALSE);
  12044. Info(source, "pointer offsets array data");
  12045. IF scope IS SyntaxTree.RecordScope THEN
  12046. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12047. ELSIF scope IS SyntaxTree.CellScope THEN
  12048. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12049. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12050. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12051. WHILE variable # NIL DO
  12052. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12053. symbol := module.allSections.FindBySymbol(variable);
  12054. ASSERT(symbol # NIL);
  12055. Pointers(0,symbol, source,variable.type,numberPointers);
  12056. END;
  12057. variable := variable.nextVariable;
  12058. END;
  12059. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12060. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12061. WHILE parameter # NIL DO
  12062. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12063. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12064. END;
  12065. parameter := parameter.nextParameter;
  12066. END;
  12067. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12068. parametersSize := ProcedureParametersSize(module.system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12069. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12070. IF implementationVisitor.backend.preciseGC THEN
  12071. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12072. END;
  12073. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12074. END;
  12075. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12076. WHILE(variable # NIL) DO
  12077. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12078. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12079. END;
  12080. variable := variable.nextVariable
  12081. END;
  12082. END;
  12083. PatchArray(source,pc,numberPointers);
  12084. END PointerArray;
  12085. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12086. VAR
  12087. name: Basic.SegmentedName;
  12088. section: IntermediateCode.Section;
  12089. BEGIN
  12090. ASSERT(implementationVisitor.newObjectFile);
  12091. Global.GetSymbolSegmentedName(symbol,name);
  12092. Basic.AppendToSegmentedName(name,suffix);
  12093. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12094. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12095. Info(section, "HeapBlock");
  12096. Address(section,0); (* empty such that GC does not go on traversing *)
  12097. Info(section, suffix);
  12098. Address(section,0);
  12099. pc := section.pc;
  12100. RETURN section;
  12101. END SymbolSection;
  12102. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12103. VAR recordType: SyntaxTree.RecordType;
  12104. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12105. section: Sections.Section; cellType: SyntaxTree.CellType;
  12106. tdInfoOffset: LONGINT;
  12107. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12108. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12109. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12110. sectionName: Basic.SectionName;
  12111. CONST MPO=-40000000H;
  12112. BEGIN
  12113. (*
  12114. TypeDesc* = POINTER TO RECORD
  12115. descSize: SIZE;
  12116. sentinel: LONGINT; (* = MPO-4 *)
  12117. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12118. flags*: SET;
  12119. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12120. name*: Name;
  12121. refsOffset: SIZE;
  12122. END;
  12123. *)
  12124. (* source := module.sections.FindByName(...) *)
  12125. Global.GetSymbolSegmentedName(td,name);
  12126. Basic.AppendToSegmentedName(name,".@Info");
  12127. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12128. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12129. Address(source,0);
  12130. Info(source, "TypeDescriptor");
  12131. Address(source,0);
  12132. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12133. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12134. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12135. Info(source, "type tag pointer");
  12136. Symbol( source, tag, offset, 0);
  12137. Info(source, "type flags");
  12138. flags := {};
  12139. IF isProtected THEN INCL(flags,31) END;
  12140. Set( source, flags);
  12141. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  12142. Info(source, "pointer to module");
  12143. moduleSection := ModuleSection();
  12144. Symbol( source, moduleSection, moduleSection.pc,0);
  12145. Info(source, "type name");
  12146. i := 0;
  12147. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12148. (*
  12149. Global.GetSymbolSegmentedName(td,name);
  12150. Basic.SegmentedNameToString(name, sectionName);
  12151. *)
  12152. Name(source,sectionName);
  12153. source.SetReferenced(FALSE);
  12154. Size(source, 0);
  12155. RETURN source;
  12156. END NewTypeDescriptorInfo;
  12157. PROCEDURE NewTypeDescriptor;
  12158. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12159. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12160. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12161. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12162. CONST MPO=-40000000H;
  12163. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12164. VAR i: LONGINT;
  12165. PROCEDURE Td(record: SyntaxTree.RecordType);
  12166. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12167. BEGIN
  12168. IF record # NIL THEN
  12169. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12170. baseTD := record.typeDeclaration;
  12171. Global.GetSymbolSegmentedName(baseTD,name);
  12172. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12173. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12174. ELSE
  12175. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12176. END;
  12177. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12178. Symbol(source, tir, 0, offset);
  12179. IF reverse THEN Td(record.GetBaseRecord()) END;
  12180. END;
  12181. END Td;
  12182. BEGIN
  12183. Info(source, "tag table");
  12184. baseRecord := recordType;
  12185. i := 0;
  12186. WHILE baseRecord # NIL DO
  12187. INC(i);
  12188. baseRecord := baseRecord.GetBaseRecord();
  12189. END;
  12190. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12191. IF ~reverse THEN Td(recordType) END;
  12192. WHILE i < size DO
  12193. Address(source,0);
  12194. INC(i);
  12195. END;
  12196. IF reverse THEN Td(recordType) END;
  12197. END TdTable;
  12198. PROCEDURE MethodTable(reverse: BOOLEAN);
  12199. VAR i,methods: LONGINT;
  12200. BEGIN
  12201. Info(source, "method table");
  12202. IF recordType # NIL THEN
  12203. methods := recordType.recordScope.numberMethods;
  12204. IF reverse THEN
  12205. FOR i := methods-1 TO 0 BY -1 DO
  12206. procedure := recordType.recordScope.FindMethod(i);
  12207. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12208. NamedSymbol(source, name,procedure, 0,0);
  12209. END;
  12210. ELSE
  12211. FOR i := 0 TO methods-1 DO
  12212. procedure := recordType.recordScope.FindMethod(i);
  12213. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12214. NamedSymbol(source, name,procedure, 0,0);
  12215. END;
  12216. END;
  12217. END;
  12218. END MethodTable;
  12219. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12220. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12221. BEGIN
  12222. Info(source, "method table");
  12223. baseRecord := recordType;
  12224. WHILE baseRecord.baseType # NIL DO
  12225. baseRecord := baseRecord.GetBaseRecord ();
  12226. END;
  12227. GetRecordTypeName (baseRecord, name);
  12228. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12229. IF name = stackFrame THEN
  12230. start := 0;
  12231. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12232. baseRecord := recordType;
  12233. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12234. baseRecord := baseRecord.GetBaseRecord ();
  12235. END;
  12236. IF baseRecord # NIL THEN
  12237. GetRecordTypeName (baseRecord, name);
  12238. IF pointer & ~baseRecord.isObject THEN
  12239. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12240. END;
  12241. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12242. ELSIF recordType.isObject THEN
  12243. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12244. ELSIF pointer THEN
  12245. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12246. ELSE
  12247. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12248. END;
  12249. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12250. Symbol(source, tir, 0, 0);
  12251. start := 0;
  12252. baseRecord := recordType;
  12253. WHILE (baseRecord # NIL) DO
  12254. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12255. baseRecord := baseRecord.GetBaseRecord ();
  12256. END;
  12257. ELSE
  12258. (* explicit trace method: *)
  12259. procedure := recordType.recordScope.FindMethod(0);
  12260. IF ~procedure.isFinalizer THEN
  12261. Global.GetSymbolSegmentedName(procedure, name);
  12262. NamedSymbol(source, name,procedure, 0,0);
  12263. END;
  12264. start := 1;
  12265. END;
  12266. IF (name # stackFrame) & recordType.isObject THEN
  12267. baseRecord := recordType;
  12268. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12269. baseRecord := baseRecord.GetBaseRecord ();
  12270. END;
  12271. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12272. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12273. ELSE
  12274. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12275. END;
  12276. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12277. Symbol(source, tir, 0, 0);
  12278. END;
  12279. methods := recordType.recordScope.numberMethods;
  12280. FOR i := start TO methods-1 DO
  12281. procedure := recordType.recordScope.FindMethod(i);
  12282. IF ~procedure.isFinalizer THEN
  12283. Global.GetSymbolSegmentedName(procedure, name);
  12284. NamedSymbol(source, name,procedure, 0,0);
  12285. END;
  12286. END;
  12287. END CooperativeMethodTable;
  12288. BEGIN
  12289. Global.GetSymbolSegmentedName(td,name);
  12290. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12291. source.SetExported(IsExported(td));
  12292. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12293. IF implementationVisitor.backend.cooperative THEN
  12294. base := NIL;
  12295. baseRecord := recordType.GetBaseRecord();
  12296. IF baseRecord # NIL THEN
  12297. baseTD := baseRecord.typeDeclaration;
  12298. END;
  12299. IF ~recordType.isObject THEN
  12300. Info(source, "parent");
  12301. IF baseRecord # NIL THEN
  12302. Global.GetSymbolSegmentedName(baseTD,name);
  12303. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12304. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12305. ELSE
  12306. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12307. END;
  12308. Symbol(source, tir, 0, 0);
  12309. ELSE
  12310. Address(source,0);
  12311. END;
  12312. Info(source, "record size");
  12313. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12314. source.SetReferenced(FALSE);
  12315. CooperativeMethodTable(FALSE);
  12316. base := source;
  12317. Global.GetSymbolSegmentedName(td,name);
  12318. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12319. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12320. source.SetExported(IsExported(td));
  12321. source.SetReferenced(FALSE);
  12322. END;
  12323. Info(source, "parent");
  12324. IF baseRecord # NIL THEN
  12325. Global.GetSymbolSegmentedName(baseTD,name);
  12326. sym := baseTD;
  12327. IF ~recordType.isObject THEN
  12328. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12329. sym := NIL;
  12330. END;
  12331. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12332. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12333. ELSE
  12334. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12335. END;
  12336. Symbol(source, tir, 0, 0);
  12337. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12338. Address(source,0);
  12339. ELSE
  12340. IF recordType.isObject THEN
  12341. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12342. ELSE
  12343. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12344. END;
  12345. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12346. Symbol(source, tir, 0, 0);
  12347. END;
  12348. Info(source, "base record descriptor");
  12349. Symbol(source, base, 0, 0);
  12350. CooperativeMethodTable(TRUE);
  12351. source.SetReferenced(FALSE);
  12352. IF recordType.hasPointers THEN
  12353. IF ~HasExplicitTraceMethod (recordType) THEN
  12354. implementationVisitor.CreateTraceMethod(recordType);
  12355. END;
  12356. implementationVisitor.CreateResetProcedure(recordType);
  12357. implementationVisitor.CreateAssignProcedure(recordType);
  12358. END;
  12359. ELSIF ~simple THEN
  12360. (*
  12361. MethodEnd = MPO
  12362. ---
  12363. methods (# methods)
  12364. ---
  12365. tags (16)
  12366. ---
  12367. TypeDesc = TypeInfoAdr
  12368. ---
  12369. td adr ---> rec size
  12370. ----
  12371. pointer offsets
  12372. ----
  12373. (padding)
  12374. -----
  12375. empty [2 addresses aligned]
  12376. empty
  12377. empty
  12378. numPtrs
  12379. ---
  12380. pointer offsets
  12381. ---
  12382. *)
  12383. Info(source, "MethodEnd = MPO");
  12384. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12385. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12386. MethodTable(TRUE);
  12387. TdTable(TypeTags, TRUE);
  12388. Info(source, "type descriptor info pointer");
  12389. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12390. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12391. IF (cellType # NIL) THEN
  12392. IF cellType.sizeInBits < 0 THEN
  12393. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12394. END;
  12395. Info(source, "cell size");
  12396. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12397. ELSE
  12398. Info(source, "record size");
  12399. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12400. END;
  12401. Info(source, "pointer offsets pointer");
  12402. padding := 1- source.pc MOD 2;
  12403. Symbol(source, source, source.pc+1+padding,0);
  12404. IF padding >0 THEN
  12405. Info(source, "padding");
  12406. FOR i := 1 TO padding DO Address(source,0) END;
  12407. END;
  12408. IF cellType # NIL THEN
  12409. PointerArray(source, cellType.cellScope, numberPointers);
  12410. ELSE
  12411. PointerArray(source, recordType.recordScope, numberPointers);
  12412. END;
  12413. ELSE
  12414. (*
  12415. simple:
  12416. td adr --> size
  12417. tag(1)
  12418. tag(2)
  12419. tag(3)
  12420. methods ->
  12421. *)
  12422. Info(source, "record size");
  12423. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12424. TdTable(TypeTags, FALSE);
  12425. MethodTable(FALSE);
  12426. source.SetReferenced(FALSE);
  12427. END;
  12428. END NewTypeDescriptor;
  12429. BEGIN
  12430. x := x.resolved;
  12431. IF (x IS SyntaxTree.PointerType) THEN
  12432. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12433. END;
  12434. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12435. recordType := x(SyntaxTree.RecordType);
  12436. td := x.typeDeclaration;
  12437. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12438. ASSERT(td # NIL);
  12439. section := module.allSections.FindBySymbol(td); (* TODO *)
  12440. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12441. IF implementationVisitor.newObjectFile THEN
  12442. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12443. NewTypeDescriptor
  12444. END;
  12445. ELSE
  12446. (* data section in intermediate code *)
  12447. Global.GetSymbolSegmentedName(td,name);
  12448. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  12449. Basic.SuffixSegmentedName (name, module.module.name);
  12450. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  12451. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  12452. tir.Emit(Data(Basic.invalidPosition,op));
  12453. END;
  12454. END;
  12455. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12456. cellType := x(SyntaxTree.CellType);
  12457. td := x.typeDeclaration;
  12458. section := module.allSections.FindBySymbol(td); (* TODO *)
  12459. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12460. IF implementationVisitor.newObjectFile THEN
  12461. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12462. NewTypeDescriptor
  12463. END;
  12464. END;
  12465. END;
  12466. END
  12467. END CheckTypeDeclaration
  12468. END MetaDataGenerator;
  12469. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12470. VAR
  12471. trace-: BOOLEAN;
  12472. traceString-: SyntaxTree.IdentifierString;
  12473. traceModuleName-: SyntaxTree.IdentifierString;
  12474. newObjectFile-: BOOLEAN;
  12475. profile-: BOOLEAN;
  12476. noRuntimeChecks: BOOLEAN;
  12477. simpleMetaData-: BOOLEAN;
  12478. noAsserts: BOOLEAN;
  12479. optimize-: BOOLEAN;
  12480. cooperative-: BOOLEAN;
  12481. preregisterStatic-: BOOLEAN;
  12482. dump-: Basic.Writer;
  12483. cellsAreObjects: BOOLEAN;
  12484. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12485. experiment: BOOLEAN;
  12486. PROCEDURE &InitIntermediateBackend*;
  12487. BEGIN
  12488. simpleMetaData := FALSE;
  12489. newObjectFile := FALSE;
  12490. InitBackend;
  12491. SetRuntimeModuleName(DefaultRuntimeModuleName);
  12492. SetTraceModuleName(DefaultTraceModuleName);
  12493. END InitIntermediateBackend;
  12494. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12495. VAR
  12496. declarationVisitor: DeclarationVisitor;
  12497. implementationVisitor: ImplementationVisitor;
  12498. module: Sections.Module;
  12499. name, platformName: SyntaxTree.IdentifierString;
  12500. meta: MetaDataGenerator;
  12501. crc: CRC.CRC32Stream;
  12502. BEGIN
  12503. ResetError;
  12504. Global.GetSymbolName(x,name);
  12505. NEW(module,x,system); (* backend structures *)
  12506. Global.GetModuleName(x, name);
  12507. module.SetModuleName(name);
  12508. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  12509. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12510. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12511. declarationVisitor.Module(x,module);
  12512. IF newObjectFile & ~meta.simple THEN
  12513. meta.Module(implementationVisitor.moduleBodySection);
  12514. END;
  12515. GetDescription(platformName);
  12516. module.SetPlatformName(platformName);
  12517. IF newObjectFile THEN
  12518. NEW(crc);
  12519. module.allSections.WriteRaw(crc);
  12520. crc.Update;
  12521. meta.PatchCRC(crc.GetCRC());
  12522. END;
  12523. RETURN module
  12524. END GenerateIntermediate;
  12525. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12526. BEGIN RETURN TRUE
  12527. END SupportedImmediate;
  12528. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12529. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12530. END ProcessSyntaxTreeModule;
  12531. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12532. VAR
  12533. result: Sections.Module;
  12534. traceName: Basic.MessageString;
  12535. BEGIN
  12536. ASSERT(intermediateCodeModule IS Sections.Module);
  12537. result := intermediateCodeModule(Sections.Module);
  12538. IF trace THEN
  12539. traceName := "intermediate code trace: ";
  12540. Strings.Append(traceName,traceString);
  12541. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12542. IF (traceString="") OR (traceString="*") THEN
  12543. result.Dump(dump);
  12544. dump.Update
  12545. ELSE
  12546. Sections.DumpFiltered(dump, result, traceString);
  12547. END
  12548. END;
  12549. RETURN result
  12550. END ProcessIntermediateCodeModule;
  12551. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12552. BEGIN instructionSet := "Intermediate";
  12553. END GetDescription;
  12554. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  12555. BEGIN
  12556. SELF.newObjectFile := newObjectFile;
  12557. SELF.simpleMetaData := simpleMetaData;
  12558. END SetNewObjectFile;
  12559. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12560. BEGIN COPY(name, traceModuleName)
  12561. END SetTraceModuleName;
  12562. PROCEDURE DefineOptions(options: Options.Options);
  12563. BEGIN
  12564. DefineOptions^(options);
  12565. options.Add(0X,"trace",Options.String);
  12566. options.Add(0X,"runtime",Options.String);
  12567. options.Add(0X,"newObjectFile",Options.Flag);
  12568. options.Add(0X,"traceModule",Options.String);
  12569. options.Add(0X,"profile",Options.Flag);
  12570. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12571. options.Add(0X,"noAsserts",Options.Flag);
  12572. options.Add(0X,"metaData",Options.String);
  12573. options.Add('o',"optimize", Options.Flag);
  12574. options.Add(0X,"preregisterStatic", Options.Flag);
  12575. options.Add(0X,"cellsAreObjects", Options.Flag);
  12576. options.Add(0X,"preciseGC", Options.Flag);
  12577. options.Add(0X,"trackLeave", Options.Flag);
  12578. options.Add(0X,"writeBarriers", Options.Flag);
  12579. options.Add(0X,"experiment", Options.Flag);
  12580. END DefineOptions;
  12581. PROCEDURE GetOptions(options: Options.Options);
  12582. VAR name,string: SyntaxTree.IdentifierString;
  12583. BEGIN
  12584. GetOptions^(options);
  12585. trace := options.GetString("trace",traceString);
  12586. profile := options.GetFlag("profile");
  12587. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12588. noAsserts := options.GetFlag("noAsserts");
  12589. cooperative := options.GetFlag("cooperative");
  12590. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  12591. IF cooperative THEN
  12592. SetRuntimeModuleName("CPU") END
  12593. END;
  12594. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12595. simpleMetaData := TRUE
  12596. END;
  12597. IF options.GetString("metaData",string) THEN
  12598. IF string = "simple" THEN simpleMetaData := TRUE
  12599. ELSIF string ="full" THEN simpleMetaData := FALSE
  12600. END;
  12601. END;
  12602. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  12603. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12604. optimize := options.GetFlag("optimize");
  12605. preregisterStatic := options.GetFlag("preregisterStatic");
  12606. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12607. preciseGC := options.GetFlag("preciseGC");
  12608. trackLeave := options.GetFlag("trackLeave");
  12609. writeBarriers := options.GetFlag("writeBarriers");
  12610. experiment := options.GetFlag("experiment");
  12611. END GetOptions;
  12612. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  12613. BEGIN RETURN SymbolFileFormat.Get()
  12614. END DefaultSymbolFileFormat;
  12615. END IntermediateBackend;
  12616. (* ----------------------------------- register allocation ------------------------------------- *)
  12617. (* register mapping scheme
  12618. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12619. spill offset
  12620. part(n) --> ticket <--> physical register
  12621. spill offset
  12622. *)
  12623. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12624. emptyOperand: IntermediateCode.Operand;
  12625. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12626. statCoopResetVariables: LONGINT;
  12627. statCoopModifyAssignments: LONGINT;
  12628. modifyAssignmentsPC : LONGINT;
  12629. statCoopNilCheck: LONGINT;
  12630. statCoopSwitch: LONGINT;
  12631. statCoopAssignProcedure: LONGINT;
  12632. statCoopTraceMethod: LONGINT;
  12633. statCoopResetProcedure: LONGINT;
  12634. statCoopTraceModule: LONGINT;
  12635. PROCEDURE ResetStatistics*;
  12636. BEGIN
  12637. statCoopResetVariables := 0;
  12638. statCoopModifyAssignments := 0;
  12639. statCoopNilCheck:= 0;
  12640. statCoopSwitch:= 0;
  12641. statCoopAssignProcedure:= 0;
  12642. statCoopTraceMethod:= 0;
  12643. statCoopResetProcedure:= 0;
  12644. statCoopTraceModule:= 0;
  12645. END ResetStatistics;
  12646. PROCEDURE Statistics*;
  12647. BEGIN
  12648. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12649. TRACE(statCoopNilCheck, statCoopSwitch);
  12650. TRACE(statCoopAssignProcedure,
  12651. statCoopTraceMethod,
  12652. statCoopResetProcedure,
  12653. statCoopTraceModule)
  12654. END Statistics;
  12655. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12656. VAR h: LONGINT;
  12657. BEGIN
  12658. WHILE b # 0 DO
  12659. h := a MOD b;
  12660. a := b;
  12661. b := h;
  12662. END;
  12663. RETURN a
  12664. END GCD;
  12665. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12666. BEGIN
  12667. RETURN a*b DIV GCD(a,b)
  12668. END SCM;
  12669. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12670. BEGIN
  12671. (*TRACE(a,b);*)
  12672. IF a = 0 THEN RETURN b
  12673. ELSIF b = 0 THEN RETURN a
  12674. ELSE RETURN SCM(a,b)
  12675. END;
  12676. END CommonAlignment;
  12677. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  12678. BEGIN
  12679. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12680. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12681. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12682. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12683. 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)
  12684. END
  12685. END PassBySingleReference;
  12686. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  12687. BEGIN
  12688. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  12689. END PassInRegister;
  12690. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12691. VAR new: RegisterEntry;
  12692. BEGIN
  12693. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12694. IF queue = NIL THEN
  12695. queue := new
  12696. ELSE
  12697. new.next := queue;
  12698. IF queue#NIL THEN queue.prev := new END;
  12699. queue := new
  12700. END;
  12701. END AddRegisterEntry;
  12702. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12703. VAR this: RegisterEntry;
  12704. BEGIN
  12705. this := queue;
  12706. WHILE (this # NIL) & (this.register # register) DO
  12707. this := this.next;
  12708. END;
  12709. IF this = NIL THEN
  12710. RETURN FALSE
  12711. END;
  12712. ASSERT(this # NIL);
  12713. IF this = queue THEN queue := queue.next END;
  12714. IF this.prev # NIL THEN this.prev.next := this.next END;
  12715. IF this.next # NIL THEN this.next.prev := this.prev END;
  12716. RETURN TRUE
  12717. END RemoveRegisterEntry;
  12718. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12719. BEGIN ASSERT(cond);
  12720. END Assert;
  12721. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12722. BEGIN
  12723. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12724. END ReusableRegister;
  12725. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12726. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12727. BEGIN
  12728. procedure := moduleScope.bodyProcedure;
  12729. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12730. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12731. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12732. procedure.SetScope(moduleScope);
  12733. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12734. procedure.SetAccess(SyntaxTree.Hidden);
  12735. moduleScope.SetBodyProcedure(procedure);
  12736. moduleScope.AddProcedure(procedure);
  12737. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12738. END;
  12739. END EnsureBodyProcedure;
  12740. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12741. VAR import: SyntaxTree.Import;
  12742. selfName: SyntaxTree.IdentifierString;
  12743. module: SyntaxTree.Module;
  12744. BEGIN
  12745. scope.ownerModule.GetName(selfName);
  12746. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12747. module := scope.ownerModule
  12748. ELSE
  12749. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12750. IF import = NIL THEN
  12751. RETURN NIL
  12752. ELSIF import.module = NIL THEN
  12753. RETURN NIL
  12754. ELSE module := import.module
  12755. END;
  12756. END;
  12757. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12758. END GetSymbol;
  12759. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12760. BEGIN
  12761. op.mode := mode;
  12762. IntermediateCode.InitOperand(op.op);
  12763. IntermediateCode.InitOperand(op.tag);
  12764. IntermediateCode.InitOperand(op.extra);
  12765. op.dimOffset := 0;
  12766. END InitOperand;
  12767. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12768. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12769. BEGIN RETURN IntermediateCode.GetType(system, type)
  12770. END GetType;
  12771. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12772. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12773. BEGIN
  12774. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12775. (*
  12776. UniqueId(name,module,name,adr);
  12777. *)
  12778. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12779. constant.SetValue(value);
  12780. constant.SetAccess(SyntaxTree.Hidden);
  12781. module.moduleScope.AddConstant(constant);
  12782. constant.SetScope(module.moduleScope);
  12783. RETURN constant
  12784. END BuildConstant;
  12785. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12786. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12787. BEGIN
  12788. variable := scope.firstVariable;
  12789. WHILE variable # NIL DO
  12790. IF variable.NeedsTrace() THEN
  12791. RETURN TRUE;
  12792. END;
  12793. variable := variable.nextVariable;
  12794. END;
  12795. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12796. WHILE parameter # NIL DO
  12797. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12798. RETURN TRUE;
  12799. END;
  12800. parameter := parameter.nextParameter;
  12801. END;
  12802. RETURN FALSE;
  12803. END HasPointers;
  12804. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12805. 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));
  12806. END IsVariableParameter;
  12807. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12808. VAR parameter: SyntaxTree.Parameter;
  12809. BEGIN
  12810. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12811. WHILE parameter # NIL DO
  12812. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12813. IF parameter.movable THEN RETURN TRUE END;
  12814. parameter := parameter.nextParameter;
  12815. END;
  12816. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12817. END HasVariableParameters;
  12818. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12819. BEGIN
  12820. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12821. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12822. END HasExplicitTraceMethod;
  12823. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12824. BEGIN
  12825. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12826. IF (expression IS SyntaxTree.IntegerValue) THEN
  12827. val := expression(SyntaxTree.IntegerValue).value;
  12828. RETURN TRUE
  12829. ELSE
  12830. RETURN FALSE
  12831. END;
  12832. END IsIntegerConstant;
  12833. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12834. BEGIN
  12835. IF val <= 0 THEN RETURN FALSE END;
  12836. exp := 0;
  12837. WHILE ~ODD(val) DO
  12838. val := val DIV 2;
  12839. INC(exp)
  12840. END;
  12841. RETURN val = 1
  12842. END PowerOf2;
  12843. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12844. VAR procedure: SyntaxTree.Procedure;
  12845. BEGIN
  12846. procedure := record.recordScope.constructor;
  12847. IF procedure = NIL THEN
  12848. record := record.GetBaseRecord();
  12849. IF record # NIL THEN
  12850. procedure := GetConstructor(record)
  12851. END;
  12852. END;
  12853. RETURN procedure;
  12854. END GetConstructor;
  12855. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12856. BEGIN
  12857. value := SHORT(op.intValue);
  12858. RETURN op.mode = IntermediateCode.ModeImmediate;
  12859. END IsIntegerImmediate;
  12860. (** whether a type strictily is a pointer to record or object type
  12861. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12862. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12863. BEGIN
  12864. IF type = NIL THEN
  12865. RETURN FALSE
  12866. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12867. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12868. ELSE
  12869. RETURN FALSE
  12870. END
  12871. END IsStrictlyPointerToRecord;
  12872. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12873. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12874. END IsUnsafePointer;
  12875. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12876. BEGIN type := type.resolved;
  12877. IF type IS SyntaxTree.PointerType THEN
  12878. type := type(SyntaxTree.PointerType).pointerBase;
  12879. type := type.resolved;
  12880. IF type IS SyntaxTree.RecordType THEN
  12881. recordType := type(SyntaxTree.RecordType);
  12882. RETURN TRUE
  12883. ELSE
  12884. RETURN FALSE
  12885. END
  12886. ELSIF type IS SyntaxTree.RecordType THEN
  12887. recordType := type(SyntaxTree.RecordType);
  12888. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12889. ELSIF type IS SyntaxTree.ObjectType THEN
  12890. RETURN TRUE
  12891. ELSIF type IS SyntaxTree.AnyType THEN
  12892. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12893. ELSE
  12894. RETURN FALSE
  12895. END;
  12896. END IsPointerToRecord;
  12897. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12898. BEGIN
  12899. type := type.resolved;
  12900. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12901. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12902. END IsArrayOfSystemByte;
  12903. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12904. BEGIN
  12905. IF type = NIL THEN RETURN FALSE END;
  12906. type := type.resolved;
  12907. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12908. END IsOpenArray;
  12909. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12910. BEGIN
  12911. IF type = NIL THEN RETURN FALSE END;
  12912. type := type.resolved;
  12913. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12914. END IsSemiDynamicArray;
  12915. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12916. BEGIN
  12917. IF type = NIL THEN RETURN FALSE END;
  12918. type := type.resolved;
  12919. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12920. END IsStaticArray;
  12921. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  12922. BEGIN
  12923. IF type = NIL THEN RETURN FALSE END;
  12924. type := type.resolved;
  12925. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  12926. END IsStaticMathArray;
  12927. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12928. BEGIN
  12929. WHILE (IsStaticMathArray(type)) DO
  12930. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12931. END;
  12932. RETURN type;
  12933. END StaticMathArrayBaseType;
  12934. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12935. VAR size: LONGINT;
  12936. BEGIN
  12937. size := 1;
  12938. WHILE (IsStaticArray(type)) DO
  12939. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12940. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12941. END;
  12942. RETURN size;
  12943. END StaticArrayNumElements;
  12944. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12945. VAR size: LONGINT;
  12946. BEGIN
  12947. size := 1;
  12948. WHILE (IsStaticMathArray(type)) DO
  12949. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  12950. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12951. END;
  12952. RETURN size;
  12953. END StaticMathArrayNumElements;
  12954. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12955. BEGIN
  12956. WHILE (IsStaticArray(type)) DO
  12957. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12958. END;
  12959. RETURN type;
  12960. END StaticArrayBaseType;
  12961. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12962. BEGIN
  12963. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12964. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12965. END;
  12966. RETURN type;
  12967. END ArrayBaseType;
  12968. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12969. BEGIN
  12970. IF type = NIL THEN RETURN FALSE END;
  12971. type := type.resolved;
  12972. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12973. END IsDelegate;
  12974. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12975. VAR i: LONGINT;
  12976. BEGIN
  12977. i := 0; type := type.resolved;
  12978. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12979. INC(i);
  12980. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12981. END;
  12982. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12983. INC(i);
  12984. type := type(SyntaxTree.MathArrayType).arrayBase;
  12985. IF type # NIL THEN type := type.resolved END;
  12986. END;
  12987. RETURN i
  12988. END DynamicDim;
  12989. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12990. BEGIN
  12991. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12992. type := type(SyntaxTree.ArrayType).arrayBase;
  12993. END;
  12994. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12995. type := type(SyntaxTree.MathArrayType).arrayBase;
  12996. END;
  12997. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12998. END StaticSize;
  12999. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13000. BEGIN
  13001. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13002. END IsImmediate;
  13003. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13004. BEGIN
  13005. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13006. END IsAddress;
  13007. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13008. BEGIN
  13009. RETURN (x.mode = IntermediateCode.ModeRegister);
  13010. END IsRegister;
  13011. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13012. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13013. BEGIN
  13014. typeDeclaration := recordType.typeDeclaration;
  13015. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13016. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13017. END GetRecordTypeName;
  13018. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13019. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13020. BEGIN
  13021. parSize := 0;
  13022. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13023. parameter := procedureType.returnParameter;
  13024. INC(parSize,system.SizeOfParameter(parameter));
  13025. parSize := parSize + (-parSize) MOD system.addressSize;
  13026. END;
  13027. parameter :=procedureType.lastParameter;
  13028. WHILE (parameter # NIL) DO
  13029. IF SysvABIorWINAPI(procedureType.callingConvention) THEN
  13030. INC(parSize, system.addressSize);
  13031. ELSE
  13032. INC(parSize,system.SizeOfParameter(parameter));
  13033. parSize := parSize + (-parSize) MOD system.addressSize;
  13034. END;
  13035. parameter := parameter.prevParameter;
  13036. END;
  13037. IF procedureType.selfParameter # NIL THEN
  13038. parameter := procedureType.selfParameter;
  13039. INC(parSize,system.SizeOfParameter(parameter));
  13040. parSize := parSize + (-parSize) MOD system.addressSize;
  13041. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13042. END; (* method => self pointer *)
  13043. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13044. RETURN ToMemoryUnits(system,parSize)
  13045. END ParametersSize;
  13046. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13047. BEGIN
  13048. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13049. END IsNested;
  13050. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13051. BEGIN
  13052. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13053. scope := scope.outerScope;
  13054. END;
  13055. RETURN scope # NIL;
  13056. END InCellScope;
  13057. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13058. BEGIN
  13059. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  13060. RETURN 0
  13061. ELSE
  13062. *)
  13063. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  13064. (*END;*)
  13065. END ProcedureParametersSize;
  13066. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13067. VAR dataUnit: LONGINT;
  13068. BEGIN dataUnit := system.dataUnit;
  13069. ASSERT(size MOD system.dataUnit = 0);
  13070. RETURN LONGINT(size DIV system.dataUnit)
  13071. END ToMemoryUnits;
  13072. PROCEDURE Get*(): Backend.Backend;
  13073. VAR backend: IntermediateBackend;
  13074. BEGIN NEW(backend); RETURN backend
  13075. END Get;
  13076. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13077. VAR instruction: IntermediateCode.Instruction;
  13078. BEGIN
  13079. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13080. RETURN instruction
  13081. END Nop;
  13082. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13083. VAR instruction: IntermediateCode.Instruction;
  13084. BEGIN
  13085. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13086. RETURN instruction
  13087. END Mov;
  13088. (* like Mov but ensures that no new register will be allocated for dest *)
  13089. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13090. VAR instruction: IntermediateCode.Instruction;
  13091. BEGIN
  13092. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13093. RETURN instruction
  13094. END MovReplace;
  13095. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13096. VAR instruction: IntermediateCode.Instruction;
  13097. BEGIN
  13098. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13099. RETURN instruction
  13100. END Conv;
  13101. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  13102. BEGIN
  13103. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  13104. END SysvABI;
  13105. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  13106. BEGIN
  13107. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  13108. END SysvABIorWINAPI;
  13109. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13110. VAR instruction: IntermediateCode.Instruction;
  13111. BEGIN
  13112. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13113. RETURN instruction
  13114. END Call;
  13115. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13116. VAR op1, op2, op3: IntermediateCode.Operand;
  13117. VAR instruction: IntermediateCode.Instruction;
  13118. BEGIN
  13119. IntermediateCode.InitNumber(op1,pcOffset);
  13120. IntermediateCode.InitNumber(op2,callingConvention);
  13121. IntermediateCode.InitNumber(op3,unwind);
  13122. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13123. RETURN instruction
  13124. END Exit;
  13125. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13126. VAR instruction: IntermediateCode.Instruction;
  13127. BEGIN
  13128. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13129. RETURN instruction
  13130. END Return;
  13131. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13132. VAR instruction: IntermediateCode.Instruction;
  13133. BEGIN
  13134. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13135. RETURN instruction
  13136. END Result;
  13137. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13138. VAR op1: IntermediateCode.Operand;
  13139. VAR instruction: IntermediateCode.Instruction;
  13140. BEGIN
  13141. IntermediateCode.InitNumber(op1,nr);
  13142. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13143. RETURN instruction
  13144. END Trap;
  13145. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13146. VAR instruction: IntermediateCode.Instruction;
  13147. BEGIN
  13148. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13149. RETURN instruction
  13150. END Br;
  13151. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13152. VAR instruction: IntermediateCode.Instruction;
  13153. BEGIN
  13154. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13155. RETURN instruction
  13156. END Breq;
  13157. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13158. VAR instruction: IntermediateCode.Instruction;
  13159. BEGIN
  13160. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13161. RETURN instruction
  13162. END Brne;
  13163. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13164. VAR instruction: IntermediateCode.Instruction;
  13165. BEGIN
  13166. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13167. RETURN instruction
  13168. END Brge;
  13169. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13170. VAR instruction: IntermediateCode.Instruction;
  13171. BEGIN
  13172. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13173. RETURN instruction
  13174. END Brlt;
  13175. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13176. VAR instruction: IntermediateCode.Instruction;
  13177. BEGIN
  13178. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13179. RETURN instruction
  13180. END Pop;
  13181. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13182. VAR instruction: IntermediateCode.Instruction;
  13183. BEGIN
  13184. ASSERT(op.mode # IntermediateCode.Undefined);
  13185. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13186. RETURN instruction
  13187. END Push;
  13188. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13189. VAR instruction: IntermediateCode.Instruction;
  13190. BEGIN
  13191. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13192. RETURN instruction
  13193. END Neg;
  13194. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13195. VAR instruction: IntermediateCode.Instruction;
  13196. BEGIN
  13197. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13198. RETURN instruction
  13199. END Not;
  13200. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13201. VAR instruction: IntermediateCode.Instruction;
  13202. BEGIN
  13203. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13204. RETURN instruction
  13205. END Abs;
  13206. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13207. VAR instruction: IntermediateCode.Instruction;
  13208. BEGIN
  13209. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13210. ASSERT(~IsImmediate(instruction.op1));
  13211. RETURN instruction
  13212. END Mul;
  13213. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13214. VAR instruction: IntermediateCode.Instruction;
  13215. BEGIN
  13216. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13217. RETURN instruction
  13218. END Div;
  13219. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13220. VAR instruction: IntermediateCode.Instruction;
  13221. BEGIN
  13222. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13223. RETURN instruction
  13224. END Mod;
  13225. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13226. VAR instruction: IntermediateCode.Instruction;
  13227. BEGIN
  13228. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13229. RETURN instruction
  13230. END Sub;
  13231. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13232. VAR instruction: IntermediateCode.Instruction;
  13233. BEGIN
  13234. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13235. RETURN instruction
  13236. END Add;
  13237. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13238. VAR instruction: IntermediateCode.Instruction;
  13239. BEGIN
  13240. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13241. RETURN instruction
  13242. END And;
  13243. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13244. VAR instruction: IntermediateCode.Instruction;
  13245. BEGIN
  13246. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13247. RETURN instruction
  13248. END Or;
  13249. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13250. VAR instruction: IntermediateCode.Instruction;
  13251. BEGIN
  13252. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13253. RETURN instruction
  13254. END Xor;
  13255. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13256. VAR instruction: IntermediateCode.Instruction;
  13257. BEGIN
  13258. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13259. RETURN instruction
  13260. END Shl;
  13261. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13262. VAR instruction: IntermediateCode.Instruction;
  13263. BEGIN
  13264. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13265. RETURN instruction
  13266. END Shr;
  13267. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13268. VAR instruction: IntermediateCode.Instruction;
  13269. BEGIN
  13270. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13271. RETURN instruction
  13272. END Rol;
  13273. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13274. VAR instruction: IntermediateCode.Instruction;
  13275. BEGIN
  13276. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13277. RETURN instruction
  13278. END Ror;
  13279. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13280. VAR instruction: IntermediateCode.Instruction;
  13281. BEGIN
  13282. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13283. RETURN instruction
  13284. END Cas;
  13285. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13286. VAR instruction: IntermediateCode.Instruction;
  13287. BEGIN
  13288. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13289. RETURN instruction
  13290. END Copy;
  13291. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13292. VAR instruction: IntermediateCode.Instruction;
  13293. BEGIN
  13294. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13295. RETURN instruction
  13296. END Fill;
  13297. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13298. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13299. BEGIN
  13300. string := IntermediateCode.String(s);
  13301. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13302. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13303. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13304. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13305. RETURN instruction
  13306. END Asm;
  13307. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13308. VAR instruction: IntermediateCode.Instruction;
  13309. BEGIN
  13310. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13311. RETURN instruction
  13312. END Data;
  13313. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13314. VAR instruction: IntermediateCode.Instruction;
  13315. BEGIN
  13316. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13317. IntermediateCode.SetSubType(instruction, subtype);
  13318. RETURN instruction
  13319. END SpecialInstruction;
  13320. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13321. VAR op1: IntermediateCode.Operand;
  13322. VAR instruction: IntermediateCode.Instruction;
  13323. BEGIN
  13324. (*! generate a warning if size exceeds a certain limit *)
  13325. (*
  13326. ASSERT(bytes < 1000000); (* sanity check *)
  13327. *)
  13328. ASSERT(0 <= units); (* sanity check *)
  13329. IntermediateCode.InitNumber(op1,units);
  13330. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13331. RETURN instruction
  13332. END Reserve;
  13333. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13334. VAR op1: IntermediateCode.Operand;
  13335. VAR instruction: IntermediateCode.Instruction;
  13336. BEGIN
  13337. IntermediateCode.InitNumber(op1,position.start);
  13338. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13339. RETURN instruction
  13340. END LabelInstruction;
  13341. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13342. VAR pc: LONGINT;
  13343. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13344. BEGIN
  13345. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13346. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13347. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13348. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13349. IF instr.op1.type.form = IntermediateCode.Float THEN
  13350. RETURN instr.op1.floatValue = op.floatValue
  13351. ELSE
  13352. RETURN instr.op1.intValue = op.intValue
  13353. END;
  13354. END ProvidesValue;
  13355. BEGIN
  13356. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13357. pc := 0;
  13358. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13359. INC(pc);
  13360. END;
  13361. IF pc = data.pc THEN
  13362. data.Emit(Data(Basic.invalidPosition,vop));
  13363. END;
  13364. RETURN pc
  13365. END EnterImmediate;
  13366. PROCEDURE Init;
  13367. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13368. BEGIN
  13369. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13370. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13371. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13372. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13373. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13374. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13375. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13376. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13377. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13378. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13379. IntermediateCode.InitOperand(emptyOperand);
  13380. FOR i := 0 TO NumberSystemCalls-1 DO
  13381. name := "@SystemCall";
  13382. Basic.AppendNumber(name,i);
  13383. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13384. END;
  13385. END Init;
  13386. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13387. BEGIN
  13388. RETURN (symbol # NIL) & symbol.NeedsSection();
  13389. END IsExported;
  13390. BEGIN
  13391. Init;
  13392. END FoxIntermediateBackend.
  13393. Compiler.Compile -p=Win32G FoxIntermediateBackend.Mod ~
  13394. # Release.Build --path="/temp/obg/" Win32G ~
  13395. # 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 ~
  13396. FStols.CloseFiles A2Z.exe ~
  13397. SystemTools.FreeDownTo FoxIntermediateBackend ~
  13398. Compiler.Compile -p=Win32G --destPath=/temp/obg/ --traceModule=Trace
  13399. Runtime.Mod Trace.Mod Generic.Win32.Kernel32.Mod Win32.Machine.Mod Heaps.Mod
  13400. Generic.Modules.Mod Win32.Objects.Mod Win32.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13401. Commands.Mod I386.Reals.Mod Generic.Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13402. Win32.Traps.Mod Locks.Mod Win32.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13403. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13404. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Win32.User32.Mod
  13405. Win32.WinTrace.Mod Win32.ODBC.Mod Win32.Shell32.Mod Win32.SQL.Mod Win32.WinFS.Mod
  13406. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13407. GenericLinker.Mod GenericLoader.Mod BootConsole.Mod