FoxIntermediateBackend.Mod 580 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067140681406914070140711407214073140741407514076140771407814079140801408114082140831408414085140861408714088140891409014091140921409314094140951409614097140981409914100141011410214103141041410514106141071410814109141101411114112141131411414115141161411714118141191412014121141221412314124141251412614127141281412914130141311413214133141341413514136141371413814139141401414114142141431414414145141461414714148141491415014151141521415314154141551415614157141581415914160141611416214163141641416514166141671416814169141701417114172141731417414175141761417714178141791418014181141821418314184141851418614187141881418914190141911419214193141941419514196141971419814199142001420114202142031420414205142061420714208142091421014211142121421314214142151421614217142181421914220142211422214223142241422514226142271422814229142301423114232142331423414235142361423714238142391424014241142421424314244142451424614247142481424914250142511425214253142541425514256142571425814259142601426114262142631426414265142661426714268142691427014271142721427314274142751427614277142781427914280142811428214283142841428514286142871428814289142901429114292142931429414295142961429714298142991430014301143021430314304143051430614307143081430914310143111431214313143141431514316143171431814319143201432114322143231432414325143261432714328143291433014331143321433314334143351433614337143381433914340143411434214343143441434514346143471434814349143501435114352143531435414355143561435714358143591436014361143621436314364143651436614367143681436914370143711437214373143741437514376143771437814379143801438114382143831438414385143861438714388143891439014391143921439314394143951439614397143981439914400144011440214403144041440514406144071440814409144101441114412144131441414415144161441714418144191442014421144221442314424144251442614427144281442914430144311443214433144341443514436144371443814439144401444114442144431444414445144461444714448144491445014451144521445314454144551445614457144581445914460144611446214463144641446514466144671446814469144701447114472144731447414475144761447714478144791448014481144821448314484144851448614487144881448914490144911449214493144941449514496144971449814499145001450114502145031450414505145061450714508145091451014511145121451314514145151451614517145181451914520145211452214523145241452514526145271452814529145301453114532145331453414535145361453714538145391454014541145421454314544145451454614547145481454914550145511455214553145541455514556145571455814559145601456114562145631456414565145661456714568145691457014571145721457314574145751457614577145781457914580145811458214583145841458514586145871458814589145901459114592145931459414595145961459714598145991460014601146021460314604146051460614607146081460914610146111461214613146141461514616146171461814619146201462114622146231462414625146261462714628146291463014631146321463314634146351463614637146381463914640146411464214643146441464514646146471464814649146501465114652146531465414655146561465714658146591466014661146621466314664146651466614667146681466914670146711467214673146741467514676146771467814679146801468114682146831468414685146861468714688146891469014691146921469314694146951469614697146981469914700147011470214703147041470514706147071470814709147101471114712147131471414715147161471714718147191472014721147221472314724147251472614727147281472914730147311473214733147341473514736147371473814739147401474114742147431474414745147461474714748147491475014751147521475314754147551475614757147581475914760147611476214763147641476514766147671476814769147701477114772147731477414775147761477714778147791478014781147821478314784147851478614787147881478914790147911479214793147941479514796147971479814799148001480114802148031480414805148061480714808148091481014811148121481314814148151481614817148181481914820148211482214823148241482514826148271482814829148301483114832148331483414835148361483714838148391484014841
  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, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool, CRC;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. RethrowTrap* = 18; (* rethrow exception after unlock *)
  42. Trace = FALSE;
  43. TraceRegisterUsageCount=TRUE;
  44. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  45. (** system call numbers *)
  46. NumberSystemCalls* = 12;
  47. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  48. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  49. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  50. DefaultBuiltinsModuleName ="Builtins";
  51. DefaultTraceModuleName ="KernelLog";
  52. ChannelModuleName = "Channels";
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. EntryPriority=-4;
  59. FirstPriority=-3;
  60. InitPriority=-2;
  61. ExitPriority=-1;
  62. BasePointerTypeSize = 5;
  63. BaseArrayTypeSize = BasePointerTypeSize + 3;
  64. LengthOffset = BasePointerTypeSize + 0;
  65. DataOffset = BasePointerTypeSize + 1;
  66. DescriptorOffset = BasePointerTypeSize + 2;
  67. BaseRecordTypeSize = BasePointerTypeSize + 2;
  68. ActionOffset = BasePointerTypeSize + 0;
  69. MonitorOffset = BasePointerTypeSize + 1;
  70. BaseObjectTypeSize = BaseRecordTypeSize;
  71. ActionTypeSize = 3;
  72. MonitorTypeSize = 7;
  73. ProcessorOffset = BaseObjectTypeSize + 1;
  74. StackLimitOffset* = BaseObjectTypeSize + 3;
  75. QuantumOffset = BaseObjectTypeSize + 4;
  76. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  77. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  78. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  79. Size2Flag = 4; (* size = 2 *)
  80. Size3Flag = 5; (* size = 3 *)
  81. Size4Flag = 6; (* size = 4 *)
  82. Size5Flag = 7; (* size = 5 *)
  83. Size6Flag = 8; (* size = 6 *)
  84. Size7Flag = 9; (* size = 7 *)
  85. Size8Flag = 10; (* size = 8 *)
  86. ReflectionSupport = TRUE;
  87. (* Solution for identifying procedure descriptors on the stack and for being able to differentiate "old school" stack frames from the underlying operating system stack frames:
  88. push a procedure desriptor plus one to where the BP pointer would be located. The misalignment of the procedure descriptor makes it possible to identify that it is not
  89. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  90. *)
  91. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  92. ProtectModulesPointers = FALSE;
  93. CreateProcedureDescInfo = TRUE;
  94. WarningDynamicLoading = FALSE;
  95. SysvABI = {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention};
  96. SysvABIorWINAPI = {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention};
  97. TYPE
  98. Position=SyntaxTree.Position;
  99. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  100. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  101. Operand = RECORD
  102. mode: SHORTINT;
  103. op: IntermediateCode.Operand;
  104. tag: IntermediateCode.Operand;
  105. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  106. dimOffset: LONGINT;
  107. END;
  108. Fixup= POINTER TO RECORD
  109. pc: LONGINT;
  110. nextFixup: Fixup;
  111. END;
  112. WriteBackCall = POINTER TO RECORD
  113. call: SyntaxTree.ProcedureCallDesignator;
  114. next: WriteBackCall;
  115. END;
  116. Label= OBJECT
  117. VAR
  118. fixups: Fixup;
  119. section: IntermediateCode.Section;
  120. pc: LONGINT;
  121. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  122. BEGIN
  123. SELF.section := section; pc := -1;
  124. END InitLabel;
  125. PROCEDURE Resolve(pc: LONGINT);
  126. VAR at: LONGINT;
  127. BEGIN
  128. SELF.pc := pc;
  129. WHILE(fixups # NIL) DO
  130. at := fixups.pc;
  131. section.PatchAddress(at,pc);
  132. fixups := fixups.nextFixup;
  133. END;
  134. END Resolve;
  135. PROCEDURE AddFixup(at: LONGINT);
  136. VAR fixup: Fixup;
  137. BEGIN
  138. ASSERT(pc=-1);
  139. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  140. END AddFixup;
  141. END Label;
  142. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  143. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  144. VAR
  145. backend: IntermediateBackend;
  146. implementationVisitor: ImplementationVisitor;
  147. meta: MetaDataGenerator;
  148. system: Global.System;
  149. currentScope: SyntaxTree.Scope;
  150. module: Sections.Module;
  151. moduleSelf: SyntaxTree.Variable;
  152. dump: BOOLEAN;
  153. forceModuleBody: BOOLEAN;
  154. addressType: IntermediateCode.Type;
  155. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  156. BEGIN
  157. currentScope := NIL; module := NIL; moduleSelf := NIL;
  158. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  159. SELF.dump := dump;
  160. SELF.backend := backend;
  161. SELF.forceModuleBody := forceModuleBody;
  162. addressType := IntermediateCode.GetType(system,system.addressType)
  163. END Init;
  164. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  165. BEGIN
  166. backend.Error(module.module.sourceName, position, Streams.Invalid, s);
  167. END Error;
  168. PROCEDURE Type(x: SyntaxTree.Type);
  169. BEGIN
  170. x.Accept(SELF);
  171. END Type;
  172. (** types **)
  173. PROCEDURE VisitBasicType*(x: SyntaxTree.BasicType);
  174. BEGIN (* no code emission *) END VisitBasicType;
  175. PROCEDURE VisitCharacterType*(x: SyntaxTree.CharacterType);
  176. BEGIN (* no code emission *) END VisitCharacterType;
  177. PROCEDURE VisitIntegerType*(x: SyntaxTree.IntegerType);
  178. BEGIN (* no code emission *) END VisitIntegerType;
  179. PROCEDURE VisitFloatType*(x: SyntaxTree.FloatType);
  180. BEGIN (* no code emission *) END VisitFloatType;
  181. PROCEDURE VisitComplexType*(x: SyntaxTree.ComplexType);
  182. BEGIN (* no code emission *) END VisitComplexType;
  183. PROCEDURE VisitQualifiedType*(x: SyntaxTree.QualifiedType);
  184. VAR type: SyntaxTree.Type;
  185. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  186. type := x.resolved;
  187. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  188. meta.CheckTypeDeclaration(type);
  189. END;
  190. END VisitQualifiedType;
  191. PROCEDURE VisitStringType*(x: SyntaxTree.StringType);
  192. BEGIN (* no code emission *) END VisitStringType;
  193. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  194. BEGIN (* no code emission *)
  195. END VisitArrayRangeType;
  196. PROCEDURE VisitArrayType*(x: SyntaxTree.ArrayType);
  197. BEGIN (* no code emission *) END VisitArrayType;
  198. PROCEDURE VisitPortType*(x: SyntaxTree.PortType);
  199. BEGIN (* no code emission *) END VisitPortType;
  200. PROCEDURE VisitMathArrayType*(x: SyntaxTree.MathArrayType);
  201. BEGIN
  202. meta.CheckTypeDeclaration(x);
  203. END VisitMathArrayType;
  204. PROCEDURE VisitPointerType*(x: SyntaxTree.PointerType);
  205. BEGIN
  206. meta.CheckTypeDeclaration(x);
  207. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  208. END VisitPointerType;
  209. PROCEDURE VisitRecordType*(x: SyntaxTree.RecordType);
  210. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  211. BEGIN (* no code emission *)
  212. meta.CheckTypeDeclaration(x);
  213. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  214. IF x.pointerType.typeDeclaration # NIL THEN
  215. td := x.pointerType.typeDeclaration
  216. ELSE
  217. td := x.typeDeclaration
  218. END;
  219. Global.GetSymbolName(td,name);
  220. (* code section for object *)
  221. END;
  222. Scope(x.recordScope);
  223. END VisitRecordType;
  224. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  225. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  226. BEGIN
  227. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  228. WHILE (this # NIL) & (this.identifier# id) DO
  229. this := this.nextModifier;
  230. END;
  231. RETURN this # NIL
  232. END HasFlag;
  233. PROCEDURE VisitCellType*(x: SyntaxTree.CellType);
  234. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  235. BEGIN
  236. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  237. capabilities := {};
  238. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  239. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  240. backend.SetCapabilities(capabilities);
  241. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  242. Scope(x.cellScope);
  243. END;
  244. END VisitCellType;
  245. PROCEDURE VisitProcedureType*(x: SyntaxTree.ProcedureType);
  246. BEGIN (* no code emission *) END VisitProcedureType;
  247. PROCEDURE VisitEnumerationType*(x: SyntaxTree.EnumerationType);
  248. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  249. END VisitEnumerationType;
  250. (* symbols *)
  251. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  252. BEGIN
  253. Procedure(x);
  254. END VisitProcedure;
  255. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  256. BEGIN
  257. Procedure(x);
  258. END VisitOperator;
  259. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  260. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  261. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  262. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  263. BEGIN
  264. type := type.resolved;
  265. IF type IS SyntaxTree.RecordType THEN
  266. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  267. ELSIF (type IS SyntaxTree.ArrayType) THEN
  268. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  269. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  270. END;
  271. ELSIF type IS SyntaxTree.MathArrayType THEN
  272. WITH type: SyntaxTree.MathArrayType DO
  273. IF type.form = SyntaxTree.Open THEN
  274. RETURN TRUE
  275. ELSIF type.form = SyntaxTree.Static THEN
  276. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  277. END;
  278. END;
  279. END;
  280. RETURN FALSE
  281. END TypeNeedsInitialization;
  282. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  283. VAR variable: SyntaxTree.Variable;
  284. BEGIN
  285. variable := scope.firstVariable;
  286. WHILE variable # NIL DO
  287. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  288. IF variable.initializer # NIL THEN RETURN TRUE END;
  289. variable := variable.nextVariable;
  290. END;
  291. RETURN FALSE
  292. END ScopeNeedsInitialization;
  293. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  294. VAR size: LONGINT;
  295. BEGIN
  296. size := offset - lastUpdated;
  297. IF size > 0 THEN
  298. irv.Emit(Reserve(x.position,size));
  299. END;
  300. irv.Emit(Data(x.position, op));
  301. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  302. END SingleInitialize;
  303. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  304. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  305. BEGIN
  306. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  307. WITH type: SyntaxTree.RecordType DO
  308. baseType := type.baseType;
  309. IF baseType # NIL THEN
  310. baseType := baseType.resolved;
  311. IF baseType IS SyntaxTree.PointerType THEN
  312. baseType := baseType(SyntaxTree.PointerType).pointerBase
  313. END;
  314. Initialize(baseType,NIL, offset);
  315. END;
  316. variable := type.recordScope.firstVariable;
  317. WHILE variable # NIL DO
  318. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  319. variable := variable.nextVariable
  320. END;
  321. | type: SyntaxTree.ArrayType DO
  322. IF type.form = SyntaxTree.Static THEN
  323. baseType := type.arrayBase;
  324. IF TypeNeedsInitialization(baseType) THEN
  325. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  326. FOR i := 0 TO type.staticLength-1 DO
  327. Initialize(baseType,NIL,offset+i*size);
  328. END;
  329. END;
  330. END;
  331. | type: SyntaxTree.MathArrayType DO
  332. IF type.form = SyntaxTree.Open THEN
  333. dim := DynamicDim(type);
  334. baseType := SemanticChecker.ArrayBase(type,dim);
  335. imm := IntermediateCode.Immediate(addressType,dim);
  336. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  337. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  338. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  339. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  340. (* flags remain empty (=0) for open array *)
  341. ELSIF type.form = SyntaxTree.Static THEN
  342. baseType := type.arrayBase;
  343. IF TypeNeedsInitialization(baseType) THEN
  344. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  345. ASSERT(type.staticLength < 1024*1024*1024);
  346. FOR i := 0 TO type.staticLength-1 DO
  347. Initialize(baseType,NIL,offset+i*size);
  348. END;
  349. END;
  350. END;
  351. ELSE
  352. IF initializer # NIL THEN
  353. implementationVisitor.Evaluate(initializer, op);
  354. SingleInitialize(op.op, offset);
  355. END;
  356. END;
  357. END Initialize;
  358. BEGIN
  359. IF x.externalName # NIL THEN RETURN END;
  360. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  361. (* code section for variable *)
  362. Global.GetSymbolSegmentedName(x,name);
  363. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  364. irv.SetExported(IsExported(x));
  365. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  366. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  367. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  368. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  369. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  370. FOR i := 0 TO DynamicDim(x.type)-1 DO
  371. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  372. END;
  373. ELSE
  374. lastUpdated:= 0;
  375. IF ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  376. Initialize(x.type, x.initializer, 0);
  377. END;
  378. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  379. IF size > 0 THEN
  380. irv.Emit(Reserve(x.position,size));
  381. END;
  382. IF ~x.fixed THEN
  383. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  384. ELSE
  385. align := x.alignment;
  386. END;
  387. irv.SetPositionOrAlignment(x.fixed, align);
  388. meta.CheckTypeDeclaration(x.type);
  389. END;
  390. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  391. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  392. END;
  393. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  394. END VisitVariable;
  395. PROCEDURE VisitProperty*(x: SyntaxTree.Property);
  396. BEGIN
  397. VisitVariable(x)
  398. END VisitProperty;
  399. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  400. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  401. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  402. BEGIN
  403. ASSERT(currentScope IS SyntaxTree.CellScope);
  404. Global.GetSymbolSegmentedName(x,name);
  405. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  406. irv.SetExported(IsExported(x));
  407. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  408. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  409. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  410. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  411. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  412. FOR i := 0 TO DynamicDim(x.type)-1 DO
  413. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  414. END;
  415. ELSE
  416. lastUpdated:= 0;
  417. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  418. IF size > 0 THEN
  419. irv.Emit(Reserve(x.position,size));
  420. END;
  421. IF ~x.fixed THEN
  422. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  423. ELSE
  424. align := x.alignment;
  425. END;
  426. irv.SetPositionOrAlignment(x.fixed, align);
  427. meta.CheckTypeDeclaration(x.type);
  428. END;
  429. END VisitParameter;
  430. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  431. BEGIN
  432. Type(x.declaredType); (* => code in objects *)
  433. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  434. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  435. END;
  436. END VisitTypeDeclaration;
  437. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  438. BEGIN
  439. IF (SyntaxTree.Public * x.access # {}) THEN
  440. implementationVisitor.VisitConstant(x);
  441. END;
  442. END VisitConstant;
  443. PROCEDURE Scope(x: SyntaxTree.Scope);
  444. VAR procedure: SyntaxTree.Procedure;
  445. constant: SyntaxTree.Constant;
  446. variable: SyntaxTree.Variable;
  447. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  448. cell: SyntaxTree.CellType;
  449. parameter: SyntaxTree.Parameter;
  450. property: SyntaxTree.Property;
  451. BEGIN
  452. prevScope := currentScope;
  453. currentScope := x;
  454. (* constants treated in implementation visitor *)
  455. WITH x: SyntaxTree.CellScope DO
  456. cell := x.ownerCell;
  457. parameter := cell.firstParameter;
  458. WHILE parameter # NIL DO
  459. VisitParameter(parameter);
  460. parameter := parameter.nextParameter;
  461. END;
  462. property := cell.firstProperty;
  463. WHILE property # NIL DO
  464. VisitProperty(property);
  465. property := property.nextProperty;
  466. END;
  467. ELSE
  468. END;
  469. typeDeclaration := x.firstTypeDeclaration;
  470. WHILE typeDeclaration # NIL DO
  471. VisitTypeDeclaration(typeDeclaration);
  472. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  473. END;
  474. variable := x.firstVariable;
  475. WHILE variable # NIL DO
  476. VisitVariable(variable);
  477. variable := variable.nextVariable;
  478. END;
  479. procedure := x.firstProcedure;
  480. WHILE procedure # NIL DO
  481. VisitProcedure(procedure);
  482. procedure := procedure.nextProcedure;
  483. END;
  484. constant := x.firstConstant;
  485. WHILE constant # NIL DO
  486. VisitConstant(constant);
  487. constant := constant.nextConstant;
  488. END;
  489. currentScope := prevScope;
  490. END Scope;
  491. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  492. VAR parameter: SyntaxTree.Parameter;
  493. BEGIN
  494. parameter := first;
  495. WHILE parameter # NIL DO
  496. VisitParameter(parameter);
  497. parameter := parameter.nextParameter;
  498. END;
  499. END Parameters;
  500. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  501. VAR scope: SyntaxTree.ProcedureScope;
  502. prevScope: SyntaxTree.Scope;
  503. inline, finalizer: BOOLEAN;
  504. procedureType: SyntaxTree.ProcedureType;
  505. pc: LONGINT;
  506. memorySize: Basic.Integer; stackSize: LONGINT;
  507. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  508. null,size,src,dest,fp,res: IntermediateCode.Operand;
  509. callingConvention: LONGINT;
  510. cellType: SyntaxTree.CellType;
  511. registerNumber: LONGINT;
  512. registerParameters: SIZE;
  513. registerClass: IntermediateCode.RegisterClass;
  514. type: IntermediateCode.Type;
  515. formalParameter: SyntaxTree.Parameter;
  516. recordType: SyntaxTree.RecordType;
  517. isModuleBody: BOOLEAN;
  518. parametersSize: LONGINT;
  519. position: LONGINT;
  520. variable: SyntaxTree.Variable;
  521. PROCEDURE Signature;
  522. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  523. BEGIN
  524. procedureType := x.type(SyntaxTree.ProcedureType);
  525. returnType := procedureType.returnType;
  526. IF returnType # NIL THEN
  527. meta.CheckTypeDeclaration(returnType)
  528. END;
  529. parameter := procedureType.firstParameter;
  530. WHILE parameter # NIL DO
  531. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  532. parameter := parameter.nextParameter;
  533. END;
  534. END Signature;
  535. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: Basic.Integer): BOOLEAN;
  536. VAR result: BOOLEAN;
  537. BEGIN
  538. result := FALSE;
  539. IF x = SyntaxTree.invalidExpression THEN
  540. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  541. result := TRUE;
  542. value := x.resolved(SyntaxTree.IntegerValue).value;
  543. ELSE
  544. Error(x.position,"expression is not an integer constant");
  545. END;
  546. RETURN result;
  547. END CheckIntegerValue;
  548. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: Basic.Integer): BOOLEAN;
  549. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  550. BEGIN
  551. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  552. WHILE (this # NIL) & (this.identifier # id) DO
  553. this := this.nextModifier;
  554. END;
  555. IF this # NIL THEN
  556. IF this.expression = NIL THEN
  557. Error(this.position,"expected expression value");
  558. ELSIF CheckIntegerValue(this.expression,value) THEN
  559. END;
  560. RETURN TRUE
  561. ELSE RETURN FALSE
  562. END;
  563. END HasValue;
  564. CONST DefaultDataMemorySize=512;
  565. BEGIN
  566. IF x.externalName # NIL THEN RETURN END;
  567. (*
  568. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  569. *)
  570. (* code section for this procedure *)
  571. position := x.position.start;
  572. scope := x.procedureScope;
  573. prevScope := currentScope;
  574. currentScope := scope;
  575. procedureType := x.type(SyntaxTree.ProcedureType);
  576. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  577. implementationVisitor.temporaries.Clear;
  578. implementationVisitor.usedRegisters := NIL;
  579. implementationVisitor.registerUsageCount.Init;
  580. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  581. IF (scope.body # NIL) & (x.isInline) THEN
  582. inline := TRUE;
  583. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  584. ir.SetExported(IsExported(x));
  585. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  586. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  587. IF backend.cellsAreObjects THEN
  588. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  589. ir.SetExported(IsExported(x));
  590. ELSE
  591. RETURN; (* cellnet cannot be compiled for final static hardware *)
  592. END;
  593. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  594. inline := FALSE;
  595. AddBodyCallStub(x);
  596. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  597. ir.SetExported(IsExported(x));
  598. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  599. inline := FALSE;
  600. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  601. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,memorySize) THEN memorySize := DefaultDataMemorySize END;
  602. AddBodyCallStub(x);
  603. AddStackAllocation(x,memorySize);
  604. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  605. ir.SetExported(IsExported(x));
  606. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  607. inline := FALSE;
  608. Parameters(procedureType.firstParameter);
  609. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  610. ir.SetExported(IsExported(x));
  611. ELSE
  612. inline := FALSE;
  613. IF x.isEntry OR x.isExit THEN
  614. IF x.isEntry THEN
  615. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  616. ELSE
  617. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  618. END;
  619. ir.SetExported(TRUE);
  620. ELSE
  621. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  622. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  623. END;
  624. END;
  625. callingConvention := procedureType.callingConvention;
  626. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  627. parametersSize := ProcedureParametersSize(backend.system,x);
  628. ELSE
  629. parametersSize := 0;
  630. END;
  631. IF scope.body # NIL THEN
  632. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  633. registerNumber := 0;
  634. IF ~inline THEN
  635. IF scope.lastVariable = NIL THEN
  636. stackSize := 0
  637. ELSE
  638. stackSize := scope.lastVariable.offsetInBits;
  639. IF stackSize <0 THEN stackSize := -stackSize END;
  640. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  641. END;
  642. (*
  643. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  644. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  645. *)
  646. (*
  647. ir.Emit(Nop(position)); (* placeholder for fill *)
  648. *)
  649. IF (callingConvention # SyntaxTree.OberonCallingConvention) & (~(callingConvention IN SysvABI) OR (system.addressSize # 64)) THEN
  650. registerParameters := backend.NumberParameterRegisters(callingConvention);
  651. (* assumption: registers are passed left to right and left parameters are in registers *)
  652. formalParameter := procedureType.firstParameter;
  653. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  654. IF ~PassInRegister(formalParameter, callingConvention) THEN
  655. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  656. ELSE
  657. IF formalParameter.type.IsRecordType() THEN
  658. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  659. type := addressType;
  660. ELSE
  661. type := GetType(system, formalParameter.type);
  662. END;
  663. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention, type, registerNumber));
  664. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  665. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  666. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  667. implementationVisitor.ReleaseIntermediateOperand(src);
  668. INC(registerNumber);
  669. formalParameter := formalParameter.nextParameter;
  670. END;
  671. END;
  672. END;
  673. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  674. implementationVisitor.EmitEnter(ir,x.position,x,callingConvention,ToMemoryUnits(system,stackSize),registerNumber);
  675. END;
  676. pc := ir.pc-1;
  677. IF (callingConvention IN SysvABI) & (system.addressSize = 64) THEN
  678. registerParameters := backend.NumberParameterRegisters(callingConvention);
  679. (* assumption: registers are passed left to right and left parameters are in registers *)
  680. formalParameter := procedureType.firstParameter;
  681. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  682. IF ~PassInRegister(formalParameter, callingConvention) THEN
  683. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  684. ELSE
  685. IF formalParameter.type.IsRecordType() THEN
  686. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  687. type := addressType;
  688. ELSE
  689. type := GetType(system, formalParameter.type);
  690. END;
  691. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention, type, registerNumber));
  692. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  693. implementationVisitor.currentScope := currentScope;
  694. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  695. formalParameter.SetOffset(variable.offsetInBits);
  696. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  697. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  698. implementationVisitor.ReleaseIntermediateOperand(src);
  699. INC(registerNumber);
  700. formalParameter := formalParameter.nextParameter;
  701. END;
  702. END;
  703. END;
  704. END;
  705. implementationVisitor.tagsAvailable := callingConvention = SyntaxTree.OberonCallingConvention;
  706. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  707. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  708. IF scope.lastVariable # NIL THEN
  709. stackSize := scope.lastVariable.offsetInBits;
  710. IF stackSize <0 THEN stackSize := -stackSize END;
  711. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  712. END;
  713. END;
  714. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  715. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  716. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  717. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  718. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  719. ir.EmitAt(pc,Push(size));
  720. implementationVisitor.StaticCallOperand(result,procedure);
  721. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  722. END;
  723. *)
  724. END;
  725. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  726. IF stackSize > 0 THEN
  727. IF (stackSize MOD system.addressSize = 0) THEN
  728. null := IntermediateCode.Immediate(addressType,0);
  729. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  730. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  731. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  732. ELSE
  733. null := IntermediateCode.Immediate(int8,0);
  734. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  735. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  736. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  737. END;
  738. (*! should potentially be called by backend -- enter might initialize
  739. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  740. *)
  741. END;
  742. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  743. parametersSize := ProcedureParametersSize(backend.system,x);
  744. ELSE
  745. parametersSize := 0;
  746. END;
  747. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  748. finalizer := FALSE;
  749. IF backend.cooperative & x.isFinalizer THEN
  750. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  751. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  752. GetRecordTypeName(recordType,name);
  753. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  754. END;
  755. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  756. IF backend.cooperative THEN
  757. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  758. IF implementationVisitor.profile & ~isModuleBody THEN
  759. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  760. END;
  761. ELSE
  762. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  763. END;
  764. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  765. IF finalizer THEN
  766. IF backend.hasLinkRegister THEN
  767. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  768. END;
  769. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  770. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  771. ir.Emit(Br(x.position,dest));
  772. ELSE
  773. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  774. END;
  775. ELSE
  776. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  777. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  778. END;
  779. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  780. IF backend.cooperative THEN
  781. IF HasPointers (scope) THEN
  782. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  783. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  784. ir.Emit(Result(x.position, res));
  785. ir.Emit(Push(x.position, res));
  786. implementationVisitor.ResetVariables(scope);
  787. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  788. ir.Emit(Pop(x.position, res));
  789. ir.Emit(Return(x.position, res));
  790. ELSE
  791. implementationVisitor.ResetVariables(scope);
  792. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  793. END;
  794. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  795. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  796. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  797. ir.Emit(Result(x.position, res));
  798. ir.Emit(Push(x.position, res));
  799. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  800. ir.Emit(Pop(x.position, res));
  801. ir.Emit(Return(x.position, res));
  802. ELSE
  803. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  804. END;
  805. END;
  806. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  807. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  808. ELSE
  809. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  810. ir.Emit(Nop(x.position));
  811. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  812. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  813. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  814. END;
  815. END;
  816. END
  817. END;
  818. ELSE (* force body for procedures *)
  819. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0,0);
  820. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  821. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  822. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  823. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  824. END;
  825. Scope(scope);
  826. Signature;
  827. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  828. currentScope := prevScope;
  829. END Procedure;
  830. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  831. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  832. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  833. BEGIN
  834. ASSERT (bodyProcedure # NIL);
  835. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  836. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  837. procedure.SetScope(bodyProcedure.scope);
  838. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  839. procedure.SetAccess(SyntaxTree.Hidden);
  840. Global.GetSymbolSegmentedName (procedure,name);
  841. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  842. ir.SetExported(TRUE);
  843. Global.GetSymbolSegmentedName (bodyProcedure,name);
  844. IF ~meta.simple THEN
  845. implementationVisitor.currentScope := module.module.moduleScope;
  846. implementationVisitor.section := ir;
  847. implementationVisitor.PushSelfPointer();
  848. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  849. ELSIF backend.preregisterStatic THEN
  850. implementationVisitor.currentScope := module.module.moduleScope;
  851. implementationVisitor.section := ir;
  852. implementationVisitor.PushSelfPointer();
  853. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  854. ELSE
  855. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  856. ir.Emit(Call(bodyProcedure.position,op, 0));
  857. END;
  858. END AddBodyCallStub;
  859. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  860. VAR name: Basic.SegmentedName;
  861. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  862. BEGIN
  863. Global.GetSymbolSegmentedName (symbol,name);
  864. Basic.RemoveSuffix(name);
  865. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  866. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  867. ir.SetExported(TRUE);
  868. IntermediateCode.InitImmediate(op,addressType,initStack);
  869. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  870. END AddStackAllocation;
  871. (** entry function to visit a complete module *)
  872. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  873. VAR
  874. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  875. hasDynamicOperatorDeclarations: BOOLEAN;
  876. operator: SyntaxTree.Operator;
  877. import: SyntaxTree.Import;
  878. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  879. BEGIN
  880. type := type.resolved;
  881. IF type IS SyntaxTree.RecordType THEN
  882. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  883. ELSIF (type IS SyntaxTree.ArrayType) THEN
  884. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  885. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  886. END;
  887. ELSIF type IS SyntaxTree.MathArrayType THEN
  888. WITH type: SyntaxTree.MathArrayType DO
  889. IF type.form = SyntaxTree.Open THEN
  890. RETURN TRUE
  891. ELSIF type.form = SyntaxTree.Static THEN
  892. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  893. END;
  894. END;
  895. END;
  896. RETURN FALSE
  897. END TypeNeedsInitialization;
  898. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  899. VAR variable: SyntaxTree.Variable;
  900. BEGIN
  901. variable := scope.firstVariable;
  902. WHILE variable # NIL DO
  903. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  904. IF variable.initializer # NIL THEN RETURN TRUE END;
  905. variable := variable.nextVariable;
  906. END;
  907. RETURN FALSE
  908. END ScopeNeedsInitialization;
  909. BEGIN
  910. ASSERT(x # NIL); ASSERT(module # NIL);
  911. SELF.module := module;
  912. (* add import names to the generated Sections.Module *)
  913. import := x.moduleScope.firstImport;
  914. WHILE import # NIL DO
  915. import.module.GetName(idstr);
  916. module.imports.AddName(idstr);
  917. import := import.nextImport
  918. END;
  919. implementationVisitor.module := module;
  920. implementationVisitor.moduleScope := x.moduleScope;
  921. implementationVisitor.moduleSelf := moduleSelf;
  922. implementationVisitor.canBeLoaded := TRUE;
  923. meta.SetModule(module);
  924. IF (forceModuleBody OR ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  925. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  926. END;
  927. IF backend.profile THEN
  928. EnsureBodyProcedure(x.moduleScope);
  929. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  930. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  931. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  932. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  933. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  934. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  935. Global.GetModuleName(module.module,idstr);
  936. implementationVisitor.ProfilerAddModule(idstr);
  937. implementationVisitor.numberProcedures := 0;
  938. END;
  939. implementationVisitor.profile := backend.profile;
  940. (* check if there is at least one dynamic operator locally defined *)
  941. hasDynamicOperatorDeclarations := FALSE;
  942. operator := x.moduleScope.firstOperator;
  943. WHILE operator # NIL DO
  944. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  945. operator := operator.nextOperator
  946. END;
  947. (* add operator initialization code section *)
  948. IF hasDynamicOperatorDeclarations THEN
  949. EnsureBodyProcedure(x.moduleScope);
  950. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  951. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  952. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  953. END;
  954. Scope(x.moduleScope);
  955. IF hasDynamicOperatorDeclarations THEN
  956. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  957. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  958. END;
  959. IF backend.profile THEN
  960. implementationVisitor.ProfilerPatchInit;
  961. END;
  962. END Module;
  963. END DeclarationVisitor;
  964. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  965. RegisterUsageCount*=OBJECT
  966. VAR used: UsedArray; count: LONGINT;
  967. PROCEDURE &Init;
  968. VAR i: LONGINT;
  969. BEGIN
  970. count := 0;
  971. IF used = NIL THEN NEW(used,64); END;
  972. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  973. END Init;
  974. PROCEDURE Grow;
  975. VAR new: UsedArray; size,i: LONGINT;
  976. BEGIN
  977. size := LEN(used)*2;
  978. NEW(new,size);
  979. FOR i := 0 TO LEN(used)-1 DO
  980. new[i].count := used[i].count;
  981. new[i].type := used[i].type;
  982. new[i].map := used[i].map
  983. END;
  984. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  985. used := new
  986. END Grow;
  987. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  988. BEGIN
  989. INC(count);
  990. IF count = LEN(used) THEN Grow END;
  991. used[count].type := type;
  992. used[count].class := class;
  993. used[count].map := count;
  994. RETURN count;
  995. END Next;
  996. PROCEDURE IncUse(register: LONGINT);
  997. BEGIN
  998. INC(used[register].count);
  999. (*
  1000. IF (register = 1) & (count > 30) THEN
  1001. D.TraceBack;
  1002. END;
  1003. *)
  1004. END IncUse;
  1005. PROCEDURE DecUse(register: LONGINT);
  1006. BEGIN
  1007. DEC(used[register].count);
  1008. END DecUse;
  1009. PROCEDURE Map(register: LONGINT): LONGINT;
  1010. VAR map : LONGINT;
  1011. BEGIN
  1012. IF register > 0 THEN
  1013. map := used[register].map;
  1014. WHILE register # map DO register := map; map := used[register].map END;
  1015. END;
  1016. RETURN register
  1017. END Map;
  1018. PROCEDURE Use(register: LONGINT): LONGINT;
  1019. BEGIN
  1020. IF register< LEN(used) THEN
  1021. RETURN used[register].count
  1022. ELSE
  1023. RETURN 0
  1024. END
  1025. END Use;
  1026. END RegisterUsageCount;
  1027. RegisterEntry = POINTER TO RECORD
  1028. prev,next: RegisterEntry;
  1029. register: LONGINT;
  1030. registerClass: IntermediateCode.RegisterClass;
  1031. type: IntermediateCode.Type;
  1032. END;
  1033. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1034. Variables = OBJECT (Basic.List)
  1035. VAR
  1036. inUse: VariableUse;
  1037. registerIndex: LONGINT;
  1038. nameIndex: LONGINT;
  1039. PROCEDURE & Init;
  1040. VAR i: LONGINT;
  1041. BEGIN
  1042. InitList(16);
  1043. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1044. registerIndex := 1024;
  1045. nameIndex := 0;
  1046. END Init;
  1047. PROCEDURE Clear*;
  1048. VAR i: LONGINT;
  1049. BEGIN
  1050. Clear^;
  1051. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1052. registerIndex := 1024;
  1053. nameIndex := 0;
  1054. END Clear;
  1055. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1056. VAR string: SyntaxTree.IdentifierString ;
  1057. BEGIN
  1058. COPY("@hiddenIRVar",string);
  1059. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1060. RETURN SyntaxTree.NewIdentifier(string);
  1061. END GetUID;
  1062. PROCEDURE GetUsage(VAR use: VariableUse);
  1063. BEGIN
  1064. use := inUse;
  1065. END GetUsage;
  1066. PROCEDURE SetUsage(CONST use: VariableUse);
  1067. BEGIN
  1068. inUse := use;
  1069. END SetUsage;
  1070. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1071. VAR any: ANY;
  1072. BEGIN
  1073. any := Get(i);
  1074. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1075. END GetVariable;
  1076. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1077. BEGIN
  1078. Set(pos, v);
  1079. END SetVariable;
  1080. PROCEDURE Occupy(pos: LONGINT);
  1081. BEGIN
  1082. INCL(inUse[pos DIV 32], pos MOD 32);
  1083. END Occupy;
  1084. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1085. BEGIN
  1086. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1087. END Occupied;
  1088. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1089. BEGIN
  1090. Occupy(Length());
  1091. Add(v);
  1092. END AddVariable;
  1093. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1094. BEGIN
  1095. t1 := t1.resolved;
  1096. t2 := t2.resolved;
  1097. (*RETURN t1.SameType(t2); *)
  1098. RETURN
  1099. (t1.SameType(t2))
  1100. OR
  1101. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1102. OR
  1103. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (t1.sizeInBits = t2.sizeInBits)
  1104. OR
  1105. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1106. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1107. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1108. OR
  1109. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1110. (DynamicDim(t1) = DynamicDim(t2))
  1111. );
  1112. END CompatibleType;
  1113. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1114. VAR var : SyntaxTree.Variable; i: LONGINT;
  1115. BEGIN
  1116. pos := Length();
  1117. FOR i := 0 TO pos-1 DO
  1118. IF ~(Occupied(i)) THEN
  1119. var := GetVariable(i);
  1120. IF (~var.useRegister) & CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1121. pos := i;
  1122. Occupy(i);
  1123. RETURN var;
  1124. END;
  1125. END;
  1126. END;
  1127. RETURN NIL
  1128. END GetFreeVariable;
  1129. END Variables;
  1130. SymbolMap = POINTER TO RECORD
  1131. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1132. isAddress: BOOLEAN;
  1133. END;
  1134. SymbolMapper = OBJECT
  1135. VAR
  1136. first: SymbolMap;
  1137. PROCEDURE & Init;
  1138. BEGIN
  1139. first := NIL;
  1140. END Init;
  1141. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1142. VAR new: SymbolMap;
  1143. BEGIN
  1144. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1145. new.next := first; first := new;
  1146. END Add;
  1147. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1148. VAR s: SymbolMap;
  1149. BEGIN
  1150. s := first;
  1151. WHILE (s # NIL) & (s.this # this) DO
  1152. s := s.next
  1153. END;
  1154. RETURN s
  1155. END Get;
  1156. END SymbolMapper;
  1157. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1158. VAR
  1159. system: Global.System;
  1160. section: IntermediateCode.Section;
  1161. module: Sections.Module;
  1162. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1163. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1164. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1165. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1166. checker: SemanticChecker.Checker;
  1167. backend: IntermediateBackend;
  1168. meta: MetaDataGenerator;
  1169. position: Position;
  1170. moduleSelf: SyntaxTree.Variable;
  1171. (* variables for hand over of variables / temporary state *)
  1172. currentScope: SyntaxTree.Scope;
  1173. constantDeclaration : SyntaxTree.Symbol;
  1174. result: Operand; (* result of the most recent expression / statement *)
  1175. destination: IntermediateCode.Operand;
  1176. arrayDestinationTag: IntermediateCode.Operand;
  1177. arrayDestinationDimension:LONGINT;
  1178. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1179. conditional: BOOLEAN;
  1180. trueLabel, falseLabel, exitLabel: Label;
  1181. locked: BOOLEAN;
  1182. (*
  1183. usedRegisters: Registers;
  1184. *)
  1185. registerUsageCount: RegisterUsageCount;
  1186. usedRegisters: RegisterEntry;
  1187. (* useful operands and types *)
  1188. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1189. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1190. commentPrintout: Printout.Printer;
  1191. dump: Streams.Writer;
  1192. tagsAvailable : BOOLEAN;
  1193. supportedInstruction: SupportedInstructionProcedure;
  1194. supportedImmediate: SupportedImmediateProcedure;
  1195. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1196. emitLabels: BOOLEAN;
  1197. builtinsModuleName : SyntaxTree.IdentifierString;
  1198. indexCounter: LONGINT;
  1199. profile: BOOLEAN;
  1200. profileId, profileInit: IntermediateCode.Section;
  1201. profileInitPatchPosition: LONGINT;
  1202. numberProcedures: LONGINT;
  1203. procedureResultDesignator : SyntaxTree.Designator;
  1204. operatorInitializationCodeSection: IntermediateCode.Section;
  1205. fingerPrinter: FingerPrinter.FingerPrinter;
  1206. temporaries: Variables;
  1207. canBeLoaded : BOOLEAN;
  1208. currentIsInline: BOOLEAN;
  1209. currentMapper: SymbolMapper;
  1210. currentInlineExit: Label;
  1211. moduleBodySection: IntermediateCode.Section;
  1212. NeedDescriptor : BOOLEAN;
  1213. cooperativeSwitches: BOOLEAN;
  1214. lastSwitchPC: LONGINT;
  1215. isUnchecked: BOOLEAN;
  1216. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend);
  1217. BEGIN
  1218. SELF.system := system;
  1219. SELF.builtinsModuleName := runtime;
  1220. currentScope := NIL;
  1221. hiddenPointerType := NIL;
  1222. delegatePointerType := NIL;
  1223. awaitProcCounter := 0;
  1224. labelId := 0; constId := 0; labelId := 0;
  1225. SELF.checker := checker;
  1226. SELF.backend := backend;
  1227. position := Basic.invalidPosition;
  1228. conditional := FALSE;
  1229. locked := FALSE;
  1230. InitOperand(result,ModeUndefined);
  1231. addressType := IntermediateCode.GetType(system,system.addressType);
  1232. setType := IntermediateCode.GetType(system,system.setType);
  1233. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1234. lenType := IntermediateCode.GetType(system, system.lenType);
  1235. byteType := IntermediateCode.GetType(system, system.byteType);
  1236. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1237. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1238. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1239. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1240. nil := IntermediateCode.Immediate(addressType,0);
  1241. one := IntermediateCode.Immediate(addressType,1);
  1242. IntermediateCode.InitOperand(destination);
  1243. tagsAvailable := TRUE;
  1244. supportedInstruction := supportedInstructionProcedure;
  1245. supportedImmediate := supportedImmediateProcedure;
  1246. inData := FALSE;
  1247. SELF.emitLabels := emitLabels;
  1248. IntermediateCode.InitOperand(arrayDestinationTag);
  1249. bool := IntermediateCode.GetType(system,system.booleanType);
  1250. IntermediateCode.InitImmediate(false,bool,0);
  1251. IntermediateCode.InitImmediate(true,bool,1);
  1252. indexCounter := 0;
  1253. NEW(registerUsageCount);
  1254. usedRegisters := NIL;
  1255. procedureResultDesignator := NIL;
  1256. NEW(fingerPrinter);
  1257. NEW(temporaries);
  1258. currentIsInline := FALSE;
  1259. NeedDescriptor := FALSE;
  1260. isUnchecked := backend.noRuntimeChecks;
  1261. END Init;
  1262. TYPE Context = RECORD
  1263. section: IntermediateCode.Section;
  1264. registerUsageCount: RegisterUsageCount;
  1265. usedRegisters: RegisterEntry;
  1266. temporaries: Variables;
  1267. END;
  1268. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1269. VAR context: Context;
  1270. BEGIN
  1271. context.section := section;
  1272. context.registerUsageCount := registerUsageCount;
  1273. context.usedRegisters := usedRegisters;
  1274. context.temporaries := temporaries;
  1275. section := new;
  1276. NEW(registerUsageCount);
  1277. NEW(temporaries);
  1278. usedRegisters := NIL;
  1279. RETURN context;
  1280. END SwitchContext;
  1281. PROCEDURE ReturnToContext(context: Context);
  1282. BEGIN
  1283. section := context.section;
  1284. registerUsageCount := context.registerUsageCount;
  1285. usedRegisters := context.usedRegisters;
  1286. temporaries := context.temporaries;
  1287. END ReturnToContext;
  1288. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1289. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1290. BEGIN
  1291. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1292. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1293. END;
  1294. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1295. section.SetExported(IsExported(syntaxTreeSymbol));
  1296. RETURN section
  1297. END NewSection;
  1298. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1299. VAR new: LONGINT;
  1300. BEGIN
  1301. new := registerUsageCount.Next(type,class);
  1302. UseRegister(new);
  1303. RETURN new
  1304. END AcquireRegister;
  1305. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1306. VAR
  1307. fingerPrint: SyntaxTree.FingerPrint;
  1308. fingerPrintString: ARRAY 32 OF CHAR;
  1309. BEGIN
  1310. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1311. string := "[";
  1312. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1313. Strings.Append(string, fingerPrintString);
  1314. Strings.Append(string, "]");
  1315. END GetFingerprintString;
  1316. (** get the name for the code section that represens a certain symbol
  1317. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1318. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1319. VAR string: ARRAY 32 OF CHAR;
  1320. BEGIN
  1321. Global.GetSymbolSegmentedName(symbol, name);
  1322. (* if the symbol is an operator, then append the fingerprint to the name *)
  1323. IF symbol IS SyntaxTree.Operator THEN
  1324. GetFingerprintString(symbol, string);
  1325. Basic.AppendToSegmentedName(name,string);
  1326. END
  1327. END GetCodeSectionNameForSymbol;
  1328. (** get the name for the code section that represens a certain symbol
  1329. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1330. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1331. VAR string: ARRAY 32 OF CHAR;
  1332. BEGIN
  1333. Global.GetSymbolNameInScope(symbol, scope, name);
  1334. (* if the symbol is an operator, then append the fingerprint to the name *)
  1335. IF symbol IS SyntaxTree.Operator THEN
  1336. GetFingerprintString(symbol, string);
  1337. Strings.Append(name, string);
  1338. END
  1339. END GetCodeSectionNameForSymbolInScope;
  1340. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1341. BEGIN
  1342. IF dump # NIL THEN
  1343. dump.String("enter "); dump.String(s); dump.Ln;
  1344. END;
  1345. END TraceEnter;
  1346. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1347. BEGIN
  1348. IF dump # NIL THEN
  1349. dump.String("exit "); dump.String(s); dump.Ln;
  1350. END;
  1351. END TraceExit;
  1352. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1353. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1354. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1355. VAR i: LONGINT;
  1356. BEGIN
  1357. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1358. IF op.rule # NIL THEN
  1359. FOR i := 0 TO LEN(op.rule)-1 DO
  1360. CheckRegister(op.rule[i])
  1361. END;
  1362. END;
  1363. END CheckRegister;
  1364. BEGIN
  1365. CheckRegister(instruction.op1);
  1366. CheckRegister(instruction.op2);
  1367. CheckRegister(instruction.op3);
  1368. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1369. ELSE section.Emit(instruction);
  1370. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1371. END;
  1372. END Emit;
  1373. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1374. BEGIN
  1375. IF backend.cooperative THEN
  1376. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1377. CallThis(position,"Runtime","Trap",1);
  1378. ELSE
  1379. Emit(Trap(position,trapNo));
  1380. (* Artificially append code to keep address of the instruction following the trap at the end of procedure within its boundary *)
  1381. IF trapNo = ReturnTrap THEN Emit(Trap(position,NoReturnTrap)) END;
  1382. END;
  1383. END EmitTrap;
  1384. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1385. VAR name: Basic.SegmentedName;
  1386. VAR op1, op2, reg: IntermediateCode.Operand;
  1387. VAR call, nocall: Label;
  1388. VAR parametersSize: LONGINT;
  1389. VAR prevSection: IntermediateCode.Section;
  1390. VAR prevDump: Streams.Writer;
  1391. VAR body: SyntaxTree.Body;
  1392. VAR procedureType: SyntaxTree.ProcedureType;
  1393. BEGIN
  1394. IF procedure # NIL THEN
  1395. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1396. ELSE procedureType := NIL;
  1397. END;
  1398. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1399. prevSection := SELF.section;
  1400. SELF.section := section;
  1401. prevDump := dump;
  1402. dump := section.comments;
  1403. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1404. IF backend.hasLinkRegister THEN
  1405. Emit(Push(Basic.invalidPosition, lr));
  1406. END;
  1407. Emit(Push(Basic.invalidPosition,fp));
  1408. IF procedure # NIL THEN
  1409. body := procedure.procedureScope.body;
  1410. ELSE
  1411. body := NIL;
  1412. END;
  1413. IF backend.cooperative THEN
  1414. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1415. GetCodeSectionNameForSymbol(procedure, name);
  1416. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1417. ELSE
  1418. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1419. END;
  1420. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1421. IntermediateCode.AddOffset(op1, 1);
  1422. Emit(Push(Basic.invalidPosition,op1));
  1423. Emit(Mov(Basic.invalidPosition,fp, sp));
  1424. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1425. NEW(call, section);
  1426. NEW(nocall, section);
  1427. reg := NewRegisterOperand(addressType);
  1428. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1429. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1430. BrltL(call, sp, reg);
  1431. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1432. BrgeL(nocall, sp, op2);
  1433. call.Resolve(section.pc);
  1434. Emit(Push(Basic.invalidPosition, reg));
  1435. ReleaseIntermediateOperand(reg);
  1436. parametersSize := ProcParametersSize(procedure);
  1437. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1438. Emit(Push(Basic.invalidPosition, op2));
  1439. CallThis(position, "Activities","ExpandStack",2);
  1440. Emit(Result(Basic.invalidPosition, sp));
  1441. nocall.Resolve(section.pc);
  1442. END;
  1443. ELSE
  1444. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1445. Emit(Push(Basic.invalidPosition, one)) ;
  1446. procedureType.SetParametersOffset(1);
  1447. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1448. END;
  1449. Emit(Mov(Basic.invalidPosition, fp, sp));
  1450. END;
  1451. END;
  1452. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1453. SELF.section := prevSection;
  1454. dump := prevDump;
  1455. END EmitEnter;
  1456. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1457. VAR op1,op2: IntermediateCode.Operand;
  1458. VAR instruction: IntermediateCode.Instruction;
  1459. BEGIN
  1460. IntermediateCode.InitNumber(op1,callconv);
  1461. IntermediateCode.InitNumber(op2,varSize);
  1462. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1463. RETURN instruction
  1464. END Enter;
  1465. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1466. VAR op1: IntermediateCode.Operand;
  1467. VAR instruction: IntermediateCode.Instruction;
  1468. BEGIN
  1469. IntermediateCode.InitNumber(op1,callconv);
  1470. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1471. RETURN instruction
  1472. END Leave;
  1473. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1474. VAR prevSection: IntermediateCode.Section;
  1475. VAR op2, size: IntermediateCode.Operand;
  1476. VAR body: SyntaxTree.Body;
  1477. BEGIN
  1478. prevSection := SELF.section;
  1479. SELF.section := section;
  1480. Emit(Leave(position, callconv));
  1481. IF procedure # NIL THEN
  1482. body := procedure.procedureScope.body;
  1483. ELSE
  1484. body := NIL;
  1485. END;
  1486. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1487. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1488. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1489. Emit(Add(position, sp, fp, op2));
  1490. ELSE
  1491. Emit(Mov(position, sp, fp));
  1492. END;
  1493. Emit(Pop(position, fp));
  1494. END;
  1495. SELF.section := prevSection;
  1496. END EmitLeave;
  1497. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1498. VAR m: SymbolMap;
  1499. BEGIN
  1500. position := x.position;
  1501. IF currentIsInline THEN
  1502. m := currentMapper.Get(x);
  1503. IF m # NIL THEN
  1504. (*
  1505. Printout.Info("mapping from", x);
  1506. Printout.Info("mapping to ", m.to);
  1507. *)
  1508. m.to.Accept(SELF);
  1509. op := result;
  1510. IF m.tag # NIL THEN
  1511. ReleaseIntermediateOperand(result.tag);
  1512. m.tag.Accept(SELF);
  1513. op.tag := result.op;
  1514. ReleaseIntermediateOperand(result.tag);
  1515. END;
  1516. RETURN
  1517. END;
  1518. END;
  1519. x.Accept(SELF);
  1520. op := result;
  1521. END Symbol;
  1522. PROCEDURE Expression(x: SyntaxTree.Expression);
  1523. BEGIN
  1524. position := x.position;
  1525. constantDeclaration := NIL;
  1526. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1527. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1528. END;
  1529. IF x.resolved # NIL THEN
  1530. x.resolved.Accept(SELF)
  1531. ELSE
  1532. x.Accept(SELF)
  1533. END;
  1534. (* check this, was commented out in ActiveCells3 *)
  1535. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1536. Error(x.position, "unsupported modifier");
  1537. END;
  1538. END Expression;
  1539. (*
  1540. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1541. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1542. BEGIN
  1543. temporaries.GetUsage(current);
  1544. FOR i := 0 TO LEN(current)-1 DO
  1545. set := current[i] - previous[i];
  1546. IF set # {} THEN
  1547. FOR j := 0 TO MAX(SET)-1 DO
  1548. IF j IN set THEN
  1549. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1550. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1551. Symbol(variable, op);
  1552. MakeMemory(tmp,op.op,addressType,0);
  1553. ReleaseOperand(op);
  1554. Emit(Mov(position,tmp, nil ) );
  1555. ReleaseIntermediateOperand(tmp);
  1556. END;
  1557. END;
  1558. END;
  1559. END;
  1560. END;
  1561. END ResetUsedTemporaries;
  1562. *)
  1563. PROCEDURE Statement(x: SyntaxTree.Statement);
  1564. VAR use: VariableUse;
  1565. BEGIN
  1566. temporaries.GetUsage(use);
  1567. position := x.position;
  1568. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1569. IF commentPrintout # NIL THEN
  1570. commentPrintout.Statement(x);
  1571. dump.Ln;
  1572. (*dump.Update;*)
  1573. END;
  1574. x.Accept(SELF);
  1575. (*
  1576. CheckRegistersFree();
  1577. *)
  1578. (*ResetUsedTemporaries(use);*)
  1579. temporaries.SetUsage(use);
  1580. END Statement;
  1581. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1582. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1583. *)
  1584. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1585. BEGIN
  1586. ASSERT(op.mode # IntermediateCode.Undefined);
  1587. IF op.mode = IntermediateCode.ModeMemory THEN
  1588. ReuseCopy(res,op);
  1589. ELSE
  1590. res := op;
  1591. UseIntermediateOperand(res);
  1592. END;
  1593. IntermediateCode.AddOffset(res,offset);
  1594. IntermediateCode.MakeMemory(res,type);
  1595. END MakeMemory;
  1596. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1597. VAR mem: IntermediateCode.Operand;
  1598. BEGIN
  1599. MakeMemory(mem,res,type,offset);
  1600. ReleaseIntermediateOperand(res);
  1601. res := mem;
  1602. END ToMemory;
  1603. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1604. VAR mem: IntermediateCode.Operand;
  1605. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1606. componentType: SyntaxTree.Type;
  1607. BEGIN
  1608. type := type.resolved;
  1609. IF operand.mode = ModeReference THEN
  1610. IF type IS SyntaxTree.RangeType THEN
  1611. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1612. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1613. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1614. ReleaseOperand(operand);
  1615. operand.op := firstOp;
  1616. operand.tag := lastOp;
  1617. operand.extra := stepOp;
  1618. ELSIF type IS SyntaxTree.ComplexType THEN
  1619. componentType := type(SyntaxTree.ComplexType).componentType;
  1620. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1621. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1622. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1623. ReleaseOperand(operand);
  1624. operand.op := firstOp;
  1625. operand.tag := lastOp
  1626. ELSE
  1627. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1628. ReleaseIntermediateOperand(operand.op);
  1629. operand.op := mem;
  1630. END;
  1631. operand.mode := ModeValue;
  1632. END;
  1633. ASSERT(operand.mode = ModeValue);
  1634. END LoadValue;
  1635. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1636. VAR prevConditional: BOOLEAN;
  1637. BEGIN
  1638. prevConditional := conditional;
  1639. conditional := FALSE;
  1640. InitOperand(result, ModeUndefined);
  1641. Expression(x);
  1642. op := result;
  1643. LoadValue(op,x.type.resolved);
  1644. conditional := prevConditional;
  1645. END Evaluate;
  1646. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1647. VAR prevConditional: BOOLEAN;
  1648. BEGIN
  1649. prevConditional := conditional;
  1650. conditional := FALSE;
  1651. InitOperand(result,ModeUndefined);
  1652. Expression(x);
  1653. op := result;
  1654. (*
  1655. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1656. *)
  1657. conditional := prevConditional;
  1658. END Designate;
  1659. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1660. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1661. BEGIN
  1662. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1663. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1664. conditional := TRUE;
  1665. trueLabel := trueL; falseLabel := falseL;
  1666. Expression(x);
  1667. trueL := trueLabel; falseL := falseLabel;
  1668. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1669. END Condition;
  1670. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1671. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1672. BEGIN
  1673. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1674. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1675. RETURN op
  1676. END NewRegisterOperand;
  1677. PROCEDURE UnuseRegister(register: LONGINT);
  1678. BEGIN
  1679. IF (register > 0) THEN
  1680. register := registerUsageCount.Map(register);
  1681. registerUsageCount.DecUse(register);
  1682. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1683. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1684. END;
  1685. IF registerUsageCount.Use(register)=0 THEN
  1686. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1687. Warning(position, "register cannot be removed");
  1688. END;
  1689. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1690. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1691. END;
  1692. ELSIF registerUsageCount.Use(register)<0 THEN
  1693. Warning(position, "register removed too often");
  1694. IF dump # NIL THEN
  1695. dump.String("register removed too often"); dump.Ln; dump.Update;
  1696. END;
  1697. END;
  1698. END;
  1699. END UnuseRegister;
  1700. PROCEDURE UseRegister(register: LONGINT);
  1701. BEGIN
  1702. IF (register > 0) THEN
  1703. register := registerUsageCount.Map(register);
  1704. registerUsageCount.IncUse(register);
  1705. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1706. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1707. END;
  1708. IF registerUsageCount.Use(register)=1 THEN
  1709. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1710. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1711. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1712. END;
  1713. END;
  1714. END;
  1715. END UseRegister;
  1716. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1717. BEGIN
  1718. UnuseRegister(op.register)
  1719. END ReleaseIntermediateOperand;
  1720. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1721. BEGIN
  1722. UseRegister(op.register)
  1723. END UseIntermediateOperand;
  1724. PROCEDURE ReleaseOperand(CONST op: Operand);
  1725. BEGIN
  1726. UnuseRegister(op.op.register);
  1727. UnuseRegister(op.tag.register);
  1728. UnuseRegister(op.extra.register);
  1729. END ReleaseOperand;
  1730. (* save registers marked in array "markedRegisters" to the stack
  1731. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1732. *)
  1733. PROCEDURE SaveRegisters();
  1734. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1735. BEGIN
  1736. entry := usedRegisters;
  1737. WHILE entry # NIL DO
  1738. type := registerUsageCount.used[entry.register].type;
  1739. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1740. Emit(Push(position,op));
  1741. entry := entry.next;
  1742. END;
  1743. END SaveRegisters;
  1744. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1745. BEGIN
  1746. saved := usedRegisters;
  1747. usedRegisters := NIL;
  1748. END ReleaseUsedRegisters;
  1749. (** remove parameter registers from used queue *)
  1750. PROCEDURE ReleaseParameterRegisters;
  1751. VAR entry,prev,next: RegisterEntry;
  1752. BEGIN
  1753. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1754. WHILE entry # NIL DO
  1755. next := entry.next;
  1756. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1757. registerUsageCount.DecUse(entry.register);
  1758. ASSERT(registerUsageCount.Use(entry.register)=0);
  1759. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1760. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1761. END;
  1762. ELSIF prev = NIL THEN
  1763. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1764. ELSE
  1765. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1766. END;
  1767. entry := next;
  1768. END;
  1769. END ReleaseParameterRegisters;
  1770. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1771. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1772. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1773. BEGIN
  1774. entry := saved;
  1775. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1776. entry := prev;
  1777. WHILE entry # NIL DO
  1778. prev := entry.prev;
  1779. type := entry.type;
  1780. class := entry.registerClass;
  1781. IntermediateCode.InitRegister(op,type,class,entry.register);
  1782. (*
  1783. new := registerUsageCount.Next(type,class);
  1784. registerUsageCount.Remap(entry.register,new);
  1785. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1786. dump.String("remap register "); dump.Int(entry.register,1);
  1787. dump.String("to "); dump.Int(new,1);
  1788. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1789. END;
  1790. entry.register := new;
  1791. *)
  1792. Emit(Pop(position,op));
  1793. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1794. entry := prev;
  1795. END;
  1796. (*
  1797. usedRegisters := saved;
  1798. *)
  1799. END RestoreRegisters;
  1800. PROCEDURE CheckRegistersFree;
  1801. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1802. BEGIN
  1803. IF usedRegisters # NIL THEN
  1804. r := usedRegisters;
  1805. WHILE r # NIL DO
  1806. warning := "register ";
  1807. Strings.AppendInt(warning, r.register);
  1808. Strings.Append(warning, " not released.");
  1809. Warning(position,warning);
  1810. r := r .next;
  1811. END;
  1812. END;
  1813. FOR i := 0 TO registerUsageCount.count-1 DO
  1814. IF registerUsageCount.used[i].count < 0 THEN
  1815. warning := "register ";
  1816. Strings.AppendInt(warning, i);
  1817. Strings.Append(warning, " unused too often.");
  1818. Warning(position,warning);
  1819. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1820. warning := "register ";
  1821. Strings.AppendInt(warning, i);
  1822. Strings.Append(warning, " not unused often enough.");
  1823. Warning(position,warning);
  1824. END;
  1825. END;
  1826. END CheckRegistersFree;
  1827. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1828. Otherwise allocate a new register.
  1829. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1830. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1831. BEGIN
  1832. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1833. UseIntermediateOperand(result);
  1834. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1835. UseIntermediateOperand(result);
  1836. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1837. END;
  1838. END Reuse2;
  1839. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1840. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1841. If not then allocate a new register.
  1842. Does NOT necessarily keep the content of src1 or src2 in result!
  1843. *)
  1844. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1845. BEGIN
  1846. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1847. UseIntermediateOperand(result);
  1848. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1849. UseIntermediateOperand(result);
  1850. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1851. result := alternative; alternative := emptyOperand;
  1852. UseIntermediateOperand(result);
  1853. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1854. END;
  1855. END Reuse2a;
  1856. (* like reuse2 but only one source *)
  1857. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1858. BEGIN
  1859. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1860. UseIntermediateOperand(result);
  1861. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1862. END;
  1863. END Reuse1;
  1864. (* like reuse2a but only one source *)
  1865. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1866. BEGIN
  1867. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1868. UseIntermediateOperand(result);
  1869. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1870. UseIntermediateOperand(result);
  1871. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1872. END;
  1873. END Reuse1a;
  1874. (* like reuse1 but guarantees that content of src1 is in result *)
  1875. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1876. BEGIN
  1877. IF ReusableRegister(src1) THEN
  1878. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1879. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1880. UseIntermediateOperand(result);
  1881. ELSE
  1882. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1883. Emit(Mov(position,result,src1));
  1884. END
  1885. END ReuseCopy;
  1886. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1887. BEGIN
  1888. IF ReusableRegister(src) THEN
  1889. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1890. ELSE
  1891. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1892. Emit(Mov(position,result,src));
  1893. ReleaseIntermediateOperand(src);
  1894. END
  1895. END TransferToRegister;
  1896. (** labels and branches **)
  1897. PROCEDURE NewLabel(): Label;
  1898. VAR label: Label;
  1899. BEGIN
  1900. NEW(label,section); RETURN label;
  1901. END NewLabel;
  1902. PROCEDURE SetLabel(label: Label);
  1903. BEGIN label.Resolve(section.pc);
  1904. END SetLabel;
  1905. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1906. BEGIN
  1907. ASSERT(label # NIL);
  1908. IF label.pc < 0 THEN (* label not yet set *)
  1909. label.AddFixup(section.pc);
  1910. END;
  1911. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1912. END LabelOperand;
  1913. PROCEDURE BrL(label: Label);
  1914. BEGIN
  1915. Emit(Br(position,LabelOperand(label)));
  1916. END BrL;
  1917. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1918. BEGIN
  1919. Emit(Brge(position,LabelOperand(label),left,right));
  1920. END BrgeL;
  1921. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1922. BEGIN
  1923. Emit(Brlt(position,LabelOperand(label),left,right));
  1924. END BrltL;
  1925. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1926. BEGIN
  1927. Emit(Breq(position,LabelOperand(label),left,right));
  1928. END BreqL;
  1929. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1930. BEGIN
  1931. Emit(Brne(position,LabelOperand(label),left,right));
  1932. END BrneL;
  1933. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1934. VAR new: IntermediateCode.Operand;
  1935. BEGIN
  1936. IF Trace THEN TraceEnter("Convert") END;
  1937. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1938. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1939. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1940. & (operand.offset = 0)
  1941. THEN
  1942. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1943. Emit(Conv(position,new,operand));
  1944. ELSE
  1945. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1946. Emit(Conv(position,new,operand));
  1947. ReleaseIntermediateOperand(operand);
  1948. END;
  1949. operand := new;
  1950. 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
  1951. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1952. ELSE
  1953. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1954. Emit(Conv(position,new,operand));
  1955. ReleaseIntermediateOperand(operand);
  1956. operand := new;
  1957. END;
  1958. IF Trace THEN TraceExit("Convert") END;
  1959. END Convert;
  1960. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1961. VAR exit: Label;
  1962. BEGIN
  1963. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1964. exit := NewLabel();
  1965. br(exit,left,right);
  1966. EmitTrap(position,trapNo);
  1967. SetLabel(exit);
  1968. END TrapC;
  1969. (** expressions *)
  1970. (** emit necessary runtime check for set elements **)
  1971. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1972. VAR max: IntermediateCode.Operand;
  1973. BEGIN
  1974. IF isUnchecked THEN RETURN END;
  1975. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1976. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1977. TrapC(BrgeL, max, o, SetElementTrap);
  1978. END;
  1979. END CheckSetElement;
  1980. (** the set that a range represents **)
  1981. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1982. VAR
  1983. operand: Operand;
  1984. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1985. BEGIN
  1986. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1987. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1988. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1989. one := IntermediateCode.Immediate(setType, 1);
  1990. Evaluate(x, operand);
  1991. Convert(operand.op, setType);
  1992. Convert(operand.tag, setType);
  1993. CheckSetElement(operand.op);
  1994. CheckSetElement(operand.tag);
  1995. (* create mask for lower bound
  1996. i.e. shift 11111111 to the left by the value of the lower bound
  1997. *)
  1998. Reuse1(temp, operand.op);
  1999. Emit(Shl(position,temp, allBits, operand.op));
  2000. ReleaseIntermediateOperand(operand.op);
  2001. operand.op := temp;
  2002. (* create mask for upper bound
  2003. i.e. shift 11111111 to the right by the difference between the
  2004. upper bound and the maximum number of set elements
  2005. *)
  2006. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2007. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2008. Reuse1(temp, operand.tag);
  2009. ELSE
  2010. Reuse1(temp, operand.tag);
  2011. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2012. Emit(Sub(position,temp, size, operand.tag));
  2013. END;
  2014. Emit(Shr(position,temp, allBits, operand.tag));
  2015. ReleaseIntermediateOperand(operand.tag);
  2016. operand.tag := temp;
  2017. Reuse2(resultingSet, operand.op, operand.tag);
  2018. (* intersect the two masks *)
  2019. Emit(And(position,resultingSet, operand.op, operand.tag));
  2020. ReleaseOperand(operand);
  2021. RETURN resultingSet
  2022. END SetFromRange;
  2023. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2024. VAR
  2025. res, operand: Operand;
  2026. temp, one, noBits, dest: IntermediateCode.Operand;
  2027. expression: SyntaxTree.Expression;
  2028. i: LONGINT;
  2029. BEGIN
  2030. IF Trace THEN TraceEnter("VisitSet") END;
  2031. dest := destination;
  2032. destination := emptyOperand;
  2033. noBits := IntermediateCode.Immediate(setType, 0);
  2034. one := IntermediateCode.Immediate(setType, 1);
  2035. (* start off with the empty set *)
  2036. InitOperand(res, ModeValue);
  2037. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2038. Emit(Mov(position,res.op, noBits));
  2039. FOR i := 0 TO x.elements.Length() - 1 DO
  2040. expression := x.elements.GetExpression(i);
  2041. IF expression IS SyntaxTree.RangeExpression THEN
  2042. (* range of set elements *)
  2043. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2044. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2045. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2046. ReleaseIntermediateOperand(temp)
  2047. ELSE
  2048. (* singelton element *)
  2049. Evaluate(expression, operand);
  2050. Convert(operand.op, setType);
  2051. CheckSetElement(operand.op);
  2052. (* create subset containing single element *)
  2053. Reuse1(temp, operand.op);
  2054. Emit(Shl(position,temp, one, operand.op));
  2055. ReleaseOperand(operand);
  2056. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2057. ReleaseIntermediateOperand(temp);
  2058. END
  2059. END;
  2060. result := res;
  2061. destination := dest;
  2062. IF Trace THEN TraceExit("VisitSet") END;
  2063. END VisitSet;
  2064. (* math arrays of the form [a,b,c]
  2065. x is a static array and thus does not provide any pointers
  2066. *)
  2067. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2068. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2069. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2070. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2071. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2072. element: SyntaxTree.IntegerValue;
  2073. BEGIN
  2074. numberElements := x.elements.Length();
  2075. expression := index.parameters.GetExpression(dim);
  2076. element := expression(SyntaxTree.IntegerValue);
  2077. FOR i := 0 TO numberElements-1 DO
  2078. expression := x.elements.GetExpression(i);
  2079. element.SetValue(i);
  2080. IF expression IS SyntaxTree.MathArrayExpression THEN
  2081. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2082. ELSE
  2083. Assign(index,expression);
  2084. END;
  2085. END;
  2086. END RecursiveAssignment;
  2087. BEGIN
  2088. (*static math array not providing pointers anyway *)
  2089. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2090. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2091. designator.SetType(variable.type);
  2092. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  2093. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2094. FOR i := 0 TO dim-1 DO
  2095. element := SyntaxTree.NewIntegerValue(x.position,0);
  2096. element.SetType(system.longintType);
  2097. index.parameters.AddExpression(element);
  2098. END;
  2099. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2100. RecursiveAssignment(x,0);
  2101. Expression(designator);
  2102. END VisitMathArrayExpression;
  2103. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2104. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2105. BEGIN
  2106. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2107. dest := destination; destination := emptyOperand;
  2108. IF x.operator = Scanner.Not THEN
  2109. IF conditional THEN
  2110. Condition(x.left,falseLabel,trueLabel)
  2111. ELSE
  2112. Evaluate(x.left,operand);
  2113. InitOperand(result,ModeValue);
  2114. Reuse1a(result.op,operand.op,dest);
  2115. Emit(Xor(position,result.op,operand.op,true));
  2116. ReleaseOperand(operand);
  2117. END;
  2118. ELSIF x.operator = Scanner.Minus THEN
  2119. Evaluate(x.left,operand);
  2120. InitOperand(result,ModeValue);
  2121. Reuse1a(result.op,operand.op,dest);
  2122. type := x.left.type.resolved;
  2123. IF type IS SyntaxTree.SetType THEN
  2124. Emit(Not(position,result.op,operand.op));
  2125. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2126. Reuse1(result.tag,operand.tag);
  2127. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2128. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2129. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2130. Emit(Neg(position,result.op,operand.op));
  2131. ELSE HALT(200)
  2132. END;
  2133. ReleaseOperand(operand);
  2134. ELSIF x.operator = Scanner.Address THEN
  2135. Designate(x.left,operand);
  2136. operand.mode := ModeValue;
  2137. t0 := x.left.type.resolved;
  2138. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2139. ReleaseIntermediateOperand(operand.op);
  2140. operand.op := operand.tag;
  2141. IntermediateCode.InitOperand(operand.tag);
  2142. END;
  2143. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2144. result := operand;
  2145. ELSE HALT(100)
  2146. END;
  2147. destination := dest;
  2148. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2149. END VisitUnaryExpression;
  2150. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2151. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2152. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2153. BEGIN
  2154. type := type.resolved;
  2155. originalType := type;
  2156. IF type IS SyntaxTree.PointerType THEN
  2157. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2158. END;
  2159. IF type IS SyntaxTree.ObjectType THEN
  2160. BrL(trueL);
  2161. ELSE
  2162. ASSERT(type IS SyntaxTree.RecordType);
  2163. (*
  2164. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2165. *)
  2166. ReuseCopy(left,tag);
  2167. right := TypeDescriptorAdr(type);
  2168. IF backend.cooperative THEN
  2169. repeatL := NewLabel();
  2170. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2171. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2172. END;
  2173. SetLabel(repeatL);
  2174. BreqL(trueL,left,right);
  2175. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2176. BrneL(repeatL,left,nil);
  2177. ELSIF meta.simple THEN
  2178. level := type(SyntaxTree.RecordType).Level();
  2179. (* get type desc tag of level relative to base tag *)
  2180. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2181. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2182. IntermediateCode.MakeMemory(left,addressType);
  2183. BreqL(trueL,left,right);
  2184. ELSE
  2185. level := type(SyntaxTree.RecordType).Level();
  2186. (* get type desc tag of level relative to base tag *)
  2187. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2188. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2189. IntermediateCode.MakeMemory(left,addressType);
  2190. BreqL(trueL,left,right);
  2191. END;
  2192. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2193. BrL(falseL);
  2194. END;
  2195. END TypeTest;
  2196. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2197. BEGIN
  2198. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2199. IF dump # NIL THEN
  2200. dump.String(s); dump.Ln;
  2201. END;
  2202. END Error;
  2203. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2204. BEGIN
  2205. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2206. IF dump # NIL THEN
  2207. dump.String(s); dump.Ln; dump.Update;
  2208. END;
  2209. END Warning;
  2210. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2211. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2212. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2213. operand:Operand;
  2214. BEGIN
  2215. previousSection := section;
  2216. Global.GetModuleName(mod,name);
  2217. Strings.Append(name,".@Trace");
  2218. Basic.ToSegmentedName(name, pooledName);
  2219. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2220. IF dump # NIL THEN dump := section.comments END;
  2221. IF backend.hasLinkRegister THEN
  2222. Emit(Push(Basic.invalidPosition, lr));
  2223. END;
  2224. variable := mod.moduleScope.firstVariable;
  2225. WHILE variable # NIL DO
  2226. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2227. Symbol(variable, operand);
  2228. register := operand.op;
  2229. CallTraceMethod(register, variable.type);
  2230. ReleaseIntermediateOperand(register);
  2231. END;
  2232. variable := variable.nextVariable;
  2233. END;
  2234. IF backend.hasLinkRegister THEN
  2235. Emit(Pop(Basic.invalidPosition, lr));
  2236. END;
  2237. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2238. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2239. Emit(Br(position,op));
  2240. INC(statCoopTraceModule, section.pc);
  2241. section := previousSection;
  2242. IF dump # NIL THEN dump := section.comments END;
  2243. END CreateTraceModuleMethod;
  2244. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2245. BEGIN
  2246. Emit (Push(position, dst));
  2247. Emit (Push(position, src));
  2248. CallThis(position,"GarbageCollector","Assign", 2);
  2249. END CallAssignPointer;
  2250. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2251. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2252. BEGIN
  2253. IF SemanticChecker.IsPointerType (type) THEN
  2254. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2255. ELSIF type.IsRecordType() THEN
  2256. Emit (Push(position,dst));
  2257. Emit (Push(position,src));
  2258. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2259. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2260. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2261. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2262. ELSIF IsStaticArray(type) THEN
  2263. size := StaticArrayNumElements(type);
  2264. base := StaticArrayBaseType(type);
  2265. IF base.IsRecordType() THEN
  2266. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2267. Emit (Push(position, dst));
  2268. Emit (Push(position, src));
  2269. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2270. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2271. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2272. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2273. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2274. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2275. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2276. Emit (Push(position, dst));
  2277. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2278. Emit (Push(position, src));
  2279. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2280. ELSE
  2281. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2282. Emit (Push(position, dst));
  2283. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2284. Emit (Push(position, src));
  2285. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2286. ASSERT(StaticArrayBaseType(type).IsPointer());
  2287. END;
  2288. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2289. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2290. Emit (Push(position, dst));
  2291. Emit (Push(position, src));
  2292. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2293. ELSE HALT(100); (* missing ? *)
  2294. END;
  2295. END CallAssignMethod;
  2296. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2297. VAR name: Basic.SegmentedName;
  2298. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2299. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2300. context: Context;
  2301. BEGIN
  2302. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2303. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2304. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2305. GetRecordTypeName (recordType,name);
  2306. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2307. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2308. IF dump # NIL THEN dump := section.comments END;
  2309. IF backend.hasLinkRegister THEN
  2310. Emit(Push(Basic.invalidPosition, lr));
  2311. END;
  2312. variable := recordType.recordScope.firstVariable;
  2313. WHILE variable # NIL DO
  2314. IF variable.NeedsTrace() THEN
  2315. dst := NewRegisterOperand (addressType);
  2316. src := NewRegisterOperand (addressType);
  2317. Emit (Mov(position, dst, parameter1));
  2318. Emit (Mov(position, src, parameter2));
  2319. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2320. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2321. CallAssignMethod(dst, src, variable.type);
  2322. ReleaseIntermediateOperand(src);
  2323. ReleaseIntermediateOperand(dst);
  2324. END;
  2325. variable := variable.nextVariable;
  2326. END;
  2327. recordBase := recordType.GetBaseRecord();
  2328. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2329. IF backend.hasLinkRegister THEN
  2330. Emit(Pop(Basic.invalidPosition, lr));
  2331. END;
  2332. GetRecordTypeName (recordBase,name);
  2333. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2334. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2335. Emit(Br(position,op));
  2336. ELSE
  2337. Emit(Exit(position,0,0, 0));
  2338. END;
  2339. IF ~recordType.isObject THEN
  2340. GetRecordTypeName (recordType,name);
  2341. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2342. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2343. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2344. NEW(registerUsageCount);
  2345. usedRegisters := NIL;
  2346. dst := NewRegisterOperand (addressType);
  2347. src := NewRegisterOperand (addressType);
  2348. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2349. Emit(Mov(position, dst, parameter1));
  2350. Emit(Mov(position, src, parameter2));
  2351. label := NewLabel();
  2352. SetLabel(label);
  2353. Emit(Push(position, dst));
  2354. Emit(Push(position, src));
  2355. GetRecordTypeName (recordType,name);
  2356. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2357. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2358. Emit(Call(position, op, 0));
  2359. Emit(Pop(position, src));
  2360. Emit(Pop(position, dst));
  2361. Emit(Add(position, dst, dst, ofs));
  2362. Emit(Add(position, src, src, ofs));
  2363. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2364. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2365. Emit(Exit(position,0,0, 0));
  2366. END;
  2367. INC(statCoopAssignProcedure, section.pc);
  2368. ReturnToContext(context);
  2369. IF dump # NIL THEN dump := section.comments END;
  2370. END CreateAssignProcedure;
  2371. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2372. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2373. BEGIN
  2374. IF IsUnsafePointer (type) THEN
  2375. skip := NewLabel();
  2376. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2377. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2378. BreqL (skip, op, nil);
  2379. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2380. SetLabel (skip);
  2381. ELSIF SemanticChecker.IsPointerType (type) THEN
  2382. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2383. CallThis(position,"GarbageCollector","Mark", 1);
  2384. ELSIF type.IsRecordType() THEN
  2385. Emit (Push(position,register));
  2386. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2387. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2388. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2389. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2390. ELSIF IsStaticArray(type) THEN
  2391. size := StaticArrayNumElements(type);
  2392. base := StaticArrayBaseType(type);
  2393. IF base.IsRecordType() THEN
  2394. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2395. Emit (Push(position, register));
  2396. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2397. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2398. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2399. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2400. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2401. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2402. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2403. Emit (Push(position, register));
  2404. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2405. ELSE
  2406. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2407. Emit (Push(position, register));
  2408. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2409. ASSERT(base.IsPointer());
  2410. END;
  2411. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2412. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2413. CallThis(position,"GarbageCollector","Mark", 1);
  2414. ELSE HALT(100); (* missing ? *)
  2415. END;
  2416. END CallTraceMethod;
  2417. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2418. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2419. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2420. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2421. BEGIN
  2422. previousSection := section;
  2423. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2424. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2425. GetRecordTypeName (recordType,name);
  2426. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2427. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2428. IF dump # NIL THEN dump := section.comments END;
  2429. IF backend.hasLinkRegister THEN
  2430. Emit(Push(Basic.invalidPosition, lr));
  2431. END;
  2432. variable := recordType.recordScope.firstVariable;
  2433. WHILE variable # NIL DO
  2434. IF variable.NeedsTrace() THEN
  2435. register := NewRegisterOperand (addressType);
  2436. Emit (Mov(position,register,parameter1));
  2437. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2438. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2439. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2440. END;
  2441. CallTraceMethod(register, variable.type);
  2442. ReleaseIntermediateOperand(register);
  2443. END;
  2444. variable := variable.nextVariable;
  2445. END;
  2446. recordBase := recordType.GetBaseRecord();
  2447. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2448. recordBase := recordBase.GetBaseRecord();
  2449. END;
  2450. IF recordBase # NIL THEN
  2451. IF backend.hasLinkRegister THEN
  2452. Emit(Pop(Basic.invalidPosition, lr));
  2453. END;
  2454. GetRecordTypeName (recordBase,name);
  2455. IF HasExplicitTraceMethod (recordBase) THEN
  2456. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2457. ELSE
  2458. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2459. END;
  2460. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2461. Emit(Br(position,op));
  2462. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2463. Emit(Exit(position,0,0,0));
  2464. ELSE
  2465. IF backend.hasLinkRegister THEN
  2466. Emit(Pop(Basic.invalidPosition, lr));
  2467. END;
  2468. IF recordType.isObject THEN
  2469. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2470. ELSE
  2471. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2472. END;
  2473. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2474. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2475. Emit(Br(position,op));
  2476. END;
  2477. IF ~recordType.isObject THEN
  2478. GetRecordTypeName (recordType,name);
  2479. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2480. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2481. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2482. NEW(registerUsageCount);
  2483. usedRegisters := NIL;
  2484. IF dump # NIL THEN dump := section.comments END;
  2485. register := NewRegisterOperand (addressType);
  2486. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2487. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2488. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2489. END;
  2490. Emit (Push(position,register));
  2491. GetRecordTypeName (recordType,name);
  2492. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2493. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2494. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2495. ReleaseIntermediateOperand(register);
  2496. Emit(Exit(position,0,0,0));
  2497. GetRecordTypeName (recordType,name);
  2498. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2499. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2500. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2501. NEW(registerUsageCount);
  2502. usedRegisters := NIL;
  2503. register := NewRegisterOperand (addressType);
  2504. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2505. Emit(Mov(position, register, parameter1));
  2506. label := NewLabel();
  2507. SetLabel(label);
  2508. Emit(Push(position, register));
  2509. GetRecordTypeName (recordType,name);
  2510. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2511. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2512. Emit(Call(position, op, 0));
  2513. Emit(Pop(position, register));
  2514. Emit(Add(position, register, register, ofs));
  2515. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2516. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2517. Emit(Exit(position,0,0,0));
  2518. END;
  2519. INC(statCoopTraceMethod, section.pc);
  2520. ReturnToContext(context);
  2521. IF dump # NIL THEN dump := section.comments END;
  2522. END CreateTraceMethod;
  2523. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2524. VAR name: Basic.SegmentedName;
  2525. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2526. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2527. context: Context;
  2528. BEGIN
  2529. IF recordType.isObject THEN RETURN END;
  2530. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2531. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2532. GetRecordTypeName (recordType,name);
  2533. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2534. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2535. IF dump # NIL THEN dump := section.comments END;
  2536. IF backend.hasLinkRegister THEN
  2537. Emit(Push(Basic.invalidPosition, lr));
  2538. END;
  2539. variable := recordType.recordScope.firstVariable;
  2540. WHILE variable # NIL DO
  2541. IF variable.NeedsTrace() THEN
  2542. dst := NewRegisterOperand (addressType);
  2543. Emit (Mov(position, dst, parameter1));
  2544. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2545. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2546. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2547. END;
  2548. CallResetProcedure(dst, nil, variable.type);
  2549. ReleaseIntermediateOperand(dst);
  2550. END;
  2551. variable := variable.nextVariable;
  2552. END;
  2553. recordBase := recordType.GetBaseRecord();
  2554. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2555. IF backend.hasLinkRegister THEN
  2556. Emit(Pop(Basic.invalidPosition, lr));
  2557. END;
  2558. GetRecordTypeName (recordBase,name);
  2559. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2560. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2561. Emit(Br(position,op));
  2562. ELSE
  2563. Emit(Exit(position,0,0, 0));
  2564. END;
  2565. GetRecordTypeName (recordType,name);
  2566. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2567. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2568. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2569. NEW(registerUsageCount);
  2570. usedRegisters := NIL;
  2571. dst := NewRegisterOperand (addressType);
  2572. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2573. Emit(Mov(position, dst, parameter1));
  2574. label := NewLabel();
  2575. SetLabel(label);
  2576. Emit(Push(position, dst));
  2577. GetRecordTypeName (recordType,name);
  2578. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2579. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2580. Emit(Call(position, op, 0));
  2581. Emit(Pop(position, dst));
  2582. Emit(Add(position, dst, dst, ofs));
  2583. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2584. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2585. Emit(Exit(position,0,0, 0));
  2586. INC(statCoopResetProcedure, section.pc);
  2587. ReturnToContext(context);
  2588. IF dump # NIL THEN dump := section.comments END;
  2589. END CreateResetProcedure;
  2590. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2591. VAR name: Basic.SegmentedName; context: Context;
  2592. BEGIN
  2593. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2594. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2595. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2596. IF dump # NIL THEN dump := section.comments END;
  2597. IF backend.hasLinkRegister THEN
  2598. Emit(Push(Basic.invalidPosition, lr));
  2599. END;
  2600. Emit(Push(position,fp));
  2601. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2602. ResetVariables(scope);
  2603. Emit(Pop(position,fp));
  2604. Emit(Exit(position,0,0, 0));
  2605. ReturnToContext(context);
  2606. IF dump # NIL THEN dump := section.comments END;
  2607. END CreateResetMethod;
  2608. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2609. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2610. BEGIN
  2611. IF SemanticChecker.IsPointerType (type) THEN
  2612. Emit (Push(position, dest));
  2613. CallThis(position,"GarbageCollector","Reset", 1);
  2614. ELSIF type.IsRecordType() THEN
  2615. Emit (Push(position, dest));
  2616. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2617. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2618. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2619. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2620. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2621. size := GetArrayLength(type, tag);
  2622. base := ArrayBaseType(type);
  2623. IF base.IsRecordType() THEN
  2624. Emit (Push(position, size));
  2625. Emit (Push(position, dest));
  2626. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2627. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2628. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2629. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2630. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2631. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2632. Emit (Push(position, size));
  2633. Emit (Push(position, dest));
  2634. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2635. ELSE
  2636. Emit (Push(position, size));
  2637. Emit (Push(position, dest));
  2638. CallThis(position,"GarbageCollector","ResetArray", 2);
  2639. ASSERT(ArrayBaseType(type).IsPointer());
  2640. END;
  2641. ReleaseIntermediateOperand(size);
  2642. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2643. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2644. Emit (Push(position, dest));
  2645. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2646. ELSE HALT(100); (* missing ? *)
  2647. END;
  2648. END CallResetProcedure;
  2649. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2650. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2651. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2652. VAR operand: Operand;
  2653. BEGIN
  2654. Symbol (symbol, operand);
  2655. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2656. ReleaseOperand(operand);
  2657. END Reset;
  2658. BEGIN
  2659. previousScope := currentScope;
  2660. currentScope := scope;
  2661. pc := section.pc;
  2662. variable := scope.firstVariable;
  2663. WHILE variable # NIL DO
  2664. IF variable.NeedsTrace() THEN
  2665. Reset (variable);
  2666. END;
  2667. variable := variable.nextVariable;
  2668. END;
  2669. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2670. WHILE parameter # NIL DO
  2671. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  2672. Reset (parameter);
  2673. END;
  2674. parameter := parameter.nextParameter;
  2675. END;
  2676. INC(statCoopResetVariables, section.pc - pc);
  2677. currentScope := previousScope;
  2678. END ResetVariables;
  2679. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  2680. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  2681. BEGIN
  2682. type := symbol.type.resolved;
  2683. SaveRegisters();ReleaseUsedRegisters(saved);
  2684. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  2685. Symbol(symbol, operand);
  2686. ToMemory(operand.op,addressType,0);
  2687. Emit(Push(position,operand.op));
  2688. IF refer THEN
  2689. CallThis(position,"Heaps","Refer",1);
  2690. ELSE
  2691. CallThis(position,"Heaps","Reset",1);
  2692. END;
  2693. ELSIF type.IsRecordType() THEN
  2694. Symbol(symbol, operand);
  2695. Emit(Push(position,operand.op));
  2696. Emit(Push(position,operand.tag)); (* type desc *)
  2697. IF refer THEN
  2698. CallThis(position,"Heaps","ReferRecord",2);
  2699. ELSE
  2700. CallThis(position,"Heaps","ResetRecord",2);
  2701. END;
  2702. ELSIF IsStaticArray(type) THEN
  2703. size := StaticArrayNumElements(type);
  2704. base := StaticArrayBaseType(type);
  2705. Symbol(symbol, operand);
  2706. arg := TypeDescriptorAdr(base);
  2707. Emit(Push(position,operand.op));
  2708. Emit(Push(position,arg));
  2709. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2710. ReleaseIntermediateOperand(arg);
  2711. IF refer THEN
  2712. CallThis(position,"Heaps","ReferArray",3);
  2713. ELSE
  2714. CallThis(position,"Heaps","ResetArray",3);
  2715. END;
  2716. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  2717. size := StaticMathArrayNumElements(type);
  2718. base := StaticMathArrayBaseType(type);
  2719. Symbol(symbol, operand);
  2720. arg := TypeDescriptorAdr(base);
  2721. Emit(Push(position,operand.op));
  2722. Emit(Push(position,arg));
  2723. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2724. ReleaseIntermediateOperand(arg);
  2725. IF refer THEN
  2726. CallThis(position,"Heaps","ReferArray",3);
  2727. ELSE
  2728. CallThis(position,"Heaps","ResetArray",3);
  2729. END;
  2730. ELSIF type IS SyntaxTree.MathArrayType THEN
  2731. Symbol(symbol, operand);
  2732. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  2733. Emit (Push(position, operand.op));
  2734. ELSE
  2735. Emit (Push(position, operand.tag));
  2736. END;
  2737. IF refer THEN
  2738. CallThis(position,"Heaps","ReferMathArray", 1);
  2739. ELSE
  2740. CallThis(position,"Heaps","ResetMathArray", 1);
  2741. END;
  2742. ELSIF type IS SyntaxTree.ProcedureType THEN
  2743. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  2744. Symbol(symbol, operand);
  2745. Emit (Push(position, operand.tag));
  2746. IF refer THEN
  2747. CallThis(position,"Heaps","Refer", 1);
  2748. ELSE
  2749. CallThis(position,"Heaps","Reset", 1);
  2750. END;
  2751. ELSE HALT(100); (* missing ? *)
  2752. END;
  2753. ReleaseOperand(operand);
  2754. RestoreRegisters(saved);
  2755. END Reset;
  2756. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  2757. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  2758. BEGIN
  2759. previousScope := currentScope;
  2760. currentScope := scope;
  2761. pc := section.pc;
  2762. IF ~ refer THEN
  2763. variable := scope.firstVariable;
  2764. prevOffset := MAX(SIZE);
  2765. WHILE variable # NIL DO
  2766. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2767. Reset (variable,refer);
  2768. prevOffset := variable.offsetInBits;
  2769. END;
  2770. variable := variable.nextVariable;
  2771. END;
  2772. END;
  2773. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2774. WHILE parameter # NIL DO
  2775. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  2776. Reset (parameter,refer);
  2777. END;
  2778. parameter := parameter.nextParameter;
  2779. END;
  2780. INC(statCoopResetVariables, section.pc - pc);
  2781. currentScope := previousScope;
  2782. END ResetVariables2;
  2783. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2784. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2785. VAR op: IntermediateCode.Operand; context: Context;
  2786. BEGIN
  2787. previousSection := section;
  2788. GetCodeSectionNameForSymbol(procedure, name);
  2789. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2790. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2791. IF dump # NIL THEN dump := section.comments END;
  2792. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2793. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2794. Emit(Data(position,op));
  2795. Emit(Data(position,nil));
  2796. IF HasPointers (procedure.procedureScope) THEN
  2797. GetCodeSectionNameForSymbol(procedure, name);
  2798. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2799. ELSE
  2800. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2801. END;
  2802. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2803. Emit(Data(position,op));
  2804. ReturnToContext(context);
  2805. IF dump # NIL THEN dump := section.comments END;
  2806. END CreateProcedureDescriptor;
  2807. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2808. VAR import: SyntaxTree.Import;
  2809. s: Basic.MessageString;
  2810. selfName: SyntaxTree.IdentifierString;
  2811. BEGIN
  2812. moduleScope.ownerModule.GetName(selfName);
  2813. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2814. module := moduleScope.ownerModule
  2815. ELSE
  2816. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2817. IF import = NIL THEN
  2818. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2819. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2820. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2821. s := "Module ";
  2822. Strings.Append(s,moduleName);
  2823. Strings.Append(s," cannot be imported.");
  2824. IF force THEN
  2825. Error(position,s);
  2826. ELSIF canBeLoaded THEN
  2827. IF WarningDynamicLoading THEN
  2828. Strings.Append(s, "=> no dynamic linking.");
  2829. Warning(position, s);
  2830. END;
  2831. canBeLoaded := FALSE;
  2832. END;
  2833. RETURN FALSE
  2834. ELSE
  2835. SELF.module.imports.AddName(moduleName)
  2836. END;
  2837. ELSIF import.module = NIL THEN (* already tried *)
  2838. RETURN FALSE
  2839. END;
  2840. module := import.module;
  2841. END;
  2842. RETURN TRUE
  2843. END AddImport;
  2844. (* needed for old binary object file format*)
  2845. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2846. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2847. BEGIN
  2848. IF AddImport(moduleName,module,TRUE) THEN
  2849. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2850. IF procedure = NIL THEN
  2851. s := "Instruction not supported on target, emulation procedure ";
  2852. Strings.Append(s,moduleName);
  2853. Strings.Append(s,".");
  2854. Strings.Append(s,procedureName);
  2855. Strings.Append(s," not present");
  2856. Error(position,s);
  2857. ELSE
  2858. StaticCallOperand(r,procedure);
  2859. ReleaseOperand(r);
  2860. fp := GetFingerprint(procedure);
  2861. END;
  2862. END;
  2863. END EnsureSymbol;
  2864. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2865. VAR exit: Label; trueL,falseL: Label;
  2866. BEGIN
  2867. trueL := NewLabel();
  2868. falseL := NewLabel();
  2869. exit := NewLabel();
  2870. Condition(x,trueL,falseL);
  2871. InitOperand(result,ModeValue);
  2872. SetLabel(trueL);
  2873. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2874. Emit(Mov(position,result.op,true));
  2875. BrL(exit);
  2876. SetLabel(falseL);
  2877. Emit(MovReplace(position,result.op,false));
  2878. SetLabel(exit);
  2879. END ConditionToValue;
  2880. PROCEDURE ValueToCondition(VAR op: Operand);
  2881. BEGIN
  2882. LoadValue(op,system.booleanType);
  2883. BrneL(trueLabel,op.op, false);
  2884. ReleaseOperand(op);
  2885. BrL(falseLabel);
  2886. END ValueToCondition;
  2887. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2888. VAR size: LONGINT;
  2889. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2890. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2891. BEGIN
  2892. ASSERT(type.form = SyntaxTree.Open);
  2893. baseType := type.arrayBase.resolved;
  2894. IF IsOpenArray(baseType) THEN
  2895. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2896. ELSE
  2897. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2898. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2899. END;
  2900. len := tag;
  2901. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2902. IntermediateCode.MakeMemory(len,addressType);
  2903. UseIntermediateOperand(len);
  2904. Reuse2(res,sizeOperand,len);
  2905. Emit(Mul(position,res,sizeOperand,len));
  2906. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2907. RETURN res
  2908. END GetArraySize;
  2909. BEGIN
  2910. type := type.resolved;
  2911. IF IsOpenArray(type) THEN
  2912. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2913. RETURN tag
  2914. ELSE
  2915. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2916. END;
  2917. ELSE
  2918. size := ToMemoryUnits(system,system.SizeOf(type));
  2919. RETURN IntermediateCode.Immediate(addressType,size)
  2920. END;
  2921. END GetDynamicSize;
  2922. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2923. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2924. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2925. BEGIN
  2926. ASSERT(type.form = SyntaxTree.Open);
  2927. baseType := type.arrayBase.resolved;
  2928. IF IsOpenArray(baseType) THEN
  2929. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2930. ELSE
  2931. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2932. END;
  2933. len := tag;
  2934. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2935. IntermediateCode.MakeMemory(len,addressType);
  2936. UseIntermediateOperand(len);
  2937. Reuse2(res,sizeOperand,len);
  2938. Emit(Mul(position,res,sizeOperand,len));
  2939. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2940. RETURN res
  2941. END GetLength;
  2942. BEGIN
  2943. type := type.resolved;
  2944. IF IsOpenArray(type) THEN
  2945. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2946. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2947. ELSIF type IS SyntaxTree.StringType THEN
  2948. RETURN tag;
  2949. ELSE
  2950. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2951. END;
  2952. END GetArrayLength;
  2953. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2954. VAR result: IntermediateCode.Operand;
  2955. BEGIN
  2956. IF backend.cooperative THEN
  2957. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2958. ELSE
  2959. MakeMemory(result, tag, addressType, 0);
  2960. END;
  2961. RETURN result
  2962. END GetSizeFromTag;
  2963. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2964. VAR parameter: SyntaxTree.Parameter;
  2965. BEGIN
  2966. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2967. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2968. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2969. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2970. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2971. END;
  2972. RETURN GetDynamicSize(e.type, tag);
  2973. END GetArrayOfBytesSize;
  2974. (*
  2975. to find imported symbol. not needed ?
  2976. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2977. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2978. BEGIN
  2979. IF AddImport(moduleName,importedModule,FALSE) THEN
  2980. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2981. RETURN symbol
  2982. ELSE
  2983. RETURN NIL
  2984. END
  2985. END SymbolByName;
  2986. *)
  2987. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2988. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2989. BEGIN
  2990. IF AddImport(moduleName,runtimeModule,force) THEN
  2991. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2992. IF procedure = NIL THEN
  2993. s := "Procedure ";
  2994. Strings.Append(s,moduleName);
  2995. Strings.Append(s,".");
  2996. Strings.Append(s,procedureName);
  2997. Strings.Append(s," not present");
  2998. Error(position,s);
  2999. RETURN FALSE
  3000. ELSE
  3001. RETURN TRUE
  3002. END;
  3003. ELSE RETURN FALSE
  3004. END;
  3005. END GetRuntimeProcedure;
  3006. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3007. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3008. s: Basic.MessageString;
  3009. BEGIN
  3010. Basic.InitSegmentedName(name);
  3011. name[0] := Basic.MakeString(moduleName);
  3012. name[1] := Basic.MakeString(typeName);
  3013. name[2] := -1;
  3014. IF AddImport(moduleName,importedModule, FALSE) THEN
  3015. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3016. IF symbol = NIL THEN
  3017. s := "type ";
  3018. Strings.Append(s,moduleName);
  3019. Strings.Append(s,".");
  3020. Strings.Append(s,typeName);
  3021. Strings.Append(s," not present");
  3022. Error(position,s);
  3023. END;
  3024. ELSE symbol := NIL;
  3025. END;
  3026. IF importedModule = moduleScope.ownerModule THEN
  3027. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3028. ELSE
  3029. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3030. END;
  3031. RETURN symbol
  3032. END GetTypeDescriptor;
  3033. (* 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. *)
  3034. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3035. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3036. pooledName: Basic.SegmentedName; size: LONGINT;
  3037. BEGIN
  3038. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3039. StaticCallOperand(result,procedure);
  3040. IF numberParameters < 0 THEN
  3041. size := ProcParametersSize(procedure);
  3042. ELSE
  3043. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3044. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3045. Error(position,"runtime call parameter count mismatch");
  3046. END;
  3047. END;
  3048. Emit(Call(position, result.op, size));
  3049. ReleaseOperand(result);
  3050. ELSE (* only static linking possible *)
  3051. ASSERT(numberParameters >= 0);
  3052. Basic.InitSegmentedName(pooledName);
  3053. pooledName[0] := Basic.MakeString(moduleName);
  3054. pooledName[1] := Basic.MakeString(procedureName);
  3055. pooledName[2] := -1;
  3056. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3057. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3058. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3059. END;
  3060. END CallThisChecked;
  3061. (* 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. *)
  3062. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3063. BEGIN
  3064. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3065. END CallThis;
  3066. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  3067. VAR
  3068. left,right: Operand;
  3069. leftSize, rightSize: IntermediateCode.Operand;
  3070. saved: RegisterEntry;
  3071. reg: IntermediateCode.Operand;
  3072. procedureName: SyntaxTree.IdentifierString;
  3073. BEGIN
  3074. procedureName := "CompareString";
  3075. SaveRegisters();ReleaseUsedRegisters(saved);
  3076. Designate(leftExpression,left);
  3077. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3078. Emit(Push(position,leftSize));
  3079. ReleaseIntermediateOperand(leftSize);
  3080. Emit(Push(position,left.op));
  3081. ReleaseOperand(left);
  3082. Designate(rightExpression,right);
  3083. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3084. Emit(Push(position,rightSize));
  3085. ReleaseIntermediateOperand(rightSize);
  3086. Emit(Push(position,right.op));
  3087. ReleaseOperand(right);
  3088. CallThis(position,builtinsModuleName,procedureName, 4);
  3089. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3090. Emit(Result(position,reg));
  3091. (*
  3092. AcquireThisRegister(int8,IntermediateCode.Result);
  3093. *)
  3094. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  3095. (*
  3096. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  3097. *)
  3098. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  3099. ReleaseIntermediateOperand(reg);
  3100. BrL(falseLabel);
  3101. END CompareString;
  3102. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3103. VAR
  3104. left,right: Operand;
  3105. leftSize, rightSize: IntermediateCode.Operand;
  3106. saved: RegisterEntry;
  3107. procedureName: SyntaxTree.IdentifierString;
  3108. BEGIN
  3109. procedureName := "CopyString";
  3110. SaveRegisters();ReleaseUsedRegisters(saved);
  3111. Designate(leftExpression,left);
  3112. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3113. Emit(Push(position,leftSize));
  3114. ReleaseIntermediateOperand(leftSize);
  3115. Emit(Push(position,left.op));
  3116. ReleaseOperand(left);
  3117. Designate(rightExpression,right);
  3118. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3119. Emit(Push(position,rightSize));
  3120. ReleaseIntermediateOperand(rightSize);
  3121. Emit(Push(position,right.op));
  3122. ReleaseOperand(right);
  3123. CallThis(position,builtinsModuleName,procedureName,4);
  3124. RestoreRegisters(saved);
  3125. END CopyString;
  3126. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3127. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3128. leftType,rightType: SyntaxTree.Type;
  3129. leftExpression,rightExpression : SyntaxTree.Expression;
  3130. componentType: IntermediateCode.Type;
  3131. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3132. size: LONGINT;
  3133. BEGIN
  3134. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3135. dest := destination; destination := emptyOperand;
  3136. leftType := x.left.type.resolved;
  3137. rightType := x.right.type.resolved;
  3138. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3139. CASE x.operator OF
  3140. Scanner.Or:
  3141. (* shortcut evaluation of left OR right *)
  3142. IF ~conditional THEN ConditionToValue(x);
  3143. ELSE
  3144. next := NewLabel();
  3145. Condition(x.left,trueLabel,next);
  3146. SetLabel(next);
  3147. Condition(x.right,trueLabel,falseLabel);
  3148. END;
  3149. |Scanner.And:
  3150. (* shortcut evaluation of left & right *)
  3151. IF ~conditional THEN ConditionToValue(x);
  3152. ELSE
  3153. next := NewLabel();
  3154. Condition(x.left,next,falseLabel);
  3155. SetLabel(next);
  3156. Condition(x.right,trueLabel,falseLabel);
  3157. END;
  3158. |Scanner.Is:
  3159. IF ~conditional THEN ConditionToValue(x);
  3160. ELSE
  3161. (* get type desc tag *)
  3162. IF IsPointerToRecord(leftType,recordType) THEN
  3163. Evaluate(x.left,left);
  3164. Dereference(left,recordType,IsUnsafePointer(leftType))
  3165. ELSE
  3166. Designate(x.left,left);
  3167. END;
  3168. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3169. ReleaseOperand(left);
  3170. END;
  3171. |Scanner.Plus:
  3172. Evaluate(x.left,left);
  3173. Evaluate(x.right,right);
  3174. IF leftType IS SyntaxTree.SetType THEN
  3175. InitOperand(result,ModeValue);
  3176. Reuse2a(result.op,left.op,right.op,dest);
  3177. Emit(Or(position,result.op,left.op,right.op));
  3178. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3179. InitOperand(result,ModeValue);
  3180. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3181. Reuse2(result.tag,left.tag,right.tag);
  3182. Emit(Add(position,result.op,left.op,right.op));
  3183. Emit(Add(position,result.tag,left.tag,right.tag))
  3184. ELSE
  3185. InitOperand(result,ModeValue);
  3186. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3187. AddInt(result.op, left.op, right.op) ;
  3188. ELSE
  3189. *)
  3190. Reuse2a(result.op,left.op,right.op,dest);
  3191. Emit(Add(position,result.op,left.op,right.op));
  3192. (*
  3193. END;
  3194. *)
  3195. END;
  3196. ReleaseOperand(left); ReleaseOperand(right);
  3197. |Scanner.Minus:
  3198. Evaluate(x.left,left);
  3199. Evaluate(x.right,right);
  3200. IF leftType IS SyntaxTree.SetType THEN
  3201. InitOperand(result,ModeValue);
  3202. Reuse1(result.op,right.op);
  3203. Emit(Not(position,result.op,right.op));
  3204. ReleaseOperand(right);
  3205. Emit(And(position,result.op,result.op,left.op));
  3206. ReleaseOperand(left);
  3207. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3208. InitOperand(result,ModeValue);
  3209. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3210. Reuse2(result.tag,left.tag,right.tag);
  3211. Emit(Sub(position,result.op,left.op,right.op));
  3212. Emit(Sub(position,result.tag,left.tag,right.tag));
  3213. ReleaseOperand(left); ReleaseOperand(right)
  3214. ELSE
  3215. InitOperand(result,ModeValue);
  3216. Reuse2a(result.op,left.op,right.op,dest);
  3217. Emit(Sub(position,result.op,left.op,right.op));
  3218. ReleaseOperand(left); ReleaseOperand(right);
  3219. END;
  3220. |Scanner.Times:
  3221. Evaluate(x.left,left);
  3222. Evaluate(x.right,right);
  3223. IF leftType IS SyntaxTree.SetType THEN
  3224. InitOperand(result,ModeValue);
  3225. Reuse2a(result.op,left.op,right.op,dest);
  3226. Emit(And(position,result.op,left.op,right.op));
  3227. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3228. InitOperand(result, ModeValue);
  3229. componentType := left.op.type;
  3230. (* TODO: review this *)
  3231. (*
  3232. result.op = left.op * right.op - left.tag * right.tag
  3233. result.tag = left.tag * right.op + left.op * right.tag
  3234. *)
  3235. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3236. Emit(Mul(position,result.op, left.op, right.op));
  3237. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3238. Emit(Mul(position,tempReg, left.tag, right.tag));
  3239. Emit(Sub(position,result.op, result.op, tempReg));
  3240. Reuse2(result.tag, left.tag, right.op);
  3241. Emit(Mul(position,result.tag, left.tag, right.op));
  3242. Emit(Mul(position,tempReg, left.op, right.tag));
  3243. Emit(Add(position,result.tag, result.tag, tempReg));
  3244. ReleaseIntermediateOperand(tempReg)
  3245. ELSE
  3246. InitOperand(result,ModeValue);
  3247. Reuse2a(result.op,left.op,right.op,dest);
  3248. Emit(Mul(position,result.op,left.op,right.op));
  3249. END;
  3250. ReleaseOperand(left); ReleaseOperand(right);
  3251. |Scanner.Div:
  3252. Evaluate(x.left,left);
  3253. Evaluate(x.right,right);
  3254. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3255. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3256. IF ~isUnchecked THEN
  3257. exit := NewLabel();
  3258. BrltL(exit,zero,right.op);
  3259. EmitTrap(position,NegativeDivisorTrap);
  3260. SetLabel(exit);
  3261. END;
  3262. END;
  3263. InitOperand(result,ModeValue);
  3264. Reuse2a(result.op,left.op,right.op,dest);
  3265. Emit(Div(position,result.op,left.op,right.op));
  3266. ReleaseOperand(left); ReleaseOperand(right);
  3267. |Scanner.Mod:
  3268. Evaluate(x.left,left);
  3269. Evaluate(x.right,right);
  3270. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3271. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3272. IF ~isUnchecked THEN
  3273. exit := NewLabel();
  3274. BrltL(exit,zero,right.op);
  3275. EmitTrap(position,NegativeDivisorTrap);
  3276. SetLabel(exit);
  3277. END;
  3278. END;
  3279. InitOperand(result,ModeValue);
  3280. Reuse2a(result.op,left.op,right.op,dest);
  3281. Emit(Mod(position,result.op,left.op,right.op));
  3282. ReleaseOperand(left); ReleaseOperand(right);
  3283. |Scanner.Slash:
  3284. Evaluate(x.left,left);
  3285. Evaluate(x.right,right);
  3286. IF leftType IS SyntaxTree.SetType THEN
  3287. InitOperand(result,ModeValue);
  3288. Reuse2a(result.op,left.op,right.op,dest);
  3289. Emit(Xor(position,result.op,left.op,right.op));
  3290. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3291. InitOperand(result,ModeValue);
  3292. componentType := left.op.type;
  3293. (* review this *)
  3294. (*
  3295. divisor = right.op * right.op + right.tag * right.tag
  3296. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3297. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3298. *)
  3299. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3300. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3301. Emit(Mul(position,tempReg, right.op, right.op));
  3302. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3303. Emit(Add(position,tempReg, tempReg, tempReg2));
  3304. result.op := tempReg2;
  3305. Emit(Mul(position,result.op, left.op, right.op));
  3306. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3307. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3308. Emit(Add(position,result.op, result.op, tempReg2));
  3309. Emit(Div(position,result.op, result.op, tempReg));
  3310. Reuse2(result.tag, left.tag, right.op);
  3311. Emit(Mul(position,result.tag, left.tag, right.op));
  3312. Emit(Mul(position,tempReg2, left.op, right.tag));
  3313. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3314. Emit(Div(position,result.tag, result.tag, tempReg));
  3315. ReleaseIntermediateOperand(tempReg);
  3316. ReleaseIntermediateOperand(tempReg2)
  3317. ELSE
  3318. InitOperand(result,ModeValue);
  3319. Reuse2a(result.op,left.op,right.op,dest);
  3320. Emit(Div(position,result.op,left.op,right.op));
  3321. END;
  3322. ReleaseOperand(left); ReleaseOperand(right);
  3323. |Scanner.Equal:
  3324. IF ~conditional THEN ConditionToValue(x);
  3325. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3326. CompareString(BreqL,x.left,x.right);
  3327. ELSE
  3328. Evaluate(x.left,left);
  3329. Evaluate(x.right,right);
  3330. IF leftType IS SyntaxTree.RangeType THEN
  3331. ASSERT(rightType IS SyntaxTree.RangeType);
  3332. BrneL(falseLabel, left.op, right.op); (* first *)
  3333. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3334. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3335. ReleaseOperand(left); ReleaseOperand(right);
  3336. BrL(trueLabel)
  3337. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3338. BrneL(falseLabel, left.op, right.op); (* first *)
  3339. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3340. ReleaseOperand(left); ReleaseOperand(right);
  3341. BrL(trueLabel)
  3342. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3343. (* TODO: review this *)
  3344. BrneL(falseLabel, left.op, right.op); (* real part *)
  3345. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3346. ReleaseOperand(left); ReleaseOperand(right);
  3347. BrL(trueLabel)
  3348. ELSE
  3349. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3350. ReleaseOperand(left); ReleaseOperand(right);
  3351. BrL(trueLabel);
  3352. END;
  3353. END;
  3354. |Scanner.LessEqual:
  3355. IF ~conditional THEN ConditionToValue(x);
  3356. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3357. CompareString(BrgeL,x.right,x.left);
  3358. ELSE
  3359. Evaluate(x.left,left);
  3360. Evaluate(x.right,right);
  3361. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3362. Reuse1(temp.op,right.op);
  3363. Emit(And(position,temp.op,left.op,right.op));
  3364. ReleaseOperand(right);
  3365. BreqL(trueLabel,temp.op,left.op);
  3366. BrL(falseLabel);
  3367. ReleaseOperand(temp);ReleaseOperand(left);
  3368. ELSE
  3369. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3370. ReleaseOperand(left); ReleaseOperand(right);
  3371. BrL(trueLabel);
  3372. END;
  3373. END;
  3374. |Scanner.Less:
  3375. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3376. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3377. leftExpression.SetType(system.booleanType);
  3378. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3379. rightExpression.SetType(system.booleanType);
  3380. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3381. leftExpression.SetType(system.booleanType);
  3382. Expression(leftExpression);
  3383. ELSIF ~conditional THEN ConditionToValue(x);
  3384. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3385. CompareString(BrltL,x.left,x.right);
  3386. ELSE
  3387. Evaluate(x.left,left);
  3388. Evaluate(x.right,right);
  3389. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3390. ReleaseOperand(left); ReleaseOperand(right);
  3391. BrL(trueLabel);
  3392. END;
  3393. |Scanner.Greater:
  3394. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3395. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3396. leftExpression.SetType(system.booleanType);
  3397. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3398. rightExpression.SetType(system.booleanType);
  3399. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3400. leftExpression.SetType(system.booleanType);
  3401. Expression(leftExpression);
  3402. ELSIF ~conditional THEN ConditionToValue(x);
  3403. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3404. CompareString(BrltL,x.right,x.left);
  3405. ELSE
  3406. Evaluate(x.left,left);
  3407. Evaluate(x.right,right);
  3408. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3409. ReleaseOperand(left); ReleaseOperand(right);
  3410. BrL(trueLabel);
  3411. END;
  3412. |Scanner.GreaterEqual:
  3413. IF ~conditional THEN ConditionToValue(x);
  3414. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3415. CompareString(BrgeL,x.left,x.right);
  3416. ELSE
  3417. Evaluate(x.left,left);
  3418. Evaluate(x.right,right);
  3419. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3420. Reuse1(temp.op,left.op);
  3421. Emit(And(position,temp.op,left.op,right.op));
  3422. ReleaseOperand(left);
  3423. BreqL(trueLabel, temp.op,right.op);
  3424. ReleaseOperand(temp); ReleaseOperand(right);
  3425. BrL(falseLabel);
  3426. ELSE
  3427. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3428. ReleaseOperand(left); ReleaseOperand(right);
  3429. BrL(trueLabel);
  3430. END;
  3431. END;
  3432. |Scanner.Unequal:
  3433. IF ~conditional THEN ConditionToValue(x);
  3434. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3435. CompareString(BrneL,x.left,x.right);
  3436. ELSE
  3437. Evaluate(x.left,left);
  3438. Evaluate(x.right,right);
  3439. IF leftType IS SyntaxTree.RangeType THEN
  3440. ASSERT(rightType IS SyntaxTree.RangeType);
  3441. BrneL(trueLabel, left.op, right.op); (* first *)
  3442. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3443. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3444. ReleaseOperand(left); ReleaseOperand(right);
  3445. BrL(falseLabel)
  3446. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3447. BrneL(trueLabel, left.op, right.op); (* first *)
  3448. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3449. ReleaseOperand(left); ReleaseOperand(right);
  3450. BrL(falseLabel)
  3451. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3452. (* TODO: review this *)
  3453. BrneL(trueLabel, left.op, right.op); (* real part *)
  3454. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3455. ReleaseOperand(left); ReleaseOperand(right);
  3456. BrL(falseLabel)
  3457. ELSE
  3458. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3459. ReleaseOperand(left); ReleaseOperand(right);
  3460. BrL(trueLabel);
  3461. END;
  3462. END;
  3463. |Scanner.In:
  3464. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3465. Evaluate(x.left,left);
  3466. Evaluate(x.right,right);
  3467. Convert(left.op,setType);
  3468. Convert(right.op,setType);
  3469. ReuseCopy(temp.op,right.op);
  3470. Emit(Shr(position,temp.op,temp.op,left.op));
  3471. ReleaseOperand(right); ReleaseOperand(left);
  3472. IntermediateCode.InitImmediate(one,setType,1);
  3473. Emit(And(position,temp.op,temp.op,one));
  3474. IF conditional THEN
  3475. IntermediateCode.InitImmediate(zero,setType,0);
  3476. BrneL(trueLabel,temp.op,zero);
  3477. ReleaseOperand(temp);
  3478. BrL(falseLabel);
  3479. ELSE
  3480. Convert(temp.op,bool);
  3481. result.mode := ModeValue;
  3482. result.op := temp.op;
  3483. result.tag := nil; (* may be left over from calls to evaluate *)
  3484. END;
  3485. ELSE
  3486. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3487. IF x.operator = Scanner.Questionmarks THEN
  3488. leftExpression := x.left;
  3489. rightExpression := x.right;
  3490. ELSE
  3491. leftExpression := x.right;
  3492. rightExpression := x.left;
  3493. END;
  3494. Evaluate(leftExpression, left);
  3495. Emit(Push(position,left.op));
  3496. ReleaseOperand(left);
  3497. Designate(rightExpression, right);
  3498. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3499. IF ~backend.cellsAreObjects THEN
  3500. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3501. END;
  3502. Emit(Push(position,right.op));
  3503. ReleaseOperand(right);
  3504. IF backend.cellsAreObjects THEN
  3505. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3506. ELSE
  3507. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3508. END;
  3509. InitOperand(result, ModeValue);
  3510. result.op := NewRegisterOperand(bool);
  3511. Emit(Result(position,result.op));
  3512. IF conditional THEN
  3513. IntermediateCode.InitImmediate(zero,setType,0);
  3514. BrneL(trueLabel,result.op,zero);
  3515. ReleaseOperand(result);
  3516. BrL(falseLabel);
  3517. END;
  3518. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3519. leftExpression := x.left;
  3520. rightExpression := x.right;
  3521. Evaluate(leftExpression, left);
  3522. Emit(Push(position,left.op));
  3523. ReleaseOperand(left);
  3524. Evaluate(rightExpression, right);
  3525. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3526. IF ~backend.cellsAreObjects THEN
  3527. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3528. END;
  3529. Emit(Push(position,right.op));
  3530. ReleaseOperand(right);
  3531. IF backend.cellsAreObjects THEN
  3532. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3533. ELSE
  3534. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3535. END;
  3536. InitOperand(result, ModeValue);
  3537. result.op := NewRegisterOperand(bool);
  3538. Emit(Result(position,result.op));
  3539. IF conditional THEN
  3540. IntermediateCode.InitImmediate(zero,setType,0);
  3541. BrneL(trueLabel,result.op,zero);
  3542. ReleaseOperand(result);
  3543. BrL(falseLabel);
  3544. END;
  3545. ELSE
  3546. HALT(100);
  3547. END;
  3548. END;
  3549. destination := dest;
  3550. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3551. END VisitBinaryExpression;
  3552. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3553. VAR localResult, operand: Operand;
  3554. BEGIN
  3555. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3556. InitOperand(localResult, ModeValue);
  3557. ASSERT(x.first # NIL);
  3558. Evaluate(x.first, operand);
  3559. localResult.op := operand.op;
  3560. ReleaseOperand(operand);
  3561. UseIntermediateOperand(localResult.op);
  3562. ASSERT(x.last # NIL);
  3563. Evaluate(x.last, operand);
  3564. localResult.tag := operand.op;
  3565. ReleaseOperand(operand);
  3566. UseIntermediateOperand(localResult.tag);
  3567. IF x.step # NIL THEN
  3568. Evaluate(x.step, operand);
  3569. localResult.extra := operand.op;
  3570. ReleaseOperand(operand);
  3571. UseIntermediateOperand(localResult.extra);
  3572. END;
  3573. result := localResult;
  3574. IF Trace THEN TraceExit("VisitRangeExpression") END
  3575. END VisitRangeExpression;
  3576. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3577. BEGIN
  3578. HALT(100); (* should never be evaluated *)
  3579. END VisitTensorRangeExpression;
  3580. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3581. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3582. BEGIN
  3583. IF Trace THEN TraceEnter("VisitConversion") END;
  3584. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3585. dest := destination; destination := emptyOperand;
  3586. Evaluate(x.expression,old);
  3587. InitOperand(result,ModeValue);
  3588. result.op := old.op;
  3589. ASSERT(result.op.mode # 0);
  3590. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3591. (* convert TO a complex number *)
  3592. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3593. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3594. ASSERT(result.op.mode # 0);
  3595. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3596. (* convert FROM a complex number TO a complex number*)
  3597. result.tag := old.tag;
  3598. ASSERT(result.tag.mode # 0);
  3599. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3600. ASSERT(result.tag.mode # 0)
  3601. ELSE
  3602. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3603. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3604. END
  3605. ELSE
  3606. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3607. ASSERT(result.op.mode # 0);
  3608. result.tag := old.tag; (*! probably never used *)
  3609. END;
  3610. destination := dest;
  3611. IF Trace THEN TraceExit("VisitConversion") END;
  3612. END VisitConversion;
  3613. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3614. BEGIN
  3615. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3616. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3617. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3618. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3619. END VisitTypeDeclaration;
  3620. (** designators (expressions) *)
  3621. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3622. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3623. BEGIN
  3624. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3625. IF x.left # NIL THEN Expression(x.left) END;
  3626. Symbol(x.symbol,result);
  3627. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3628. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3629. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3630. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3631. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3632. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3633. END;
  3634. END;
  3635. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3636. END VisitSymbolDesignator;
  3637. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3638. BEGIN
  3639. IF isUnchecked THEN RETURN END;
  3640. IF tagsAvailable THEN
  3641. TrapC(BrltL,index,length,IndexCheckTrap);
  3642. END;
  3643. END BoundCheck;
  3644. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3645. VAR d: IntermediateCode.Operand;
  3646. BEGIN
  3647. IF isUnchecked THEN RETURN END;
  3648. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3649. TrapC(op,dim,d,ArraySizeTrap);
  3650. ReleaseIntermediateOperand(d);
  3651. END DimensionCheck;
  3652. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3653. VAR
  3654. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3655. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3656. expression: SyntaxTree.Expression;
  3657. resultingType, leftType, baseType: SyntaxTree.Type;
  3658. skipLabel1: Label;
  3659. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3660. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3661. variableOp: Operand;
  3662. variable: SyntaxTree.Variable;
  3663. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3664. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3665. VAR e: SyntaxTree.Expression; i: LONGINT;
  3666. BEGIN
  3667. tensorFound := FALSE;
  3668. FOR i := 0 TO parameters.Length()-1 DO
  3669. e := parameters.GetExpression(i);
  3670. IF e IS SyntaxTree.TensorRangeExpression THEN
  3671. ASSERT(~tensorFound);
  3672. tensorFound := TRUE;
  3673. ELSIF e IS SyntaxTree.RangeExpression THEN
  3674. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3675. ELSE
  3676. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3677. END;
  3678. END;
  3679. END CountIndices;
  3680. BEGIN
  3681. ASSERT(tagsAvailable);
  3682. resultingType := x.type.resolved; (* resulting type *)
  3683. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3684. InitOperand(localResult, ModeReference);
  3685. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3686. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3687. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3688. (* a globally defined array destination tag is available -> use and invalidate it*)
  3689. localResult.tag := arrayDestinationTag;
  3690. IntermediateCode.InitOperand(arrayDestinationTag)
  3691. ELSE
  3692. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3693. (* the result is of array range type and thus does not provide any collectable pointers *)
  3694. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3695. Symbol(variable, variableOp);
  3696. ReuseCopy(localResult.tag, variableOp.op);
  3697. ReleaseOperand(variableOp);
  3698. END
  3699. END;
  3700. indexListSize := x.parameters.Length();
  3701. CountIndices(x.parameters);
  3702. (*ASSERT(tensorRangeCount <= 1);*)
  3703. (* designate the array to be indexed over, perform tensor range check if known *)
  3704. Designate(x.left, array);
  3705. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3706. Dereference(array, leftType,FALSE);
  3707. IF ~tensorFound THEN
  3708. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3709. END
  3710. END;
  3711. (* default base offset *)
  3712. srcDimOffset := 0;
  3713. destDimOffset := 0;
  3714. indexDim := 0;
  3715. (* use address of source array as basis *)
  3716. localResult.op := array.op;
  3717. UseIntermediateOperand(localResult.op);
  3718. (* go through the index list *)
  3719. FOR i := 0 TO indexListSize - 1 DO
  3720. expression := x.parameters.GetExpression(i);
  3721. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3722. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3723. srcDimOffset := -indexListSize;
  3724. destDimOffset := -suffixRanges;
  3725. ELSE
  3726. (* determine which dimension of source array is currently looked at *)
  3727. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3728. (* get the memory operand pointing to array descriptor dimension *)
  3729. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3730. (* make a reusable register from it *)
  3731. ReuseCopy(srcDim, tmp);
  3732. ReleaseIntermediateOperand(tmp);
  3733. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3734. ELSE
  3735. srcDim := IntermediateCode.Immediate(sizeType, i);
  3736. END;
  3737. (* get length and increment of source array for current dimension *)
  3738. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3739. Convert(sourceLength.op, sizeType);
  3740. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3741. Convert(sourceIncrement.op, sizeType);
  3742. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3743. ReleaseIntermediateOperand(srcDim);
  3744. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3745. (* SINGLE INDEX *)
  3746. Evaluate(expression, index);
  3747. ReleaseIntermediateOperand(index.tag);
  3748. index.tag := emptyOperand;
  3749. Convert(index.op, sizeType);
  3750. (* lower bound check *)
  3751. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3752. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3753. ELSIF isUnchecked THEN (* do nothing *)
  3754. ELSE
  3755. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3756. END;
  3757. (* upper bound check *)
  3758. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3759. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3760. ELSIF isUnchecked THEN (* do nothing *)
  3761. ELSE
  3762. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3763. END;
  3764. ReleaseOperand(sourceLength);
  3765. Convert(index.op, addressType);
  3766. summand := index.op;
  3767. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3768. (* RANGE OF INDICES *)
  3769. Evaluate(expression, range);
  3770. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3771. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3772. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3773. ReleaseOperand(range);
  3774. Convert(firstIndex, sizeType);
  3775. Convert(lastIndex, sizeType);
  3776. Convert(stepSize, sizeType);
  3777. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3778. if it is 'MAX(LONGINT)' *)
  3779. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3780. TransferToRegister(lastIndex, lastIndex);
  3781. skipLabel1 := NewLabel();
  3782. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3783. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3784. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3785. SetLabel(skipLabel1)
  3786. END;
  3787. (* check if step size is valid *)
  3788. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3789. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3790. ELSIF isUnchecked THEN (* do nothing *)
  3791. ELSE
  3792. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3793. END;
  3794. (* check lower bound check *)
  3795. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3796. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3797. ELSIF isUnchecked THEN (* do nothing *)
  3798. ELSE
  3799. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3800. END;
  3801. (* check upper bound check *)
  3802. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3803. (* statically open range: nothing to do *)
  3804. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3805. ASSERT(staticLastIndex < staticSourceLength)
  3806. ELSIF isUnchecked THEN (* do nothing *)
  3807. ELSE
  3808. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3809. END;
  3810. (* determine length of target array for current dimension *)
  3811. (* 1. incorporate last index: *)
  3812. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3813. (* last index is static *)
  3814. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3815. targetLength := sourceLength.op
  3816. ELSE
  3817. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3818. END;
  3819. UseIntermediateOperand(targetLength);
  3820. ELSE
  3821. (* targetLength := lastIndex + 1
  3822. Reuse1(targetLength, lastIndex);
  3823. *)
  3824. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3825. END;
  3826. ReleaseOperand(sourceLength);
  3827. ReleaseIntermediateOperand(lastIndex);
  3828. (* 2. incorporate first index: *)
  3829. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3830. (* first index and current target length are static *)
  3831. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3832. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3833. (* first index = 0: nothing to do *)
  3834. ELSE
  3835. (* targetLength := targetLength - firstIndex *)
  3836. TransferToRegister(targetLength, targetLength);
  3837. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3838. END;
  3839. (* clip negative lengths to 0 *)
  3840. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3841. IF staticTargetLength < 0 THEN
  3842. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3843. END
  3844. ELSE
  3845. skipLabel1 := NewLabel();
  3846. TransferToRegister(targetLength, targetLength);
  3847. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3848. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3849. SetLabel(skipLabel1)
  3850. END;
  3851. (* 3. incorporate index step size: *)
  3852. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3853. (*step size and current target length are static *)
  3854. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3855. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3856. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3857. (* step size = 1: nothing to do *)
  3858. ELSE
  3859. (* emit code for this:
  3860. targetLength := (targetLength-1) DIV stepSize +1;
  3861. *)
  3862. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3863. DivInt(targetLength, targetLength, stepSize);
  3864. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3865. END;
  3866. (* determine increment of target array for current dimension *)
  3867. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3868. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3869. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3870. (* step size = 1 *)
  3871. targetIncrement := sourceIncrement.op;
  3872. UseIntermediateOperand(targetIncrement)
  3873. ELSE
  3874. (* targetIncrement := sourceIncrement * stepSize *)
  3875. Reuse1(targetIncrement, stepSize);
  3876. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3877. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3878. END;
  3879. ReleaseIntermediateOperand(stepSize);
  3880. (* write length and increment of target array to descriptor *)
  3881. IF destDimOffset < 0 THEN
  3882. (* determine which dimension of target array is currently looked at *)
  3883. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3884. TransferToRegister(destDim, tmp);
  3885. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3886. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3887. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3888. ReleaseIntermediateOperand(destDim);
  3889. INC(destDimOffset);
  3890. ELSE
  3891. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3892. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3893. END;
  3894. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3895. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3896. INC(indexDim);
  3897. Convert(firstIndex, addressType);
  3898. TransferToRegister(summand, firstIndex);
  3899. ELSE HALT(100);
  3900. END;
  3901. (*
  3902. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3903. *)
  3904. Convert(sourceIncrement.op, addressType);
  3905. Convert(summand, addressType);
  3906. MulInt(summand, summand, sourceIncrement.op);
  3907. ReleaseIntermediateOperand(sourceIncrement.op);
  3908. AddInt(localResult.op, localResult.op, summand);
  3909. ReleaseIntermediateOperand(summand);
  3910. END
  3911. END;
  3912. result := localResult;
  3913. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3914. ReleaseIntermediateOperand(result.tag);
  3915. result.tag := TypeDescriptorAdr(resultingType);
  3916. ELSIF IsDelegate(resultingType) THEN
  3917. ReleaseIntermediateOperand(result.tag);
  3918. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3919. UseIntermediateOperand(result.tag);
  3920. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3921. ReleaseIntermediateOperand(result.tag);
  3922. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3923. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3924. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3925. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3926. (* finalize target array descriptor *)
  3927. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3928. (* write lengths and increments of target array for remaining dimensions *)
  3929. i := indexListSize;
  3930. WHILE indexDim < targetArrayDimensionality DO
  3931. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3932. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3933. ReleaseOperand(sourceLength);
  3934. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3935. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3936. ReleaseOperand(sourceIncrement);
  3937. INC(i); INC(indexDim);
  3938. END;
  3939. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3940. tmp := nil;
  3941. ELSE
  3942. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3943. END;
  3944. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3945. ReleaseIntermediateOperand(tmp);
  3946. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3947. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3948. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3949. ELSE
  3950. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3951. END;
  3952. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3953. ReleaseIntermediateOperand(tmp);
  3954. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3955. (* write dimensionality *)
  3956. IF targetArrayDimensionality # 0 THEN
  3957. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3958. END;
  3959. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3960. END;
  3961. ReleaseOperand(array);
  3962. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3963. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3964. END;
  3965. END MathIndexDesignator;
  3966. (* get the length of an array , trying to make use of static information *)
  3967. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3968. VAR res: IntermediateCode.Operand; size: LONGINT;
  3969. BEGIN
  3970. type := type.resolved;
  3971. IF type IS SyntaxTree.ArrayType THEN
  3972. WITH type: SyntaxTree.ArrayType DO
  3973. IF type.form = SyntaxTree.Static THEN
  3974. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3975. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3976. Evaluate(type.length, op);
  3977. ReleaseIntermediateOperand(op.tag);
  3978. RETURN op.op;*)
  3979. ELSE
  3980. res := tag;
  3981. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3982. IntermediateCode.MakeMemory(res,addressType);
  3983. UseIntermediateOperand(res);
  3984. RETURN res
  3985. END
  3986. END;
  3987. ELSE
  3988. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3989. RETURN IntermediateCode.Immediate(addressType,size);
  3990. END;
  3991. END ArrayLength;
  3992. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  3993. BEGIN
  3994. IF IsImmediate(x) THEN
  3995. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  3996. ELSE
  3997. IF ~ReusableRegister(res) THEN
  3998. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3999. ELSE
  4000. UseIntermediateOperand(res);
  4001. END;
  4002. Emit(Mov(position,res,x))
  4003. END;
  4004. END CopyInt;
  4005. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4006. BEGIN
  4007. ReleaseIntermediateOperand(res);
  4008. IF IsImmediate(x) & IsImmediate(y) THEN
  4009. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4010. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4011. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4012. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4013. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4014. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4015. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4016. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4017. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4018. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4019. UseIntermediateOperand(res);
  4020. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4021. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4022. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4023. UseIntermediateOperand(res);
  4024. ELSE
  4025. IF ~ReusableRegister(res) THEN
  4026. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4027. ELSE
  4028. UseIntermediateOperand(res);
  4029. END;
  4030. IF IsImmediate(x) & (x.intValue = 0) THEN
  4031. Emit(Mov(position,res,y))
  4032. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4033. Emit(Mov(position,res,x))
  4034. ELSE
  4035. Emit(Add(position,res, x, y));
  4036. END;
  4037. END;
  4038. END AddInt;
  4039. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4040. BEGIN
  4041. ReleaseIntermediateOperand(res);
  4042. IF IsImmediate(x) & IsImmediate(y) THEN
  4043. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4044. ELSE
  4045. IF ~ReusableRegister(res) THEN
  4046. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4047. ELSE UseIntermediateOperand(res);
  4048. END;
  4049. IF IsImmediate(x) & (x.intValue = 1) THEN
  4050. Emit(Mov(position,res,y))
  4051. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4052. Emit(Mov(position,res,x))
  4053. ELSE
  4054. Emit(Mul(position,res, x, y));
  4055. END;
  4056. END;
  4057. END MulInt;
  4058. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4059. BEGIN
  4060. ReleaseIntermediateOperand(res);
  4061. IF IsImmediate(x) & IsImmediate(y) THEN
  4062. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4063. ELSE
  4064. IF ~ReusableRegister(res) THEN
  4065. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4066. ELSE UseIntermediateOperand(res);
  4067. END;
  4068. IF IsImmediate(x) & (x.intValue = 1) THEN
  4069. Emit(Mov(position,res,y))
  4070. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4071. Emit(Mov(position,res,x))
  4072. ELSE
  4073. Emit(Div(position,res, x, y));
  4074. END;
  4075. END;
  4076. END DivInt;
  4077. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4078. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4079. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4080. BEGIN
  4081. type := x.left.type.resolved;
  4082. IF type IS SyntaxTree.StringType THEN
  4083. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4084. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4085. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4086. type := atype;
  4087. x.left.SetType(type);
  4088. END;
  4089. IntermediateCode.InitImmediate(res,addressType,0);
  4090. maxDim := x.parameters.Length()-1;
  4091. (*
  4092. computation rule:
  4093. a: ARRAY X,Y,Z OF Element with size S
  4094. a[i,j,k] -->
  4095. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4096. *)
  4097. FOR i := 0 TO maxDim DO
  4098. e := x.parameters.GetExpression(i);
  4099. Evaluate(e,index);
  4100. Convert(index.op,addressType);
  4101. AddInt(res, res, index.op);
  4102. IF i = 0 THEN
  4103. (*
  4104. ReuseCopy(res, index.op);
  4105. *)
  4106. Designate(x.left,array);
  4107. type := x.left.type.resolved;
  4108. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4109. Dereference(array, type, FALSE);
  4110. END;
  4111. (*
  4112. ELSE AddInt(res, res, index.op);
  4113. *)
  4114. END;
  4115. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4116. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4117. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4118. BoundCheck(index.op, length);
  4119. END;
  4120. ReleaseIntermediateOperand(length);
  4121. END;
  4122. ReleaseOperand(index);
  4123. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4124. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4125. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4126. MulInt(res,res,length);
  4127. END;
  4128. ReleaseIntermediateOperand(length);
  4129. END;
  4130. (* remaining open dimensions -- compute address *)
  4131. i := maxDim+1;
  4132. IF type IS SyntaxTree.ArrayType THEN
  4133. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4134. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4135. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4136. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4137. MulInt(res,res,length);
  4138. END;
  4139. ReleaseIntermediateOperand(length);
  4140. INC(i);
  4141. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4142. END;
  4143. END;
  4144. IF (type IS SyntaxTree.ArrayType) THEN
  4145. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4146. size := StaticSize(system, type);
  4147. IF size # 1 THEN
  4148. length := IntermediateCode.Immediate(addressType,size);
  4149. MulInt(res,res,length);
  4150. END;
  4151. ELSE
  4152. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4153. IF size # 1 THEN
  4154. length := IntermediateCode.Immediate(addressType,size);
  4155. MulInt(res,res,length);
  4156. END;
  4157. END;
  4158. END;
  4159. AddInt(res,res,array.op);
  4160. InitOperand(result,ModeReference);
  4161. result.op := res;
  4162. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4163. ReleaseIntermediateOperand(result.tag);
  4164. result.tag := TypeDescriptorAdr(type);
  4165. ELSIF IsDelegate(type) THEN
  4166. ReleaseIntermediateOperand(result.tag);
  4167. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4168. UseIntermediateOperand(result.tag);
  4169. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4170. ReleaseIntermediateOperand(result.tag);
  4171. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4172. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4173. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4174. END;
  4175. ReleaseOperand(array);
  4176. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4177. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4178. END;
  4179. END IndexDesignator;
  4180. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4181. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4182. BEGIN
  4183. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4184. dest := destination; destination := emptyOperand;
  4185. type := x.left.type.resolved;
  4186. IF type IS SyntaxTree.MathArrayType THEN
  4187. MathIndexDesignator(x);
  4188. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4189. IndexDesignator(x);
  4190. END;
  4191. destination := dest;
  4192. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4193. END VisitIndexDesignator;
  4194. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4195. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4196. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4197. procedure: SyntaxTree.Procedure;
  4198. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4199. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4200. BEGIN
  4201. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4202. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4203. parameters := expression.parameters;
  4204. moduleName := "FoxArrayBase";
  4205. procedureName := "CopyDescriptor";
  4206. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4207. SaveRegisters();ReleaseUsedRegisters(saved);
  4208. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4209. IF procedure = NIL THEN
  4210. s := "procedure ";
  4211. Strings.Append(s,moduleName);
  4212. Strings.Append(s,".");
  4213. Strings.Append(s,procedureName);
  4214. Strings.Append(s," not present");
  4215. Error(position,s);
  4216. ELSE
  4217. (* push address of temporary variable *)
  4218. Symbol(variable,destOperand);
  4219. Emit(Push(position,destOperand.op));
  4220. ReleaseOperand(destOperand);
  4221. (* push src *)
  4222. Evaluate(expression.left,srcOperand);
  4223. (*
  4224. Dereference(srcOperand,expression.type.resolved);
  4225. Emit(Push(position,srcOperand.tag));
  4226. *)
  4227. Emit(Push(position,srcOperand.op));
  4228. ReleaseOperand(srcOperand);
  4229. tensorFound := FALSE;
  4230. FOR i := 0 TO parameters.Length()-1 DO
  4231. e := parameters.GetExpression(i);
  4232. IF e IS SyntaxTree.TensorRangeExpression THEN
  4233. tensorFound := TRUE;
  4234. ELSIF e IS SyntaxTree.RangeExpression THEN
  4235. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4236. ELSE
  4237. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4238. END;
  4239. END;
  4240. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4241. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4242. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4243. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4244. StaticCallOperand(procOp,procedure);
  4245. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4246. ReleaseOperand(procOp);
  4247. END;
  4248. RestoreRegisters(saved);
  4249. END;
  4250. RETURN variable
  4251. END PrepareTensorDescriptor;
  4252. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4253. VAR
  4254. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4255. operand, tmpOperand, variableOp, variable2Op: Operand;
  4256. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4257. variable, variable2: SyntaxTree.Variable;
  4258. dim, i, size: LONGINT;
  4259. (* TODO: needed? *)
  4260. oldArrayDestinationTag: IntermediateCode.Operand;
  4261. oldArrayDestinationDimension: LONGINT;
  4262. position: Position;
  4263. saved: RegisterEntry;
  4264. arrayFlags: SET;
  4265. m, n: LONGINT;
  4266. PROCEDURE Pass(op: IntermediateCode.Operand);
  4267. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4268. BEGIN
  4269. IF numberRegister >= 0 THEN
  4270. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention,op.type,numberRegister));
  4271. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4272. Emit(Mov(position,parameterRegister, op));
  4273. ELSE
  4274. Emit(Push(position,op))
  4275. END
  4276. END Pass;
  4277. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4278. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4279. BEGIN
  4280. formalType := formalType.resolved; actualType := actualType.resolved;
  4281. IF IsOpenArray(formalType)THEN
  4282. IF actualType IS SyntaxTree.StringType THEN
  4283. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4284. RETURN;
  4285. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4286. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4287. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4288. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4289. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4290. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4291. ELSE
  4292. tmp := baseReg;
  4293. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4294. IntermediateCode.MakeMemory(tmp,addressType);
  4295. Pass((tmp));
  4296. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4297. END;
  4298. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4299. END;
  4300. END PushArrayLens;
  4301. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4302. BEGIN
  4303. CASE size OF
  4304. |2: INCL(flags,Size2Flag);
  4305. |3: INCL(flags,Size3Flag);
  4306. |4: INCL(flags,Size4Flag);
  4307. |5: INCL(flags,Size5Flag);
  4308. |6: INCL(flags,Size6Flag);
  4309. |7: INCL(flags,Size7Flag);
  4310. |8: INCL(flags,Size8Flag);
  4311. END;
  4312. END SetSmallArraySizeFlag;
  4313. BEGIN
  4314. IF Trace THEN TraceEnter("PushParameter") END;
  4315. position := expression.position;
  4316. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4317. type := expression.type.resolved;
  4318. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4319. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4320. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4321. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4322. );
  4323. (* TODO: needed? *)
  4324. oldArrayDestinationTag := arrayDestinationTag;
  4325. oldArrayDestinationDimension := arrayDestinationDimension;
  4326. IF IsArrayOfSystemByte(parameter.type) THEN
  4327. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4328. Designate(expression,operand);
  4329. ELSE
  4330. Evaluate(expression, tmpOperand);
  4331. (* array of system byte does not provide any pointers *)
  4332. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4333. Symbol(variable, operand);
  4334. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4335. Emit(Mov(position,tmp, tmpOperand.op));
  4336. ReleaseOperand(tmpOperand);
  4337. END;
  4338. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4339. ReleaseIntermediateOperand(operand.tag);
  4340. operand.tag := tmp;
  4341. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4342. Pass((operand.tag));
  4343. END;
  4344. Pass((operand.op));
  4345. ELSIF IsOpenArray(parameter.type) THEN
  4346. Designate(expression,operand);
  4347. baseReg := operand.tag;
  4348. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4349. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4350. END;
  4351. Pass((operand.op)); (* address of the array *)
  4352. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4353. (* case 1
  4354. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4355. *)
  4356. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4357. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4358. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4359. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4360. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4361. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4362. arrayDestinationTag := sp;
  4363. (* case 1b
  4364. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4365. *)
  4366. IF expression IS SyntaxTree.IndexDesignator THEN
  4367. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4368. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4369. arrayDestinationDimension := dim;
  4370. Designate(expression,operand);
  4371. (* case 1a
  4372. P(...,A,...) push: push array descriptor to stack
  4373. *)
  4374. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4375. Designate(expression,operand);
  4376. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4377. i := 0;
  4378. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4379. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4380. INC(i);
  4381. END;
  4382. type := expression.type.resolved;
  4383. WHILE (i<dim) DO (* remaining static dimensions *)
  4384. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4385. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4386. ReleaseOperand(tmpOperand);
  4387. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4388. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4389. ReleaseOperand(tmpOperand);
  4390. INC(i);
  4391. END;
  4392. dimOp := IntermediateCode.Immediate(addressType,dim);
  4393. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4394. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4395. (* case 1d
  4396. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4397. + case 1e
  4398. P(.. PT() ... );
  4399. *)
  4400. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4401. Designate(expression,operand);
  4402. Dereference(operand,type.resolved,FALSE);
  4403. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4404. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4405. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4406. (* case 1f
  4407. P(...,S,...) push: create array descriptor to S on stack
  4408. case 1g
  4409. P(... PS()...)
  4410. *)
  4411. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4412. Designate(expression,operand);
  4413. FOR i := 0 TO dim-1 DO
  4414. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4415. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4416. ReleaseOperand(tmpOperand);
  4417. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4418. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4419. ReleaseOperand(tmpOperand);
  4420. END;
  4421. (*******
  4422. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4423. *)
  4424. arrayFlags := {StaticFlag};
  4425. IF dim = 1 THEN
  4426. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4427. ReleaseOperand(tmpOperand);
  4428. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4429. m := LONGINT(tmpOperand.op.intValue);
  4430. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4431. ELSIF dim = 2 THEN
  4432. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4433. ReleaseOperand(tmpOperand);
  4434. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4435. m := LONGINT(tmpOperand.op.intValue);
  4436. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4437. ReleaseOperand(tmpOperand);
  4438. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4439. n := LONGINT(tmpOperand.op.intValue);
  4440. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4441. INCL(arrayFlags,SmallMatrixFlag);
  4442. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4443. END;
  4444. END;
  4445. (*******)
  4446. dimOp := IntermediateCode.Immediate(addressType,dim);
  4447. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4448. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4449. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4450. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4451. baseType := SemanticChecker.ArrayBase(type,dim);
  4452. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4453. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4454. ELSE HALT(100);
  4455. END;
  4456. (* case 2
  4457. procedure P([left args], var A: array [*,*] of Type, [right args])
  4458. *)
  4459. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4460. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4461. (* case 2b
  4462. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4463. push: push reference to pushed array descriptor
  4464. post: remove array descriptor.
  4465. *)
  4466. IF expression IS SyntaxTree.IndexDesignator THEN
  4467. descriptorType := GetMathArrayDescriptorType(dim);
  4468. (* range type : no allocation possible, should be untraced *)
  4469. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4470. Symbol(variable,variableOp);
  4471. arrayDestinationTag := variableOp.op;
  4472. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4473. arrayDestinationDimension := dim;
  4474. NeedDescriptor := TRUE;
  4475. Designate(expression,operand);
  4476. Pass((operand.tag));
  4477. NeedDescriptor := FALSE;
  4478. (* case 2a
  4479. P(...,A,...)
  4480. push: push reference to array descriptor on stack
  4481. *)
  4482. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4483. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4484. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4485. INC(i);
  4486. END;
  4487. IF i = dim THEN
  4488. Designate(expression,operand);
  4489. Pass((operand.tag));
  4490. ELSE (* open-static *)
  4491. type := expression.type.resolved;
  4492. descriptorType := GetMathArrayDescriptorType(dim);
  4493. (* static array , cannot be reallocated, untraced !*)
  4494. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4495. Symbol(variable,variableOp);
  4496. arrayDestinationTag := variableOp.op;
  4497. Designate(expression,operand);
  4498. FOR i := 0 TO dim-1 DO
  4499. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4500. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4501. ReleaseOperand(tmpOperand);
  4502. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4503. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4504. ReleaseOperand(tmpOperand);
  4505. END;
  4506. dimOp := IntermediateCode.Immediate(addressType,dim);
  4507. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4508. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4509. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4510. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4511. baseType := SemanticChecker.ArrayBase(type,dim);
  4512. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4513. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4514. Pass((arrayDestinationTag));
  4515. END;
  4516. (* case 2d
  4517. P(...,T,...) push: emit dimension check, push T
  4518. *)
  4519. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4520. Designate(expression,operand);
  4521. Dereference(operand,type.resolved,FALSE);
  4522. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4523. Pass((operand.tag));
  4524. (* case 2f
  4525. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4526. push: push reference to pushed array descriptor
  4527. post: remove array descriptor
  4528. *)
  4529. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4530. descriptorType := GetMathArrayDescriptorType(dim);
  4531. (* static array -- cannot be reallocatated, untraced *)
  4532. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4533. Symbol(variable,variableOp);
  4534. arrayDestinationTag := variableOp.op;
  4535. Designate(expression,operand);
  4536. FOR i := 0 TO dim-1 DO
  4537. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4538. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4539. ReleaseOperand(tmpOperand);
  4540. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4541. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4542. ReleaseOperand(tmpOperand);
  4543. END;
  4544. (*
  4545. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4546. *)
  4547. arrayFlags := {StaticFlag};
  4548. IF dim = 1 THEN
  4549. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4550. ReleaseOperand(tmpOperand);
  4551. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4552. m := LONGINT(tmpOperand.op.intValue);
  4553. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4554. ELSIF dim = 2 THEN
  4555. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4556. ReleaseOperand(tmpOperand);
  4557. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4558. m := LONGINT(tmpOperand.op.intValue);
  4559. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4560. ReleaseOperand(tmpOperand);
  4561. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4562. n := LONGINT(tmpOperand.op.intValue);
  4563. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4564. INCL(arrayFlags,SmallMatrixFlag);
  4565. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4566. END;
  4567. END;
  4568. (*******)
  4569. dimOp := IntermediateCode.Immediate(addressType,dim);
  4570. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4571. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4572. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4573. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4574. baseType := SemanticChecker.ArrayBase(type,dim);
  4575. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4576. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4577. Pass((arrayDestinationTag));
  4578. ELSE HALT(100);
  4579. END;
  4580. (* case 3
  4581. procedure P([left args], [const] A: array [?] of Type, [right args])
  4582. *)
  4583. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4584. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4585. (* case 3b
  4586. P(...,A[a..b,c..d],...)
  4587. *)
  4588. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4589. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4590. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4591. Symbol(variable,variableOp);
  4592. LoadValue(variableOp,system.addressType);
  4593. ELSE
  4594. descriptorType := GetMathArrayDescriptorType(dim);
  4595. (* range -- cannot be reallocated *)
  4596. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4597. Symbol(variable,variableOp);
  4598. END;
  4599. arrayDestinationTag := variableOp.op;
  4600. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4601. arrayDestinationDimension := 0;
  4602. Designate(expression,operand);
  4603. Pass((operand.tag));
  4604. (* case 3a
  4605. P(...,A,...)
  4606. *)
  4607. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4608. i := 0;
  4609. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4610. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4611. INC(i);
  4612. END;
  4613. IF i = dim THEN
  4614. Designate(expression,operand);
  4615. Pass((operand.tag));
  4616. ELSE (* open-static *)
  4617. type := expression.type.resolved;
  4618. descriptorType := GetMathArrayDescriptorType(dim);
  4619. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4620. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4621. Symbol(variable,variableOp);
  4622. arrayDestinationTag := variableOp.op;
  4623. Designate(expression,operand);
  4624. FOR i := 0 TO dim-1 DO
  4625. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4626. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4627. ReleaseOperand(tmpOperand);
  4628. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4629. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4630. ReleaseOperand(tmpOperand);
  4631. END;
  4632. dimOp := IntermediateCode.Immediate(addressType,dim);
  4633. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4634. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4635. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4636. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4637. baseType := SemanticChecker.ArrayBase(type,dim);
  4638. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4639. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4640. Pass((arrayDestinationTag));
  4641. END;
  4642. (* case 3d
  4643. P(...,T,...)
  4644. case 3e
  4645. P(...,PT(...),...)
  4646. *)
  4647. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4648. Designate(expression,operand);
  4649. Dereference(operand,type.resolved,FALSE);
  4650. Pass((operand.tag));
  4651. (* case 3f
  4652. P(...,S,...)
  4653. case 3g
  4654. P(...,PS(...),...)
  4655. *)
  4656. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4657. descriptorType := GetMathArrayDescriptorType(dim);
  4658. (* static array does not need to be traced *)
  4659. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4660. Symbol(variable,variableOp);
  4661. arrayDestinationTag := variableOp.op;
  4662. Designate(expression,operand);
  4663. IF operand.op.type.length >1 THEN (* vector register *)
  4664. (* static array does not need to be traced *)
  4665. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4666. Symbol(variable2, variable2Op);
  4667. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4668. Emit(Mov(position,tmp, operand.op));
  4669. ReleaseOperand(operand);
  4670. Symbol(variable2, operand);
  4671. END;
  4672. FOR i := 0 TO dim-1 DO
  4673. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4674. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4675. ReleaseOperand(tmpOperand);
  4676. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4677. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4678. ReleaseOperand(tmpOperand);
  4679. END;
  4680. dimOp := IntermediateCode.Immediate(addressType,dim);
  4681. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4682. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4683. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4684. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4685. baseType := SemanticChecker.ArrayBase(type,dim);
  4686. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4687. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4688. Pass((arrayDestinationTag));
  4689. ELSE HALT(100);
  4690. END;
  4691. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4692. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4693. (* case 4b
  4694. P(...,A[a..b,c..d],...)
  4695. *)
  4696. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4697. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4698. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4699. Symbol(variable,variableOp);
  4700. LoadValue(variableOp,system.addressType);
  4701. ELSE
  4702. descriptorType := GetMathArrayDescriptorType(dim);
  4703. (* range array -- cannot be allocated *)
  4704. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4705. Symbol(variable,variableOp);
  4706. END;
  4707. arrayDestinationTag := variableOp.op;
  4708. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4709. arrayDestinationDimension := 0;
  4710. Designate(expression,operand);
  4711. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4712. Symbol(variable,variableOp);
  4713. ELSE
  4714. (* alias to range -- untraced *)
  4715. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4716. Symbol(variable,variableOp);
  4717. MakeMemory(tmp,variableOp.op,addressType,0);
  4718. Emit(Mov(position,tmp,operand.tag));
  4719. ReleaseIntermediateOperand(tmp);
  4720. END;
  4721. Pass((variableOp.op));
  4722. ReleaseOperand(variableOp);
  4723. (* case 4a
  4724. P(...,A,...)
  4725. *)
  4726. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4727. i := 0;
  4728. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4729. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4730. INC(i);
  4731. END;
  4732. IF i = dim THEN
  4733. Designate(expression,operand);
  4734. arrayDestinationTag := operand.tag;
  4735. ELSE (* open-static *)
  4736. type := expression.type.resolved;
  4737. descriptorType := GetMathArrayDescriptorType(dim);
  4738. (* static array -- untraced *)
  4739. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4740. Symbol(variable,variableOp);
  4741. arrayDestinationTag := variableOp.op;
  4742. Designate(expression,operand);
  4743. FOR i := 0 TO dim-1 DO
  4744. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4745. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4746. ReleaseOperand(tmpOperand);
  4747. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4748. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4749. ReleaseOperand(tmpOperand);
  4750. END;
  4751. dimOp := IntermediateCode.Immediate(addressType,dim);
  4752. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4753. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4754. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4755. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4756. baseType := SemanticChecker.ArrayBase(type,dim);
  4757. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4758. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4759. END;
  4760. (* tensor alias to open array -- untraced *)
  4761. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4762. Symbol(variable,variableOp);
  4763. MakeMemory(tmp,variableOp.op,addressType,0);
  4764. Emit(Mov(position,tmp,arrayDestinationTag));
  4765. ReleaseIntermediateOperand(tmp);
  4766. Pass((variableOp.op));
  4767. ReleaseOperand(variableOp);
  4768. (* case 4d
  4769. P(...,T,...)
  4770. *)
  4771. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4772. Designate(expression,operand);
  4773. Pass((operand.op));
  4774. (* case 4f
  4775. P(...,S,...)
  4776. *)
  4777. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4778. descriptorType := GetMathArrayDescriptorType(dim);
  4779. (* static array -- cannot be reallocated, untraced *)
  4780. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4781. Symbol(variable,variableOp);
  4782. arrayDestinationTag := variableOp.op;
  4783. Designate(expression,operand);
  4784. FOR i := 0 TO dim-1 DO
  4785. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4786. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4787. ReleaseOperand(tmpOperand);
  4788. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4789. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4790. ReleaseOperand(tmpOperand);
  4791. END;
  4792. dimOp := IntermediateCode.Immediate(addressType,dim);
  4793. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4794. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4795. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4796. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4797. baseType := SemanticChecker.ArrayBase(type,dim);
  4798. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4799. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4800. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4801. Symbol(variable,variableOp);
  4802. MakeMemory(tmp,variableOp.op,addressType,0);
  4803. Emit(Mov(position,tmp,arrayDestinationTag));
  4804. ReleaseIntermediateOperand(tmp);
  4805. Pass((variableOp.op));
  4806. ReleaseOperand(variableOp);
  4807. ELSE HALT(100);
  4808. END;
  4809. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4810. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4811. Designate(expression,operand);
  4812. IF operand.op.type.length > 1 THEN
  4813. Emit(Push(position, operand.op));
  4814. ELSE
  4815. size := system.SizeOf(type);
  4816. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4817. size := ToMemoryUnits(system,size);
  4818. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4819. arrayDestinationTag := sp;
  4820. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4821. END;
  4822. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4823. Designate(expression,operand);
  4824. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4825. (* static array no pointer *)
  4826. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4827. Symbol(variable,variableOp);
  4828. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4829. Emit(Mov(position,tmp,operand.op));
  4830. Emit(Push(position,variableOp.op));
  4831. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4832. Pass((operand.op));
  4833. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4834. END;
  4835. ELSE HALT(200)
  4836. END;
  4837. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4838. IF parameter.kind = SyntaxTree.VarParameter THEN
  4839. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4840. Designate(expression, operand);
  4841. Pass((operand.op));
  4842. ELSE
  4843. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4844. Evaluate(expression, operand);
  4845. Pass((operand.extra)); (* step *)
  4846. Pass((operand.tag)); (* last *)
  4847. Pass((operand.op)) (* first *)
  4848. END
  4849. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4850. IF parameter.kind = SyntaxTree.VarParameter THEN
  4851. Designate(expression, operand);
  4852. Pass((operand.op));
  4853. ELSE
  4854. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4855. Evaluate(expression, operand);
  4856. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  4857. IF (numberRegister > 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  4858. Pass((operand.tag)); (* imaginary part *)
  4859. Pass((operand.op)) (* real part *)
  4860. ELSE
  4861. (* pass complex as a whole in order to comply with the variable alignment of its components *)
  4862. size := ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,parameter.type));
  4863. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4864. tmp := sp;
  4865. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4866. Emit(Mov(position,tmp,operand.op)); (* real part *)
  4867. size := ToMemoryUnits(system,system.AlignmentOf(system.variableAlignment,componentType));
  4868. IntermediateCode.AddOffset(tmp,size);
  4869. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  4870. END
  4871. END
  4872. ELSE
  4873. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4874. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4875. Designate(expression,operand);
  4876. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4877. (* stack allocation *)
  4878. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4879. (*! parameter alignment to be discussed ... *)
  4880. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4881. size := type(SyntaxTree.StringType).length;
  4882. END;
  4883. IF backend.cooperative & parameter.NeedsTrace() THEN
  4884. dst := NewRegisterOperand (addressType);
  4885. Emit(Mov(position,dst, sp));
  4886. IntermediateCode.InitImmediate(null, byteType, 0);
  4887. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4888. ReleaseIntermediateOperand(dst);
  4889. SaveRegisters();ReleaseUsedRegisters(saved);
  4890. (* register dst has been freed before SaveRegisters already *)
  4891. CallAssignMethod(dst, operand.op, parameter.type);
  4892. RestoreRegisters(saved);
  4893. END;
  4894. IF operand.op.type.length > 1 THEN (* vector *)
  4895. MakeMemory(tmp,sp,operand.op.type,0);
  4896. Emit(Mov(position, tmp, operand.op));
  4897. ELSE
  4898. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4899. END;
  4900. ELSIF IsOpenArray(parameter.type) THEN
  4901. Designate(expression,operand);
  4902. baseReg := operand.tag;
  4903. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4904. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4905. END;
  4906. Pass((operand.op)); (* address of the array *)
  4907. ELSIF IsDelegate(parameter.type) THEN
  4908. Evaluate(expression,operand);
  4909. IF backend.cooperative & parameter.NeedsTrace() THEN
  4910. Emit(Push(position, nil));
  4911. dst := NewRegisterOperand (addressType);
  4912. Emit(Mov(position,dst, sp));
  4913. ReleaseIntermediateOperand(dst);
  4914. SaveRegisters();ReleaseUsedRegisters(saved);
  4915. Emit(Push(position, dst));
  4916. (* register dst has been freed before SaveRegisters already *)
  4917. Emit(Push(position, operand.tag));
  4918. CallThis(position,"GarbageCollector","Assign",2);
  4919. RestoreRegisters(saved);
  4920. ELSE
  4921. Pass((operand.tag));
  4922. END;
  4923. Pass((operand.op));
  4924. ELSE
  4925. Evaluate(expression,operand);
  4926. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4927. Emit(Push(position, nil));
  4928. dst := NewRegisterOperand (addressType);
  4929. Emit(Mov(position,dst, sp));
  4930. ReleaseIntermediateOperand(dst);
  4931. SaveRegisters();ReleaseUsedRegisters(saved);
  4932. Emit(Push(position, dst));
  4933. (* register dst has been freed before SaveRegisters already *)
  4934. Emit(Push(position, operand.op));
  4935. CallThis(position,"GarbageCollector","Assign",2);
  4936. RestoreRegisters(saved);
  4937. ELSE
  4938. Pass((operand.op));
  4939. END;
  4940. END;
  4941. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4942. Evaluate(expression,operand);
  4943. Pass((operand.op));
  4944. ELSE (* var parameter *)
  4945. Designate(expression,operand);
  4946. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4947. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4948. Pass((operand.tag));
  4949. END;
  4950. END;
  4951. Pass((operand.op));
  4952. END;
  4953. END;
  4954. (* TODO: needed? *)
  4955. arrayDestinationTag := oldArrayDestinationTag;
  4956. arrayDestinationDimension := oldArrayDestinationDimension;
  4957. IF needsParameterBackup THEN
  4958. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4959. ReuseCopy(parameterBackup, operand.op)
  4960. END;
  4961. ReleaseOperand(operand);
  4962. IF Trace THEN TraceExit("PushParameter") END;
  4963. END PushParameter;
  4964. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  4965. VAR prevConditional: BOOLEAN;
  4966. BEGIN
  4967. prevConditional := conditional;
  4968. conditional := FALSE;
  4969. 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
  4970. Expression(x.result); (* use register *)
  4971. END;
  4972. Statement(x.statement);
  4973. conditional := prevConditional;
  4974. IF x.result # NIL THEN Expression(x.result) END;
  4975. 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
  4976. ReleaseIntermediateOperand(result.op);
  4977. END;
  4978. END VisitStatementDesignator;
  4979. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4980. VAR
  4981. procedure: SyntaxTree.Procedure;
  4982. procedureType: SyntaxTree.ProcedureType;
  4983. wasInline: BOOLEAN;
  4984. actualParameters: SyntaxTree.ExpressionList;
  4985. formalParameter: SyntaxTree.Parameter;
  4986. actualParameter: SyntaxTree.Expression;
  4987. i: LONGINT;
  4988. localVariable: SyntaxTree.Variable;
  4989. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4990. src, dest: Operand;
  4991. prevInlineExit : Label;
  4992. prevMapper: SymbolMapper;
  4993. tooComplex: BOOLEAN;
  4994. resultDesignator: SyntaxTree.Expression;
  4995. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4996. BEGIN
  4997. IF e = NIL THEN RETURN TRUE
  4998. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4999. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5000. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5001. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5002. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5003. ELSE RETURN FALSE
  5004. END;
  5005. END SimpleExpression;
  5006. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5007. BEGIN
  5008. RETURN checker.CanPassInRegister(type)
  5009. END FitsInRegister;
  5010. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5011. VAR
  5012. variable: SyntaxTree.Variable;
  5013. variableDesignator: SyntaxTree.Designator;
  5014. BEGIN
  5015. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5016. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5017. variableDesignator.SetType(type);
  5018. RETURN variableDesignator
  5019. END GetTemp;
  5020. BEGIN
  5021. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5022. wasInline := currentIsInline;
  5023. prevInlineExit := currentInlineExit;
  5024. prevMapper := currentMapper;
  5025. currentInlineExit := NewLabel();
  5026. tooComplex := FALSE;
  5027. NEW(currentMapper);
  5028. currentIsInline := TRUE;
  5029. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5030. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5031. formalParameter := procedureType.firstParameter;
  5032. actualParameters := x.parameters;
  5033. i := 0;
  5034. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5035. actualParameter := actualParameters.GetExpression(i);
  5036. IF actualParameter.resolved # NIL THEN
  5037. actualParameter := actualParameter.resolved
  5038. END;
  5039. (*
  5040. if expression is simple and can be passed immediately
  5041. or if type fits in register then we can proceed
  5042. otherwise we escape to ordinary procedure call.
  5043. *)
  5044. (* cases where the expression can be mapped identically *)
  5045. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5046. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5047. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5048. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5049. (*
  5050. Assign(variableDesignator, actualParameter);
  5051. *)
  5052. Evaluate(actualParameter, src);
  5053. Designate(variableDesignator, dest);
  5054. Emit(Mov(x.position, dest.op, src.op));
  5055. ReleaseOperand(dest);
  5056. ReleaseOperand(src);
  5057. (* the src operand should now have been completely released ! *)
  5058. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5059. ELSE tooComplex := TRUE
  5060. END;
  5061. (*
  5062. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5063. currentMapper.Add(formalParameter, actualParameter, NIL);
  5064. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5065. variableDesignator := GetTemp(system.addressType, FALSE);
  5066. Designate(actualParameter, src);
  5067. Designate(variableDesignator, dest);
  5068. IntermediateCode.MakeMemory(dest.op,addressType);
  5069. Emit(Mov(x.position, dest.op, src.op));
  5070. ReleaseOperand(dest);
  5071. IF src.tag.mode # IntermediateCode.Undefined THEN
  5072. tagDesignator := GetTemp(system.addressType, FALSE);
  5073. Designate(tagDesignator, dest);
  5074. IntermediateCode.MakeMemory(dest.op,addressType);
  5075. Emit(Mov(x.position, dest.op, src.op));
  5076. END;
  5077. ReleaseOperand(dest); ReleaseOperand(src);
  5078. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5079. END;
  5080. *)
  5081. formalParameter := formalParameter.nextParameter;
  5082. INC(i);
  5083. END;
  5084. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5085. IF resultDesignator # NIL THEN
  5086. returnDesignator := resultDesignator
  5087. ELSE
  5088. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5089. END;
  5090. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5091. END;
  5092. localVariable := procedure.procedureScope.firstVariable;
  5093. WHILE ~tooComplex & (localVariable # NIL) DO
  5094. variableDesignator := GetTemp(localVariable.type, FALSE);
  5095. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5096. localVariable := localVariable.nextVariable;
  5097. END;
  5098. IF ~tooComplex THEN
  5099. VisitStatementBlock(procedure.procedureScope.body);
  5100. SetLabel(currentInlineExit);
  5101. IF procedureType.returnType # NIL THEN
  5102. Designate(returnDesignator, result);
  5103. IF conditional THEN
  5104. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  5105. ValueToCondition(result)
  5106. END;
  5107. END;
  5108. END;
  5109. currentMapper := prevMapper;
  5110. currentInlineExit := prevInlineExit;
  5111. currentIsInline := wasInline;
  5112. RETURN ~tooComplex
  5113. END InlineProcedureCall;
  5114. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5115. VAR
  5116. parameters: SyntaxTree.ExpressionList;
  5117. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5118. designator: SyntaxTree.Designator;
  5119. procedureType: SyntaxTree.ProcedureType;
  5120. formalParameter: SyntaxTree.Parameter;
  5121. operand, returnValue: Operand;
  5122. reg, size, mask, dest: IntermediateCode.Operand;
  5123. saved,saved2: RegisterEntry;
  5124. symbol: SyntaxTree.Symbol;
  5125. variable: SyntaxTree.Variable;
  5126. i, parametersSize, returnTypeSize : LONGINT;
  5127. structuredReturnType: BOOLEAN;
  5128. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5129. tempVariableDesignator: SyntaxTree.Designator;
  5130. gap, alignment: LONGINT; (*fld*)
  5131. (* TODO: remove unnecessary backup variables *)
  5132. oldResult: Operand;
  5133. oldCurrentScope: SyntaxTree.Scope;
  5134. oldArrayDestinationTag: IntermediateCode.Operand;
  5135. oldArrayDestinationDimension: LONGINT;
  5136. oldConstantDeclaration: SyntaxTree.Symbol;
  5137. oldDestination: IntermediateCode.Operand;
  5138. oldCurrentLoop: Label;
  5139. oldConditional: BOOLEAN;
  5140. oldTrueLabel, oldFalseLabel: Label;
  5141. oldLocked: BOOLEAN;
  5142. usedRegisters,oldUsedRegisters: RegisterEntry;
  5143. return: IntermediateCode.Operand;
  5144. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5145. arg: IntermediateCode.Operand;
  5146. dummy: IntermediateCode.Operand;
  5147. recordType: SyntaxTree.RecordType;
  5148. operatorSelectionProcedureOperand: Operand;
  5149. operatorSelectionProcedure: SyntaxTree.Procedure;
  5150. fingerPrint: SyntaxTree.FingerPrint;
  5151. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5152. identifierNumber: LONGINT;
  5153. parameterRegisters: SIZE;
  5154. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5155. procedure: SyntaxTree.Procedure;
  5156. callingConvention: SyntaxTree.CallingConvention;
  5157. PROCEDURE BackupGlobalState;
  5158. BEGIN
  5159. oldResult := result;
  5160. oldCurrentScope := currentScope;
  5161. oldArrayDestinationTag := arrayDestinationTag;
  5162. oldArrayDestinationDimension := arrayDestinationDimension;
  5163. oldConstantDeclaration := constantDeclaration;
  5164. oldDestination := destination;
  5165. oldCurrentLoop := currentLoop;
  5166. oldConditional := conditional;
  5167. oldTrueLabel := trueLabel;
  5168. oldFalseLabel := falseLabel;
  5169. oldLocked := locked;
  5170. oldUsedRegisters := usedRegisters
  5171. END BackupGlobalState;
  5172. PROCEDURE RestoreGlobalState;
  5173. BEGIN
  5174. result := oldResult;
  5175. currentScope := oldCurrentScope;
  5176. arrayDestinationTag := oldArrayDestinationTag;
  5177. arrayDestinationDimension := oldArrayDestinationDimension;
  5178. constantDeclaration := oldConstantDeclaration;
  5179. destination := oldDestination;
  5180. currentLoop := oldCurrentLoop;
  5181. conditional := oldConditional;
  5182. trueLabel := oldTrueLabel;
  5183. falseLabel := oldFalseLabel;
  5184. locked := oldLocked;
  5185. usedRegisters := oldUsedRegisters
  5186. END RestoreGlobalState;
  5187. (** do preparations before parameter push for array-structured object types (ASOTs):
  5188. if ASOT is passed as VAR parameter:
  5189. - allocate temporary variable of math array type
  5190. - copy contents of ASOT to be passed to temporary variable
  5191. - use temporary variable as the actual parameter instead
  5192. - 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)
  5193. **)
  5194. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5195. VAR
  5196. expression: SyntaxTree.Expression;
  5197. BEGIN
  5198. IF actualParameter IS SyntaxTree.Designator THEN
  5199. designator := actualParameter(SyntaxTree.Designator);
  5200. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5201. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5202. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5203. ASSERT(checker # NIL);
  5204. checker.SetCurrentScope(currentScope);
  5205. (* allocate temporary variable *)
  5206. ASSERT(actualParameter.type # NIL);
  5207. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5208. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5209. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5210. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5211. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5212. ASSERT(tempVariableDesignator.type # NIL);
  5213. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5214. (* copy math array stored in actual parameter to temporary variable *)
  5215. BackupGlobalState;
  5216. AssignMathArray(tempVariableDesignator, actualParameter);
  5217. RestoreGlobalState;
  5218. (* use temporary variable as actual parameter instead of the original one *)
  5219. actualParameter := tempVariableDesignator;
  5220. (* create write-back call and store it in linked list *)
  5221. (* create new list entry *)
  5222. IF firstWriteBackCall = NIL THEN
  5223. NEW(firstWriteBackCall);
  5224. currentWriteBackCall := firstWriteBackCall
  5225. ELSE
  5226. ASSERT(currentWriteBackCall # NIL);
  5227. NEW(currentWriteBackCall.next);
  5228. currentWriteBackCall := currentWriteBackCall.next
  5229. END;
  5230. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5231. ASSERT(expression.type = NIL);
  5232. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5233. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5234. (* prepare writeback for any other "normal" indexer *)
  5235. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5236. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5237. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5238. Assign(tempVariableDesignator, actualParameter);
  5239. actualParameter := tempVariableDesignator;
  5240. IF firstWriteBackCall = NIL THEN
  5241. NEW(firstWriteBackCall);
  5242. currentWriteBackCall := firstWriteBackCall
  5243. ELSE
  5244. ASSERT(currentWriteBackCall # NIL);
  5245. NEW(currentWriteBackCall.next);
  5246. currentWriteBackCall := currentWriteBackCall.next
  5247. END;
  5248. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5249. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5250. END
  5251. END
  5252. END PrepareParameter;
  5253. BEGIN
  5254. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5255. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5256. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5257. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5258. IF InlineProcedureCall(x) THEN
  5259. RETURN
  5260. ELSE
  5261. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5262. END
  5263. END;
  5264. END;
  5265. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5266. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5267. callingConvention := procedureType.callingConvention;
  5268. dest := destination; destination := emptyOperand;
  5269. SaveRegisters();ReleaseUsedRegisters(saved);
  5270. parameters := x.parameters;
  5271. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5272. (* an operator is called *)
  5273. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5274. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5275. (* check if a dynamic operator call should be performed *)
  5276. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5277. ELSE
  5278. isCallOfDynamicOperator := FALSE
  5279. END;
  5280. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5281. Emit(Push(position, ap));
  5282. END;
  5283. alignment := procedureType.stackAlignment;
  5284. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5285. alignment := 16 (* bytes *);
  5286. END;
  5287. IF alignment > 1 THEN
  5288. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5289. Emit(Mov(position,reg, sp));
  5290. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5291. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5292. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5293. gap := 4*ToMemoryUnits(system,system.addressSize);
  5294. END;
  5295. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5296. gap := gap - 6*ToMemoryUnits(system,system.addressSize); (* the first 6 parameters are passed via registers in SysVABI *)
  5297. IF gap < 0 THEN
  5298. gap := 0
  5299. END;
  5300. ELSE
  5301. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5302. END;
  5303. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5304. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5305. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5306. Emit(And(position,sp, sp, mask));
  5307. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5308. Emit(Push(position,reg));
  5309. ReleaseIntermediateOperand(reg);
  5310. END;
  5311. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5312. (* align stack to 16-byte boundary *)
  5313. IntermediateCode.InitImmediate(mask,addressType,-16);
  5314. Emit(And(position,sp, sp, mask));
  5315. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5316. IF gap # 0 THEN
  5317. IntermediateCode.InitImmediate(size,addressType,gap);
  5318. Emit(Sub(position,sp,sp,size))
  5319. END;
  5320. END;
  5321. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5322. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5323. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5324. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5325. ELSE
  5326. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5327. END;
  5328. Evaluate(x.left, operand);
  5329. IF symbol IS SyntaxTree.Procedure THEN
  5330. IF (procedureType.selfParameter # NIL) THEN
  5331. Emit(Push(position,operand.tag));
  5332. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5333. Emit(Push(position,operand.tag));
  5334. ELSIF (procedureType.isDelegate) THEN
  5335. Emit(Push(position,operand.tag));
  5336. END;
  5337. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5338. IF (procedureType.selfParameter # NIL) THEN
  5339. Emit(Push(position,operand.tag));
  5340. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5341. Emit(Push(position,operand.tag));
  5342. END;
  5343. ELSE HALT(200);
  5344. END;
  5345. ReleaseIntermediateOperand(operand.tag);
  5346. operand.tag := emptyOperand;
  5347. (* determine if a structured return type is needed *)
  5348. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5349. IF structuredReturnType THEN
  5350. IF resultDesignator # NIL THEN
  5351. d := resultDesignator;
  5352. ELSE
  5353. (* temporary result that might be allocated, must potentially be traced *)
  5354. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5355. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5356. d.SetType(variable.type);
  5357. END;
  5358. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5359. Designate(d,returnValue);
  5360. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5361. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5362. Emit(Push(position,size));
  5363. Emit(Push(position,returnValue.op));
  5364. ReleaseOperand(returnValue);
  5365. ELSE*)
  5366. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5367. (*
  5368. END;
  5369. *)
  5370. END;
  5371. firstWriteBackCall := NIL; (* reset write-back call list *)
  5372. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5373. parameterRegisters := backend.NumberParameterRegisters(callingConvention);
  5374. passByRegister := parameterRegisters > 0;
  5375. registerNumber := 0;
  5376. formalParameter := procedureType.lastParameter;
  5377. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5378. actualParameter := parameters.GetExpression(i);
  5379. PrepareParameter(actualParameter, formalParameter);
  5380. IF passByRegister & (i < parameterRegisters) THEN
  5381. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5382. Error(actualParameter.position,"cannot be passed by register")
  5383. ELSE
  5384. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,i);
  5385. END;
  5386. INC(registerNumber);
  5387. ELSE
  5388. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5389. END;
  5390. formalParameter := formalParameter.prevParameter;
  5391. END;
  5392. IF passByRegister (* & (registerNumber > 0)*) & ~(callingConvention IN SysvABI) THEN
  5393. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5394. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5395. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5396. END;
  5397. ELSE
  5398. hasDynamicOperands := FALSE;
  5399. formalParameter := procedureType.firstParameter;
  5400. FOR i := 0 TO parameters.Length() - 1 DO
  5401. actualParameter := parameters.GetExpression(i);
  5402. IF formalParameter # NIL THEN (* TENTATIVE *)
  5403. PrepareParameter(actualParameter, formalParameter);
  5404. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5405. ASSERT(i < 2);
  5406. hasDynamicOperands := TRUE;
  5407. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5408. ELSE
  5409. IF passByRegister & (registerNumber > 0) THEN
  5410. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5411. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5412. END;
  5413. passByRegister := FALSE;
  5414. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5415. END;
  5416. formalParameter := formalParameter.nextParameter;
  5417. END;
  5418. END;
  5419. END;
  5420. IF symbol IS SyntaxTree.Procedure THEN
  5421. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5422. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5423. Emit(Push(position,reg));
  5424. ReleaseIntermediateOperand(reg);
  5425. END;
  5426. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5427. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5428. parametersSize := ParametersSize(system,procedureType, FALSE);
  5429. END;
  5430. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5431. (*
  5432. dynamic operator overloading:
  5433. first push parameters, regularly:
  5434. [self]
  5435. par1
  5436. par2
  5437. then push parameters for GetOperator
  5438. identifier
  5439. ptr1
  5440. tag
  5441. ptr2
  5442. tag
  5443. call GetOperatorRuntimeProc
  5444. call Operator
  5445. *)
  5446. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5447. (* push ID *)
  5448. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5449. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5450. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5451. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5452. formalParameter := procedureType.firstParameter;
  5453. FOR i := 0 TO parameters.Length() - 1 DO
  5454. IF formalParameter.access # SyntaxTree.Hidden THEN
  5455. ASSERT(i < 2);
  5456. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5457. (* push pointer *)
  5458. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5459. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5460. (* add dereference *)
  5461. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5462. (*! better: do refer to stack above than using parameter backups !!*)
  5463. ReleaseIntermediateOperand(parameterBackups[i]);
  5464. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5465. END;
  5466. Emit(Push(position,parameterBackups[i]));
  5467. ReleaseIntermediateOperand(parameterBackups[i]);
  5468. (* push typetag *)
  5469. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5470. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5471. arg := TypeDescriptorAdr(recordType);
  5472. Emit(Push(position,arg));
  5473. ELSE
  5474. (* push 'NonPointer' *)
  5475. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5476. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5477. (* push fingerprint *)
  5478. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5479. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5480. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5481. END
  5482. END;
  5483. formalParameter := formalParameter.nextParameter
  5484. END;
  5485. (* for unary operators: complete the information for the second parameter *)
  5486. IF procedureType.numberParameters < 2 THEN
  5487. (* push 'NonPointer' *)
  5488. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5489. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5490. (* push 'NoType' *)
  5491. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5492. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5493. END;
  5494. (* call operator selection procedure *)
  5495. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5496. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5497. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5498. ReleaseOperand(operatorSelectionProcedureOperand);
  5499. (* use the address that the operator selection procedure returned as the target address of the call *)
  5500. InitOperand(operand, ModeValue);
  5501. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5502. Emit(Result(position,operand.op))
  5503. END
  5504. END;
  5505. ReleaseParameterRegisters();
  5506. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5507. SaveRegisters();ReleaseUsedRegisters(saved2);
  5508. CallThis(position,"Objects","LeaveA2",0);
  5509. RestoreRegisters(saved2);
  5510. END;
  5511. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5512. Emit(Call(position,operand.op,0));
  5513. ELSE
  5514. Emit(Call(position,operand.op,parametersSize));
  5515. END;
  5516. ReleaseOperand(operand);
  5517. IF procedureType.noReturn THEN
  5518. EmitTrap(position,NoReturnTrap);
  5519. END;
  5520. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5521. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5522. Emit(Result(position,return));
  5523. END;
  5524. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5525. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5526. Emit(Push(position, return));
  5527. CallThis(position,"Objects","ReenterA2",0);
  5528. Emit(Pop(position, return));
  5529. ELSE
  5530. CallThis(position,"Objects","ReenterA2",0);
  5531. END;
  5532. END;
  5533. (* === return parameter space === *)
  5534. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5535. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5536. (* cleanup all space for all parameters *)
  5537. IF parametersSize < 32 THEN
  5538. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5539. parametersSize := 32
  5540. END;
  5541. size := IntermediateCode.Immediate(addressType,parametersSize);
  5542. Emit(Add(position,sp,sp,size))
  5543. END;
  5544. IF (callingConvention IN SysvABI) THEN
  5545. IF passByRegister THEN
  5546. IF parameters.Length() > parameterRegisters THEN
  5547. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5548. ELSE
  5549. parametersSize := 0
  5550. END;
  5551. ELSE
  5552. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5553. INC( parametersSize, (-parametersSize) MOD 16 )
  5554. END;
  5555. IF parametersSize > 0 THEN
  5556. size := IntermediateCode.Immediate(addressType,parametersSize);
  5557. Emit(Add(position,sp,sp,size))
  5558. END;
  5559. END;
  5560. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5561. IF structuredReturnType THEN
  5562. (* stack pointer rewinding done by callee
  5563. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5564. Emit(Add(position,sp,sp,size));
  5565. *)
  5566. RestoreRegisters(saved);
  5567. InitOperand(result,ModeReference);
  5568. Symbol(variable,result);
  5569. ELSE
  5570. RestoreRegisters(saved);
  5571. InitOperand(result,ModeValue);
  5572. result.op := return;
  5573. END;
  5574. END;
  5575. IF alignment > 1 THEN
  5576. Emit(Pop(position,sp));
  5577. END;
  5578. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5579. Emit(Pop(position, ap));
  5580. END;
  5581. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5582. ValueToCondition(result);
  5583. END;
  5584. destination := dest;
  5585. (* perform all write-back calls in the list *)
  5586. BackupGlobalState;
  5587. currentWriteBackCall := firstWriteBackCall;
  5588. WHILE currentWriteBackCall # NIL DO
  5589. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5590. currentWriteBackCall := currentWriteBackCall.next
  5591. END;
  5592. RestoreGlobalState;
  5593. (* TENATIVE *)
  5594. (*
  5595. IF isOperatorCall THEN
  5596. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5597. END;
  5598. *)
  5599. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5600. END VisitProcedureCallDesignator;
  5601. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5602. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5603. td: SyntaxTree.Symbol;
  5604. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5605. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5606. BEGIN
  5607. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5608. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5609. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5610. variable.SetType(system.anyType);
  5611. scope.AddVariable(variable);
  5612. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5613. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5614. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5615. typeDeclaration.SetScope(module.module.moduleScope);
  5616. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5617. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5618. END;
  5619. RETURN hiddenPointerType;
  5620. END GetHiddenPointerType;
  5621. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5622. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5623. BEGIN
  5624. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5625. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5626. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5627. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5628. scope.AddVariable(variable);
  5629. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5630. variable.SetType(system.anyType);
  5631. scope.AddVariable(variable);
  5632. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5633. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5634. typeDeclaration.SetDeclaredType(delegatePointerType);
  5635. typeDeclaration.SetScope(module.module.moduleScope);
  5636. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5637. delegatePointerType.SetState(SyntaxTree.Resolved);
  5638. END;
  5639. RETURN delegatePointerType
  5640. END GetDelegateType;
  5641. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5642. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5643. such as in VAR a: RECORD ... END;
  5644. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5645. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5646. *)
  5647. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5648. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5649. BEGIN (* no code emission *)
  5650. source := NIL;
  5651. x := x.resolved;
  5652. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5653. x := GetHiddenPointerType();
  5654. ELSIF IsDelegate(x) THEN
  5655. x := GetDelegateType();
  5656. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5657. ELSE HALT(200);
  5658. END;
  5659. td := x.typeDeclaration;
  5660. IF td = NIL THEN
  5661. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5662. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5663. ASSERT(td # NIL);
  5664. END;
  5665. GetCodeSectionNameForSymbol(td,name);
  5666. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5667. meta.CheckTypeDeclaration(x);
  5668. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5669. ELSE
  5670. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5671. END;
  5672. IF backend.cooperative OR meta.simple THEN
  5673. offset := 0;
  5674. ELSE
  5675. IF x IS SyntaxTree.CellType THEN
  5676. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5677. IF baseRecord = NIL THEN
  5678. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5679. ELSE
  5680. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5681. END;
  5682. ELSE
  5683. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5684. END;
  5685. END;
  5686. RETURN td
  5687. END GetBackendType;
  5688. BEGIN
  5689. (*td := t.typeDeclaration;*)
  5690. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5691. (*
  5692. IF t IS SyntaxTree.PointerType THEN
  5693. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5694. ELSE
  5695. source := GetBackendType(t);
  5696. END;
  5697. *)
  5698. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5699. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5700. IntermediateCode.SetOffset(res,offset);
  5701. (*
  5702. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5703. make memory should be used when tag is used, not earlier
  5704. *)
  5705. RETURN res
  5706. END TypeDescriptorAdr;
  5707. (*
  5708. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5709. VAR result: IntermediateCode.Operand;
  5710. BEGIN
  5711. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5712. operand.tag := TypeDescriptorAdr(operand.type);
  5713. IntermediateCode.MakeMemory(operand.tag,addressType);
  5714. UseIntermediateOperand(operand.tag);
  5715. END;
  5716. END MakeTypeTag;
  5717. *)
  5718. PROCEDURE ProfilerInit;
  5719. VAR reg: IntermediateCode.Operand;
  5720. BEGIN
  5721. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5722. Emit(Call(position,reg,0));
  5723. END ProfilerInit;
  5724. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5725. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5726. BEGIN
  5727. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5728. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5729. THEN
  5730. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5731. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5732. Emit(Push(position,reg));
  5733. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5734. Emit(Push(position,reg));
  5735. StaticCallOperand(result,procedure);
  5736. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5737. ReleaseOperand(result);
  5738. END;
  5739. END ProfilerEnterExit;
  5740. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5741. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5742. BEGIN
  5743. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5744. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5745. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5746. profileInit.Emit(Push(position,reg));
  5747. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5748. profileInit.Emit(Push(position,reg));
  5749. NEW(string, LEN(name)); COPY(name, string^);
  5750. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5751. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5752. sv.SetType(type);
  5753. Designate(sv,result);
  5754. profileInit.Emit(Push(position,result.tag));
  5755. profileInit.Emit(Push(position,result.op));
  5756. StaticCallOperand(result,procedure);
  5757. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5758. ReleaseOperand(result);
  5759. END;
  5760. END ProfilerAddProcedure;
  5761. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5762. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5763. BEGIN
  5764. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5765. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5766. profileInit.Emit(Push(position,reg));
  5767. profileInitPatchPosition := profileInit.pc;
  5768. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5769. NEW(string, LEN(name)); COPY(name, string^);
  5770. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5771. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5772. sv.SetType(type);
  5773. Designate(sv,result);
  5774. profileInit.Emit(Push(position,result.tag));
  5775. profileInit.Emit(Push(position,result.op));
  5776. StaticCallOperand(result,procedure);
  5777. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5778. ReleaseOperand(result);
  5779. END;
  5780. END ProfilerAddModule;
  5781. PROCEDURE ProfilerPatchInit;
  5782. VAR reg: IntermediateCode.Operand;
  5783. BEGIN
  5784. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5785. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5786. EmitLeave(profileInit,position,NIL,0);
  5787. profileInit.Emit(Exit(position,0,0,0));
  5788. END ProfilerPatchInit;
  5789. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5790. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5791. VAR
  5792. id: LONGINT;
  5793. leftType, rightType: SyntaxTree.Type;
  5794. procedureType: SyntaxTree.ProcedureType;
  5795. runtimeProcedure: SyntaxTree.Procedure;
  5796. runtimeProcedureOperand, operatorOperand: Operand;
  5797. kind: SET;
  5798. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5799. VAR
  5800. arg: IntermediateCode.Operand;
  5801. recordType: SyntaxTree.RecordType;
  5802. fingerPrint: SyntaxTree.FingerPrint;
  5803. BEGIN
  5804. IF type = NIL THEN
  5805. (* no type: push 'NoType' *)
  5806. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5807. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5808. ELSIF IsStrictlyPointerToRecord(type) THEN
  5809. (* pointer to record type: push typetag *)
  5810. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5811. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5812. arg := TypeDescriptorAdr(recordType);
  5813. ELSE
  5814. (* non-pointer to record type: push fingerprint *)
  5815. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5816. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5817. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5818. END;
  5819. operatorInitializationCodeSection.Emit(Push(position,arg))
  5820. END PushTypeInfo;
  5821. BEGIN
  5822. ASSERT(operatorInitializationCodeSection # NIL);
  5823. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5824. procedureType := operator.type(SyntaxTree.ProcedureType);
  5825. (* determine types *)
  5826. leftType := procedureType.firstParameter.type;
  5827. IF procedureType.numberParameters = 2 THEN
  5828. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5829. rightType := procedureType.firstParameter.nextParameter.type;
  5830. ELSE
  5831. rightType := NIL
  5832. END;
  5833. (* determine operator kind *)
  5834. IF IsStrictlyPointerToRecord(leftType) THEN
  5835. kind := {LhsIsPointer}
  5836. ELSE
  5837. kind := {}
  5838. END;
  5839. IF IsStrictlyPointerToRecord(rightType) THEN
  5840. kind := kind + {RhsIsPointer}
  5841. END;
  5842. IF kind # {} THEN (* TODO: to be removed later on *)
  5843. (* at least one of the types is a pointer to record *)
  5844. (* emit a code that registers this specific operator in the runtime *)
  5845. dump := operatorInitializationCodeSection.comments;
  5846. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5847. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5848. (* push ID *)
  5849. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5850. id := Global.GetSymbol(module.module.case, operator.name);
  5851. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5852. (* push kind *)
  5853. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5854. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5855. (* push type infos *)
  5856. PushTypeInfo(leftType);
  5857. PushTypeInfo(rightType);
  5858. (* push operator address *)
  5859. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5860. StaticCallOperand(operatorOperand, operator);
  5861. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5862. ReleaseOperand(operatorOperand);
  5863. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5864. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  5865. ReleaseOperand(runtimeProcedureOperand)
  5866. END
  5867. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5868. END
  5869. END RegisterDynamicOperator;
  5870. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5871. VAR
  5872. traceModule: SyntaxTree.Module;
  5873. procedure: SyntaxTree.Procedure;
  5874. procedureVariable: SyntaxTree.Variable;
  5875. s,msg: Basic.MessageString;
  5876. res: Operand;
  5877. i: LONGINT;
  5878. sv: SyntaxTree.StringValue;
  5879. type: SyntaxTree.Type;
  5880. recordType: SyntaxTree.RecordType;
  5881. printout: Printout.Printer;
  5882. stringWriter: Streams.StringWriter;
  5883. expression: SyntaxTree.Expression;
  5884. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5885. BEGIN
  5886. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5887. IF procedure = NIL THEN
  5888. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5889. END;
  5890. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5891. s := "procedure ";
  5892. Strings.Append(s,backend.traceModuleName);
  5893. Strings.Append(s,".");
  5894. Strings.Append(s,procedureName);
  5895. Strings.Append(s," not present");
  5896. Error(position,s);
  5897. RETURN FALSE
  5898. ELSE
  5899. RETURN TRUE
  5900. END;
  5901. END GetProcedure;
  5902. PROCEDURE CallProcedure;
  5903. VAR size: LONGINT;
  5904. BEGIN
  5905. IF procedure # NIL THEN
  5906. StaticCallOperand(result,procedure);
  5907. size := ProcParametersSize(procedure);
  5908. ELSE
  5909. Symbol(procedureVariable, result);
  5910. LoadValue(result, procedureVariable.type.resolved);
  5911. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5912. END;
  5913. Emit(Call(position,result.op,size));
  5914. END CallProcedure;
  5915. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5916. VAR res: Operand; string: SyntaxTree.String;
  5917. BEGIN
  5918. IF GetProcedure("String") THEN
  5919. NEW(string, LEN(s)); COPY(s, string^);
  5920. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5921. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5922. sv.SetType(type);
  5923. Designate(sv,res);
  5924. Emit(Push(position,res.tag));
  5925. Emit(Push(position,res.op));
  5926. ReleaseOperand(res);
  5927. CallProcedure;
  5928. END;
  5929. END String;
  5930. PROCEDURE Integer(op: IntermediateCode.Operand);
  5931. BEGIN
  5932. IF GetProcedure("Int") THEN
  5933. Emit(Push(position,op));
  5934. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5935. CallProcedure;
  5936. END;
  5937. END Integer;
  5938. PROCEDURE Float(op: IntermediateCode.Operand);
  5939. BEGIN
  5940. IF GetProcedure("HIntHex") THEN
  5941. Emit(Push(position,op));
  5942. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5943. CallProcedure;
  5944. END;
  5945. END Float;
  5946. PROCEDURE Set(op: IntermediateCode.Operand);
  5947. BEGIN
  5948. IF GetProcedure("Set") THEN
  5949. Emit(Push(position,op));
  5950. (*
  5951. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5952. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5953. *)
  5954. CallProcedure;
  5955. END;
  5956. END Set;
  5957. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5958. BEGIN
  5959. IF GetProcedure("Boolean") THEN
  5960. Emit(Push(position,op));
  5961. CallProcedure;
  5962. END;
  5963. END Boolean;
  5964. PROCEDURE Char(op: IntermediateCode.Operand);
  5965. BEGIN
  5966. IF GetProcedure("Char") THEN
  5967. Emit(Push(position,op));
  5968. CallProcedure;
  5969. END;
  5970. END Char;
  5971. PROCEDURE Address(op: IntermediateCode.Operand);
  5972. BEGIN
  5973. IF GetProcedure("Address") THEN
  5974. Emit(Push(position,op));
  5975. CallProcedure;
  5976. END;
  5977. END Address;
  5978. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  5979. VAR len: IntermediateCode.Operand;
  5980. BEGIN
  5981. IF GetProcedure("String") THEN
  5982. len := GetArrayLength(type, op.tag);
  5983. Emit(Push(position,len));
  5984. ReleaseIntermediateOperand(len);
  5985. Emit(Push(position,op.op));
  5986. CallProcedure;
  5987. END;
  5988. END StringOperand;
  5989. PROCEDURE Ln;
  5990. BEGIN
  5991. IF GetProcedure("Ln") THEN
  5992. CallProcedure;
  5993. END;
  5994. END Ln;
  5995. BEGIN
  5996. IF backend.traceModuleName = "" THEN RETURN END;
  5997. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5998. IF GetProcedure("Enter") THEN
  5999. CallProcedure
  6000. END;
  6001. NEW(stringWriter,LEN(s));
  6002. FOR i := 0 TO x.Length()-1 DO
  6003. msg := "";
  6004. expression := x.GetExpression(i);
  6005. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6006. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6007. ELSE
  6008. Global.GetModuleName(module.module, s);
  6009. END;
  6010. IF i = 0 THEN
  6011. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6012. stringWriter.String(":");
  6013. END;
  6014. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6015. IF ~(expression IS SyntaxTree.StringValue) THEN
  6016. printout.Expression(expression);
  6017. stringWriter.Get(s);
  6018. Strings.Append(msg,s);
  6019. Strings.Append(msg,"= ");
  6020. ELSE stringWriter.Get(s); (* remove from string writer *)
  6021. Strings.Append(msg, s);
  6022. END;
  6023. String(msg);
  6024. IF SemanticChecker.IsStringType(expression.type) THEN
  6025. Designate(expression,res);
  6026. StringOperand(res, expression.type);
  6027. ELSE
  6028. Evaluate(expression,res);
  6029. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6030. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6031. Convert(res.op,int64);
  6032. END;
  6033. Integer(res.op);
  6034. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6035. Boolean(res.op);
  6036. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6037. Set(res.op);
  6038. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6039. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6040. Convert(res.op,float64);
  6041. END;
  6042. Float(res.op);
  6043. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6044. Char(res.op);
  6045. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6046. Address(res.op);String("H");
  6047. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6048. Address(res.op);String("H");
  6049. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6050. Address(res.op);String("H");
  6051. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6052. Address(res.op);String("H");
  6053. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6054. String("NIL");
  6055. ELSE HALT(200);
  6056. END;
  6057. END;
  6058. ReleaseOperand(res);
  6059. String("; ");
  6060. END;
  6061. IF GetProcedure("Exit") THEN
  6062. CallProcedure
  6063. ELSE
  6064. Ln;
  6065. END;
  6066. END;
  6067. END SystemTrace;
  6068. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6069. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6070. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6071. BEGIN
  6072. type := type.resolved;
  6073. IF type IS SyntaxTree.RecordType THEN
  6074. WITH type: SyntaxTree.RecordType DO
  6075. baseType := type.baseType;
  6076. IF baseType # NIL THEN
  6077. baseType := baseType.resolved;
  6078. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6079. InitFields(baseType,adr,offset);
  6080. END;
  6081. variable := type.recordScope.firstVariable;
  6082. WHILE variable # NIL DO
  6083. IF variable.initializer # NIL THEN
  6084. Evaluate(variable.initializer,initializerOp);
  6085. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6086. Emit(Mov(position,mem,initializerOp.op));
  6087. ReleaseOperand(initializerOp);
  6088. ReleaseIntermediateOperand(mem);
  6089. END;
  6090. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6091. variable := variable.nextVariable
  6092. END;
  6093. END;
  6094. ELSIF type IS SyntaxTree.CellType THEN
  6095. WITH type: SyntaxTree.CellType DO
  6096. baseType := type.baseType;
  6097. IF baseType # NIL THEN
  6098. baseType := baseType.resolved;
  6099. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6100. InitFields(baseType,adr,offset);
  6101. END;
  6102. variable := type.cellScope.firstVariable;
  6103. WHILE variable # NIL DO
  6104. IF variable.initializer # NIL THEN
  6105. Evaluate(variable.initializer,initializerOp);
  6106. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6107. Emit(Mov(position,mem,initializerOp.op));
  6108. ReleaseOperand(initializerOp);
  6109. ReleaseIntermediateOperand(mem);
  6110. END;
  6111. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6112. variable := variable.nextVariable
  6113. END;
  6114. END;
  6115. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6116. WITH type: SyntaxTree.ArrayType DO
  6117. IF type.form = SyntaxTree.Static THEN
  6118. baseType := type.arrayBase;
  6119. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6120. FOR i := 0 TO type.staticLength-1 DO
  6121. InitFields(baseType,adr,offset+i*size);
  6122. END;
  6123. END;
  6124. END;
  6125. ELSIF type IS SyntaxTree.MathArrayType THEN
  6126. WITH type: SyntaxTree.MathArrayType DO
  6127. IF type.form = SyntaxTree.Open THEN
  6128. dim := DynamicDim(type);
  6129. imm := IntermediateCode.Immediate(addressType,dim);
  6130. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6131. baseType := SemanticChecker.ArrayBase(type,dim);
  6132. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6133. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6134. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6135. ReleaseIntermediateOperand(imm);
  6136. (* flags remain empty (=0) for open array *)
  6137. ELSIF type.form = SyntaxTree.Static THEN
  6138. baseType := type.arrayBase;
  6139. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6140. ASSERT(type.staticLength < 1024*1024*1024);
  6141. FOR i := 0 TO type.staticLength-1 DO
  6142. InitFields(baseType,adr,offset+i*size);
  6143. END;
  6144. END;
  6145. END;
  6146. END;
  6147. END InitFields;
  6148. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6149. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6150. saved: RegisterEntry;
  6151. BEGIN
  6152. type := variable.type.resolved;
  6153. IF (type IS SyntaxTree.MathArrayType) THEN
  6154. WITH type: SyntaxTree.MathArrayType DO
  6155. IF type.form = SyntaxTree.Open THEN
  6156. Symbol(variable,operand);
  6157. InitFields(type, operand.tag,0);
  6158. IF temporary THEN
  6159. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6160. END;
  6161. ELSIF type.form = SyntaxTree.Tensor THEN
  6162. IF temporary & backend.writeBarriers THEN
  6163. SaveRegisters();ReleaseUsedRegisters(saved);
  6164. Symbol(variable, operand);
  6165. Emit(Push(position,operand.op));
  6166. ReleaseOperand(operand);
  6167. Emit(Push(position,nil));
  6168. CallThis(position,"FoxArrayBase","Assign",2);
  6169. RestoreRegisters(saved);
  6170. ELSE
  6171. Symbol(variable, operand);
  6172. MakeMemory(tmp,operand.op,addressType,0);
  6173. ReleaseOperand(operand);
  6174. IF FALSE & temporary THEN
  6175. (* trick -- temporary object from array base *)
  6176. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6177. Symbol(symbol,operand);
  6178. MakeMemory(mem,operand.op,addressType,0);
  6179. ReleaseOperand(operand);
  6180. Emit(Mov(position,tmp, mem) );
  6181. ReleaseOperand(operand);
  6182. ELSE
  6183. Emit(Mov(position,tmp, nil ) );
  6184. END;
  6185. ReleaseIntermediateOperand(tmp)
  6186. END;
  6187. END;
  6188. END;
  6189. ELSE
  6190. Symbol(variable,operand);
  6191. IF variable.initializer # NIL THEN
  6192. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6193. reference.SetType(variable.type.resolved);
  6194. reference.SetAssignable(TRUE);
  6195. Assign(reference,variable.initializer);
  6196. ELSIF temporary THEN
  6197. IF SemanticChecker.IsPointerType(variable.type) THEN
  6198. IF backend.writeBarriers THEN
  6199. SaveRegisters();ReleaseUsedRegisters(saved);
  6200. Symbol(variable, operand);
  6201. Emit(Push(position,operand.op));
  6202. ReleaseOperand(operand);
  6203. Emit(Push(position,nil));
  6204. CallThis(position,"Heaps","Assign",2);
  6205. RestoreRegisters(saved);
  6206. ELSE
  6207. Symbol(variable, operand);
  6208. MakeMemory(tmp,operand.op,addressType,0);
  6209. ReleaseOperand(operand);
  6210. Emit(Mov(position,tmp, nil ) );
  6211. ReleaseIntermediateOperand(tmp);
  6212. END;
  6213. END;
  6214. END;
  6215. InitFields(type, operand.op,0);
  6216. ReleaseOperand(operand);
  6217. END;
  6218. END InitVariable;
  6219. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6220. VAR end: Label;
  6221. BEGIN
  6222. IF type.form = SyntaxTree.Tensor THEN
  6223. InitOperand(result,ModeValue);
  6224. ReuseCopy(result.op,base);
  6225. end := NewLabel();
  6226. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6227. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6228. SetLabel(end);
  6229. Convert(result.op,lenType);
  6230. ELSE
  6231. InitOperand(result,ModeValue);
  6232. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6233. END
  6234. END MathArrayDim;
  6235. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6236. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6237. BEGIN
  6238. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6239. MakeMemory(mem,base,addressType,offset);
  6240. Emit(Mov(position,mem,value));
  6241. ReleaseIntermediateOperand(mem);
  6242. END PutMathArrayField;
  6243. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6244. VAR mem: IntermediateCode.Operand;
  6245. BEGIN
  6246. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6247. MakeMemory(mem,base,addressType,offset);
  6248. Emit(Mov(position,mem,value));
  6249. ReleaseIntermediateOperand(mem);
  6250. END PutMathArrayFieldOffset;
  6251. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6252. BEGIN
  6253. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6254. MakeMemory(value,base,addressType,offset);
  6255. END GetMathArrayField;
  6256. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6257. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6258. BEGIN
  6259. IF incr THEN
  6260. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6261. ELSE
  6262. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6263. END;
  6264. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6265. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6266. ELSE
  6267. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6268. Emit(Mov(position,reg,dim));
  6269. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6270. Emit(Add(position,reg,reg,base));
  6271. MakeMemory(mem, reg, addressType, offset);
  6272. ReleaseIntermediateOperand(reg);
  6273. Emit(Mov(position,mem,value));
  6274. ReleaseIntermediateOperand(mem);
  6275. END;
  6276. END PutMathArrayLenOrIncr;
  6277. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6278. BEGIN
  6279. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6280. END PutMathArrayLength;
  6281. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6282. BEGIN
  6283. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6284. END PutMathArrayIncrement;
  6285. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6286. BEGIN
  6287. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6288. END GetMathArrayIncrement;
  6289. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6290. BEGIN
  6291. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6292. END GetMathArrayLength;
  6293. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6294. VAR dimOp: IntermediateCode.Operand;
  6295. BEGIN
  6296. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6297. GetMathArrayLength(type, operand, dimOp, check, result);
  6298. END GetMathArrayLengthAt;
  6299. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6300. VAR dimOp: IntermediateCode.Operand;
  6301. BEGIN
  6302. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6303. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6304. END GetMathArrayIncrementAt;
  6305. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6306. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6307. offset: LONGINT;
  6308. BEGIN
  6309. IF increment THEN
  6310. offset := MathIncrOffset;
  6311. ELSE
  6312. offset := MathLenOffset;
  6313. END;
  6314. INC(offset,operand.dimOffset*2);
  6315. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6316. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6317. END;
  6318. (* static dimension *)
  6319. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6320. IF check & (type.form = SyntaxTree.Tensor) THEN
  6321. DimensionCheck(operand.tag,dim,BrltL);
  6322. END;
  6323. val := SHORT(dim.intValue);
  6324. IF type.form # SyntaxTree.Tensor THEN
  6325. t := SemanticChecker.ArrayBase(type,val);
  6326. type := t.resolved(SyntaxTree.MathArrayType);
  6327. IF type.form = SyntaxTree.Static THEN
  6328. IF increment THEN
  6329. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6330. ELSE
  6331. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6332. END;
  6333. InitOperand(result,ModeValue);
  6334. result.op := res;
  6335. RETURN;
  6336. END;
  6337. END;
  6338. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6339. MakeMemory(res,operand.tag,addressType,offset);
  6340. (*
  6341. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6342. *)
  6343. InitOperand(result,ModeValue);
  6344. result.op := res;
  6345. ELSE
  6346. Convert(dim,addressType);
  6347. IF check THEN
  6348. IF type.form = SyntaxTree.Tensor THEN
  6349. DimensionCheck(operand.tag,dim,BrltL);
  6350. ELSIF isUnchecked THEN (* do nothing *)
  6351. ELSE
  6352. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6353. END;
  6354. END;
  6355. end := NewLabel(); next := NIL;
  6356. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6357. Emit(Mov(position,res,dim));
  6358. Convert(res,sizeType);
  6359. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6360. WHILE t IS SyntaxTree.MathArrayType DO
  6361. type := t(SyntaxTree.MathArrayType);
  6362. IF type.form = SyntaxTree.Static THEN
  6363. imm := IntermediateCode.Immediate(sizeType,val);
  6364. next := NewLabel();
  6365. BrneL(next,imm,res);
  6366. IF increment THEN
  6367. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6368. ELSE
  6369. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6370. END;
  6371. Emit(MovReplace(position,res,imm));
  6372. BrL(end);
  6373. ELSE hasDynamicPart := TRUE;
  6374. END;
  6375. t := type.arrayBase.resolved;
  6376. val := val + 1;
  6377. IF next # NIL THEN SetLabel(next) END;
  6378. END;
  6379. IF hasDynamicPart THEN
  6380. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6381. Emit(Mov(position,res2,dim));
  6382. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6383. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6384. Emit(Add(position,res2,res2,imm));
  6385. Emit(Add(position,res2,res2,operand.tag));
  6386. IntermediateCode.MakeMemory(res2,sizeType);
  6387. Emit(MovReplace(position,res,res2));
  6388. ReleaseIntermediateOperand(res2);
  6389. END;
  6390. SetLabel(end);
  6391. Convert(res,sizeType);
  6392. InitOperand(result,ModeValue);
  6393. result.op := res;
  6394. END;
  6395. END MathArrayLenOrIncr;
  6396. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6397. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6398. offset: LONGINT;
  6399. BEGIN
  6400. offset := operand.dimOffset+DynamicDim(type)-1;
  6401. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6402. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6403. val := SHORT(dim.intValue);
  6404. t := SemanticChecker.ArrayBase(type,val);
  6405. type := t.resolved(SyntaxTree.ArrayType);
  6406. IF type.form = SyntaxTree.Static THEN
  6407. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6408. ELSE
  6409. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6410. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6411. END;
  6412. UseIntermediateOperand(res);
  6413. InitOperand(result,ModeValue);
  6414. result.op := res;
  6415. ELSE
  6416. Convert(dim,addressType);
  6417. IF ~isUnchecked THEN
  6418. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6419. END;
  6420. end := NewLabel(); next := NIL;
  6421. (* ReuseCopy(dim,res); *)
  6422. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6423. Emit(Mov(position,res,dim));
  6424. Convert(res,sizeType);
  6425. Convert(res,sizeType);
  6426. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6427. WHILE t IS SyntaxTree.ArrayType DO
  6428. type := t(SyntaxTree.ArrayType);
  6429. IF type.form = SyntaxTree.Static THEN
  6430. imm := IntermediateCode.Immediate(sizeType,val);
  6431. next := NewLabel();
  6432. BrneL(next,imm,res);
  6433. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6434. Emit(MovReplace(position,res,imm));
  6435. BrL(end);
  6436. ELSE hasDynamicPart := TRUE;
  6437. END;
  6438. t := type.arrayBase.resolved;
  6439. val := val + 1;
  6440. IF next # NIL THEN SetLabel(next) END;
  6441. END;
  6442. IF hasDynamicPart THEN
  6443. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6444. Convert(res2,addressType);
  6445. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6446. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6447. Emit(Sub(position,res2,imm,res2));
  6448. Emit(Add(position,res2,res2,operand.tag));
  6449. IntermediateCode.MakeMemory(res2,sizeType);
  6450. Emit(MovReplace(position,res,res2));
  6451. ReleaseIntermediateOperand(res2);
  6452. END;
  6453. SetLabel(end);
  6454. Convert(res,sizeType);
  6455. InitOperand(result,ModeValue);
  6456. result.op := res;
  6457. END;
  6458. END ArrayLen;
  6459. (**
  6460. create a temporary variable in current scope
  6461. **)
  6462. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6463. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6464. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6465. BEGIN
  6466. IF ~register THEN
  6467. v := temporaries.GetFreeVariable(type, untraced, index);
  6468. ELSE
  6469. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6470. END;
  6471. scope := currentScope;
  6472. (*
  6473. variable := NIL; (* disable free variable managemenet for the time being -- does not work *)
  6474. *)
  6475. name := temporaries.GetUID();
  6476. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6477. variable.SetType(type);
  6478. variable.SetAccess(SyntaxTree.Hidden);
  6479. variable.SetUntraced(untraced);
  6480. IF v = NIL THEN
  6481. temporaries.AddVariable(variable);
  6482. IF ~register THEN
  6483. IF scope.lastVariable # NIL THEN
  6484. offset := scope.lastVariable.offsetInBits;
  6485. ELSE
  6486. offset := 0;
  6487. END;
  6488. DEC(offset,system.SizeOf(variable.type));
  6489. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6490. variable(SyntaxTree.Variable).SetOffset(offset);
  6491. scope.AddVariable(variable(SyntaxTree.Variable));
  6492. scope.EnterSymbol(variable, duplicate);
  6493. ASSERT(~duplicate);
  6494. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6495. ELSE
  6496. variable.SetUseRegister(TRUE);
  6497. variable(SyntaxTree.Variable).SetOffset(0);
  6498. END;
  6499. ELSE (* v # NIL *)
  6500. (* reuse slot for new variable, do not create new slot ! *)
  6501. temporaries.SetVariable(index, variable);
  6502. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6503. ASSERT(~register);
  6504. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6505. ASSERT(v.offsetInBits # 0);
  6506. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6507. scope.EnterSymbol(variable, duplicate);
  6508. ASSERT(~duplicate);
  6509. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6510. END;
  6511. RETURN variable(SyntaxTree.Variable)
  6512. END GetTemporaryVariable;
  6513. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6514. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6515. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6516. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6517. i: LONGINT; duplicate: BOOLEAN;
  6518. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6519. VAR variable: SyntaxTree.Variable;
  6520. BEGIN
  6521. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6522. variable.SetType(type);
  6523. recordScope.AddVariable(variable);
  6524. END AddVariable;
  6525. BEGIN
  6526. name := "@ArrayDescriptor";
  6527. Basic.AppendNumber(name,dimensions);
  6528. identifier := SyntaxTree.NewIdentifier(name);
  6529. parentScope := module.module.moduleScope;
  6530. symbol := parentScope.FindSymbol(identifier);
  6531. IF symbol # NIL THEN
  6532. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6533. type := typeDeclaration.declaredType;
  6534. ELSE
  6535. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6536. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6537. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6538. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6539. recordType.SetTypeDeclaration(typeDeclaration);
  6540. recordType.SetState(SyntaxTree.Resolved);
  6541. typeDeclaration.SetDeclaredType(recordType);
  6542. AddVariable("@ptr",system.anyType);
  6543. AddVariable("@adr",system.addressType);
  6544. AddVariable("@flags",system.addressType);
  6545. AddVariable("@dim",system.addressType);
  6546. AddVariable("@elementSize",system.addressType);
  6547. FOR i := 0 TO dimensions-1 DO
  6548. name := "@len";
  6549. Basic.AppendNumber(name,i);
  6550. AddVariable(name,system.addressType);
  6551. name := "@incr";
  6552. Basic.AppendNumber(name,i);
  6553. AddVariable(name,system.addressType);
  6554. END;
  6555. parentScope.AddTypeDeclaration(typeDeclaration);
  6556. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6557. ASSERT(~duplicate);
  6558. type := recordType;
  6559. END;
  6560. RETURN type
  6561. END GetMathArrayDescriptorType;
  6562. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6563. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6564. BEGIN
  6565. type := GetMathArrayDescriptorType(dimensions);
  6566. Emit(Push(position,op.op));
  6567. (* push type descriptor *)
  6568. reg := TypeDescriptorAdr(type);
  6569. Emit(Push(position,reg));
  6570. ReleaseIntermediateOperand(reg);
  6571. (* push realtime flag: false by default *)
  6572. Emit(Push(position,false));
  6573. CallThis(position,"Heaps","NewRec",3);
  6574. END NewMathArrayDescriptor;
  6575. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6576. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6577. BEGIN
  6578. NEW(string, LEN(s)); COPY(s, string^);
  6579. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6580. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6581. sv.SetType(type);
  6582. Designate(sv,res);
  6583. Emit(Push(position,res.tag));
  6584. Emit(Push(position,res.op));
  6585. ReleaseOperand(res);
  6586. END PushConstString;
  6587. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6588. BEGIN
  6589. IF b THEN
  6590. Emit(Push(Basic.invalidPosition, true));
  6591. ELSE
  6592. Emit(Push(Basic.invalidPosition, false));
  6593. END;
  6594. END PushConstBoolean;
  6595. PROCEDURE PushConstSet(v: SET);
  6596. VAR value: SyntaxTree.Value; op: Operand;
  6597. BEGIN
  6598. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6599. value.SetType(system.setType);
  6600. Evaluate(value, op);
  6601. Emit(Push(Basic.invalidPosition, op.op));
  6602. ReleaseOperand(op);
  6603. END PushConstSet;
  6604. PROCEDURE PushConstInteger(v: LONGINT);
  6605. VAR value: SyntaxTree.Value; op: Operand;
  6606. BEGIN
  6607. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6608. value.SetType(system.longintType);
  6609. Evaluate(value, op);
  6610. Emit(Push(Basic.invalidPosition, op.op));
  6611. ReleaseOperand(op);
  6612. END PushConstInteger;
  6613. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6614. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6615. section: IntermediateCode.Section;
  6616. BEGIN
  6617. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6618. Global.GetSymbolSegmentedName(symbol, name);
  6619. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6620. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6621. procedure.SetScope(moduleScope);
  6622. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6623. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6624. procedure.SetAccess(SyntaxTree.Hidden);
  6625. currentScope := procedureScope;
  6626. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6627. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6628. RETURN section;
  6629. END OpenInitializer;
  6630. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6631. BEGIN
  6632. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6633. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6634. section := prev;
  6635. END CloseInitializer;
  6636. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6637. VAR name: SyntaxTree.IdentifierString;
  6638. variable: SyntaxTree.Variable;
  6639. parameter: SyntaxTree.Parameter;
  6640. type: SyntaxTree.Type;
  6641. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6642. BEGIN
  6643. InitOperand(op,ModeReference);
  6644. op.op := fp;
  6645. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6646. Dereference(op, x, FALSE);
  6647. result := op;
  6648. Symbol(symbol, op);
  6649. END Field;
  6650. PROCEDURE Direction(direction: LONGINT): SET;
  6651. BEGIN
  6652. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6653. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6654. ELSE HALT(100);
  6655. END;
  6656. END Direction;
  6657. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6658. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6659. BEGIN
  6660. Field(port, op);
  6661. ToMemory(op.op,addressType,0);
  6662. Emit(Push(Basic.invalidPosition, op.op));
  6663. ReleaseOperand(op);
  6664. Basic.GetString(modifier.identifier, name);
  6665. PushConstString(name);
  6666. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6667. ASSERT(SemanticChecker.IsStringType(value.type));
  6668. Designate(value, op);
  6669. Emit(Push(modifier.position, op.tag));
  6670. Emit(Push(modifier.position, op.op));
  6671. ReleaseOperand(op);
  6672. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6673. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6674. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6675. Evaluate(value, op);
  6676. Emit(Push(modifier.position, op.op));
  6677. ReleaseOperand(op);
  6678. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6679. ELSE
  6680. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6681. END;
  6682. END AddPortProperty;
  6683. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6684. VAR modifier: SyntaxTree.Modifier;
  6685. BEGIN
  6686. modifier := parameter.modifiers;
  6687. WHILE modifier # NIL DO
  6688. AddPortProperty(parameter,modifier, modifier.expression);
  6689. modifier := modifier.nextModifier;
  6690. END;
  6691. END AddPortProperties;
  6692. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6693. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6694. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6695. PROCEDURE PushLens(type: SyntaxTree.Type);
  6696. BEGIN
  6697. IF IsSemiDynamicArray(type) THEN
  6698. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6699. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6700. Emit(Push(Basic.invalidPosition, op.op));
  6701. ReleaseOperand(op);
  6702. INC(dim);
  6703. ELSIF IsStaticArray(type) THEN
  6704. len := len * type(SyntaxTree.ArrayType).staticLength;
  6705. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6706. INC(dim);
  6707. ELSE
  6708. baseType := type;
  6709. END;
  6710. END PushLens;
  6711. BEGIN
  6712. (* cell *)
  6713. IF parameter.type IS SyntaxTree.ArrayType THEN
  6714. type := parameter.type;
  6715. dim := 0;
  6716. len := 1;
  6717. PushLens(type);
  6718. portType := baseType.resolved(SyntaxTree.PortType);
  6719. ELSE
  6720. portType := parameter.type(SyntaxTree.PortType);
  6721. END;
  6722. PushSelfPointer();
  6723. (* port / array of ports *)
  6724. IF IsStaticArray(type) THEN
  6725. PushConstInteger(len);
  6726. END;
  6727. Field(parameter, op);
  6728. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6729. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6730. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6731. Designate(d, op);*)
  6732. Emit(Push(Basic.invalidPosition, op.op));
  6733. ReleaseOperand(op);
  6734. (* name *)
  6735. PushConstString(name);
  6736. (* inout *)
  6737. PushConstSet(Direction(portType.direction));
  6738. (* width *)
  6739. PushConstInteger(portType.sizeInBits);
  6740. IF parameter.type IS SyntaxTree.PortType THEN
  6741. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6742. AddPortProperties(parameter);
  6743. ELSIF IsStaticArray(type)THEN
  6744. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6745. ELSIF IsSemiDynamicArray(type) THEN
  6746. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6747. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6748. Emit(Add(position,reg, sp, size));
  6749. (* dim *)
  6750. PushConstInteger(dim);
  6751. (* len array *)
  6752. Emit(Push(position, reg));
  6753. ReleaseIntermediateOperand(reg);
  6754. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6755. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6756. Emit(Add(position, sp,sp, size));
  6757. ELSE
  6758. HALT(100);
  6759. END;
  6760. END Parameter;
  6761. BEGIN
  6762. IF backend.cellsAreObjects THEN
  6763. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6764. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6765. END;
  6766. parameter := x.firstParameter;
  6767. WHILE (parameter # NIL) DO
  6768. type := parameter.type.resolved;
  6769. WHILE (type IS SyntaxTree.ArrayType) DO
  6770. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6771. END;
  6772. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6773. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6774. Parameter(name,parameter);
  6775. END;
  6776. parameter := parameter.nextParameter;
  6777. END;
  6778. ELSE HALT(200)
  6779. END;
  6780. END AddPorts;
  6781. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6782. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6783. BEGIN
  6784. Symbol(cell,op);
  6785. ToMemory(op.op,addressType,0);
  6786. Emit(Push(position,op.op));
  6787. ReleaseOperand(op);
  6788. property.GetName(name);
  6789. (* does not work when inheritance is used:
  6790. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6791. *)
  6792. PushConstString(name);
  6793. IF (value # NIL) THEN
  6794. ASSERT(
  6795. SemanticChecker.IsStringType(property.type)
  6796. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6797. OR (property.type.resolved IS SyntaxTree.FloatType)
  6798. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6799. OR (property.type.resolved IS SyntaxTree.SetType)
  6800. );
  6801. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6802. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6803. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6804. Designate(d, op);
  6805. IF SemanticChecker.IsStringType(property.type) THEN
  6806. Emit(Push(Basic.invalidPosition, op.tag))
  6807. END;
  6808. Emit(Push(Basic.invalidPosition, op.op));
  6809. ReleaseOperand(op);
  6810. END;
  6811. IF value = NIL THEN
  6812. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6813. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6814. ASSERT(SemanticChecker.IsStringType(value.type));
  6815. Designate(value, op);
  6816. PushString(op, value.type);
  6817. ReleaseOperand(op);
  6818. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6819. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6820. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6821. Evaluate(value, op);
  6822. Emit(Push(property.position, op.op));
  6823. ReleaseOperand(op);
  6824. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6825. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6826. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6827. Evaluate(value, op);
  6828. Emit(Push(property.position, op.op));
  6829. ReleaseOperand(op);
  6830. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6831. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6832. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6833. Evaluate(value, op);
  6834. Emit(Push(property.position, op.op));
  6835. ReleaseOperand(op);
  6836. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6837. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6838. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6839. Evaluate(value, op);
  6840. Emit(Push(property.position, op.op));
  6841. ReleaseOperand(op);
  6842. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6843. ELSE
  6844. HALT(200);
  6845. END;
  6846. END AddProperty;
  6847. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6848. VAR symbol: SyntaxTree.Symbol;
  6849. BEGIN
  6850. WHILE modifier # NIL DO
  6851. symbol := cellType.FindProperty(modifier.identifier);
  6852. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6853. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6854. modifier := modifier.nextModifier;
  6855. END;
  6856. END AddModifiers;
  6857. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6858. VAR last: SyntaxTree.Modifier;
  6859. BEGIN
  6860. IF to = NIL THEN
  6861. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6862. ELSE
  6863. last := to;
  6864. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6865. last := last.nextModifier;
  6866. END;
  6867. IF last.identifier # this.identifier THEN
  6868. ASSERT(last.nextModifier = NIL);
  6869. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6870. END;
  6871. END;
  6872. END AppendModifier;
  6873. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6874. BEGIN
  6875. WHILE this # NIL DO
  6876. AppendModifier(to, this);
  6877. this := this.nextModifier;
  6878. END;
  6879. END AppendModifiers;
  6880. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6881. VAR base: SyntaxTree.Type;
  6882. BEGIN
  6883. AppendModifiers(to, c.modifiers);
  6884. base := c.GetBaseValueType();
  6885. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6886. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6887. END;
  6888. END AppendCellTypeModifiers;
  6889. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6890. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6891. BEGIN
  6892. Basic.GetString(modifier.identifier, name);
  6893. PushConstString(name);
  6894. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6895. ASSERT(SemanticChecker.IsStringType(value.type));
  6896. Designate(value, op);
  6897. PushString(op, value.type);
  6898. ReleaseOperand(op);
  6899. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6900. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6901. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6902. Evaluate(value, op);
  6903. Emit(Push(modifier.position, op.op));
  6904. ReleaseOperand(op);
  6905. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6906. ELSE
  6907. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6908. END;
  6909. END AddPortProperty;
  6910. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6911. BEGIN
  6912. WHILE modifier # NIL DO
  6913. AddPortProperty(modifier, modifier.expression);
  6914. modifier := modifier.nextModifier;
  6915. END;
  6916. END AddPortProperties;
  6917. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6918. VAR op: Operand;
  6919. BEGIN
  6920. Evaluate(p, op);
  6921. Emit(Push(p.position, op.op));
  6922. ReleaseOperand(op);
  6923. IF p IS SyntaxTree.Designator THEN
  6924. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6925. END;
  6926. END PushPort;
  6927. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6928. VAR tmp: IntermediateCode.Operand;
  6929. BEGIN
  6930. actualType := actualType.resolved;
  6931. IF actualType IS SyntaxTree.StringType THEN
  6932. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6933. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6934. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6935. ELSE
  6936. tmp := op.tag;
  6937. IntermediateCode.MakeMemory(tmp,addressType);
  6938. Emit(Push(position,tmp));
  6939. END;
  6940. Emit(Push(position,op.op))
  6941. END PushString;
  6942. (* conservative check if x is potentially on the heap, excluding the module heap
  6943. required for generational garbage collector
  6944. *)
  6945. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6946. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6947. BEGIN
  6948. RETURN TRUE;
  6949. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6950. passed by reference.
  6951. pos := x.position.start;
  6952. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6953. x := x(SyntaxTree.Designator).left;
  6954. END;
  6955. RETURN x # NIL;
  6956. *)
  6957. END OnHeap;
  6958. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  6959. VAR
  6960. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6961. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6962. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6963. tmp:IntermediateCode.Operand;
  6964. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6965. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6966. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6967. dest: IntermediateCode.Operand;
  6968. staticLength: LONGINT; itype: IntermediateCode.Type;
  6969. convert,isTensor: BOOLEAN;
  6970. recordType: SyntaxTree.RecordType;
  6971. baseType: SyntaxTree.Type;
  6972. flags: SET;
  6973. left: SyntaxTree.Expression;
  6974. call: SyntaxTree.Designator;
  6975. procedure: SyntaxTree.Procedure;
  6976. temporaryVariable: SyntaxTree.Variable;
  6977. dummy: IntermediateCode.Operand;
  6978. customBuiltin: SyntaxTree.CustomBuiltin;
  6979. isVarPar: ARRAY 3 OF BOOLEAN;
  6980. callsection: Sections.Section;
  6981. segmentedName: Basic.SegmentedName;
  6982. needsTrace: BOOLEAN;
  6983. n: ARRAY 256 OF CHAR;
  6984. modifier: SyntaxTree.Modifier;
  6985. previous, init: IntermediateCode.Section;
  6986. prevScope: SyntaxTree.Scope;
  6987. firstPar: LONGINT;
  6988. saved: RegisterEntry;
  6989. callingConvention: SyntaxTree.CallingConvention;
  6990. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6991. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6992. priority: IntermediateCode.Operand;
  6993. op,callop: Operand;
  6994. BEGIN
  6995. IF type = NIL THEN RETURN END;
  6996. type := type.resolved;
  6997. IF type IS SyntaxTree.PointerType THEN
  6998. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6999. END;
  7000. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7001. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7002. recordScope := type(SyntaxTree.RecordType).recordScope;
  7003. IF recordScope.bodyProcedure # NIL THEN
  7004. procedure := recordScope.bodyProcedure;
  7005. body := procedure.procedureScope.body;
  7006. Emit(Push(position,self));
  7007. IF body.isActive THEN
  7008. StaticCallOperand(callop,procedure);
  7009. Emit(Push(position,callop.op));
  7010. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7011. Convert(priority,sizeType);
  7012. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7013. END;
  7014. Emit(Push(position,priority));
  7015. ReleaseIntermediateOperand(priority);
  7016. IF backend.cooperative THEN
  7017. Emit(Push(position,self));
  7018. CallThis(position,"Activities","Create",3)
  7019. ELSE
  7020. flags := 0;
  7021. IF body.isSafe THEN
  7022. flags := 1;
  7023. END;
  7024. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7025. Emit(Push(position,self));
  7026. CallThis(position,"Objects","CreateProcess",4)
  7027. END;
  7028. ELSE
  7029. Emit(Push(position,self));
  7030. StaticCallOperand(callop,procedure);
  7031. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7032. END;
  7033. Emit(Pop(position,self));
  7034. END;
  7035. END CallBodies;
  7036. PROCEDURE PushTD(type: SyntaxTree.Type);
  7037. VAR op: IntermediateCode.Operand;
  7038. BEGIN
  7039. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7040. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7041. ELSE
  7042. IF type.resolved IS SyntaxTree.PointerType THEN
  7043. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7044. END;
  7045. op := TypeDescriptorAdr(type.resolved);
  7046. Emit(Push(position,op));
  7047. END
  7048. END PushTD;
  7049. BEGIN
  7050. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7051. dest := destination; destination := emptyOperand;
  7052. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7053. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7054. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7055. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7056. CASE x.id OF
  7057. (* ---- COPY ----- *)
  7058. |Global.Copy:
  7059. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7060. (* ---- EXCL, INCL----- *)
  7061. |Global.Excl,Global.Incl:
  7062. Evaluate(p0,s0);
  7063. Evaluate(p1,s1);
  7064. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7065. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7066. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7067. END;
  7068. ReuseCopy(res,s0.op);
  7069. ReleaseOperand(s0);
  7070. Reuse1(tmp,s1.op);
  7071. ReleaseOperand(s1);
  7072. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7073. IF x.id = Global.Excl THEN
  7074. Emit(Not(position,tmp,tmp));
  7075. Emit(And(position,res,res,tmp));
  7076. ELSE
  7077. Emit(Or(position,res,res,tmp));
  7078. END;
  7079. ReleaseIntermediateOperand(tmp);
  7080. Designate(p0,s0);
  7081. ToMemory(s0.op,s1.op.type,0);
  7082. Emit(Mov(position,s0.op,res));
  7083. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7084. (* ---- DISPOSE ----- *)
  7085. |Global.Dispose:
  7086. Designate(p0,s0);
  7087. Emit(Push(position,s0.op));
  7088. ReleaseOperand(s0);
  7089. CallThis(position,"Runtime","Dispose", 1);
  7090. (* ---- GETPROCEDURE ----- *)
  7091. |Global.GetProcedure:
  7092. Designate(p0,s0);
  7093. PushString(s0,p0.type);
  7094. Designate(p1,s1);
  7095. PushString(s1,p1.type);
  7096. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7097. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7098. ELSE PushTD(procedureType.firstParameter.type)
  7099. END;
  7100. PushTD(procedureType.returnType);
  7101. Designate(p2,s2);
  7102. Emit(Push(position,s2.op));
  7103. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7104. CallThis(position,"Modules","GetProcedure", 7);
  7105. (* ---- ASH, LSH, ROT ----- *)
  7106. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7107. Evaluate(p0,s0);
  7108. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7109. (* make unsigned arguments in order to produced a logical shift *)
  7110. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7111. convert:= TRUE;
  7112. itype := s0.op.type;
  7113. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7114. Convert(s0.op,itype);
  7115. ELSE
  7116. convert := FALSE;
  7117. END;
  7118. END;
  7119. Evaluate(p1,s1);
  7120. IF IsIntegerConstant(p1,hint) THEN
  7121. ReuseCopy(reg,s0.op);
  7122. IF hint > 0 THEN
  7123. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7124. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7125. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7126. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7127. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7128. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7129. END;
  7130. ELSIF hint < 0 THEN
  7131. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7132. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7133. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7134. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7135. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7136. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7137. END;
  7138. END;
  7139. ReleaseOperand(s0); ReleaseOperand(s1);
  7140. ELSE
  7141. exit := NewLabel();
  7142. end := NewLabel();
  7143. ReuseCopy(reg,s0.op);
  7144. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7145. Reuse1(tmp,s1.op);
  7146. Emit(Neg(position,tmp,s1.op));
  7147. Convert(tmp,s1.op.type);
  7148. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7149. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7150. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7151. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7152. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7153. END;
  7154. ReleaseIntermediateOperand(tmp);
  7155. BrL(end);
  7156. SetLabel(exit);
  7157. ReuseCopy(tmp,s1.op);
  7158. Convert(tmp,s1.op.type);
  7159. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7160. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7161. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7162. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7163. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7164. END;
  7165. ReleaseIntermediateOperand(tmp);
  7166. SetLabel(end);
  7167. ReleaseOperand(s0); ReleaseOperand(s1);
  7168. END;
  7169. InitOperand(result,ModeValue);
  7170. IF convert THEN
  7171. itype := reg.type;
  7172. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7173. Convert(reg,itype);
  7174. END;
  7175. result.op := reg;
  7176. (* ---- CAP ----- *)
  7177. |Global.Cap:
  7178. Evaluate(p0,result);
  7179. ReuseCopy(reg,result.op);
  7180. ReleaseIntermediateOperand(result.op);
  7181. ignore := NewLabel();
  7182. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7183. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7184. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7185. SetLabel(ignore);
  7186. result.op := reg;
  7187. (* ---- CHR ----- *)
  7188. |Global.Chr, Global.Chr32:
  7189. Evaluate(p0,result);
  7190. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7191. |Global.Entier, Global.EntierH:
  7192. Evaluate(p0,result);
  7193. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7194. (* ---- MIN and MAX ----- *)
  7195. |Global.Max,Global.Min:
  7196. Evaluate(p0,s0);
  7197. Evaluate(p1,s1);
  7198. Reuse2(res,s0.op,s1.op);
  7199. else := NewLabel();
  7200. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7201. ELSE BrltL(else,s1.op,s0.op) END;
  7202. Emit(Mov(position,res,s0.op));
  7203. ReleaseOperand(s0);
  7204. end := NewLabel();
  7205. BrL(end);
  7206. SetLabel(else);
  7207. Emit(MovReplace(position,res,s1.op));
  7208. SetLabel(end);
  7209. ReleaseOperand(s1);
  7210. InitOperand(result,ModeValue);
  7211. result.op := res;
  7212. (* ---- ODD ----- *)
  7213. |Global.Odd:
  7214. IF ~conditional THEN
  7215. ConditionToValue(x)
  7216. ELSE
  7217. Evaluate(p0,result);
  7218. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7219. Reuse1(res,result.op);
  7220. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7221. ReleaseIntermediateOperand(result.op);
  7222. result.op := res;
  7223. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7224. ReleaseOperand(result);
  7225. BrL(falseLabel);
  7226. END;
  7227. (* ---- ORD ----- *)
  7228. |Global.Ord, Global.Ord32:
  7229. Evaluate(p0,result);
  7230. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7231. (* ---- SHORT, LONG ----- *)
  7232. |Global.Short, Global.Long:
  7233. Evaluate(p0,result);
  7234. IF x.type IS SyntaxTree.ComplexType THEN
  7235. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7236. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7237. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7238. ELSE
  7239. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7240. END
  7241. (* ---- HALT, SYSTEM.HALT----- *)
  7242. |Global.Halt, Global.systemHalt:
  7243. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7244. EmitTrap (position, val);
  7245. (* ---- ASSERT ----- *)
  7246. |Global.Assert:
  7247. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7248. trueL := NewLabel();
  7249. falseL := NewLabel();
  7250. Condition(p0,trueL,falseL);
  7251. IF p1 = NIL THEN val := AssertTrap
  7252. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7253. END;
  7254. SetLabel(falseL);
  7255. EmitTrap(position,val);
  7256. SetLabel(trueL);
  7257. END;
  7258. (*
  7259. Emit(TrapC(result.op,val);
  7260. *)
  7261. (* ---- INC, DEC----- *)
  7262. |Global.Inc,Global.Dec:
  7263. Expression(p0); adr := result.op;
  7264. LoadValue(result,p0.type); l := result;
  7265. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7266. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7267. END;
  7268. IF x.id = Global.Inc THEN
  7269. Emit(Add(position,l.op,l.op,r.op));
  7270. ELSE
  7271. Emit(Sub(position,l.op,l.op,r.op));
  7272. END;
  7273. ReleaseOperand(l); ReleaseOperand(r);
  7274. (* ---- LEN ----- *)
  7275. |Global.Len: (* dynamic length, static length done by checker *)
  7276. Designate(p0,operand);
  7277. IF p1 = NIL THEN
  7278. InitOperand(l,ModeValue);
  7279. l.op := IntermediateCode.Immediate(sizeType,0);
  7280. ELSE
  7281. Evaluate(p1,l);
  7282. END;
  7283. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7284. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7285. Dereference(operand, p0.type.resolved, FALSE);
  7286. END;
  7287. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7288. ReleaseOperand(operand); ReleaseOperand(l);
  7289. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7290. ASSERT(p1 # NIL);
  7291. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7292. Dereference(operand,p0.type.resolved,FALSE);
  7293. END;
  7294. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7295. ReleaseOperand(operand); ReleaseOperand(l);
  7296. ELSE HALT(100);
  7297. END;
  7298. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7299. (* ---- FIRST ---- *)
  7300. |Global.First:
  7301. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7302. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7303. ELSE
  7304. Designate(p0, result)
  7305. END
  7306. (* ---- LAST ---- *)
  7307. |Global.Last:
  7308. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7309. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7310. ELSE
  7311. Designate(p0, result);
  7312. (* make sure result.op is a register *)
  7313. tmp := result.op;
  7314. ReuseCopy(result.op, result.op);
  7315. ReleaseIntermediateOperand(tmp);
  7316. (* add offset to result.op *)
  7317. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7318. END
  7319. (* ---- STEP ---- *)
  7320. |Global.Step:
  7321. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7322. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7323. ELSE
  7324. Designate(p0, result);
  7325. (* make sure result.op is a register *)
  7326. tmp := result.op;
  7327. ReuseCopy(result.op, result.op);
  7328. ReleaseIntermediateOperand(tmp);
  7329. (* add offset to result.op *)
  7330. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7331. END
  7332. (* ---- RE ---- *)
  7333. |Global.Re:
  7334. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7335. Designate(p0, result)
  7336. ELSE
  7337. Evaluate(p0, result)
  7338. END
  7339. (* ---- IM ---- *)
  7340. |Global.Im:
  7341. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7342. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7343. Designate(p0, result);
  7344. (* make sure result.op is a register *)
  7345. tmp := result.op;
  7346. ReuseCopy(result.op, result.op);
  7347. ReleaseIntermediateOperand(tmp);
  7348. (* add offset to result.op *)
  7349. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7350. (* ---- ABS ----- *)
  7351. |Global.Abs:
  7352. Evaluate(p0,operand);
  7353. type := p0.type.resolved;
  7354. InitOperand(result,ModeValue);
  7355. Reuse1a(result.op,operand.op,dest);
  7356. Emit(Abs(position,result.op,operand.op));
  7357. ReleaseOperand(operand);
  7358. (* ---- WAIT ----- *)
  7359. |Global.Wait:
  7360. Evaluate(p0,operand);
  7361. Emit(Push(position,operand.op));
  7362. ReleaseOperand(operand);
  7363. CallThis(position,"Activities","Wait", 1);
  7364. (* ---- NEW ----- *)
  7365. |Global.New:
  7366. (*! the following code is only correct for "standard" Oberon calling convention *)
  7367. IF x.type # NIL THEN
  7368. type := x.type.resolved;
  7369. firstPar := 0;
  7370. ELSE
  7371. type := p0.type.resolved;
  7372. firstPar := 1;
  7373. END;
  7374. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7375. THEN
  7376. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7377. IF backend.cooperative THEN
  7378. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7379. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7380. IF recordType.isObject THEN
  7381. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7382. IF recordType.IsActive() THEN
  7383. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7384. END;
  7385. IF recordType.IsProtected() THEN
  7386. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7387. END;
  7388. ELSE
  7389. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7390. END;
  7391. END;
  7392. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7393. CallThis(position,"Runtime","New", 1);
  7394. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7395. Emit(Result(position, pointer));
  7396. exit := NewLabel();
  7397. BreqL(exit,pointer,nil);
  7398. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7399. GetRecordTypeName (recordType,name);
  7400. IF ~recordType.isObject THEN
  7401. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7402. END;
  7403. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7404. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7405. IF recordType.isObject THEN
  7406. IF recordType.IsProtected() THEN
  7407. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7408. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7409. END;
  7410. IF recordType.IsActive() THEN
  7411. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7412. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7413. END;
  7414. END;
  7415. END;
  7416. (* initialize fields *)
  7417. IF type(SyntaxTree.PointerType).isPlain THEN
  7418. size := 0;
  7419. ELSIF recordType.isObject THEN
  7420. size := BaseObjectTypeSize;
  7421. ELSE
  7422. size := BaseRecordTypeSize;
  7423. END;
  7424. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7425. (* call initializer *)
  7426. constructor := GetConstructor(recordType);
  7427. IF constructor # NIL THEN
  7428. (*! should be unified with ProcedureCallDesignator *)
  7429. Emit(Push(position,pointer));
  7430. ReleaseIntermediateOperand(pointer);
  7431. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7432. FOR i := firstPar TO x.parameters.Length()-1 DO
  7433. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7434. formalParameter := formalParameter.nextParameter;
  7435. END;
  7436. (* static call of the constructor *)
  7437. GetCodeSectionNameForSymbol(constructor,name);
  7438. ASSERT(~constructor.isInline);
  7439. IF constructor.scope.ownerModule # module.module THEN
  7440. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7441. ELSE
  7442. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7443. END;
  7444. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7445. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7446. Emit(Pop(position,pointer));
  7447. END;
  7448. (* call bodies *)
  7449. CallBodies(pointer,type);
  7450. SetLabel(exit);
  7451. needsTrace := p0.NeedsTrace();
  7452. IF needsTrace THEN ModifyAssignments(true) END;
  7453. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7454. Emit(Push(position, pointer));
  7455. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7456. Emit(Pop(position, pointer));
  7457. END;
  7458. Designate(p0,l);
  7459. IF needsTrace THEN
  7460. CallAssignPointer(l.op, pointer);
  7461. ELSE
  7462. ToMemory(l.op,addressType,0);
  7463. Emit(Mov(position,l.op,pointer));
  7464. END;
  7465. ReleaseIntermediateOperand(pointer);
  7466. ReleaseOperand(l);
  7467. IF needsTrace THEN ModifyAssignments(false) END;
  7468. ELSE (* not cooperative backend *)
  7469. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7470. IF temporaryVariable # NIL THEN
  7471. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7472. ELSE
  7473. Designate(p0,l);
  7474. END;
  7475. (* l.op contains address of pointer to record *)
  7476. Emit(Push(position,l.op)); (* address for use after syscall *)
  7477. Emit(Push(position,l.op));
  7478. ReleaseOperand(l);
  7479. (* push type descriptor *)
  7480. reg := TypeDescriptorAdr(recordType);
  7481. Emit(Push(position,reg));
  7482. ReleaseIntermediateOperand(reg);
  7483. (* push realtime flag *)
  7484. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7485. ELSE Emit(Push(position,false));
  7486. END;
  7487. CallThis(position,"Heaps","NewRec", 3);
  7488. (* check allocation success, if not successful then do not call initializers and bodies *)
  7489. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7490. Emit(Pop(position,pointer));
  7491. MakeMemory(reg,pointer,addressType,0);
  7492. ReleaseIntermediateOperand(pointer);
  7493. pointer := reg;
  7494. exit := NewLabel();
  7495. BreqL(exit,pointer,nil);
  7496. Emit(Push(position,pointer));
  7497. (* initialize fields *)
  7498. InitFields(recordType, pointer,0);
  7499. (* call initializer *)
  7500. constructor := GetConstructor(recordType);
  7501. IF constructor # NIL THEN
  7502. (*! should be unified with ProcedureCallDesignator *)
  7503. Emit(Push(position,pointer));
  7504. ReleaseIntermediateOperand(pointer);
  7505. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7506. FOR i := firstPar TO x.parameters.Length()-1 DO
  7507. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7508. formalParameter := formalParameter.nextParameter;
  7509. END;
  7510. (* static call of the constructor *)
  7511. GetCodeSectionNameForSymbol(constructor,name);
  7512. ASSERT(~constructor.isInline);
  7513. IF constructor.scope.ownerModule # module.module THEN
  7514. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7515. ELSE
  7516. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7517. END;
  7518. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7519. ELSE
  7520. ReleaseIntermediateOperand(pointer);
  7521. END;
  7522. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7523. Emit(Pop(position,pointer));
  7524. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7525. Designate(p0,l);
  7526. IF backend.writeBarriers & OnHeap(p0) THEN
  7527. SaveRegisters();ReleaseUsedRegisters(saved);
  7528. Emit(Push(position,l.op));
  7529. Emit(Push(position,pointer));
  7530. CallThis(position,"Heaps","Assign",2);
  7531. RestoreRegisters(saved);
  7532. ELSE
  7533. ToMemory(l.op,addressType,0);
  7534. Emit(Mov(position,l.op,pointer));
  7535. END;
  7536. ReleaseOperand(l);
  7537. result.tag := emptyOperand;
  7538. ELSIF (x.type # NIL) THEN
  7539. result := l; (* temporary variable is the result of NEW Type() *)
  7540. END;
  7541. (* call bodies *)
  7542. CallBodies(pointer,type);
  7543. ReleaseIntermediateOperand(pointer);
  7544. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7545. end := NewLabel();
  7546. BrL(end);
  7547. SetLabel(exit);
  7548. Designate(p0,l);
  7549. ToMemory(l.op,addressType,0);
  7550. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7551. ReleaseOperand(l);
  7552. SetLabel(end);
  7553. ELSE
  7554. SetLabel(exit);
  7555. END;
  7556. END;
  7557. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7558. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7559. IF ~backend.cooperative THEN (* simpler version *)
  7560. (*
  7561. push len0
  7562. push len1
  7563. push len2
  7564. push len_size
  7565. push len_adr
  7566. push tag
  7567. push static elements
  7568. push element size
  7569. push adr
  7570. *)
  7571. dim := 0;
  7572. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7573. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7574. parameter := x.parameters.GetExpression(i);
  7575. Evaluate(parameter,r);
  7576. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7577. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7578. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7579. END;
  7580. Emit(Push(position,r.op));
  7581. ReleaseOperand(r);
  7582. INC(dim);
  7583. END;
  7584. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7585. Emit(Mov(position, adr, sp));
  7586. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7587. Emit(Push(position, adr));
  7588. ReleaseIntermediateOperand(adr);
  7589. openDim := dim;
  7590. staticLength := 1;
  7591. IF type IS SyntaxTree.ArrayType THEN
  7592. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7593. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7594. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7595. END;
  7596. END;
  7597. IF SemanticChecker.ContainsPointer(type) THEN
  7598. tmp := TypeDescriptorAdr(type);
  7599. ELSE
  7600. tmp := nil;
  7601. END;
  7602. Emit(Push(position,tmp)); (* type descriptor *)
  7603. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7604. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7605. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7606. Designate(p0,l);
  7607. Emit(Push(position,l.op)); (* address *)
  7608. ReleaseOperand(l);
  7609. CallThis(position,"Heaps","NewArray", 6);
  7610. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7611. Emit(Add(position,sp,sp,tmp));
  7612. ELSE
  7613. dim := 0;
  7614. IntermediateCode.InitOperand(reg);
  7615. IF p1 # NIL THEN
  7616. FOR i := firstPar TO x.parameters.Length()-1 DO
  7617. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7618. parameter := x.parameters.GetExpression(i);
  7619. Evaluate(parameter,r);
  7620. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7621. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7622. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7623. END;
  7624. Emit(Push(position,r.op));
  7625. IF i=1 THEN
  7626. CopyInt(reg,r.op);
  7627. ELSE
  7628. MulInt(reg, reg, r.op);
  7629. END;
  7630. ReleaseOperand(r);
  7631. INC(dim);
  7632. END;
  7633. Convert(reg,addressType);
  7634. ELSE
  7635. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7636. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7637. END;
  7638. openDim := dim;
  7639. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7640. IF backend.cooperative THEN
  7641. size := ToMemoryUnits(system,system.SizeOf(type));
  7642. WHILE type IS SyntaxTree.ArrayType DO
  7643. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7644. END;
  7645. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7646. IF (size # 1) THEN
  7647. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7648. END;
  7649. Emit(Push(position,reg));
  7650. size := ToMemoryUnits(system,system.SizeOf(type));
  7651. IF (size # 1) THEN
  7652. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7653. END;
  7654. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7655. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7656. Emit(Push(position,reg));
  7657. ReleaseIntermediateOperand(reg);
  7658. CallThis(position,"Runtime","New", 1);
  7659. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7660. Emit(Result(position, pointer));
  7661. exit := NewLabel();
  7662. else := NewLabel();
  7663. BreqL(else,pointer,nil);
  7664. IF ~type.hasPointers THEN
  7665. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7666. ELSIF type IS SyntaxTree.RecordType THEN
  7667. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7668. ELSIF type IS SyntaxTree.ProcedureType THEN
  7669. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7670. ELSE
  7671. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7672. END;
  7673. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7674. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7675. 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))));
  7676. IF type IS SyntaxTree.RecordType THEN
  7677. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7678. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7679. ELSE
  7680. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7681. END;
  7682. i := openDim;
  7683. WHILE i > 0 DO
  7684. DEC (i);
  7685. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7686. END;
  7687. needsTrace := p0.NeedsTrace();
  7688. IF needsTrace THEN ModifyAssignments(true) END;
  7689. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7690. Emit(Push(position, pointer));
  7691. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7692. Emit(Pop(position, pointer));
  7693. END;
  7694. Designate(p0,l);
  7695. IF needsTrace THEN
  7696. CallAssignPointer(l.op, pointer);
  7697. ModifyAssignments(false);
  7698. ELSE
  7699. ToMemory(l.op,addressType,0);
  7700. Emit(Mov(position,l.op,pointer));
  7701. END;
  7702. ReleaseIntermediateOperand(pointer);
  7703. ReleaseOperand(l);
  7704. BrL(exit);
  7705. SetLabel(else);
  7706. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7707. Designate(p0,l);
  7708. IF needsTrace THEN
  7709. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7710. ELSE
  7711. ToMemory(l.op,addressType,0);
  7712. Emit(Mov(position,l.op,pointer));
  7713. END;
  7714. ReleaseOperand(l);
  7715. SetLabel(exit);
  7716. ELSE
  7717. (*! the following code is only correct for "standard" Oberon calling convention *)
  7718. IF SemanticChecker.ContainsPointer(type) THEN
  7719. IF type IS SyntaxTree.ArrayType THEN
  7720. staticLength := 1;
  7721. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7722. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7723. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7724. END;
  7725. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7726. MulInt(reg,reg,tmp);
  7727. END;
  7728. Designate(p0,l);
  7729. IF openDim > 0 THEN
  7730. Emit(Push(position,l.op)); (* address for use after syscall *)
  7731. END;
  7732. Emit(Push(position,l.op)); (* address *)
  7733. ReleaseOperand(l);
  7734. tmp := TypeDescriptorAdr(type);
  7735. Emit(Push(position,tmp)); (* type descriptor *)
  7736. ReleaseIntermediateOperand(tmp);
  7737. Emit(Push(position,reg)); (* number Elements *)
  7738. ReleaseIntermediateOperand(reg);
  7739. tmp := IntermediateCode.Immediate(addressType,dim);
  7740. Emit(Push(position,tmp)); (* dimensions *)
  7741. (* push realtime flag *)
  7742. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7743. ELSE Emit(Push(position,false));
  7744. END;
  7745. CallThis(position,"Heaps","NewArr",5)
  7746. ELSE
  7747. size := ToMemoryUnits(system,system.SizeOf(type));
  7748. IF (size # 1) THEN
  7749. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7750. (*
  7751. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7752. *)
  7753. END;
  7754. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7755. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7756. AddInt(reg, reg, tmp);
  7757. (*
  7758. Emit(Add(position,reg,reg,tmp));
  7759. *)
  7760. Designate(p0,l);
  7761. IF openDim >0 THEN
  7762. Emit(Push(position,l.op)); (* address for use after syscall *)
  7763. END;
  7764. Emit(Push(position,l.op)); (* address for syscall *)
  7765. ReleaseOperand(l); (* pointer address *)
  7766. Emit(Push(position,reg)); (* size *)
  7767. ReleaseIntermediateOperand(reg);
  7768. (* push realtime flag *)
  7769. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7770. ELSE Emit(Push(position,false));
  7771. END;
  7772. CallThis(position,"Heaps","NewSys", 3)
  7773. END;
  7774. IF openDim > 0 THEN
  7775. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7776. Emit(Pop(position,adr));
  7777. ToMemory(adr,addressType,0);
  7778. ReuseCopy(tmp,adr);
  7779. ReleaseIntermediateOperand(adr);
  7780. adr := tmp;
  7781. else := NewLabel();
  7782. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7783. i := openDim-1;
  7784. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7785. WHILE (i >= 0) DO
  7786. Emit(Pop(position,reg));
  7787. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7788. Emit(Mov(position,res,reg));
  7789. DEC(i);
  7790. END;
  7791. ReleaseIntermediateOperand(adr);
  7792. ReleaseIntermediateOperand(reg);
  7793. exit := NewLabel();
  7794. BrL(exit);
  7795. SetLabel(else);
  7796. (* else part: array could not be allocated *)
  7797. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7798. Emit(Add(position,sp,sp,tmp));
  7799. SetLabel(exit);
  7800. END;
  7801. END;
  7802. END;
  7803. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7804. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7805. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7806. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7807. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7808. callingConvention := procedureType.callingConvention;
  7809. left.SetType(procedure.type);
  7810. formalParameter := procedureType.firstParameter;
  7811. (* push array to allocate *)
  7812. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  7813. formalParameter :=formalParameter.nextParameter;
  7814. (* push length array *)
  7815. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  7816. (* push size *)
  7817. type := t0;
  7818. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7819. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7820. END;
  7821. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7822. Emit(Push(position,tmp));
  7823. (* *)
  7824. IF SemanticChecker.ContainsPointer(type) THEN
  7825. tmp := TypeDescriptorAdr(type);
  7826. ELSE
  7827. tmp := IntermediateCode.Immediate(addressType, 0);
  7828. END;
  7829. Emit(Push(position,tmp)); (* type descriptor *)
  7830. StaticCallOperand(result,procedure);
  7831. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7832. ReleaseOperand(result);
  7833. END;
  7834. (*
  7835. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7836. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7837. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7838. *)
  7839. ELSE
  7840. (*
  7841. push len0
  7842. push len1
  7843. push len2
  7844. push size
  7845. push len_adr
  7846. push element_size
  7847. push tag
  7848. push adr
  7849. *)
  7850. dim := 0;
  7851. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7852. isTensor := TRUE;
  7853. ELSE
  7854. isTensor := FALSE;
  7855. END;
  7856. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7857. IF ~isTensor THEN
  7858. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7859. END;
  7860. parameter := x.parameters.GetExpression(i);
  7861. Evaluate(parameter,r);
  7862. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7863. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7864. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7865. END;
  7866. Emit(Push(position,r.op));
  7867. ReleaseOperand(r);
  7868. INC(dim);
  7869. END;
  7870. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7871. Emit(Mov(position, adr, sp));
  7872. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7873. Emit(Push(position, adr));
  7874. ReleaseIntermediateOperand(adr);
  7875. openDim := dim;
  7876. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7877. IF isTensor THEN
  7878. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7879. ELSE
  7880. baseType := SemanticChecker.ArrayBase(type,openDim);
  7881. END;
  7882. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7883. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7884. IF SemanticChecker.ContainsPointer(baseType) THEN
  7885. tmp := TypeDescriptorAdr(baseType);
  7886. ELSE
  7887. tmp := nil;
  7888. END;
  7889. Emit(Push(position,tmp)); (* type descriptor *)
  7890. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7891. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7892. ELSE (* error message has already been emited *)
  7893. RETURN;
  7894. END;
  7895. Designate(p0,l);
  7896. IF isTensor THEN
  7897. Emit(Push(position,l.op)); (* address *)
  7898. ELSE
  7899. Emit(Push(position,l.tag)); (* address *)
  7900. END;
  7901. ReleaseOperand(l);
  7902. StaticCallOperand(result,procedure);
  7903. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7904. ReleaseOperand(result);
  7905. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7906. Emit(Add(position,sp,sp,tmp));
  7907. END;
  7908. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7909. THEN
  7910. IF ~backend.cellsAreObjects THEN RETURN END;
  7911. IF InCellScope(currentScope) THEN
  7912. PushSelfPointer()
  7913. ELSE
  7914. Emit(Push(position, nil));
  7915. END;
  7916. (* push temp address *)
  7917. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7918. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7919. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7920. (* l.op contains address of pointer to record *)
  7921. Emit(Push(position,l.op)); (* address for use after syscall *)
  7922. ReleaseOperand(l);
  7923. (* push type descriptor *)
  7924. reg := TypeDescriptorAdr(baseType);
  7925. Emit(Push(position,reg));
  7926. ReleaseIntermediateOperand(reg);
  7927. (* push name *)
  7928. (*Global.GetSymbolName(p0, n);*)
  7929. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7930. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7931. ELSE
  7932. Global.GetModuleName(module.module, n);
  7933. END;
  7934. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7935. (*type.typeDeclaration.GetName(n);*)
  7936. PushConstString(n);
  7937. (* push cellnet boolean *)
  7938. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7939. (* push engine boolean *)
  7940. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7941. (* allocate *)
  7942. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7943. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7944. (* l.op contains address of pointer to record *)
  7945. ToMemory(l.op,addressType,0);
  7946. (* l.op contains value of pointer to record *)
  7947. InitFields(baseType, l.op,0);
  7948. (* add capabilities *)
  7949. modifier := p0(SyntaxTree.Designator).modifiers;
  7950. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7951. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7952. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7953. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7954. END;
  7955. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7956. (*
  7957. modifier := baseType(SyntaxTree.CellType).modifiers;
  7958. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7959. modifier := p0(SyntaxTree.Designator).modifiers;
  7960. *)
  7961. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7962. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7963. (* l.op contains address of pointer to record *)
  7964. ToMemory(l.op,addressType,0);
  7965. (* l.op contains value of pointer to record *)
  7966. Emit(Push(position,l.op)); (* address for use after syscall *)
  7967. ReleaseOperand(l);
  7968. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7969. prevScope := currentScope;
  7970. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7971. previous := section;
  7972. section := init;
  7973. (* add ports *)
  7974. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7975. CloseInitializer(previous);
  7976. currentScope := prevScope;
  7977. Symbol(temporaryVariable,l);
  7978. ToMemory(l.op,addressType,0);
  7979. Emit(Push(position,l.op));
  7980. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7981. (*
  7982. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7983. IF constructor # NIL THEN
  7984. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7985. FOR i := 1 TO x.parameters.Length()-1 DO
  7986. p := x.parameters.GetExpression(i);
  7987. Global.GetSymbolName(parameter,name);
  7988. Evaluate(p, value);
  7989. ASSERT(value.type # NIL);
  7990. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7991. par := instance.AddParameter(name);
  7992. par.SetInteger(value.integer);
  7993. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7994. par := instance.AddParameter(name);
  7995. par.SetBoolean(value.boolean);
  7996. ELSE Error(x.position,NotYetImplemented)
  7997. END;
  7998. parameter := parameter.nextParameter
  7999. END;
  8000. END;
  8001. *)
  8002. (* call initializer *)
  8003. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8004. IF constructor # NIL THEN
  8005. (*! should be unified with ProcedureCallDesignator *)
  8006. IF backend.cellsAreObjects THEN
  8007. Symbol(temporaryVariable,l);
  8008. ToMemory(l.op,addressType,0);
  8009. Emit(Push(position,l.op));
  8010. ReleaseOperand(l);
  8011. END;
  8012. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8013. FOR i := firstPar TO x.parameters.Length()-1 DO
  8014. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8015. formalParameter := formalParameter.nextParameter;
  8016. END;
  8017. (* static call of the constructor *)
  8018. Global.GetSymbolSegmentedName(constructor,name);
  8019. ASSERT(~constructor.isInline);
  8020. IF constructor.scope.ownerModule # module.module THEN
  8021. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8022. ELSE
  8023. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8024. END;
  8025. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8026. (*ELSE
  8027. ReleaseIntermediateOperand(pointer);*)
  8028. END;
  8029. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8030. ToMemory(l.op, addressType, 0);
  8031. Designate(p0,s0);
  8032. ToMemory(s0.op,addressType,0);
  8033. Emit(Mov(position,s0.op,l.op));
  8034. ReleaseOperand(l);
  8035. ReleaseOperand(s0);
  8036. result.tag := emptyOperand;
  8037. (* start *)
  8038. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8039. (* push cell *)
  8040. Symbol(temporaryVariable, l);
  8041. ToMemory(l.op,addressType,0);
  8042. Emit(Push(Basic.invalidPosition,l.op));
  8043. (* push delegate *)
  8044. Emit(Push(Basic.invalidPosition,l.op));
  8045. ReleaseOperand(l);
  8046. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8047. Emit(Push(position, s1.op));
  8048. ReleaseOperand(s1);
  8049. CallThis(position,"ActiveCellsRuntime","Start",3);
  8050. END;
  8051. (*IF temporaryVariable # NIL THEN
  8052. end := NewLabel();
  8053. BrL(end);
  8054. SetLabel(exit);
  8055. Designate(p0,l);
  8056. ToMemory(l.op,addressType,0);
  8057. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8058. ReleaseOperand(l);
  8059. SetLabel(end);
  8060. ELSE
  8061. SetLabel(exit);
  8062. END;
  8063. *)
  8064. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8065. ELSE (* no pointer to record, no pointer to array *)
  8066. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8067. (* ignore new statement *)
  8068. Warning(p0.position, "cannot run on final hardware");
  8069. ELSE
  8070. HALT(200);
  8071. END;
  8072. END;
  8073. (* ---- ADDRESSOF----- *)
  8074. |Global.systemAdr:
  8075. Designate(p0,s0);
  8076. s0.mode := ModeValue;
  8077. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8078. ReleaseIntermediateOperand(s0.op);
  8079. s0.op := s0.tag;
  8080. IntermediateCode.InitOperand(s0.tag);
  8081. END;
  8082. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8083. result := s0;
  8084. (* ---- BIT ----- *)
  8085. |Global.systemBit:
  8086. Evaluate(p0,s0);
  8087. ToMemory(s0.op,addressType,0);
  8088. ReuseCopy(res,s0.op);
  8089. ReleaseOperand(s0);
  8090. Evaluate(p1,s1);
  8091. Emit(Ror(position,res,res,s1.op));
  8092. ReleaseOperand(s1);
  8093. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8094. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8095. IF ~conditional THEN
  8096. InitOperand(result,ModeValue); result.op := res;
  8097. ELSE
  8098. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8099. BrL(falseLabel);
  8100. ReleaseIntermediateOperand(res);
  8101. END;
  8102. (* --- MSK ----*)
  8103. |Global.systemMsk:
  8104. Evaluate(p0,s0);
  8105. Evaluate(p1,s1);
  8106. ReuseCopy(res,s0.op);
  8107. ReleaseOperand(s0);
  8108. Emit(And(position,res,res,s1.op));
  8109. ReleaseOperand(s1);
  8110. InitOperand(result,ModeValue);
  8111. result.op := res;
  8112. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8113. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8114. Evaluate(p0,s0);
  8115. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8116. ReleaseOperand(s0);
  8117. InitOperand(result,ModeValue);
  8118. result.op := res;
  8119. (* ---- SYSTEM.GetStackPointer ----- *)
  8120. |Global.systemGetStackPointer:
  8121. InitOperand(result,ModeValue);
  8122. result.op := sp;
  8123. (* ---- SYSTEM.GetFramePointer ----- *)
  8124. |Global.systemGetFramePointer:
  8125. InitOperand(result,ModeValue);
  8126. result.op := fp;
  8127. (* ---- SYSTEM.GetActivity ----- *)
  8128. |Global.systemGetActivity:
  8129. ASSERT(backend.cooperative);
  8130. InitOperand(result,ModeValue);
  8131. result.op := ap;
  8132. (* ---- SYSTEM.SetStackPointer ----- *)
  8133. |Global.systemSetStackPointer:
  8134. Evaluate(p0,s0); (* *)
  8135. Emit(Mov(position,sp,s0.op));
  8136. ReleaseOperand(s0);
  8137. (* ---- SYSTEM.SetFramePointer ----- *)
  8138. |Global.systemSetFramePointer:
  8139. Evaluate(p0,s0); (* *)
  8140. Emit(Mov(position,fp,s0.op));
  8141. ReleaseOperand(s0);
  8142. (* ---- SYSTEM.Activity ----- *)
  8143. |Global.systemSetActivity:
  8144. ASSERT(backend.cooperative);
  8145. Evaluate(p0,s0); (* *)
  8146. Emit(Mov(position,ap,s0.op));
  8147. ReleaseOperand(s0);
  8148. (* ---- SYSTEM.VAL ----- *)
  8149. |Global.systemVal:
  8150. Expression(p1);
  8151. s1 := result;
  8152. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8153. IF s1.mode = ModeReference THEN
  8154. (* nothing to be done if not record type, just take over new type *)
  8155. IF (type IS SyntaxTree.RecordType) THEN
  8156. ReleaseIntermediateOperand(s1.tag);
  8157. s1.tag := TypeDescriptorAdr(type);
  8158. UseIntermediateOperand(s1.tag);
  8159. END;
  8160. result := s1;
  8161. ELSE (* copy over result to different type, may not use convert *)
  8162. itype := IntermediateCode.GetType(system,type);
  8163. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8164. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8165. Emit(Mov(position,s0.op,s1.op));
  8166. ReleaseOperand(s1);
  8167. InitOperand(result,ModeValue);
  8168. result.op := s0.op;
  8169. ELSE (* different size, must convert *)
  8170. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8171. Convert(s1.op, IntermediateCode.GetType(system,type));
  8172. result := s1;
  8173. END;
  8174. END;
  8175. (* ---- SYSTEM.GET ----- *)
  8176. |Global.systemGet:
  8177. Evaluate(p0,s0); (* adr *)
  8178. Designate(p1,s1); (* variable *)
  8179. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8180. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8181. Emit(Mov(position,s1.op,s0.op));
  8182. ReleaseOperand(s1);
  8183. ReleaseOperand(s0);
  8184. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8185. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8186. Evaluate(p0,s0); (* *)
  8187. Evaluate(p1,s1); (* variable *)
  8188. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8189. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8190. (* real part *)
  8191. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8192. Emit(Mov(position,res, s1.op));
  8193. ReleaseIntermediateOperand(res);
  8194. (* imaginary part *)
  8195. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8196. Emit(Mov(position,res, s1.tag));
  8197. ReleaseIntermediateOperand(res);
  8198. ReleaseOperand(s1);
  8199. ReleaseOperand(s0);
  8200. ELSE
  8201. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8202. ReleaseOperand(s0);
  8203. Emit(Mov(position,res,s1.op));
  8204. ReleaseIntermediateOperand(res);
  8205. ReleaseOperand(s1);
  8206. END;
  8207. (* ---- SYSTEM.MOVE ----- *)
  8208. |Global.systemMove:
  8209. Evaluate(p0,s0);
  8210. Evaluate(p1,s1);
  8211. Evaluate(p2,s2);
  8212. Emit(Copy(position,s1.op,s0.op,s2.op));
  8213. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8214. (* ---- SYSTEM.NEW ----- *)
  8215. |Global.systemNew:
  8216. Designate(p0,s0);
  8217. Emit(Push(position,s0.op));
  8218. ReleaseOperand(s0);
  8219. Evaluate(p1,s1);
  8220. Emit(Push(position,s1.op));
  8221. ReleaseOperand(s1);
  8222. (* push realtime flag: false by default *)
  8223. Emit(Push(position,false));
  8224. CallThis(position,"Heaps","NewSys",3);
  8225. (* ---- SYSTEM.CALL ----- *)
  8226. |Global.systemRef:
  8227. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8228. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8229. s0.mode := ModeValue;
  8230. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8231. result := s0
  8232. (* ---- INCR ----- *)
  8233. |Global.Incr:
  8234. Designate(p0,operand);
  8235. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8236. Dereference(operand,p0.type.resolved,FALSE);
  8237. END;
  8238. ASSERT(p1 # NIL);
  8239. Evaluate(p1,l);
  8240. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8241. ReleaseOperand(operand); ReleaseOperand(l);
  8242. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8243. (* ---- SUM ----- *)
  8244. |Global.Sum: HALT(200);
  8245. (* ---- ALL ----- *)
  8246. |Global.All: HALT(200);
  8247. (* ---- CAS ----- *)
  8248. |Global.Cas:
  8249. needsTrace := p0.NeedsTrace();
  8250. IF needsTrace THEN ModifyAssignments(true) END;
  8251. Designate(p0,s0);
  8252. Evaluate(p1,s1);
  8253. Evaluate(p2,s2);
  8254. IF needsTrace THEN
  8255. Emit(Push(position, s0.op));
  8256. Emit(Push(position, s1.op));
  8257. Emit(Push(position, s2.op));
  8258. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8259. ELSE
  8260. Emit(Cas(position,s0.op,s1.op,s2.op));
  8261. END;
  8262. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8263. IF needsTrace THEN ModifyAssignments(false) END;
  8264. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8265. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8266. IF conditional THEN
  8267. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8268. BrL(falseLabel);
  8269. ReleaseIntermediateOperand(res);
  8270. END;
  8271. (* ---- DIM ----- *)
  8272. |Global.Dim:
  8273. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8274. Designate(p0,s0);
  8275. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8276. Dereference(s0,p0.type.resolved,FALSE);
  8277. END;
  8278. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8279. ReleaseOperand(s0);
  8280. (* ---- RESHAPE ----- *)
  8281. |Global.Reshape:
  8282. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8283. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8284. left.SetType(procedure.type);
  8285. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8286. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8287. END;
  8288. (* ---- SYSTEM.TYPECODE ----- *)
  8289. |Global.systemTypeCode:
  8290. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8291. IF type.resolved IS SyntaxTree.PointerType THEN
  8292. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8293. END;
  8294. result.op := TypeDescriptorAdr(type);
  8295. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8296. result.mode := ModeValue;
  8297. (* ---- SYSTEM.TRACE ----- *)
  8298. |Global.systemTrace:
  8299. SystemTrace(x.parameters, x.position);
  8300. (* ----- CONNECT ------*)
  8301. |Global.Connect:
  8302. IF backend.cellsAreObjects THEN
  8303. PushPort(p0);
  8304. PushPort(p1);
  8305. IF p2 # NIL THEN
  8306. Evaluate(p2, s2);
  8307. Emit(Push(p2.position, s2.op));
  8308. ReleaseOperand(s2);
  8309. ELSE
  8310. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8311. END;
  8312. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8313. ELSE
  8314. Warning(x.position, "cannot run on final hardware");
  8315. END;
  8316. (* ----- DELEGATE ------*)
  8317. |Global.Delegate:
  8318. IF backend.cellsAreObjects THEN
  8319. PushPort(p0);
  8320. PushPort(p1);
  8321. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8322. ELSE
  8323. Warning(x.position, "cannot run on final hardware");
  8324. END;
  8325. (* ----- SEND ------*)
  8326. |Global.Send:
  8327. Evaluate(p0,s0);
  8328. Evaluate(p1,s1);
  8329. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8330. Emit(Push(position,s0.op));
  8331. Emit(Push(position,s1.op));
  8332. (*
  8333. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8334. *)
  8335. IF ~backend.cellsAreObjects THEN
  8336. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8337. END;
  8338. ReleaseOperand(s0);
  8339. ReleaseOperand(s1);
  8340. IF backend.cellsAreObjects THEN
  8341. CallThis(position,"ActiveCellsRuntime","Send",2);
  8342. ELSE
  8343. CallThis(position,ChannelModuleName,"Send",2);
  8344. END;
  8345. (* ----- RECEIVE ------*)
  8346. |Global.Receive:
  8347. Evaluate(p0,s0);
  8348. Emit(Push(position,s0.op));
  8349. Designate(p1,s1);
  8350. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8351. Emit(Push(position,s1.op));
  8352. IF p2 # NIL THEN
  8353. Designate(p2,s2);
  8354. Emit(Push(position,s2.op));
  8355. END;
  8356. (*
  8357. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8358. *)
  8359. IF ~backend.cellsAreObjects THEN
  8360. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8361. END;
  8362. ReleaseOperand(s0);
  8363. ReleaseOperand(s1);
  8364. ReleaseOperand(s2);
  8365. IF backend.cellsAreObjects THEN
  8366. IF p2 = NIL THEN
  8367. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8368. ELSE
  8369. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8370. END;
  8371. ELSE
  8372. IF p2 = NIL THEN
  8373. CallThis(position,ChannelModuleName,"Receive",2)
  8374. ELSE
  8375. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8376. END;
  8377. END;
  8378. | Global.systemSpecial:
  8379. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8380. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8381. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8382. (* determine if parameters are of the VAR kind *)
  8383. ASSERT(x.parameters.Length() <= 3);
  8384. formalParameter := procedureType.firstParameter;
  8385. FOR i := 0 TO x.parameters.Length() - 1 DO
  8386. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8387. formalParameter := formalParameter.nextParameter
  8388. END;
  8389. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8390. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8391. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8392. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8393. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8394. IF procedureType.returnType # NIL THEN
  8395. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8396. Emit(Result(position, res));
  8397. (*InitOperand(result,ModeValue);
  8398. result.op := res;
  8399. *)
  8400. IF ~conditional THEN
  8401. InitOperand(result,ModeValue); result.op := res;
  8402. ELSE
  8403. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8404. BrL(falseLabel);
  8405. ReleaseIntermediateOperand(res);
  8406. END;
  8407. END
  8408. ELSE (* function not yet implemented *)
  8409. Error(position,"not yet implemented");
  8410. END;
  8411. destination := dest;
  8412. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8413. END VisitBuiltinCallDesignator;
  8414. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8415. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8416. BEGIN
  8417. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8418. dest := destination; destination := emptyOperand;
  8419. Expression(x.left);
  8420. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8421. ELSIF isUnchecked THEN (* no check *)
  8422. ELSE
  8423. trueL := NewLabel();
  8424. falseL := NewLabel();
  8425. IF IsPointerToRecord(x.left.type,recordType) THEN
  8426. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8427. Emit(Mov(position,tag, result.op));
  8428. IF result.mode # ModeValue THEN
  8429. ptr := tag;
  8430. IntermediateCode.MakeMemory(ptr,addressType);
  8431. Emit(Mov(position,tag, ptr));
  8432. END;
  8433. IF ~backend.cooperative THEN
  8434. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8435. END;
  8436. IntermediateCode.MakeMemory(tag,addressType);
  8437. ELSE
  8438. tag := result.tag;
  8439. UseIntermediateOperand(tag);
  8440. END;
  8441. TypeTest(tag,x.type,trueL,falseL);
  8442. ReleaseIntermediateOperand(tag);
  8443. SetLabel(falseL);
  8444. EmitTrap(position,TypeCheckTrap);
  8445. SetLabel(trueL);
  8446. END;
  8447. destination := dest;
  8448. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8449. END VisitTypeGuardDesignator;
  8450. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8451. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8452. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8453. VAR label: Label; pc: LONGINT;
  8454. BEGIN
  8455. IF backend.cooperative & ~isUnchecked THEN
  8456. pc := section.pc;
  8457. label := NewLabel();
  8458. BrneL(label, operand.op, nil);
  8459. EmitTrap(position, NilPointerTrap);
  8460. SetLabel(label);
  8461. INC(statCoopNilCheck, section.pc - pc);
  8462. END;
  8463. END NilCheck;
  8464. BEGIN
  8465. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8466. ReuseCopy(dereferenced,operand.op);
  8467. ReleaseOperand(operand);
  8468. operand.mode := ModeReference;
  8469. operand.op := dereferenced;
  8470. operand.tag := dereferenced;
  8471. UseIntermediateOperand(operand.tag);
  8472. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8473. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8474. ReleaseIntermediateOperand(operand.tag);
  8475. operand.tag := TypeDescriptorAdr(type);
  8476. ELSE
  8477. IF ~backend.cooperative THEN
  8478. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8479. END;
  8480. IntermediateCode.MakeMemory(operand.tag,addressType);
  8481. END;
  8482. NilCheck(operand.op);
  8483. ELSIF type IS SyntaxTree.ArrayType THEN
  8484. IF isUnsafe THEN
  8485. NilCheck(operand.op);
  8486. ReleaseIntermediateOperand(operand.tag);
  8487. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8488. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8489. ELSE
  8490. operand.tag := emptyOperand;
  8491. END;
  8492. ELSE
  8493. NilCheck(operand.op);
  8494. IF backend.cooperative THEN
  8495. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8496. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8497. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8498. ELSE
  8499. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8500. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8501. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8502. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8503. END;
  8504. END;
  8505. ELSIF type IS SyntaxTree.MathArrayType THEN
  8506. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8507. IntermediateCode.MakeMemory(operand.op,addressType);
  8508. ELSE HALT(100);
  8509. END;
  8510. END Dereference;
  8511. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8512. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8513. BEGIN
  8514. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8515. dest := destination; destination := emptyOperand;
  8516. Evaluate(x.left,d);
  8517. type := x.type.resolved;
  8518. prevIsUnchecked := isUnchecked;
  8519. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8520. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8521. END;
  8522. Dereference(d,type,IsUnsafePointer(x.left.type));
  8523. isUnchecked := prevIsUnchecked;
  8524. result := d;
  8525. 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
  8526. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8527. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8528. END;
  8529. END;
  8530. destination := dest;
  8531. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8532. END VisitDereferenceDesignator;
  8533. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8534. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8535. BEGIN
  8536. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8537. dest := destination; destination := emptyOperand;
  8538. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8539. tag := result.op;
  8540. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8541. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8542. StaticCallOperand(result,procedure.super);
  8543. ReleaseIntermediateOperand(result.tag);
  8544. UseIntermediateOperand(tag); (* necessary ? *)
  8545. result.tag := tag;
  8546. destination := dest;
  8547. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8548. END VisitSupercallDesignator;
  8549. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8550. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8551. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8552. name: Basic.SegmentedName;
  8553. procedure: SyntaxTree.Procedure;
  8554. procedureType: SyntaxTree.ProcedureType;
  8555. BEGIN
  8556. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8557. dest := destination; destination := emptyOperand;
  8558. scope := currentScope;
  8559. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8560. scope := scope.outerScope;
  8561. END;
  8562. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8563. moduleSection := meta.ModuleSection();
  8564. IF backend.cooperative THEN
  8565. moduleOffset := 0;
  8566. ELSE
  8567. moduleOffset := moduleSection.pc;
  8568. END;
  8569. result.mode := ModeValue;
  8570. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8571. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8572. result.mode := ModeValue;
  8573. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8574. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8575. ELSE
  8576. GetBaseRegister(basereg,currentScope,scope);
  8577. InitOperand(result,ModeReference);
  8578. result.op := basereg;
  8579. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8580. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8581. parametersSize := ProcParametersSize(procedure);
  8582. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8583. IF backend.cooperative THEN
  8584. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8585. END;
  8586. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8587. MakeMemory(result.op, result.op, addressType, 0);
  8588. END;
  8589. (* tag must be loaded when dereferencing SELF pointer *)
  8590. END;
  8591. destination := dest;
  8592. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8593. END VisitSelfDesignator;
  8594. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8595. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8596. BEGIN
  8597. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8598. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8599. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8600. parameter := procedureType.returnParameter;
  8601. IF currentIsInline THEN
  8602. map := currentMapper.Get(NIL);
  8603. IF map # NIL THEN
  8604. Designate(map.to, result);
  8605. ELSE
  8606. HALT(200);
  8607. END;
  8608. RETURN;
  8609. END;
  8610. VisitParameter(parameter);
  8611. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8612. END VisitResultDesignator;
  8613. (** values *)
  8614. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8615. BEGIN
  8616. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8617. IF conditional THEN
  8618. IF x.value THEN BrL(trueLabel)
  8619. ELSE BrL(falseLabel)
  8620. END;
  8621. ELSE
  8622. InitOperand(result,ModeValue);
  8623. IF x.value THEN result.op := true ELSE result.op := false END;
  8624. END;
  8625. END VisitBooleanValue;
  8626. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8627. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8628. BEGIN
  8629. Global.GetModuleSegmentedName(module.module, name);
  8630. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8631. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8632. RETURN section
  8633. END GetDataSection;
  8634. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8635. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8636. BEGIN
  8637. type := vop.type;
  8638. data := GetDataSection();
  8639. pc := EnterImmediate(data,vop);
  8640. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8641. IntermediateCode.MakeMemory(vop, type);
  8642. END GetImmediateMem;
  8643. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8644. BEGIN
  8645. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8646. InitOperand(result,ModeValue);
  8647. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8648. IF ~supportedImmediate(result.op) &~inData THEN
  8649. GetImmediateMem(result.op)
  8650. END;
  8651. END VisitIntegerValue;
  8652. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8653. BEGIN
  8654. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8655. InitOperand(result,ModeValue);
  8656. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8657. END VisitCharacterValue;
  8658. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8659. BEGIN
  8660. IF Trace THEN TraceEnter("VisitSetValue") END;
  8661. InitOperand(result,ModeValue);
  8662. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  8663. END VisitSetValue;
  8664. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8665. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8666. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8667. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8668. BEGIN
  8669. numberElements := x.elements.Length();
  8670. FOR i := 0 TO numberElements-1 DO
  8671. expression := x.elements.GetExpression(i);
  8672. IF expression IS SyntaxTree.MathArrayExpression THEN
  8673. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8674. ELSE
  8675. inData := TRUE;
  8676. Evaluate(expression,op);
  8677. irv.Emit(Data(position,op.op));
  8678. inData := FALSE;
  8679. ReleaseOperand(op);
  8680. END;
  8681. END;
  8682. END RecursiveData;
  8683. BEGIN
  8684. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8685. IF ~TryConstantDeclaration() THEN
  8686. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8687. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8688. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8689. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8690. ELSE
  8691. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8692. END;
  8693. RecursiveData(x.array);
  8694. InitOperand(result,ModeReference);
  8695. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8696. END
  8697. END VisitMathArrayValue;
  8698. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8699. VAR constant: Sections.Section;
  8700. BEGIN
  8701. IF constantDeclaration = NIL THEN
  8702. RETURN FALSE
  8703. ELSE
  8704. (* Is a constant in this module: did we generate it already? *)
  8705. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8706. IF constant # NIL THEN
  8707. InitOperand(result,ModeReference);
  8708. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8709. RETURN TRUE;
  8710. END;
  8711. END;
  8712. RETURN FALSE
  8713. END TryConstantDeclaration;
  8714. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8715. BEGIN
  8716. constantDeclaration := x;
  8717. x.value.resolved.Accept(SELF);
  8718. END VisitConstant;
  8719. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8720. BEGIN
  8721. IF Trace THEN TraceEnter("VisitRealValue") END;
  8722. InitOperand(result,ModeValue);
  8723. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8724. END VisitRealValue;
  8725. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8726. VAR
  8727. componentType: SyntaxTree.Type;
  8728. BEGIN
  8729. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8730. ASSERT(x.type IS SyntaxTree.ComplexType);
  8731. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8732. InitOperand(result,ModeValue);
  8733. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8734. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8735. END VisitComplexValue;
  8736. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8737. VAR i: LONGINT; name: Basic.SegmentedName;
  8738. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8739. BEGIN
  8740. IF Trace THEN TraceEnter("VisitStringValue") END;
  8741. IF ~TryConstantDeclaration() THEN
  8742. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8743. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8744. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8745. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8746. ELSE
  8747. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8748. END;
  8749. FOR i := 0 TO x.length-1 DO
  8750. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8751. irv.Emit(Data(position,op));
  8752. END;
  8753. InitOperand(result,ModeReference);
  8754. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8755. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8756. END
  8757. END VisitStringValue;
  8758. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8759. BEGIN
  8760. IF Trace THEN TraceEnter("VisitNilValue") END;
  8761. InitOperand(result,ModeValue);
  8762. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8763. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8764. END VisitNilValue;
  8765. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8766. BEGIN
  8767. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8768. InitOperand(result,ModeValue);
  8769. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8770. END VisitEnumerationValue;
  8771. (** symbols *)
  8772. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8773. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8774. END VisitImport;
  8775. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8776. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8777. BEGIN
  8778. IF scope # baseScope THEN
  8779. (* left := [fp+8] *)
  8780. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8781. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8782. ReuseCopy(left,right);
  8783. ReleaseIntermediateOperand(right);
  8784. scope := scope.outerScope; DEC(level);
  8785. (* { left := [left+8] } *)
  8786. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8787. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8788. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8789. Emit(Mov(position,left,right));
  8790. scope := scope.outerScope; DEC(level);
  8791. END;
  8792. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8793. result := left;
  8794. ELSE
  8795. result := fp;
  8796. END;
  8797. END GetBaseRegister;
  8798. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8799. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8800. BEGIN
  8801. IF Trace THEN TraceEnter("VisitVariable"); END;
  8802. type := x.type.resolved;
  8803. IF (x.useRegister) THEN
  8804. InitOperand(result, ModeValue);
  8805. IF x.registerNumber < 0 THEN
  8806. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8807. reg := x.registerNumber;
  8808. ELSE
  8809. reg := registerUsageCount.Map(x.registerNumber);
  8810. UseRegister(reg);
  8811. END;
  8812. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8813. ELSIF x.externalName # NIL THEN
  8814. InitOperand(result,ModeReference);
  8815. Basic.ToSegmentedName(x.externalName^, name);
  8816. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8817. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8818. InitOperand(result,ModeReference);
  8819. GetBaseRegister(result.op,currentScope,x.scope);
  8820. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8821. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8822. InitOperand(result,ModeReference);
  8823. GetCodeSectionNameForSymbol(x,name);
  8824. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8825. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8826. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8827. InitOperand(result,ModeReference);
  8828. GetCodeSectionNameForSymbol(x,name);
  8829. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8830. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8831. ELSE (* field, left designator must have been emitted *)
  8832. ASSERT(result.mode = ModeReference);
  8833. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8834. ReuseCopy(temp,result.op);
  8835. ReleaseIntermediateOperand(result.op);
  8836. result.op := temp;
  8837. END;
  8838. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8839. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8840. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8841. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8842. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8843. END;
  8844. END;
  8845. END;
  8846. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8847. ValueToCondition(result);
  8848. ELSIF type IS SyntaxTree.ProcedureType THEN
  8849. ReleaseIntermediateOperand(result.tag);
  8850. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8851. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8852. UseIntermediateOperand(result.tag);
  8853. ELSE
  8854. result.tag := nil; (* nil *)
  8855. END;
  8856. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8857. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8858. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8859. ReleaseIntermediateOperand(result.tag);
  8860. Global.GetSymbolSegmentedName(x,name);
  8861. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8862. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8863. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8864. ELSE
  8865. END;
  8866. ELSE
  8867. ReleaseIntermediateOperand(result.tag);
  8868. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8869. END;
  8870. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8871. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8872. ReleaseIntermediateOperand(result.tag);
  8873. result.tag := result.op;
  8874. UseIntermediateOperand(result.tag);
  8875. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8876. IntermediateCode.MakeMemory(result.op,addressType);
  8877. END;
  8878. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8879. ReleaseIntermediateOperand(result.tag);
  8880. result.tag := TypeDescriptorAdr(type);
  8881. UseIntermediateOperand(result.tag);
  8882. (* tag for pointer type computed not here but during dereferencing *)
  8883. END;
  8884. IF Trace THEN TraceExit("VisitVariable") END;
  8885. END VisitVariable;
  8886. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8887. BEGIN
  8888. VisitVariable(property);
  8889. END VisitProperty;
  8890. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8891. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8892. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8893. BEGIN
  8894. type := x.type.resolved;
  8895. IF Trace THEN TraceEnter("VisitParameter") END;
  8896. IF x.ownerType IS SyntaxTree.CellType THEN
  8897. ptype := x.type.resolved;
  8898. IF backend.cellsAreObjects THEN
  8899. ASSERT(result.mode = ModeReference);
  8900. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8901. ReuseCopy(temp,result.op);
  8902. ReleaseIntermediateOperand(result.op);
  8903. result.op := temp;
  8904. END;
  8905. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8906. RETURN;
  8907. ELSE
  8908. InitOperand(result,ModeReference);
  8909. GetCodeSectionNameForSymbol(x,name);
  8910. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8911. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8912. RETURN;
  8913. END;
  8914. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8915. InitOperand(result,ModeReference);
  8916. GetCodeSectionNameForSymbol(x,name);
  8917. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8918. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8919. RETURN
  8920. ELSE
  8921. GetBaseRegister(basereg,currentScope,x.scope);
  8922. InitOperand(result,ModeReference);
  8923. result.op := basereg;
  8924. END;
  8925. IF IsOpenArray(type) THEN
  8926. result.tag := basereg;
  8927. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8928. IntermediateCode.MakeMemory(result.op,addressType);
  8929. IF Global.IsOberonProcedure(x.ownerType) THEN
  8930. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8931. UseIntermediateOperand(result.tag);
  8932. ELSE
  8933. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8934. END;
  8935. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8936. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8937. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8938. ELSIF IsStaticArray(type) THEN
  8939. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8940. IntermediateCode.MakeMemory(result.op,addressType);
  8941. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8942. ELSIF type IS SyntaxTree.MathArrayType THEN
  8943. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8944. WITH type: SyntaxTree.MathArrayType DO
  8945. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8946. IF type.form = SyntaxTree.Tensor THEN
  8947. ELSIF type.form = SyntaxTree.Open THEN
  8948. result.tag := result.op;
  8949. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8950. IntermediateCode.MakeMemory(result.op,addressType);
  8951. UseIntermediateOperand(result.tag);
  8952. ELSIF type.form = SyntaxTree.Static THEN
  8953. IF x.kind = SyntaxTree.ConstParameter THEN
  8954. IntermediateCode.MakeMemory(result.op,addressType);
  8955. END;
  8956. ELSE HALT(100)
  8957. END;
  8958. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8959. IF type.form = SyntaxTree.Tensor THEN
  8960. ToMemory(result.op,addressType,0);
  8961. ELSIF type.form = SyntaxTree.Open THEN
  8962. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8963. ReuseCopy(result.tag, mem);
  8964. ReleaseIntermediateOperand(mem);
  8965. ReleaseIntermediateOperand(result.op);
  8966. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8967. ELSIF type.form = SyntaxTree.Static THEN
  8968. IntermediateCode.MakeMemory(result.op,addressType);
  8969. ELSE HALT(100)
  8970. END;
  8971. ELSE HALT(100)
  8972. END;
  8973. END;
  8974. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8975. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8976. IntermediateCode.MakeMemory(result.op,addressType);
  8977. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8978. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8979. END;
  8980. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8981. ValueToCondition(result);
  8982. ELSIF type IS SyntaxTree.ProcedureType THEN
  8983. ReleaseIntermediateOperand(result.tag);
  8984. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8985. IF x.kind = SyntaxTree.VarParameter THEN
  8986. ReuseCopy(result.tag,result.op);
  8987. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8988. IntermediateCode.MakeMemory(result.tag,addressType);
  8989. ELSE
  8990. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8991. UseIntermediateOperand(result.tag);
  8992. END;
  8993. ELSE
  8994. result.tag := nil;
  8995. END;
  8996. (* tag for pointer type computed not here but during dereferencing *)
  8997. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  8998. ReleaseIntermediateOperand(result.tag);
  8999. result.tag := basereg;
  9000. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9001. IntermediateCode.MakeMemory(result.tag,addressType);
  9002. UseIntermediateOperand(result.tag);
  9003. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9004. ReleaseIntermediateOperand(result.tag);
  9005. result.tag := TypeDescriptorAdr(type);
  9006. UseIntermediateOperand(result.tag);
  9007. END;
  9008. IF Trace THEN TraceExit("VisitParameter") END;
  9009. END VisitParameter;
  9010. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9011. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9012. BEGIN
  9013. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9014. (* left.p: left already emitted *)
  9015. tag := result.op; (* value of pointer to left *)
  9016. (* get type desc *)
  9017. tmp := result.tag;
  9018. IntermediateCode.MakeMemory(tmp,addressType);
  9019. (* get method adr *)
  9020. Reuse1(reg,tmp);
  9021. ReleaseIntermediateOperand(tmp);
  9022. IF backend.cooperative THEN
  9023. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9024. WHILE recordType.baseType # NIL DO
  9025. recordType := recordType.GetBaseRecord ();
  9026. END;
  9027. GetRecordTypeName (recordType,name);
  9028. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9029. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9030. offset := 0;
  9031. ELSE
  9032. offset := 2;
  9033. END;
  9034. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9035. ELSIF meta.simple THEN
  9036. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9037. ELSE
  9038. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9039. END;
  9040. InitOperand(operand,ModeReference);
  9041. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9042. operand.op := reg;
  9043. operand.tag := tag;
  9044. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9045. END DynamicCallOperand;
  9046. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9047. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9048. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9049. BEGIN
  9050. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9051. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9052. tag := operand.op;
  9053. ReleaseIntermediateOperand(operand.tag);
  9054. ELSE tag := nil
  9055. END;
  9056. IF x.isInline THEN
  9057. sectionType := Sections.InlineCodeSection;
  9058. ELSE
  9059. sectionType := Sections.CodeSection;
  9060. END;
  9061. IF x.externalName # NIL THEN
  9062. Basic.ToSegmentedName(x.externalName^, name);
  9063. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9064. ELSE
  9065. GetCodeSectionNameForSymbol(x, name);
  9066. IF (x.scope.ownerModule = module.module) THEN
  9067. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9068. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9069. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9070. IF source.pc = 0 THEN (* no code yet *)
  9071. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9072. END;
  9073. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9074. bits := x.procedureScope.body.code.inlineCode;
  9075. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9076. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9077. binary.CopyBits(bits, 0, bits.GetSize());
  9078. source.SetResolved(binary);
  9079. ELSE
  9080. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9081. END;
  9082. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9083. END;
  9084. InitOperand(operand,ModeValue);
  9085. operand.op := reg;
  9086. operand.tag := tag;
  9087. IF Trace THEN TraceExit("StaticCallOperand") END;
  9088. END StaticCallOperand;
  9089. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9090. (* handle expressions of the form designator.procedure or procedure *)
  9091. BEGIN
  9092. IF Trace THEN TraceEnter("VisitProcedure") END;
  9093. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9094. DynamicCallOperand(result,x);
  9095. ELSIF x.isInline THEN
  9096. StaticCallOperand(result,x);
  9097. ELSE
  9098. StaticCallOperand(result,x);
  9099. END;
  9100. IF Trace THEN TraceExit("VisitProcedure") END;
  9101. END VisitProcedure;
  9102. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9103. BEGIN
  9104. VisitProcedure(x);
  9105. END VisitOperator;
  9106. (** statements *)
  9107. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9108. BEGIN
  9109. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9110. Expression(x.call);
  9111. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9112. ReleaseOperand(result)
  9113. END;
  9114. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9115. END VisitProcedureCallStatement;
  9116. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9117. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9118. leftBase, rightBase: SyntaxTree.Type;
  9119. procedureName,s: SyntaxTree.IdentifierString;
  9120. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9121. size: LONGINT; rightKind: LONGINT;
  9122. dummy: IntermediateCode.Operand;
  9123. CONST moduleName = "FoxArrayBase";
  9124. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9125. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9126. BEGIN
  9127. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9128. IF base IS SyntaxTree.MathArrayType THEN
  9129. base := OpenArray(base(SyntaxTree.MathArrayType));
  9130. END;
  9131. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9132. result.SetArrayBase(base);
  9133. RETURN result
  9134. END OpenArray;
  9135. BEGIN
  9136. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9137. SaveRegisters();ReleaseUsedRegisters(saved);
  9138. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9139. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9140. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9141. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9142. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9143. IF leftType.form = SyntaxTree.Tensor THEN
  9144. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9145. ELSIF leftType.form = SyntaxTree.Open THEN
  9146. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9147. ELSIF leftType.form = SyntaxTree.Static THEN
  9148. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9149. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9150. END;
  9151. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9152. IF procedure = NIL THEN
  9153. s := "Instruction not supported on target, emulation procedure ";
  9154. Strings.Append(s,moduleName);
  9155. Strings.Append(s,".");
  9156. Strings.Append(s,procedureName);
  9157. Strings.Append(s," not present");
  9158. Error(position,s);
  9159. ELSE
  9160. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9161. parameter.SetType(leftType);
  9162. parameter.SetAccess(SyntaxTree.Internal);
  9163. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9164. parameter.SetKind(rightKind);
  9165. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9166. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9167. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9168. StaticCallOperand(result,procedure);
  9169. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  9170. ReleaseOperand(result);
  9171. END;
  9172. RestoreRegisters(saved);
  9173. END;
  9174. END AssignMathArray;
  9175. VAR modifyAssignmentCounter := 0: LONGINT;
  9176. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9177. VAR processor,mem,dst: IntermediateCode.Operand;
  9178. BEGIN
  9179. IF value.intValue = true.intValue THEN
  9180. INC(modifyAssignmentCounter);
  9181. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9182. modifyAssignmentsPC := section.pc;
  9183. ELSE
  9184. DEC(modifyAssignmentCounter);
  9185. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9186. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9187. END;
  9188. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9189. dst := NewRegisterOperand (addressType);
  9190. Emit(Mov(position,dst, processor));
  9191. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9192. Emit(Mov(position,mem, value));
  9193. ReleaseIntermediateOperand(dst);
  9194. END ModifyAssignments;
  9195. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9196. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9197. BEGIN
  9198. type := left.type.resolved;
  9199. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9200. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9201. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9202. IF procedureType.returnParameter = parameter THEN
  9203. (* this is the only case where the destination can be dynamically smaller than the source
  9204. in all other cases the dynamic size has to be taken
  9205. *)
  9206. IF backend.cooperative THEN
  9207. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9208. ELSE
  9209. MakeMemory(mem, tag, addressType, 0);
  9210. END;
  9211. RETURN mem;
  9212. END;
  9213. END;
  9214. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9215. END CopySize;
  9216. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9217. VAR
  9218. leftO, rightO: Operand;
  9219. arg,mem, sizeOp: IntermediateCode.Operand;
  9220. leftType, rightType, componentType, base: SyntaxTree.Type;
  9221. size: LONGINT;
  9222. parameters: SyntaxTree.ExpressionList;
  9223. procedure: SyntaxTree.Procedure;
  9224. call: SyntaxTree.ProcedureCallDesignator;
  9225. designator: SyntaxTree.Designator;
  9226. saved: RegisterEntry;
  9227. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9228. VAR procedureType: SyntaxTree.ProcedureType;
  9229. BEGIN
  9230. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9231. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9232. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9233. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9234. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9235. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9236. IF right.id = Global.Reshape THEN RETURN TRUE
  9237. END;
  9238. END;
  9239. END;
  9240. END;
  9241. RETURN FALSE
  9242. END CanPassAsResultParameter;
  9243. BEGIN
  9244. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9245. leftType := left.type.resolved; rightType:= right.type.resolved;
  9246. IF backend.cooperative & left.NeedsTrace() THEN
  9247. ModifyAssignments(true);
  9248. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9249. Designate(right, rightO);
  9250. Designate(left, leftO);
  9251. ASSERT(leftO.mode = ModeReference);
  9252. TransferToRegister(leftO.op, leftO.op);
  9253. TransferToRegister(rightO.op, rightO.op);
  9254. Emit(Push(position, leftO.op));
  9255. Emit(Push(position, rightO.op));
  9256. CallAssignMethod(leftO.op, rightO.op, left.type);
  9257. Emit(Pop(position, rightO.op));
  9258. Emit(Pop(position, leftO.op));
  9259. sizeOp := CopySize(left, leftO.tag);
  9260. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9261. ReleaseIntermediateOperand(sizeOp);
  9262. ReleaseOperand(leftO);
  9263. ReleaseOperand(rightO);
  9264. ELSE
  9265. Evaluate(right,rightO);
  9266. Designate(left,leftO);
  9267. ASSERT(leftO.mode = ModeReference);
  9268. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9269. (* copy procedure address first *)
  9270. MakeMemory(mem,leftO.op,addressType,0);
  9271. Emit(Mov(position,mem,rightO.op));
  9272. ReleaseIntermediateOperand(mem);
  9273. (* copy pointer address *)
  9274. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9275. CallAssignPointer(leftO.tag, rightO.tag);
  9276. ELSE
  9277. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9278. CallAssignPointer(leftO.op, rightO.op);
  9279. END;
  9280. ReleaseOperand(leftO);
  9281. ReleaseOperand(rightO);
  9282. END;
  9283. ModifyAssignments(false);
  9284. RETURN;
  9285. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9286. SaveRegisters();ReleaseUsedRegisters(saved);
  9287. IF SemanticChecker.IsPointerType(leftType) THEN
  9288. Evaluate(right,rightO);
  9289. Designate(left,leftO);
  9290. Emit(Push(position,leftO.op));
  9291. ReleaseOperand(leftO);
  9292. Emit(Push(position,rightO.op));
  9293. ReleaseOperand(rightO);
  9294. CallThis(position,"Heaps","Assign",2);
  9295. ELSIF leftType.IsRecordType() THEN
  9296. Designate(right,rightO);
  9297. Designate(left,leftO);
  9298. Emit(Push(position,leftO.op));
  9299. Emit(Push(position,leftO.tag)); (* type desc *)
  9300. ReleaseOperand(leftO);
  9301. Emit(Push(position,rightO.op));
  9302. ReleaseOperand(rightO);
  9303. CallThis(position,"Heaps","AssignRecord",3);
  9304. ELSIF IsStaticArray(leftType) THEN
  9305. size := StaticArrayNumElements(leftType);
  9306. base := StaticArrayBaseType(leftType);
  9307. Designate(right,rightO);
  9308. Designate(left,leftO);
  9309. Emit(Push(position,leftO.op));
  9310. ReleaseOperand(leftO);
  9311. arg := TypeDescriptorAdr(base);
  9312. Emit(Push(position,arg));
  9313. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9314. Emit(Push(position,rightO.op));
  9315. ReleaseOperand(rightO);
  9316. CallThis(position,"Heaps","AssignArray",4);
  9317. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9318. size := StaticMathArrayNumElements(leftType);
  9319. base := StaticMathArrayBaseType(leftType);
  9320. Designate(right,rightO);
  9321. Designate(left,leftO);
  9322. Emit(Push(position,leftO.op));
  9323. ReleaseOperand(leftO);
  9324. arg := TypeDescriptorAdr(base);
  9325. Emit(Push(position,arg));
  9326. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9327. Emit(Push(position,rightO.op));
  9328. ReleaseOperand(rightO);
  9329. CallThis(position,"Heaps","AssignArray",4);
  9330. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9331. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9332. Evaluate(right,rightO);
  9333. Designate(left,leftO);
  9334. MakeMemory(mem,leftO.op,addressType,0);
  9335. Emit(Mov(position,mem,rightO.op));
  9336. ReleaseIntermediateOperand(mem);
  9337. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9338. Emit (Push(position, leftO.tag));
  9339. ReleaseOperand(leftO);
  9340. Emit (Push(position, rightO.tag));
  9341. ReleaseOperand(rightO);
  9342. CallThis(position,"Heaps","Assign", 2);
  9343. ELSE HALT(100); (* missing ? *)
  9344. END;
  9345. RestoreRegisters(saved);
  9346. RETURN;
  9347. END;
  9348. IF CanPassAsResultParameter(right) THEN
  9349. procedureResultDesignator := left(SyntaxTree.Designator);
  9350. Expression(right);
  9351. procedureResultDesignator := NIL;
  9352. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9353. (* left <-- ALIAS OF right: zerocopy *)
  9354. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9355. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9356. designator.SetType(procedure.type);
  9357. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9358. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9359. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9360. END;
  9361. ELSIF leftType IS SyntaxTree.RangeType THEN
  9362. (* LHS is of array range type *)
  9363. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9364. Evaluate(right, rightO);
  9365. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9366. (* first *)
  9367. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9368. Emit(Mov(position,mem, rightO.op));
  9369. ReleaseIntermediateOperand(mem);
  9370. (* last *)
  9371. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9372. Emit(Mov(position,mem, rightO.tag));
  9373. ReleaseIntermediateOperand(mem);
  9374. (* step *)
  9375. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9376. Emit(Mov(position,mem, rightO.extra));
  9377. ReleaseIntermediateOperand(mem);
  9378. ReleaseOperand(rightO);
  9379. ReleaseOperand(leftO)
  9380. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9381. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9382. Evaluate(right, rightO);
  9383. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9384. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9385. (* real part *)
  9386. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9387. Emit(Mov(position,mem, rightO.op));
  9388. ReleaseIntermediateOperand(mem);
  9389. (* imaginary part *)
  9390. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9391. Emit(Mov(position,mem, rightO.tag));
  9392. ReleaseIntermediateOperand(mem);
  9393. ReleaseOperand(rightO);
  9394. ReleaseOperand(leftO)
  9395. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9396. OR (leftType IS SyntaxTree.PortType) THEN
  9397. (* rightO := leftO;*)
  9398. Evaluate(right,rightO);
  9399. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9400. Designate(left,leftO);
  9401. IF leftO.mode = ModeReference THEN
  9402. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9403. destination := mem;
  9404. ELSE
  9405. destination := leftO.op;
  9406. END;
  9407. ReleaseOperand(leftO);
  9408. IF destination.mode # IntermediateCode.Undefined THEN
  9409. Emit(Mov(position,destination,rightO.op));
  9410. END;
  9411. ReleaseOperand(rightO);
  9412. ReleaseIntermediateOperand(mem);
  9413. IntermediateCode.InitOperand(destination);
  9414. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9415. Evaluate(right,rightO);
  9416. Designate(left,leftO);
  9417. MakeMemory(mem,leftO.op,addressType,0);
  9418. Emit(Mov(position,mem,rightO.op));
  9419. ReleaseIntermediateOperand(mem);
  9420. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9421. (* delegate *)
  9422. (*
  9423. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9424. *)
  9425. Emit(Mov(position,leftO.tag,rightO.tag));
  9426. END;
  9427. ReleaseOperand(leftO);
  9428. ReleaseOperand(rightO);
  9429. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9430. Designate(right,rightO);
  9431. Designate(left,leftO);
  9432. sizeOp := CopySize(left, leftO.tag);
  9433. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9434. ReleaseIntermediateOperand(sizeOp);
  9435. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9436. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9437. IF (rightType IS SyntaxTree.StringType) THEN
  9438. CopyString(left,right);
  9439. 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
  9440. Designate(right,rightO);
  9441. Designate(left,leftO);
  9442. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9443. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9444. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9445. ELSE
  9446. HALT(201)
  9447. END;
  9448. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9449. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9450. Designate(right,rightO);
  9451. Designate(left,leftO);
  9452. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9453. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  9454. MakeMemory(mem, rightO.op, leftO.op.type,0);
  9455. Emit(Mov(position, leftO.op, mem));
  9456. ReleaseIntermediateOperand(mem);
  9457. ELSE
  9458. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9459. END;
  9460. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9461. ELSE
  9462. AssignMathArray(left,right);
  9463. END;
  9464. ELSE
  9465. HALT(200);
  9466. END;
  9467. END Assign;
  9468. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9469. BEGIN
  9470. IF Trace THEN TraceEnter("VisitAssignment") END;
  9471. Assign(x.left,x.right);
  9472. IF Trace THEN TraceExit("VisitAssignment") END;
  9473. END VisitAssignment;
  9474. PROCEDURE EmitCooperativeSwitch;
  9475. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9476. BEGIN
  9477. ASSERT (cooperativeSwitches);
  9478. pc := section.pc;
  9479. IF lastSwitchPC = section.pc THEN RETURN END;
  9480. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9481. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9482. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9483. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9484. INC(statCoopSwitch, section.pc - pc);
  9485. END EmitCooperativeSwitch;
  9486. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9487. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9488. BEGIN
  9489. p0 := communication.left; p1 := communication.right;
  9490. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9491. Evaluate(p0,s0);
  9492. Evaluate(p1,s1);
  9493. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9494. Emit(Push(position,s0.op));
  9495. Emit(Push(position,s1.op));
  9496. (*
  9497. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9498. *)
  9499. IF ~backend.cellsAreObjects THEN
  9500. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9501. END;
  9502. ReleaseOperand(s0);
  9503. ReleaseOperand(s1);
  9504. IF backend.cellsAreObjects THEN
  9505. CallThis(position,"ActiveCellsRuntime","Send",2);
  9506. ELSE
  9507. CallThis(position,ChannelModuleName,"Send",2);
  9508. END;
  9509. (* ----- RECEIVE ------*)
  9510. ELSE
  9511. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9512. tmp := p0; p0 := p1; p1 := tmp;
  9513. END;
  9514. Evaluate(p0,s0);
  9515. Emit(Push(position,s0.op));
  9516. Designate(p1,s1);
  9517. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9518. Emit(Push(position,s1.op));
  9519. (*
  9520. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9521. *)
  9522. IF ~backend.cellsAreObjects THEN
  9523. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9524. END;
  9525. ReleaseOperand(s0);
  9526. ReleaseOperand(s1);
  9527. IF backend.cellsAreObjects THEN
  9528. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9529. ELSE
  9530. CallThis(position,ChannelModuleName,"Receive",2)
  9531. END;
  9532. END;
  9533. END VisitCommunicationStatement;
  9534. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9535. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9536. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9537. VAR true, false: Label; condition, value: BOOLEAN;
  9538. BEGIN
  9539. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9540. IF condition THEN
  9541. true := NewLabel();
  9542. false := NewLabel();
  9543. Condition(if.condition,true,false);
  9544. SetLabel(true);
  9545. StatementSequence(if.statements);
  9546. BrL(end);
  9547. SetLabel(false);
  9548. ELSE
  9549. IF value THEN (* always true *)
  9550. escape := TRUE;
  9551. StatementSequence(if.statements);
  9552. (* no branch necessary -- rest skipped *)
  9553. END;
  9554. END;
  9555. END IfPart;
  9556. BEGIN
  9557. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9558. end := NewLabel();
  9559. elsifs := x.ElsifParts();
  9560. IfPart(x.ifPart);
  9561. FOR i := 0 TO elsifs-1 DO
  9562. IF ~escape THEN
  9563. elsif := x.GetElsifPart(i);
  9564. IfPart(elsif);
  9565. END;
  9566. END;
  9567. IF (x.elsePart # NIL) & ~escape THEN
  9568. StatementSequence(x.elsePart);
  9569. END;
  9570. SetLabel(end);
  9571. IF Trace THEN TraceExit("VisitIfStatement") END;
  9572. END VisitIfStatement;
  9573. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9574. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9575. BEGIN
  9576. (*IF x.variable.type.resolved = x.type.resolved THEN
  9577. (* always true, do nothing *)
  9578. ELSE*)
  9579. Designate(x.variable,res);
  9580. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9581. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9582. END;
  9583. trueL := NewLabel();
  9584. TypeTest(res.tag,x.type,trueL,falseL);
  9585. ReleaseOperand(res);
  9586. SetLabel(trueL);
  9587. StatementSequence(x.statements);
  9588. BrL(endL);
  9589. END WithPart;
  9590. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9591. VAR endL,falseL: Label;i: LONGINT;
  9592. BEGIN
  9593. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9594. endL := NewLabel();
  9595. FOR i := 0 TO x.WithParts()-1 DO
  9596. falseL := NewLabel();
  9597. WithPart(x.GetWithPart(i),falseL,endL);
  9598. SetLabel(falseL);
  9599. END;
  9600. IF x.elsePart = NIL THEN
  9601. IF ~isUnchecked THEN
  9602. EmitTrap(position,WithTrap);
  9603. END;
  9604. ELSE
  9605. StatementSequence(x.elsePart)
  9606. END;
  9607. SetLabel(endL);
  9608. IF Trace THEN TraceExit("VisitWithStatement") END;
  9609. END VisitWithStatement;
  9610. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9611. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9612. out,else: Label; label: Label;
  9613. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9614. symbol: SyntaxTree.Symbol;
  9615. BEGIN
  9616. (*! split case statement into if-elsif statements for large case label lists *)
  9617. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9618. range := x.max-x.min+1;
  9619. IF (range<0) OR (range > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9620. END;
  9621. size := LONGINT(range);
  9622. Evaluate(x.variable,var);
  9623. ReuseCopy(tmp,var.op);
  9624. ReleaseIntermediateOperand(var.op);
  9625. var.op := tmp;
  9626. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9627. Convert(var.op,addressType);
  9628. else := NewLabel();
  9629. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9630. (*
  9631. UniqueId(name,module.module,"case",caseId);
  9632. *)
  9633. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9634. Global.GetModuleSegmentedName(module.module, name);
  9635. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9636. symbol := SyntaxTree.NewSymbol(name[1]);
  9637. symbol.SetScope(moduleScope);
  9638. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9639. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9640. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9641. ReuseCopy(res,var.op);
  9642. ReleaseOperand(var);
  9643. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9644. Emit(Add(position,res,res,jmp));
  9645. IntermediateCode.MakeMemory(res,addressType);
  9646. Emit(Br(position,res));
  9647. ReleaseIntermediateOperand(res);
  9648. out := NewLabel();
  9649. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9650. part := x.GetCasePart(i);
  9651. constant := part.firstConstant;
  9652. label := NewLabel();
  9653. SetLabel(label);
  9654. WHILE(constant # NIL) DO (* case labels for this case part *)
  9655. FOR j := constant.min TO constant.max DO
  9656. fixups[j-x.min] := label;
  9657. END;
  9658. constant := constant.next;
  9659. END;
  9660. StatementSequence(part.statements);
  9661. BrL(out);
  9662. END;
  9663. SetLabel(else);
  9664. FOR i := 0 TO size-1 DO
  9665. IF fixups[i] = NIL THEN
  9666. fixups[i] := else;
  9667. END;
  9668. END;
  9669. IF x.elsePart # NIL THEN
  9670. StatementSequence(x.elsePart);
  9671. ELSIF ~isUnchecked THEN
  9672. EmitTrap(position,CaseTrap);
  9673. END;
  9674. SetLabel(out);
  9675. FOR i := 0 TO size-1 DO
  9676. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9677. section.Emit(Data(position,op));
  9678. END;
  9679. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9680. END VisitCaseStatement;
  9681. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9682. VAR start: Label; true,false: Label;
  9683. BEGIN
  9684. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9685. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9686. start := NewLabel();
  9687. true := NewLabel();
  9688. false := NewLabel();
  9689. SetLabel(start);
  9690. Condition(x.condition,true,false);
  9691. SetLabel(true);
  9692. StatementSequence(x.statements);
  9693. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9694. BrL(start);
  9695. SetLabel(false);
  9696. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9697. END VisitWhileStatement;
  9698. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9699. VAR false,true: Label;
  9700. BEGIN
  9701. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9702. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9703. true := NewLabel();
  9704. false := NewLabel();
  9705. SetLabel(false);
  9706. StatementSequence(x.statements);
  9707. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9708. Condition(x.condition,true,false);
  9709. SetLabel(true);
  9710. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9711. END VisitRepeatStatement;
  9712. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9713. VAR
  9714. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9715. temporaryVariable: SyntaxTree.Variable;
  9716. temporaryVariableDesignator : SyntaxTree.Designator;
  9717. BEGIN
  9718. IF Trace THEN TraceEnter("VisitForStatement") END;
  9719. true := NewLabel();
  9720. false := NewLabel();
  9721. start := NewLabel();
  9722. Assign(x.variable,x.from);
  9723. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9724. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9725. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9726. Assign(temporaryVariableDesignator,x.to);
  9727. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  9728. IF by > 0 THEN
  9729. cmp := Scanner.LessEqual
  9730. ELSE
  9731. cmp := Scanner.GreaterEqual
  9732. END;
  9733. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9734. binary.SetType(system.booleanType);
  9735. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9736. SetLabel(start);
  9737. Condition(binary,true,false);
  9738. SetLabel(true);
  9739. StatementSequence(x.statements);
  9740. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9741. binary.SetType(x.variable.type);
  9742. Assign(x.variable,binary);
  9743. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9744. BrL(start);
  9745. SetLabel(false);
  9746. IF Trace THEN TraceExit("VisitForStatement") END;
  9747. END VisitForStatement;
  9748. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9749. VAR prevLoop: Label;
  9750. BEGIN
  9751. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9752. prevLoop := currentLoop;
  9753. currentLoop := NewLabel();
  9754. StatementSequence(x.statements);
  9755. SetLabel(currentLoop);
  9756. currentLoop := prevLoop;
  9757. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9758. END VisitExitableBlock;
  9759. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9760. VAR prevLoop,start: Label;
  9761. BEGIN
  9762. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9763. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9764. start := NewLabel();
  9765. prevLoop := currentLoop;
  9766. SetLabel(start);
  9767. currentLoop := NewLabel();
  9768. StatementSequence(x.statements);
  9769. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9770. BrL(start);
  9771. SetLabel(currentLoop);
  9772. currentLoop := prevLoop;
  9773. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9774. END VisitLoopStatement;
  9775. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9776. VAR outer: SyntaxTree.Statement;
  9777. BEGIN
  9778. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9779. IF locked THEN (* r if we jump out of an exclusive block *)
  9780. outer := x.outer;
  9781. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9782. outer := outer.outer;
  9783. END;
  9784. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9785. Lock(FALSE);
  9786. END;
  9787. END;
  9788. BrL(currentLoop);
  9789. IF Trace THEN TraceExit("VisitExitStatement") END;
  9790. END VisitExitStatement;
  9791. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9792. VAR
  9793. expression, parameterDesignator: SyntaxTree.Expression;
  9794. type, componentType: SyntaxTree.Type;
  9795. res, right: Operand;
  9796. left, mem, reg: IntermediateCode.Operand;
  9797. parameter: SyntaxTree.Parameter;
  9798. procedure: SyntaxTree.Procedure;
  9799. procedureType: SyntaxTree.ProcedureType;
  9800. returnTypeOffset: LONGINT;
  9801. delegate: BOOLEAN;
  9802. map: SymbolMap;
  9803. callingConvention, parametersSize: LONGINT;
  9804. BEGIN
  9805. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9806. expression := x.returnValue;
  9807. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9808. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9809. IF currentIsInline THEN
  9810. IF expression # NIL THEN
  9811. map := currentMapper.Get(NIL);
  9812. IF map # NIL THEN
  9813. Assign(map.to, expression);
  9814. ELSE
  9815. Evaluate(expression,res);
  9816. Emit(Return(position,res.op));
  9817. ReleaseOperand(res);
  9818. END;
  9819. END;
  9820. BrL(currentInlineExit);
  9821. RETURN;
  9822. END;
  9823. IF expression # NIL THEN
  9824. type := expression.type.resolved;
  9825. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9826. IF locked THEN Lock(FALSE) END;
  9827. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9828. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9829. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9830. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (type IS SyntaxTree.EnumerationType) OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9831. (* return without structured return parameter *)
  9832. Evaluate(expression,res);
  9833. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9834. IF locked OR profile THEN
  9835. Emit(Push(position,res.op));
  9836. IF delegate THEN HALT(200) END;
  9837. ReleaseOperand(res);
  9838. IF locked THEN Lock(FALSE) END;
  9839. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9840. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9841. reg := NewRegisterOperand(res.op.type);
  9842. Emit(Pop(position,reg));
  9843. Emit(Return(position,reg));
  9844. ReleaseIntermediateOperand(reg);
  9845. ELSE
  9846. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9847. Emit(Return(position,res.op));
  9848. ReleaseOperand(res);
  9849. END;
  9850. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9851. THEN
  9852. (* return using structured return parameter *)
  9853. 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)
  9854. OR SemanticChecker.IsPointerType(type));
  9855. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9856. parameter :=procedureType.returnParameter;
  9857. ASSERT(parameter # NIL);
  9858. returnTypeOffset := parameter.offsetInBits;
  9859. (*
  9860. IF parameter# NIL THEN
  9861. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9862. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9863. ELSE
  9864. returnTypeOffset := system.offsetFirstParameter
  9865. END;
  9866. *)
  9867. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9868. IF type IS SyntaxTree.RangeType THEN
  9869. (* array range type *)
  9870. Evaluate(expression, right);
  9871. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9872. Emit(Mov(position,mem, right.op)); (* first *)
  9873. ReleaseIntermediateOperand(mem);
  9874. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9875. Emit(Mov(position,mem, right.tag)); (* last *)
  9876. ReleaseIntermediateOperand(mem);
  9877. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9878. Emit(Mov(position,mem, right.extra)); (* step *)
  9879. ReleaseIntermediateOperand(mem);
  9880. ReleaseOperand(right);
  9881. ELSIF type IS SyntaxTree.ComplexType THEN
  9882. Evaluate(expression, right);
  9883. componentType := type(SyntaxTree.ComplexType).componentType;
  9884. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9885. Emit(Mov(position,mem, right.op)); (* real part *)
  9886. ReleaseIntermediateOperand(mem);
  9887. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9888. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9889. ReleaseIntermediateOperand(mem);
  9890. ReleaseOperand(right);
  9891. ELSE (* covers cases: pointer / record / array *)
  9892. parameter := procedureType.returnParameter;
  9893. checker.SetCurrentScope(currentScope);
  9894. ASSERT(parameter # NIL);
  9895. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9896. Assign(parameterDesignator,expression);
  9897. END;
  9898. ReleaseIntermediateOperand(left);
  9899. IF locked THEN Lock(FALSE) END;
  9900. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9901. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9902. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9903. parameter := procedureType.returnParameter;
  9904. checker.SetCurrentScope(currentScope);
  9905. IF parameter = NIL THEN
  9906. Error(procedure.position, "structured return of parameter of procedure not found");
  9907. ELSE
  9908. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9909. Assign(parameterDesignator,expression);
  9910. END;
  9911. IF locked THEN Lock(FALSE) END;
  9912. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9913. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9914. ELSE
  9915. HALT(200);
  9916. END;
  9917. ELSE
  9918. IF locked THEN Lock(FALSE) END;
  9919. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9920. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9921. END;
  9922. IF backend.cooperative THEN
  9923. BrL(exitLabel);
  9924. ELSE
  9925. callingConvention := procedureType.callingConvention;
  9926. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  9927. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9928. ELSE
  9929. parametersSize := 0;
  9930. END;
  9931. EmitLeave(section, position,procedure, callingConvention);
  9932. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  9933. END;
  9934. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9935. END VisitReturnStatement;
  9936. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9937. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9938. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9939. statements: SyntaxTree.StatementSequence;
  9940. name, suffix: SyntaxTree.IdentifierString;
  9941. BEGIN
  9942. Strings.IntToStr(awaitProcCounter,suffix);
  9943. Strings.Concat("@AwaitProcedure",suffix,name);
  9944. identifier := SyntaxTree.NewIdentifier(name);
  9945. INC(awaitProcCounter);
  9946. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9947. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9948. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9949. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9950. procedure.SetAccess(SyntaxTree.Hidden);
  9951. procedure.SetScope(currentScope);
  9952. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9953. procedureType.SetReturnType(system.booleanType);
  9954. procedure.SetType(procedureType);
  9955. body := SyntaxTree.NewBody(x.position,procedureScope);
  9956. procedureScope.SetBody(body);
  9957. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9958. returnStatement.SetReturnValue(x.condition);
  9959. statements := SyntaxTree.NewStatementSequence();
  9960. statements.AddStatement(returnStatement);
  9961. body.SetStatementSequence(statements);
  9962. currentScope.AddProcedure(procedure);
  9963. RETURN procedure
  9964. END MakeAwaitProcedure;
  9965. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  9966. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9967. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9968. BEGIN
  9969. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9970. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9971. IF backend.cooperative THEN
  9972. start := NewLabel();
  9973. true := NewLabel();
  9974. false := NewLabel();
  9975. SetLabel(start);
  9976. Condition(x.condition,true,false);
  9977. SetLabel(false);
  9978. PushSelfPointer();
  9979. CallThis(position,"ExclusiveBlocks","Await",1);
  9980. BrL(start);
  9981. SetLabel(true);
  9982. PushSelfPointer();
  9983. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9984. ELSE
  9985. proc := MakeAwaitProcedure(x);
  9986. Emit(Push(position,fp));
  9987. GetCodeSectionNameForSymbol(proc,name);
  9988. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9989. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9990. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9991. Emit(Call(position,call,ProcParametersSize(proc)));
  9992. Emit(Result(position,res));
  9993. (*
  9994. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9995. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9996. *)
  9997. InitOperand(result,ModeValue);
  9998. result.op := res;
  9999. label := NewLabel();
  10000. BreqL(label, result.op, SELF.true);
  10001. ReleaseOperand(result);
  10002. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10003. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10004. Emit(Push(position,res));
  10005. Emit(Push(position,fp));
  10006. PushSelfPointer();
  10007. Emit(Push(position,nil));
  10008. CallThis(position,"Objects","Await",4);
  10009. SetLabel(label);
  10010. END;
  10011. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10012. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  10013. END VisitAwaitStatement;
  10014. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  10015. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  10016. BEGIN
  10017. FOR i := 0 TO x.Length() - 1 DO
  10018. statement := x.GetStatement( i );
  10019. Statement(statement);
  10020. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  10021. END;
  10022. END StatementSequence;
  10023. PROCEDURE PushSelfPointer;
  10024. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  10025. procedureType: SyntaxTree.ProcedureType;
  10026. BEGIN
  10027. scope := currentScope;
  10028. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  10029. scope := scope.outerScope;
  10030. END;
  10031. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  10032. moduleSection := meta.ModuleSection();
  10033. IF backend.cooperative THEN
  10034. moduleOffset := 0;
  10035. ELSE
  10036. moduleOffset := moduleSection.pc;
  10037. END;
  10038. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  10039. ELSE
  10040. GetBaseRegister(op.op,currentScope,scope);
  10041. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10042. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10043. parametersSize := ProcParametersSize(procedure);
  10044. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  10045. IF backend.cooperative THEN
  10046. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  10047. END;
  10048. IntermediateCode.MakeMemory(op.op,addressType);
  10049. END;
  10050. Emit(Push(position,op.op));
  10051. ReleaseOperand(op);
  10052. END PushSelfPointer;
  10053. PROCEDURE Lock(lock: BOOLEAN);
  10054. BEGIN
  10055. IF Trace THEN TraceEnter("Lock") END;
  10056. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10057. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  10058. ASSERT(modifyAssignmentCounter = 0);
  10059. IF dump # NIL THEN
  10060. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  10061. dump.Ln;dump.Update;
  10062. END;
  10063. PushSelfPointer;
  10064. IF backend.cooperative THEN
  10065. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  10066. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  10067. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  10068. END;
  10069. ELSE
  10070. Emit(Push(position,true));
  10071. IF lock THEN CallThis(position,"Objects","Lock",2)
  10072. ELSE CallThis(position,"Objects","Unlock",2);
  10073. END;
  10074. END;
  10075. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10076. IF Trace THEN TraceExit("Lock") END;
  10077. END Lock;
  10078. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  10079. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  10080. BEGIN
  10081. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  10082. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10083. previouslyUnchecked := isUnchecked;
  10084. isUnchecked := isUnchecked OR x.isUnchecked;
  10085. previouslyCooperativeSwitches := cooperativeSwitches;
  10086. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  10087. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  10088. IF x.statements # NIL THEN
  10089. StatementSequence(x.statements);
  10090. END;
  10091. IF (x IS SyntaxTree.Body) THEN
  10092. IF (x(SyntaxTree.Body).finally # NIL) THEN
  10093. section.SetFinally(section.pc);
  10094. StatementSequence(x(SyntaxTree.Body).finally)
  10095. ELSIF x.isExclusive THEN
  10096. end := NewLabel();
  10097. BrL(end);
  10098. section.SetFinally(section.pc);
  10099. Lock(FALSE);
  10100. EmitTrap(position,RethrowTrap);
  10101. SetLabel(end);
  10102. END;
  10103. END;
  10104. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10105. isUnchecked := previouslyUnchecked;
  10106. cooperativeSwitches := previouslyCooperativeSwitches;
  10107. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10108. END VisitStatementBlock;
  10109. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10110. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10111. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10112. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10113. procedure: SyntaxTree.Procedure;
  10114. map: SymbolMap;
  10115. callingConvention, parametersSize: LONGINT;
  10116. BEGIN
  10117. scope := currentScope;
  10118. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10119. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10120. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10121. return := emptyOperand;
  10122. IF Trace THEN TraceEnter("VisitCode") END;
  10123. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10124. NEW(in, x.inRules.Length());
  10125. FOR i := 0 TO LEN(in)-1 DO
  10126. statement := x.inRules.GetStatement(i);
  10127. WITH statement: SyntaxTree.Assignment DO
  10128. Evaluate(statement.right, operand);
  10129. result := operand.op;
  10130. NEW(str, 64);
  10131. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10132. in[i] := result; IntermediateCode.SetString(in[i], str);
  10133. ReleaseIntermediateOperand(operand.tag);
  10134. END;
  10135. END;
  10136. ELSE in := NIL
  10137. END;
  10138. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10139. NEW(out, x.outRules.Length());
  10140. FOR i := 0 TO LEN(out)-1 DO
  10141. statement := x.outRules.GetStatement(i);
  10142. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10143. WITH statement: SyntaxTree.Assignment DO
  10144. Designate(statement.left, operand);
  10145. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10146. NEW(str, 64);
  10147. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10148. out[i] := result; IntermediateCode.SetString(out[i], str);
  10149. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10150. |statement: SyntaxTree.ReturnStatement DO
  10151. NEW(str, 64);
  10152. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10153. IF currentIsInline THEN
  10154. map := currentMapper.Get(NIL);
  10155. Designate(map.to, operand);
  10156. IF map.isAddress THEN
  10157. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10158. ELSE
  10159. result := operand.op;
  10160. END;
  10161. (*! only if it does not fit into register
  10162. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10163. *)
  10164. (*Evaluate(map.to, operand);*)
  10165. out[i] := result;
  10166. ELSE
  10167. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10168. END;
  10169. IntermediateCode.SetString(out[i], str);
  10170. ReleaseIntermediateOperand(operand.tag);
  10171. return := out[i];
  10172. ELSE
  10173. END;
  10174. END;
  10175. ELSE out := NIL
  10176. END;
  10177. Emit(Asm(x.position,x.sourceCode, in, out));
  10178. IF in # NIL THEN
  10179. FOR i := 0 TO LEN(in)-1 DO
  10180. ReleaseIntermediateOperand(in[i]);
  10181. END;
  10182. END;
  10183. IF out # NIL THEN
  10184. FOR i := 0 TO LEN(out)-1 DO
  10185. WITH statement: SyntaxTree.Assignment DO
  10186. ReleaseIntermediateOperand(out[i]);
  10187. |statement: SyntaxTree.ReturnStatement DO
  10188. (* release happens below *)
  10189. ELSE
  10190. END;
  10191. statement := x.outRules.GetStatement(i);
  10192. END;
  10193. END;
  10194. IF return.mode # IntermediateCode.Undefined THEN
  10195. IF currentIsInline THEN
  10196. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10197. Symbol(procedureType.returnParameter, par);
  10198. MakeMemory(mem, par.op, return.type, 0);
  10199. ReleaseOperand(par);
  10200. Emit(Mov(position, mem, return));
  10201. ReleaseIntermediateOperand(mem);
  10202. ELSE
  10203. Emit(Return(position,return));
  10204. END;
  10205. ReleaseIntermediateOperand(return);
  10206. IF currentIsInline THEN RETURN END;
  10207. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10208. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10209. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10210. ELSE
  10211. parametersSize := 0;
  10212. END;
  10213. EmitLeave(section, position,procedure, callingConvention);
  10214. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10215. END;
  10216. IF Trace THEN TraceExit("VisitCode") END;
  10217. END VisitCode;
  10218. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  10219. BEGIN
  10220. RETURN ProcedureParametersSize(system, procedure);
  10221. END ProcParametersSize;
  10222. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10223. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10224. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10225. const, call: IntermediateCode.Operand;
  10226. parameterDesignator: SyntaxTree.Expression;
  10227. saved: RegisterEntry;
  10228. name: Basic.SegmentedName;
  10229. BEGIN
  10230. IF Trace THEN TraceEnter("ParameterCopies") END;
  10231. parameter := x.firstParameter;
  10232. WHILE parameter # NIL DO
  10233. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10234. type := parameter.type.resolved;
  10235. IF IsOpenArray(type) THEN
  10236. VisitParameter(parameter);
  10237. op := result;
  10238. IF backend.cooperative & parameter.NeedsTrace() THEN
  10239. length := GetArrayLength(type, op.tag);
  10240. size := NewRegisterOperand(addressType);
  10241. base := ArrayBaseType(type);
  10242. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10243. Emit(Mul(position, size, length, const));
  10244. dst := NewRegisterOperand (addressType);
  10245. Emit(Mov(position, dst, size));
  10246. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10247. Emit(Sub(position,dst,sp,dst));
  10248. Emit(And(position,dst,dst,const));
  10249. Emit(Mov(position,sp,dst));
  10250. par := fp;
  10251. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10252. IntermediateCode.InitImmediate(null, byteType, 0);
  10253. Emit(Fill(position, dst, size, null));
  10254. ReleaseIntermediateOperand(dst);
  10255. ReleaseIntermediateOperand(length);
  10256. SaveRegisters();ReleaseUsedRegisters(saved);
  10257. (* register dst has been freed before SaveRegisters already *)
  10258. base := ArrayBaseType(type);
  10259. (* assign method of open array *)
  10260. IF base.IsRecordType() THEN
  10261. Emit (Push(position, length));
  10262. Emit (Push(position, dst));
  10263. Emit (Push(position, op.op));
  10264. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10265. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10266. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10267. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10268. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10269. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10270. Emit (Push(position,length));
  10271. Emit (Push(position, dst));
  10272. Emit (Push(position, length));
  10273. Emit (Push(position, op.op));
  10274. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10275. ELSE
  10276. Emit (Push(position, length));
  10277. Emit (Push(position, dst));
  10278. Emit (Push(position, length));
  10279. Emit (Push(position, op.op));
  10280. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10281. ASSERT(ArrayBaseType(type).IsPointer());
  10282. END;
  10283. RestoreRegisters(saved);
  10284. ELSE
  10285. temp := GetDynamicSize(type,op.tag);
  10286. ReuseCopy(size,temp);
  10287. ReleaseIntermediateOperand(temp);
  10288. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10289. Emit(Sub(position,size,sp,size));
  10290. Emit(And(position,size,size,const));
  10291. Emit(Mov(position,sp,size));
  10292. par := fp;
  10293. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10294. ReleaseIntermediateOperand(size);
  10295. size := GetDynamicSize(type,op.tag);
  10296. END;
  10297. Emit(Copy(position,sp,op.op,size));
  10298. ReleaseIntermediateOperand(size);
  10299. ReleaseOperand(op);
  10300. IntermediateCode.MakeMemory(par,addressType);
  10301. Emit(Mov(position,par,sp));
  10302. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10303. checker.SetCurrentScope(currentScope);
  10304. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10305. Assign(parameterDesignator,parameterDesignator);
  10306. END;
  10307. END;
  10308. parameter := parameter.nextParameter;
  10309. END;
  10310. IF Trace THEN TraceExit("ParameterCopies") END;
  10311. END ParameterCopies;
  10312. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10313. VAR x: SyntaxTree.Variable;
  10314. BEGIN
  10315. x := scope.firstVariable;
  10316. WHILE x # NIL DO
  10317. InitVariable(x,FALSE);
  10318. x := x.nextVariable;
  10319. END;
  10320. END InitVariables;
  10321. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10322. BEGIN
  10323. IF (symbol # NIL) THEN
  10324. RETURN fingerPrinter.SymbolFP(symbol).public
  10325. ELSE
  10326. RETURN 0
  10327. END;
  10328. END GetFingerprint;
  10329. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10330. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10331. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10332. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10333. name: Basic.SegmentedName;
  10334. offset: LONGINT;
  10335. BEGIN
  10336. IF Trace THEN TraceEnter("Body") END;
  10337. ReleaseUsedRegisters(saved); (* just in case ... *)
  10338. section := ir;
  10339. exitLabel := NewLabel ();
  10340. IF moduleBody THEN moduleBodySection := section END;
  10341. IF ir.comments # NIL THEN
  10342. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10343. commentPrintout.SingleStatement(TRUE);
  10344. dump := ir.comments;
  10345. ELSE
  10346. commentPrintout := NIL;
  10347. dump := NIL;
  10348. END;
  10349. prevScope := currentScope;
  10350. currentScope := scope;
  10351. lastSwitchPC := 0;
  10352. cooperativeSwitches := backend.cooperative;
  10353. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10354. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10355. IF x # NIL THEN
  10356. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10357. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10358. IF moduleBody THEN
  10359. ProfilerInit();
  10360. ELSE
  10361. Basic.SegmentedNameToString(ir.name, string);
  10362. ProfilerAddProcedure(numberProcedures,string);
  10363. ProfilerEnterExit(numberProcedures,TRUE);
  10364. END;
  10365. END;
  10366. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10367. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10368. END;
  10369. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10370. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10371. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10372. IF procedure = cellScope.bodyProcedure THEN
  10373. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10374. StaticCallOperand(op, cellScope.constructor);
  10375. Emit(Call(position,op.op,0));
  10376. END;
  10377. END;
  10378. END;
  10379. InitVariables(scope);
  10380. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10381. GetCodeSectionNameForSymbol(procedure, name);
  10382. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10383. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10384. IF ProtectModulesPointers THEN
  10385. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10386. ELSE
  10387. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10388. END;
  10389. IntermediateCode.SetOffset(right,offset); (* tag *)
  10390. IntermediateCode.InitMemory(left,addressType,fp,0);
  10391. Emit(Mov(position, left, right));
  10392. END;
  10393. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  10394. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10395. ParameterCopies(procedureType);
  10396. IF x.code = NIL THEN
  10397. VisitStatementBlock(x);
  10398. ELSE
  10399. VisitCode(x.code)
  10400. END;
  10401. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10402. IF ~backend.cooperative THEN
  10403. ProfilerEnterExit(numberProcedures,FALSE);
  10404. END;
  10405. INC(numberProcedures);
  10406. END;
  10407. END;
  10408. IF backend.cooperative THEN
  10409. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10410. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10411. END;
  10412. IF x # NIL THEN
  10413. SELF.position := x.position;
  10414. END;
  10415. CheckRegistersFree();
  10416. ASSERT(modifyAssignmentCounter = 0);
  10417. currentScope := prevScope;
  10418. IF Trace THEN TraceExit("Body") END;
  10419. END Body;
  10420. END ImplementationVisitor;
  10421. MetaDataGenerator=OBJECT
  10422. VAR
  10423. implementationVisitor: ImplementationVisitor;
  10424. declarationVisitor: DeclarationVisitor;
  10425. module: Sections.Module;
  10426. moduleName: ARRAY 128 OF CHAR;
  10427. moduleNamePool: Basic.HashTableInt;
  10428. moduleNamePoolSection: IntermediateCode.Section;
  10429. modulePointerSection: IntermediateCode.Section;
  10430. modulePointerSizePC: LONGINT;
  10431. modulePointerSectionOffset: LONGINT;
  10432. modulePointers: LONGINT;
  10433. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  10434. RecordBaseOffset: LONGINT;
  10435. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10436. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10437. TypeTags: LONGINT; (* type extension level support *)
  10438. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10439. patchInfoPC: LONGINT;
  10440. patchCRC: LONGINT;
  10441. CONST
  10442. EmptyBlockOffset = 2;
  10443. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10444. BEGIN
  10445. IF implementationVisitor.backend.cooperative THEN
  10446. TypeTags := MAX(LONGINT);
  10447. BaseTypesTableOffset := 0;
  10448. MethodTableOffset := 2;
  10449. TypeRecordBaseOffset := 0;
  10450. RecordBaseOffset := 0;
  10451. ELSIF simple THEN
  10452. TypeTags := 3; (* only 3 extensions allowed *)
  10453. BaseTypesTableOffset := 1;
  10454. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10455. TypeRecordBaseOffset := 0;
  10456. RecordBaseOffset := 1;
  10457. ELSE
  10458. TypeTags := 16;
  10459. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10460. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10461. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10462. (* change this when Heaps.HeapBlock is modified *)
  10463. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  10464. RecordBaseOffset := 8; (* addresses *)
  10465. ELSE
  10466. RecordBaseOffset := 9; (* addresses *)
  10467. END;
  10468. END;
  10469. SELF.simple := simple;
  10470. SELF.implementationVisitor := implementationVisitor;
  10471. SELF.declarationVisitor := declarationVisitor;
  10472. implementationVisitor.meta := SELF;
  10473. declarationVisitor.meta := SELF;
  10474. END InitMetaDataGenerator;
  10475. PROCEDURE SetModule(module: Sections.Module);
  10476. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10477. BEGIN
  10478. SELF.module := module;
  10479. Global.GetModuleName(module.module,moduleName);
  10480. Global.GetSymbolSegmentedName(module.module, name);
  10481. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  10482. NEW(moduleNamePool, 32);
  10483. (*! require GC protection *)
  10484. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10485. IF ProtectModulesPointers THEN
  10486. name := "Heaps.AnyPtr";
  10487. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10488. (* set base pointer *)
  10489. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10490. END;
  10491. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10492. modulePointers := 0;
  10493. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10494. AddPointer(moduleNamePoolSection, namePoolOffset);
  10495. END;
  10496. END SetModule;
  10497. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10498. BEGIN
  10499. IF ~implementationVisitor.backend.cooperative THEN
  10500. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10501. INC(modulePointers);
  10502. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10503. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10504. END;
  10505. END AddPointer;
  10506. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10507. BEGIN
  10508. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10509. END GetTypeRecordBaseOffset;
  10510. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10511. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10512. BEGIN
  10513. (* change this when Heaps.HeapBlock is modified *)
  10514. INC(dataAdrOffset,7);
  10515. Info(section,"headerAdr");
  10516. Address(section,0);
  10517. Info(section,"typeDesc");
  10518. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10519. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10520. NamedSymbol(section, name, symbol, 0, offset);
  10521. Info(section,"mark: LONGINT;");
  10522. Longint(section,-1);
  10523. Info(section,"refCount: LONGINT;");
  10524. Longint(section,0);
  10525. (*
  10526. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10527. *)
  10528. Info(section,"dataAdr-: ADDRESS");
  10529. Symbol(section,section, dataAdrOffset,0);
  10530. Info(section,"size-: SIZE");
  10531. Address(section,0);
  10532. Info(section,"nextMark: HeapBlock;");
  10533. Address(section,0);
  10534. END HeapBlock;
  10535. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10536. VAR i: LONGINT;
  10537. BEGIN
  10538. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10539. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10540. Info(section,"count*: LONGINT");
  10541. Longint(section,0);
  10542. Info(section,"locked*: BOOLEAN");
  10543. Longint(section,0);
  10544. Info(section,"awaitingLock*: ProcessQueue");
  10545. Address(section,0);
  10546. Address(section,0);
  10547. Info(section,"awaitingCond*: ProcessQueue");
  10548. Address(section,0);
  10549. Address(section,0);
  10550. Info(section,"lockedBy*: ANY");
  10551. Address(section,0);
  10552. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10553. Longint(section,1);
  10554. FOR i := 2 TO 6 DO
  10555. Longint(section,0);
  10556. END;
  10557. Info(section,"lock*: ANY");
  10558. Address(section,0);
  10559. END ProtectedHeapBlock;
  10560. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10561. BEGIN
  10562. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10563. END Info;
  10564. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10565. VAR op: IntermediateCode.Operand;
  10566. BEGIN
  10567. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10568. section.Emit(Data(Basic.invalidPosition,op));
  10569. END Address;
  10570. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10571. VAR op: IntermediateCode.Operand;
  10572. BEGIN
  10573. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10574. section.Emit(Data(Basic.invalidPosition,op));
  10575. END Size;
  10576. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  10577. VAR op: IntermediateCode.Operand;
  10578. BEGIN
  10579. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  10580. section.Emit(Data(Basic.invalidPosition,op));
  10581. END Set;
  10582. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10583. VAR op: IntermediateCode.Operand;
  10584. BEGIN
  10585. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10586. section.Emit(Data(Basic.invalidPosition,op));
  10587. END Longint;
  10588. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10589. VAR op,noOperand: IntermediateCode.Operand;
  10590. BEGIN
  10591. IntermediateCode.InitOperand(noOperand);
  10592. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10593. section.PatchOperands(pc,op,noOperand,noOperand);
  10594. END PatchAddress;
  10595. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10596. VAR op,noOperand: IntermediateCode.Operand;
  10597. BEGIN
  10598. IntermediateCode.InitOperand(noOperand);
  10599. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10600. section.PatchOperands(pc,op,noOperand,noOperand);
  10601. END PatchSize;
  10602. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10603. VAR op,noOperand: IntermediateCode.Operand;
  10604. BEGIN
  10605. IntermediateCode.InitOperand(noOperand);
  10606. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10607. section.PatchOperands(pc,op,noOperand,noOperand);
  10608. END PatchLongint;
  10609. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10610. VAR op, noOperand: IntermediateCode.Operand;
  10611. BEGIN
  10612. IntermediateCode.InitOperand(noOperand);
  10613. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10614. section.PatchOperands(pc,op,noOperand,noOperand);
  10615. END PatchSymbol;
  10616. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10617. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10618. BEGIN
  10619. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10620. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10621. section.Emit(Data(Basic.invalidPosition,op));
  10622. END Boolean;
  10623. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10624. VAR op: IntermediateCode.Operand;
  10625. BEGIN
  10626. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10627. section.Emit(Data(Basic.invalidPosition,op));
  10628. END Char;
  10629. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10630. VAR op: IntermediateCode.Operand;
  10631. BEGIN
  10632. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10633. section.Emit(Data(Basic.invalidPosition,op));
  10634. END Integer;
  10635. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10636. VAR i: LONGINT;
  10637. BEGIN
  10638. Info(section,str);
  10639. i := 0;
  10640. WHILE(str[i] # 0X) DO
  10641. Char(section,str[i]);
  10642. INC(i);
  10643. END;
  10644. Char(section,0X);
  10645. END String;
  10646. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10647. VAR s: Basic.SectionName;
  10648. BEGIN
  10649. StringPool.GetString(str, s);
  10650. String(section, s);
  10651. END String0;
  10652. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10653. VAR op: IntermediateCode.Operand;
  10654. BEGIN
  10655. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10656. IntermediateCode.SetOffset(op,realOffset);
  10657. section.Emit(Data(Basic.invalidPosition,op));
  10658. END NamedSymbol;
  10659. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10660. VAR op: IntermediateCode.Operand;
  10661. BEGIN
  10662. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10663. IntermediateCode.SetOffset(op,realOffset);
  10664. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10665. END NamedSymbolAt;
  10666. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10667. BEGIN
  10668. IF symbol= NIL THEN
  10669. Address( section, realOffset);
  10670. ASSERT(virtualOffset = 0);
  10671. ELSE
  10672. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10673. END;
  10674. END Symbol;
  10675. (* OutPointers delivers
  10676. {pointerOffset}
  10677. *)
  10678. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10679. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10680. BEGIN
  10681. type := type.resolved;
  10682. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10683. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10684. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10685. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10686. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10687. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10688. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10689. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10690. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10691. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10692. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10693. ELSIF (type IS SyntaxTree.RecordType) THEN
  10694. (* never treat a record like a pointer, even if the pointer field is set! *)
  10695. WITH type: SyntaxTree.RecordType DO
  10696. base := type.GetBaseRecord();
  10697. IF base # NIL THEN
  10698. Pointers(offset,symbol,section, base,numberPointers);
  10699. END;
  10700. variable := type.recordScope.firstVariable;
  10701. WHILE(variable # NIL) DO
  10702. IF ~(variable.untraced) THEN
  10703. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10704. END;
  10705. variable := variable.nextVariable;
  10706. END;
  10707. END;
  10708. ELSIF (type IS SyntaxTree.CellType) THEN
  10709. WITH type: SyntaxTree.CellType DO
  10710. base := type.GetBaseRecord();
  10711. IF base # NIL THEN
  10712. Pointers(offset,symbol,section, base,numberPointers);
  10713. END;
  10714. variable := type.cellScope.firstVariable;
  10715. WHILE(variable # NIL) DO
  10716. IF ~(variable.untraced) THEN
  10717. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10718. END;
  10719. variable := variable.nextVariable;
  10720. END;
  10721. property := type.firstProperty;
  10722. WHILE(property # NIL) DO
  10723. IF ~(property.untraced) THEN
  10724. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10725. END;
  10726. property := property.nextProperty;
  10727. END;
  10728. parameter := type.firstParameter;
  10729. WHILE(parameter # NIL) DO
  10730. IF ~(parameter.untraced) THEN
  10731. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10732. END;
  10733. parameter := parameter.nextParameter;
  10734. END;
  10735. END;
  10736. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10737. WITH type: SyntaxTree.ArrayType DO
  10738. IF type.form= SyntaxTree.Static THEN
  10739. n := type.staticLength;
  10740. base := type.arrayBase.resolved;
  10741. WHILE(base IS SyntaxTree.ArrayType) DO
  10742. type := base(SyntaxTree.ArrayType);
  10743. n := n* type.staticLength;
  10744. base := type.arrayBase.resolved;
  10745. END;
  10746. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10747. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10748. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10749. FOR i := 0 TO n-1 DO
  10750. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10751. END;
  10752. END;
  10753. ELSE
  10754. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10755. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10756. END;
  10757. END;
  10758. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10759. WITH type: SyntaxTree.MathArrayType DO
  10760. IF type.form = SyntaxTree.Static THEN
  10761. n := type.staticLength;
  10762. base := type.arrayBase.resolved;
  10763. WHILE(base IS SyntaxTree.MathArrayType) DO
  10764. type := base(SyntaxTree.MathArrayType);
  10765. n := n* type.staticLength;
  10766. base := type.arrayBase.resolved;
  10767. END;
  10768. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10769. IF SemanticChecker.ContainsPointer(base) THEN
  10770. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10771. FOR i := 0 TO n-1 DO
  10772. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10773. END;
  10774. END;
  10775. ELSE
  10776. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10777. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10778. END
  10779. END;
  10780. (* ELSE no pointers in type *)
  10781. END;
  10782. END Pointers;
  10783. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10784. VAR position,i: LONGINT; ch: CHAR;
  10785. BEGIN
  10786. IF pool.Has(index) THEN
  10787. RETURN pool.GetInt(index)
  10788. ELSE
  10789. position := source.pc;
  10790. pool.PutInt(index, position);
  10791. Info(source, name);
  10792. i := 0;
  10793. REPEAT
  10794. ch := name[i]; INC(i);
  10795. Char( source, ch);
  10796. UNTIL ch = 0X;
  10797. END;
  10798. RETURN position;
  10799. END EnterDynamicName;
  10800. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10801. VAR name: Basic.SectionName; position: LONGINT;
  10802. BEGIN
  10803. IF pool.Has(index) THEN
  10804. RETURN pool.GetInt(index)
  10805. ELSE
  10806. StringPool.GetString(index, name);
  10807. position := EnterDynamicName(source,name,index, pool);
  10808. END;
  10809. RETURN position;
  10810. END DynamicName;
  10811. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10812. VAR section: IntermediateCode.Section;
  10813. BEGIN
  10814. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10815. IF implementationVisitor.backend.cooperative THEN
  10816. Info(section, "TypeDescriptor");
  10817. Basic.ToSegmentedName("BaseTypes.Array", name);
  10818. NamedSymbol(section, name,NIL, 0, 0);
  10819. BasePointer(section);
  10820. offset := 0;
  10821. ELSE
  10822. IF ProtectModulesPointers THEN
  10823. HeapBlock(mName,typeName,section,2);
  10824. END;
  10825. Info(section, "HeapBlock");
  10826. IF ProtectModulesPointers THEN
  10827. Symbol(section,section,2,0);
  10828. ELSE
  10829. Address(section,0);
  10830. END;
  10831. Info(section, "TypeDescriptor");
  10832. Address(section,0);
  10833. offset := section.pc;
  10834. END;
  10835. RETURN section
  10836. END NamedBlock;
  10837. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10838. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10839. BEGIN
  10840. COPY(moduleName,name);
  10841. Strings.Append(name,suffix);
  10842. Basic.ToSegmentedName(name, pooledName);
  10843. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10844. END Block;
  10845. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10846. VAR name: Basic.SegmentedName;
  10847. BEGIN
  10848. Info(source,"ArrayHeader");
  10849. IF implementationVisitor.backend.cooperative THEN
  10850. sizePC := source.pc;
  10851. Address(source,0);
  10852. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10853. IF baseType # "" THEN
  10854. Basic.ToSegmentedName(baseType, name);
  10855. NamedSymbol(source, name,NIL, 0, 0);
  10856. ELSE
  10857. Address(source,0);
  10858. END;
  10859. Address(source,0);
  10860. ELSE
  10861. Address(source,0);
  10862. Address(source,0);
  10863. (* first pointer for GC *)
  10864. IF hasPointer THEN
  10865. (* points to first element in the array, this is NOT the base type descriptor *)
  10866. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10867. ELSE
  10868. Address(source,0);
  10869. END;
  10870. sizePC := source.pc;
  10871. Address(source,0);
  10872. Info(source,"array data");
  10873. END;
  10874. END ArrayBlock;
  10875. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10876. BEGIN
  10877. IF implementationVisitor.backend.cooperative THEN
  10878. PatchSize(section, pc, size);
  10879. PatchSize(section, pc + 3, size);
  10880. ELSE
  10881. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10882. PatchSize(section, pc, size);
  10883. END;
  10884. END PatchArray;
  10885. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10886. VAR
  10887. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10888. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10889. poolMap: Basic.HashTableInt;
  10890. namePool: IntermediateCode.Section;
  10891. namePoolOffset: LONGINT;
  10892. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10893. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10894. BEGIN
  10895. Basic.SegmentedNameToString(s1.name,n1);
  10896. Basic.SegmentedNameToString(s2.name,n2);
  10897. index := 0;
  10898. ch1 := n1[index];
  10899. ch2 := n2[index];
  10900. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10901. INC(index);
  10902. ch1 := n1[index];
  10903. ch2 := n2[index];
  10904. END;
  10905. RETURN ch1 < ch2;
  10906. END Compare;
  10907. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10908. VAR
  10909. i, j: LONGINT;
  10910. x, t: Sections.Section;
  10911. BEGIN
  10912. IF lo < hi THEN
  10913. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10914. WHILE i <= j DO
  10915. WHILE Compare(list[i], x) DO INC(i) END;
  10916. WHILE Compare(x, list[j]) DO DEC(j) END;
  10917. IF i <= j THEN
  10918. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10919. INC(i); DEC(j)
  10920. END
  10921. END;
  10922. IF lo < j THEN QuickSort(list, lo, j) END;
  10923. IF i < hi THEN QuickSort(list, i, hi) END
  10924. END;
  10925. END QuickSort;
  10926. (*
  10927. ExportDesc* = RECORD
  10928. fp*: ADDRESS;
  10929. name* {UNTRACED}: DynamicName;
  10930. adr*: ADDRESS;
  10931. exports*: LONGINT;
  10932. dsc* {UNTRACED}: ExportArray
  10933. END;
  10934. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10935. *)
  10936. PROCEDURE ExportDesc2(
  10937. source: IntermediateCode.Section;
  10938. namePool: IntermediateCode.Section;
  10939. fingerPrinter: FingerPrinter.FingerPrinter;
  10940. symbol: Sections.Section;
  10941. name: StringPool.Index;
  10942. VAR patchAdr: LONGINT
  10943. ): BOOLEAN;
  10944. VAR fingerPrint: SyntaxTree.FingerPrint;
  10945. BEGIN
  10946. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10947. & (symbol.type # Sections.InlineCodeSection)
  10948. THEN
  10949. *)
  10950. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  10951. & (symbol.type # Sections.ExitCodeSection)
  10952. & (symbol.type # Sections.InlineCodeSection))
  10953. THEN
  10954. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10955. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10956. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10957. Longint(source,fingerPrint.public);
  10958. ELSE
  10959. Longint(source, 0);
  10960. END;
  10961. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10962. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10963. Symbol(source, symbol,0,0);
  10964. patchAdr := source.pc;
  10965. Longint(source, 0);
  10966. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10967. Address(source,0);
  10968. END;
  10969. RETURN TRUE
  10970. ELSE
  10971. RETURN FALSE
  10972. END;
  10973. END ExportDesc2;
  10974. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10975. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10976. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10977. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  10978. nextPatch: LONGINT;
  10979. TYPE
  10980. Scope = RECORD
  10981. elements: LONGINT;
  10982. gelements: LONGINT;
  10983. section: IntermediateCode.Section;
  10984. patchAdr: LONGINT;
  10985. arraySizePC: LONGINT;
  10986. beginPC: LONGINT; (* current scope start pc *)
  10987. END;
  10988. BEGIN
  10989. Basic.InitSegmentedName(prev);
  10990. olevel := -1;
  10991. scopes[0].section := source;
  10992. scopes[0].arraySizePC := MIN(LONGINT);
  10993. FOR s := 0 TO LEN(sections)-1 DO
  10994. symbol := sections[s];
  10995. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection) & (symbol.type # Sections.ExitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10996. this := sections[s].name;
  10997. level := 0;
  10998. WHILE (level < LEN(this)) & (this[level] > 0) DO
  10999. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11000. INC(level);
  11001. END;
  11002. WHILE level < olevel DO
  11003. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11004. IF olevel > 0 THEN
  11005. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11006. nextPatch := scopes[olevel-1].patchAdr+1;
  11007. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11008. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11009. END;
  11010. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11011. DEC(olevel);
  11012. END;
  11013. IF (level < LEN(this)) & (this[level] > 0) THEN
  11014. IF level > olevel THEN
  11015. (*TRACE("opening",level); *)
  11016. IF scopes[level].section = NIL THEN
  11017. arrayName := ".@ExportArray";
  11018. Strings.AppendInt(arrayName, level);
  11019. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11020. AddPointer(scopes[level].section,offset);
  11021. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11022. END;
  11023. scopes[level].beginPC := scopes[level].section.pc;
  11024. olevel := level;
  11025. scopes[olevel].elements := 0;
  11026. END;
  11027. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  11028. sym := sections[s];
  11029. ELSE
  11030. sym := NIL;
  11031. END;
  11032. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  11033. THEN
  11034. INC(scopes[olevel].elements);
  11035. END;
  11036. (* enter string in scope *)
  11037. INC(level);
  11038. END;
  11039. END;
  11040. Basic.SegmentedNameToString(this, name);
  11041. prev := this;
  11042. END;
  11043. END;
  11044. WHILE 0 <= olevel DO
  11045. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11046. IF olevel > 0 THEN
  11047. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11048. nextPatch := scopes[olevel-1].patchAdr+1;
  11049. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11050. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11051. END;
  11052. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11053. DEC(olevel);
  11054. END;
  11055. level := 0;
  11056. WHILE (level < LEN(scopes)) DO
  11057. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  11058. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  11059. END;
  11060. INC(level);
  11061. END;
  11062. END Export;
  11063. BEGIN
  11064. NEW(fingerPrinter);
  11065. NEW(poolMap, 64);
  11066. (* 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 *)
  11067. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  11068. NEW(sectionArray, module.allSections.Length());
  11069. FOR i := 0 TO module.allSections.Length() - 1 DO
  11070. section := module.allSections.GetSection(i);
  11071. sectionArray[i] := section;
  11072. END;
  11073. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  11074. Export(sectionArray^);
  11075. END ExportDesc;
  11076. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11077. VAR
  11078. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11079. BEGIN
  11080. Info(source, "exception table offsets array descriptor");
  11081. size := 0;
  11082. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11083. Info(source, "exception table content");
  11084. FOR i := 0 TO module.allSections.Length() - 1 DO
  11085. p := module.allSections.GetSection(i);
  11086. IF p.type = Sections.CodeSection THEN
  11087. finallyPC := p(IntermediateCode.Section).finally;
  11088. IF finallyPC>=0 THEN
  11089. Symbol( source, p, 0,0);
  11090. Symbol( source, p, finallyPC, 0);
  11091. Symbol( source, p, finallyPC,0);
  11092. INC(size);
  11093. END;
  11094. END
  11095. END;
  11096. PatchArray(source,sizePC,size);
  11097. END ExceptionArray;
  11098. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11099. VAR i: LONGINT; ch: CHAR;
  11100. BEGIN
  11101. i := 0;
  11102. REPEAT
  11103. ch := name[i]; INC(i);
  11104. Char( section, ch);
  11105. UNTIL ch = 0X;
  11106. WHILE i < 32 DO
  11107. Char( section, 0X); INC(i);
  11108. END;
  11109. END Name;
  11110. PROCEDURE References(section: IntermediateCode.Section);
  11111. CONST
  11112. sfTypeNone = 0X;
  11113. sfTypeCHAR = 01X;
  11114. sfTypeCHAR8 = 02X;
  11115. sfTypeCHAR16 = 03X;
  11116. sfTypeCHAR32 = 04X;
  11117. sfTypeRANGE = 05X;
  11118. sfTypeSHORTINT = 06X;
  11119. sfTypeINTEGER = 07X;
  11120. sfTypeLONGINT = 08X;
  11121. sfTypeHUGEINT = 09X;
  11122. sfTypeWORD = 0AX;
  11123. sfTypeLONGWORD = 0BX;
  11124. sfTypeSIGNED8 = 0CX;
  11125. sfTypeSIGNED16 = 0DX;
  11126. sfTypeSIGNED32 = 0EX;
  11127. sfTypeSIGNED64 = 0FX;
  11128. sfTypeUNSIGNED8 = 10X;
  11129. sfTypeUNSIGNED16 = 11X;
  11130. sfTypeUNSIGNED32 = 12X;
  11131. sfTypeUNSIGNED64 = 13X;
  11132. sfTypeREAL = 14X;
  11133. sfTypeLONGREAL = 15X;
  11134. sfTypeCOMPLEX = 16X;
  11135. sfTypeLONGCOMPLEX = 17X;
  11136. sfTypeBOOLEAN = 18X;
  11137. sfTypeSET = 19X;
  11138. sfTypeANY = 1AX;
  11139. sfTypeOBJECT = 1BX;
  11140. sfTypeBYTE = 1CX;
  11141. sfTypeADDRESS = 1DX;
  11142. sfTypeSIZE = 1EX;
  11143. sfTypeIndirect = 1FX;
  11144. sfTypeRecord = 20X;
  11145. sfTypePointerToRecord = 21X;
  11146. sfTypePointerToArray = 22X;
  11147. sfTypeOpenArray = 23X;
  11148. sfTypeStaticArray = 24X;
  11149. sfTypeDynamicArray = 25X;
  11150. sfTypeMathStaticArray = 26X;
  11151. sfTypeMathOpenArray = 27X;
  11152. sfTypeMathTensor = 28X;
  11153. sfTypeProcedure = 29X;
  11154. sfTypeDelegate = 2AX;
  11155. sfTypeENUM = 2BX;
  11156. sfTypeCELL = 2CX;
  11157. sfTypePORT = 2DX;
  11158. sfIN = 0X;
  11159. sfOUT = 1X;
  11160. flagDelegate = 0;
  11161. flagConstructor = 1;
  11162. (* variable / parameter addressing modes *)
  11163. sfAbsolute = 0X; (* global vars *)
  11164. sfRelative = 1X; (* variables, value parameters *)
  11165. sfIndirect = 2X; (* var parameters *)
  11166. sfScopeBegin = 0F0X;
  11167. sfScopeEnd = 0F1X;
  11168. sfProcedure = 0F2X;
  11169. sfVariable = 0F3X;
  11170. sfTypeDeclaration = 0F4X;
  11171. sfModule = 0FFX;
  11172. RefInfo = TRUE;
  11173. VAR
  11174. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11175. indirectTypes: Basic.HashTable;
  11176. PROCEDURE CurrentIndex(): LONGINT;
  11177. VAR i: LONGINT;
  11178. BEGIN
  11179. FOR i := startPC TO section.pc -1 DO
  11180. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11181. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11182. END;
  11183. startPC := section.pc;
  11184. RETURN lastOffset;
  11185. END CurrentIndex;
  11186. (*
  11187. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11188. Module = sfModule prevSymbol:SIZE name:String Scope.
  11189. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11190. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11191. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11192. Type =
  11193. sfTypePointerToRecord
  11194. | sfTypePointerToArray Type
  11195. | sfTypeOpenArray Type
  11196. | sfTypeDynamicArray Type
  11197. | sfTypeStaticArray length:SIZE Type
  11198. | sfTypeMathOpenArray Type
  11199. | sfTypeMathStaticArray length:SIZE Type
  11200. | sfTypeMathTensor Type
  11201. | sfTypeRecord tdAdr:ADDRESS
  11202. | sfTypeProcedure {Parameter} return:Type
  11203. | sfTypeDelegate {Parameter} return:Type
  11204. | sfTypePort (sfIN | sfOUT)
  11205. | sfTypeBOOLEAN
  11206. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11207. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11208. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11209. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11210. | sfTypeWORD | sfTypeLONGWORD
  11211. | sfTypeREAL | sfTypeLONGREAL
  11212. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11213. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11214. | sfTypeIndirect offset:SIZE.
  11215. *)
  11216. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11217. VAR offset: SIZE;
  11218. BEGIN
  11219. IF indirectTypes.Has(type) THEN
  11220. offset := indirectTypes.GetInt(type);
  11221. Char(section, sfTypeIndirect);
  11222. Size(section, offset);
  11223. RETURN TRUE;
  11224. ELSE
  11225. indirectTypes.PutInt(type, CurrentIndex());
  11226. RETURN FALSE;
  11227. END;
  11228. END Indirect;
  11229. PROCEDURE NType(type: SyntaxTree.Type);
  11230. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11231. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11232. BEGIN
  11233. IF type = NIL THEN
  11234. Char(section, sfTypeNone)
  11235. ELSE
  11236. type := type.resolved;
  11237. size := type.sizeInBits;
  11238. WITH type:SyntaxTree.PointerType DO
  11239. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11240. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11241. Char(section, sfTypePointerToRecord);
  11242. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11243. ELSE
  11244. IF RefInfo THEN Info(section,"PointerToArray") END;
  11245. Char(section, sfTypePointerToArray);
  11246. NType(type.pointerBase);
  11247. END;
  11248. | type: SyntaxTree.ArrayType DO
  11249. IF ~Indirect(type) THEN
  11250. IF type.form = SyntaxTree.Open THEN
  11251. IF RefInfo THEN Info(section,"OpenArray") END;
  11252. Char(section, sfTypeOpenArray);
  11253. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11254. IF RefInfo THEN Info(section,"DynamicArray") END;
  11255. Char(section, sfTypeDynamicArray);
  11256. ELSIF type.form = SyntaxTree.Static THEN
  11257. IF RefInfo THEN Info(section,"StaticArray") END;
  11258. Char(section, sfTypeStaticArray);
  11259. Size(section, type.staticLength);
  11260. ELSE
  11261. HALT(100);
  11262. END;
  11263. NType(type.arrayBase);
  11264. END;
  11265. | type: SyntaxTree.MathArrayType DO
  11266. IF ~Indirect(type) THEN
  11267. IF type.form = SyntaxTree.Open THEN
  11268. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11269. Char(section, sfTypeMathOpenArray);
  11270. ELSIF type.form = SyntaxTree.Static THEN
  11271. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11272. Char(section, sfTypeMathStaticArray);
  11273. Size(section, type.staticLength);
  11274. ELSIF type.form = SyntaxTree.Tensor THEN
  11275. IF RefInfo THEN Info(section,"MathTensor") END;
  11276. Char(section, sfTypeMathTensor);
  11277. ELSE
  11278. HALT(100);
  11279. END;
  11280. NType(type.arrayBase);
  11281. END;
  11282. | type: SyntaxTree.RecordType DO
  11283. IF ~Indirect(type) THEN
  11284. IF type.pointerType # NIL (* OBJECT *) THEN
  11285. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11286. Char(section, sfTypePointerToRecord)
  11287. ELSE
  11288. IF RefInfo THEN Info(section,"Record") END;
  11289. Char(section, sfTypeRecord);
  11290. td := type.typeDeclaration;
  11291. IF RefInfo THEN Info(section,"TD") END;
  11292. IF (td # NIL) THEN
  11293. Global.GetSymbolSegmentedName(td,segmentedName);
  11294. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11295. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11296. ELSE
  11297. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11298. END;
  11299. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11300. Symbol(section, tir, 0, offset);
  11301. ELSE
  11302. Address(section, 0);
  11303. END;
  11304. END;
  11305. END;
  11306. | type: SyntaxTree.CellType DO
  11307. IF ~Indirect(type) THEN
  11308. IF RefInfo THEN Info(section,"Record") END;
  11309. Char(section, sfTypeRecord);
  11310. td := type.typeDeclaration;
  11311. IF RefInfo THEN Info(section,"TD") END;
  11312. IF (td # NIL) THEN
  11313. Global.GetSymbolSegmentedName(td,segmentedName);
  11314. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11315. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11316. ELSE
  11317. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11318. END;
  11319. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11320. Symbol(section, tir, 0, offset);
  11321. ELSE
  11322. Address(section, 0);
  11323. END;
  11324. END;
  11325. | type: SyntaxTree.PortType DO
  11326. Char(section, sfTypePORT);
  11327. IF type.direction = SyntaxTree.OutPort THEN
  11328. Char(section, sfOUT)
  11329. ELSE
  11330. Char(section, sfIN)
  11331. END;
  11332. | type: SyntaxTree.ProcedureType DO
  11333. IF ~Indirect(type) THEN
  11334. IF type.isDelegate THEN
  11335. Char(section, sfTypeDelegate);
  11336. ELSE
  11337. Char(section, sfTypeProcedure);
  11338. END;
  11339. parameter := type.firstParameter;
  11340. WHILE(parameter # NIL) DO
  11341. NParameter(parameter, -1);
  11342. parameter := parameter.nextParameter;
  11343. END;
  11344. NType(type.returnType);
  11345. END;
  11346. | type:SyntaxTree.EnumerationType DO
  11347. Char(section, sfTypeENUM);
  11348. | type: SyntaxTree.BasicType DO
  11349. WITH type: SyntaxTree.BooleanType DO
  11350. IF RefInfo THEN Info(section,"Boolean") END;
  11351. Char(section, sfTypeBOOLEAN);
  11352. | type: SyntaxTree.CharacterType DO
  11353. IF type = module.system.characterType THEN
  11354. IF RefInfo THEN Info(section,"CHAR") END;
  11355. Char(section, sfTypeCHAR);
  11356. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11357. IF RefInfo THEN Info(section,"CHAR8") END;
  11358. Char(section, sfTypeCHAR8)
  11359. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11360. IF RefInfo THEN Info(section,"CHAR16") END;
  11361. Char(section, sfTypeCHAR16);
  11362. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11363. IF RefInfo THEN Info(section,"CHAR32") END;
  11364. Char(section, sfTypeCHAR32);
  11365. ELSE
  11366. HALT(100);
  11367. END;
  11368. |type: SyntaxTree.IntegerType DO
  11369. IF type(SyntaxTree.IntegerType).signed THEN
  11370. IF (type = module.system.shortintType) THEN
  11371. IF RefInfo THEN Info(section,"SHORTINT") END;
  11372. Char(section, sfTypeSHORTINT)
  11373. ELSIF (type = module.system.integerType) THEN
  11374. IF RefInfo THEN Info(section,"INTEGER") END;
  11375. Char(section, sfTypeINTEGER)
  11376. ELSIF (type = module.system.longintType) THEN
  11377. IF RefInfo THEN Info(section,"LONGINT") END;
  11378. Char(section, sfTypeLONGINT)
  11379. ELSIF (type = module.system.hugeintType) THEN
  11380. IF RefInfo THEN Info(section,"HUGEINT") END;
  11381. Char(section, sfTypeHUGEINT)
  11382. ELSIF (type = module.system.wordType) THEN
  11383. IF RefInfo THEN Info(section,"WORD") END;
  11384. Char(section, sfTypeWORD)
  11385. ELSIF (type = module.system.longWordType) THEN
  11386. IF RefInfo THEN Info(section,"LONGWORD") END;
  11387. Char(section, sfTypeLONGWORD);
  11388. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11389. IF RefInfo THEN Info(section,"SIGNED8") END;
  11390. Char(section, sfTypeSIGNED8)
  11391. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11392. IF RefInfo THEN Info(section,"SIGNED16") END;
  11393. Char(section, sfTypeSIGNED16)
  11394. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11395. IF RefInfo THEN Info(section,"SIGNED32") END;
  11396. Char(section, sfTypeSIGNED32)
  11397. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11398. IF RefInfo THEN Info(section,"SIGNED64") END;
  11399. Char(section, sfTypeSIGNED64)
  11400. ELSE
  11401. HALT(100);
  11402. END
  11403. ELSE (* unsigned *)
  11404. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11405. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11406. Char(section, sfTypeUNSIGNED8)
  11407. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11408. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11409. Char(section, sfTypeUNSIGNED16)
  11410. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11411. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11412. Char(section, sfTypeUNSIGNED32)
  11413. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11414. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11415. Char(section, sfTypeUNSIGNED64)
  11416. ELSE
  11417. HALT(100)
  11418. END
  11419. END;
  11420. | type: SyntaxTree.FloatType DO
  11421. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11422. IF RefInfo THEN Info(section,"REAL") END;
  11423. Char(section, sfTypeREAL);
  11424. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11425. IF RefInfo THEN Info(section,"LONGREAL") END;
  11426. Char(section, sfTypeLONGREAL);
  11427. ELSE
  11428. HALT(100);
  11429. END;
  11430. |type: SyntaxTree.ComplexType DO
  11431. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11432. IF RefInfo THEN Info(section,"COMPLEX") END;
  11433. Char(section, sfTypeCOMPLEX);
  11434. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11435. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11436. Char(section, sfTypeLONGCOMPLEX);
  11437. ELSE
  11438. HALT(100);
  11439. END;
  11440. |type:SyntaxTree.SetType DO
  11441. IF RefInfo THEN Info(section,"SET") END;
  11442. Char(section, sfTypeSET);
  11443. |type:SyntaxTree.AnyType DO
  11444. IF RefInfo THEN Info(section,"ANY") END;
  11445. Char(section, sfTypeANY);
  11446. |type:SyntaxTree.ObjectType DO
  11447. IF RefInfo THEN Info(section,"OBJECT") END;
  11448. Char(section, sfTypeOBJECT);
  11449. |type:SyntaxTree.ByteType DO
  11450. IF RefInfo THEN Info(section,"BYTE") END;
  11451. Char(section, sfTypeBYTE);
  11452. |type:SyntaxTree.RangeType DO
  11453. IF RefInfo THEN Info(section,"RANGE") END;
  11454. Char(section, sfTypeRANGE)
  11455. |type:SyntaxTree.AddressType DO
  11456. IF RefInfo THEN Info(section,"ADDRESS") END;
  11457. Char(section, sfTypeADDRESS)
  11458. |type:SyntaxTree.SizeType DO
  11459. IF RefInfo THEN Info(section,"SIZE") END;
  11460. Char(section, sfTypeSIZE)
  11461. ELSE
  11462. HALT(100)
  11463. END;
  11464. ELSE HALT(101);
  11465. END;
  11466. END;
  11467. END NType;
  11468. (*
  11469. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11470. *)
  11471. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11472. VAR pos: LONGINT; type: SyntaxTree.Type;
  11473. BEGIN
  11474. IF RefInfo THEN Info(section, "Parameter") END;
  11475. Char(section, sfVariable);
  11476. Size(section, procOffset);
  11477. String0(section, parameter.name);
  11478. type := parameter.type.resolved;
  11479. IF parameter.kind = SyntaxTree.VarParameter THEN
  11480. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11481. ELSE Char(section, sfIndirect)
  11482. END;
  11483. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11484. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11485. Char(section, sfIndirect);
  11486. ELSE
  11487. Char(section, sfRelative);
  11488. END;
  11489. ELSE
  11490. Char(section, sfRelative);
  11491. END;
  11492. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11493. NType(parameter.type);
  11494. END NParameter;
  11495. (*
  11496. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11497. *)
  11498. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11499. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11500. flags: SET;
  11501. BEGIN
  11502. IF procedure.externalName # NIL THEN RETURN END;
  11503. IF RefInfo THEN Info(section, "Procedure") END;
  11504. pos := CurrentIndex();
  11505. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11506. Char(section, sfProcedure);
  11507. Size(section, scopeOffset);
  11508. String0(section,procedure.name);
  11509. s := module.allSections.FindBySymbol(procedure);
  11510. Symbol(section,s,0,0); (* start *)
  11511. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11512. flags := {};
  11513. IF procedureType.isDelegate THEN
  11514. INCL(flags, flagDelegate);
  11515. END;
  11516. IF procedure.isConstructor THEN
  11517. INCL(flags, flagConstructor);
  11518. END;
  11519. Set(section, flags);
  11520. IF RefInfo THEN Info(section, "Parameters") END;
  11521. parameter := procedureType.firstParameter;
  11522. WHILE(parameter # NIL) DO
  11523. NParameter(parameter, pos);
  11524. parameter := parameter.nextParameter;
  11525. END;
  11526. IF procedureType.returnParameter # NIL THEN
  11527. NParameter(procedureType.returnParameter, pos);
  11528. END;
  11529. IF procedureType.selfParameter # NIL THEN
  11530. NParameter(procedureType.selfParameter, pos);
  11531. END;
  11532. IF RefInfo THEN Info(section, "ReturnType") END;
  11533. NType(procedureType.returnType);
  11534. NScope(procedure.procedureScope, pos);
  11535. END NProcedure;
  11536. (*
  11537. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11538. *)
  11539. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11540. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11541. BEGIN
  11542. IF RefInfo THEN Info(section, "Variable") END;
  11543. pos := CurrentIndex();
  11544. Char(section, sfVariable);
  11545. Size(section, scopeOffset);
  11546. String0(section, variable.name);
  11547. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11548. Char(section, sfAbsolute);
  11549. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11550. NamedSymbol(section, sn,variable, 0,0);
  11551. ELSE
  11552. Char(section, sfRelative);
  11553. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11554. END;
  11555. NType(variable.type);
  11556. s := module.allSections.FindBySymbol(variable);
  11557. END NVariable;
  11558. (*
  11559. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11560. *)
  11561. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11562. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11563. BEGIN
  11564. IF typeDeclaration = NIL THEN RETURN END;
  11565. pos := CurrentIndex();
  11566. s := module.allSections.FindBySymbol(typeDeclaration);
  11567. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11568. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11569. Char(section, sfTypeDeclaration);
  11570. Size(section, scopeOffset);
  11571. String0(section, typeDeclaration.name);
  11572. declared := typeDeclaration.declaredType.resolved;
  11573. IF (declared IS SyntaxTree.PointerType) THEN
  11574. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11575. END;
  11576. WITH declared: SyntaxTree.RecordType DO
  11577. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11578. Symbol(section, s, 0, offset);
  11579. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11580. Basic.AppendToSegmentedName(name,".@Info");
  11581. s := module.allSections.FindByName(name);
  11582. IF s # NIL THEN (* does not work for coop *)
  11583. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11584. END;
  11585. NScope(declared.recordScope, pos);
  11586. |declared: SyntaxTree.CellType DO
  11587. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11588. Symbol(section, s, 0, offset);
  11589. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11590. Basic.AppendToSegmentedName(name,".@Info");
  11591. s := module.allSections.FindByName(name);
  11592. IF s # NIL THEN
  11593. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11594. END;
  11595. NScope(declared.cellScope, pos);
  11596. ELSE
  11597. Address(section, 0);
  11598. END;
  11599. END NTypeDeclaration;
  11600. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11601. VAR pos: LONGINT;
  11602. BEGIN
  11603. pos := CurrentIndex();
  11604. Char(section,sfModule);
  11605. Size(section, prevSymbol);
  11606. String0(section, module.name);
  11607. NScope(module.moduleScope, pos);
  11608. END NModule;
  11609. (*
  11610. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11611. *)
  11612. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11613. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11614. BEGIN
  11615. IF scope = NIL THEN RETURN END;
  11616. IF RefInfo THEN Info(section, "Scope") END;
  11617. Char(section, sfScopeBegin);
  11618. variable := scope.firstVariable;
  11619. WHILE (variable # NIL) DO
  11620. NVariable(variable, prevSymbol);
  11621. variable := variable.nextVariable;
  11622. END;
  11623. WITH scope: SyntaxTree.ModuleScope DO
  11624. bodyProcedure := scope.bodyProcedure;
  11625. |scope: SyntaxTree.RecordScope DO
  11626. bodyProcedure := scope.bodyProcedure;
  11627. ELSE
  11628. bodyProcedure := NIL;
  11629. END;
  11630. IF bodyProcedure # NIL THEN
  11631. NProcedure(bodyProcedure, prevSymbol)
  11632. END;
  11633. procedure := scope.firstProcedure;
  11634. WHILE procedure # NIL DO
  11635. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11636. procedure := procedure.nextProcedure;
  11637. END;
  11638. typeDeclaration := scope.firstTypeDeclaration;
  11639. WHILE typeDeclaration # NIL DO
  11640. NTypeDeclaration(typeDeclaration, prevSymbol);
  11641. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11642. END;
  11643. Char(section, sfScopeEnd); (* scope ends *)
  11644. END NScope;
  11645. BEGIN
  11646. NEW(indirectTypes, 32);
  11647. ArrayBlock(section,sizePC,"", FALSE);
  11648. startPC := section.pc;
  11649. NModule(module.module, -1);
  11650. PatchArray(section,sizePC,CurrentIndex());
  11651. END References;
  11652. (*
  11653. Command* = RECORD
  11654. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11655. name*: Name; (* name of the procedure *)
  11656. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11657. entryAdr* : ADDRESS; (* entry address of procedure *)
  11658. END;
  11659. *)
  11660. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11661. VAR
  11662. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11663. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11664. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11665. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11666. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11667. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11668. BEGIN
  11669. RETURN
  11670. (type = NIL) OR
  11671. (type.resolved IS SyntaxTree.RecordType) OR
  11672. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11673. (type.resolved IS SyntaxTree.AnyType);
  11674. END TypeAllowed;
  11675. BEGIN
  11676. numberParameters := procedureType.numberParameters;
  11677. RETURN
  11678. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11679. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11680. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11681. END GetProcedureAllowed;
  11682. PROCEDURE WriteType(type : SyntaxTree.Type);
  11683. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11684. name: Basic.SegmentedName; offset: LONGINT;
  11685. BEGIN
  11686. IF type = NIL THEN
  11687. Address(source,0);
  11688. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11689. Address(source,1);
  11690. ELSE
  11691. type := type.resolved;
  11692. IF type IS SyntaxTree.PointerType THEN
  11693. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11694. END;
  11695. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11696. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11697. name[0] := typeDeclaration.name; name[1] := -1;
  11698. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11699. ASSERT(section # NIL);
  11700. ELSE
  11701. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11702. (* TODO *)
  11703. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11704. END;
  11705. IF implementationVisitor.backend.cooperative THEN
  11706. offset := 0;
  11707. ELSE
  11708. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11709. END;
  11710. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11711. END;
  11712. END WriteType;
  11713. BEGIN
  11714. Info(source, "command array descriptor");
  11715. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11716. numberCommands := 0;
  11717. Info(source, "command array content");
  11718. FOR i := 0 TO module.allSections.Length() - 1 DO
  11719. p := module.allSections.GetSection(i);
  11720. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11721. procedure := p.symbol(SyntaxTree.Procedure);
  11722. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11723. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11724. procedure.GetName(name);
  11725. Name(source,name);
  11726. numberParameters := procedureType.numberParameters;
  11727. (* offset of type of first parameter *)
  11728. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11729. ELSE WriteType(procedureType.firstParameter.type)
  11730. END;
  11731. (* offset of type of return parameter *)
  11732. WriteType(procedureType.returnType);
  11733. (* command name *)
  11734. (* command code offset *)
  11735. Symbol(source,p,0,0);
  11736. INC(numberCommands);
  11737. IF Trace THEN
  11738. D.Ln;
  11739. END;
  11740. END;
  11741. END
  11742. END;
  11743. PatchArray(source,sizePC,numberCommands);
  11744. END CommandArray;
  11745. (* to prevent from double import of different module aliases *)
  11746. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11747. VAR i: SyntaxTree.Import;
  11748. BEGIN
  11749. i := module.module.moduleScope.firstImport;
  11750. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11751. i := i.nextImport;
  11752. END;
  11753. RETURN i = import
  11754. END IsFirstDirectOccurence;
  11755. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11756. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11757. BEGIN
  11758. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11759. ArrayBlock(source,pc,"", FALSE);
  11760. Info(source, "import module array data");
  11761. IF implementationVisitor.backend.cooperative THEN
  11762. offset := 0;
  11763. ELSE
  11764. IF module.system.addressType.sizeInBits = 64 THEN
  11765. (* change this when Heaps.HeapBlock is modified *)
  11766. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11767. ELSE
  11768. (* change this when Heaps.HeapBlock is modified *)
  11769. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11770. END;
  11771. END;
  11772. import := module.module.moduleScope.firstImport;
  11773. numberImports := 0;
  11774. WHILE import # NIL DO
  11775. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11776. Global.GetModuleSegmentedName(import.module,name);
  11777. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11778. NamedSymbol(source, name, NIL, 0, offset);
  11779. INC(numberImports);
  11780. END;
  11781. import := import.nextImport
  11782. END;
  11783. PatchArray(source,pc,numberImports);
  11784. END ImportsArray;
  11785. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11786. VAR
  11787. p: Sections.Section; sizePC, size, i: LONGINT;
  11788. BEGIN
  11789. Info(source, "Type info section");
  11790. size := 0;
  11791. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11792. FOR i := 0 TO module.allSections.Length() - 1 DO
  11793. p := module.allSections.GetSection(i);
  11794. WITH p: IntermediateCode.Section DO
  11795. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11796. Symbol(source,p,EmptyBlockOffset,0);
  11797. INC(size);
  11798. END;
  11799. END
  11800. END;
  11801. PatchArray(source,sizePC,size);
  11802. END TypeInfoSection;
  11803. (*
  11804. ProcTableEntry* = RECORD
  11805. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11806. noPtr*: LONGINT;
  11807. END;
  11808. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11809. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11810. *)
  11811. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11812. VAR
  11813. numberPointers: LONGINT;
  11814. procedure: SyntaxTree.Procedure;
  11815. BEGIN
  11816. Info(section,"pcFrom");
  11817. Symbol(section,procedureSection,0,0);
  11818. Info(section,"pcTo");
  11819. Symbol(section, procedureSection, procedureSection.pc, 0);
  11820. Info(section,"pointer to offsets array");
  11821. Symbol(section, section,section.pc+1,0);
  11822. Info(section,"offsets array");
  11823. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11824. PointerArray(section, procedure.procedureScope, numberPointers);
  11825. END ProcedureDescriptor;
  11826. (* only for tracing, the descriptor is otherwise not complete ! *)
  11827. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11828. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11829. BEGIN
  11830. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11831. name := procedureSection.name;
  11832. Basic.AppendToSegmentedName(name,".@Info");
  11833. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11834. Address(section,0);
  11835. Symbol(section,section,2,0);
  11836. (*
  11837. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11838. descSize: SIZE;
  11839. sentinel: ADDRESS; (* = MPO-4 *)
  11840. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11841. flags*: SET;
  11842. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11843. name*: Name;
  11844. END;
  11845. *)
  11846. Size(section, 0);
  11847. Address(section,0);
  11848. Address(section,0);
  11849. Set(section,{});
  11850. moduleSection := ModuleSection();
  11851. Symbol( section, moduleSection, moduleSection.pc,0);
  11852. IF procedureSection.symbol = NIL THEN
  11853. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11854. ELSE
  11855. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11856. END;
  11857. Name(section, infoName);
  11858. Size(section, 0);
  11859. RETURN section;
  11860. END MakeProcedureDescriptorTag;
  11861. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11862. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11863. BEGIN
  11864. name := procedureSection.name;
  11865. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11866. IF implementationVisitor.backend.cooperative THEN
  11867. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11868. Info(section, "TypeDescriptor");
  11869. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11870. NamedSymbol(dest, name,NIL, 0, 0);
  11871. BaseRecord(dest);
  11872. offset := 0;
  11873. ELSIF CreateProcedureDescInfo THEN
  11874. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11875. Address(dest,0);
  11876. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11877. offset := dest.pc;
  11878. ELSE
  11879. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11880. END;
  11881. ProcedureDescriptor(dest, procedureSection);
  11882. Symbol(section, dest, offset, 0);
  11883. END ProcedureDescriptorPointer;
  11884. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11885. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11886. BEGIN
  11887. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11888. numberProcs := 0;
  11889. FOR i := 0 TO module.allSections.Length() - 1 DO
  11890. destination := module.allSections.GetSection(i);
  11891. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11892. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11893. INC(numberProcs);
  11894. END
  11895. END;
  11896. PatchArray(section, sizePC, numberProcs);
  11897. END ProcedureDescriptorArray;
  11898. (*
  11899. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11900. VAR
  11901. next*: Module; (** once a module is published, all fields are read-only *)
  11902. name*: Name;
  11903. init, published: BOOLEAN;
  11904. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11905. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11906. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11907. command*: POINTER TO ARRAY OF Command;
  11908. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11909. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11910. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11911. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11912. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11913. data*, code*: Bytes;
  11914. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11915. export*: ExportDesc;
  11916. term*: TerminationHandler;
  11917. exTable*: ExceptionTable;
  11918. noProcs*: LONGINT;
  11919. firstProc*: ADDRESS; <- done by loader
  11920. maxPtrs*: LONGINT;
  11921. crc*: LONGINT;
  11922. *)
  11923. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11924. BEGIN
  11925. Info(section, "cycle");
  11926. Size(section,0);
  11927. Info(section, "references");
  11928. Size(section,0);
  11929. Info(section, "nextMarked");
  11930. Address(section,0);
  11931. Info(section, "nextWatched");
  11932. Address(section,0);
  11933. END BasePointer;
  11934. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11935. BEGIN
  11936. BasePointer(section);
  11937. Info(section, "action");
  11938. Address(section,0);
  11939. Info(section, "monitor");
  11940. Address(section,0);
  11941. END BaseObject;
  11942. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11943. BEGIN
  11944. BasePointer(section);
  11945. Info(section, "action");
  11946. Address(section,0);
  11947. Info(section, "monitor");
  11948. Address(section,0);
  11949. END BaseRecord;
  11950. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11951. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11952. pooledName: Basic.SegmentedName;
  11953. symbol: SyntaxTree.Symbol;
  11954. BEGIN
  11955. Global.GetModuleName(module.module,name);
  11956. Strings.Append(name,".@Module.@Descriptor");
  11957. Basic.ToSegmentedName(name, pooledName);
  11958. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11959. Symbol(section,descriptorSection,0,0);
  11960. Info(descriptorSection, "descriptor");
  11961. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11962. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11963. Address(descriptorSection,0);
  11964. Global.GetModuleName(module.module,name);
  11965. Strings.Append(name,".@Trace");
  11966. Basic.ToSegmentedName(name, pooledName);
  11967. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11968. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11969. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11970. END ModuleDescriptor;
  11971. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11972. VAR name: ARRAY 128 OF CHAR;
  11973. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11974. symbol: SyntaxTree.Symbol;
  11975. BEGIN
  11976. Global.GetModuleName(module.module,name);
  11977. Strings.Append(name,".@Module");
  11978. Basic.ToSegmentedName(name, pooledName);
  11979. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11980. moduleSection.SetExported(TRUE);
  11981. IF moduleSection.pc = 0 THEN
  11982. IF implementationVisitor.backend.cooperative THEN
  11983. Info(moduleSection, "descriptor");
  11984. ModuleDescriptor(moduleSection);
  11985. BaseObject(moduleSection);
  11986. implementationVisitor.CreateTraceModuleMethod(module.module);
  11987. ELSE
  11988. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11989. Info(moduleSection, "HeapBlock");
  11990. Symbol(moduleSection,moduleSection,2,0);
  11991. Info(moduleSection, "TypeDescriptor");
  11992. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11993. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11994. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11995. END;
  11996. END;
  11997. RETURN moduleSection;
  11998. END ModuleSection;
  11999. PROCEDURE NewModuleInfo();
  12000. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12001. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12002. sectionName: Basic.SectionName;
  12003. CONST MPO=-40000000H;
  12004. BEGIN
  12005. (*
  12006. TypeDesc* = POINTER TO RECORD
  12007. descSize: SIZE;
  12008. sentinel: LONGINT; (* = MPO-4 *)
  12009. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12010. flags*: SET;
  12011. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12012. name*: Name;
  12013. refsOffset: SIZE;
  12014. END;
  12015. *)
  12016. (*name is missing prefixes sometimes*)
  12017. Global.GetModuleSegmentedName(module.module,name);
  12018. Basic.AppendToSegmentedName(name,".@Info");
  12019. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12020. IF ~implementationVisitor.backend.cooperative THEN
  12021. Info(source, "HeapBlock");
  12022. Address(source,0); (* an empty heap block prevents GC marking *)
  12023. Info(source, "TypeDescriptor");
  12024. Address(source,0);
  12025. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12026. END;
  12027. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12028. Address(source,MPO-4);
  12029. Info(source, "type tag pointer");
  12030. Address( source,0);
  12031. Info(source, "type flags");
  12032. flags := {};
  12033. Set( source, flags);
  12034. Info(source, "pointer to module");
  12035. moduleSection := ModuleSection();
  12036. Symbol( source, moduleSection, moduleSection.pc,0);
  12037. Info(source, "type name");
  12038. i := 0;
  12039. sectionName := "@Self";
  12040. (*
  12041. Global.GetSymbolSegmentedName(td,name);
  12042. Basic.SegmentedNameToString(name, sectionName);
  12043. *)
  12044. Name(source,sectionName);
  12045. patchInfoPC := source.pc;
  12046. Size(source, 0);
  12047. END NewModuleInfo;
  12048. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  12049. VAR
  12050. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  12051. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  12052. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  12053. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  12054. referenceSectionOffset : LONGINT;
  12055. name: Basic.SegmentedName; offset: LONGINT;
  12056. flags: SET;
  12057. BEGIN
  12058. NewModuleInfo();
  12059. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  12060. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  12061. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  12062. ImportsArray(importSection);
  12063. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  12064. CommandArray(commandsSection);
  12065. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  12066. ExceptionArray(exceptionSection);
  12067. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  12068. AddPointer(typeInfoSection, typeInfoSectionOffset);
  12069. TypeInfoSection(typeInfoSection);
  12070. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  12071. referenceSection.SetExported(TRUE);
  12072. References(referenceSection);
  12073. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  12074. ProcedureDescriptorArray(procTableSection, numberProcs);
  12075. IF ProtectModulesPointers THEN
  12076. name := "Heaps.AnyPtr";
  12077. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12078. (* set base pointer *)
  12079. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12080. END;
  12081. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12082. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12083. moduleSection := ModuleSection();
  12084. Info(moduleSection, "nextRoot*: RootObject");
  12085. Address(moduleSection,0);
  12086. Info(moduleSection, "next*: Module");
  12087. Address(moduleSection,0);
  12088. Info(moduleSection, "name*: Name");
  12089. Name(moduleSection,moduleName);
  12090. Info(moduleSection, "init, published: BOOLEAN");
  12091. Boolean(moduleSection,FALSE);
  12092. Boolean(moduleSection,FALSE);
  12093. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12094. Boolean(moduleSection,FALSE);
  12095. Boolean(moduleSection,FALSE);
  12096. Info(moduleSection, "refcnt*: LONGINT");
  12097. Longint(moduleSection,0);
  12098. Info(moduleSection, "sb*: ADDRESS");
  12099. Address(moduleSection,0);
  12100. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12101. Address(moduleSection,0);
  12102. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12103. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12104. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12105. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12106. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12107. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12108. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12109. Symbol(moduleSection,importSection,importSectionOffset,0);
  12110. Info(moduleSection, "procTable*: ProcTable");
  12111. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12112. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12113. Address(moduleSection,0);
  12114. Address(moduleSection,0);
  12115. Address(moduleSection,0);
  12116. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12117. Info(moduleSection, "export*: ExportDesc");
  12118. ExportDesc(moduleSection);
  12119. Info(moduleSection, "term*: TerminationHandler");
  12120. Address(moduleSection,0);
  12121. Info(moduleSection, "exTable*: ExceptionTable");
  12122. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12123. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12124. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12125. Info(moduleSection, "crc*: LONGINT");
  12126. patchCRC:= moduleSection.pc;
  12127. Longint(moduleSection, 0); (*! must be implemented *)
  12128. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12129. Info(moduleSection, "body*: ADDRESS");
  12130. Symbol(moduleSection, bodyProc, 0,0);
  12131. Info(moduleSection, "module flags");
  12132. flags := {};
  12133. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12134. Set( moduleSection, flags);
  12135. IF implementationVisitor.backend.cooperative THEN
  12136. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12137. Info(moduleSection, "monitor.owner");
  12138. Address(moduleSection,0);
  12139. Info(moduleSection, "monitor.nestingLevel");
  12140. Address(moduleSection,0);
  12141. Info(moduleSection, "monitor.blockedQueue");
  12142. Address(moduleSection,0); Address(moduleSection,0);
  12143. Info(moduleSection, "monitor.waitingQueue");
  12144. Address(moduleSection,0); Address(moduleSection,0);
  12145. Info(moduleSection, "monitor.waitingSentinel");
  12146. Address(moduleSection,0);
  12147. END;
  12148. END Module;
  12149. PROCEDURE PatchCRC(crc: LONGINT);
  12150. BEGIN
  12151. IF ~simple THEN
  12152. PatchLongint(ModuleSection(), patchCRC, crc);
  12153. END;
  12154. END PatchCRC;
  12155. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12156. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12157. BEGIN
  12158. ArrayBlock(source,pc,"",FALSE);
  12159. Info(source, "pointer offsets array data");
  12160. IF scope IS SyntaxTree.RecordScope THEN
  12161. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12162. ELSIF scope IS SyntaxTree.CellScope THEN
  12163. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12164. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12165. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12166. WHILE variable # NIL DO
  12167. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12168. symbol := module.allSections.FindBySymbol(variable);
  12169. ASSERT(symbol # NIL);
  12170. Pointers(0,symbol, source,variable.type,numberPointers);
  12171. END;
  12172. variable := variable.nextVariable;
  12173. END;
  12174. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12175. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12176. WHILE parameter # NIL DO
  12177. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  12178. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12179. END;
  12180. parameter := parameter.nextParameter;
  12181. END;
  12182. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12183. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12184. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12185. IF implementationVisitor.backend.preciseGC THEN
  12186. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12187. END;
  12188. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12189. END;
  12190. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12191. WHILE(variable # NIL) DO
  12192. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12193. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12194. END;
  12195. variable := variable.nextVariable
  12196. END;
  12197. END;
  12198. PatchArray(source,pc,numberPointers);
  12199. END PointerArray;
  12200. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12201. VAR
  12202. name: Basic.SegmentedName;
  12203. section: IntermediateCode.Section;
  12204. BEGIN
  12205. Global.GetSymbolSegmentedName(symbol,name);
  12206. Basic.AppendToSegmentedName(name,suffix);
  12207. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12208. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12209. Info(section, "HeapBlock");
  12210. Address(section,0); (* empty such that GC does not go on traversing *)
  12211. Info(section, suffix);
  12212. Address(section,0);
  12213. pc := section.pc;
  12214. RETURN section;
  12215. END SymbolSection;
  12216. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12217. VAR recordType: SyntaxTree.RecordType;
  12218. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12219. section: Sections.Section; cellType: SyntaxTree.CellType;
  12220. tdInfoOffset: LONGINT;
  12221. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12222. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12223. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12224. sectionName: Basic.SectionName;
  12225. CONST MPO=-40000000H;
  12226. BEGIN
  12227. (*
  12228. TypeDesc* = POINTER TO RECORD
  12229. descSize: SIZE;
  12230. sentinel: LONGINT; (* = MPO-4 *)
  12231. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12232. flags*: SET;
  12233. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12234. name*: Name;
  12235. refsOffset: SIZE;
  12236. END;
  12237. *)
  12238. (* source := module.sections.FindByName(...) *)
  12239. Global.GetSymbolSegmentedName(td,name);
  12240. Basic.AppendToSegmentedName(name,".@Info");
  12241. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12242. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12243. Address(source,0);
  12244. Info(source, "TypeDescriptor");
  12245. Address(source,0);
  12246. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12247. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12248. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12249. Info(source, "type tag pointer");
  12250. Symbol( source, tag, offset, 0);
  12251. Info(source, "type flags");
  12252. flags := {};
  12253. IF isProtected THEN INCL(flags,31) END;
  12254. Set( source, flags);
  12255. Info(source, "pointer to module");
  12256. moduleSection := ModuleSection();
  12257. Symbol( source, moduleSection, moduleSection.pc,0);
  12258. Info(source, "type name");
  12259. i := 0;
  12260. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12261. (*
  12262. Global.GetSymbolSegmentedName(td,name);
  12263. Basic.SegmentedNameToString(name, sectionName);
  12264. *)
  12265. Name(source,sectionName);
  12266. Size(source, 0);
  12267. RETURN source;
  12268. END NewTypeDescriptorInfo;
  12269. PROCEDURE NewTypeDescriptor;
  12270. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12271. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12272. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12273. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12274. CONST MPO=-40000000H;
  12275. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12276. VAR i: LONGINT;
  12277. PROCEDURE Td(record: SyntaxTree.RecordType);
  12278. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12279. BEGIN
  12280. IF record # NIL THEN
  12281. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12282. baseTD := record.typeDeclaration;
  12283. Global.GetSymbolSegmentedName(baseTD,name);
  12284. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12285. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12286. ELSE
  12287. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12288. END;
  12289. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12290. Symbol(source, tir, 0, offset);
  12291. IF reverse THEN Td(record.GetBaseRecord()) END;
  12292. END;
  12293. END Td;
  12294. BEGIN
  12295. Info(source, "tag table");
  12296. baseRecord := recordType;
  12297. i := 0;
  12298. WHILE baseRecord # NIL DO
  12299. INC(i);
  12300. baseRecord := baseRecord.GetBaseRecord();
  12301. END;
  12302. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12303. IF ~reverse THEN Td(recordType) END;
  12304. WHILE i < size DO
  12305. Address(source,0);
  12306. INC(i);
  12307. END;
  12308. IF reverse THEN Td(recordType) END;
  12309. END TdTable;
  12310. PROCEDURE MethodTable(reverse: BOOLEAN);
  12311. VAR i,methods: LONGINT;
  12312. BEGIN
  12313. Info(source, "method table");
  12314. IF recordType # NIL THEN
  12315. methods := recordType.recordScope.numberMethods;
  12316. IF reverse THEN
  12317. FOR i := methods-1 TO 0 BY -1 DO
  12318. procedure := recordType.recordScope.FindMethod(i);
  12319. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12320. NamedSymbol(source, name,procedure, 0,0);
  12321. END;
  12322. ELSE
  12323. FOR i := 0 TO methods-1 DO
  12324. procedure := recordType.recordScope.FindMethod(i);
  12325. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12326. NamedSymbol(source, name,procedure, 0,0);
  12327. END;
  12328. END;
  12329. END;
  12330. END MethodTable;
  12331. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12332. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12333. BEGIN
  12334. Info(source, "method table");
  12335. baseRecord := recordType;
  12336. WHILE baseRecord.baseType # NIL DO
  12337. baseRecord := baseRecord.GetBaseRecord ();
  12338. END;
  12339. GetRecordTypeName (baseRecord, name);
  12340. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12341. IF name = stackFrame THEN
  12342. start := 0;
  12343. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12344. baseRecord := recordType;
  12345. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12346. baseRecord := baseRecord.GetBaseRecord ();
  12347. END;
  12348. IF baseRecord # NIL THEN
  12349. GetRecordTypeName (baseRecord, name);
  12350. IF pointer & ~baseRecord.isObject THEN
  12351. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12352. END;
  12353. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12354. ELSIF recordType.isObject THEN
  12355. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12356. ELSIF pointer THEN
  12357. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12358. ELSE
  12359. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12360. END;
  12361. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12362. Symbol(source, tir, 0, 0);
  12363. start := 0;
  12364. baseRecord := recordType;
  12365. WHILE (baseRecord # NIL) DO
  12366. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12367. baseRecord := baseRecord.GetBaseRecord ();
  12368. END;
  12369. ELSE
  12370. (* explicit trace method: *)
  12371. procedure := recordType.recordScope.FindMethod(0);
  12372. IF ~procedure.isFinalizer THEN
  12373. Global.GetSymbolSegmentedName(procedure, name);
  12374. NamedSymbol(source, name,procedure, 0,0);
  12375. END;
  12376. start := 1;
  12377. END;
  12378. IF (name # stackFrame) & recordType.isObject THEN
  12379. baseRecord := recordType;
  12380. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12381. baseRecord := baseRecord.GetBaseRecord ();
  12382. END;
  12383. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12384. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12385. ELSE
  12386. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12387. END;
  12388. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12389. Symbol(source, tir, 0, 0);
  12390. END;
  12391. methods := recordType.recordScope.numberMethods;
  12392. FOR i := start TO methods-1 DO
  12393. procedure := recordType.recordScope.FindMethod(i);
  12394. IF ~procedure.isFinalizer THEN
  12395. Global.GetSymbolSegmentedName(procedure, name);
  12396. NamedSymbol(source, name,procedure, 0,0);
  12397. END;
  12398. END;
  12399. END CooperativeMethodTable;
  12400. BEGIN
  12401. Global.GetSymbolSegmentedName(td,name);
  12402. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12403. source.SetExported(IsExported(td));
  12404. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12405. IF implementationVisitor.backend.cooperative THEN
  12406. base := NIL;
  12407. baseRecord := recordType.GetBaseRecord();
  12408. IF baseRecord # NIL THEN
  12409. baseTD := baseRecord.typeDeclaration;
  12410. END;
  12411. IF ~recordType.isObject THEN
  12412. Info(source, "parent");
  12413. IF baseRecord # NIL THEN
  12414. Global.GetSymbolSegmentedName(baseTD,name);
  12415. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12416. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12417. ELSE
  12418. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12419. END;
  12420. Symbol(source, tir, 0, 0);
  12421. ELSE
  12422. Address(source,0);
  12423. END;
  12424. Info(source, "record size");
  12425. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12426. CooperativeMethodTable(FALSE);
  12427. base := source;
  12428. Global.GetSymbolSegmentedName(td,name);
  12429. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12430. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12431. source.SetExported(IsExported(td));
  12432. END;
  12433. Info(source, "parent");
  12434. IF baseRecord # NIL THEN
  12435. Global.GetSymbolSegmentedName(baseTD,name);
  12436. sym := baseTD;
  12437. IF ~recordType.isObject THEN
  12438. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12439. sym := NIL;
  12440. END;
  12441. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12442. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12443. ELSE
  12444. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12445. END;
  12446. Symbol(source, tir, 0, 0);
  12447. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12448. Address(source,0);
  12449. ELSE
  12450. IF recordType.isObject THEN
  12451. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12452. ELSE
  12453. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12454. END;
  12455. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12456. Symbol(source, tir, 0, 0);
  12457. END;
  12458. Info(source, "base record descriptor");
  12459. Symbol(source, base, 0, 0);
  12460. CooperativeMethodTable(TRUE);
  12461. IF recordType.hasPointers THEN
  12462. IF ~HasExplicitTraceMethod (recordType) THEN
  12463. implementationVisitor.CreateTraceMethod(recordType);
  12464. END;
  12465. implementationVisitor.CreateResetProcedure(recordType);
  12466. implementationVisitor.CreateAssignProcedure(recordType);
  12467. END;
  12468. ELSIF ~simple THEN
  12469. (*
  12470. MethodEnd = MPO
  12471. ---
  12472. methods (# methods)
  12473. ---
  12474. tags (16)
  12475. ---
  12476. TypeDesc = TypeInfoAdr
  12477. ---
  12478. td adr ---> rec size
  12479. ----
  12480. pointer offsets
  12481. ----
  12482. (padding)
  12483. -----
  12484. empty [2 addresses aligned]
  12485. empty
  12486. empty
  12487. numPtrs
  12488. ---
  12489. pointer offsets
  12490. ---
  12491. *)
  12492. Info(source, "MethodEnd = MPO");
  12493. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12494. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12495. MethodTable(TRUE);
  12496. TdTable(TypeTags, TRUE);
  12497. Info(source, "type descriptor info pointer");
  12498. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12499. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12500. IF (cellType # NIL) THEN
  12501. IF cellType.sizeInBits < 0 THEN
  12502. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12503. END;
  12504. Info(source, "cell size");
  12505. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12506. ELSE
  12507. Info(source, "record size");
  12508. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12509. END;
  12510. Info(source, "pointer offsets pointer");
  12511. padding := 1- source.pc MOD 2;
  12512. Symbol(source, source, source.pc+1+padding,0);
  12513. IF padding >0 THEN
  12514. Info(source, "padding");
  12515. FOR i := 1 TO padding DO Address(source,0) END;
  12516. END;
  12517. IF cellType # NIL THEN
  12518. PointerArray(source, cellType.cellScope, numberPointers);
  12519. ELSE
  12520. PointerArray(source, recordType.recordScope, numberPointers);
  12521. END;
  12522. ELSE
  12523. (*
  12524. simple:
  12525. td adr --> size
  12526. tag(1)
  12527. tag(2)
  12528. tag(3)
  12529. methods ->
  12530. *)
  12531. Info(source, "record size");
  12532. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12533. TdTable(TypeTags, FALSE);
  12534. MethodTable(FALSE);
  12535. END;
  12536. END NewTypeDescriptor;
  12537. BEGIN
  12538. x := x.resolved;
  12539. IF (x IS SyntaxTree.PointerType) THEN
  12540. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12541. END;
  12542. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12543. recordType := x(SyntaxTree.RecordType);
  12544. td := x.typeDeclaration;
  12545. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12546. ASSERT(td # NIL);
  12547. section := module.allSections.FindBySymbol(td); (* TODO *)
  12548. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12549. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12550. NewTypeDescriptor
  12551. END;
  12552. END;
  12553. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12554. cellType := x(SyntaxTree.CellType);
  12555. td := x.typeDeclaration;
  12556. section := module.allSections.FindBySymbol(td); (* TODO *)
  12557. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12558. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12559. NewTypeDescriptor
  12560. END;
  12561. END;
  12562. END
  12563. END CheckTypeDeclaration
  12564. END MetaDataGenerator;
  12565. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12566. VAR
  12567. trace-: BOOLEAN;
  12568. traceString-: SyntaxTree.IdentifierString;
  12569. traceModuleName-: SyntaxTree.IdentifierString;
  12570. profile-: BOOLEAN;
  12571. noRuntimeChecks: BOOLEAN;
  12572. simpleMetaData-: BOOLEAN;
  12573. noAsserts: BOOLEAN;
  12574. optimize-: BOOLEAN;
  12575. cooperative-: BOOLEAN;
  12576. preregisterStatic-: BOOLEAN;
  12577. dump-: Basic.Writer;
  12578. cellsAreObjects: BOOLEAN;
  12579. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12580. experiment: BOOLEAN;
  12581. PROCEDURE &InitIntermediateBackend*;
  12582. BEGIN
  12583. simpleMetaData := FALSE;
  12584. InitBackend;
  12585. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  12586. SetTraceModuleName(DefaultTraceModuleName);
  12587. END InitIntermediateBackend;
  12588. (* must be overwritten by actual backend, if parameter registers should be used *)
  12589. PROCEDURE NumberParameterRegisters*(callingConvention: SyntaxTree.CallingConvention): SIZE;
  12590. BEGIN
  12591. RETURN 0; (* default case: no parameter registers *)
  12592. END NumberParameterRegisters;
  12593. (* must be overwritten by actual backend, if parameter registers should be used *)
  12594. PROCEDURE ParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; index: LONGINT): LONGINT;
  12595. BEGIN
  12596. HALT(100); (* abstract *)
  12597. END ParameterRegister;
  12598. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12599. VAR
  12600. declarationVisitor: DeclarationVisitor;
  12601. implementationVisitor: ImplementationVisitor;
  12602. module: Sections.Module;
  12603. name, platformName: SyntaxTree.IdentifierString;
  12604. meta: MetaDataGenerator;
  12605. crc: CRC.CRC32Stream;
  12606. BEGIN
  12607. ResetError;
  12608. Global.GetSymbolName(x,name);
  12609. NEW(module,x,system); (* backend structures *)
  12610. Global.GetModuleName(x, name);
  12611. module.SetModuleName(name);
  12612. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  12613. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12614. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12615. declarationVisitor.Module(x,module);
  12616. IF ~meta.simple THEN
  12617. meta.Module(implementationVisitor.moduleBodySection);
  12618. END;
  12619. GetDescription(platformName);
  12620. module.SetPlatformName(platformName);
  12621. NEW(crc);
  12622. module.allSections.WriteRaw(crc);
  12623. crc.Update;
  12624. meta.PatchCRC(crc.GetCRC());
  12625. RETURN module
  12626. END GenerateIntermediate;
  12627. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12628. BEGIN RETURN TRUE
  12629. END SupportedImmediate;
  12630. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12631. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12632. END ProcessSyntaxTreeModule;
  12633. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12634. VAR
  12635. result: Sections.Module;
  12636. traceName: Basic.MessageString;
  12637. BEGIN
  12638. ASSERT(intermediateCodeModule IS Sections.Module);
  12639. result := intermediateCodeModule(Sections.Module);
  12640. IF trace THEN
  12641. traceName := "intermediate code trace: ";
  12642. Strings.Append(traceName,traceString);
  12643. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12644. IF (traceString="") OR (traceString="*") THEN
  12645. result.Dump(dump);
  12646. dump.Update
  12647. ELSE
  12648. Sections.DumpFiltered(dump, result, traceString);
  12649. END
  12650. END;
  12651. RETURN result
  12652. END ProcessIntermediateCodeModule;
  12653. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12654. BEGIN instructionSet := "Intermediate";
  12655. END GetDescription;
  12656. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  12657. BEGIN
  12658. SELF.simpleMetaData := simpleMetaData;
  12659. END SetSimpleMetaData;
  12660. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12661. BEGIN COPY(name, traceModuleName)
  12662. END SetTraceModuleName;
  12663. PROCEDURE DefineOptions*(options: Options.Options);
  12664. BEGIN
  12665. DefineOptions^(options);
  12666. options.Add(0X,"trace",Options.String);
  12667. options.Add(0X,"builtinsModule",Options.String);
  12668. options.Add(0X,"traceModule",Options.String);
  12669. options.Add(0X,"profile",Options.Flag);
  12670. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12671. options.Add(0X,"noAsserts",Options.Flag);
  12672. options.Add(0X,"metaData",Options.String);
  12673. options.Add('o',"optimize", Options.Flag);
  12674. options.Add(0X,"preregisterStatic", Options.Flag);
  12675. options.Add(0X,"cellsAreObjects", Options.Flag);
  12676. options.Add(0X,"preciseGC", Options.Flag);
  12677. options.Add(0X,"trackLeave", Options.Flag);
  12678. options.Add(0X,"writeBarriers", Options.Flag);
  12679. options.Add(0X,"experiment", Options.Flag);
  12680. END DefineOptions;
  12681. PROCEDURE GetOptions*(options: Options.Options);
  12682. VAR name,string: SyntaxTree.IdentifierString;
  12683. BEGIN
  12684. GetOptions^(options);
  12685. trace := options.GetString("trace",traceString);
  12686. profile := options.GetFlag("profile");
  12687. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12688. noAsserts := options.GetFlag("noAsserts");
  12689. cooperative := options.GetFlag("cooperative");
  12690. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12691. simpleMetaData := TRUE
  12692. END;
  12693. IF options.GetString("metaData",string) THEN
  12694. IF string = "simple" THEN simpleMetaData := TRUE
  12695. ELSIF string ="full" THEN simpleMetaData := FALSE
  12696. END;
  12697. END;
  12698. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  12699. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12700. optimize := options.GetFlag("optimize");
  12701. preregisterStatic := options.GetFlag("preregisterStatic");
  12702. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12703. preciseGC := options.GetFlag("preciseGC");
  12704. trackLeave := options.GetFlag("trackLeave");
  12705. writeBarriers := options.GetFlag("writeBarriers");
  12706. experiment := options.GetFlag("experiment");
  12707. END GetOptions;
  12708. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12709. BEGIN RETURN SymbolFileFormat.Get()
  12710. END DefaultSymbolFileFormat;
  12711. END IntermediateBackend;
  12712. (* ----------------------------------- register allocation ------------------------------------- *)
  12713. (* register mapping scheme
  12714. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12715. spill offset
  12716. part(n) --> ticket <--> physical register
  12717. spill offset
  12718. *)
  12719. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12720. emptyOperand: IntermediateCode.Operand;
  12721. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12722. statCoopResetVariables: LONGINT;
  12723. statCoopModifyAssignments: LONGINT;
  12724. modifyAssignmentsPC : LONGINT;
  12725. statCoopNilCheck: LONGINT;
  12726. statCoopSwitch: LONGINT;
  12727. statCoopAssignProcedure: LONGINT;
  12728. statCoopTraceMethod: LONGINT;
  12729. statCoopResetProcedure: LONGINT;
  12730. statCoopTraceModule: LONGINT;
  12731. PROCEDURE ResetStatistics*;
  12732. BEGIN
  12733. statCoopResetVariables := 0;
  12734. statCoopModifyAssignments := 0;
  12735. statCoopNilCheck:= 0;
  12736. statCoopSwitch:= 0;
  12737. statCoopAssignProcedure:= 0;
  12738. statCoopTraceMethod:= 0;
  12739. statCoopResetProcedure:= 0;
  12740. statCoopTraceModule:= 0;
  12741. END ResetStatistics;
  12742. PROCEDURE Statistics*;
  12743. BEGIN
  12744. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12745. TRACE(statCoopNilCheck, statCoopSwitch);
  12746. TRACE(statCoopAssignProcedure,
  12747. statCoopTraceMethod,
  12748. statCoopResetProcedure,
  12749. statCoopTraceModule)
  12750. END Statistics;
  12751. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12752. VAR h: LONGINT;
  12753. BEGIN
  12754. WHILE b # 0 DO
  12755. h := a MOD b;
  12756. a := b;
  12757. b := h;
  12758. END;
  12759. RETURN a
  12760. END GCD;
  12761. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12762. BEGIN
  12763. RETURN a*b DIV GCD(a,b)
  12764. END SCM;
  12765. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12766. BEGIN
  12767. (*TRACE(a,b);*)
  12768. IF a = 0 THEN RETURN b
  12769. ELSIF b = 0 THEN RETURN a
  12770. ELSE RETURN SCM(a,b)
  12771. END;
  12772. END CommonAlignment;
  12773. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12774. BEGIN
  12775. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12776. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12777. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12778. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12779. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12780. END
  12781. END PassBySingleReference;
  12782. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12783. BEGIN
  12784. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  12785. END PassInRegister;
  12786. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12787. VAR new: RegisterEntry;
  12788. BEGIN
  12789. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12790. IF queue = NIL THEN
  12791. queue := new
  12792. ELSE
  12793. new.next := queue;
  12794. IF queue#NIL THEN queue.prev := new END;
  12795. queue := new
  12796. END;
  12797. END AddRegisterEntry;
  12798. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12799. VAR this: RegisterEntry;
  12800. BEGIN
  12801. this := queue;
  12802. WHILE (this # NIL) & (this.register # register) DO
  12803. this := this.next;
  12804. END;
  12805. IF this = NIL THEN
  12806. RETURN FALSE
  12807. END;
  12808. ASSERT(this # NIL);
  12809. IF this = queue THEN queue := queue.next END;
  12810. IF this.prev # NIL THEN this.prev.next := this.next END;
  12811. IF this.next # NIL THEN this.next.prev := this.prev END;
  12812. RETURN TRUE
  12813. END RemoveRegisterEntry;
  12814. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12815. BEGIN ASSERT(cond);
  12816. END Assert;
  12817. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12818. BEGIN
  12819. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12820. END ReusableRegister;
  12821. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12822. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12823. BEGIN
  12824. procedure := moduleScope.bodyProcedure;
  12825. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12826. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12827. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12828. procedure.SetScope(moduleScope);
  12829. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12830. procedure.SetAccess(SyntaxTree.Hidden);
  12831. moduleScope.SetBodyProcedure(procedure);
  12832. moduleScope.AddProcedure(procedure);
  12833. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12834. END;
  12835. END EnsureBodyProcedure;
  12836. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12837. VAR import: SyntaxTree.Import;
  12838. selfName: SyntaxTree.IdentifierString;
  12839. module: SyntaxTree.Module;
  12840. BEGIN
  12841. scope.ownerModule.GetName(selfName);
  12842. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12843. module := scope.ownerModule
  12844. ELSE
  12845. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12846. IF import = NIL THEN
  12847. RETURN NIL
  12848. ELSIF import.module = NIL THEN
  12849. RETURN NIL
  12850. ELSE module := import.module
  12851. END;
  12852. END;
  12853. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12854. END GetSymbol;
  12855. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12856. BEGIN
  12857. op.mode := mode;
  12858. IntermediateCode.InitOperand(op.op);
  12859. IntermediateCode.InitOperand(op.tag);
  12860. IntermediateCode.InitOperand(op.extra);
  12861. op.dimOffset := 0;
  12862. END InitOperand;
  12863. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12864. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12865. BEGIN RETURN IntermediateCode.GetType(system, type)
  12866. END GetType;
  12867. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12868. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12869. BEGIN
  12870. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12871. (*
  12872. UniqueId(name,module,name,adr);
  12873. *)
  12874. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12875. constant.SetValue(value);
  12876. constant.SetAccess(SyntaxTree.Hidden);
  12877. module.moduleScope.AddConstant(constant);
  12878. constant.SetScope(module.moduleScope);
  12879. RETURN constant
  12880. END BuildConstant;
  12881. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12882. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12883. BEGIN
  12884. variable := scope.firstVariable;
  12885. WHILE variable # NIL DO
  12886. IF variable.NeedsTrace() THEN
  12887. RETURN TRUE;
  12888. END;
  12889. variable := variable.nextVariable;
  12890. END;
  12891. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12892. WHILE parameter # NIL DO
  12893. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  12894. RETURN TRUE;
  12895. END;
  12896. parameter := parameter.nextParameter;
  12897. END;
  12898. RETURN FALSE;
  12899. END HasPointers;
  12900. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12901. 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));
  12902. END IsVariableParameter;
  12903. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12904. VAR parameter: SyntaxTree.Parameter;
  12905. BEGIN
  12906. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12907. WHILE parameter # NIL DO
  12908. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12909. IF parameter.movable THEN RETURN TRUE END;
  12910. parameter := parameter.nextParameter;
  12911. END;
  12912. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12913. END HasVariableParameters;
  12914. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12915. BEGIN
  12916. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12917. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12918. END HasExplicitTraceMethod;
  12919. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12920. BEGIN
  12921. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12922. IF (expression IS SyntaxTree.IntegerValue) THEN
  12923. val := expression(SyntaxTree.IntegerValue).value;
  12924. RETURN TRUE
  12925. ELSE
  12926. RETURN FALSE
  12927. END;
  12928. END IsIntegerConstant;
  12929. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12930. BEGIN
  12931. IF val <= 0 THEN RETURN FALSE END;
  12932. exp := 0;
  12933. WHILE ~ODD(val) DO
  12934. val := val DIV 2;
  12935. INC(exp)
  12936. END;
  12937. RETURN val = 1
  12938. END PowerOf2;
  12939. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12940. VAR procedure: SyntaxTree.Procedure;
  12941. BEGIN
  12942. procedure := record.recordScope.constructor;
  12943. IF procedure = NIL THEN
  12944. record := record.GetBaseRecord();
  12945. IF record # NIL THEN
  12946. procedure := GetConstructor(record)
  12947. END;
  12948. END;
  12949. RETURN procedure;
  12950. END GetConstructor;
  12951. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12952. BEGIN
  12953. value := SHORT(op.intValue);
  12954. RETURN op.mode = IntermediateCode.ModeImmediate;
  12955. END IsIntegerImmediate;
  12956. (** whether a type strictily is a pointer to record or object type
  12957. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12958. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12959. BEGIN
  12960. IF type = NIL THEN
  12961. RETURN FALSE
  12962. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12963. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12964. ELSE
  12965. RETURN FALSE
  12966. END
  12967. END IsStrictlyPointerToRecord;
  12968. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12969. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12970. END IsUnsafePointer;
  12971. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12972. BEGIN type := type.resolved;
  12973. IF type IS SyntaxTree.PointerType THEN
  12974. type := type(SyntaxTree.PointerType).pointerBase;
  12975. type := type.resolved;
  12976. IF type IS SyntaxTree.RecordType THEN
  12977. recordType := type(SyntaxTree.RecordType);
  12978. RETURN TRUE
  12979. ELSE
  12980. RETURN FALSE
  12981. END
  12982. ELSIF type IS SyntaxTree.RecordType THEN
  12983. recordType := type(SyntaxTree.RecordType);
  12984. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12985. ELSIF type IS SyntaxTree.ObjectType THEN
  12986. RETURN TRUE
  12987. ELSIF type IS SyntaxTree.AnyType THEN
  12988. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12989. ELSE
  12990. RETURN FALSE
  12991. END;
  12992. END IsPointerToRecord;
  12993. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12994. BEGIN
  12995. type := type.resolved;
  12996. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12997. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12998. END IsArrayOfSystemByte;
  12999. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13000. BEGIN
  13001. IF type = NIL THEN RETURN FALSE END;
  13002. type := type.resolved;
  13003. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13004. END IsOpenArray;
  13005. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13006. BEGIN
  13007. IF type = NIL THEN RETURN FALSE END;
  13008. type := type.resolved;
  13009. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13010. END IsSemiDynamicArray;
  13011. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13012. BEGIN
  13013. IF type = NIL THEN RETURN FALSE END;
  13014. type := type.resolved;
  13015. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13016. END IsStaticArray;
  13017. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13018. BEGIN
  13019. IF type = NIL THEN RETURN FALSE END;
  13020. type := type.resolved;
  13021. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13022. END IsStaticMathArray;
  13023. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13024. BEGIN
  13025. WHILE (IsStaticMathArray(type)) DO
  13026. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13027. END;
  13028. RETURN type;
  13029. END StaticMathArrayBaseType;
  13030. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13031. VAR size: LONGINT;
  13032. BEGIN
  13033. size := 1;
  13034. WHILE (IsStaticArray(type)) DO
  13035. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  13036. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13037. END;
  13038. RETURN size;
  13039. END StaticArrayNumElements;
  13040. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13041. VAR size: LONGINT;
  13042. BEGIN
  13043. size := 1;
  13044. WHILE (IsStaticMathArray(type)) DO
  13045. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  13046. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13047. END;
  13048. RETURN size;
  13049. END StaticMathArrayNumElements;
  13050. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13051. BEGIN
  13052. WHILE (IsStaticArray(type)) DO
  13053. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13054. END;
  13055. RETURN type;
  13056. END StaticArrayBaseType;
  13057. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13058. BEGIN
  13059. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  13060. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13061. END;
  13062. RETURN type;
  13063. END ArrayBaseType;
  13064. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  13065. BEGIN
  13066. IF type = NIL THEN RETURN FALSE END;
  13067. type := type.resolved;
  13068. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  13069. END IsDelegate;
  13070. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  13071. VAR i: LONGINT;
  13072. BEGIN
  13073. i := 0; type := type.resolved;
  13074. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13075. INC(i);
  13076. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  13077. END;
  13078. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13079. INC(i);
  13080. type := type(SyntaxTree.MathArrayType).arrayBase;
  13081. IF type # NIL THEN type := type.resolved END;
  13082. END;
  13083. RETURN i
  13084. END DynamicDim;
  13085. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13086. BEGIN
  13087. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13088. type := type(SyntaxTree.ArrayType).arrayBase;
  13089. END;
  13090. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13091. type := type(SyntaxTree.MathArrayType).arrayBase;
  13092. END;
  13093. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13094. END StaticSize;
  13095. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13096. BEGIN
  13097. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13098. END IsImmediate;
  13099. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13100. BEGIN
  13101. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13102. END IsAddress;
  13103. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13104. BEGIN
  13105. RETURN (x.mode = IntermediateCode.ModeRegister);
  13106. END IsRegister;
  13107. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13108. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13109. BEGIN
  13110. typeDeclaration := recordType.typeDeclaration;
  13111. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13112. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13113. END GetRecordTypeName;
  13114. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13115. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13116. BEGIN
  13117. parSize := 0;
  13118. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13119. parameter := procedureType.returnParameter;
  13120. INC(parSize,system.SizeOfParameter(parameter));
  13121. parSize := parSize + (-parSize) MOD system.addressSize;
  13122. END;
  13123. parameter :=procedureType.lastParameter;
  13124. WHILE (parameter # NIL) DO
  13125. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  13126. INC(parSize, system.addressSize);
  13127. ELSE
  13128. INC(parSize,system.SizeOfParameter(parameter));
  13129. parSize := parSize + (-parSize) MOD system.addressSize;
  13130. END;
  13131. parameter := parameter.prevParameter;
  13132. END;
  13133. IF procedureType.selfParameter # NIL THEN
  13134. parameter := procedureType.selfParameter;
  13135. INC(parSize,system.SizeOfParameter(parameter));
  13136. parSize := parSize + (-parSize) MOD system.addressSize;
  13137. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13138. END; (* method => self pointer *)
  13139. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13140. RETURN ToMemoryUnits(system,parSize)
  13141. END ParametersSize;
  13142. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13143. BEGIN
  13144. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13145. END IsNested;
  13146. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13147. BEGIN
  13148. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13149. scope := scope.outerScope;
  13150. END;
  13151. RETURN scope # NIL;
  13152. END InCellScope;
  13153. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13154. BEGIN
  13155. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  13156. END ProcedureParametersSize;
  13157. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13158. VAR dataUnit: LONGINT;
  13159. BEGIN dataUnit := system.dataUnit;
  13160. ASSERT(size MOD system.dataUnit = 0);
  13161. RETURN LONGINT(size DIV system.dataUnit)
  13162. END ToMemoryUnits;
  13163. PROCEDURE Get*(): Backend.Backend;
  13164. VAR backend: IntermediateBackend;
  13165. BEGIN NEW(backend); RETURN backend
  13166. END Get;
  13167. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13168. VAR instruction: IntermediateCode.Instruction;
  13169. BEGIN
  13170. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13171. RETURN instruction
  13172. END Nop;
  13173. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13174. VAR instruction: IntermediateCode.Instruction;
  13175. BEGIN
  13176. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13177. RETURN instruction
  13178. END Mov;
  13179. (* like Mov but ensures that no new register will be allocated for dest *)
  13180. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13181. VAR instruction: IntermediateCode.Instruction;
  13182. BEGIN
  13183. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13184. RETURN instruction
  13185. END MovReplace;
  13186. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13187. VAR instruction: IntermediateCode.Instruction;
  13188. BEGIN
  13189. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13190. RETURN instruction
  13191. END Conv;
  13192. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13193. VAR instruction: IntermediateCode.Instruction;
  13194. BEGIN
  13195. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13196. RETURN instruction
  13197. END Call;
  13198. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13199. VAR op1, op2, op3: IntermediateCode.Operand;
  13200. VAR instruction: IntermediateCode.Instruction;
  13201. BEGIN
  13202. IntermediateCode.InitNumber(op1,pcOffset);
  13203. IntermediateCode.InitNumber(op2,callingConvention);
  13204. IntermediateCode.InitNumber(op3,unwind);
  13205. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13206. RETURN instruction
  13207. END Exit;
  13208. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13209. VAR instruction: IntermediateCode.Instruction;
  13210. BEGIN
  13211. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13212. RETURN instruction
  13213. END Return;
  13214. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13215. VAR instruction: IntermediateCode.Instruction;
  13216. BEGIN
  13217. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13218. RETURN instruction
  13219. END Result;
  13220. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13221. VAR op1: IntermediateCode.Operand;
  13222. VAR instruction: IntermediateCode.Instruction;
  13223. BEGIN
  13224. IntermediateCode.InitNumber(op1,nr);
  13225. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13226. RETURN instruction
  13227. END Trap;
  13228. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13229. VAR instruction: IntermediateCode.Instruction;
  13230. BEGIN
  13231. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13232. RETURN instruction
  13233. END Br;
  13234. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13235. VAR instruction: IntermediateCode.Instruction;
  13236. BEGIN
  13237. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13238. RETURN instruction
  13239. END Breq;
  13240. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13241. VAR instruction: IntermediateCode.Instruction;
  13242. BEGIN
  13243. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13244. RETURN instruction
  13245. END Brne;
  13246. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13247. VAR instruction: IntermediateCode.Instruction;
  13248. BEGIN
  13249. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13250. RETURN instruction
  13251. END Brge;
  13252. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13253. VAR instruction: IntermediateCode.Instruction;
  13254. BEGIN
  13255. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13256. RETURN instruction
  13257. END Brlt;
  13258. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13259. VAR instruction: IntermediateCode.Instruction;
  13260. BEGIN
  13261. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13262. RETURN instruction
  13263. END Pop;
  13264. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13265. VAR instruction: IntermediateCode.Instruction;
  13266. BEGIN
  13267. ASSERT(op.mode # IntermediateCode.Undefined);
  13268. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13269. RETURN instruction
  13270. END Push;
  13271. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13272. VAR instruction: IntermediateCode.Instruction;
  13273. BEGIN
  13274. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13275. RETURN instruction
  13276. END Neg;
  13277. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13278. VAR instruction: IntermediateCode.Instruction;
  13279. BEGIN
  13280. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13281. RETURN instruction
  13282. END Not;
  13283. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13284. VAR instruction: IntermediateCode.Instruction;
  13285. BEGIN
  13286. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13287. RETURN instruction
  13288. END Abs;
  13289. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13290. VAR instruction: IntermediateCode.Instruction;
  13291. BEGIN
  13292. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13293. ASSERT(~IsImmediate(instruction.op1));
  13294. RETURN instruction
  13295. END Mul;
  13296. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13297. VAR instruction: IntermediateCode.Instruction;
  13298. BEGIN
  13299. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13300. RETURN instruction
  13301. END Div;
  13302. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13303. VAR instruction: IntermediateCode.Instruction;
  13304. BEGIN
  13305. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13306. RETURN instruction
  13307. END Mod;
  13308. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13309. VAR instruction: IntermediateCode.Instruction;
  13310. BEGIN
  13311. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13312. RETURN instruction
  13313. END Sub;
  13314. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13315. VAR instruction: IntermediateCode.Instruction;
  13316. BEGIN
  13317. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13318. RETURN instruction
  13319. END Add;
  13320. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13321. VAR instruction: IntermediateCode.Instruction;
  13322. BEGIN
  13323. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13324. RETURN instruction
  13325. END And;
  13326. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13327. VAR instruction: IntermediateCode.Instruction;
  13328. BEGIN
  13329. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13330. RETURN instruction
  13331. END Or;
  13332. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13333. VAR instruction: IntermediateCode.Instruction;
  13334. BEGIN
  13335. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13336. RETURN instruction
  13337. END Xor;
  13338. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13339. VAR instruction: IntermediateCode.Instruction;
  13340. BEGIN
  13341. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13342. RETURN instruction
  13343. END Shl;
  13344. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13345. VAR instruction: IntermediateCode.Instruction;
  13346. BEGIN
  13347. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13348. RETURN instruction
  13349. END Shr;
  13350. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13351. VAR instruction: IntermediateCode.Instruction;
  13352. BEGIN
  13353. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13354. RETURN instruction
  13355. END Rol;
  13356. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13357. VAR instruction: IntermediateCode.Instruction;
  13358. BEGIN
  13359. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13360. RETURN instruction
  13361. END Ror;
  13362. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13363. VAR instruction: IntermediateCode.Instruction;
  13364. BEGIN
  13365. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13366. RETURN instruction
  13367. END Cas;
  13368. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13369. VAR instruction: IntermediateCode.Instruction;
  13370. BEGIN
  13371. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  13372. ASSERT(~IntermediateCode.IsVectorRegister(src));
  13373. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13374. RETURN instruction
  13375. END Copy;
  13376. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13377. VAR instruction: IntermediateCode.Instruction;
  13378. BEGIN
  13379. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13380. RETURN instruction
  13381. END Fill;
  13382. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13383. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13384. BEGIN
  13385. string := IntermediateCode.String(s);
  13386. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13387. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13388. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13389. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13390. RETURN instruction
  13391. END Asm;
  13392. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13393. VAR instruction: IntermediateCode.Instruction;
  13394. BEGIN
  13395. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13396. RETURN instruction
  13397. END Data;
  13398. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13399. VAR instruction: IntermediateCode.Instruction;
  13400. BEGIN
  13401. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13402. IntermediateCode.SetSubType(instruction, subtype);
  13403. RETURN instruction
  13404. END SpecialInstruction;
  13405. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13406. VAR op1: IntermediateCode.Operand;
  13407. VAR instruction: IntermediateCode.Instruction;
  13408. BEGIN
  13409. (*! generate a warning if size exceeds a certain limit *)
  13410. (*
  13411. ASSERT(bytes < 1000000); (* sanity check *)
  13412. *)
  13413. ASSERT(0 <= units); (* sanity check *)
  13414. IntermediateCode.InitNumber(op1,units);
  13415. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13416. RETURN instruction
  13417. END Reserve;
  13418. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13419. VAR op1: IntermediateCode.Operand;
  13420. VAR instruction: IntermediateCode.Instruction;
  13421. BEGIN
  13422. IntermediateCode.InitNumber(op1,position.start);
  13423. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13424. RETURN instruction
  13425. END LabelInstruction;
  13426. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13427. VAR pc: LONGINT;
  13428. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13429. BEGIN
  13430. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13431. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13432. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13433. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13434. IF instr.op1.type.form = IntermediateCode.Float THEN
  13435. RETURN instr.op1.floatValue = op.floatValue
  13436. ELSE
  13437. RETURN instr.op1.intValue = op.intValue
  13438. END;
  13439. END ProvidesValue;
  13440. BEGIN
  13441. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13442. pc := 0;
  13443. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13444. INC(pc);
  13445. END;
  13446. IF pc = data.pc THEN
  13447. data.Emit(Data(Basic.invalidPosition,vop));
  13448. END;
  13449. RETURN pc
  13450. END EnterImmediate;
  13451. PROCEDURE Init;
  13452. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13453. BEGIN
  13454. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13455. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13456. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13457. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13458. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13459. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13460. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13461. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13462. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13463. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13464. IntermediateCode.InitOperand(emptyOperand);
  13465. FOR i := 0 TO NumberSystemCalls-1 DO
  13466. name := "@SystemCall";
  13467. Basic.AppendNumber(name,i);
  13468. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13469. END;
  13470. END Init;
  13471. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13472. BEGIN
  13473. RETURN (symbol # NIL) & symbol.NeedsSection();
  13474. END IsExported;
  13475. BEGIN
  13476. Init;
  13477. END FoxIntermediateBackend.
  13478. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  13479. # Release.Build --path="/temp/obg/" Win32 ~
  13480. # Linker.Link --fileFormat=PE32 --fileName=A2H.exe --extension=GofW --displacement=401000H Builtins Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection Loader BootConsole ~
  13481. FStols.CloseFiles A2Z.exe ~
  13482. System.FreeDownTo FoxIntermediateBackend ~
  13483. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  13484. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  13485. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13486. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13487. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13488. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13489. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  13490. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  13491. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13492. GenericLinker.Mod Loader.Mod BootConsole.Mod