2
0

FoxIntermediateBackend.Mod 573 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067140681406914070140711407214073140741407514076140771407814079140801408114082140831408414085140861408714088140891409014091140921409314094140951409614097140981409914100141011410214103141041410514106141071410814109141101411114112141131411414115141161411714118141191412014121141221412314124141251412614127141281412914130141311413214133141341413514136141371413814139141401414114142141431414414145141461414714148141491415014151141521415314154141551415614157141581415914160141611416214163141641416514166141671416814169141701417114172141731417414175141761417714178141791418014181141821418314184141851418614187141881418914190141911419214193141941419514196141971419814199142001420114202142031420414205142061420714208142091421014211142121421314214142151421614217142181421914220142211422214223142241422514226142271422814229142301423114232142331423414235142361423714238142391424014241142421424314244142451424614247142481424914250142511425214253142541425514256142571425814259142601426114262142631426414265142661426714268142691427014271142721427314274142751427614277142781427914280142811428214283142841428514286142871428814289142901429114292142931429414295142961429714298142991430014301143021430314304143051430614307143081430914310143111431214313143141431514316143171431814319143201432114322143231432414325143261432714328143291433014331143321433314334143351433614337143381433914340143411434214343143441434514346143471434814349143501435114352143531435414355143561435714358143591436014361143621436314364143651436614367143681436914370143711437214373143741437514376143771437814379143801438114382143831438414385143861438714388143891439014391143921439314394143951439614397143981439914400144011440214403144041440514406144071440814409144101441114412144131441414415144161441714418144191442014421144221442314424144251442614427144281442914430144311443214433144341443514436144371443814439144401444114442144431444414445144461444714448144491445014451144521445314454144551445614457144581445914460144611446214463144641446514466144671446814469144701447114472144731447414475144761447714478144791448014481144821448314484144851448614487144881448914490144911449214493144941449514496144971449814499145001450114502145031450414505145061450714508145091451014511145121451314514145151451614517145181451914520145211452214523145241452514526145271452814529145301453114532145331453414535145361453714538145391454014541145421454314544145451454614547145481454914550145511455214553145541455514556145571455814559145601456114562145631456414565145661456714568145691457014571145721457314574145751457614577145781457914580145811458214583145841458514586145871458814589145901459114592145931459414595145961459714598145991460014601146021460314604146051460614607146081460914610146111461214613146141461514616146171461814619146201462114622146231462414625146261462714628146291463014631146321463314634146351463614637146381463914640146411464214643146441464514646146471464814649146501465114652146531465414655146561465714658146591466014661146621466314664146651466614667
  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. position: LONGINT;
  517. PROCEDURE Signature;
  518. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  519. BEGIN
  520. procedureType := x.type(SyntaxTree.ProcedureType);
  521. returnType := procedureType.returnType;
  522. IF returnType # NIL THEN
  523. meta.CheckTypeDeclaration(returnType)
  524. END;
  525. parameter := procedureType.firstParameter;
  526. WHILE parameter # NIL DO
  527. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  528. parameter := parameter.nextParameter;
  529. END;
  530. END Signature;
  531. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  532. VAR result: BOOLEAN;
  533. BEGIN
  534. result := FALSE;
  535. IF x = SyntaxTree.invalidExpression THEN
  536. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  537. result := TRUE;
  538. value := x.resolved(SyntaxTree.IntegerValue).value;
  539. ELSE
  540. Error(x.position,"expression is not an integer constant");
  541. END;
  542. RETURN result;
  543. END CheckIntegerValue;
  544. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  545. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  546. BEGIN
  547. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  548. WHILE (this # NIL) & (this.identifier # id) DO
  549. this := this.nextModifier;
  550. END;
  551. IF this # NIL THEN
  552. IF this.expression = NIL THEN
  553. Error(this.position,"expected expression value");
  554. ELSIF CheckIntegerValue(this.expression,value) THEN
  555. END;
  556. RETURN TRUE
  557. ELSE RETURN FALSE
  558. END;
  559. END HasValue;
  560. CONST DefaultDataMemorySize=512;
  561. BEGIN
  562. IF x.externalName # NIL THEN RETURN END;
  563. (*
  564. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  565. *)
  566. (* code section for this procedure *)
  567. position := x.position.start;
  568. scope := x.procedureScope;
  569. prevScope := currentScope;
  570. currentScope := scope;
  571. procedureType := x.type(SyntaxTree.ProcedureType);
  572. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  573. implementationVisitor.temporaries.Init;
  574. implementationVisitor.usedRegisters := NIL;
  575. implementationVisitor.registerUsageCount.Init;
  576. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  577. IF (scope.body # NIL) & (x.isInline) THEN
  578. inline := TRUE;
  579. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  580. ir.SetExported(IsExported(x));
  581. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  582. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  583. IF backend.cellsAreObjects THEN
  584. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  585. ir.SetExported(IsExported(x));
  586. ELSE
  587. RETURN; (* cellnet cannot be compiled for final static hardware *)
  588. END;
  589. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  590. inline := FALSE;
  591. AddBodyCallStub(x);
  592. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  593. ir.SetExported(IsExported(x));
  594. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  595. inline := FALSE;
  596. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  597. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  598. AddBodyCallStub(x);
  599. AddStackAllocation(x,stackSize);
  600. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  601. ir.SetExported(IsExported(x));
  602. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  603. inline := FALSE;
  604. Parameters(procedureType.firstParameter);
  605. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  606. ir.SetExported(IsExported(x));
  607. ELSE
  608. inline := FALSE;
  609. IF x.isEntry OR x.isExit THEN
  610. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  611. ir.SetExported(TRUE);
  612. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  613. ELSE
  614. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  615. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  616. END;
  617. END;
  618. cc := procedureType.callingConvention;
  619. IF cc = SyntaxTree.WinAPICallingConvention THEN
  620. parametersSize := ProcedureParametersSize(backend.system,x);
  621. ELSE
  622. parametersSize := 0;
  623. END;
  624. IF scope.body # NIL THEN
  625. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  626. registerNumber := 0;
  627. IF ~inline THEN
  628. IF scope.lastVariable = NIL THEN
  629. stackSize := 0
  630. ELSE
  631. stackSize := scope.lastVariable.offsetInBits;
  632. IF stackSize <0 THEN stackSize := -stackSize END;
  633. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  634. END;
  635. (*
  636. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  637. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  638. *)
  639. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  640. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  641. END;
  642. pc := ir.pc-1;
  643. (*
  644. ir.Emit(Nop(position)); (* placeholder for fill *)
  645. *)
  646. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  647. registerParameter := backend.GetParameterRegisters(procedureType.callingConvention);
  648. IF registerParameter = NIL THEN registerParameters := 0
  649. ELSE registerParameters := LEN(registerParameter)
  650. END;
  651. formalParameter := procedureType.lastParameter;
  652. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  653. IF ~PassInRegister(formalParameter) THEN
  654. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  655. ELSE
  656. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, registerParameter[registerNumber]);
  657. IF formalParameter.type.IsRecordType() THEN
  658. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  659. type := addressType;
  660. ELSE
  661. type := GetType(system, formalParameter.type);
  662. END;
  663. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  664. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  665. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  666. implementationVisitor.ReleaseIntermediateOperand(src);
  667. INC(registerNumber);
  668. formalParameter := formalParameter.prevParameter;
  669. END;
  670. END;
  671. END;
  672. END;
  673. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  674. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  675. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  676. IF scope.lastVariable # NIL THEN
  677. stackSize := scope.lastVariable.offsetInBits;
  678. IF stackSize <0 THEN stackSize := -stackSize END;
  679. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  680. END;
  681. END;
  682. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  683. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  684. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  685. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  686. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  687. ir.EmitAt(pc,Push(size));
  688. implementationVisitor.StaticCallOperand(result,procedure);
  689. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  690. END;
  691. *)
  692. END;
  693. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  694. IF stackSize > 0 THEN
  695. IF (stackSize MOD system.addressSize = 0) THEN
  696. null := IntermediateCode.Immediate(addressType,0);
  697. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  698. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  699. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  700. ELSE
  701. null := IntermediateCode.Immediate(int8,0);
  702. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  703. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  704. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  705. END;
  706. (*! should potentially be called by backend -- enter might initialize
  707. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  708. *)
  709. END;
  710. IF procedureType.callingConvention = SyntaxTree.WinAPICallingConvention THEN
  711. parametersSize := ProcedureParametersSize(backend.system,x);
  712. ELSE
  713. parametersSize := 0;
  714. END;
  715. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  716. finalizer := FALSE;
  717. IF backend.cooperative & x.isFinalizer THEN
  718. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  719. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  720. GetRecordTypeName(recordType,name);
  721. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  722. END;
  723. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  724. IF backend.cooperative THEN
  725. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  726. IF implementationVisitor.profile & ~isModuleBody THEN
  727. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  728. END;
  729. END;
  730. implementationVisitor.EmitLeave(ir, x.position,x,cc);
  731. IF finalizer THEN
  732. IF backend.hasLinkRegister THEN
  733. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  734. END;
  735. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  736. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  737. ir.Emit(Br(x.position,dest));
  738. ELSE
  739. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  740. END;
  741. ELSE
  742. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  743. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  744. END;
  745. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  746. IF backend.cooperative THEN
  747. IF HasPointers (scope) THEN
  748. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  749. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  750. ir.Emit(Result(x.position, res));
  751. ir.Emit(Push(x.position, res));
  752. implementationVisitor.ResetVariables(scope);
  753. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  754. ir.Emit(Pop(x.position, res));
  755. ir.Emit(Return(x.position, res));
  756. ELSE
  757. implementationVisitor.ResetVariables(scope);
  758. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  759. END;
  760. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  761. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  762. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  763. ir.Emit(Result(x.position, res));
  764. ir.Emit(Push(x.position, res));
  765. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  766. ir.Emit(Pop(x.position, res));
  767. ir.Emit(Return(x.position, res));
  768. ELSE
  769. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  770. END;
  771. END;
  772. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  773. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  774. ELSE
  775. ir.Emit(Nop(x.position));
  776. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  777. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  778. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  779. END;
  780. END;
  781. END
  782. END;
  783. ELSE (* force body for procedures *)
  784. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  785. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  786. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  787. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  788. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  789. END;
  790. Scope(scope);
  791. Signature;
  792. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  793. currentScope := prevScope;
  794. END Procedure;
  795. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  796. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  797. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  798. BEGIN
  799. ASSERT (bodyProcedure # NIL);
  800. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  801. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  802. procedure.SetScope(bodyProcedure.scope);
  803. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  804. procedure.SetAccess(SyntaxTree.Hidden);
  805. Global.GetSymbolSegmentedName (procedure,name);
  806. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  807. ir.SetExported(TRUE);
  808. ir.SetPriority(InitPriority);
  809. Global.GetSymbolSegmentedName (bodyProcedure,name);
  810. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  811. implementationVisitor.currentScope := module.module.moduleScope;
  812. implementationVisitor.section := ir;
  813. implementationVisitor.PushSelfPointer();
  814. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  815. ELSIF backend.preregisterStatic THEN
  816. implementationVisitor.currentScope := module.module.moduleScope;
  817. implementationVisitor.section := ir;
  818. implementationVisitor.PushSelfPointer();
  819. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  820. ELSE
  821. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  822. ir.Emit(Call(bodyProcedure.position,op, 0));
  823. END;
  824. END AddBodyCallStub;
  825. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  826. VAR name: Basic.SegmentedName;
  827. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  828. BEGIN
  829. Global.GetSymbolSegmentedName (symbol,name);
  830. Basic.RemoveSuffix(name);
  831. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  832. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  833. ir.SetExported(TRUE);
  834. ir.SetPriority(FirstPriority);
  835. IntermediateCode.InitImmediate(op,addressType,initStack);
  836. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  837. END AddStackAllocation;
  838. (** entry function to visit a complete module *)
  839. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  840. VAR
  841. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  842. hasDynamicOperatorDeclarations: BOOLEAN;
  843. operator: SyntaxTree.Operator;
  844. import: SyntaxTree.Import;
  845. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  846. BEGIN
  847. type := type.resolved;
  848. IF type IS SyntaxTree.RecordType THEN
  849. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  850. ELSIF (type IS SyntaxTree.ArrayType) THEN
  851. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  852. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  853. END;
  854. ELSIF type IS SyntaxTree.MathArrayType THEN
  855. WITH type: SyntaxTree.MathArrayType DO
  856. IF type.form = SyntaxTree.Open THEN
  857. RETURN TRUE
  858. ELSIF type.form = SyntaxTree.Static THEN
  859. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  860. END;
  861. END;
  862. END;
  863. RETURN FALSE
  864. END TypeNeedsInitialization;
  865. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  866. VAR variable: SyntaxTree.Variable;
  867. BEGIN
  868. variable := scope.firstVariable;
  869. WHILE variable # NIL DO
  870. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  871. IF variable.initializer # NIL THEN RETURN TRUE END;
  872. variable := variable.nextVariable;
  873. END;
  874. RETURN FALSE
  875. END ScopeNeedsInitialization;
  876. BEGIN
  877. ASSERT(x # NIL); ASSERT(module # NIL);
  878. SELF.module := module;
  879. (* add import names to the generated Sections.Module *)
  880. import := x.moduleScope.firstImport;
  881. WHILE import # NIL DO
  882. import.module.GetName(idstr);
  883. module.imports.AddName(idstr);
  884. import := import.nextImport
  885. END;
  886. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  887. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  888. moduleSelf := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@moduleSelf"));
  889. moduleSelf.SetType(system.anyType);
  890. moduleSelf.SetScope(x.moduleScope);
  891. moduleSelf.SetUntraced(TRUE);
  892. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  893. ir.SetExported(TRUE);
  894. IntermediateCode.InitImmediate(op,addressType,0);
  895. ir.Emit(Data(Basic.invalidPosition,op));
  896. END;
  897. implementationVisitor.module := module;
  898. implementationVisitor.moduleScope := x.moduleScope;
  899. implementationVisitor.moduleSelf := moduleSelf;
  900. implementationVisitor.canBeLoaded := TRUE;
  901. meta.SetModule(module);
  902. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  903. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  904. END;
  905. IF backend.profile THEN
  906. EnsureBodyProcedure(x.moduleScope);
  907. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  908. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  909. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  910. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  911. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  912. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  913. Global.GetModuleName(module.module,idstr);
  914. implementationVisitor.ProfilerAddModule(idstr);
  915. implementationVisitor.numberProcedures := 0;
  916. END;
  917. implementationVisitor.profile := backend.profile;
  918. (* check if there is at least one dynamic operator locally defined *)
  919. hasDynamicOperatorDeclarations := FALSE;
  920. operator := x.moduleScope.firstOperator;
  921. WHILE operator # NIL DO
  922. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  923. operator := operator.nextOperator
  924. END;
  925. (* add operator initialization code section *)
  926. IF hasDynamicOperatorDeclarations THEN
  927. EnsureBodyProcedure(x.moduleScope);
  928. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  929. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  930. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  931. END;
  932. Scope(x.moduleScope);
  933. IF hasDynamicOperatorDeclarations THEN
  934. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  935. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  936. END;
  937. IF backend.profile THEN
  938. implementationVisitor.ProfilerPatchInit;
  939. END;
  940. END Module;
  941. END DeclarationVisitor;
  942. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  943. RegisterUsageCount*=OBJECT
  944. VAR used: UsedArray; count: LONGINT;
  945. PROCEDURE &Init;
  946. VAR i: LONGINT;
  947. BEGIN
  948. count := 0;
  949. IF used = NIL THEN NEW(used,64); END;
  950. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  951. END Init;
  952. PROCEDURE Grow;
  953. VAR new: UsedArray; size,i: LONGINT;
  954. BEGIN
  955. size := LEN(used)*2;
  956. NEW(new,size);
  957. FOR i := 0 TO LEN(used)-1 DO
  958. new[i].count := used[i].count;
  959. new[i].type := used[i].type;
  960. new[i].map := used[i].map
  961. END;
  962. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  963. used := new
  964. END Grow;
  965. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  966. BEGIN
  967. INC(count);
  968. IF count = LEN(used) THEN Grow END;
  969. used[count].type := type;
  970. used[count].class := class;
  971. used[count].map := count;
  972. RETURN count;
  973. END Next;
  974. PROCEDURE IncUse(register: LONGINT);
  975. BEGIN
  976. INC(used[register].count);
  977. (*
  978. IF (register = 1) & (count > 30) THEN
  979. D.TraceBack;
  980. END;
  981. *)
  982. END IncUse;
  983. PROCEDURE DecUse(register: LONGINT);
  984. BEGIN
  985. DEC(used[register].count);
  986. END DecUse;
  987. PROCEDURE Map(register: LONGINT): LONGINT;
  988. VAR map : LONGINT;
  989. BEGIN
  990. IF register > 0 THEN
  991. map := used[register].map;
  992. WHILE register # map DO register := map; map := used[register].map END;
  993. END;
  994. RETURN register
  995. END Map;
  996. PROCEDURE Use(register: LONGINT): LONGINT;
  997. BEGIN
  998. IF register< LEN(used) THEN
  999. RETURN used[register].count
  1000. ELSE
  1001. RETURN 0
  1002. END
  1003. END Use;
  1004. END RegisterUsageCount;
  1005. RegisterEntry = POINTER TO RECORD
  1006. prev,next: RegisterEntry;
  1007. register: LONGINT;
  1008. registerClass: IntermediateCode.RegisterClass;
  1009. type: IntermediateCode.Type;
  1010. END;
  1011. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1012. Variables = OBJECT (Basic.List)
  1013. VAR
  1014. inUse: VariableUse;
  1015. registerIndex: LONGINT;
  1016. nameIndex: LONGINT;
  1017. PROCEDURE & Init;
  1018. VAR i: LONGINT;
  1019. BEGIN
  1020. InitList(16);
  1021. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1022. registerIndex := 1024;
  1023. nameIndex := 0;
  1024. END Init;
  1025. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1026. VAR string: SyntaxTree.IdentifierString ;
  1027. BEGIN
  1028. COPY("@hiddenIRVar",string);
  1029. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1030. RETURN SyntaxTree.NewIdentifier(string);
  1031. END GetUID;
  1032. PROCEDURE GetUsage(VAR use: VariableUse);
  1033. BEGIN
  1034. use := inUse;
  1035. END GetUsage;
  1036. PROCEDURE SetUsage(CONST use: VariableUse);
  1037. BEGIN
  1038. inUse := use;
  1039. END SetUsage;
  1040. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1041. VAR any: ANY;
  1042. BEGIN
  1043. any := Get(i);;
  1044. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1045. END GetVariable;
  1046. PROCEDURE Occupy(pos: LONGINT);
  1047. BEGIN
  1048. INCL(inUse[pos DIV 32], pos MOD 32);
  1049. END Occupy;
  1050. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1051. BEGIN
  1052. Occupy(Length());
  1053. Add(v);
  1054. END AddVariable;
  1055. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1056. BEGIN
  1057. t1 := t1.resolved;
  1058. t2 := t2.resolved;
  1059. RETURN
  1060. (t1.SameType(t2))
  1061. OR
  1062. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1063. OR
  1064. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits = t2.sizeInBits)
  1065. OR
  1066. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1067. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1068. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1069. OR
  1070. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1071. (DynamicDim(t1) = DynamicDim(t2))
  1072. );
  1073. END CompatibleType;
  1074. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1075. VAR var : SyntaxTree.Variable;
  1076. BEGIN
  1077. FOR pos := 0 TO Length()-1 DO
  1078. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  1079. var := GetVariable(pos);
  1080. IF CompatibleType(type, var.type) & (var.untraced = untraced) THEN
  1081. Occupy(pos); RETURN var
  1082. END;
  1083. END;
  1084. END;
  1085. pos := Length();
  1086. RETURN NIL
  1087. END GetFreeVariable;
  1088. END Variables;
  1089. SymbolMap = POINTER TO RECORD
  1090. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1091. isAddress: BOOLEAN;
  1092. END;
  1093. SymbolMapper = OBJECT
  1094. VAR
  1095. first: SymbolMap;
  1096. PROCEDURE & Init;
  1097. BEGIN
  1098. first := NIL;
  1099. END Init;
  1100. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1101. VAR new: SymbolMap;
  1102. BEGIN
  1103. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1104. new.next := first; first := new;
  1105. END Add;
  1106. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1107. VAR s: SymbolMap;
  1108. BEGIN
  1109. s := first;
  1110. WHILE (s # NIL) & (s.this # this) DO
  1111. s := s.next
  1112. END;
  1113. RETURN s
  1114. END Get;
  1115. END SymbolMapper;
  1116. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1117. VAR
  1118. system: Global.System;
  1119. section: IntermediateCode.Section;
  1120. module: Sections.Module;
  1121. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1122. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1123. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1124. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1125. checker: SemanticChecker.Checker;
  1126. backend: IntermediateBackend;
  1127. meta: MetaDataGenerator;
  1128. position: Position;
  1129. moduleSelf: SyntaxTree.Variable;
  1130. (* variables for hand over of variables / temporary state *)
  1131. currentScope: SyntaxTree.Scope;
  1132. constantDeclaration : SyntaxTree.Symbol;
  1133. result: Operand; (* result of the most recent expression / statement *)
  1134. destination: IntermediateCode.Operand;
  1135. arrayDestinationTag: IntermediateCode.Operand;
  1136. arrayDestinationDimension:LONGINT;
  1137. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1138. conditional: BOOLEAN;
  1139. trueLabel, falseLabel, exitLabel: Label;
  1140. locked: BOOLEAN;
  1141. (*
  1142. usedRegisters: Registers;
  1143. *)
  1144. registerUsageCount: RegisterUsageCount;
  1145. usedRegisters: RegisterEntry;
  1146. (* useful operands and types *)
  1147. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1148. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1149. commentPrintout: Printout.Printer;
  1150. dump: Streams.Writer;
  1151. tagsAvailable : BOOLEAN;
  1152. supportedInstruction: SupportedInstructionProcedure;
  1153. supportedImmediate: SupportedImmediateProcedure;
  1154. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1155. emitLabels: BOOLEAN;
  1156. runtimeModuleName : SyntaxTree.IdentifierString;
  1157. newObjectFile: BOOLEAN;
  1158. indexCounter: LONGINT;
  1159. profile: BOOLEAN;
  1160. profileId, profileInit: IntermediateCode.Section;
  1161. profileInitPatchPosition: LONGINT;
  1162. numberProcedures: LONGINT;
  1163. procedureResultDesignator : SyntaxTree.Designator;
  1164. operatorInitializationCodeSection: IntermediateCode.Section;
  1165. fingerPrinter: FingerPrinter.FingerPrinter;
  1166. temporaries: Variables;
  1167. canBeLoaded : BOOLEAN;
  1168. currentIsInline: BOOLEAN;
  1169. currentMapper: SymbolMapper;
  1170. currentInlineExit: Label;
  1171. moduleBodySection: IntermediateCode.Section;
  1172. NeedDescriptor : BOOLEAN;
  1173. cooperativeSwitches: BOOLEAN;
  1174. lastSwitchPC: LONGINT;
  1175. isUnchecked: BOOLEAN;
  1176. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1177. newObjectFile: BOOLEAN);
  1178. BEGIN
  1179. SELF.system := system;
  1180. SELF.runtimeModuleName := runtime;
  1181. currentScope := NIL;
  1182. hiddenPointerType := NIL;
  1183. delegatePointerType := NIL;
  1184. awaitProcCounter := 0;
  1185. labelId := 0; constId := 0; labelId := 0;
  1186. SELF.checker := checker;
  1187. SELF.backend := backend;
  1188. position := Basic.invalidPosition;
  1189. conditional := FALSE;
  1190. locked := FALSE;
  1191. InitOperand(result,ModeUndefined);
  1192. addressType := IntermediateCode.GetType(system,system.addressType);
  1193. setType := IntermediateCode.GetType(system,system.setType);
  1194. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1195. byteType := IntermediateCode.GetType(system, system.byteType);
  1196. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1197. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1198. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1199. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1200. nil := IntermediateCode.Immediate(addressType,0);
  1201. one := IntermediateCode.Immediate(addressType,1);
  1202. IntermediateCode.InitOperand(destination);
  1203. tagsAvailable := TRUE;
  1204. supportedInstruction := supportedInstructionProcedure;
  1205. supportedImmediate := supportedImmediateProcedure;
  1206. inData := FALSE;
  1207. SELF.emitLabels := emitLabels;
  1208. IntermediateCode.InitOperand(arrayDestinationTag);
  1209. bool := IntermediateCode.GetType(system,system.booleanType);
  1210. IntermediateCode.InitImmediate(false,bool,0);
  1211. IntermediateCode.InitImmediate(true,bool,1);
  1212. SELF.newObjectFile := newObjectFile;
  1213. indexCounter := 0;
  1214. NEW(registerUsageCount);
  1215. usedRegisters := NIL;
  1216. procedureResultDesignator := NIL;
  1217. NEW(fingerPrinter);
  1218. NEW(temporaries);
  1219. currentIsInline := FALSE;
  1220. NeedDescriptor := FALSE;
  1221. isUnchecked := backend.noRuntimeChecks;
  1222. END Init;
  1223. TYPE Context = RECORD
  1224. section: IntermediateCode.Section;
  1225. registerUsageCount: RegisterUsageCount;
  1226. usedRegisters: RegisterEntry;
  1227. END;
  1228. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1229. VAR context: Context;
  1230. BEGIN
  1231. context.section := section;
  1232. context.registerUsageCount := registerUsageCount;
  1233. context.usedRegisters := usedRegisters;
  1234. section := new;
  1235. NEW(registerUsageCount);
  1236. usedRegisters := NIL;
  1237. RETURN context;
  1238. END SwitchContext;
  1239. PROCEDURE ReturnToContext(context: Context);
  1240. BEGIN
  1241. section := context.section;
  1242. registerUsageCount := context.registerUsageCount;
  1243. usedRegisters := context.usedRegisters;
  1244. END ReturnToContext;
  1245. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1246. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1247. BEGIN
  1248. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1249. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1250. END;
  1251. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1252. section.SetExported(IsExported(syntaxTreeSymbol));
  1253. RETURN section
  1254. END NewSection;
  1255. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1256. VAR new: LONGINT;
  1257. BEGIN
  1258. new := registerUsageCount.Next(type,class);
  1259. UseRegister(new);
  1260. RETURN new
  1261. END AcquireRegister;
  1262. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1263. VAR
  1264. fingerPrint: SyntaxTree.FingerPrint;
  1265. fingerPrintString: ARRAY 32 OF CHAR;
  1266. BEGIN
  1267. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1268. string := "[";
  1269. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1270. Strings.Append(string, fingerPrintString);
  1271. Strings.Append(string, "]");
  1272. END GetFingerprintString;
  1273. (** get the name for the code section that represens a certain symbol
  1274. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1275. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1276. VAR string: ARRAY 32 OF CHAR;
  1277. BEGIN
  1278. Global.GetSymbolSegmentedName(symbol, name);
  1279. (* if the symbol is an operator, then append the fingerprint to the name *)
  1280. IF symbol IS SyntaxTree.Operator THEN
  1281. GetFingerprintString(symbol, string);
  1282. Basic.AppendToSegmentedName(name,string);
  1283. END
  1284. END GetCodeSectionNameForSymbol;
  1285. (** get the name for the code section that represens a certain symbol
  1286. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1287. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1288. VAR string: ARRAY 32 OF CHAR;
  1289. BEGIN
  1290. Global.GetSymbolNameInScope(symbol, scope, name);
  1291. (* if the symbol is an operator, then append the fingerprint to the name *)
  1292. IF symbol IS SyntaxTree.Operator THEN
  1293. GetFingerprintString(symbol, string);
  1294. Strings.Append(name, string);
  1295. END
  1296. END GetCodeSectionNameForSymbolInScope;
  1297. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1298. BEGIN
  1299. IF dump # NIL THEN
  1300. dump.String("enter "); dump.String(s); dump.Ln;
  1301. END;
  1302. END TraceEnter;
  1303. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1304. BEGIN
  1305. IF dump # NIL THEN
  1306. dump.String("exit "); dump.String(s); dump.Ln;
  1307. END;
  1308. END TraceExit;
  1309. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1310. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1311. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1312. VAR i: LONGINT;
  1313. BEGIN
  1314. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1315. IF op.rule # NIL THEN
  1316. FOR i := 0 TO LEN(op.rule)-1 DO
  1317. CheckRegister(op.rule[i])
  1318. END;
  1319. END;
  1320. END CheckRegister;
  1321. BEGIN
  1322. CheckRegister(instruction.op1);
  1323. CheckRegister(instruction.op2);
  1324. CheckRegister(instruction.op3);
  1325. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1326. ELSE section.Emit(instruction);
  1327. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1328. END;
  1329. END Emit;
  1330. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1331. BEGIN
  1332. IF backend.cooperative THEN
  1333. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1334. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1335. ELSE
  1336. Emit(Trap(position,trapNo));
  1337. END;
  1338. END EmitTrap;
  1339. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1340. VAR name: Basic.SegmentedName;
  1341. VAR op1, op2, reg: IntermediateCode.Operand;
  1342. VAR call, nocall: Label;
  1343. VAR parametersSize: LONGINT;
  1344. VAR prevSection: IntermediateCode.Section;
  1345. VAR prevDump: Streams.Writer;
  1346. VAR body: SyntaxTree.Body;
  1347. VAR procedureType: SyntaxTree.ProcedureType;
  1348. BEGIN
  1349. IF procedure # NIL THEN
  1350. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1351. ELSE procedureType := NIL;
  1352. END;
  1353. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1354. prevSection := SELF.section;
  1355. SELF.section := section;
  1356. prevDump := dump;
  1357. dump := section.comments;
  1358. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1359. IF backend.hasLinkRegister THEN
  1360. Emit(Push(Basic.invalidPosition, lr));
  1361. END;
  1362. Emit(Push(Basic.invalidPosition,fp));
  1363. IF procedure # NIL THEN
  1364. body := procedure.procedureScope.body;
  1365. ELSE
  1366. body := NIL;
  1367. END;
  1368. IF backend.cooperative THEN
  1369. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1370. GetCodeSectionNameForSymbol(procedure, name);
  1371. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1372. ELSE
  1373. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1374. END;
  1375. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1376. IntermediateCode.AddOffset(op1, 1);
  1377. Emit(Push(Basic.invalidPosition,op1));
  1378. Emit(Mov(Basic.invalidPosition,fp, sp));
  1379. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1380. NEW(call, section);
  1381. NEW(nocall, section);
  1382. reg := NewRegisterOperand(addressType);
  1383. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1384. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1385. BrltL(call, sp, reg);
  1386. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1387. BrgeL(nocall, sp, op2);
  1388. call.Resolve(section.pc);
  1389. Emit(Push(Basic.invalidPosition, reg));
  1390. ReleaseIntermediateOperand(reg);
  1391. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1392. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1393. Emit(Push(Basic.invalidPosition, op2));
  1394. CallThis(position, "Activities","ExpandStack",2);
  1395. Emit(Result(Basic.invalidPosition, sp));
  1396. nocall.Resolve(section.pc);
  1397. END;
  1398. ELSE
  1399. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1400. Emit(Push(Basic.invalidPosition, one)) ;
  1401. procedureType.SetParametersOffset(1);
  1402. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1403. END;
  1404. Emit(Mov(Basic.invalidPosition, fp, sp));
  1405. END;
  1406. END;
  1407. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1408. SELF.section := prevSection;
  1409. dump := prevDump;
  1410. END EmitEnter;
  1411. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1412. VAR op1,op2: IntermediateCode.Operand;
  1413. VAR instruction: IntermediateCode.Instruction;
  1414. BEGIN
  1415. IntermediateCode.InitNumber(op1,callconv);
  1416. IntermediateCode.InitNumber(op2,varSize);
  1417. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1418. RETURN instruction
  1419. END Enter;
  1420. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1421. VAR op1: IntermediateCode.Operand;
  1422. VAR instruction: IntermediateCode.Instruction;
  1423. BEGIN
  1424. IntermediateCode.InitNumber(op1,callconv);
  1425. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1426. RETURN instruction
  1427. END Leave;
  1428. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1429. VAR prevSection: IntermediateCode.Section;
  1430. VAR op2, size: IntermediateCode.Operand;
  1431. VAR body: SyntaxTree.Body;
  1432. BEGIN
  1433. prevSection := SELF.section;
  1434. SELF.section := section;
  1435. Emit(Leave(position, callconv));
  1436. IF procedure # NIL THEN
  1437. body := procedure.procedureScope.body;
  1438. ELSE
  1439. body := NIL;
  1440. END;
  1441. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1442. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1443. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1444. Emit(Add(position, sp, fp, op2));
  1445. ELSE
  1446. Emit(Mov(position, sp, fp));
  1447. END;
  1448. Emit(Pop(position, fp));
  1449. END;
  1450. SELF.section := prevSection;
  1451. END EmitLeave;
  1452. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1453. VAR m: SymbolMap;
  1454. BEGIN
  1455. position := x.position;
  1456. IF currentIsInline THEN
  1457. m := currentMapper.Get(x);
  1458. IF m # NIL THEN
  1459. (*
  1460. Printout.Info("mapping from", x);
  1461. Printout.Info("mapping to ", m.to);
  1462. *)
  1463. m.to.Accept(SELF);
  1464. op := result;
  1465. IF m.tag # NIL THEN
  1466. ReleaseIntermediateOperand(result.tag);
  1467. m.tag.Accept(SELF);
  1468. op.tag := result.op;
  1469. ReleaseIntermediateOperand(result.tag);
  1470. END;
  1471. RETURN
  1472. END;
  1473. END;
  1474. x.Accept(SELF);
  1475. op := result;
  1476. END Symbol;
  1477. PROCEDURE Expression(x: SyntaxTree.Expression);
  1478. BEGIN
  1479. position := x.position;
  1480. constantDeclaration := NIL;
  1481. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1482. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1483. END;
  1484. IF x.resolved # NIL THEN
  1485. x.resolved.Accept(SELF)
  1486. ELSE
  1487. x.Accept(SELF)
  1488. END;
  1489. (* check this, was commented out in ActiveCells3 *)
  1490. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1491. Error(x.position, "unsupported modifier");
  1492. END;
  1493. END Expression;
  1494. (*
  1495. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1496. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1497. BEGIN
  1498. temporaries.GetUsage(current);
  1499. FOR i := 0 TO LEN(current)-1 DO
  1500. set := current[i] - previous[i];
  1501. IF set # {} THEN
  1502. FOR j := 0 TO MAX(SET)-1 DO
  1503. IF j IN set THEN
  1504. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1505. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1506. Symbol(variable, op);
  1507. MakeMemory(tmp,op.op,addressType,0);
  1508. ReleaseOperand(op);
  1509. Emit(Mov(position,tmp, nil ) );
  1510. ReleaseIntermediateOperand(tmp);
  1511. END;
  1512. END;
  1513. END;
  1514. END;
  1515. END;
  1516. END ResetUsedTemporaries;
  1517. *)
  1518. PROCEDURE Statement(x: SyntaxTree.Statement);
  1519. VAR use: VariableUse;
  1520. BEGIN
  1521. temporaries.GetUsage(use);
  1522. position := x.position;
  1523. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1524. IF commentPrintout # NIL THEN
  1525. commentPrintout.Statement(x);
  1526. dump.Ln;
  1527. (*dump.Update;*)
  1528. END;
  1529. x.Accept(SELF);
  1530. (*
  1531. CheckRegistersFree();
  1532. *)
  1533. (*ResetUsedTemporaries(use);*)
  1534. temporaries.SetUsage(use);
  1535. END Statement;
  1536. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1537. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1538. *)
  1539. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1540. BEGIN
  1541. ASSERT(op.mode # IntermediateCode.Undefined);
  1542. IF op.mode = IntermediateCode.ModeMemory THEN
  1543. ReuseCopy(res,op);
  1544. ELSE
  1545. res := op;
  1546. UseIntermediateOperand(res);
  1547. END;
  1548. IntermediateCode.AddOffset(res,offset);
  1549. IntermediateCode.MakeMemory(res,type);
  1550. END MakeMemory;
  1551. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1552. VAR mem: IntermediateCode.Operand;
  1553. BEGIN
  1554. MakeMemory(mem,res,type,offset);
  1555. ReleaseIntermediateOperand(res);
  1556. res := mem;
  1557. END ToMemory;
  1558. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1559. VAR mem: IntermediateCode.Operand;
  1560. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1561. componentType: SyntaxTree.Type;
  1562. BEGIN
  1563. type := type.resolved;
  1564. IF operand.mode = ModeReference THEN
  1565. IF type IS SyntaxTree.RangeType THEN
  1566. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1567. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1568. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1569. ReleaseOperand(operand);
  1570. operand.op := firstOp;
  1571. operand.tag := lastOp;
  1572. operand.extra := stepOp;
  1573. ELSIF type IS SyntaxTree.ComplexType THEN
  1574. componentType := type(SyntaxTree.ComplexType).componentType;
  1575. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1576. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1577. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1578. ReleaseOperand(operand);
  1579. operand.op := firstOp;
  1580. operand.tag := lastOp
  1581. ELSE
  1582. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1583. ReleaseIntermediateOperand(operand.op);
  1584. operand.op := mem;
  1585. END;
  1586. operand.mode := ModeValue;
  1587. END;
  1588. ASSERT(operand.mode = ModeValue);
  1589. END LoadValue;
  1590. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1591. VAR prevConditional: BOOLEAN;
  1592. BEGIN
  1593. prevConditional := conditional;
  1594. conditional := FALSE;
  1595. InitOperand(result, ModeUndefined);
  1596. Expression(x);
  1597. op := result;
  1598. LoadValue(op,x.type.resolved);
  1599. conditional := prevConditional;
  1600. END Evaluate;
  1601. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1602. VAR prevConditional: BOOLEAN;
  1603. BEGIN
  1604. prevConditional := conditional;
  1605. conditional := FALSE;
  1606. InitOperand(result,ModeUndefined);
  1607. Expression(x);
  1608. op := result;
  1609. (*
  1610. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1611. *)
  1612. conditional := prevConditional;
  1613. END Designate;
  1614. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1615. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1616. BEGIN
  1617. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1618. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1619. conditional := TRUE;
  1620. trueLabel := trueL; falseLabel := falseL;
  1621. Expression(x);
  1622. trueL := trueLabel; falseL := falseLabel;
  1623. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1624. END Condition;
  1625. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1626. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1627. BEGIN
  1628. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1629. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1630. RETURN op
  1631. END NewRegisterOperand;
  1632. PROCEDURE UnuseRegister(register: LONGINT);
  1633. BEGIN
  1634. IF (register > 0) THEN
  1635. register := registerUsageCount.Map(register);
  1636. registerUsageCount.DecUse(register);
  1637. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1638. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1639. END;
  1640. IF registerUsageCount.Use(register)=0 THEN
  1641. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1642. Warning(position, "register cannot be removed");
  1643. END;
  1644. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1645. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1646. END;
  1647. ELSIF registerUsageCount.Use(register)<0 THEN
  1648. Warning(position, "register removed too often");
  1649. IF dump # NIL THEN
  1650. dump.String("register removed too often"); dump.Ln; dump.Update;
  1651. END;
  1652. END;
  1653. END;
  1654. END UnuseRegister;
  1655. PROCEDURE UseRegister(register: LONGINT);
  1656. BEGIN
  1657. IF (register > 0) THEN
  1658. register := registerUsageCount.Map(register);
  1659. registerUsageCount.IncUse(register);
  1660. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1661. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1662. END;
  1663. IF registerUsageCount.Use(register)=1 THEN
  1664. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1665. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1666. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1667. END;
  1668. END;
  1669. END;
  1670. END UseRegister;
  1671. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1672. BEGIN
  1673. UnuseRegister(op.register)
  1674. END ReleaseIntermediateOperand;
  1675. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1676. BEGIN
  1677. UseRegister(op.register)
  1678. END UseIntermediateOperand;
  1679. PROCEDURE ReleaseOperand(CONST op: Operand);
  1680. BEGIN
  1681. UnuseRegister(op.op.register);
  1682. UnuseRegister(op.tag.register);
  1683. UnuseRegister(op.extra.register);
  1684. END ReleaseOperand;
  1685. (* save registers marked in array "markedRegisters" to the stack
  1686. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1687. *)
  1688. PROCEDURE SaveRegisters();
  1689. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1690. BEGIN
  1691. entry := usedRegisters;
  1692. WHILE entry # NIL DO
  1693. type := registerUsageCount.used[entry.register].type;
  1694. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1695. Emit(Push(position,op));
  1696. entry := entry.next;
  1697. END;
  1698. END SaveRegisters;
  1699. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1700. BEGIN
  1701. saved := usedRegisters;
  1702. usedRegisters := NIL;
  1703. END ReleaseUsedRegisters;
  1704. (** remove parameter registers from used queue *)
  1705. PROCEDURE ReleaseParameterRegisters;
  1706. VAR entry,prev,next: RegisterEntry;
  1707. BEGIN
  1708. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1709. WHILE entry # NIL DO
  1710. next := entry.next;
  1711. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1712. registerUsageCount.DecUse(entry.register);
  1713. ASSERT(registerUsageCount.Use(entry.register)=0);
  1714. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1715. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1716. END;
  1717. ELSIF prev = NIL THEN
  1718. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1719. ELSE
  1720. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1721. END;
  1722. entry := next;
  1723. END;
  1724. END ReleaseParameterRegisters;
  1725. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1726. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1727. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1728. BEGIN
  1729. entry := saved;
  1730. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1731. entry := prev;
  1732. WHILE entry # NIL DO
  1733. prev := entry.prev;
  1734. type := entry.type;
  1735. class := entry.registerClass;
  1736. IntermediateCode.InitRegister(op,type,class,entry.register);
  1737. (*
  1738. new := registerUsageCount.Next(type,class);
  1739. registerUsageCount.Remap(entry.register,new);
  1740. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1741. dump.String("remap register "); dump.Int(entry.register,1);
  1742. dump.String("to "); dump.Int(new,1);
  1743. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1744. END;
  1745. entry.register := new;
  1746. *)
  1747. Emit(Pop(position,op));
  1748. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1749. entry := prev;
  1750. END;
  1751. (*
  1752. usedRegisters := saved;
  1753. *)
  1754. END RestoreRegisters;
  1755. PROCEDURE CheckRegistersFree;
  1756. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1757. BEGIN
  1758. IF usedRegisters # NIL THEN
  1759. r := usedRegisters;
  1760. WHILE r # NIL DO
  1761. warning := "register ";
  1762. Strings.AppendInt(warning, r.register);
  1763. Strings.Append(warning, " not released.");
  1764. Warning(position,warning);
  1765. r := r .next;
  1766. END;
  1767. END;
  1768. FOR i := 0 TO registerUsageCount.count-1 DO
  1769. IF registerUsageCount.used[i].count < 0 THEN
  1770. warning := "register ";
  1771. Strings.AppendInt(warning, i);
  1772. Strings.Append(warning, " unused too often.");
  1773. Warning(position,warning);
  1774. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1775. warning := "register ";
  1776. Strings.AppendInt(warning, i);
  1777. Strings.Append(warning, " not unused often enough.");
  1778. Warning(position,warning);
  1779. END;
  1780. END;
  1781. END CheckRegistersFree;
  1782. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1783. Otherwise allocate a new register.
  1784. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1785. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1786. BEGIN
  1787. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1788. UseIntermediateOperand(result);
  1789. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1790. UseIntermediateOperand(result);
  1791. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1792. END;
  1793. END Reuse2;
  1794. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1795. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1796. If not then allocate a new register.
  1797. Does NOT necessarily keep the content of src1 or src2 in result!
  1798. *)
  1799. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1800. BEGIN
  1801. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1802. UseIntermediateOperand(result);
  1803. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1804. UseIntermediateOperand(result);
  1805. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1806. result := alternative; alternative := emptyOperand;
  1807. UseIntermediateOperand(result);
  1808. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1809. END;
  1810. END Reuse2a;
  1811. (* like reuse2 but only one source *)
  1812. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1813. BEGIN
  1814. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1815. UseIntermediateOperand(result);
  1816. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1817. END;
  1818. END Reuse1;
  1819. (* like reuse2a but only one source *)
  1820. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1821. BEGIN
  1822. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1823. UseIntermediateOperand(result);
  1824. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1825. UseIntermediateOperand(result);
  1826. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1827. END;
  1828. END Reuse1a;
  1829. (* like reuse1 but guarantees that content of src1 is in result *)
  1830. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1831. BEGIN
  1832. IF ReusableRegister(src1) THEN
  1833. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1834. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1835. UseIntermediateOperand(result);
  1836. ELSE
  1837. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1838. Emit(Mov(position,result,src1));
  1839. END
  1840. END ReuseCopy;
  1841. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1842. BEGIN
  1843. IF ReusableRegister(src) THEN
  1844. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1845. ELSE
  1846. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1847. Emit(Mov(position,result,src));
  1848. ReleaseIntermediateOperand(src);
  1849. END
  1850. END TransferToRegister;
  1851. (** labels and branches **)
  1852. PROCEDURE NewLabel(): Label;
  1853. VAR label: Label;
  1854. BEGIN
  1855. NEW(label,section); RETURN label;
  1856. END NewLabel;
  1857. PROCEDURE SetLabel(label: Label);
  1858. BEGIN label.Resolve(section.pc);
  1859. END SetLabel;
  1860. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1861. BEGIN
  1862. ASSERT(label # NIL);
  1863. IF label.pc < 0 THEN (* label not yet set *)
  1864. label.AddFixup(section.pc);
  1865. END;
  1866. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1867. END LabelOperand;
  1868. PROCEDURE BrL(label: Label);
  1869. BEGIN
  1870. Emit(Br(position,LabelOperand(label)));
  1871. END BrL;
  1872. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1873. BEGIN
  1874. Emit(Brge(position,LabelOperand(label),left,right));
  1875. END BrgeL;
  1876. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1877. BEGIN
  1878. Emit(Brlt(position,LabelOperand(label),left,right));
  1879. END BrltL;
  1880. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1881. BEGIN
  1882. Emit(Breq(position,LabelOperand(label),left,right));
  1883. END BreqL;
  1884. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1885. BEGIN
  1886. Emit(Brne(position,LabelOperand(label),left,right));
  1887. END BrneL;
  1888. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1889. VAR new: IntermediateCode.Operand;
  1890. BEGIN
  1891. IF Trace THEN TraceEnter("Convert") END;
  1892. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1893. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1894. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1895. & (operand.offset = 0)
  1896. THEN
  1897. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1898. Emit(Conv(position,new,operand));
  1899. ELSE
  1900. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1901. Emit(Conv(position,new,operand));
  1902. ReleaseIntermediateOperand(operand);
  1903. END;
  1904. operand := new;
  1905. 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
  1906. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1907. ELSE
  1908. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1909. Emit(Conv(position,new,operand));
  1910. ReleaseIntermediateOperand(operand);
  1911. operand := new;
  1912. END;
  1913. IF Trace THEN TraceExit("Convert") END;
  1914. END Convert;
  1915. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1916. VAR exit: Label;
  1917. BEGIN
  1918. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1919. exit := NewLabel();
  1920. br(exit,left,right);
  1921. EmitTrap(position,trapNo);
  1922. SetLabel(exit);
  1923. END TrapC;
  1924. (** expressions *)
  1925. (** emit necessary runtime check for set elements **)
  1926. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1927. VAR max: IntermediateCode.Operand;
  1928. BEGIN
  1929. IF isUnchecked THEN RETURN END;
  1930. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1931. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1932. TrapC(BrgeL, max, o, SetElementTrap);
  1933. END;
  1934. END CheckSetElement;
  1935. (** the set that a range represents **)
  1936. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1937. VAR
  1938. operand: Operand;
  1939. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1940. BEGIN
  1941. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1942. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1943. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1944. one := IntermediateCode.Immediate(setType, 1);
  1945. Evaluate(x, operand);
  1946. Convert(operand.op, setType);
  1947. Convert(operand.tag, setType);
  1948. CheckSetElement(operand.op);
  1949. CheckSetElement(operand.tag);
  1950. (* create mask for lower bound
  1951. i.e. shift 11111111 to the left by the value of the lower bound
  1952. *)
  1953. Reuse1(temp, operand.op);
  1954. Emit(Shl(position,temp, allBits, operand.op));
  1955. ReleaseIntermediateOperand(operand.op);
  1956. operand.op := temp;
  1957. (* create mask for upper bound
  1958. i.e. shift 11111111 to the right by the difference between the
  1959. upper bound and the maximum number of set elements
  1960. *)
  1961. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1962. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1963. Reuse1(temp, operand.tag);
  1964. ELSE
  1965. Reuse1(temp, operand.tag);
  1966. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1967. Emit(Sub(position,temp, size, operand.tag));
  1968. END;
  1969. Emit(Shr(position,temp, allBits, operand.tag));
  1970. ReleaseIntermediateOperand(operand.tag);
  1971. operand.tag := temp;
  1972. Reuse2(resultingSet, operand.op, operand.tag);
  1973. (* intersect the two masks *)
  1974. Emit(And(position,resultingSet, operand.op, operand.tag));
  1975. ReleaseOperand(operand);
  1976. RETURN resultingSet
  1977. END SetFromRange;
  1978. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1979. VAR
  1980. res, operand: Operand;
  1981. temp, one, noBits, dest: IntermediateCode.Operand;
  1982. expression: SyntaxTree.Expression;
  1983. i: LONGINT;
  1984. BEGIN
  1985. IF Trace THEN TraceEnter("VisitSet") END;
  1986. dest := destination;
  1987. destination := emptyOperand;
  1988. noBits := IntermediateCode.Immediate(setType, 0);
  1989. one := IntermediateCode.Immediate(setType, 1);
  1990. (* start off with the empty set *)
  1991. InitOperand(res, ModeValue);
  1992. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1993. Emit(Mov(position,res.op, noBits));
  1994. FOR i := 0 TO x.elements.Length() - 1 DO
  1995. expression := x.elements.GetExpression(i);
  1996. IF expression IS SyntaxTree.RangeExpression THEN
  1997. (* range of set elements *)
  1998. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1999. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2000. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2001. ReleaseIntermediateOperand(temp)
  2002. ELSE
  2003. (* singelton element *)
  2004. Evaluate(expression, operand);
  2005. Convert(operand.op, setType);
  2006. CheckSetElement(operand.op);
  2007. (* create subset containing single element *)
  2008. Reuse1(temp, operand.op);
  2009. Emit(Shl(position,temp, one, operand.op));
  2010. ReleaseOperand(operand);
  2011. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2012. ReleaseIntermediateOperand(temp);
  2013. END
  2014. END;
  2015. result := res;
  2016. destination := dest;
  2017. IF Trace THEN TraceExit("VisitSet") END;
  2018. END VisitSet;
  2019. (* math arrays of the form [a,b,c]
  2020. x is a static array and thus does not provide any pointers
  2021. *)
  2022. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  2023. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2024. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2025. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2026. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2027. element: SyntaxTree.IntegerValue;
  2028. BEGIN
  2029. numberElements := x.elements.Length();
  2030. expression := index.parameters.GetExpression(dim);
  2031. element := expression(SyntaxTree.IntegerValue);
  2032. FOR i := 0 TO numberElements-1 DO
  2033. expression := x.elements.GetExpression(i);
  2034. element.SetValue(i);
  2035. IF expression IS SyntaxTree.MathArrayExpression THEN
  2036. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2037. ELSE
  2038. Assign(index,expression);
  2039. END;
  2040. END;
  2041. END RecursiveAssignment;
  2042. BEGIN
  2043. (*static math array not providing pointers anyway *)
  2044. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2045. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2046. designator.SetType(variable.type);
  2047. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  2048. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2049. FOR i := 0 TO dim-1 DO
  2050. element := SyntaxTree.NewIntegerValue(x.position,0);
  2051. element.SetType(system.longintType);
  2052. index.parameters.AddExpression(element);
  2053. END;
  2054. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2055. RecursiveAssignment(x,0);
  2056. Expression(designator);
  2057. END VisitMathArrayExpression;
  2058. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  2059. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2060. BEGIN
  2061. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2062. dest := destination; destination := emptyOperand;
  2063. IF x.operator = Scanner.Not THEN
  2064. IF conditional THEN
  2065. Condition(x.left,falseLabel,trueLabel)
  2066. ELSE
  2067. Evaluate(x.left,operand);
  2068. InitOperand(result,ModeValue);
  2069. Reuse1a(result.op,operand.op,dest);
  2070. Emit(Xor(position,result.op,operand.op,true));
  2071. ReleaseOperand(operand);
  2072. END;
  2073. ELSIF x.operator = Scanner.Minus THEN
  2074. Evaluate(x.left,operand);
  2075. InitOperand(result,ModeValue);
  2076. Reuse1a(result.op,operand.op,dest);
  2077. type := x.left.type.resolved;
  2078. IF type IS SyntaxTree.SetType THEN
  2079. Emit(Not(position,result.op,operand.op));
  2080. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2081. Reuse1(result.tag,operand.tag);
  2082. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2083. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2084. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2085. Emit(Neg(position,result.op,operand.op));
  2086. ELSE HALT(200)
  2087. END;
  2088. ReleaseOperand(operand);
  2089. ELSIF x.operator = Scanner.Address THEN
  2090. Designate(x.left,operand);
  2091. operand.mode := ModeValue;
  2092. t0 := x.left.type.resolved;
  2093. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2094. ReleaseIntermediateOperand(operand.op);
  2095. operand.op := operand.tag;
  2096. IntermediateCode.InitOperand(operand.tag);
  2097. END;
  2098. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2099. result := operand;
  2100. ELSE HALT(100)
  2101. END;
  2102. destination := dest;
  2103. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2104. END VisitUnaryExpression;
  2105. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2106. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2107. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2108. BEGIN
  2109. type := type.resolved;
  2110. originalType := type;
  2111. IF type IS SyntaxTree.PointerType THEN
  2112. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2113. END;
  2114. IF type IS SyntaxTree.ObjectType THEN
  2115. BrL(trueL);
  2116. ELSE
  2117. ASSERT(type IS SyntaxTree.RecordType);
  2118. (*
  2119. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2120. *)
  2121. ReuseCopy(left,tag);
  2122. right := TypeDescriptorAdr(type);
  2123. IF ~newObjectFile THEN
  2124. IntermediateCode.MakeMemory(right,addressType);
  2125. END;
  2126. IF backend.cooperative THEN
  2127. repeatL := NewLabel();
  2128. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2129. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2130. END;
  2131. SetLabel(repeatL);
  2132. BreqL(trueL,left,right);
  2133. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2134. BrneL(repeatL,left,nil);
  2135. ELSIF meta.simple THEN
  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. ELSE
  2143. level := type(SyntaxTree.RecordType).Level();
  2144. (* get type desc tag of level relative to base tag *)
  2145. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2146. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2147. IntermediateCode.MakeMemory(left,addressType);
  2148. BreqL(trueL,left,right);
  2149. END;
  2150. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2151. BrL(falseL);
  2152. END;
  2153. END TypeTest;
  2154. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2155. BEGIN
  2156. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2157. IF dump # NIL THEN
  2158. dump.String(s); dump.Ln;
  2159. END;
  2160. END Error;
  2161. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2162. BEGIN
  2163. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2164. IF dump # NIL THEN
  2165. dump.String(s); dump.Ln; dump.Update;
  2166. END;
  2167. END Warning;
  2168. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2169. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2170. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2171. operand:Operand;
  2172. BEGIN
  2173. previousSection := section;
  2174. Global.GetModuleName(mod,name);
  2175. Strings.Append(name,".@Trace");
  2176. Basic.ToSegmentedName(name, pooledName);
  2177. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2178. IF dump # NIL THEN dump := section.comments END;
  2179. IF backend.hasLinkRegister THEN
  2180. Emit(Push(Basic.invalidPosition, lr));
  2181. END;
  2182. variable := mod.moduleScope.firstVariable;
  2183. WHILE variable # NIL DO
  2184. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2185. Symbol(variable, operand);
  2186. register := operand.op;
  2187. CallTraceMethod(register, variable.type);
  2188. ReleaseIntermediateOperand(register);
  2189. END;
  2190. variable := variable.nextVariable;
  2191. END;
  2192. IF backend.hasLinkRegister THEN
  2193. Emit(Pop(Basic.invalidPosition, lr));
  2194. END;
  2195. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2196. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2197. Emit(Br(position,op));
  2198. INC(statCoopTraceModule, section.pc);
  2199. section := previousSection;
  2200. IF dump # NIL THEN dump := section.comments END;
  2201. END CreateTraceModuleMethod;
  2202. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2203. BEGIN
  2204. Emit (Push(position, dst));
  2205. Emit (Push(position, src));
  2206. CallThis(position,"GarbageCollector","Assign", 2);
  2207. END CallAssignPointer;
  2208. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2209. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2210. BEGIN
  2211. IF SemanticChecker.IsPointerType (type) THEN
  2212. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2213. ELSIF type.IsRecordType() THEN
  2214. Emit (Push(position,dst));
  2215. Emit (Push(position,src));
  2216. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2217. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2218. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2219. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2220. ELSIF IsStaticArray(type) THEN
  2221. size := StaticArrayNumElements(type);
  2222. base := StaticArrayBaseType(type);
  2223. IF base.IsRecordType() THEN
  2224. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2225. Emit (Push(position, dst));
  2226. Emit (Push(position, src));
  2227. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2228. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2229. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2230. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2231. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2232. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2233. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2234. Emit (Push(position, dst));
  2235. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2236. Emit (Push(position, src));
  2237. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2238. ELSE
  2239. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2240. Emit (Push(position, dst));
  2241. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2242. Emit (Push(position, src));
  2243. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2244. ASSERT(StaticArrayBaseType(type).IsPointer());
  2245. END;
  2246. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2247. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2248. Emit (Push(position, dst));
  2249. Emit (Push(position, src));
  2250. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2251. ELSE HALT(100); (* missing ? *)
  2252. END;
  2253. END CallAssignMethod;
  2254. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2255. VAR name: Basic.SegmentedName;
  2256. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2257. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2258. context: Context;
  2259. BEGIN
  2260. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2261. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2262. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2263. GetRecordTypeName (recordType,name);
  2264. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2265. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2266. IF dump # NIL THEN dump := section.comments END;
  2267. IF backend.hasLinkRegister THEN
  2268. Emit(Push(Basic.invalidPosition, lr));
  2269. END;
  2270. variable := recordType.recordScope.firstVariable;
  2271. WHILE variable # NIL DO
  2272. IF variable.NeedsTrace() THEN
  2273. dst := NewRegisterOperand (addressType);
  2274. src := NewRegisterOperand (addressType);
  2275. Emit (Mov(position, dst, parameter1));
  2276. Emit (Mov(position, src, parameter2));
  2277. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2278. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2279. CallAssignMethod(dst, src, variable.type);
  2280. ReleaseIntermediateOperand(src);
  2281. ReleaseIntermediateOperand(dst);
  2282. END;
  2283. variable := variable.nextVariable;
  2284. END;
  2285. recordBase := recordType.GetBaseRecord();
  2286. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2287. IF backend.hasLinkRegister THEN
  2288. Emit(Pop(Basic.invalidPosition, lr));
  2289. END;
  2290. GetRecordTypeName (recordBase,name);
  2291. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2292. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2293. Emit(Br(position,op));
  2294. ELSE
  2295. Emit(Exit(position,0,0, 0));
  2296. END;
  2297. IF ~recordType.isObject THEN
  2298. GetRecordTypeName (recordType,name);
  2299. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2300. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2301. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2302. NEW(registerUsageCount);
  2303. usedRegisters := NIL;
  2304. dst := NewRegisterOperand (addressType);
  2305. src := NewRegisterOperand (addressType);
  2306. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2307. Emit(Mov(position, dst, parameter1));
  2308. Emit(Mov(position, src, parameter2));
  2309. label := NewLabel();
  2310. SetLabel(label);
  2311. Emit(Push(position, dst));
  2312. Emit(Push(position, src));
  2313. GetRecordTypeName (recordType,name);
  2314. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2315. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2316. Emit(Call(position, op, 0));
  2317. Emit(Pop(position, src));
  2318. Emit(Pop(position, dst));
  2319. Emit(Add(position, dst, dst, ofs));
  2320. Emit(Add(position, src, src, ofs));
  2321. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2322. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2323. Emit(Exit(position,0,0, 0));
  2324. END;
  2325. INC(statCoopAssignProcedure, section.pc);
  2326. ReturnToContext(context);
  2327. IF dump # NIL THEN dump := section.comments END;
  2328. END CreateAssignProcedure;
  2329. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2330. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2331. BEGIN
  2332. IF IsUnsafePointer (type) THEN
  2333. skip := NewLabel();
  2334. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2335. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2336. BreqL (skip, op, nil);
  2337. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2338. SetLabel (skip);
  2339. ELSIF SemanticChecker.IsPointerType (type) THEN
  2340. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2341. CallThis(position,"GarbageCollector","Mark", 1);
  2342. ELSIF type.IsRecordType() THEN
  2343. Emit (Push(position,register));
  2344. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2345. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2346. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2347. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2348. ELSIF IsStaticArray(type) THEN
  2349. size := StaticArrayNumElements(type);
  2350. base := StaticArrayBaseType(type);
  2351. IF base.IsRecordType() THEN
  2352. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2353. Emit (Push(position, register));
  2354. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2355. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2356. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2357. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2358. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2359. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2360. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2361. Emit (Push(position, register));
  2362. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2363. ELSE
  2364. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2365. Emit (Push(position, register));
  2366. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2367. ASSERT(base.IsPointer());
  2368. END;
  2369. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2370. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2371. CallThis(position,"GarbageCollector","Mark", 1);
  2372. ELSE HALT(100); (* missing ? *)
  2373. END;
  2374. END CallTraceMethod;
  2375. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2376. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2377. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2378. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2379. BEGIN
  2380. previousSection := section;
  2381. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2382. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2383. GetRecordTypeName (recordType,name);
  2384. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2385. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2386. IF dump # NIL THEN dump := section.comments END;
  2387. IF backend.hasLinkRegister THEN
  2388. Emit(Push(Basic.invalidPosition, lr));
  2389. END;
  2390. variable := recordType.recordScope.firstVariable;
  2391. WHILE variable # NIL DO
  2392. IF variable.NeedsTrace() THEN
  2393. register := NewRegisterOperand (addressType);
  2394. Emit (Mov(position,register,parameter1));
  2395. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2396. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2397. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2398. END;
  2399. CallTraceMethod(register, variable.type);
  2400. ReleaseIntermediateOperand(register);
  2401. END;
  2402. variable := variable.nextVariable;
  2403. END;
  2404. recordBase := recordType.GetBaseRecord();
  2405. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2406. recordBase := recordBase.GetBaseRecord();
  2407. END;
  2408. IF recordBase # NIL THEN
  2409. IF backend.hasLinkRegister THEN
  2410. Emit(Pop(Basic.invalidPosition, lr));
  2411. END;
  2412. GetRecordTypeName (recordBase,name);
  2413. IF HasExplicitTraceMethod (recordBase) THEN
  2414. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2415. ELSE
  2416. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2417. END;
  2418. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2419. Emit(Br(position,op));
  2420. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2421. Emit(Exit(position,0,0,0));
  2422. ELSE
  2423. IF backend.hasLinkRegister THEN
  2424. Emit(Pop(Basic.invalidPosition, lr));
  2425. END;
  2426. IF recordType.isObject THEN
  2427. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2428. ELSE
  2429. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2430. END;
  2431. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2432. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2433. Emit(Br(position,op));
  2434. END;
  2435. IF ~recordType.isObject THEN
  2436. GetRecordTypeName (recordType,name);
  2437. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2438. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2439. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2440. NEW(registerUsageCount);
  2441. usedRegisters := NIL;
  2442. IF dump # NIL THEN dump := section.comments END;
  2443. register := NewRegisterOperand (addressType);
  2444. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2445. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2446. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2447. END;
  2448. Emit (Push(position,register));
  2449. GetRecordTypeName (recordType,name);
  2450. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2451. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2452. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2453. ReleaseIntermediateOperand(register);
  2454. Emit(Exit(position,0,0,0));
  2455. GetRecordTypeName (recordType,name);
  2456. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2457. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2458. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2459. NEW(registerUsageCount);
  2460. usedRegisters := NIL;
  2461. register := NewRegisterOperand (addressType);
  2462. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2463. Emit(Mov(position, register, parameter1));
  2464. label := NewLabel();
  2465. SetLabel(label);
  2466. Emit(Push(position, register));
  2467. GetRecordTypeName (recordType,name);
  2468. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2469. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2470. Emit(Call(position, op, 0));
  2471. Emit(Pop(position, register));
  2472. Emit(Add(position, register, register, ofs));
  2473. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2474. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2475. Emit(Exit(position,0,0,0));
  2476. END;
  2477. INC(statCoopTraceMethod, section.pc);
  2478. ReturnToContext(context);
  2479. IF dump # NIL THEN dump := section.comments END;
  2480. END CreateTraceMethod;
  2481. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2482. VAR name: Basic.SegmentedName;
  2483. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2484. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2485. context: Context;
  2486. BEGIN
  2487. IF recordType.isObject THEN RETURN END;
  2488. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2489. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2490. GetRecordTypeName (recordType,name);
  2491. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2492. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2493. IF dump # NIL THEN dump := section.comments END;
  2494. IF backend.hasLinkRegister THEN
  2495. Emit(Push(Basic.invalidPosition, lr));
  2496. END;
  2497. variable := recordType.recordScope.firstVariable;
  2498. WHILE variable # NIL DO
  2499. IF variable.NeedsTrace() THEN
  2500. dst := NewRegisterOperand (addressType);
  2501. Emit (Mov(position, dst, parameter1));
  2502. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2503. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2504. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2505. END;
  2506. CallResetProcedure(dst, nil, variable.type);
  2507. ReleaseIntermediateOperand(dst);
  2508. END;
  2509. variable := variable.nextVariable;
  2510. END;
  2511. recordBase := recordType.GetBaseRecord();
  2512. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2513. IF backend.hasLinkRegister THEN
  2514. Emit(Pop(Basic.invalidPosition, lr));
  2515. END;
  2516. GetRecordTypeName (recordBase,name);
  2517. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2518. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2519. Emit(Br(position,op));
  2520. ELSE
  2521. Emit(Exit(position,0,0, 0));
  2522. END;
  2523. GetRecordTypeName (recordType,name);
  2524. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2525. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2526. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2527. NEW(registerUsageCount);
  2528. usedRegisters := NIL;
  2529. dst := NewRegisterOperand (addressType);
  2530. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2531. Emit(Mov(position, dst, parameter1));
  2532. label := NewLabel();
  2533. SetLabel(label);
  2534. Emit(Push(position, dst));
  2535. GetRecordTypeName (recordType,name);
  2536. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2537. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2538. Emit(Call(position, op, 0));
  2539. Emit(Pop(position, dst));
  2540. Emit(Add(position, dst, dst, ofs));
  2541. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2542. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2543. Emit(Exit(position,0,0, 0));
  2544. INC(statCoopResetProcedure, section.pc);
  2545. ReturnToContext(context);
  2546. IF dump # NIL THEN dump := section.comments END;
  2547. END CreateResetProcedure;
  2548. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2549. VAR name: Basic.SegmentedName; context: Context;
  2550. BEGIN
  2551. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2552. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2553. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2554. IF dump # NIL THEN dump := section.comments END;
  2555. IF backend.hasLinkRegister THEN
  2556. Emit(Push(Basic.invalidPosition, lr));
  2557. END;
  2558. Emit(Push(position,fp));
  2559. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2560. ResetVariables(scope);
  2561. Emit(Pop(position,fp));
  2562. Emit(Exit(position,0,0, 0));
  2563. ReturnToContext(context);
  2564. IF dump # NIL THEN dump := section.comments END;
  2565. END CreateResetMethod;
  2566. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2567. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2568. BEGIN
  2569. IF SemanticChecker.IsPointerType (type) THEN
  2570. Emit (Push(position, dest));
  2571. CallThis(position,"GarbageCollector","Reset", 1);
  2572. ELSIF type.IsRecordType() THEN
  2573. Emit (Push(position, dest));
  2574. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2575. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2576. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2577. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2578. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2579. size := GetArrayLength(type, tag);
  2580. base := ArrayBaseType(type);
  2581. IF base.IsRecordType() THEN
  2582. Emit (Push(position, size));
  2583. Emit (Push(position, dest));
  2584. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2585. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2586. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2587. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2588. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2589. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2590. Emit (Push(position, size));
  2591. Emit (Push(position, dest));
  2592. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2593. ELSE
  2594. Emit (Push(position, size));
  2595. Emit (Push(position, dest));
  2596. CallThis(position,"GarbageCollector","ResetArray", 2);
  2597. ASSERT(ArrayBaseType(type).IsPointer());
  2598. END;
  2599. ReleaseIntermediateOperand(size);
  2600. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2601. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2602. Emit (Push(position, dest));
  2603. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2604. ELSE HALT(100); (* missing ? *)
  2605. END;
  2606. END CallResetProcedure;
  2607. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2608. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2609. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2610. VAR operand: Operand;
  2611. BEGIN
  2612. Symbol (symbol, operand);
  2613. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2614. ReleaseOperand(operand);
  2615. END Reset;
  2616. BEGIN
  2617. previousScope := currentScope;
  2618. currentScope := scope;
  2619. pc := section.pc;
  2620. variable := scope.firstVariable;
  2621. WHILE variable # NIL DO
  2622. IF variable.NeedsTrace() THEN
  2623. Reset (variable);
  2624. END;
  2625. variable := variable.nextVariable;
  2626. END;
  2627. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2628. WHILE parameter # NIL DO
  2629. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2630. Reset (parameter);
  2631. END;
  2632. parameter := parameter.nextParameter;
  2633. END;
  2634. INC(statCoopResetVariables, section.pc - pc);
  2635. currentScope := previousScope;
  2636. END ResetVariables;
  2637. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2638. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2639. VAR op: IntermediateCode.Operand; context: Context;
  2640. BEGIN
  2641. previousSection := section;
  2642. GetCodeSectionNameForSymbol(procedure, name);
  2643. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2644. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2645. IF dump # NIL THEN dump := section.comments END;
  2646. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2647. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2648. Emit(Data(position,op));
  2649. Emit(Data(position,nil));
  2650. IF HasPointers (procedure.procedureScope) THEN
  2651. GetCodeSectionNameForSymbol(procedure, name);
  2652. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2653. ELSE
  2654. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2655. END;
  2656. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2657. Emit(Data(position,op));
  2658. ReturnToContext(context);
  2659. IF dump # NIL THEN dump := section.comments END;
  2660. END CreateProcedureDescriptor;
  2661. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2662. VAR import: SyntaxTree.Import;
  2663. s: Basic.MessageString;
  2664. selfName: SyntaxTree.IdentifierString;
  2665. BEGIN
  2666. moduleScope.ownerModule.GetName(selfName);
  2667. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2668. module := moduleScope.ownerModule
  2669. ELSE
  2670. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2671. IF import = NIL THEN
  2672. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2673. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2674. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2675. s := "Module ";
  2676. Strings.Append(s,moduleName);
  2677. Strings.Append(s," cannot be imported.");
  2678. IF force THEN
  2679. Error(position,s);
  2680. ELSIF canBeLoaded THEN
  2681. IF WarningDynamicLoading THEN
  2682. Strings.Append(s, "=> no dynamic linking.");
  2683. Warning(position, s);
  2684. END;
  2685. canBeLoaded := FALSE;
  2686. END;
  2687. RETURN FALSE
  2688. ELSE
  2689. SELF.module.imports.AddName(moduleName)
  2690. END;
  2691. ELSIF import.module = NIL THEN (* already tried *)
  2692. RETURN FALSE
  2693. END;
  2694. module := import.module;
  2695. END;
  2696. RETURN TRUE
  2697. END AddImport;
  2698. (* needed for old binary object file format*)
  2699. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2700. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2701. BEGIN
  2702. IF AddImport(moduleName,module,TRUE) THEN
  2703. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2704. IF procedure = NIL THEN
  2705. s := "Instruction not supported on target, emulation procedure ";
  2706. Strings.Append(s,moduleName);
  2707. Strings.Append(s,".");
  2708. Strings.Append(s,procedureName);
  2709. Strings.Append(s," not present");
  2710. Error(position,s);
  2711. ELSE
  2712. StaticCallOperand(r,procedure);
  2713. ReleaseOperand(r);
  2714. fp := GetFingerprint(procedure);
  2715. END;
  2716. END;
  2717. END EnsureSymbol;
  2718. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2719. VAR exit: Label; trueL,falseL: Label;
  2720. BEGIN
  2721. trueL := NewLabel();
  2722. falseL := NewLabel();
  2723. exit := NewLabel();
  2724. Condition(x,trueL,falseL);
  2725. InitOperand(result,ModeValue);
  2726. SetLabel(trueL);
  2727. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2728. Emit(Mov(position,result.op,true));
  2729. BrL(exit);
  2730. SetLabel(falseL);
  2731. Emit(MovReplace(position,result.op,false));
  2732. SetLabel(exit);
  2733. END ConditionToValue;
  2734. PROCEDURE ValueToCondition(VAR op: Operand);
  2735. BEGIN
  2736. LoadValue(op,system.booleanType);
  2737. BrneL(trueLabel,op.op, false);
  2738. ReleaseOperand(op);
  2739. BrL(falseLabel);
  2740. END ValueToCondition;
  2741. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2742. VAR size: LONGINT;
  2743. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2744. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2745. BEGIN
  2746. ASSERT(type.form = SyntaxTree.Open);
  2747. baseType := type.arrayBase.resolved;
  2748. IF IsOpenArray(baseType) THEN
  2749. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2750. ELSE
  2751. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2752. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2753. END;
  2754. len := tag;
  2755. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2756. IntermediateCode.MakeMemory(len,addressType);
  2757. UseIntermediateOperand(len);
  2758. Reuse2(res,sizeOperand,len);
  2759. Emit(Mul(position,res,sizeOperand,len));
  2760. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2761. RETURN res
  2762. END GetArraySize;
  2763. BEGIN
  2764. type := type.resolved;
  2765. IF IsOpenArray(type) THEN
  2766. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2767. RETURN tag
  2768. ELSE
  2769. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2770. END;
  2771. ELSE
  2772. size := ToMemoryUnits(system,system.SizeOf(type));
  2773. RETURN IntermediateCode.Immediate(addressType,size)
  2774. END;
  2775. END GetDynamicSize;
  2776. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2777. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2778. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2779. BEGIN
  2780. ASSERT(type.form = SyntaxTree.Open);
  2781. baseType := type.arrayBase.resolved;
  2782. IF IsOpenArray(baseType) THEN
  2783. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2784. ELSE
  2785. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2786. END;
  2787. len := tag;
  2788. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2789. IntermediateCode.MakeMemory(len,addressType);
  2790. UseIntermediateOperand(len);
  2791. Reuse2(res,sizeOperand,len);
  2792. Emit(Mul(position,res,sizeOperand,len));
  2793. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2794. RETURN res
  2795. END GetLength;
  2796. BEGIN
  2797. type := type.resolved;
  2798. IF IsOpenArray(type) THEN
  2799. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2800. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2801. ELSIF type IS SyntaxTree.StringType THEN
  2802. RETURN tag;
  2803. ELSE
  2804. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2805. END;
  2806. END GetArrayLength;
  2807. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2808. VAR result: IntermediateCode.Operand;
  2809. BEGIN
  2810. IF backend.cooperative THEN
  2811. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2812. ELSE
  2813. MakeMemory(result, tag, addressType, 0);
  2814. END;
  2815. RETURN result
  2816. END GetSizeFromTag;
  2817. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2818. VAR parameter: SyntaxTree.Parameter;
  2819. BEGIN
  2820. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2821. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2822. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2823. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2824. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2825. END;
  2826. RETURN GetDynamicSize(e.type, tag);
  2827. END GetArrayOfBytesSize;
  2828. (*
  2829. to find imported symbol. not needed ?
  2830. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2831. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2832. BEGIN
  2833. IF AddImport(moduleName,importedModule,FALSE) THEN
  2834. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2835. RETURN symbol
  2836. ELSE
  2837. RETURN NIL
  2838. END
  2839. END SymbolByName;
  2840. *)
  2841. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2842. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2843. BEGIN
  2844. IF AddImport(moduleName,runtimeModule,force) THEN
  2845. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2846. IF procedure = NIL THEN
  2847. s := "Procedure ";
  2848. Strings.Append(s,moduleName);
  2849. Strings.Append(s,".");
  2850. Strings.Append(s,procedureName);
  2851. Strings.Append(s," not present");
  2852. Error(position,s);
  2853. RETURN FALSE
  2854. ELSE
  2855. RETURN TRUE
  2856. END;
  2857. ELSE RETURN FALSE
  2858. END;
  2859. END GetRuntimeProcedure;
  2860. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2861. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2862. s: Basic.MessageString;
  2863. BEGIN
  2864. Basic.InitSegmentedName(name);
  2865. name[0] := Basic.MakeString(moduleName);
  2866. name[1] := Basic.MakeString(typeName);
  2867. name[2] := -1;
  2868. IF AddImport(moduleName,importedModule, FALSE) THEN
  2869. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2870. IF symbol = NIL THEN
  2871. s := "type ";
  2872. Strings.Append(s,moduleName);
  2873. Strings.Append(s,".");
  2874. Strings.Append(s,typeName);
  2875. Strings.Append(s," not present");
  2876. Error(position,s);
  2877. END;
  2878. ELSE symbol := NIL;
  2879. END;
  2880. IF importedModule = moduleScope.ownerModule THEN
  2881. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2882. ELSE
  2883. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2884. END;
  2885. RETURN symbol
  2886. END GetTypeDescriptor;
  2887. (* 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. *)
  2888. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2889. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2890. pooledName: Basic.SegmentedName; size: LONGINT;
  2891. BEGIN
  2892. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2893. StaticCallOperand(result,procedure);
  2894. IF numberParameters < 0 THEN
  2895. size := ProcedureParametersSize(system,procedure);
  2896. ELSE
  2897. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2898. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2899. Error(position,"runtime call parameter count mismatch");
  2900. END;
  2901. END;
  2902. Emit(Call(position, result.op, size));
  2903. ReleaseOperand(result);
  2904. ELSE (* only static linking possible *)
  2905. ASSERT(numberParameters >= 0);
  2906. Basic.InitSegmentedName(pooledName);
  2907. pooledName[0] := Basic.MakeString(moduleName);
  2908. pooledName[1] := Basic.MakeString(procedureName);
  2909. pooledName[2] := -1;
  2910. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2911. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2912. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2913. END;
  2914. END CallThisChecked;
  2915. (* 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. *)
  2916. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2917. BEGIN
  2918. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2919. END CallThis;
  2920. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2921. VAR
  2922. left,right: Operand;
  2923. leftSize, rightSize: IntermediateCode.Operand;
  2924. saved: RegisterEntry;
  2925. reg: IntermediateCode.Operand;
  2926. procedureName: SyntaxTree.IdentifierString;
  2927. BEGIN
  2928. procedureName := "CompareString";
  2929. SaveRegisters();ReleaseUsedRegisters(saved);
  2930. Designate(leftExpression,left);
  2931. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2932. Emit(Push(position,leftSize));
  2933. ReleaseIntermediateOperand(leftSize);
  2934. Emit(Push(position,left.op));
  2935. ReleaseOperand(left);
  2936. Designate(rightExpression,right);
  2937. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2938. Emit(Push(position,rightSize));
  2939. ReleaseIntermediateOperand(rightSize);
  2940. Emit(Push(position,right.op));
  2941. ReleaseOperand(right);
  2942. IF backend.cooperative THEN
  2943. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2944. ELSE
  2945. CallThis(position,runtimeModuleName,procedureName, 4);
  2946. END;
  2947. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2948. Emit(Result(position,reg));
  2949. (*
  2950. AcquireThisRegister(int8,IntermediateCode.Result);
  2951. *)
  2952. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2953. (*
  2954. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2955. *)
  2956. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2957. ReleaseIntermediateOperand(reg);
  2958. BrL(falseLabel);
  2959. END CompareString;
  2960. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2961. VAR
  2962. left,right: Operand;
  2963. leftSize, rightSize: IntermediateCode.Operand;
  2964. saved: RegisterEntry;
  2965. procedureName: SyntaxTree.IdentifierString;
  2966. BEGIN
  2967. procedureName := "CopyString";
  2968. SaveRegisters();ReleaseUsedRegisters(saved);
  2969. Designate(leftExpression,left);
  2970. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2971. Emit(Push(position,leftSize));
  2972. ReleaseIntermediateOperand(leftSize);
  2973. Emit(Push(position,left.op));
  2974. ReleaseOperand(left);
  2975. Designate(rightExpression,right);
  2976. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2977. Emit(Push(position,rightSize));
  2978. ReleaseIntermediateOperand(rightSize);
  2979. Emit(Push(position,right.op));
  2980. ReleaseOperand(right);
  2981. IF backend.cooperative THEN
  2982. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2983. ELSE
  2984. CallThis(position,runtimeModuleName,procedureName,4);
  2985. END;
  2986. RestoreRegisters(saved);
  2987. END CopyString;
  2988. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2989. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2990. leftType,rightType: SyntaxTree.Type;
  2991. leftExpression,rightExpression : SyntaxTree.Expression;
  2992. componentType: IntermediateCode.Type;
  2993. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2994. size: LONGINT;
  2995. BEGIN
  2996. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2997. dest := destination; destination := emptyOperand;
  2998. leftType := x.left.type.resolved;
  2999. rightType := x.right.type.resolved;
  3000. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3001. CASE x.operator OF
  3002. Scanner.Or:
  3003. (* shortcut evaluation of left OR right *)
  3004. IF ~conditional THEN ConditionToValue(x);
  3005. ELSE
  3006. next := NewLabel();
  3007. Condition(x.left,trueLabel,next);
  3008. SetLabel(next);
  3009. Condition(x.right,trueLabel,falseLabel);
  3010. END;
  3011. |Scanner.And:
  3012. (* shortcut evaluation of left & right *)
  3013. IF ~conditional THEN ConditionToValue(x);
  3014. ELSE
  3015. next := NewLabel();
  3016. Condition(x.left,next,falseLabel);
  3017. SetLabel(next);
  3018. Condition(x.right,trueLabel,falseLabel);
  3019. END;
  3020. |Scanner.Is:
  3021. IF ~conditional THEN ConditionToValue(x);
  3022. ELSE
  3023. (* get type desc tag *)
  3024. IF IsPointerToRecord(leftType,recordType) THEN
  3025. Evaluate(x.left,left);
  3026. Dereference(left,recordType,IsUnsafePointer(leftType))
  3027. ELSE
  3028. Designate(x.left,left);
  3029. END;
  3030. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3031. ReleaseOperand(left);
  3032. END;
  3033. |Scanner.Plus:
  3034. Evaluate(x.left,left);
  3035. Evaluate(x.right,right);
  3036. IF leftType IS SyntaxTree.SetType THEN
  3037. InitOperand(result,ModeValue);
  3038. Reuse2a(result.op,left.op,right.op,dest);
  3039. Emit(Or(position,result.op,left.op,right.op));
  3040. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3041. InitOperand(result,ModeValue);
  3042. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3043. Reuse2(result.tag,left.tag,right.tag);
  3044. Emit(Add(position,result.op,left.op,right.op));
  3045. Emit(Add(position,result.tag,left.tag,right.tag))
  3046. ELSE
  3047. InitOperand(result,ModeValue);
  3048. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3049. AddInt(result.op, left.op, right.op) ;
  3050. ELSE
  3051. *)
  3052. Reuse2a(result.op,left.op,right.op,dest);
  3053. Emit(Add(position,result.op,left.op,right.op));
  3054. (*
  3055. END;
  3056. *)
  3057. END;
  3058. ReleaseOperand(left); ReleaseOperand(right);
  3059. |Scanner.Minus:
  3060. Evaluate(x.left,left);
  3061. Evaluate(x.right,right);
  3062. IF leftType IS SyntaxTree.SetType THEN
  3063. InitOperand(result,ModeValue);
  3064. Reuse1(result.op,right.op);
  3065. Emit(Not(position,result.op,right.op));
  3066. ReleaseOperand(right);
  3067. Emit(And(position,result.op,result.op,left.op));
  3068. ReleaseOperand(left);
  3069. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3070. InitOperand(result,ModeValue);
  3071. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3072. Reuse2(result.tag,left.tag,right.tag);
  3073. Emit(Sub(position,result.op,left.op,right.op));
  3074. Emit(Sub(position,result.tag,left.tag,right.tag));
  3075. ReleaseOperand(left); ReleaseOperand(right)
  3076. ELSE
  3077. InitOperand(result,ModeValue);
  3078. Reuse2a(result.op,left.op,right.op,dest);
  3079. Emit(Sub(position,result.op,left.op,right.op));
  3080. ReleaseOperand(left); ReleaseOperand(right);
  3081. END;
  3082. |Scanner.Times:
  3083. Evaluate(x.left,left);
  3084. Evaluate(x.right,right);
  3085. IF leftType IS SyntaxTree.SetType THEN
  3086. InitOperand(result,ModeValue);
  3087. Reuse2a(result.op,left.op,right.op,dest);
  3088. Emit(And(position,result.op,left.op,right.op));
  3089. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3090. InitOperand(result, ModeValue);
  3091. componentType := left.op.type;
  3092. (* TODO: review this *)
  3093. (*
  3094. result.op = left.op * right.op - left.tag * right.tag
  3095. result.tag = left.tag * right.op + left.op * right.tag
  3096. *)
  3097. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3098. Emit(Mul(position,result.op, left.op, right.op));
  3099. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3100. Emit(Mul(position,tempReg, left.tag, right.tag));
  3101. Emit(Sub(position,result.op, result.op, tempReg));
  3102. Reuse2(result.tag, left.tag, right.op);
  3103. Emit(Mul(position,result.tag, left.tag, right.op));
  3104. Emit(Mul(position,tempReg, left.op, right.tag));
  3105. Emit(Add(position,result.tag, result.tag, tempReg));
  3106. ReleaseIntermediateOperand(tempReg)
  3107. ELSE
  3108. InitOperand(result,ModeValue);
  3109. Reuse2a(result.op,left.op,right.op,dest);
  3110. Emit(Mul(position,result.op,left.op,right.op));
  3111. END;
  3112. ReleaseOperand(left); ReleaseOperand(right);
  3113. |Scanner.Div:
  3114. Evaluate(x.left,left);
  3115. Evaluate(x.right,right);
  3116. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3117. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3118. IF ~isUnchecked THEN
  3119. exit := NewLabel();
  3120. BrltL(exit,zero,right.op);
  3121. EmitTrap(position,NegativeDivisorTrap);
  3122. SetLabel(exit);
  3123. END;
  3124. END;
  3125. InitOperand(result,ModeValue);
  3126. Reuse2a(result.op,left.op,right.op,dest);
  3127. Emit(Div(position,result.op,left.op,right.op));
  3128. ReleaseOperand(left); ReleaseOperand(right);
  3129. |Scanner.Mod:
  3130. Evaluate(x.left,left);
  3131. Evaluate(x.right,right);
  3132. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3133. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3134. IF ~isUnchecked THEN
  3135. exit := NewLabel();
  3136. BrltL(exit,zero,right.op);
  3137. EmitTrap(position,NegativeDivisorTrap);
  3138. SetLabel(exit);
  3139. END;
  3140. END;
  3141. InitOperand(result,ModeValue);
  3142. Reuse2a(result.op,left.op,right.op,dest);
  3143. Emit(Mod(position,result.op,left.op,right.op));
  3144. ReleaseOperand(left); ReleaseOperand(right);
  3145. |Scanner.Slash:
  3146. Evaluate(x.left,left);
  3147. Evaluate(x.right,right);
  3148. IF leftType IS SyntaxTree.SetType THEN
  3149. InitOperand(result,ModeValue);
  3150. Reuse2a(result.op,left.op,right.op,dest);
  3151. Emit(Xor(position,result.op,left.op,right.op));
  3152. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3153. InitOperand(result,ModeValue);
  3154. componentType := left.op.type;
  3155. (* review this *)
  3156. (*
  3157. divisor = right.op * right.op + right.tag * right.tag
  3158. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3159. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3160. *)
  3161. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3162. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3163. Emit(Mul(position,tempReg, right.op, right.op));
  3164. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3165. Emit(Add(position,tempReg, tempReg, tempReg2));
  3166. result.op := tempReg2;
  3167. Emit(Mul(position,result.op, left.op, right.op));
  3168. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3169. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3170. Emit(Add(position,result.op, result.op, tempReg2));
  3171. Emit(Div(position,result.op, result.op, tempReg));
  3172. Reuse2(result.tag, left.tag, right.op);
  3173. Emit(Mul(position,result.tag, left.tag, right.op));
  3174. Emit(Mul(position,tempReg2, left.op, right.tag));
  3175. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3176. Emit(Div(position,result.tag, result.tag, tempReg));
  3177. ReleaseIntermediateOperand(tempReg);
  3178. ReleaseIntermediateOperand(tempReg2)
  3179. ELSE
  3180. InitOperand(result,ModeValue);
  3181. Reuse2a(result.op,left.op,right.op,dest);
  3182. Emit(Div(position,result.op,left.op,right.op));
  3183. END;
  3184. ReleaseOperand(left); ReleaseOperand(right);
  3185. |Scanner.Equal:
  3186. IF ~conditional THEN ConditionToValue(x);
  3187. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3188. CompareString(BreqL,x.left,x.right);
  3189. ELSE
  3190. Evaluate(x.left,left);
  3191. Evaluate(x.right,right);
  3192. IF leftType IS SyntaxTree.RangeType THEN
  3193. ASSERT(rightType IS SyntaxTree.RangeType);
  3194. BrneL(falseLabel, left.op, right.op); (* first *)
  3195. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3196. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3197. ReleaseOperand(left); ReleaseOperand(right);
  3198. BrL(trueLabel)
  3199. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3200. BrneL(falseLabel, left.op, right.op); (* first *)
  3201. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3202. ReleaseOperand(left); ReleaseOperand(right);
  3203. BrL(trueLabel)
  3204. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3205. (* TODO: review this *)
  3206. BrneL(falseLabel, left.op, right.op); (* real part *)
  3207. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3208. ReleaseOperand(left); ReleaseOperand(right);
  3209. BrL(trueLabel)
  3210. ELSE
  3211. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3212. ReleaseOperand(left); ReleaseOperand(right);
  3213. BrL(trueLabel);
  3214. END;
  3215. END;
  3216. |Scanner.LessEqual:
  3217. IF ~conditional THEN ConditionToValue(x);
  3218. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3219. CompareString(BrgeL,x.right,x.left);
  3220. ELSE
  3221. Evaluate(x.left,left);
  3222. Evaluate(x.right,right);
  3223. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3224. Reuse1(temp.op,right.op);
  3225. Emit(And(position,temp.op,left.op,right.op));
  3226. ReleaseOperand(right);
  3227. BreqL(trueLabel,temp.op,left.op);
  3228. BrL(falseLabel);
  3229. ReleaseOperand(temp);ReleaseOperand(left);
  3230. ELSE
  3231. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3232. ReleaseOperand(left); ReleaseOperand(right);
  3233. BrL(trueLabel);
  3234. END;
  3235. END;
  3236. |Scanner.Less:
  3237. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3238. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3239. leftExpression.SetType(system.booleanType);
  3240. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3241. rightExpression.SetType(system.booleanType);
  3242. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3243. leftExpression.SetType(system.booleanType);
  3244. Expression(leftExpression);
  3245. ELSIF ~conditional THEN ConditionToValue(x);
  3246. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3247. CompareString(BrltL,x.left,x.right);
  3248. ELSE
  3249. Evaluate(x.left,left);
  3250. Evaluate(x.right,right);
  3251. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3252. ReleaseOperand(left); ReleaseOperand(right);
  3253. BrL(trueLabel);
  3254. END;
  3255. |Scanner.Greater:
  3256. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3257. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3258. leftExpression.SetType(system.booleanType);
  3259. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3260. rightExpression.SetType(system.booleanType);
  3261. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3262. leftExpression.SetType(system.booleanType);
  3263. Expression(leftExpression);
  3264. ELSIF ~conditional THEN ConditionToValue(x);
  3265. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3266. CompareString(BrltL,x.right,x.left);
  3267. ELSE
  3268. Evaluate(x.left,left);
  3269. Evaluate(x.right,right);
  3270. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3271. ReleaseOperand(left); ReleaseOperand(right);
  3272. BrL(trueLabel);
  3273. END;
  3274. |Scanner.GreaterEqual:
  3275. IF ~conditional THEN ConditionToValue(x);
  3276. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3277. CompareString(BrgeL,x.left,x.right);
  3278. ELSE
  3279. Evaluate(x.left,left);
  3280. Evaluate(x.right,right);
  3281. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3282. Reuse1(temp.op,left.op);
  3283. Emit(And(position,temp.op,left.op,right.op));
  3284. ReleaseOperand(left);
  3285. BreqL(trueLabel, temp.op,right.op);
  3286. ReleaseOperand(temp); ReleaseOperand(right);
  3287. BrL(falseLabel);
  3288. ELSE
  3289. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3290. ReleaseOperand(left); ReleaseOperand(right);
  3291. BrL(trueLabel);
  3292. END;
  3293. END;
  3294. |Scanner.Unequal:
  3295. IF ~conditional THEN ConditionToValue(x);
  3296. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3297. CompareString(BrneL,x.left,x.right);
  3298. ELSE
  3299. Evaluate(x.left,left);
  3300. Evaluate(x.right,right);
  3301. IF leftType IS SyntaxTree.RangeType THEN
  3302. ASSERT(rightType IS SyntaxTree.RangeType);
  3303. BrneL(trueLabel, left.op, right.op); (* first *)
  3304. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3305. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3306. ReleaseOperand(left); ReleaseOperand(right);
  3307. BrL(falseLabel)
  3308. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3309. BrneL(trueLabel, left.op, right.op); (* first *)
  3310. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3311. ReleaseOperand(left); ReleaseOperand(right);
  3312. BrL(falseLabel)
  3313. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3314. (* TODO: review this *)
  3315. BrneL(trueLabel, left.op, right.op); (* real part *)
  3316. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3317. ReleaseOperand(left); ReleaseOperand(right);
  3318. BrL(falseLabel)
  3319. ELSE
  3320. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3321. ReleaseOperand(left); ReleaseOperand(right);
  3322. BrL(trueLabel);
  3323. END;
  3324. END;
  3325. |Scanner.In:
  3326. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3327. Evaluate(x.left,left);
  3328. Evaluate(x.right,right);
  3329. Convert(left.op,setType);
  3330. ReuseCopy(temp.op,right.op);
  3331. Emit(Shr(position,temp.op,temp.op,left.op));
  3332. ReleaseOperand(right); ReleaseOperand(left);
  3333. IntermediateCode.InitImmediate(one,setType,1);
  3334. Emit(And(position,temp.op,temp.op,one));
  3335. IF conditional THEN
  3336. IntermediateCode.InitImmediate(zero,setType,0);
  3337. BrneL(trueLabel,temp.op,zero);
  3338. ReleaseOperand(temp);
  3339. BrL(falseLabel);
  3340. ELSE
  3341. Convert(temp.op,bool);
  3342. result.mode := ModeValue;
  3343. result.op := temp.op;
  3344. result.tag := nil; (* may be left over from calls to evaluate *)
  3345. END;
  3346. ELSE
  3347. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3348. IF x.operator = Scanner.Questionmarks THEN
  3349. leftExpression := x.left;
  3350. rightExpression := x.right;
  3351. ELSE
  3352. leftExpression := x.right;
  3353. rightExpression := x.left;
  3354. END;
  3355. Evaluate(leftExpression, left);
  3356. Emit(Push(position,left.op));
  3357. ReleaseOperand(left);
  3358. Designate(rightExpression, right);
  3359. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3360. IF ~backend.cellsAreObjects THEN
  3361. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3362. END;
  3363. Emit(Push(position,right.op));
  3364. ReleaseOperand(right);
  3365. IF backend.cellsAreObjects THEN
  3366. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3367. ELSE
  3368. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3369. END;
  3370. InitOperand(result, ModeValue);
  3371. result.op := NewRegisterOperand(bool);
  3372. Emit(Result(position,result.op));
  3373. IF conditional THEN
  3374. IntermediateCode.InitImmediate(zero,setType,0);
  3375. BrneL(trueLabel,result.op,zero);
  3376. ReleaseOperand(result);
  3377. BrL(falseLabel);
  3378. END;
  3379. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3380. leftExpression := x.left;
  3381. rightExpression := x.right;
  3382. Evaluate(leftExpression, left);
  3383. Emit(Push(position,left.op));
  3384. ReleaseOperand(left);
  3385. Evaluate(rightExpression, right);
  3386. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3387. IF ~backend.cellsAreObjects THEN
  3388. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3389. END;
  3390. Emit(Push(position,right.op));
  3391. ReleaseOperand(right);
  3392. IF backend.cellsAreObjects THEN
  3393. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3394. ELSE
  3395. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3396. END;
  3397. InitOperand(result, ModeValue);
  3398. result.op := NewRegisterOperand(bool);
  3399. Emit(Result(position,result.op));
  3400. IF conditional THEN
  3401. IntermediateCode.InitImmediate(zero,setType,0);
  3402. BrneL(trueLabel,result.op,zero);
  3403. ReleaseOperand(result);
  3404. BrL(falseLabel);
  3405. END;
  3406. ELSE
  3407. HALT(100);
  3408. END;
  3409. END;
  3410. destination := dest;
  3411. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3412. END VisitBinaryExpression;
  3413. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3414. VAR localResult, operand: Operand;
  3415. BEGIN
  3416. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3417. InitOperand(localResult, ModeValue);
  3418. ASSERT(x.first # NIL);
  3419. Evaluate(x.first, operand);
  3420. localResult.op := operand.op;
  3421. ReleaseOperand(operand);
  3422. UseIntermediateOperand(localResult.op);
  3423. ASSERT(x.last # NIL);
  3424. Evaluate(x.last, operand);
  3425. localResult.tag := operand.op;
  3426. ReleaseOperand(operand);
  3427. UseIntermediateOperand(localResult.tag);
  3428. IF x.step # NIL THEN
  3429. Evaluate(x.step, operand);
  3430. localResult.extra := operand.op;
  3431. ReleaseOperand(operand);
  3432. UseIntermediateOperand(localResult.extra);
  3433. END;
  3434. result := localResult;
  3435. IF Trace THEN TraceExit("VisitRangeExpression") END
  3436. END VisitRangeExpression;
  3437. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3438. BEGIN
  3439. HALT(100); (* should never be evaluated *)
  3440. END VisitTensorRangeExpression;
  3441. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3442. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3443. BEGIN
  3444. IF Trace THEN TraceEnter("VisitConversion") END;
  3445. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3446. dest := destination; destination := emptyOperand;
  3447. Evaluate(x.expression,old);
  3448. InitOperand(result,ModeValue);
  3449. result.op := old.op;
  3450. ASSERT(result.op.mode # 0);
  3451. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3452. (* convert TO a complex number *)
  3453. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3454. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3455. ASSERT(result.op.mode # 0);
  3456. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3457. (* convert FROM a complex number TO a complex number*)
  3458. result.tag := old.tag;
  3459. ASSERT(result.tag.mode # 0);
  3460. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3461. ASSERT(result.tag.mode # 0)
  3462. ELSE
  3463. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3464. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3465. END
  3466. ELSE
  3467. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3468. ASSERT(result.op.mode # 0);
  3469. result.tag := old.tag; (*! probably never used *)
  3470. END;
  3471. destination := dest;
  3472. IF Trace THEN TraceExit("VisitConversion") END;
  3473. END VisitConversion;
  3474. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3475. BEGIN
  3476. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3477. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3478. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3479. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3480. END VisitTypeDeclaration;
  3481. (** designators (expressions) *)
  3482. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3483. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3484. BEGIN
  3485. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3486. IF x.left # NIL THEN Expression(x.left) END;
  3487. Symbol(x.symbol,result);
  3488. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3489. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3490. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3491. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3492. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3493. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3494. END;
  3495. END;
  3496. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3497. END VisitSymbolDesignator;
  3498. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3499. BEGIN
  3500. IF isUnchecked THEN RETURN END;
  3501. IF tagsAvailable THEN
  3502. TrapC(BrltL,index,length,IndexCheckTrap);
  3503. END;
  3504. END BoundCheck;
  3505. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3506. VAR d: IntermediateCode.Operand;
  3507. BEGIN
  3508. IF isUnchecked THEN RETURN END;
  3509. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3510. TrapC(op,dim,d,ArraySizeTrap);
  3511. ReleaseIntermediateOperand(d);
  3512. END DimensionCheck;
  3513. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3514. VAR
  3515. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3516. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3517. expression: SyntaxTree.Expression;
  3518. resultingType, leftType, baseType: SyntaxTree.Type;
  3519. skipLabel1: Label;
  3520. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3521. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3522. variableOp: Operand;
  3523. variable: SyntaxTree.Variable;
  3524. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3525. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3526. VAR e: SyntaxTree.Expression; i: LONGINT;
  3527. BEGIN
  3528. tensorFound := FALSE;
  3529. FOR i := 0 TO parameters.Length()-1 DO
  3530. e := parameters.GetExpression(i);
  3531. IF e IS SyntaxTree.TensorRangeExpression THEN
  3532. ASSERT(~tensorFound);
  3533. tensorFound := TRUE;
  3534. ELSIF e IS SyntaxTree.RangeExpression THEN
  3535. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3536. ELSE
  3537. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3538. END;
  3539. END;
  3540. END CountIndices;
  3541. BEGIN
  3542. ASSERT(tagsAvailable);
  3543. resultingType := x.type.resolved; (* resulting type *)
  3544. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3545. InitOperand(localResult, ModeReference);
  3546. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3547. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3548. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3549. (* a globally defined array destination tag is available -> use and invalidate it*)
  3550. localResult.tag := arrayDestinationTag;
  3551. IntermediateCode.InitOperand(arrayDestinationTag)
  3552. ELSE
  3553. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3554. (* the result is of array range type and thus does not provide any collectable pointers *)
  3555. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3556. Symbol(variable, variableOp);
  3557. ReuseCopy(localResult.tag, variableOp.op);
  3558. ReleaseOperand(variableOp);
  3559. END
  3560. END;
  3561. indexListSize := x.parameters.Length();
  3562. CountIndices(x.parameters);
  3563. (*ASSERT(tensorRangeCount <= 1);*)
  3564. (* designate the array to be indexed over, perform tensor range check if known *)
  3565. Designate(x.left, array);
  3566. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3567. Dereference(array, leftType,FALSE);
  3568. IF ~tensorFound THEN
  3569. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, prefixRanges + prefixIndices), BreqL)
  3570. END
  3571. END;
  3572. (* default base offset *)
  3573. srcDimOffset := 0;
  3574. destDimOffset := 0;
  3575. indexDim := 0;
  3576. (* use address of source array as basis *)
  3577. localResult.op := array.op;
  3578. UseIntermediateOperand(localResult.op);
  3579. (* go through the index list *)
  3580. FOR i := 0 TO indexListSize - 1 DO
  3581. expression := x.parameters.GetExpression(i);
  3582. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3583. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3584. srcDimOffset := -indexListSize;
  3585. destDimOffset := -suffixRanges;
  3586. ELSE
  3587. (* determine which dimension of source array is currently looked at *)
  3588. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3589. (* get the memory operand pointing to array descriptor dimension *)
  3590. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3591. (* make a reusable register from it *)
  3592. ReuseCopy(srcDim, tmp);
  3593. ReleaseIntermediateOperand(tmp);
  3594. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3595. ELSE
  3596. srcDim := IntermediateCode.Immediate(int32, i);
  3597. END;
  3598. (* get length and increment of source array for current dimension *)
  3599. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3600. Convert(sourceLength.op, sizeType);
  3601. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3602. Convert(sourceIncrement.op, sizeType);
  3603. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3604. ReleaseIntermediateOperand(srcDim);
  3605. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3606. (* SINGLE INDEX *)
  3607. Evaluate(expression, index);
  3608. ReleaseIntermediateOperand(index.tag);
  3609. index.tag := emptyOperand;
  3610. Convert(index.op, sizeType);
  3611. (* lower bound check *)
  3612. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3613. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3614. ELSIF isUnchecked THEN (* do nothing *)
  3615. ELSE
  3616. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3617. END;
  3618. (* upper bound check *)
  3619. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3620. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3621. ELSIF isUnchecked THEN (* do nothing *)
  3622. ELSE
  3623. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3624. END;
  3625. ReleaseOperand(sourceLength);
  3626. Convert(index.op, addressType);
  3627. summand := index.op;
  3628. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3629. (* RANGE OF INDICES *)
  3630. Evaluate(expression, range);
  3631. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3632. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3633. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3634. ReleaseOperand(range);
  3635. Convert(firstIndex, sizeType);
  3636. Convert(lastIndex, sizeType);
  3637. Convert(stepSize, sizeType);
  3638. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3639. if it is 'MAX(LONGINT)' *)
  3640. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3641. TransferToRegister(lastIndex, lastIndex);
  3642. skipLabel1 := NewLabel();
  3643. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3644. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3645. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3646. SetLabel(skipLabel1)
  3647. END;
  3648. (* check if step size is valid *)
  3649. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3650. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3651. ELSIF isUnchecked THEN (* do nothing *)
  3652. ELSE
  3653. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3654. END;
  3655. (* check lower bound check *)
  3656. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3657. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3658. ELSIF isUnchecked THEN (* do nothing *)
  3659. ELSE
  3660. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3661. END;
  3662. (* check upper bound check *)
  3663. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3664. (* statically open range: nothing to do *)
  3665. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3666. ASSERT(staticLastIndex < staticSourceLength)
  3667. ELSIF isUnchecked THEN (* do nothing *)
  3668. ELSE
  3669. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3670. END;
  3671. (* determine length of target array for current dimension *)
  3672. (* 1. incorporate last index: *)
  3673. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3674. (* last index is static *)
  3675. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3676. targetLength := sourceLength.op
  3677. ELSE
  3678. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3679. END;
  3680. UseIntermediateOperand(targetLength);
  3681. ELSE
  3682. (* targetLength := lastIndex + 1
  3683. Reuse1(targetLength, lastIndex);
  3684. *)
  3685. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3686. END;
  3687. ReleaseOperand(sourceLength);
  3688. ReleaseIntermediateOperand(lastIndex);
  3689. (* 2. incorporate first index: *)
  3690. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3691. (* first index and current target length are static *)
  3692. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3693. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3694. (* first index = 0: nothing to do *)
  3695. ELSE
  3696. (* targetLength := targetLength - firstIndex *)
  3697. TransferToRegister(targetLength, targetLength);
  3698. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3699. END;
  3700. (* clip negative lengths to 0 *)
  3701. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3702. IF staticTargetLength < 0 THEN
  3703. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3704. END
  3705. ELSE
  3706. skipLabel1 := NewLabel();
  3707. TransferToRegister(targetLength, targetLength);
  3708. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3709. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3710. SetLabel(skipLabel1)
  3711. END;
  3712. (* 3. incorporate index step size: *)
  3713. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3714. (*step size and current target length are static *)
  3715. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3716. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3717. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3718. (* step size = 1: nothing to do *)
  3719. ELSE
  3720. (* emit code for this:
  3721. targetLength := (targetLength-1) DIV stepSize +1;
  3722. *)
  3723. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3724. DivInt(targetLength, targetLength, stepSize);
  3725. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3726. END;
  3727. (* determine increment of target array for current dimension *)
  3728. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3729. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3730. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3731. (* step size = 1 *)
  3732. targetIncrement := sourceIncrement.op;
  3733. UseIntermediateOperand(targetIncrement)
  3734. ELSE
  3735. (* targetIncrement := sourceIncrement * stepSize *)
  3736. Reuse1(targetIncrement, stepSize);
  3737. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3738. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3739. END;
  3740. ReleaseIntermediateOperand(stepSize);
  3741. (* write length and increment of target array to descriptor *)
  3742. IF destDimOffset < 0 THEN
  3743. (* determine which dimension of target array is currently looked at *)
  3744. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3745. TransferToRegister(destDim, tmp);
  3746. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3747. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3748. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3749. ReleaseIntermediateOperand(destDim);
  3750. INC(destDimOffset);
  3751. ELSE
  3752. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3753. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3754. END;
  3755. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3756. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3757. INC(indexDim);
  3758. Convert(firstIndex, addressType);
  3759. TransferToRegister(summand, firstIndex);
  3760. ELSE HALT(100);
  3761. END;
  3762. (*
  3763. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3764. *)
  3765. Convert(sourceIncrement.op, addressType);
  3766. Convert(summand, addressType);
  3767. MulInt(summand, summand, sourceIncrement.op);
  3768. ReleaseIntermediateOperand(sourceIncrement.op);
  3769. AddInt(localResult.op, localResult.op, summand);
  3770. ReleaseIntermediateOperand(summand);
  3771. END
  3772. END;
  3773. result := localResult;
  3774. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3775. ReleaseIntermediateOperand(result.tag);
  3776. result.tag := TypeDescriptorAdr(resultingType);
  3777. IF ~newObjectFile THEN
  3778. IntermediateCode.MakeMemory(result.tag,addressType);
  3779. END;
  3780. ELSIF IsDelegate(resultingType) THEN
  3781. ReleaseIntermediateOperand(result.tag);
  3782. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3783. UseIntermediateOperand(result.tag);
  3784. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3785. ReleaseIntermediateOperand(result.tag);
  3786. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3787. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3788. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3789. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3790. (* finalize target array descriptor *)
  3791. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3792. (* write lengths and increments of target array for remaining dimensions *)
  3793. i := indexListSize;
  3794. WHILE indexDim < targetArrayDimensionality DO
  3795. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3796. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3797. ReleaseOperand(sourceLength);
  3798. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3799. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3800. ReleaseOperand(sourceIncrement);
  3801. INC(i); INC(indexDim);
  3802. END;
  3803. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3804. tmp := nil;
  3805. ELSE
  3806. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3807. END;
  3808. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3809. ReleaseIntermediateOperand(tmp);
  3810. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3811. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3812. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3813. ELSE
  3814. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3815. END;
  3816. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3817. ReleaseIntermediateOperand(tmp);
  3818. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3819. (* write dimensionality *)
  3820. IF targetArrayDimensionality # 0 THEN
  3821. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3822. END;
  3823. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3824. END;
  3825. ReleaseOperand(array);
  3826. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3827. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3828. END;
  3829. END MathIndexDesignator;
  3830. (* get the length of an array , trying to make use of static information *)
  3831. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3832. VAR res: IntermediateCode.Operand; size: LONGINT;
  3833. BEGIN
  3834. type := type.resolved;
  3835. IF type IS SyntaxTree.ArrayType THEN
  3836. WITH type: SyntaxTree.ArrayType DO
  3837. IF type.form = SyntaxTree.Static THEN
  3838. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3839. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3840. Evaluate(type.length, op);
  3841. ReleaseIntermediateOperand(op.tag);
  3842. RETURN op.op;*)
  3843. ELSE
  3844. res := tag;
  3845. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3846. IntermediateCode.MakeMemory(res,addressType);
  3847. UseIntermediateOperand(res);
  3848. RETURN res
  3849. END
  3850. END;
  3851. ELSE
  3852. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3853. RETURN IntermediateCode.Immediate(addressType,size);
  3854. END;
  3855. END ArrayLength;
  3856. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  3857. BEGIN
  3858. IF IsImmediate(x) THEN
  3859. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  3860. ELSE
  3861. IF ~ReusableRegister(res) THEN
  3862. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3863. ELSE
  3864. UseIntermediateOperand(res);
  3865. END;
  3866. Emit(Mov(position,res,x))
  3867. END;
  3868. END CopyInt;
  3869. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3870. BEGIN
  3871. ReleaseIntermediateOperand(res);
  3872. IF IsImmediate(x) & IsImmediate(y) THEN
  3873. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3874. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3875. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3876. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3877. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3878. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3879. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3880. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3881. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3882. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3883. UseIntermediateOperand(res);
  3884. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3885. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3886. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3887. UseIntermediateOperand(res);
  3888. ELSE
  3889. IF ~ReusableRegister(res) THEN
  3890. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3891. ELSE
  3892. UseIntermediateOperand(res);
  3893. END;
  3894. IF IsImmediate(x) & (x.intValue = 0) THEN
  3895. Emit(Mov(position,res,y))
  3896. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3897. Emit(Mov(position,res,x))
  3898. ELSE
  3899. Emit(Add(position,res, x, y));
  3900. END;
  3901. END;
  3902. END AddInt;
  3903. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3904. BEGIN
  3905. ReleaseIntermediateOperand(res);
  3906. IF IsImmediate(x) & IsImmediate(y) THEN
  3907. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3908. ELSE
  3909. IF ~ReusableRegister(res) THEN
  3910. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3911. ELSE UseIntermediateOperand(res);
  3912. END;
  3913. IF IsImmediate(x) & (x.intValue = 1) THEN
  3914. Emit(Mov(position,res,y))
  3915. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3916. Emit(Mov(position,res,x))
  3917. ELSE
  3918. Emit(Mul(position,res, x, y));
  3919. END;
  3920. END;
  3921. END MulInt;
  3922. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3923. BEGIN
  3924. ReleaseIntermediateOperand(res);
  3925. IF IsImmediate(x) & IsImmediate(y) THEN
  3926. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3927. ELSE
  3928. IF ~ReusableRegister(res) THEN
  3929. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3930. ELSE UseIntermediateOperand(res);
  3931. END;
  3932. IF IsImmediate(x) & (x.intValue = 1) THEN
  3933. Emit(Mov(position,res,y))
  3934. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3935. Emit(Mov(position,res,x))
  3936. ELSE
  3937. Emit(Div(position,res, x, y));
  3938. END;
  3939. END;
  3940. END DivInt;
  3941. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3942. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3943. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3944. BEGIN
  3945. type := x.left.type.resolved;
  3946. IF type IS SyntaxTree.StringType THEN
  3947. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  3948. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3949. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  3950. type := atype;
  3951. x.left.SetType(type);
  3952. END;
  3953. IntermediateCode.InitImmediate(res,addressType,0);
  3954. maxDim := x.parameters.Length()-1;
  3955. (*
  3956. computation rule:
  3957. a: ARRAY X,Y,Z OF Element with size S
  3958. a[i,j,k] -->
  3959. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  3960. *)
  3961. FOR i := 0 TO maxDim DO
  3962. e := x.parameters.GetExpression(i);
  3963. Evaluate(e,index);
  3964. Convert(index.op,addressType);
  3965. AddInt(res, res, index.op);
  3966. IF i = 0 THEN
  3967. (*
  3968. ReuseCopy(res, index.op);
  3969. *)
  3970. Designate(x.left,array);
  3971. type := x.left.type.resolved;
  3972. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3973. Dereference(array, type, FALSE);
  3974. END;
  3975. (*
  3976. ELSE AddInt(res, res, index.op);
  3977. *)
  3978. END;
  3979. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3980. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3981. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3982. BoundCheck(index.op, length);
  3983. END;
  3984. ReleaseIntermediateOperand(length);
  3985. END;
  3986. ReleaseOperand(index);
  3987. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3988. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3989. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3990. MulInt(res,res,length);
  3991. END;
  3992. ReleaseIntermediateOperand(length);
  3993. END;
  3994. (* remaining open dimensions -- compute address *)
  3995. i := maxDim+1;
  3996. IF type IS SyntaxTree.ArrayType THEN
  3997. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3998. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  3999. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4000. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4001. MulInt(res,res,length);
  4002. END;
  4003. ReleaseIntermediateOperand(length);
  4004. INC(i);
  4005. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4006. END;
  4007. END;
  4008. IF (type IS SyntaxTree.ArrayType) THEN
  4009. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4010. size := StaticSize(system, type);
  4011. IF size # 1 THEN
  4012. length := IntermediateCode.Immediate(addressType,size);
  4013. MulInt(res,res,length);
  4014. END;
  4015. ELSE
  4016. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4017. IF size # 1 THEN
  4018. length := IntermediateCode.Immediate(addressType,size);
  4019. MulInt(res,res,length);
  4020. END;
  4021. END;
  4022. END;
  4023. AddInt(res,res,array.op);
  4024. InitOperand(result,ModeReference);
  4025. result.op := res;
  4026. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4027. ReleaseIntermediateOperand(result.tag);
  4028. result.tag := TypeDescriptorAdr(type);
  4029. IF ~newObjectFile THEN
  4030. IntermediateCode.MakeMemory(result.tag,addressType);
  4031. END
  4032. ELSIF IsDelegate(type) THEN
  4033. ReleaseIntermediateOperand(result.tag);
  4034. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4035. UseIntermediateOperand(result.tag);
  4036. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4037. ReleaseIntermediateOperand(result.tag);
  4038. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4039. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4040. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4041. END;
  4042. ReleaseOperand(array);
  4043. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4044. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4045. END;
  4046. END IndexDesignator;
  4047. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  4048. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4049. BEGIN
  4050. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4051. dest := destination; destination := emptyOperand;
  4052. type := x.left.type.resolved;
  4053. IF type IS SyntaxTree.MathArrayType THEN
  4054. MathIndexDesignator(x);
  4055. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4056. IndexDesignator(x);
  4057. END;
  4058. destination := dest;
  4059. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4060. END VisitIndexDesignator;
  4061. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4062. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4063. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4064. procedure: SyntaxTree.Procedure;
  4065. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4066. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4067. BEGIN
  4068. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4069. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4070. parameters := expression.parameters;
  4071. moduleName := "FoxArrayBase";
  4072. procedureName := "CopyDescriptor";
  4073. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4074. SaveRegisters();ReleaseUsedRegisters(saved);
  4075. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4076. IF procedure = NIL THEN
  4077. s := "procedure ";
  4078. Strings.Append(s,moduleName);
  4079. Strings.Append(s,".");
  4080. Strings.Append(s,procedureName);
  4081. Strings.Append(s," not present");
  4082. Error(position,s);
  4083. ELSE
  4084. (* push address of temporary variable *)
  4085. Symbol(variable,destOperand);
  4086. Emit(Push(position,destOperand.op));
  4087. ReleaseOperand(destOperand);
  4088. (* push src *)
  4089. Evaluate(expression.left,srcOperand);
  4090. (*
  4091. Dereference(srcOperand,expression.type.resolved);
  4092. Emit(Push(position,srcOperand.tag));
  4093. *)
  4094. Emit(Push(position,srcOperand.op));
  4095. ReleaseOperand(srcOperand);
  4096. tensorFound := FALSE;
  4097. FOR i := 0 TO parameters.Length()-1 DO
  4098. e := parameters.GetExpression(i);
  4099. IF e IS SyntaxTree.TensorRangeExpression THEN
  4100. tensorFound := TRUE;
  4101. ELSIF e IS SyntaxTree.RangeExpression THEN
  4102. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4103. ELSE
  4104. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4105. END;
  4106. END;
  4107. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  4108. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  4109. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  4110. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  4111. StaticCallOperand(procOp,procedure);
  4112. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4113. ReleaseOperand(procOp);
  4114. END;
  4115. RestoreRegisters(saved);
  4116. END;
  4117. RETURN variable
  4118. END PrepareTensorDescriptor;
  4119. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4120. VAR
  4121. type, descriptorType, baseType: SyntaxTree.Type;
  4122. operand, tmpOperand, variableOp, variable2Op: Operand;
  4123. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4124. variable, variable2: SyntaxTree.Variable;
  4125. dim, i, size: LONGINT;
  4126. (* TODO: needed? *)
  4127. oldArrayDestinationTag: IntermediateCode.Operand;
  4128. oldArrayDestinationDimension: LONGINT;
  4129. position: Position;
  4130. saved: RegisterEntry;
  4131. arrayFlags: SET;
  4132. m, n: LONGINT;
  4133. PROCEDURE Pass(op: IntermediateCode.Operand);
  4134. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4135. BEGIN
  4136. IF numberRegister >= 0 THEN
  4137. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  4138. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4139. Emit(Mov(position,parameterRegister, op));
  4140. ELSE
  4141. Emit(Push(position,op))
  4142. END
  4143. END Pass;
  4144. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4145. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4146. BEGIN
  4147. formalType := formalType.resolved; actualType := actualType.resolved;
  4148. IF IsOpenArray(formalType)THEN
  4149. IF actualType IS SyntaxTree.StringType THEN
  4150. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4151. RETURN;
  4152. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4153. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4154. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4155. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4156. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4157. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4158. ELSE
  4159. tmp := baseReg;
  4160. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4161. IntermediateCode.MakeMemory(tmp,addressType);
  4162. Pass((tmp));
  4163. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4164. END;
  4165. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4166. END;
  4167. END PushArrayLens;
  4168. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4169. BEGIN
  4170. CASE size OF
  4171. |2: INCL(flags,Size2Flag);
  4172. |3: INCL(flags,Size3Flag);
  4173. |4: INCL(flags,Size4Flag);
  4174. |5: INCL(flags,Size5Flag);
  4175. |6: INCL(flags,Size6Flag);
  4176. |7: INCL(flags,Size7Flag);
  4177. |8: INCL(flags,Size8Flag);
  4178. END;
  4179. END SetSmallArraySizeFlag;
  4180. BEGIN
  4181. IF Trace THEN TraceEnter("PushParameter") END;
  4182. position := expression.position;
  4183. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4184. type := expression.type.resolved;
  4185. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4186. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4187. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4188. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4189. );
  4190. (* TODO: needed? *)
  4191. oldArrayDestinationTag := arrayDestinationTag;
  4192. oldArrayDestinationDimension := arrayDestinationDimension;
  4193. IF IsArrayOfSystemByte(parameter.type) THEN
  4194. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4195. Designate(expression,operand);
  4196. ELSE
  4197. Evaluate(expression, tmpOperand);
  4198. (* array of system byte does not provide any pointers *)
  4199. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4200. Symbol(variable, operand);
  4201. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4202. Emit(Mov(position,tmp, tmpOperand.op));
  4203. ReleaseOperand(tmpOperand);
  4204. END;
  4205. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4206. ReleaseIntermediateOperand(operand.tag);
  4207. operand.tag := tmp;
  4208. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4209. Pass((operand.tag));
  4210. END;
  4211. Pass((operand.op));
  4212. ELSIF IsOpenArray(parameter.type) THEN
  4213. Designate(expression,operand);
  4214. baseReg := operand.tag;
  4215. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4216. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4217. END;
  4218. Pass((operand.op)); (* address of the array *)
  4219. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4220. (* case 1
  4221. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4222. *)
  4223. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4224. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4225. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4226. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4227. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4228. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4229. arrayDestinationTag := sp;
  4230. (* case 1b
  4231. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4232. *)
  4233. IF expression IS SyntaxTree.IndexDesignator THEN
  4234. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4235. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4236. arrayDestinationDimension := dim;
  4237. Designate(expression,operand);
  4238. (* case 1a
  4239. P(...,A,...) push: push array descriptor to stack
  4240. *)
  4241. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4242. Designate(expression,operand);
  4243. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4244. i := 0;
  4245. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4246. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4247. INC(i);
  4248. END;
  4249. type := expression.type.resolved;
  4250. WHILE (i<dim) DO (* remaining static dimensions *)
  4251. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4252. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4253. ReleaseOperand(tmpOperand);
  4254. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4255. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4256. ReleaseOperand(tmpOperand);
  4257. INC(i);
  4258. END;
  4259. dimOp := IntermediateCode.Immediate(addressType,dim);
  4260. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4261. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4262. (* case 1d
  4263. P(...,T,...) push: process left arguments, create array descriptor with given number of dimensions from T on stack
  4264. + case 1e
  4265. P(.. PT() ... );
  4266. *)
  4267. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4268. Designate(expression,operand);
  4269. Dereference(operand,type.resolved,FALSE);
  4270. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4271. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4272. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4273. (* case 1f
  4274. P(...,S,...) push: create array descriptor to S on stack
  4275. case 1g
  4276. P(... PS()...)
  4277. *)
  4278. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4279. Designate(expression,operand);
  4280. FOR i := 0 TO dim-1 DO
  4281. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4282. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4283. ReleaseOperand(tmpOperand);
  4284. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4285. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4286. ReleaseOperand(tmpOperand);
  4287. END;
  4288. (*******
  4289. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4290. *)
  4291. arrayFlags := {StaticFlag};
  4292. IF dim = 1 THEN
  4293. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4294. ReleaseOperand(tmpOperand);
  4295. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4296. m := LONGINT(tmpOperand.op.intValue);
  4297. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4298. ELSIF dim = 2 THEN
  4299. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4300. ReleaseOperand(tmpOperand);
  4301. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4302. m := LONGINT(tmpOperand.op.intValue);
  4303. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4304. ReleaseOperand(tmpOperand);
  4305. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4306. n := LONGINT(tmpOperand.op.intValue);
  4307. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4308. INCL(arrayFlags,SmallMatrixFlag);
  4309. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4310. END;
  4311. END;
  4312. (*******)
  4313. dimOp := IntermediateCode.Immediate(addressType,dim);
  4314. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4315. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4316. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4317. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4318. baseType := SemanticChecker.ArrayBase(type,dim);
  4319. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4320. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4321. ELSE HALT(100);
  4322. END;
  4323. (* case 2
  4324. procedure P([left args], var A: array [*,*] of Type, [right args])
  4325. *)
  4326. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4327. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4328. (* case 2b
  4329. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4330. push: push reference to pushed array descriptor
  4331. post: remove array descriptor.
  4332. *)
  4333. IF expression IS SyntaxTree.IndexDesignator THEN
  4334. descriptorType := GetMathArrayDescriptorType(dim);
  4335. (* range type : no allocation possible, should be untraced *)
  4336. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4337. Symbol(variable,variableOp);
  4338. arrayDestinationTag := variableOp.op;
  4339. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4340. arrayDestinationDimension := dim;
  4341. NeedDescriptor := TRUE;
  4342. Designate(expression,operand);
  4343. Pass((operand.tag));
  4344. NeedDescriptor := FALSE;
  4345. (* case 2a
  4346. P(...,A,...)
  4347. push: push reference to array descriptor on stack
  4348. *)
  4349. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4350. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4351. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4352. INC(i);
  4353. END;
  4354. IF i = dim THEN
  4355. Designate(expression,operand);
  4356. Pass((operand.tag));
  4357. ELSE (* open-static *)
  4358. type := expression.type.resolved;
  4359. descriptorType := GetMathArrayDescriptorType(dim);
  4360. (* static array , cannot be reallocated, untraced !*)
  4361. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4362. Symbol(variable,variableOp);
  4363. arrayDestinationTag := variableOp.op;
  4364. Designate(expression,operand);
  4365. FOR i := 0 TO dim-1 DO
  4366. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4367. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4368. ReleaseOperand(tmpOperand);
  4369. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4370. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4371. ReleaseOperand(tmpOperand);
  4372. END;
  4373. dimOp := IntermediateCode.Immediate(addressType,dim);
  4374. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4375. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4376. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4377. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4378. baseType := SemanticChecker.ArrayBase(type,dim);
  4379. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4380. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4381. Pass((arrayDestinationTag));
  4382. END;
  4383. (* case 2d
  4384. P(...,T,...) push: emit dimension check, push T
  4385. *)
  4386. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4387. Designate(expression,operand);
  4388. Dereference(operand,type.resolved,FALSE);
  4389. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4390. Pass((operand.tag));
  4391. (* case 2f
  4392. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4393. push: push reference to pushed array descriptor
  4394. post: remove array descriptor
  4395. *)
  4396. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4397. descriptorType := GetMathArrayDescriptorType(dim);
  4398. (* static array -- cannot be reallocatated, untraced *)
  4399. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4400. Symbol(variable,variableOp);
  4401. arrayDestinationTag := variableOp.op;
  4402. Designate(expression,operand);
  4403. FOR i := 0 TO dim-1 DO
  4404. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4405. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4406. ReleaseOperand(tmpOperand);
  4407. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4408. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4409. ReleaseOperand(tmpOperand);
  4410. END;
  4411. (*
  4412. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4413. *)
  4414. arrayFlags := {StaticFlag};
  4415. IF dim = 1 THEN
  4416. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4417. ReleaseOperand(tmpOperand);
  4418. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4419. m := LONGINT(tmpOperand.op.intValue);
  4420. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4421. ELSIF dim = 2 THEN
  4422. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4423. ReleaseOperand(tmpOperand);
  4424. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4425. m := LONGINT(tmpOperand.op.intValue);
  4426. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4427. ReleaseOperand(tmpOperand);
  4428. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4429. n := LONGINT(tmpOperand.op.intValue);
  4430. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4431. INCL(arrayFlags,SmallMatrixFlag);
  4432. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4433. END;
  4434. END;
  4435. (*******)
  4436. dimOp := IntermediateCode.Immediate(addressType,dim);
  4437. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4438. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4439. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4440. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4441. baseType := SemanticChecker.ArrayBase(type,dim);
  4442. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4443. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4444. Pass((arrayDestinationTag));
  4445. ELSE HALT(100);
  4446. END;
  4447. (* case 3
  4448. procedure P([left args], [const] A: array [?] of Type, [right args])
  4449. *)
  4450. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4451. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4452. (* case 3b
  4453. P(...,A[a..b,c..d],...)
  4454. *)
  4455. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4456. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4457. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4458. Symbol(variable,variableOp);
  4459. LoadValue(variableOp,system.addressType);
  4460. ELSE
  4461. descriptorType := GetMathArrayDescriptorType(dim);
  4462. (* range -- cannot be reallocated *)
  4463. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4464. Symbol(variable,variableOp);
  4465. END;
  4466. arrayDestinationTag := variableOp.op;
  4467. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4468. arrayDestinationDimension := 0;
  4469. Designate(expression,operand);
  4470. Pass((operand.tag));
  4471. (* case 3a
  4472. P(...,A,...)
  4473. *)
  4474. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4475. i := 0;
  4476. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4477. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4478. INC(i);
  4479. END;
  4480. IF i = dim THEN
  4481. Designate(expression,operand);
  4482. Pass((operand.tag));
  4483. ELSE (* open-static *)
  4484. type := expression.type.resolved;
  4485. descriptorType := GetMathArrayDescriptorType(dim);
  4486. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4487. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4488. Symbol(variable,variableOp);
  4489. arrayDestinationTag := variableOp.op;
  4490. Designate(expression,operand);
  4491. FOR i := 0 TO dim-1 DO
  4492. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4493. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4494. ReleaseOperand(tmpOperand);
  4495. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4496. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4497. ReleaseOperand(tmpOperand);
  4498. END;
  4499. dimOp := IntermediateCode.Immediate(addressType,dim);
  4500. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4501. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4502. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4503. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4504. baseType := SemanticChecker.ArrayBase(type,dim);
  4505. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4506. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4507. Pass((arrayDestinationTag));
  4508. END;
  4509. (* case 3d
  4510. P(...,T,...)
  4511. case 3e
  4512. P(...,PT(...),...)
  4513. *)
  4514. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4515. Designate(expression,operand);
  4516. Dereference(operand,type.resolved,FALSE);
  4517. Pass((operand.tag));
  4518. (* case 3f
  4519. P(...,S,...)
  4520. case 3g
  4521. P(...,PS(...),...)
  4522. *)
  4523. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4524. descriptorType := GetMathArrayDescriptorType(dim);
  4525. (* static array does not need to be traced *)
  4526. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4527. Symbol(variable,variableOp);
  4528. arrayDestinationTag := variableOp.op;
  4529. Designate(expression,operand);
  4530. IF operand.op.type.length >1 THEN (* vector register *)
  4531. (* static array does not need to be traced *)
  4532. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4533. Symbol(variable2, variable2Op);
  4534. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4535. Emit(Mov(position,tmp, operand.op));
  4536. ReleaseOperand(operand);
  4537. Symbol(variable2, operand);
  4538. END;
  4539. FOR i := 0 TO dim-1 DO
  4540. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4541. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4542. ReleaseOperand(tmpOperand);
  4543. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4544. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4545. ReleaseOperand(tmpOperand);
  4546. END;
  4547. dimOp := IntermediateCode.Immediate(addressType,dim);
  4548. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4549. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4550. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4551. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4552. baseType := SemanticChecker.ArrayBase(type,dim);
  4553. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4554. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4555. Pass((arrayDestinationTag));
  4556. ELSE HALT(100);
  4557. END;
  4558. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4559. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4560. (* case 4b
  4561. P(...,A[a..b,c..d],...)
  4562. *)
  4563. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4564. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4565. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4566. Symbol(variable,variableOp);
  4567. LoadValue(variableOp,system.addressType);
  4568. ELSE
  4569. descriptorType := GetMathArrayDescriptorType(dim);
  4570. (* range array -- cannot be allocated *)
  4571. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4572. Symbol(variable,variableOp);
  4573. END;
  4574. arrayDestinationTag := variableOp.op;
  4575. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4576. arrayDestinationDimension := 0;
  4577. Designate(expression,operand);
  4578. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4579. Symbol(variable,variableOp);
  4580. ELSE
  4581. (* alias to range -- untraced *)
  4582. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4583. Symbol(variable,variableOp);
  4584. MakeMemory(tmp,variableOp.op,addressType,0);
  4585. Emit(Mov(position,tmp,operand.tag));
  4586. ReleaseIntermediateOperand(tmp);
  4587. END;
  4588. Pass((variableOp.op));
  4589. ReleaseOperand(variableOp);
  4590. (* case 4a
  4591. P(...,A,...)
  4592. *)
  4593. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4594. i := 0;
  4595. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4596. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4597. INC(i);
  4598. END;
  4599. IF i = dim THEN
  4600. Designate(expression,operand);
  4601. arrayDestinationTag := operand.tag;
  4602. ELSE (* open-static *)
  4603. type := expression.type.resolved;
  4604. descriptorType := GetMathArrayDescriptorType(dim);
  4605. (* static array -- untraced *)
  4606. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4607. Symbol(variable,variableOp);
  4608. arrayDestinationTag := variableOp.op;
  4609. Designate(expression,operand);
  4610. FOR i := 0 TO dim-1 DO
  4611. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4612. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4613. ReleaseOperand(tmpOperand);
  4614. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4615. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4616. ReleaseOperand(tmpOperand);
  4617. END;
  4618. dimOp := IntermediateCode.Immediate(addressType,dim);
  4619. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4620. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4621. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4622. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4623. baseType := SemanticChecker.ArrayBase(type,dim);
  4624. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4625. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4626. END;
  4627. (* tensor alias to open array -- untraced *)
  4628. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4629. Symbol(variable,variableOp);
  4630. MakeMemory(tmp,variableOp.op,addressType,0);
  4631. Emit(Mov(position,tmp,arrayDestinationTag));
  4632. ReleaseIntermediateOperand(tmp);
  4633. Pass((variableOp.op));
  4634. ReleaseOperand(variableOp);
  4635. (* case 4d
  4636. P(...,T,...)
  4637. *)
  4638. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4639. Designate(expression,operand);
  4640. Pass((operand.op));
  4641. (* case 4f
  4642. P(...,S,...)
  4643. *)
  4644. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4645. descriptorType := GetMathArrayDescriptorType(dim);
  4646. (* static array -- cannot be reallocated, untraced *)
  4647. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4648. Symbol(variable,variableOp);
  4649. arrayDestinationTag := variableOp.op;
  4650. Designate(expression,operand);
  4651. FOR i := 0 TO dim-1 DO
  4652. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4653. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4654. ReleaseOperand(tmpOperand);
  4655. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4656. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4657. ReleaseOperand(tmpOperand);
  4658. END;
  4659. dimOp := IntermediateCode.Immediate(addressType,dim);
  4660. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4661. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4662. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4663. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4664. baseType := SemanticChecker.ArrayBase(type,dim);
  4665. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4666. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4667. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4668. Symbol(variable,variableOp);
  4669. MakeMemory(tmp,variableOp.op,addressType,0);
  4670. Emit(Mov(position,tmp,arrayDestinationTag));
  4671. ReleaseIntermediateOperand(tmp);
  4672. Pass((variableOp.op));
  4673. ReleaseOperand(variableOp);
  4674. ELSE HALT(100);
  4675. END;
  4676. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4677. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4678. Designate(expression,operand);
  4679. IF operand.op.type.length > 1 THEN
  4680. Emit(Push(position, operand.op));
  4681. ELSE
  4682. size := system.SizeOf(type);
  4683. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4684. size := ToMemoryUnits(system,size);
  4685. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4686. arrayDestinationTag := sp;
  4687. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4688. END;
  4689. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4690. Designate(expression,operand);
  4691. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4692. (* static array no pointer *)
  4693. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4694. Symbol(variable,variableOp);
  4695. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4696. Emit(Mov(position,tmp,operand.op));
  4697. Emit(Push(position,variableOp.op));
  4698. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4699. Pass((operand.op));
  4700. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4701. END;
  4702. ELSE HALT(200)
  4703. END;
  4704. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4705. IF parameter.kind = SyntaxTree.VarParameter THEN
  4706. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4707. Designate(expression, operand);
  4708. Pass((operand.op));
  4709. ELSE
  4710. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4711. Evaluate(expression, operand);
  4712. Pass((operand.extra)); (* step *)
  4713. Pass((operand.tag)); (* last *)
  4714. Pass((operand.op)) (* first *)
  4715. END
  4716. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4717. IF parameter.kind = SyntaxTree.VarParameter THEN
  4718. Designate(expression, operand);
  4719. Pass((operand.op));
  4720. ELSE
  4721. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4722. Evaluate(expression, operand);
  4723. Pass((operand.tag)); (* real part *)
  4724. Pass((operand.op)) (* imaginary part *)
  4725. END
  4726. ELSE
  4727. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4728. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4729. Designate(expression,operand);
  4730. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4731. (* stack allocation *)
  4732. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4733. (*! parameter alignment to be discussed ... *)
  4734. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4735. size := type(SyntaxTree.StringType).length;
  4736. END;
  4737. IF backend.cooperative & parameter.NeedsTrace() THEN
  4738. dst := NewRegisterOperand (addressType);
  4739. Emit(Mov(position,dst, sp));
  4740. IntermediateCode.InitImmediate(null, byteType, 0);
  4741. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4742. ReleaseIntermediateOperand(dst);
  4743. SaveRegisters();ReleaseUsedRegisters(saved);
  4744. (* register dst has been freed before SaveRegisters already *)
  4745. CallAssignMethod(dst, operand.op, parameter.type);
  4746. RestoreRegisters(saved);
  4747. END;
  4748. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4749. ELSIF IsOpenArray(parameter.type) THEN
  4750. Designate(expression,operand);
  4751. baseReg := operand.tag;
  4752. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4753. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4754. END;
  4755. Pass((operand.op)); (* address of the array *)
  4756. ELSIF IsDelegate(parameter.type) THEN
  4757. Evaluate(expression,operand);
  4758. IF backend.cooperative & parameter.NeedsTrace() THEN
  4759. Emit(Push(position, nil));
  4760. dst := NewRegisterOperand (addressType);
  4761. Emit(Mov(position,dst, sp));
  4762. ReleaseIntermediateOperand(dst);
  4763. SaveRegisters();ReleaseUsedRegisters(saved);
  4764. Emit(Push(position, dst));
  4765. (* register dst has been freed before SaveRegisters already *)
  4766. Emit(Push(position, operand.tag));
  4767. CallThis(position,"GarbageCollector","Assign",2);
  4768. RestoreRegisters(saved);
  4769. ELSE
  4770. Pass((operand.tag));
  4771. END;
  4772. Pass((operand.op));
  4773. ELSE
  4774. Evaluate(expression,operand);
  4775. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4776. Emit(Push(position, nil));
  4777. dst := NewRegisterOperand (addressType);
  4778. Emit(Mov(position,dst, sp));
  4779. ReleaseIntermediateOperand(dst);
  4780. SaveRegisters();ReleaseUsedRegisters(saved);
  4781. Emit(Push(position, dst));
  4782. (* register dst has been freed before SaveRegisters already *)
  4783. Emit(Push(position, operand.op));
  4784. CallThis(position,"GarbageCollector","Assign",2);
  4785. RestoreRegisters(saved);
  4786. ELSE
  4787. Pass((operand.op));
  4788. END;
  4789. END;
  4790. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4791. Evaluate(expression,operand);
  4792. Pass((operand.op));
  4793. ELSE (* var parameter *)
  4794. Designate(expression,operand);
  4795. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4796. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4797. Pass((operand.tag));
  4798. END;
  4799. END;
  4800. Pass((operand.op));
  4801. END;
  4802. END;
  4803. (* TODO: needed? *)
  4804. arrayDestinationTag := oldArrayDestinationTag;
  4805. arrayDestinationDimension := oldArrayDestinationDimension;
  4806. IF needsParameterBackup THEN
  4807. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4808. ReuseCopy(parameterBackup, operand.op)
  4809. END;
  4810. ReleaseOperand(operand);
  4811. IF Trace THEN TraceExit("PushParameter") END;
  4812. END PushParameter;
  4813. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4814. VAR prevConditional: BOOLEAN;
  4815. BEGIN
  4816. prevConditional := conditional;
  4817. conditional := FALSE;
  4818. 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
  4819. Expression(x.result); (* use register *)
  4820. END;
  4821. Statement(x.statement);
  4822. conditional := prevConditional;
  4823. IF x.result # NIL THEN Expression(x.result) END;
  4824. 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
  4825. ReleaseIntermediateOperand(result.op);
  4826. END;
  4827. END VisitStatementDesignator;
  4828. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4829. VAR
  4830. procedure: SyntaxTree.Procedure;
  4831. procedureType: SyntaxTree.ProcedureType;
  4832. wasInline: BOOLEAN;
  4833. actualParameters: SyntaxTree.ExpressionList;
  4834. formalParameter: SyntaxTree.Parameter;
  4835. actualParameter: SyntaxTree.Expression;
  4836. i: LONGINT;
  4837. localVariable: SyntaxTree.Variable;
  4838. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4839. src, dest: Operand;
  4840. prevInlineExit : Label;
  4841. prevMapper: SymbolMapper;
  4842. tooComplex: BOOLEAN;
  4843. resultDesignator: SyntaxTree.Expression;
  4844. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4845. BEGIN
  4846. IF e = NIL THEN RETURN TRUE
  4847. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4848. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4849. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4850. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4851. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4852. ELSE RETURN FALSE
  4853. END;
  4854. END SimpleExpression;
  4855. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4856. BEGIN
  4857. RETURN checker.CanPassInRegister(type)
  4858. END FitsInRegister;
  4859. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4860. VAR
  4861. variable: SyntaxTree.Variable;
  4862. variableDesignator: SyntaxTree.Designator;
  4863. BEGIN
  4864. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  4865. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  4866. variableDesignator.SetType(type);
  4867. RETURN variableDesignator
  4868. END GetTemp;
  4869. BEGIN
  4870. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4871. wasInline := currentIsInline;
  4872. prevInlineExit := currentInlineExit;
  4873. prevMapper := currentMapper;
  4874. currentInlineExit := NewLabel();
  4875. tooComplex := FALSE;
  4876. NEW(currentMapper);
  4877. currentIsInline := TRUE;
  4878. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4879. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4880. formalParameter := procedureType.firstParameter;
  4881. actualParameters := x.parameters;
  4882. i := 0;
  4883. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4884. actualParameter := actualParameters.GetExpression(i);
  4885. IF actualParameter.resolved # NIL THEN
  4886. actualParameter := actualParameter.resolved
  4887. END;
  4888. (*
  4889. if expression is simple and can be passed immediately
  4890. or if type fits in register then we can proceed
  4891. otherwise we escape to ordinary procedure call.
  4892. *)
  4893. (* cases where the expression can be mapped identically *)
  4894. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4895. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  4896. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4897. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4898. (*
  4899. Assign(variableDesignator, actualParameter);
  4900. *)
  4901. Evaluate(actualParameter, src);
  4902. Designate(variableDesignator, dest);
  4903. Emit(Mov(x.position, dest.op, src.op));
  4904. ReleaseOperand(dest);
  4905. ReleaseOperand(src);
  4906. (* the src operand should now have been completely released ! *)
  4907. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  4908. ELSE tooComplex := TRUE
  4909. END;
  4910. (*
  4911. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4912. currentMapper.Add(formalParameter, actualParameter, NIL);
  4913. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4914. variableDesignator := GetTemp(system.addressType, FALSE);
  4915. Designate(actualParameter, src);
  4916. Designate(variableDesignator, dest);
  4917. IntermediateCode.MakeMemory(dest.op,addressType);
  4918. Emit(Mov(x.position, dest.op, src.op));
  4919. ReleaseOperand(dest);
  4920. IF src.tag.mode # IntermediateCode.Undefined THEN
  4921. tagDesignator := GetTemp(system.addressType, FALSE);
  4922. Designate(tagDesignator, dest);
  4923. IntermediateCode.MakeMemory(dest.op,addressType);
  4924. Emit(Mov(x.position, dest.op, src.op));
  4925. END;
  4926. ReleaseOperand(dest); ReleaseOperand(src);
  4927. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4928. END;
  4929. *)
  4930. formalParameter := formalParameter.nextParameter;
  4931. INC(i);
  4932. END;
  4933. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4934. IF resultDesignator # NIL THEN
  4935. returnDesignator := resultDesignator
  4936. ELSE
  4937. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4938. END;
  4939. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  4940. END;
  4941. localVariable := procedure.procedureScope.firstVariable;
  4942. WHILE ~tooComplex & (localVariable # NIL) DO
  4943. variableDesignator := GetTemp(localVariable.type, FALSE);
  4944. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  4945. localVariable := localVariable.nextVariable;
  4946. END;
  4947. IF ~tooComplex THEN
  4948. VisitStatementBlock(procedure.procedureScope.body);
  4949. SetLabel(currentInlineExit);
  4950. IF procedureType.returnType # NIL THEN
  4951. Designate(returnDesignator, result);
  4952. IF conditional THEN
  4953. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4954. ValueToCondition(result)
  4955. END;
  4956. END;
  4957. END;
  4958. currentMapper := prevMapper;
  4959. currentInlineExit := prevInlineExit;
  4960. currentIsInline := wasInline;
  4961. RETURN ~tooComplex
  4962. END InlineProcedureCall;
  4963. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4964. VAR
  4965. parameters: SyntaxTree.ExpressionList;
  4966. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4967. designator: SyntaxTree.Designator;
  4968. procedureType: SyntaxTree.ProcedureType;
  4969. formalParameter: SyntaxTree.Parameter;
  4970. operand, returnValue: Operand;
  4971. reg, size, mask, dest: IntermediateCode.Operand;
  4972. saved,saved2: RegisterEntry;
  4973. symbol: SyntaxTree.Symbol;
  4974. variable: SyntaxTree.Variable;
  4975. i, parametersSize, returnTypeSize : LONGINT;
  4976. structuredReturnType: BOOLEAN;
  4977. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4978. tempVariableDesignator: SyntaxTree.Designator;
  4979. gap, alignment: LONGINT; (*fld*)
  4980. (* TODO: remove unnecessary backup variables *)
  4981. oldResult: Operand;
  4982. oldCurrentScope: SyntaxTree.Scope;
  4983. oldArrayDestinationTag: IntermediateCode.Operand;
  4984. oldArrayDestinationDimension: LONGINT;
  4985. oldConstantDeclaration: SyntaxTree.Symbol;
  4986. oldDestination: IntermediateCode.Operand;
  4987. oldCurrentLoop: Label;
  4988. oldConditional: BOOLEAN;
  4989. oldTrueLabel, oldFalseLabel: Label;
  4990. oldLocked: BOOLEAN;
  4991. usedRegisters,oldUsedRegisters: RegisterEntry;
  4992. return: IntermediateCode.Operand;
  4993. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4994. arg: IntermediateCode.Operand;
  4995. dummy: IntermediateCode.Operand;
  4996. recordType: SyntaxTree.RecordType;
  4997. operatorSelectionProcedureOperand: Operand;
  4998. operatorSelectionProcedure: SyntaxTree.Procedure;
  4999. fingerPrint: SyntaxTree.FingerPrint;
  5000. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5001. identifierNumber: LONGINT;
  5002. parameterRegister: Backend.Registers;
  5003. parameterRegisters: LONGINT;
  5004. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5005. procedure: SyntaxTree.Procedure;
  5006. PROCEDURE BackupGlobalState;
  5007. BEGIN
  5008. oldResult := result;
  5009. oldCurrentScope := currentScope;
  5010. oldArrayDestinationTag := arrayDestinationTag;
  5011. oldArrayDestinationDimension := arrayDestinationDimension;
  5012. oldConstantDeclaration := constantDeclaration;
  5013. oldDestination := destination;
  5014. oldCurrentLoop := currentLoop;
  5015. oldConditional := conditional;
  5016. oldTrueLabel := trueLabel;
  5017. oldFalseLabel := falseLabel;
  5018. oldLocked := locked;
  5019. oldUsedRegisters := usedRegisters
  5020. END BackupGlobalState;
  5021. PROCEDURE RestoreGlobalState;
  5022. BEGIN
  5023. result := oldResult;
  5024. currentScope := oldCurrentScope;
  5025. arrayDestinationTag := oldArrayDestinationTag;
  5026. arrayDestinationDimension := oldArrayDestinationDimension;
  5027. constantDeclaration := oldConstantDeclaration;
  5028. destination := oldDestination;
  5029. currentLoop := oldCurrentLoop;
  5030. conditional := oldConditional;
  5031. trueLabel := oldTrueLabel;
  5032. falseLabel := oldFalseLabel;
  5033. locked := oldLocked;
  5034. usedRegisters := oldUsedRegisters
  5035. END RestoreGlobalState;
  5036. (** do preparations before parameter push for array-structured object types (ASOTs):
  5037. if ASOT is passed as VAR parameter:
  5038. - allocate temporary variable of math array type
  5039. - copy contents of ASOT to be passed to temporary variable
  5040. - use temporary variable as the actual parameter instead
  5041. - 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)
  5042. **)
  5043. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5044. VAR
  5045. expression: SyntaxTree.Expression;
  5046. BEGIN
  5047. IF actualParameter IS SyntaxTree.Designator THEN
  5048. designator := actualParameter(SyntaxTree.Designator);
  5049. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5050. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5051. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5052. ASSERT(checker # NIL);
  5053. checker.SetCurrentScope(currentScope);
  5054. (* allocate temporary variable *)
  5055. ASSERT(actualParameter.type # NIL);
  5056. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5057. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5058. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5059. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5060. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5061. ASSERT(tempVariableDesignator.type # NIL);
  5062. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5063. (* copy math array stored in actual parameter to temporary variable *)
  5064. BackupGlobalState;
  5065. AssignMathArray(tempVariableDesignator, actualParameter);
  5066. RestoreGlobalState;
  5067. (* use temporary variable as actual parameter instead of the original one *)
  5068. actualParameter := tempVariableDesignator;
  5069. (* create write-back call and store it in linked list *)
  5070. (* create new list entry *)
  5071. IF firstWriteBackCall = NIL THEN
  5072. NEW(firstWriteBackCall);
  5073. currentWriteBackCall := firstWriteBackCall
  5074. ELSE
  5075. ASSERT(currentWriteBackCall # NIL);
  5076. NEW(currentWriteBackCall.next);
  5077. currentWriteBackCall := currentWriteBackCall.next
  5078. END;
  5079. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5080. ASSERT(expression.type = NIL);
  5081. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5082. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5083. (* prepare writeback for any other "normal" indexer *)
  5084. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5085. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5086. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5087. Assign(tempVariableDesignator, actualParameter);
  5088. actualParameter := tempVariableDesignator;
  5089. IF firstWriteBackCall = NIL THEN
  5090. NEW(firstWriteBackCall);
  5091. currentWriteBackCall := firstWriteBackCall
  5092. ELSE
  5093. ASSERT(currentWriteBackCall # NIL);
  5094. NEW(currentWriteBackCall.next);
  5095. currentWriteBackCall := currentWriteBackCall.next
  5096. END;
  5097. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5098. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5099. END
  5100. END
  5101. END PrepareParameter;
  5102. BEGIN
  5103. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5104. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5105. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5106. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5107. IF InlineProcedureCall(x) THEN
  5108. RETURN
  5109. ELSE
  5110. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5111. END
  5112. END;
  5113. END;
  5114. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5115. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5116. dest := destination; destination := emptyOperand;
  5117. SaveRegisters();ReleaseUsedRegisters(saved);
  5118. parameters := x.parameters;
  5119. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5120. (* an operator is called *)
  5121. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5122. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  5123. (* check if a dynamic operator call should be performed *)
  5124. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5125. ELSE
  5126. isCallOfDynamicOperator := FALSE
  5127. END;
  5128. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5129. Emit(Push(position, ap));
  5130. END;
  5131. alignment := procedureType.stackAlignment;
  5132. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize = 64) THEN
  5133. alignment := 16 (* bytes *);
  5134. END;
  5135. IF alignment > 1 THEN
  5136. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5137. Emit(Mov(position,reg, sp));
  5138. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  5139. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5140. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5141. Emit(And(position,sp, sp, mask));
  5142. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5143. Emit(Push(position,reg));
  5144. (*
  5145. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  5146. Emit(Mov(position,mem,reg));
  5147. *)
  5148. ReleaseIntermediateOperand(reg);
  5149. END;
  5150. IF SysvABI(procedureType.callingConvention) & (system.addressSize = 32) THEN
  5151. (* align stack to 16-byte boundary *)
  5152. IntermediateCode.InitImmediate(mask,addressType,-16);
  5153. Emit(And(position,sp, sp, mask));
  5154. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5155. IF gap # 0 THEN
  5156. IntermediateCode.InitImmediate(size,addressType,gap);
  5157. Emit(Sub(position,sp,sp,size))
  5158. END;
  5159. END;
  5160. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5161. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5162. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5163. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5164. ELSE
  5165. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5166. END;
  5167. Evaluate(x.left, operand);
  5168. IF symbol IS SyntaxTree.Procedure THEN
  5169. IF (procedureType.selfParameter # NIL) THEN
  5170. Emit(Push(position,operand.tag));
  5171. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5172. Emit(Push(position,operand.tag));
  5173. ELSIF (procedureType.isDelegate) THEN
  5174. Emit(Push(position,operand.tag));
  5175. END;
  5176. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5177. IF (procedureType.selfParameter # NIL) THEN
  5178. Emit(Push(position,operand.tag));
  5179. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5180. Emit(Push(position,operand.tag));
  5181. END;
  5182. ELSE HALT(200);
  5183. END;
  5184. ReleaseIntermediateOperand(operand.tag);
  5185. operand.tag := emptyOperand;
  5186. (* determine if a structured return type is needed *)
  5187. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5188. IF structuredReturnType THEN
  5189. IF resultDesignator # NIL THEN
  5190. d := resultDesignator;
  5191. ELSE
  5192. (* temporary result that might be allocated, must potentially be traced *)
  5193. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5194. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5195. d.SetType(variable.type);
  5196. END;
  5197. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5198. Designate(d,returnValue);
  5199. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5200. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5201. Emit(Push(position,size));
  5202. Emit(Push(position,returnValue.op));
  5203. ReleaseOperand(returnValue);
  5204. ELSE*)
  5205. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5206. (*
  5207. END;
  5208. *)
  5209. END;
  5210. firstWriteBackCall := NIL; (* reset write-back call list *)
  5211. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5212. parameterRegister := backend.GetParameterRegisters(procedureType.callingConvention);
  5213. IF parameterRegister = NIL THEN parameterRegisters := 0
  5214. ELSE parameterRegisters := LEN(parameterRegister)
  5215. END;
  5216. passByRegister := parameterRegisters > 0;
  5217. registerNumber := 0;
  5218. formalParameter := procedureType.lastParameter;
  5219. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5220. actualParameter := parameters.GetExpression(i);
  5221. PrepareParameter(actualParameter, formalParameter);
  5222. IF passByRegister & (i < parameterRegisters) THEN
  5223. IF ~PassInRegister(formalParameter) THEN
  5224. Error(actualParameter.position,"cannot be passed by register")
  5225. ELSE
  5226. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,parameterRegister[i]);
  5227. END;
  5228. INC(registerNumber);
  5229. ELSE
  5230. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5231. END;
  5232. formalParameter := formalParameter.prevParameter;
  5233. END;
  5234. IF passByRegister (* & (registerNumber > 0)*) & ~SysvABI(procedureType.callingConvention) THEN
  5235. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5236. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5237. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5238. END;
  5239. ELSE
  5240. hasDynamicOperands := FALSE;
  5241. formalParameter := procedureType.firstParameter;
  5242. FOR i := 0 TO parameters.Length() - 1 DO
  5243. actualParameter := parameters.GetExpression(i);
  5244. IF formalParameter # NIL THEN (* TENTATIVE *)
  5245. PrepareParameter(actualParameter, formalParameter);
  5246. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5247. ASSERT(i < 2);
  5248. hasDynamicOperands := TRUE;
  5249. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5250. ELSE
  5251. IF passByRegister & (registerNumber > 0) THEN
  5252. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5253. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5254. END;
  5255. passByRegister := FALSE;
  5256. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5257. END;
  5258. formalParameter := formalParameter.nextParameter;
  5259. END;
  5260. END;
  5261. END;
  5262. IF symbol IS SyntaxTree.Procedure THEN
  5263. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5264. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5265. Emit(Push(position,reg));
  5266. ReleaseIntermediateOperand(reg);
  5267. END;
  5268. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5269. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5270. parametersSize := ParametersSize(system,procedureType,FALSE);
  5271. END;
  5272. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5273. (*
  5274. dynamic operator overloading:
  5275. first push parameters, regularly:
  5276. [self]
  5277. par1
  5278. par2
  5279. then push parameters for GetOperator
  5280. identifier
  5281. ptr1
  5282. tag
  5283. ptr2
  5284. tag
  5285. call GetOperatorRuntimeProc
  5286. call Operator
  5287. *)
  5288. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5289. (* push ID *)
  5290. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5291. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5292. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5293. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5294. formalParameter := procedureType.firstParameter;
  5295. FOR i := 0 TO parameters.Length() - 1 DO
  5296. IF formalParameter.access # SyntaxTree.Hidden THEN
  5297. ASSERT(i < 2);
  5298. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5299. (* push pointer *)
  5300. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5301. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5302. (* add dereference *)
  5303. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5304. (*! better: do refer to stack above than using parameter backups !!*)
  5305. ReleaseIntermediateOperand(parameterBackups[i]);
  5306. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5307. END;
  5308. Emit(Push(position,parameterBackups[i]));
  5309. ReleaseIntermediateOperand(parameterBackups[i]);
  5310. (* push typetag *)
  5311. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5312. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5313. arg := TypeDescriptorAdr(recordType);
  5314. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5315. Emit(Push(position,arg));
  5316. ELSE
  5317. (* push 'NonPointer' *)
  5318. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5319. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5320. (* push fingerprint *)
  5321. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5322. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5323. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5324. END
  5325. END;
  5326. formalParameter := formalParameter.nextParameter
  5327. END;
  5328. (* for unary operators: complete the information for the second parameter *)
  5329. IF procedureType.numberParameters < 2 THEN
  5330. (* push 'NonPointer' *)
  5331. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5332. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5333. (* push 'NoType' *)
  5334. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5335. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5336. END;
  5337. (* call operator selection procedure *)
  5338. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5339. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5340. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5341. ReleaseOperand(operatorSelectionProcedureOperand);
  5342. (* use the address that the operator selection procedure returned as the target address of the call *)
  5343. InitOperand(operand, ModeValue);
  5344. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5345. Emit(Result(position,operand.op))
  5346. END
  5347. END;
  5348. ReleaseParameterRegisters();
  5349. IF backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5350. SaveRegisters();ReleaseUsedRegisters(saved2);
  5351. CallThis(position,"Objects","LeaveA2",0);
  5352. RestoreRegisters(saved2);
  5353. END;
  5354. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR SysvABI(procedureType.callingConvention) THEN
  5355. Emit(Call(position,operand.op,0));
  5356. ELSE
  5357. Emit(Call(position,operand.op,parametersSize));
  5358. END;
  5359. ReleaseOperand(operand);
  5360. IF procedureType.noReturn THEN
  5361. EmitTrap(position,NoReturnTrap);
  5362. END;
  5363. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5364. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5365. Emit(Result(position,return));
  5366. END;
  5367. IF backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5368. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5369. Emit(Push(position, return));
  5370. CallThis(position,"Objects","ReenterA2",0);
  5371. Emit(Pop(position, return));
  5372. ELSE
  5373. CallThis(position,"Objects","ReenterA2",0);
  5374. END;
  5375. END;
  5376. (* === return parameter space === *)
  5377. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5378. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5379. (* cleanup all space for all parameters *)
  5380. IF parametersSize < 32 THEN
  5381. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5382. parametersSize := 32
  5383. END;
  5384. size := IntermediateCode.Immediate(addressType,parametersSize);
  5385. Emit(Add(position,sp,sp,size))
  5386. END;
  5387. IF SysvABI(procedureType.callingConvention) THEN
  5388. IF passByRegister THEN
  5389. IF parameters.Length() > parameterRegisters THEN
  5390. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5391. ELSE
  5392. parametersSize := 0
  5393. END;
  5394. ELSE
  5395. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5396. INC( parametersSize, (-parametersSize) MOD 16 )
  5397. END;
  5398. IF parametersSize > 0 THEN
  5399. size := IntermediateCode.Immediate(addressType,parametersSize);
  5400. Emit(Add(position,sp,sp,size))
  5401. END;
  5402. END;
  5403. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5404. IF structuredReturnType THEN
  5405. (* stack pointer rewinding done by callee
  5406. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5407. Emit(Add(position,sp,sp,size));
  5408. *)
  5409. RestoreRegisters(saved);
  5410. InitOperand(result,ModeReference);
  5411. Symbol(variable,result);
  5412. ELSE
  5413. RestoreRegisters(saved);
  5414. InitOperand(result,ModeValue);
  5415. result.op := return;
  5416. END;
  5417. END;
  5418. IF alignment > 1 THEN
  5419. Emit(Pop(position,sp));
  5420. END;
  5421. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5422. Emit(Pop(position, ap));
  5423. END;
  5424. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5425. ValueToCondition(result);
  5426. END;
  5427. destination := dest;
  5428. (* perform all write-back calls in the list *)
  5429. BackupGlobalState;
  5430. currentWriteBackCall := firstWriteBackCall;
  5431. WHILE currentWriteBackCall # NIL DO
  5432. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5433. currentWriteBackCall := currentWriteBackCall.next
  5434. END;
  5435. RestoreGlobalState;
  5436. (* TENATIVE *)
  5437. (*
  5438. IF isOperatorCall THEN
  5439. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5440. END;
  5441. *)
  5442. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5443. END VisitProcedureCallDesignator;
  5444. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5445. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5446. td: SyntaxTree.Symbol;
  5447. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5448. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5449. BEGIN
  5450. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5451. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5452. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5453. variable.SetType(system.anyType);
  5454. scope.AddVariable(variable);
  5455. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5456. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5457. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5458. typeDeclaration.SetScope(module.module.moduleScope);
  5459. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5460. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5461. END;
  5462. RETURN hiddenPointerType;
  5463. END GetHiddenPointerType;
  5464. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5465. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5466. BEGIN
  5467. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5468. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5469. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5470. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5471. scope.AddVariable(variable);
  5472. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5473. variable.SetType(system.anyType);
  5474. scope.AddVariable(variable);
  5475. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5476. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5477. typeDeclaration.SetDeclaredType(delegatePointerType);
  5478. typeDeclaration.SetScope(module.module.moduleScope);
  5479. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5480. delegatePointerType.SetState(SyntaxTree.Resolved);
  5481. END;
  5482. RETURN delegatePointerType
  5483. END GetDelegateType;
  5484. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5485. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5486. such as in VAR a: RECORD ... END;
  5487. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5488. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5489. *)
  5490. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5491. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5492. BEGIN (* no code emission *)
  5493. source := NIL;
  5494. x := x.resolved;
  5495. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5496. x := GetHiddenPointerType();
  5497. ELSIF IsDelegate(x) THEN
  5498. x := GetDelegateType();
  5499. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5500. ELSE HALT(200);
  5501. END;
  5502. td := x.typeDeclaration;
  5503. IF td = NIL THEN
  5504. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5505. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5506. ASSERT(td # NIL);
  5507. END;
  5508. IF newObjectFile THEN
  5509. GetCodeSectionNameForSymbol(td,name);
  5510. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5511. meta.CheckTypeDeclaration(x);
  5512. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5513. ELSE
  5514. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5515. END;
  5516. IF backend.cooperative OR meta.simple THEN
  5517. offset := 0;
  5518. ELSE
  5519. IF x IS SyntaxTree.CellType THEN
  5520. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5521. IF baseRecord = NIL THEN
  5522. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5523. ELSE
  5524. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5525. END;
  5526. ELSE
  5527. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5528. END;
  5529. END;
  5530. ELSE
  5531. offset := 0;
  5532. source := module.allSections.FindBySymbol(td); (*TODO*)
  5533. IF source = NIL THEN
  5534. null := 0;
  5535. GetCodeSectionNameForSymbol(td,name);
  5536. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5537. Basic.SuffixSegmentedName (name, module.module.name);
  5538. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5539. IntermediateCode.InitImmediate(op,addressType,0);
  5540. source(IntermediateCode.Section).Emit(Data(position,op));
  5541. source.SetReferenced(FALSE)
  5542. ELSE
  5543. name := source.name;
  5544. END;
  5545. END;
  5546. RETURN td
  5547. END GetBackendType;
  5548. BEGIN
  5549. (*td := t.typeDeclaration;*)
  5550. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5551. (*
  5552. IF t IS SyntaxTree.PointerType THEN
  5553. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5554. ELSE
  5555. source := GetBackendType(t);
  5556. END;
  5557. *)
  5558. IF newObjectFile THEN
  5559. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5560. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5561. IntermediateCode.SetOffset(res,offset);
  5562. ELSE
  5563. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5564. END;
  5565. (*
  5566. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5567. make memory should be used when tag is used, not earlier
  5568. *)
  5569. RETURN res
  5570. END TypeDescriptorAdr;
  5571. (*
  5572. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5573. VAR result: IntermediateCode.Operand;
  5574. BEGIN
  5575. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5576. operand.tag := TypeDescriptorAdr(operand.type);
  5577. IntermediateCode.MakeMemory(operand.tag,addressType);
  5578. UseIntermediateOperand(operand.tag);
  5579. END;
  5580. END MakeTypeTag;
  5581. *)
  5582. PROCEDURE ProfilerInit;
  5583. VAR reg: IntermediateCode.Operand;
  5584. BEGIN
  5585. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5586. Emit(Call(position,reg,0));
  5587. END ProfilerInit;
  5588. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5589. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5590. BEGIN
  5591. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5592. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5593. THEN
  5594. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5595. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5596. Emit(Push(position,reg));
  5597. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5598. Emit(Push(position,reg));
  5599. StaticCallOperand(result,procedure);
  5600. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5601. ReleaseOperand(result);
  5602. END;
  5603. END ProfilerEnterExit;
  5604. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5605. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5606. BEGIN
  5607. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5608. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5609. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5610. profileInit.Emit(Push(position,reg));
  5611. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5612. profileInit.Emit(Push(position,reg));
  5613. NEW(string, LEN(name)); COPY(name, string^);
  5614. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5615. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5616. sv.SetType(type);
  5617. Designate(sv,result);
  5618. profileInit.Emit(Push(position,result.tag));
  5619. profileInit.Emit(Push(position,result.op));
  5620. StaticCallOperand(result,procedure);
  5621. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5622. ReleaseOperand(result);
  5623. END;
  5624. END ProfilerAddProcedure;
  5625. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5626. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5627. BEGIN
  5628. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5629. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5630. profileInit.Emit(Push(position,reg));
  5631. profileInitPatchPosition := profileInit.pc;
  5632. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5633. NEW(string, LEN(name)); COPY(name, string^);
  5634. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5635. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5636. sv.SetType(type);
  5637. Designate(sv,result);
  5638. profileInit.Emit(Push(position,result.tag));
  5639. profileInit.Emit(Push(position,result.op));
  5640. StaticCallOperand(result,procedure);
  5641. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5642. ReleaseOperand(result);
  5643. END;
  5644. END ProfilerAddModule;
  5645. PROCEDURE ProfilerPatchInit;
  5646. VAR reg: IntermediateCode.Operand;
  5647. BEGIN
  5648. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5649. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5650. EmitLeave(profileInit,position,NIL,0);
  5651. profileInit.Emit(Exit(position,0,0,0));
  5652. END ProfilerPatchInit;
  5653. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5654. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5655. VAR
  5656. id: LONGINT;
  5657. leftType, rightType: SyntaxTree.Type;
  5658. procedureType: SyntaxTree.ProcedureType;
  5659. runtimeProcedure: SyntaxTree.Procedure;
  5660. runtimeProcedureOperand, operatorOperand: Operand;
  5661. kind: SET;
  5662. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5663. VAR
  5664. arg: IntermediateCode.Operand;
  5665. recordType: SyntaxTree.RecordType;
  5666. fingerPrint: SyntaxTree.FingerPrint;
  5667. BEGIN
  5668. IF type = NIL THEN
  5669. (* no type: push 'NoType' *)
  5670. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5671. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5672. ELSIF IsStrictlyPointerToRecord(type) THEN
  5673. (* pointer to record type: push typetag *)
  5674. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5675. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5676. arg := TypeDescriptorAdr(recordType);
  5677. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5678. ELSE
  5679. (* non-pointer to record type: push fingerprint *)
  5680. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5681. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5682. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5683. END;
  5684. operatorInitializationCodeSection.Emit(Push(position,arg))
  5685. END PushTypeInfo;
  5686. BEGIN
  5687. ASSERT(operatorInitializationCodeSection # NIL);
  5688. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5689. procedureType := operator.type(SyntaxTree.ProcedureType);
  5690. (* determine types *)
  5691. leftType := procedureType.firstParameter.type;
  5692. IF procedureType.numberParameters = 2 THEN
  5693. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5694. rightType := procedureType.firstParameter.nextParameter.type;
  5695. ELSE
  5696. rightType := NIL
  5697. END;
  5698. (* determine operator kind *)
  5699. IF IsStrictlyPointerToRecord(leftType) THEN
  5700. kind := {LhsIsPointer}
  5701. ELSE
  5702. kind := {}
  5703. END;
  5704. IF IsStrictlyPointerToRecord(rightType) THEN
  5705. kind := kind + {RhsIsPointer}
  5706. END;
  5707. IF kind # {} THEN (* TODO: to be removed later on *)
  5708. (* at least one of the types is a pointer to record *)
  5709. (* emit a code that registers this specific operator in the runtime *)
  5710. dump := operatorInitializationCodeSection.comments;
  5711. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5712. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5713. (* push ID *)
  5714. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5715. id := Global.GetSymbol(module.module.case, operator.name);
  5716. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5717. (* push kind *)
  5718. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5719. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5720. (* push type infos *)
  5721. PushTypeInfo(leftType);
  5722. PushTypeInfo(rightType);
  5723. (* push operator address *)
  5724. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5725. StaticCallOperand(operatorOperand, operator);
  5726. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5727. ReleaseOperand(operatorOperand);
  5728. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5729. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5730. ReleaseOperand(runtimeProcedureOperand)
  5731. END
  5732. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5733. END
  5734. END RegisterDynamicOperator;
  5735. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5736. VAR
  5737. traceModule: SyntaxTree.Module;
  5738. procedure: SyntaxTree.Procedure;
  5739. procedureVariable: SyntaxTree.Variable;
  5740. s,msg: Basic.MessageString;
  5741. res: Operand;
  5742. i: LONGINT;
  5743. sv: SyntaxTree.StringValue;
  5744. type: SyntaxTree.Type;
  5745. recordType: SyntaxTree.RecordType;
  5746. printout: Printout.Printer;
  5747. stringWriter: Streams.StringWriter;
  5748. expression: SyntaxTree.Expression;
  5749. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5750. BEGIN
  5751. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5752. IF procedure = NIL THEN
  5753. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5754. END;
  5755. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5756. s := "procedure ";
  5757. Strings.Append(s,backend.traceModuleName);
  5758. Strings.Append(s,".");
  5759. Strings.Append(s,procedureName);
  5760. Strings.Append(s," not present");
  5761. Error(position,s);
  5762. RETURN FALSE
  5763. ELSE
  5764. RETURN TRUE
  5765. END;
  5766. END GetProcedure;
  5767. PROCEDURE CallProcedure;
  5768. VAR size: LONGINT;
  5769. BEGIN
  5770. IF procedure # NIL THEN
  5771. StaticCallOperand(result,procedure);
  5772. size := ProcedureParametersSize(system,procedure);
  5773. ELSE
  5774. Symbol(procedureVariable, result);
  5775. LoadValue(result, procedureVariable.type.resolved);
  5776. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5777. END;
  5778. Emit(Call(position,result.op,size));
  5779. END CallProcedure;
  5780. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5781. VAR res: Operand; string: SyntaxTree.String;
  5782. BEGIN
  5783. IF GetProcedure("String") THEN
  5784. NEW(string, LEN(s)); COPY(s, string^);
  5785. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5786. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5787. sv.SetType(type);
  5788. Designate(sv,res);
  5789. Emit(Push(position,res.tag));
  5790. Emit(Push(position,res.op));
  5791. ReleaseOperand(res);
  5792. CallProcedure;
  5793. END;
  5794. END String;
  5795. PROCEDURE Integer(op: IntermediateCode.Operand);
  5796. BEGIN
  5797. IF GetProcedure("Int") THEN
  5798. Emit(Push(position,op));
  5799. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5800. CallProcedure;
  5801. END;
  5802. END Integer;
  5803. PROCEDURE Float(op: IntermediateCode.Operand);
  5804. BEGIN
  5805. IF GetProcedure("HIntHex") THEN
  5806. Emit(Push(position,op));
  5807. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5808. CallProcedure;
  5809. END;
  5810. END Float;
  5811. PROCEDURE Set(op: IntermediateCode.Operand);
  5812. BEGIN
  5813. IF GetProcedure("Set") THEN
  5814. Emit(Push(position,op));
  5815. (*
  5816. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5817. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5818. *)
  5819. CallProcedure;
  5820. END;
  5821. END Set;
  5822. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5823. BEGIN
  5824. IF GetProcedure("Boolean") THEN
  5825. Emit(Push(position,op));
  5826. CallProcedure;
  5827. END;
  5828. END Boolean;
  5829. PROCEDURE Char(op: IntermediateCode.Operand);
  5830. BEGIN
  5831. IF GetProcedure("Char") THEN
  5832. Emit(Push(position,op));
  5833. CallProcedure;
  5834. END;
  5835. END Char;
  5836. PROCEDURE Address(op: IntermediateCode.Operand);
  5837. BEGIN
  5838. IF GetProcedure("Address") THEN
  5839. Emit(Push(position,op));
  5840. CallProcedure;
  5841. END;
  5842. END Address;
  5843. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  5844. VAR len: IntermediateCode.Operand;
  5845. BEGIN
  5846. IF GetProcedure("String") THEN
  5847. len := GetArrayLength(type, op.tag);
  5848. Emit(Push(position,len));
  5849. ReleaseIntermediateOperand(len);
  5850. Emit(Push(position,op.op));
  5851. CallProcedure;
  5852. END;
  5853. END StringOperand;
  5854. PROCEDURE Ln;
  5855. BEGIN
  5856. IF GetProcedure("Ln") THEN
  5857. CallProcedure;
  5858. END;
  5859. END Ln;
  5860. BEGIN
  5861. IF backend.traceModuleName = "" THEN RETURN END;
  5862. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5863. IF GetProcedure("Enter") THEN
  5864. CallProcedure
  5865. END;
  5866. NEW(stringWriter,LEN(s));
  5867. FOR i := 0 TO x.Length()-1 DO
  5868. msg := "";
  5869. expression := x.GetExpression(i);
  5870. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5871. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5872. ELSE
  5873. Global.GetModuleName(module.module, s);
  5874. END;
  5875. IF i = 0 THEN
  5876. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  5877. stringWriter.String(":");
  5878. END;
  5879. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5880. IF ~(expression IS SyntaxTree.StringValue) THEN
  5881. printout.Expression(expression);
  5882. stringWriter.Get(s);
  5883. Strings.Append(msg,s);
  5884. Strings.Append(msg,"= ");
  5885. ELSE stringWriter.Get(s); (* remove from string writer *)
  5886. Strings.Append(msg, s);
  5887. END;
  5888. String(msg);
  5889. IF SemanticChecker.IsStringType(expression.type) THEN
  5890. Designate(expression,res);
  5891. StringOperand(res, expression.type);
  5892. ELSE
  5893. Evaluate(expression,res);
  5894. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5895. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5896. Convert(res.op,int64);
  5897. END;
  5898. Integer(res.op);
  5899. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5900. Boolean(res.op);
  5901. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5902. Set(res.op);
  5903. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5904. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5905. Convert(res.op,float64);
  5906. END;
  5907. Float(res.op);
  5908. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5909. Char(res.op);
  5910. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5911. Address(res.op);String("H");
  5912. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5913. Address(res.op);String("H");
  5914. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5915. Address(res.op);String("H");
  5916. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5917. Address(res.op);String("H");
  5918. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5919. String("NIL");
  5920. ELSE HALT(200);
  5921. END;
  5922. END;
  5923. ReleaseOperand(res);
  5924. String("; ");
  5925. END;
  5926. IF GetProcedure("Exit") THEN
  5927. CallProcedure
  5928. ELSE
  5929. Ln;
  5930. END;
  5931. END;
  5932. END SystemTrace;
  5933. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5934. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5935. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5936. BEGIN
  5937. type := type.resolved;
  5938. IF type IS SyntaxTree.RecordType THEN
  5939. WITH type: SyntaxTree.RecordType DO
  5940. baseType := type.baseType;
  5941. IF baseType # NIL THEN
  5942. baseType := baseType.resolved;
  5943. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5944. InitFields(baseType,adr,offset);
  5945. END;
  5946. variable := type.recordScope.firstVariable;
  5947. WHILE variable # NIL DO
  5948. IF variable.initializer # NIL THEN
  5949. Evaluate(variable.initializer,initializerOp);
  5950. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5951. Emit(Mov(position,mem,initializerOp.op));
  5952. ReleaseOperand(initializerOp);
  5953. ReleaseIntermediateOperand(mem);
  5954. END;
  5955. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5956. variable := variable.nextVariable
  5957. END;
  5958. END;
  5959. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5960. WITH type: SyntaxTree.ArrayType DO
  5961. IF type.form = SyntaxTree.Static THEN
  5962. baseType := type.arrayBase;
  5963. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5964. FOR i := 0 TO type.staticLength-1 DO
  5965. InitFields(baseType,adr,offset+i*size);
  5966. END;
  5967. END;
  5968. END;
  5969. ELSIF type IS SyntaxTree.MathArrayType THEN
  5970. WITH type: SyntaxTree.MathArrayType DO
  5971. IF type.form = SyntaxTree.Open THEN
  5972. dim := DynamicDim(type);
  5973. imm := IntermediateCode.Immediate(addressType,dim);
  5974. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5975. baseType := SemanticChecker.ArrayBase(type,dim);
  5976. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5977. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5978. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5979. ReleaseIntermediateOperand(imm);
  5980. (* flags remain empty (=0) for open array *)
  5981. ELSIF type.form = SyntaxTree.Static THEN
  5982. baseType := type.arrayBase;
  5983. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5984. ASSERT(type.staticLength < 1024*1024*1024);
  5985. FOR i := 0 TO type.staticLength-1 DO
  5986. InitFields(baseType,adr,offset+i*size);
  5987. END;
  5988. END;
  5989. END;
  5990. END;
  5991. END InitFields;
  5992. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  5993. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  5994. BEGIN
  5995. type := variable.type.resolved;
  5996. IF (type IS SyntaxTree.MathArrayType) THEN
  5997. WITH type: SyntaxTree.MathArrayType DO
  5998. IF type.form = SyntaxTree.Open THEN
  5999. Symbol(variable,operand);
  6000. InitFields(type, operand.tag,0);
  6001. IF temporary THEN
  6002. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6003. END;
  6004. ELSIF type.form = SyntaxTree.Tensor THEN
  6005. Symbol(variable, operand);
  6006. MakeMemory(tmp,operand.op,addressType,0);
  6007. ReleaseOperand(operand);
  6008. IF temporary THEN
  6009. (* trick -- temporary object from array base *)
  6010. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6011. Symbol(symbol,operand);
  6012. MakeMemory(mem,operand.op,addressType,0);
  6013. ReleaseOperand(operand);
  6014. Emit(Mov(position,tmp, mem) );
  6015. ReleaseOperand(operand);
  6016. ELSE
  6017. Emit(Mov(position,tmp, nil ) );
  6018. END;
  6019. ReleaseIntermediateOperand(tmp);
  6020. END;
  6021. END;
  6022. ELSE
  6023. Symbol(variable,operand);
  6024. IF variable.initializer # NIL THEN
  6025. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6026. reference.SetType(variable.type.resolved);
  6027. reference.SetAssignable(TRUE);
  6028. Assign(reference,variable.initializer);
  6029. ELSIF temporary THEN
  6030. IF SemanticChecker.IsPointerType(variable.type) THEN
  6031. Symbol(variable, operand);
  6032. MakeMemory(tmp,operand.op,addressType,0);
  6033. ReleaseOperand(operand);
  6034. Emit(Mov(position,tmp, nil ) );
  6035. ReleaseIntermediateOperand(tmp);
  6036. END;
  6037. END;
  6038. InitFields(type, operand.op,0);
  6039. ReleaseOperand(operand);
  6040. END;
  6041. END InitVariable;
  6042. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6043. VAR end: Label;
  6044. BEGIN
  6045. IF type.form = SyntaxTree.Tensor THEN
  6046. InitOperand(result,ModeValue);
  6047. ReuseCopy(result.op,base);
  6048. end := NewLabel();
  6049. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6050. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6051. SetLabel(end);
  6052. Convert(result.op,int32);
  6053. ELSE
  6054. InitOperand(result,ModeValue);
  6055. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6056. END
  6057. END MathArrayDim;
  6058. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6059. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6060. BEGIN
  6061. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6062. MakeMemory(mem,base,addressType,offset);
  6063. Emit(Mov(position,mem,value));
  6064. ReleaseIntermediateOperand(mem);
  6065. END PutMathArrayField;
  6066. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6067. VAR mem: IntermediateCode.Operand;
  6068. BEGIN
  6069. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6070. MakeMemory(mem,base,addressType,offset);
  6071. Emit(Mov(position,mem,value));
  6072. ReleaseIntermediateOperand(mem);
  6073. END PutMathArrayFieldOffset;
  6074. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6075. BEGIN
  6076. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6077. MakeMemory(value,base,addressType,offset);
  6078. END GetMathArrayField;
  6079. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6080. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6081. BEGIN
  6082. IF incr THEN
  6083. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6084. ELSE
  6085. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6086. END;
  6087. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6088. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6089. ELSE
  6090. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6091. Emit(Mov(position,reg,dim));
  6092. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6093. Emit(Add(position,reg,reg,base));
  6094. MakeMemory(mem, reg, addressType, offset);
  6095. ReleaseIntermediateOperand(reg);
  6096. Emit(Mov(position,mem,value));
  6097. ReleaseIntermediateOperand(mem);
  6098. END;
  6099. END PutMathArrayLenOrIncr;
  6100. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6101. BEGIN
  6102. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6103. END PutMathArrayLength;
  6104. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6105. BEGIN
  6106. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6107. END PutMathArrayIncrement;
  6108. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6109. BEGIN
  6110. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6111. END GetMathArrayIncrement;
  6112. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6113. BEGIN
  6114. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6115. END GetMathArrayLength;
  6116. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6117. VAR dimOp: IntermediateCode.Operand;
  6118. BEGIN
  6119. dimOp := IntermediateCode.Immediate(int32, dim);
  6120. GetMathArrayLength(type, operand, dimOp, check, result);
  6121. END GetMathArrayLengthAt;
  6122. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6123. VAR dimOp: IntermediateCode.Operand;
  6124. BEGIN
  6125. dimOp := IntermediateCode.Immediate(int32, dim);
  6126. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6127. END GetMathArrayIncrementAt;
  6128. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6129. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6130. offset: LONGINT;
  6131. BEGIN
  6132. IF increment THEN
  6133. offset := MathIncrOffset;
  6134. ELSE
  6135. offset := MathLenOffset;
  6136. END;
  6137. INC(offset,operand.dimOffset*2);
  6138. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6139. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6140. END;
  6141. (* static dimension *)
  6142. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6143. IF check & (type.form = SyntaxTree.Tensor) THEN
  6144. DimensionCheck(operand.tag,dim,BrltL);
  6145. END;
  6146. val := SHORT(dim.intValue);
  6147. IF type.form # SyntaxTree.Tensor THEN
  6148. t := SemanticChecker.ArrayBase(type,val);
  6149. type := t.resolved(SyntaxTree.MathArrayType);
  6150. IF type.form = SyntaxTree.Static THEN
  6151. IF increment THEN
  6152. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6153. ELSE
  6154. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6155. END;
  6156. InitOperand(result,ModeValue);
  6157. result.op := res;
  6158. RETURN;
  6159. END;
  6160. END;
  6161. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6162. MakeMemory(res,operand.tag,addressType,offset);
  6163. (*
  6164. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6165. *)
  6166. InitOperand(result,ModeValue);
  6167. result.op := res;
  6168. ELSE
  6169. Convert(dim,addressType);
  6170. IF check THEN
  6171. IF type.form = SyntaxTree.Tensor THEN
  6172. DimensionCheck(operand.tag,dim,BrltL);
  6173. ELSIF isUnchecked THEN (* do nothing *)
  6174. ELSE
  6175. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6176. END;
  6177. END;
  6178. end := NewLabel(); next := NIL;
  6179. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6180. Emit(Mov(position,res,dim));
  6181. Convert(res,int32);
  6182. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6183. WHILE t IS SyntaxTree.MathArrayType DO
  6184. type := t(SyntaxTree.MathArrayType);
  6185. IF type.form = SyntaxTree.Static THEN
  6186. imm := IntermediateCode.Immediate(int32,val);
  6187. next := NewLabel();
  6188. BrneL(next,imm,res);
  6189. IF increment THEN
  6190. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  6191. ELSE
  6192. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6193. END;
  6194. Emit(MovReplace(position,res,imm));
  6195. BrL(end);
  6196. ELSE hasDynamicPart := TRUE;
  6197. END;
  6198. t := type.arrayBase.resolved;
  6199. val := val + 1;
  6200. IF next # NIL THEN SetLabel(next) END;
  6201. END;
  6202. IF hasDynamicPart THEN
  6203. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6204. Emit(Mov(position,res2,dim));
  6205. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6206. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6207. Emit(Add(position,res2,res2,imm));
  6208. Emit(Add(position,res2,res2,operand.tag));
  6209. IntermediateCode.MakeMemory(res2,int32);
  6210. Emit(MovReplace(position,res,res2));
  6211. ReleaseIntermediateOperand(res2);
  6212. END;
  6213. SetLabel(end);
  6214. Convert(res,int32);
  6215. InitOperand(result,ModeValue);
  6216. result.op := res;
  6217. END;
  6218. END MathArrayLenOrIncr;
  6219. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6220. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6221. offset: LONGINT;
  6222. BEGIN
  6223. offset := operand.dimOffset+DynamicDim(type)-1;
  6224. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6225. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6226. val := SHORT(dim.intValue);
  6227. t := SemanticChecker.ArrayBase(type,val);
  6228. type := t.resolved(SyntaxTree.ArrayType);
  6229. IF type.form = SyntaxTree.Static THEN
  6230. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6231. ELSE
  6232. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6233. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6234. END;
  6235. UseIntermediateOperand(res);
  6236. InitOperand(result,ModeValue);
  6237. result.op := res;
  6238. ELSE
  6239. Convert(dim,addressType);
  6240. IF ~isUnchecked THEN
  6241. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6242. END;
  6243. end := NewLabel(); next := NIL;
  6244. (* ReuseCopy(dim,res); *)
  6245. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6246. Emit(Mov(position,res,dim));
  6247. Convert(res,int32);
  6248. Convert(res,int32);
  6249. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6250. WHILE t IS SyntaxTree.ArrayType DO
  6251. type := t(SyntaxTree.ArrayType);
  6252. IF type.form = SyntaxTree.Static THEN
  6253. imm := IntermediateCode.Immediate(int32,val);
  6254. next := NewLabel();
  6255. BrneL(next,imm,res);
  6256. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6257. Emit(MovReplace(position,res,imm));
  6258. BrL(end);
  6259. ELSE hasDynamicPart := TRUE;
  6260. END;
  6261. t := type.arrayBase.resolved;
  6262. val := val + 1;
  6263. IF next # NIL THEN SetLabel(next) END;
  6264. END;
  6265. IF hasDynamicPart THEN
  6266. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6267. Convert(res2,addressType);
  6268. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6269. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6270. Emit(Sub(position,res2,imm,res2));
  6271. Emit(Add(position,res2,res2,operand.tag));
  6272. IntermediateCode.MakeMemory(res2,int32);
  6273. Emit(MovReplace(position,res,res2));
  6274. ReleaseIntermediateOperand(res2);
  6275. END;
  6276. SetLabel(end);
  6277. Convert(res,int32);
  6278. InitOperand(result,ModeValue);
  6279. result.op := res;
  6280. END;
  6281. END ArrayLen;
  6282. (**
  6283. create a temporary variable in current scope
  6284. **)
  6285. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6286. VAR name: SyntaxTree.Identifier; variable: SyntaxTree.Variable;
  6287. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6288. BEGIN
  6289. IF ~register THEN
  6290. variable := temporaries.GetFreeVariable(type, untraced, index);
  6291. ELSE
  6292. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6293. END;
  6294. scope := currentScope;
  6295. variable := NIL; (* disable free variable managemenet for the time being -- does not work *)
  6296. IF variable = NIL THEN
  6297. name := temporaries.GetUID();
  6298. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6299. variable.SetType(type);
  6300. variable.SetAccess(SyntaxTree.Hidden);
  6301. variable.SetUntraced(untraced);
  6302. IF ~register THEN
  6303. temporaries.AddVariable(variable);
  6304. IF scope.lastVariable # NIL THEN
  6305. offset := scope.lastVariable.offsetInBits;
  6306. ELSE
  6307. offset := 0;
  6308. END;
  6309. DEC(offset,system.SizeOf(variable.type));
  6310. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6311. variable(SyntaxTree.Variable).SetOffset(offset);
  6312. scope.AddVariable(variable(SyntaxTree.Variable));
  6313. scope.EnterSymbol(variable, duplicate);
  6314. ASSERT(~duplicate);
  6315. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6316. ELSE
  6317. variable.SetUseRegister(TRUE);
  6318. variable(SyntaxTree.Variable).SetOffset(0);
  6319. END;
  6320. ELSE
  6321. name := temporaries.GetUID();
  6322. offset := variable.offsetInBits;
  6323. (* create new variable on existing slot *)
  6324. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6325. variable.SetType(type);
  6326. variable.SetAccess(SyntaxTree.Hidden);
  6327. variable.SetUntraced(untraced);
  6328. variable(SyntaxTree.Variable).SetOffset(offset);
  6329. scope.AddVariable(variable(SyntaxTree.Variable));
  6330. scope.EnterSymbol(variable, duplicate);
  6331. ASSERT(~duplicate);
  6332. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6333. (*
  6334. ASSERT(variable.type.resolved = type.resolved)
  6335. *)
  6336. END;
  6337. RETURN variable(SyntaxTree.Variable)
  6338. END GetTemporaryVariable;
  6339. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6340. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6341. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6342. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6343. i: LONGINT; duplicate: BOOLEAN;
  6344. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6345. VAR variable: SyntaxTree.Variable;
  6346. BEGIN
  6347. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6348. variable.SetType(type);
  6349. recordScope.AddVariable(variable);
  6350. END AddVariable;
  6351. BEGIN
  6352. name := "@ArrayDescriptor";
  6353. Basic.AppendNumber(name,dimensions);
  6354. identifier := SyntaxTree.NewIdentifier(name);
  6355. parentScope := module.module.moduleScope;
  6356. symbol := parentScope.FindSymbol(identifier);
  6357. IF symbol # NIL THEN
  6358. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6359. type := typeDeclaration.declaredType;
  6360. ELSE
  6361. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6362. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6363. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6364. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6365. recordType.SetTypeDeclaration(typeDeclaration);
  6366. recordType.SetState(SyntaxTree.Resolved);
  6367. typeDeclaration.SetDeclaredType(recordType);
  6368. AddVariable("@ptr",system.anyType);
  6369. AddVariable("@adr",system.addressType);
  6370. AddVariable("@flags",system.addressType);
  6371. AddVariable("@dim",system.addressType);
  6372. AddVariable("@elementSize",system.addressType);
  6373. FOR i := 0 TO dimensions-1 DO
  6374. name := "@len";
  6375. Basic.AppendNumber(name,i);
  6376. AddVariable(name,system.addressType);
  6377. name := "@incr";
  6378. Basic.AppendNumber(name,i);
  6379. AddVariable(name,system.addressType);
  6380. END;
  6381. parentScope.AddTypeDeclaration(typeDeclaration);
  6382. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6383. ASSERT(~duplicate);
  6384. type := recordType;
  6385. END;
  6386. RETURN type
  6387. END GetMathArrayDescriptorType;
  6388. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6389. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6390. BEGIN
  6391. type := GetMathArrayDescriptorType(dimensions);
  6392. Emit(Push(position,op.op));
  6393. (* push type descriptor *)
  6394. reg := TypeDescriptorAdr(type);
  6395. IF ~newObjectFile THEN
  6396. IntermediateCode.MakeMemory(reg,addressType);
  6397. END;
  6398. Emit(Push(position,reg));
  6399. ReleaseIntermediateOperand(reg);
  6400. (* push realtime flag: false by default *)
  6401. Emit(Push(position,false));
  6402. CallThis(position,"Heaps","NewRec",3);
  6403. END NewMathArrayDescriptor;
  6404. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6405. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6406. BEGIN
  6407. NEW(string, LEN(s)); COPY(s, string^);
  6408. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6409. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6410. sv.SetType(type);
  6411. Designate(sv,res);
  6412. Emit(Push(position,res.tag));
  6413. Emit(Push(position,res.op));
  6414. ReleaseOperand(res);
  6415. END PushConstString;
  6416. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6417. BEGIN
  6418. IF b THEN
  6419. Emit(Push(Basic.invalidPosition, true));
  6420. ELSE
  6421. Emit(Push(Basic.invalidPosition, false));
  6422. END;
  6423. END PushConstBoolean;
  6424. PROCEDURE PushConstSet(v: SET);
  6425. VAR value: SyntaxTree.Value; op: Operand;
  6426. BEGIN
  6427. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6428. value.SetType(system.setType);
  6429. Evaluate(value, op);
  6430. Emit(Push(Basic.invalidPosition, op.op));
  6431. ReleaseOperand(op);
  6432. END PushConstSet;
  6433. PROCEDURE PushConstInteger(v: LONGINT);
  6434. VAR value: SyntaxTree.Value; op: Operand;
  6435. BEGIN
  6436. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6437. value.SetType(system.longintType);
  6438. Evaluate(value, op);
  6439. Emit(Push(Basic.invalidPosition, op.op));
  6440. ReleaseOperand(op);
  6441. END PushConstInteger;
  6442. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6443. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6444. section: IntermediateCode.Section;
  6445. BEGIN
  6446. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6447. Global.GetSymbolSegmentedName(symbol, name);
  6448. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6449. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6450. procedure.SetScope(moduleScope);
  6451. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6452. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6453. procedure.SetAccess(SyntaxTree.Hidden);
  6454. currentScope := procedureScope;
  6455. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6456. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6457. RETURN section;
  6458. END OpenInitializer;
  6459. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6460. BEGIN
  6461. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6462. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6463. section := prev;
  6464. END CloseInitializer;
  6465. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6466. VAR name: SyntaxTree.IdentifierString;
  6467. variable: SyntaxTree.Variable;
  6468. parameter: SyntaxTree.Parameter;
  6469. type: SyntaxTree.Type;
  6470. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6471. BEGIN
  6472. InitOperand(op,ModeReference);
  6473. op.op := fp;
  6474. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6475. Dereference(op, x, FALSE);
  6476. result := op;
  6477. Symbol(symbol, op);
  6478. END Field;
  6479. PROCEDURE Direction(direction: LONGINT): SET;
  6480. BEGIN
  6481. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6482. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6483. ELSE HALT(100);
  6484. END;
  6485. END Direction;
  6486. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6487. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6488. BEGIN
  6489. Field(port, op);
  6490. ToMemory(op.op,addressType,0);
  6491. Emit(Push(Basic.invalidPosition, op.op));
  6492. ReleaseOperand(op);
  6493. Basic.GetString(modifier.identifier, name);
  6494. PushConstString(name);
  6495. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6496. ASSERT(SemanticChecker.IsStringType(value.type));
  6497. Designate(value, op);
  6498. Emit(Push(modifier.position, op.tag));
  6499. Emit(Push(modifier.position, op.op));
  6500. ReleaseOperand(op);
  6501. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6502. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6503. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6504. Evaluate(value, op);
  6505. Emit(Push(modifier.position, op.op));
  6506. ReleaseOperand(op);
  6507. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6508. ELSE
  6509. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6510. END;
  6511. END AddPortProperty;
  6512. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6513. VAR modifier: SyntaxTree.Modifier;
  6514. BEGIN
  6515. modifier := parameter.modifiers;
  6516. WHILE modifier # NIL DO
  6517. AddPortProperty(parameter,modifier, modifier.expression);
  6518. modifier := modifier.nextModifier;
  6519. END;
  6520. END AddPortProperties;
  6521. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6522. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6523. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6524. PROCEDURE PushLens(type: SyntaxTree.Type);
  6525. BEGIN
  6526. IF IsSemiDynamicArray(type) THEN
  6527. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6528. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6529. Emit(Push(Basic.invalidPosition, op.op));
  6530. ReleaseOperand(op);
  6531. INC(dim);
  6532. ELSIF IsStaticArray(type) THEN
  6533. len := len * type(SyntaxTree.ArrayType).staticLength;
  6534. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6535. INC(dim);
  6536. ELSE
  6537. baseType := type;
  6538. END;
  6539. END PushLens;
  6540. BEGIN
  6541. (* cell *)
  6542. IF parameter.type IS SyntaxTree.ArrayType THEN
  6543. type := parameter.type;
  6544. dim := 0;
  6545. len := 1;
  6546. PushLens(type);
  6547. portType := baseType.resolved(SyntaxTree.PortType);
  6548. ELSE
  6549. portType := parameter.type(SyntaxTree.PortType);
  6550. END;
  6551. PushSelfPointer();
  6552. (* port / array of ports *)
  6553. IF IsStaticArray(type) THEN
  6554. PushConstInteger(len);
  6555. END;
  6556. Field(parameter, op);
  6557. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6558. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6559. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6560. Designate(d, op);*)
  6561. Emit(Push(Basic.invalidPosition, op.op));
  6562. ReleaseOperand(op);
  6563. (* name *)
  6564. PushConstString(name);
  6565. (* inout *)
  6566. PushConstSet(Direction(portType.direction));
  6567. (* width *)
  6568. PushConstInteger(portType.sizeInBits);
  6569. IF parameter.type IS SyntaxTree.PortType THEN
  6570. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6571. AddPortProperties(parameter);
  6572. ELSIF IsStaticArray(type)THEN
  6573. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6574. ELSIF IsSemiDynamicArray(type) THEN
  6575. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6576. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6577. Emit(Add(position,reg, sp, size));
  6578. (* dim *)
  6579. PushConstInteger(dim);
  6580. (* len array *)
  6581. Emit(Push(position, reg));
  6582. ReleaseIntermediateOperand(reg);
  6583. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6584. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6585. Emit(Add(position, sp,sp, size));
  6586. ELSE
  6587. HALT(100);
  6588. END;
  6589. END Parameter;
  6590. BEGIN
  6591. IF backend.cellsAreObjects THEN
  6592. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6593. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6594. END;
  6595. parameter := x.firstParameter;
  6596. WHILE (parameter # NIL) DO
  6597. type := parameter.type.resolved;
  6598. WHILE (type IS SyntaxTree.ArrayType) DO
  6599. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6600. END;
  6601. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6602. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6603. Parameter(name,parameter);
  6604. END;
  6605. parameter := parameter.nextParameter;
  6606. END;
  6607. ELSE HALT(200)
  6608. END;
  6609. END AddPorts;
  6610. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6611. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6612. BEGIN
  6613. Symbol(cell,op);
  6614. ToMemory(op.op,addressType,0);
  6615. Emit(Push(position,op.op));
  6616. ReleaseOperand(op);
  6617. property.GetName(name);
  6618. (* does not work when inheritance is used:
  6619. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6620. *)
  6621. PushConstString(name);
  6622. IF (value # NIL) THEN
  6623. ASSERT(
  6624. SemanticChecker.IsStringType(property.type)
  6625. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6626. OR (property.type.resolved IS SyntaxTree.FloatType)
  6627. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6628. OR (property.type.resolved IS SyntaxTree.SetType)
  6629. );
  6630. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6631. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6632. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6633. Designate(d, op);
  6634. IF SemanticChecker.IsStringType(property.type) THEN
  6635. Emit(Push(Basic.invalidPosition, op.tag))
  6636. END;
  6637. Emit(Push(Basic.invalidPosition, op.op));
  6638. ReleaseOperand(op);
  6639. END;
  6640. IF value = NIL THEN
  6641. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6642. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6643. ASSERT(SemanticChecker.IsStringType(value.type));
  6644. Designate(value, op);
  6645. PushString(op, value.type);
  6646. ReleaseOperand(op);
  6647. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6648. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6649. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6650. Evaluate(value, op);
  6651. Emit(Push(property.position, op.op));
  6652. ReleaseOperand(op);
  6653. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6654. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6655. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6656. Evaluate(value, op);
  6657. Emit(Push(property.position, op.op));
  6658. ReleaseOperand(op);
  6659. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6660. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6661. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6662. Evaluate(value, op);
  6663. Emit(Push(property.position, op.op));
  6664. ReleaseOperand(op);
  6665. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6666. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6667. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6668. Evaluate(value, op);
  6669. Emit(Push(property.position, op.op));
  6670. ReleaseOperand(op);
  6671. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6672. ELSE
  6673. HALT(200);
  6674. END;
  6675. END AddProperty;
  6676. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6677. VAR symbol: SyntaxTree.Symbol;
  6678. BEGIN
  6679. WHILE modifier # NIL DO
  6680. symbol := cellType.FindProperty(modifier.identifier);
  6681. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6682. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6683. modifier := modifier.nextModifier;
  6684. END;
  6685. END AddModifiers;
  6686. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6687. VAR last: SyntaxTree.Modifier;
  6688. BEGIN
  6689. IF to = NIL THEN
  6690. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6691. ELSE
  6692. last := to;
  6693. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6694. last := last.nextModifier;
  6695. END;
  6696. IF last.identifier # this.identifier THEN
  6697. ASSERT(last.nextModifier = NIL);
  6698. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6699. END;
  6700. END;
  6701. END AppendModifier;
  6702. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6703. BEGIN
  6704. WHILE this # NIL DO
  6705. AppendModifier(to, this);
  6706. this := this.nextModifier;
  6707. END;
  6708. END AppendModifiers;
  6709. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6710. VAR base: SyntaxTree.Type;
  6711. BEGIN
  6712. AppendModifiers(to, c.modifiers);
  6713. base := c.GetBaseValueType();
  6714. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6715. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6716. END;
  6717. END AppendCellTypeModifiers;
  6718. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6719. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6720. BEGIN
  6721. Basic.GetString(modifier.identifier, name);
  6722. PushConstString(name);
  6723. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6724. ASSERT(SemanticChecker.IsStringType(value.type));
  6725. Designate(value, op);
  6726. PushString(op, value.type);
  6727. ReleaseOperand(op);
  6728. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6729. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6730. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6731. Evaluate(value, op);
  6732. Emit(Push(modifier.position, op.op));
  6733. ReleaseOperand(op);
  6734. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6735. ELSE
  6736. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6737. END;
  6738. END AddPortProperty;
  6739. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6740. BEGIN
  6741. WHILE modifier # NIL DO
  6742. AddPortProperty(modifier, modifier.expression);
  6743. modifier := modifier.nextModifier;
  6744. END;
  6745. END AddPortProperties;
  6746. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6747. VAR op: Operand;
  6748. BEGIN
  6749. Evaluate(p, op);
  6750. Emit(Push(p.position, op.op));
  6751. ReleaseOperand(op);
  6752. IF p IS SyntaxTree.Designator THEN
  6753. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6754. END;
  6755. END PushPort;
  6756. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6757. VAR tmp: IntermediateCode.Operand;
  6758. BEGIN
  6759. actualType := actualType.resolved;
  6760. IF actualType IS SyntaxTree.StringType THEN
  6761. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6762. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6763. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6764. ELSE
  6765. tmp := op.tag;
  6766. IntermediateCode.MakeMemory(tmp,addressType);
  6767. Emit(Push(position,tmp));
  6768. END;
  6769. Emit(Push(position,op.op))
  6770. END PushString;
  6771. (* conservative check if x is potentially on the heap, excluding the module heap
  6772. required for generational garbage collector
  6773. *)
  6774. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6775. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6776. BEGIN
  6777. RETURN TRUE;
  6778. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6779. passed by reference.
  6780. pos := x.position.start;
  6781. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6782. x := x(SyntaxTree.Designator).left;
  6783. END;
  6784. RETURN x # NIL;
  6785. *)
  6786. END OnHeap;
  6787. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6788. VAR
  6789. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6790. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6791. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6792. tmp:IntermediateCode.Operand;
  6793. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6794. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6795. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6796. dest: IntermediateCode.Operand;
  6797. staticLength: LONGINT; itype: IntermediateCode.Type;
  6798. convert,isTensor: BOOLEAN;
  6799. recordType: SyntaxTree.RecordType;
  6800. baseType: SyntaxTree.Type;
  6801. flags: SET;
  6802. left: SyntaxTree.Expression;
  6803. call: SyntaxTree.Designator;
  6804. procedure: SyntaxTree.Procedure;
  6805. temporaryVariable: SyntaxTree.Variable;
  6806. dummy: IntermediateCode.Operand;
  6807. customBuiltin: SyntaxTree.CustomBuiltin;
  6808. isVarPar: ARRAY 3 OF BOOLEAN;
  6809. callsection: Sections.Section;
  6810. segmentedName: Basic.SegmentedName;
  6811. needsTrace: BOOLEAN;
  6812. n: ARRAY 256 OF CHAR;
  6813. modifier: SyntaxTree.Modifier;
  6814. previous, init: IntermediateCode.Section;
  6815. prevScope: SyntaxTree.Scope;
  6816. firstPar: LONGINT;
  6817. saved: RegisterEntry;
  6818. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6819. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6820. priority: IntermediateCode.Operand;
  6821. op,callop: Operand;
  6822. BEGIN
  6823. IF type = NIL THEN RETURN END;
  6824. type := type.resolved;
  6825. IF type IS SyntaxTree.PointerType THEN
  6826. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6827. END;
  6828. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6829. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6830. recordScope := type(SyntaxTree.RecordType).recordScope;
  6831. IF recordScope.bodyProcedure # NIL THEN
  6832. procedure := recordScope.bodyProcedure;
  6833. body := procedure.procedureScope.body;
  6834. Emit(Push(position,self));
  6835. IF body.isActive THEN
  6836. StaticCallOperand(callop,procedure);
  6837. Emit(Push(position,callop.op));
  6838. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6839. Convert(priority,sizeType);
  6840. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6841. END;
  6842. Emit(Push(position,priority));
  6843. ReleaseIntermediateOperand(priority);
  6844. IF backend.cooperative THEN
  6845. Emit(Push(position,self));
  6846. CallThis(position,"Activities","Create",3)
  6847. ELSE
  6848. flags := 0;
  6849. IF body.isSafe THEN
  6850. flags := 1;
  6851. END;
  6852. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6853. Emit(Push(position,self));
  6854. CallThis(position,"Objects","CreateProcess",4)
  6855. END;
  6856. ELSE
  6857. Emit(Push(position,self));
  6858. StaticCallOperand(callop,procedure);
  6859. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6860. END;
  6861. Emit(Pop(position,self));
  6862. END;
  6863. END CallBodies;
  6864. PROCEDURE PushTD(type: SyntaxTree.Type);
  6865. VAR op: IntermediateCode.Operand;
  6866. BEGIN
  6867. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6868. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6869. ELSE
  6870. IF type.resolved IS SyntaxTree.PointerType THEN
  6871. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6872. END;
  6873. op := TypeDescriptorAdr(type.resolved);
  6874. IF ~newObjectFile THEN
  6875. IntermediateCode.MakeMemory(op,addressType);
  6876. END;
  6877. Emit(Push(position,op));
  6878. END
  6879. END PushTD;
  6880. BEGIN
  6881. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6882. dest := destination; destination := emptyOperand;
  6883. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6884. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6885. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6886. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6887. CASE x.id OF
  6888. (* ---- COPY ----- *)
  6889. |Global.Copy:
  6890. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6891. (* ---- EXCL, INCL----- *)
  6892. |Global.Excl,Global.Incl:
  6893. Evaluate(p0,s0);
  6894. Evaluate(p1,s1);
  6895. Convert(s1.op,setType);
  6896. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6897. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6898. END;
  6899. ReuseCopy(res,s0.op);
  6900. ReleaseOperand(s0);
  6901. Reuse1(tmp,s1.op);
  6902. ReleaseOperand(s1);
  6903. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6904. IF x.id = Global.Excl THEN
  6905. Emit(Not(position,tmp,tmp));
  6906. Emit(And(position,res,res,tmp));
  6907. ELSE
  6908. Emit(Or(position,res,res,tmp));
  6909. END;
  6910. ReleaseIntermediateOperand(tmp);
  6911. Designate(p0,s0);
  6912. ToMemory(s0.op,setType,0);
  6913. Emit(Mov(position,s0.op,res));
  6914. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6915. (* ---- DISPOSE ----- *)
  6916. |Global.Dispose:
  6917. Designate(p0,s0);
  6918. Emit(Push(position,s0.op));
  6919. ReleaseOperand(s0);
  6920. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6921. (* ---- GETPROCEDURE ----- *)
  6922. |Global.GetProcedure:
  6923. Designate(p0,s0);
  6924. PushString(s0,p0.type);
  6925. Designate(p1,s1);
  6926. PushString(s1,p1.type);
  6927. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6928. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6929. ELSE PushTD(procedureType.firstParameter.type)
  6930. END;
  6931. PushTD(procedureType.returnType);
  6932. Designate(p2,s2);
  6933. Emit(Push(position,s2.op));
  6934. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6935. CallThis(position,"Modules","GetProcedure", 7);
  6936. (* ---- ASH, LSH, ROT ----- *)
  6937. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6938. Evaluate(p0,s0);
  6939. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6940. (* make unsigned arguments in order to produced a logical shift *)
  6941. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6942. convert:= TRUE;
  6943. itype := s0.op.type;
  6944. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6945. Convert(s0.op,itype);
  6946. ELSE
  6947. convert := FALSE;
  6948. END;
  6949. END;
  6950. Evaluate(p1,s1);
  6951. IF IsIntegerConstant(p1,hint) THEN
  6952. ReuseCopy(reg,s0.op);
  6953. IF hint > 0 THEN
  6954. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6955. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6956. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6957. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6958. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6959. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6960. END;
  6961. ELSIF hint < 0 THEN
  6962. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6963. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6964. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6965. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6966. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6967. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6968. END;
  6969. END;
  6970. ReleaseOperand(s0); ReleaseOperand(s1);
  6971. ELSE
  6972. exit := NewLabel();
  6973. end := NewLabel();
  6974. ReuseCopy(reg,s0.op);
  6975. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6976. Reuse1(tmp,s1.op);
  6977. Emit(Neg(position,tmp,s1.op));
  6978. Convert(tmp,s1.op.type);
  6979. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6980. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6981. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6982. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6983. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6984. END;
  6985. ReleaseIntermediateOperand(tmp);
  6986. BrL(end);
  6987. SetLabel(exit);
  6988. ReuseCopy(tmp,s1.op);
  6989. Convert(tmp,s1.op.type);
  6990. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6991. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6992. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6993. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6994. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6995. END;
  6996. ReleaseIntermediateOperand(tmp);
  6997. SetLabel(end);
  6998. ReleaseOperand(s0); ReleaseOperand(s1);
  6999. END;
  7000. InitOperand(result,ModeValue);
  7001. IF convert THEN
  7002. itype := reg.type;
  7003. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7004. Convert(reg,itype);
  7005. END;
  7006. result.op := reg;
  7007. (* ---- CAP ----- *)
  7008. |Global.Cap:
  7009. Evaluate(p0,result);
  7010. ReuseCopy(reg,result.op);
  7011. ReleaseIntermediateOperand(result.op);
  7012. ignore := NewLabel();
  7013. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7014. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7015. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7016. SetLabel(ignore);
  7017. result.op := reg;
  7018. (* ---- CHR ----- *)
  7019. |Global.Chr, Global.Chr32:
  7020. Evaluate(p0,result);
  7021. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7022. |Global.Entier, Global.EntierH:
  7023. Evaluate(p0,result);
  7024. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7025. (* ---- MIN and MAX ----- *)
  7026. |Global.Max,Global.Min:
  7027. Evaluate(p0,s0);
  7028. Evaluate(p1,s1);
  7029. Reuse2(res,s0.op,s1.op);
  7030. else := NewLabel();
  7031. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7032. ELSE BrltL(else,s1.op,s0.op) END;
  7033. Emit(Mov(position,res,s0.op));
  7034. ReleaseOperand(s0);
  7035. end := NewLabel();
  7036. BrL(end);
  7037. SetLabel(else);
  7038. Emit(MovReplace(position,res,s1.op));
  7039. SetLabel(end);
  7040. ReleaseOperand(s1);
  7041. InitOperand(result,ModeValue);
  7042. result.op := res;
  7043. (* ---- ODD ----- *)
  7044. |Global.Odd:
  7045. IF ~conditional THEN
  7046. ConditionToValue(x)
  7047. ELSE
  7048. Evaluate(p0,result);
  7049. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7050. Reuse1(res,result.op);
  7051. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7052. ReleaseIntermediateOperand(result.op);
  7053. result.op := res;
  7054. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7055. ReleaseOperand(result);
  7056. BrL(falseLabel);
  7057. END;
  7058. (* ---- ORD ----- *)
  7059. |Global.Ord, Global.Ord32:
  7060. Evaluate(p0,result);
  7061. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7062. (* ---- SHORT, LONG ----- *)
  7063. |Global.Short, Global.Long:
  7064. Evaluate(p0,result);
  7065. IF x.type IS SyntaxTree.ComplexType THEN
  7066. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7067. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7068. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7069. ELSE
  7070. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7071. END
  7072. (* ---- HALT, SYSTEM.HALT----- *)
  7073. |Global.Halt, Global.systemHalt:
  7074. val := p0.resolved(SyntaxTree.IntegerValue).value;
  7075. EmitTrap (position, val);
  7076. (* ---- ASSERT ----- *)
  7077. |Global.Assert:
  7078. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7079. trueL := NewLabel();
  7080. falseL := NewLabel();
  7081. Condition(p0,trueL,falseL);
  7082. IF p1 = NIL THEN val := AssertTrap
  7083. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  7084. END;
  7085. SetLabel(falseL);
  7086. EmitTrap(position,val);
  7087. SetLabel(trueL);
  7088. END;
  7089. (*
  7090. Emit(TrapC(result.op,val);
  7091. *)
  7092. (* ---- INC, DEC----- *)
  7093. |Global.Inc,Global.Dec:
  7094. Expression(p0); adr := result.op;
  7095. LoadValue(result,p0.type); l := result;
  7096. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7097. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7098. END;
  7099. IF x.id = Global.Inc THEN
  7100. Emit(Add(position,l.op,l.op,r.op));
  7101. ELSE
  7102. Emit(Sub(position,l.op,l.op,r.op));
  7103. END;
  7104. ReleaseOperand(l); ReleaseOperand(r);
  7105. (* ---- LEN ----- *)
  7106. |Global.Len: (* dynamic length, static length done by checker *)
  7107. Designate(p0,operand);
  7108. IF p1 = NIL THEN
  7109. InitOperand(l,ModeValue);
  7110. l.op := IntermediateCode.Immediate(int32,0);
  7111. ELSE
  7112. Evaluate(p1,l);
  7113. END;
  7114. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7115. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7116. Dereference(operand, p0.type.resolved, FALSE);
  7117. END;
  7118. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7119. ReleaseOperand(operand); ReleaseOperand(l);
  7120. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7121. ASSERT(p1 # NIL);
  7122. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7123. Dereference(operand,p0.type.resolved,FALSE);
  7124. END;
  7125. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7126. ReleaseOperand(operand); ReleaseOperand(l);
  7127. ELSE HALT(100);
  7128. END;
  7129. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7130. (* ---- FIRST ---- *)
  7131. |Global.First:
  7132. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7133. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7134. ELSE
  7135. Designate(p0, result)
  7136. END
  7137. (* ---- LAST ---- *)
  7138. |Global.Last:
  7139. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7140. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7141. ELSE
  7142. Designate(p0, result);
  7143. (* make sure result.op is a register *)
  7144. tmp := result.op;
  7145. ReuseCopy(result.op, result.op);
  7146. ReleaseIntermediateOperand(tmp);
  7147. (* add offset to result.op *)
  7148. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7149. END
  7150. (* ---- STEP ---- *)
  7151. |Global.Step:
  7152. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7153. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7154. ELSE
  7155. Designate(p0, result);
  7156. (* make sure result.op is a register *)
  7157. tmp := result.op;
  7158. ReuseCopy(result.op, result.op);
  7159. ReleaseIntermediateOperand(tmp);
  7160. (* add offset to result.op *)
  7161. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7162. END
  7163. (* ---- RE ---- *)
  7164. |Global.Re:
  7165. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7166. Designate(p0, result)
  7167. ELSE
  7168. Evaluate(p0, result)
  7169. END
  7170. (* ---- IM ---- *)
  7171. |Global.Im:
  7172. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7173. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7174. Designate(p0, result);
  7175. (* make sure result.op is a register *)
  7176. tmp := result.op;
  7177. ReuseCopy(result.op, result.op);
  7178. ReleaseIntermediateOperand(tmp);
  7179. (* add offset to result.op *)
  7180. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7181. (* ---- ABS ----- *)
  7182. |Global.Abs:
  7183. Evaluate(p0,operand);
  7184. type := p0.type.resolved;
  7185. InitOperand(result,ModeValue);
  7186. Reuse1a(result.op,operand.op,dest);
  7187. Emit(Abs(position,result.op,operand.op));
  7188. ReleaseOperand(operand);
  7189. (* ---- WAIT ----- *)
  7190. |Global.Wait:
  7191. Evaluate(p0,operand);
  7192. Emit(Push(position,operand.op));
  7193. ReleaseOperand(operand);
  7194. CallThis(position,"Activities","Wait", 1);
  7195. (* ---- NEW ----- *)
  7196. |Global.New:
  7197. (*! the following code is only correct for "standard" Oberon calling convention *)
  7198. IF x.type # NIL THEN
  7199. type := x.type.resolved;
  7200. firstPar := 0;
  7201. ELSE
  7202. type := p0.type.resolved;
  7203. firstPar := 1;
  7204. END;
  7205. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7206. THEN
  7207. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7208. IF backend.cooperative THEN
  7209. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7210. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7211. IF recordType.isObject THEN
  7212. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7213. IF recordType.IsActive() THEN
  7214. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7215. END;
  7216. IF recordType.IsProtected() THEN
  7217. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7218. END;
  7219. ELSE
  7220. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7221. END;
  7222. END;
  7223. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7224. CallThis(position,"Runtime","New", 1);
  7225. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7226. Emit(Result(position, pointer));
  7227. exit := NewLabel();
  7228. BreqL(exit,pointer,nil);
  7229. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7230. GetRecordTypeName (recordType,name);
  7231. IF ~recordType.isObject THEN
  7232. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7233. END;
  7234. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7235. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7236. IF recordType.isObject THEN
  7237. IF recordType.IsProtected() THEN
  7238. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7239. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7240. END;
  7241. IF recordType.IsActive() THEN
  7242. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7243. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7244. END;
  7245. END;
  7246. END;
  7247. (* initialize fields *)
  7248. IF type(SyntaxTree.PointerType).isPlain THEN
  7249. size := 0;
  7250. ELSIF recordType.isObject THEN
  7251. size := BaseObjectTypeSize;
  7252. ELSE
  7253. size := BaseRecordTypeSize;
  7254. END;
  7255. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7256. (* call initializer *)
  7257. constructor := GetConstructor(recordType);
  7258. IF constructor # NIL THEN
  7259. (*! should be unified with ProcedureCallDesignator *)
  7260. Emit(Push(position,pointer));
  7261. ReleaseIntermediateOperand(pointer);
  7262. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7263. FOR i := firstPar TO x.parameters.Length()-1 DO
  7264. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7265. formalParameter := formalParameter.nextParameter;
  7266. END;
  7267. (* static call of the constructor *)
  7268. GetCodeSectionNameForSymbol(constructor,name);
  7269. ASSERT(~constructor.isInline);
  7270. IF constructor.scope.ownerModule # module.module THEN
  7271. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7272. ELSE
  7273. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7274. END;
  7275. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7276. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7277. Emit(Pop(position,pointer));
  7278. END;
  7279. (* call bodies *)
  7280. CallBodies(pointer,type);
  7281. SetLabel(exit);
  7282. needsTrace := p0.NeedsTrace();
  7283. IF needsTrace THEN ModifyAssignments(true) END;
  7284. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7285. Emit(Push(position, pointer));
  7286. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7287. Emit(Pop(position, pointer));
  7288. END;
  7289. Designate(p0,l);
  7290. IF needsTrace THEN
  7291. CallAssignPointer(l.op, pointer);
  7292. ELSE
  7293. ToMemory(l.op,addressType,0);
  7294. Emit(Mov(position,l.op,pointer));
  7295. END;
  7296. ReleaseIntermediateOperand(pointer);
  7297. ReleaseOperand(l);
  7298. IF needsTrace THEN ModifyAssignments(false) END;
  7299. ELSE (* not cooperative backend *)
  7300. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7301. IF temporaryVariable # NIL THEN
  7302. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7303. ELSE
  7304. Designate(p0,l);
  7305. END;
  7306. (* l.op contains address of pointer to record *)
  7307. Emit(Push(position,l.op)); (* address for use after syscall *)
  7308. Emit(Push(position,l.op));
  7309. ReleaseOperand(l);
  7310. (* push type descriptor *)
  7311. reg := TypeDescriptorAdr(recordType);
  7312. IF ~newObjectFile THEN
  7313. IntermediateCode.MakeMemory(reg,addressType);
  7314. END;
  7315. Emit(Push(position,reg));
  7316. ReleaseIntermediateOperand(reg);
  7317. (* push realtime flag *)
  7318. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7319. ELSE Emit(Push(position,false));
  7320. END;
  7321. CallThis(position,"Heaps","NewRec", 3);
  7322. (* check allocation success, if not successful then do not call initializers and bodies *)
  7323. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7324. Emit(Pop(position,pointer));
  7325. MakeMemory(reg,pointer,addressType,0);
  7326. ReleaseIntermediateOperand(pointer);
  7327. pointer := reg;
  7328. exit := NewLabel();
  7329. BreqL(exit,pointer,nil);
  7330. Emit(Push(position,pointer));
  7331. (* initialize fields *)
  7332. InitFields(recordType, pointer,0);
  7333. (* call initializer *)
  7334. constructor := GetConstructor(recordType);
  7335. IF constructor # NIL THEN
  7336. (*! should be unified with ProcedureCallDesignator *)
  7337. Emit(Push(position,pointer));
  7338. ReleaseIntermediateOperand(pointer);
  7339. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7340. FOR i := firstPar TO x.parameters.Length()-1 DO
  7341. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7342. formalParameter := formalParameter.nextParameter;
  7343. END;
  7344. (* static call of the constructor *)
  7345. GetCodeSectionNameForSymbol(constructor,name);
  7346. ASSERT(~constructor.isInline);
  7347. IF constructor.scope.ownerModule # module.module THEN
  7348. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7349. ELSE
  7350. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7351. END;
  7352. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7353. ELSE
  7354. ReleaseIntermediateOperand(pointer);
  7355. END;
  7356. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7357. Emit(Pop(position,pointer));
  7358. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7359. Designate(p0,l);
  7360. IF backend.writeBarriers & OnHeap(p0) THEN
  7361. SaveRegisters();ReleaseUsedRegisters(saved);
  7362. Emit(Push(position,l.op));
  7363. Emit(Push(position,pointer));
  7364. CallThis(position,"Heaps","Assign",2);
  7365. RestoreRegisters(saved);
  7366. ELSE
  7367. ToMemory(l.op,addressType,0);
  7368. Emit(Mov(position,l.op,pointer));
  7369. END;
  7370. ReleaseOperand(l);
  7371. result.tag := emptyOperand;
  7372. ELSIF (x.type # NIL) THEN
  7373. result := l; (* temporary variable is the result of NEW Type() *)
  7374. END;
  7375. (* call bodies *)
  7376. CallBodies(pointer,type);
  7377. ReleaseIntermediateOperand(pointer);
  7378. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7379. end := NewLabel();
  7380. BrL(end);
  7381. SetLabel(exit);
  7382. Designate(p0,l);
  7383. ToMemory(l.op,addressType,0);
  7384. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7385. ReleaseOperand(l);
  7386. SetLabel(end);
  7387. ELSE
  7388. SetLabel(exit);
  7389. END;
  7390. END;
  7391. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7392. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7393. IF ~backend.cooperative THEN (* simpler version *)
  7394. (*
  7395. push len0
  7396. push len1
  7397. push len2
  7398. push len_size
  7399. push len_adr
  7400. push tag
  7401. push static elements
  7402. push element size
  7403. push adr
  7404. *)
  7405. dim := 0;
  7406. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7407. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7408. parameter := x.parameters.GetExpression(i);
  7409. Evaluate(parameter,r);
  7410. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7411. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7412. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7413. END;
  7414. Emit(Push(position,r.op));
  7415. ReleaseOperand(r);
  7416. INC(dim);
  7417. END;
  7418. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7419. Emit(Mov(position, adr, sp));
  7420. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7421. Emit(Push(position, adr));
  7422. ReleaseIntermediateOperand(adr);
  7423. openDim := dim;
  7424. staticLength := 1;
  7425. IF type IS SyntaxTree.ArrayType THEN
  7426. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7427. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7428. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7429. END;
  7430. END;
  7431. IF SemanticChecker.ContainsPointer(type) THEN
  7432. tmp := TypeDescriptorAdr(type);
  7433. IF ~newObjectFile THEN
  7434. IntermediateCode.MakeMemory(tmp,addressType);
  7435. END;
  7436. ELSE
  7437. tmp := nil;
  7438. END;
  7439. Emit(Push(position,tmp)); (* type descriptor *)
  7440. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7441. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7442. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7443. Designate(p0,l);
  7444. Emit(Push(position,l.op)); (* address *)
  7445. ReleaseOperand(l);
  7446. CallThis(position,"Heaps","NewArray", 6);
  7447. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7448. Emit(Add(position,sp,sp,tmp));
  7449. ELSE
  7450. dim := 0;
  7451. IntermediateCode.InitOperand(reg);
  7452. IF p1 # NIL THEN
  7453. FOR i := firstPar TO x.parameters.Length()-1 DO
  7454. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7455. parameter := x.parameters.GetExpression(i);
  7456. Evaluate(parameter,r);
  7457. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7458. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7459. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7460. END;
  7461. Emit(Push(position,r.op));
  7462. IF i=1 THEN
  7463. CopyInt(reg,r.op);
  7464. ELSE
  7465. MulInt(reg, reg, r.op);
  7466. END;
  7467. ReleaseOperand(r);
  7468. INC(dim);
  7469. END;
  7470. Convert(reg,addressType);
  7471. ELSE
  7472. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7473. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7474. END;
  7475. openDim := dim;
  7476. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7477. IF backend.cooperative THEN
  7478. size := ToMemoryUnits(system,system.SizeOf(type));
  7479. WHILE type IS SyntaxTree.ArrayType DO
  7480. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7481. END;
  7482. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7483. IF (size # 1) THEN
  7484. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7485. END;
  7486. Emit(Push(position,reg));
  7487. size := ToMemoryUnits(system,system.SizeOf(type));
  7488. IF (size # 1) THEN
  7489. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7490. END;
  7491. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7492. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7493. Emit(Push(position,reg));
  7494. ReleaseIntermediateOperand(reg);
  7495. CallThis(position,"Runtime","New", 1);
  7496. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7497. Emit(Result(position, pointer));
  7498. exit := NewLabel();
  7499. else := NewLabel();
  7500. BreqL(else,pointer,nil);
  7501. IF ~type.hasPointers THEN
  7502. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7503. ELSIF type IS SyntaxTree.RecordType THEN
  7504. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7505. ELSIF type IS SyntaxTree.ProcedureType THEN
  7506. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7507. ELSE
  7508. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7509. END;
  7510. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7511. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7512. 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))));
  7513. IF type IS SyntaxTree.RecordType THEN
  7514. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7515. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7516. ELSE
  7517. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7518. END;
  7519. i := openDim;
  7520. WHILE i > 0 DO
  7521. DEC (i);
  7522. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7523. END;
  7524. needsTrace := p0.NeedsTrace();
  7525. IF needsTrace THEN ModifyAssignments(true) END;
  7526. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7527. Emit(Push(position, pointer));
  7528. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7529. Emit(Pop(position, pointer));
  7530. END;
  7531. Designate(p0,l);
  7532. IF needsTrace THEN
  7533. CallAssignPointer(l.op, pointer);
  7534. ModifyAssignments(false);
  7535. ELSE
  7536. ToMemory(l.op,addressType,0);
  7537. Emit(Mov(position,l.op,pointer));
  7538. END;
  7539. ReleaseIntermediateOperand(pointer);
  7540. ReleaseOperand(l);
  7541. BrL(exit);
  7542. SetLabel(else);
  7543. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7544. Designate(p0,l);
  7545. IF needsTrace THEN
  7546. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7547. ELSE
  7548. ToMemory(l.op,addressType,0);
  7549. Emit(Mov(position,l.op,pointer));
  7550. END;
  7551. ReleaseOperand(l);
  7552. SetLabel(exit);
  7553. ELSE
  7554. (*! the following code is only correct for "standard" Oberon calling convention *)
  7555. IF SemanticChecker.ContainsPointer(type) THEN
  7556. IF type IS SyntaxTree.ArrayType THEN
  7557. staticLength := 1;
  7558. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7559. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7560. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7561. END;
  7562. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7563. MulInt(reg,reg,tmp);
  7564. END;
  7565. Designate(p0,l);
  7566. IF openDim > 0 THEN
  7567. Emit(Push(position,l.op)); (* address for use after syscall *)
  7568. END;
  7569. Emit(Push(position,l.op)); (* address *)
  7570. ReleaseOperand(l);
  7571. tmp := TypeDescriptorAdr(type);
  7572. IF ~newObjectFile THEN
  7573. IntermediateCode.MakeMemory(tmp,addressType);
  7574. END;
  7575. Emit(Push(position,tmp)); (* type descriptor *)
  7576. ReleaseIntermediateOperand(tmp);
  7577. Emit(Push(position,reg)); (* number Elements *)
  7578. ReleaseIntermediateOperand(reg);
  7579. tmp := IntermediateCode.Immediate(addressType,dim);
  7580. Emit(Push(position,tmp)); (* dimensions *)
  7581. (* push realtime flag *)
  7582. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7583. ELSE Emit(Push(position,false));
  7584. END;
  7585. CallThis(position,"Heaps","NewArr",5)
  7586. ELSE
  7587. size := ToMemoryUnits(system,system.SizeOf(type));
  7588. IF (size # 1) THEN
  7589. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7590. (*
  7591. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7592. *)
  7593. END;
  7594. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7595. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7596. AddInt(reg, reg, tmp);
  7597. (*
  7598. Emit(Add(position,reg,reg,tmp));
  7599. *)
  7600. Designate(p0,l);
  7601. IF openDim >0 THEN
  7602. Emit(Push(position,l.op)); (* address for use after syscall *)
  7603. END;
  7604. Emit(Push(position,l.op)); (* address for syscall *)
  7605. ReleaseOperand(l); (* pointer address *)
  7606. Emit(Push(position,reg)); (* size *)
  7607. ReleaseIntermediateOperand(reg);
  7608. (* push realtime flag *)
  7609. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7610. ELSE Emit(Push(position,false));
  7611. END;
  7612. CallThis(position,"Heaps","NewSys", 3)
  7613. END;
  7614. IF openDim > 0 THEN
  7615. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7616. Emit(Pop(position,adr));
  7617. ToMemory(adr,addressType,0);
  7618. ReuseCopy(tmp,adr);
  7619. ReleaseIntermediateOperand(adr);
  7620. adr := tmp;
  7621. else := NewLabel();
  7622. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7623. i := openDim-1;
  7624. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7625. WHILE (i >= 0) DO
  7626. Emit(Pop(position,reg));
  7627. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7628. Emit(Mov(position,res,reg));
  7629. DEC(i);
  7630. END;
  7631. ReleaseIntermediateOperand(adr);
  7632. ReleaseIntermediateOperand(reg);
  7633. exit := NewLabel();
  7634. BrL(exit);
  7635. SetLabel(else);
  7636. (* else part: array could not be allocated *)
  7637. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7638. Emit(Add(position,sp,sp,tmp));
  7639. SetLabel(exit);
  7640. END;
  7641. END;
  7642. END;
  7643. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7644. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7645. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7646. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7647. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7648. left.SetType(procedure.type);
  7649. formalParameter := procedureType.firstParameter;
  7650. (* push array to allocate *)
  7651. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7652. formalParameter :=formalParameter.nextParameter;
  7653. (* push length array *)
  7654. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7655. (* push size *)
  7656. type := t0;
  7657. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7658. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7659. END;
  7660. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7661. Emit(Push(position,tmp));
  7662. (* *)
  7663. IF SemanticChecker.ContainsPointer(type) THEN
  7664. tmp := TypeDescriptorAdr(type);
  7665. IF ~newObjectFile THEN
  7666. IntermediateCode.MakeMemory(tmp,addressType);
  7667. END;
  7668. ELSE
  7669. tmp := IntermediateCode.Immediate(addressType, 0);
  7670. END;
  7671. Emit(Push(position,tmp)); (* type descriptor *)
  7672. StaticCallOperand(result,procedure);
  7673. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7674. ReleaseOperand(result);
  7675. END;
  7676. (*
  7677. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7678. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7679. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7680. *)
  7681. ELSE
  7682. (*
  7683. push len0
  7684. push len1
  7685. push len2
  7686. push size
  7687. push len_adr
  7688. push element_size
  7689. push tag
  7690. push adr
  7691. *)
  7692. dim := 0;
  7693. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7694. isTensor := TRUE;
  7695. ELSE
  7696. isTensor := FALSE;
  7697. END;
  7698. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7699. IF ~isTensor THEN
  7700. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7701. END;
  7702. parameter := x.parameters.GetExpression(i);
  7703. Evaluate(parameter,r);
  7704. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7705. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7706. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7707. END;
  7708. Emit(Push(position,r.op));
  7709. ReleaseOperand(r);
  7710. INC(dim);
  7711. END;
  7712. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7713. Emit(Mov(position, adr, sp));
  7714. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7715. Emit(Push(position, adr));
  7716. ReleaseIntermediateOperand(adr);
  7717. openDim := dim;
  7718. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7719. IF isTensor THEN
  7720. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7721. ELSE
  7722. baseType := SemanticChecker.ArrayBase(type,openDim);
  7723. END;
  7724. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7725. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7726. IF SemanticChecker.ContainsPointer(baseType) THEN
  7727. tmp := TypeDescriptorAdr(baseType);
  7728. IF ~newObjectFile THEN
  7729. IntermediateCode.MakeMemory(tmp,addressType);
  7730. END;
  7731. ELSE
  7732. tmp := nil;
  7733. END;
  7734. Emit(Push(position,tmp)); (* type descriptor *)
  7735. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7736. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7737. ELSE (* error message has already been emited *)
  7738. RETURN;
  7739. END;
  7740. Designate(p0,l);
  7741. IF isTensor THEN
  7742. Emit(Push(position,l.op)); (* address *)
  7743. ELSE
  7744. Emit(Push(position,l.tag)); (* address *)
  7745. END;
  7746. ReleaseOperand(l);
  7747. StaticCallOperand(result,procedure);
  7748. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7749. ReleaseOperand(result);
  7750. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7751. Emit(Add(position,sp,sp,tmp));
  7752. END;
  7753. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7754. THEN
  7755. IF ~backend.cellsAreObjects THEN RETURN END;
  7756. IF InCellScope(currentScope) THEN
  7757. PushSelfPointer()
  7758. ELSE
  7759. Emit(Push(position, nil));
  7760. END;
  7761. (* push temp address *)
  7762. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7763. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7764. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7765. (* l.op contains address of pointer to record *)
  7766. Emit(Push(position,l.op)); (* address for use after syscall *)
  7767. ReleaseOperand(l);
  7768. (* push type descriptor *)
  7769. reg := TypeDescriptorAdr(baseType);
  7770. IF ~newObjectFile THEN
  7771. IntermediateCode.MakeMemory(reg,addressType);
  7772. END;
  7773. Emit(Push(position,reg));
  7774. ReleaseIntermediateOperand(reg);
  7775. (* push name *)
  7776. (*Global.GetSymbolName(p0, n);*)
  7777. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7778. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7779. ELSE
  7780. Global.GetModuleName(module.module, n);
  7781. END;
  7782. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7783. (*type.typeDeclaration.GetName(n);*)
  7784. PushConstString(n);
  7785. (* push cellnet boolean *)
  7786. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7787. (* push engine boolean *)
  7788. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7789. (* allocate *)
  7790. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7791. (* add capabilities *)
  7792. modifier := p0(SyntaxTree.Designator).modifiers;
  7793. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7794. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7795. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7796. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7797. END;
  7798. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7799. (*
  7800. modifier := baseType(SyntaxTree.CellType).modifiers;
  7801. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7802. modifier := p0(SyntaxTree.Designator).modifiers;
  7803. *)
  7804. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7805. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7806. (* l.op contains address of pointer to record *)
  7807. ToMemory(l.op,addressType,0);
  7808. (* l.op contains value of pointer to record *)
  7809. Emit(Push(position,l.op)); (* address for use after syscall *)
  7810. ReleaseOperand(l);
  7811. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7812. prevScope := currentScope;
  7813. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7814. previous := section;
  7815. section := init;
  7816. (* add ports *)
  7817. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7818. CloseInitializer(previous);
  7819. currentScope := prevScope;
  7820. Symbol(temporaryVariable,l);
  7821. ToMemory(l.op,addressType,0);
  7822. Emit(Push(position,l.op));
  7823. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7824. (*
  7825. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7826. IF constructor # NIL THEN
  7827. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7828. FOR i := 1 TO x.parameters.Length()-1 DO
  7829. p := x.parameters.GetExpression(i);
  7830. Global.GetSymbolName(parameter,name);
  7831. Evaluate(p, value);
  7832. ASSERT(value.type # NIL);
  7833. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7834. par := instance.AddParameter(name);
  7835. par.SetInteger(value.integer);
  7836. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7837. par := instance.AddParameter(name);
  7838. par.SetBoolean(value.boolean);
  7839. ELSE Error(x.position,NotYetImplemented)
  7840. END;
  7841. parameter := parameter.nextParameter
  7842. END;
  7843. END;
  7844. *)
  7845. (* call initializer *)
  7846. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7847. IF constructor # NIL THEN
  7848. (*! should be unified with ProcedureCallDesignator *)
  7849. IF backend.cellsAreObjects THEN
  7850. Symbol(temporaryVariable,l);
  7851. ToMemory(l.op,addressType,0);
  7852. Emit(Push(position,l.op));
  7853. ReleaseOperand(l);
  7854. END;
  7855. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7856. FOR i := firstPar TO x.parameters.Length()-1 DO
  7857. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7858. formalParameter := formalParameter.nextParameter;
  7859. END;
  7860. (* static call of the constructor *)
  7861. Global.GetSymbolSegmentedName(constructor,name);
  7862. ASSERT(~constructor.isInline);
  7863. IF constructor.scope.ownerModule # module.module THEN
  7864. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7865. ELSE
  7866. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7867. END;
  7868. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7869. (*ELSE
  7870. ReleaseIntermediateOperand(pointer);*)
  7871. END;
  7872. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7873. ToMemory(l.op, addressType, 0);
  7874. Designate(p0,s0);
  7875. ToMemory(s0.op,addressType,0);
  7876. Emit(Mov(position,s0.op,l.op));
  7877. ReleaseOperand(l);
  7878. ReleaseOperand(s0);
  7879. result.tag := emptyOperand;
  7880. (* start *)
  7881. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7882. (* push cell *)
  7883. Symbol(temporaryVariable, l);
  7884. ToMemory(l.op,addressType,0);
  7885. Emit(Push(Basic.invalidPosition,l.op));
  7886. (* push delegate *)
  7887. Emit(Push(Basic.invalidPosition,l.op));
  7888. ReleaseOperand(l);
  7889. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7890. Emit(Push(position, s1.op));
  7891. ReleaseOperand(s1);
  7892. CallThis(position,"ActiveCellsRuntime","Start",3);
  7893. END;
  7894. (*IF temporaryVariable # NIL THEN
  7895. end := NewLabel();
  7896. BrL(end);
  7897. SetLabel(exit);
  7898. Designate(p0,l);
  7899. ToMemory(l.op,addressType,0);
  7900. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7901. ReleaseOperand(l);
  7902. SetLabel(end);
  7903. ELSE
  7904. SetLabel(exit);
  7905. END;
  7906. *)
  7907. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7908. ELSE (* no pointer to record, no pointer to array *)
  7909. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7910. (* ignore new statement *)
  7911. Warning(p0.position, "cannot run on final hardware");
  7912. ELSE
  7913. HALT(200);
  7914. END;
  7915. END;
  7916. (* ---- ADDRESSOF----- *)
  7917. |Global.systemAdr:
  7918. Designate(p0,s0);
  7919. s0.mode := ModeValue;
  7920. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7921. ReleaseIntermediateOperand(s0.op);
  7922. s0.op := s0.tag;
  7923. IntermediateCode.InitOperand(s0.tag);
  7924. END;
  7925. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7926. result := s0;
  7927. (* ---- BIT ----- *)
  7928. |Global.systemBit:
  7929. Evaluate(p0,s0);
  7930. ToMemory(s0.op,addressType,0);
  7931. ReuseCopy(res,s0.op);
  7932. ReleaseOperand(s0);
  7933. Evaluate(p1,s1);
  7934. Emit(Ror(position,res,res,s1.op));
  7935. ReleaseOperand(s1);
  7936. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7937. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7938. IF ~conditional THEN
  7939. InitOperand(result,ModeValue); result.op := res;
  7940. ELSE
  7941. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7942. BrL(falseLabel);
  7943. ReleaseIntermediateOperand(res);
  7944. END;
  7945. (* --- MSK ----*)
  7946. |Global.systemMsk:
  7947. Evaluate(p0,s0);
  7948. Evaluate(p1,s1);
  7949. ReuseCopy(res,s0.op);
  7950. ReleaseOperand(s0);
  7951. Emit(And(position,res,res,s1.op));
  7952. ReleaseOperand(s1);
  7953. InitOperand(result,ModeValue);
  7954. result.op := res;
  7955. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7956. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7957. Evaluate(p0,s0);
  7958. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7959. ReleaseOperand(s0);
  7960. InitOperand(result,ModeValue);
  7961. result.op := res;
  7962. (* ---- SYSTEM.GetStackPointer ----- *)
  7963. |Global.systemGetStackPointer:
  7964. InitOperand(result,ModeValue);
  7965. result.op := sp;
  7966. (* ---- SYSTEM.GetFramePointer ----- *)
  7967. |Global.systemGetFramePointer:
  7968. InitOperand(result,ModeValue);
  7969. result.op := fp;
  7970. (* ---- SYSTEM.GetActivity ----- *)
  7971. |Global.systemGetActivity:
  7972. ASSERT(backend.cooperative);
  7973. InitOperand(result,ModeValue);
  7974. result.op := ap;
  7975. (* ---- SYSTEM.SetStackPointer ----- *)
  7976. |Global.systemSetStackPointer:
  7977. Evaluate(p0,s0); (* *)
  7978. Emit(Mov(position,sp,s0.op));
  7979. ReleaseOperand(s0);
  7980. (* ---- SYSTEM.SetFramePointer ----- *)
  7981. |Global.systemSetFramePointer:
  7982. Evaluate(p0,s0); (* *)
  7983. Emit(Mov(position,fp,s0.op));
  7984. ReleaseOperand(s0);
  7985. (* ---- SYSTEM.Activity ----- *)
  7986. |Global.systemSetActivity:
  7987. ASSERT(backend.cooperative);
  7988. Evaluate(p0,s0); (* *)
  7989. Emit(Mov(position,ap,s0.op));
  7990. ReleaseOperand(s0);
  7991. (* ---- SYSTEM.VAL ----- *)
  7992. |Global.systemVal:
  7993. Expression(p1);
  7994. s1 := result;
  7995. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7996. IF s1.mode = ModeReference THEN
  7997. (* nothing to be done if not record type, just take over new type *)
  7998. IF (type IS SyntaxTree.RecordType) THEN
  7999. ReleaseIntermediateOperand(s1.tag);
  8000. s1.tag := TypeDescriptorAdr(type);
  8001. IF ~newObjectFile THEN
  8002. IntermediateCode.MakeMemory(s1.tag,addressType);
  8003. END;
  8004. UseIntermediateOperand(s1.tag);
  8005. END;
  8006. result := s1;
  8007. ELSE (* copy over result to different type, may not use convert *)
  8008. itype := IntermediateCode.GetType(system,type);
  8009. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8010. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8011. Emit(Mov(position,s0.op,s1.op));
  8012. ReleaseOperand(s1);
  8013. InitOperand(result,ModeValue);
  8014. result.op := s0.op;
  8015. ELSE (* different size, must convert *)
  8016. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8017. Convert(s1.op, IntermediateCode.GetType(system,type));
  8018. result := s1;
  8019. END;
  8020. END;
  8021. (* ---- SYSTEM.GET ----- *)
  8022. |Global.systemGet:
  8023. Evaluate(p0,s0); (* adr *)
  8024. Designate(p1,s1); (* variable *)
  8025. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8026. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8027. Emit(Mov(position,s1.op,s0.op));
  8028. ReleaseOperand(s1);
  8029. ReleaseOperand(s0);
  8030. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8031. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8032. Evaluate(p0,s0); (* *)
  8033. Evaluate(p1,s1); (* variable *)
  8034. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8035. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8036. (* real part *)
  8037. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8038. Emit(Mov(position,res, s1.op));
  8039. ReleaseIntermediateOperand(res);
  8040. (* imaginary part *)
  8041. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8042. Emit(Mov(position,res, s1.tag));
  8043. ReleaseIntermediateOperand(res);
  8044. ReleaseOperand(s1);
  8045. ReleaseOperand(s0);
  8046. ELSE
  8047. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8048. ReleaseOperand(s0);
  8049. Emit(Mov(position,res,s1.op));
  8050. ReleaseIntermediateOperand(res);
  8051. ReleaseOperand(s1);
  8052. END;
  8053. (* ---- SYSTEM.MOVE ----- *)
  8054. |Global.systemMove:
  8055. Evaluate(p0,s0);
  8056. Evaluate(p1,s1);
  8057. Evaluate(p2,s2);
  8058. Emit(Copy(position,s1.op,s0.op,s2.op));
  8059. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8060. (* ---- SYSTEM.NEW ----- *)
  8061. |Global.systemNew:
  8062. Designate(p0,s0);
  8063. Emit(Push(position,s0.op));
  8064. ReleaseOperand(s0);
  8065. Evaluate(p1,s1);
  8066. Emit(Push(position,s1.op));
  8067. ReleaseOperand(s1);
  8068. (* push realtime flag: false by default *)
  8069. Emit(Push(position,false));
  8070. CallThis(position,"Heaps","NewSys",3);
  8071. (* ---- SYSTEM.CALL ----- *)
  8072. |Global.systemRef:
  8073. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8074. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8075. s0.mode := ModeValue;
  8076. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8077. result := s0
  8078. (* ---- INCR ----- *)
  8079. |Global.Incr:
  8080. Designate(p0,operand);
  8081. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8082. Dereference(operand,p0.type.resolved,FALSE);
  8083. END;
  8084. ASSERT(p1 # NIL);
  8085. Evaluate(p1,l);
  8086. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8087. ReleaseOperand(operand); ReleaseOperand(l);
  8088. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8089. (* ---- SUM ----- *)
  8090. |Global.Sum: HALT(200);
  8091. (* ---- ALL ----- *)
  8092. |Global.All: HALT(200);
  8093. (* ---- CAS ----- *)
  8094. |Global.Cas:
  8095. needsTrace := p0.NeedsTrace();
  8096. IF needsTrace THEN ModifyAssignments(true) END;
  8097. Designate(p0,s0);
  8098. Evaluate(p1,s1);
  8099. Evaluate(p2,s2);
  8100. IF needsTrace THEN
  8101. Emit(Push(position, s0.op));
  8102. Emit(Push(position, s1.op));
  8103. Emit(Push(position, s2.op));
  8104. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8105. ELSE
  8106. Emit(Cas(position,s0.op,s1.op,s2.op));
  8107. END;
  8108. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8109. IF needsTrace THEN ModifyAssignments(false) END;
  8110. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8111. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8112. IF conditional THEN
  8113. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8114. BrL(falseLabel);
  8115. ReleaseIntermediateOperand(res);
  8116. END;
  8117. (* ---- DIM ----- *)
  8118. |Global.Dim:
  8119. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8120. Designate(p0,s0);
  8121. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8122. Dereference(s0,p0.type.resolved,FALSE);
  8123. END;
  8124. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8125. ReleaseOperand(s0);
  8126. (* ---- RESHAPE ----- *)
  8127. |Global.Reshape:
  8128. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8129. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8130. left.SetType(procedure.type);
  8131. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8132. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8133. END;
  8134. (* ---- SYSTEM.TYPECODE ----- *)
  8135. |Global.systemTypeCode:
  8136. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8137. IF type.resolved IS SyntaxTree.PointerType THEN
  8138. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8139. END;
  8140. result.op := TypeDescriptorAdr(type);
  8141. IF ~newObjectFile THEN
  8142. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  8143. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  8144. END;
  8145. result.mode := ModeValue;
  8146. (* ---- SYSTEM.TRACE ----- *)
  8147. |Global.systemTrace:
  8148. SystemTrace(x.parameters, x.position);
  8149. (* ----- CONNECT ------*)
  8150. |Global.Connect:
  8151. IF backend.cellsAreObjects THEN
  8152. PushPort(p0);
  8153. PushPort(p1);
  8154. IF p2 # NIL THEN
  8155. Evaluate(p2, s2);
  8156. Emit(Push(p2.position, s2.op));
  8157. ReleaseOperand(s2);
  8158. ELSE
  8159. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8160. END;
  8161. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8162. ELSE
  8163. Warning(x.position, "cannot run on final hardware");
  8164. END;
  8165. (* ----- DELEGATE ------*)
  8166. |Global.Delegate:
  8167. IF backend.cellsAreObjects THEN
  8168. PushPort(p0);
  8169. PushPort(p1);
  8170. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8171. ELSE
  8172. Warning(x.position, "cannot run on final hardware");
  8173. END;
  8174. (* ----- SEND ------*)
  8175. |Global.Send:
  8176. Evaluate(p0,s0);
  8177. Evaluate(p1,s1);
  8178. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8179. Emit(Push(position,s0.op));
  8180. Emit(Push(position,s1.op));
  8181. (*
  8182. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8183. *)
  8184. IF ~backend.cellsAreObjects THEN
  8185. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8186. END;
  8187. ReleaseOperand(s0);
  8188. ReleaseOperand(s1);
  8189. IF backend.cellsAreObjects THEN
  8190. CallThis(position,"ActiveCellsRuntime","Send",2);
  8191. ELSE
  8192. CallThis(position,ChannelModuleName,"Send",2);
  8193. END;
  8194. (* ----- RECEIVE ------*)
  8195. |Global.Receive:
  8196. Evaluate(p0,s0);
  8197. Emit(Push(position,s0.op));
  8198. Designate(p1,s1);
  8199. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8200. Emit(Push(position,s1.op));
  8201. IF p2 # NIL THEN
  8202. Designate(p2,s2);
  8203. Emit(Push(position,s2.op));
  8204. END;
  8205. (*
  8206. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8207. *)
  8208. IF ~backend.cellsAreObjects THEN
  8209. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8210. END;
  8211. ReleaseOperand(s0);
  8212. ReleaseOperand(s1);
  8213. ReleaseOperand(s2);
  8214. IF backend.cellsAreObjects THEN
  8215. IF p2 = NIL THEN
  8216. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8217. ELSE
  8218. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8219. END;
  8220. ELSE
  8221. IF p2 = NIL THEN
  8222. CallThis(position,ChannelModuleName,"Receive",2)
  8223. ELSE
  8224. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8225. END;
  8226. END;
  8227. | Global.systemSpecial:
  8228. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8229. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8230. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8231. (* determine if parameters are of the VAR kind *)
  8232. ASSERT(x.parameters.Length() <= 3);
  8233. formalParameter := procedureType.firstParameter;
  8234. FOR i := 0 TO x.parameters.Length() - 1 DO
  8235. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8236. formalParameter := formalParameter.nextParameter
  8237. END;
  8238. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8239. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8240. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8241. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8242. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8243. IF procedureType.returnType # NIL THEN
  8244. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8245. Emit(Result(position, res));
  8246. (*InitOperand(result,ModeValue);
  8247. result.op := res;
  8248. *)
  8249. IF ~conditional THEN
  8250. InitOperand(result,ModeValue); result.op := res;
  8251. ELSE
  8252. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8253. BrL(falseLabel);
  8254. ReleaseIntermediateOperand(res);
  8255. END;
  8256. END
  8257. ELSE (* function not yet implemented *)
  8258. Error(position,"not yet implemented");
  8259. END;
  8260. destination := dest;
  8261. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8262. END VisitBuiltinCallDesignator;
  8263. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  8264. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8265. BEGIN
  8266. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8267. dest := destination; destination := emptyOperand;
  8268. Expression(x.left);
  8269. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8270. ELSIF isUnchecked THEN (* no check *)
  8271. ELSE
  8272. trueL := NewLabel();
  8273. falseL := NewLabel();
  8274. IF IsPointerToRecord(x.left.type,recordType) THEN
  8275. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8276. Emit(Mov(position,tag, result.op));
  8277. IF result.mode # ModeValue THEN
  8278. ptr := tag;
  8279. IntermediateCode.MakeMemory(ptr,addressType);
  8280. Emit(Mov(position,tag, ptr));
  8281. END;
  8282. IF ~backend.cooperative THEN
  8283. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8284. END;
  8285. IntermediateCode.MakeMemory(tag,addressType);
  8286. ELSE
  8287. tag := result.tag;
  8288. UseIntermediateOperand(tag);
  8289. END;
  8290. TypeTest(tag,x.type,trueL,falseL);
  8291. ReleaseIntermediateOperand(tag);
  8292. SetLabel(falseL);
  8293. EmitTrap(position,TypeCheckTrap);
  8294. SetLabel(trueL);
  8295. END;
  8296. destination := dest;
  8297. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8298. END VisitTypeGuardDesignator;
  8299. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8300. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8301. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8302. VAR label: Label; pc: LONGINT;
  8303. BEGIN
  8304. IF backend.cooperative & ~isUnchecked THEN
  8305. pc := section.pc;
  8306. label := NewLabel();
  8307. BrneL(label, operand.op, nil);
  8308. EmitTrap(position, NilPointerTrap);
  8309. SetLabel(label);
  8310. INC(statCoopNilCheck, section.pc - pc);
  8311. END;
  8312. END NilCheck;
  8313. BEGIN
  8314. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8315. ReuseCopy(dereferenced,operand.op);
  8316. ReleaseOperand(operand);
  8317. operand.mode := ModeReference;
  8318. operand.op := dereferenced;
  8319. operand.tag := dereferenced;
  8320. UseIntermediateOperand(operand.tag);
  8321. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8322. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8323. ReleaseIntermediateOperand(operand.tag);
  8324. operand.tag := TypeDescriptorAdr(type);
  8325. IF ~newObjectFile THEN
  8326. IntermediateCode.MakeMemory(operand.tag,addressType);
  8327. END;
  8328. ELSE
  8329. IF ~backend.cooperative THEN
  8330. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8331. END;
  8332. IntermediateCode.MakeMemory(operand.tag,addressType);
  8333. END;
  8334. NilCheck(operand.op);
  8335. ELSIF type IS SyntaxTree.ArrayType THEN
  8336. IF isUnsafe THEN
  8337. NilCheck(operand.op);
  8338. ReleaseIntermediateOperand(operand.tag);
  8339. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8340. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8341. ELSE
  8342. operand.tag := emptyOperand;
  8343. END;
  8344. ELSE
  8345. NilCheck(operand.op);
  8346. IF backend.cooperative THEN
  8347. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8348. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8349. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8350. ELSE
  8351. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8352. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8353. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8354. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8355. END;
  8356. END;
  8357. ELSIF type IS SyntaxTree.MathArrayType THEN
  8358. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8359. IntermediateCode.MakeMemory(operand.op,addressType);
  8360. ELSE HALT(100);
  8361. END;
  8362. END Dereference;
  8363. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8364. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8365. BEGIN
  8366. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8367. dest := destination; destination := emptyOperand;
  8368. Evaluate(x.left,d);
  8369. type := x.type.resolved;
  8370. prevIsUnchecked := isUnchecked;
  8371. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8372. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8373. END;
  8374. Dereference(d,type,IsUnsafePointer(x.left.type));
  8375. isUnchecked := prevIsUnchecked;
  8376. result := d;
  8377. 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
  8378. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8379. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8380. END;
  8381. END;
  8382. destination := dest;
  8383. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8384. END VisitDereferenceDesignator;
  8385. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8386. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8387. BEGIN
  8388. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8389. dest := destination; destination := emptyOperand;
  8390. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8391. tag := result.op;
  8392. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8393. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8394. StaticCallOperand(result,procedure.super);
  8395. ReleaseIntermediateOperand(result.tag);
  8396. UseIntermediateOperand(tag); (* necessary ? *)
  8397. result.tag := tag;
  8398. destination := dest;
  8399. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8400. END VisitSupercallDesignator;
  8401. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8402. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8403. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8404. name: Basic.SegmentedName;
  8405. procedure: SyntaxTree.Procedure;
  8406. procedureType: SyntaxTree.ProcedureType;
  8407. BEGIN
  8408. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8409. dest := destination; destination := emptyOperand;
  8410. scope := currentScope;
  8411. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8412. scope := scope.outerScope;
  8413. END;
  8414. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8415. IF newObjectFile THEN
  8416. moduleSection := meta.ModuleSection();
  8417. IF backend.cooperative THEN
  8418. moduleOffset := 0;
  8419. ELSE
  8420. moduleOffset := moduleSection.pc;
  8421. END;
  8422. result.mode := ModeValue;
  8423. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8424. ELSE
  8425. Symbol(moduleSelf,result);
  8426. IntermediateCode.MakeMemory(result.op,addressType);
  8427. END
  8428. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8429. result.mode := ModeValue;
  8430. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8431. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8432. ELSE
  8433. GetBaseRegister(basereg,currentScope,scope);
  8434. InitOperand(result,ModeReference);
  8435. result.op := basereg;
  8436. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8437. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8438. parametersSize := ProcedureParametersSize(system,procedure);
  8439. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8440. IF backend.cooperative THEN
  8441. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8442. END;
  8443. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8444. MakeMemory(result.op, result.op, addressType, 0);
  8445. END;
  8446. (* tag must be loaded when dereferencing SELF pointer *)
  8447. END;
  8448. destination := dest;
  8449. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8450. END VisitSelfDesignator;
  8451. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8452. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8453. BEGIN
  8454. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8455. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8456. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8457. parameter := procedureType.returnParameter;
  8458. IF currentIsInline THEN
  8459. map := currentMapper.Get(NIL);
  8460. IF map # NIL THEN
  8461. Designate(map.to, result);
  8462. ELSE
  8463. HALT(200);
  8464. END;
  8465. RETURN;
  8466. END;
  8467. VisitParameter(parameter);
  8468. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8469. END VisitResultDesignator;
  8470. (** values *)
  8471. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8472. BEGIN
  8473. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8474. IF conditional THEN
  8475. IF x.value THEN BrL(trueLabel)
  8476. ELSE BrL(falseLabel)
  8477. END;
  8478. ELSE
  8479. InitOperand(result,ModeValue);
  8480. IF x.value THEN result.op := true ELSE result.op := false END;
  8481. END;
  8482. END VisitBooleanValue;
  8483. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8484. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8485. BEGIN
  8486. Global.GetModuleSegmentedName(module.module, name);
  8487. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8488. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8489. RETURN section
  8490. END GetDataSection;
  8491. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8492. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8493. BEGIN
  8494. type := vop.type;
  8495. data := GetDataSection();
  8496. pc := EnterImmediate(data,vop);
  8497. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8498. IntermediateCode.MakeMemory(vop, type);
  8499. END GetImmediateMem;
  8500. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8501. BEGIN
  8502. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8503. InitOperand(result,ModeValue);
  8504. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8505. IF ~supportedImmediate(result.op) &~inData THEN
  8506. GetImmediateMem(result.op)
  8507. END;
  8508. END VisitIntegerValue;
  8509. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8510. BEGIN
  8511. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8512. InitOperand(result,ModeValue);
  8513. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8514. END VisitCharacterValue;
  8515. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8516. BEGIN
  8517. IF Trace THEN TraceEnter("VisitSetValue") END;
  8518. InitOperand(result,ModeValue);
  8519. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8520. END VisitSetValue;
  8521. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8522. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8523. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8524. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8525. BEGIN
  8526. numberElements := x.elements.Length();
  8527. FOR i := 0 TO numberElements-1 DO
  8528. expression := x.elements.GetExpression(i);
  8529. IF expression IS SyntaxTree.MathArrayExpression THEN
  8530. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8531. ELSE
  8532. inData := TRUE;
  8533. Evaluate(expression,op);
  8534. irv.Emit(Data(position,op.op));
  8535. inData := FALSE;
  8536. ReleaseOperand(op);
  8537. END;
  8538. END;
  8539. END RecursiveData;
  8540. BEGIN
  8541. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8542. IF ~TryConstantDeclaration() THEN
  8543. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8544. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8545. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8546. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8547. ELSE
  8548. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8549. END;
  8550. RecursiveData(x.array);
  8551. InitOperand(result,ModeReference);
  8552. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8553. END
  8554. END VisitMathArrayValue;
  8555. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8556. VAR constant: Sections.Section;
  8557. BEGIN
  8558. IF constantDeclaration = NIL THEN
  8559. RETURN FALSE
  8560. ELSE
  8561. (* Is a constant in this module: did we generate it already? *)
  8562. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8563. IF constant # NIL THEN
  8564. InitOperand(result,ModeReference);
  8565. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8566. RETURN TRUE;
  8567. END;
  8568. END;
  8569. RETURN FALSE
  8570. END TryConstantDeclaration;
  8571. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8572. BEGIN
  8573. constantDeclaration := x;
  8574. x.value.resolved.Accept(SELF);
  8575. END VisitConstant;
  8576. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8577. BEGIN
  8578. IF Trace THEN TraceEnter("VisitRealValue") END;
  8579. InitOperand(result,ModeValue);
  8580. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8581. END VisitRealValue;
  8582. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8583. VAR
  8584. componentType: SyntaxTree.Type;
  8585. BEGIN
  8586. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8587. ASSERT(x.type IS SyntaxTree.ComplexType);
  8588. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8589. InitOperand(result,ModeValue);
  8590. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8591. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8592. END VisitComplexValue;
  8593. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8594. VAR i: LONGINT; name: Basic.SegmentedName;
  8595. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8596. BEGIN
  8597. IF Trace THEN TraceEnter("VisitStringValue") END;
  8598. IF ~TryConstantDeclaration() THEN
  8599. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8600. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8601. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8602. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8603. ELSE
  8604. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8605. END;
  8606. FOR i := 0 TO x.length-1 DO
  8607. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8608. irv.Emit(Data(position,op));
  8609. END;
  8610. InitOperand(result,ModeReference);
  8611. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8612. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8613. END
  8614. END VisitStringValue;
  8615. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8616. BEGIN
  8617. IF Trace THEN TraceEnter("VisitNilValue") END;
  8618. InitOperand(result,ModeValue);
  8619. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8620. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8621. END VisitNilValue;
  8622. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8623. BEGIN
  8624. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8625. InitOperand(result,ModeValue);
  8626. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8627. END VisitEnumerationValue;
  8628. (** symbols *)
  8629. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8630. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8631. END VisitImport;
  8632. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8633. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8634. BEGIN
  8635. IF scope # baseScope THEN
  8636. (* left := [fp+8] *)
  8637. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8638. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8639. ReuseCopy(left,right);
  8640. ReleaseIntermediateOperand(right);
  8641. scope := scope.outerScope; DEC(level);
  8642. (* { left := [left+8] } *)
  8643. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8644. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8645. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8646. Emit(Mov(position,left,right));
  8647. scope := scope.outerScope; DEC(level);
  8648. END;
  8649. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8650. result := left;
  8651. ELSE
  8652. result := fp;
  8653. END;
  8654. END GetBaseRegister;
  8655. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8656. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8657. BEGIN
  8658. IF Trace THEN TraceEnter("VisitVariable"); END;
  8659. type := x.type.resolved;
  8660. IF (x.useRegister) THEN
  8661. InitOperand(result, ModeValue);
  8662. IF x.registerNumber < 0 THEN
  8663. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8664. reg := x.registerNumber;
  8665. ELSE
  8666. reg := registerUsageCount.Map(x.registerNumber);
  8667. UseRegister(reg);
  8668. END;
  8669. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8670. ELSIF x.externalName # NIL THEN
  8671. InitOperand(result,ModeReference);
  8672. Basic.ToSegmentedName(x.externalName^, name);
  8673. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8674. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8675. InitOperand(result,ModeReference);
  8676. GetBaseRegister(result.op,currentScope,x.scope);
  8677. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8678. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8679. InitOperand(result,ModeReference);
  8680. GetCodeSectionNameForSymbol(x,name);
  8681. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8682. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8683. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8684. InitOperand(result,ModeReference);
  8685. GetCodeSectionNameForSymbol(x,name);
  8686. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8687. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8688. ELSE (* field, left designator must have been emitted *)
  8689. ASSERT(result.mode = ModeReference);
  8690. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8691. ReuseCopy(temp,result.op);
  8692. ReleaseIntermediateOperand(result.op);
  8693. result.op := temp;
  8694. END;
  8695. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8696. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8697. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8698. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8699. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8700. END;
  8701. END;
  8702. END;
  8703. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8704. ValueToCondition(result);
  8705. ELSIF type IS SyntaxTree.ProcedureType THEN
  8706. ReleaseIntermediateOperand(result.tag);
  8707. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8708. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8709. UseIntermediateOperand(result.tag);
  8710. ELSE
  8711. result.tag := nil; (* nil *)
  8712. END;
  8713. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8714. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8715. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8716. ReleaseIntermediateOperand(result.tag);
  8717. Global.GetSymbolSegmentedName(x,name);
  8718. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8719. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8720. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8721. ELSE
  8722. END;
  8723. ELSE
  8724. ReleaseIntermediateOperand(result.tag);
  8725. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8726. END;
  8727. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8728. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8729. ReleaseIntermediateOperand(result.tag);
  8730. result.tag := result.op;
  8731. UseIntermediateOperand(result.tag);
  8732. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8733. IntermediateCode.MakeMemory(result.op,addressType);
  8734. END;
  8735. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8736. ReleaseIntermediateOperand(result.tag);
  8737. result.tag := TypeDescriptorAdr(type);
  8738. IF ~newObjectFile THEN
  8739. IntermediateCode.MakeMemory(result.tag,addressType);
  8740. END;
  8741. UseIntermediateOperand(result.tag);
  8742. (* tag for pointer type computed not here but during dereferencing *)
  8743. END;
  8744. IF Trace THEN TraceExit("VisitVariable") END;
  8745. END VisitVariable;
  8746. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8747. BEGIN
  8748. VisitVariable(property);
  8749. END VisitProperty;
  8750. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8751. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8752. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8753. BEGIN
  8754. type := x.type.resolved;
  8755. IF Trace THEN TraceEnter("VisitParameter") END;
  8756. IF x.ownerType IS SyntaxTree.CellType THEN
  8757. ptype := x.type.resolved;
  8758. IF backend.cellsAreObjects THEN
  8759. ASSERT(result.mode = ModeReference);
  8760. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8761. ReuseCopy(temp,result.op);
  8762. ReleaseIntermediateOperand(result.op);
  8763. result.op := temp;
  8764. END;
  8765. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8766. RETURN;
  8767. ELSE
  8768. InitOperand(result,ModeReference);
  8769. GetCodeSectionNameForSymbol(x,name);
  8770. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8771. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8772. RETURN;
  8773. END;
  8774. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8775. InitOperand(result,ModeReference);
  8776. GetCodeSectionNameForSymbol(x,name);
  8777. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8778. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8779. RETURN
  8780. ELSE
  8781. GetBaseRegister(basereg,currentScope,x.scope);
  8782. InitOperand(result,ModeReference);
  8783. result.op := basereg;
  8784. END;
  8785. IF IsOpenArray(type) THEN
  8786. result.tag := basereg;
  8787. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8788. IntermediateCode.MakeMemory(result.op,addressType);
  8789. IF Global.IsOberonProcedure(x.ownerType) THEN
  8790. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8791. UseIntermediateOperand(result.tag);
  8792. ELSE
  8793. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8794. END;
  8795. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8796. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8797. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8798. ELSIF IsStaticArray(type) THEN
  8799. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8800. IntermediateCode.MakeMemory(result.op,addressType);
  8801. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8802. ELSIF type IS SyntaxTree.MathArrayType THEN
  8803. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8804. WITH type: SyntaxTree.MathArrayType DO
  8805. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8806. IF type.form = SyntaxTree.Tensor THEN
  8807. ELSIF type.form = SyntaxTree.Open THEN
  8808. result.tag := result.op;
  8809. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8810. IntermediateCode.MakeMemory(result.op,addressType);
  8811. UseIntermediateOperand(result.tag);
  8812. ELSIF type.form = SyntaxTree.Static THEN
  8813. IF x.kind = SyntaxTree.ConstParameter THEN
  8814. IntermediateCode.MakeMemory(result.op,addressType);
  8815. END;
  8816. ELSE HALT(100)
  8817. END;
  8818. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8819. IF type.form = SyntaxTree.Tensor THEN
  8820. ToMemory(result.op,addressType,0);
  8821. ELSIF type.form = SyntaxTree.Open THEN
  8822. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8823. ReuseCopy(result.tag, mem);
  8824. ReleaseIntermediateOperand(mem);
  8825. ReleaseIntermediateOperand(result.op);
  8826. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8827. ELSIF type.form = SyntaxTree.Static THEN
  8828. IntermediateCode.MakeMemory(result.op,addressType);
  8829. ELSE HALT(100)
  8830. END;
  8831. ELSE HALT(100)
  8832. END;
  8833. END;
  8834. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8835. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8836. IntermediateCode.MakeMemory(result.op,addressType);
  8837. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8838. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8839. END;
  8840. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8841. ValueToCondition(result);
  8842. ELSIF type IS SyntaxTree.ProcedureType THEN
  8843. ReleaseIntermediateOperand(result.tag);
  8844. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8845. IF x.kind = SyntaxTree.VarParameter THEN
  8846. ReuseCopy(result.tag,result.op);
  8847. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8848. IntermediateCode.MakeMemory(result.tag,addressType);
  8849. ELSE
  8850. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8851. UseIntermediateOperand(result.tag);
  8852. END;
  8853. ELSE
  8854. result.tag := nil;
  8855. END;
  8856. (* tag for pointer type computed not here but during dereferencing *)
  8857. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  8858. ReleaseIntermediateOperand(result.tag);
  8859. result.tag := basereg;
  8860. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8861. IntermediateCode.MakeMemory(result.tag,addressType);
  8862. UseIntermediateOperand(result.tag);
  8863. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  8864. ReleaseIntermediateOperand(result.tag);
  8865. result.tag := TypeDescriptorAdr(type);
  8866. IF ~newObjectFile THEN
  8867. IntermediateCode.MakeMemory(result.tag,addressType);
  8868. END;
  8869. UseIntermediateOperand(result.tag);
  8870. END;
  8871. IF Trace THEN TraceExit("VisitParameter") END;
  8872. END VisitParameter;
  8873. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8874. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8875. BEGIN
  8876. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8877. (* left.p: left already emitted *)
  8878. tag := result.op; (* value of pointer to left *)
  8879. (* get type desc *)
  8880. tmp := result.tag;
  8881. IntermediateCode.MakeMemory(tmp,addressType);
  8882. (* get method adr *)
  8883. Reuse1(reg,tmp);
  8884. ReleaseIntermediateOperand(tmp);
  8885. IF backend.cooperative THEN
  8886. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8887. WHILE recordType.baseType # NIL DO
  8888. recordType := recordType.GetBaseRecord ();
  8889. END;
  8890. GetRecordTypeName (recordType,name);
  8891. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8892. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8893. offset := 0;
  8894. ELSE
  8895. offset := 2;
  8896. END;
  8897. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8898. ELSE
  8899. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8900. END;
  8901. InitOperand(operand,ModeReference);
  8902. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8903. operand.op := reg;
  8904. operand.tag := tag;
  8905. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8906. END DynamicCallOperand;
  8907. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8908. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8909. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8910. BEGIN
  8911. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8912. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8913. tag := operand.op;
  8914. ReleaseIntermediateOperand(operand.tag);
  8915. ELSE tag := nil
  8916. END;
  8917. IF x.isInline THEN
  8918. sectionType := Sections.InlineCodeSection;
  8919. ELSE
  8920. sectionType := Sections.CodeSection;
  8921. END;
  8922. IF x.externalName # NIL THEN
  8923. Basic.ToSegmentedName(x.externalName^, name);
  8924. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8925. ELSE
  8926. GetCodeSectionNameForSymbol(x, name);
  8927. IF (x.scope.ownerModule = module.module) THEN
  8928. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8929. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8930. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8931. IF source.pc = 0 THEN (* no code yet *)
  8932. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8933. END;
  8934. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8935. bits := x.procedureScope.body.code.inlineCode;
  8936. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8937. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8938. binary.CopyBits(bits, 0, bits.GetSize());
  8939. source.SetResolved(binary);
  8940. ELSE
  8941. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8942. END;
  8943. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8944. END;
  8945. InitOperand(operand,ModeValue);
  8946. operand.op := reg;
  8947. operand.tag := tag;
  8948. IF Trace THEN TraceExit("StaticCallOperand") END;
  8949. END StaticCallOperand;
  8950. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8951. (* handle expressions of the form designator.procedure or procedure *)
  8952. BEGIN
  8953. IF Trace THEN TraceEnter("VisitProcedure") END;
  8954. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  8955. DynamicCallOperand(result,x);
  8956. ELSIF x.isInline THEN
  8957. StaticCallOperand(result,x);
  8958. ELSE
  8959. StaticCallOperand(result,x);
  8960. END;
  8961. IF Trace THEN TraceExit("VisitProcedure") END;
  8962. END VisitProcedure;
  8963. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8964. BEGIN
  8965. VisitProcedure(x);
  8966. END VisitOperator;
  8967. (** statements *)
  8968. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8969. BEGIN
  8970. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8971. Expression(x.call);
  8972. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8973. ReleaseOperand(result)
  8974. END;
  8975. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8976. END VisitProcedureCallStatement;
  8977. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8978. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8979. leftBase, rightBase: SyntaxTree.Type;
  8980. procedureName,s: SyntaxTree.IdentifierString;
  8981. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8982. size: LONGINT; rightKind: LONGINT;
  8983. dummy: IntermediateCode.Operand;
  8984. CONST moduleName = "FoxArrayBase";
  8985. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8986. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8987. BEGIN
  8988. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8989. IF base IS SyntaxTree.MathArrayType THEN
  8990. base := OpenArray(base(SyntaxTree.MathArrayType));
  8991. END;
  8992. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8993. result.SetArrayBase(base);
  8994. RETURN result
  8995. END OpenArray;
  8996. BEGIN
  8997. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8998. SaveRegisters();ReleaseUsedRegisters(saved);
  8999. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9000. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9001. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9002. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9003. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9004. IF leftType.form = SyntaxTree.Tensor THEN
  9005. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9006. ELSIF leftType.form = SyntaxTree.Open THEN
  9007. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9008. ELSIF leftType.form = SyntaxTree.Static THEN
  9009. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9010. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9011. END;
  9012. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9013. IF procedure = NIL THEN
  9014. s := "Instruction not supported on target, emulation procedure ";
  9015. Strings.Append(s,moduleName);
  9016. Strings.Append(s,".");
  9017. Strings.Append(s,procedureName);
  9018. Strings.Append(s," not present");
  9019. Error(position,s);
  9020. ELSE
  9021. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9022. parameter.SetType(leftType);
  9023. parameter.SetAccess(SyntaxTree.Internal);
  9024. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9025. parameter.SetKind(rightKind);
  9026. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9027. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9028. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  9029. StaticCallOperand(result,procedure);
  9030. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  9031. ReleaseOperand(result);
  9032. END;
  9033. RestoreRegisters(saved);
  9034. END;
  9035. END AssignMathArray;
  9036. VAR modifyAssignmentCounter := 0: LONGINT;
  9037. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9038. VAR processor,mem,dst: IntermediateCode.Operand;
  9039. BEGIN
  9040. IF value.intValue = true.intValue THEN
  9041. INC(modifyAssignmentCounter);
  9042. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9043. modifyAssignmentsPC := section.pc;
  9044. ELSE
  9045. DEC(modifyAssignmentCounter);
  9046. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9047. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9048. END;
  9049. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9050. dst := NewRegisterOperand (addressType);
  9051. Emit(Mov(position,dst, processor));
  9052. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9053. Emit(Mov(position,mem, value));
  9054. ReleaseIntermediateOperand(dst);
  9055. END ModifyAssignments;
  9056. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9057. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9058. BEGIN
  9059. type := left.type.resolved;
  9060. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9061. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9062. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9063. IF procedureType.returnParameter = parameter THEN
  9064. (* this is the only case where the destination can be dynamically smaller than the source
  9065. in all other cases the dynamic size has to be taken
  9066. *)
  9067. IF backend.cooperative THEN
  9068. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9069. ELSE
  9070. MakeMemory(mem, tag, addressType, 0);
  9071. END;
  9072. RETURN mem;
  9073. END;
  9074. END;
  9075. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9076. END CopySize;
  9077. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9078. VAR
  9079. leftO, rightO: Operand;
  9080. arg,mem, sizeOp: IntermediateCode.Operand;
  9081. leftType, rightType, componentType, base: SyntaxTree.Type;
  9082. size: LONGINT;
  9083. parameters: SyntaxTree.ExpressionList;
  9084. procedure: SyntaxTree.Procedure;
  9085. call: SyntaxTree.ProcedureCallDesignator;
  9086. designator: SyntaxTree.Designator;
  9087. saved: RegisterEntry;
  9088. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9089. VAR procedureType: SyntaxTree.ProcedureType;
  9090. BEGIN
  9091. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9092. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9093. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9094. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9095. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9096. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9097. IF right.id = Global.Reshape THEN RETURN TRUE
  9098. END;
  9099. END;
  9100. END;
  9101. END;
  9102. RETURN FALSE
  9103. END CanPassAsResultParameter;
  9104. BEGIN
  9105. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9106. leftType := left.type.resolved; rightType:= right.type.resolved;
  9107. IF backend.cooperative & left.NeedsTrace() THEN
  9108. ModifyAssignments(true);
  9109. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9110. Designate(right, rightO);
  9111. Designate(left, leftO);
  9112. ASSERT(leftO.mode = ModeReference);
  9113. TransferToRegister(leftO.op, leftO.op);
  9114. TransferToRegister(rightO.op, rightO.op);
  9115. Emit(Push(position, leftO.op));
  9116. Emit(Push(position, rightO.op));
  9117. CallAssignMethod(leftO.op, rightO.op, left.type);
  9118. Emit(Pop(position, rightO.op));
  9119. Emit(Pop(position, leftO.op));
  9120. sizeOp := CopySize(left, leftO.tag);
  9121. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9122. ReleaseIntermediateOperand(sizeOp);
  9123. ReleaseOperand(leftO);
  9124. ReleaseOperand(rightO);
  9125. ELSE
  9126. Evaluate(right,rightO);
  9127. Designate(left,leftO);
  9128. ASSERT(leftO.mode = ModeReference);
  9129. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9130. (* copy procedure address first *)
  9131. MakeMemory(mem,leftO.op,addressType,0);
  9132. Emit(Mov(position,mem,rightO.op));
  9133. ReleaseIntermediateOperand(mem);
  9134. (* copy pointer address *)
  9135. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9136. CallAssignPointer(leftO.tag, rightO.tag);
  9137. ELSE
  9138. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9139. CallAssignPointer(leftO.op, rightO.op);
  9140. END;
  9141. ReleaseOperand(leftO);
  9142. ReleaseOperand(rightO);
  9143. END;
  9144. ModifyAssignments(false);
  9145. RETURN;
  9146. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9147. SaveRegisters();ReleaseUsedRegisters(saved);
  9148. IF SemanticChecker.IsPointerType(leftType) THEN
  9149. Evaluate(right,rightO);
  9150. Designate(left,leftO);
  9151. Emit(Push(position,leftO.op));
  9152. ReleaseOperand(leftO);
  9153. Emit(Push(position,rightO.op));
  9154. ReleaseOperand(rightO);
  9155. CallThis(position,"Heaps","Assign",2);
  9156. ELSIF leftType.IsRecordType() THEN
  9157. Designate(right,rightO);
  9158. Designate(left,leftO);
  9159. Emit(Push(position,leftO.op));
  9160. Emit(Push(position,leftO.tag)); (* type desc *)
  9161. ReleaseOperand(leftO);
  9162. Emit(Push(position,rightO.op));
  9163. ReleaseOperand(rightO);
  9164. CallThis(position,"Heaps","AssignRecord",3);
  9165. ELSIF IsStaticArray(leftType) THEN
  9166. size := StaticArrayNumElements(leftType);
  9167. base := StaticArrayBaseType(leftType);
  9168. Designate(right,rightO);
  9169. Designate(left,leftO);
  9170. Emit(Push(position,leftO.op));
  9171. ReleaseOperand(leftO);
  9172. arg := TypeDescriptorAdr(base);
  9173. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9174. Emit(Push(position,arg));
  9175. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9176. Emit(Push(position,rightO.op));
  9177. ReleaseOperand(rightO);
  9178. CallThis(position,"Heaps","AssignArray",4);
  9179. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9180. size := StaticMathArrayNumElements(leftType);
  9181. base := StaticMathArrayBaseType(leftType);
  9182. Designate(right,rightO);
  9183. Designate(left,leftO);
  9184. Emit(Push(position,leftO.op));
  9185. ReleaseOperand(leftO);
  9186. arg := TypeDescriptorAdr(base);
  9187. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9188. Emit(Push(position,arg));
  9189. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9190. Emit(Push(position,rightO.op));
  9191. ReleaseOperand(rightO);
  9192. CallThis(position,"Heaps","AssignArray",4);
  9193. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9194. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9195. Evaluate(right,rightO);
  9196. Designate(left,leftO);
  9197. MakeMemory(mem,leftO.op,addressType,0);
  9198. Emit(Mov(position,mem,rightO.op));
  9199. ReleaseIntermediateOperand(mem);
  9200. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9201. Emit (Push(position, leftO.tag));
  9202. ReleaseOperand(leftO);
  9203. Emit (Push(position, rightO.tag));
  9204. ReleaseOperand(rightO);
  9205. CallThis(position,"Heaps","Assign", 2);
  9206. ELSE HALT(100); (* missing ? *)
  9207. END;
  9208. RestoreRegisters(saved);
  9209. RETURN;
  9210. END;
  9211. IF CanPassAsResultParameter(right) THEN
  9212. procedureResultDesignator := left(SyntaxTree.Designator);
  9213. Expression(right);
  9214. procedureResultDesignator := NIL;
  9215. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9216. (* left <-- ALIAS OF right: zerocopy *)
  9217. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9218. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9219. designator.SetType(procedure.type);
  9220. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9221. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9222. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9223. END;
  9224. ELSIF leftType IS SyntaxTree.RangeType THEN
  9225. (* LHS is of array range type *)
  9226. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9227. Evaluate(right, rightO);
  9228. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9229. (* first *)
  9230. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  9231. Emit(Mov(position,mem, rightO.op));
  9232. ReleaseIntermediateOperand(mem);
  9233. (* last *)
  9234. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9235. Emit(Mov(position,mem, rightO.tag));
  9236. ReleaseIntermediateOperand(mem);
  9237. (* step *)
  9238. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9239. Emit(Mov(position,mem, rightO.extra));
  9240. ReleaseIntermediateOperand(mem);
  9241. ReleaseOperand(rightO);
  9242. ReleaseOperand(leftO)
  9243. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9244. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9245. Evaluate(right, rightO);
  9246. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9247. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9248. (* real part *)
  9249. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9250. Emit(Mov(position,mem, rightO.op));
  9251. ReleaseIntermediateOperand(mem);
  9252. (* imaginary part *)
  9253. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9254. Emit(Mov(position,mem, rightO.tag));
  9255. ReleaseIntermediateOperand(mem);
  9256. ReleaseOperand(rightO);
  9257. ReleaseOperand(leftO)
  9258. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9259. OR (leftType IS SyntaxTree.PortType) THEN
  9260. (* rightO := leftO;*)
  9261. Evaluate(right,rightO);
  9262. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9263. Designate(left,leftO);
  9264. IF leftO.mode = ModeReference THEN
  9265. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9266. destination := mem;
  9267. ELSE
  9268. destination := leftO.op;
  9269. END;
  9270. ReleaseOperand(leftO);
  9271. IF destination.mode # IntermediateCode.Undefined THEN
  9272. Emit(Mov(position,destination,rightO.op));
  9273. END;
  9274. ReleaseOperand(rightO);
  9275. ReleaseIntermediateOperand(mem);
  9276. IntermediateCode.InitOperand(destination);
  9277. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9278. Evaluate(right,rightO);
  9279. Designate(left,leftO);
  9280. MakeMemory(mem,leftO.op,addressType,0);
  9281. Emit(Mov(position,mem,rightO.op));
  9282. ReleaseIntermediateOperand(mem);
  9283. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9284. (* delegate *)
  9285. (*
  9286. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9287. *)
  9288. Emit(Mov(position,leftO.tag,rightO.tag));
  9289. END;
  9290. ReleaseOperand(leftO);
  9291. ReleaseOperand(rightO);
  9292. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9293. Designate(right,rightO);
  9294. Designate(left,leftO);
  9295. sizeOp := CopySize(left, leftO.tag);
  9296. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9297. ReleaseIntermediateOperand(sizeOp);
  9298. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9299. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9300. IF (rightType IS SyntaxTree.StringType) THEN
  9301. CopyString(left,right);
  9302. 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
  9303. Designate(right,rightO);
  9304. Designate(left,leftO);
  9305. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9306. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9307. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9308. ELSE
  9309. HALT(201)
  9310. END;
  9311. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9312. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9313. Designate(right,rightO);
  9314. Designate(left,leftO);
  9315. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9316. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9317. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9318. ELSE
  9319. AssignMathArray(left,right);
  9320. END;
  9321. ELSE
  9322. HALT(200);
  9323. END;
  9324. END Assign;
  9325. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  9326. BEGIN
  9327. IF Trace THEN TraceEnter("VisitAssignment") END;
  9328. Assign(x.left,x.right);
  9329. IF Trace THEN TraceExit("VisitAssignment") END;
  9330. END VisitAssignment;
  9331. PROCEDURE EmitCooperativeSwitch;
  9332. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9333. BEGIN
  9334. ASSERT (cooperativeSwitches);
  9335. pc := section.pc;
  9336. IF lastSwitchPC = section.pc THEN RETURN END;
  9337. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9338. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9339. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9340. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9341. INC(statCoopSwitch, section.pc - pc);
  9342. END EmitCooperativeSwitch;
  9343. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  9344. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9345. BEGIN
  9346. p0 := communication.left; p1 := communication.right;
  9347. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9348. Evaluate(p0,s0);
  9349. Evaluate(p1,s1);
  9350. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9351. Emit(Push(position,s0.op));
  9352. Emit(Push(position,s1.op));
  9353. (*
  9354. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9355. *)
  9356. IF ~backend.cellsAreObjects THEN
  9357. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9358. END;
  9359. ReleaseOperand(s0);
  9360. ReleaseOperand(s1);
  9361. IF backend.cellsAreObjects THEN
  9362. CallThis(position,"ActiveCellsRuntime","Send",2);
  9363. ELSE
  9364. CallThis(position,ChannelModuleName,"Send",2);
  9365. END;
  9366. (* ----- RECEIVE ------*)
  9367. ELSE
  9368. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9369. tmp := p0; p0 := p1; p1 := tmp;
  9370. END;
  9371. Evaluate(p0,s0);
  9372. Emit(Push(position,s0.op));
  9373. Designate(p1,s1);
  9374. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9375. Emit(Push(position,s1.op));
  9376. (*
  9377. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9378. *)
  9379. IF ~backend.cellsAreObjects THEN
  9380. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9381. END;
  9382. ReleaseOperand(s0);
  9383. ReleaseOperand(s1);
  9384. IF backend.cellsAreObjects THEN
  9385. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9386. ELSE
  9387. CallThis(position,ChannelModuleName,"Receive",2)
  9388. END;
  9389. END;
  9390. END VisitCommunicationStatement;
  9391. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  9392. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9393. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9394. VAR true, false: Label; condition, value: BOOLEAN;
  9395. BEGIN
  9396. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9397. IF condition THEN
  9398. true := NewLabel();
  9399. false := NewLabel();
  9400. Condition(if.condition,true,false);
  9401. SetLabel(true);
  9402. StatementSequence(if.statements);
  9403. BrL(end);
  9404. SetLabel(false);
  9405. ELSE
  9406. IF value THEN (* always true *)
  9407. escape := TRUE;
  9408. StatementSequence(if.statements);
  9409. (* no branch necessary -- rest skipped *)
  9410. END;
  9411. END;
  9412. END IfPart;
  9413. BEGIN
  9414. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9415. end := NewLabel();
  9416. elsifs := x.ElsifParts();
  9417. IfPart(x.ifPart);
  9418. FOR i := 0 TO elsifs-1 DO
  9419. IF ~escape THEN
  9420. elsif := x.GetElsifPart(i);
  9421. IfPart(elsif);
  9422. END;
  9423. END;
  9424. IF (x.elsePart # NIL) & ~escape THEN
  9425. StatementSequence(x.elsePart);
  9426. END;
  9427. SetLabel(end);
  9428. IF Trace THEN TraceExit("VisitIfStatement") END;
  9429. END VisitIfStatement;
  9430. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9431. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9432. BEGIN
  9433. (*IF x.variable.type.resolved = x.type.resolved THEN
  9434. (* always true, do nothing *)
  9435. ELSE*)
  9436. Designate(x.variable,res);
  9437. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9438. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9439. END;
  9440. trueL := NewLabel();
  9441. TypeTest(res.tag,x.type,trueL,falseL);
  9442. ReleaseOperand(res);
  9443. SetLabel(trueL);
  9444. StatementSequence(x.statements);
  9445. BrL(endL);
  9446. END WithPart;
  9447. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9448. VAR endL,falseL: Label;i: LONGINT;
  9449. BEGIN
  9450. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9451. endL := NewLabel();
  9452. FOR i := 0 TO x.WithParts()-1 DO
  9453. falseL := NewLabel();
  9454. WithPart(x.GetWithPart(i),falseL,endL);
  9455. SetLabel(falseL);
  9456. END;
  9457. IF x.elsePart = NIL THEN
  9458. IF ~isUnchecked THEN
  9459. EmitTrap(position,WithTrap);
  9460. END;
  9461. ELSE
  9462. StatementSequence(x.elsePart)
  9463. END;
  9464. SetLabel(endL);
  9465. IF Trace THEN TraceExit("VisitWithStatement") END;
  9466. END VisitWithStatement;
  9467. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9468. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9469. out,else: Label; label: Label;
  9470. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9471. symbol: SyntaxTree.Symbol;
  9472. BEGIN
  9473. (*! split case statement into if-elsif statements for large case label lists *)
  9474. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9475. size := x.max-x.min+1;
  9476. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9477. END;
  9478. Evaluate(x.variable,var);
  9479. ReuseCopy(tmp,var.op);
  9480. ReleaseIntermediateOperand(var.op);
  9481. var.op := tmp;
  9482. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9483. Convert(var.op,addressType);
  9484. size := x.max-x.min+1;
  9485. else := NewLabel();
  9486. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9487. (*
  9488. UniqueId(name,module.module,"case",caseId);
  9489. *)
  9490. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9491. Global.GetModuleSegmentedName(module.module, name);
  9492. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9493. symbol := SyntaxTree.NewSymbol(name[1]);
  9494. symbol.SetScope(moduleScope);
  9495. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9496. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9497. section.isCaseTable := TRUE;
  9498. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9499. ReuseCopy(res,var.op);
  9500. ReleaseOperand(var);
  9501. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9502. Emit(Add(position,res,res,jmp));
  9503. IntermediateCode.MakeMemory(res,addressType);
  9504. Emit(Br(position,res));
  9505. ReleaseIntermediateOperand(res);
  9506. out := NewLabel();
  9507. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9508. part := x.GetCasePart(i);
  9509. constant := part.firstConstant;
  9510. label := NewLabel();
  9511. SetLabel(label);
  9512. WHILE(constant # NIL) DO (* case labels for this case part *)
  9513. FOR j := constant.min TO constant.max DO
  9514. fixups[j-x.min] := label;
  9515. END;
  9516. constant := constant.next;
  9517. END;
  9518. StatementSequence(part.statements);
  9519. BrL(out);
  9520. END;
  9521. SetLabel(else);
  9522. FOR i := 0 TO size-1 DO
  9523. IF fixups[i] = NIL THEN
  9524. fixups[i] := else;
  9525. END;
  9526. END;
  9527. IF x.elsePart # NIL THEN
  9528. StatementSequence(x.elsePart);
  9529. ELSIF ~isUnchecked THEN
  9530. EmitTrap(position,CaseTrap);
  9531. END;
  9532. SetLabel(out);
  9533. FOR i := 0 TO size-1 DO
  9534. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9535. section.Emit(Data(position,op));
  9536. END;
  9537. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9538. END VisitCaseStatement;
  9539. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9540. VAR start: Label; true,false: Label;
  9541. BEGIN
  9542. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9543. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9544. start := NewLabel();
  9545. true := NewLabel();
  9546. false := NewLabel();
  9547. SetLabel(start);
  9548. Condition(x.condition,true,false);
  9549. SetLabel(true);
  9550. StatementSequence(x.statements);
  9551. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9552. BrL(start);
  9553. SetLabel(false);
  9554. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9555. END VisitWhileStatement;
  9556. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9557. VAR false,true: Label;
  9558. BEGIN
  9559. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9560. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9561. true := NewLabel();
  9562. false := NewLabel();
  9563. SetLabel(false);
  9564. StatementSequence(x.statements);
  9565. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9566. Condition(x.condition,true,false);
  9567. SetLabel(true);
  9568. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9569. END VisitRepeatStatement;
  9570. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9571. VAR
  9572. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9573. temporaryVariable: SyntaxTree.Variable;
  9574. temporaryVariableDesignator : SyntaxTree.Designator;
  9575. BEGIN
  9576. IF Trace THEN TraceEnter("VisitForStatement") END;
  9577. true := NewLabel();
  9578. false := NewLabel();
  9579. start := NewLabel();
  9580. Assign(x.variable,x.from);
  9581. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9582. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9583. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9584. Assign(temporaryVariableDesignator,x.to);
  9585. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9586. IF by > 0 THEN
  9587. cmp := Scanner.LessEqual
  9588. ELSE
  9589. cmp := Scanner.GreaterEqual
  9590. END;
  9591. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9592. binary.SetType(system.booleanType);
  9593. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9594. SetLabel(start);
  9595. Condition(binary,true,false);
  9596. SetLabel(true);
  9597. StatementSequence(x.statements);
  9598. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9599. binary.SetType(x.variable.type);
  9600. Assign(x.variable,binary);
  9601. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9602. BrL(start);
  9603. SetLabel(false);
  9604. IF Trace THEN TraceExit("VisitForStatement") END;
  9605. END VisitForStatement;
  9606. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9607. VAR prevLoop: Label;
  9608. BEGIN
  9609. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9610. prevLoop := currentLoop;
  9611. currentLoop := NewLabel();
  9612. StatementSequence(x.statements);
  9613. SetLabel(currentLoop);
  9614. currentLoop := prevLoop;
  9615. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9616. END VisitExitableBlock;
  9617. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9618. VAR prevLoop,start: Label;
  9619. BEGIN
  9620. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9621. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9622. start := NewLabel();
  9623. prevLoop := currentLoop;
  9624. SetLabel(start);
  9625. currentLoop := NewLabel();
  9626. StatementSequence(x.statements);
  9627. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9628. BrL(start);
  9629. SetLabel(currentLoop);
  9630. currentLoop := prevLoop;
  9631. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9632. END VisitLoopStatement;
  9633. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9634. VAR outer: SyntaxTree.Statement;
  9635. BEGIN
  9636. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9637. IF locked THEN (* r if we jump out of an exclusive block *)
  9638. outer := x.outer;
  9639. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9640. outer := outer.outer;
  9641. END;
  9642. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9643. Lock(FALSE);
  9644. END;
  9645. END;
  9646. BrL(currentLoop);
  9647. IF Trace THEN TraceExit("VisitExitStatement") END;
  9648. END VisitExitStatement;
  9649. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9650. VAR
  9651. expression, parameterDesignator: SyntaxTree.Expression;
  9652. type, componentType: SyntaxTree.Type;
  9653. res, right: Operand;
  9654. left, mem, reg: IntermediateCode.Operand;
  9655. parameter: SyntaxTree.Parameter;
  9656. procedure: SyntaxTree.Procedure;
  9657. procedureType: SyntaxTree.ProcedureType;
  9658. returnTypeOffset: LONGINT;
  9659. delegate: BOOLEAN;
  9660. map: SymbolMap;
  9661. cc, parametersSize: LONGINT;
  9662. BEGIN
  9663. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9664. expression := x.returnValue;
  9665. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9666. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9667. IF currentIsInline THEN
  9668. IF expression # NIL THEN
  9669. map := currentMapper.Get(NIL);
  9670. IF map # NIL THEN
  9671. Assign(map.to, expression);
  9672. ELSE
  9673. Evaluate(expression,res);
  9674. Emit(Return(position,res.op));
  9675. ReleaseOperand(res);
  9676. END;
  9677. END;
  9678. BrL(currentInlineExit);
  9679. RETURN;
  9680. END;
  9681. IF expression # NIL THEN
  9682. type := expression.type.resolved;
  9683. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9684. IF locked THEN Lock(FALSE) END;
  9685. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9686. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9687. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9688. (* return without structured return parameter *)
  9689. Evaluate(expression,res);
  9690. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9691. IF locked OR profile THEN
  9692. Emit(Push(position,res.op));
  9693. IF delegate THEN HALT(200) END;
  9694. ReleaseOperand(res);
  9695. IF locked THEN Lock(FALSE) END;
  9696. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9697. reg := NewRegisterOperand(res.op.type);
  9698. Emit(Pop(position,reg));
  9699. Emit(Return(position,reg));
  9700. ReleaseIntermediateOperand(reg);
  9701. ELSE
  9702. Emit(Return(position,res.op));
  9703. ReleaseOperand(res);
  9704. END;
  9705. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9706. THEN
  9707. (* return using structured return parameter *)
  9708. 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)
  9709. OR SemanticChecker.IsPointerType(type));
  9710. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9711. parameter :=procedureType.returnParameter;
  9712. ASSERT(parameter # NIL);
  9713. returnTypeOffset := parameter.offsetInBits;
  9714. (*
  9715. IF parameter# NIL THEN
  9716. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9717. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9718. ELSE
  9719. returnTypeOffset := system.offsetFirstParameter
  9720. END;
  9721. *)
  9722. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9723. IF type IS SyntaxTree.RangeType THEN
  9724. (* array range type *)
  9725. Evaluate(expression, right);
  9726. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9727. Emit(Mov(position,mem, right.op)); (* first *)
  9728. ReleaseIntermediateOperand(mem);
  9729. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9730. Emit(Mov(position,mem, right.tag)); (* last *)
  9731. ReleaseIntermediateOperand(mem);
  9732. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9733. Emit(Mov(position,mem, right.extra)); (* step *)
  9734. ReleaseIntermediateOperand(mem);
  9735. ReleaseOperand(right);
  9736. ELSIF type IS SyntaxTree.ComplexType THEN
  9737. Evaluate(expression, right);
  9738. componentType := type(SyntaxTree.ComplexType).componentType;
  9739. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9740. Emit(Mov(position,mem, right.op)); (* real part *)
  9741. ReleaseIntermediateOperand(mem);
  9742. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9743. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9744. ReleaseIntermediateOperand(mem);
  9745. ReleaseOperand(right);
  9746. ELSE (* covers cases: pointer / record / array *)
  9747. parameter := procedureType.returnParameter;
  9748. checker.SetCurrentScope(currentScope);
  9749. ASSERT(parameter # NIL);
  9750. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9751. Assign(parameterDesignator,expression);
  9752. END;
  9753. ReleaseIntermediateOperand(left);
  9754. IF locked THEN Lock(FALSE) END;
  9755. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9756. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9757. parameter := procedureType.returnParameter;
  9758. checker.SetCurrentScope(currentScope);
  9759. IF parameter = NIL THEN
  9760. Error(procedure.position, "structured return of parameter of procedure not found");
  9761. ELSE
  9762. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9763. Assign(parameterDesignator,expression);
  9764. END;
  9765. IF locked THEN Lock(FALSE) END;
  9766. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9767. ELSE
  9768. HALT(200);
  9769. END;
  9770. ELSE
  9771. IF locked THEN Lock(FALSE) END;
  9772. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9773. END;
  9774. IF backend.cooperative THEN
  9775. BrL(exitLabel);
  9776. ELSE
  9777. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  9778. IF cc = SyntaxTree.WinAPICallingConvention THEN
  9779. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9780. ELSE
  9781. parametersSize := 0;
  9782. END;
  9783. EmitLeave(section, position,procedure, procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9784. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention, parametersSize));
  9785. END;
  9786. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9787. END VisitReturnStatement;
  9788. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9789. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9790. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9791. statements: SyntaxTree.StatementSequence;
  9792. name, suffix: SyntaxTree.IdentifierString;
  9793. BEGIN
  9794. Strings.IntToStr(awaitProcCounter,suffix);
  9795. Strings.Concat("@AwaitProcedure",suffix,name);
  9796. identifier := SyntaxTree.NewIdentifier(name);
  9797. INC(awaitProcCounter);
  9798. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9799. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9800. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9801. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9802. procedure.SetAccess(SyntaxTree.Hidden);
  9803. procedure.SetScope(currentScope);
  9804. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9805. procedureType.SetReturnType(system.booleanType);
  9806. procedure.SetType(procedureType);
  9807. body := SyntaxTree.NewBody(x.position,procedureScope);
  9808. procedureScope.SetBody(body);
  9809. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9810. returnStatement.SetReturnValue(x.condition);
  9811. statements := SyntaxTree.NewStatementSequence();
  9812. statements.AddStatement(returnStatement);
  9813. body.SetStatementSequence(statements);
  9814. currentScope.AddProcedure(procedure);
  9815. RETURN procedure
  9816. END MakeAwaitProcedure;
  9817. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9818. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9819. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9820. BEGIN
  9821. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9822. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9823. IF backend.cooperative THEN
  9824. start := NewLabel();
  9825. true := NewLabel();
  9826. false := NewLabel();
  9827. SetLabel(start);
  9828. Condition(x.condition,true,false);
  9829. SetLabel(false);
  9830. PushSelfPointer();
  9831. CallThis(position,"ExclusiveBlocks","Await",1);
  9832. BrL(start);
  9833. SetLabel(true);
  9834. PushSelfPointer();
  9835. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9836. ELSE
  9837. proc := MakeAwaitProcedure(x);
  9838. Emit(Push(position,fp));
  9839. GetCodeSectionNameForSymbol(proc,name);
  9840. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9841. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9842. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9843. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9844. Emit(Result(position,res));
  9845. (*
  9846. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9847. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9848. *)
  9849. InitOperand(result,ModeValue);
  9850. result.op := res;
  9851. label := NewLabel();
  9852. BreqL(label, result.op, SELF.true);
  9853. ReleaseOperand(result);
  9854. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9855. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9856. Emit(Push(position,res));
  9857. Emit(Push(position,fp));
  9858. PushSelfPointer();
  9859. Emit(Push(position,nil));
  9860. CallThis(position,"Objects","Await",4);
  9861. SetLabel(label);
  9862. END;
  9863. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9864. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9865. END VisitAwaitStatement;
  9866. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9867. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9868. BEGIN
  9869. FOR i := 0 TO x.Length() - 1 DO
  9870. statement := x.GetStatement( i );
  9871. Statement(statement);
  9872. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9873. END;
  9874. END StatementSequence;
  9875. PROCEDURE PushSelfPointer;
  9876. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  9877. procedureType: SyntaxTree.ProcedureType;
  9878. BEGIN
  9879. scope := currentScope;
  9880. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9881. scope := scope.outerScope;
  9882. END;
  9883. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9884. IF ~newObjectFile THEN
  9885. Symbol(moduleSelf,op);
  9886. IntermediateCode.MakeMemory(op.op,addressType);
  9887. ELSE
  9888. moduleSection := meta.ModuleSection();
  9889. IF backend.cooperative THEN
  9890. moduleOffset := 0;
  9891. ELSE
  9892. moduleOffset := moduleSection.pc;
  9893. END;
  9894. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9895. END;
  9896. ELSE
  9897. GetBaseRegister(op.op,currentScope,scope);
  9898. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9899. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9900. parametersSize := ProcedureParametersSize(system,procedure);
  9901. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9902. IF backend.cooperative THEN
  9903. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9904. END;
  9905. IntermediateCode.MakeMemory(op.op,addressType);
  9906. END;
  9907. Emit(Push(position,op.op));
  9908. ReleaseOperand(op);
  9909. END PushSelfPointer;
  9910. PROCEDURE Lock(lock: BOOLEAN);
  9911. BEGIN
  9912. IF Trace THEN TraceEnter("Lock") END;
  9913. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9914. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9915. ASSERT(modifyAssignmentCounter = 0);
  9916. IF dump # NIL THEN
  9917. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9918. dump.Ln;dump.Update;
  9919. END;
  9920. PushSelfPointer;
  9921. IF backend.cooperative THEN
  9922. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9923. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9924. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9925. END;
  9926. ELSE
  9927. Emit(Push(position,true));
  9928. IF lock THEN CallThis(position,"Objects","Lock",2)
  9929. ELSE CallThis(position,"Objects","Unlock",2);
  9930. END;
  9931. END;
  9932. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9933. IF Trace THEN TraceExit("Lock") END;
  9934. END Lock;
  9935. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9936. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9937. BEGIN
  9938. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9939. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9940. previouslyUnchecked := isUnchecked;
  9941. isUnchecked := isUnchecked OR x.isUnchecked;
  9942. previouslyCooperativeSwitches := cooperativeSwitches;
  9943. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9944. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9945. IF x.statements # NIL THEN
  9946. StatementSequence(x.statements);
  9947. END;
  9948. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9949. isUnchecked := previouslyUnchecked;
  9950. cooperativeSwitches := previouslyCooperativeSwitches;
  9951. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9952. END VisitStatementBlock;
  9953. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9954. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9955. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9956. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9957. procedure: SyntaxTree.Procedure;
  9958. map: SymbolMap;
  9959. cc, parametersSize: LONGINT;
  9960. BEGIN
  9961. scope := currentScope;
  9962. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9963. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9964. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9965. return := emptyOperand;
  9966. IF Trace THEN TraceEnter("VisitCode") END;
  9967. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9968. NEW(in, x.inRules.Length());
  9969. FOR i := 0 TO LEN(in)-1 DO
  9970. statement := x.inRules.GetStatement(i);
  9971. WITH statement: SyntaxTree.Assignment DO
  9972. Evaluate(statement.right, operand);
  9973. result := operand.op;
  9974. NEW(str, 64);
  9975. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9976. in[i] := result; IntermediateCode.SetString(in[i], str);
  9977. ReleaseIntermediateOperand(operand.tag);
  9978. END;
  9979. END;
  9980. ELSE in := NIL
  9981. END;
  9982. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9983. NEW(out, x.outRules.Length());
  9984. FOR i := 0 TO LEN(out)-1 DO
  9985. statement := x.outRules.GetStatement(i);
  9986. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9987. WITH statement: SyntaxTree.Assignment DO
  9988. Designate(statement.left, operand);
  9989. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  9990. NEW(str, 64);
  9991. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9992. out[i] := result; IntermediateCode.SetString(out[i], str);
  9993. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  9994. |statement: SyntaxTree.ReturnStatement DO
  9995. NEW(str, 64);
  9996. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9997. IF currentIsInline THEN
  9998. map := currentMapper.Get(NIL);
  9999. Designate(map.to, operand);
  10000. IF map.isAddress THEN
  10001. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10002. ELSE
  10003. result := operand.op;
  10004. END;
  10005. (*! only if it does not fit into register
  10006. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10007. *)
  10008. (*Evaluate(map.to, operand);*)
  10009. out[i] := result;
  10010. ELSE
  10011. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10012. END;
  10013. IntermediateCode.SetString(out[i], str);
  10014. ReleaseIntermediateOperand(operand.tag);
  10015. return := out[i];
  10016. ELSE
  10017. END;
  10018. END;
  10019. ELSE out := NIL
  10020. END;
  10021. Emit(Asm(x.position,x.sourceCode, in, out));
  10022. IF in # NIL THEN
  10023. FOR i := 0 TO LEN(in)-1 DO
  10024. ReleaseIntermediateOperand(in[i]);
  10025. END;
  10026. END;
  10027. IF out # NIL THEN
  10028. FOR i := 0 TO LEN(out)-1 DO
  10029. WITH statement: SyntaxTree.Assignment DO
  10030. ReleaseIntermediateOperand(out[i]);
  10031. |statement: SyntaxTree.ReturnStatement DO
  10032. (* release happens below *)
  10033. ELSE
  10034. END;
  10035. statement := x.outRules.GetStatement(i);
  10036. END;
  10037. END;
  10038. IF return.mode # IntermediateCode.Undefined THEN
  10039. IF currentIsInline THEN
  10040. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10041. Symbol(procedureType.returnParameter, par);
  10042. MakeMemory(mem, par.op, return.type, 0);
  10043. ReleaseOperand(par);
  10044. Emit(Mov(position, mem, return));
  10045. ReleaseIntermediateOperand(mem);
  10046. ELSE
  10047. Emit(Return(position,return));
  10048. END;
  10049. ReleaseIntermediateOperand(return);
  10050. IF currentIsInline THEN RETURN END;
  10051. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10052. IF cc = SyntaxTree.WinAPICallingConvention THEN
  10053. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10054. ELSE
  10055. parametersSize := 0;
  10056. END;
  10057. EmitLeave(section, position,procedure, cc);
  10058. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,cc, parametersSize));
  10059. END;
  10060. IF Trace THEN TraceExit("VisitCode") END;
  10061. END VisitCode;
  10062. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10063. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10064. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10065. const, call: IntermediateCode.Operand;
  10066. parameterDesignator: SyntaxTree.Expression;
  10067. saved: RegisterEntry;
  10068. name: Basic.SegmentedName;
  10069. BEGIN
  10070. IF Trace THEN TraceEnter("ParameterCopies") END;
  10071. parameter := x.firstParameter;
  10072. WHILE parameter # NIL DO
  10073. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10074. type := parameter.type.resolved;
  10075. IF IsOpenArray(type) THEN
  10076. VisitParameter(parameter);
  10077. op := result;
  10078. IF backend.cooperative & parameter.NeedsTrace() THEN
  10079. length := GetArrayLength(type, op.tag);
  10080. size := NewRegisterOperand(addressType);
  10081. base := ArrayBaseType(type);
  10082. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10083. Emit(Mul(position, size, length, const));
  10084. dst := NewRegisterOperand (addressType);
  10085. Emit(Mov(position, dst, size));
  10086. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10087. Emit(Sub(position,dst,sp,dst));
  10088. Emit(And(position,dst,dst,const));
  10089. Emit(Mov(position,sp,dst));
  10090. par := fp;
  10091. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10092. IntermediateCode.InitImmediate(null, byteType, 0);
  10093. Emit(Fill(position, dst, size, null));
  10094. ReleaseIntermediateOperand(dst);
  10095. ReleaseIntermediateOperand(length);
  10096. SaveRegisters();ReleaseUsedRegisters(saved);
  10097. (* register dst has been freed before SaveRegisters already *)
  10098. base := ArrayBaseType(type);
  10099. (* assign method of open array *)
  10100. IF base.IsRecordType() THEN
  10101. Emit (Push(position, length));
  10102. Emit (Push(position, dst));
  10103. Emit (Push(position, op.op));
  10104. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10105. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10106. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10107. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10108. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10109. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10110. Emit (Push(position,length));
  10111. Emit (Push(position, dst));
  10112. Emit (Push(position, length));
  10113. Emit (Push(position, op.op));
  10114. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10115. ELSE
  10116. Emit (Push(position, length));
  10117. Emit (Push(position, dst));
  10118. Emit (Push(position, length));
  10119. Emit (Push(position, op.op));
  10120. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10121. ASSERT(ArrayBaseType(type).IsPointer());
  10122. END;
  10123. RestoreRegisters(saved);
  10124. ELSE
  10125. temp := GetDynamicSize(type,op.tag);
  10126. ReuseCopy(size,temp);
  10127. ReleaseIntermediateOperand(temp);
  10128. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10129. Emit(Sub(position,size,sp,size));
  10130. Emit(And(position,size,size,const));
  10131. Emit(Mov(position,sp,size));
  10132. par := fp;
  10133. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10134. ReleaseIntermediateOperand(size);
  10135. size := GetDynamicSize(type,op.tag);
  10136. END;
  10137. Emit(Copy(position,sp,op.op,size));
  10138. ReleaseIntermediateOperand(size);
  10139. ReleaseOperand(op);
  10140. IntermediateCode.MakeMemory(par,addressType);
  10141. Emit(Mov(position,par,sp));
  10142. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10143. checker.SetCurrentScope(currentScope);
  10144. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10145. Assign(parameterDesignator,parameterDesignator);
  10146. END;
  10147. END;
  10148. parameter := parameter.nextParameter;
  10149. END;
  10150. IF Trace THEN TraceExit("ParameterCopies") END;
  10151. END ParameterCopies;
  10152. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10153. VAR x: SyntaxTree.Variable;
  10154. BEGIN
  10155. x := scope.firstVariable;
  10156. WHILE x # NIL DO
  10157. InitVariable(x,FALSE);
  10158. x := x.nextVariable;
  10159. END;
  10160. END InitVariables;
  10161. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10162. BEGIN
  10163. IF (symbol # NIL) THEN
  10164. RETURN fingerPrinter.SymbolFP(symbol).public
  10165. ELSE
  10166. RETURN 0
  10167. END;
  10168. END GetFingerprint;
  10169. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10170. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10171. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10172. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10173. name: Basic.SegmentedName;
  10174. offset: LONGINT;
  10175. BEGIN
  10176. IF Trace THEN TraceEnter("Body") END;
  10177. ReleaseUsedRegisters(saved); (* just in case ... *)
  10178. section := ir;
  10179. exitLabel := NewLabel ();
  10180. IF moduleBody THEN moduleBodySection := section END;
  10181. IF ir.comments # NIL THEN
  10182. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10183. commentPrintout.SingleStatement(TRUE);
  10184. dump := ir.comments;
  10185. ELSE
  10186. commentPrintout := NIL;
  10187. dump := NIL;
  10188. END;
  10189. prevScope := currentScope;
  10190. currentScope := scope;
  10191. lastSwitchPC := 0;
  10192. cooperativeSwitches := backend.cooperative;
  10193. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10194. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10195. IF x # NIL THEN
  10196. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10197. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10198. IF moduleBody THEN
  10199. ProfilerInit();
  10200. ELSE
  10201. Basic.SegmentedNameToString(ir.name, string);
  10202. ProfilerAddProcedure(numberProcedures,string);
  10203. ProfilerEnterExit(numberProcedures,TRUE);
  10204. END;
  10205. END;
  10206. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10207. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10208. END;
  10209. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10210. IF moduleBody & ~newObjectFile THEN
  10211. InitVariables(moduleScope)
  10212. END;
  10213. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10214. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10215. IF procedure = cellScope.bodyProcedure THEN
  10216. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10217. StaticCallOperand(op, cellScope.constructor);
  10218. Emit(Call(position,op.op,0));
  10219. END;
  10220. END;
  10221. END;
  10222. InitVariables(scope);
  10223. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10224. GetCodeSectionNameForSymbol(procedure, name);
  10225. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10226. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10227. IF ProtectModulesPointers THEN
  10228. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10229. ELSE
  10230. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10231. END;
  10232. IntermediateCode.SetOffset(right,offset); (* tag *)
  10233. IntermediateCode.InitMemory(left,addressType,fp,0);
  10234. Emit(Mov(position, left, right));
  10235. END;
  10236. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10237. ParameterCopies(procedureType);
  10238. IF x.code = NIL THEN
  10239. VisitStatementBlock(x);
  10240. ELSE
  10241. VisitCode(x.code)
  10242. END;
  10243. IF x.finally # NIL THEN (*! mark finally block for object file *)
  10244. ir.SetFinally(ir.pc);
  10245. StatementSequence(x.finally)
  10246. END;
  10247. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10248. IF ~backend.cooperative THEN
  10249. ProfilerEnterExit(numberProcedures,FALSE);
  10250. END;
  10251. INC(numberProcedures);
  10252. END;
  10253. END;
  10254. IF backend.cooperative THEN
  10255. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10256. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10257. END;
  10258. IF x # NIL THEN
  10259. SELF.position := x.position;
  10260. END;
  10261. CheckRegistersFree();
  10262. ASSERT(modifyAssignmentCounter = 0);
  10263. currentScope := prevScope;
  10264. IF Trace THEN TraceExit("Body") END;
  10265. END Body;
  10266. END ImplementationVisitor;
  10267. MetaDataGenerator=OBJECT
  10268. VAR
  10269. implementationVisitor: ImplementationVisitor;
  10270. declarationVisitor: DeclarationVisitor;
  10271. module: Sections.Module;
  10272. moduleName: ARRAY 128 OF CHAR;
  10273. moduleNamePool: Basic.HashTableInt;
  10274. moduleNamePoolSection: IntermediateCode.Section;
  10275. modulePointerSection: IntermediateCode.Section;
  10276. modulePointerSizePC: LONGINT;
  10277. modulePointerSectionOffset: LONGINT;
  10278. modulePointers: LONGINT;
  10279. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  10280. RecordBaseOffset: LONGINT;
  10281. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10282. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10283. TypeTags: LONGINT; (* type extension level support *)
  10284. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10285. patchInfoPC: LONGINT;
  10286. patchCRC: LONGINT;
  10287. CONST
  10288. EmptyBlockOffset = 2;
  10289. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10290. BEGIN
  10291. IF implementationVisitor.backend.cooperative THEN
  10292. TypeTags := MAX(LONGINT);
  10293. BaseTypesTableOffset := 0;
  10294. MethodTableOffset := 2;
  10295. TypeRecordBaseOffset := 0;
  10296. RecordBaseOffset := 0;
  10297. ELSIF simple THEN
  10298. TypeTags := 3; (* only 3 extensions allowed *)
  10299. BaseTypesTableOffset := 1;
  10300. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10301. TypeRecordBaseOffset := 0;
  10302. RecordBaseOffset := 1;
  10303. ELSE
  10304. TypeTags := 16;
  10305. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10306. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10307. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10308. (* change this when Heaps.HeapBlock is modified *)
  10309. RecordBaseOffset := 8;
  10310. END;
  10311. SELF.simple := simple;
  10312. SELF.implementationVisitor := implementationVisitor;
  10313. SELF.declarationVisitor := declarationVisitor;
  10314. implementationVisitor.meta := SELF;
  10315. declarationVisitor.meta := SELF;
  10316. END InitMetaDataGenerator;
  10317. PROCEDURE SetModule(module: Sections.Module);
  10318. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10319. BEGIN
  10320. SELF.module := module;
  10321. Global.GetModuleName(module.module,moduleName);
  10322. Global.GetSymbolSegmentedName(module.module, name);
  10323. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple & ~implementationVisitor.backend.cooperative THEN
  10324. NEW(moduleNamePool, 32);
  10325. (*! require GC protection *)
  10326. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10327. IF ProtectModulesPointers THEN
  10328. name := "Heaps.AnyPtr";
  10329. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10330. (* set base pointer *)
  10331. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10332. END;
  10333. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10334. modulePointers := 0;
  10335. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10336. AddPointer(moduleNamePoolSection, namePoolOffset);
  10337. END;
  10338. END SetModule;
  10339. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10340. BEGIN
  10341. IF ~implementationVisitor.backend.cooperative THEN
  10342. NamedSymbol(modulePointerSection, section.name, NIL, 0, offset);
  10343. INC(modulePointers);
  10344. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10345. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10346. END;
  10347. END AddPointer;
  10348. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10349. BEGIN
  10350. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10351. END GetTypeRecordBaseOffset;
  10352. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10353. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10354. BEGIN
  10355. (* change this when Heaps.HeapBlock is modified *)
  10356. INC(dataAdrOffset,6);
  10357. Info(section,"headerAdr");
  10358. Address(section,0);
  10359. Info(section,"typeDesc");
  10360. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10361. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10362. NamedSymbol(section, name, symbol, 0, offset);
  10363. Info(section,"mark: LONGINT;");
  10364. Longint(section,-1);
  10365. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10366. Info(section,"dataAdr-: ADDRESS");
  10367. Symbol(section,section, dataAdrOffset,0);
  10368. Info(section,"size-: SIZE");
  10369. Address(section,0);
  10370. Info(section,"nextMark: HeapBlock;");
  10371. Address(section,0);
  10372. END HeapBlock;
  10373. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10374. VAR i: LONGINT;
  10375. BEGIN
  10376. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10377. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10378. Info(section,"count*: LONGINT");
  10379. Longint(section,0);
  10380. Info(section,"locked*: BOOLEAN");
  10381. Longint(section,0);
  10382. Info(section,"awaitingLock*: ProcessQueue");
  10383. Address(section,0);
  10384. Address(section,0);
  10385. Info(section,"awaitingCond*: ProcessQueue");
  10386. Address(section,0);
  10387. Address(section,0);
  10388. Info(section,"lockedBy*: ANY");
  10389. Address(section,0);
  10390. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10391. Longint(section,1);
  10392. FOR i := 2 TO 6 DO
  10393. Longint(section,0);
  10394. END;
  10395. Info(section,"lock*: ANY");
  10396. Address(section,0);
  10397. END ProtectedHeapBlock;
  10398. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10399. BEGIN
  10400. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10401. END Info;
  10402. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10403. VAR op: IntermediateCode.Operand;
  10404. BEGIN
  10405. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10406. section.Emit(Data(Basic.invalidPosition,op));
  10407. END Address;
  10408. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10409. VAR op: IntermediateCode.Operand;
  10410. BEGIN
  10411. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10412. section.Emit(Data(Basic.invalidPosition,op));
  10413. END Size;
  10414. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10415. VAR op: IntermediateCode.Operand;
  10416. BEGIN
  10417. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10418. section.Emit(Data(Basic.invalidPosition,op));
  10419. END Set;
  10420. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10421. VAR op: IntermediateCode.Operand;
  10422. BEGIN
  10423. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10424. section.Emit(Data(Basic.invalidPosition,op));
  10425. END Longint;
  10426. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10427. VAR op,noOperand: IntermediateCode.Operand;
  10428. BEGIN
  10429. IntermediateCode.InitOperand(noOperand);
  10430. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10431. section.PatchOperands(pc,op,noOperand,noOperand);
  10432. END PatchAddress;
  10433. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10434. VAR op,noOperand: IntermediateCode.Operand;
  10435. BEGIN
  10436. IntermediateCode.InitOperand(noOperand);
  10437. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10438. section.PatchOperands(pc,op,noOperand,noOperand);
  10439. END PatchSize;
  10440. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10441. VAR op,noOperand: IntermediateCode.Operand;
  10442. BEGIN
  10443. IntermediateCode.InitOperand(noOperand);
  10444. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10445. section.PatchOperands(pc,op,noOperand,noOperand);
  10446. END PatchLongint;
  10447. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10448. VAR op, noOperand: IntermediateCode.Operand;
  10449. BEGIN
  10450. IntermediateCode.InitOperand(noOperand);
  10451. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10452. section.PatchOperands(pc,op,noOperand,noOperand);
  10453. END PatchSymbol;
  10454. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10455. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10456. BEGIN
  10457. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10458. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10459. section.Emit(Data(Basic.invalidPosition,op));
  10460. END Boolean;
  10461. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10462. VAR op: IntermediateCode.Operand;
  10463. BEGIN
  10464. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10465. section.Emit(Data(Basic.invalidPosition,op));
  10466. END Char;
  10467. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10468. VAR op: IntermediateCode.Operand;
  10469. BEGIN
  10470. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10471. section.Emit(Data(Basic.invalidPosition,op));
  10472. END Integer;
  10473. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10474. VAR i: LONGINT;
  10475. BEGIN
  10476. Info(section,str);
  10477. i := 0;
  10478. WHILE(str[i] # 0X) DO
  10479. Char(section,str[i]);
  10480. INC(i);
  10481. END;
  10482. Char(section,0X);
  10483. END String;
  10484. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10485. VAR s: Basic.SectionName;
  10486. BEGIN
  10487. StringPool.GetString(str, s);
  10488. String(section, s);
  10489. END String0;
  10490. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10491. VAR op: IntermediateCode.Operand;
  10492. BEGIN
  10493. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10494. IntermediateCode.SetOffset(op,realOffset);
  10495. section.Emit(Data(Basic.invalidPosition,op));
  10496. END NamedSymbol;
  10497. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10498. VAR op: IntermediateCode.Operand;
  10499. BEGIN
  10500. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10501. IntermediateCode.SetOffset(op,realOffset);
  10502. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10503. END NamedSymbolAt;
  10504. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10505. BEGIN
  10506. IF symbol= NIL THEN
  10507. Address( section, realOffset);
  10508. ASSERT(virtualOffset = 0);
  10509. ELSE
  10510. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10511. END;
  10512. END Symbol;
  10513. (* OutPointers delivers
  10514. {pointerOffset}
  10515. *)
  10516. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10517. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10518. BEGIN
  10519. type := type.resolved;
  10520. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10521. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10522. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10523. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10524. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10525. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10526. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10527. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10528. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10529. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10530. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10531. ELSIF (type IS SyntaxTree.RecordType) THEN
  10532. (* never treat a record like a pointer, even if the pointer field is set! *)
  10533. WITH type: SyntaxTree.RecordType DO
  10534. base := type.GetBaseRecord();
  10535. IF base # NIL THEN
  10536. Pointers(offset,symbol,section, base,numberPointers);
  10537. END;
  10538. variable := type.recordScope.firstVariable;
  10539. WHILE(variable # NIL) DO
  10540. IF ~(variable.untraced) THEN
  10541. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10542. END;
  10543. variable := variable.nextVariable;
  10544. END;
  10545. END;
  10546. ELSIF (type IS SyntaxTree.CellType) THEN
  10547. WITH type: SyntaxTree.CellType DO
  10548. base := type.GetBaseRecord();
  10549. IF base # NIL THEN
  10550. Pointers(offset,symbol,section, base,numberPointers);
  10551. END;
  10552. variable := type.cellScope.firstVariable;
  10553. WHILE(variable # NIL) DO
  10554. IF ~(variable.untraced) THEN
  10555. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10556. END;
  10557. variable := variable.nextVariable;
  10558. END;
  10559. property := type.firstProperty;
  10560. WHILE(property # NIL) DO
  10561. IF ~(property.untraced) THEN
  10562. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10563. END;
  10564. property := property.nextProperty;
  10565. END;
  10566. parameter := type.firstParameter;
  10567. WHILE(parameter # NIL) DO
  10568. IF ~(parameter.untraced) THEN
  10569. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10570. END;
  10571. parameter := parameter.nextParameter;
  10572. END;
  10573. END;
  10574. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10575. WITH type: SyntaxTree.ArrayType DO
  10576. IF type.form= SyntaxTree.Static THEN
  10577. n := type.staticLength;
  10578. base := type.arrayBase.resolved;
  10579. WHILE(base IS SyntaxTree.ArrayType) DO
  10580. type := base(SyntaxTree.ArrayType);
  10581. n := n* type.staticLength;
  10582. base := type.arrayBase.resolved;
  10583. END;
  10584. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10585. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10586. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10587. FOR i := 0 TO n-1 DO
  10588. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10589. END;
  10590. END;
  10591. ELSE
  10592. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10593. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10594. END;
  10595. END;
  10596. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10597. WITH type: SyntaxTree.MathArrayType DO
  10598. IF type.form = SyntaxTree.Static THEN
  10599. n := type.staticLength;
  10600. base := type.arrayBase.resolved;
  10601. WHILE(base IS SyntaxTree.MathArrayType) DO
  10602. type := base(SyntaxTree.MathArrayType);
  10603. n := n* type.staticLength;
  10604. base := type.arrayBase.resolved;
  10605. END;
  10606. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10607. IF SemanticChecker.ContainsPointer(base) THEN
  10608. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10609. FOR i := 0 TO n-1 DO
  10610. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10611. END;
  10612. END;
  10613. ELSE
  10614. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10615. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10616. END
  10617. END;
  10618. (* ELSE no pointers in type *)
  10619. END;
  10620. END Pointers;
  10621. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10622. VAR position,i: LONGINT; ch: CHAR;
  10623. BEGIN
  10624. IF pool.Has(index) THEN
  10625. RETURN pool.GetInt(index)
  10626. ELSE
  10627. position := source.pc;
  10628. pool.PutInt(index, position);
  10629. Info(source, name);
  10630. i := 0;
  10631. REPEAT
  10632. ch := name[i]; INC(i);
  10633. Char( source, ch);
  10634. UNTIL ch = 0X;
  10635. END;
  10636. RETURN position;
  10637. END EnterDynamicName;
  10638. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10639. VAR name: Basic.SectionName; position: LONGINT;
  10640. BEGIN
  10641. IF pool.Has(index) THEN
  10642. RETURN pool.GetInt(index)
  10643. ELSE
  10644. StringPool.GetString(index, name);
  10645. position := EnterDynamicName(source,name,index, pool);
  10646. END;
  10647. RETURN position;
  10648. END DynamicName;
  10649. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10650. VAR section: IntermediateCode.Section;
  10651. BEGIN
  10652. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10653. IF implementationVisitor.backend.cooperative THEN
  10654. Info(section, "TypeDescriptor");
  10655. Basic.ToSegmentedName("BaseTypes.Array", name);
  10656. NamedSymbol(section, name,NIL, 0, 0);
  10657. BasePointer(section);
  10658. offset := 0;
  10659. ELSE
  10660. IF ProtectModulesPointers THEN
  10661. HeapBlock(mName,typeName,section,2);
  10662. END;
  10663. Info(section, "HeapBlock");
  10664. IF ProtectModulesPointers THEN
  10665. Symbol(section,section,2,0);
  10666. ELSE
  10667. Address(section,0);
  10668. END;
  10669. Info(section, "TypeDescriptor");
  10670. Address(section,0);
  10671. offset := section.pc;
  10672. END;
  10673. RETURN section
  10674. END NamedBlock;
  10675. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10676. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10677. BEGIN
  10678. COPY(moduleName,name);
  10679. Strings.Append(name,suffix);
  10680. Basic.ToSegmentedName(name, pooledName);
  10681. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10682. END Block;
  10683. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10684. VAR name: Basic.SegmentedName;
  10685. BEGIN
  10686. Info(source,"ArrayHeader");
  10687. IF implementationVisitor.backend.cooperative THEN
  10688. sizePC := source.pc;
  10689. Address(source,0);
  10690. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10691. IF baseType # "" THEN
  10692. Basic.ToSegmentedName(baseType, name);
  10693. NamedSymbol(source, name,NIL, 0, 0);
  10694. ELSE
  10695. Address(source,0);
  10696. END;
  10697. Address(source,0);
  10698. ELSE
  10699. Address(source,0);
  10700. Address(source,0);
  10701. (* first pointer for GC *)
  10702. IF hasPointer THEN
  10703. (* points to first element in the array, this is NOT the base type descriptor *)
  10704. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10705. ELSE
  10706. Address(source,0);
  10707. END;
  10708. sizePC := source.pc;
  10709. Address(source,0);
  10710. Info(source,"array data");
  10711. END;
  10712. END ArrayBlock;
  10713. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10714. BEGIN
  10715. IF implementationVisitor.backend.cooperative THEN
  10716. PatchSize(section, pc, size);
  10717. PatchSize(section, pc + 3, size);
  10718. ELSE
  10719. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10720. PatchSize(section, pc, size);
  10721. END;
  10722. END PatchArray;
  10723. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10724. VAR
  10725. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10726. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10727. poolMap: Basic.HashTableInt;
  10728. namePool: IntermediateCode.Section;
  10729. namePoolOffset: LONGINT;
  10730. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10731. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10732. BEGIN
  10733. Basic.SegmentedNameToString(s1.name,n1);
  10734. Basic.SegmentedNameToString(s2.name,n2);
  10735. index := 0;
  10736. ch1 := n1[index];
  10737. ch2 := n2[index];
  10738. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10739. INC(index);
  10740. ch1 := n1[index];
  10741. ch2 := n2[index];
  10742. END;
  10743. RETURN ch1 < ch2;
  10744. END Compare;
  10745. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10746. VAR
  10747. i, j: LONGINT;
  10748. x, t: Sections.Section;
  10749. BEGIN
  10750. IF lo < hi THEN
  10751. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10752. WHILE i <= j DO
  10753. WHILE Compare(list[i], x) DO INC(i) END;
  10754. WHILE Compare(x, list[j]) DO DEC(j) END;
  10755. IF i <= j THEN
  10756. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10757. INC(i); DEC(j)
  10758. END
  10759. END;
  10760. IF lo < j THEN QuickSort(list, lo, j) END;
  10761. IF i < hi THEN QuickSort(list, i, hi) END
  10762. END;
  10763. END QuickSort;
  10764. (*
  10765. ExportDesc* = RECORD
  10766. fp*: ADDRESS;
  10767. name* {UNTRACED}: DynamicName;
  10768. adr*: ADDRESS;
  10769. exports*: LONGINT;
  10770. dsc* {UNTRACED}: ExportArray
  10771. END;
  10772. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10773. *)
  10774. PROCEDURE ExportDesc2(
  10775. source: IntermediateCode.Section;
  10776. namePool: IntermediateCode.Section;
  10777. fingerPrinter: FingerPrinter.FingerPrinter;
  10778. symbol: Sections.Section;
  10779. name: StringPool.Index;
  10780. VAR patchAdr: LONGINT
  10781. ): BOOLEAN;
  10782. VAR fingerPrint: SyntaxTree.FingerPrint;
  10783. BEGIN
  10784. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10785. & (symbol.type # Sections.InlineCodeSection)
  10786. THEN
  10787. *)
  10788. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10789. & (symbol.type # Sections.InlineCodeSection))
  10790. THEN
  10791. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10792. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10793. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10794. Longint(source,fingerPrint.public);
  10795. ELSE
  10796. Longint(source, 0);
  10797. END;
  10798. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10799. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10800. Symbol(source, symbol,0,0);
  10801. patchAdr := source.pc;
  10802. Longint(source, 0);
  10803. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10804. Address(source,0);
  10805. END;
  10806. RETURN TRUE
  10807. ELSE
  10808. RETURN FALSE
  10809. END;
  10810. END ExportDesc2;
  10811. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10812. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10813. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10814. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  10815. nextPatch: LONGINT;
  10816. TYPE
  10817. Scope = RECORD
  10818. elements: LONGINT;
  10819. gelements: LONGINT;
  10820. section: IntermediateCode.Section;
  10821. patchAdr: LONGINT;
  10822. arraySizePC: LONGINT;
  10823. beginPC: LONGINT; (* current scope start pc *)
  10824. END;
  10825. BEGIN
  10826. Basic.InitSegmentedName(prev);
  10827. olevel := -1;
  10828. scopes[0].section := source;
  10829. scopes[0].arraySizePC := MIN(LONGINT);
  10830. FOR s := 0 TO LEN(sections)-1 DO
  10831. symbol := sections[s];
  10832. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10833. this := sections[s].name;
  10834. level := 0;
  10835. WHILE (this[level] > 0) DO
  10836. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10837. INC(level);
  10838. END;
  10839. WHILE level < olevel DO
  10840. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10841. IF olevel > 0 THEN
  10842. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10843. nextPatch := scopes[olevel-1].patchAdr+1;
  10844. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10845. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10846. END;
  10847. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10848. DEC(olevel);
  10849. END;
  10850. IF (this[level] > 0) THEN
  10851. IF level > olevel THEN
  10852. (*TRACE("opening",level); *)
  10853. IF scopes[level].section = NIL THEN
  10854. arrayName := ".@ExportArray";
  10855. Strings.AppendInt(arrayName, level);
  10856. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  10857. AddPointer(scopes[level].section,offset);
  10858. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  10859. END;
  10860. scopes[level].beginPC := scopes[level].section.pc;
  10861. olevel := level;
  10862. scopes[olevel].elements := 0;
  10863. END;
  10864. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10865. sym := sections[s];
  10866. ELSE
  10867. sym := NIL;
  10868. END;
  10869. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10870. THEN
  10871. INC(scopes[olevel].elements);
  10872. END;
  10873. (* enter string in scope *)
  10874. INC(level);
  10875. END;
  10876. END;
  10877. Basic.SegmentedNameToString(this, name);
  10878. prev := this;
  10879. END;
  10880. END;
  10881. WHILE 0 <= olevel DO
  10882. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10883. IF olevel > 0 THEN
  10884. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10885. nextPatch := scopes[olevel-1].patchAdr+1;
  10886. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10887. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10888. END;
  10889. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10890. DEC(olevel);
  10891. END;
  10892. level := 0;
  10893. WHILE (level < LEN(scopes)) DO
  10894. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  10895. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10896. END;
  10897. INC(level);
  10898. END;
  10899. END Export;
  10900. BEGIN
  10901. NEW(fingerPrinter);
  10902. NEW(poolMap, 64);
  10903. (* 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 *)
  10904. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10905. NEW(sectionArray, module.allSections.Length());
  10906. FOR i := 0 TO module.allSections.Length() - 1 DO
  10907. section := module.allSections.GetSection(i);
  10908. sectionArray[i] := section;
  10909. END;
  10910. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10911. Export(sectionArray^);
  10912. END ExportDesc;
  10913. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10914. VAR
  10915. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10916. BEGIN
  10917. Info(source, "exception table offsets array descriptor");
  10918. size := 0;
  10919. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  10920. Info(source, "exception table content");
  10921. FOR i := 0 TO module.allSections.Length() - 1 DO
  10922. p := module.allSections.GetSection(i);
  10923. IF p.type = Sections.CodeSection THEN
  10924. finallyPC := p(IntermediateCode.Section).finally;
  10925. IF finallyPC>=0 THEN
  10926. Symbol( source, p, 0,0);
  10927. Symbol( source, p, finallyPC, 0);
  10928. Symbol( source, p, finallyPC,0);
  10929. INC(size);
  10930. END;
  10931. END
  10932. END;
  10933. PatchArray(source,sizePC,size);
  10934. END ExceptionArray;
  10935. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10936. VAR i: LONGINT; ch: CHAR;
  10937. BEGIN
  10938. i := 0;
  10939. REPEAT
  10940. ch := name[i]; INC(i);
  10941. Char( section, ch);
  10942. UNTIL ch = 0X;
  10943. WHILE i < 32 DO
  10944. Char( section, 0X); INC(i);
  10945. END;
  10946. END Name;
  10947. PROCEDURE References(section: IntermediateCode.Section);
  10948. CONST
  10949. sfTypeNone = 0X;
  10950. sfTypeCHAR = 01X;
  10951. sfTypeCHAR8 = 02X;
  10952. sfTypeCHAR16 = 03X;
  10953. sfTypeCHAR32 = 04X;
  10954. sfTypeRANGE = 05X;
  10955. sfTypeSHORTINT = 06X;
  10956. sfTypeINTEGER = 07X;
  10957. sfTypeLONGINT = 08X;
  10958. sfTypeHUGEINT = 09X;
  10959. sfTypeWORD = 0AX;
  10960. sfTypeLONGWORD = 0BX;
  10961. sfTypeSIGNED8 = 0CX;
  10962. sfTypeSIGNED16 = 0DX;
  10963. sfTypeSIGNED32 = 0EX;
  10964. sfTypeSIGNED64 = 0FX;
  10965. sfTypeUNSIGNED8 = 10X;
  10966. sfTypeUNSIGNED16 = 11X;
  10967. sfTypeUNSIGNED32 = 12X;
  10968. sfTypeUNSIGNED64 = 13X;
  10969. sfTypeREAL = 14X;
  10970. sfTypeLONGREAL = 15X;
  10971. sfTypeCOMPLEX = 16X;
  10972. sfTypeLONGCOMPLEX = 17X;
  10973. sfTypeBOOLEAN = 18X;
  10974. sfTypeSET = 19X;
  10975. sfTypeANY = 1AX;
  10976. sfTypeOBJECT = 1BX;
  10977. sfTypeBYTE = 1CX;
  10978. sfTypeADDRESS = 1DX;
  10979. sfTypeSIZE = 1EX;
  10980. sfTypeIndirect = 1FX;
  10981. sfTypeRecord = 20X;
  10982. sfTypePointerToRecord = 21X;
  10983. sfTypePointerToArray = 22X;
  10984. sfTypeOpenArray = 23X;
  10985. sfTypeStaticArray = 24X;
  10986. sfTypeDynamicArray = 25X;
  10987. sfTypeMathStaticArray = 26X;
  10988. sfTypeMathOpenArray = 27X;
  10989. sfTypeMathTensor = 28X;
  10990. sfTypeDelegate = 29X;
  10991. sfTypeENUM = 2AX;
  10992. sfTypeCELL = 2BX;
  10993. sfTypePORT = 2CX;
  10994. sfIN = 0X;
  10995. sfOUT = 1X;
  10996. flagDelegate = 0;
  10997. flagConstructor = 1;
  10998. (* variable / parameter addressing modes *)
  10999. sfAbsolute = 0X; (* global vars *)
  11000. sfRelative = 1X; (* variables, value parameters *)
  11001. sfIndirect = 2X; (* var parameters *)
  11002. sfScopeBegin = 0F0X;
  11003. sfScopeEnd = 0F1X;
  11004. sfProcedure = 0F2X;
  11005. sfVariable = 0F3X;
  11006. sfTypeDeclaration = 0F4X;
  11007. sfModule = 0FFX;
  11008. RefInfo = TRUE;
  11009. VAR
  11010. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11011. indirectTypes: Basic.HashTable;
  11012. PROCEDURE CurrentIndex(): SIZE;
  11013. VAR i: LONGINT;
  11014. BEGIN
  11015. FOR i := startPC TO section.pc -1 DO
  11016. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11017. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11018. END;
  11019. startPC := section.pc;
  11020. RETURN lastOffset;
  11021. END CurrentIndex;
  11022. (*
  11023. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11024. Module = sfModule prevSymbol:SIZE name:String Scope.
  11025. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11026. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11027. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11028. Type =
  11029. sfTypePointerToRecord
  11030. | sfTypePointerToArray Type
  11031. | sfTypeOpenArray Type
  11032. | sfTypeDynamicArray Type
  11033. | sfTypeStaticArray length:SIZE Type
  11034. | sfTypeMathOpenArray Type
  11035. | sfTypeMathStaticArray length:SIZE Type
  11036. | sfTypeMathTensor Type
  11037. | sfTypeRecord tdAdr:ADDRESS
  11038. | sfTypeDelegate {Parameter} return:Type
  11039. | sfTypePort (sfIN | sfOUT)
  11040. | sfTypeBOOLEAN
  11041. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11042. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11043. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11044. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11045. | sfTypeWORD | sfTypeLONGWORD
  11046. | sfTypeREAL | sfTypeLONGREAL
  11047. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11048. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11049. | sfTypeIndirect offset:SIZE.
  11050. *)
  11051. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11052. VAR offset: SIZE;
  11053. BEGIN
  11054. IF indirectTypes.Has(type) THEN
  11055. offset := indirectTypes.GetInt(type);
  11056. Char(section, sfTypeIndirect);
  11057. Size(section, offset);
  11058. RETURN TRUE;
  11059. ELSE
  11060. indirectTypes.PutInt(type, CurrentIndex());
  11061. RETURN FALSE;
  11062. END;
  11063. END Indirect;
  11064. PROCEDURE NType(type: SyntaxTree.Type);
  11065. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11066. segmentedName: Basic.SegmentedName; offset: SIZE; parameter: SyntaxTree.Parameter;
  11067. BEGIN
  11068. IF type = NIL THEN
  11069. Char(section, sfTypeNone)
  11070. ELSE
  11071. type := type.resolved;
  11072. size := type.sizeInBits;
  11073. WITH type:SyntaxTree.PointerType DO
  11074. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11075. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11076. Char(section, sfTypePointerToRecord);
  11077. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11078. ELSE
  11079. IF RefInfo THEN Info(section,"PointerToArray") END;
  11080. Char(section, sfTypePointerToArray);
  11081. NType(type.pointerBase);
  11082. END;
  11083. | type: SyntaxTree.ArrayType DO
  11084. IF ~Indirect(type) THEN
  11085. IF type.form = SyntaxTree.Open THEN
  11086. IF RefInfo THEN Info(section,"OpenArray") END;
  11087. Char(section, sfTypeOpenArray);
  11088. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11089. IF RefInfo THEN Info(section,"DynamicArray") END;
  11090. Char(section, sfTypeDynamicArray);
  11091. ELSIF type.form = SyntaxTree.Static THEN
  11092. IF RefInfo THEN Info(section,"StaticArray") END;
  11093. Char(section, sfTypeStaticArray);
  11094. Size(section, type.staticLength);
  11095. ELSE
  11096. HALT(100);
  11097. END;
  11098. NType(type.arrayBase);
  11099. END;
  11100. | type: SyntaxTree.MathArrayType DO
  11101. IF ~Indirect(type) THEN
  11102. IF type.form = SyntaxTree.Open THEN
  11103. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11104. Char(section, sfTypeMathOpenArray);
  11105. ELSIF type.form = SyntaxTree.Static THEN
  11106. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11107. Char(section, sfTypeMathStaticArray);
  11108. Size(section, type.staticLength);
  11109. ELSIF type.form = SyntaxTree.Tensor THEN
  11110. IF RefInfo THEN Info(section,"MathTensor") END;
  11111. Char(section, sfTypeMathTensor);
  11112. ELSE
  11113. HALT(100);
  11114. END;
  11115. NType(type.arrayBase);
  11116. END;
  11117. | type: SyntaxTree.RecordType DO
  11118. IF ~Indirect(type) THEN
  11119. IF type.pointerType # NIL (* OBJECT *) THEN
  11120. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11121. Char(section, sfTypePointerToRecord)
  11122. ELSE
  11123. IF RefInfo THEN Info(section,"Record") END;
  11124. Char(section, sfTypeRecord);
  11125. td := type.typeDeclaration;
  11126. IF RefInfo THEN Info(section,"TD") END;
  11127. IF (td # NIL) THEN
  11128. Global.GetSymbolSegmentedName(td,segmentedName);
  11129. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11130. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11131. ELSE
  11132. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11133. END;
  11134. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11135. Symbol(section, tir, 0, offset);
  11136. ELSE
  11137. Address(section, 0);
  11138. END;
  11139. END;
  11140. END;
  11141. | type: SyntaxTree.CellType DO
  11142. IF ~Indirect(type) THEN
  11143. IF RefInfo THEN Info(section,"Record") END;
  11144. Char(section, sfTypeRecord);
  11145. td := type.typeDeclaration;
  11146. IF RefInfo THEN Info(section,"TD") END;
  11147. IF (td # NIL) THEN
  11148. Global.GetSymbolSegmentedName(td,segmentedName);
  11149. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11150. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11151. ELSE
  11152. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11153. END;
  11154. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11155. Symbol(section, tir, 0, offset);
  11156. ELSE
  11157. Address(section, 0);
  11158. END;
  11159. END;
  11160. | type: SyntaxTree.PortType DO
  11161. Char(section, sfTypePORT);
  11162. IF type.direction = SyntaxTree.OutPort THEN
  11163. Char(section, sfOUT)
  11164. ELSE
  11165. Char(section, sfIN)
  11166. END;
  11167. | type: SyntaxTree.ProcedureType DO
  11168. IF ~Indirect(type) THEN
  11169. Char(section, sfTypeDelegate);
  11170. parameter := type.firstParameter;
  11171. WHILE(parameter # NIL) DO
  11172. NParameter(parameter, -1);
  11173. parameter := parameter.nextParameter;
  11174. END;
  11175. NType(type.returnType);
  11176. END;
  11177. | type:SyntaxTree.EnumerationType DO
  11178. Char(section, sfTypeENUM);
  11179. | type: SyntaxTree.BasicType DO
  11180. WITH type: SyntaxTree.BooleanType DO
  11181. IF RefInfo THEN Info(section,"Boolean") END;
  11182. Char(section, sfTypeBOOLEAN);
  11183. | type: SyntaxTree.CharacterType DO
  11184. IF type = module.system.characterType THEN
  11185. IF RefInfo THEN Info(section,"CHAR") END;
  11186. Char(section, sfTypeCHAR);
  11187. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11188. IF RefInfo THEN Info(section,"CHAR8") END;
  11189. Char(section, sfTypeCHAR8)
  11190. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11191. IF RefInfo THEN Info(section,"CHAR16") END;
  11192. Char(section, sfTypeCHAR16);
  11193. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11194. IF RefInfo THEN Info(section,"CHAR32") END;
  11195. Char(section, sfTypeCHAR32);
  11196. ELSE
  11197. HALT(100);
  11198. END;
  11199. |type: SyntaxTree.IntegerType DO
  11200. IF type(SyntaxTree.IntegerType).signed THEN
  11201. IF (type = module.system.shortintType) THEN
  11202. IF RefInfo THEN Info(section,"SHORTINT") END;
  11203. Char(section, sfTypeSHORTINT)
  11204. ELSIF (type = module.system.integerType) THEN
  11205. IF RefInfo THEN Info(section,"INTEGER") END;
  11206. Char(section, sfTypeINTEGER)
  11207. ELSIF (type = module.system.longintType) THEN
  11208. IF RefInfo THEN Info(section,"LONGINT") END;
  11209. Char(section, sfTypeLONGINT)
  11210. ELSIF (type = module.system.hugeintType) THEN
  11211. IF RefInfo THEN Info(section,"HUGEINT") END;
  11212. Char(section, sfTypeHUGEINT)
  11213. ELSIF (type = module.system.wordType) THEN
  11214. IF RefInfo THEN Info(section,"WORD") END;
  11215. Char(section, sfTypeWORD)
  11216. ELSIF (type = module.system.longWordType) THEN
  11217. IF RefInfo THEN Info(section,"LONGWORD") END;
  11218. Char(section, sfTypeLONGWORD);
  11219. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11220. IF RefInfo THEN Info(section,"SIGNED8") END;
  11221. Char(section, sfTypeSIGNED8)
  11222. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11223. IF RefInfo THEN Info(section,"SIGNED16") END;
  11224. Char(section, sfTypeSIGNED16)
  11225. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11226. IF RefInfo THEN Info(section,"SIGNED32") END;
  11227. Char(section, sfTypeSIGNED32)
  11228. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11229. IF RefInfo THEN Info(section,"SIGNED64") END;
  11230. Char(section, sfTypeSIGNED64)
  11231. ELSE
  11232. HALT(100);
  11233. END
  11234. ELSE (* unsigned *)
  11235. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11236. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11237. Char(section, sfTypeUNSIGNED8)
  11238. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11239. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11240. Char(section, sfTypeUNSIGNED16)
  11241. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11242. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11243. Char(section, sfTypeUNSIGNED32)
  11244. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11245. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11246. Char(section, sfTypeUNSIGNED64)
  11247. ELSE
  11248. HALT(100)
  11249. END
  11250. END;
  11251. | type: SyntaxTree.FloatType DO
  11252. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11253. IF RefInfo THEN Info(section,"REAL") END;
  11254. Char(section, sfTypeREAL);
  11255. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11256. IF RefInfo THEN Info(section,"LONGREAL") END;
  11257. Char(section, sfTypeLONGREAL);
  11258. ELSE
  11259. HALT(100);
  11260. END;
  11261. |type: SyntaxTree.ComplexType DO
  11262. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11263. IF RefInfo THEN Info(section,"COMPLEX") END;
  11264. Char(section, sfTypeCOMPLEX);
  11265. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11266. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11267. Char(section, sfTypeLONGCOMPLEX);
  11268. ELSE
  11269. HALT(100);
  11270. END;
  11271. |type:SyntaxTree.SetType DO
  11272. IF RefInfo THEN Info(section,"SET") END;
  11273. Char(section, sfTypeSET);
  11274. |type:SyntaxTree.AnyType DO
  11275. IF RefInfo THEN Info(section,"ANY") END;
  11276. Char(section, sfTypeANY);
  11277. |type:SyntaxTree.ObjectType DO
  11278. IF RefInfo THEN Info(section,"OBJECT") END;
  11279. Char(section, sfTypeOBJECT);
  11280. |type:SyntaxTree.ByteType DO
  11281. IF RefInfo THEN Info(section,"BYTE") END;
  11282. Char(section, sfTypeBYTE);
  11283. |type:SyntaxTree.RangeType DO
  11284. IF RefInfo THEN Info(section,"RANGE") END;
  11285. Char(section, sfTypeRANGE)
  11286. |type:SyntaxTree.AddressType DO
  11287. IF RefInfo THEN Info(section,"ADDRESS") END;
  11288. Char(section, sfTypeADDRESS)
  11289. |type:SyntaxTree.SizeType DO
  11290. IF RefInfo THEN Info(section,"SIZE") END;
  11291. Char(section, sfTypeSIZE)
  11292. ELSE
  11293. HALT(100)
  11294. END;
  11295. ELSE HALT(101);
  11296. END;
  11297. END;
  11298. END NType;
  11299. (*
  11300. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11301. *)
  11302. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11303. VAR pos: LONGINT; type: SyntaxTree.Type;
  11304. BEGIN
  11305. IF RefInfo THEN Info(section, "Parameter") END;
  11306. Char(section, sfVariable);
  11307. Size(section, procOffset);
  11308. String0(section, parameter.name);
  11309. type := parameter.type.resolved;
  11310. IF parameter.kind = SyntaxTree.VarParameter THEN
  11311. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11312. ELSE Char(section, sfIndirect)
  11313. END;
  11314. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11315. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11316. Char(section, sfIndirect);
  11317. ELSE
  11318. Char(section, sfRelative);
  11319. END;
  11320. ELSE
  11321. Char(section, sfRelative);
  11322. END;
  11323. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11324. NType(parameter.type);
  11325. END NParameter;
  11326. (*
  11327. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11328. *)
  11329. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11330. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11331. flags: SET;
  11332. BEGIN
  11333. IF procedure.externalName # NIL THEN RETURN END;
  11334. IF RefInfo THEN Info(section, "Procedure") END;
  11335. pos := CurrentIndex();
  11336. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11337. Char(section, sfProcedure);
  11338. Size(section, scopeOffset);
  11339. String0(section,procedure.name);
  11340. s := module.allSections.FindBySymbol(procedure);
  11341. Symbol(section,s,0,0); (* start *)
  11342. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11343. flags := {};
  11344. IF procedureType.isDelegate THEN
  11345. INCL(flags, flagDelegate);
  11346. END;
  11347. IF procedure.isConstructor THEN
  11348. INCL(flags, flagConstructor);
  11349. END;
  11350. Set(section, flags);
  11351. IF RefInfo THEN Info(section, "Parameters") END;
  11352. parameter := procedureType.firstParameter;
  11353. WHILE(parameter # NIL) DO
  11354. NParameter(parameter, pos);
  11355. parameter := parameter.nextParameter;
  11356. END;
  11357. IF procedureType.returnParameter # NIL THEN
  11358. NParameter(procedureType.returnParameter, pos);
  11359. END;
  11360. IF procedureType.selfParameter # NIL THEN
  11361. NParameter(procedureType.selfParameter, pos);
  11362. END;
  11363. IF RefInfo THEN Info(section, "ReturnType") END;
  11364. NType(procedureType.returnType);
  11365. NScope(procedure.procedureScope, pos);
  11366. END NProcedure;
  11367. (*
  11368. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11369. *)
  11370. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11371. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11372. BEGIN
  11373. IF RefInfo THEN Info(section, "Variable") END;
  11374. pos := CurrentIndex();
  11375. Char(section, sfVariable);
  11376. Size(section, scopeOffset);
  11377. String0(section, variable.name);
  11378. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11379. Char(section, sfAbsolute);
  11380. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11381. NamedSymbol(section, sn,variable, 0,0);
  11382. ELSE
  11383. Char(section, sfRelative);
  11384. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11385. END;
  11386. NType(variable.type);
  11387. s := module.allSections.FindBySymbol(variable);
  11388. END NVariable;
  11389. (*
  11390. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11391. *)
  11392. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11393. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11394. BEGIN
  11395. IF typeDeclaration = NIL THEN RETURN END;
  11396. pos := CurrentIndex();
  11397. s := module.allSections.FindBySymbol(typeDeclaration);
  11398. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11399. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11400. Char(section, sfTypeDeclaration);
  11401. Size(section, scopeOffset);
  11402. String0(section, typeDeclaration.name);
  11403. declared := typeDeclaration.declaredType.resolved;
  11404. IF (declared IS SyntaxTree.PointerType) THEN
  11405. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11406. END;
  11407. WITH declared: SyntaxTree.RecordType DO
  11408. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11409. Symbol(section, s, 0, offset);
  11410. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11411. Basic.AppendToSegmentedName(name,".@Info");
  11412. s := module.allSections.FindByName(name);
  11413. IF s # NIL THEN (* does not work for coop *)
  11414. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11415. END;
  11416. NScope(declared.recordScope, pos);
  11417. |declared: SyntaxTree.CellType DO
  11418. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11419. Symbol(section, s, 0, offset);
  11420. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11421. Basic.AppendToSegmentedName(name,".@Info");
  11422. s := module.allSections.FindByName(name);
  11423. IF s # NIL THEN
  11424. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11425. END;
  11426. NScope(declared.cellScope, pos);
  11427. ELSE
  11428. Address(section, 0);
  11429. END;
  11430. END NTypeDeclaration;
  11431. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11432. VAR pos: LONGINT;
  11433. BEGIN
  11434. pos := CurrentIndex();
  11435. Char(section,sfModule);
  11436. Size(section, prevSymbol);
  11437. String0(section, module.name);
  11438. NScope(module.moduleScope, pos);
  11439. END NModule;
  11440. (*
  11441. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11442. *)
  11443. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11444. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11445. BEGIN
  11446. IF scope = NIL THEN RETURN END;
  11447. IF RefInfo THEN Info(section, "Scope") END;
  11448. Char(section, sfScopeBegin);
  11449. variable := scope.firstVariable;
  11450. WHILE (variable # NIL) DO
  11451. NVariable(variable, prevSymbol);
  11452. variable := variable.nextVariable;
  11453. END;
  11454. WITH scope: SyntaxTree.ModuleScope DO
  11455. bodyProcedure := scope.bodyProcedure;
  11456. |scope: SyntaxTree.RecordScope DO
  11457. bodyProcedure := scope.bodyProcedure;
  11458. ELSE
  11459. bodyProcedure := NIL;
  11460. END;
  11461. IF bodyProcedure # NIL THEN
  11462. NProcedure(bodyProcedure, prevSymbol)
  11463. END;
  11464. procedure := scope.firstProcedure;
  11465. WHILE procedure # NIL DO
  11466. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11467. procedure := procedure.nextProcedure;
  11468. END;
  11469. typeDeclaration := scope.firstTypeDeclaration;
  11470. WHILE typeDeclaration # NIL DO
  11471. NTypeDeclaration(typeDeclaration, prevSymbol);
  11472. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11473. END;
  11474. Char(section, sfScopeEnd); (* scope ends *)
  11475. END NScope;
  11476. BEGIN
  11477. NEW(indirectTypes, 32);
  11478. ArrayBlock(section,sizePC,"", FALSE);
  11479. startPC := section.pc;
  11480. NModule(module.module, -1);
  11481. PatchArray(section,sizePC,CurrentIndex());
  11482. END References;
  11483. (*
  11484. Command* = RECORD
  11485. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11486. name*: Name; (* name of the procedure *)
  11487. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11488. entryAdr* : ADDRESS; (* entry address of procedure *)
  11489. END;
  11490. *)
  11491. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11492. VAR
  11493. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11494. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11495. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11496. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11497. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11498. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11499. BEGIN
  11500. RETURN
  11501. (type = NIL) OR
  11502. (type.resolved IS SyntaxTree.RecordType) OR
  11503. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11504. (type.resolved IS SyntaxTree.AnyType);
  11505. END TypeAllowed;
  11506. BEGIN
  11507. numberParameters := procedureType.numberParameters;
  11508. RETURN
  11509. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11510. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11511. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11512. END GetProcedureAllowed;
  11513. PROCEDURE WriteType(type : SyntaxTree.Type);
  11514. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11515. name: Basic.SegmentedName; offset: LONGINT;
  11516. BEGIN
  11517. IF type = NIL THEN
  11518. Address(source,0);
  11519. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11520. Address(source,1);
  11521. ELSE
  11522. type := type.resolved;
  11523. IF type IS SyntaxTree.PointerType THEN
  11524. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11525. END;
  11526. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11527. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11528. name[0] := typeDeclaration.name; name[1] := -1;
  11529. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11530. ASSERT(section # NIL);
  11531. ELSE
  11532. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11533. (* TODO *)
  11534. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11535. END;
  11536. IF implementationVisitor.backend.cooperative THEN
  11537. offset := 0;
  11538. ELSE
  11539. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11540. END;
  11541. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11542. END;
  11543. END WriteType;
  11544. BEGIN
  11545. Info(source, "command array descriptor");
  11546. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11547. numberCommands := 0;
  11548. Info(source, "command array content");
  11549. FOR i := 0 TO module.allSections.Length() - 1 DO
  11550. p := module.allSections.GetSection(i);
  11551. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11552. procedure := p.symbol(SyntaxTree.Procedure);
  11553. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11554. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11555. procedure.GetName(name);
  11556. Name(source,name);
  11557. numberParameters := procedureType.numberParameters;
  11558. (* offset of type of first parameter *)
  11559. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11560. ELSE WriteType(procedureType.firstParameter.type)
  11561. END;
  11562. (* offset of type of return parameter *)
  11563. WriteType(procedureType.returnType);
  11564. (* command name *)
  11565. (* command code offset *)
  11566. Symbol(source,p,0,0);
  11567. INC(numberCommands);
  11568. IF Trace THEN
  11569. D.Ln;
  11570. END;
  11571. END;
  11572. END
  11573. END;
  11574. PatchArray(source,sizePC,numberCommands);
  11575. END CommandArray;
  11576. (* to prevent from double import of different module aliases *)
  11577. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11578. VAR i: SyntaxTree.Import;
  11579. BEGIN
  11580. i := module.module.moduleScope.firstImport;
  11581. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11582. i := i.nextImport;
  11583. END;
  11584. RETURN i = import
  11585. END IsFirstDirectOccurence;
  11586. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11587. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11588. BEGIN
  11589. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11590. ArrayBlock(source,pc,"", FALSE);
  11591. Info(source, "import module array data");
  11592. IF implementationVisitor.backend.cooperative THEN
  11593. offset := 0;
  11594. ELSE
  11595. IF module.system.addressType.sizeInBits = 64 THEN
  11596. (* change this when Heaps.HeapBlock is modified *)
  11597. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11598. ELSE
  11599. (* change this when Heaps.HeapBlock is modified *)
  11600. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11601. END;
  11602. END;
  11603. import := module.module.moduleScope.firstImport;
  11604. numberImports := 0;
  11605. WHILE import # NIL DO
  11606. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11607. Global.GetModuleSegmentedName(import.module,name);
  11608. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11609. NamedSymbol(source, name, NIL, 0, offset);
  11610. INC(numberImports);
  11611. END;
  11612. import := import.nextImport
  11613. END;
  11614. PatchArray(source,pc,numberImports);
  11615. END ImportsArray;
  11616. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11617. VAR
  11618. p: Sections.Section; sizePC, size, i: LONGINT;
  11619. BEGIN
  11620. Info(source, "Type info section");
  11621. size := 0;
  11622. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11623. FOR i := 0 TO module.allSections.Length() - 1 DO
  11624. p := module.allSections.GetSection(i);
  11625. WITH p: IntermediateCode.Section DO
  11626. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11627. Symbol(source,p,EmptyBlockOffset,0);
  11628. INC(size);
  11629. END;
  11630. END
  11631. END;
  11632. PatchArray(source,sizePC,size);
  11633. END TypeInfoSection;
  11634. (*
  11635. ProcTableEntry* = RECORD
  11636. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11637. noPtr*: LONGINT;
  11638. END;
  11639. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11640. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11641. *)
  11642. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11643. VAR
  11644. numberPointers: SIZE;
  11645. procedure: SyntaxTree.Procedure;
  11646. BEGIN
  11647. Info(section,"pcFrom");
  11648. Symbol(section,procedureSection,0,0);
  11649. Info(section,"pcTo");
  11650. Symbol(section, procedureSection, procedureSection.pc, 0);
  11651. Info(section,"pointer to offsets array");
  11652. Symbol(section, section,section.pc+1,0);
  11653. Info(section,"offsets array");
  11654. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11655. PointerArray(section, procedure.procedureScope, numberPointers);
  11656. END ProcedureDescriptor;
  11657. (* only for tracing, the descriptor is otherwise not complete ! *)
  11658. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11659. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11660. BEGIN
  11661. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11662. name := procedureSection.name;
  11663. Basic.AppendToSegmentedName(name,".@Info");
  11664. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11665. Address(section,0);
  11666. Symbol(section,section,2,0);
  11667. (*
  11668. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11669. descSize: LONGINT;
  11670. sentinel: LONGINT; (* = MPO-4 *)
  11671. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11672. flags*: SET;
  11673. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11674. name*: Name;
  11675. END;
  11676. *)
  11677. Size(section, 0);
  11678. Longint(section,0);
  11679. Address(section,0);
  11680. Set(section,{});
  11681. moduleSection := ModuleSection();
  11682. Symbol( section, moduleSection, moduleSection.pc,0);
  11683. IF procedureSection.symbol = NIL THEN
  11684. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11685. ELSE
  11686. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11687. END;
  11688. Name(section, infoName);
  11689. Size(section, 0);
  11690. RETURN section;
  11691. END MakeProcedureDescriptorTag;
  11692. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11693. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11694. BEGIN
  11695. name := procedureSection.name;
  11696. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11697. IF implementationVisitor.backend.cooperative THEN
  11698. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11699. Info(section, "TypeDescriptor");
  11700. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11701. NamedSymbol(dest, name,NIL, 0, 0);
  11702. BaseRecord(dest);
  11703. offset := 0;
  11704. ELSIF CreateProcedureDescInfo THEN
  11705. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11706. Address(dest,0);
  11707. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11708. offset := dest.pc;
  11709. ELSE
  11710. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11711. END;
  11712. ProcedureDescriptor(dest, procedureSection);
  11713. Symbol(section, dest, offset, 0);
  11714. END ProcedureDescriptorPointer;
  11715. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11716. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11717. BEGIN
  11718. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11719. numberProcs := 0;
  11720. FOR i := 0 TO module.allSections.Length() - 1 DO
  11721. destination := module.allSections.GetSection(i);
  11722. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11723. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11724. INC(numberProcs);
  11725. END
  11726. END;
  11727. PatchArray(section, sizePC, numberProcs);
  11728. END ProcedureDescriptorArray;
  11729. (*
  11730. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11731. VAR
  11732. next*: Module; (** once a module is published, all fields are read-only *)
  11733. name*: Name;
  11734. init, published: BOOLEAN;
  11735. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11736. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11737. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11738. command*: POINTER TO ARRAY OF Command;
  11739. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11740. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11741. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11742. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11743. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11744. data*, code*: Bytes;
  11745. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11746. export*: ExportDesc;
  11747. term*: TerminationHandler;
  11748. exTable*: ExceptionTable;
  11749. noProcs*: LONGINT;
  11750. firstProc*: ADDRESS; <- done by loader
  11751. maxPtrs*: LONGINT;
  11752. crc*: LONGINT;
  11753. *)
  11754. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11755. BEGIN
  11756. Info(section, "cycle");
  11757. Size(section,0);
  11758. Info(section, "references");
  11759. Size(section,0);
  11760. Info(section, "nextMarked");
  11761. Address(section,0);
  11762. Info(section, "nextWatched");
  11763. Address(section,0);
  11764. END BasePointer;
  11765. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11766. BEGIN
  11767. BasePointer(section);
  11768. Info(section, "action");
  11769. Address(section,0);
  11770. Info(section, "monitor");
  11771. Address(section,0);
  11772. END BaseObject;
  11773. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11774. BEGIN
  11775. BasePointer(section);
  11776. Info(section, "action");
  11777. Address(section,0);
  11778. Info(section, "monitor");
  11779. Address(section,0);
  11780. END BaseRecord;
  11781. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11782. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11783. pooledName: Basic.SegmentedName;
  11784. symbol: SyntaxTree.Symbol;
  11785. BEGIN
  11786. Global.GetModuleName(module.module,name);
  11787. Strings.Append(name,".@Module.@Descriptor");
  11788. Basic.ToSegmentedName(name, pooledName);
  11789. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11790. Symbol(section,descriptorSection,0,0);
  11791. Info(descriptorSection, "descriptor");
  11792. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11793. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11794. Address(descriptorSection,0);
  11795. Global.GetModuleName(module.module,name);
  11796. Strings.Append(name,".@Trace");
  11797. Basic.ToSegmentedName(name, pooledName);
  11798. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11799. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11800. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11801. END ModuleDescriptor;
  11802. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11803. VAR name: ARRAY 128 OF CHAR;
  11804. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11805. symbol: SyntaxTree.Symbol;
  11806. BEGIN
  11807. ASSERT(implementationVisitor.backend.newObjectFile);
  11808. Global.GetModuleName(module.module,name);
  11809. Strings.Append(name,".@Module");
  11810. Basic.ToSegmentedName(name, pooledName);
  11811. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11812. moduleSection.SetExported(TRUE);
  11813. IF moduleSection.pc = 0 THEN
  11814. IF implementationVisitor.backend.cooperative THEN
  11815. Info(moduleSection, "descriptor");
  11816. ModuleDescriptor(moduleSection);
  11817. BaseObject(moduleSection);
  11818. implementationVisitor.CreateTraceModuleMethod(module.module);
  11819. ELSE
  11820. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11821. Info(moduleSection, "HeapBlock");
  11822. Symbol(moduleSection,moduleSection,2,0);
  11823. Info(moduleSection, "TypeDescriptor");
  11824. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11825. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11826. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11827. END;
  11828. END;
  11829. RETURN moduleSection;
  11830. END ModuleSection;
  11831. PROCEDURE NewModuleInfo();
  11832. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11833. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11834. sectionName: Basic.SectionName;
  11835. CONST MPO=-40000000H;
  11836. BEGIN
  11837. (*
  11838. TypeDesc* = POINTER TO RECORD
  11839. descSize: SIZE;
  11840. sentinel: LONGINT; (* = MPO-4 *)
  11841. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11842. flags*: SET;
  11843. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11844. name*: Name;
  11845. refsOffset: SIZE;
  11846. END;
  11847. *)
  11848. (*name is missing prefixes sometimes*)
  11849. Global.GetModuleSegmentedName(module.module,name);
  11850. Basic.AppendToSegmentedName(name,".@Info");
  11851. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11852. Info(source, "HeapBlock");
  11853. Address(source,0); (* an empty heap block prevents GC marking *)
  11854. Info(source, "TypeDescriptor");
  11855. Address(source,0);
  11856. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  11857. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11858. Address(source,MPO-4);
  11859. Info(source, "type tag pointer");
  11860. Address( source,0);
  11861. Info(source, "type flags");
  11862. flags := {};
  11863. Set( source, flags);
  11864. Info(source, "pointer to module");
  11865. moduleSection := ModuleSection();
  11866. Symbol( source, moduleSection, moduleSection.pc,0);
  11867. Info(source, "type name");
  11868. i := 0;
  11869. sectionName := "@Self";
  11870. (*
  11871. Global.GetSymbolSegmentedName(td,name);
  11872. Basic.SegmentedNameToString(name, sectionName);
  11873. *)
  11874. Name(source,sectionName);
  11875. source.SetReferenced(FALSE);
  11876. patchInfoPC := source.pc;
  11877. Size(source, 0);
  11878. END NewModuleInfo;
  11879. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11880. VAR
  11881. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11882. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  11883. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11884. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  11885. referenceSectionOffset : LONGINT;
  11886. name: Basic.SegmentedName; offset: LONGINT;
  11887. flags: SET;
  11888. BEGIN
  11889. NewModuleInfo();
  11890. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11891. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11892. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11893. ImportsArray(importSection);
  11894. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11895. CommandArray(commandsSection);
  11896. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11897. ExceptionArray(exceptionSection);
  11898. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11899. AddPointer(typeInfoSection, typeInfoSectionOffset);
  11900. TypeInfoSection(typeInfoSection);
  11901. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11902. References(referenceSection);
  11903. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11904. ProcedureDescriptorArray(procTableSection, numberProcs);
  11905. IF ProtectModulesPointers THEN
  11906. name := "Heaps.AnyPtr";
  11907. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11908. (* set base pointer *)
  11909. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  11910. END;
  11911. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11912. ArrayBlock(emptyArraySection,temp,"", FALSE);
  11913. moduleSection := ModuleSection();
  11914. Info(moduleSection, "nextRoot*: RootObject");
  11915. Address(moduleSection,0);
  11916. Info(moduleSection, "next*: Module");
  11917. Address(moduleSection,0);
  11918. Info(moduleSection, "name*: Name");
  11919. Name(moduleSection,moduleName);
  11920. Info(moduleSection, "init, published: BOOLEAN");
  11921. Boolean(moduleSection,FALSE);
  11922. Boolean(moduleSection,FALSE);
  11923. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11924. Boolean(moduleSection,FALSE);
  11925. Boolean(moduleSection,FALSE);
  11926. Info(moduleSection, "refcnt*: LONGINT");
  11927. Longint(moduleSection,0);
  11928. Info(moduleSection, "sb*: ADDRESS");
  11929. Address(moduleSection,0);
  11930. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11931. Address(moduleSection,0);
  11932. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11933. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11934. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11935. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11936. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11937. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11938. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11939. Symbol(moduleSection,importSection,importSectionOffset,0);
  11940. Info(moduleSection, "procTable*: ProcTable");
  11941. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11942. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11943. Address(moduleSection,0);
  11944. Address(moduleSection,0);
  11945. Address(moduleSection,0);
  11946. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  11947. Info(moduleSection, "export*: ExportDesc");
  11948. ExportDesc(moduleSection);
  11949. Info(moduleSection, "term*: TerminationHandler");
  11950. Address(moduleSection,0);
  11951. Info(moduleSection, "exTable*: ExceptionTable");
  11952. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  11953. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding -> alignment *)
  11954. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  11955. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  11956. Info(moduleSection, "crc*: LONGINT");
  11957. patchCRC:= moduleSection.pc;
  11958. Longint(moduleSection, 0); (*! must be implemented *)
  11959. Info(moduleSection, "body*: ADDRESS");
  11960. Symbol(moduleSection, bodyProc, 0,0);
  11961. Info(moduleSection, "module flags");
  11962. flags := {};
  11963. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  11964. Set( moduleSection, flags);
  11965. IF implementationVisitor.backend.cooperative THEN
  11966. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  11967. Info(moduleSection, "monitor.owner");
  11968. Address(moduleSection,0);
  11969. Info(moduleSection, "monitor.nestingLevel");
  11970. Address(moduleSection,0);
  11971. Info(moduleSection, "monitor.blockedQueue");
  11972. Address(moduleSection,0); Address(moduleSection,0);
  11973. Info(moduleSection, "monitor.waitingQueue");
  11974. Address(moduleSection,0); Address(moduleSection,0);
  11975. Info(moduleSection, "monitor.waitingSentinel");
  11976. Address(moduleSection,0);
  11977. END;
  11978. END Module;
  11979. PROCEDURE PatchCRC(crc: LONGINT);
  11980. BEGIN
  11981. IF implementationVisitor.newObjectFile & ~simple THEN
  11982. PatchLongint(ModuleSection(), patchCRC, crc);
  11983. END;
  11984. END PatchCRC;
  11985. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  11986. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: SIZE;
  11987. BEGIN
  11988. ArrayBlock(source,pc,"",FALSE);
  11989. Info(source, "pointer offsets array data");
  11990. IF scope IS SyntaxTree.RecordScope THEN
  11991. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  11992. ELSIF scope IS SyntaxTree.CellScope THEN
  11993. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  11994. ELSIF scope IS SyntaxTree.ModuleScope THEN
  11995. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  11996. WHILE variable # NIL DO
  11997. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  11998. symbol := module.allSections.FindBySymbol(variable);
  11999. ASSERT(symbol # NIL);
  12000. Pointers(0,symbol, source,variable.type,numberPointers);
  12001. END;
  12002. variable := variable.nextVariable;
  12003. END;
  12004. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12005. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12006. WHILE parameter # NIL DO
  12007. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12008. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12009. END;
  12010. parameter := parameter.nextParameter;
  12011. END;
  12012. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12013. parametersSize := ProcedureParametersSize(module.system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12014. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12015. IF implementationVisitor.backend.preciseGC THEN
  12016. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12017. END;
  12018. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12019. END;
  12020. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12021. WHILE(variable # NIL) DO
  12022. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12023. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12024. END;
  12025. variable := variable.nextVariable
  12026. END;
  12027. END;
  12028. PatchArray(source,pc,numberPointers);
  12029. END PointerArray;
  12030. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12031. VAR
  12032. name: Basic.SegmentedName;
  12033. section: IntermediateCode.Section;
  12034. BEGIN
  12035. ASSERT(implementationVisitor.newObjectFile);
  12036. Global.GetSymbolSegmentedName(symbol,name);
  12037. Basic.AppendToSegmentedName(name,suffix);
  12038. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12039. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12040. Info(section, "HeapBlock");
  12041. Address(section,0); (* empty such that GC does not go on traversing *)
  12042. Info(section, suffix);
  12043. Address(section,0);
  12044. pc := section.pc;
  12045. RETURN section;
  12046. END SymbolSection;
  12047. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12048. VAR recordType: SyntaxTree.RecordType;
  12049. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12050. section: Sections.Section; cellType: SyntaxTree.CellType;
  12051. tdInfoOffset: LONGINT;
  12052. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12053. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12054. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12055. sectionName: Basic.SectionName;
  12056. CONST MPO=-40000000H;
  12057. BEGIN
  12058. (*
  12059. TypeDesc* = POINTER TO RECORD
  12060. descSize: SIZE;
  12061. sentinel: LONGINT; (* = MPO-4 *)
  12062. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12063. flags*: SET;
  12064. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12065. name*: Name;
  12066. refsOffset: SIZE;
  12067. END;
  12068. *)
  12069. (* source := module.sections.FindByName(...) *)
  12070. Global.GetSymbolSegmentedName(td,name);
  12071. Basic.AppendToSegmentedName(name,".@Info");
  12072. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12073. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12074. Address(source,0);
  12075. Info(source, "TypeDescriptor");
  12076. Address(source,0);
  12077. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12078. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12079. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12080. Info(source, "type tag pointer");
  12081. Symbol( source, tag, offset, 0);
  12082. Info(source, "type flags");
  12083. flags := {};
  12084. IF isProtected THEN INCL(flags,31) END;
  12085. Set( source, flags);
  12086. Info(source, "pointer to module");
  12087. moduleSection := ModuleSection();
  12088. Symbol( source, moduleSection, moduleSection.pc,0);
  12089. Info(source, "type name");
  12090. i := 0;
  12091. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12092. (*
  12093. Global.GetSymbolSegmentedName(td,name);
  12094. Basic.SegmentedNameToString(name, sectionName);
  12095. *)
  12096. Name(source,sectionName);
  12097. source.SetReferenced(FALSE);
  12098. Size(source, 0);
  12099. RETURN source;
  12100. END NewTypeDescriptorInfo;
  12101. PROCEDURE NewTypeDescriptor;
  12102. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12103. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12104. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12105. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12106. CONST MPO=-40000000H;
  12107. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12108. VAR i: LONGINT;
  12109. PROCEDURE Td(record: SyntaxTree.RecordType);
  12110. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12111. BEGIN
  12112. IF record # NIL THEN
  12113. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12114. baseTD := record.typeDeclaration;
  12115. Global.GetSymbolSegmentedName(baseTD,name);
  12116. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12117. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12118. ELSE
  12119. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12120. END;
  12121. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12122. Symbol(source, tir, 0, offset);
  12123. IF reverse THEN Td(record.GetBaseRecord()) END;
  12124. END;
  12125. END Td;
  12126. BEGIN
  12127. Info(source, "tag table");
  12128. baseRecord := recordType;
  12129. i := 0;
  12130. WHILE baseRecord # NIL DO
  12131. INC(i);
  12132. baseRecord := baseRecord.GetBaseRecord();
  12133. END;
  12134. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12135. IF ~reverse THEN Td(recordType) END;
  12136. WHILE i < size DO
  12137. Address(source,0);
  12138. INC(i);
  12139. END;
  12140. IF reverse THEN Td(recordType) END;
  12141. END TdTable;
  12142. PROCEDURE MethodTable(reverse: BOOLEAN);
  12143. VAR i,methods: LONGINT;
  12144. BEGIN
  12145. Info(source, "method table");
  12146. IF recordType # NIL THEN
  12147. methods := recordType.recordScope.numberMethods;
  12148. IF reverse THEN
  12149. FOR i := methods-1 TO 0 BY -1 DO
  12150. procedure := recordType.recordScope.FindMethod(i);
  12151. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12152. NamedSymbol(source, name,procedure, 0,0);
  12153. END;
  12154. ELSE
  12155. FOR i := 0 TO methods-1 DO
  12156. procedure := recordType.recordScope.FindMethod(i);
  12157. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12158. NamedSymbol(source, name,procedure, 0,0);
  12159. END;
  12160. END;
  12161. END;
  12162. END MethodTable;
  12163. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12164. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12165. BEGIN
  12166. Info(source, "method table");
  12167. baseRecord := recordType;
  12168. WHILE baseRecord.baseType # NIL DO
  12169. baseRecord := baseRecord.GetBaseRecord ();
  12170. END;
  12171. GetRecordTypeName (baseRecord, name);
  12172. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12173. IF name = stackFrame THEN
  12174. start := 0;
  12175. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12176. baseRecord := recordType;
  12177. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12178. baseRecord := baseRecord.GetBaseRecord ();
  12179. END;
  12180. IF baseRecord # NIL THEN
  12181. GetRecordTypeName (baseRecord, name);
  12182. IF pointer & ~baseRecord.isObject THEN
  12183. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12184. END;
  12185. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12186. ELSIF recordType.isObject THEN
  12187. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12188. ELSIF pointer THEN
  12189. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12190. ELSE
  12191. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12192. END;
  12193. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12194. Symbol(source, tir, 0, 0);
  12195. start := 0;
  12196. baseRecord := recordType;
  12197. WHILE (baseRecord # NIL) DO
  12198. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12199. baseRecord := baseRecord.GetBaseRecord ();
  12200. END;
  12201. ELSE
  12202. (* explicit trace method: *)
  12203. procedure := recordType.recordScope.FindMethod(0);
  12204. IF ~procedure.isFinalizer THEN
  12205. Global.GetSymbolSegmentedName(procedure, name);
  12206. NamedSymbol(source, name,procedure, 0,0);
  12207. END;
  12208. start := 1;
  12209. END;
  12210. IF (name # stackFrame) & recordType.isObject THEN
  12211. baseRecord := recordType;
  12212. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12213. baseRecord := baseRecord.GetBaseRecord ();
  12214. END;
  12215. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12216. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12217. ELSE
  12218. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12219. END;
  12220. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12221. Symbol(source, tir, 0, 0);
  12222. END;
  12223. methods := recordType.recordScope.numberMethods;
  12224. FOR i := start TO methods-1 DO
  12225. procedure := recordType.recordScope.FindMethod(i);
  12226. IF ~procedure.isFinalizer THEN
  12227. Global.GetSymbolSegmentedName(procedure, name);
  12228. NamedSymbol(source, name,procedure, 0,0);
  12229. END;
  12230. END;
  12231. END CooperativeMethodTable;
  12232. BEGIN
  12233. Global.GetSymbolSegmentedName(td,name);
  12234. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12235. source.SetExported(IsExported(td));
  12236. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12237. IF implementationVisitor.backend.cooperative THEN
  12238. base := NIL;
  12239. baseRecord := recordType.GetBaseRecord();
  12240. IF baseRecord # NIL THEN
  12241. baseTD := baseRecord.typeDeclaration;
  12242. END;
  12243. IF ~recordType.isObject THEN
  12244. Info(source, "parent");
  12245. IF baseRecord # NIL THEN
  12246. Global.GetSymbolSegmentedName(baseTD,name);
  12247. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12248. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12249. ELSE
  12250. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12251. END;
  12252. Symbol(source, tir, 0, 0);
  12253. ELSE
  12254. Address(source,0);
  12255. END;
  12256. Info(source, "record size");
  12257. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12258. source.SetReferenced(FALSE);
  12259. CooperativeMethodTable(FALSE);
  12260. base := source;
  12261. Global.GetSymbolSegmentedName(td,name);
  12262. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12263. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12264. source.SetExported(IsExported(td));
  12265. source.SetReferenced(FALSE);
  12266. END;
  12267. Info(source, "parent");
  12268. IF baseRecord # NIL THEN
  12269. Global.GetSymbolSegmentedName(baseTD,name);
  12270. sym := baseTD;
  12271. IF ~recordType.isObject THEN
  12272. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12273. sym := NIL;
  12274. END;
  12275. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12276. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12277. ELSE
  12278. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12279. END;
  12280. Symbol(source, tir, 0, 0);
  12281. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12282. Address(source,0);
  12283. ELSE
  12284. IF recordType.isObject THEN
  12285. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12286. ELSE
  12287. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12288. END;
  12289. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12290. Symbol(source, tir, 0, 0);
  12291. END;
  12292. Info(source, "base record descriptor");
  12293. Symbol(source, base, 0, 0);
  12294. CooperativeMethodTable(TRUE);
  12295. source.SetReferenced(FALSE);
  12296. IF recordType.hasPointers THEN
  12297. IF ~HasExplicitTraceMethod (recordType) THEN
  12298. implementationVisitor.CreateTraceMethod(recordType);
  12299. END;
  12300. implementationVisitor.CreateResetProcedure(recordType);
  12301. implementationVisitor.CreateAssignProcedure(recordType);
  12302. END;
  12303. ELSIF ~simple THEN
  12304. (*
  12305. MethodEnd = MPO
  12306. ---
  12307. methods (# methods)
  12308. ---
  12309. tags (16)
  12310. ---
  12311. TypeDesc = TypeInfoAdr
  12312. ---
  12313. td adr ---> rec size
  12314. ----
  12315. pointer offsets
  12316. ----
  12317. (padding)
  12318. -----
  12319. empty [2 addresses aligned]
  12320. empty
  12321. empty
  12322. numPtrs
  12323. ---
  12324. pointer offsets
  12325. ---
  12326. *)
  12327. Info(source, "MethodEnd = MPO");
  12328. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12329. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12330. MethodTable(TRUE);
  12331. TdTable(TypeTags, TRUE);
  12332. Info(source, "type descriptor info pointer");
  12333. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12334. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12335. IF (cellType # NIL) THEN
  12336. IF cellType.sizeInBits < 0 THEN
  12337. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12338. END;
  12339. Info(source, "cell size");
  12340. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12341. ELSE
  12342. Info(source, "record size");
  12343. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12344. END;
  12345. Info(source, "pointer offsets pointer");
  12346. padding := 1- source.pc MOD 2;
  12347. Symbol(source, source, source.pc+1+padding,0);
  12348. IF padding >0 THEN
  12349. Info(source, "padding");
  12350. FOR i := 1 TO padding DO Address(source,0) END;
  12351. END;
  12352. IF cellType # NIL THEN
  12353. PointerArray(source, cellType.cellScope, numberPointers);
  12354. ELSE
  12355. PointerArray(source, recordType.recordScope, numberPointers);
  12356. END;
  12357. ELSE
  12358. (*
  12359. simple:
  12360. td adr --> size
  12361. tag(1)
  12362. tag(2)
  12363. tag(3)
  12364. methods ->
  12365. *)
  12366. Info(source, "record size");
  12367. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12368. TdTable(TypeTags, FALSE);
  12369. MethodTable(FALSE);
  12370. source.SetReferenced(FALSE);
  12371. END;
  12372. END NewTypeDescriptor;
  12373. BEGIN
  12374. x := x.resolved;
  12375. IF (x IS SyntaxTree.PointerType) THEN
  12376. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12377. END;
  12378. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12379. recordType := x(SyntaxTree.RecordType);
  12380. td := x.typeDeclaration;
  12381. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12382. ASSERT(td # NIL);
  12383. section := module.allSections.FindBySymbol(td); (* TODO *)
  12384. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12385. IF implementationVisitor.newObjectFile THEN
  12386. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12387. NewTypeDescriptor
  12388. END;
  12389. ELSE
  12390. (* data section in intermediate code *)
  12391. Global.GetSymbolSegmentedName(td,name);
  12392. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  12393. Basic.SuffixSegmentedName (name, module.module.name);
  12394. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  12395. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  12396. tir.Emit(Data(Basic.invalidPosition,op));
  12397. END;
  12398. END;
  12399. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12400. cellType := x(SyntaxTree.CellType);
  12401. td := x.typeDeclaration;
  12402. section := module.allSections.FindBySymbol(td); (* TODO *)
  12403. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12404. IF implementationVisitor.newObjectFile THEN
  12405. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12406. NewTypeDescriptor
  12407. END;
  12408. END;
  12409. END;
  12410. END
  12411. END CheckTypeDeclaration
  12412. END MetaDataGenerator;
  12413. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12414. VAR
  12415. trace-: BOOLEAN;
  12416. traceString-: SyntaxTree.IdentifierString;
  12417. traceModuleName-: SyntaxTree.IdentifierString;
  12418. newObjectFile-: BOOLEAN;
  12419. profile-: BOOLEAN;
  12420. noRuntimeChecks: BOOLEAN;
  12421. simpleMetaData-: BOOLEAN;
  12422. noAsserts: BOOLEAN;
  12423. optimize-: BOOLEAN;
  12424. cooperative-: BOOLEAN;
  12425. preregisterStatic-: BOOLEAN;
  12426. dump-: Basic.Writer;
  12427. cellsAreObjects: BOOLEAN;
  12428. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12429. experiment: BOOLEAN;
  12430. PROCEDURE &InitIntermediateBackend*;
  12431. BEGIN
  12432. simpleMetaData := FALSE;
  12433. newObjectFile := FALSE;
  12434. InitBackend;
  12435. SetRuntimeModuleName(DefaultRuntimeModuleName);
  12436. SetTraceModuleName(DefaultTraceModuleName);
  12437. END InitIntermediateBackend;
  12438. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12439. VAR
  12440. declarationVisitor: DeclarationVisitor;
  12441. implementationVisitor: ImplementationVisitor;
  12442. module: Sections.Module;
  12443. name, platformName: SyntaxTree.IdentifierString;
  12444. meta: MetaDataGenerator;
  12445. crc: CRC.CRC32Stream;
  12446. BEGIN
  12447. ResetError;
  12448. Global.GetSymbolName(x,name);
  12449. NEW(module,x,system); (* backend structures *)
  12450. Global.GetModuleName(x, name);
  12451. module.SetModuleName(name);
  12452. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  12453. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12454. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12455. declarationVisitor.Module(x,module);
  12456. IF newObjectFile & ~meta.simple THEN
  12457. meta.Module(implementationVisitor.moduleBodySection);
  12458. END;
  12459. GetDescription(platformName);
  12460. module.SetPlatformName(platformName);
  12461. IF newObjectFile THEN
  12462. NEW(crc);
  12463. module.allSections.WriteRaw(crc);
  12464. crc.Update;
  12465. meta.PatchCRC(crc.GetCRC());
  12466. END;
  12467. RETURN module
  12468. END GenerateIntermediate;
  12469. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12470. BEGIN RETURN TRUE
  12471. END SupportedImmediate;
  12472. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12473. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12474. END ProcessSyntaxTreeModule;
  12475. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12476. VAR
  12477. result: Sections.Module;
  12478. traceName: Basic.MessageString;
  12479. BEGIN
  12480. ASSERT(intermediateCodeModule IS Sections.Module);
  12481. result := intermediateCodeModule(Sections.Module);
  12482. IF trace THEN
  12483. traceName := "intermediate code trace: ";
  12484. Strings.Append(traceName,traceString);
  12485. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12486. IF (traceString="") OR (traceString="*") THEN
  12487. result.Dump(dump);
  12488. dump.Update
  12489. ELSE
  12490. Sections.DumpFiltered(dump, result, traceString);
  12491. END
  12492. END;
  12493. RETURN result
  12494. END ProcessIntermediateCodeModule;
  12495. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12496. BEGIN instructionSet := "Intermediate";
  12497. END GetDescription;
  12498. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  12499. BEGIN
  12500. SELF.newObjectFile := newObjectFile;
  12501. SELF.simpleMetaData := simpleMetaData;
  12502. END SetNewObjectFile;
  12503. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12504. BEGIN COPY(name, traceModuleName)
  12505. END SetTraceModuleName;
  12506. PROCEDURE DefineOptions(options: Options.Options);
  12507. BEGIN
  12508. DefineOptions^(options);
  12509. options.Add(0X,"trace",Options.String);
  12510. options.Add(0X,"runtime",Options.String);
  12511. options.Add(0X,"newObjectFile",Options.Flag);
  12512. options.Add(0X,"traceModule",Options.String);
  12513. options.Add(0X,"profile",Options.Flag);
  12514. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12515. options.Add(0X,"noAsserts",Options.Flag);
  12516. options.Add(0X,"metaData",Options.String);
  12517. options.Add('o',"optimize", Options.Flag);
  12518. options.Add(0X,"preregisterStatic", Options.Flag);
  12519. options.Add(0X,"cellsAreObjects", Options.Flag);
  12520. options.Add(0X,"preciseGC", Options.Flag);
  12521. options.Add(0X,"trackLeave", Options.Flag);
  12522. options.Add(0X,"writeBarriers", Options.Flag);
  12523. options.Add(0X,"experiment", Options.Flag);
  12524. END DefineOptions;
  12525. PROCEDURE GetOptions(options: Options.Options);
  12526. VAR name,string: SyntaxTree.IdentifierString;
  12527. BEGIN
  12528. GetOptions^(options);
  12529. trace := options.GetString("trace",traceString);
  12530. profile := options.GetFlag("profile");
  12531. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12532. noAsserts := options.GetFlag("noAsserts");
  12533. cooperative := options.GetFlag("cooperative");
  12534. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  12535. IF cooperative THEN
  12536. SetRuntimeModuleName("CPU") END
  12537. END;
  12538. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12539. simpleMetaData := TRUE
  12540. END;
  12541. IF options.GetString("metaData",string) THEN
  12542. IF string = "simple" THEN simpleMetaData := TRUE
  12543. ELSIF string ="full" THEN simpleMetaData := FALSE
  12544. END;
  12545. END;
  12546. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  12547. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12548. optimize := options.GetFlag("optimize");
  12549. preregisterStatic := options.GetFlag("preregisterStatic");
  12550. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12551. preciseGC := options.GetFlag("preciseGC");
  12552. trackLeave := options.GetFlag("trackLeave");
  12553. writeBarriers := options.GetFlag("writeBarriers");
  12554. experiment := options.GetFlag("experiment");
  12555. END GetOptions;
  12556. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  12557. BEGIN RETURN SymbolFileFormat.Get()
  12558. END DefaultSymbolFileFormat;
  12559. END IntermediateBackend;
  12560. (* ----------------------------------- register allocation ------------------------------------- *)
  12561. (* register mapping scheme
  12562. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12563. spill offset
  12564. part(n) --> ticket <--> physical register
  12565. spill offset
  12566. *)
  12567. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12568. emptyOperand: IntermediateCode.Operand;
  12569. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12570. statCoopResetVariables: LONGINT;
  12571. statCoopModifyAssignments: LONGINT;
  12572. modifyAssignmentsPC : LONGINT;
  12573. statCoopNilCheck: LONGINT;
  12574. statCoopSwitch: LONGINT;
  12575. statCoopAssignProcedure: LONGINT;
  12576. statCoopTraceMethod: LONGINT;
  12577. statCoopResetProcedure: LONGINT;
  12578. statCoopTraceModule: LONGINT;
  12579. PROCEDURE ResetStatistics*;
  12580. BEGIN
  12581. statCoopResetVariables := 0;
  12582. statCoopModifyAssignments := 0;
  12583. statCoopNilCheck:= 0;
  12584. statCoopSwitch:= 0;
  12585. statCoopAssignProcedure:= 0;
  12586. statCoopTraceMethod:= 0;
  12587. statCoopResetProcedure:= 0;
  12588. statCoopTraceModule:= 0;
  12589. END ResetStatistics;
  12590. PROCEDURE Statistics*;
  12591. BEGIN
  12592. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12593. TRACE(statCoopNilCheck, statCoopSwitch);
  12594. TRACE(statCoopAssignProcedure,
  12595. statCoopTraceMethod,
  12596. statCoopResetProcedure,
  12597. statCoopTraceModule)
  12598. END Statistics;
  12599. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12600. VAR h: LONGINT;
  12601. BEGIN
  12602. WHILE b # 0 DO
  12603. h := a MOD b;
  12604. a := b;
  12605. b := h;
  12606. END;
  12607. RETURN a
  12608. END GCD;
  12609. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12610. BEGIN
  12611. RETURN a*b DIV GCD(a,b)
  12612. END SCM;
  12613. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12614. BEGIN
  12615. (*TRACE(a,b);*)
  12616. IF a = 0 THEN RETURN b
  12617. ELSIF b = 0 THEN RETURN a
  12618. ELSE RETURN SCM(a,b)
  12619. END;
  12620. END CommonAlignment;
  12621. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  12622. BEGIN
  12623. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12624. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12625. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12626. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12627. 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)
  12628. END
  12629. END PassBySingleReference;
  12630. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  12631. BEGIN
  12632. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  12633. END PassInRegister;
  12634. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12635. VAR new: RegisterEntry;
  12636. BEGIN
  12637. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12638. IF queue = NIL THEN
  12639. queue := new
  12640. ELSE
  12641. new.next := queue;
  12642. IF queue#NIL THEN queue.prev := new END;
  12643. queue := new
  12644. END;
  12645. END AddRegisterEntry;
  12646. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12647. VAR this: RegisterEntry;
  12648. BEGIN
  12649. this := queue;
  12650. WHILE (this # NIL) & (this.register # register) DO
  12651. this := this.next;
  12652. END;
  12653. IF this = NIL THEN
  12654. RETURN FALSE
  12655. END;
  12656. ASSERT(this # NIL);
  12657. IF this = queue THEN queue := queue.next END;
  12658. IF this.prev # NIL THEN this.prev.next := this.next END;
  12659. IF this.next # NIL THEN this.next.prev := this.prev END;
  12660. RETURN TRUE
  12661. END RemoveRegisterEntry;
  12662. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12663. BEGIN ASSERT(cond);
  12664. END Assert;
  12665. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12666. BEGIN
  12667. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12668. END ReusableRegister;
  12669. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12670. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12671. BEGIN
  12672. procedure := moduleScope.bodyProcedure;
  12673. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12674. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12675. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12676. procedure.SetScope(moduleScope);
  12677. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12678. procedure.SetAccess(SyntaxTree.Hidden);
  12679. moduleScope.SetBodyProcedure(procedure);
  12680. moduleScope.AddProcedure(procedure);
  12681. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12682. END;
  12683. END EnsureBodyProcedure;
  12684. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12685. VAR import: SyntaxTree.Import;
  12686. selfName: SyntaxTree.IdentifierString;
  12687. module: SyntaxTree.Module;
  12688. BEGIN
  12689. scope.ownerModule.GetName(selfName);
  12690. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12691. module := scope.ownerModule
  12692. ELSE
  12693. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12694. IF import = NIL THEN
  12695. RETURN NIL
  12696. ELSIF import.module = NIL THEN
  12697. RETURN NIL
  12698. ELSE module := import.module
  12699. END;
  12700. END;
  12701. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12702. END GetSymbol;
  12703. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12704. BEGIN
  12705. op.mode := mode;
  12706. IntermediateCode.InitOperand(op.op);
  12707. IntermediateCode.InitOperand(op.tag);
  12708. IntermediateCode.InitOperand(op.extra);
  12709. op.dimOffset := 0;
  12710. END InitOperand;
  12711. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12712. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12713. BEGIN RETURN IntermediateCode.GetType(system, type)
  12714. END GetType;
  12715. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12716. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12717. BEGIN
  12718. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12719. (*
  12720. UniqueId(name,module,name,adr);
  12721. *)
  12722. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12723. constant.SetValue(value);
  12724. constant.SetAccess(SyntaxTree.Hidden);
  12725. module.moduleScope.AddConstant(constant);
  12726. constant.SetScope(module.moduleScope);
  12727. RETURN constant
  12728. END BuildConstant;
  12729. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12730. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12731. BEGIN
  12732. variable := scope.firstVariable;
  12733. WHILE variable # NIL DO
  12734. IF variable.NeedsTrace() THEN
  12735. RETURN TRUE;
  12736. END;
  12737. variable := variable.nextVariable;
  12738. END;
  12739. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12740. WHILE parameter # NIL DO
  12741. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12742. RETURN TRUE;
  12743. END;
  12744. parameter := parameter.nextParameter;
  12745. END;
  12746. RETURN FALSE;
  12747. END HasPointers;
  12748. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12749. 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));
  12750. END IsVariableParameter;
  12751. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12752. VAR parameter: SyntaxTree.Parameter;
  12753. BEGIN
  12754. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12755. WHILE parameter # NIL DO
  12756. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12757. IF parameter.movable THEN RETURN TRUE END;
  12758. parameter := parameter.nextParameter;
  12759. END;
  12760. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12761. END HasVariableParameters;
  12762. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12763. BEGIN
  12764. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12765. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12766. END HasExplicitTraceMethod;
  12767. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12768. BEGIN
  12769. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12770. IF (expression IS SyntaxTree.IntegerValue) THEN
  12771. val := expression(SyntaxTree.IntegerValue).value;
  12772. RETURN TRUE
  12773. ELSE
  12774. RETURN FALSE
  12775. END;
  12776. END IsIntegerConstant;
  12777. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12778. BEGIN
  12779. IF val <= 0 THEN RETURN FALSE END;
  12780. exp := 0;
  12781. WHILE ~ODD(val) DO
  12782. val := val DIV 2;
  12783. INC(exp)
  12784. END;
  12785. RETURN val = 1
  12786. END PowerOf2;
  12787. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12788. VAR procedure: SyntaxTree.Procedure;
  12789. BEGIN
  12790. procedure := record.recordScope.constructor;
  12791. IF procedure = NIL THEN
  12792. record := record.GetBaseRecord();
  12793. IF record # NIL THEN
  12794. procedure := GetConstructor(record)
  12795. END;
  12796. END;
  12797. RETURN procedure;
  12798. END GetConstructor;
  12799. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12800. BEGIN
  12801. value := SHORT(op.intValue);
  12802. RETURN op.mode = IntermediateCode.ModeImmediate;
  12803. END IsIntegerImmediate;
  12804. (** whether a type strictily is a pointer to record or object type
  12805. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12806. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12807. BEGIN
  12808. IF type = NIL THEN
  12809. RETURN FALSE
  12810. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12811. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12812. ELSE
  12813. RETURN FALSE
  12814. END
  12815. END IsStrictlyPointerToRecord;
  12816. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12817. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12818. END IsUnsafePointer;
  12819. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12820. BEGIN type := type.resolved;
  12821. IF type IS SyntaxTree.PointerType THEN
  12822. type := type(SyntaxTree.PointerType).pointerBase;
  12823. type := type.resolved;
  12824. IF type IS SyntaxTree.RecordType THEN
  12825. recordType := type(SyntaxTree.RecordType);
  12826. RETURN TRUE
  12827. ELSE
  12828. RETURN FALSE
  12829. END
  12830. ELSIF type IS SyntaxTree.RecordType THEN
  12831. recordType := type(SyntaxTree.RecordType);
  12832. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12833. ELSIF type IS SyntaxTree.ObjectType THEN
  12834. RETURN TRUE
  12835. ELSIF type IS SyntaxTree.AnyType THEN
  12836. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12837. ELSE
  12838. RETURN FALSE
  12839. END;
  12840. END IsPointerToRecord;
  12841. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12842. BEGIN
  12843. type := type.resolved;
  12844. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12845. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12846. END IsArrayOfSystemByte;
  12847. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12848. BEGIN
  12849. IF type = NIL THEN RETURN FALSE END;
  12850. type := type.resolved;
  12851. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12852. END IsOpenArray;
  12853. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12854. BEGIN
  12855. IF type = NIL THEN RETURN FALSE END;
  12856. type := type.resolved;
  12857. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12858. END IsSemiDynamicArray;
  12859. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12860. BEGIN
  12861. IF type = NIL THEN RETURN FALSE END;
  12862. type := type.resolved;
  12863. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12864. END IsStaticArray;
  12865. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  12866. BEGIN
  12867. IF type = NIL THEN RETURN FALSE END;
  12868. type := type.resolved;
  12869. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  12870. END IsStaticMathArray;
  12871. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12872. BEGIN
  12873. WHILE (IsStaticMathArray(type)) DO
  12874. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12875. END;
  12876. RETURN type;
  12877. END StaticMathArrayBaseType;
  12878. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12879. VAR size: LONGINT;
  12880. BEGIN
  12881. size := 1;
  12882. WHILE (IsStaticArray(type)) DO
  12883. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12884. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12885. END;
  12886. RETURN size;
  12887. END StaticArrayNumElements;
  12888. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12889. VAR size: LONGINT;
  12890. BEGIN
  12891. size := 1;
  12892. WHILE (IsStaticMathArray(type)) DO
  12893. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  12894. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12895. END;
  12896. RETURN size;
  12897. END StaticMathArrayNumElements;
  12898. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12899. BEGIN
  12900. WHILE (IsStaticArray(type)) DO
  12901. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12902. END;
  12903. RETURN type;
  12904. END StaticArrayBaseType;
  12905. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12906. BEGIN
  12907. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12908. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12909. END;
  12910. RETURN type;
  12911. END ArrayBaseType;
  12912. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12913. BEGIN
  12914. IF type = NIL THEN RETURN FALSE END;
  12915. type := type.resolved;
  12916. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12917. END IsDelegate;
  12918. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12919. VAR i: LONGINT;
  12920. BEGIN
  12921. i := 0; type := type.resolved;
  12922. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12923. INC(i);
  12924. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12925. END;
  12926. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12927. INC(i);
  12928. type := type(SyntaxTree.MathArrayType).arrayBase;
  12929. IF type # NIL THEN type := type.resolved END;
  12930. END;
  12931. RETURN i
  12932. END DynamicDim;
  12933. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12934. BEGIN
  12935. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12936. type := type(SyntaxTree.ArrayType).arrayBase;
  12937. END;
  12938. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12939. type := type(SyntaxTree.MathArrayType).arrayBase;
  12940. END;
  12941. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12942. END StaticSize;
  12943. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12944. BEGIN
  12945. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12946. END IsImmediate;
  12947. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12948. BEGIN
  12949. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12950. END IsAddress;
  12951. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12952. BEGIN
  12953. RETURN (x.mode = IntermediateCode.ModeRegister);
  12954. END IsRegister;
  12955. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12956. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12957. BEGIN
  12958. typeDeclaration := recordType.typeDeclaration;
  12959. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12960. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12961. END GetRecordTypeName;
  12962. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12963. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12964. BEGIN
  12965. parSize := 0;
  12966. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  12967. parameter := procedureType.returnParameter;
  12968. INC(parSize,system.SizeOfParameter(parameter));
  12969. parSize := parSize + (-parSize) MOD system.addressSize;
  12970. END;
  12971. parameter :=procedureType.lastParameter;
  12972. WHILE (parameter # NIL) DO
  12973. INC(parSize,system.SizeOfParameter(parameter));
  12974. parSize := parSize + (-parSize) MOD system.addressSize;
  12975. parameter := parameter.prevParameter;
  12976. END;
  12977. IF procedureType.selfParameter # NIL THEN
  12978. parameter := procedureType.selfParameter;
  12979. INC(parSize,system.SizeOfParameter(parameter));
  12980. parSize := parSize + (-parSize) MOD system.addressSize;
  12981. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  12982. END; (* method => self pointer *)
  12983. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12984. RETURN ToMemoryUnits(system,parSize)
  12985. END ParametersSize;
  12986. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12987. BEGIN
  12988. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12989. END IsNested;
  12990. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12991. BEGIN
  12992. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12993. scope := scope.outerScope;
  12994. END;
  12995. RETURN scope # NIL;
  12996. END InCellScope;
  12997. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12998. BEGIN
  12999. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  13000. RETURN 0
  13001. ELSE
  13002. *)
  13003. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  13004. (*END;*)
  13005. END ProcedureParametersSize;
  13006. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  13007. VAR dataUnit: LONGINT;
  13008. BEGIN dataUnit := system.dataUnit;
  13009. ASSERT(size MOD system.dataUnit = 0);
  13010. RETURN size DIV system.dataUnit
  13011. END ToMemoryUnits;
  13012. PROCEDURE Get*(): Backend.Backend;
  13013. VAR backend: IntermediateBackend;
  13014. BEGIN NEW(backend); RETURN backend
  13015. END Get;
  13016. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13017. VAR instruction: IntermediateCode.Instruction;
  13018. BEGIN
  13019. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13020. RETURN instruction
  13021. END Nop;
  13022. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13023. VAR instruction: IntermediateCode.Instruction;
  13024. BEGIN
  13025. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13026. RETURN instruction
  13027. END Mov;
  13028. (* like Mov but ensures that no new register will be allocated for dest *)
  13029. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13030. VAR instruction: IntermediateCode.Instruction;
  13031. BEGIN
  13032. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13033. RETURN instruction
  13034. END MovReplace;
  13035. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13036. VAR instruction: IntermediateCode.Instruction;
  13037. BEGIN
  13038. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13039. RETURN instruction
  13040. END Conv;
  13041. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  13042. BEGIN
  13043. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  13044. END SysvABI;
  13045. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  13046. BEGIN
  13047. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  13048. END SysvABIorWINAPI;
  13049. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13050. VAR instruction: IntermediateCode.Instruction;
  13051. BEGIN
  13052. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13053. RETURN instruction
  13054. END Call;
  13055. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13056. VAR op1, op2, op3: IntermediateCode.Operand;
  13057. VAR instruction: IntermediateCode.Instruction;
  13058. BEGIN
  13059. IntermediateCode.InitNumber(op1,pcOffset);
  13060. IntermediateCode.InitNumber(op2,callingConvention);
  13061. IntermediateCode.InitNumber(op3,unwind);
  13062. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13063. RETURN instruction
  13064. END Exit;
  13065. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13066. VAR instruction: IntermediateCode.Instruction;
  13067. BEGIN
  13068. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13069. RETURN instruction
  13070. END Return;
  13071. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13072. VAR instruction: IntermediateCode.Instruction;
  13073. BEGIN
  13074. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13075. RETURN instruction
  13076. END Result;
  13077. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13078. VAR op1: IntermediateCode.Operand;
  13079. VAR instruction: IntermediateCode.Instruction;
  13080. BEGIN
  13081. IntermediateCode.InitNumber(op1,nr);
  13082. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13083. RETURN instruction
  13084. END Trap;
  13085. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13086. VAR instruction: IntermediateCode.Instruction;
  13087. BEGIN
  13088. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13089. RETURN instruction
  13090. END Br;
  13091. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13092. VAR instruction: IntermediateCode.Instruction;
  13093. BEGIN
  13094. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13095. RETURN instruction
  13096. END Breq;
  13097. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13098. VAR instruction: IntermediateCode.Instruction;
  13099. BEGIN
  13100. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13101. RETURN instruction
  13102. END Brne;
  13103. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13104. VAR instruction: IntermediateCode.Instruction;
  13105. BEGIN
  13106. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13107. RETURN instruction
  13108. END Brge;
  13109. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13110. VAR instruction: IntermediateCode.Instruction;
  13111. BEGIN
  13112. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13113. RETURN instruction
  13114. END Brlt;
  13115. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13116. VAR instruction: IntermediateCode.Instruction;
  13117. BEGIN
  13118. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13119. RETURN instruction
  13120. END Pop;
  13121. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13122. VAR instruction: IntermediateCode.Instruction;
  13123. BEGIN
  13124. ASSERT(op.mode # IntermediateCode.Undefined);
  13125. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13126. RETURN instruction
  13127. END Push;
  13128. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13129. VAR instruction: IntermediateCode.Instruction;
  13130. BEGIN
  13131. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13132. RETURN instruction
  13133. END Neg;
  13134. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13135. VAR instruction: IntermediateCode.Instruction;
  13136. BEGIN
  13137. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13138. RETURN instruction
  13139. END Not;
  13140. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13141. VAR instruction: IntermediateCode.Instruction;
  13142. BEGIN
  13143. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13144. RETURN instruction
  13145. END Abs;
  13146. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13147. VAR instruction: IntermediateCode.Instruction;
  13148. BEGIN
  13149. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13150. ASSERT(~IsImmediate(instruction.op1));
  13151. RETURN instruction
  13152. END Mul;
  13153. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13154. VAR instruction: IntermediateCode.Instruction;
  13155. BEGIN
  13156. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13157. RETURN instruction
  13158. END Div;
  13159. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13160. VAR instruction: IntermediateCode.Instruction;
  13161. BEGIN
  13162. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13163. RETURN instruction
  13164. END Mod;
  13165. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13166. VAR instruction: IntermediateCode.Instruction;
  13167. BEGIN
  13168. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13169. RETURN instruction
  13170. END Sub;
  13171. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13172. VAR instruction: IntermediateCode.Instruction;
  13173. BEGIN
  13174. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13175. RETURN instruction
  13176. END Add;
  13177. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13178. VAR instruction: IntermediateCode.Instruction;
  13179. BEGIN
  13180. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13181. RETURN instruction
  13182. END And;
  13183. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13184. VAR instruction: IntermediateCode.Instruction;
  13185. BEGIN
  13186. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13187. RETURN instruction
  13188. END Or;
  13189. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13190. VAR instruction: IntermediateCode.Instruction;
  13191. BEGIN
  13192. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13193. RETURN instruction
  13194. END Xor;
  13195. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13196. VAR instruction: IntermediateCode.Instruction;
  13197. BEGIN
  13198. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13199. RETURN instruction
  13200. END Shl;
  13201. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13202. VAR instruction: IntermediateCode.Instruction;
  13203. BEGIN
  13204. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13205. RETURN instruction
  13206. END Shr;
  13207. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13208. VAR instruction: IntermediateCode.Instruction;
  13209. BEGIN
  13210. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13211. RETURN instruction
  13212. END Rol;
  13213. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13214. VAR instruction: IntermediateCode.Instruction;
  13215. BEGIN
  13216. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13217. RETURN instruction
  13218. END Ror;
  13219. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13220. VAR instruction: IntermediateCode.Instruction;
  13221. BEGIN
  13222. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13223. RETURN instruction
  13224. END Cas;
  13225. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13226. VAR instruction: IntermediateCode.Instruction;
  13227. BEGIN
  13228. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13229. RETURN instruction
  13230. END Copy;
  13231. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13232. VAR instruction: IntermediateCode.Instruction;
  13233. BEGIN
  13234. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13235. RETURN instruction
  13236. END Fill;
  13237. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13238. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13239. BEGIN
  13240. string := IntermediateCode.String(s);
  13241. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13242. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13243. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13244. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13245. RETURN instruction
  13246. END Asm;
  13247. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13248. VAR instruction: IntermediateCode.Instruction;
  13249. BEGIN
  13250. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13251. RETURN instruction
  13252. END Data;
  13253. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13254. VAR instruction: IntermediateCode.Instruction;
  13255. BEGIN
  13256. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13257. IntermediateCode.SetSubType(instruction, subtype);
  13258. RETURN instruction
  13259. END SpecialInstruction;
  13260. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13261. VAR op1: IntermediateCode.Operand;
  13262. VAR instruction: IntermediateCode.Instruction;
  13263. BEGIN
  13264. (*! generate a warning if size exceeds a certain limit *)
  13265. (*
  13266. ASSERT(bytes < 1000000); (* sanity check *)
  13267. *)
  13268. ASSERT(0 <= units); (* sanity check *)
  13269. IntermediateCode.InitNumber(op1,units);
  13270. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13271. RETURN instruction
  13272. END Reserve;
  13273. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13274. VAR op1: IntermediateCode.Operand;
  13275. VAR instruction: IntermediateCode.Instruction;
  13276. BEGIN
  13277. IntermediateCode.InitNumber(op1,position.start);
  13278. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13279. RETURN instruction
  13280. END LabelInstruction;
  13281. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13282. VAR pc: LONGINT;
  13283. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13284. BEGIN
  13285. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13286. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13287. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13288. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13289. IF instr.op1.type.form = IntermediateCode.Float THEN
  13290. RETURN instr.op1.floatValue = op.floatValue
  13291. ELSE
  13292. RETURN instr.op1.intValue = op.intValue
  13293. END;
  13294. END ProvidesValue;
  13295. BEGIN
  13296. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13297. pc := 0;
  13298. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13299. INC(pc);
  13300. END;
  13301. IF pc = data.pc THEN
  13302. data.Emit(Data(Basic.invalidPosition,vop));
  13303. END;
  13304. RETURN pc
  13305. END EnterImmediate;
  13306. PROCEDURE Init;
  13307. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13308. BEGIN
  13309. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13310. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13311. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13312. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13313. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13314. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13315. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13316. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13317. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13318. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13319. IntermediateCode.InitOperand(emptyOperand);
  13320. FOR i := 0 TO NumberSystemCalls-1 DO
  13321. name := "@SystemCall";
  13322. Basic.AppendNumber(name,i);
  13323. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13324. END;
  13325. END Init;
  13326. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13327. BEGIN
  13328. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  13329. END IsExported;
  13330. BEGIN
  13331. Init;
  13332. END FoxIntermediateBackend.
  13333. Compiler.Compile -p=Win32G FoxIntermediateBackend.Mod ~
  13334. # Release.Build --path="/temp/obg/" WinAosNewObjectFile ~
  13335. # 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 ~
  13336. # Release.Build --path="/temp/obg/" WinAosNewObjectFile ~
  13337. # 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 ~
  13338. FSTools.CloseFiles A2Z.exe ~
  13339. SystemTools.FreeDownTo FoxIntermediateBackend ~
  13340. Compiler.Compile -p=Win32G --destPath=/temp/obg/ --traceModule=Trace
  13341. Runtime.Mod Trace.Mod Generic.Win32.Kernel32.Mod Win32.Machine.Mod Heaps.Mod
  13342. Generic.Modules.Mod Win32.Objects.Mod Win32.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13343. Commands.Mod I386.Reals.Mod Generic.Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13344. Win32.Traps.Mod Locks.Mod Win32.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13345. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13346. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Win32.User32.Mod
  13347. Win32.WinTrace.Mod Win32.ODBC.Mod Win32.Shell32.Mod Win32.SQL.Mod Win32.WinFS.Mod
  13348. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13349. GenericLinker.Mod GenericLoader.Mod BootConsole.Mod