FoxIntermediateBackend.Mod 572 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067140681406914070140711407214073140741407514076140771407814079140801408114082140831408414085140861408714088140891409014091140921409314094140951409614097140981409914100141011410214103141041410514106141071410814109141101411114112141131411414115141161411714118141191412014121141221412314124141251412614127141281412914130141311413214133141341413514136141371413814139141401414114142141431414414145141461414714148141491415014151141521415314154141551415614157141581415914160141611416214163141641416514166141671416814169141701417114172141731417414175141761417714178141791418014181141821418314184141851418614187141881418914190141911419214193141941419514196141971419814199142001420114202142031420414205142061420714208142091421014211142121421314214142151421614217142181421914220142211422214223142241422514226142271422814229142301423114232142331423414235142361423714238142391424014241142421424314244142451424614247142481424914250142511425214253142541425514256142571425814259142601426114262142631426414265142661426714268142691427014271142721427314274142751427614277142781427914280142811428214283142841428514286142871428814289142901429114292142931429414295142961429714298142991430014301143021430314304143051430614307143081430914310143111431214313143141431514316143171431814319143201432114322143231432414325143261432714328143291433014331143321433314334143351433614337143381433914340143411434214343143441434514346143471434814349143501435114352143531435414355143561435714358143591436014361143621436314364143651436614367143681436914370143711437214373143741437514376143771437814379143801438114382143831438414385143861438714388143891439014391143921439314394143951439614397143981439914400144011440214403144041440514406144071440814409144101441114412144131441414415144161441714418144191442014421144221442314424144251442614427144281442914430144311443214433144341443514436144371443814439144401444114442144431444414445144461444714448144491445014451144521445314454144551445614457144581445914460144611446214463144641446514466144671446814469144701447114472144731447414475144761447714478144791448014481144821448314484144851448614487144881448914490144911449214493144941449514496144971449814499145001450114502145031450414505145061450714508145091451014511145121451314514145151451614517145181451914520145211452214523145241452514526145271452814529145301453114532145331453414535145361453714538145391454014541145421454314544145451454614547145481454914550145511455214553145541455514556145571455814559145601456114562145631456414565145661456714568145691457014571145721457314574145751457614577145781457914580145811458214583145841458514586145871458814589145901459114592145931459414595145961459714598145991460014601146021460314604146051460614607146081460914610146111461214613146141461514616146171461814619146201462114622146231462414625146261462714628146291463014631146321463314634146351463614637146381463914640146411464214643146441464514646146471464814649146501465114652
  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. BEGIN
  292. size := offset - lastUpdated;
  293. IF size > 0 THEN
  294. irv.Emit(Reserve(x.position,size));
  295. END;
  296. irv.Emit(Data(x.position, op));
  297. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  298. END SingleInitialize;
  299. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset: LONGINT);
  300. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size: SIZE;
  301. BEGIN
  302. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  303. WITH type: SyntaxTree.RecordType DO
  304. baseType := type.baseType;
  305. IF baseType # NIL THEN
  306. baseType := baseType.resolved;
  307. IF baseType IS SyntaxTree.PointerType THEN
  308. baseType := baseType(SyntaxTree.PointerType).pointerBase
  309. END;
  310. Initialize(baseType,NIL, offset);
  311. END;
  312. variable := type.recordScope.firstVariable;
  313. WHILE variable # NIL DO
  314. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  315. variable := variable.nextVariable
  316. END;
  317. | type: SyntaxTree.ArrayType DO
  318. IF type.form = SyntaxTree.Static THEN
  319. baseType := type.arrayBase;
  320. IF TypeNeedsInitialization(baseType) THEN
  321. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  322. FOR i := 0 TO type.staticLength-1 DO
  323. Initialize(baseType,NIL,offset+i*size);
  324. END;
  325. END;
  326. END;
  327. | type: SyntaxTree.MathArrayType DO
  328. IF type.form = SyntaxTree.Open THEN
  329. dim := DynamicDim(type);
  330. baseType := SemanticChecker.ArrayBase(type,dim);
  331. imm := IntermediateCode.Immediate(addressType,dim);
  332. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  333. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  334. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  335. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  336. (* flags remain empty (=0) for open array *)
  337. ELSIF type.form = SyntaxTree.Static THEN
  338. baseType := type.arrayBase;
  339. IF TypeNeedsInitialization(baseType) THEN
  340. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  341. ASSERT(type.staticLength < 1024*1024*1024);
  342. FOR i := 0 TO type.staticLength-1 DO
  343. Initialize(baseType,NIL,offset+i*size);
  344. END;
  345. END;
  346. END;
  347. ELSE
  348. IF initializer # NIL THEN
  349. implementationVisitor.Evaluate(initializer, op);
  350. SingleInitialize(op.op, offset);
  351. END;
  352. END;
  353. END Initialize;
  354. BEGIN
  355. IF x.externalName # NIL THEN RETURN END;
  356. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  357. (* code section for variable *)
  358. Global.GetSymbolSegmentedName(x,name);
  359. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  360. irv.SetExported(IsExported(x));
  361. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  362. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  363. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  364. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  365. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  366. FOR i := 0 TO DynamicDim(x.type)-1 DO
  367. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  368. END;
  369. ELSE
  370. lastUpdated:= 0;
  371. IF implementationVisitor.newObjectFile & ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  372. Initialize(x.type, x.initializer, 0);
  373. END;
  374. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  375. IF size > 0 THEN
  376. irv.Emit(Reserve(x.position,size));
  377. END;
  378. IF ~x.fixed THEN
  379. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  380. ELSE
  381. align := x.alignment;
  382. END;
  383. irv.SetPositionOrAlignment(x.fixed, align);
  384. meta.CheckTypeDeclaration(x.type);
  385. END;
  386. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  387. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  388. END;
  389. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  390. END VisitVariable;
  391. PROCEDURE VisitProperty(x: SyntaxTree.Property);
  392. BEGIN
  393. VisitVariable(x)
  394. END VisitProperty;
  395. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  396. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  397. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  398. BEGIN
  399. ASSERT(currentScope IS SyntaxTree.CellScope);
  400. Global.GetSymbolSegmentedName(x,name);
  401. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  402. irv.SetExported(IsExported(x));
  403. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  404. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  405. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  406. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  407. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  408. FOR i := 0 TO DynamicDim(x.type)-1 DO
  409. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  410. END;
  411. ELSE
  412. lastUpdated:= 0;
  413. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  414. IF size > 0 THEN
  415. irv.Emit(Reserve(x.position,size));
  416. END;
  417. IF ~x.fixed THEN
  418. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  419. ELSE
  420. align := x.alignment;
  421. END;
  422. irv.SetPositionOrAlignment(x.fixed, align);
  423. meta.CheckTypeDeclaration(x.type);
  424. END;
  425. END VisitParameter;
  426. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  427. BEGIN
  428. Type(x.declaredType); (* => code in objects *)
  429. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  430. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  431. END;
  432. END VisitTypeDeclaration;
  433. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  434. BEGIN
  435. IF (SyntaxTree.Public * x.access # {}) THEN
  436. implementationVisitor.VisitConstant(x);
  437. END;
  438. END VisitConstant;
  439. PROCEDURE Scope(x: SyntaxTree.Scope);
  440. VAR procedure: SyntaxTree.Procedure;
  441. constant: SyntaxTree.Constant;
  442. variable: SyntaxTree.Variable;
  443. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  444. cell: SyntaxTree.CellType;
  445. parameter: SyntaxTree.Parameter;
  446. property: SyntaxTree.Property;
  447. BEGIN
  448. prevScope := currentScope;
  449. currentScope := x;
  450. (* constants treated in implementation visitor *)
  451. WITH x: SyntaxTree.CellScope DO
  452. cell := x.ownerCell;
  453. parameter := cell.firstParameter;
  454. WHILE parameter # NIL DO
  455. VisitParameter(parameter);
  456. parameter := parameter.nextParameter;
  457. END;
  458. property := cell.firstProperty;
  459. WHILE property # NIL DO
  460. VisitProperty(property);
  461. property := property.nextProperty;
  462. END;
  463. ELSE
  464. END;
  465. typeDeclaration := x.firstTypeDeclaration;
  466. WHILE typeDeclaration # NIL DO
  467. VisitTypeDeclaration(typeDeclaration);
  468. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  469. END;
  470. variable := x.firstVariable;
  471. WHILE variable # NIL DO
  472. VisitVariable(variable);
  473. variable := variable.nextVariable;
  474. END;
  475. procedure := x.firstProcedure;
  476. WHILE procedure # NIL DO
  477. VisitProcedure(procedure);
  478. procedure := procedure.nextProcedure;
  479. END;
  480. constant := x.firstConstant;
  481. WHILE constant # NIL DO
  482. VisitConstant(constant);
  483. constant := constant.nextConstant;
  484. END;
  485. currentScope := prevScope;
  486. END Scope;
  487. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  488. VAR parameter: SyntaxTree.Parameter;
  489. BEGIN
  490. parameter := first;
  491. WHILE parameter # NIL DO
  492. VisitParameter(parameter);
  493. parameter := parameter.nextParameter;
  494. END;
  495. END Parameters;
  496. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  497. VAR scope: SyntaxTree.ProcedureScope;
  498. prevScope: SyntaxTree.Scope;
  499. inline, finalizer: BOOLEAN;
  500. procedureType: SyntaxTree.ProcedureType;
  501. pc: LONGINT;
  502. stackSize: LONGINT;
  503. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  504. null,size,src,dest,fp,res: IntermediateCode.Operand;
  505. cc: LONGINT;
  506. cellType: SyntaxTree.CellType;
  507. registerNumber: LONGINT;
  508. registerParameter: Backend.Registers;
  509. registerParameters: LONGINT;
  510. registerClass: IntermediateCode.RegisterClass;
  511. type: IntermediateCode.Type;
  512. formalParameter: SyntaxTree.Parameter;
  513. recordType: SyntaxTree.RecordType;
  514. isModuleBody: BOOLEAN;
  515. parametersSize: LONGINT;
  516. PROCEDURE Signature;
  517. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  518. BEGIN
  519. procedureType := x.type(SyntaxTree.ProcedureType);
  520. returnType := procedureType.returnType;
  521. IF returnType # NIL THEN
  522. meta.CheckTypeDeclaration(returnType)
  523. END;
  524. parameter := procedureType.firstParameter;
  525. WHILE parameter # NIL DO
  526. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  527. parameter := parameter.nextParameter;
  528. END;
  529. END Signature;
  530. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  531. VAR result: BOOLEAN;
  532. BEGIN
  533. result := FALSE;
  534. IF x = SyntaxTree.invalidExpression THEN
  535. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  536. result := TRUE;
  537. value := x.resolved(SyntaxTree.IntegerValue).value;
  538. ELSE
  539. Error(x.position,"expression is not an integer constant");
  540. END;
  541. RETURN result;
  542. END CheckIntegerValue;
  543. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  544. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  545. BEGIN
  546. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  547. WHILE (this # NIL) & (this.identifier # id) DO
  548. this := this.nextModifier;
  549. END;
  550. IF this # NIL THEN
  551. IF this.expression = NIL THEN
  552. Error(this.position,"expected expression value");
  553. ELSIF CheckIntegerValue(this.expression,value) THEN
  554. END;
  555. RETURN TRUE
  556. ELSE RETURN FALSE
  557. END;
  558. END HasValue;
  559. CONST DefaultDataMemorySize=512;
  560. BEGIN
  561. IF x.externalName # NIL THEN RETURN END;
  562. (*
  563. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  564. *)
  565. (* code section for this procedure *)
  566. scope := x.procedureScope;
  567. prevScope := currentScope;
  568. currentScope := scope;
  569. procedureType := x.type(SyntaxTree.ProcedureType);
  570. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  571. implementationVisitor.temporaries.Init;
  572. implementationVisitor.usedRegisters := NIL;
  573. implementationVisitor.registerUsageCount.Init;
  574. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  575. IF (scope.body # NIL) & (x.isInline) THEN
  576. inline := TRUE;
  577. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  578. ir.SetExported(IsExported(x));
  579. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  580. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  581. IF backend.cellsAreObjects THEN
  582. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  583. ir.SetExported(IsExported(x));
  584. ELSE
  585. RETURN; (* cellnet cannot be compiled for final static hardware *)
  586. END;
  587. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  588. inline := FALSE;
  589. AddBodyCallStub(x);
  590. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  591. ir.SetExported(IsExported(x));
  592. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  593. inline := FALSE;
  594. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  595. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  596. AddBodyCallStub(x);
  597. AddStackAllocation(x,stackSize);
  598. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  599. ir.SetExported(IsExported(x));
  600. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  601. inline := FALSE;
  602. Parameters(procedureType.firstParameter);
  603. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  604. ir.SetExported(IsExported(x));
  605. ELSE
  606. inline := FALSE;
  607. IF x.isEntry OR x.isExit THEN
  608. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  609. ir.SetExported(TRUE);
  610. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  611. ELSE
  612. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  613. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  614. END;
  615. END;
  616. cc := procedureType.callingConvention;
  617. IF cc = SyntaxTree.WinAPICallingConvention THEN
  618. parametersSize := ProcedureParametersSize(backend.system,x);
  619. ELSE
  620. parametersSize := 0;
  621. END;
  622. IF scope.body # NIL THEN
  623. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  624. registerNumber := 0;
  625. IF ~inline THEN
  626. IF scope.lastVariable = NIL THEN
  627. stackSize := 0
  628. ELSE
  629. stackSize := scope.lastVariable.offsetInBits;
  630. IF stackSize <0 THEN stackSize := -stackSize END;
  631. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  632. END;
  633. (*
  634. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  635. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  636. *)
  637. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  638. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  639. END;
  640. pc := ir.pc-1;
  641. (*
  642. ir.Emit(Nop(position)); (* placeholder for fill *)
  643. *)
  644. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  645. registerParameter := backend.GetParameterRegisters(procedureType.callingConvention);
  646. IF registerParameter = NIL THEN registerParameters := 0
  647. ELSE registerParameters := LEN(registerParameter)
  648. END;
  649. formalParameter := procedureType.lastParameter;
  650. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  651. IF ~PassInRegister(formalParameter) THEN
  652. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  653. ELSE
  654. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, registerParameter[registerNumber]);
  655. type := GetType(system, formalParameter.type);
  656. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  657. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  658. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  659. implementationVisitor.ReleaseIntermediateOperand(src);
  660. INC(registerNumber);
  661. formalParameter := formalParameter.prevParameter;
  662. END;
  663. END;
  664. END;
  665. END;
  666. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  667. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  668. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  669. IF scope.lastVariable # NIL THEN
  670. stackSize := scope.lastVariable.offsetInBits;
  671. IF stackSize <0 THEN stackSize := -stackSize END;
  672. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  673. END;
  674. END;
  675. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  676. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  677. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  678. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  679. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  680. ir.EmitAt(pc,Push(size));
  681. implementationVisitor.StaticCallOperand(result,procedure);
  682. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  683. END;
  684. *)
  685. END;
  686. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  687. IF stackSize > 0 THEN
  688. IF (stackSize MOD system.addressSize = 0) THEN
  689. null := IntermediateCode.Immediate(addressType,0);
  690. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  691. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  692. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  693. ELSE
  694. null := IntermediateCode.Immediate(int8,0);
  695. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  696. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  697. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  698. END;
  699. (*! should potentially be called by backend -- enter might initialize
  700. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  701. *)
  702. END;
  703. IF procedureType.callingConvention = SyntaxTree.WinAPICallingConvention THEN
  704. parametersSize := ProcedureParametersSize(backend.system,x);
  705. ELSE
  706. parametersSize := 0;
  707. END;
  708. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  709. finalizer := FALSE;
  710. IF backend.cooperative & x.isFinalizer THEN
  711. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  712. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  713. GetRecordTypeName(recordType,name);
  714. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  715. END;
  716. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  717. IF backend.cooperative THEN
  718. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  719. IF implementationVisitor.profile & ~isModuleBody THEN
  720. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  721. END;
  722. END;
  723. implementationVisitor.EmitLeave(ir, x.position,x,cc);
  724. IF finalizer THEN
  725. IF backend.hasLinkRegister THEN
  726. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  727. END;
  728. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  729. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  730. ir.Emit(Br(x.position,dest));
  731. ELSE
  732. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  733. END;
  734. ELSE
  735. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  736. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  737. END;
  738. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  739. IF backend.cooperative THEN
  740. IF HasPointers (scope) THEN
  741. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  742. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  743. ir.Emit(Result(x.position, res));
  744. ir.Emit(Push(x.position, res));
  745. implementationVisitor.ResetVariables(scope);
  746. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  747. ir.Emit(Pop(x.position, res));
  748. ir.Emit(Return(x.position, res));
  749. ELSE
  750. implementationVisitor.ResetVariables(scope);
  751. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  752. END;
  753. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  754. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  755. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  756. ir.Emit(Result(x.position, res));
  757. ir.Emit(Push(x.position, res));
  758. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  759. ir.Emit(Pop(x.position, res));
  760. ir.Emit(Return(x.position, res));
  761. ELSE
  762. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  763. END;
  764. END;
  765. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  766. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  767. ELSE
  768. ir.Emit(Nop(x.position));
  769. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  770. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  771. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  772. END;
  773. END;
  774. END
  775. END;
  776. ELSE (* force body for procedures *)
  777. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  778. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  779. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  780. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  781. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  782. END;
  783. Scope(scope);
  784. Signature;
  785. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  786. currentScope := prevScope;
  787. END Procedure;
  788. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  789. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  790. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  791. BEGIN
  792. ASSERT (bodyProcedure # NIL);
  793. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  794. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  795. procedure.SetScope(bodyProcedure.scope);
  796. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  797. procedure.SetAccess(SyntaxTree.Hidden);
  798. Global.GetSymbolSegmentedName (procedure,name);
  799. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  800. ir.SetExported(TRUE);
  801. ir.SetPriority(InitPriority);
  802. Global.GetSymbolSegmentedName (bodyProcedure,name);
  803. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  804. implementationVisitor.currentScope := module.module.moduleScope;
  805. implementationVisitor.section := ir;
  806. implementationVisitor.PushSelfPointer();
  807. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  808. ELSIF backend.preregisterStatic THEN
  809. implementationVisitor.currentScope := module.module.moduleScope;
  810. implementationVisitor.section := ir;
  811. implementationVisitor.PushSelfPointer();
  812. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  813. ELSE
  814. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  815. ir.Emit(Call(bodyProcedure.position,op, 0));
  816. END;
  817. END AddBodyCallStub;
  818. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  819. VAR name: Basic.SegmentedName;
  820. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  821. BEGIN
  822. Global.GetSymbolSegmentedName (symbol,name);
  823. Basic.RemoveSuffix(name);
  824. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  825. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  826. ir.SetExported(TRUE);
  827. ir.SetPriority(FirstPriority);
  828. IntermediateCode.InitImmediate(op,addressType,initStack);
  829. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  830. END AddStackAllocation;
  831. (** entry function to visit a complete module *)
  832. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  833. VAR
  834. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  835. hasDynamicOperatorDeclarations: BOOLEAN;
  836. operator: SyntaxTree.Operator;
  837. import: SyntaxTree.Import;
  838. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  839. BEGIN
  840. type := type.resolved;
  841. IF type IS SyntaxTree.RecordType THEN
  842. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  843. ELSIF (type IS SyntaxTree.ArrayType) THEN
  844. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  845. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  846. END;
  847. ELSIF type IS SyntaxTree.MathArrayType THEN
  848. WITH type: SyntaxTree.MathArrayType DO
  849. IF type.form = SyntaxTree.Open THEN
  850. RETURN TRUE
  851. ELSIF type.form = SyntaxTree.Static THEN
  852. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  853. END;
  854. END;
  855. END;
  856. RETURN FALSE
  857. END TypeNeedsInitialization;
  858. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  859. VAR variable: SyntaxTree.Variable;
  860. BEGIN
  861. variable := scope.firstVariable;
  862. WHILE variable # NIL DO
  863. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  864. IF variable.initializer # NIL THEN RETURN TRUE END;
  865. variable := variable.nextVariable;
  866. END;
  867. RETURN FALSE
  868. END ScopeNeedsInitialization;
  869. BEGIN
  870. ASSERT(x # NIL); ASSERT(module # NIL);
  871. SELF.module := module;
  872. (* add import names to the generated Sections.Module *)
  873. import := x.moduleScope.firstImport;
  874. WHILE import # NIL DO
  875. import.module.GetName(idstr);
  876. module.imports.AddName(idstr);
  877. import := import.nextImport
  878. END;
  879. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  880. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  881. moduleSelf := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@moduleSelf"));
  882. moduleSelf.SetType(system.anyType);
  883. moduleSelf.SetScope(x.moduleScope);
  884. moduleSelf.SetUntraced(TRUE);
  885. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  886. ir.SetExported(TRUE);
  887. IntermediateCode.InitImmediate(op,addressType,0);
  888. ir.Emit(Data(Basic.invalidPosition,op));
  889. END;
  890. implementationVisitor.module := module;
  891. implementationVisitor.moduleScope := x.moduleScope;
  892. implementationVisitor.moduleSelf := moduleSelf;
  893. implementationVisitor.canBeLoaded := TRUE;
  894. meta.SetModule(module);
  895. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  896. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  897. END;
  898. IF backend.profile THEN
  899. EnsureBodyProcedure(x.moduleScope);
  900. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  901. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  902. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  903. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  904. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  905. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  906. Global.GetModuleName(module.module,idstr);
  907. implementationVisitor.ProfilerAddModule(idstr);
  908. implementationVisitor.numberProcedures := 0;
  909. END;
  910. implementationVisitor.profile := backend.profile;
  911. (* check if there is at least one dynamic operator locally defined *)
  912. hasDynamicOperatorDeclarations := FALSE;
  913. operator := x.moduleScope.firstOperator;
  914. WHILE operator # NIL DO
  915. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  916. operator := operator.nextOperator
  917. END;
  918. (* add operator initialization code section *)
  919. IF hasDynamicOperatorDeclarations THEN
  920. EnsureBodyProcedure(x.moduleScope);
  921. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  922. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  923. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  924. END;
  925. Scope(x.moduleScope);
  926. IF hasDynamicOperatorDeclarations THEN
  927. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  928. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  929. END;
  930. IF backend.profile THEN
  931. implementationVisitor.ProfilerPatchInit;
  932. END;
  933. END Module;
  934. END DeclarationVisitor;
  935. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  936. RegisterUsageCount*=OBJECT
  937. VAR used: UsedArray; count: LONGINT;
  938. PROCEDURE &Init;
  939. VAR i: LONGINT;
  940. BEGIN
  941. count := 0;
  942. IF used = NIL THEN NEW(used,64); END;
  943. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  944. END Init;
  945. PROCEDURE Grow;
  946. VAR new: UsedArray; size,i: LONGINT;
  947. BEGIN
  948. size := LEN(used)*2;
  949. NEW(new,size);
  950. FOR i := 0 TO LEN(used)-1 DO
  951. new[i].count := used[i].count;
  952. new[i].type := used[i].type;
  953. new[i].map := used[i].map
  954. END;
  955. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  956. used := new
  957. END Grow;
  958. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  959. BEGIN
  960. INC(count);
  961. IF count = LEN(used) THEN Grow END;
  962. used[count].type := type;
  963. used[count].class := class;
  964. used[count].map := count;
  965. RETURN count;
  966. END Next;
  967. PROCEDURE IncUse(register: LONGINT);
  968. BEGIN
  969. INC(used[register].count);
  970. (*
  971. IF (register = 1) & (count > 30) THEN
  972. D.TraceBack;
  973. END;
  974. *)
  975. END IncUse;
  976. PROCEDURE DecUse(register: LONGINT);
  977. BEGIN
  978. DEC(used[register].count);
  979. END DecUse;
  980. PROCEDURE Map(register: LONGINT): LONGINT;
  981. VAR map : LONGINT;
  982. BEGIN
  983. IF register > 0 THEN
  984. map := used[register].map;
  985. WHILE register # map DO register := map; map := used[register].map END;
  986. END;
  987. RETURN register
  988. END Map;
  989. PROCEDURE Use(register: LONGINT): LONGINT;
  990. BEGIN
  991. IF register< LEN(used) THEN
  992. RETURN used[register].count
  993. ELSE
  994. RETURN 0
  995. END
  996. END Use;
  997. END RegisterUsageCount;
  998. RegisterEntry = POINTER TO RECORD
  999. prev,next: RegisterEntry;
  1000. register: LONGINT;
  1001. registerClass: IntermediateCode.RegisterClass;
  1002. type: IntermediateCode.Type;
  1003. END;
  1004. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1005. Variables = OBJECT (Basic.List)
  1006. VAR
  1007. inUse: VariableUse;
  1008. registerIndex: LONGINT;
  1009. nameIndex: LONGINT;
  1010. PROCEDURE & Init;
  1011. VAR i: LONGINT;
  1012. BEGIN
  1013. InitList(16);
  1014. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1015. registerIndex := 1024;
  1016. nameIndex := 0;
  1017. END Init;
  1018. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1019. VAR string: SyntaxTree.IdentifierString ;
  1020. BEGIN
  1021. COPY("@hiddenIRVar",string);
  1022. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1023. RETURN SyntaxTree.NewIdentifier(string);
  1024. END GetUID;
  1025. PROCEDURE GetUsage(VAR use: VariableUse);
  1026. BEGIN
  1027. use := inUse;
  1028. END GetUsage;
  1029. PROCEDURE SetUsage(CONST use: VariableUse);
  1030. BEGIN
  1031. inUse := use;
  1032. END SetUsage;
  1033. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1034. VAR any: ANY;
  1035. BEGIN
  1036. any := Get(i);;
  1037. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1038. END GetVariable;
  1039. PROCEDURE Occupy(pos: LONGINT);
  1040. BEGIN
  1041. INCL(inUse[pos DIV 32], pos MOD 32);
  1042. END Occupy;
  1043. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1044. BEGIN
  1045. Occupy(Length());
  1046. Add(v);
  1047. END AddVariable;
  1048. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1049. BEGIN
  1050. t1 := t1.resolved;
  1051. t2 := t2.resolved;
  1052. RETURN
  1053. (t1.SameType(t2))
  1054. OR
  1055. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1056. OR
  1057. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits = t2.sizeInBits)
  1058. OR
  1059. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1060. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1061. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1062. OR
  1063. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1064. (DynamicDim(t1) = DynamicDim(t2))
  1065. );
  1066. END CompatibleType;
  1067. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1068. VAR var : SyntaxTree.Variable;
  1069. BEGIN
  1070. FOR pos := 0 TO Length()-1 DO
  1071. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  1072. var := GetVariable(pos);
  1073. IF CompatibleType(type, var.type) & (var.untraced = untraced) THEN
  1074. Occupy(pos); RETURN var
  1075. END;
  1076. END;
  1077. END;
  1078. pos := Length();
  1079. RETURN NIL
  1080. END GetFreeVariable;
  1081. END Variables;
  1082. SymbolMap = POINTER TO RECORD
  1083. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1084. isAddress: BOOLEAN;
  1085. END;
  1086. SymbolMapper = OBJECT
  1087. VAR
  1088. first: SymbolMap;
  1089. PROCEDURE & Init;
  1090. BEGIN
  1091. first := NIL;
  1092. END Init;
  1093. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1094. VAR new: SymbolMap;
  1095. BEGIN
  1096. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1097. new.next := first; first := new;
  1098. END Add;
  1099. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1100. VAR s: SymbolMap;
  1101. BEGIN
  1102. s := first;
  1103. WHILE (s # NIL) & (s.this # this) DO
  1104. s := s.next
  1105. END;
  1106. RETURN s
  1107. END Get;
  1108. END SymbolMapper;
  1109. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1110. VAR
  1111. system: Global.System;
  1112. section: IntermediateCode.Section;
  1113. module: Sections.Module;
  1114. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1115. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1116. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1117. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1118. checker: SemanticChecker.Checker;
  1119. backend: IntermediateBackend;
  1120. meta: MetaDataGenerator;
  1121. position: Position;
  1122. moduleSelf: SyntaxTree.Variable;
  1123. (* variables for hand over of variables / temporary state *)
  1124. currentScope: SyntaxTree.Scope;
  1125. constantDeclaration : SyntaxTree.Symbol;
  1126. result: Operand; (* result of the most recent expression / statement *)
  1127. destination: IntermediateCode.Operand;
  1128. arrayDestinationTag: IntermediateCode.Operand;
  1129. arrayDestinationDimension:LONGINT;
  1130. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1131. conditional: BOOLEAN;
  1132. trueLabel, falseLabel, exitLabel: Label;
  1133. locked: BOOLEAN;
  1134. (*
  1135. usedRegisters: Registers;
  1136. *)
  1137. registerUsageCount: RegisterUsageCount;
  1138. usedRegisters: RegisterEntry;
  1139. (* useful operands and types *)
  1140. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1141. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1142. commentPrintout: Printout.Printer;
  1143. dump: Streams.Writer;
  1144. tagsAvailable : BOOLEAN;
  1145. supportedInstruction: SupportedInstructionProcedure;
  1146. supportedImmediate: SupportedImmediateProcedure;
  1147. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1148. emitLabels: BOOLEAN;
  1149. runtimeModuleName : SyntaxTree.IdentifierString;
  1150. newObjectFile: BOOLEAN;
  1151. indexCounter: LONGINT;
  1152. profile: BOOLEAN;
  1153. profileId, profileInit: IntermediateCode.Section;
  1154. profileInitPatchPosition: LONGINT;
  1155. numberProcedures: LONGINT;
  1156. procedureResultDesignator : SyntaxTree.Designator;
  1157. operatorInitializationCodeSection: IntermediateCode.Section;
  1158. fingerPrinter: FingerPrinter.FingerPrinter;
  1159. temporaries: Variables;
  1160. canBeLoaded : BOOLEAN;
  1161. currentIsInline: BOOLEAN;
  1162. currentMapper: SymbolMapper;
  1163. currentInlineExit: Label;
  1164. moduleBodySection: IntermediateCode.Section;
  1165. NeedDescriptor : BOOLEAN;
  1166. cooperativeSwitches: BOOLEAN;
  1167. lastSwitchPC: LONGINT;
  1168. isUnchecked: BOOLEAN;
  1169. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1170. newObjectFile: BOOLEAN);
  1171. BEGIN
  1172. SELF.system := system;
  1173. SELF.runtimeModuleName := runtime;
  1174. currentScope := NIL;
  1175. hiddenPointerType := NIL;
  1176. delegatePointerType := NIL;
  1177. awaitProcCounter := 0;
  1178. labelId := 0; constId := 0; labelId := 0;
  1179. SELF.checker := checker;
  1180. SELF.backend := backend;
  1181. position := Basic.invalidPosition;
  1182. conditional := FALSE;
  1183. locked := FALSE;
  1184. InitOperand(result,ModeUndefined);
  1185. addressType := IntermediateCode.GetType(system,system.addressType);
  1186. setType := IntermediateCode.GetType(system,system.setType);
  1187. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1188. byteType := IntermediateCode.GetType(system, system.byteType);
  1189. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1190. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1191. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1192. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1193. nil := IntermediateCode.Immediate(addressType,0);
  1194. one := IntermediateCode.Immediate(addressType,1);
  1195. IntermediateCode.InitOperand(destination);
  1196. tagsAvailable := TRUE;
  1197. supportedInstruction := supportedInstructionProcedure;
  1198. supportedImmediate := supportedImmediateProcedure;
  1199. inData := FALSE;
  1200. SELF.emitLabels := emitLabels;
  1201. IntermediateCode.InitOperand(arrayDestinationTag);
  1202. bool := IntermediateCode.GetType(system,system.booleanType);
  1203. IntermediateCode.InitImmediate(false,bool,0);
  1204. IntermediateCode.InitImmediate(true,bool,1);
  1205. SELF.newObjectFile := newObjectFile;
  1206. indexCounter := 0;
  1207. NEW(registerUsageCount);
  1208. usedRegisters := NIL;
  1209. procedureResultDesignator := NIL;
  1210. NEW(fingerPrinter);
  1211. NEW(temporaries);
  1212. currentIsInline := FALSE;
  1213. NeedDescriptor := FALSE;
  1214. isUnchecked := backend.noRuntimeChecks;
  1215. END Init;
  1216. TYPE Context = RECORD
  1217. section: IntermediateCode.Section;
  1218. registerUsageCount: RegisterUsageCount;
  1219. usedRegisters: RegisterEntry;
  1220. END;
  1221. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1222. VAR context: Context;
  1223. BEGIN
  1224. context.section := section;
  1225. context.registerUsageCount := registerUsageCount;
  1226. context.usedRegisters := usedRegisters;
  1227. section := new;
  1228. NEW(registerUsageCount);
  1229. usedRegisters := NIL;
  1230. RETURN context;
  1231. END SwitchContext;
  1232. PROCEDURE ReturnToContext(context: Context);
  1233. BEGIN
  1234. section := context.section;
  1235. registerUsageCount := context.registerUsageCount;
  1236. usedRegisters := context.usedRegisters;
  1237. END ReturnToContext;
  1238. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1239. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1240. BEGIN
  1241. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1242. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1243. END;
  1244. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1245. section.SetExported(IsExported(syntaxTreeSymbol));
  1246. RETURN section
  1247. END NewSection;
  1248. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1249. VAR new: LONGINT;
  1250. BEGIN
  1251. new := registerUsageCount.Next(type,class);
  1252. UseRegister(new);
  1253. RETURN new
  1254. END AcquireRegister;
  1255. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1256. VAR
  1257. fingerPrint: SyntaxTree.FingerPrint;
  1258. fingerPrintString: ARRAY 32 OF CHAR;
  1259. BEGIN
  1260. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1261. string := "[";
  1262. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1263. Strings.Append(string, fingerPrintString);
  1264. Strings.Append(string, "]");
  1265. END GetFingerprintString;
  1266. (** get the name for the code section that represens a certain symbol
  1267. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1268. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1269. VAR string: ARRAY 32 OF CHAR;
  1270. BEGIN
  1271. Global.GetSymbolSegmentedName(symbol, name);
  1272. (* if the symbol is an operator, then append the fingerprint to the name *)
  1273. IF symbol IS SyntaxTree.Operator THEN
  1274. GetFingerprintString(symbol, string);
  1275. Basic.AppendToSegmentedName(name,string);
  1276. END
  1277. END GetCodeSectionNameForSymbol;
  1278. (** get the name for the code section that represens a certain symbol
  1279. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1280. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1281. VAR string: ARRAY 32 OF CHAR;
  1282. BEGIN
  1283. Global.GetSymbolNameInScope(symbol, scope, name);
  1284. (* if the symbol is an operator, then append the fingerprint to the name *)
  1285. IF symbol IS SyntaxTree.Operator THEN
  1286. GetFingerprintString(symbol, string);
  1287. Strings.Append(name, string);
  1288. END
  1289. END GetCodeSectionNameForSymbolInScope;
  1290. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1291. BEGIN
  1292. IF dump # NIL THEN
  1293. dump.String("enter "); dump.String(s); dump.Ln;
  1294. END;
  1295. END TraceEnter;
  1296. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1297. BEGIN
  1298. IF dump # NIL THEN
  1299. dump.String("exit "); dump.String(s); dump.Ln;
  1300. END;
  1301. END TraceExit;
  1302. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1303. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1304. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1305. VAR i: LONGINT;
  1306. BEGIN
  1307. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1308. IF op.rule # NIL THEN
  1309. FOR i := 0 TO LEN(op.rule)-1 DO
  1310. CheckRegister(op.rule[i])
  1311. END;
  1312. END;
  1313. END CheckRegister;
  1314. BEGIN
  1315. CheckRegister(instruction.op1);
  1316. CheckRegister(instruction.op2);
  1317. CheckRegister(instruction.op3);
  1318. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1319. ELSE section.Emit(instruction);
  1320. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1321. END;
  1322. END Emit;
  1323. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1324. BEGIN
  1325. IF backend.cooperative THEN
  1326. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1327. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1328. ELSE
  1329. Emit(Trap(position,trapNo));
  1330. END;
  1331. END EmitTrap;
  1332. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1333. VAR name: Basic.SegmentedName;
  1334. VAR op1, op2, reg: IntermediateCode.Operand;
  1335. VAR call, nocall: Label;
  1336. VAR parametersSize: LONGINT;
  1337. VAR prevSection: IntermediateCode.Section;
  1338. VAR prevDump: Streams.Writer;
  1339. VAR body: SyntaxTree.Body;
  1340. VAR procedureType: SyntaxTree.ProcedureType;
  1341. BEGIN
  1342. IF procedure # NIL THEN
  1343. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1344. ELSE procedureType := NIL;
  1345. END;
  1346. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1347. prevSection := SELF.section;
  1348. SELF.section := section;
  1349. prevDump := dump;
  1350. dump := section.comments;
  1351. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1352. IF backend.hasLinkRegister THEN
  1353. Emit(Push(Basic.invalidPosition, lr));
  1354. END;
  1355. Emit(Push(Basic.invalidPosition,fp));
  1356. IF procedure # NIL THEN
  1357. body := procedure.procedureScope.body;
  1358. ELSE
  1359. body := NIL;
  1360. END;
  1361. IF backend.cooperative THEN
  1362. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1363. GetCodeSectionNameForSymbol(procedure, name);
  1364. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1365. ELSE
  1366. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1367. END;
  1368. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1369. IntermediateCode.AddOffset(op1, 1);
  1370. Emit(Push(Basic.invalidPosition,op1));
  1371. Emit(Mov(Basic.invalidPosition,fp, sp));
  1372. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1373. NEW(call, section);
  1374. NEW(nocall, section);
  1375. reg := NewRegisterOperand(addressType);
  1376. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1377. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1378. BrltL(call, sp, reg);
  1379. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1380. BrgeL(nocall, sp, op2);
  1381. call.Resolve(section.pc);
  1382. Emit(Push(Basic.invalidPosition, reg));
  1383. ReleaseIntermediateOperand(reg);
  1384. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1385. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1386. Emit(Push(Basic.invalidPosition, op2));
  1387. CallThis(position, "Activities","ExpandStack",2);
  1388. Emit(Result(Basic.invalidPosition, sp));
  1389. nocall.Resolve(section.pc);
  1390. END;
  1391. ELSE
  1392. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1393. Emit(Push(Basic.invalidPosition, one)) ;
  1394. procedureType.SetParametersOffset(1);
  1395. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1396. END;
  1397. Emit(Mov(Basic.invalidPosition, fp, sp));
  1398. END;
  1399. END;
  1400. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1401. SELF.section := prevSection;
  1402. dump := prevDump;
  1403. END EmitEnter;
  1404. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1405. VAR op1,op2: IntermediateCode.Operand;
  1406. VAR instruction: IntermediateCode.Instruction;
  1407. BEGIN
  1408. IntermediateCode.InitNumber(op1,callconv);
  1409. IntermediateCode.InitNumber(op2,varSize);
  1410. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1411. RETURN instruction
  1412. END Enter;
  1413. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1414. VAR op1: IntermediateCode.Operand;
  1415. VAR instruction: IntermediateCode.Instruction;
  1416. BEGIN
  1417. IntermediateCode.InitNumber(op1,callconv);
  1418. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1419. RETURN instruction
  1420. END Leave;
  1421. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1422. VAR prevSection: IntermediateCode.Section;
  1423. VAR op2, size: IntermediateCode.Operand;
  1424. VAR body: SyntaxTree.Body;
  1425. BEGIN
  1426. prevSection := SELF.section;
  1427. SELF.section := section;
  1428. Emit(Leave(position, callconv));
  1429. IF procedure # NIL THEN
  1430. body := procedure.procedureScope.body;
  1431. ELSE
  1432. body := NIL;
  1433. END;
  1434. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1435. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1436. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1437. Emit(Add(position, sp, fp, op2));
  1438. ELSE
  1439. Emit(Mov(position, sp, fp));
  1440. END;
  1441. Emit(Pop(position, fp));
  1442. END;
  1443. SELF.section := prevSection;
  1444. END EmitLeave;
  1445. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1446. VAR m: SymbolMap;
  1447. BEGIN
  1448. position := x.position;
  1449. IF currentIsInline THEN
  1450. m := currentMapper.Get(x);
  1451. IF m # NIL THEN
  1452. (*
  1453. Printout.Info("mapping from", x);
  1454. Printout.Info("mapping to ", m.to);
  1455. *)
  1456. m.to.Accept(SELF);
  1457. op := result;
  1458. IF m.tag # NIL THEN
  1459. ReleaseIntermediateOperand(result.tag);
  1460. m.tag.Accept(SELF);
  1461. op.tag := result.op;
  1462. ReleaseIntermediateOperand(result.tag);
  1463. END;
  1464. RETURN
  1465. END;
  1466. END;
  1467. x.Accept(SELF);
  1468. op := result;
  1469. END Symbol;
  1470. PROCEDURE Expression(x: SyntaxTree.Expression);
  1471. BEGIN
  1472. position := x.position;
  1473. constantDeclaration := NIL;
  1474. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1475. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1476. END;
  1477. IF x.resolved # NIL THEN
  1478. x.resolved.Accept(SELF)
  1479. ELSE
  1480. x.Accept(SELF)
  1481. END;
  1482. (* check this, was commented out in ActiveCells3 *)
  1483. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1484. Error(x.position, "unsupported modifier");
  1485. END;
  1486. END Expression;
  1487. (*
  1488. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1489. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1490. BEGIN
  1491. temporaries.GetUsage(current);
  1492. FOR i := 0 TO LEN(current)-1 DO
  1493. set := current[i] - previous[i];
  1494. IF set # {} THEN
  1495. FOR j := 0 TO MAX(SET)-1 DO
  1496. IF j IN set THEN
  1497. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1498. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1499. Symbol(variable, op);
  1500. MakeMemory(tmp,op.op,addressType,0);
  1501. ReleaseOperand(op);
  1502. Emit(Mov(position,tmp, nil ) );
  1503. ReleaseIntermediateOperand(tmp);
  1504. END;
  1505. END;
  1506. END;
  1507. END;
  1508. END;
  1509. END ResetUsedTemporaries;
  1510. *)
  1511. PROCEDURE Statement(x: SyntaxTree.Statement);
  1512. VAR use: VariableUse;
  1513. BEGIN
  1514. temporaries.GetUsage(use);
  1515. position := x.position;
  1516. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1517. IF commentPrintout # NIL THEN
  1518. commentPrintout.Statement(x);
  1519. dump.Ln;
  1520. (*dump.Update;*)
  1521. END;
  1522. x.Accept(SELF);
  1523. (*
  1524. CheckRegistersFree();
  1525. *)
  1526. (*ResetUsedTemporaries(use);*)
  1527. temporaries.SetUsage(use);
  1528. END Statement;
  1529. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1530. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1531. *)
  1532. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1533. BEGIN
  1534. ASSERT(op.mode # IntermediateCode.Undefined);
  1535. IF op.mode = IntermediateCode.ModeMemory THEN
  1536. ReuseCopy(res,op);
  1537. ELSE
  1538. res := op;
  1539. UseIntermediateOperand(res);
  1540. END;
  1541. IntermediateCode.AddOffset(res,offset);
  1542. IntermediateCode.MakeMemory(res,type);
  1543. END MakeMemory;
  1544. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1545. VAR mem: IntermediateCode.Operand;
  1546. BEGIN
  1547. MakeMemory(mem,res,type,offset);
  1548. ReleaseIntermediateOperand(res);
  1549. res := mem;
  1550. END ToMemory;
  1551. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1552. VAR mem: IntermediateCode.Operand;
  1553. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1554. componentType: SyntaxTree.Type;
  1555. BEGIN
  1556. type := type.resolved;
  1557. IF operand.mode = ModeReference THEN
  1558. IF type IS SyntaxTree.RangeType THEN
  1559. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1560. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1561. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1562. ReleaseOperand(operand);
  1563. operand.op := firstOp;
  1564. operand.tag := lastOp;
  1565. operand.extra := stepOp;
  1566. ELSIF type IS SyntaxTree.ComplexType THEN
  1567. componentType := type(SyntaxTree.ComplexType).componentType;
  1568. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1569. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1570. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1571. ReleaseOperand(operand);
  1572. operand.op := firstOp;
  1573. operand.tag := lastOp
  1574. ELSE
  1575. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1576. ReleaseIntermediateOperand(operand.op);
  1577. operand.op := mem;
  1578. END;
  1579. operand.mode := ModeValue;
  1580. END;
  1581. ASSERT(operand.mode = ModeValue);
  1582. END LoadValue;
  1583. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1584. VAR prevConditional: BOOLEAN;
  1585. BEGIN
  1586. prevConditional := conditional;
  1587. conditional := FALSE;
  1588. InitOperand(result, ModeUndefined);
  1589. Expression(x);
  1590. op := result;
  1591. LoadValue(op,x.type.resolved);
  1592. conditional := prevConditional;
  1593. END Evaluate;
  1594. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1595. VAR prevConditional: BOOLEAN;
  1596. BEGIN
  1597. prevConditional := conditional;
  1598. conditional := FALSE;
  1599. InitOperand(result,ModeUndefined);
  1600. Expression(x);
  1601. op := result;
  1602. (*
  1603. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1604. *)
  1605. conditional := prevConditional;
  1606. END Designate;
  1607. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1608. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1609. BEGIN
  1610. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1611. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1612. conditional := TRUE;
  1613. trueLabel := trueL; falseLabel := falseL;
  1614. Expression(x);
  1615. trueL := trueLabel; falseL := falseLabel;
  1616. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1617. END Condition;
  1618. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1619. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1620. BEGIN
  1621. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1622. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1623. RETURN op
  1624. END NewRegisterOperand;
  1625. PROCEDURE UnuseRegister(register: LONGINT);
  1626. BEGIN
  1627. IF (register > 0) THEN
  1628. register := registerUsageCount.Map(register);
  1629. registerUsageCount.DecUse(register);
  1630. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1631. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1632. END;
  1633. IF registerUsageCount.Use(register)=0 THEN
  1634. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1635. Warning(position, "register cannot be removed");
  1636. END;
  1637. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1638. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1639. END;
  1640. ELSIF registerUsageCount.Use(register)<0 THEN
  1641. Warning(position, "register removed too often");
  1642. IF dump # NIL THEN
  1643. dump.String("register removed too often"); dump.Ln; dump.Update;
  1644. END;
  1645. END;
  1646. END;
  1647. END UnuseRegister;
  1648. PROCEDURE UseRegister(register: LONGINT);
  1649. BEGIN
  1650. IF (register > 0) THEN
  1651. register := registerUsageCount.Map(register);
  1652. registerUsageCount.IncUse(register);
  1653. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1654. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1655. END;
  1656. IF registerUsageCount.Use(register)=1 THEN
  1657. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1658. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1659. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1660. END;
  1661. END;
  1662. END;
  1663. END UseRegister;
  1664. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1665. BEGIN
  1666. UnuseRegister(op.register)
  1667. END ReleaseIntermediateOperand;
  1668. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1669. BEGIN
  1670. UseRegister(op.register)
  1671. END UseIntermediateOperand;
  1672. PROCEDURE ReleaseOperand(CONST op: Operand);
  1673. BEGIN
  1674. UnuseRegister(op.op.register);
  1675. UnuseRegister(op.tag.register);
  1676. UnuseRegister(op.extra.register);
  1677. END ReleaseOperand;
  1678. (* save registers marked in array "markedRegisters" to the stack
  1679. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1680. *)
  1681. PROCEDURE SaveRegisters();
  1682. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1683. BEGIN
  1684. entry := usedRegisters;
  1685. WHILE entry # NIL DO
  1686. type := registerUsageCount.used[entry.register].type;
  1687. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1688. Emit(Push(position,op));
  1689. entry := entry.next;
  1690. END;
  1691. END SaveRegisters;
  1692. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1693. BEGIN
  1694. saved := usedRegisters;
  1695. usedRegisters := NIL;
  1696. END ReleaseUsedRegisters;
  1697. (** remove parameter registers from used queue *)
  1698. PROCEDURE ReleaseParameterRegisters;
  1699. VAR entry,prev,next: RegisterEntry;
  1700. BEGIN
  1701. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1702. WHILE entry # NIL DO
  1703. next := entry.next;
  1704. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1705. registerUsageCount.DecUse(entry.register);
  1706. ASSERT(registerUsageCount.Use(entry.register)=0);
  1707. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1708. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1709. END;
  1710. ELSIF prev = NIL THEN
  1711. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1712. ELSE
  1713. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1714. END;
  1715. entry := next;
  1716. END;
  1717. END ReleaseParameterRegisters;
  1718. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1719. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1720. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1721. BEGIN
  1722. entry := saved;
  1723. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1724. entry := prev;
  1725. WHILE entry # NIL DO
  1726. prev := entry.prev;
  1727. type := entry.type;
  1728. class := entry.registerClass;
  1729. IntermediateCode.InitRegister(op,type,class,entry.register);
  1730. (*
  1731. new := registerUsageCount.Next(type,class);
  1732. registerUsageCount.Remap(entry.register,new);
  1733. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1734. dump.String("remap register "); dump.Int(entry.register,1);
  1735. dump.String("to "); dump.Int(new,1);
  1736. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1737. END;
  1738. entry.register := new;
  1739. *)
  1740. Emit(Pop(position,op));
  1741. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1742. entry := prev;
  1743. END;
  1744. (*
  1745. usedRegisters := saved;
  1746. *)
  1747. END RestoreRegisters;
  1748. PROCEDURE CheckRegistersFree;
  1749. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1750. BEGIN
  1751. IF usedRegisters # NIL THEN
  1752. r := usedRegisters;
  1753. WHILE r # NIL DO
  1754. warning := "register ";
  1755. Strings.AppendInt(warning, r.register);
  1756. Strings.Append(warning, " not released.");
  1757. Warning(position,warning);
  1758. r := r .next;
  1759. END;
  1760. END;
  1761. FOR i := 0 TO registerUsageCount.count-1 DO
  1762. IF registerUsageCount.used[i].count < 0 THEN
  1763. warning := "register ";
  1764. Strings.AppendInt(warning, i);
  1765. Strings.Append(warning, " unused too often.");
  1766. Warning(position,warning);
  1767. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1768. warning := "register ";
  1769. Strings.AppendInt(warning, i);
  1770. Strings.Append(warning, " not unused often enough.");
  1771. Warning(position,warning);
  1772. END;
  1773. END;
  1774. END CheckRegistersFree;
  1775. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1776. Otherwise allocate a new register.
  1777. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1778. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1779. BEGIN
  1780. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1781. UseIntermediateOperand(result);
  1782. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1783. UseIntermediateOperand(result);
  1784. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1785. END;
  1786. END Reuse2;
  1787. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1788. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1789. If not then allocate a new register.
  1790. Does NOT necessarily keep the content of src1 or src2 in result!
  1791. *)
  1792. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1793. BEGIN
  1794. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1795. UseIntermediateOperand(result);
  1796. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1797. UseIntermediateOperand(result);
  1798. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1799. result := alternative; alternative := emptyOperand;
  1800. UseIntermediateOperand(result);
  1801. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1802. END;
  1803. END Reuse2a;
  1804. (* like reuse2 but only one source *)
  1805. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1806. BEGIN
  1807. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1808. UseIntermediateOperand(result);
  1809. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1810. END;
  1811. END Reuse1;
  1812. (* like reuse2a but only one source *)
  1813. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1814. BEGIN
  1815. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1816. UseIntermediateOperand(result);
  1817. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1818. UseIntermediateOperand(result);
  1819. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1820. END;
  1821. END Reuse1a;
  1822. (* like reuse1 but guarantees that content of src1 is in result *)
  1823. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1824. BEGIN
  1825. IF ReusableRegister(src1) THEN
  1826. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1827. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1828. UseIntermediateOperand(result);
  1829. ELSE
  1830. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1831. Emit(Mov(position,result,src1));
  1832. END
  1833. END ReuseCopy;
  1834. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1835. BEGIN
  1836. IF ReusableRegister(src) THEN
  1837. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1838. ELSE
  1839. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1840. Emit(Mov(position,result,src));
  1841. ReleaseIntermediateOperand(src);
  1842. END
  1843. END TransferToRegister;
  1844. (** labels and branches **)
  1845. PROCEDURE NewLabel(): Label;
  1846. VAR label: Label;
  1847. BEGIN
  1848. NEW(label,section); RETURN label;
  1849. END NewLabel;
  1850. PROCEDURE SetLabel(label: Label);
  1851. BEGIN label.Resolve(section.pc);
  1852. END SetLabel;
  1853. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1854. BEGIN
  1855. ASSERT(label # NIL);
  1856. IF label.pc < 0 THEN (* label not yet set *)
  1857. label.AddFixup(section.pc);
  1858. END;
  1859. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1860. END LabelOperand;
  1861. PROCEDURE BrL(label: Label);
  1862. BEGIN
  1863. Emit(Br(position,LabelOperand(label)));
  1864. END BrL;
  1865. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1866. BEGIN
  1867. Emit(Brge(position,LabelOperand(label),left,right));
  1868. END BrgeL;
  1869. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1870. BEGIN
  1871. Emit(Brlt(position,LabelOperand(label),left,right));
  1872. END BrltL;
  1873. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1874. BEGIN
  1875. Emit(Breq(position,LabelOperand(label),left,right));
  1876. END BreqL;
  1877. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1878. BEGIN
  1879. Emit(Brne(position,LabelOperand(label),left,right));
  1880. END BrneL;
  1881. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1882. VAR new: IntermediateCode.Operand;
  1883. BEGIN
  1884. IF Trace THEN TraceEnter("Convert") END;
  1885. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1886. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1887. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1888. & (operand.offset = 0)
  1889. THEN
  1890. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1891. Emit(Conv(position,new,operand));
  1892. ELSE
  1893. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1894. Emit(Conv(position,new,operand));
  1895. ReleaseIntermediateOperand(operand);
  1896. END;
  1897. operand := new;
  1898. 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
  1899. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1900. ELSE
  1901. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1902. Emit(Conv(position,new,operand));
  1903. ReleaseIntermediateOperand(operand);
  1904. operand := new;
  1905. END;
  1906. IF Trace THEN TraceExit("Convert") END;
  1907. END Convert;
  1908. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1909. VAR exit: Label;
  1910. BEGIN
  1911. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1912. exit := NewLabel();
  1913. br(exit,left,right);
  1914. EmitTrap(position,trapNo);
  1915. SetLabel(exit);
  1916. END TrapC;
  1917. (** expressions *)
  1918. (** emit necessary runtime check for set elements **)
  1919. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1920. VAR max: IntermediateCode.Operand;
  1921. BEGIN
  1922. IF isUnchecked THEN RETURN END;
  1923. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1924. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1925. TrapC(BrgeL, max, o, SetElementTrap);
  1926. END;
  1927. END CheckSetElement;
  1928. (** the set that a range represents **)
  1929. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1930. VAR
  1931. operand: Operand;
  1932. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1933. BEGIN
  1934. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1935. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1936. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1937. one := IntermediateCode.Immediate(setType, 1);
  1938. Evaluate(x, operand);
  1939. Convert(operand.op, setType);
  1940. Convert(operand.tag, setType);
  1941. CheckSetElement(operand.op);
  1942. CheckSetElement(operand.tag);
  1943. (* create mask for lower bound
  1944. i.e. shift 11111111 to the left by the value of the lower bound
  1945. *)
  1946. Reuse1(temp, operand.op);
  1947. Emit(Shl(position,temp, allBits, operand.op));
  1948. ReleaseIntermediateOperand(operand.op);
  1949. operand.op := temp;
  1950. (* create mask for upper bound
  1951. i.e. shift 11111111 to the right by the difference between the
  1952. upper bound and the maximum number of set elements
  1953. *)
  1954. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1955. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1956. Reuse1(temp, operand.tag);
  1957. ELSE
  1958. Reuse1(temp, operand.tag);
  1959. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1960. Emit(Sub(position,temp, size, operand.tag));
  1961. END;
  1962. Emit(Shr(position,temp, allBits, operand.tag));
  1963. ReleaseIntermediateOperand(operand.tag);
  1964. operand.tag := temp;
  1965. Reuse2(resultingSet, operand.op, operand.tag);
  1966. (* intersect the two masks *)
  1967. Emit(And(position,resultingSet, operand.op, operand.tag));
  1968. ReleaseOperand(operand);
  1969. RETURN resultingSet
  1970. END SetFromRange;
  1971. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1972. VAR
  1973. res, operand: Operand;
  1974. temp, one, noBits, dest: IntermediateCode.Operand;
  1975. expression: SyntaxTree.Expression;
  1976. i: LONGINT;
  1977. BEGIN
  1978. IF Trace THEN TraceEnter("VisitSet") END;
  1979. dest := destination;
  1980. destination := emptyOperand;
  1981. noBits := IntermediateCode.Immediate(setType, 0);
  1982. one := IntermediateCode.Immediate(setType, 1);
  1983. (* start off with the empty set *)
  1984. InitOperand(res, ModeValue);
  1985. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1986. Emit(Mov(position,res.op, noBits));
  1987. FOR i := 0 TO x.elements.Length() - 1 DO
  1988. expression := x.elements.GetExpression(i);
  1989. IF expression IS SyntaxTree.RangeExpression THEN
  1990. (* range of set elements *)
  1991. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1992. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1993. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1994. ReleaseIntermediateOperand(temp)
  1995. ELSE
  1996. (* singelton element *)
  1997. Evaluate(expression, operand);
  1998. Convert(operand.op, setType);
  1999. CheckSetElement(operand.op);
  2000. (* create subset containing single element *)
  2001. Reuse1(temp, operand.op);
  2002. Emit(Shl(position,temp, one, operand.op));
  2003. ReleaseOperand(operand);
  2004. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2005. ReleaseIntermediateOperand(temp);
  2006. END
  2007. END;
  2008. result := res;
  2009. destination := dest;
  2010. IF Trace THEN TraceExit("VisitSet") END;
  2011. END VisitSet;
  2012. (* math arrays of the form [a,b,c]
  2013. x is a static array and thus does not provide any pointers
  2014. *)
  2015. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  2016. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2017. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2018. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2019. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2020. element: SyntaxTree.IntegerValue;
  2021. BEGIN
  2022. numberElements := x.elements.Length();
  2023. expression := index.parameters.GetExpression(dim);
  2024. element := expression(SyntaxTree.IntegerValue);
  2025. FOR i := 0 TO numberElements-1 DO
  2026. expression := x.elements.GetExpression(i);
  2027. element.SetValue(i);
  2028. IF expression IS SyntaxTree.MathArrayExpression THEN
  2029. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2030. ELSE
  2031. Assign(index,expression);
  2032. END;
  2033. END;
  2034. END RecursiveAssignment;
  2035. BEGIN
  2036. (*static math array not providing pointers anyway *)
  2037. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2038. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2039. designator.SetType(variable.type);
  2040. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  2041. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2042. FOR i := 0 TO dim-1 DO
  2043. element := SyntaxTree.NewIntegerValue(x.position,0);
  2044. element.SetType(system.longintType);
  2045. index.parameters.AddExpression(element);
  2046. END;
  2047. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2048. RecursiveAssignment(x,0);
  2049. Expression(designator);
  2050. END VisitMathArrayExpression;
  2051. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  2052. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2053. BEGIN
  2054. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2055. dest := destination; destination := emptyOperand;
  2056. IF x.operator = Scanner.Not THEN
  2057. IF conditional THEN
  2058. Condition(x.left,falseLabel,trueLabel)
  2059. ELSE
  2060. Evaluate(x.left,operand);
  2061. InitOperand(result,ModeValue);
  2062. Reuse1a(result.op,operand.op,dest);
  2063. Emit(Xor(position,result.op,operand.op,true));
  2064. ReleaseOperand(operand);
  2065. END;
  2066. ELSIF x.operator = Scanner.Minus THEN
  2067. Evaluate(x.left,operand);
  2068. InitOperand(result,ModeValue);
  2069. Reuse1a(result.op,operand.op,dest);
  2070. type := x.left.type.resolved;
  2071. IF type IS SyntaxTree.SetType THEN
  2072. Emit(Not(position,result.op,operand.op));
  2073. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2074. Reuse1(result.tag,operand.tag);
  2075. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2076. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2077. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2078. Emit(Neg(position,result.op,operand.op));
  2079. ELSE HALT(200)
  2080. END;
  2081. ReleaseOperand(operand);
  2082. ELSIF x.operator = Scanner.Address THEN
  2083. Designate(x.left,operand);
  2084. operand.mode := ModeValue;
  2085. t0 := x.left.type.resolved;
  2086. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2087. ReleaseIntermediateOperand(operand.op);
  2088. operand.op := operand.tag;
  2089. IntermediateCode.InitOperand(operand.tag);
  2090. END;
  2091. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2092. result := operand;
  2093. ELSE HALT(100)
  2094. END;
  2095. destination := dest;
  2096. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2097. END VisitUnaryExpression;
  2098. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2099. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2100. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2101. BEGIN
  2102. type := type.resolved;
  2103. originalType := type;
  2104. IF type IS SyntaxTree.PointerType THEN
  2105. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2106. END;
  2107. IF type IS SyntaxTree.ObjectType THEN
  2108. BrL(trueL);
  2109. ELSE
  2110. ASSERT(type IS SyntaxTree.RecordType);
  2111. (*
  2112. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2113. *)
  2114. ReuseCopy(left,tag);
  2115. right := TypeDescriptorAdr(type);
  2116. IF ~newObjectFile THEN
  2117. IntermediateCode.MakeMemory(right,addressType);
  2118. END;
  2119. IF backend.cooperative THEN
  2120. repeatL := NewLabel();
  2121. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2122. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2123. END;
  2124. SetLabel(repeatL);
  2125. BreqL(trueL,left,right);
  2126. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2127. BrneL(repeatL,left,nil);
  2128. ELSIF meta.simple THEN
  2129. level := type(SyntaxTree.RecordType).Level();
  2130. (* get type desc tag of level relative to base tag *)
  2131. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2132. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2133. IntermediateCode.MakeMemory(left,addressType);
  2134. BreqL(trueL,left,right);
  2135. ELSE
  2136. level := type(SyntaxTree.RecordType).Level();
  2137. (* get type desc tag of level relative to base tag *)
  2138. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2139. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2140. IntermediateCode.MakeMemory(left,addressType);
  2141. BreqL(trueL,left,right);
  2142. END;
  2143. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2144. BrL(falseL);
  2145. END;
  2146. END TypeTest;
  2147. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2148. BEGIN
  2149. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2150. IF dump # NIL THEN
  2151. dump.String(s); dump.Ln;
  2152. END;
  2153. END Error;
  2154. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2155. BEGIN
  2156. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2157. IF dump # NIL THEN
  2158. dump.String(s); dump.Ln; dump.Update;
  2159. END;
  2160. END Warning;
  2161. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2162. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2163. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2164. operand:Operand;
  2165. BEGIN
  2166. previousSection := section;
  2167. Global.GetModuleName(mod,name);
  2168. Strings.Append(name,".@Trace");
  2169. Basic.ToSegmentedName(name, pooledName);
  2170. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2171. IF dump # NIL THEN dump := section.comments END;
  2172. IF backend.hasLinkRegister THEN
  2173. Emit(Push(Basic.invalidPosition, lr));
  2174. END;
  2175. variable := mod.moduleScope.firstVariable;
  2176. WHILE variable # NIL DO
  2177. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2178. Symbol(variable, operand);
  2179. register := operand.op;
  2180. CallTraceMethod(register, variable.type);
  2181. ReleaseIntermediateOperand(register);
  2182. END;
  2183. variable := variable.nextVariable;
  2184. END;
  2185. IF backend.hasLinkRegister THEN
  2186. Emit(Pop(Basic.invalidPosition, lr));
  2187. END;
  2188. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2189. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2190. Emit(Br(position,op));
  2191. INC(statCoopTraceModule, section.pc);
  2192. section := previousSection;
  2193. IF dump # NIL THEN dump := section.comments END;
  2194. END CreateTraceModuleMethod;
  2195. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2196. BEGIN
  2197. Emit (Push(position, dst));
  2198. Emit (Push(position, src));
  2199. CallThis(position,"GarbageCollector","Assign", 2);
  2200. END CallAssignPointer;
  2201. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2202. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2203. BEGIN
  2204. IF SemanticChecker.IsPointerType (type) THEN
  2205. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2206. ELSIF type.IsRecordType() THEN
  2207. Emit (Push(position,dst));
  2208. Emit (Push(position,src));
  2209. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2210. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2211. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2212. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2213. ELSIF IsStaticArray(type) THEN
  2214. size := StaticArrayNumElements(type);
  2215. base := StaticArrayBaseType(type);
  2216. IF base.IsRecordType() THEN
  2217. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2218. Emit (Push(position, dst));
  2219. Emit (Push(position, src));
  2220. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2221. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2222. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2223. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2224. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2225. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2226. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2227. Emit (Push(position, dst));
  2228. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2229. Emit (Push(position, src));
  2230. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2231. ELSE
  2232. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2233. Emit (Push(position, dst));
  2234. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2235. Emit (Push(position, src));
  2236. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2237. ASSERT(StaticArrayBaseType(type).IsPointer());
  2238. END;
  2239. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2240. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2241. Emit (Push(position, dst));
  2242. Emit (Push(position, src));
  2243. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2244. ELSE HALT(100); (* missing ? *)
  2245. END;
  2246. END CallAssignMethod;
  2247. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2248. VAR name: Basic.SegmentedName;
  2249. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2250. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2251. context: Context;
  2252. BEGIN
  2253. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2254. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2255. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2256. GetRecordTypeName (recordType,name);
  2257. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2258. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2259. IF dump # NIL THEN dump := section.comments END;
  2260. IF backend.hasLinkRegister THEN
  2261. Emit(Push(Basic.invalidPosition, lr));
  2262. END;
  2263. variable := recordType.recordScope.firstVariable;
  2264. WHILE variable # NIL DO
  2265. IF variable.NeedsTrace() THEN
  2266. dst := NewRegisterOperand (addressType);
  2267. src := NewRegisterOperand (addressType);
  2268. Emit (Mov(position, dst, parameter1));
  2269. Emit (Mov(position, src, parameter2));
  2270. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2271. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2272. CallAssignMethod(dst, src, variable.type);
  2273. ReleaseIntermediateOperand(src);
  2274. ReleaseIntermediateOperand(dst);
  2275. END;
  2276. variable := variable.nextVariable;
  2277. END;
  2278. recordBase := recordType.GetBaseRecord();
  2279. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2280. IF backend.hasLinkRegister THEN
  2281. Emit(Pop(Basic.invalidPosition, lr));
  2282. END;
  2283. GetRecordTypeName (recordBase,name);
  2284. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2285. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2286. Emit(Br(position,op));
  2287. ELSE
  2288. Emit(Exit(position,0,0, 0));
  2289. END;
  2290. IF ~recordType.isObject THEN
  2291. GetRecordTypeName (recordType,name);
  2292. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2293. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2294. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2295. NEW(registerUsageCount);
  2296. usedRegisters := NIL;
  2297. dst := NewRegisterOperand (addressType);
  2298. src := NewRegisterOperand (addressType);
  2299. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2300. Emit(Mov(position, dst, parameter1));
  2301. Emit(Mov(position, src, parameter2));
  2302. label := NewLabel();
  2303. SetLabel(label);
  2304. Emit(Push(position, dst));
  2305. Emit(Push(position, src));
  2306. GetRecordTypeName (recordType,name);
  2307. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2308. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2309. Emit(Call(position, op, 0));
  2310. Emit(Pop(position, src));
  2311. Emit(Pop(position, dst));
  2312. Emit(Add(position, dst, dst, ofs));
  2313. Emit(Add(position, src, src, ofs));
  2314. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2315. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2316. Emit(Exit(position,0,0, 0));
  2317. END;
  2318. INC(statCoopAssignProcedure, section.pc);
  2319. ReturnToContext(context);
  2320. IF dump # NIL THEN dump := section.comments END;
  2321. END CreateAssignProcedure;
  2322. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2323. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2324. BEGIN
  2325. IF IsUnsafePointer (type) THEN
  2326. skip := NewLabel();
  2327. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2328. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2329. BreqL (skip, op, nil);
  2330. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2331. SetLabel (skip);
  2332. ELSIF SemanticChecker.IsPointerType (type) THEN
  2333. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2334. CallThis(position,"GarbageCollector","Mark", 1);
  2335. ELSIF type.IsRecordType() THEN
  2336. Emit (Push(position,register));
  2337. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2338. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2339. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2340. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2341. ELSIF IsStaticArray(type) THEN
  2342. size := StaticArrayNumElements(type);
  2343. base := StaticArrayBaseType(type);
  2344. IF base.IsRecordType() THEN
  2345. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2346. Emit (Push(position, register));
  2347. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2348. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2349. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2350. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2351. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2352. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2353. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2354. Emit (Push(position, register));
  2355. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2356. ELSE
  2357. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2358. Emit (Push(position, register));
  2359. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2360. ASSERT(base.IsPointer());
  2361. END;
  2362. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2363. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2364. CallThis(position,"GarbageCollector","Mark", 1);
  2365. ELSE HALT(100); (* missing ? *)
  2366. END;
  2367. END CallTraceMethod;
  2368. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2369. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2370. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2371. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2372. BEGIN
  2373. previousSection := section;
  2374. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2375. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2376. GetRecordTypeName (recordType,name);
  2377. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2378. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2379. IF dump # NIL THEN dump := section.comments END;
  2380. IF backend.hasLinkRegister THEN
  2381. Emit(Push(Basic.invalidPosition, lr));
  2382. END;
  2383. variable := recordType.recordScope.firstVariable;
  2384. WHILE variable # NIL DO
  2385. IF variable.NeedsTrace() THEN
  2386. register := NewRegisterOperand (addressType);
  2387. Emit (Mov(position,register,parameter1));
  2388. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2389. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2390. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2391. END;
  2392. CallTraceMethod(register, variable.type);
  2393. ReleaseIntermediateOperand(register);
  2394. END;
  2395. variable := variable.nextVariable;
  2396. END;
  2397. recordBase := recordType.GetBaseRecord();
  2398. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2399. recordBase := recordBase.GetBaseRecord();
  2400. END;
  2401. IF recordBase # NIL THEN
  2402. IF backend.hasLinkRegister THEN
  2403. Emit(Pop(Basic.invalidPosition, lr));
  2404. END;
  2405. GetRecordTypeName (recordBase,name);
  2406. IF HasExplicitTraceMethod (recordBase) THEN
  2407. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2408. ELSE
  2409. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2410. END;
  2411. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2412. Emit(Br(position,op));
  2413. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2414. Emit(Exit(position,0,0,0));
  2415. ELSE
  2416. IF backend.hasLinkRegister THEN
  2417. Emit(Pop(Basic.invalidPosition, lr));
  2418. END;
  2419. IF recordType.isObject THEN
  2420. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2421. ELSE
  2422. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2423. END;
  2424. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2425. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2426. Emit(Br(position,op));
  2427. END;
  2428. IF ~recordType.isObject THEN
  2429. GetRecordTypeName (recordType,name);
  2430. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2431. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2432. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2433. NEW(registerUsageCount);
  2434. usedRegisters := NIL;
  2435. IF dump # NIL THEN dump := section.comments END;
  2436. register := NewRegisterOperand (addressType);
  2437. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2438. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2439. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2440. END;
  2441. Emit (Push(position,register));
  2442. GetRecordTypeName (recordType,name);
  2443. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2444. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2445. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2446. ReleaseIntermediateOperand(register);
  2447. Emit(Exit(position,0,0,0));
  2448. GetRecordTypeName (recordType,name);
  2449. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2450. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2451. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2452. NEW(registerUsageCount);
  2453. usedRegisters := NIL;
  2454. register := NewRegisterOperand (addressType);
  2455. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2456. Emit(Mov(position, register, parameter1));
  2457. label := NewLabel();
  2458. SetLabel(label);
  2459. Emit(Push(position, register));
  2460. GetRecordTypeName (recordType,name);
  2461. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2462. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2463. Emit(Call(position, op, 0));
  2464. Emit(Pop(position, register));
  2465. Emit(Add(position, register, register, ofs));
  2466. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2467. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2468. Emit(Exit(position,0,0,0));
  2469. END;
  2470. INC(statCoopTraceMethod, section.pc);
  2471. ReturnToContext(context);
  2472. IF dump # NIL THEN dump := section.comments END;
  2473. END CreateTraceMethod;
  2474. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2475. VAR name: Basic.SegmentedName;
  2476. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2477. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2478. context: Context;
  2479. BEGIN
  2480. IF recordType.isObject THEN RETURN END;
  2481. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2482. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2483. GetRecordTypeName (recordType,name);
  2484. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2485. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2486. IF dump # NIL THEN dump := section.comments END;
  2487. IF backend.hasLinkRegister THEN
  2488. Emit(Push(Basic.invalidPosition, lr));
  2489. END;
  2490. variable := recordType.recordScope.firstVariable;
  2491. WHILE variable # NIL DO
  2492. IF variable.NeedsTrace() THEN
  2493. dst := NewRegisterOperand (addressType);
  2494. Emit (Mov(position, dst, parameter1));
  2495. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2496. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2497. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2498. END;
  2499. CallResetProcedure(dst, nil, variable.type);
  2500. ReleaseIntermediateOperand(dst);
  2501. END;
  2502. variable := variable.nextVariable;
  2503. END;
  2504. recordBase := recordType.GetBaseRecord();
  2505. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2506. IF backend.hasLinkRegister THEN
  2507. Emit(Pop(Basic.invalidPosition, lr));
  2508. END;
  2509. GetRecordTypeName (recordBase,name);
  2510. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2511. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2512. Emit(Br(position,op));
  2513. ELSE
  2514. Emit(Exit(position,0,0, 0));
  2515. END;
  2516. GetRecordTypeName (recordType,name);
  2517. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2518. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2519. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2520. NEW(registerUsageCount);
  2521. usedRegisters := NIL;
  2522. dst := NewRegisterOperand (addressType);
  2523. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2524. Emit(Mov(position, dst, parameter1));
  2525. label := NewLabel();
  2526. SetLabel(label);
  2527. Emit(Push(position, dst));
  2528. GetRecordTypeName (recordType,name);
  2529. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2530. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2531. Emit(Call(position, op, 0));
  2532. Emit(Pop(position, dst));
  2533. Emit(Add(position, dst, dst, ofs));
  2534. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2535. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2536. Emit(Exit(position,0,0, 0));
  2537. INC(statCoopResetProcedure, section.pc);
  2538. ReturnToContext(context);
  2539. IF dump # NIL THEN dump := section.comments END;
  2540. END CreateResetProcedure;
  2541. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2542. VAR name: Basic.SegmentedName; context: Context;
  2543. BEGIN
  2544. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2545. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2546. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2547. IF dump # NIL THEN dump := section.comments END;
  2548. IF backend.hasLinkRegister THEN
  2549. Emit(Push(Basic.invalidPosition, lr));
  2550. END;
  2551. Emit(Push(position,fp));
  2552. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2553. ResetVariables(scope);
  2554. Emit(Pop(position,fp));
  2555. Emit(Exit(position,0,0, 0));
  2556. ReturnToContext(context);
  2557. IF dump # NIL THEN dump := section.comments END;
  2558. END CreateResetMethod;
  2559. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2560. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2561. BEGIN
  2562. IF SemanticChecker.IsPointerType (type) THEN
  2563. Emit (Push(position, dest));
  2564. CallThis(position,"GarbageCollector","Reset", 1);
  2565. ELSIF type.IsRecordType() THEN
  2566. Emit (Push(position, dest));
  2567. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2568. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2569. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2570. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2571. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2572. size := GetArrayLength(type, tag);
  2573. base := ArrayBaseType(type);
  2574. IF base.IsRecordType() THEN
  2575. Emit (Push(position, size));
  2576. Emit (Push(position, dest));
  2577. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2578. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2579. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2580. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2581. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2582. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2583. Emit (Push(position, size));
  2584. Emit (Push(position, dest));
  2585. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2586. ELSE
  2587. Emit (Push(position, size));
  2588. Emit (Push(position, dest));
  2589. CallThis(position,"GarbageCollector","ResetArray", 2);
  2590. ASSERT(ArrayBaseType(type).IsPointer());
  2591. END;
  2592. ReleaseIntermediateOperand(size);
  2593. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2594. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2595. Emit (Push(position, dest));
  2596. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2597. ELSE HALT(100); (* missing ? *)
  2598. END;
  2599. END CallResetProcedure;
  2600. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2601. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2602. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2603. VAR operand: Operand;
  2604. BEGIN
  2605. Symbol (symbol, operand);
  2606. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2607. ReleaseOperand(operand);
  2608. END Reset;
  2609. BEGIN
  2610. previousScope := currentScope;
  2611. currentScope := scope;
  2612. pc := section.pc;
  2613. variable := scope.firstVariable;
  2614. WHILE variable # NIL DO
  2615. IF variable.NeedsTrace() THEN
  2616. Reset (variable);
  2617. END;
  2618. variable := variable.nextVariable;
  2619. END;
  2620. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2621. WHILE parameter # NIL DO
  2622. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2623. Reset (parameter);
  2624. END;
  2625. parameter := parameter.nextParameter;
  2626. END;
  2627. INC(statCoopResetVariables, section.pc - pc);
  2628. currentScope := previousScope;
  2629. END ResetVariables;
  2630. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2631. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2632. VAR op: IntermediateCode.Operand; context: Context;
  2633. BEGIN
  2634. previousSection := section;
  2635. GetCodeSectionNameForSymbol(procedure, name);
  2636. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2637. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2638. IF dump # NIL THEN dump := section.comments END;
  2639. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2640. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2641. Emit(Data(position,op));
  2642. Emit(Data(position,nil));
  2643. IF HasPointers (procedure.procedureScope) THEN
  2644. GetCodeSectionNameForSymbol(procedure, name);
  2645. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2646. ELSE
  2647. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2648. END;
  2649. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2650. Emit(Data(position,op));
  2651. ReturnToContext(context);
  2652. IF dump # NIL THEN dump := section.comments END;
  2653. END CreateProcedureDescriptor;
  2654. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2655. VAR import: SyntaxTree.Import;
  2656. s: Basic.MessageString;
  2657. selfName: SyntaxTree.IdentifierString;
  2658. BEGIN
  2659. moduleScope.ownerModule.GetName(selfName);
  2660. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2661. module := moduleScope.ownerModule
  2662. ELSE
  2663. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2664. IF import = NIL THEN
  2665. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2666. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2667. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2668. s := "Module ";
  2669. Strings.Append(s,moduleName);
  2670. Strings.Append(s," cannot be imported.");
  2671. IF force THEN
  2672. Error(position,s);
  2673. ELSIF canBeLoaded THEN
  2674. IF WarningDynamicLoading THEN
  2675. Strings.Append(s, "=> no dynamic linking.");
  2676. Warning(position, s);
  2677. END;
  2678. canBeLoaded := FALSE;
  2679. END;
  2680. RETURN FALSE
  2681. ELSE
  2682. SELF.module.imports.AddName(moduleName)
  2683. END;
  2684. ELSIF import.module = NIL THEN (* already tried *)
  2685. RETURN FALSE
  2686. END;
  2687. module := import.module;
  2688. END;
  2689. RETURN TRUE
  2690. END AddImport;
  2691. (* needed for old binary object file format*)
  2692. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2693. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2694. BEGIN
  2695. IF AddImport(moduleName,module,TRUE) THEN
  2696. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2697. IF procedure = NIL THEN
  2698. s := "Instruction not supported on target, emulation procedure ";
  2699. Strings.Append(s,moduleName);
  2700. Strings.Append(s,".");
  2701. Strings.Append(s,procedureName);
  2702. Strings.Append(s," not present");
  2703. Error(position,s);
  2704. ELSE
  2705. StaticCallOperand(r,procedure);
  2706. ReleaseOperand(r);
  2707. fp := GetFingerprint(procedure);
  2708. END;
  2709. END;
  2710. END EnsureSymbol;
  2711. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2712. VAR exit: Label; trueL,falseL: Label;
  2713. BEGIN
  2714. trueL := NewLabel();
  2715. falseL := NewLabel();
  2716. exit := NewLabel();
  2717. Condition(x,trueL,falseL);
  2718. InitOperand(result,ModeValue);
  2719. SetLabel(trueL);
  2720. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2721. Emit(Mov(position,result.op,true));
  2722. BrL(exit);
  2723. SetLabel(falseL);
  2724. Emit(MovReplace(position,result.op,false));
  2725. SetLabel(exit);
  2726. END ConditionToValue;
  2727. PROCEDURE ValueToCondition(VAR op: Operand);
  2728. BEGIN
  2729. LoadValue(op,system.booleanType);
  2730. BrneL(trueLabel,op.op, false);
  2731. ReleaseOperand(op);
  2732. BrL(falseLabel);
  2733. END ValueToCondition;
  2734. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2735. VAR size: LONGINT;
  2736. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2737. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2738. BEGIN
  2739. ASSERT(type.form = SyntaxTree.Open);
  2740. baseType := type.arrayBase.resolved;
  2741. IF IsOpenArray(baseType) THEN
  2742. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2743. ELSE
  2744. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2745. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2746. END;
  2747. len := tag;
  2748. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2749. IntermediateCode.MakeMemory(len,addressType);
  2750. UseIntermediateOperand(len);
  2751. Reuse2(res,sizeOperand,len);
  2752. Emit(Mul(position,res,sizeOperand,len));
  2753. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2754. RETURN res
  2755. END GetArraySize;
  2756. BEGIN
  2757. type := type.resolved;
  2758. IF IsOpenArray(type) THEN
  2759. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2760. RETURN tag
  2761. ELSE
  2762. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2763. END;
  2764. ELSE
  2765. size := ToMemoryUnits(system,system.SizeOf(type));
  2766. RETURN IntermediateCode.Immediate(addressType,size)
  2767. END;
  2768. END GetDynamicSize;
  2769. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2770. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2771. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2772. BEGIN
  2773. ASSERT(type.form = SyntaxTree.Open);
  2774. baseType := type.arrayBase.resolved;
  2775. IF IsOpenArray(baseType) THEN
  2776. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2777. ELSE
  2778. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2779. END;
  2780. len := tag;
  2781. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2782. IntermediateCode.MakeMemory(len,addressType);
  2783. UseIntermediateOperand(len);
  2784. Reuse2(res,sizeOperand,len);
  2785. Emit(Mul(position,res,sizeOperand,len));
  2786. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2787. RETURN res
  2788. END GetLength;
  2789. BEGIN
  2790. type := type.resolved;
  2791. IF IsOpenArray(type) THEN
  2792. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2793. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2794. ELSIF type IS SyntaxTree.StringType THEN
  2795. RETURN tag;
  2796. ELSE
  2797. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2798. END;
  2799. END GetArrayLength;
  2800. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2801. VAR result: IntermediateCode.Operand;
  2802. BEGIN
  2803. IF backend.cooperative THEN
  2804. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2805. ELSE
  2806. MakeMemory(result, tag, addressType, 0);
  2807. END;
  2808. RETURN result
  2809. END GetSizeFromTag;
  2810. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2811. VAR parameter: SyntaxTree.Parameter;
  2812. BEGIN
  2813. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2814. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2815. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2816. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2817. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2818. END;
  2819. RETURN GetDynamicSize(e.type, tag);
  2820. END GetArrayOfBytesSize;
  2821. (*
  2822. to find imported symbol. not needed ?
  2823. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2824. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2825. BEGIN
  2826. IF AddImport(moduleName,importedModule,FALSE) THEN
  2827. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2828. RETURN symbol
  2829. ELSE
  2830. RETURN NIL
  2831. END
  2832. END SymbolByName;
  2833. *)
  2834. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2835. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2836. BEGIN
  2837. IF AddImport(moduleName,runtimeModule,force) THEN
  2838. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2839. IF procedure = NIL THEN
  2840. s := "Procedure ";
  2841. Strings.Append(s,moduleName);
  2842. Strings.Append(s,".");
  2843. Strings.Append(s,procedureName);
  2844. Strings.Append(s," not present");
  2845. Error(position,s);
  2846. RETURN FALSE
  2847. ELSE
  2848. RETURN TRUE
  2849. END;
  2850. ELSE RETURN FALSE
  2851. END;
  2852. END GetRuntimeProcedure;
  2853. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2854. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2855. s: Basic.MessageString;
  2856. BEGIN
  2857. Basic.InitSegmentedName(name);
  2858. name[0] := Basic.MakeString(moduleName);
  2859. name[1] := Basic.MakeString(typeName);
  2860. name[2] := -1;
  2861. IF AddImport(moduleName,importedModule, FALSE) THEN
  2862. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2863. IF symbol = NIL THEN
  2864. s := "type ";
  2865. Strings.Append(s,moduleName);
  2866. Strings.Append(s,".");
  2867. Strings.Append(s,typeName);
  2868. Strings.Append(s," not present");
  2869. Error(position,s);
  2870. END;
  2871. ELSE symbol := NIL;
  2872. END;
  2873. IF importedModule = moduleScope.ownerModule THEN
  2874. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2875. ELSE
  2876. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2877. END;
  2878. RETURN symbol
  2879. END GetTypeDescriptor;
  2880. (* 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. *)
  2881. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2882. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2883. pooledName: Basic.SegmentedName; size: LONGINT;
  2884. BEGIN
  2885. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2886. StaticCallOperand(result,procedure);
  2887. IF numberParameters < 0 THEN
  2888. size := ProcedureParametersSize(system,procedure);
  2889. ELSE
  2890. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2891. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2892. Error(position,"runtime call parameter count mismatch");
  2893. END;
  2894. END;
  2895. Emit(Call(position, result.op, size));
  2896. ReleaseOperand(result);
  2897. ELSE (* only static linking possible *)
  2898. ASSERT(numberParameters >= 0);
  2899. Basic.InitSegmentedName(pooledName);
  2900. pooledName[0] := Basic.MakeString(moduleName);
  2901. pooledName[1] := Basic.MakeString(procedureName);
  2902. pooledName[2] := -1;
  2903. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2904. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2905. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2906. END;
  2907. END CallThisChecked;
  2908. (* 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. *)
  2909. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2910. BEGIN
  2911. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2912. END CallThis;
  2913. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2914. VAR
  2915. left,right: Operand;
  2916. leftSize, rightSize: IntermediateCode.Operand;
  2917. saved: RegisterEntry;
  2918. reg: IntermediateCode.Operand;
  2919. procedureName: SyntaxTree.IdentifierString;
  2920. BEGIN
  2921. procedureName := "CompareString";
  2922. SaveRegisters();ReleaseUsedRegisters(saved);
  2923. Designate(leftExpression,left);
  2924. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2925. Emit(Push(position,leftSize));
  2926. ReleaseIntermediateOperand(leftSize);
  2927. Emit(Push(position,left.op));
  2928. ReleaseOperand(left);
  2929. Designate(rightExpression,right);
  2930. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2931. Emit(Push(position,rightSize));
  2932. ReleaseIntermediateOperand(rightSize);
  2933. Emit(Push(position,right.op));
  2934. ReleaseOperand(right);
  2935. IF backend.cooperative THEN
  2936. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2937. ELSE
  2938. CallThis(position,runtimeModuleName,procedureName, 4);
  2939. END;
  2940. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2941. Emit(Result(position,reg));
  2942. (*
  2943. AcquireThisRegister(int8,IntermediateCode.Result);
  2944. *)
  2945. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2946. (*
  2947. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2948. *)
  2949. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2950. ReleaseIntermediateOperand(reg);
  2951. BrL(falseLabel);
  2952. END CompareString;
  2953. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2954. VAR
  2955. left,right: Operand;
  2956. leftSize, rightSize: IntermediateCode.Operand;
  2957. saved: RegisterEntry;
  2958. procedureName: SyntaxTree.IdentifierString;
  2959. BEGIN
  2960. procedureName := "CopyString";
  2961. SaveRegisters();ReleaseUsedRegisters(saved);
  2962. Designate(leftExpression,left);
  2963. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2964. Emit(Push(position,leftSize));
  2965. ReleaseIntermediateOperand(leftSize);
  2966. Emit(Push(position,left.op));
  2967. ReleaseOperand(left);
  2968. Designate(rightExpression,right);
  2969. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2970. Emit(Push(position,rightSize));
  2971. ReleaseIntermediateOperand(rightSize);
  2972. Emit(Push(position,right.op));
  2973. ReleaseOperand(right);
  2974. IF backend.cooperative THEN
  2975. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2976. ELSE
  2977. CallThis(position,runtimeModuleName,procedureName,4);
  2978. END;
  2979. RestoreRegisters(saved);
  2980. END CopyString;
  2981. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2982. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2983. leftType,rightType: SyntaxTree.Type;
  2984. leftExpression,rightExpression : SyntaxTree.Expression;
  2985. componentType: IntermediateCode.Type;
  2986. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2987. size: LONGINT;
  2988. BEGIN
  2989. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2990. dest := destination; destination := emptyOperand;
  2991. leftType := x.left.type.resolved;
  2992. rightType := x.right.type.resolved;
  2993. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2994. CASE x.operator OF
  2995. Scanner.Or:
  2996. (* shortcut evaluation of left OR right *)
  2997. IF ~conditional THEN ConditionToValue(x);
  2998. ELSE
  2999. next := NewLabel();
  3000. Condition(x.left,trueLabel,next);
  3001. SetLabel(next);
  3002. Condition(x.right,trueLabel,falseLabel);
  3003. END;
  3004. |Scanner.And:
  3005. (* shortcut evaluation of left & right *)
  3006. IF ~conditional THEN ConditionToValue(x);
  3007. ELSE
  3008. next := NewLabel();
  3009. Condition(x.left,next,falseLabel);
  3010. SetLabel(next);
  3011. Condition(x.right,trueLabel,falseLabel);
  3012. END;
  3013. |Scanner.Is:
  3014. IF ~conditional THEN ConditionToValue(x);
  3015. ELSE
  3016. (* get type desc tag *)
  3017. IF IsPointerToRecord(leftType,recordType) THEN
  3018. Evaluate(x.left,left);
  3019. Dereference(left,recordType,IsUnsafePointer(leftType))
  3020. ELSE
  3021. Designate(x.left,left);
  3022. END;
  3023. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3024. ReleaseOperand(left);
  3025. END;
  3026. |Scanner.Plus:
  3027. Evaluate(x.left,left);
  3028. Evaluate(x.right,right);
  3029. IF leftType IS SyntaxTree.SetType THEN
  3030. InitOperand(result,ModeValue);
  3031. Reuse2a(result.op,left.op,right.op,dest);
  3032. Emit(Or(position,result.op,left.op,right.op));
  3033. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3034. InitOperand(result,ModeValue);
  3035. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3036. Reuse2(result.tag,left.tag,right.tag);
  3037. Emit(Add(position,result.op,left.op,right.op));
  3038. Emit(Add(position,result.tag,left.tag,right.tag))
  3039. ELSE
  3040. InitOperand(result,ModeValue);
  3041. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3042. AddInt(result.op, left.op, right.op) ;
  3043. ELSE
  3044. *)
  3045. Reuse2a(result.op,left.op,right.op,dest);
  3046. Emit(Add(position,result.op,left.op,right.op));
  3047. (*
  3048. END;
  3049. *)
  3050. END;
  3051. ReleaseOperand(left); ReleaseOperand(right);
  3052. |Scanner.Minus:
  3053. Evaluate(x.left,left);
  3054. Evaluate(x.right,right);
  3055. IF leftType IS SyntaxTree.SetType THEN
  3056. InitOperand(result,ModeValue);
  3057. Reuse1(result.op,right.op);
  3058. Emit(Not(position,result.op,right.op));
  3059. ReleaseOperand(right);
  3060. Emit(And(position,result.op,result.op,left.op));
  3061. ReleaseOperand(left);
  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(Sub(position,result.op,left.op,right.op));
  3067. Emit(Sub(position,result.tag,left.tag,right.tag));
  3068. ReleaseOperand(left); ReleaseOperand(right)
  3069. ELSE
  3070. InitOperand(result,ModeValue);
  3071. Reuse2a(result.op,left.op,right.op,dest);
  3072. Emit(Sub(position,result.op,left.op,right.op));
  3073. ReleaseOperand(left); ReleaseOperand(right);
  3074. END;
  3075. |Scanner.Times:
  3076. Evaluate(x.left,left);
  3077. Evaluate(x.right,right);
  3078. IF leftType IS SyntaxTree.SetType THEN
  3079. InitOperand(result,ModeValue);
  3080. Reuse2a(result.op,left.op,right.op,dest);
  3081. Emit(And(position,result.op,left.op,right.op));
  3082. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3083. InitOperand(result, ModeValue);
  3084. componentType := left.op.type;
  3085. (* TODO: review this *)
  3086. (*
  3087. result.op = left.op * right.op - left.tag * right.tag
  3088. result.tag = left.tag * right.op + left.op * right.tag
  3089. *)
  3090. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3091. Emit(Mul(position,result.op, left.op, right.op));
  3092. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3093. Emit(Mul(position,tempReg, left.tag, right.tag));
  3094. Emit(Sub(position,result.op, result.op, tempReg));
  3095. Reuse2(result.tag, left.tag, right.op);
  3096. Emit(Mul(position,result.tag, left.tag, right.op));
  3097. Emit(Mul(position,tempReg, left.op, right.tag));
  3098. Emit(Add(position,result.tag, result.tag, tempReg));
  3099. ReleaseIntermediateOperand(tempReg)
  3100. ELSE
  3101. InitOperand(result,ModeValue);
  3102. Reuse2a(result.op,left.op,right.op,dest);
  3103. Emit(Mul(position,result.op,left.op,right.op));
  3104. END;
  3105. ReleaseOperand(left); ReleaseOperand(right);
  3106. |Scanner.Div:
  3107. Evaluate(x.left,left);
  3108. Evaluate(x.right,right);
  3109. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3110. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3111. IF ~isUnchecked THEN
  3112. exit := NewLabel();
  3113. BrltL(exit,zero,right.op);
  3114. EmitTrap(position,NegativeDivisorTrap);
  3115. SetLabel(exit);
  3116. END;
  3117. END;
  3118. InitOperand(result,ModeValue);
  3119. Reuse2a(result.op,left.op,right.op,dest);
  3120. Emit(Div(position,result.op,left.op,right.op));
  3121. ReleaseOperand(left); ReleaseOperand(right);
  3122. |Scanner.Mod:
  3123. Evaluate(x.left,left);
  3124. Evaluate(x.right,right);
  3125. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3126. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3127. IF ~isUnchecked THEN
  3128. exit := NewLabel();
  3129. BrltL(exit,zero,right.op);
  3130. EmitTrap(position,NegativeDivisorTrap);
  3131. SetLabel(exit);
  3132. END;
  3133. END;
  3134. InitOperand(result,ModeValue);
  3135. Reuse2a(result.op,left.op,right.op,dest);
  3136. Emit(Mod(position,result.op,left.op,right.op));
  3137. ReleaseOperand(left); ReleaseOperand(right);
  3138. |Scanner.Slash:
  3139. Evaluate(x.left,left);
  3140. Evaluate(x.right,right);
  3141. IF leftType IS SyntaxTree.SetType THEN
  3142. InitOperand(result,ModeValue);
  3143. Reuse2a(result.op,left.op,right.op,dest);
  3144. Emit(Xor(position,result.op,left.op,right.op));
  3145. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3146. InitOperand(result,ModeValue);
  3147. componentType := left.op.type;
  3148. (* review this *)
  3149. (*
  3150. divisor = right.op * right.op + right.tag * right.tag
  3151. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3152. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3153. *)
  3154. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3155. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3156. Emit(Mul(position,tempReg, right.op, right.op));
  3157. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3158. Emit(Add(position,tempReg, tempReg, tempReg2));
  3159. result.op := tempReg2;
  3160. Emit(Mul(position,result.op, left.op, right.op));
  3161. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3162. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3163. Emit(Add(position,result.op, result.op, tempReg2));
  3164. Emit(Div(position,result.op, result.op, tempReg));
  3165. Reuse2(result.tag, left.tag, right.op);
  3166. Emit(Mul(position,result.tag, left.tag, right.op));
  3167. Emit(Mul(position,tempReg2, left.op, right.tag));
  3168. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3169. Emit(Div(position,result.tag, result.tag, tempReg));
  3170. ReleaseIntermediateOperand(tempReg);
  3171. ReleaseIntermediateOperand(tempReg2)
  3172. ELSE
  3173. InitOperand(result,ModeValue);
  3174. Reuse2a(result.op,left.op,right.op,dest);
  3175. Emit(Div(position,result.op,left.op,right.op));
  3176. END;
  3177. ReleaseOperand(left); ReleaseOperand(right);
  3178. |Scanner.Equal:
  3179. IF ~conditional THEN ConditionToValue(x);
  3180. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3181. CompareString(BreqL,x.left,x.right);
  3182. ELSE
  3183. Evaluate(x.left,left);
  3184. Evaluate(x.right,right);
  3185. IF leftType IS SyntaxTree.RangeType THEN
  3186. ASSERT(rightType IS SyntaxTree.RangeType);
  3187. BrneL(falseLabel, left.op, right.op); (* first *)
  3188. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3189. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3190. ReleaseOperand(left); ReleaseOperand(right);
  3191. BrL(trueLabel)
  3192. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3193. BrneL(falseLabel, left.op, right.op); (* first *)
  3194. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3195. ReleaseOperand(left); ReleaseOperand(right);
  3196. BrL(trueLabel)
  3197. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3198. (* TODO: review this *)
  3199. BrneL(falseLabel, left.op, right.op); (* real part *)
  3200. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3201. ReleaseOperand(left); ReleaseOperand(right);
  3202. BrL(trueLabel)
  3203. ELSE
  3204. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3205. ReleaseOperand(left); ReleaseOperand(right);
  3206. BrL(trueLabel);
  3207. END;
  3208. END;
  3209. |Scanner.LessEqual:
  3210. IF ~conditional THEN ConditionToValue(x);
  3211. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3212. CompareString(BrgeL,x.right,x.left);
  3213. ELSE
  3214. Evaluate(x.left,left);
  3215. Evaluate(x.right,right);
  3216. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3217. Reuse1(temp.op,right.op);
  3218. Emit(And(position,temp.op,left.op,right.op));
  3219. ReleaseOperand(right);
  3220. BreqL(trueLabel,temp.op,left.op);
  3221. BrL(falseLabel);
  3222. ReleaseOperand(temp);ReleaseOperand(left);
  3223. ELSE
  3224. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3225. ReleaseOperand(left); ReleaseOperand(right);
  3226. BrL(trueLabel);
  3227. END;
  3228. END;
  3229. |Scanner.Less:
  3230. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3231. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3232. leftExpression.SetType(system.booleanType);
  3233. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3234. rightExpression.SetType(system.booleanType);
  3235. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3236. leftExpression.SetType(system.booleanType);
  3237. Expression(leftExpression);
  3238. ELSIF ~conditional THEN ConditionToValue(x);
  3239. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3240. CompareString(BrltL,x.left,x.right);
  3241. ELSE
  3242. Evaluate(x.left,left);
  3243. Evaluate(x.right,right);
  3244. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3245. ReleaseOperand(left); ReleaseOperand(right);
  3246. BrL(trueLabel);
  3247. END;
  3248. |Scanner.Greater:
  3249. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3250. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3251. leftExpression.SetType(system.booleanType);
  3252. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3253. rightExpression.SetType(system.booleanType);
  3254. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3255. leftExpression.SetType(system.booleanType);
  3256. Expression(leftExpression);
  3257. ELSIF ~conditional THEN ConditionToValue(x);
  3258. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3259. CompareString(BrltL,x.right,x.left);
  3260. ELSE
  3261. Evaluate(x.left,left);
  3262. Evaluate(x.right,right);
  3263. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3264. ReleaseOperand(left); ReleaseOperand(right);
  3265. BrL(trueLabel);
  3266. END;
  3267. |Scanner.GreaterEqual:
  3268. IF ~conditional THEN ConditionToValue(x);
  3269. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3270. CompareString(BrgeL,x.left,x.right);
  3271. ELSE
  3272. Evaluate(x.left,left);
  3273. Evaluate(x.right,right);
  3274. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3275. Reuse1(temp.op,left.op);
  3276. Emit(And(position,temp.op,left.op,right.op));
  3277. ReleaseOperand(left);
  3278. BreqL(trueLabel, temp.op,right.op);
  3279. ReleaseOperand(temp); ReleaseOperand(right);
  3280. BrL(falseLabel);
  3281. ELSE
  3282. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3283. ReleaseOperand(left); ReleaseOperand(right);
  3284. BrL(trueLabel);
  3285. END;
  3286. END;
  3287. |Scanner.Unequal:
  3288. IF ~conditional THEN ConditionToValue(x);
  3289. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3290. CompareString(BrneL,x.left,x.right);
  3291. ELSE
  3292. Evaluate(x.left,left);
  3293. Evaluate(x.right,right);
  3294. IF leftType IS SyntaxTree.RangeType THEN
  3295. ASSERT(rightType IS SyntaxTree.RangeType);
  3296. BrneL(trueLabel, left.op, right.op); (* first *)
  3297. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3298. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3299. ReleaseOperand(left); ReleaseOperand(right);
  3300. BrL(falseLabel)
  3301. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3302. BrneL(trueLabel, left.op, right.op); (* first *)
  3303. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3304. ReleaseOperand(left); ReleaseOperand(right);
  3305. BrL(falseLabel)
  3306. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3307. (* TODO: review this *)
  3308. BrneL(trueLabel, left.op, right.op); (* real part *)
  3309. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3310. ReleaseOperand(left); ReleaseOperand(right);
  3311. BrL(falseLabel)
  3312. ELSE
  3313. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3314. ReleaseOperand(left); ReleaseOperand(right);
  3315. BrL(trueLabel);
  3316. END;
  3317. END;
  3318. |Scanner.In:
  3319. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3320. Evaluate(x.left,left);
  3321. Evaluate(x.right,right);
  3322. Convert(left.op,setType);
  3323. ReuseCopy(temp.op,right.op);
  3324. Emit(Shr(position,temp.op,temp.op,left.op));
  3325. ReleaseOperand(right); ReleaseOperand(left);
  3326. IntermediateCode.InitImmediate(one,setType,1);
  3327. Emit(And(position,temp.op,temp.op,one));
  3328. IF conditional THEN
  3329. IntermediateCode.InitImmediate(zero,setType,0);
  3330. BrneL(trueLabel,temp.op,zero);
  3331. ReleaseOperand(temp);
  3332. BrL(falseLabel);
  3333. ELSE
  3334. Convert(temp.op,bool);
  3335. result.mode := ModeValue;
  3336. result.op := temp.op;
  3337. result.tag := nil; (* may be left over from calls to evaluate *)
  3338. END;
  3339. ELSE
  3340. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3341. IF x.operator = Scanner.Questionmarks THEN
  3342. leftExpression := x.left;
  3343. rightExpression := x.right;
  3344. ELSE
  3345. leftExpression := x.right;
  3346. rightExpression := x.left;
  3347. END;
  3348. Evaluate(leftExpression, left);
  3349. Emit(Push(position,left.op));
  3350. ReleaseOperand(left);
  3351. Designate(rightExpression, right);
  3352. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3353. IF ~backend.cellsAreObjects THEN
  3354. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3355. END;
  3356. Emit(Push(position,right.op));
  3357. ReleaseOperand(right);
  3358. IF backend.cellsAreObjects THEN
  3359. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3360. ELSE
  3361. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3362. END;
  3363. InitOperand(result, ModeValue);
  3364. result.op := NewRegisterOperand(bool);
  3365. Emit(Result(position,result.op));
  3366. IF conditional THEN
  3367. IntermediateCode.InitImmediate(zero,setType,0);
  3368. BrneL(trueLabel,result.op,zero);
  3369. ReleaseOperand(result);
  3370. BrL(falseLabel);
  3371. END;
  3372. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3373. leftExpression := x.left;
  3374. rightExpression := x.right;
  3375. Evaluate(leftExpression, left);
  3376. Emit(Push(position,left.op));
  3377. ReleaseOperand(left);
  3378. Evaluate(rightExpression, right);
  3379. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3380. IF ~backend.cellsAreObjects THEN
  3381. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3382. END;
  3383. Emit(Push(position,right.op));
  3384. ReleaseOperand(right);
  3385. IF backend.cellsAreObjects THEN
  3386. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3387. ELSE
  3388. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3389. END;
  3390. InitOperand(result, ModeValue);
  3391. result.op := NewRegisterOperand(bool);
  3392. Emit(Result(position,result.op));
  3393. IF conditional THEN
  3394. IntermediateCode.InitImmediate(zero,setType,0);
  3395. BrneL(trueLabel,result.op,zero);
  3396. ReleaseOperand(result);
  3397. BrL(falseLabel);
  3398. END;
  3399. ELSE
  3400. HALT(100);
  3401. END;
  3402. END;
  3403. destination := dest;
  3404. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3405. END VisitBinaryExpression;
  3406. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3407. VAR localResult, operand: Operand;
  3408. BEGIN
  3409. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3410. InitOperand(localResult, ModeValue);
  3411. ASSERT(x.first # NIL);
  3412. Evaluate(x.first, operand);
  3413. localResult.op := operand.op;
  3414. ReleaseOperand(operand);
  3415. UseIntermediateOperand(localResult.op);
  3416. ASSERT(x.last # NIL);
  3417. Evaluate(x.last, operand);
  3418. localResult.tag := operand.op;
  3419. ReleaseOperand(operand);
  3420. UseIntermediateOperand(localResult.tag);
  3421. IF x.step # NIL THEN
  3422. Evaluate(x.step, operand);
  3423. localResult.extra := operand.op;
  3424. ReleaseOperand(operand);
  3425. UseIntermediateOperand(localResult.extra);
  3426. END;
  3427. result := localResult;
  3428. IF Trace THEN TraceExit("VisitRangeExpression") END
  3429. END VisitRangeExpression;
  3430. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3431. BEGIN
  3432. HALT(100); (* should never be evaluated *)
  3433. END VisitTensorRangeExpression;
  3434. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3435. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3436. BEGIN
  3437. IF Trace THEN TraceEnter("VisitConversion") END;
  3438. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3439. dest := destination; destination := emptyOperand;
  3440. Evaluate(x.expression,old);
  3441. InitOperand(result,ModeValue);
  3442. result.op := old.op;
  3443. ASSERT(result.op.mode # 0);
  3444. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3445. (* convert TO a complex number *)
  3446. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3447. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3448. ASSERT(result.op.mode # 0);
  3449. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3450. (* convert FROM a complex number TO a complex number*)
  3451. result.tag := old.tag;
  3452. ASSERT(result.tag.mode # 0);
  3453. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3454. ASSERT(result.tag.mode # 0)
  3455. ELSE
  3456. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3457. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3458. END
  3459. ELSE
  3460. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3461. ASSERT(result.op.mode # 0);
  3462. result.tag := old.tag; (*! probably never used *)
  3463. END;
  3464. destination := dest;
  3465. IF Trace THEN TraceExit("VisitConversion") END;
  3466. END VisitConversion;
  3467. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3468. BEGIN
  3469. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3470. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3471. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3472. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3473. END VisitTypeDeclaration;
  3474. (** designators (expressions) *)
  3475. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3476. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3477. BEGIN
  3478. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3479. IF x.left # NIL THEN Expression(x.left) END;
  3480. Symbol(x.symbol,result);
  3481. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3482. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3483. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3484. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3485. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3486. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3487. END;
  3488. END;
  3489. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3490. END VisitSymbolDesignator;
  3491. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3492. BEGIN
  3493. IF isUnchecked THEN RETURN END;
  3494. IF tagsAvailable THEN
  3495. TrapC(BrltL,index,length,IndexCheckTrap);
  3496. END;
  3497. END BoundCheck;
  3498. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3499. VAR d: IntermediateCode.Operand;
  3500. BEGIN
  3501. IF isUnchecked THEN RETURN END;
  3502. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3503. TrapC(op,dim,d,ArraySizeTrap);
  3504. ReleaseIntermediateOperand(d);
  3505. END DimensionCheck;
  3506. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3507. VAR
  3508. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3509. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3510. expression: SyntaxTree.Expression;
  3511. resultingType, leftType, baseType: SyntaxTree.Type;
  3512. skipLabel1: Label;
  3513. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3514. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3515. variableOp: Operand;
  3516. variable: SyntaxTree.Variable;
  3517. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3518. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3519. VAR e: SyntaxTree.Expression; i: LONGINT;
  3520. BEGIN
  3521. tensorFound := FALSE;
  3522. FOR i := 0 TO parameters.Length()-1 DO
  3523. e := parameters.GetExpression(i);
  3524. IF e IS SyntaxTree.TensorRangeExpression THEN
  3525. ASSERT(~tensorFound);
  3526. tensorFound := TRUE;
  3527. ELSIF e IS SyntaxTree.RangeExpression THEN
  3528. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3529. ELSE
  3530. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3531. END;
  3532. END;
  3533. END CountIndices;
  3534. BEGIN
  3535. ASSERT(tagsAvailable);
  3536. resultingType := x.type.resolved; (* resulting type *)
  3537. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3538. InitOperand(localResult, ModeReference);
  3539. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3540. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3541. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3542. (* a globally defined array destination tag is available -> use and invalidate it*)
  3543. localResult.tag := arrayDestinationTag;
  3544. IntermediateCode.InitOperand(arrayDestinationTag)
  3545. ELSE
  3546. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3547. (* the result is of array range type and thus does not provide any collectable pointers *)
  3548. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3549. Symbol(variable, variableOp);
  3550. ReuseCopy(localResult.tag, variableOp.op);
  3551. ReleaseOperand(variableOp);
  3552. END
  3553. END;
  3554. indexListSize := x.parameters.Length();
  3555. CountIndices(x.parameters);
  3556. (*ASSERT(tensorRangeCount <= 1);*)
  3557. (* designate the array to be indexed over, perform tensor range check if known *)
  3558. Designate(x.left, array);
  3559. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3560. Dereference(array, leftType,FALSE);
  3561. IF ~tensorFound THEN
  3562. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, prefixRanges + prefixIndices), BreqL)
  3563. END
  3564. END;
  3565. (* default base offset *)
  3566. srcDimOffset := 0;
  3567. destDimOffset := 0;
  3568. indexDim := 0;
  3569. (* use address of source array as basis *)
  3570. localResult.op := array.op;
  3571. UseIntermediateOperand(localResult.op);
  3572. (* go through the index list *)
  3573. FOR i := 0 TO indexListSize - 1 DO
  3574. expression := x.parameters.GetExpression(i);
  3575. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3576. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3577. srcDimOffset := -indexListSize;
  3578. destDimOffset := -suffixRanges;
  3579. ELSE
  3580. (* determine which dimension of source array is currently looked at *)
  3581. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3582. (* get the memory operand pointing to array descriptor dimension *)
  3583. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3584. (* make a reusable register from it *)
  3585. ReuseCopy(srcDim, tmp);
  3586. ReleaseIntermediateOperand(tmp);
  3587. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3588. ELSE
  3589. srcDim := IntermediateCode.Immediate(int32, i);
  3590. END;
  3591. (* get length and increment of source array for current dimension *)
  3592. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3593. Convert(sourceLength.op, sizeType);
  3594. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3595. Convert(sourceIncrement.op, sizeType);
  3596. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3597. ReleaseIntermediateOperand(srcDim);
  3598. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3599. (* SINGLE INDEX *)
  3600. Evaluate(expression, index);
  3601. ReleaseIntermediateOperand(index.tag);
  3602. index.tag := emptyOperand;
  3603. Convert(index.op, sizeType);
  3604. (* lower bound check *)
  3605. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3606. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3607. ELSIF isUnchecked THEN (* do nothing *)
  3608. ELSE
  3609. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3610. END;
  3611. (* upper bound check *)
  3612. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3613. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3614. ELSIF isUnchecked THEN (* do nothing *)
  3615. ELSE
  3616. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3617. END;
  3618. ReleaseOperand(sourceLength);
  3619. Convert(index.op, addressType);
  3620. summand := index.op;
  3621. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3622. (* RANGE OF INDICES *)
  3623. Evaluate(expression, range);
  3624. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3625. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3626. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3627. ReleaseOperand(range);
  3628. Convert(firstIndex, sizeType);
  3629. Convert(lastIndex, sizeType);
  3630. Convert(stepSize, sizeType);
  3631. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3632. if it is 'MAX(LONGINT)' *)
  3633. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3634. TransferToRegister(lastIndex, lastIndex);
  3635. skipLabel1 := NewLabel();
  3636. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3637. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3638. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3639. SetLabel(skipLabel1)
  3640. END;
  3641. (* check if step size is valid *)
  3642. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3643. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3644. ELSIF isUnchecked THEN (* do nothing *)
  3645. ELSE
  3646. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3647. END;
  3648. (* check lower bound check *)
  3649. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3650. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3651. ELSIF isUnchecked THEN (* do nothing *)
  3652. ELSE
  3653. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3654. END;
  3655. (* check upper bound check *)
  3656. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3657. (* statically open range: nothing to do *)
  3658. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3659. ASSERT(staticLastIndex < staticSourceLength)
  3660. ELSIF isUnchecked THEN (* do nothing *)
  3661. ELSE
  3662. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3663. END;
  3664. (* determine length of target array for current dimension *)
  3665. (* 1. incorporate last index: *)
  3666. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3667. (* last index is static *)
  3668. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3669. targetLength := sourceLength.op
  3670. ELSE
  3671. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3672. END;
  3673. UseIntermediateOperand(targetLength);
  3674. ELSE
  3675. (* targetLength := lastIndex + 1
  3676. Reuse1(targetLength, lastIndex);
  3677. *)
  3678. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3679. END;
  3680. ReleaseOperand(sourceLength);
  3681. ReleaseIntermediateOperand(lastIndex);
  3682. (* 2. incorporate first index: *)
  3683. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3684. (* first index and current target length are static *)
  3685. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3686. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3687. (* first index = 0: nothing to do *)
  3688. ELSE
  3689. (* targetLength := targetLength - firstIndex *)
  3690. TransferToRegister(targetLength, targetLength);
  3691. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3692. END;
  3693. (* clip negative lengths to 0 *)
  3694. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3695. IF staticTargetLength < 0 THEN
  3696. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3697. END
  3698. ELSE
  3699. skipLabel1 := NewLabel();
  3700. TransferToRegister(targetLength, targetLength);
  3701. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3702. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3703. SetLabel(skipLabel1)
  3704. END;
  3705. (* 3. incorporate index step size: *)
  3706. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3707. (*step size and current target length are static *)
  3708. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3709. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3710. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3711. (* step size = 1: nothing to do *)
  3712. ELSE
  3713. (* emit code for this:
  3714. targetLength := (targetLength-1) DIV stepSize +1;
  3715. *)
  3716. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3717. DivInt(targetLength, targetLength, stepSize);
  3718. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3719. END;
  3720. (* determine increment of target array for current dimension *)
  3721. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3722. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3723. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3724. (* step size = 1 *)
  3725. targetIncrement := sourceIncrement.op;
  3726. UseIntermediateOperand(targetIncrement)
  3727. ELSE
  3728. (* targetIncrement := sourceIncrement * stepSize *)
  3729. Reuse1(targetIncrement, stepSize);
  3730. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3731. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3732. END;
  3733. ReleaseIntermediateOperand(stepSize);
  3734. (* write length and increment of target array to descriptor *)
  3735. IF destDimOffset < 0 THEN
  3736. (* determine which dimension of target array is currently looked at *)
  3737. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3738. TransferToRegister(destDim, tmp);
  3739. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3740. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3741. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3742. ReleaseIntermediateOperand(destDim);
  3743. INC(destDimOffset);
  3744. ELSE
  3745. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3746. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3747. END;
  3748. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3749. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3750. INC(indexDim);
  3751. Convert(firstIndex, addressType);
  3752. TransferToRegister(summand, firstIndex);
  3753. ELSE HALT(100);
  3754. END;
  3755. (*
  3756. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3757. *)
  3758. Convert(sourceIncrement.op, addressType);
  3759. Convert(summand, addressType);
  3760. MulInt(summand, summand, sourceIncrement.op);
  3761. ReleaseIntermediateOperand(sourceIncrement.op);
  3762. AddInt(localResult.op, localResult.op, summand);
  3763. ReleaseIntermediateOperand(summand);
  3764. END
  3765. END;
  3766. result := localResult;
  3767. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3768. ReleaseIntermediateOperand(result.tag);
  3769. result.tag := TypeDescriptorAdr(resultingType);
  3770. IF ~newObjectFile THEN
  3771. IntermediateCode.MakeMemory(result.tag,addressType);
  3772. END;
  3773. ELSIF IsDelegate(resultingType) THEN
  3774. ReleaseIntermediateOperand(result.tag);
  3775. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3776. UseIntermediateOperand(result.tag);
  3777. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3778. ReleaseIntermediateOperand(result.tag);
  3779. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3780. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3781. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3782. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3783. (* finalize target array descriptor *)
  3784. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3785. (* write lengths and increments of target array for remaining dimensions *)
  3786. i := indexListSize;
  3787. WHILE indexDim < targetArrayDimensionality DO
  3788. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3789. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3790. ReleaseOperand(sourceLength);
  3791. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3792. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3793. ReleaseOperand(sourceIncrement);
  3794. INC(i); INC(indexDim);
  3795. END;
  3796. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3797. tmp := nil;
  3798. ELSE
  3799. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3800. END;
  3801. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3802. ReleaseIntermediateOperand(tmp);
  3803. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3804. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3805. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3806. ELSE
  3807. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3808. END;
  3809. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3810. ReleaseIntermediateOperand(tmp);
  3811. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3812. (* write dimensionality *)
  3813. IF targetArrayDimensionality # 0 THEN
  3814. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3815. END;
  3816. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3817. END;
  3818. ReleaseOperand(array);
  3819. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3820. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3821. END;
  3822. END MathIndexDesignator;
  3823. (* get the length of an array , trying to make use of static information *)
  3824. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3825. VAR res: IntermediateCode.Operand; size: LONGINT;
  3826. BEGIN
  3827. type := type.resolved;
  3828. IF type IS SyntaxTree.ArrayType THEN
  3829. WITH type: SyntaxTree.ArrayType DO
  3830. IF type.form = SyntaxTree.Static THEN
  3831. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3832. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3833. Evaluate(type.length, op);
  3834. ReleaseIntermediateOperand(op.tag);
  3835. RETURN op.op;*)
  3836. ELSE
  3837. res := tag;
  3838. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3839. IntermediateCode.MakeMemory(res,addressType);
  3840. UseIntermediateOperand(res);
  3841. RETURN res
  3842. END
  3843. END;
  3844. ELSE
  3845. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3846. RETURN IntermediateCode.Immediate(addressType,size);
  3847. END;
  3848. END ArrayLength;
  3849. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  3850. BEGIN
  3851. IF IsImmediate(x) THEN
  3852. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  3853. ELSE
  3854. IF ~ReusableRegister(res) THEN
  3855. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3856. ELSE
  3857. UseIntermediateOperand(res);
  3858. END;
  3859. Emit(Mov(position,res,x))
  3860. END;
  3861. END CopyInt;
  3862. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3863. BEGIN
  3864. ReleaseIntermediateOperand(res);
  3865. IF IsImmediate(x) & IsImmediate(y) THEN
  3866. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3867. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3868. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3869. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3870. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3871. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3872. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3873. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3874. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3875. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3876. UseIntermediateOperand(res);
  3877. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3878. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3879. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3880. UseIntermediateOperand(res);
  3881. ELSE
  3882. IF ~ReusableRegister(res) THEN
  3883. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3884. ELSE
  3885. UseIntermediateOperand(res);
  3886. END;
  3887. IF IsImmediate(x) & (x.intValue = 0) THEN
  3888. Emit(Mov(position,res,y))
  3889. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3890. Emit(Mov(position,res,x))
  3891. ELSE
  3892. Emit(Add(position,res, x, y));
  3893. END;
  3894. END;
  3895. END AddInt;
  3896. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3897. BEGIN
  3898. ReleaseIntermediateOperand(res);
  3899. IF IsImmediate(x) & IsImmediate(y) THEN
  3900. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3901. ELSE
  3902. IF ~ReusableRegister(res) THEN
  3903. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3904. ELSE UseIntermediateOperand(res);
  3905. END;
  3906. IF IsImmediate(x) & (x.intValue = 1) THEN
  3907. Emit(Mov(position,res,y))
  3908. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3909. Emit(Mov(position,res,x))
  3910. ELSE
  3911. Emit(Mul(position,res, x, y));
  3912. END;
  3913. END;
  3914. END MulInt;
  3915. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3916. BEGIN
  3917. ReleaseIntermediateOperand(res);
  3918. IF IsImmediate(x) & IsImmediate(y) THEN
  3919. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3920. ELSE
  3921. IF ~ReusableRegister(res) THEN
  3922. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3923. ELSE UseIntermediateOperand(res);
  3924. END;
  3925. IF IsImmediate(x) & (x.intValue = 1) THEN
  3926. Emit(Mov(position,res,y))
  3927. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3928. Emit(Mov(position,res,x))
  3929. ELSE
  3930. Emit(Div(position,res, x, y));
  3931. END;
  3932. END;
  3933. END DivInt;
  3934. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3935. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3936. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3937. BEGIN
  3938. type := x.left.type.resolved;
  3939. IF type IS SyntaxTree.StringType THEN
  3940. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  3941. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3942. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  3943. type := atype;
  3944. x.left.SetType(type);
  3945. END;
  3946. IntermediateCode.InitImmediate(res,addressType,0);
  3947. maxDim := x.parameters.Length()-1;
  3948. (*
  3949. computation rule:
  3950. a: ARRAY X,Y,Z OF Element with size S
  3951. a[i,j,k] -->
  3952. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  3953. *)
  3954. FOR i := 0 TO maxDim DO
  3955. e := x.parameters.GetExpression(i);
  3956. Evaluate(e,index);
  3957. Convert(index.op,addressType);
  3958. AddInt(res, res, index.op);
  3959. IF i = 0 THEN
  3960. (*
  3961. ReuseCopy(res, index.op);
  3962. *)
  3963. Designate(x.left,array);
  3964. type := x.left.type.resolved;
  3965. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3966. Dereference(array, type, FALSE);
  3967. END;
  3968. (*
  3969. ELSE AddInt(res, res, index.op);
  3970. *)
  3971. END;
  3972. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3973. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3974. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3975. BoundCheck(index.op, length);
  3976. END;
  3977. ReleaseIntermediateOperand(length);
  3978. END;
  3979. ReleaseOperand(index);
  3980. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3981. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3982. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3983. MulInt(res,res,length);
  3984. END;
  3985. ReleaseIntermediateOperand(length);
  3986. END;
  3987. (* remaining open dimensions -- compute address *)
  3988. i := maxDim+1;
  3989. IF type IS SyntaxTree.ArrayType THEN
  3990. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3991. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  3992. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  3993. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3994. MulInt(res,res,length);
  3995. END;
  3996. ReleaseIntermediateOperand(length);
  3997. INC(i);
  3998. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  3999. END;
  4000. END;
  4001. IF (type IS SyntaxTree.ArrayType) THEN
  4002. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4003. size := StaticSize(system, type);
  4004. IF size # 1 THEN
  4005. length := IntermediateCode.Immediate(addressType,size);
  4006. MulInt(res,res,length);
  4007. END;
  4008. ELSE
  4009. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4010. IF size # 1 THEN
  4011. length := IntermediateCode.Immediate(addressType,size);
  4012. MulInt(res,res,length);
  4013. END;
  4014. END;
  4015. END;
  4016. AddInt(res,res,array.op);
  4017. InitOperand(result,ModeReference);
  4018. result.op := res;
  4019. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4020. ReleaseIntermediateOperand(result.tag);
  4021. result.tag := TypeDescriptorAdr(type);
  4022. IF ~newObjectFile THEN
  4023. IntermediateCode.MakeMemory(result.tag,addressType);
  4024. END
  4025. ELSIF IsDelegate(type) THEN
  4026. ReleaseIntermediateOperand(result.tag);
  4027. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4028. UseIntermediateOperand(result.tag);
  4029. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4030. ReleaseIntermediateOperand(result.tag);
  4031. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4032. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4033. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4034. END;
  4035. ReleaseOperand(array);
  4036. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4037. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4038. END;
  4039. END IndexDesignator;
  4040. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  4041. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4042. BEGIN
  4043. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4044. dest := destination; destination := emptyOperand;
  4045. type := x.left.type.resolved;
  4046. IF type IS SyntaxTree.MathArrayType THEN
  4047. MathIndexDesignator(x);
  4048. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4049. IndexDesignator(x);
  4050. END;
  4051. destination := dest;
  4052. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4053. END VisitIndexDesignator;
  4054. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4055. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4056. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4057. procedure: SyntaxTree.Procedure;
  4058. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4059. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4060. BEGIN
  4061. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4062. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4063. parameters := expression.parameters;
  4064. moduleName := "FoxArrayBase";
  4065. procedureName := "CopyDescriptor";
  4066. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4067. SaveRegisters();ReleaseUsedRegisters(saved);
  4068. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4069. IF procedure = NIL THEN
  4070. s := "procedure ";
  4071. Strings.Append(s,moduleName);
  4072. Strings.Append(s,".");
  4073. Strings.Append(s,procedureName);
  4074. Strings.Append(s," not present");
  4075. Error(position,s);
  4076. ELSE
  4077. (* push address of temporary variable *)
  4078. Symbol(variable,destOperand);
  4079. Emit(Push(position,destOperand.op));
  4080. ReleaseOperand(destOperand);
  4081. (* push src *)
  4082. Evaluate(expression.left,srcOperand);
  4083. (*
  4084. Dereference(srcOperand,expression.type.resolved);
  4085. Emit(Push(position,srcOperand.tag));
  4086. *)
  4087. Emit(Push(position,srcOperand.op));
  4088. ReleaseOperand(srcOperand);
  4089. tensorFound := FALSE;
  4090. FOR i := 0 TO parameters.Length()-1 DO
  4091. e := parameters.GetExpression(i);
  4092. IF e IS SyntaxTree.TensorRangeExpression THEN
  4093. tensorFound := TRUE;
  4094. ELSIF e IS SyntaxTree.RangeExpression THEN
  4095. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4096. ELSE
  4097. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4098. END;
  4099. END;
  4100. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  4101. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  4102. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  4103. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  4104. StaticCallOperand(procOp,procedure);
  4105. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4106. ReleaseOperand(procOp);
  4107. END;
  4108. RestoreRegisters(saved);
  4109. END;
  4110. RETURN variable
  4111. END PrepareTensorDescriptor;
  4112. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4113. VAR
  4114. type, descriptorType, baseType: SyntaxTree.Type;
  4115. operand, tmpOperand, variableOp, variable2Op: Operand;
  4116. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4117. variable, variable2: SyntaxTree.Variable;
  4118. dim, i, size: LONGINT;
  4119. (* TODO: needed? *)
  4120. oldArrayDestinationTag: IntermediateCode.Operand;
  4121. oldArrayDestinationDimension: LONGINT;
  4122. position: Position;
  4123. saved: RegisterEntry;
  4124. arrayFlags: SET;
  4125. m, n: LONGINT;
  4126. PROCEDURE Pass(op: IntermediateCode.Operand);
  4127. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4128. BEGIN
  4129. IF numberRegister >= 0 THEN
  4130. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  4131. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4132. Emit(Mov(position,parameterRegister, op));
  4133. ELSE
  4134. Emit(Push(position,op))
  4135. END
  4136. END Pass;
  4137. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4138. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4139. BEGIN
  4140. formalType := formalType.resolved; actualType := actualType.resolved;
  4141. IF IsOpenArray(formalType)THEN
  4142. IF actualType IS SyntaxTree.StringType THEN
  4143. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4144. RETURN;
  4145. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4146. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4147. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4148. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4149. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4150. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4151. ELSE
  4152. tmp := baseReg;
  4153. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4154. IntermediateCode.MakeMemory(tmp,addressType);
  4155. Pass((tmp));
  4156. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4157. END;
  4158. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4159. END;
  4160. END PushArrayLens;
  4161. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4162. BEGIN
  4163. CASE size OF
  4164. |2: INCL(flags,Size2Flag);
  4165. |3: INCL(flags,Size3Flag);
  4166. |4: INCL(flags,Size4Flag);
  4167. |5: INCL(flags,Size5Flag);
  4168. |6: INCL(flags,Size6Flag);
  4169. |7: INCL(flags,Size7Flag);
  4170. |8: INCL(flags,Size8Flag);
  4171. END;
  4172. END SetSmallArraySizeFlag;
  4173. BEGIN
  4174. IF Trace THEN TraceEnter("PushParameter") END;
  4175. position := expression.position;
  4176. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4177. type := expression.type.resolved;
  4178. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4179. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4180. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4181. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4182. );
  4183. (* TODO: needed? *)
  4184. oldArrayDestinationTag := arrayDestinationTag;
  4185. oldArrayDestinationDimension := arrayDestinationDimension;
  4186. IF IsArrayOfSystemByte(parameter.type) THEN
  4187. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4188. Designate(expression,operand);
  4189. ELSE
  4190. Evaluate(expression, tmpOperand);
  4191. (* array of system byte does not provide any pointers *)
  4192. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4193. Symbol(variable, operand);
  4194. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4195. Emit(Mov(position,tmp, tmpOperand.op));
  4196. ReleaseOperand(tmpOperand);
  4197. END;
  4198. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4199. ReleaseIntermediateOperand(operand.tag);
  4200. operand.tag := tmp;
  4201. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4202. Pass((operand.tag));
  4203. END;
  4204. Pass((operand.op));
  4205. ELSIF IsOpenArray(parameter.type) THEN
  4206. Designate(expression,operand);
  4207. baseReg := operand.tag;
  4208. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4209. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4210. END;
  4211. Pass((operand.op)); (* address of the array *)
  4212. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4213. (* case 1
  4214. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4215. *)
  4216. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4217. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4218. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4219. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4220. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4221. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4222. arrayDestinationTag := sp;
  4223. (* case 1b
  4224. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4225. *)
  4226. IF expression IS SyntaxTree.IndexDesignator THEN
  4227. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4228. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4229. arrayDestinationDimension := dim;
  4230. Designate(expression,operand);
  4231. (* case 1a
  4232. P(...,A,...) push: push array descriptor to stack
  4233. *)
  4234. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4235. Designate(expression,operand);
  4236. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4237. i := 0;
  4238. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4239. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4240. INC(i);
  4241. END;
  4242. type := expression.type.resolved;
  4243. WHILE (i<dim) DO (* remaining static dimensions *)
  4244. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4245. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4246. ReleaseOperand(tmpOperand);
  4247. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4248. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4249. ReleaseOperand(tmpOperand);
  4250. INC(i);
  4251. END;
  4252. dimOp := IntermediateCode.Immediate(addressType,dim);
  4253. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4254. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4255. (* case 1d
  4256. P(...,T,...) push: process left arguments, create array descriptor with given number of dimensions from T on stack
  4257. + case 1e
  4258. P(.. PT() ... );
  4259. *)
  4260. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4261. Designate(expression,operand);
  4262. Dereference(operand,type.resolved,FALSE);
  4263. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4264. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4265. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4266. (* case 1f
  4267. P(...,S,...) push: create array descriptor to S on stack
  4268. case 1g
  4269. P(... PS()...)
  4270. *)
  4271. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4272. Designate(expression,operand);
  4273. FOR i := 0 TO dim-1 DO
  4274. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4275. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4276. ReleaseOperand(tmpOperand);
  4277. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4278. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4279. ReleaseOperand(tmpOperand);
  4280. END;
  4281. (*******
  4282. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4283. *)
  4284. arrayFlags := {StaticFlag};
  4285. IF dim = 1 THEN
  4286. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4287. ReleaseOperand(tmpOperand);
  4288. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4289. m := LONGINT(tmpOperand.op.intValue);
  4290. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4291. ELSIF dim = 2 THEN
  4292. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4293. ReleaseOperand(tmpOperand);
  4294. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4295. m := LONGINT(tmpOperand.op.intValue);
  4296. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4297. ReleaseOperand(tmpOperand);
  4298. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4299. n := LONGINT(tmpOperand.op.intValue);
  4300. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4301. INCL(arrayFlags,SmallMatrixFlag);
  4302. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4303. END;
  4304. END;
  4305. (*******)
  4306. dimOp := IntermediateCode.Immediate(addressType,dim);
  4307. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4308. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4309. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4310. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4311. baseType := SemanticChecker.ArrayBase(type,dim);
  4312. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4313. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4314. ELSE HALT(100);
  4315. END;
  4316. (* case 2
  4317. procedure P([left args], var A: array [*,*] of Type, [right args])
  4318. *)
  4319. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4320. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4321. (* case 2b
  4322. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4323. push: push reference to pushed array descriptor
  4324. post: remove array descriptor.
  4325. *)
  4326. IF expression IS SyntaxTree.IndexDesignator THEN
  4327. descriptorType := GetMathArrayDescriptorType(dim);
  4328. (* range type : no allocation possible, should be untraced *)
  4329. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4330. Symbol(variable,variableOp);
  4331. arrayDestinationTag := variableOp.op;
  4332. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4333. arrayDestinationDimension := dim;
  4334. NeedDescriptor := TRUE;
  4335. Designate(expression,operand);
  4336. Pass((operand.tag));
  4337. NeedDescriptor := FALSE;
  4338. (* case 2a
  4339. P(...,A,...)
  4340. push: push reference to array descriptor on stack
  4341. *)
  4342. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4343. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4344. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4345. INC(i);
  4346. END;
  4347. IF i = dim THEN
  4348. Designate(expression,operand);
  4349. Pass((operand.tag));
  4350. ELSE (* open-static *)
  4351. type := expression.type.resolved;
  4352. descriptorType := GetMathArrayDescriptorType(dim);
  4353. (* static array , cannot be reallocated, untraced !*)
  4354. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4355. Symbol(variable,variableOp);
  4356. arrayDestinationTag := variableOp.op;
  4357. Designate(expression,operand);
  4358. FOR i := 0 TO dim-1 DO
  4359. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4360. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4361. ReleaseOperand(tmpOperand);
  4362. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4363. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4364. ReleaseOperand(tmpOperand);
  4365. END;
  4366. dimOp := IntermediateCode.Immediate(addressType,dim);
  4367. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4368. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4369. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4370. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4371. baseType := SemanticChecker.ArrayBase(type,dim);
  4372. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4373. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4374. Pass((arrayDestinationTag));
  4375. END;
  4376. (* case 2d
  4377. P(...,T,...) push: emit dimension check, push T
  4378. *)
  4379. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4380. Designate(expression,operand);
  4381. Dereference(operand,type.resolved,FALSE);
  4382. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4383. Pass((operand.tag));
  4384. (* case 2f
  4385. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4386. push: push reference to pushed array descriptor
  4387. post: remove array descriptor
  4388. *)
  4389. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4390. descriptorType := GetMathArrayDescriptorType(dim);
  4391. (* static array -- cannot be reallocatated, untraced *)
  4392. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4393. Symbol(variable,variableOp);
  4394. arrayDestinationTag := variableOp.op;
  4395. Designate(expression,operand);
  4396. FOR i := 0 TO dim-1 DO
  4397. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4398. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4399. ReleaseOperand(tmpOperand);
  4400. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4401. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4402. ReleaseOperand(tmpOperand);
  4403. END;
  4404. (*
  4405. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4406. *)
  4407. arrayFlags := {StaticFlag};
  4408. IF dim = 1 THEN
  4409. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4410. ReleaseOperand(tmpOperand);
  4411. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4412. m := LONGINT(tmpOperand.op.intValue);
  4413. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4414. ELSIF dim = 2 THEN
  4415. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4416. ReleaseOperand(tmpOperand);
  4417. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4418. m := LONGINT(tmpOperand.op.intValue);
  4419. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4420. ReleaseOperand(tmpOperand);
  4421. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4422. n := LONGINT(tmpOperand.op.intValue);
  4423. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4424. INCL(arrayFlags,SmallMatrixFlag);
  4425. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4426. END;
  4427. END;
  4428. (*******)
  4429. dimOp := IntermediateCode.Immediate(addressType,dim);
  4430. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4431. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4432. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4433. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4434. baseType := SemanticChecker.ArrayBase(type,dim);
  4435. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4436. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4437. Pass((arrayDestinationTag));
  4438. ELSE HALT(100);
  4439. END;
  4440. (* case 3
  4441. procedure P([left args], [const] A: array [?] of Type, [right args])
  4442. *)
  4443. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4444. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4445. (* case 3b
  4446. P(...,A[a..b,c..d],...)
  4447. *)
  4448. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4449. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4450. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4451. Symbol(variable,variableOp);
  4452. LoadValue(variableOp,system.addressType);
  4453. ELSE
  4454. descriptorType := GetMathArrayDescriptorType(dim);
  4455. (* range -- cannot be reallocated *)
  4456. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4457. Symbol(variable,variableOp);
  4458. END;
  4459. arrayDestinationTag := variableOp.op;
  4460. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4461. arrayDestinationDimension := 0;
  4462. Designate(expression,operand);
  4463. Pass((operand.tag));
  4464. (* case 3a
  4465. P(...,A,...)
  4466. *)
  4467. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4468. i := 0;
  4469. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4470. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4471. INC(i);
  4472. END;
  4473. IF i = dim THEN
  4474. Designate(expression,operand);
  4475. Pass((operand.tag));
  4476. ELSE (* open-static *)
  4477. type := expression.type.resolved;
  4478. descriptorType := GetMathArrayDescriptorType(dim);
  4479. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4480. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4481. Symbol(variable,variableOp);
  4482. arrayDestinationTag := variableOp.op;
  4483. Designate(expression,operand);
  4484. FOR i := 0 TO dim-1 DO
  4485. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4486. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4487. ReleaseOperand(tmpOperand);
  4488. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4489. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4490. ReleaseOperand(tmpOperand);
  4491. END;
  4492. dimOp := IntermediateCode.Immediate(addressType,dim);
  4493. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4494. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4495. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4496. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4497. baseType := SemanticChecker.ArrayBase(type,dim);
  4498. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4499. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4500. Pass((arrayDestinationTag));
  4501. END;
  4502. (* case 3d
  4503. P(...,T,...)
  4504. case 3e
  4505. P(...,PT(...),...)
  4506. *)
  4507. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4508. Designate(expression,operand);
  4509. Dereference(operand,type.resolved,FALSE);
  4510. Pass((operand.tag));
  4511. (* case 3f
  4512. P(...,S,...)
  4513. case 3g
  4514. P(...,PS(...),...)
  4515. *)
  4516. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4517. descriptorType := GetMathArrayDescriptorType(dim);
  4518. (* static array does not need to be traced *)
  4519. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4520. Symbol(variable,variableOp);
  4521. arrayDestinationTag := variableOp.op;
  4522. Designate(expression,operand);
  4523. IF operand.op.type.length >1 THEN (* vector register *)
  4524. (* static array does not need to be traced *)
  4525. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4526. Symbol(variable2, variable2Op);
  4527. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4528. Emit(Mov(position,tmp, operand.op));
  4529. ReleaseOperand(operand);
  4530. Symbol(variable2, operand);
  4531. END;
  4532. FOR i := 0 TO dim-1 DO
  4533. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4534. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4535. ReleaseOperand(tmpOperand);
  4536. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4537. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4538. ReleaseOperand(tmpOperand);
  4539. END;
  4540. dimOp := IntermediateCode.Immediate(addressType,dim);
  4541. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4542. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4543. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4544. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4545. baseType := SemanticChecker.ArrayBase(type,dim);
  4546. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4547. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4548. Pass((arrayDestinationTag));
  4549. ELSE HALT(100);
  4550. END;
  4551. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4552. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4553. (* case 4b
  4554. P(...,A[a..b,c..d],...)
  4555. *)
  4556. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4557. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4558. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4559. Symbol(variable,variableOp);
  4560. LoadValue(variableOp,system.addressType);
  4561. ELSE
  4562. descriptorType := GetMathArrayDescriptorType(dim);
  4563. (* range array -- cannot be allocated *)
  4564. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4565. Symbol(variable,variableOp);
  4566. END;
  4567. arrayDestinationTag := variableOp.op;
  4568. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4569. arrayDestinationDimension := 0;
  4570. Designate(expression,operand);
  4571. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4572. Symbol(variable,variableOp);
  4573. ELSE
  4574. (* alias to range -- untraced *)
  4575. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4576. Symbol(variable,variableOp);
  4577. MakeMemory(tmp,variableOp.op,addressType,0);
  4578. Emit(Mov(position,tmp,operand.tag));
  4579. ReleaseIntermediateOperand(tmp);
  4580. END;
  4581. Pass((variableOp.op));
  4582. ReleaseOperand(variableOp);
  4583. (* case 4a
  4584. P(...,A,...)
  4585. *)
  4586. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4587. i := 0;
  4588. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4589. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4590. INC(i);
  4591. END;
  4592. IF i = dim THEN
  4593. Designate(expression,operand);
  4594. arrayDestinationTag := operand.tag;
  4595. ELSE (* open-static *)
  4596. type := expression.type.resolved;
  4597. descriptorType := GetMathArrayDescriptorType(dim);
  4598. (* static array -- untraced *)
  4599. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4600. Symbol(variable,variableOp);
  4601. arrayDestinationTag := variableOp.op;
  4602. Designate(expression,operand);
  4603. FOR i := 0 TO dim-1 DO
  4604. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4605. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4606. ReleaseOperand(tmpOperand);
  4607. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4608. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4609. ReleaseOperand(tmpOperand);
  4610. END;
  4611. dimOp := IntermediateCode.Immediate(addressType,dim);
  4612. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4613. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4614. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4615. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4616. baseType := SemanticChecker.ArrayBase(type,dim);
  4617. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4618. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4619. END;
  4620. (* tensor alias to open array -- untraced *)
  4621. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4622. Symbol(variable,variableOp);
  4623. MakeMemory(tmp,variableOp.op,addressType,0);
  4624. Emit(Mov(position,tmp,arrayDestinationTag));
  4625. ReleaseIntermediateOperand(tmp);
  4626. Pass((variableOp.op));
  4627. ReleaseOperand(variableOp);
  4628. (* case 4d
  4629. P(...,T,...)
  4630. *)
  4631. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4632. Designate(expression,operand);
  4633. Pass((operand.op));
  4634. (* case 4f
  4635. P(...,S,...)
  4636. *)
  4637. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4638. descriptorType := GetMathArrayDescriptorType(dim);
  4639. (* static array -- cannot be reallocated, untraced *)
  4640. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4641. Symbol(variable,variableOp);
  4642. arrayDestinationTag := variableOp.op;
  4643. Designate(expression,operand);
  4644. FOR i := 0 TO dim-1 DO
  4645. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4646. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4647. ReleaseOperand(tmpOperand);
  4648. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4649. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4650. ReleaseOperand(tmpOperand);
  4651. END;
  4652. dimOp := IntermediateCode.Immediate(addressType,dim);
  4653. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4654. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4655. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4656. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4657. baseType := SemanticChecker.ArrayBase(type,dim);
  4658. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4659. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4660. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4661. Symbol(variable,variableOp);
  4662. MakeMemory(tmp,variableOp.op,addressType,0);
  4663. Emit(Mov(position,tmp,arrayDestinationTag));
  4664. ReleaseIntermediateOperand(tmp);
  4665. Pass((variableOp.op));
  4666. ReleaseOperand(variableOp);
  4667. ELSE HALT(100);
  4668. END;
  4669. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4670. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4671. Designate(expression,operand);
  4672. IF operand.op.type.length > 1 THEN
  4673. Emit(Push(position, operand.op));
  4674. ELSE
  4675. size := system.SizeOf(type);
  4676. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4677. size := ToMemoryUnits(system,size);
  4678. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4679. arrayDestinationTag := sp;
  4680. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4681. END;
  4682. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4683. Designate(expression,operand);
  4684. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4685. (* static array no pointer *)
  4686. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4687. Symbol(variable,variableOp);
  4688. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4689. Emit(Mov(position,tmp,operand.op));
  4690. Emit(Push(position,variableOp.op));
  4691. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4692. Pass((operand.op));
  4693. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4694. END;
  4695. ELSE HALT(200)
  4696. END;
  4697. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4698. IF parameter.kind = SyntaxTree.VarParameter THEN
  4699. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4700. Designate(expression, operand);
  4701. Pass((operand.op));
  4702. ELSE
  4703. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4704. Evaluate(expression, operand);
  4705. Pass((operand.extra)); (* step *)
  4706. Pass((operand.tag)); (* last *)
  4707. Pass((operand.op)) (* first *)
  4708. END
  4709. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4710. IF parameter.kind = SyntaxTree.VarParameter THEN
  4711. Designate(expression, operand);
  4712. Pass((operand.op));
  4713. ELSE
  4714. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4715. Evaluate(expression, operand);
  4716. Pass((operand.tag)); (* real part *)
  4717. Pass((operand.op)) (* imaginary part *)
  4718. END
  4719. ELSE
  4720. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4721. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4722. Designate(expression,operand);
  4723. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4724. (* stack allocation *)
  4725. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4726. (*! parameter alignment to be discussed ... *)
  4727. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4728. size := type(SyntaxTree.StringType).length;
  4729. END;
  4730. IF backend.cooperative & parameter.NeedsTrace() THEN
  4731. dst := NewRegisterOperand (addressType);
  4732. Emit(Mov(position,dst, sp));
  4733. IntermediateCode.InitImmediate(null, byteType, 0);
  4734. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4735. ReleaseIntermediateOperand(dst);
  4736. SaveRegisters();ReleaseUsedRegisters(saved);
  4737. (* register dst has been freed before SaveRegisters already *)
  4738. CallAssignMethod(dst, operand.op, parameter.type);
  4739. RestoreRegisters(saved);
  4740. END;
  4741. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4742. ELSIF IsOpenArray(parameter.type) THEN
  4743. Designate(expression,operand);
  4744. baseReg := operand.tag;
  4745. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4746. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4747. END;
  4748. Pass((operand.op)); (* address of the array *)
  4749. ELSIF IsDelegate(parameter.type) THEN
  4750. Evaluate(expression,operand);
  4751. IF backend.cooperative & parameter.NeedsTrace() THEN
  4752. Emit(Push(position, nil));
  4753. dst := NewRegisterOperand (addressType);
  4754. Emit(Mov(position,dst, sp));
  4755. ReleaseIntermediateOperand(dst);
  4756. SaveRegisters();ReleaseUsedRegisters(saved);
  4757. Emit(Push(position, dst));
  4758. (* register dst has been freed before SaveRegisters already *)
  4759. Emit(Push(position, operand.tag));
  4760. CallThis(position,"GarbageCollector","Assign",2);
  4761. RestoreRegisters(saved);
  4762. ELSE
  4763. Pass((operand.tag));
  4764. END;
  4765. Pass((operand.op));
  4766. ELSE
  4767. Evaluate(expression,operand);
  4768. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4769. Emit(Push(position, nil));
  4770. dst := NewRegisterOperand (addressType);
  4771. Emit(Mov(position,dst, sp));
  4772. ReleaseIntermediateOperand(dst);
  4773. SaveRegisters();ReleaseUsedRegisters(saved);
  4774. Emit(Push(position, dst));
  4775. (* register dst has been freed before SaveRegisters already *)
  4776. Emit(Push(position, operand.op));
  4777. CallThis(position,"GarbageCollector","Assign",2);
  4778. RestoreRegisters(saved);
  4779. ELSE
  4780. Pass((operand.op));
  4781. END;
  4782. END;
  4783. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4784. Evaluate(expression,operand);
  4785. Pass((operand.op));
  4786. ELSE (* var parameter *)
  4787. Designate(expression,operand);
  4788. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4789. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4790. Pass((operand.tag));
  4791. END;
  4792. END;
  4793. Pass((operand.op));
  4794. END;
  4795. END;
  4796. (* TODO: needed? *)
  4797. arrayDestinationTag := oldArrayDestinationTag;
  4798. arrayDestinationDimension := oldArrayDestinationDimension;
  4799. IF needsParameterBackup THEN
  4800. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4801. ReuseCopy(parameterBackup, operand.op)
  4802. END;
  4803. ReleaseOperand(operand);
  4804. IF Trace THEN TraceExit("PushParameter") END;
  4805. END PushParameter;
  4806. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4807. VAR prevConditional: BOOLEAN;
  4808. BEGIN
  4809. prevConditional := conditional;
  4810. conditional := FALSE;
  4811. 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
  4812. Expression(x.result); (* use register *)
  4813. END;
  4814. Statement(x.statement);
  4815. conditional := prevConditional;
  4816. IF x.result # NIL THEN Expression(x.result) END;
  4817. 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
  4818. ReleaseIntermediateOperand(result.op);
  4819. END;
  4820. END VisitStatementDesignator;
  4821. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4822. VAR
  4823. procedure: SyntaxTree.Procedure;
  4824. procedureType: SyntaxTree.ProcedureType;
  4825. wasInline: BOOLEAN;
  4826. actualParameters: SyntaxTree.ExpressionList;
  4827. formalParameter: SyntaxTree.Parameter;
  4828. actualParameter: SyntaxTree.Expression;
  4829. i: LONGINT;
  4830. localVariable: SyntaxTree.Variable;
  4831. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4832. src, dest: Operand;
  4833. prevInlineExit : Label;
  4834. prevMapper: SymbolMapper;
  4835. tooComplex: BOOLEAN;
  4836. resultDesignator: SyntaxTree.Expression;
  4837. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4838. BEGIN
  4839. IF e = NIL THEN RETURN TRUE
  4840. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4841. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4842. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4843. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4844. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4845. ELSE RETURN FALSE
  4846. END;
  4847. END SimpleExpression;
  4848. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4849. BEGIN
  4850. RETURN checker.CanPassInRegister(type)
  4851. END FitsInRegister;
  4852. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4853. VAR
  4854. variable: SyntaxTree.Variable;
  4855. variableDesignator: SyntaxTree.Designator;
  4856. BEGIN
  4857. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  4858. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  4859. variableDesignator.SetType(type);
  4860. RETURN variableDesignator
  4861. END GetTemp;
  4862. BEGIN
  4863. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4864. wasInline := currentIsInline;
  4865. prevInlineExit := currentInlineExit;
  4866. prevMapper := currentMapper;
  4867. currentInlineExit := NewLabel();
  4868. tooComplex := FALSE;
  4869. NEW(currentMapper);
  4870. currentIsInline := TRUE;
  4871. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4872. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4873. formalParameter := procedureType.firstParameter;
  4874. actualParameters := x.parameters;
  4875. i := 0;
  4876. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4877. actualParameter := actualParameters.GetExpression(i);
  4878. IF actualParameter.resolved # NIL THEN
  4879. actualParameter := actualParameter.resolved
  4880. END;
  4881. (*
  4882. if expression is simple and can be passed immediately
  4883. or if type fits in register then we can proceed
  4884. otherwise we escape to ordinary procedure call.
  4885. *)
  4886. (* cases where the expression can be mapped identically *)
  4887. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4888. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  4889. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4890. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4891. (*
  4892. Assign(variableDesignator, actualParameter);
  4893. *)
  4894. Evaluate(actualParameter, src);
  4895. Designate(variableDesignator, dest);
  4896. Emit(Mov(x.position, dest.op, src.op));
  4897. ReleaseOperand(dest);
  4898. ReleaseOperand(src);
  4899. (* the src operand should now have been completely released ! *)
  4900. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  4901. ELSE tooComplex := TRUE
  4902. END;
  4903. (*
  4904. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4905. currentMapper.Add(formalParameter, actualParameter, NIL);
  4906. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4907. variableDesignator := GetTemp(system.addressType, FALSE);
  4908. Designate(actualParameter, src);
  4909. Designate(variableDesignator, dest);
  4910. IntermediateCode.MakeMemory(dest.op,addressType);
  4911. Emit(Mov(x.position, dest.op, src.op));
  4912. ReleaseOperand(dest);
  4913. IF src.tag.mode # IntermediateCode.Undefined THEN
  4914. tagDesignator := GetTemp(system.addressType, FALSE);
  4915. Designate(tagDesignator, dest);
  4916. IntermediateCode.MakeMemory(dest.op,addressType);
  4917. Emit(Mov(x.position, dest.op, src.op));
  4918. END;
  4919. ReleaseOperand(dest); ReleaseOperand(src);
  4920. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4921. END;
  4922. *)
  4923. formalParameter := formalParameter.nextParameter;
  4924. INC(i);
  4925. END;
  4926. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4927. IF resultDesignator # NIL THEN
  4928. returnDesignator := resultDesignator
  4929. ELSE
  4930. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4931. END;
  4932. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  4933. END;
  4934. localVariable := procedure.procedureScope.firstVariable;
  4935. WHILE ~tooComplex & (localVariable # NIL) DO
  4936. variableDesignator := GetTemp(localVariable.type, FALSE);
  4937. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  4938. localVariable := localVariable.nextVariable;
  4939. END;
  4940. IF ~tooComplex THEN
  4941. VisitStatementBlock(procedure.procedureScope.body);
  4942. SetLabel(currentInlineExit);
  4943. IF procedureType.returnType # NIL THEN
  4944. Designate(returnDesignator, result);
  4945. IF conditional THEN
  4946. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4947. ValueToCondition(result)
  4948. END;
  4949. END;
  4950. END;
  4951. currentMapper := prevMapper;
  4952. currentInlineExit := prevInlineExit;
  4953. currentIsInline := wasInline;
  4954. RETURN ~tooComplex
  4955. END InlineProcedureCall;
  4956. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4957. VAR
  4958. parameters: SyntaxTree.ExpressionList;
  4959. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4960. designator: SyntaxTree.Designator;
  4961. procedureType: SyntaxTree.ProcedureType;
  4962. formalParameter: SyntaxTree.Parameter;
  4963. operand, returnValue: Operand;
  4964. reg, size, mask, dest: IntermediateCode.Operand;
  4965. saved,saved2: RegisterEntry;
  4966. symbol: SyntaxTree.Symbol;
  4967. variable: SyntaxTree.Variable;
  4968. i, parametersSize, returnTypeSize : LONGINT;
  4969. structuredReturnType: BOOLEAN;
  4970. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4971. tempVariableDesignator: SyntaxTree.Designator;
  4972. gap, alignment: LONGINT; (*fld*)
  4973. (* TODO: remove unnecessary backup variables *)
  4974. oldResult: Operand;
  4975. oldCurrentScope: SyntaxTree.Scope;
  4976. oldArrayDestinationTag: IntermediateCode.Operand;
  4977. oldArrayDestinationDimension: LONGINT;
  4978. oldConstantDeclaration: SyntaxTree.Symbol;
  4979. oldDestination: IntermediateCode.Operand;
  4980. oldCurrentLoop: Label;
  4981. oldConditional: BOOLEAN;
  4982. oldTrueLabel, oldFalseLabel: Label;
  4983. oldLocked: BOOLEAN;
  4984. usedRegisters,oldUsedRegisters: RegisterEntry;
  4985. return: IntermediateCode.Operand;
  4986. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4987. arg: IntermediateCode.Operand;
  4988. dummy: IntermediateCode.Operand;
  4989. recordType: SyntaxTree.RecordType;
  4990. operatorSelectionProcedureOperand: Operand;
  4991. operatorSelectionProcedure: SyntaxTree.Procedure;
  4992. fingerPrint: SyntaxTree.FingerPrint;
  4993. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4994. identifierNumber: LONGINT;
  4995. parameterRegister: Backend.Registers;
  4996. parameterRegisters: LONGINT;
  4997. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4998. procedure: SyntaxTree.Procedure;
  4999. PROCEDURE BackupGlobalState;
  5000. BEGIN
  5001. oldResult := result;
  5002. oldCurrentScope := currentScope;
  5003. oldArrayDestinationTag := arrayDestinationTag;
  5004. oldArrayDestinationDimension := arrayDestinationDimension;
  5005. oldConstantDeclaration := constantDeclaration;
  5006. oldDestination := destination;
  5007. oldCurrentLoop := currentLoop;
  5008. oldConditional := conditional;
  5009. oldTrueLabel := trueLabel;
  5010. oldFalseLabel := falseLabel;
  5011. oldLocked := locked;
  5012. oldUsedRegisters := usedRegisters
  5013. END BackupGlobalState;
  5014. PROCEDURE RestoreGlobalState;
  5015. BEGIN
  5016. result := oldResult;
  5017. currentScope := oldCurrentScope;
  5018. arrayDestinationTag := oldArrayDestinationTag;
  5019. arrayDestinationDimension := oldArrayDestinationDimension;
  5020. constantDeclaration := oldConstantDeclaration;
  5021. destination := oldDestination;
  5022. currentLoop := oldCurrentLoop;
  5023. conditional := oldConditional;
  5024. trueLabel := oldTrueLabel;
  5025. falseLabel := oldFalseLabel;
  5026. locked := oldLocked;
  5027. usedRegisters := oldUsedRegisters
  5028. END RestoreGlobalState;
  5029. (** do preparations before parameter push for array-structured object types (ASOTs):
  5030. if ASOT is passed as VAR parameter:
  5031. - allocate temporary variable of math array type
  5032. - copy contents of ASOT to be passed to temporary variable
  5033. - use temporary variable as the actual parameter instead
  5034. - 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)
  5035. **)
  5036. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5037. VAR
  5038. expression: SyntaxTree.Expression;
  5039. BEGIN
  5040. IF actualParameter IS SyntaxTree.Designator THEN
  5041. designator := actualParameter(SyntaxTree.Designator);
  5042. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5043. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5044. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5045. ASSERT(checker # NIL);
  5046. checker.SetCurrentScope(currentScope);
  5047. (* allocate temporary variable *)
  5048. ASSERT(actualParameter.type # NIL);
  5049. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5050. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5051. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5052. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5053. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5054. ASSERT(tempVariableDesignator.type # NIL);
  5055. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5056. (* copy math array stored in actual parameter to temporary variable *)
  5057. BackupGlobalState;
  5058. AssignMathArray(tempVariableDesignator, actualParameter);
  5059. RestoreGlobalState;
  5060. (* use temporary variable as actual parameter instead of the original one *)
  5061. actualParameter := tempVariableDesignator;
  5062. (* create write-back call and store it in linked list *)
  5063. (* create new list entry *)
  5064. IF firstWriteBackCall = NIL THEN
  5065. NEW(firstWriteBackCall);
  5066. currentWriteBackCall := firstWriteBackCall
  5067. ELSE
  5068. ASSERT(currentWriteBackCall # NIL);
  5069. NEW(currentWriteBackCall.next);
  5070. currentWriteBackCall := currentWriteBackCall.next
  5071. END;
  5072. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5073. ASSERT(expression.type = NIL);
  5074. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5075. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5076. (* prepare writeback for any other "normal" indexer *)
  5077. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5078. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5079. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5080. Assign(tempVariableDesignator, actualParameter);
  5081. actualParameter := tempVariableDesignator;
  5082. IF firstWriteBackCall = NIL THEN
  5083. NEW(firstWriteBackCall);
  5084. currentWriteBackCall := firstWriteBackCall
  5085. ELSE
  5086. ASSERT(currentWriteBackCall # NIL);
  5087. NEW(currentWriteBackCall.next);
  5088. currentWriteBackCall := currentWriteBackCall.next
  5089. END;
  5090. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5091. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5092. END
  5093. END
  5094. END PrepareParameter;
  5095. BEGIN
  5096. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5097. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5098. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5099. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5100. IF InlineProcedureCall(x) THEN
  5101. RETURN
  5102. ELSE
  5103. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5104. END
  5105. END;
  5106. END;
  5107. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5108. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5109. dest := destination; destination := emptyOperand;
  5110. SaveRegisters();ReleaseUsedRegisters(saved);
  5111. parameters := x.parameters;
  5112. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5113. (* an operator is called *)
  5114. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5115. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  5116. (* check if a dynamic operator call should be performed *)
  5117. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5118. ELSE
  5119. isCallOfDynamicOperator := FALSE
  5120. END;
  5121. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5122. Emit(Push(position, ap));
  5123. END;
  5124. alignment := procedureType.stackAlignment;
  5125. IF alignment > 1 THEN
  5126. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5127. Emit(Mov(position,reg, sp));
  5128. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  5129. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5130. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5131. Emit(And(position,sp, sp, mask));
  5132. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5133. Emit(Push(position,reg));
  5134. (*
  5135. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  5136. Emit(Mov(position,mem,reg));
  5137. *)
  5138. ReleaseIntermediateOperand(reg);
  5139. END;
  5140. IF SysvABI(procedureType.callingConvention) & (system.addressSize = 32) THEN
  5141. (* align stack to 16-byte boundary *)
  5142. IntermediateCode.InitImmediate(mask,addressType,-16);
  5143. Emit(And(position,sp, sp, mask));
  5144. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5145. IF gap # 0 THEN
  5146. IntermediateCode.InitImmediate(size,addressType,gap);
  5147. Emit(Sub(position,sp,sp,size))
  5148. END;
  5149. END;
  5150. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5151. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5152. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5153. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5154. ELSE
  5155. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5156. END;
  5157. Evaluate(x.left, operand);
  5158. IF symbol IS SyntaxTree.Procedure THEN
  5159. IF (procedureType.selfParameter # NIL) THEN
  5160. Emit(Push(position,operand.tag));
  5161. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5162. Emit(Push(position,operand.tag));
  5163. ELSIF (procedureType.isDelegate) THEN
  5164. Emit(Push(position,operand.tag));
  5165. END;
  5166. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5167. IF (procedureType.selfParameter # NIL) THEN
  5168. Emit(Push(position,operand.tag));
  5169. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5170. Emit(Push(position,operand.tag));
  5171. END;
  5172. ELSE HALT(200);
  5173. END;
  5174. ReleaseIntermediateOperand(operand.tag);
  5175. operand.tag := emptyOperand;
  5176. (* determine if a structured return type is needed *)
  5177. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5178. IF structuredReturnType THEN
  5179. IF resultDesignator # NIL THEN
  5180. d := resultDesignator;
  5181. ELSE
  5182. (* temporary result that might be allocated, must potentially be traced *)
  5183. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5184. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5185. d.SetType(variable.type);
  5186. END;
  5187. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5188. Designate(d,returnValue);
  5189. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5190. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5191. Emit(Push(position,size));
  5192. Emit(Push(position,returnValue.op));
  5193. ReleaseOperand(returnValue);
  5194. ELSE*)
  5195. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5196. (*
  5197. END;
  5198. *)
  5199. END;
  5200. firstWriteBackCall := NIL; (* reset write-back call list *)
  5201. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5202. parameterRegister := backend.GetParameterRegisters(procedureType.callingConvention);
  5203. IF parameterRegister = NIL THEN parameterRegisters := 0
  5204. ELSE parameterRegisters := LEN(parameterRegister)
  5205. END;
  5206. passByRegister := parameterRegisters > 0;
  5207. registerNumber := 0;
  5208. formalParameter := procedureType.lastParameter;
  5209. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5210. actualParameter := parameters.GetExpression(i);
  5211. PrepareParameter(actualParameter, formalParameter);
  5212. IF passByRegister & (i < parameterRegisters) THEN
  5213. IF ~PassInRegister(formalParameter) THEN
  5214. Error(actualParameter.position,"cannot be passed by register")
  5215. ELSE
  5216. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,parameterRegister[i]);
  5217. END;
  5218. INC(registerNumber);
  5219. ELSE
  5220. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5221. END;
  5222. formalParameter := formalParameter.prevParameter;
  5223. END;
  5224. IF passByRegister & (registerNumber > 0) & ~SysvABI(procedureType.callingConvention) THEN
  5225. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5226. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5227. END;
  5228. ELSE
  5229. hasDynamicOperands := FALSE;
  5230. formalParameter := procedureType.firstParameter;
  5231. FOR i := 0 TO parameters.Length() - 1 DO
  5232. actualParameter := parameters.GetExpression(i);
  5233. IF formalParameter # NIL THEN (* TENTATIVE *)
  5234. PrepareParameter(actualParameter, formalParameter);
  5235. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5236. ASSERT(i < 2);
  5237. hasDynamicOperands := TRUE;
  5238. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5239. ELSE
  5240. IF passByRegister & (registerNumber > 0) THEN
  5241. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5242. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5243. END;
  5244. passByRegister := FALSE;
  5245. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5246. END;
  5247. formalParameter := formalParameter.nextParameter;
  5248. END;
  5249. END;
  5250. END;
  5251. IF symbol IS SyntaxTree.Procedure THEN
  5252. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5253. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5254. Emit(Push(position,reg));
  5255. ReleaseIntermediateOperand(reg);
  5256. END;
  5257. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5258. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5259. parametersSize := ParametersSize(system,procedureType,FALSE);
  5260. END;
  5261. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5262. (*
  5263. dynamic operator overloading:
  5264. first push parameters, regularly:
  5265. [self]
  5266. par1
  5267. par2
  5268. then push parameters for GetOperator
  5269. identifier
  5270. ptr1
  5271. tag
  5272. ptr2
  5273. tag
  5274. call GetOperatorRuntimeProc
  5275. call Operator
  5276. *)
  5277. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5278. (* push ID *)
  5279. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5280. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5281. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5282. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5283. formalParameter := procedureType.firstParameter;
  5284. FOR i := 0 TO parameters.Length() - 1 DO
  5285. IF formalParameter.access # SyntaxTree.Hidden THEN
  5286. ASSERT(i < 2);
  5287. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5288. (* push pointer *)
  5289. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5290. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5291. (* add dereference *)
  5292. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5293. (*! better: do refer to stack above than using parameter backups !!*)
  5294. ReleaseIntermediateOperand(parameterBackups[i]);
  5295. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5296. END;
  5297. Emit(Push(position,parameterBackups[i]));
  5298. ReleaseIntermediateOperand(parameterBackups[i]);
  5299. (* push typetag *)
  5300. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5301. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5302. arg := TypeDescriptorAdr(recordType);
  5303. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5304. Emit(Push(position,arg));
  5305. ELSE
  5306. (* push 'NonPointer' *)
  5307. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5308. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5309. (* push fingerprint *)
  5310. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5311. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5312. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5313. END
  5314. END;
  5315. formalParameter := formalParameter.nextParameter
  5316. END;
  5317. (* for unary operators: complete the information for the second parameter *)
  5318. IF procedureType.numberParameters < 2 THEN
  5319. (* push 'NonPointer' *)
  5320. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5321. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5322. (* push 'NoType' *)
  5323. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5324. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5325. END;
  5326. (* call operator selection procedure *)
  5327. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5328. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5329. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5330. ReleaseOperand(operatorSelectionProcedureOperand);
  5331. (* use the address that the operator selection procedure returned as the target address of the call *)
  5332. InitOperand(operand, ModeValue);
  5333. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5334. Emit(Result(position,operand.op))
  5335. END
  5336. END;
  5337. ReleaseParameterRegisters();
  5338. IF backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5339. SaveRegisters();ReleaseUsedRegisters(saved2);
  5340. CallThis(position,"Objects","LeaveA2",0);
  5341. RestoreRegisters(saved2);
  5342. END;
  5343. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR SysvABI(procedureType.callingConvention) THEN
  5344. Emit(Call(position,operand.op,0));
  5345. ELSE
  5346. Emit(Call(position,operand.op,parametersSize));
  5347. END;
  5348. ReleaseOperand(operand);
  5349. IF procedureType.noReturn THEN
  5350. EmitTrap(position,NoReturnTrap);
  5351. END;
  5352. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5353. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5354. Emit(Result(position,return));
  5355. END;
  5356. IF backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5357. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5358. Emit(Push(position, return));
  5359. CallThis(position,"Objects","ReenterA2",0);
  5360. Emit(Pop(position, return));
  5361. ELSE
  5362. CallThis(position,"Objects","ReenterA2",0);
  5363. END;
  5364. END;
  5365. (* === return parameter space === *)
  5366. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister THEN
  5367. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5368. IF parametersSize < 32 THEN
  5369. (* allocated space for all parameter registers *)
  5370. parametersSize := 32
  5371. END;
  5372. size := IntermediateCode.Immediate(addressType,parametersSize);
  5373. Emit(Add(position,sp,sp,size))
  5374. END;
  5375. IF SysvABI(procedureType.callingConvention) THEN
  5376. IF passByRegister THEN
  5377. IF parameters.Length() > parameterRegisters THEN
  5378. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5379. ELSE
  5380. parametersSize := 0
  5381. END;
  5382. ELSE
  5383. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5384. INC( parametersSize, (-parametersSize) MOD 16 )
  5385. END;
  5386. IF parametersSize > 0 THEN
  5387. size := IntermediateCode.Immediate(addressType,parametersSize);
  5388. Emit(Add(position,sp,sp,size))
  5389. END;
  5390. END;
  5391. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5392. IF structuredReturnType THEN
  5393. (* stack pointer rewinding done by callee
  5394. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5395. Emit(Add(position,sp,sp,size));
  5396. *)
  5397. RestoreRegisters(saved);
  5398. InitOperand(result,ModeReference);
  5399. Symbol(variable,result);
  5400. ELSE
  5401. RestoreRegisters(saved);
  5402. InitOperand(result,ModeValue);
  5403. result.op := return;
  5404. END;
  5405. END;
  5406. IF alignment > 1 THEN
  5407. Emit(Pop(position,sp));
  5408. END;
  5409. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5410. Emit(Pop(position, ap));
  5411. END;
  5412. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5413. ValueToCondition(result);
  5414. END;
  5415. destination := dest;
  5416. (* perform all write-back calls in the list *)
  5417. BackupGlobalState;
  5418. currentWriteBackCall := firstWriteBackCall;
  5419. WHILE currentWriteBackCall # NIL DO
  5420. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5421. currentWriteBackCall := currentWriteBackCall.next
  5422. END;
  5423. RestoreGlobalState;
  5424. (* TENATIVE *)
  5425. (*
  5426. IF isOperatorCall THEN
  5427. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5428. END;
  5429. *)
  5430. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5431. END VisitProcedureCallDesignator;
  5432. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5433. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5434. td: SyntaxTree.Symbol;
  5435. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5436. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5437. BEGIN
  5438. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5439. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5440. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5441. variable.SetType(system.anyType);
  5442. scope.AddVariable(variable);
  5443. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5444. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5445. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5446. typeDeclaration.SetScope(module.module.moduleScope);
  5447. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5448. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5449. END;
  5450. RETURN hiddenPointerType;
  5451. END GetHiddenPointerType;
  5452. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5453. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5454. BEGIN
  5455. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5456. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5457. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5458. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5459. scope.AddVariable(variable);
  5460. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5461. variable.SetType(system.anyType);
  5462. scope.AddVariable(variable);
  5463. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5464. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5465. typeDeclaration.SetDeclaredType(delegatePointerType);
  5466. typeDeclaration.SetScope(module.module.moduleScope);
  5467. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5468. delegatePointerType.SetState(SyntaxTree.Resolved);
  5469. END;
  5470. RETURN delegatePointerType
  5471. END GetDelegateType;
  5472. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5473. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5474. such as in VAR a: RECORD ... END;
  5475. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5476. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5477. *)
  5478. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5479. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5480. BEGIN (* no code emission *)
  5481. source := NIL;
  5482. x := x.resolved;
  5483. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5484. x := GetHiddenPointerType();
  5485. ELSIF IsDelegate(x) THEN
  5486. x := GetDelegateType();
  5487. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5488. ELSE HALT(200);
  5489. END;
  5490. td := x.typeDeclaration;
  5491. IF td = NIL THEN
  5492. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5493. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5494. ASSERT(td # NIL);
  5495. END;
  5496. IF newObjectFile THEN
  5497. GetCodeSectionNameForSymbol(td,name);
  5498. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5499. meta.CheckTypeDeclaration(x);
  5500. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5501. ELSE
  5502. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5503. END;
  5504. IF backend.cooperative OR meta.simple THEN
  5505. offset := 0;
  5506. ELSE
  5507. IF x IS SyntaxTree.CellType THEN
  5508. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5509. IF baseRecord = NIL THEN
  5510. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5511. ELSE
  5512. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5513. END;
  5514. ELSE
  5515. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5516. END;
  5517. END;
  5518. ELSE
  5519. offset := 0;
  5520. source := module.allSections.FindBySymbol(td); (*TODO*)
  5521. IF source = NIL THEN
  5522. null := 0;
  5523. GetCodeSectionNameForSymbol(td,name);
  5524. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5525. Basic.SuffixSegmentedName (name, module.module.name);
  5526. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5527. IntermediateCode.InitImmediate(op,addressType,0);
  5528. source(IntermediateCode.Section).Emit(Data(position,op));
  5529. source.SetReferenced(FALSE)
  5530. ELSE
  5531. name := source.name;
  5532. END;
  5533. END;
  5534. RETURN td
  5535. END GetBackendType;
  5536. BEGIN
  5537. (*td := t.typeDeclaration;*)
  5538. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5539. (*
  5540. IF t IS SyntaxTree.PointerType THEN
  5541. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5542. ELSE
  5543. source := GetBackendType(t);
  5544. END;
  5545. *)
  5546. IF newObjectFile THEN
  5547. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5548. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5549. IntermediateCode.SetOffset(res,offset);
  5550. ELSE
  5551. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5552. END;
  5553. (*
  5554. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5555. make memory should be used when tag is used, not earlier
  5556. *)
  5557. RETURN res
  5558. END TypeDescriptorAdr;
  5559. (*
  5560. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5561. VAR result: IntermediateCode.Operand;
  5562. BEGIN
  5563. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5564. operand.tag := TypeDescriptorAdr(operand.type);
  5565. IntermediateCode.MakeMemory(operand.tag,addressType);
  5566. UseIntermediateOperand(operand.tag);
  5567. END;
  5568. END MakeTypeTag;
  5569. *)
  5570. PROCEDURE ProfilerInit;
  5571. VAR reg: IntermediateCode.Operand;
  5572. BEGIN
  5573. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5574. Emit(Call(position,reg,0));
  5575. END ProfilerInit;
  5576. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5577. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5578. BEGIN
  5579. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5580. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5581. THEN
  5582. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5583. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5584. Emit(Push(position,reg));
  5585. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5586. Emit(Push(position,reg));
  5587. StaticCallOperand(result,procedure);
  5588. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5589. ReleaseOperand(result);
  5590. END;
  5591. END ProfilerEnterExit;
  5592. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5593. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5594. BEGIN
  5595. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5596. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5597. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5598. profileInit.Emit(Push(position,reg));
  5599. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5600. profileInit.Emit(Push(position,reg));
  5601. NEW(string, LEN(name)); COPY(name, string^);
  5602. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5603. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5604. sv.SetType(type);
  5605. Designate(sv,result);
  5606. profileInit.Emit(Push(position,result.tag));
  5607. profileInit.Emit(Push(position,result.op));
  5608. StaticCallOperand(result,procedure);
  5609. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5610. ReleaseOperand(result);
  5611. END;
  5612. END ProfilerAddProcedure;
  5613. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5614. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5615. BEGIN
  5616. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5617. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5618. profileInit.Emit(Push(position,reg));
  5619. profileInitPatchPosition := profileInit.pc;
  5620. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5621. NEW(string, LEN(name)); COPY(name, string^);
  5622. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5623. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5624. sv.SetType(type);
  5625. Designate(sv,result);
  5626. profileInit.Emit(Push(position,result.tag));
  5627. profileInit.Emit(Push(position,result.op));
  5628. StaticCallOperand(result,procedure);
  5629. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5630. ReleaseOperand(result);
  5631. END;
  5632. END ProfilerAddModule;
  5633. PROCEDURE ProfilerPatchInit;
  5634. VAR reg: IntermediateCode.Operand;
  5635. BEGIN
  5636. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5637. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5638. EmitLeave(profileInit,position,NIL,0);
  5639. profileInit.Emit(Exit(position,0,0,0));
  5640. END ProfilerPatchInit;
  5641. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5642. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5643. VAR
  5644. id: LONGINT;
  5645. leftType, rightType: SyntaxTree.Type;
  5646. procedureType: SyntaxTree.ProcedureType;
  5647. runtimeProcedure: SyntaxTree.Procedure;
  5648. runtimeProcedureOperand, operatorOperand: Operand;
  5649. kind: SET;
  5650. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5651. VAR
  5652. arg: IntermediateCode.Operand;
  5653. recordType: SyntaxTree.RecordType;
  5654. fingerPrint: SyntaxTree.FingerPrint;
  5655. BEGIN
  5656. IF type = NIL THEN
  5657. (* no type: push 'NoType' *)
  5658. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5659. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5660. ELSIF IsStrictlyPointerToRecord(type) THEN
  5661. (* pointer to record type: push typetag *)
  5662. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5663. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5664. arg := TypeDescriptorAdr(recordType);
  5665. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5666. ELSE
  5667. (* non-pointer to record type: push fingerprint *)
  5668. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5669. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5670. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5671. END;
  5672. operatorInitializationCodeSection.Emit(Push(position,arg))
  5673. END PushTypeInfo;
  5674. BEGIN
  5675. ASSERT(operatorInitializationCodeSection # NIL);
  5676. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5677. procedureType := operator.type(SyntaxTree.ProcedureType);
  5678. (* determine types *)
  5679. leftType := procedureType.firstParameter.type;
  5680. IF procedureType.numberParameters = 2 THEN
  5681. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5682. rightType := procedureType.firstParameter.nextParameter.type;
  5683. ELSE
  5684. rightType := NIL
  5685. END;
  5686. (* determine operator kind *)
  5687. IF IsStrictlyPointerToRecord(leftType) THEN
  5688. kind := {LhsIsPointer}
  5689. ELSE
  5690. kind := {}
  5691. END;
  5692. IF IsStrictlyPointerToRecord(rightType) THEN
  5693. kind := kind + {RhsIsPointer}
  5694. END;
  5695. IF kind # {} THEN (* TODO: to be removed later on *)
  5696. (* at least one of the types is a pointer to record *)
  5697. (* emit a code that registers this specific operator in the runtime *)
  5698. dump := operatorInitializationCodeSection.comments;
  5699. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5700. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5701. (* push ID *)
  5702. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5703. id := Global.GetSymbol(module.module.case, operator.name);
  5704. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5705. (* push kind *)
  5706. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5707. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5708. (* push type infos *)
  5709. PushTypeInfo(leftType);
  5710. PushTypeInfo(rightType);
  5711. (* push operator address *)
  5712. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5713. StaticCallOperand(operatorOperand, operator);
  5714. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5715. ReleaseOperand(operatorOperand);
  5716. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5717. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5718. ReleaseOperand(runtimeProcedureOperand)
  5719. END
  5720. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5721. END
  5722. END RegisterDynamicOperator;
  5723. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5724. VAR
  5725. traceModule: SyntaxTree.Module;
  5726. procedure: SyntaxTree.Procedure;
  5727. procedureVariable: SyntaxTree.Variable;
  5728. s,msg: Basic.MessageString;
  5729. res: Operand;
  5730. i: LONGINT;
  5731. sv: SyntaxTree.StringValue;
  5732. type: SyntaxTree.Type;
  5733. recordType: SyntaxTree.RecordType;
  5734. printout: Printout.Printer;
  5735. stringWriter: Streams.StringWriter;
  5736. expression: SyntaxTree.Expression;
  5737. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5738. BEGIN
  5739. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5740. IF procedure = NIL THEN
  5741. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5742. END;
  5743. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5744. s := "procedure ";
  5745. Strings.Append(s,backend.traceModuleName);
  5746. Strings.Append(s,".");
  5747. Strings.Append(s,procedureName);
  5748. Strings.Append(s," not present");
  5749. Error(position,s);
  5750. RETURN FALSE
  5751. ELSE
  5752. RETURN TRUE
  5753. END;
  5754. END GetProcedure;
  5755. PROCEDURE CallProcedure;
  5756. VAR size: LONGINT;
  5757. BEGIN
  5758. IF procedure # NIL THEN
  5759. StaticCallOperand(result,procedure);
  5760. size := ProcedureParametersSize(system,procedure);
  5761. ELSE
  5762. Symbol(procedureVariable, result);
  5763. LoadValue(result, procedureVariable.type.resolved);
  5764. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5765. END;
  5766. Emit(Call(position,result.op,size));
  5767. END CallProcedure;
  5768. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5769. VAR res: Operand; string: SyntaxTree.String;
  5770. BEGIN
  5771. IF GetProcedure("String") THEN
  5772. NEW(string, LEN(s)); COPY(s, string^);
  5773. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5774. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5775. sv.SetType(type);
  5776. Designate(sv,res);
  5777. Emit(Push(position,res.tag));
  5778. Emit(Push(position,res.op));
  5779. ReleaseOperand(res);
  5780. CallProcedure;
  5781. END;
  5782. END String;
  5783. PROCEDURE Integer(op: IntermediateCode.Operand);
  5784. BEGIN
  5785. IF GetProcedure("Int") THEN
  5786. Emit(Push(position,op));
  5787. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5788. CallProcedure;
  5789. END;
  5790. END Integer;
  5791. PROCEDURE Float(op: IntermediateCode.Operand);
  5792. BEGIN
  5793. IF GetProcedure("HIntHex") THEN
  5794. Emit(Push(position,op));
  5795. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5796. CallProcedure;
  5797. END;
  5798. END Float;
  5799. PROCEDURE Set(op: IntermediateCode.Operand);
  5800. BEGIN
  5801. IF GetProcedure("Set") THEN
  5802. Emit(Push(position,op));
  5803. (*
  5804. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5805. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5806. *)
  5807. CallProcedure;
  5808. END;
  5809. END Set;
  5810. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5811. BEGIN
  5812. IF GetProcedure("Boolean") THEN
  5813. Emit(Push(position,op));
  5814. CallProcedure;
  5815. END;
  5816. END Boolean;
  5817. PROCEDURE Char(op: IntermediateCode.Operand);
  5818. BEGIN
  5819. IF GetProcedure("Char") THEN
  5820. Emit(Push(position,op));
  5821. CallProcedure;
  5822. END;
  5823. END Char;
  5824. PROCEDURE Address(op: IntermediateCode.Operand);
  5825. BEGIN
  5826. IF GetProcedure("Address") THEN
  5827. Emit(Push(position,op));
  5828. CallProcedure;
  5829. END;
  5830. END Address;
  5831. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  5832. VAR len: IntermediateCode.Operand;
  5833. BEGIN
  5834. IF GetProcedure("String") THEN
  5835. len := GetArrayLength(type, op.tag);
  5836. Emit(Push(position,len));
  5837. ReleaseIntermediateOperand(len);
  5838. Emit(Push(position,op.op));
  5839. CallProcedure;
  5840. END;
  5841. END StringOperand;
  5842. PROCEDURE Ln;
  5843. BEGIN
  5844. IF GetProcedure("Ln") THEN
  5845. CallProcedure;
  5846. END;
  5847. END Ln;
  5848. BEGIN
  5849. IF backend.traceModuleName = "" THEN RETURN END;
  5850. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5851. IF GetProcedure("Enter") THEN
  5852. CallProcedure
  5853. END;
  5854. NEW(stringWriter,LEN(s));
  5855. FOR i := 0 TO x.Length()-1 DO
  5856. msg := "";
  5857. expression := x.GetExpression(i);
  5858. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5859. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5860. ELSE
  5861. Global.GetModuleName(module.module, s);
  5862. END;
  5863. IF i = 0 THEN
  5864. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  5865. stringWriter.String(":");
  5866. END;
  5867. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5868. IF ~(expression IS SyntaxTree.StringValue) THEN
  5869. printout.Expression(expression);
  5870. stringWriter.Get(s);
  5871. Strings.Append(msg,s);
  5872. Strings.Append(msg,"= ");
  5873. ELSE stringWriter.Get(s); (* remove from string writer *)
  5874. Strings.Append(msg, s);
  5875. END;
  5876. String(msg);
  5877. IF SemanticChecker.IsStringType(expression.type) THEN
  5878. Designate(expression,res);
  5879. StringOperand(res, expression.type);
  5880. ELSE
  5881. Evaluate(expression,res);
  5882. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5883. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5884. Convert(res.op,int64);
  5885. END;
  5886. Integer(res.op);
  5887. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5888. Boolean(res.op);
  5889. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5890. Set(res.op);
  5891. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5892. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5893. Convert(res.op,float64);
  5894. END;
  5895. Float(res.op);
  5896. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5897. Char(res.op);
  5898. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5899. Address(res.op);String("H");
  5900. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5901. Address(res.op);String("H");
  5902. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5903. Address(res.op);String("H");
  5904. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5905. Address(res.op);String("H");
  5906. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5907. String("NIL");
  5908. ELSE HALT(200);
  5909. END;
  5910. END;
  5911. ReleaseOperand(res);
  5912. String("; ");
  5913. END;
  5914. IF GetProcedure("Exit") THEN
  5915. CallProcedure
  5916. ELSE
  5917. Ln;
  5918. END;
  5919. END;
  5920. END SystemTrace;
  5921. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5922. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5923. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5924. BEGIN
  5925. type := type.resolved;
  5926. IF type IS SyntaxTree.RecordType THEN
  5927. WITH type: SyntaxTree.RecordType DO
  5928. baseType := type.baseType;
  5929. IF baseType # NIL THEN
  5930. baseType := baseType.resolved;
  5931. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5932. InitFields(baseType,adr,offset);
  5933. END;
  5934. variable := type.recordScope.firstVariable;
  5935. WHILE variable # NIL DO
  5936. IF variable.initializer # NIL THEN
  5937. Evaluate(variable.initializer,initializerOp);
  5938. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5939. Emit(Mov(position,mem,initializerOp.op));
  5940. ReleaseOperand(initializerOp);
  5941. ReleaseIntermediateOperand(mem);
  5942. END;
  5943. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5944. variable := variable.nextVariable
  5945. END;
  5946. END;
  5947. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5948. WITH type: SyntaxTree.ArrayType DO
  5949. IF type.form = SyntaxTree.Static THEN
  5950. baseType := type.arrayBase;
  5951. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5952. FOR i := 0 TO type.staticLength-1 DO
  5953. InitFields(baseType,adr,offset+i*size);
  5954. END;
  5955. END;
  5956. END;
  5957. ELSIF type IS SyntaxTree.MathArrayType THEN
  5958. WITH type: SyntaxTree.MathArrayType DO
  5959. IF type.form = SyntaxTree.Open THEN
  5960. dim := DynamicDim(type);
  5961. imm := IntermediateCode.Immediate(addressType,dim);
  5962. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5963. baseType := SemanticChecker.ArrayBase(type,dim);
  5964. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5965. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5966. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5967. ReleaseIntermediateOperand(imm);
  5968. (* flags remain empty (=0) for open array *)
  5969. ELSIF type.form = SyntaxTree.Static THEN
  5970. baseType := type.arrayBase;
  5971. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5972. ASSERT(type.staticLength < 1024*1024*1024);
  5973. FOR i := 0 TO type.staticLength-1 DO
  5974. InitFields(baseType,adr,offset+i*size);
  5975. END;
  5976. END;
  5977. END;
  5978. END;
  5979. END InitFields;
  5980. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  5981. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  5982. BEGIN
  5983. type := variable.type.resolved;
  5984. IF (type IS SyntaxTree.MathArrayType) THEN
  5985. WITH type: SyntaxTree.MathArrayType DO
  5986. IF type.form = SyntaxTree.Open THEN
  5987. Symbol(variable,operand);
  5988. InitFields(type, operand.tag,0);
  5989. IF temporary THEN
  5990. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  5991. END;
  5992. ELSIF type.form = SyntaxTree.Tensor THEN
  5993. Symbol(variable, operand);
  5994. MakeMemory(tmp,operand.op,addressType,0);
  5995. ReleaseOperand(operand);
  5996. IF temporary THEN
  5997. (* trick -- temporary object from array base *)
  5998. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  5999. Symbol(symbol,operand);
  6000. MakeMemory(mem,operand.op,addressType,0);
  6001. ReleaseOperand(operand);
  6002. Emit(Mov(position,tmp, mem) );
  6003. ReleaseOperand(operand);
  6004. ELSE
  6005. Emit(Mov(position,tmp, nil ) );
  6006. END;
  6007. ReleaseIntermediateOperand(tmp);
  6008. END;
  6009. END;
  6010. ELSE
  6011. Symbol(variable,operand);
  6012. IF variable.initializer # NIL THEN
  6013. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6014. reference.SetType(variable.type.resolved);
  6015. reference.SetAssignable(TRUE);
  6016. Assign(reference,variable.initializer);
  6017. ELSIF temporary THEN
  6018. IF SemanticChecker.IsPointerType(variable.type) THEN
  6019. Symbol(variable, operand);
  6020. MakeMemory(tmp,operand.op,addressType,0);
  6021. ReleaseOperand(operand);
  6022. Emit(Mov(position,tmp, nil ) );
  6023. ReleaseIntermediateOperand(tmp);
  6024. END;
  6025. END;
  6026. InitFields(type, operand.op,0);
  6027. ReleaseOperand(operand);
  6028. END;
  6029. END InitVariable;
  6030. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6031. VAR end: Label;
  6032. BEGIN
  6033. IF type.form = SyntaxTree.Tensor THEN
  6034. InitOperand(result,ModeValue);
  6035. ReuseCopy(result.op,base);
  6036. end := NewLabel();
  6037. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6038. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6039. SetLabel(end);
  6040. Convert(result.op,int32);
  6041. ELSE
  6042. InitOperand(result,ModeValue);
  6043. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6044. END
  6045. END MathArrayDim;
  6046. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6047. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6048. BEGIN
  6049. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6050. MakeMemory(mem,base,addressType,offset);
  6051. Emit(Mov(position,mem,value));
  6052. ReleaseIntermediateOperand(mem);
  6053. END PutMathArrayField;
  6054. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6055. VAR mem: IntermediateCode.Operand;
  6056. BEGIN
  6057. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6058. MakeMemory(mem,base,addressType,offset);
  6059. Emit(Mov(position,mem,value));
  6060. ReleaseIntermediateOperand(mem);
  6061. END PutMathArrayFieldOffset;
  6062. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6063. BEGIN
  6064. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6065. MakeMemory(value,base,addressType,offset);
  6066. END GetMathArrayField;
  6067. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6068. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6069. BEGIN
  6070. IF incr THEN
  6071. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6072. ELSE
  6073. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6074. END;
  6075. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6076. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6077. ELSE
  6078. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6079. Emit(Mov(position,reg,dim));
  6080. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6081. Emit(Add(position,reg,reg,base));
  6082. MakeMemory(mem, reg, addressType, offset);
  6083. ReleaseIntermediateOperand(reg);
  6084. Emit(Mov(position,mem,value));
  6085. ReleaseIntermediateOperand(mem);
  6086. END;
  6087. END PutMathArrayLenOrIncr;
  6088. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6089. BEGIN
  6090. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6091. END PutMathArrayLength;
  6092. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6093. BEGIN
  6094. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6095. END PutMathArrayIncrement;
  6096. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6097. BEGIN
  6098. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6099. END GetMathArrayIncrement;
  6100. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6101. BEGIN
  6102. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6103. END GetMathArrayLength;
  6104. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6105. VAR dimOp: IntermediateCode.Operand;
  6106. BEGIN
  6107. dimOp := IntermediateCode.Immediate(int32, dim);
  6108. GetMathArrayLength(type, operand, dimOp, check, result);
  6109. END GetMathArrayLengthAt;
  6110. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6111. VAR dimOp: IntermediateCode.Operand;
  6112. BEGIN
  6113. dimOp := IntermediateCode.Immediate(int32, dim);
  6114. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6115. END GetMathArrayIncrementAt;
  6116. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6117. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6118. offset: LONGINT;
  6119. BEGIN
  6120. IF increment THEN
  6121. offset := MathIncrOffset;
  6122. ELSE
  6123. offset := MathLenOffset;
  6124. END;
  6125. INC(offset,operand.dimOffset*2);
  6126. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6127. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6128. END;
  6129. (* static dimension *)
  6130. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6131. IF check & (type.form = SyntaxTree.Tensor) THEN
  6132. DimensionCheck(operand.tag,dim,BrltL);
  6133. END;
  6134. val := SHORT(dim.intValue);
  6135. IF type.form # SyntaxTree.Tensor THEN
  6136. t := SemanticChecker.ArrayBase(type,val);
  6137. type := t.resolved(SyntaxTree.MathArrayType);
  6138. IF type.form = SyntaxTree.Static THEN
  6139. IF increment THEN
  6140. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6141. ELSE
  6142. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6143. END;
  6144. InitOperand(result,ModeValue);
  6145. result.op := res;
  6146. RETURN;
  6147. END;
  6148. END;
  6149. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6150. MakeMemory(res,operand.tag,addressType,offset);
  6151. (*
  6152. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6153. *)
  6154. InitOperand(result,ModeValue);
  6155. result.op := res;
  6156. ELSE
  6157. Convert(dim,addressType);
  6158. IF check THEN
  6159. IF type.form = SyntaxTree.Tensor THEN
  6160. DimensionCheck(operand.tag,dim,BrltL);
  6161. ELSIF isUnchecked THEN (* do nothing *)
  6162. ELSE
  6163. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6164. END;
  6165. END;
  6166. end := NewLabel(); next := NIL;
  6167. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6168. Emit(Mov(position,res,dim));
  6169. Convert(res,int32);
  6170. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6171. WHILE t IS SyntaxTree.MathArrayType DO
  6172. type := t(SyntaxTree.MathArrayType);
  6173. IF type.form = SyntaxTree.Static THEN
  6174. imm := IntermediateCode.Immediate(int32,val);
  6175. next := NewLabel();
  6176. BrneL(next,imm,res);
  6177. IF increment THEN
  6178. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  6179. ELSE
  6180. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6181. END;
  6182. Emit(MovReplace(position,res,imm));
  6183. BrL(end);
  6184. ELSE hasDynamicPart := TRUE;
  6185. END;
  6186. t := type.arrayBase.resolved;
  6187. val := val + 1;
  6188. IF next # NIL THEN SetLabel(next) END;
  6189. END;
  6190. IF hasDynamicPart THEN
  6191. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6192. Emit(Mov(position,res2,dim));
  6193. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6194. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6195. Emit(Add(position,res2,res2,imm));
  6196. Emit(Add(position,res2,res2,operand.tag));
  6197. IntermediateCode.MakeMemory(res2,int32);
  6198. Emit(MovReplace(position,res,res2));
  6199. ReleaseIntermediateOperand(res2);
  6200. END;
  6201. SetLabel(end);
  6202. Convert(res,int32);
  6203. InitOperand(result,ModeValue);
  6204. result.op := res;
  6205. END;
  6206. END MathArrayLenOrIncr;
  6207. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6208. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6209. offset: LONGINT;
  6210. BEGIN
  6211. offset := operand.dimOffset+DynamicDim(type)-1;
  6212. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6213. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6214. val := SHORT(dim.intValue);
  6215. t := SemanticChecker.ArrayBase(type,val);
  6216. type := t.resolved(SyntaxTree.ArrayType);
  6217. IF type.form = SyntaxTree.Static THEN
  6218. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6219. ELSE
  6220. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6221. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6222. END;
  6223. UseIntermediateOperand(res);
  6224. InitOperand(result,ModeValue);
  6225. result.op := res;
  6226. ELSE
  6227. Convert(dim,addressType);
  6228. IF ~isUnchecked THEN
  6229. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6230. END;
  6231. end := NewLabel(); next := NIL;
  6232. (* ReuseCopy(dim,res); *)
  6233. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6234. Emit(Mov(position,res,dim));
  6235. Convert(res,int32);
  6236. Convert(res,int32);
  6237. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6238. WHILE t IS SyntaxTree.ArrayType DO
  6239. type := t(SyntaxTree.ArrayType);
  6240. IF type.form = SyntaxTree.Static THEN
  6241. imm := IntermediateCode.Immediate(int32,val);
  6242. next := NewLabel();
  6243. BrneL(next,imm,res);
  6244. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6245. Emit(MovReplace(position,res,imm));
  6246. BrL(end);
  6247. ELSE hasDynamicPart := TRUE;
  6248. END;
  6249. t := type.arrayBase.resolved;
  6250. val := val + 1;
  6251. IF next # NIL THEN SetLabel(next) END;
  6252. END;
  6253. IF hasDynamicPart THEN
  6254. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6255. Convert(res2,addressType);
  6256. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6257. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6258. Emit(Sub(position,res2,imm,res2));
  6259. Emit(Add(position,res2,res2,operand.tag));
  6260. IntermediateCode.MakeMemory(res2,int32);
  6261. Emit(MovReplace(position,res,res2));
  6262. ReleaseIntermediateOperand(res2);
  6263. END;
  6264. SetLabel(end);
  6265. Convert(res,int32);
  6266. InitOperand(result,ModeValue);
  6267. result.op := res;
  6268. END;
  6269. END ArrayLen;
  6270. (**
  6271. create a temporary variable in current scope
  6272. **)
  6273. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6274. VAR name: SyntaxTree.Identifier; variable: SyntaxTree.Variable;
  6275. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6276. BEGIN
  6277. IF ~register THEN
  6278. variable := temporaries.GetFreeVariable(type, untraced, index);
  6279. ELSE
  6280. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6281. END;
  6282. scope := currentScope;
  6283. variable := NIL; (* disable free variable managemenet for the time being -- does not work *)
  6284. IF variable = NIL THEN
  6285. name := temporaries.GetUID();
  6286. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6287. variable.SetType(type);
  6288. variable.SetAccess(SyntaxTree.Hidden);
  6289. variable.SetUntraced(untraced);
  6290. IF ~register THEN
  6291. temporaries.AddVariable(variable);
  6292. IF scope.lastVariable # NIL THEN
  6293. offset := scope.lastVariable.offsetInBits;
  6294. ELSE
  6295. offset := 0;
  6296. END;
  6297. DEC(offset,system.SizeOf(variable.type));
  6298. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6299. variable(SyntaxTree.Variable).SetOffset(offset);
  6300. scope.AddVariable(variable(SyntaxTree.Variable));
  6301. scope.EnterSymbol(variable, duplicate);
  6302. ASSERT(~duplicate);
  6303. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6304. ELSE
  6305. variable.SetUseRegister(TRUE);
  6306. variable(SyntaxTree.Variable).SetOffset(0);
  6307. END;
  6308. ELSE
  6309. name := temporaries.GetUID();
  6310. offset := variable.offsetInBits;
  6311. (* create new variable on existing slot *)
  6312. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6313. variable.SetType(type);
  6314. variable.SetAccess(SyntaxTree.Hidden);
  6315. variable.SetUntraced(untraced);
  6316. variable(SyntaxTree.Variable).SetOffset(offset);
  6317. scope.AddVariable(variable(SyntaxTree.Variable));
  6318. scope.EnterSymbol(variable, duplicate);
  6319. ASSERT(~duplicate);
  6320. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6321. (*
  6322. ASSERT(variable.type.resolved = type.resolved)
  6323. *)
  6324. END;
  6325. RETURN variable(SyntaxTree.Variable)
  6326. END GetTemporaryVariable;
  6327. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6328. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6329. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6330. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6331. i: LONGINT; duplicate: BOOLEAN;
  6332. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6333. VAR variable: SyntaxTree.Variable;
  6334. BEGIN
  6335. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6336. variable.SetType(type);
  6337. recordScope.AddVariable(variable);
  6338. END AddVariable;
  6339. BEGIN
  6340. name := "@ArrayDescriptor";
  6341. Basic.AppendNumber(name,dimensions);
  6342. identifier := SyntaxTree.NewIdentifier(name);
  6343. parentScope := module.module.moduleScope;
  6344. symbol := parentScope.FindSymbol(identifier);
  6345. IF symbol # NIL THEN
  6346. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6347. type := typeDeclaration.declaredType;
  6348. ELSE
  6349. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6350. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6351. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6352. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6353. recordType.SetTypeDeclaration(typeDeclaration);
  6354. recordType.SetState(SyntaxTree.Resolved);
  6355. typeDeclaration.SetDeclaredType(recordType);
  6356. AddVariable("@ptr",system.anyType);
  6357. AddVariable("@adr",system.addressType);
  6358. AddVariable("@flags",system.addressType);
  6359. AddVariable("@dim",system.addressType);
  6360. AddVariable("@elementSize",system.addressType);
  6361. FOR i := 0 TO dimensions-1 DO
  6362. name := "@len";
  6363. Basic.AppendNumber(name,i);
  6364. AddVariable(name,system.addressType);
  6365. name := "@incr";
  6366. Basic.AppendNumber(name,i);
  6367. AddVariable(name,system.addressType);
  6368. END;
  6369. parentScope.AddTypeDeclaration(typeDeclaration);
  6370. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6371. ASSERT(~duplicate);
  6372. type := recordType;
  6373. END;
  6374. RETURN type
  6375. END GetMathArrayDescriptorType;
  6376. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6377. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6378. BEGIN
  6379. type := GetMathArrayDescriptorType(dimensions);
  6380. Emit(Push(position,op.op));
  6381. (* push type descriptor *)
  6382. reg := TypeDescriptorAdr(type);
  6383. IF ~newObjectFile THEN
  6384. IntermediateCode.MakeMemory(reg,addressType);
  6385. END;
  6386. Emit(Push(position,reg));
  6387. ReleaseIntermediateOperand(reg);
  6388. (* push realtime flag: false by default *)
  6389. Emit(Push(position,false));
  6390. CallThis(position,"Heaps","NewRec",3);
  6391. END NewMathArrayDescriptor;
  6392. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6393. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6394. BEGIN
  6395. NEW(string, LEN(s)); COPY(s, string^);
  6396. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6397. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6398. sv.SetType(type);
  6399. Designate(sv,res);
  6400. Emit(Push(position,res.tag));
  6401. Emit(Push(position,res.op));
  6402. ReleaseOperand(res);
  6403. END PushConstString;
  6404. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6405. BEGIN
  6406. IF b THEN
  6407. Emit(Push(Basic.invalidPosition, true));
  6408. ELSE
  6409. Emit(Push(Basic.invalidPosition, false));
  6410. END;
  6411. END PushConstBoolean;
  6412. PROCEDURE PushConstSet(v: SET);
  6413. VAR value: SyntaxTree.Value; op: Operand;
  6414. BEGIN
  6415. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6416. value.SetType(system.setType);
  6417. Evaluate(value, op);
  6418. Emit(Push(Basic.invalidPosition, op.op));
  6419. ReleaseOperand(op);
  6420. END PushConstSet;
  6421. PROCEDURE PushConstInteger(v: LONGINT);
  6422. VAR value: SyntaxTree.Value; op: Operand;
  6423. BEGIN
  6424. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6425. value.SetType(system.longintType);
  6426. Evaluate(value, op);
  6427. Emit(Push(Basic.invalidPosition, op.op));
  6428. ReleaseOperand(op);
  6429. END PushConstInteger;
  6430. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6431. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6432. section: IntermediateCode.Section;
  6433. BEGIN
  6434. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6435. Global.GetSymbolSegmentedName(symbol, name);
  6436. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6437. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6438. procedure.SetScope(moduleScope);
  6439. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6440. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6441. procedure.SetAccess(SyntaxTree.Hidden);
  6442. currentScope := procedureScope;
  6443. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6444. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6445. RETURN section;
  6446. END OpenInitializer;
  6447. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6448. BEGIN
  6449. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6450. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6451. section := prev;
  6452. END CloseInitializer;
  6453. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6454. VAR name: SyntaxTree.IdentifierString;
  6455. variable: SyntaxTree.Variable;
  6456. parameter: SyntaxTree.Parameter;
  6457. type: SyntaxTree.Type;
  6458. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6459. BEGIN
  6460. InitOperand(op,ModeReference);
  6461. op.op := fp;
  6462. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6463. Dereference(op, x, FALSE);
  6464. result := op;
  6465. Symbol(symbol, op);
  6466. END Field;
  6467. PROCEDURE Direction(direction: LONGINT): SET;
  6468. BEGIN
  6469. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6470. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6471. ELSE HALT(100);
  6472. END;
  6473. END Direction;
  6474. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6475. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6476. BEGIN
  6477. Field(port, op);
  6478. ToMemory(op.op,addressType,0);
  6479. Emit(Push(Basic.invalidPosition, op.op));
  6480. ReleaseOperand(op);
  6481. Basic.GetString(modifier.identifier, name);
  6482. PushConstString(name);
  6483. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6484. ASSERT(SemanticChecker.IsStringType(value.type));
  6485. Designate(value, op);
  6486. Emit(Push(modifier.position, op.tag));
  6487. Emit(Push(modifier.position, op.op));
  6488. ReleaseOperand(op);
  6489. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6490. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6491. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6492. Evaluate(value, op);
  6493. Emit(Push(modifier.position, op.op));
  6494. ReleaseOperand(op);
  6495. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6496. ELSE
  6497. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6498. END;
  6499. END AddPortProperty;
  6500. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6501. VAR modifier: SyntaxTree.Modifier;
  6502. BEGIN
  6503. modifier := parameter.modifiers;
  6504. WHILE modifier # NIL DO
  6505. AddPortProperty(parameter,modifier, modifier.expression);
  6506. modifier := modifier.nextModifier;
  6507. END;
  6508. END AddPortProperties;
  6509. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6510. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6511. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6512. PROCEDURE PushLens(type: SyntaxTree.Type);
  6513. BEGIN
  6514. IF IsSemiDynamicArray(type) THEN
  6515. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6516. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6517. Emit(Push(Basic.invalidPosition, op.op));
  6518. ReleaseOperand(op);
  6519. INC(dim);
  6520. ELSIF IsStaticArray(type) THEN
  6521. len := len * type(SyntaxTree.ArrayType).staticLength;
  6522. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6523. INC(dim);
  6524. ELSE
  6525. baseType := type;
  6526. END;
  6527. END PushLens;
  6528. BEGIN
  6529. (* cell *)
  6530. IF parameter.type IS SyntaxTree.ArrayType THEN
  6531. type := parameter.type;
  6532. dim := 0;
  6533. len := 1;
  6534. PushLens(type);
  6535. portType := baseType.resolved(SyntaxTree.PortType);
  6536. ELSE
  6537. portType := parameter.type(SyntaxTree.PortType);
  6538. END;
  6539. PushSelfPointer();
  6540. (* port / array of ports *)
  6541. IF IsStaticArray(type) THEN
  6542. PushConstInteger(len);
  6543. END;
  6544. Field(parameter, op);
  6545. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6546. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6547. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6548. Designate(d, op);*)
  6549. Emit(Push(Basic.invalidPosition, op.op));
  6550. ReleaseOperand(op);
  6551. (* name *)
  6552. PushConstString(name);
  6553. (* inout *)
  6554. PushConstSet(Direction(portType.direction));
  6555. (* width *)
  6556. PushConstInteger(portType.sizeInBits);
  6557. IF parameter.type IS SyntaxTree.PortType THEN
  6558. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6559. AddPortProperties(parameter);
  6560. ELSIF IsStaticArray(type)THEN
  6561. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6562. ELSIF IsSemiDynamicArray(type) THEN
  6563. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6564. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6565. Emit(Add(position,reg, sp, size));
  6566. (* dim *)
  6567. PushConstInteger(dim);
  6568. (* len array *)
  6569. Emit(Push(position, reg));
  6570. ReleaseIntermediateOperand(reg);
  6571. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6572. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6573. Emit(Add(position, sp,sp, size));
  6574. ELSE
  6575. HALT(100);
  6576. END;
  6577. END Parameter;
  6578. BEGIN
  6579. IF backend.cellsAreObjects THEN
  6580. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6581. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6582. END;
  6583. parameter := x.firstParameter;
  6584. WHILE (parameter # NIL) DO
  6585. type := parameter.type.resolved;
  6586. WHILE (type IS SyntaxTree.ArrayType) DO
  6587. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6588. END;
  6589. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6590. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6591. Parameter(name,parameter);
  6592. END;
  6593. parameter := parameter.nextParameter;
  6594. END;
  6595. ELSE HALT(200)
  6596. END;
  6597. END AddPorts;
  6598. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6599. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6600. BEGIN
  6601. Symbol(cell,op);
  6602. ToMemory(op.op,addressType,0);
  6603. Emit(Push(position,op.op));
  6604. ReleaseOperand(op);
  6605. property.GetName(name);
  6606. (* does not work when inheritance is used:
  6607. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6608. *)
  6609. PushConstString(name);
  6610. IF (value # NIL) THEN
  6611. ASSERT(
  6612. SemanticChecker.IsStringType(property.type)
  6613. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6614. OR (property.type.resolved IS SyntaxTree.FloatType)
  6615. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6616. OR (property.type.resolved IS SyntaxTree.SetType)
  6617. );
  6618. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6619. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6620. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6621. Designate(d, op);
  6622. IF SemanticChecker.IsStringType(property.type) THEN
  6623. Emit(Push(Basic.invalidPosition, op.tag))
  6624. END;
  6625. Emit(Push(Basic.invalidPosition, op.op));
  6626. ReleaseOperand(op);
  6627. END;
  6628. IF value = NIL THEN
  6629. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6630. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6631. ASSERT(SemanticChecker.IsStringType(value.type));
  6632. Designate(value, op);
  6633. PushString(op, value.type);
  6634. ReleaseOperand(op);
  6635. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6636. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6637. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6638. Evaluate(value, op);
  6639. Emit(Push(property.position, op.op));
  6640. ReleaseOperand(op);
  6641. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6642. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6643. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6644. Evaluate(value, op);
  6645. Emit(Push(property.position, op.op));
  6646. ReleaseOperand(op);
  6647. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6648. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6649. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6650. Evaluate(value, op);
  6651. Emit(Push(property.position, op.op));
  6652. ReleaseOperand(op);
  6653. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6654. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6655. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6656. Evaluate(value, op);
  6657. Emit(Push(property.position, op.op));
  6658. ReleaseOperand(op);
  6659. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6660. ELSE
  6661. HALT(200);
  6662. END;
  6663. END AddProperty;
  6664. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6665. VAR symbol: SyntaxTree.Symbol;
  6666. BEGIN
  6667. WHILE modifier # NIL DO
  6668. symbol := cellType.FindProperty(modifier.identifier);
  6669. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6670. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6671. modifier := modifier.nextModifier;
  6672. END;
  6673. END AddModifiers;
  6674. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6675. VAR last: SyntaxTree.Modifier;
  6676. BEGIN
  6677. IF to = NIL THEN
  6678. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6679. ELSE
  6680. last := to;
  6681. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6682. last := last.nextModifier;
  6683. END;
  6684. IF last.identifier # this.identifier THEN
  6685. ASSERT(last.nextModifier = NIL);
  6686. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6687. END;
  6688. END;
  6689. END AppendModifier;
  6690. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6691. BEGIN
  6692. WHILE this # NIL DO
  6693. AppendModifier(to, this);
  6694. this := this.nextModifier;
  6695. END;
  6696. END AppendModifiers;
  6697. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6698. VAR base: SyntaxTree.Type;
  6699. BEGIN
  6700. AppendModifiers(to, c.modifiers);
  6701. base := c.GetBaseValueType();
  6702. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6703. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6704. END;
  6705. END AppendCellTypeModifiers;
  6706. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6707. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6708. BEGIN
  6709. Basic.GetString(modifier.identifier, name);
  6710. PushConstString(name);
  6711. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6712. ASSERT(SemanticChecker.IsStringType(value.type));
  6713. Designate(value, op);
  6714. PushString(op, value.type);
  6715. ReleaseOperand(op);
  6716. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6717. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6718. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6719. Evaluate(value, op);
  6720. Emit(Push(modifier.position, op.op));
  6721. ReleaseOperand(op);
  6722. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6723. ELSE
  6724. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6725. END;
  6726. END AddPortProperty;
  6727. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6728. BEGIN
  6729. WHILE modifier # NIL DO
  6730. AddPortProperty(modifier, modifier.expression);
  6731. modifier := modifier.nextModifier;
  6732. END;
  6733. END AddPortProperties;
  6734. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6735. VAR op: Operand;
  6736. BEGIN
  6737. Evaluate(p, op);
  6738. Emit(Push(p.position, op.op));
  6739. ReleaseOperand(op);
  6740. IF p IS SyntaxTree.Designator THEN
  6741. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6742. END;
  6743. END PushPort;
  6744. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6745. VAR tmp: IntermediateCode.Operand;
  6746. BEGIN
  6747. actualType := actualType.resolved;
  6748. IF actualType IS SyntaxTree.StringType THEN
  6749. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6750. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6751. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6752. ELSE
  6753. tmp := op.tag;
  6754. IntermediateCode.MakeMemory(tmp,addressType);
  6755. Emit(Push(position,tmp));
  6756. END;
  6757. Emit(Push(position,op.op))
  6758. END PushString;
  6759. (* conservative check if x is potentially on the heap, excluding the module heap
  6760. required for generational garbage collector
  6761. *)
  6762. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6763. VAR pos: LONGINT;
  6764. BEGIN
  6765. pos := x.position.start;
  6766. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6767. x := x(SyntaxTree.Designator).left;
  6768. END;
  6769. (*TRACE(pos, x # NIL);*)
  6770. RETURN x # NIL;
  6771. END OnHeap;
  6772. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6773. VAR
  6774. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6775. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6776. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6777. tmp:IntermediateCode.Operand;
  6778. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6779. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6780. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6781. dest: IntermediateCode.Operand;
  6782. staticLength: LONGINT; itype: IntermediateCode.Type;
  6783. convert,isTensor: BOOLEAN;
  6784. recordType: SyntaxTree.RecordType;
  6785. baseType: SyntaxTree.Type;
  6786. flags: SET;
  6787. left: SyntaxTree.Expression;
  6788. call: SyntaxTree.Designator;
  6789. procedure: SyntaxTree.Procedure;
  6790. temporaryVariable: SyntaxTree.Variable;
  6791. dummy: IntermediateCode.Operand;
  6792. customBuiltin: SyntaxTree.CustomBuiltin;
  6793. isVarPar: ARRAY 3 OF BOOLEAN;
  6794. callsection: Sections.Section;
  6795. segmentedName: Basic.SegmentedName;
  6796. needsTrace: BOOLEAN;
  6797. n: ARRAY 256 OF CHAR;
  6798. modifier: SyntaxTree.Modifier;
  6799. previous, init: IntermediateCode.Section;
  6800. prevScope: SyntaxTree.Scope;
  6801. firstPar: LONGINT;
  6802. saved: RegisterEntry;
  6803. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6804. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6805. priority: IntermediateCode.Operand;
  6806. op,callop: Operand;
  6807. BEGIN
  6808. IF type = NIL THEN RETURN END;
  6809. type := type.resolved;
  6810. IF type IS SyntaxTree.PointerType THEN
  6811. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6812. END;
  6813. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6814. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6815. recordScope := type(SyntaxTree.RecordType).recordScope;
  6816. IF recordScope.bodyProcedure # NIL THEN
  6817. procedure := recordScope.bodyProcedure;
  6818. body := procedure.procedureScope.body;
  6819. Emit(Push(position,self));
  6820. IF body.isActive THEN
  6821. StaticCallOperand(callop,procedure);
  6822. Emit(Push(position,callop.op));
  6823. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6824. Convert(priority,sizeType);
  6825. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6826. END;
  6827. Emit(Push(position,priority));
  6828. ReleaseIntermediateOperand(priority);
  6829. IF backend.cooperative THEN
  6830. Emit(Push(position,self));
  6831. CallThis(position,"Activities","Create",3)
  6832. ELSE
  6833. flags := 0;
  6834. IF body.isSafe THEN
  6835. flags := 1;
  6836. END;
  6837. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6838. Emit(Push(position,self));
  6839. CallThis(position,"Objects","CreateProcess",4)
  6840. END;
  6841. ELSE
  6842. Emit(Push(position,self));
  6843. StaticCallOperand(callop,procedure);
  6844. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6845. END;
  6846. Emit(Pop(position,self));
  6847. END;
  6848. END CallBodies;
  6849. PROCEDURE PushTD(type: SyntaxTree.Type);
  6850. VAR op: IntermediateCode.Operand;
  6851. BEGIN
  6852. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6853. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6854. ELSE
  6855. IF type.resolved IS SyntaxTree.PointerType THEN
  6856. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6857. END;
  6858. op := TypeDescriptorAdr(type.resolved);
  6859. IF ~newObjectFile THEN
  6860. IntermediateCode.MakeMemory(op,addressType);
  6861. END;
  6862. Emit(Push(position,op));
  6863. END
  6864. END PushTD;
  6865. BEGIN
  6866. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6867. dest := destination; destination := emptyOperand;
  6868. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6869. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6870. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6871. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6872. CASE x.id OF
  6873. (* ---- COPY ----- *)
  6874. |Global.Copy:
  6875. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6876. (* ---- EXCL, INCL----- *)
  6877. |Global.Excl,Global.Incl:
  6878. Evaluate(p0,s0);
  6879. Evaluate(p1,s1);
  6880. Convert(s1.op,setType);
  6881. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6882. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6883. END;
  6884. ReuseCopy(res,s0.op);
  6885. ReleaseOperand(s0);
  6886. Reuse1(tmp,s1.op);
  6887. ReleaseOperand(s1);
  6888. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6889. IF x.id = Global.Excl THEN
  6890. Emit(Not(position,tmp,tmp));
  6891. Emit(And(position,res,res,tmp));
  6892. ELSE
  6893. Emit(Or(position,res,res,tmp));
  6894. END;
  6895. ReleaseIntermediateOperand(tmp);
  6896. Designate(p0,s0);
  6897. ToMemory(s0.op,setType,0);
  6898. Emit(Mov(position,s0.op,res));
  6899. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6900. (* ---- DISPOSE ----- *)
  6901. |Global.Dispose:
  6902. Designate(p0,s0);
  6903. Emit(Push(position,s0.op));
  6904. ReleaseOperand(s0);
  6905. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6906. (* ---- GETPROCEDURE ----- *)
  6907. |Global.GetProcedure:
  6908. Designate(p0,s0);
  6909. PushString(s0,p0.type);
  6910. Designate(p1,s1);
  6911. PushString(s1,p1.type);
  6912. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6913. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6914. ELSE PushTD(procedureType.firstParameter.type)
  6915. END;
  6916. PushTD(procedureType.returnType);
  6917. Designate(p2,s2);
  6918. Emit(Push(position,s2.op));
  6919. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6920. CallThis(position,"Modules","GetProcedure", 7);
  6921. (* ---- ASH, LSH, ROT ----- *)
  6922. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6923. Evaluate(p0,s0);
  6924. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6925. (* make unsigned arguments in order to produced a logical shift *)
  6926. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6927. convert:= TRUE;
  6928. itype := s0.op.type;
  6929. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6930. Convert(s0.op,itype);
  6931. ELSE
  6932. convert := FALSE;
  6933. END;
  6934. END;
  6935. Evaluate(p1,s1);
  6936. IF IsIntegerConstant(p1,hint) THEN
  6937. ReuseCopy(reg,s0.op);
  6938. IF hint > 0 THEN
  6939. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6940. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6941. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6942. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6943. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6944. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6945. END;
  6946. ELSIF hint < 0 THEN
  6947. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6948. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6949. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6950. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6951. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6952. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6953. END;
  6954. END;
  6955. ReleaseOperand(s0); ReleaseOperand(s1);
  6956. ELSE
  6957. exit := NewLabel();
  6958. end := NewLabel();
  6959. ReuseCopy(reg,s0.op);
  6960. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6961. Reuse1(tmp,s1.op);
  6962. Emit(Neg(position,tmp,s1.op));
  6963. Convert(tmp,s1.op.type);
  6964. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6965. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6966. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6967. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6968. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6969. END;
  6970. ReleaseIntermediateOperand(tmp);
  6971. BrL(end);
  6972. SetLabel(exit);
  6973. ReuseCopy(tmp,s1.op);
  6974. Convert(tmp,s1.op.type);
  6975. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6976. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6977. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6978. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6979. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6980. END;
  6981. ReleaseIntermediateOperand(tmp);
  6982. SetLabel(end);
  6983. ReleaseOperand(s0); ReleaseOperand(s1);
  6984. END;
  6985. InitOperand(result,ModeValue);
  6986. IF convert THEN
  6987. itype := reg.type;
  6988. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6989. Convert(reg,itype);
  6990. END;
  6991. result.op := reg;
  6992. (* ---- CAP ----- *)
  6993. |Global.Cap:
  6994. Evaluate(p0,result);
  6995. ReuseCopy(reg,result.op);
  6996. ReleaseIntermediateOperand(result.op);
  6997. ignore := NewLabel();
  6998. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6999. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7000. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7001. SetLabel(ignore);
  7002. result.op := reg;
  7003. (* ---- CHR ----- *)
  7004. |Global.Chr, Global.Chr32:
  7005. Evaluate(p0,result);
  7006. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7007. |Global.Entier, Global.EntierH:
  7008. Evaluate(p0,result);
  7009. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7010. (* ---- MIN and MAX ----- *)
  7011. |Global.Max,Global.Min:
  7012. Evaluate(p0,s0);
  7013. Evaluate(p1,s1);
  7014. Reuse2(res,s0.op,s1.op);
  7015. else := NewLabel();
  7016. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7017. ELSE BrltL(else,s1.op,s0.op) END;
  7018. Emit(Mov(position,res,s0.op));
  7019. ReleaseOperand(s0);
  7020. end := NewLabel();
  7021. BrL(end);
  7022. SetLabel(else);
  7023. Emit(MovReplace(position,res,s1.op));
  7024. SetLabel(end);
  7025. ReleaseOperand(s1);
  7026. InitOperand(result,ModeValue);
  7027. result.op := res;
  7028. (* ---- ODD ----- *)
  7029. |Global.Odd:
  7030. IF ~conditional THEN
  7031. ConditionToValue(x)
  7032. ELSE
  7033. Evaluate(p0,result);
  7034. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7035. Reuse1(res,result.op);
  7036. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7037. ReleaseIntermediateOperand(result.op);
  7038. result.op := res;
  7039. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7040. ReleaseOperand(result);
  7041. BrL(falseLabel);
  7042. END;
  7043. (* ---- ORD ----- *)
  7044. |Global.Ord, Global.Ord32:
  7045. Evaluate(p0,result);
  7046. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7047. (* ---- SHORT, LONG ----- *)
  7048. |Global.Short, Global.Long:
  7049. Evaluate(p0,result);
  7050. IF x.type IS SyntaxTree.ComplexType THEN
  7051. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7052. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7053. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7054. ELSE
  7055. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7056. END
  7057. (* ---- HALT, SYSTEM.HALT----- *)
  7058. |Global.Halt, Global.systemHalt:
  7059. val := p0.resolved(SyntaxTree.IntegerValue).value;
  7060. EmitTrap (position, val);
  7061. (* ---- ASSERT ----- *)
  7062. |Global.Assert:
  7063. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7064. trueL := NewLabel();
  7065. falseL := NewLabel();
  7066. Condition(p0,trueL,falseL);
  7067. IF p1 = NIL THEN val := AssertTrap
  7068. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  7069. END;
  7070. SetLabel(falseL);
  7071. EmitTrap(position,val);
  7072. SetLabel(trueL);
  7073. END;
  7074. (*
  7075. Emit(TrapC(result.op,val);
  7076. *)
  7077. (* ---- INC, DEC----- *)
  7078. |Global.Inc,Global.Dec:
  7079. Expression(p0); adr := result.op;
  7080. LoadValue(result,p0.type); l := result;
  7081. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7082. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7083. END;
  7084. IF x.id = Global.Inc THEN
  7085. Emit(Add(position,l.op,l.op,r.op));
  7086. ELSE
  7087. Emit(Sub(position,l.op,l.op,r.op));
  7088. END;
  7089. ReleaseOperand(l); ReleaseOperand(r);
  7090. (* ---- LEN ----- *)
  7091. |Global.Len: (* dynamic length, static length done by checker *)
  7092. Designate(p0,operand);
  7093. IF p1 = NIL THEN
  7094. InitOperand(l,ModeValue);
  7095. l.op := IntermediateCode.Immediate(int32,0);
  7096. ELSE
  7097. Evaluate(p1,l);
  7098. END;
  7099. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7100. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7101. Dereference(operand, p0.type.resolved, FALSE);
  7102. END;
  7103. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7104. ReleaseOperand(operand); ReleaseOperand(l);
  7105. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7106. ASSERT(p1 # NIL);
  7107. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7108. Dereference(operand,p0.type.resolved,FALSE);
  7109. END;
  7110. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7111. ReleaseOperand(operand); ReleaseOperand(l);
  7112. ELSE HALT(100);
  7113. END;
  7114. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7115. (* ---- FIRST ---- *)
  7116. |Global.First:
  7117. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7118. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7119. ELSE
  7120. Designate(p0, result)
  7121. END
  7122. (* ---- LAST ---- *)
  7123. |Global.Last:
  7124. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7125. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7126. ELSE
  7127. Designate(p0, result);
  7128. (* make sure result.op is a register *)
  7129. tmp := result.op;
  7130. ReuseCopy(result.op, result.op);
  7131. ReleaseIntermediateOperand(tmp);
  7132. (* add offset to result.op *)
  7133. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7134. END
  7135. (* ---- STEP ---- *)
  7136. |Global.Step:
  7137. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7138. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7139. ELSE
  7140. Designate(p0, result);
  7141. (* make sure result.op is a register *)
  7142. tmp := result.op;
  7143. ReuseCopy(result.op, result.op);
  7144. ReleaseIntermediateOperand(tmp);
  7145. (* add offset to result.op *)
  7146. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7147. END
  7148. (* ---- RE ---- *)
  7149. |Global.Re:
  7150. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7151. Designate(p0, result)
  7152. ELSE
  7153. Evaluate(p0, result)
  7154. END
  7155. (* ---- IM ---- *)
  7156. |Global.Im:
  7157. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7158. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7159. Designate(p0, result);
  7160. (* make sure result.op is a register *)
  7161. tmp := result.op;
  7162. ReuseCopy(result.op, result.op);
  7163. ReleaseIntermediateOperand(tmp);
  7164. (* add offset to result.op *)
  7165. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7166. (* ---- ABS ----- *)
  7167. |Global.Abs:
  7168. Evaluate(p0,operand);
  7169. type := p0.type.resolved;
  7170. InitOperand(result,ModeValue);
  7171. Reuse1a(result.op,operand.op,dest);
  7172. Emit(Abs(position,result.op,operand.op));
  7173. ReleaseOperand(operand);
  7174. (* ---- WAIT ----- *)
  7175. |Global.Wait:
  7176. Evaluate(p0,operand);
  7177. Emit(Push(position,operand.op));
  7178. ReleaseOperand(operand);
  7179. CallThis(position,"Activities","Wait", 1);
  7180. (* ---- NEW ----- *)
  7181. |Global.New:
  7182. (*! the following code is only correct for "standard" Oberon calling convention *)
  7183. IF x.type # NIL THEN
  7184. type := x.type.resolved;
  7185. firstPar := 0;
  7186. ELSE
  7187. type := p0.type.resolved;
  7188. firstPar := 1;
  7189. END;
  7190. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7191. THEN
  7192. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7193. IF backend.cooperative THEN
  7194. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7195. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7196. IF recordType.isObject THEN
  7197. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7198. IF recordType.IsActive() THEN
  7199. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7200. END;
  7201. IF recordType.IsProtected() THEN
  7202. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7203. END;
  7204. ELSE
  7205. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7206. END;
  7207. END;
  7208. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7209. CallThis(position,"Runtime","New", 1);
  7210. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7211. Emit(Result(position, pointer));
  7212. exit := NewLabel();
  7213. BreqL(exit,pointer,nil);
  7214. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7215. GetRecordTypeName (recordType,name);
  7216. IF ~recordType.isObject THEN
  7217. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7218. END;
  7219. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7220. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7221. IF recordType.isObject THEN
  7222. IF recordType.IsProtected() THEN
  7223. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7224. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7225. END;
  7226. IF recordType.IsActive() THEN
  7227. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7228. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7229. END;
  7230. END;
  7231. END;
  7232. (* initialize fields *)
  7233. IF type(SyntaxTree.PointerType).isPlain THEN
  7234. size := 0;
  7235. ELSIF recordType.isObject THEN
  7236. size := BaseObjectTypeSize;
  7237. ELSE
  7238. size := BaseRecordTypeSize;
  7239. END;
  7240. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7241. (* call initializer *)
  7242. constructor := GetConstructor(recordType);
  7243. IF constructor # NIL THEN
  7244. (*! should be unified with ProcedureCallDesignator *)
  7245. Emit(Push(position,pointer));
  7246. ReleaseIntermediateOperand(pointer);
  7247. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7248. FOR i := firstPar TO x.parameters.Length()-1 DO
  7249. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7250. formalParameter := formalParameter.nextParameter;
  7251. END;
  7252. (* static call of the constructor *)
  7253. GetCodeSectionNameForSymbol(constructor,name);
  7254. ASSERT(~constructor.isInline);
  7255. IF constructor.scope.ownerModule # module.module THEN
  7256. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7257. ELSE
  7258. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7259. END;
  7260. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7261. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7262. Emit(Pop(position,pointer));
  7263. END;
  7264. (* call bodies *)
  7265. CallBodies(pointer,type);
  7266. SetLabel(exit);
  7267. needsTrace := p0.NeedsTrace();
  7268. IF needsTrace THEN ModifyAssignments(true) END;
  7269. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7270. Emit(Push(position, pointer));
  7271. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7272. Emit(Pop(position, pointer));
  7273. END;
  7274. Designate(p0,l);
  7275. IF needsTrace THEN
  7276. CallAssignPointer(l.op, pointer);
  7277. ELSE
  7278. ToMemory(l.op,addressType,0);
  7279. Emit(Mov(position,l.op,pointer));
  7280. END;
  7281. ReleaseIntermediateOperand(pointer);
  7282. ReleaseOperand(l);
  7283. IF needsTrace THEN ModifyAssignments(false) END;
  7284. ELSE (* not cooperative backend *)
  7285. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7286. IF temporaryVariable # NIL THEN
  7287. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7288. ELSE
  7289. Designate(p0,l);
  7290. END;
  7291. (* l.op contains address of pointer to record *)
  7292. Emit(Push(position,l.op)); (* address for use after syscall *)
  7293. Emit(Push(position,l.op));
  7294. ReleaseOperand(l);
  7295. (* push type descriptor *)
  7296. reg := TypeDescriptorAdr(recordType);
  7297. IF ~newObjectFile THEN
  7298. IntermediateCode.MakeMemory(reg,addressType);
  7299. END;
  7300. Emit(Push(position,reg));
  7301. ReleaseIntermediateOperand(reg);
  7302. (* push realtime flag *)
  7303. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7304. ELSE Emit(Push(position,false));
  7305. END;
  7306. CallThis(position,"Heaps","NewRec", 3);
  7307. (* check allocation success, if not successful then do not call initializers and bodies *)
  7308. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7309. Emit(Pop(position,pointer));
  7310. MakeMemory(reg,pointer,addressType,0);
  7311. ReleaseIntermediateOperand(pointer);
  7312. pointer := reg;
  7313. exit := NewLabel();
  7314. BreqL(exit,pointer,nil);
  7315. Emit(Push(position,pointer));
  7316. (* initialize fields *)
  7317. InitFields(recordType, pointer,0);
  7318. (* call initializer *)
  7319. constructor := GetConstructor(recordType);
  7320. IF constructor # NIL THEN
  7321. (*! should be unified with ProcedureCallDesignator *)
  7322. Emit(Push(position,pointer));
  7323. ReleaseIntermediateOperand(pointer);
  7324. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7325. FOR i := firstPar TO x.parameters.Length()-1 DO
  7326. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7327. formalParameter := formalParameter.nextParameter;
  7328. END;
  7329. (* static call of the constructor *)
  7330. GetCodeSectionNameForSymbol(constructor,name);
  7331. ASSERT(~constructor.isInline);
  7332. IF constructor.scope.ownerModule # module.module THEN
  7333. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7334. ELSE
  7335. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7336. END;
  7337. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7338. ELSE
  7339. ReleaseIntermediateOperand(pointer);
  7340. END;
  7341. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7342. Emit(Pop(position,pointer));
  7343. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7344. Designate(p0,l);
  7345. IF backend.writeBarriers & OnHeap(p0) THEN
  7346. SaveRegisters();ReleaseUsedRegisters(saved);
  7347. Emit(Push(position,l.op));
  7348. Emit(Push(position,pointer));
  7349. CallThis(position,"Heaps","Assign",2);
  7350. RestoreRegisters(saved);
  7351. ELSE
  7352. ToMemory(l.op,addressType,0);
  7353. Emit(Mov(position,l.op,pointer));
  7354. END;
  7355. ReleaseOperand(l);
  7356. result.tag := emptyOperand;
  7357. ELSIF (x.type # NIL) THEN
  7358. result := l; (* temporary variable is the result of NEW Type() *)
  7359. END;
  7360. (* call bodies *)
  7361. CallBodies(pointer,type);
  7362. ReleaseIntermediateOperand(pointer);
  7363. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7364. end := NewLabel();
  7365. BrL(end);
  7366. SetLabel(exit);
  7367. Designate(p0,l);
  7368. ToMemory(l.op,addressType,0);
  7369. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7370. ReleaseOperand(l);
  7371. SetLabel(end);
  7372. ELSE
  7373. SetLabel(exit);
  7374. END;
  7375. END;
  7376. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7377. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7378. IF ~backend.cooperative THEN (* simpler version *)
  7379. (*
  7380. push len0
  7381. push len1
  7382. push len2
  7383. push len_size
  7384. push len_adr
  7385. push tag
  7386. push static elements
  7387. push element size
  7388. push adr
  7389. *)
  7390. dim := 0;
  7391. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7392. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7393. parameter := x.parameters.GetExpression(i);
  7394. Evaluate(parameter,r);
  7395. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7396. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7397. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7398. END;
  7399. Emit(Push(position,r.op));
  7400. ReleaseOperand(r);
  7401. INC(dim);
  7402. END;
  7403. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7404. Emit(Mov(position, adr, sp));
  7405. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7406. Emit(Push(position, adr));
  7407. ReleaseIntermediateOperand(adr);
  7408. openDim := dim;
  7409. staticLength := 1;
  7410. IF type IS SyntaxTree.ArrayType THEN
  7411. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7412. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7413. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7414. END;
  7415. END;
  7416. IF SemanticChecker.ContainsPointer(type) THEN
  7417. tmp := TypeDescriptorAdr(type);
  7418. IF ~newObjectFile THEN
  7419. IntermediateCode.MakeMemory(tmp,addressType);
  7420. END;
  7421. ELSE
  7422. tmp := nil;
  7423. END;
  7424. Emit(Push(position,tmp)); (* type descriptor *)
  7425. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7426. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7427. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7428. Designate(p0,l);
  7429. Emit(Push(position,l.op)); (* address *)
  7430. ReleaseOperand(l);
  7431. CallThis(position,"Heaps","NewArray", 6);
  7432. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7433. Emit(Add(position,sp,sp,tmp));
  7434. ELSE
  7435. dim := 0;
  7436. IntermediateCode.InitOperand(reg);
  7437. IF p1 # NIL THEN
  7438. FOR i := firstPar TO x.parameters.Length()-1 DO
  7439. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7440. parameter := x.parameters.GetExpression(i);
  7441. Evaluate(parameter,r);
  7442. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7443. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7444. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7445. END;
  7446. Emit(Push(position,r.op));
  7447. IF i=1 THEN
  7448. CopyInt(reg,r.op);
  7449. ELSE
  7450. MulInt(reg, reg, r.op);
  7451. END;
  7452. ReleaseOperand(r);
  7453. INC(dim);
  7454. END;
  7455. Convert(reg,addressType);
  7456. ELSE
  7457. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7458. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7459. END;
  7460. openDim := dim;
  7461. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7462. IF backend.cooperative THEN
  7463. size := ToMemoryUnits(system,system.SizeOf(type));
  7464. WHILE type IS SyntaxTree.ArrayType DO
  7465. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7466. END;
  7467. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7468. IF (size # 1) THEN
  7469. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7470. END;
  7471. Emit(Push(position,reg));
  7472. size := ToMemoryUnits(system,system.SizeOf(type));
  7473. IF (size # 1) THEN
  7474. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7475. END;
  7476. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7477. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7478. Emit(Push(position,reg));
  7479. ReleaseIntermediateOperand(reg);
  7480. CallThis(position,"Runtime","New", 1);
  7481. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7482. Emit(Result(position, pointer));
  7483. exit := NewLabel();
  7484. else := NewLabel();
  7485. BreqL(else,pointer,nil);
  7486. IF ~type.hasPointers THEN
  7487. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7488. ELSIF type IS SyntaxTree.RecordType THEN
  7489. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7490. ELSIF type IS SyntaxTree.ProcedureType THEN
  7491. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7492. ELSE
  7493. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7494. END;
  7495. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7496. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7497. 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))));
  7498. IF type IS SyntaxTree.RecordType THEN
  7499. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7500. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7501. ELSE
  7502. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7503. END;
  7504. i := openDim;
  7505. WHILE i > 0 DO
  7506. DEC (i);
  7507. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7508. END;
  7509. needsTrace := p0.NeedsTrace();
  7510. IF needsTrace THEN ModifyAssignments(true) END;
  7511. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7512. Emit(Push(position, pointer));
  7513. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7514. Emit(Pop(position, pointer));
  7515. END;
  7516. Designate(p0,l);
  7517. IF needsTrace THEN
  7518. CallAssignPointer(l.op, pointer);
  7519. ModifyAssignments(false);
  7520. ELSE
  7521. ToMemory(l.op,addressType,0);
  7522. Emit(Mov(position,l.op,pointer));
  7523. END;
  7524. ReleaseIntermediateOperand(pointer);
  7525. ReleaseOperand(l);
  7526. BrL(exit);
  7527. SetLabel(else);
  7528. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7529. Designate(p0,l);
  7530. IF needsTrace THEN
  7531. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7532. ELSE
  7533. ToMemory(l.op,addressType,0);
  7534. Emit(Mov(position,l.op,pointer));
  7535. END;
  7536. ReleaseOperand(l);
  7537. SetLabel(exit);
  7538. ELSE
  7539. (*! the following code is only correct for "standard" Oberon calling convention *)
  7540. IF SemanticChecker.ContainsPointer(type) THEN
  7541. IF type IS SyntaxTree.ArrayType THEN
  7542. staticLength := 1;
  7543. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7544. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7545. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7546. END;
  7547. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7548. MulInt(reg,reg,tmp);
  7549. END;
  7550. Designate(p0,l);
  7551. IF openDim > 0 THEN
  7552. Emit(Push(position,l.op)); (* address for use after syscall *)
  7553. END;
  7554. Emit(Push(position,l.op)); (* address *)
  7555. ReleaseOperand(l);
  7556. tmp := TypeDescriptorAdr(type);
  7557. IF ~newObjectFile THEN
  7558. IntermediateCode.MakeMemory(tmp,addressType);
  7559. END;
  7560. Emit(Push(position,tmp)); (* type descriptor *)
  7561. ReleaseIntermediateOperand(tmp);
  7562. Emit(Push(position,reg)); (* number Elements *)
  7563. ReleaseIntermediateOperand(reg);
  7564. tmp := IntermediateCode.Immediate(addressType,dim);
  7565. Emit(Push(position,tmp)); (* dimensions *)
  7566. (* push realtime flag *)
  7567. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7568. ELSE Emit(Push(position,false));
  7569. END;
  7570. CallThis(position,"Heaps","NewArr",5)
  7571. ELSE
  7572. size := ToMemoryUnits(system,system.SizeOf(type));
  7573. IF (size # 1) THEN
  7574. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7575. (*
  7576. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7577. *)
  7578. END;
  7579. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7580. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7581. AddInt(reg, reg, tmp);
  7582. (*
  7583. Emit(Add(position,reg,reg,tmp));
  7584. *)
  7585. Designate(p0,l);
  7586. IF openDim >0 THEN
  7587. Emit(Push(position,l.op)); (* address for use after syscall *)
  7588. END;
  7589. Emit(Push(position,l.op)); (* address for syscall *)
  7590. ReleaseOperand(l); (* pointer address *)
  7591. Emit(Push(position,reg)); (* size *)
  7592. ReleaseIntermediateOperand(reg);
  7593. (* push realtime flag *)
  7594. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7595. ELSE Emit(Push(position,false));
  7596. END;
  7597. CallThis(position,"Heaps","NewSys", 3)
  7598. END;
  7599. IF openDim > 0 THEN
  7600. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7601. Emit(Pop(position,adr));
  7602. ToMemory(adr,addressType,0);
  7603. ReuseCopy(tmp,adr);
  7604. ReleaseIntermediateOperand(adr);
  7605. adr := tmp;
  7606. else := NewLabel();
  7607. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7608. i := openDim-1;
  7609. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7610. WHILE (i >= 0) DO
  7611. Emit(Pop(position,reg));
  7612. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7613. Emit(Mov(position,res,reg));
  7614. DEC(i);
  7615. END;
  7616. ReleaseIntermediateOperand(adr);
  7617. ReleaseIntermediateOperand(reg);
  7618. exit := NewLabel();
  7619. BrL(exit);
  7620. SetLabel(else);
  7621. (* else part: array could not be allocated *)
  7622. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7623. Emit(Add(position,sp,sp,tmp));
  7624. SetLabel(exit);
  7625. END;
  7626. END;
  7627. END;
  7628. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7629. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7630. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7631. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7632. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7633. left.SetType(procedure.type);
  7634. formalParameter := procedureType.firstParameter;
  7635. (* push array to allocate *)
  7636. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7637. formalParameter :=formalParameter.nextParameter;
  7638. (* push length array *)
  7639. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7640. (* push size *)
  7641. type := t0;
  7642. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7643. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7644. END;
  7645. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7646. Emit(Push(position,tmp));
  7647. (* *)
  7648. IF SemanticChecker.ContainsPointer(type) THEN
  7649. tmp := TypeDescriptorAdr(type);
  7650. IF ~newObjectFile THEN
  7651. IntermediateCode.MakeMemory(tmp,addressType);
  7652. END;
  7653. ELSE
  7654. tmp := IntermediateCode.Immediate(addressType, 0);
  7655. END;
  7656. Emit(Push(position,tmp)); (* type descriptor *)
  7657. StaticCallOperand(result,procedure);
  7658. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7659. ReleaseOperand(result);
  7660. END;
  7661. (*
  7662. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7663. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7664. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7665. *)
  7666. ELSE
  7667. (*
  7668. push len0
  7669. push len1
  7670. push len2
  7671. push size
  7672. push len_adr
  7673. push element_size
  7674. push tag
  7675. push adr
  7676. *)
  7677. dim := 0;
  7678. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7679. isTensor := TRUE;
  7680. ELSE
  7681. isTensor := FALSE;
  7682. END;
  7683. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7684. IF ~isTensor THEN
  7685. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7686. END;
  7687. parameter := x.parameters.GetExpression(i);
  7688. Evaluate(parameter,r);
  7689. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7690. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7691. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7692. END;
  7693. Emit(Push(position,r.op));
  7694. ReleaseOperand(r);
  7695. INC(dim);
  7696. END;
  7697. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7698. Emit(Mov(position, adr, sp));
  7699. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7700. Emit(Push(position, adr));
  7701. ReleaseIntermediateOperand(adr);
  7702. openDim := dim;
  7703. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7704. IF isTensor THEN
  7705. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7706. ELSE
  7707. baseType := SemanticChecker.ArrayBase(type,openDim);
  7708. END;
  7709. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7710. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7711. IF SemanticChecker.ContainsPointer(baseType) THEN
  7712. tmp := TypeDescriptorAdr(baseType);
  7713. IF ~newObjectFile THEN
  7714. IntermediateCode.MakeMemory(tmp,addressType);
  7715. END;
  7716. ELSE
  7717. tmp := nil;
  7718. END;
  7719. Emit(Push(position,tmp)); (* type descriptor *)
  7720. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7721. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7722. ELSE (* error message has already been emited *)
  7723. RETURN;
  7724. END;
  7725. Designate(p0,l);
  7726. IF isTensor THEN
  7727. Emit(Push(position,l.op)); (* address *)
  7728. ELSE
  7729. Emit(Push(position,l.tag)); (* address *)
  7730. END;
  7731. ReleaseOperand(l);
  7732. StaticCallOperand(result,procedure);
  7733. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7734. ReleaseOperand(result);
  7735. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7736. Emit(Add(position,sp,sp,tmp));
  7737. END;
  7738. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7739. THEN
  7740. IF ~backend.cellsAreObjects THEN RETURN END;
  7741. IF InCellScope(currentScope) THEN
  7742. PushSelfPointer()
  7743. ELSE
  7744. Emit(Push(position, nil));
  7745. END;
  7746. (* push temp address *)
  7747. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7748. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7749. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7750. (* l.op contains address of pointer to record *)
  7751. Emit(Push(position,l.op)); (* address for use after syscall *)
  7752. ReleaseOperand(l);
  7753. (* push type descriptor *)
  7754. reg := TypeDescriptorAdr(baseType);
  7755. IF ~newObjectFile THEN
  7756. IntermediateCode.MakeMemory(reg,addressType);
  7757. END;
  7758. Emit(Push(position,reg));
  7759. ReleaseIntermediateOperand(reg);
  7760. (* push name *)
  7761. (*Global.GetSymbolName(p0, n);*)
  7762. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7763. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7764. ELSE
  7765. Global.GetModuleName(module.module, n);
  7766. END;
  7767. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7768. (*type.typeDeclaration.GetName(n);*)
  7769. PushConstString(n);
  7770. (* push cellnet boolean *)
  7771. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7772. (* push engine boolean *)
  7773. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7774. (* allocate *)
  7775. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7776. (* add capabilities *)
  7777. modifier := p0(SyntaxTree.Designator).modifiers;
  7778. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7779. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7780. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7781. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7782. END;
  7783. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7784. (*
  7785. modifier := baseType(SyntaxTree.CellType).modifiers;
  7786. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7787. modifier := p0(SyntaxTree.Designator).modifiers;
  7788. *)
  7789. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7790. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7791. (* l.op contains address of pointer to record *)
  7792. ToMemory(l.op,addressType,0);
  7793. (* l.op contains value of pointer to record *)
  7794. Emit(Push(position,l.op)); (* address for use after syscall *)
  7795. ReleaseOperand(l);
  7796. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7797. prevScope := currentScope;
  7798. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7799. previous := section;
  7800. section := init;
  7801. (* add ports *)
  7802. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7803. CloseInitializer(previous);
  7804. currentScope := prevScope;
  7805. Symbol(temporaryVariable,l);
  7806. ToMemory(l.op,addressType,0);
  7807. Emit(Push(position,l.op));
  7808. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7809. (*
  7810. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7811. IF constructor # NIL THEN
  7812. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7813. FOR i := 1 TO x.parameters.Length()-1 DO
  7814. p := x.parameters.GetExpression(i);
  7815. Global.GetSymbolName(parameter,name);
  7816. Evaluate(p, value);
  7817. ASSERT(value.type # NIL);
  7818. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7819. par := instance.AddParameter(name);
  7820. par.SetInteger(value.integer);
  7821. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7822. par := instance.AddParameter(name);
  7823. par.SetBoolean(value.boolean);
  7824. ELSE Error(x.position,NotYetImplemented)
  7825. END;
  7826. parameter := parameter.nextParameter
  7827. END;
  7828. END;
  7829. *)
  7830. (* call initializer *)
  7831. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7832. IF constructor # NIL THEN
  7833. (*! should be unified with ProcedureCallDesignator *)
  7834. IF backend.cellsAreObjects THEN
  7835. Symbol(temporaryVariable,l);
  7836. ToMemory(l.op,addressType,0);
  7837. Emit(Push(position,l.op));
  7838. ReleaseOperand(l);
  7839. END;
  7840. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7841. FOR i := firstPar TO x.parameters.Length()-1 DO
  7842. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7843. formalParameter := formalParameter.nextParameter;
  7844. END;
  7845. (* static call of the constructor *)
  7846. Global.GetSymbolSegmentedName(constructor,name);
  7847. ASSERT(~constructor.isInline);
  7848. IF constructor.scope.ownerModule # module.module THEN
  7849. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7850. ELSE
  7851. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7852. END;
  7853. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7854. (*ELSE
  7855. ReleaseIntermediateOperand(pointer);*)
  7856. END;
  7857. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7858. ToMemory(l.op, addressType, 0);
  7859. Designate(p0,s0);
  7860. ToMemory(s0.op,addressType,0);
  7861. Emit(Mov(position,s0.op,l.op));
  7862. ReleaseOperand(l);
  7863. ReleaseOperand(s0);
  7864. result.tag := emptyOperand;
  7865. (* start *)
  7866. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7867. (* push cell *)
  7868. Symbol(temporaryVariable, l);
  7869. ToMemory(l.op,addressType,0);
  7870. Emit(Push(Basic.invalidPosition,l.op));
  7871. (* push delegate *)
  7872. Emit(Push(Basic.invalidPosition,l.op));
  7873. ReleaseOperand(l);
  7874. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7875. Emit(Push(position, s1.op));
  7876. ReleaseOperand(s1);
  7877. CallThis(position,"ActiveCellsRuntime","Start",3);
  7878. END;
  7879. (*IF temporaryVariable # NIL THEN
  7880. end := NewLabel();
  7881. BrL(end);
  7882. SetLabel(exit);
  7883. Designate(p0,l);
  7884. ToMemory(l.op,addressType,0);
  7885. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7886. ReleaseOperand(l);
  7887. SetLabel(end);
  7888. ELSE
  7889. SetLabel(exit);
  7890. END;
  7891. *)
  7892. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7893. ELSE (* no pointer to record, no pointer to array *)
  7894. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7895. (* ignore new statement *)
  7896. Warning(p0.position, "cannot run on final hardware");
  7897. ELSE
  7898. HALT(200);
  7899. END;
  7900. END;
  7901. (* ---- ADDRESSOF----- *)
  7902. |Global.systemAdr:
  7903. Designate(p0,s0);
  7904. s0.mode := ModeValue;
  7905. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7906. ReleaseIntermediateOperand(s0.op);
  7907. s0.op := s0.tag;
  7908. IntermediateCode.InitOperand(s0.tag);
  7909. END;
  7910. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7911. result := s0;
  7912. (* ---- BIT ----- *)
  7913. |Global.systemBit:
  7914. Evaluate(p0,s0);
  7915. ToMemory(s0.op,addressType,0);
  7916. ReuseCopy(res,s0.op);
  7917. ReleaseOperand(s0);
  7918. Evaluate(p1,s1);
  7919. Emit(Ror(position,res,res,s1.op));
  7920. ReleaseOperand(s1);
  7921. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7922. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7923. IF ~conditional THEN
  7924. InitOperand(result,ModeValue); result.op := res;
  7925. ELSE
  7926. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7927. BrL(falseLabel);
  7928. ReleaseIntermediateOperand(res);
  7929. END;
  7930. (* --- MSK ----*)
  7931. |Global.systemMsk:
  7932. Evaluate(p0,s0);
  7933. Evaluate(p1,s1);
  7934. ReuseCopy(res,s0.op);
  7935. ReleaseOperand(s0);
  7936. Emit(And(position,res,res,s1.op));
  7937. ReleaseOperand(s1);
  7938. InitOperand(result,ModeValue);
  7939. result.op := res;
  7940. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7941. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7942. Evaluate(p0,s0);
  7943. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7944. ReleaseOperand(s0);
  7945. InitOperand(result,ModeValue);
  7946. result.op := res;
  7947. (* ---- SYSTEM.GetStackPointer ----- *)
  7948. |Global.systemGetStackPointer:
  7949. InitOperand(result,ModeValue);
  7950. result.op := sp;
  7951. (* ---- SYSTEM.GetFramePointer ----- *)
  7952. |Global.systemGetFramePointer:
  7953. InitOperand(result,ModeValue);
  7954. result.op := fp;
  7955. (* ---- SYSTEM.GetActivity ----- *)
  7956. |Global.systemGetActivity:
  7957. ASSERT(backend.cooperative);
  7958. InitOperand(result,ModeValue);
  7959. result.op := ap;
  7960. (* ---- SYSTEM.SetStackPointer ----- *)
  7961. |Global.systemSetStackPointer:
  7962. Evaluate(p0,s0); (* *)
  7963. Emit(Mov(position,sp,s0.op));
  7964. ReleaseOperand(s0);
  7965. (* ---- SYSTEM.SetFramePointer ----- *)
  7966. |Global.systemSetFramePointer:
  7967. Evaluate(p0,s0); (* *)
  7968. Emit(Mov(position,fp,s0.op));
  7969. ReleaseOperand(s0);
  7970. (* ---- SYSTEM.Activity ----- *)
  7971. |Global.systemSetActivity:
  7972. ASSERT(backend.cooperative);
  7973. Evaluate(p0,s0); (* *)
  7974. Emit(Mov(position,ap,s0.op));
  7975. ReleaseOperand(s0);
  7976. (* ---- SYSTEM.VAL ----- *)
  7977. |Global.systemVal:
  7978. Expression(p1);
  7979. s1 := result;
  7980. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7981. IF s1.mode = ModeReference THEN
  7982. (* nothing to be done if not record type, just take over new type *)
  7983. IF (type IS SyntaxTree.RecordType) THEN
  7984. ReleaseIntermediateOperand(s1.tag);
  7985. s1.tag := TypeDescriptorAdr(type);
  7986. IF ~newObjectFile THEN
  7987. IntermediateCode.MakeMemory(s1.tag,addressType);
  7988. END;
  7989. UseIntermediateOperand(s1.tag);
  7990. END;
  7991. result := s1;
  7992. ELSE (* copy over result to different type, may not use convert *)
  7993. itype := IntermediateCode.GetType(system,type);
  7994. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7995. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7996. Emit(Mov(position,s0.op,s1.op));
  7997. ReleaseOperand(s1);
  7998. InitOperand(result,ModeValue);
  7999. result.op := s0.op;
  8000. ELSE (* different size, must convert *)
  8001. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8002. Convert(s1.op, IntermediateCode.GetType(system,type));
  8003. result := s1;
  8004. END;
  8005. END;
  8006. (* ---- SYSTEM.GET ----- *)
  8007. |Global.systemGet:
  8008. Evaluate(p0,s0); (* adr *)
  8009. Designate(p1,s1); (* variable *)
  8010. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8011. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8012. Emit(Mov(position,s1.op,s0.op));
  8013. ReleaseOperand(s1);
  8014. ReleaseOperand(s0);
  8015. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8016. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8017. Evaluate(p0,s0); (* *)
  8018. Evaluate(p1,s1); (* variable *)
  8019. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8020. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8021. (* real part *)
  8022. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8023. Emit(Mov(position,res, s1.op));
  8024. ReleaseIntermediateOperand(res);
  8025. (* imaginary part *)
  8026. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8027. Emit(Mov(position,res, s1.tag));
  8028. ReleaseIntermediateOperand(res);
  8029. ReleaseOperand(s1);
  8030. ReleaseOperand(s0);
  8031. ELSE
  8032. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8033. ReleaseOperand(s0);
  8034. Emit(Mov(position,res,s1.op));
  8035. ReleaseIntermediateOperand(res);
  8036. ReleaseOperand(s1);
  8037. END;
  8038. (* ---- SYSTEM.MOVE ----- *)
  8039. |Global.systemMove:
  8040. Evaluate(p0,s0);
  8041. Evaluate(p1,s1);
  8042. Evaluate(p2,s2);
  8043. Emit(Copy(position,s1.op,s0.op,s2.op));
  8044. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8045. (* ---- SYSTEM.NEW ----- *)
  8046. |Global.systemNew:
  8047. Designate(p0,s0);
  8048. Emit(Push(position,s0.op));
  8049. ReleaseOperand(s0);
  8050. Evaluate(p1,s1);
  8051. Emit(Push(position,s1.op));
  8052. ReleaseOperand(s1);
  8053. (* push realtime flag: false by default *)
  8054. Emit(Push(position,false));
  8055. CallThis(position,"Heaps","NewSys",3);
  8056. (* ---- SYSTEM.CALL ----- *)
  8057. |Global.systemRef:
  8058. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8059. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8060. s0.mode := ModeValue;
  8061. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8062. result := s0
  8063. (* ---- INCR ----- *)
  8064. |Global.Incr:
  8065. Designate(p0,operand);
  8066. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8067. Dereference(operand,p0.type.resolved,FALSE);
  8068. END;
  8069. ASSERT(p1 # NIL);
  8070. Evaluate(p1,l);
  8071. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8072. ReleaseOperand(operand); ReleaseOperand(l);
  8073. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8074. (* ---- SUM ----- *)
  8075. |Global.Sum: HALT(200);
  8076. (* ---- ALL ----- *)
  8077. |Global.All: HALT(200);
  8078. (* ---- CAS ----- *)
  8079. |Global.Cas:
  8080. needsTrace := p0.NeedsTrace();
  8081. IF needsTrace THEN ModifyAssignments(true) END;
  8082. Designate(p0,s0);
  8083. Evaluate(p1,s1);
  8084. Evaluate(p2,s2);
  8085. IF needsTrace THEN
  8086. Emit(Push(position, s0.op));
  8087. Emit(Push(position, s1.op));
  8088. Emit(Push(position, s2.op));
  8089. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8090. ELSE
  8091. Emit(Cas(position,s0.op,s1.op,s2.op));
  8092. END;
  8093. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8094. IF needsTrace THEN ModifyAssignments(false) END;
  8095. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8096. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8097. IF conditional THEN
  8098. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8099. BrL(falseLabel);
  8100. ReleaseIntermediateOperand(res);
  8101. END;
  8102. (* ---- DIM ----- *)
  8103. |Global.Dim:
  8104. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8105. Designate(p0,s0);
  8106. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8107. Dereference(s0,p0.type.resolved,FALSE);
  8108. END;
  8109. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8110. ReleaseOperand(s0);
  8111. (* ---- RESHAPE ----- *)
  8112. |Global.Reshape:
  8113. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8114. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8115. left.SetType(procedure.type);
  8116. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8117. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8118. END;
  8119. (* ---- SYSTEM.TYPECODE ----- *)
  8120. |Global.systemTypeCode:
  8121. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8122. IF type.resolved IS SyntaxTree.PointerType THEN
  8123. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8124. END;
  8125. result.op := TypeDescriptorAdr(type);
  8126. IF ~newObjectFile THEN
  8127. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  8128. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  8129. END;
  8130. result.mode := ModeValue;
  8131. (* ---- SYSTEM.TRACE ----- *)
  8132. |Global.systemTrace:
  8133. SystemTrace(x.parameters, x.position);
  8134. (* ----- CONNECT ------*)
  8135. |Global.Connect:
  8136. IF backend.cellsAreObjects THEN
  8137. PushPort(p0);
  8138. PushPort(p1);
  8139. IF p2 # NIL THEN
  8140. Evaluate(p2, s2);
  8141. Emit(Push(p2.position, s2.op));
  8142. ReleaseOperand(s2);
  8143. ELSE
  8144. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8145. END;
  8146. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8147. ELSE
  8148. Warning(x.position, "cannot run on final hardware");
  8149. END;
  8150. (* ----- DELEGATE ------*)
  8151. |Global.Delegate:
  8152. IF backend.cellsAreObjects THEN
  8153. PushPort(p0);
  8154. PushPort(p1);
  8155. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8156. ELSE
  8157. Warning(x.position, "cannot run on final hardware");
  8158. END;
  8159. (* ----- SEND ------*)
  8160. |Global.Send:
  8161. Evaluate(p0,s0);
  8162. Evaluate(p1,s1);
  8163. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8164. Emit(Push(position,s0.op));
  8165. Emit(Push(position,s1.op));
  8166. (*
  8167. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8168. *)
  8169. IF ~backend.cellsAreObjects THEN
  8170. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8171. END;
  8172. ReleaseOperand(s0);
  8173. ReleaseOperand(s1);
  8174. IF backend.cellsAreObjects THEN
  8175. CallThis(position,"ActiveCellsRuntime","Send",2);
  8176. ELSE
  8177. CallThis(position,ChannelModuleName,"Send",2);
  8178. END;
  8179. (* ----- RECEIVE ------*)
  8180. |Global.Receive:
  8181. Evaluate(p0,s0);
  8182. Emit(Push(position,s0.op));
  8183. Designate(p1,s1);
  8184. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8185. Emit(Push(position,s1.op));
  8186. IF p2 # NIL THEN
  8187. Designate(p2,s2);
  8188. Emit(Push(position,s2.op));
  8189. END;
  8190. (*
  8191. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8192. *)
  8193. IF ~backend.cellsAreObjects THEN
  8194. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8195. END;
  8196. ReleaseOperand(s0);
  8197. ReleaseOperand(s1);
  8198. ReleaseOperand(s2);
  8199. IF backend.cellsAreObjects THEN
  8200. IF p2 = NIL THEN
  8201. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8202. ELSE
  8203. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8204. END;
  8205. ELSE
  8206. IF p2 = NIL THEN
  8207. CallThis(position,ChannelModuleName,"Receive",2)
  8208. ELSE
  8209. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8210. END;
  8211. END;
  8212. | Global.systemSpecial:
  8213. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8214. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8215. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8216. (* determine if parameters are of the VAR kind *)
  8217. ASSERT(x.parameters.Length() <= 3);
  8218. formalParameter := procedureType.firstParameter;
  8219. FOR i := 0 TO x.parameters.Length() - 1 DO
  8220. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8221. formalParameter := formalParameter.nextParameter
  8222. END;
  8223. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8224. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8225. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8226. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8227. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8228. IF procedureType.returnType # NIL THEN
  8229. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8230. Emit(Result(position, res));
  8231. (*InitOperand(result,ModeValue);
  8232. result.op := res;
  8233. *)
  8234. IF ~conditional THEN
  8235. InitOperand(result,ModeValue); result.op := res;
  8236. ELSE
  8237. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8238. BrL(falseLabel);
  8239. ReleaseIntermediateOperand(res);
  8240. END;
  8241. END
  8242. ELSE (* function not yet implemented *)
  8243. Error(position,"not yet implemented");
  8244. END;
  8245. destination := dest;
  8246. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8247. END VisitBuiltinCallDesignator;
  8248. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  8249. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8250. BEGIN
  8251. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8252. dest := destination; destination := emptyOperand;
  8253. Expression(x.left);
  8254. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8255. ELSIF isUnchecked THEN (* no check *)
  8256. ELSE
  8257. trueL := NewLabel();
  8258. falseL := NewLabel();
  8259. IF IsPointerToRecord(x.left.type,recordType) THEN
  8260. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8261. Emit(Mov(position,tag, result.op));
  8262. IF result.mode # ModeValue THEN
  8263. ptr := tag;
  8264. IntermediateCode.MakeMemory(ptr,addressType);
  8265. Emit(Mov(position,tag, ptr));
  8266. END;
  8267. IF ~backend.cooperative THEN
  8268. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8269. END;
  8270. IntermediateCode.MakeMemory(tag,addressType);
  8271. ELSE
  8272. tag := result.tag;
  8273. UseIntermediateOperand(tag);
  8274. END;
  8275. TypeTest(tag,x.type,trueL,falseL);
  8276. ReleaseIntermediateOperand(tag);
  8277. SetLabel(falseL);
  8278. EmitTrap(position,TypeCheckTrap);
  8279. SetLabel(trueL);
  8280. END;
  8281. destination := dest;
  8282. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8283. END VisitTypeGuardDesignator;
  8284. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8285. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8286. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8287. VAR label: Label; pc: LONGINT;
  8288. BEGIN
  8289. IF backend.cooperative & ~isUnchecked THEN
  8290. pc := section.pc;
  8291. label := NewLabel();
  8292. BrneL(label, operand.op, nil);
  8293. EmitTrap(position, NilPointerTrap);
  8294. SetLabel(label);
  8295. INC(statCoopNilCheck, section.pc - pc);
  8296. END;
  8297. END NilCheck;
  8298. BEGIN
  8299. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8300. ReuseCopy(dereferenced,operand.op);
  8301. ReleaseOperand(operand);
  8302. operand.mode := ModeReference;
  8303. operand.op := dereferenced;
  8304. operand.tag := dereferenced;
  8305. UseIntermediateOperand(operand.tag);
  8306. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8307. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8308. ReleaseIntermediateOperand(operand.tag);
  8309. operand.tag := TypeDescriptorAdr(type);
  8310. IF ~newObjectFile THEN
  8311. IntermediateCode.MakeMemory(operand.tag,addressType);
  8312. END;
  8313. ELSE
  8314. IF ~backend.cooperative THEN
  8315. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8316. END;
  8317. IntermediateCode.MakeMemory(operand.tag,addressType);
  8318. END;
  8319. NilCheck(operand.op);
  8320. ELSIF type IS SyntaxTree.ArrayType THEN
  8321. IF isUnsafe THEN
  8322. NilCheck(operand.op);
  8323. ReleaseIntermediateOperand(operand.tag);
  8324. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8325. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8326. ELSE
  8327. operand.tag := emptyOperand;
  8328. END;
  8329. ELSE
  8330. NilCheck(operand.op);
  8331. IF backend.cooperative THEN
  8332. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8333. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8334. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8335. ELSE
  8336. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8337. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8338. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8339. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8340. END;
  8341. END;
  8342. ELSIF type IS SyntaxTree.MathArrayType THEN
  8343. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8344. IntermediateCode.MakeMemory(operand.op,addressType);
  8345. ELSE HALT(100);
  8346. END;
  8347. END Dereference;
  8348. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8349. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8350. BEGIN
  8351. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8352. dest := destination; destination := emptyOperand;
  8353. Evaluate(x.left,d);
  8354. type := x.type.resolved;
  8355. prevIsUnchecked := isUnchecked;
  8356. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8357. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8358. END;
  8359. Dereference(d,type,IsUnsafePointer(x.left.type));
  8360. isUnchecked := prevIsUnchecked;
  8361. result := d;
  8362. 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
  8363. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8364. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8365. END;
  8366. END;
  8367. destination := dest;
  8368. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8369. END VisitDereferenceDesignator;
  8370. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8371. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8372. BEGIN
  8373. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8374. dest := destination; destination := emptyOperand;
  8375. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8376. tag := result.op;
  8377. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8378. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8379. StaticCallOperand(result,procedure.super);
  8380. ReleaseIntermediateOperand(result.tag);
  8381. UseIntermediateOperand(tag); (* necessary ? *)
  8382. result.tag := tag;
  8383. destination := dest;
  8384. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8385. END VisitSupercallDesignator;
  8386. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8387. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8388. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8389. name: Basic.SegmentedName;
  8390. procedure: SyntaxTree.Procedure;
  8391. procedureType: SyntaxTree.ProcedureType;
  8392. BEGIN
  8393. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8394. dest := destination; destination := emptyOperand;
  8395. scope := currentScope;
  8396. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8397. scope := scope.outerScope;
  8398. END;
  8399. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8400. IF newObjectFile THEN
  8401. moduleSection := meta.ModuleSection();
  8402. IF backend.cooperative THEN
  8403. moduleOffset := 0;
  8404. ELSE
  8405. moduleOffset := moduleSection.pc;
  8406. END;
  8407. result.mode := ModeValue;
  8408. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8409. ELSE
  8410. Symbol(moduleSelf,result);
  8411. IntermediateCode.MakeMemory(result.op,addressType);
  8412. END
  8413. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8414. result.mode := ModeValue;
  8415. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8416. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8417. ELSE
  8418. GetBaseRegister(basereg,currentScope,scope);
  8419. InitOperand(result,ModeReference);
  8420. result.op := basereg;
  8421. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8422. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8423. parametersSize := ProcedureParametersSize(system,procedure);
  8424. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8425. IF backend.cooperative THEN
  8426. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8427. END;
  8428. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8429. MakeMemory(result.op, result.op, addressType, 0);
  8430. END;
  8431. (* tag must be loaded when dereferencing SELF pointer *)
  8432. END;
  8433. destination := dest;
  8434. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8435. END VisitSelfDesignator;
  8436. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8437. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8438. BEGIN
  8439. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8440. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8441. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8442. parameter := procedureType.returnParameter;
  8443. IF currentIsInline THEN
  8444. map := currentMapper.Get(NIL);
  8445. IF map # NIL THEN
  8446. Designate(map.to, result);
  8447. ELSE
  8448. HALT(200);
  8449. END;
  8450. RETURN;
  8451. END;
  8452. VisitParameter(parameter);
  8453. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8454. END VisitResultDesignator;
  8455. (** values *)
  8456. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8457. BEGIN
  8458. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8459. IF conditional THEN
  8460. IF x.value THEN BrL(trueLabel)
  8461. ELSE BrL(falseLabel)
  8462. END;
  8463. ELSE
  8464. InitOperand(result,ModeValue);
  8465. IF x.value THEN result.op := true ELSE result.op := false END;
  8466. END;
  8467. END VisitBooleanValue;
  8468. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8469. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8470. BEGIN
  8471. Global.GetModuleSegmentedName(module.module, name);
  8472. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8473. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8474. RETURN section
  8475. END GetDataSection;
  8476. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8477. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8478. BEGIN
  8479. type := vop.type;
  8480. data := GetDataSection();
  8481. pc := EnterImmediate(data,vop);
  8482. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8483. IntermediateCode.MakeMemory(vop, type);
  8484. END GetImmediateMem;
  8485. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8486. BEGIN
  8487. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8488. InitOperand(result,ModeValue);
  8489. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8490. IF ~supportedImmediate(result.op) &~inData THEN
  8491. GetImmediateMem(result.op)
  8492. END;
  8493. END VisitIntegerValue;
  8494. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8495. BEGIN
  8496. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8497. InitOperand(result,ModeValue);
  8498. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8499. END VisitCharacterValue;
  8500. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8501. BEGIN
  8502. IF Trace THEN TraceEnter("VisitSetValue") END;
  8503. InitOperand(result,ModeValue);
  8504. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8505. END VisitSetValue;
  8506. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8507. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8508. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8509. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8510. BEGIN
  8511. numberElements := x.elements.Length();
  8512. FOR i := 0 TO numberElements-1 DO
  8513. expression := x.elements.GetExpression(i);
  8514. IF expression IS SyntaxTree.MathArrayExpression THEN
  8515. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8516. ELSE
  8517. inData := TRUE;
  8518. Evaluate(expression,op);
  8519. irv.Emit(Data(position,op.op));
  8520. inData := FALSE;
  8521. ReleaseOperand(op);
  8522. END;
  8523. END;
  8524. END RecursiveData;
  8525. BEGIN
  8526. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8527. IF ~TryConstantDeclaration() THEN
  8528. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8529. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8530. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8531. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8532. ELSE
  8533. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8534. END;
  8535. RecursiveData(x.array);
  8536. InitOperand(result,ModeReference);
  8537. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8538. END
  8539. END VisitMathArrayValue;
  8540. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8541. VAR constant: Sections.Section;
  8542. BEGIN
  8543. IF constantDeclaration = NIL THEN
  8544. RETURN FALSE
  8545. ELSE
  8546. (* Is a constant in this module: did we generate it already? *)
  8547. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8548. IF constant # NIL THEN
  8549. InitOperand(result,ModeReference);
  8550. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8551. RETURN TRUE;
  8552. END;
  8553. END;
  8554. RETURN FALSE
  8555. END TryConstantDeclaration;
  8556. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8557. BEGIN
  8558. constantDeclaration := x;
  8559. x.value.resolved.Accept(SELF);
  8560. END VisitConstant;
  8561. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8562. BEGIN
  8563. IF Trace THEN TraceEnter("VisitRealValue") END;
  8564. InitOperand(result,ModeValue);
  8565. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8566. END VisitRealValue;
  8567. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8568. VAR
  8569. componentType: SyntaxTree.Type;
  8570. BEGIN
  8571. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8572. ASSERT(x.type IS SyntaxTree.ComplexType);
  8573. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8574. InitOperand(result,ModeValue);
  8575. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8576. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8577. END VisitComplexValue;
  8578. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8579. VAR i: LONGINT; name: Basic.SegmentedName;
  8580. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8581. BEGIN
  8582. IF Trace THEN TraceEnter("VisitStringValue") END;
  8583. IF ~TryConstantDeclaration() THEN
  8584. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8585. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8586. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8587. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8588. ELSE
  8589. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8590. END;
  8591. FOR i := 0 TO x.length-1 DO
  8592. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8593. irv.Emit(Data(position,op));
  8594. END;
  8595. InitOperand(result,ModeReference);
  8596. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8597. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8598. END
  8599. END VisitStringValue;
  8600. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8601. BEGIN
  8602. IF Trace THEN TraceEnter("VisitNilValue") END;
  8603. InitOperand(result,ModeValue);
  8604. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8605. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8606. END VisitNilValue;
  8607. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8608. BEGIN
  8609. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8610. InitOperand(result,ModeValue);
  8611. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8612. END VisitEnumerationValue;
  8613. (** symbols *)
  8614. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8615. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8616. END VisitImport;
  8617. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8618. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8619. BEGIN
  8620. IF scope # baseScope THEN
  8621. (* left := [fp+8] *)
  8622. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8623. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8624. ReuseCopy(left,right);
  8625. ReleaseIntermediateOperand(right);
  8626. scope := scope.outerScope; DEC(level);
  8627. (* { left := [left+8] } *)
  8628. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8629. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8630. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8631. Emit(Mov(position,left,right));
  8632. scope := scope.outerScope; DEC(level);
  8633. END;
  8634. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8635. result := left;
  8636. ELSE
  8637. result := fp;
  8638. END;
  8639. END GetBaseRegister;
  8640. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8641. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8642. BEGIN
  8643. IF Trace THEN TraceEnter("VisitVariable"); END;
  8644. type := x.type.resolved;
  8645. IF (x.useRegister) THEN
  8646. InitOperand(result, ModeValue);
  8647. IF x.registerNumber < 0 THEN
  8648. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8649. reg := x.registerNumber;
  8650. ELSE
  8651. reg := registerUsageCount.Map(x.registerNumber);
  8652. UseRegister(reg);
  8653. END;
  8654. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8655. ELSIF x.externalName # NIL THEN
  8656. InitOperand(result,ModeReference);
  8657. Basic.ToSegmentedName(x.externalName^, name);
  8658. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8659. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8660. InitOperand(result,ModeReference);
  8661. GetBaseRegister(result.op,currentScope,x.scope);
  8662. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8663. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8664. InitOperand(result,ModeReference);
  8665. GetCodeSectionNameForSymbol(x,name);
  8666. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8667. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8668. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8669. InitOperand(result,ModeReference);
  8670. GetCodeSectionNameForSymbol(x,name);
  8671. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8672. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8673. ELSE (* field, left designator must have been emitted *)
  8674. ASSERT(result.mode = ModeReference);
  8675. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8676. ReuseCopy(temp,result.op);
  8677. ReleaseIntermediateOperand(result.op);
  8678. result.op := temp;
  8679. END;
  8680. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8681. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8682. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8683. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8684. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8685. END;
  8686. END;
  8687. END;
  8688. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8689. ValueToCondition(result);
  8690. ELSIF type IS SyntaxTree.ProcedureType THEN
  8691. ReleaseIntermediateOperand(result.tag);
  8692. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8693. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8694. UseIntermediateOperand(result.tag);
  8695. ELSE
  8696. result.tag := nil; (* nil *)
  8697. END;
  8698. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8699. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8700. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8701. ReleaseIntermediateOperand(result.tag);
  8702. Global.GetSymbolSegmentedName(x,name);
  8703. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8704. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8705. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8706. ELSE
  8707. END;
  8708. ELSE
  8709. ReleaseIntermediateOperand(result.tag);
  8710. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8711. END;
  8712. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8713. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8714. ReleaseIntermediateOperand(result.tag);
  8715. result.tag := result.op;
  8716. UseIntermediateOperand(result.tag);
  8717. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8718. IntermediateCode.MakeMemory(result.op,addressType);
  8719. END;
  8720. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8721. ReleaseIntermediateOperand(result.tag);
  8722. result.tag := TypeDescriptorAdr(type);
  8723. IF ~newObjectFile THEN
  8724. IntermediateCode.MakeMemory(result.tag,addressType);
  8725. END;
  8726. UseIntermediateOperand(result.tag);
  8727. (* tag for pointer type computed not here but during dereferencing *)
  8728. END;
  8729. IF Trace THEN TraceExit("VisitVariable") END;
  8730. END VisitVariable;
  8731. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8732. BEGIN
  8733. VisitVariable(property);
  8734. END VisitProperty;
  8735. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8736. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8737. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8738. BEGIN
  8739. type := x.type.resolved;
  8740. IF Trace THEN TraceEnter("VisitParameter") END;
  8741. IF x.ownerType IS SyntaxTree.CellType THEN
  8742. ptype := x.type.resolved;
  8743. IF backend.cellsAreObjects THEN
  8744. ASSERT(result.mode = ModeReference);
  8745. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8746. ReuseCopy(temp,result.op);
  8747. ReleaseIntermediateOperand(result.op);
  8748. result.op := temp;
  8749. END;
  8750. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8751. RETURN;
  8752. ELSE
  8753. InitOperand(result,ModeReference);
  8754. GetCodeSectionNameForSymbol(x,name);
  8755. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8756. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8757. RETURN;
  8758. END;
  8759. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8760. InitOperand(result,ModeReference);
  8761. GetCodeSectionNameForSymbol(x,name);
  8762. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8763. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8764. RETURN
  8765. ELSE
  8766. GetBaseRegister(basereg,currentScope,x.scope);
  8767. InitOperand(result,ModeReference);
  8768. result.op := basereg;
  8769. END;
  8770. IF IsOpenArray(type) THEN
  8771. result.tag := basereg;
  8772. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8773. IntermediateCode.MakeMemory(result.op,addressType);
  8774. IF Global.IsOberonProcedure(x.ownerType) THEN
  8775. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8776. UseIntermediateOperand(result.tag);
  8777. ELSE
  8778. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8779. END;
  8780. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8781. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8782. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8783. ELSIF IsStaticArray(type) THEN
  8784. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8785. IntermediateCode.MakeMemory(result.op,addressType);
  8786. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8787. ELSIF type IS SyntaxTree.MathArrayType THEN
  8788. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8789. WITH type: SyntaxTree.MathArrayType DO
  8790. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8791. IF type.form = SyntaxTree.Tensor THEN
  8792. ELSIF type.form = SyntaxTree.Open THEN
  8793. result.tag := result.op;
  8794. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8795. IntermediateCode.MakeMemory(result.op,addressType);
  8796. UseIntermediateOperand(result.tag);
  8797. ELSIF type.form = SyntaxTree.Static THEN
  8798. IF x.kind = SyntaxTree.ConstParameter THEN
  8799. IntermediateCode.MakeMemory(result.op,addressType);
  8800. END;
  8801. ELSE HALT(100)
  8802. END;
  8803. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8804. IF type.form = SyntaxTree.Tensor THEN
  8805. ToMemory(result.op,addressType,0);
  8806. ELSIF type.form = SyntaxTree.Open THEN
  8807. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8808. ReuseCopy(result.tag, mem);
  8809. ReleaseIntermediateOperand(mem);
  8810. ReleaseIntermediateOperand(result.op);
  8811. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8812. ELSIF type.form = SyntaxTree.Static THEN
  8813. IntermediateCode.MakeMemory(result.op,addressType);
  8814. ELSE HALT(100)
  8815. END;
  8816. ELSE HALT(100)
  8817. END;
  8818. END;
  8819. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8820. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8821. IntermediateCode.MakeMemory(result.op,addressType);
  8822. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8823. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8824. END;
  8825. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8826. ValueToCondition(result);
  8827. ELSIF type IS SyntaxTree.ProcedureType THEN
  8828. ReleaseIntermediateOperand(result.tag);
  8829. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8830. IF x.kind = SyntaxTree.VarParameter THEN
  8831. ReuseCopy(result.tag,result.op);
  8832. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8833. IntermediateCode.MakeMemory(result.tag,addressType);
  8834. ELSE
  8835. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8836. UseIntermediateOperand(result.tag);
  8837. END;
  8838. ELSE
  8839. result.tag := nil;
  8840. END;
  8841. (* tag for pointer type computed not here but during dereferencing *)
  8842. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  8843. ReleaseIntermediateOperand(result.tag);
  8844. result.tag := basereg;
  8845. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8846. IntermediateCode.MakeMemory(result.tag,addressType);
  8847. UseIntermediateOperand(result.tag);
  8848. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  8849. ReleaseIntermediateOperand(result.tag);
  8850. result.tag := TypeDescriptorAdr(type);
  8851. IF ~newObjectFile THEN
  8852. IntermediateCode.MakeMemory(result.tag,addressType);
  8853. END;
  8854. UseIntermediateOperand(result.tag);
  8855. END;
  8856. IF Trace THEN TraceExit("VisitParameter") END;
  8857. END VisitParameter;
  8858. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8859. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8860. BEGIN
  8861. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8862. (* left.p: left already emitted *)
  8863. tag := result.op; (* value of pointer to left *)
  8864. (* get type desc *)
  8865. tmp := result.tag;
  8866. IntermediateCode.MakeMemory(tmp,addressType);
  8867. (* get method adr *)
  8868. Reuse1(reg,tmp);
  8869. ReleaseIntermediateOperand(tmp);
  8870. IF backend.cooperative THEN
  8871. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8872. WHILE recordType.baseType # NIL DO
  8873. recordType := recordType.GetBaseRecord ();
  8874. END;
  8875. GetRecordTypeName (recordType,name);
  8876. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8877. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8878. offset := 0;
  8879. ELSE
  8880. offset := 2;
  8881. END;
  8882. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8883. ELSE
  8884. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8885. END;
  8886. InitOperand(operand,ModeReference);
  8887. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8888. operand.op := reg;
  8889. operand.tag := tag;
  8890. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8891. END DynamicCallOperand;
  8892. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8893. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8894. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8895. BEGIN
  8896. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8897. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8898. tag := operand.op;
  8899. ReleaseIntermediateOperand(operand.tag);
  8900. ELSE tag := nil
  8901. END;
  8902. IF x.isInline THEN
  8903. sectionType := Sections.InlineCodeSection;
  8904. ELSE
  8905. sectionType := Sections.CodeSection;
  8906. END;
  8907. IF x.externalName # NIL THEN
  8908. Basic.ToSegmentedName(x.externalName^, name);
  8909. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8910. ELSE
  8911. GetCodeSectionNameForSymbol(x, name);
  8912. IF (x.scope.ownerModule = module.module) THEN
  8913. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8914. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8915. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8916. IF source.pc = 0 THEN (* no code yet *)
  8917. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8918. END;
  8919. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8920. bits := x.procedureScope.body.code.inlineCode;
  8921. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8922. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8923. binary.CopyBits(bits, 0, bits.GetSize());
  8924. source.SetResolved(binary);
  8925. ELSE
  8926. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8927. END;
  8928. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8929. END;
  8930. InitOperand(operand,ModeValue);
  8931. operand.op := reg;
  8932. operand.tag := tag;
  8933. IF Trace THEN TraceExit("StaticCallOperand") END;
  8934. END StaticCallOperand;
  8935. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8936. (* handle expressions of the form designator.procedure or procedure *)
  8937. BEGIN
  8938. IF Trace THEN TraceEnter("VisitProcedure") END;
  8939. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  8940. DynamicCallOperand(result,x);
  8941. ELSIF x.isInline THEN
  8942. StaticCallOperand(result,x);
  8943. ELSE
  8944. StaticCallOperand(result,x);
  8945. END;
  8946. IF Trace THEN TraceExit("VisitProcedure") END;
  8947. END VisitProcedure;
  8948. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8949. BEGIN
  8950. VisitProcedure(x);
  8951. END VisitOperator;
  8952. (** statements *)
  8953. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8954. BEGIN
  8955. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8956. Expression(x.call);
  8957. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8958. ReleaseOperand(result)
  8959. END;
  8960. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8961. END VisitProcedureCallStatement;
  8962. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8963. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8964. leftBase, rightBase: SyntaxTree.Type;
  8965. procedureName,s: SyntaxTree.IdentifierString;
  8966. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8967. size: LONGINT; rightKind: LONGINT;
  8968. dummy: IntermediateCode.Operand;
  8969. CONST moduleName = "FoxArrayBase";
  8970. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8971. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8972. BEGIN
  8973. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8974. IF base IS SyntaxTree.MathArrayType THEN
  8975. base := OpenArray(base(SyntaxTree.MathArrayType));
  8976. END;
  8977. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8978. result.SetArrayBase(base);
  8979. RETURN result
  8980. END OpenArray;
  8981. BEGIN
  8982. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8983. SaveRegisters();ReleaseUsedRegisters(saved);
  8984. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8985. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8986. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8987. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8988. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8989. IF leftType.form = SyntaxTree.Tensor THEN
  8990. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8991. ELSIF leftType.form = SyntaxTree.Open THEN
  8992. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8993. ELSIF leftType.form = SyntaxTree.Static THEN
  8994. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8995. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8996. END;
  8997. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8998. IF procedure = NIL THEN
  8999. s := "Instruction not supported on target, emulation procedure ";
  9000. Strings.Append(s,moduleName);
  9001. Strings.Append(s,".");
  9002. Strings.Append(s,procedureName);
  9003. Strings.Append(s," not present");
  9004. Error(position,s);
  9005. ELSE
  9006. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9007. parameter.SetType(leftType);
  9008. parameter.SetAccess(SyntaxTree.Internal);
  9009. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9010. parameter.SetKind(rightKind);
  9011. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9012. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9013. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  9014. StaticCallOperand(result,procedure);
  9015. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  9016. ReleaseOperand(result);
  9017. END;
  9018. RestoreRegisters(saved);
  9019. END;
  9020. END AssignMathArray;
  9021. VAR modifyAssignmentCounter := 0: LONGINT;
  9022. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9023. VAR processor,mem,dst: IntermediateCode.Operand;
  9024. BEGIN
  9025. IF value.intValue = true.intValue THEN
  9026. INC(modifyAssignmentCounter);
  9027. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9028. modifyAssignmentsPC := section.pc;
  9029. ELSE
  9030. DEC(modifyAssignmentCounter);
  9031. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9032. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9033. END;
  9034. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9035. dst := NewRegisterOperand (addressType);
  9036. Emit(Mov(position,dst, processor));
  9037. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9038. Emit(Mov(position,mem, value));
  9039. ReleaseIntermediateOperand(dst);
  9040. END ModifyAssignments;
  9041. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9042. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9043. BEGIN
  9044. type := left.type.resolved;
  9045. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9046. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9047. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9048. IF procedureType.returnParameter = parameter THEN
  9049. (* this is the only case where the destination can be dynamically smaller than the source
  9050. in all other cases the dynamic size has to be taken
  9051. *)
  9052. IF backend.cooperative THEN
  9053. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9054. ELSE
  9055. MakeMemory(mem, tag, addressType, 0);
  9056. END;
  9057. RETURN mem;
  9058. END;
  9059. END;
  9060. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9061. END CopySize;
  9062. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9063. VAR
  9064. leftO, rightO: Operand;
  9065. arg,mem, sizeOp: IntermediateCode.Operand;
  9066. leftType, rightType, componentType, base: SyntaxTree.Type;
  9067. size: LONGINT;
  9068. parameters: SyntaxTree.ExpressionList;
  9069. procedure: SyntaxTree.Procedure;
  9070. call: SyntaxTree.ProcedureCallDesignator;
  9071. designator: SyntaxTree.Designator;
  9072. saved: RegisterEntry;
  9073. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9074. VAR procedureType: SyntaxTree.ProcedureType;
  9075. BEGIN
  9076. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9077. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9078. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9079. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9080. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9081. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9082. IF right.id = Global.Reshape THEN RETURN TRUE
  9083. END;
  9084. END;
  9085. END;
  9086. END;
  9087. RETURN FALSE
  9088. END CanPassAsResultParameter;
  9089. BEGIN
  9090. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9091. leftType := left.type.resolved; rightType:= right.type.resolved;
  9092. IF backend.cooperative & left.NeedsTrace() THEN
  9093. ModifyAssignments(true);
  9094. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9095. Designate(right, rightO);
  9096. Designate(left, leftO);
  9097. ASSERT(leftO.mode = ModeReference);
  9098. TransferToRegister(leftO.op, leftO.op);
  9099. TransferToRegister(rightO.op, rightO.op);
  9100. Emit(Push(position, leftO.op));
  9101. Emit(Push(position, rightO.op));
  9102. CallAssignMethod(leftO.op, rightO.op, left.type);
  9103. Emit(Pop(position, rightO.op));
  9104. Emit(Pop(position, leftO.op));
  9105. sizeOp := CopySize(left, leftO.tag);
  9106. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9107. ReleaseIntermediateOperand(sizeOp);
  9108. ReleaseOperand(leftO);
  9109. ReleaseOperand(rightO);
  9110. ELSE
  9111. Evaluate(right,rightO);
  9112. Designate(left,leftO);
  9113. ASSERT(leftO.mode = ModeReference);
  9114. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9115. (* copy procedure address first *)
  9116. MakeMemory(mem,leftO.op,addressType,0);
  9117. Emit(Mov(position,mem,rightO.op));
  9118. ReleaseIntermediateOperand(mem);
  9119. (* copy pointer address *)
  9120. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9121. CallAssignPointer(leftO.tag, rightO.tag);
  9122. ELSE
  9123. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9124. CallAssignPointer(leftO.op, rightO.op);
  9125. END;
  9126. ReleaseOperand(leftO);
  9127. ReleaseOperand(rightO);
  9128. END;
  9129. ModifyAssignments(false);
  9130. RETURN;
  9131. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9132. SaveRegisters();ReleaseUsedRegisters(saved);
  9133. IF SemanticChecker.IsPointerType(leftType) THEN
  9134. Evaluate(right,rightO);
  9135. Designate(left,leftO);
  9136. Emit(Push(position,leftO.op));
  9137. ReleaseOperand(leftO);
  9138. Emit(Push(position,rightO.op));
  9139. ReleaseOperand(rightO);
  9140. CallThis(position,"Heaps","Assign",2);
  9141. ELSIF leftType.IsRecordType() THEN
  9142. Designate(right,rightO);
  9143. Designate(left,leftO);
  9144. Emit(Push(position,leftO.op));
  9145. Emit(Push(position,leftO.tag)); (* type desc *)
  9146. ReleaseOperand(leftO);
  9147. Emit(Push(position,rightO.op));
  9148. ReleaseOperand(rightO);
  9149. CallThis(position,"Heaps","AssignRecord",3);
  9150. ELSIF IsStaticArray(leftType) THEN
  9151. size := StaticArrayNumElements(leftType);
  9152. base := StaticArrayBaseType(leftType);
  9153. Designate(right,rightO);
  9154. Designate(left,leftO);
  9155. Emit(Push(position,leftO.op));
  9156. ReleaseOperand(leftO);
  9157. arg := TypeDescriptorAdr(base);
  9158. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9159. Emit(Push(position,arg));
  9160. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9161. Emit(Push(position,rightO.op));
  9162. ReleaseOperand(rightO);
  9163. CallThis(position,"Heaps","AssignArray",4);
  9164. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9165. size := StaticMathArrayNumElements(leftType);
  9166. base := StaticMathArrayBaseType(leftType);
  9167. Designate(right,rightO);
  9168. Designate(left,leftO);
  9169. Emit(Push(position,leftO.op));
  9170. ReleaseOperand(leftO);
  9171. arg := TypeDescriptorAdr(base);
  9172. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9173. Emit(Push(position,arg));
  9174. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9175. Emit(Push(position,rightO.op));
  9176. ReleaseOperand(rightO);
  9177. CallThis(position,"Heaps","AssignArray",4);
  9178. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9179. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9180. Evaluate(right,rightO);
  9181. Designate(left,leftO);
  9182. MakeMemory(mem,leftO.op,addressType,0);
  9183. Emit(Mov(position,mem,rightO.op));
  9184. ReleaseIntermediateOperand(mem);
  9185. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9186. Emit (Push(position, leftO.tag));
  9187. ReleaseOperand(leftO);
  9188. Emit (Push(position, rightO.tag));
  9189. ReleaseOperand(rightO);
  9190. CallThis(position,"Heaps","Assign", 2);
  9191. ELSE HALT(100); (* missing ? *)
  9192. END;
  9193. RestoreRegisters(saved);
  9194. RETURN;
  9195. END;
  9196. IF CanPassAsResultParameter(right) THEN
  9197. procedureResultDesignator := left(SyntaxTree.Designator);
  9198. Expression(right);
  9199. procedureResultDesignator := NIL;
  9200. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9201. (* left <-- ALIAS OF right: zerocopy *)
  9202. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9203. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9204. designator.SetType(procedure.type);
  9205. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9206. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9207. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9208. END;
  9209. ELSIF leftType IS SyntaxTree.RangeType THEN
  9210. (* LHS is of array range type *)
  9211. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9212. Evaluate(right, rightO);
  9213. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9214. (* first *)
  9215. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  9216. Emit(Mov(position,mem, rightO.op));
  9217. ReleaseIntermediateOperand(mem);
  9218. (* last *)
  9219. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9220. Emit(Mov(position,mem, rightO.tag));
  9221. ReleaseIntermediateOperand(mem);
  9222. (* step *)
  9223. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9224. Emit(Mov(position,mem, rightO.extra));
  9225. ReleaseIntermediateOperand(mem);
  9226. ReleaseOperand(rightO);
  9227. ReleaseOperand(leftO)
  9228. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9229. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9230. Evaluate(right, rightO);
  9231. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9232. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9233. (* real part *)
  9234. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9235. Emit(Mov(position,mem, rightO.op));
  9236. ReleaseIntermediateOperand(mem);
  9237. (* imaginary part *)
  9238. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9239. Emit(Mov(position,mem, rightO.tag));
  9240. ReleaseIntermediateOperand(mem);
  9241. ReleaseOperand(rightO);
  9242. ReleaseOperand(leftO)
  9243. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9244. OR (leftType IS SyntaxTree.PortType) THEN
  9245. (* rightO := leftO;*)
  9246. Evaluate(right,rightO);
  9247. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9248. Designate(left,leftO);
  9249. IF leftO.mode = ModeReference THEN
  9250. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9251. destination := mem;
  9252. ELSE
  9253. destination := leftO.op;
  9254. END;
  9255. ReleaseOperand(leftO);
  9256. IF destination.mode # IntermediateCode.Undefined THEN
  9257. Emit(Mov(position,destination,rightO.op));
  9258. END;
  9259. ReleaseOperand(rightO);
  9260. ReleaseIntermediateOperand(mem);
  9261. IntermediateCode.InitOperand(destination);
  9262. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9263. Evaluate(right,rightO);
  9264. Designate(left,leftO);
  9265. MakeMemory(mem,leftO.op,addressType,0);
  9266. Emit(Mov(position,mem,rightO.op));
  9267. ReleaseIntermediateOperand(mem);
  9268. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9269. (* delegate *)
  9270. (*
  9271. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9272. *)
  9273. Emit(Mov(position,leftO.tag,rightO.tag));
  9274. END;
  9275. ReleaseOperand(leftO);
  9276. ReleaseOperand(rightO);
  9277. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9278. Designate(right,rightO);
  9279. Designate(left,leftO);
  9280. sizeOp := CopySize(left, leftO.tag);
  9281. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9282. ReleaseIntermediateOperand(sizeOp);
  9283. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9284. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9285. IF (rightType IS SyntaxTree.StringType) THEN
  9286. CopyString(left,right);
  9287. 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
  9288. Designate(right,rightO);
  9289. Designate(left,leftO);
  9290. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9291. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9292. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9293. ELSE
  9294. HALT(201)
  9295. END;
  9296. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9297. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9298. Designate(right,rightO);
  9299. Designate(left,leftO);
  9300. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9301. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9302. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9303. ELSE
  9304. AssignMathArray(left,right);
  9305. END;
  9306. ELSE
  9307. HALT(200);
  9308. END;
  9309. END Assign;
  9310. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  9311. BEGIN
  9312. IF Trace THEN TraceEnter("VisitAssignment") END;
  9313. Assign(x.left,x.right);
  9314. IF Trace THEN TraceExit("VisitAssignment") END;
  9315. END VisitAssignment;
  9316. PROCEDURE EmitCooperativeSwitch;
  9317. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9318. BEGIN
  9319. ASSERT (cooperativeSwitches);
  9320. pc := section.pc;
  9321. IF lastSwitchPC = section.pc THEN RETURN END;
  9322. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9323. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9324. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9325. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9326. INC(statCoopSwitch, section.pc - pc);
  9327. END EmitCooperativeSwitch;
  9328. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  9329. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9330. BEGIN
  9331. p0 := communication.left; p1 := communication.right;
  9332. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9333. Evaluate(p0,s0);
  9334. Evaluate(p1,s1);
  9335. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9336. Emit(Push(position,s0.op));
  9337. Emit(Push(position,s1.op));
  9338. (*
  9339. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9340. *)
  9341. IF ~backend.cellsAreObjects THEN
  9342. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9343. END;
  9344. ReleaseOperand(s0);
  9345. ReleaseOperand(s1);
  9346. IF backend.cellsAreObjects THEN
  9347. CallThis(position,"ActiveCellsRuntime","Send",2);
  9348. ELSE
  9349. CallThis(position,ChannelModuleName,"Send",2);
  9350. END;
  9351. (* ----- RECEIVE ------*)
  9352. ELSE
  9353. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9354. tmp := p0; p0 := p1; p1 := tmp;
  9355. END;
  9356. Evaluate(p0,s0);
  9357. Emit(Push(position,s0.op));
  9358. Designate(p1,s1);
  9359. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9360. Emit(Push(position,s1.op));
  9361. (*
  9362. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9363. *)
  9364. IF ~backend.cellsAreObjects THEN
  9365. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9366. END;
  9367. ReleaseOperand(s0);
  9368. ReleaseOperand(s1);
  9369. IF backend.cellsAreObjects THEN
  9370. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9371. ELSE
  9372. CallThis(position,ChannelModuleName,"Receive",2)
  9373. END;
  9374. END;
  9375. END VisitCommunicationStatement;
  9376. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  9377. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9378. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9379. VAR true, false: Label; condition, value: BOOLEAN;
  9380. BEGIN
  9381. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9382. IF condition THEN
  9383. true := NewLabel();
  9384. false := NewLabel();
  9385. Condition(if.condition,true,false);
  9386. SetLabel(true);
  9387. StatementSequence(if.statements);
  9388. BrL(end);
  9389. SetLabel(false);
  9390. ELSE
  9391. IF value THEN (* always true *)
  9392. escape := TRUE;
  9393. StatementSequence(if.statements);
  9394. (* no branch necessary -- rest skipped *)
  9395. END;
  9396. END;
  9397. END IfPart;
  9398. BEGIN
  9399. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9400. end := NewLabel();
  9401. elsifs := x.ElsifParts();
  9402. IfPart(x.ifPart);
  9403. FOR i := 0 TO elsifs-1 DO
  9404. IF ~escape THEN
  9405. elsif := x.GetElsifPart(i);
  9406. IfPart(elsif);
  9407. END;
  9408. END;
  9409. IF (x.elsePart # NIL) & ~escape THEN
  9410. StatementSequence(x.elsePart);
  9411. END;
  9412. SetLabel(end);
  9413. IF Trace THEN TraceExit("VisitIfStatement") END;
  9414. END VisitIfStatement;
  9415. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9416. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9417. BEGIN
  9418. (*IF x.variable.type.resolved = x.type.resolved THEN
  9419. (* always true, do nothing *)
  9420. ELSE*)
  9421. Designate(x.variable,res);
  9422. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9423. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9424. END;
  9425. trueL := NewLabel();
  9426. TypeTest(res.tag,x.type,trueL,falseL);
  9427. ReleaseOperand(res);
  9428. SetLabel(trueL);
  9429. StatementSequence(x.statements);
  9430. BrL(endL);
  9431. END WithPart;
  9432. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9433. VAR endL,falseL: Label;i: LONGINT;
  9434. BEGIN
  9435. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9436. endL := NewLabel();
  9437. FOR i := 0 TO x.WithParts()-1 DO
  9438. falseL := NewLabel();
  9439. WithPart(x.GetWithPart(i),falseL,endL);
  9440. SetLabel(falseL);
  9441. END;
  9442. IF x.elsePart = NIL THEN
  9443. IF ~isUnchecked THEN
  9444. EmitTrap(position,WithTrap);
  9445. END;
  9446. ELSE
  9447. StatementSequence(x.elsePart)
  9448. END;
  9449. SetLabel(endL);
  9450. IF Trace THEN TraceExit("VisitWithStatement") END;
  9451. END VisitWithStatement;
  9452. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9453. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9454. out,else: Label; label: Label;
  9455. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9456. symbol: SyntaxTree.Symbol;
  9457. BEGIN
  9458. (*! split case statement into if-elsif statements for large case label lists *)
  9459. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9460. size := x.max-x.min+1;
  9461. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9462. END;
  9463. Evaluate(x.variable,var);
  9464. ReuseCopy(tmp,var.op);
  9465. ReleaseIntermediateOperand(var.op);
  9466. var.op := tmp;
  9467. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9468. Convert(var.op,addressType);
  9469. size := x.max-x.min+1;
  9470. else := NewLabel();
  9471. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9472. (*
  9473. UniqueId(name,module.module,"case",caseId);
  9474. *)
  9475. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9476. Global.GetModuleSegmentedName(module.module, name);
  9477. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9478. symbol := SyntaxTree.NewSymbol(name[1]);
  9479. symbol.SetScope(moduleScope);
  9480. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9481. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9482. section.isCaseTable := TRUE;
  9483. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9484. ReuseCopy(res,var.op);
  9485. ReleaseOperand(var);
  9486. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9487. Emit(Add(position,res,res,jmp));
  9488. IntermediateCode.MakeMemory(res,addressType);
  9489. Emit(Br(position,res));
  9490. ReleaseIntermediateOperand(res);
  9491. out := NewLabel();
  9492. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9493. part := x.GetCasePart(i);
  9494. constant := part.firstConstant;
  9495. label := NewLabel();
  9496. SetLabel(label);
  9497. WHILE(constant # NIL) DO (* case labels for this case part *)
  9498. FOR j := constant.min TO constant.max DO
  9499. fixups[j-x.min] := label;
  9500. END;
  9501. constant := constant.next;
  9502. END;
  9503. StatementSequence(part.statements);
  9504. BrL(out);
  9505. END;
  9506. SetLabel(else);
  9507. FOR i := 0 TO size-1 DO
  9508. IF fixups[i] = NIL THEN
  9509. fixups[i] := else;
  9510. END;
  9511. END;
  9512. IF x.elsePart # NIL THEN
  9513. StatementSequence(x.elsePart);
  9514. ELSIF ~isUnchecked THEN
  9515. EmitTrap(position,CaseTrap);
  9516. END;
  9517. SetLabel(out);
  9518. FOR i := 0 TO size-1 DO
  9519. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9520. section.Emit(Data(position,op));
  9521. END;
  9522. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9523. END VisitCaseStatement;
  9524. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9525. VAR start: Label; true,false: Label;
  9526. BEGIN
  9527. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9528. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9529. start := NewLabel();
  9530. true := NewLabel();
  9531. false := NewLabel();
  9532. SetLabel(start);
  9533. Condition(x.condition,true,false);
  9534. SetLabel(true);
  9535. StatementSequence(x.statements);
  9536. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9537. BrL(start);
  9538. SetLabel(false);
  9539. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9540. END VisitWhileStatement;
  9541. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9542. VAR false,true: Label;
  9543. BEGIN
  9544. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9545. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9546. true := NewLabel();
  9547. false := NewLabel();
  9548. SetLabel(false);
  9549. StatementSequence(x.statements);
  9550. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9551. Condition(x.condition,true,false);
  9552. SetLabel(true);
  9553. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9554. END VisitRepeatStatement;
  9555. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9556. VAR
  9557. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9558. temporaryVariable: SyntaxTree.Variable;
  9559. temporaryVariableDesignator : SyntaxTree.Designator;
  9560. BEGIN
  9561. IF Trace THEN TraceEnter("VisitForStatement") END;
  9562. true := NewLabel();
  9563. false := NewLabel();
  9564. start := NewLabel();
  9565. Assign(x.variable,x.from);
  9566. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9567. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9568. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9569. Assign(temporaryVariableDesignator,x.to);
  9570. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9571. IF by > 0 THEN
  9572. cmp := Scanner.LessEqual
  9573. ELSE
  9574. cmp := Scanner.GreaterEqual
  9575. END;
  9576. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9577. binary.SetType(system.booleanType);
  9578. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9579. SetLabel(start);
  9580. Condition(binary,true,false);
  9581. SetLabel(true);
  9582. StatementSequence(x.statements);
  9583. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9584. binary.SetType(x.variable.type);
  9585. Assign(x.variable,binary);
  9586. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9587. BrL(start);
  9588. SetLabel(false);
  9589. IF Trace THEN TraceExit("VisitForStatement") END;
  9590. END VisitForStatement;
  9591. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9592. VAR prevLoop: Label;
  9593. BEGIN
  9594. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9595. prevLoop := currentLoop;
  9596. currentLoop := NewLabel();
  9597. StatementSequence(x.statements);
  9598. SetLabel(currentLoop);
  9599. currentLoop := prevLoop;
  9600. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9601. END VisitExitableBlock;
  9602. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9603. VAR prevLoop,start: Label;
  9604. BEGIN
  9605. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9606. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9607. start := NewLabel();
  9608. prevLoop := currentLoop;
  9609. SetLabel(start);
  9610. currentLoop := NewLabel();
  9611. StatementSequence(x.statements);
  9612. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9613. BrL(start);
  9614. SetLabel(currentLoop);
  9615. currentLoop := prevLoop;
  9616. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9617. END VisitLoopStatement;
  9618. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9619. VAR outer: SyntaxTree.Statement;
  9620. BEGIN
  9621. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9622. IF locked THEN (* r if we jump out of an exclusive block *)
  9623. outer := x.outer;
  9624. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9625. outer := outer.outer;
  9626. END;
  9627. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9628. Lock(FALSE);
  9629. END;
  9630. END;
  9631. BrL(currentLoop);
  9632. IF Trace THEN TraceExit("VisitExitStatement") END;
  9633. END VisitExitStatement;
  9634. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9635. VAR
  9636. expression, parameterDesignator: SyntaxTree.Expression;
  9637. type, componentType: SyntaxTree.Type;
  9638. res, right: Operand;
  9639. left, mem, reg: IntermediateCode.Operand;
  9640. parameter: SyntaxTree.Parameter;
  9641. procedure: SyntaxTree.Procedure;
  9642. procedureType: SyntaxTree.ProcedureType;
  9643. returnTypeOffset: LONGINT;
  9644. delegate: BOOLEAN;
  9645. map: SymbolMap;
  9646. cc, parametersSize: LONGINT;
  9647. BEGIN
  9648. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9649. expression := x.returnValue;
  9650. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9651. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9652. IF currentIsInline THEN
  9653. IF expression # NIL THEN
  9654. map := currentMapper.Get(NIL);
  9655. IF map # NIL THEN
  9656. Assign(map.to, expression);
  9657. ELSE
  9658. Evaluate(expression,res);
  9659. Emit(Return(position,res.op));
  9660. ReleaseOperand(res);
  9661. END;
  9662. END;
  9663. BrL(currentInlineExit);
  9664. RETURN;
  9665. END;
  9666. IF expression # NIL THEN
  9667. type := expression.type.resolved;
  9668. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9669. IF locked THEN Lock(FALSE) END;
  9670. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9671. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9672. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9673. (* return without structured return parameter *)
  9674. Evaluate(expression,res);
  9675. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9676. IF locked OR profile THEN
  9677. Emit(Push(position,res.op));
  9678. IF delegate THEN HALT(200) END;
  9679. ReleaseOperand(res);
  9680. IF locked THEN Lock(FALSE) END;
  9681. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9682. reg := NewRegisterOperand(res.op.type);
  9683. Emit(Pop(position,reg));
  9684. Emit(Return(position,reg));
  9685. ReleaseIntermediateOperand(reg);
  9686. ELSE
  9687. Emit(Return(position,res.op));
  9688. ReleaseOperand(res);
  9689. END;
  9690. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9691. THEN
  9692. (* return using structured return parameter *)
  9693. 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)
  9694. OR SemanticChecker.IsPointerType(type));
  9695. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9696. parameter :=procedureType.returnParameter;
  9697. ASSERT(parameter # NIL);
  9698. returnTypeOffset := parameter.offsetInBits;
  9699. (*
  9700. IF parameter# NIL THEN
  9701. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9702. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9703. ELSE
  9704. returnTypeOffset := system.offsetFirstParameter
  9705. END;
  9706. *)
  9707. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9708. IF type IS SyntaxTree.RangeType THEN
  9709. (* array range type *)
  9710. Evaluate(expression, right);
  9711. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9712. Emit(Mov(position,mem, right.op)); (* first *)
  9713. ReleaseIntermediateOperand(mem);
  9714. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9715. Emit(Mov(position,mem, right.tag)); (* last *)
  9716. ReleaseIntermediateOperand(mem);
  9717. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9718. Emit(Mov(position,mem, right.extra)); (* step *)
  9719. ReleaseIntermediateOperand(mem);
  9720. ReleaseOperand(right);
  9721. ELSIF type IS SyntaxTree.ComplexType THEN
  9722. Evaluate(expression, right);
  9723. componentType := type(SyntaxTree.ComplexType).componentType;
  9724. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9725. Emit(Mov(position,mem, right.op)); (* real part *)
  9726. ReleaseIntermediateOperand(mem);
  9727. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9728. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9729. ReleaseIntermediateOperand(mem);
  9730. ReleaseOperand(right);
  9731. ELSE (* covers cases: pointer / record / array *)
  9732. parameter := procedureType.returnParameter;
  9733. checker.SetCurrentScope(currentScope);
  9734. ASSERT(parameter # NIL);
  9735. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9736. Assign(parameterDesignator,expression);
  9737. END;
  9738. ReleaseIntermediateOperand(left);
  9739. IF locked THEN Lock(FALSE) END;
  9740. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9741. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9742. parameter := procedureType.returnParameter;
  9743. checker.SetCurrentScope(currentScope);
  9744. IF parameter = NIL THEN
  9745. Error(procedure.position, "structured return of parameter of procedure not found");
  9746. ELSE
  9747. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9748. Assign(parameterDesignator,expression);
  9749. END;
  9750. IF locked THEN Lock(FALSE) END;
  9751. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9752. ELSE
  9753. HALT(200);
  9754. END;
  9755. ELSE
  9756. IF locked THEN Lock(FALSE) END;
  9757. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9758. END;
  9759. IF backend.cooperative THEN
  9760. BrL(exitLabel);
  9761. ELSE
  9762. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  9763. IF cc = SyntaxTree.WinAPICallingConvention THEN
  9764. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9765. ELSE
  9766. parametersSize := 0;
  9767. END;
  9768. EmitLeave(section, position,procedure, procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9769. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention, parametersSize));
  9770. END;
  9771. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9772. END VisitReturnStatement;
  9773. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9774. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9775. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9776. statements: SyntaxTree.StatementSequence;
  9777. name, suffix: SyntaxTree.IdentifierString;
  9778. BEGIN
  9779. Strings.IntToStr(awaitProcCounter,suffix);
  9780. Strings.Concat("@AwaitProcedure",suffix,name);
  9781. identifier := SyntaxTree.NewIdentifier(name);
  9782. INC(awaitProcCounter);
  9783. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9784. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9785. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9786. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9787. procedure.SetAccess(SyntaxTree.Hidden);
  9788. procedure.SetScope(currentScope);
  9789. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9790. procedureType.SetReturnType(system.booleanType);
  9791. procedure.SetType(procedureType);
  9792. body := SyntaxTree.NewBody(x.position,procedureScope);
  9793. procedureScope.SetBody(body);
  9794. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9795. returnStatement.SetReturnValue(x.condition);
  9796. statements := SyntaxTree.NewStatementSequence();
  9797. statements.AddStatement(returnStatement);
  9798. body.SetStatementSequence(statements);
  9799. currentScope.AddProcedure(procedure);
  9800. RETURN procedure
  9801. END MakeAwaitProcedure;
  9802. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9803. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9804. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9805. BEGIN
  9806. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9807. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9808. IF backend.cooperative THEN
  9809. start := NewLabel();
  9810. true := NewLabel();
  9811. false := NewLabel();
  9812. SetLabel(start);
  9813. Condition(x.condition,true,false);
  9814. SetLabel(false);
  9815. PushSelfPointer();
  9816. CallThis(position,"ExclusiveBlocks","Await",1);
  9817. BrL(start);
  9818. SetLabel(true);
  9819. PushSelfPointer();
  9820. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9821. ELSE
  9822. proc := MakeAwaitProcedure(x);
  9823. Emit(Push(position,fp));
  9824. GetCodeSectionNameForSymbol(proc,name);
  9825. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9826. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9827. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9828. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9829. Emit(Result(position,res));
  9830. (*
  9831. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9832. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9833. *)
  9834. InitOperand(result,ModeValue);
  9835. result.op := res;
  9836. label := NewLabel();
  9837. BreqL(label, result.op, SELF.true);
  9838. ReleaseOperand(result);
  9839. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9840. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9841. Emit(Push(position,res));
  9842. Emit(Push(position,fp));
  9843. PushSelfPointer();
  9844. Emit(Push(position,nil));
  9845. CallThis(position,"Objects","Await",4);
  9846. SetLabel(label);
  9847. END;
  9848. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9849. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9850. END VisitAwaitStatement;
  9851. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9852. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9853. BEGIN
  9854. FOR i := 0 TO x.Length() - 1 DO
  9855. statement := x.GetStatement( i );
  9856. Statement(statement);
  9857. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9858. END;
  9859. END StatementSequence;
  9860. PROCEDURE PushSelfPointer;
  9861. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  9862. procedureType: SyntaxTree.ProcedureType;
  9863. BEGIN
  9864. scope := currentScope;
  9865. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9866. scope := scope.outerScope;
  9867. END;
  9868. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9869. IF ~newObjectFile THEN
  9870. Symbol(moduleSelf,op);
  9871. IntermediateCode.MakeMemory(op.op,addressType);
  9872. ELSE
  9873. moduleSection := meta.ModuleSection();
  9874. IF backend.cooperative THEN
  9875. moduleOffset := 0;
  9876. ELSE
  9877. moduleOffset := moduleSection.pc;
  9878. END;
  9879. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9880. END;
  9881. ELSE
  9882. GetBaseRegister(op.op,currentScope,scope);
  9883. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9884. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9885. parametersSize := ProcedureParametersSize(system,procedure);
  9886. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9887. IF backend.cooperative THEN
  9888. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9889. END;
  9890. IntermediateCode.MakeMemory(op.op,addressType);
  9891. END;
  9892. Emit(Push(position,op.op));
  9893. ReleaseOperand(op);
  9894. END PushSelfPointer;
  9895. PROCEDURE Lock(lock: BOOLEAN);
  9896. BEGIN
  9897. IF Trace THEN TraceEnter("Lock") END;
  9898. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9899. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9900. ASSERT(modifyAssignmentCounter = 0);
  9901. IF dump # NIL THEN
  9902. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9903. dump.Ln;dump.Update;
  9904. END;
  9905. PushSelfPointer;
  9906. IF backend.cooperative THEN
  9907. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9908. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9909. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9910. END;
  9911. ELSE
  9912. Emit(Push(position,true));
  9913. IF lock THEN CallThis(position,"Objects","Lock",2)
  9914. ELSE CallThis(position,"Objects","Unlock",2);
  9915. END;
  9916. END;
  9917. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9918. IF Trace THEN TraceExit("Lock") END;
  9919. END Lock;
  9920. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9921. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9922. BEGIN
  9923. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9924. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9925. previouslyUnchecked := isUnchecked;
  9926. isUnchecked := isUnchecked OR x.isUnchecked;
  9927. previouslyCooperativeSwitches := cooperativeSwitches;
  9928. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9929. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9930. IF x.statements # NIL THEN
  9931. StatementSequence(x.statements);
  9932. END;
  9933. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9934. isUnchecked := previouslyUnchecked;
  9935. cooperativeSwitches := previouslyCooperativeSwitches;
  9936. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9937. END VisitStatementBlock;
  9938. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9939. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9940. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9941. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9942. procedure: SyntaxTree.Procedure;
  9943. map: SymbolMap;
  9944. cc, parametersSize: LONGINT;
  9945. BEGIN
  9946. scope := currentScope;
  9947. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9948. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9949. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9950. return := emptyOperand;
  9951. IF Trace THEN TraceEnter("VisitCode") END;
  9952. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9953. NEW(in, x.inRules.Length());
  9954. FOR i := 0 TO LEN(in)-1 DO
  9955. statement := x.inRules.GetStatement(i);
  9956. WITH statement: SyntaxTree.Assignment DO
  9957. Evaluate(statement.right, operand);
  9958. result := operand.op;
  9959. NEW(str, 64);
  9960. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9961. in[i] := result; IntermediateCode.SetString(in[i], str);
  9962. ReleaseIntermediateOperand(operand.tag);
  9963. END;
  9964. END;
  9965. ELSE in := NIL
  9966. END;
  9967. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9968. NEW(out, x.outRules.Length());
  9969. FOR i := 0 TO LEN(out)-1 DO
  9970. statement := x.outRules.GetStatement(i);
  9971. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9972. WITH statement: SyntaxTree.Assignment DO
  9973. Designate(statement.left, operand);
  9974. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  9975. NEW(str, 64);
  9976. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9977. out[i] := result; IntermediateCode.SetString(out[i], str);
  9978. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  9979. |statement: SyntaxTree.ReturnStatement DO
  9980. NEW(str, 64);
  9981. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9982. IF currentIsInline THEN
  9983. map := currentMapper.Get(NIL);
  9984. Designate(map.to, operand);
  9985. IF map.isAddress THEN
  9986. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  9987. ELSE
  9988. result := operand.op;
  9989. END;
  9990. (*! only if it does not fit into register
  9991. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  9992. *)
  9993. (*Evaluate(map.to, operand);*)
  9994. out[i] := result;
  9995. ELSE
  9996. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9997. END;
  9998. IntermediateCode.SetString(out[i], str);
  9999. ReleaseIntermediateOperand(operand.tag);
  10000. return := out[i];
  10001. ELSE
  10002. END;
  10003. END;
  10004. ELSE out := NIL
  10005. END;
  10006. Emit(Asm(x.position,x.sourceCode, in, out));
  10007. IF in # NIL THEN
  10008. FOR i := 0 TO LEN(in)-1 DO
  10009. ReleaseIntermediateOperand(in[i]);
  10010. END;
  10011. END;
  10012. IF out # NIL THEN
  10013. FOR i := 0 TO LEN(out)-1 DO
  10014. WITH statement: SyntaxTree.Assignment DO
  10015. ReleaseIntermediateOperand(out[i]);
  10016. |statement: SyntaxTree.ReturnStatement DO
  10017. (* release happens below *)
  10018. ELSE
  10019. END;
  10020. statement := x.outRules.GetStatement(i);
  10021. END;
  10022. END;
  10023. IF return.mode # IntermediateCode.Undefined THEN
  10024. IF currentIsInline THEN
  10025. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10026. Symbol(procedureType.returnParameter, par);
  10027. MakeMemory(mem, par.op, return.type, 0);
  10028. ReleaseOperand(par);
  10029. Emit(Mov(position, mem, return));
  10030. ReleaseIntermediateOperand(mem);
  10031. ELSE
  10032. Emit(Return(position,return));
  10033. END;
  10034. ReleaseIntermediateOperand(return);
  10035. IF currentIsInline THEN RETURN END;
  10036. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10037. IF cc = SyntaxTree.WinAPICallingConvention THEN
  10038. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10039. ELSE
  10040. parametersSize := 0;
  10041. END;
  10042. EmitLeave(section, position,procedure, cc);
  10043. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,cc, parametersSize));
  10044. END;
  10045. IF Trace THEN TraceExit("VisitCode") END;
  10046. END VisitCode;
  10047. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10048. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10049. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10050. const, call: IntermediateCode.Operand;
  10051. parameterDesignator: SyntaxTree.Expression;
  10052. saved: RegisterEntry;
  10053. name: Basic.SegmentedName;
  10054. BEGIN
  10055. IF Trace THEN TraceEnter("ParameterCopies") END;
  10056. parameter := x.firstParameter;
  10057. WHILE parameter # NIL DO
  10058. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10059. type := parameter.type.resolved;
  10060. IF IsOpenArray(type) THEN
  10061. VisitParameter(parameter);
  10062. op := result;
  10063. IF backend.cooperative & parameter.NeedsTrace() THEN
  10064. length := GetArrayLength(type, op.tag);
  10065. size := NewRegisterOperand(addressType);
  10066. base := ArrayBaseType(type);
  10067. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10068. Emit(Mul(position, size, length, const));
  10069. dst := NewRegisterOperand (addressType);
  10070. Emit(Mov(position, dst, size));
  10071. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10072. Emit(Sub(position,dst,sp,dst));
  10073. Emit(And(position,dst,dst,const));
  10074. Emit(Mov(position,sp,dst));
  10075. par := fp;
  10076. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10077. IntermediateCode.InitImmediate(null, byteType, 0);
  10078. Emit(Fill(position, dst, size, null));
  10079. ReleaseIntermediateOperand(dst);
  10080. ReleaseIntermediateOperand(length);
  10081. SaveRegisters();ReleaseUsedRegisters(saved);
  10082. (* register dst has been freed before SaveRegisters already *)
  10083. base := ArrayBaseType(type);
  10084. (* assign method of open array *)
  10085. IF base.IsRecordType() THEN
  10086. Emit (Push(position, length));
  10087. Emit (Push(position, dst));
  10088. Emit (Push(position, op.op));
  10089. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10090. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10091. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10092. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10093. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10094. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10095. Emit (Push(position,length));
  10096. Emit (Push(position, dst));
  10097. Emit (Push(position, length));
  10098. Emit (Push(position, op.op));
  10099. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10100. ELSE
  10101. Emit (Push(position, length));
  10102. Emit (Push(position, dst));
  10103. Emit (Push(position, length));
  10104. Emit (Push(position, op.op));
  10105. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10106. ASSERT(ArrayBaseType(type).IsPointer());
  10107. END;
  10108. RestoreRegisters(saved);
  10109. ELSE
  10110. temp := GetDynamicSize(type,op.tag);
  10111. ReuseCopy(size,temp);
  10112. ReleaseIntermediateOperand(temp);
  10113. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10114. Emit(Sub(position,size,sp,size));
  10115. Emit(And(position,size,size,const));
  10116. Emit(Mov(position,sp,size));
  10117. par := fp;
  10118. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10119. ReleaseIntermediateOperand(size);
  10120. size := GetDynamicSize(type,op.tag);
  10121. END;
  10122. Emit(Copy(position,sp,op.op,size));
  10123. ReleaseIntermediateOperand(size);
  10124. ReleaseOperand(op);
  10125. IntermediateCode.MakeMemory(par,addressType);
  10126. Emit(Mov(position,par,sp));
  10127. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10128. checker.SetCurrentScope(currentScope);
  10129. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10130. Assign(parameterDesignator,parameterDesignator);
  10131. END;
  10132. END;
  10133. parameter := parameter.nextParameter;
  10134. END;
  10135. IF Trace THEN TraceExit("ParameterCopies") END;
  10136. END ParameterCopies;
  10137. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10138. VAR x: SyntaxTree.Variable;
  10139. BEGIN
  10140. x := scope.firstVariable;
  10141. WHILE x # NIL DO
  10142. InitVariable(x,FALSE);
  10143. x := x.nextVariable;
  10144. END;
  10145. END InitVariables;
  10146. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10147. BEGIN
  10148. IF (symbol # NIL) THEN
  10149. RETURN fingerPrinter.SymbolFP(symbol).public
  10150. ELSE
  10151. RETURN 0
  10152. END;
  10153. END GetFingerprint;
  10154. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10155. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10156. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10157. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10158. name: Basic.SegmentedName;
  10159. offset: LONGINT;
  10160. BEGIN
  10161. IF Trace THEN TraceEnter("Body") END;
  10162. ReleaseUsedRegisters(saved); (* just in case ... *)
  10163. section := ir;
  10164. exitLabel := NewLabel ();
  10165. IF moduleBody THEN moduleBodySection := section END;
  10166. IF ir.comments # NIL THEN
  10167. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10168. commentPrintout.SingleStatement(TRUE);
  10169. dump := ir.comments;
  10170. ELSE
  10171. commentPrintout := NIL;
  10172. dump := NIL;
  10173. END;
  10174. prevScope := currentScope;
  10175. currentScope := scope;
  10176. lastSwitchPC := 0;
  10177. cooperativeSwitches := backend.cooperative;
  10178. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10179. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10180. IF x # NIL THEN
  10181. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10182. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10183. IF moduleBody THEN
  10184. ProfilerInit();
  10185. ELSE
  10186. Basic.SegmentedNameToString(ir.name, string);
  10187. ProfilerAddProcedure(numberProcedures,string);
  10188. ProfilerEnterExit(numberProcedures,TRUE);
  10189. END;
  10190. END;
  10191. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10192. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10193. END;
  10194. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10195. IF moduleBody & ~newObjectFile THEN
  10196. InitVariables(moduleScope)
  10197. END;
  10198. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10199. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10200. IF procedure = cellScope.bodyProcedure THEN
  10201. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10202. StaticCallOperand(op, cellScope.constructor);
  10203. Emit(Call(position,op.op,0));
  10204. END;
  10205. END;
  10206. END;
  10207. InitVariables(scope);
  10208. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10209. GetCodeSectionNameForSymbol(procedure, name);
  10210. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10211. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10212. IF ProtectModulesPointers THEN
  10213. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10214. ELSE
  10215. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10216. END;
  10217. IntermediateCode.SetOffset(right,offset); (* tag *)
  10218. IntermediateCode.InitMemory(left,addressType,fp,0);
  10219. Emit(Mov(position, left, right));
  10220. END;
  10221. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10222. ParameterCopies(procedureType);
  10223. IF x.code = NIL THEN
  10224. VisitStatementBlock(x);
  10225. ELSE
  10226. VisitCode(x.code)
  10227. END;
  10228. IF x.finally # NIL THEN (*! mark finally block for object file *)
  10229. ir.SetFinally(ir.pc);
  10230. StatementSequence(x.finally)
  10231. END;
  10232. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10233. IF ~backend.cooperative THEN
  10234. ProfilerEnterExit(numberProcedures,FALSE);
  10235. END;
  10236. INC(numberProcedures);
  10237. END;
  10238. END;
  10239. IF backend.cooperative THEN
  10240. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10241. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10242. END;
  10243. IF x # NIL THEN
  10244. SELF.position := x.position;
  10245. END;
  10246. CheckRegistersFree();
  10247. ASSERT(modifyAssignmentCounter = 0);
  10248. currentScope := prevScope;
  10249. IF Trace THEN TraceExit("Body") END;
  10250. END Body;
  10251. END ImplementationVisitor;
  10252. MetaDataGenerator=OBJECT
  10253. VAR
  10254. implementationVisitor: ImplementationVisitor;
  10255. declarationVisitor: DeclarationVisitor;
  10256. module: Sections.Module;
  10257. moduleName: ARRAY 128 OF CHAR;
  10258. moduleNamePool: Basic.HashTableInt;
  10259. moduleNamePoolSection: IntermediateCode.Section;
  10260. modulePointerSection: IntermediateCode.Section;
  10261. modulePointerSizePC: LONGINT;
  10262. modulePointerSectionOffset: LONGINT;
  10263. modulePointers: LONGINT;
  10264. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  10265. RecordBaseOffset: LONGINT;
  10266. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10267. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10268. TypeTags: LONGINT; (* type extension level support *)
  10269. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10270. patchInfoPC: LONGINT;
  10271. patchCRC: LONGINT;
  10272. CONST
  10273. EmptyBlockOffset = 2;
  10274. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10275. BEGIN
  10276. IF implementationVisitor.backend.cooperative THEN
  10277. TypeTags := MAX(LONGINT);
  10278. BaseTypesTableOffset := 0;
  10279. MethodTableOffset := 2;
  10280. TypeRecordBaseOffset := 0;
  10281. RecordBaseOffset := 0;
  10282. ELSIF simple THEN
  10283. TypeTags := 3; (* only 3 extensions allowed *)
  10284. BaseTypesTableOffset := 1;
  10285. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10286. TypeRecordBaseOffset := 0;
  10287. RecordBaseOffset := 1;
  10288. ELSE
  10289. TypeTags := 16;
  10290. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10291. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10292. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10293. (* change this when Heaps.HeapBlock is modified *)
  10294. RecordBaseOffset := 8;
  10295. END;
  10296. SELF.simple := simple;
  10297. SELF.implementationVisitor := implementationVisitor;
  10298. SELF.declarationVisitor := declarationVisitor;
  10299. implementationVisitor.meta := SELF;
  10300. declarationVisitor.meta := SELF;
  10301. END InitMetaDataGenerator;
  10302. PROCEDURE SetModule(module: Sections.Module);
  10303. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10304. BEGIN
  10305. SELF.module := module;
  10306. Global.GetModuleName(module.module,moduleName);
  10307. Global.GetSymbolSegmentedName(module.module, name);
  10308. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple & ~implementationVisitor.backend.cooperative THEN
  10309. NEW(moduleNamePool, 32);
  10310. (*! require GC protection *)
  10311. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10312. IF ProtectModulesPointers THEN
  10313. name := "Heaps.AnyPtr";
  10314. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10315. (* set base pointer *)
  10316. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10317. END;
  10318. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10319. modulePointers := 0;
  10320. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10321. AddPointer(moduleNamePoolSection, namePoolOffset);
  10322. END;
  10323. END SetModule;
  10324. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10325. BEGIN
  10326. IF ~implementationVisitor.backend.cooperative THEN
  10327. NamedSymbol(modulePointerSection, section.name, NIL, 0, offset);
  10328. INC(modulePointers);
  10329. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10330. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10331. END;
  10332. END AddPointer;
  10333. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10334. BEGIN
  10335. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10336. END GetTypeRecordBaseOffset;
  10337. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10338. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10339. BEGIN
  10340. (* change this when Heaps.HeapBlock is modified *)
  10341. INC(dataAdrOffset,6);
  10342. Info(section,"headerAdr");
  10343. Address(section,0);
  10344. Info(section,"typeDesc");
  10345. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10346. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10347. NamedSymbol(section, name, symbol, 0, offset);
  10348. Info(section,"mark: LONGINT;");
  10349. Longint(section,-1);
  10350. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10351. Info(section,"dataAdr-: ADDRESS");
  10352. Symbol(section,section, dataAdrOffset,0);
  10353. Info(section,"size-: SIZE");
  10354. Address(section,0);
  10355. Info(section,"nextMark: HeapBlock;");
  10356. Address(section,0);
  10357. END HeapBlock;
  10358. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10359. VAR i: LONGINT;
  10360. BEGIN
  10361. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10362. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10363. Info(section,"count*: LONGINT");
  10364. Longint(section,0);
  10365. Info(section,"locked*: BOOLEAN");
  10366. Longint(section,0);
  10367. Info(section,"awaitingLock*: ProcessQueue");
  10368. Address(section,0);
  10369. Address(section,0);
  10370. Info(section,"awaitingCond*: ProcessQueue");
  10371. Address(section,0);
  10372. Address(section,0);
  10373. Info(section,"lockedBy*: ANY");
  10374. Address(section,0);
  10375. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10376. Longint(section,1);
  10377. FOR i := 2 TO 6 DO
  10378. Longint(section,0);
  10379. END;
  10380. Info(section,"lock*: ANY");
  10381. Address(section,0);
  10382. END ProtectedHeapBlock;
  10383. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10384. BEGIN
  10385. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10386. END Info;
  10387. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10388. VAR op: IntermediateCode.Operand;
  10389. BEGIN
  10390. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10391. section.Emit(Data(Basic.invalidPosition,op));
  10392. END Address;
  10393. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10394. VAR op: IntermediateCode.Operand;
  10395. BEGIN
  10396. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10397. section.Emit(Data(Basic.invalidPosition,op));
  10398. END Size;
  10399. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10400. VAR op: IntermediateCode.Operand;
  10401. BEGIN
  10402. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10403. section.Emit(Data(Basic.invalidPosition,op));
  10404. END Set;
  10405. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10406. VAR op: IntermediateCode.Operand;
  10407. BEGIN
  10408. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10409. section.Emit(Data(Basic.invalidPosition,op));
  10410. END Longint;
  10411. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10412. VAR op,noOperand: IntermediateCode.Operand;
  10413. BEGIN
  10414. IntermediateCode.InitOperand(noOperand);
  10415. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10416. section.PatchOperands(pc,op,noOperand,noOperand);
  10417. END PatchAddress;
  10418. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10419. VAR op,noOperand: IntermediateCode.Operand;
  10420. BEGIN
  10421. IntermediateCode.InitOperand(noOperand);
  10422. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10423. section.PatchOperands(pc,op,noOperand,noOperand);
  10424. END PatchSize;
  10425. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10426. VAR op,noOperand: IntermediateCode.Operand;
  10427. BEGIN
  10428. IntermediateCode.InitOperand(noOperand);
  10429. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10430. section.PatchOperands(pc,op,noOperand,noOperand);
  10431. END PatchLongint;
  10432. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10433. VAR op, noOperand: IntermediateCode.Operand;
  10434. BEGIN
  10435. IntermediateCode.InitOperand(noOperand);
  10436. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10437. section.PatchOperands(pc,op,noOperand,noOperand);
  10438. END PatchSymbol;
  10439. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10440. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10441. BEGIN
  10442. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10443. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10444. section.Emit(Data(Basic.invalidPosition,op));
  10445. END Boolean;
  10446. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10447. VAR op: IntermediateCode.Operand;
  10448. BEGIN
  10449. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10450. section.Emit(Data(Basic.invalidPosition,op));
  10451. END Char;
  10452. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10453. VAR op: IntermediateCode.Operand;
  10454. BEGIN
  10455. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10456. section.Emit(Data(Basic.invalidPosition,op));
  10457. END Integer;
  10458. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10459. VAR i: LONGINT;
  10460. BEGIN
  10461. Info(section,str);
  10462. i := 0;
  10463. WHILE(str[i] # 0X) DO
  10464. Char(section,str[i]);
  10465. INC(i);
  10466. END;
  10467. Char(section,0X);
  10468. END String;
  10469. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10470. VAR s: Basic.SectionName;
  10471. BEGIN
  10472. StringPool.GetString(str, s);
  10473. String(section, s);
  10474. END String0;
  10475. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10476. VAR op: IntermediateCode.Operand;
  10477. BEGIN
  10478. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10479. IntermediateCode.SetOffset(op,realOffset);
  10480. section.Emit(Data(Basic.invalidPosition,op));
  10481. END NamedSymbol;
  10482. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10483. VAR op: IntermediateCode.Operand;
  10484. BEGIN
  10485. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10486. IntermediateCode.SetOffset(op,realOffset);
  10487. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10488. END NamedSymbolAt;
  10489. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10490. BEGIN
  10491. IF symbol= NIL THEN
  10492. Address( section, realOffset);
  10493. ASSERT(virtualOffset = 0);
  10494. ELSE
  10495. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10496. END;
  10497. END Symbol;
  10498. (* OutPointers delivers
  10499. {pointerOffset}
  10500. *)
  10501. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10502. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10503. BEGIN
  10504. type := type.resolved;
  10505. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10506. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10507. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10508. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10509. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10510. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10511. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10512. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10513. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10514. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10515. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10516. ELSIF (type IS SyntaxTree.RecordType) THEN
  10517. (* never treat a record like a pointer, even if the pointer field is set! *)
  10518. WITH type: SyntaxTree.RecordType DO
  10519. base := type.GetBaseRecord();
  10520. IF base # NIL THEN
  10521. Pointers(offset,symbol,section, base,numberPointers);
  10522. END;
  10523. variable := type.recordScope.firstVariable;
  10524. WHILE(variable # NIL) DO
  10525. IF ~(variable.untraced) THEN
  10526. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10527. END;
  10528. variable := variable.nextVariable;
  10529. END;
  10530. END;
  10531. ELSIF (type IS SyntaxTree.CellType) THEN
  10532. WITH type: SyntaxTree.CellType DO
  10533. base := type.GetBaseRecord();
  10534. IF base # NIL THEN
  10535. Pointers(offset,symbol,section, base,numberPointers);
  10536. END;
  10537. variable := type.cellScope.firstVariable;
  10538. WHILE(variable # NIL) DO
  10539. IF ~(variable.untraced) THEN
  10540. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10541. END;
  10542. variable := variable.nextVariable;
  10543. END;
  10544. property := type.firstProperty;
  10545. WHILE(property # NIL) DO
  10546. IF ~(property.untraced) THEN
  10547. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10548. END;
  10549. property := property.nextProperty;
  10550. END;
  10551. parameter := type.firstParameter;
  10552. WHILE(parameter # NIL) DO
  10553. IF ~(parameter.untraced) THEN
  10554. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10555. END;
  10556. parameter := parameter.nextParameter;
  10557. END;
  10558. END;
  10559. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10560. WITH type: SyntaxTree.ArrayType DO
  10561. IF type.form= SyntaxTree.Static THEN
  10562. n := type.staticLength;
  10563. base := type.arrayBase.resolved;
  10564. WHILE(base IS SyntaxTree.ArrayType) DO
  10565. type := base(SyntaxTree.ArrayType);
  10566. n := n* type.staticLength;
  10567. base := type.arrayBase.resolved;
  10568. END;
  10569. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10570. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10571. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10572. FOR i := 0 TO n-1 DO
  10573. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10574. END;
  10575. END;
  10576. ELSE
  10577. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10578. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10579. END;
  10580. END;
  10581. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10582. WITH type: SyntaxTree.MathArrayType DO
  10583. IF type.form = SyntaxTree.Static THEN
  10584. n := type.staticLength;
  10585. base := type.arrayBase.resolved;
  10586. WHILE(base IS SyntaxTree.MathArrayType) DO
  10587. type := base(SyntaxTree.MathArrayType);
  10588. n := n* type.staticLength;
  10589. base := type.arrayBase.resolved;
  10590. END;
  10591. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10592. IF SemanticChecker.ContainsPointer(base) THEN
  10593. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10594. FOR i := 0 TO n-1 DO
  10595. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10596. END;
  10597. END;
  10598. ELSE
  10599. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10600. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10601. END
  10602. END;
  10603. (* ELSE no pointers in type *)
  10604. END;
  10605. END Pointers;
  10606. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10607. VAR position,i: LONGINT; ch: CHAR;
  10608. BEGIN
  10609. IF pool.Has(index) THEN
  10610. RETURN pool.GetInt(index)
  10611. ELSE
  10612. position := source.pc;
  10613. pool.PutInt(index, position);
  10614. Info(source, name);
  10615. i := 0;
  10616. REPEAT
  10617. ch := name[i]; INC(i);
  10618. Char( source, ch);
  10619. UNTIL ch = 0X;
  10620. END;
  10621. RETURN position;
  10622. END EnterDynamicName;
  10623. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10624. VAR name: Basic.SectionName; position: LONGINT;
  10625. BEGIN
  10626. IF pool.Has(index) THEN
  10627. RETURN pool.GetInt(index)
  10628. ELSE
  10629. StringPool.GetString(index, name);
  10630. position := EnterDynamicName(source,name,index, pool);
  10631. END;
  10632. RETURN position;
  10633. END DynamicName;
  10634. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10635. VAR section: IntermediateCode.Section;
  10636. BEGIN
  10637. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10638. IF implementationVisitor.backend.cooperative THEN
  10639. Info(section, "TypeDescriptor");
  10640. Basic.ToSegmentedName("BaseTypes.Array", name);
  10641. NamedSymbol(section, name,NIL, 0, 0);
  10642. BasePointer(section);
  10643. offset := 0;
  10644. ELSE
  10645. IF ProtectModulesPointers THEN
  10646. HeapBlock(mName,typeName,section,2);
  10647. END;
  10648. Info(section, "HeapBlock");
  10649. IF ProtectModulesPointers THEN
  10650. Symbol(section,section,2,0);
  10651. ELSE
  10652. Address(section,0);
  10653. END;
  10654. Info(section, "TypeDescriptor");
  10655. Address(section,0);
  10656. offset := section.pc;
  10657. END;
  10658. RETURN section
  10659. END NamedBlock;
  10660. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10661. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10662. BEGIN
  10663. COPY(moduleName,name);
  10664. Strings.Append(name,suffix);
  10665. Basic.ToSegmentedName(name, pooledName);
  10666. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10667. END Block;
  10668. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10669. VAR name: Basic.SegmentedName;
  10670. BEGIN
  10671. Info(source,"ArrayHeader");
  10672. IF implementationVisitor.backend.cooperative THEN
  10673. sizePC := source.pc;
  10674. Address(source,0);
  10675. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10676. IF baseType # "" THEN
  10677. Basic.ToSegmentedName(baseType, name);
  10678. NamedSymbol(source, name,NIL, 0, 0);
  10679. ELSE
  10680. Address(source,0);
  10681. END;
  10682. Address(source,0);
  10683. ELSE
  10684. Address(source,0);
  10685. Address(source,0);
  10686. (* first pointer for GC *)
  10687. IF hasPointer THEN
  10688. (* points to first element in the array, this is NOT the base type descriptor *)
  10689. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10690. ELSE
  10691. Address(source,0);
  10692. END;
  10693. sizePC := source.pc;
  10694. Address(source,0);
  10695. Info(source,"array data");
  10696. END;
  10697. END ArrayBlock;
  10698. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10699. BEGIN
  10700. IF implementationVisitor.backend.cooperative THEN
  10701. PatchSize(section, pc, size);
  10702. PatchSize(section, pc + 3, size);
  10703. ELSE
  10704. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10705. PatchSize(section, pc, size);
  10706. END;
  10707. END PatchArray;
  10708. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10709. VAR
  10710. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10711. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10712. poolMap: Basic.HashTableInt;
  10713. namePool: IntermediateCode.Section;
  10714. namePoolOffset: LONGINT;
  10715. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10716. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10717. BEGIN
  10718. Basic.SegmentedNameToString(s1.name,n1);
  10719. Basic.SegmentedNameToString(s2.name,n2);
  10720. index := 0;
  10721. ch1 := n1[index];
  10722. ch2 := n2[index];
  10723. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10724. INC(index);
  10725. ch1 := n1[index];
  10726. ch2 := n2[index];
  10727. END;
  10728. RETURN ch1 < ch2;
  10729. END Compare;
  10730. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10731. VAR
  10732. i, j: LONGINT;
  10733. x, t: Sections.Section;
  10734. BEGIN
  10735. IF lo < hi THEN
  10736. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10737. WHILE i <= j DO
  10738. WHILE Compare(list[i], x) DO INC(i) END;
  10739. WHILE Compare(x, list[j]) DO DEC(j) END;
  10740. IF i <= j THEN
  10741. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10742. INC(i); DEC(j)
  10743. END
  10744. END;
  10745. IF lo < j THEN QuickSort(list, lo, j) END;
  10746. IF i < hi THEN QuickSort(list, i, hi) END
  10747. END;
  10748. END QuickSort;
  10749. (*
  10750. ExportDesc* = RECORD
  10751. fp*: ADDRESS;
  10752. name* {UNTRACED}: DynamicName;
  10753. adr*: ADDRESS;
  10754. exports*: LONGINT;
  10755. dsc* {UNTRACED}: ExportArray
  10756. END;
  10757. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10758. *)
  10759. PROCEDURE ExportDesc2(
  10760. source: IntermediateCode.Section;
  10761. namePool: IntermediateCode.Section;
  10762. fingerPrinter: FingerPrinter.FingerPrinter;
  10763. symbol: Sections.Section;
  10764. name: StringPool.Index;
  10765. VAR patchAdr: LONGINT
  10766. ): BOOLEAN;
  10767. VAR fingerPrint: SyntaxTree.FingerPrint;
  10768. BEGIN
  10769. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10770. & (symbol.type # Sections.InlineCodeSection)
  10771. THEN
  10772. *)
  10773. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10774. & (symbol.type # Sections.InlineCodeSection))
  10775. THEN
  10776. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10777. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10778. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10779. Longint(source,fingerPrint.public);
  10780. ELSE
  10781. Longint(source, 0);
  10782. END;
  10783. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10784. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10785. Symbol(source, symbol,0,0);
  10786. patchAdr := source.pc;
  10787. Longint(source, 0);
  10788. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10789. Address(source,0);
  10790. END;
  10791. RETURN TRUE
  10792. ELSE
  10793. RETURN FALSE
  10794. END;
  10795. END ExportDesc2;
  10796. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10797. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10798. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10799. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  10800. nextPatch: LONGINT;
  10801. TYPE
  10802. Scope = RECORD
  10803. elements: LONGINT;
  10804. gelements: LONGINT;
  10805. section: IntermediateCode.Section;
  10806. patchAdr: LONGINT;
  10807. arraySizePC: LONGINT;
  10808. beginPC: LONGINT; (* current scope start pc *)
  10809. END;
  10810. BEGIN
  10811. Basic.InitSegmentedName(prev);
  10812. olevel := -1;
  10813. scopes[0].section := source;
  10814. scopes[0].arraySizePC := MIN(LONGINT);
  10815. FOR s := 0 TO LEN(sections)-1 DO
  10816. symbol := sections[s];
  10817. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10818. this := sections[s].name;
  10819. level := 0;
  10820. WHILE (this[level] > 0) DO
  10821. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10822. INC(level);
  10823. END;
  10824. WHILE level < olevel DO
  10825. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10826. IF olevel > 0 THEN
  10827. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10828. nextPatch := scopes[olevel-1].patchAdr+1;
  10829. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10830. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10831. END;
  10832. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10833. DEC(olevel);
  10834. END;
  10835. IF (this[level] > 0) THEN
  10836. IF level > olevel THEN
  10837. (*TRACE("opening",level); *)
  10838. IF scopes[level].section = NIL THEN
  10839. arrayName := ".@ExportArray";
  10840. Strings.AppendInt(arrayName, level);
  10841. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  10842. AddPointer(scopes[level].section,offset);
  10843. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  10844. END;
  10845. scopes[level].beginPC := scopes[level].section.pc;
  10846. olevel := level;
  10847. scopes[olevel].elements := 0;
  10848. END;
  10849. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10850. sym := sections[s];
  10851. ELSE
  10852. sym := NIL;
  10853. END;
  10854. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10855. THEN
  10856. INC(scopes[olevel].elements);
  10857. END;
  10858. (* enter string in scope *)
  10859. INC(level);
  10860. END;
  10861. END;
  10862. Basic.SegmentedNameToString(this, name);
  10863. prev := this;
  10864. END;
  10865. END;
  10866. WHILE 0 <= olevel DO
  10867. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10868. IF olevel > 0 THEN
  10869. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10870. nextPatch := scopes[olevel-1].patchAdr+1;
  10871. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10872. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10873. END;
  10874. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10875. DEC(olevel);
  10876. END;
  10877. level := 0;
  10878. WHILE (level < LEN(scopes)) DO
  10879. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  10880. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10881. END;
  10882. INC(level);
  10883. END;
  10884. END Export;
  10885. BEGIN
  10886. NEW(fingerPrinter);
  10887. NEW(poolMap, 64);
  10888. (* 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 *)
  10889. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10890. NEW(sectionArray, module.allSections.Length());
  10891. FOR i := 0 TO module.allSections.Length() - 1 DO
  10892. section := module.allSections.GetSection(i);
  10893. sectionArray[i] := section;
  10894. END;
  10895. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10896. Export(sectionArray^);
  10897. END ExportDesc;
  10898. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10899. VAR
  10900. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10901. BEGIN
  10902. Info(source, "exception table offsets array descriptor");
  10903. size := 0;
  10904. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  10905. Info(source, "exception table content");
  10906. FOR i := 0 TO module.allSections.Length() - 1 DO
  10907. p := module.allSections.GetSection(i);
  10908. IF p.type = Sections.CodeSection THEN
  10909. finallyPC := p(IntermediateCode.Section).finally;
  10910. IF finallyPC>=0 THEN
  10911. Symbol( source, p, 0,0);
  10912. Symbol( source, p, finallyPC, 0);
  10913. Symbol( source, p, finallyPC,0);
  10914. INC(size);
  10915. END;
  10916. END
  10917. END;
  10918. PatchArray(source,sizePC,size);
  10919. END ExceptionArray;
  10920. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10921. VAR i: LONGINT; ch: CHAR;
  10922. BEGIN
  10923. i := 0;
  10924. REPEAT
  10925. ch := name[i]; INC(i);
  10926. Char( section, ch);
  10927. UNTIL ch = 0X;
  10928. WHILE i < 32 DO
  10929. Char( section, 0X); INC(i);
  10930. END;
  10931. END Name;
  10932. PROCEDURE References(section: IntermediateCode.Section);
  10933. CONST
  10934. sfTypeNone = 0X;
  10935. sfTypeCHAR = 01X;
  10936. sfTypeCHAR8 = 02X;
  10937. sfTypeCHAR16 = 03X;
  10938. sfTypeCHAR32 = 04X;
  10939. sfTypeRANGE = 05X;
  10940. sfTypeSHORTINT = 06X;
  10941. sfTypeINTEGER = 07X;
  10942. sfTypeLONGINT = 08X;
  10943. sfTypeHUGEINT = 09X;
  10944. sfTypeWORD = 0AX;
  10945. sfTypeLONGWORD = 0BX;
  10946. sfTypeSIGNED8 = 0CX;
  10947. sfTypeSIGNED16 = 0DX;
  10948. sfTypeSIGNED32 = 0EX;
  10949. sfTypeSIGNED64 = 0FX;
  10950. sfTypeUNSIGNED8 = 10X;
  10951. sfTypeUNSIGNED16 = 11X;
  10952. sfTypeUNSIGNED32 = 12X;
  10953. sfTypeUNSIGNED64 = 13X;
  10954. sfTypeREAL = 14X;
  10955. sfTypeLONGREAL = 15X;
  10956. sfTypeCOMPLEX = 16X;
  10957. sfTypeLONGCOMPLEX = 17X;
  10958. sfTypeBOOLEAN = 18X;
  10959. sfTypeSET = 19X;
  10960. sfTypeANY = 1AX;
  10961. sfTypeOBJECT = 1BX;
  10962. sfTypeBYTE = 1CX;
  10963. sfTypeADDRESS = 1DX;
  10964. sfTypeSIZE = 1EX;
  10965. sfTypeIndirect = 1FX;
  10966. sfTypeRecord = 20X;
  10967. sfTypePointerToRecord = 21X;
  10968. sfTypePointerToArray = 22X;
  10969. sfTypeOpenArray = 23X;
  10970. sfTypeStaticArray = 24X;
  10971. sfTypeDynamicArray = 25X;
  10972. sfTypeMathStaticArray = 26X;
  10973. sfTypeMathOpenArray = 27X;
  10974. sfTypeMathTensor = 28X;
  10975. sfTypeDelegate = 29X;
  10976. sfTypeENUM = 2AX;
  10977. sfTypeCELL = 2BX;
  10978. sfTypePORT = 2CX;
  10979. sfIN = 0X;
  10980. sfOUT = 1X;
  10981. flagDelegate = 0;
  10982. flagConstructor = 1;
  10983. (* variable / parameter addressing modes *)
  10984. sfAbsolute = 0X; (* global vars *)
  10985. sfRelative = 1X; (* variables, value parameters *)
  10986. sfIndirect = 2X; (* var parameters *)
  10987. sfScopeBegin = 0F0X;
  10988. sfScopeEnd = 0F1X;
  10989. sfProcedure = 0F2X;
  10990. sfVariable = 0F3X;
  10991. sfTypeDeclaration = 0F4X;
  10992. sfModule = 0FFX;
  10993. RefInfo = TRUE;
  10994. VAR
  10995. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  10996. indirectTypes: Basic.HashTable;
  10997. PROCEDURE CurrentIndex(): SIZE;
  10998. VAR i: LONGINT;
  10999. BEGIN
  11000. FOR i := startPC TO section.pc -1 DO
  11001. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11002. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11003. END;
  11004. startPC := section.pc;
  11005. RETURN lastOffset;
  11006. END CurrentIndex;
  11007. (*
  11008. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11009. Module = sfModule prevSymbol:SIZE name:String Scope.
  11010. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11011. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11012. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11013. Type =
  11014. sfTypePointerToRecord
  11015. | sfTypePointerToArray Type
  11016. | sfTypeOpenArray Type
  11017. | sfTypeDynamicArray Type
  11018. | sfTypeStaticArray length:SIZE Type
  11019. | sfTypeMathOpenArray Type
  11020. | sfTypeMathStaticArray length:SIZE Type
  11021. | sfTypeMathTensor Type
  11022. | sfTypeRecord tdAdr:ADDRESS
  11023. | sfTypeDelegate {Parameter} return:Type
  11024. | sfTypePort (sfIN | sfOUT)
  11025. | sfTypeBOOLEAN
  11026. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11027. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11028. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11029. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11030. | sfTypeWORD | sfTypeLONGWORD
  11031. | sfTypeREAL | sfTypeLONGREAL
  11032. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11033. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11034. | sfTypeIndirect offset:SIZE.
  11035. *)
  11036. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11037. VAR offset: SIZE;
  11038. BEGIN
  11039. IF indirectTypes.Has(type) THEN
  11040. offset := indirectTypes.GetInt(type);
  11041. Char(section, sfTypeIndirect);
  11042. Size(section, offset);
  11043. RETURN TRUE;
  11044. ELSE
  11045. indirectTypes.PutInt(type, CurrentIndex());
  11046. RETURN FALSE;
  11047. END;
  11048. END Indirect;
  11049. PROCEDURE NType(type: SyntaxTree.Type);
  11050. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11051. segmentedName: Basic.SegmentedName; offset: SIZE; parameter: SyntaxTree.Parameter;
  11052. BEGIN
  11053. IF type = NIL THEN
  11054. Char(section, sfTypeNone)
  11055. ELSE
  11056. type := type.resolved;
  11057. size := type.sizeInBits;
  11058. WITH type:SyntaxTree.PointerType DO
  11059. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11060. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11061. Char(section, sfTypePointerToRecord);
  11062. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11063. ELSE
  11064. IF RefInfo THEN Info(section,"PointerToArray") END;
  11065. Char(section, sfTypePointerToArray);
  11066. NType(type.pointerBase);
  11067. END;
  11068. | type: SyntaxTree.ArrayType DO
  11069. IF ~Indirect(type) THEN
  11070. IF type.form = SyntaxTree.Open THEN
  11071. IF RefInfo THEN Info(section,"OpenArray") END;
  11072. Char(section, sfTypeOpenArray);
  11073. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11074. IF RefInfo THEN Info(section,"DynamicArray") END;
  11075. Char(section, sfTypeDynamicArray);
  11076. ELSIF type.form = SyntaxTree.Static THEN
  11077. IF RefInfo THEN Info(section,"StaticArray") END;
  11078. Char(section, sfTypeStaticArray);
  11079. Size(section, type.staticLength);
  11080. ELSE
  11081. HALT(100);
  11082. END;
  11083. NType(type.arrayBase);
  11084. END;
  11085. | type: SyntaxTree.MathArrayType DO
  11086. IF ~Indirect(type) THEN
  11087. IF type.form = SyntaxTree.Open THEN
  11088. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11089. Char(section, sfTypeMathOpenArray);
  11090. ELSIF type.form = SyntaxTree.Static THEN
  11091. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11092. Char(section, sfTypeMathStaticArray);
  11093. Size(section, type.staticLength);
  11094. ELSIF type.form = SyntaxTree.Tensor THEN
  11095. IF RefInfo THEN Info(section,"MathTensor") END;
  11096. Char(section, sfTypeMathTensor);
  11097. ELSE
  11098. HALT(100);
  11099. END;
  11100. NType(type.arrayBase);
  11101. END;
  11102. | type: SyntaxTree.RecordType DO
  11103. IF ~Indirect(type) THEN
  11104. IF type.pointerType # NIL (* OBJECT *) THEN
  11105. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11106. Char(section, sfTypePointerToRecord)
  11107. ELSE
  11108. IF RefInfo THEN Info(section,"Record") END;
  11109. Char(section, sfTypeRecord);
  11110. td := type.typeDeclaration;
  11111. IF RefInfo THEN Info(section,"TD") END;
  11112. IF (td # NIL) THEN
  11113. Global.GetSymbolSegmentedName(td,segmentedName);
  11114. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11115. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11116. ELSE
  11117. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11118. END;
  11119. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11120. Symbol(section, tir, 0, offset);
  11121. ELSE
  11122. Address(section, 0);
  11123. END;
  11124. END;
  11125. END;
  11126. | type: SyntaxTree.CellType DO
  11127. IF ~Indirect(type) THEN
  11128. IF RefInfo THEN Info(section,"Record") END;
  11129. Char(section, sfTypeRecord);
  11130. td := type.typeDeclaration;
  11131. IF RefInfo THEN Info(section,"TD") END;
  11132. IF (td # NIL) THEN
  11133. Global.GetSymbolSegmentedName(td,segmentedName);
  11134. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11135. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11136. ELSE
  11137. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11138. END;
  11139. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11140. Symbol(section, tir, 0, offset);
  11141. ELSE
  11142. Address(section, 0);
  11143. END;
  11144. END;
  11145. | type: SyntaxTree.PortType DO
  11146. Char(section, sfTypePORT);
  11147. IF type.direction = SyntaxTree.OutPort THEN
  11148. Char(section, sfOUT)
  11149. ELSE
  11150. Char(section, sfIN)
  11151. END;
  11152. | type: SyntaxTree.ProcedureType DO
  11153. IF ~Indirect(type) THEN
  11154. Char(section, sfTypeDelegate);
  11155. parameter := type.firstParameter;
  11156. WHILE(parameter # NIL) DO
  11157. NParameter(parameter, -1);
  11158. parameter := parameter.nextParameter;
  11159. END;
  11160. NType(type.returnType);
  11161. END;
  11162. | type:SyntaxTree.EnumerationType DO
  11163. Char(section, sfTypeENUM);
  11164. | type: SyntaxTree.BasicType DO
  11165. WITH type: SyntaxTree.BooleanType DO
  11166. IF RefInfo THEN Info(section,"Boolean") END;
  11167. Char(section, sfTypeBOOLEAN);
  11168. | type: SyntaxTree.CharacterType DO
  11169. IF type = module.system.characterType THEN
  11170. IF RefInfo THEN Info(section,"CHAR") END;
  11171. Char(section, sfTypeCHAR);
  11172. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11173. IF RefInfo THEN Info(section,"CHAR8") END;
  11174. Char(section, sfTypeCHAR8)
  11175. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11176. IF RefInfo THEN Info(section,"CHAR16") END;
  11177. Char(section, sfTypeCHAR16);
  11178. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11179. IF RefInfo THEN Info(section,"CHAR32") END;
  11180. Char(section, sfTypeCHAR32);
  11181. ELSE
  11182. HALT(100);
  11183. END;
  11184. |type: SyntaxTree.IntegerType DO
  11185. IF type(SyntaxTree.IntegerType).signed THEN
  11186. IF (type = module.system.shortintType) THEN
  11187. IF RefInfo THEN Info(section,"SHORTINT") END;
  11188. Char(section, sfTypeSHORTINT)
  11189. ELSIF (type = module.system.integerType) THEN
  11190. IF RefInfo THEN Info(section,"INTEGER") END;
  11191. Char(section, sfTypeINTEGER)
  11192. ELSIF (type = module.system.longintType) THEN
  11193. IF RefInfo THEN Info(section,"LONGINT") END;
  11194. Char(section, sfTypeLONGINT)
  11195. ELSIF (type = module.system.hugeintType) THEN
  11196. IF RefInfo THEN Info(section,"HUGEINT") END;
  11197. Char(section, sfTypeHUGEINT)
  11198. ELSIF (type = module.system.wordType) THEN
  11199. IF RefInfo THEN Info(section,"WORD") END;
  11200. Char(section, sfTypeWORD)
  11201. ELSIF (type = module.system.longWordType) THEN
  11202. IF RefInfo THEN Info(section,"LONGWORD") END;
  11203. Char(section, sfTypeLONGWORD);
  11204. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11205. IF RefInfo THEN Info(section,"SIGNED8") END;
  11206. Char(section, sfTypeSIGNED8)
  11207. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11208. IF RefInfo THEN Info(section,"SIGNED16") END;
  11209. Char(section, sfTypeSIGNED16)
  11210. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11211. IF RefInfo THEN Info(section,"SIGNED32") END;
  11212. Char(section, sfTypeSIGNED32)
  11213. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11214. IF RefInfo THEN Info(section,"SIGNED64") END;
  11215. Char(section, sfTypeSIGNED64)
  11216. ELSE
  11217. HALT(100);
  11218. END
  11219. ELSE (* unsigned *)
  11220. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11221. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11222. Char(section, sfTypeUNSIGNED8)
  11223. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11224. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11225. Char(section, sfTypeUNSIGNED16)
  11226. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11227. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11228. Char(section, sfTypeUNSIGNED32)
  11229. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11230. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11231. Char(section, sfTypeUNSIGNED64)
  11232. ELSE
  11233. HALT(100)
  11234. END
  11235. END;
  11236. | type: SyntaxTree.FloatType DO
  11237. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11238. IF RefInfo THEN Info(section,"REAL") END;
  11239. Char(section, sfTypeREAL);
  11240. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11241. IF RefInfo THEN Info(section,"LONGREAL") END;
  11242. Char(section, sfTypeLONGREAL);
  11243. ELSE
  11244. HALT(100);
  11245. END;
  11246. |type: SyntaxTree.ComplexType DO
  11247. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11248. IF RefInfo THEN Info(section,"COMPLEX") END;
  11249. Char(section, sfTypeCOMPLEX);
  11250. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11251. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11252. Char(section, sfTypeLONGCOMPLEX);
  11253. ELSE
  11254. HALT(100);
  11255. END;
  11256. |type:SyntaxTree.SetType DO
  11257. IF RefInfo THEN Info(section,"SET") END;
  11258. Char(section, sfTypeSET);
  11259. |type:SyntaxTree.AnyType DO
  11260. IF RefInfo THEN Info(section,"ANY") END;
  11261. Char(section, sfTypeANY);
  11262. |type:SyntaxTree.ObjectType DO
  11263. IF RefInfo THEN Info(section,"OBJECT") END;
  11264. Char(section, sfTypeOBJECT);
  11265. |type:SyntaxTree.ByteType DO
  11266. IF RefInfo THEN Info(section,"BYTE") END;
  11267. Char(section, sfTypeBYTE);
  11268. |type:SyntaxTree.RangeType DO
  11269. IF RefInfo THEN Info(section,"RANGE") END;
  11270. Char(section, sfTypeRANGE)
  11271. |type:SyntaxTree.AddressType DO
  11272. IF RefInfo THEN Info(section,"ADDRESS") END;
  11273. Char(section, sfTypeADDRESS)
  11274. |type:SyntaxTree.SizeType DO
  11275. IF RefInfo THEN Info(section,"SIZE") END;
  11276. Char(section, sfTypeSIZE)
  11277. ELSE
  11278. HALT(100)
  11279. END;
  11280. ELSE HALT(101);
  11281. END;
  11282. END;
  11283. END NType;
  11284. (*
  11285. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11286. *)
  11287. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11288. VAR pos: LONGINT; type: SyntaxTree.Type;
  11289. BEGIN
  11290. IF RefInfo THEN Info(section, "Parameter") END;
  11291. Char(section, sfVariable);
  11292. Size(section, procOffset);
  11293. String0(section, parameter.name);
  11294. type := parameter.type.resolved;
  11295. IF parameter.kind = SyntaxTree.VarParameter THEN
  11296. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11297. ELSE Char(section, sfIndirect)
  11298. END;
  11299. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11300. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11301. Char(section, sfIndirect);
  11302. ELSE
  11303. Char(section, sfRelative);
  11304. END;
  11305. ELSE
  11306. Char(section, sfRelative);
  11307. END;
  11308. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11309. NType(parameter.type);
  11310. END NParameter;
  11311. (*
  11312. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11313. *)
  11314. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11315. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11316. flags: SET;
  11317. BEGIN
  11318. IF procedure.externalName # NIL THEN RETURN END;
  11319. IF RefInfo THEN Info(section, "Procedure") END;
  11320. pos := CurrentIndex();
  11321. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11322. Char(section, sfProcedure);
  11323. Size(section, scopeOffset);
  11324. String0(section,procedure.name);
  11325. s := module.allSections.FindBySymbol(procedure);
  11326. Symbol(section,s,0,0); (* start *)
  11327. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11328. flags := {};
  11329. IF procedureType.isDelegate THEN
  11330. INCL(flags, flagDelegate);
  11331. END;
  11332. IF procedure.isConstructor THEN
  11333. INCL(flags, flagConstructor);
  11334. END;
  11335. Set(section, flags);
  11336. IF RefInfo THEN Info(section, "Parameters") END;
  11337. parameter := procedureType.firstParameter;
  11338. WHILE(parameter # NIL) DO
  11339. NParameter(parameter, pos);
  11340. parameter := parameter.nextParameter;
  11341. END;
  11342. IF procedureType.returnParameter # NIL THEN
  11343. NParameter(procedureType.returnParameter, pos);
  11344. END;
  11345. IF procedureType.selfParameter # NIL THEN
  11346. NParameter(procedureType.selfParameter, pos);
  11347. END;
  11348. IF RefInfo THEN Info(section, "ReturnType") END;
  11349. NType(procedureType.returnType);
  11350. NScope(procedure.procedureScope, pos);
  11351. END NProcedure;
  11352. (*
  11353. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11354. *)
  11355. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11356. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11357. BEGIN
  11358. IF RefInfo THEN Info(section, "Variable") END;
  11359. pos := CurrentIndex();
  11360. Char(section, sfVariable);
  11361. Size(section, scopeOffset);
  11362. String0(section, variable.name);
  11363. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11364. Char(section, sfAbsolute);
  11365. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11366. NamedSymbol(section, sn,variable, 0,0);
  11367. ELSE
  11368. Char(section, sfRelative);
  11369. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11370. END;
  11371. NType(variable.type);
  11372. s := module.allSections.FindBySymbol(variable);
  11373. END NVariable;
  11374. (*
  11375. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11376. *)
  11377. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11378. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11379. BEGIN
  11380. IF typeDeclaration = NIL THEN RETURN END;
  11381. pos := CurrentIndex();
  11382. s := module.allSections.FindBySymbol(typeDeclaration);
  11383. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11384. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11385. Char(section, sfTypeDeclaration);
  11386. Size(section, scopeOffset);
  11387. String0(section, typeDeclaration.name);
  11388. declared := typeDeclaration.declaredType.resolved;
  11389. IF (declared IS SyntaxTree.PointerType) THEN
  11390. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11391. END;
  11392. WITH declared: SyntaxTree.RecordType DO
  11393. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11394. Symbol(section, s, 0, offset);
  11395. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11396. Basic.AppendToSegmentedName(name,".@Info");
  11397. s := module.allSections.FindByName(name);
  11398. IF s # NIL THEN (* does not work for coop *)
  11399. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11400. END;
  11401. NScope(declared.recordScope, pos);
  11402. |declared: SyntaxTree.CellType DO
  11403. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11404. Symbol(section, s, 0, offset);
  11405. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11406. Basic.AppendToSegmentedName(name,".@Info");
  11407. s := module.allSections.FindByName(name);
  11408. IF s # NIL THEN
  11409. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11410. END;
  11411. NScope(declared.cellScope, pos);
  11412. ELSE
  11413. Address(section, 0);
  11414. END;
  11415. END NTypeDeclaration;
  11416. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11417. VAR pos: LONGINT;
  11418. BEGIN
  11419. pos := CurrentIndex();
  11420. Char(section,sfModule);
  11421. Size(section, prevSymbol);
  11422. String0(section, module.name);
  11423. NScope(module.moduleScope, pos);
  11424. END NModule;
  11425. (*
  11426. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11427. *)
  11428. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11429. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11430. BEGIN
  11431. IF scope = NIL THEN RETURN END;
  11432. IF RefInfo THEN Info(section, "Scope") END;
  11433. Char(section, sfScopeBegin);
  11434. variable := scope.firstVariable;
  11435. WHILE (variable # NIL) DO
  11436. NVariable(variable, prevSymbol);
  11437. variable := variable.nextVariable;
  11438. END;
  11439. WITH scope: SyntaxTree.ModuleScope DO
  11440. bodyProcedure := scope.bodyProcedure;
  11441. |scope: SyntaxTree.RecordScope DO
  11442. bodyProcedure := scope.bodyProcedure;
  11443. ELSE
  11444. bodyProcedure := NIL;
  11445. END;
  11446. IF bodyProcedure # NIL THEN
  11447. NProcedure(bodyProcedure, prevSymbol)
  11448. END;
  11449. procedure := scope.firstProcedure;
  11450. WHILE procedure # NIL DO
  11451. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11452. procedure := procedure.nextProcedure;
  11453. END;
  11454. typeDeclaration := scope.firstTypeDeclaration;
  11455. WHILE typeDeclaration # NIL DO
  11456. NTypeDeclaration(typeDeclaration, prevSymbol);
  11457. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11458. END;
  11459. Char(section, sfScopeEnd); (* scope ends *)
  11460. END NScope;
  11461. BEGIN
  11462. NEW(indirectTypes, 32);
  11463. ArrayBlock(section,sizePC,"", FALSE);
  11464. startPC := section.pc;
  11465. NModule(module.module, -1);
  11466. PatchArray(section,sizePC,CurrentIndex());
  11467. END References;
  11468. (*
  11469. Command* = RECORD
  11470. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11471. name*: Name; (* name of the procedure *)
  11472. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11473. entryAdr* : ADDRESS; (* entry address of procedure *)
  11474. END;
  11475. *)
  11476. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11477. VAR
  11478. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11479. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11480. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11481. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11482. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11483. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11484. BEGIN
  11485. RETURN
  11486. (type = NIL) OR
  11487. (type.resolved IS SyntaxTree.RecordType) OR
  11488. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11489. (type.resolved IS SyntaxTree.AnyType);
  11490. END TypeAllowed;
  11491. BEGIN
  11492. numberParameters := procedureType.numberParameters;
  11493. RETURN
  11494. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11495. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11496. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11497. END GetProcedureAllowed;
  11498. PROCEDURE WriteType(type : SyntaxTree.Type);
  11499. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11500. name: Basic.SegmentedName; offset: LONGINT;
  11501. BEGIN
  11502. IF type = NIL THEN
  11503. Address(source,0);
  11504. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11505. Address(source,1);
  11506. ELSE
  11507. type := type.resolved;
  11508. IF type IS SyntaxTree.PointerType THEN
  11509. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11510. END;
  11511. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11512. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11513. name[0] := typeDeclaration.name; name[1] := -1;
  11514. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11515. ASSERT(section # NIL);
  11516. ELSE
  11517. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11518. (* TODO *)
  11519. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11520. END;
  11521. IF implementationVisitor.backend.cooperative THEN
  11522. offset := 0;
  11523. ELSE
  11524. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11525. END;
  11526. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11527. END;
  11528. END WriteType;
  11529. BEGIN
  11530. Info(source, "command array descriptor");
  11531. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11532. numberCommands := 0;
  11533. Info(source, "command array content");
  11534. FOR i := 0 TO module.allSections.Length() - 1 DO
  11535. p := module.allSections.GetSection(i);
  11536. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11537. procedure := p.symbol(SyntaxTree.Procedure);
  11538. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11539. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11540. procedure.GetName(name);
  11541. Name(source,name);
  11542. numberParameters := procedureType.numberParameters;
  11543. (* offset of type of first parameter *)
  11544. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11545. ELSE WriteType(procedureType.firstParameter.type)
  11546. END;
  11547. (* offset of type of return parameter *)
  11548. WriteType(procedureType.returnType);
  11549. (* command name *)
  11550. (* command code offset *)
  11551. Symbol(source,p,0,0);
  11552. INC(numberCommands);
  11553. IF Trace THEN
  11554. D.Ln;
  11555. END;
  11556. END;
  11557. END
  11558. END;
  11559. PatchArray(source,sizePC,numberCommands);
  11560. END CommandArray;
  11561. (* to prevent from double import of different module aliases *)
  11562. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11563. VAR i: SyntaxTree.Import;
  11564. BEGIN
  11565. i := module.module.moduleScope.firstImport;
  11566. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11567. i := i.nextImport;
  11568. END;
  11569. RETURN i = import
  11570. END IsFirstDirectOccurence;
  11571. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11572. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11573. BEGIN
  11574. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11575. ArrayBlock(source,pc,"", FALSE);
  11576. Info(source, "import module array data");
  11577. IF implementationVisitor.backend.cooperative THEN
  11578. offset := 0;
  11579. ELSE
  11580. IF module.system.addressType.sizeInBits = 64 THEN
  11581. (* change this when Heaps.HeapBlock is modified *)
  11582. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11583. ELSE
  11584. (* change this when Heaps.HeapBlock is modified *)
  11585. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11586. END;
  11587. END;
  11588. import := module.module.moduleScope.firstImport;
  11589. numberImports := 0;
  11590. WHILE import # NIL DO
  11591. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11592. Global.GetModuleSegmentedName(import.module,name);
  11593. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11594. NamedSymbol(source, name, NIL, 0, offset);
  11595. INC(numberImports);
  11596. END;
  11597. import := import.nextImport
  11598. END;
  11599. PatchArray(source,pc,numberImports);
  11600. END ImportsArray;
  11601. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11602. VAR
  11603. p: Sections.Section; sizePC, size, i: LONGINT;
  11604. BEGIN
  11605. Info(source, "Type info section");
  11606. size := 0;
  11607. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11608. FOR i := 0 TO module.allSections.Length() - 1 DO
  11609. p := module.allSections.GetSection(i);
  11610. WITH p: IntermediateCode.Section DO
  11611. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11612. Symbol(source,p,EmptyBlockOffset,0);
  11613. INC(size);
  11614. END;
  11615. END
  11616. END;
  11617. PatchArray(source,sizePC,size);
  11618. END TypeInfoSection;
  11619. (*
  11620. ProcTableEntry* = RECORD
  11621. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11622. noPtr*: LONGINT;
  11623. END;
  11624. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11625. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11626. *)
  11627. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11628. VAR
  11629. numberPointers: SIZE;
  11630. procedure: SyntaxTree.Procedure;
  11631. BEGIN
  11632. Info(section,"pcFrom");
  11633. Symbol(section,procedureSection,0,0);
  11634. Info(section,"pcTo");
  11635. Symbol(section, procedureSection, procedureSection.pc, 0);
  11636. Info(section,"pointer to offsets array");
  11637. Symbol(section, section,section.pc+1,0);
  11638. Info(section,"offsets array");
  11639. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11640. PointerArray(section, procedure.procedureScope, numberPointers);
  11641. END ProcedureDescriptor;
  11642. (* only for tracing, the descriptor is otherwise not complete ! *)
  11643. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11644. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11645. BEGIN
  11646. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11647. name := procedureSection.name;
  11648. Basic.AppendToSegmentedName(name,".@Info");
  11649. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11650. Address(section,0);
  11651. Symbol(section,section,2,0);
  11652. (*
  11653. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11654. descSize: LONGINT;
  11655. sentinel: LONGINT; (* = MPO-4 *)
  11656. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11657. flags*: SET;
  11658. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11659. name*: Name;
  11660. END;
  11661. *)
  11662. Size(section, 0);
  11663. Longint(section,0);
  11664. Address(section,0);
  11665. Set(section,{});
  11666. moduleSection := ModuleSection();
  11667. Symbol( section, moduleSection, moduleSection.pc,0);
  11668. IF procedureSection.symbol = NIL THEN
  11669. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11670. ELSE
  11671. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11672. END;
  11673. Name(section, infoName);
  11674. Size(section, 0);
  11675. RETURN section;
  11676. END MakeProcedureDescriptorTag;
  11677. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11678. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11679. BEGIN
  11680. name := procedureSection.name;
  11681. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11682. IF implementationVisitor.backend.cooperative THEN
  11683. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11684. Info(section, "TypeDescriptor");
  11685. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11686. NamedSymbol(dest, name,NIL, 0, 0);
  11687. BaseRecord(dest);
  11688. offset := 0;
  11689. ELSIF CreateProcedureDescInfo THEN
  11690. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11691. Address(dest,0);
  11692. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11693. offset := dest.pc;
  11694. ELSE
  11695. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11696. END;
  11697. ProcedureDescriptor(dest, procedureSection);
  11698. Symbol(section, dest, offset, 0);
  11699. END ProcedureDescriptorPointer;
  11700. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11701. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11702. BEGIN
  11703. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11704. numberProcs := 0;
  11705. FOR i := 0 TO module.allSections.Length() - 1 DO
  11706. destination := module.allSections.GetSection(i);
  11707. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11708. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11709. INC(numberProcs);
  11710. END
  11711. END;
  11712. PatchArray(section, sizePC, numberProcs);
  11713. END ProcedureDescriptorArray;
  11714. (*
  11715. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11716. VAR
  11717. next*: Module; (** once a module is published, all fields are read-only *)
  11718. name*: Name;
  11719. init, published: BOOLEAN;
  11720. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11721. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11722. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11723. command*: POINTER TO ARRAY OF Command;
  11724. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11725. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11726. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11727. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11728. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11729. data*, code*: Bytes;
  11730. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11731. export*: ExportDesc;
  11732. term*: TerminationHandler;
  11733. exTable*: ExceptionTable;
  11734. noProcs*: LONGINT;
  11735. firstProc*: ADDRESS; <- done by loader
  11736. maxPtrs*: LONGINT;
  11737. crc*: LONGINT;
  11738. *)
  11739. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11740. BEGIN
  11741. Info(section, "cycle");
  11742. Size(section,0);
  11743. Info(section, "references");
  11744. Size(section,0);
  11745. Info(section, "nextMarked");
  11746. Address(section,0);
  11747. Info(section, "nextWatched");
  11748. Address(section,0);
  11749. END BasePointer;
  11750. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11751. BEGIN
  11752. BasePointer(section);
  11753. Info(section, "action");
  11754. Address(section,0);
  11755. Info(section, "monitor");
  11756. Address(section,0);
  11757. END BaseObject;
  11758. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11759. BEGIN
  11760. BasePointer(section);
  11761. Info(section, "action");
  11762. Address(section,0);
  11763. Info(section, "monitor");
  11764. Address(section,0);
  11765. END BaseRecord;
  11766. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11767. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11768. pooledName: Basic.SegmentedName;
  11769. symbol: SyntaxTree.Symbol;
  11770. BEGIN
  11771. Global.GetModuleName(module.module,name);
  11772. Strings.Append(name,".@Module.@Descriptor");
  11773. Basic.ToSegmentedName(name, pooledName);
  11774. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11775. Symbol(section,descriptorSection,0,0);
  11776. Info(descriptorSection, "descriptor");
  11777. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11778. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11779. Address(descriptorSection,0);
  11780. Global.GetModuleName(module.module,name);
  11781. Strings.Append(name,".@Trace");
  11782. Basic.ToSegmentedName(name, pooledName);
  11783. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11784. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11785. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11786. END ModuleDescriptor;
  11787. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11788. VAR name: ARRAY 128 OF CHAR;
  11789. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11790. symbol: SyntaxTree.Symbol;
  11791. BEGIN
  11792. ASSERT(implementationVisitor.backend.newObjectFile);
  11793. Global.GetModuleName(module.module,name);
  11794. Strings.Append(name,".@Module");
  11795. Basic.ToSegmentedName(name, pooledName);
  11796. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11797. moduleSection.SetExported(TRUE);
  11798. IF moduleSection.pc = 0 THEN
  11799. IF implementationVisitor.backend.cooperative THEN
  11800. Info(moduleSection, "descriptor");
  11801. ModuleDescriptor(moduleSection);
  11802. BaseObject(moduleSection);
  11803. implementationVisitor.CreateTraceModuleMethod(module.module);
  11804. ELSE
  11805. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11806. Info(moduleSection, "HeapBlock");
  11807. Symbol(moduleSection,moduleSection,2,0);
  11808. Info(moduleSection, "TypeDescriptor");
  11809. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11810. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11811. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11812. END;
  11813. END;
  11814. RETURN moduleSection;
  11815. END ModuleSection;
  11816. PROCEDURE NewModuleInfo();
  11817. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11818. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11819. sectionName: Basic.SectionName;
  11820. CONST MPO=-40000000H;
  11821. BEGIN
  11822. (*
  11823. TypeDesc* = POINTER TO RECORD
  11824. descSize: SIZE;
  11825. sentinel: LONGINT; (* = MPO-4 *)
  11826. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11827. flags*: SET;
  11828. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11829. name*: Name;
  11830. refsOffset: SIZE;
  11831. END;
  11832. *)
  11833. (*name is missing prefixes sometimes*)
  11834. Global.GetModuleSegmentedName(module.module,name);
  11835. Basic.AppendToSegmentedName(name,".@Info");
  11836. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11837. Info(source, "HeapBlock");
  11838. Address(source,0); (* an empty heap block prevents GC marking *)
  11839. Info(source, "TypeDescriptor");
  11840. Address(source,0);
  11841. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  11842. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11843. Address(source,MPO-4);
  11844. Info(source, "type tag pointer");
  11845. Address( source,0);
  11846. Info(source, "type flags");
  11847. flags := {};
  11848. Set( source, flags);
  11849. Info(source, "pointer to module");
  11850. moduleSection := ModuleSection();
  11851. Symbol( source, moduleSection, moduleSection.pc,0);
  11852. Info(source, "type name");
  11853. i := 0;
  11854. sectionName := "@Self";
  11855. (*
  11856. Global.GetSymbolSegmentedName(td,name);
  11857. Basic.SegmentedNameToString(name, sectionName);
  11858. *)
  11859. Name(source,sectionName);
  11860. source.SetReferenced(FALSE);
  11861. patchInfoPC := source.pc;
  11862. Size(source, 0);
  11863. END NewModuleInfo;
  11864. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11865. VAR
  11866. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11867. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  11868. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11869. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  11870. referenceSectionOffset : LONGINT;
  11871. name: Basic.SegmentedName; offset: LONGINT;
  11872. flags: SET;
  11873. BEGIN
  11874. NewModuleInfo();
  11875. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11876. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11877. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11878. ImportsArray(importSection);
  11879. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11880. CommandArray(commandsSection);
  11881. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11882. ExceptionArray(exceptionSection);
  11883. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11884. AddPointer(typeInfoSection, typeInfoSectionOffset);
  11885. TypeInfoSection(typeInfoSection);
  11886. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11887. References(referenceSection);
  11888. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11889. ProcedureDescriptorArray(procTableSection, numberProcs);
  11890. IF ProtectModulesPointers THEN
  11891. name := "Heaps.AnyPtr";
  11892. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11893. (* set base pointer *)
  11894. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  11895. END;
  11896. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11897. ArrayBlock(emptyArraySection,temp,"", FALSE);
  11898. moduleSection := ModuleSection();
  11899. Info(moduleSection, "nextRoot*: RootObject");
  11900. Address(moduleSection,0);
  11901. Info(moduleSection, "next*: Module");
  11902. Address(moduleSection,0);
  11903. Info(moduleSection, "name*: Name");
  11904. Name(moduleSection,moduleName);
  11905. Info(moduleSection, "init, published: BOOLEAN");
  11906. Boolean(moduleSection,FALSE);
  11907. Boolean(moduleSection,FALSE);
  11908. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11909. Boolean(moduleSection,FALSE);
  11910. Boolean(moduleSection,FALSE);
  11911. Info(moduleSection, "refcnt*: LONGINT");
  11912. Longint(moduleSection,0);
  11913. Info(moduleSection, "sb*: ADDRESS");
  11914. Address(moduleSection,0);
  11915. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11916. Address(moduleSection,0);
  11917. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11918. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11919. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11920. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11921. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11922. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11923. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11924. Symbol(moduleSection,importSection,importSectionOffset,0);
  11925. Info(moduleSection, "procTable*: ProcTable");
  11926. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11927. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11928. Address(moduleSection,0);
  11929. Address(moduleSection,0);
  11930. Address(moduleSection,0);
  11931. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  11932. Info(moduleSection, "export*: ExportDesc");
  11933. ExportDesc(moduleSection);
  11934. Info(moduleSection, "term*: TerminationHandler");
  11935. Address(moduleSection,0);
  11936. Info(moduleSection, "exTable*: ExceptionTable");
  11937. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  11938. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding -> alignment *)
  11939. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  11940. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  11941. Info(moduleSection, "crc*: LONGINT");
  11942. patchCRC:= moduleSection.pc;
  11943. Longint(moduleSection, 0); (*! must be implemented *)
  11944. Info(moduleSection, "body*: ADDRESS");
  11945. Symbol(moduleSection, bodyProc, 0,0);
  11946. Info(moduleSection, "module flags");
  11947. flags := {};
  11948. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  11949. Set( moduleSection, flags);
  11950. IF implementationVisitor.backend.cooperative THEN
  11951. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  11952. Info(moduleSection, "monitor.owner");
  11953. Address(moduleSection,0);
  11954. Info(moduleSection, "monitor.nestingLevel");
  11955. Address(moduleSection,0);
  11956. Info(moduleSection, "monitor.blockedQueue");
  11957. Address(moduleSection,0); Address(moduleSection,0);
  11958. Info(moduleSection, "monitor.waitingQueue");
  11959. Address(moduleSection,0); Address(moduleSection,0);
  11960. Info(moduleSection, "monitor.waitingSentinel");
  11961. Address(moduleSection,0);
  11962. END;
  11963. END Module;
  11964. PROCEDURE PatchCRC(crc: LONGINT);
  11965. BEGIN
  11966. IF implementationVisitor.newObjectFile & ~simple THEN
  11967. PatchLongint(ModuleSection(), patchCRC, crc);
  11968. END;
  11969. END PatchCRC;
  11970. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  11971. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: SIZE;
  11972. BEGIN
  11973. ArrayBlock(source,pc,"",FALSE);
  11974. Info(source, "pointer offsets array data");
  11975. IF scope IS SyntaxTree.RecordScope THEN
  11976. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  11977. ELSIF scope IS SyntaxTree.CellScope THEN
  11978. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  11979. ELSIF scope IS SyntaxTree.ModuleScope THEN
  11980. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  11981. WHILE variable # NIL DO
  11982. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  11983. symbol := module.allSections.FindBySymbol(variable);
  11984. ASSERT(symbol # NIL);
  11985. Pointers(0,symbol, source,variable.type,numberPointers);
  11986. END;
  11987. variable := variable.nextVariable;
  11988. END;
  11989. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  11990. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11991. WHILE parameter # NIL DO
  11992. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  11993. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  11994. END;
  11995. parameter := parameter.nextParameter;
  11996. END;
  11997. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  11998. parametersSize := ProcedureParametersSize(module.system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  11999. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12000. IF implementationVisitor.backend.preciseGC THEN
  12001. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12002. END;
  12003. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12004. END;
  12005. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12006. WHILE(variable # NIL) DO
  12007. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12008. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12009. END;
  12010. variable := variable.nextVariable
  12011. END;
  12012. END;
  12013. PatchArray(source,pc,numberPointers);
  12014. END PointerArray;
  12015. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12016. VAR
  12017. name: Basic.SegmentedName;
  12018. section: IntermediateCode.Section;
  12019. BEGIN
  12020. ASSERT(implementationVisitor.newObjectFile);
  12021. Global.GetSymbolSegmentedName(symbol,name);
  12022. Basic.AppendToSegmentedName(name,suffix);
  12023. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12024. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12025. Info(section, "HeapBlock");
  12026. Address(section,0); (* empty such that GC does not go on traversing *)
  12027. Info(section, suffix);
  12028. Address(section,0);
  12029. pc := section.pc;
  12030. RETURN section;
  12031. END SymbolSection;
  12032. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12033. VAR recordType: SyntaxTree.RecordType;
  12034. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12035. section: Sections.Section; cellType: SyntaxTree.CellType;
  12036. tdInfoOffset: LONGINT;
  12037. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12038. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12039. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12040. sectionName: Basic.SectionName;
  12041. CONST MPO=-40000000H;
  12042. BEGIN
  12043. (*
  12044. TypeDesc* = POINTER TO RECORD
  12045. descSize: SIZE;
  12046. sentinel: LONGINT; (* = MPO-4 *)
  12047. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12048. flags*: SET;
  12049. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12050. name*: Name;
  12051. refsOffset: SIZE;
  12052. END;
  12053. *)
  12054. (* source := module.sections.FindByName(...) *)
  12055. Global.GetSymbolSegmentedName(td,name);
  12056. Basic.AppendToSegmentedName(name,".@Info");
  12057. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12058. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12059. Address(source,0);
  12060. Info(source, "TypeDescriptor");
  12061. Address(source,0);
  12062. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12063. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12064. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12065. Info(source, "type tag pointer");
  12066. Symbol( source, tag, offset, 0);
  12067. Info(source, "type flags");
  12068. flags := {};
  12069. IF isProtected THEN INCL(flags,31) END;
  12070. Set( source, flags);
  12071. Info(source, "pointer to module");
  12072. moduleSection := ModuleSection();
  12073. Symbol( source, moduleSection, moduleSection.pc,0);
  12074. Info(source, "type name");
  12075. i := 0;
  12076. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12077. (*
  12078. Global.GetSymbolSegmentedName(td,name);
  12079. Basic.SegmentedNameToString(name, sectionName);
  12080. *)
  12081. Name(source,sectionName);
  12082. source.SetReferenced(FALSE);
  12083. Size(source, 0);
  12084. RETURN source;
  12085. END NewTypeDescriptorInfo;
  12086. PROCEDURE NewTypeDescriptor;
  12087. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12088. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12089. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12090. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12091. CONST MPO=-40000000H;
  12092. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12093. VAR i: LONGINT;
  12094. PROCEDURE Td(record: SyntaxTree.RecordType);
  12095. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12096. BEGIN
  12097. IF record # NIL THEN
  12098. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12099. baseTD := record.typeDeclaration;
  12100. Global.GetSymbolSegmentedName(baseTD,name);
  12101. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12102. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12103. ELSE
  12104. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12105. END;
  12106. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12107. Symbol(source, tir, 0, offset);
  12108. IF reverse THEN Td(record.GetBaseRecord()) END;
  12109. END;
  12110. END Td;
  12111. BEGIN
  12112. Info(source, "tag table");
  12113. baseRecord := recordType;
  12114. i := 0;
  12115. WHILE baseRecord # NIL DO
  12116. INC(i);
  12117. baseRecord := baseRecord.GetBaseRecord();
  12118. END;
  12119. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12120. IF ~reverse THEN Td(recordType) END;
  12121. WHILE i < size DO
  12122. Address(source,0);
  12123. INC(i);
  12124. END;
  12125. IF reverse THEN Td(recordType) END;
  12126. END TdTable;
  12127. PROCEDURE MethodTable(reverse: BOOLEAN);
  12128. VAR i,methods: LONGINT;
  12129. BEGIN
  12130. Info(source, "method table");
  12131. IF recordType # NIL THEN
  12132. methods := recordType.recordScope.numberMethods;
  12133. IF reverse THEN
  12134. FOR i := methods-1 TO 0 BY -1 DO
  12135. procedure := recordType.recordScope.FindMethod(i);
  12136. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12137. NamedSymbol(source, name,procedure, 0,0);
  12138. END;
  12139. ELSE
  12140. FOR i := 0 TO methods-1 DO
  12141. procedure := recordType.recordScope.FindMethod(i);
  12142. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12143. NamedSymbol(source, name,procedure, 0,0);
  12144. END;
  12145. END;
  12146. END;
  12147. END MethodTable;
  12148. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12149. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12150. BEGIN
  12151. Info(source, "method table");
  12152. baseRecord := recordType;
  12153. WHILE baseRecord.baseType # NIL DO
  12154. baseRecord := baseRecord.GetBaseRecord ();
  12155. END;
  12156. GetRecordTypeName (baseRecord, name);
  12157. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12158. IF name = stackFrame THEN
  12159. start := 0;
  12160. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12161. baseRecord := recordType;
  12162. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12163. baseRecord := baseRecord.GetBaseRecord ();
  12164. END;
  12165. IF baseRecord # NIL THEN
  12166. GetRecordTypeName (baseRecord, name);
  12167. IF pointer & ~baseRecord.isObject THEN
  12168. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12169. END;
  12170. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12171. ELSIF recordType.isObject THEN
  12172. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12173. ELSIF pointer THEN
  12174. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12175. ELSE
  12176. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12177. END;
  12178. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12179. Symbol(source, tir, 0, 0);
  12180. start := 0;
  12181. baseRecord := recordType;
  12182. WHILE (baseRecord # NIL) DO
  12183. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12184. baseRecord := baseRecord.GetBaseRecord ();
  12185. END;
  12186. ELSE
  12187. (* explicit trace method: *)
  12188. procedure := recordType.recordScope.FindMethod(0);
  12189. IF ~procedure.isFinalizer THEN
  12190. Global.GetSymbolSegmentedName(procedure, name);
  12191. NamedSymbol(source, name,procedure, 0,0);
  12192. END;
  12193. start := 1;
  12194. END;
  12195. IF (name # stackFrame) & recordType.isObject THEN
  12196. baseRecord := recordType;
  12197. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12198. baseRecord := baseRecord.GetBaseRecord ();
  12199. END;
  12200. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12201. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12202. ELSE
  12203. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12204. END;
  12205. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12206. Symbol(source, tir, 0, 0);
  12207. END;
  12208. methods := recordType.recordScope.numberMethods;
  12209. FOR i := start TO methods-1 DO
  12210. procedure := recordType.recordScope.FindMethod(i);
  12211. IF ~procedure.isFinalizer THEN
  12212. Global.GetSymbolSegmentedName(procedure, name);
  12213. NamedSymbol(source, name,procedure, 0,0);
  12214. END;
  12215. END;
  12216. END CooperativeMethodTable;
  12217. BEGIN
  12218. Global.GetSymbolSegmentedName(td,name);
  12219. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12220. source.SetExported(IsExported(td));
  12221. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12222. IF implementationVisitor.backend.cooperative THEN
  12223. base := NIL;
  12224. baseRecord := recordType.GetBaseRecord();
  12225. IF baseRecord # NIL THEN
  12226. baseTD := baseRecord.typeDeclaration;
  12227. END;
  12228. IF ~recordType.isObject THEN
  12229. Info(source, "parent");
  12230. IF baseRecord # NIL THEN
  12231. Global.GetSymbolSegmentedName(baseTD,name);
  12232. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12233. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12234. ELSE
  12235. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12236. END;
  12237. Symbol(source, tir, 0, 0);
  12238. ELSE
  12239. Address(source,0);
  12240. END;
  12241. Info(source, "record size");
  12242. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12243. source.SetReferenced(FALSE);
  12244. CooperativeMethodTable(FALSE);
  12245. base := source;
  12246. Global.GetSymbolSegmentedName(td,name);
  12247. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12248. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12249. source.SetExported(IsExported(td));
  12250. source.SetReferenced(FALSE);
  12251. END;
  12252. Info(source, "parent");
  12253. IF baseRecord # NIL THEN
  12254. Global.GetSymbolSegmentedName(baseTD,name);
  12255. sym := baseTD;
  12256. IF ~recordType.isObject THEN
  12257. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12258. sym := NIL;
  12259. END;
  12260. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12261. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12262. ELSE
  12263. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12264. END;
  12265. Symbol(source, tir, 0, 0);
  12266. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12267. Address(source,0);
  12268. ELSE
  12269. IF recordType.isObject THEN
  12270. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12271. ELSE
  12272. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12273. END;
  12274. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12275. Symbol(source, tir, 0, 0);
  12276. END;
  12277. Info(source, "base record descriptor");
  12278. Symbol(source, base, 0, 0);
  12279. CooperativeMethodTable(TRUE);
  12280. source.SetReferenced(FALSE);
  12281. IF recordType.hasPointers THEN
  12282. IF ~HasExplicitTraceMethod (recordType) THEN
  12283. implementationVisitor.CreateTraceMethod(recordType);
  12284. END;
  12285. implementationVisitor.CreateResetProcedure(recordType);
  12286. implementationVisitor.CreateAssignProcedure(recordType);
  12287. END;
  12288. ELSIF ~simple THEN
  12289. (*
  12290. MethodEnd = MPO
  12291. ---
  12292. methods (# methods)
  12293. ---
  12294. tags (16)
  12295. ---
  12296. TypeDesc = TypeInfoAdr
  12297. ---
  12298. td adr ---> rec size
  12299. ----
  12300. pointer offsets
  12301. ----
  12302. (padding)
  12303. -----
  12304. empty [2 addresses aligned]
  12305. empty
  12306. empty
  12307. numPtrs
  12308. ---
  12309. pointer offsets
  12310. ---
  12311. *)
  12312. Info(source, "MethodEnd = MPO");
  12313. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12314. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12315. MethodTable(TRUE);
  12316. TdTable(TypeTags, TRUE);
  12317. Info(source, "type descriptor info pointer");
  12318. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12319. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12320. IF (cellType # NIL) THEN
  12321. IF cellType.sizeInBits < 0 THEN
  12322. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12323. END;
  12324. Info(source, "cell size");
  12325. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12326. ELSE
  12327. Info(source, "record size");
  12328. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12329. END;
  12330. Info(source, "pointer offsets pointer");
  12331. padding := 1- source.pc MOD 2;
  12332. Symbol(source, source, source.pc+1+padding,0);
  12333. IF padding >0 THEN
  12334. Info(source, "padding");
  12335. FOR i := 1 TO padding DO Address(source,0) END;
  12336. END;
  12337. IF cellType # NIL THEN
  12338. PointerArray(source, cellType.cellScope, numberPointers);
  12339. ELSE
  12340. PointerArray(source, recordType.recordScope, numberPointers);
  12341. END;
  12342. ELSE
  12343. (*
  12344. simple:
  12345. td adr --> size
  12346. tag(1)
  12347. tag(2)
  12348. tag(3)
  12349. methods ->
  12350. *)
  12351. Info(source, "record size");
  12352. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12353. TdTable(TypeTags, FALSE);
  12354. MethodTable(FALSE);
  12355. source.SetReferenced(FALSE);
  12356. END;
  12357. END NewTypeDescriptor;
  12358. BEGIN
  12359. x := x.resolved;
  12360. IF (x IS SyntaxTree.PointerType) THEN
  12361. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12362. END;
  12363. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12364. recordType := x(SyntaxTree.RecordType);
  12365. td := x.typeDeclaration;
  12366. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12367. ASSERT(td # NIL);
  12368. section := module.allSections.FindBySymbol(td); (* TODO *)
  12369. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12370. IF implementationVisitor.newObjectFile THEN
  12371. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12372. NewTypeDescriptor
  12373. END;
  12374. ELSE
  12375. (* data section in intermediate code *)
  12376. Global.GetSymbolSegmentedName(td,name);
  12377. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  12378. Basic.SuffixSegmentedName (name, module.module.name);
  12379. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  12380. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  12381. tir.Emit(Data(Basic.invalidPosition,op));
  12382. END;
  12383. END;
  12384. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12385. cellType := x(SyntaxTree.CellType);
  12386. td := x.typeDeclaration;
  12387. section := module.allSections.FindBySymbol(td); (* TODO *)
  12388. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12389. IF implementationVisitor.newObjectFile THEN
  12390. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12391. NewTypeDescriptor
  12392. END;
  12393. END;
  12394. END;
  12395. END
  12396. END CheckTypeDeclaration
  12397. END MetaDataGenerator;
  12398. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12399. VAR
  12400. trace-: BOOLEAN;
  12401. traceString-: SyntaxTree.IdentifierString;
  12402. traceModuleName-: SyntaxTree.IdentifierString;
  12403. newObjectFile-: BOOLEAN;
  12404. profile-: BOOLEAN;
  12405. noRuntimeChecks: BOOLEAN;
  12406. simpleMetaData-: BOOLEAN;
  12407. noAsserts: BOOLEAN;
  12408. optimize-: BOOLEAN;
  12409. cooperative-: BOOLEAN;
  12410. preregisterStatic-: BOOLEAN;
  12411. dump-: Basic.Writer;
  12412. cellsAreObjects: BOOLEAN;
  12413. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12414. experiment: BOOLEAN;
  12415. PROCEDURE &InitIntermediateBackend*;
  12416. BEGIN
  12417. simpleMetaData := FALSE;
  12418. newObjectFile := FALSE;
  12419. InitBackend;
  12420. SetRuntimeModuleName(DefaultRuntimeModuleName);
  12421. SetTraceModuleName(DefaultTraceModuleName);
  12422. END InitIntermediateBackend;
  12423. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12424. VAR
  12425. declarationVisitor: DeclarationVisitor;
  12426. implementationVisitor: ImplementationVisitor;
  12427. module: Sections.Module;
  12428. name, platformName: SyntaxTree.IdentifierString;
  12429. meta: MetaDataGenerator;
  12430. crc: CRC.CRC32Stream;
  12431. BEGIN
  12432. ResetError;
  12433. Global.GetSymbolName(x,name);
  12434. NEW(module,x,system); (* backend structures *)
  12435. Global.GetModuleName(x, name);
  12436. module.SetModuleName(name);
  12437. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  12438. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12439. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12440. declarationVisitor.Module(x,module);
  12441. IF newObjectFile & ~meta.simple THEN
  12442. meta.Module(implementationVisitor.moduleBodySection);
  12443. END;
  12444. GetDescription(platformName);
  12445. module.SetPlatformName(platformName);
  12446. IF newObjectFile THEN
  12447. NEW(crc);
  12448. module.allSections.WriteRaw(crc);
  12449. crc.Update;
  12450. meta.PatchCRC(crc.GetCRC());
  12451. END;
  12452. RETURN module
  12453. END GenerateIntermediate;
  12454. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12455. BEGIN RETURN TRUE
  12456. END SupportedImmediate;
  12457. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12458. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12459. END ProcessSyntaxTreeModule;
  12460. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12461. VAR
  12462. result: Sections.Module;
  12463. traceName: Basic.MessageString;
  12464. BEGIN
  12465. ASSERT(intermediateCodeModule IS Sections.Module);
  12466. result := intermediateCodeModule(Sections.Module);
  12467. IF trace THEN
  12468. traceName := "intermediate code trace: ";
  12469. Strings.Append(traceName,traceString);
  12470. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12471. IF (traceString="") OR (traceString="*") THEN
  12472. result.Dump(dump);
  12473. dump.Update
  12474. ELSE
  12475. Sections.DumpFiltered(dump, result, traceString);
  12476. END
  12477. END;
  12478. RETURN result
  12479. END ProcessIntermediateCodeModule;
  12480. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12481. BEGIN instructionSet := "Intermediate";
  12482. END GetDescription;
  12483. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  12484. BEGIN
  12485. SELF.newObjectFile := newObjectFile;
  12486. SELF.simpleMetaData := simpleMetaData;
  12487. END SetNewObjectFile;
  12488. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12489. BEGIN COPY(name, traceModuleName)
  12490. END SetTraceModuleName;
  12491. PROCEDURE DefineOptions(options: Options.Options);
  12492. BEGIN
  12493. DefineOptions^(options);
  12494. options.Add(0X,"trace",Options.String);
  12495. options.Add(0X,"runtime",Options.String);
  12496. options.Add(0X,"newObjectFile",Options.Flag);
  12497. options.Add(0X,"traceModule",Options.String);
  12498. options.Add(0X,"profile",Options.Flag);
  12499. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12500. options.Add(0X,"noAsserts",Options.Flag);
  12501. options.Add(0X,"metaData",Options.String);
  12502. options.Add('o',"optimize", Options.Flag);
  12503. options.Add(0X,"preregisterStatic", Options.Flag);
  12504. options.Add(0X,"cellsAreObjects", Options.Flag);
  12505. options.Add(0X,"preciseGC", Options.Flag);
  12506. options.Add(0X,"trackLeave", Options.Flag);
  12507. options.Add(0X,"writeBarriers", Options.Flag);
  12508. options.Add(0X,"experiment", Options.Flag);
  12509. END DefineOptions;
  12510. PROCEDURE GetOptions(options: Options.Options);
  12511. VAR name,string: SyntaxTree.IdentifierString;
  12512. BEGIN
  12513. GetOptions^(options);
  12514. trace := options.GetString("trace",traceString);
  12515. profile := options.GetFlag("profile");
  12516. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12517. noAsserts := options.GetFlag("noAsserts");
  12518. cooperative := options.GetFlag("cooperative");
  12519. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  12520. IF cooperative THEN
  12521. SetRuntimeModuleName("CPU") END
  12522. END;
  12523. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12524. simpleMetaData := TRUE
  12525. END;
  12526. IF options.GetString("metaData",string) THEN
  12527. IF string = "simple" THEN simpleMetaData := TRUE
  12528. ELSIF string ="full" THEN simpleMetaData := FALSE
  12529. END;
  12530. END;
  12531. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  12532. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12533. optimize := options.GetFlag("optimize");
  12534. preregisterStatic := options.GetFlag("preregisterStatic");
  12535. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12536. preciseGC := options.GetFlag("preciseGC");
  12537. trackLeave := options.GetFlag("trackLeave");
  12538. writeBarriers := options.GetFlag("writeBarriers");
  12539. experiment := options.GetFlag("experiment");
  12540. END GetOptions;
  12541. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  12542. BEGIN RETURN SymbolFileFormat.Get()
  12543. END DefaultSymbolFileFormat;
  12544. END IntermediateBackend;
  12545. (* ----------------------------------- register allocation ------------------------------------- *)
  12546. (* register mapping scheme
  12547. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12548. spill offset
  12549. part(n) --> ticket <--> physical register
  12550. spill offset
  12551. *)
  12552. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12553. emptyOperand: IntermediateCode.Operand;
  12554. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12555. statCoopResetVariables: LONGINT;
  12556. statCoopModifyAssignments: LONGINT;
  12557. modifyAssignmentsPC : LONGINT;
  12558. statCoopNilCheck: LONGINT;
  12559. statCoopSwitch: LONGINT;
  12560. statCoopAssignProcedure: LONGINT;
  12561. statCoopTraceMethod: LONGINT;
  12562. statCoopResetProcedure: LONGINT;
  12563. statCoopTraceModule: LONGINT;
  12564. PROCEDURE ResetStatistics*;
  12565. BEGIN
  12566. statCoopResetVariables := 0;
  12567. statCoopModifyAssignments := 0;
  12568. statCoopNilCheck:= 0;
  12569. statCoopSwitch:= 0;
  12570. statCoopAssignProcedure:= 0;
  12571. statCoopTraceMethod:= 0;
  12572. statCoopResetProcedure:= 0;
  12573. statCoopTraceModule:= 0;
  12574. END ResetStatistics;
  12575. PROCEDURE Statistics*;
  12576. BEGIN
  12577. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12578. TRACE(statCoopNilCheck, statCoopSwitch);
  12579. TRACE(statCoopAssignProcedure,
  12580. statCoopTraceMethod,
  12581. statCoopResetProcedure,
  12582. statCoopTraceModule)
  12583. END Statistics;
  12584. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12585. VAR h: LONGINT;
  12586. BEGIN
  12587. WHILE b # 0 DO
  12588. h := a MOD b;
  12589. a := b;
  12590. b := h;
  12591. END;
  12592. RETURN a
  12593. END GCD;
  12594. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12595. BEGIN
  12596. RETURN a*b DIV GCD(a,b)
  12597. END SCM;
  12598. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12599. BEGIN
  12600. (*TRACE(a,b);*)
  12601. IF a = 0 THEN RETURN b
  12602. ELSIF b = 0 THEN RETURN a
  12603. ELSE RETURN SCM(a,b)
  12604. END;
  12605. END CommonAlignment;
  12606. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  12607. BEGIN
  12608. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12609. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12610. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12611. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12612. 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)
  12613. END
  12614. END PassBySingleReference;
  12615. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  12616. BEGIN
  12617. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  12618. END PassInRegister;
  12619. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12620. VAR new: RegisterEntry;
  12621. BEGIN
  12622. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12623. IF queue = NIL THEN
  12624. queue := new
  12625. ELSE
  12626. new.next := queue;
  12627. IF queue#NIL THEN queue.prev := new END;
  12628. queue := new
  12629. END;
  12630. END AddRegisterEntry;
  12631. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12632. VAR this: RegisterEntry;
  12633. BEGIN
  12634. this := queue;
  12635. WHILE (this # NIL) & (this.register # register) DO
  12636. this := this.next;
  12637. END;
  12638. IF this = NIL THEN
  12639. RETURN FALSE
  12640. END;
  12641. ASSERT(this # NIL);
  12642. IF this = queue THEN queue := queue.next END;
  12643. IF this.prev # NIL THEN this.prev.next := this.next END;
  12644. IF this.next # NIL THEN this.next.prev := this.prev END;
  12645. RETURN TRUE
  12646. END RemoveRegisterEntry;
  12647. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12648. BEGIN ASSERT(cond);
  12649. END Assert;
  12650. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12651. BEGIN
  12652. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12653. END ReusableRegister;
  12654. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12655. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12656. BEGIN
  12657. procedure := moduleScope.bodyProcedure;
  12658. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12659. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12660. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12661. procedure.SetScope(moduleScope);
  12662. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12663. procedure.SetAccess(SyntaxTree.Hidden);
  12664. moduleScope.SetBodyProcedure(procedure);
  12665. moduleScope.AddProcedure(procedure);
  12666. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12667. END;
  12668. END EnsureBodyProcedure;
  12669. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12670. VAR import: SyntaxTree.Import;
  12671. selfName: SyntaxTree.IdentifierString;
  12672. module: SyntaxTree.Module;
  12673. BEGIN
  12674. scope.ownerModule.GetName(selfName);
  12675. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12676. module := scope.ownerModule
  12677. ELSE
  12678. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12679. IF import = NIL THEN
  12680. RETURN NIL
  12681. ELSIF import.module = NIL THEN
  12682. RETURN NIL
  12683. ELSE module := import.module
  12684. END;
  12685. END;
  12686. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12687. END GetSymbol;
  12688. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12689. BEGIN
  12690. op.mode := mode;
  12691. IntermediateCode.InitOperand(op.op);
  12692. IntermediateCode.InitOperand(op.tag);
  12693. IntermediateCode.InitOperand(op.extra);
  12694. op.dimOffset := 0;
  12695. END InitOperand;
  12696. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12697. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12698. BEGIN RETURN IntermediateCode.GetType(system, type)
  12699. END GetType;
  12700. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12701. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12702. BEGIN
  12703. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12704. (*
  12705. UniqueId(name,module,name,adr);
  12706. *)
  12707. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12708. constant.SetValue(value);
  12709. constant.SetAccess(SyntaxTree.Hidden);
  12710. module.moduleScope.AddConstant(constant);
  12711. constant.SetScope(module.moduleScope);
  12712. RETURN constant
  12713. END BuildConstant;
  12714. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12715. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12716. BEGIN
  12717. variable := scope.firstVariable;
  12718. WHILE variable # NIL DO
  12719. IF variable.NeedsTrace() THEN
  12720. RETURN TRUE;
  12721. END;
  12722. variable := variable.nextVariable;
  12723. END;
  12724. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12725. WHILE parameter # NIL DO
  12726. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12727. RETURN TRUE;
  12728. END;
  12729. parameter := parameter.nextParameter;
  12730. END;
  12731. RETURN FALSE;
  12732. END HasPointers;
  12733. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12734. 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));
  12735. END IsVariableParameter;
  12736. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12737. VAR parameter: SyntaxTree.Parameter;
  12738. BEGIN
  12739. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12740. WHILE parameter # NIL DO
  12741. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12742. IF parameter.movable THEN RETURN TRUE END;
  12743. parameter := parameter.nextParameter;
  12744. END;
  12745. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12746. END HasVariableParameters;
  12747. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12748. BEGIN
  12749. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12750. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12751. END HasExplicitTraceMethod;
  12752. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12753. BEGIN
  12754. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12755. IF (expression IS SyntaxTree.IntegerValue) THEN
  12756. val := expression(SyntaxTree.IntegerValue).value;
  12757. RETURN TRUE
  12758. ELSE
  12759. RETURN FALSE
  12760. END;
  12761. END IsIntegerConstant;
  12762. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12763. BEGIN
  12764. IF val <= 0 THEN RETURN FALSE END;
  12765. exp := 0;
  12766. WHILE ~ODD(val) DO
  12767. val := val DIV 2;
  12768. INC(exp)
  12769. END;
  12770. RETURN val = 1
  12771. END PowerOf2;
  12772. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12773. VAR procedure: SyntaxTree.Procedure;
  12774. BEGIN
  12775. procedure := record.recordScope.constructor;
  12776. IF procedure = NIL THEN
  12777. record := record.GetBaseRecord();
  12778. IF record # NIL THEN
  12779. procedure := GetConstructor(record)
  12780. END;
  12781. END;
  12782. RETURN procedure;
  12783. END GetConstructor;
  12784. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12785. BEGIN
  12786. value := SHORT(op.intValue);
  12787. RETURN op.mode = IntermediateCode.ModeImmediate;
  12788. END IsIntegerImmediate;
  12789. (** whether a type strictily is a pointer to record or object type
  12790. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12791. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12792. BEGIN
  12793. IF type = NIL THEN
  12794. RETURN FALSE
  12795. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12796. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12797. ELSE
  12798. RETURN FALSE
  12799. END
  12800. END IsStrictlyPointerToRecord;
  12801. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12802. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12803. END IsUnsafePointer;
  12804. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12805. BEGIN type := type.resolved;
  12806. IF type IS SyntaxTree.PointerType THEN
  12807. type := type(SyntaxTree.PointerType).pointerBase;
  12808. type := type.resolved;
  12809. IF type IS SyntaxTree.RecordType THEN
  12810. recordType := type(SyntaxTree.RecordType);
  12811. RETURN TRUE
  12812. ELSE
  12813. RETURN FALSE
  12814. END
  12815. ELSIF type IS SyntaxTree.RecordType THEN
  12816. recordType := type(SyntaxTree.RecordType);
  12817. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12818. ELSIF type IS SyntaxTree.ObjectType THEN
  12819. RETURN TRUE
  12820. ELSIF type IS SyntaxTree.AnyType THEN
  12821. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12822. ELSE
  12823. RETURN FALSE
  12824. END;
  12825. END IsPointerToRecord;
  12826. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12827. BEGIN
  12828. type := type.resolved;
  12829. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12830. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12831. END IsArrayOfSystemByte;
  12832. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12833. BEGIN
  12834. IF type = NIL THEN RETURN FALSE END;
  12835. type := type.resolved;
  12836. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12837. END IsOpenArray;
  12838. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12839. BEGIN
  12840. IF type = NIL THEN RETURN FALSE END;
  12841. type := type.resolved;
  12842. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12843. END IsSemiDynamicArray;
  12844. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12845. BEGIN
  12846. IF type = NIL THEN RETURN FALSE END;
  12847. type := type.resolved;
  12848. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12849. END IsStaticArray;
  12850. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  12851. BEGIN
  12852. IF type = NIL THEN RETURN FALSE END;
  12853. type := type.resolved;
  12854. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  12855. END IsStaticMathArray;
  12856. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12857. BEGIN
  12858. WHILE (IsStaticMathArray(type)) DO
  12859. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12860. END;
  12861. RETURN type;
  12862. END StaticMathArrayBaseType;
  12863. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12864. VAR size: LONGINT;
  12865. BEGIN
  12866. size := 1;
  12867. WHILE (IsStaticArray(type)) DO
  12868. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12869. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12870. END;
  12871. RETURN size;
  12872. END StaticArrayNumElements;
  12873. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12874. VAR size: LONGINT;
  12875. BEGIN
  12876. size := 1;
  12877. WHILE (IsStaticMathArray(type)) DO
  12878. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  12879. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12880. END;
  12881. RETURN size;
  12882. END StaticMathArrayNumElements;
  12883. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12884. BEGIN
  12885. WHILE (IsStaticArray(type)) DO
  12886. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12887. END;
  12888. RETURN type;
  12889. END StaticArrayBaseType;
  12890. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12891. BEGIN
  12892. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12893. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12894. END;
  12895. RETURN type;
  12896. END ArrayBaseType;
  12897. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12898. BEGIN
  12899. IF type = NIL THEN RETURN FALSE END;
  12900. type := type.resolved;
  12901. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12902. END IsDelegate;
  12903. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12904. VAR i: LONGINT;
  12905. BEGIN
  12906. i := 0; type := type.resolved;
  12907. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12908. INC(i);
  12909. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12910. END;
  12911. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12912. INC(i);
  12913. type := type(SyntaxTree.MathArrayType).arrayBase;
  12914. IF type # NIL THEN type := type.resolved END;
  12915. END;
  12916. RETURN i
  12917. END DynamicDim;
  12918. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12919. BEGIN
  12920. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12921. type := type(SyntaxTree.ArrayType).arrayBase;
  12922. END;
  12923. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12924. type := type(SyntaxTree.MathArrayType).arrayBase;
  12925. END;
  12926. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12927. END StaticSize;
  12928. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12929. BEGIN
  12930. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12931. END IsImmediate;
  12932. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12933. BEGIN
  12934. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12935. END IsAddress;
  12936. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12937. BEGIN
  12938. RETURN (x.mode = IntermediateCode.ModeRegister);
  12939. END IsRegister;
  12940. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12941. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12942. BEGIN
  12943. typeDeclaration := recordType.typeDeclaration;
  12944. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12945. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12946. END GetRecordTypeName;
  12947. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12948. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12949. BEGIN
  12950. parSize := 0;
  12951. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  12952. parameter := procedureType.returnParameter;
  12953. INC(parSize,system.SizeOfParameter(parameter));
  12954. parSize := parSize + (-parSize) MOD system.addressSize;
  12955. END;
  12956. parameter :=procedureType.lastParameter;
  12957. WHILE (parameter # NIL) DO
  12958. INC(parSize,system.SizeOfParameter(parameter));
  12959. parSize := parSize + (-parSize) MOD system.addressSize;
  12960. parameter := parameter.prevParameter;
  12961. END;
  12962. IF procedureType.selfParameter # NIL THEN
  12963. parameter := procedureType.selfParameter;
  12964. INC(parSize,system.SizeOfParameter(parameter));
  12965. parSize := parSize + (-parSize) MOD system.addressSize;
  12966. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  12967. END; (* method => self pointer *)
  12968. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12969. RETURN ToMemoryUnits(system,parSize)
  12970. END ParametersSize;
  12971. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12972. BEGIN
  12973. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12974. END IsNested;
  12975. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12976. BEGIN
  12977. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12978. scope := scope.outerScope;
  12979. END;
  12980. RETURN scope # NIL;
  12981. END InCellScope;
  12982. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12983. BEGIN
  12984. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12985. RETURN 0
  12986. ELSE
  12987. *)
  12988. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12989. (*END;*)
  12990. END ProcedureParametersSize;
  12991. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12992. VAR dataUnit: LONGINT;
  12993. BEGIN dataUnit := system.dataUnit;
  12994. ASSERT(size MOD system.dataUnit = 0);
  12995. RETURN size DIV system.dataUnit
  12996. END ToMemoryUnits;
  12997. PROCEDURE Get*(): Backend.Backend;
  12998. VAR backend: IntermediateBackend;
  12999. BEGIN NEW(backend); RETURN backend
  13000. END Get;
  13001. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13002. VAR instruction: IntermediateCode.Instruction;
  13003. BEGIN
  13004. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13005. RETURN instruction
  13006. END Nop;
  13007. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13008. VAR instruction: IntermediateCode.Instruction;
  13009. BEGIN
  13010. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13011. RETURN instruction
  13012. END Mov;
  13013. (* like Mov but ensures that no new register will be allocated for dest *)
  13014. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13015. VAR instruction: IntermediateCode.Instruction;
  13016. BEGIN
  13017. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13018. RETURN instruction
  13019. END MovReplace;
  13020. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13021. VAR instruction: IntermediateCode.Instruction;
  13022. BEGIN
  13023. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13024. RETURN instruction
  13025. END Conv;
  13026. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  13027. BEGIN
  13028. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  13029. END SysvABI;
  13030. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  13031. BEGIN
  13032. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  13033. END SysvABIorWINAPI;
  13034. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13035. VAR instruction: IntermediateCode.Instruction;
  13036. BEGIN
  13037. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13038. RETURN instruction
  13039. END Call;
  13040. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13041. VAR op1, op2, op3: IntermediateCode.Operand;
  13042. VAR instruction: IntermediateCode.Instruction;
  13043. BEGIN
  13044. IntermediateCode.InitNumber(op1,pcOffset);
  13045. IntermediateCode.InitNumber(op2,callingConvention);
  13046. IntermediateCode.InitNumber(op3,unwind);
  13047. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13048. RETURN instruction
  13049. END Exit;
  13050. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13051. VAR instruction: IntermediateCode.Instruction;
  13052. BEGIN
  13053. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13054. RETURN instruction
  13055. END Return;
  13056. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13057. VAR instruction: IntermediateCode.Instruction;
  13058. BEGIN
  13059. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13060. RETURN instruction
  13061. END Result;
  13062. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13063. VAR op1: IntermediateCode.Operand;
  13064. VAR instruction: IntermediateCode.Instruction;
  13065. BEGIN
  13066. IntermediateCode.InitNumber(op1,nr);
  13067. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13068. RETURN instruction
  13069. END Trap;
  13070. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13071. VAR instruction: IntermediateCode.Instruction;
  13072. BEGIN
  13073. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13074. RETURN instruction
  13075. END Br;
  13076. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13077. VAR instruction: IntermediateCode.Instruction;
  13078. BEGIN
  13079. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13080. RETURN instruction
  13081. END Breq;
  13082. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13083. VAR instruction: IntermediateCode.Instruction;
  13084. BEGIN
  13085. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13086. RETURN instruction
  13087. END Brne;
  13088. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13089. VAR instruction: IntermediateCode.Instruction;
  13090. BEGIN
  13091. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13092. RETURN instruction
  13093. END Brge;
  13094. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13095. VAR instruction: IntermediateCode.Instruction;
  13096. BEGIN
  13097. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13098. RETURN instruction
  13099. END Brlt;
  13100. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13101. VAR instruction: IntermediateCode.Instruction;
  13102. BEGIN
  13103. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13104. RETURN instruction
  13105. END Pop;
  13106. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13107. VAR instruction: IntermediateCode.Instruction;
  13108. BEGIN
  13109. ASSERT(op.mode # IntermediateCode.Undefined);
  13110. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13111. RETURN instruction
  13112. END Push;
  13113. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13114. VAR instruction: IntermediateCode.Instruction;
  13115. BEGIN
  13116. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13117. RETURN instruction
  13118. END Neg;
  13119. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13120. VAR instruction: IntermediateCode.Instruction;
  13121. BEGIN
  13122. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13123. RETURN instruction
  13124. END Not;
  13125. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13126. VAR instruction: IntermediateCode.Instruction;
  13127. BEGIN
  13128. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13129. RETURN instruction
  13130. END Abs;
  13131. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13132. VAR instruction: IntermediateCode.Instruction;
  13133. BEGIN
  13134. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13135. ASSERT(~IsImmediate(instruction.op1));
  13136. RETURN instruction
  13137. END Mul;
  13138. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13139. VAR instruction: IntermediateCode.Instruction;
  13140. BEGIN
  13141. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13142. RETURN instruction
  13143. END Div;
  13144. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13145. VAR instruction: IntermediateCode.Instruction;
  13146. BEGIN
  13147. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13148. RETURN instruction
  13149. END Mod;
  13150. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13151. VAR instruction: IntermediateCode.Instruction;
  13152. BEGIN
  13153. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13154. RETURN instruction
  13155. END Sub;
  13156. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13157. VAR instruction: IntermediateCode.Instruction;
  13158. BEGIN
  13159. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13160. RETURN instruction
  13161. END Add;
  13162. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13163. VAR instruction: IntermediateCode.Instruction;
  13164. BEGIN
  13165. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13166. RETURN instruction
  13167. END And;
  13168. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13169. VAR instruction: IntermediateCode.Instruction;
  13170. BEGIN
  13171. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13172. RETURN instruction
  13173. END Or;
  13174. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13175. VAR instruction: IntermediateCode.Instruction;
  13176. BEGIN
  13177. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13178. RETURN instruction
  13179. END Xor;
  13180. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13181. VAR instruction: IntermediateCode.Instruction;
  13182. BEGIN
  13183. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13184. RETURN instruction
  13185. END Shl;
  13186. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13187. VAR instruction: IntermediateCode.Instruction;
  13188. BEGIN
  13189. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13190. RETURN instruction
  13191. END Shr;
  13192. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13193. VAR instruction: IntermediateCode.Instruction;
  13194. BEGIN
  13195. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13196. RETURN instruction
  13197. END Rol;
  13198. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13199. VAR instruction: IntermediateCode.Instruction;
  13200. BEGIN
  13201. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13202. RETURN instruction
  13203. END Ror;
  13204. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13205. VAR instruction: IntermediateCode.Instruction;
  13206. BEGIN
  13207. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13208. RETURN instruction
  13209. END Cas;
  13210. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13211. VAR instruction: IntermediateCode.Instruction;
  13212. BEGIN
  13213. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13214. RETURN instruction
  13215. END Copy;
  13216. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13217. VAR instruction: IntermediateCode.Instruction;
  13218. BEGIN
  13219. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13220. RETURN instruction
  13221. END Fill;
  13222. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13223. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13224. BEGIN
  13225. string := IntermediateCode.String(s);
  13226. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13227. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13228. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13229. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13230. RETURN instruction
  13231. END Asm;
  13232. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13233. VAR instruction: IntermediateCode.Instruction;
  13234. BEGIN
  13235. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13236. RETURN instruction
  13237. END Data;
  13238. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13239. VAR instruction: IntermediateCode.Instruction;
  13240. BEGIN
  13241. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13242. IntermediateCode.SetSubType(instruction, subtype);
  13243. RETURN instruction
  13244. END SpecialInstruction;
  13245. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13246. VAR op1: IntermediateCode.Operand;
  13247. VAR instruction: IntermediateCode.Instruction;
  13248. BEGIN
  13249. (*! generate a warning if size exceeds a certain limit *)
  13250. (*
  13251. ASSERT(bytes < 1000000); (* sanity check *)
  13252. *)
  13253. ASSERT(0 <= units); (* sanity check *)
  13254. IntermediateCode.InitNumber(op1,units);
  13255. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13256. RETURN instruction
  13257. END Reserve;
  13258. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13259. VAR op1: IntermediateCode.Operand;
  13260. VAR instruction: IntermediateCode.Instruction;
  13261. BEGIN
  13262. IntermediateCode.InitNumber(op1,position.start);
  13263. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13264. RETURN instruction
  13265. END LabelInstruction;
  13266. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13267. VAR pc: LONGINT;
  13268. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13269. BEGIN
  13270. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13271. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13272. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13273. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13274. IF instr.op1.type.form = IntermediateCode.Float THEN
  13275. RETURN instr.op1.floatValue = op.floatValue
  13276. ELSE
  13277. RETURN instr.op1.intValue = op.intValue
  13278. END;
  13279. END ProvidesValue;
  13280. BEGIN
  13281. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13282. pc := 0;
  13283. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13284. INC(pc);
  13285. END;
  13286. IF pc = data.pc THEN
  13287. data.Emit(Data(Basic.invalidPosition,vop));
  13288. END;
  13289. RETURN pc
  13290. END EnterImmediate;
  13291. PROCEDURE Init;
  13292. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13293. BEGIN
  13294. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13295. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13296. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13297. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13298. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13299. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13300. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13301. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13302. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13303. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13304. IntermediateCode.InitOperand(emptyOperand);
  13305. FOR i := 0 TO NumberSystemCalls-1 DO
  13306. name := "@SystemCall";
  13307. Basic.AppendNumber(name,i);
  13308. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13309. END;
  13310. END Init;
  13311. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13312. BEGIN
  13313. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  13314. END IsExported;
  13315. BEGIN
  13316. Init;
  13317. END FoxIntermediateBackend.
  13318. Compiler.Compile -p=Win32G FoxIntermediateBackend.Mod ~
  13319. # Release.Build --path="/temp/obg/" WinAosNewObjectFile ~
  13320. # StaticLinker.Link --fileFormat=PE32 --fileName=A2Z.exe --extension=GofW --displacement=401000H --path="/temp/obg/" 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 ~
  13321. # Release.Build --path="/temp/obg/" WinAosNewObjectFile ~
  13322. # 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 ~
  13323. FSTools.CloseFiles A2Z.exe ~
  13324. SystemTools.FreeDownTo FoxIntermediateBackend ~
  13325. Compiler.Compile -p=Win32G --destPath=/temp/obg/ --traceModule=Trace
  13326. Runtime.Mod Trace.Mod Generic.Win32.Kernel32.Mod Win32.Machine.Mod Heaps.Mod
  13327. Generic.Modules.Mod Win32.Objects.Mod Win32.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13328. Commands.Mod I386.Reals.Mod Generic.Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13329. Win32.Traps.Mod Locks.Mod Win32.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13330. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13331. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Win32.User32.Mod
  13332. Win32.WinTrace.Mod Win32.ODBC.Mod Win32.Shell32.Mod Win32.SQL.Mod Win32.WinFS.Mod
  13333. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13334. GenericLinker.Mod GenericLoader.Mod BootConsole.Mod