FoxIntermediateBackend.Mod 573 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067140681406914070140711407214073140741407514076140771407814079140801408114082140831408414085140861408714088140891409014091140921409314094140951409614097140981409914100141011410214103141041410514106141071410814109141101411114112141131411414115141161411714118141191412014121141221412314124141251412614127141281412914130141311413214133141341413514136141371413814139141401414114142141431414414145141461414714148141491415014151141521415314154141551415614157141581415914160141611416214163141641416514166141671416814169141701417114172141731417414175141761417714178141791418014181141821418314184141851418614187141881418914190141911419214193141941419514196141971419814199142001420114202142031420414205142061420714208142091421014211142121421314214142151421614217142181421914220142211422214223142241422514226142271422814229142301423114232142331423414235142361423714238142391424014241142421424314244142451424614247142481424914250142511425214253142541425514256142571425814259142601426114262142631426414265142661426714268142691427014271142721427314274142751427614277142781427914280142811428214283142841428514286142871428814289142901429114292142931429414295142961429714298142991430014301143021430314304143051430614307143081430914310143111431214313143141431514316143171431814319143201432114322143231432414325143261432714328143291433014331143321433314334143351433614337143381433914340143411434214343143441434514346143471434814349143501435114352143531435414355143561435714358143591436014361143621436314364143651436614367143681436914370143711437214373143741437514376143771437814379143801438114382143831438414385143861438714388143891439014391143921439314394143951439614397143981439914400144011440214403144041440514406144071440814409144101441114412144131441414415144161441714418144191442014421144221442314424144251442614427144281442914430144311443214433144341443514436144371443814439144401444114442144431444414445144461444714448144491445014451144521445314454144551445614457144581445914460144611446214463144641446514466144671446814469144701447114472144731447414475144761447714478144791448014481144821448314484144851448614487144881448914490144911449214493144941449514496144971449814499145001450114502145031450414505145061450714508145091451014511145121451314514145151451614517145181451914520145211452214523145241452514526145271452814529145301453114532145331453414535145361453714538145391454014541145421454314544145451454614547145481454914550145511455214553145541455514556145571455814559145601456114562145631456414565145661456714568145691457014571145721457314574145751457614577145781457914580145811458214583145841458514586145871458814589145901459114592145931459414595145961459714598145991460014601146021460314604146051460614607146081460914610146111461214613146141461514616146171461814619146201462114622146231462414625146261462714628146291463014631146321463314634146351463614637146381463914640146411464214643146441464514646146471464814649146501465114652146531465414655146561465714658146591466014661146621466314664146651466614667146681466914670146711467214673146741467514676146771467814679146801468114682146831468414685
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Diagnostics, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool, CRC;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. Trace = FALSE;
  42. TraceRegisterUsageCount=TRUE;
  43. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  44. (** system call numbers *)
  45. NumberSystemCalls* = 12;
  46. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  47. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  48. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  49. DefaultRuntimeModuleName ="Runtime";
  50. DefaultTraceModuleName ="KernelLog";
  51. ChannelModuleName = "Channels";
  52. NonPointer = -1; (* special pointer values *)
  53. NoType = 0; (* special type info values *)
  54. LhsIsPointer = 0; (* for the operator kind *)
  55. RhsIsPointer = 1;
  56. (* priority values, lower means higher priority *)
  57. EntryPriority=-4;
  58. FirstPriority=-3;
  59. InitPriority=-2;
  60. ExitPriority=-1;
  61. BasePointerTypeSize = 5;
  62. BaseArrayTypeSize = BasePointerTypeSize + 3;
  63. LengthOffset = BasePointerTypeSize + 0;
  64. DataOffset = BasePointerTypeSize + 1;
  65. DescriptorOffset = BasePointerTypeSize + 2;
  66. BaseRecordTypeSize = BasePointerTypeSize + 2;
  67. ActionOffset = BasePointerTypeSize + 0;
  68. MonitorOffset = BasePointerTypeSize + 1;
  69. BaseObjectTypeSize = BaseRecordTypeSize;
  70. ActionTypeSize = 3;
  71. MonitorTypeSize = 7;
  72. ProcessorOffset = BaseObjectTypeSize + 1;
  73. StackLimitOffset* = BaseObjectTypeSize + 3;
  74. QuantumOffset = BaseObjectTypeSize + 4;
  75. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  76. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  77. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  78. Size2Flag = 4; (* size = 2 *)
  79. Size3Flag = 5; (* size = 3 *)
  80. Size4Flag = 6; (* size = 4 *)
  81. Size5Flag = 7; (* size = 5 *)
  82. Size6Flag = 8; (* size = 6 *)
  83. Size7Flag = 9; (* size = 7 *)
  84. Size8Flag = 10; (* size = 8 *)
  85. ReflectionSupport = TRUE;
  86. (* Solution for identifying procedure descriptors on the stack and for being able to differentiate "old school" stack frames from the underlying operating system stack frames:
  87. push a procedure desriptor plus one to where the BP pointer would be located. The misalignment of the procedure descriptor makes it possible to identify that it is not
  88. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  89. *)
  90. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  91. ProtectModulesPointers = FALSE;
  92. CreateProcedureDescInfo = TRUE;
  93. WarningDynamicLoading = FALSE;
  94. TYPE
  95. Position=SyntaxTree.Position;
  96. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  97. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  98. Operand = RECORD
  99. mode: SHORTINT;
  100. op: IntermediateCode.Operand;
  101. tag: IntermediateCode.Operand;
  102. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  103. dimOffset: LONGINT;
  104. END;
  105. Fixup= POINTER TO RECORD
  106. pc: LONGINT;
  107. nextFixup: Fixup;
  108. END;
  109. WriteBackCall = POINTER TO RECORD
  110. call: SyntaxTree.ProcedureCallDesignator;
  111. next: WriteBackCall;
  112. END;
  113. Label= OBJECT
  114. VAR
  115. fixups: Fixup;
  116. section: IntermediateCode.Section;
  117. pc: LONGINT;
  118. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  119. BEGIN
  120. SELF.section := section; pc := -1;
  121. END InitLabel;
  122. PROCEDURE Resolve(pc: LONGINT);
  123. VAR at: LONGINT;
  124. BEGIN
  125. SELF.pc := pc;
  126. WHILE(fixups # NIL) DO
  127. at := fixups.pc;
  128. section.PatchAddress(at,pc);
  129. fixups := fixups.nextFixup;
  130. END;
  131. END Resolve;
  132. PROCEDURE AddFixup(at: LONGINT);
  133. VAR fixup: Fixup;
  134. BEGIN
  135. ASSERT(pc=-1);
  136. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  137. END AddFixup;
  138. END Label;
  139. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  140. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  141. VAR
  142. backend: IntermediateBackend;
  143. implementationVisitor: ImplementationVisitor;
  144. meta: MetaDataGenerator;
  145. system: Global.System;
  146. currentScope: SyntaxTree.Scope;
  147. module: Sections.Module;
  148. moduleSelf: SyntaxTree.Variable;
  149. dump: BOOLEAN;
  150. forceModuleBody: BOOLEAN;
  151. addressType: IntermediateCode.Type;
  152. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  153. BEGIN
  154. currentScope := NIL; module := NIL; moduleSelf := NIL;
  155. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  156. SELF.dump := dump;
  157. SELF.backend := backend;
  158. SELF.forceModuleBody := forceModuleBody;
  159. addressType := IntermediateCode.GetType(system,system.addressType)
  160. END Init;
  161. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  162. BEGIN
  163. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  164. END Error;
  165. PROCEDURE Type(x: SyntaxTree.Type);
  166. BEGIN
  167. x.Accept(SELF);
  168. END Type;
  169. (** types **)
  170. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  171. BEGIN (* no code emission *) END VisitBasicType;
  172. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  173. BEGIN (* no code emission *) END VisitCharacterType;
  174. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  175. BEGIN (* no code emission *) END VisitIntegerType;
  176. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  177. BEGIN (* no code emission *) END VisitFloatType;
  178. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  179. BEGIN (* no code emission *) END VisitComplexType;
  180. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  181. VAR type: SyntaxTree.Type;
  182. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  183. type := x.resolved;
  184. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  185. meta.CheckTypeDeclaration(type);
  186. END;
  187. END VisitQualifiedType;
  188. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  189. BEGIN (* no code emission *) END VisitStringType;
  190. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  191. BEGIN (* no code emission *)
  192. END VisitArrayRangeType;
  193. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  194. BEGIN (* no code emission *) END VisitArrayType;
  195. PROCEDURE VisitPortType(x: SyntaxTree.PortType);
  196. BEGIN (* no code emission *) END VisitPortType;
  197. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  198. BEGIN
  199. meta.CheckTypeDeclaration(x);
  200. END VisitMathArrayType;
  201. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  202. BEGIN
  203. meta.CheckTypeDeclaration(x);
  204. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  205. END VisitPointerType;
  206. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  207. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  208. BEGIN (* no code emission *)
  209. meta.CheckTypeDeclaration(x);
  210. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  211. IF x.pointerType.typeDeclaration # NIL THEN
  212. td := x.pointerType.typeDeclaration
  213. ELSE
  214. td := x.typeDeclaration
  215. END;
  216. Global.GetSymbolName(td,name);
  217. (* code section for object *)
  218. END;
  219. Scope(x.recordScope);
  220. END VisitRecordType;
  221. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  222. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  223. BEGIN
  224. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  225. WHILE (this # NIL) & (this.identifier# id) DO
  226. this := this.nextModifier;
  227. END;
  228. RETURN this # NIL
  229. END HasFlag;
  230. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  231. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  232. BEGIN
  233. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  234. capabilities := {};
  235. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  236. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  237. backend.SetCapabilities(capabilities);
  238. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  239. Scope(x.cellScope);
  240. END;
  241. END VisitCellType;
  242. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  243. BEGIN (* no code emission *) END VisitProcedureType;
  244. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  245. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  246. END VisitEnumerationType;
  247. (* symbols *)
  248. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  249. BEGIN
  250. Procedure(x);
  251. END VisitProcedure;
  252. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  253. BEGIN
  254. Procedure(x);
  255. END VisitOperator;
  256. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  257. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  258. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  259. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  260. BEGIN
  261. type := type.resolved;
  262. IF type IS SyntaxTree.RecordType THEN
  263. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  264. ELSIF (type IS SyntaxTree.ArrayType) THEN
  265. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  266. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  267. END;
  268. ELSIF type IS SyntaxTree.MathArrayType THEN
  269. WITH type: SyntaxTree.MathArrayType DO
  270. IF type.form = SyntaxTree.Open THEN
  271. RETURN TRUE
  272. ELSIF type.form = SyntaxTree.Static THEN
  273. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  274. END;
  275. END;
  276. END;
  277. RETURN FALSE
  278. END TypeNeedsInitialization;
  279. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  280. VAR variable: SyntaxTree.Variable;
  281. BEGIN
  282. variable := scope.firstVariable;
  283. WHILE variable # NIL DO
  284. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  285. IF variable.initializer # NIL THEN RETURN TRUE END;
  286. variable := variable.nextVariable;
  287. END;
  288. RETURN FALSE
  289. END ScopeNeedsInitialization;
  290. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset: LONGINT);
  291. BEGIN
  292. size := offset - lastUpdated;
  293. IF size > 0 THEN
  294. irv.Emit(Reserve(x.position,size));
  295. END;
  296. irv.Emit(Data(x.position, op));
  297. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  298. END SingleInitialize;
  299. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset: LONGINT);
  300. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size: SIZE;
  301. BEGIN
  302. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  303. WITH type: SyntaxTree.RecordType DO
  304. baseType := type.baseType;
  305. IF baseType # NIL THEN
  306. baseType := baseType.resolved;
  307. IF baseType IS SyntaxTree.PointerType THEN
  308. baseType := baseType(SyntaxTree.PointerType).pointerBase
  309. END;
  310. Initialize(baseType,NIL, offset);
  311. END;
  312. variable := type.recordScope.firstVariable;
  313. WHILE variable # NIL DO
  314. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  315. variable := variable.nextVariable
  316. END;
  317. | type: SyntaxTree.ArrayType DO
  318. IF type.form = SyntaxTree.Static THEN
  319. baseType := type.arrayBase;
  320. IF TypeNeedsInitialization(baseType) THEN
  321. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  322. FOR i := 0 TO type.staticLength-1 DO
  323. Initialize(baseType,NIL,offset+i*size);
  324. END;
  325. END;
  326. END;
  327. | type: SyntaxTree.MathArrayType DO
  328. IF type.form = SyntaxTree.Open THEN
  329. dim := DynamicDim(type);
  330. baseType := SemanticChecker.ArrayBase(type,dim);
  331. imm := IntermediateCode.Immediate(addressType,dim);
  332. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  333. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  334. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  335. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  336. (* flags remain empty (=0) for open array *)
  337. ELSIF type.form = SyntaxTree.Static THEN
  338. baseType := type.arrayBase;
  339. IF TypeNeedsInitialization(baseType) THEN
  340. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  341. ASSERT(type.staticLength < 1024*1024*1024);
  342. FOR i := 0 TO type.staticLength-1 DO
  343. Initialize(baseType,NIL,offset+i*size);
  344. END;
  345. END;
  346. END;
  347. ELSE
  348. IF initializer # NIL THEN
  349. implementationVisitor.Evaluate(initializer, op);
  350. SingleInitialize(op.op, offset);
  351. END;
  352. END;
  353. END Initialize;
  354. BEGIN
  355. IF x.externalName # NIL THEN RETURN END;
  356. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  357. (* code section for variable *)
  358. Global.GetSymbolSegmentedName(x,name);
  359. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  360. irv.SetExported(IsExported(x));
  361. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  362. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  363. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  364. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  365. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  366. FOR i := 0 TO DynamicDim(x.type)-1 DO
  367. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  368. END;
  369. ELSE
  370. lastUpdated:= 0;
  371. IF implementationVisitor.newObjectFile & ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  372. Initialize(x.type, x.initializer, 0);
  373. END;
  374. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  375. IF size > 0 THEN
  376. irv.Emit(Reserve(x.position,size));
  377. END;
  378. IF ~x.fixed THEN
  379. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  380. ELSE
  381. align := x.alignment;
  382. END;
  383. irv.SetPositionOrAlignment(x.fixed, align);
  384. meta.CheckTypeDeclaration(x.type);
  385. END;
  386. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  387. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  388. END;
  389. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  390. END VisitVariable;
  391. PROCEDURE VisitProperty(x: SyntaxTree.Property);
  392. BEGIN
  393. VisitVariable(x)
  394. END VisitProperty;
  395. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  396. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  397. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  398. BEGIN
  399. ASSERT(currentScope IS SyntaxTree.CellScope);
  400. Global.GetSymbolSegmentedName(x,name);
  401. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  402. irv.SetExported(IsExported(x));
  403. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  404. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  405. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  406. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  407. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  408. FOR i := 0 TO DynamicDim(x.type)-1 DO
  409. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  410. END;
  411. ELSE
  412. lastUpdated:= 0;
  413. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  414. IF size > 0 THEN
  415. irv.Emit(Reserve(x.position,size));
  416. END;
  417. IF ~x.fixed THEN
  418. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  419. ELSE
  420. align := x.alignment;
  421. END;
  422. irv.SetPositionOrAlignment(x.fixed, align);
  423. meta.CheckTypeDeclaration(x.type);
  424. END;
  425. END VisitParameter;
  426. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  427. BEGIN
  428. Type(x.declaredType); (* => code in objects *)
  429. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  430. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  431. END;
  432. END VisitTypeDeclaration;
  433. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  434. BEGIN
  435. IF (SyntaxTree.Public * x.access # {}) THEN
  436. implementationVisitor.VisitConstant(x);
  437. END;
  438. END VisitConstant;
  439. PROCEDURE Scope(x: SyntaxTree.Scope);
  440. VAR procedure: SyntaxTree.Procedure;
  441. constant: SyntaxTree.Constant;
  442. variable: SyntaxTree.Variable;
  443. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  444. cell: SyntaxTree.CellType;
  445. parameter: SyntaxTree.Parameter;
  446. property: SyntaxTree.Property;
  447. BEGIN
  448. prevScope := currentScope;
  449. currentScope := x;
  450. (* constants treated in implementation visitor *)
  451. WITH x: SyntaxTree.CellScope DO
  452. cell := x.ownerCell;
  453. parameter := cell.firstParameter;
  454. WHILE parameter # NIL DO
  455. VisitParameter(parameter);
  456. parameter := parameter.nextParameter;
  457. END;
  458. property := cell.firstProperty;
  459. WHILE property # NIL DO
  460. VisitProperty(property);
  461. property := property.nextProperty;
  462. END;
  463. ELSE
  464. END;
  465. typeDeclaration := x.firstTypeDeclaration;
  466. WHILE typeDeclaration # NIL DO
  467. VisitTypeDeclaration(typeDeclaration);
  468. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  469. END;
  470. variable := x.firstVariable;
  471. WHILE variable # NIL DO
  472. VisitVariable(variable);
  473. variable := variable.nextVariable;
  474. END;
  475. procedure := x.firstProcedure;
  476. WHILE procedure # NIL DO
  477. VisitProcedure(procedure);
  478. procedure := procedure.nextProcedure;
  479. END;
  480. constant := x.firstConstant;
  481. WHILE constant # NIL DO
  482. VisitConstant(constant);
  483. constant := constant.nextConstant;
  484. END;
  485. currentScope := prevScope;
  486. END Scope;
  487. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  488. VAR parameter: SyntaxTree.Parameter;
  489. BEGIN
  490. parameter := first;
  491. WHILE parameter # NIL DO
  492. VisitParameter(parameter);
  493. parameter := parameter.nextParameter;
  494. END;
  495. END Parameters;
  496. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  497. VAR scope: SyntaxTree.ProcedureScope;
  498. prevScope: SyntaxTree.Scope;
  499. inline, finalizer: BOOLEAN;
  500. procedureType: SyntaxTree.ProcedureType;
  501. pc: LONGINT;
  502. stackSize: LONGINT;
  503. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  504. null,size,src,dest,fp,res: IntermediateCode.Operand;
  505. cc: LONGINT;
  506. cellType: SyntaxTree.CellType;
  507. registerNumber: LONGINT;
  508. registerParameter: Backend.Registers;
  509. registerParameters: LONGINT;
  510. registerClass: IntermediateCode.RegisterClass;
  511. type: IntermediateCode.Type;
  512. formalParameter: SyntaxTree.Parameter;
  513. recordType: SyntaxTree.RecordType;
  514. isModuleBody: BOOLEAN;
  515. parametersSize: LONGINT;
  516. position: LONGINT;
  517. PROCEDURE Signature;
  518. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  519. BEGIN
  520. procedureType := x.type(SyntaxTree.ProcedureType);
  521. returnType := procedureType.returnType;
  522. IF returnType # NIL THEN
  523. meta.CheckTypeDeclaration(returnType)
  524. END;
  525. parameter := procedureType.firstParameter;
  526. WHILE parameter # NIL DO
  527. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  528. parameter := parameter.nextParameter;
  529. END;
  530. END Signature;
  531. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  532. VAR result: BOOLEAN;
  533. BEGIN
  534. result := FALSE;
  535. IF x = SyntaxTree.invalidExpression THEN
  536. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  537. result := TRUE;
  538. value := x.resolved(SyntaxTree.IntegerValue).value;
  539. ELSE
  540. Error(x.position,"expression is not an integer constant");
  541. END;
  542. RETURN result;
  543. END CheckIntegerValue;
  544. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  545. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  546. BEGIN
  547. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  548. WHILE (this # NIL) & (this.identifier # id) DO
  549. this := this.nextModifier;
  550. END;
  551. IF this # NIL THEN
  552. IF this.expression = NIL THEN
  553. Error(this.position,"expected expression value");
  554. ELSIF CheckIntegerValue(this.expression,value) THEN
  555. END;
  556. RETURN TRUE
  557. ELSE RETURN FALSE
  558. END;
  559. END HasValue;
  560. CONST DefaultDataMemorySize=512;
  561. BEGIN
  562. IF x.externalName # NIL THEN RETURN END;
  563. (*
  564. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  565. *)
  566. (* code section for this procedure *)
  567. position := x.position.start;
  568. scope := x.procedureScope;
  569. prevScope := currentScope;
  570. currentScope := scope;
  571. procedureType := x.type(SyntaxTree.ProcedureType);
  572. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  573. implementationVisitor.temporaries.Init;
  574. implementationVisitor.usedRegisters := NIL;
  575. implementationVisitor.registerUsageCount.Init;
  576. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  577. IF (scope.body # NIL) & (x.isInline) THEN
  578. inline := TRUE;
  579. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  580. ir.SetExported(IsExported(x));
  581. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  582. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  583. IF backend.cellsAreObjects THEN
  584. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  585. ir.SetExported(IsExported(x));
  586. ELSE
  587. RETURN; (* cellnet cannot be compiled for final static hardware *)
  588. END;
  589. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  590. inline := FALSE;
  591. AddBodyCallStub(x);
  592. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  593. ir.SetExported(IsExported(x));
  594. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  595. inline := FALSE;
  596. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  597. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  598. AddBodyCallStub(x);
  599. AddStackAllocation(x,stackSize);
  600. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  601. ir.SetExported(IsExported(x));
  602. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  603. inline := FALSE;
  604. Parameters(procedureType.firstParameter);
  605. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  606. ir.SetExported(IsExported(x));
  607. ELSE
  608. inline := FALSE;
  609. IF x.isEntry OR x.isExit THEN
  610. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  611. ir.SetExported(TRUE);
  612. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  613. ELSE
  614. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  615. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  616. END;
  617. END;
  618. cc := procedureType.callingConvention;
  619. IF cc = SyntaxTree.WinAPICallingConvention THEN
  620. parametersSize := ProcedureParametersSize(backend.system,x);
  621. ELSE
  622. parametersSize := 0;
  623. END;
  624. IF scope.body # NIL THEN
  625. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  626. registerNumber := 0;
  627. IF ~inline THEN
  628. IF scope.lastVariable = NIL THEN
  629. stackSize := 0
  630. ELSE
  631. stackSize := scope.lastVariable.offsetInBits;
  632. IF stackSize <0 THEN stackSize := -stackSize END;
  633. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  634. END;
  635. (*
  636. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  637. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  638. *)
  639. (*
  640. ir.Emit(Nop(position)); (* placeholder for fill *)
  641. *)
  642. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  643. registerParameter := backend.GetParameterRegisters(procedureType.callingConvention);
  644. IF registerParameter = NIL THEN registerParameters := 0
  645. ELSE registerParameters := LEN(registerParameter)
  646. END;
  647. formalParameter := procedureType.lastParameter;
  648. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  649. IF ~PassInRegister(formalParameter) THEN
  650. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  651. ELSE
  652. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, registerParameter[registerNumber]);
  653. IF formalParameter.type.IsRecordType() THEN
  654. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  655. type := addressType;
  656. ELSE
  657. type := GetType(system, formalParameter.type);
  658. END;
  659. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  660. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  661. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  662. implementationVisitor.ReleaseIntermediateOperand(src);
  663. INC(registerNumber);
  664. formalParameter := formalParameter.prevParameter;
  665. END;
  666. END;
  667. END;
  668. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  669. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  670. END;
  671. pc := ir.pc-1;
  672. END;
  673. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  674. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  675. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  676. IF scope.lastVariable # NIL THEN
  677. stackSize := scope.lastVariable.offsetInBits;
  678. IF stackSize <0 THEN stackSize := -stackSize END;
  679. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  680. END;
  681. END;
  682. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  683. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  684. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  685. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  686. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  687. ir.EmitAt(pc,Push(size));
  688. implementationVisitor.StaticCallOperand(result,procedure);
  689. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  690. END;
  691. *)
  692. END;
  693. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  694. IF stackSize > 0 THEN
  695. IF (stackSize MOD system.addressSize = 0) THEN
  696. null := IntermediateCode.Immediate(addressType,0);
  697. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  698. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  699. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  700. ELSE
  701. null := IntermediateCode.Immediate(int8,0);
  702. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  703. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  704. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  705. END;
  706. (*! should potentially be called by backend -- enter might initialize
  707. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  708. *)
  709. END;
  710. IF procedureType.callingConvention = SyntaxTree.WinAPICallingConvention THEN
  711. parametersSize := ProcedureParametersSize(backend.system,x);
  712. ELSE
  713. parametersSize := 0;
  714. END;
  715. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  716. finalizer := FALSE;
  717. IF backend.cooperative & x.isFinalizer THEN
  718. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  719. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  720. GetRecordTypeName(recordType,name);
  721. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  722. END;
  723. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  724. IF backend.cooperative THEN
  725. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  726. IF implementationVisitor.profile & ~isModuleBody THEN
  727. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  728. END;
  729. END;
  730. implementationVisitor.EmitLeave(ir, x.position,x,cc);
  731. IF finalizer THEN
  732. IF backend.hasLinkRegister THEN
  733. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  734. END;
  735. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  736. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  737. ir.Emit(Br(x.position,dest));
  738. ELSE
  739. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  740. END;
  741. ELSE
  742. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  743. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  744. END;
  745. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  746. IF backend.cooperative THEN
  747. IF HasPointers (scope) THEN
  748. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  749. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  750. ir.Emit(Result(x.position, res));
  751. ir.Emit(Push(x.position, res));
  752. implementationVisitor.ResetVariables(scope);
  753. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  754. ir.Emit(Pop(x.position, res));
  755. ir.Emit(Return(x.position, res));
  756. ELSE
  757. implementationVisitor.ResetVariables(scope);
  758. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  759. END;
  760. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  761. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  762. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  763. ir.Emit(Result(x.position, res));
  764. ir.Emit(Push(x.position, res));
  765. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  766. ir.Emit(Pop(x.position, res));
  767. ir.Emit(Return(x.position, res));
  768. ELSE
  769. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  770. END;
  771. END;
  772. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  773. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  774. ELSE
  775. ir.Emit(Nop(x.position));
  776. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  777. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  778. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  779. END;
  780. END;
  781. END
  782. END;
  783. ELSE (* force body for procedures *)
  784. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  785. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  786. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  787. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  788. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  789. END;
  790. Scope(scope);
  791. Signature;
  792. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  793. currentScope := prevScope;
  794. END Procedure;
  795. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  796. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  797. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  798. BEGIN
  799. ASSERT (bodyProcedure # NIL);
  800. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  801. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  802. procedure.SetScope(bodyProcedure.scope);
  803. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  804. procedure.SetAccess(SyntaxTree.Hidden);
  805. Global.GetSymbolSegmentedName (procedure,name);
  806. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  807. ir.SetExported(TRUE);
  808. ir.SetPriority(InitPriority);
  809. Global.GetSymbolSegmentedName (bodyProcedure,name);
  810. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  811. implementationVisitor.currentScope := module.module.moduleScope;
  812. implementationVisitor.section := ir;
  813. implementationVisitor.PushSelfPointer();
  814. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  815. ELSIF backend.preregisterStatic THEN
  816. implementationVisitor.currentScope := module.module.moduleScope;
  817. implementationVisitor.section := ir;
  818. implementationVisitor.PushSelfPointer();
  819. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  820. ELSE
  821. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  822. ir.Emit(Call(bodyProcedure.position,op, 0));
  823. END;
  824. END AddBodyCallStub;
  825. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  826. VAR name: Basic.SegmentedName;
  827. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  828. BEGIN
  829. Global.GetSymbolSegmentedName (symbol,name);
  830. Basic.RemoveSuffix(name);
  831. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  832. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  833. ir.SetExported(TRUE);
  834. ir.SetPriority(FirstPriority);
  835. IntermediateCode.InitImmediate(op,addressType,initStack);
  836. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  837. END AddStackAllocation;
  838. (** entry function to visit a complete module *)
  839. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  840. VAR
  841. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  842. hasDynamicOperatorDeclarations: BOOLEAN;
  843. operator: SyntaxTree.Operator;
  844. import: SyntaxTree.Import;
  845. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  846. BEGIN
  847. type := type.resolved;
  848. IF type IS SyntaxTree.RecordType THEN
  849. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  850. ELSIF (type IS SyntaxTree.ArrayType) THEN
  851. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  852. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  853. END;
  854. ELSIF type IS SyntaxTree.MathArrayType THEN
  855. WITH type: SyntaxTree.MathArrayType DO
  856. IF type.form = SyntaxTree.Open THEN
  857. RETURN TRUE
  858. ELSIF type.form = SyntaxTree.Static THEN
  859. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  860. END;
  861. END;
  862. END;
  863. RETURN FALSE
  864. END TypeNeedsInitialization;
  865. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  866. VAR variable: SyntaxTree.Variable;
  867. BEGIN
  868. variable := scope.firstVariable;
  869. WHILE variable # NIL DO
  870. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  871. IF variable.initializer # NIL THEN RETURN TRUE END;
  872. variable := variable.nextVariable;
  873. END;
  874. RETURN FALSE
  875. END ScopeNeedsInitialization;
  876. BEGIN
  877. ASSERT(x # NIL); ASSERT(module # NIL);
  878. SELF.module := module;
  879. (* add import names to the generated Sections.Module *)
  880. import := x.moduleScope.firstImport;
  881. WHILE import # NIL DO
  882. import.module.GetName(idstr);
  883. module.imports.AddName(idstr);
  884. import := import.nextImport
  885. END;
  886. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  887. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  888. moduleSelf := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@moduleSelf"));
  889. moduleSelf.SetType(system.anyType);
  890. moduleSelf.SetScope(x.moduleScope);
  891. moduleSelf.SetUntraced(TRUE);
  892. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  893. ir.SetExported(TRUE);
  894. IntermediateCode.InitImmediate(op,addressType,0);
  895. ir.Emit(Data(Basic.invalidPosition,op));
  896. END;
  897. implementationVisitor.module := module;
  898. implementationVisitor.moduleScope := x.moduleScope;
  899. implementationVisitor.moduleSelf := moduleSelf;
  900. implementationVisitor.canBeLoaded := TRUE;
  901. meta.SetModule(module);
  902. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  903. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  904. END;
  905. IF backend.profile THEN
  906. EnsureBodyProcedure(x.moduleScope);
  907. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  908. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  909. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  910. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  911. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  912. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  913. Global.GetModuleName(module.module,idstr);
  914. implementationVisitor.ProfilerAddModule(idstr);
  915. implementationVisitor.numberProcedures := 0;
  916. END;
  917. implementationVisitor.profile := backend.profile;
  918. (* check if there is at least one dynamic operator locally defined *)
  919. hasDynamicOperatorDeclarations := FALSE;
  920. operator := x.moduleScope.firstOperator;
  921. WHILE operator # NIL DO
  922. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  923. operator := operator.nextOperator
  924. END;
  925. (* add operator initialization code section *)
  926. IF hasDynamicOperatorDeclarations THEN
  927. EnsureBodyProcedure(x.moduleScope);
  928. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  929. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  930. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  931. END;
  932. Scope(x.moduleScope);
  933. IF hasDynamicOperatorDeclarations THEN
  934. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  935. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  936. END;
  937. IF backend.profile THEN
  938. implementationVisitor.ProfilerPatchInit;
  939. END;
  940. END Module;
  941. END DeclarationVisitor;
  942. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  943. RegisterUsageCount*=OBJECT
  944. VAR used: UsedArray; count: LONGINT;
  945. PROCEDURE &Init;
  946. VAR i: LONGINT;
  947. BEGIN
  948. count := 0;
  949. IF used = NIL THEN NEW(used,64); END;
  950. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  951. END Init;
  952. PROCEDURE Grow;
  953. VAR new: UsedArray; size,i: LONGINT;
  954. BEGIN
  955. size := LEN(used)*2;
  956. NEW(new,size);
  957. FOR i := 0 TO LEN(used)-1 DO
  958. new[i].count := used[i].count;
  959. new[i].type := used[i].type;
  960. new[i].map := used[i].map
  961. END;
  962. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  963. used := new
  964. END Grow;
  965. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  966. BEGIN
  967. INC(count);
  968. IF count = LEN(used) THEN Grow END;
  969. used[count].type := type;
  970. used[count].class := class;
  971. used[count].map := count;
  972. RETURN count;
  973. END Next;
  974. PROCEDURE IncUse(register: LONGINT);
  975. BEGIN
  976. INC(used[register].count);
  977. (*
  978. IF (register = 1) & (count > 30) THEN
  979. D.TraceBack;
  980. END;
  981. *)
  982. END IncUse;
  983. PROCEDURE DecUse(register: LONGINT);
  984. BEGIN
  985. DEC(used[register].count);
  986. END DecUse;
  987. PROCEDURE Map(register: LONGINT): LONGINT;
  988. VAR map : LONGINT;
  989. BEGIN
  990. IF register > 0 THEN
  991. map := used[register].map;
  992. WHILE register # map DO register := map; map := used[register].map END;
  993. END;
  994. RETURN register
  995. END Map;
  996. PROCEDURE Use(register: LONGINT): LONGINT;
  997. BEGIN
  998. IF register< LEN(used) THEN
  999. RETURN used[register].count
  1000. ELSE
  1001. RETURN 0
  1002. END
  1003. END Use;
  1004. END RegisterUsageCount;
  1005. RegisterEntry = POINTER TO RECORD
  1006. prev,next: RegisterEntry;
  1007. register: LONGINT;
  1008. registerClass: IntermediateCode.RegisterClass;
  1009. type: IntermediateCode.Type;
  1010. END;
  1011. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1012. Variables = OBJECT (Basic.List)
  1013. VAR
  1014. inUse: VariableUse;
  1015. registerIndex: LONGINT;
  1016. nameIndex: LONGINT;
  1017. PROCEDURE & Init;
  1018. VAR i: LONGINT;
  1019. BEGIN
  1020. InitList(16);
  1021. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1022. registerIndex := 1024;
  1023. nameIndex := 0;
  1024. END Init;
  1025. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1026. VAR string: SyntaxTree.IdentifierString ;
  1027. BEGIN
  1028. COPY("@hiddenIRVar",string);
  1029. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1030. RETURN SyntaxTree.NewIdentifier(string);
  1031. END GetUID;
  1032. PROCEDURE GetUsage(VAR use: VariableUse);
  1033. BEGIN
  1034. use := inUse;
  1035. END GetUsage;
  1036. PROCEDURE SetUsage(CONST use: VariableUse);
  1037. BEGIN
  1038. inUse := use;
  1039. END SetUsage;
  1040. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1041. VAR any: ANY;
  1042. BEGIN
  1043. any := Get(i);;
  1044. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1045. END GetVariable;
  1046. PROCEDURE Occupy(pos: LONGINT);
  1047. BEGIN
  1048. INCL(inUse[pos DIV 32], pos MOD 32);
  1049. END Occupy;
  1050. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1051. BEGIN
  1052. Occupy(Length());
  1053. Add(v);
  1054. END AddVariable;
  1055. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1056. BEGIN
  1057. t1 := t1.resolved;
  1058. t2 := t2.resolved;
  1059. RETURN
  1060. (t1.SameType(t2))
  1061. OR
  1062. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1063. OR
  1064. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits = t2.sizeInBits)
  1065. OR
  1066. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1067. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1068. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1069. OR
  1070. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1071. (DynamicDim(t1) = DynamicDim(t2))
  1072. );
  1073. END CompatibleType;
  1074. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1075. VAR var : SyntaxTree.Variable;
  1076. BEGIN
  1077. FOR pos := 0 TO Length()-1 DO
  1078. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  1079. var := GetVariable(pos);
  1080. IF CompatibleType(type, var.type) & (var.untraced = untraced) THEN
  1081. Occupy(pos); RETURN var
  1082. END;
  1083. END;
  1084. END;
  1085. pos := Length();
  1086. RETURN NIL
  1087. END GetFreeVariable;
  1088. END Variables;
  1089. SymbolMap = POINTER TO RECORD
  1090. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1091. isAddress: BOOLEAN;
  1092. END;
  1093. SymbolMapper = OBJECT
  1094. VAR
  1095. first: SymbolMap;
  1096. PROCEDURE & Init;
  1097. BEGIN
  1098. first := NIL;
  1099. END Init;
  1100. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1101. VAR new: SymbolMap;
  1102. BEGIN
  1103. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1104. new.next := first; first := new;
  1105. END Add;
  1106. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1107. VAR s: SymbolMap;
  1108. BEGIN
  1109. s := first;
  1110. WHILE (s # NIL) & (s.this # this) DO
  1111. s := s.next
  1112. END;
  1113. RETURN s
  1114. END Get;
  1115. END SymbolMapper;
  1116. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1117. VAR
  1118. system: Global.System;
  1119. section: IntermediateCode.Section;
  1120. module: Sections.Module;
  1121. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1122. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1123. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1124. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1125. checker: SemanticChecker.Checker;
  1126. backend: IntermediateBackend;
  1127. meta: MetaDataGenerator;
  1128. position: Position;
  1129. moduleSelf: SyntaxTree.Variable;
  1130. (* variables for hand over of variables / temporary state *)
  1131. currentScope: SyntaxTree.Scope;
  1132. constantDeclaration : SyntaxTree.Symbol;
  1133. result: Operand; (* result of the most recent expression / statement *)
  1134. destination: IntermediateCode.Operand;
  1135. arrayDestinationTag: IntermediateCode.Operand;
  1136. arrayDestinationDimension:LONGINT;
  1137. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1138. conditional: BOOLEAN;
  1139. trueLabel, falseLabel, exitLabel: Label;
  1140. locked: BOOLEAN;
  1141. (*
  1142. usedRegisters: Registers;
  1143. *)
  1144. registerUsageCount: RegisterUsageCount;
  1145. usedRegisters: RegisterEntry;
  1146. (* useful operands and types *)
  1147. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1148. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1149. commentPrintout: Printout.Printer;
  1150. dump: Streams.Writer;
  1151. tagsAvailable : BOOLEAN;
  1152. supportedInstruction: SupportedInstructionProcedure;
  1153. supportedImmediate: SupportedImmediateProcedure;
  1154. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1155. emitLabels: BOOLEAN;
  1156. runtimeModuleName : SyntaxTree.IdentifierString;
  1157. newObjectFile: BOOLEAN;
  1158. indexCounter: LONGINT;
  1159. profile: BOOLEAN;
  1160. profileId, profileInit: IntermediateCode.Section;
  1161. profileInitPatchPosition: LONGINT;
  1162. numberProcedures: LONGINT;
  1163. procedureResultDesignator : SyntaxTree.Designator;
  1164. operatorInitializationCodeSection: IntermediateCode.Section;
  1165. fingerPrinter: FingerPrinter.FingerPrinter;
  1166. temporaries: Variables;
  1167. canBeLoaded : BOOLEAN;
  1168. currentIsInline: BOOLEAN;
  1169. currentMapper: SymbolMapper;
  1170. currentInlineExit: Label;
  1171. moduleBodySection: IntermediateCode.Section;
  1172. NeedDescriptor : BOOLEAN;
  1173. cooperativeSwitches: BOOLEAN;
  1174. lastSwitchPC: LONGINT;
  1175. isUnchecked: BOOLEAN;
  1176. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1177. newObjectFile: BOOLEAN);
  1178. BEGIN
  1179. SELF.system := system;
  1180. SELF.runtimeModuleName := runtime;
  1181. currentScope := NIL;
  1182. hiddenPointerType := NIL;
  1183. delegatePointerType := NIL;
  1184. awaitProcCounter := 0;
  1185. labelId := 0; constId := 0; labelId := 0;
  1186. SELF.checker := checker;
  1187. SELF.backend := backend;
  1188. position := Basic.invalidPosition;
  1189. conditional := FALSE;
  1190. locked := FALSE;
  1191. InitOperand(result,ModeUndefined);
  1192. addressType := IntermediateCode.GetType(system,system.addressType);
  1193. setType := IntermediateCode.GetType(system,system.setType);
  1194. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1195. byteType := IntermediateCode.GetType(system, system.byteType);
  1196. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1197. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1198. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1199. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1200. nil := IntermediateCode.Immediate(addressType,0);
  1201. one := IntermediateCode.Immediate(addressType,1);
  1202. IntermediateCode.InitOperand(destination);
  1203. tagsAvailable := TRUE;
  1204. supportedInstruction := supportedInstructionProcedure;
  1205. supportedImmediate := supportedImmediateProcedure;
  1206. inData := FALSE;
  1207. SELF.emitLabels := emitLabels;
  1208. IntermediateCode.InitOperand(arrayDestinationTag);
  1209. bool := IntermediateCode.GetType(system,system.booleanType);
  1210. IntermediateCode.InitImmediate(false,bool,0);
  1211. IntermediateCode.InitImmediate(true,bool,1);
  1212. SELF.newObjectFile := newObjectFile;
  1213. indexCounter := 0;
  1214. NEW(registerUsageCount);
  1215. usedRegisters := NIL;
  1216. procedureResultDesignator := NIL;
  1217. NEW(fingerPrinter);
  1218. NEW(temporaries);
  1219. currentIsInline := FALSE;
  1220. NeedDescriptor := FALSE;
  1221. isUnchecked := backend.noRuntimeChecks;
  1222. END Init;
  1223. TYPE Context = RECORD
  1224. section: IntermediateCode.Section;
  1225. registerUsageCount: RegisterUsageCount;
  1226. usedRegisters: RegisterEntry;
  1227. END;
  1228. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1229. VAR context: Context;
  1230. BEGIN
  1231. context.section := section;
  1232. context.registerUsageCount := registerUsageCount;
  1233. context.usedRegisters := usedRegisters;
  1234. section := new;
  1235. NEW(registerUsageCount);
  1236. usedRegisters := NIL;
  1237. RETURN context;
  1238. END SwitchContext;
  1239. PROCEDURE ReturnToContext(context: Context);
  1240. BEGIN
  1241. section := context.section;
  1242. registerUsageCount := context.registerUsageCount;
  1243. usedRegisters := context.usedRegisters;
  1244. END ReturnToContext;
  1245. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1246. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1247. BEGIN
  1248. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1249. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1250. END;
  1251. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1252. section.SetExported(IsExported(syntaxTreeSymbol));
  1253. RETURN section
  1254. END NewSection;
  1255. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1256. VAR new: LONGINT;
  1257. BEGIN
  1258. new := registerUsageCount.Next(type,class);
  1259. UseRegister(new);
  1260. RETURN new
  1261. END AcquireRegister;
  1262. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1263. VAR
  1264. fingerPrint: SyntaxTree.FingerPrint;
  1265. fingerPrintString: ARRAY 32 OF CHAR;
  1266. BEGIN
  1267. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1268. string := "[";
  1269. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1270. Strings.Append(string, fingerPrintString);
  1271. Strings.Append(string, "]");
  1272. END GetFingerprintString;
  1273. (** get the name for the code section that represens a certain symbol
  1274. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1275. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1276. VAR string: ARRAY 32 OF CHAR;
  1277. BEGIN
  1278. Global.GetSymbolSegmentedName(symbol, name);
  1279. (* if the symbol is an operator, then append the fingerprint to the name *)
  1280. IF symbol IS SyntaxTree.Operator THEN
  1281. GetFingerprintString(symbol, string);
  1282. Basic.AppendToSegmentedName(name,string);
  1283. END
  1284. END GetCodeSectionNameForSymbol;
  1285. (** get the name for the code section that represens a certain symbol
  1286. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1287. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1288. VAR string: ARRAY 32 OF CHAR;
  1289. BEGIN
  1290. Global.GetSymbolNameInScope(symbol, scope, name);
  1291. (* if the symbol is an operator, then append the fingerprint to the name *)
  1292. IF symbol IS SyntaxTree.Operator THEN
  1293. GetFingerprintString(symbol, string);
  1294. Strings.Append(name, string);
  1295. END
  1296. END GetCodeSectionNameForSymbolInScope;
  1297. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1298. BEGIN
  1299. IF dump # NIL THEN
  1300. dump.String("enter "); dump.String(s); dump.Ln;
  1301. END;
  1302. END TraceEnter;
  1303. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1304. BEGIN
  1305. IF dump # NIL THEN
  1306. dump.String("exit "); dump.String(s); dump.Ln;
  1307. END;
  1308. END TraceExit;
  1309. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1310. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1311. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1312. VAR i: LONGINT;
  1313. BEGIN
  1314. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1315. IF op.rule # NIL THEN
  1316. FOR i := 0 TO LEN(op.rule)-1 DO
  1317. CheckRegister(op.rule[i])
  1318. END;
  1319. END;
  1320. END CheckRegister;
  1321. BEGIN
  1322. CheckRegister(instruction.op1);
  1323. CheckRegister(instruction.op2);
  1324. CheckRegister(instruction.op3);
  1325. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1326. ELSE section.Emit(instruction);
  1327. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1328. END;
  1329. END Emit;
  1330. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1331. BEGIN
  1332. IF backend.cooperative THEN
  1333. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1334. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1335. ELSE
  1336. Emit(Trap(position,trapNo));
  1337. END;
  1338. END EmitTrap;
  1339. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1340. VAR name: Basic.SegmentedName;
  1341. VAR op1, op2, reg: IntermediateCode.Operand;
  1342. VAR call, nocall: Label;
  1343. VAR parametersSize: LONGINT;
  1344. VAR prevSection: IntermediateCode.Section;
  1345. VAR prevDump: Streams.Writer;
  1346. VAR body: SyntaxTree.Body;
  1347. VAR procedureType: SyntaxTree.ProcedureType;
  1348. BEGIN
  1349. IF procedure # NIL THEN
  1350. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1351. ELSE procedureType := NIL;
  1352. END;
  1353. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1354. prevSection := SELF.section;
  1355. SELF.section := section;
  1356. prevDump := dump;
  1357. dump := section.comments;
  1358. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1359. IF backend.hasLinkRegister THEN
  1360. Emit(Push(Basic.invalidPosition, lr));
  1361. END;
  1362. Emit(Push(Basic.invalidPosition,fp));
  1363. IF procedure # NIL THEN
  1364. body := procedure.procedureScope.body;
  1365. ELSE
  1366. body := NIL;
  1367. END;
  1368. IF backend.cooperative THEN
  1369. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1370. GetCodeSectionNameForSymbol(procedure, name);
  1371. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1372. ELSE
  1373. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1374. END;
  1375. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1376. IntermediateCode.AddOffset(op1, 1);
  1377. Emit(Push(Basic.invalidPosition,op1));
  1378. Emit(Mov(Basic.invalidPosition,fp, sp));
  1379. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1380. NEW(call, section);
  1381. NEW(nocall, section);
  1382. reg := NewRegisterOperand(addressType);
  1383. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1384. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1385. BrltL(call, sp, reg);
  1386. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1387. BrgeL(nocall, sp, op2);
  1388. call.Resolve(section.pc);
  1389. Emit(Push(Basic.invalidPosition, reg));
  1390. ReleaseIntermediateOperand(reg);
  1391. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1392. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1393. Emit(Push(Basic.invalidPosition, op2));
  1394. CallThis(position, "Activities","ExpandStack",2);
  1395. Emit(Result(Basic.invalidPosition, sp));
  1396. nocall.Resolve(section.pc);
  1397. END;
  1398. ELSE
  1399. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1400. Emit(Push(Basic.invalidPosition, one)) ;
  1401. procedureType.SetParametersOffset(1);
  1402. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1403. END;
  1404. Emit(Mov(Basic.invalidPosition, fp, sp));
  1405. END;
  1406. END;
  1407. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1408. SELF.section := prevSection;
  1409. dump := prevDump;
  1410. END EmitEnter;
  1411. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1412. VAR op1,op2: IntermediateCode.Operand;
  1413. VAR instruction: IntermediateCode.Instruction;
  1414. BEGIN
  1415. IntermediateCode.InitNumber(op1,callconv);
  1416. IntermediateCode.InitNumber(op2,varSize);
  1417. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1418. RETURN instruction
  1419. END Enter;
  1420. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1421. VAR op1: IntermediateCode.Operand;
  1422. VAR instruction: IntermediateCode.Instruction;
  1423. BEGIN
  1424. IntermediateCode.InitNumber(op1,callconv);
  1425. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1426. RETURN instruction
  1427. END Leave;
  1428. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1429. VAR prevSection: IntermediateCode.Section;
  1430. VAR op2, size: IntermediateCode.Operand;
  1431. VAR body: SyntaxTree.Body;
  1432. BEGIN
  1433. prevSection := SELF.section;
  1434. SELF.section := section;
  1435. Emit(Leave(position, callconv));
  1436. IF procedure # NIL THEN
  1437. body := procedure.procedureScope.body;
  1438. ELSE
  1439. body := NIL;
  1440. END;
  1441. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1442. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1443. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1444. Emit(Add(position, sp, fp, op2));
  1445. ELSE
  1446. Emit(Mov(position, sp, fp));
  1447. END;
  1448. Emit(Pop(position, fp));
  1449. END;
  1450. SELF.section := prevSection;
  1451. END EmitLeave;
  1452. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1453. VAR m: SymbolMap;
  1454. BEGIN
  1455. position := x.position;
  1456. IF currentIsInline THEN
  1457. m := currentMapper.Get(x);
  1458. IF m # NIL THEN
  1459. (*
  1460. Printout.Info("mapping from", x);
  1461. Printout.Info("mapping to ", m.to);
  1462. *)
  1463. m.to.Accept(SELF);
  1464. op := result;
  1465. IF m.tag # NIL THEN
  1466. ReleaseIntermediateOperand(result.tag);
  1467. m.tag.Accept(SELF);
  1468. op.tag := result.op;
  1469. ReleaseIntermediateOperand(result.tag);
  1470. END;
  1471. RETURN
  1472. END;
  1473. END;
  1474. x.Accept(SELF);
  1475. op := result;
  1476. END Symbol;
  1477. PROCEDURE Expression(x: SyntaxTree.Expression);
  1478. BEGIN
  1479. position := x.position;
  1480. constantDeclaration := NIL;
  1481. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1482. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1483. END;
  1484. IF x.resolved # NIL THEN
  1485. x.resolved.Accept(SELF)
  1486. ELSE
  1487. x.Accept(SELF)
  1488. END;
  1489. (* check this, was commented out in ActiveCells3 *)
  1490. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1491. Error(x.position, "unsupported modifier");
  1492. END;
  1493. END Expression;
  1494. (*
  1495. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1496. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1497. BEGIN
  1498. temporaries.GetUsage(current);
  1499. FOR i := 0 TO LEN(current)-1 DO
  1500. set := current[i] - previous[i];
  1501. IF set # {} THEN
  1502. FOR j := 0 TO MAX(SET)-1 DO
  1503. IF j IN set THEN
  1504. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1505. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1506. Symbol(variable, op);
  1507. MakeMemory(tmp,op.op,addressType,0);
  1508. ReleaseOperand(op);
  1509. Emit(Mov(position,tmp, nil ) );
  1510. ReleaseIntermediateOperand(tmp);
  1511. END;
  1512. END;
  1513. END;
  1514. END;
  1515. END;
  1516. END ResetUsedTemporaries;
  1517. *)
  1518. PROCEDURE Statement(x: SyntaxTree.Statement);
  1519. VAR use: VariableUse;
  1520. BEGIN
  1521. temporaries.GetUsage(use);
  1522. position := x.position;
  1523. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1524. IF commentPrintout # NIL THEN
  1525. commentPrintout.Statement(x);
  1526. dump.Ln;
  1527. (*dump.Update;*)
  1528. END;
  1529. x.Accept(SELF);
  1530. (*
  1531. CheckRegistersFree();
  1532. *)
  1533. (*ResetUsedTemporaries(use);*)
  1534. temporaries.SetUsage(use);
  1535. END Statement;
  1536. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1537. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1538. *)
  1539. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1540. BEGIN
  1541. ASSERT(op.mode # IntermediateCode.Undefined);
  1542. IF op.mode = IntermediateCode.ModeMemory THEN
  1543. ReuseCopy(res,op);
  1544. ELSE
  1545. res := op;
  1546. UseIntermediateOperand(res);
  1547. END;
  1548. IntermediateCode.AddOffset(res,offset);
  1549. IntermediateCode.MakeMemory(res,type);
  1550. END MakeMemory;
  1551. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1552. VAR mem: IntermediateCode.Operand;
  1553. BEGIN
  1554. MakeMemory(mem,res,type,offset);
  1555. ReleaseIntermediateOperand(res);
  1556. res := mem;
  1557. END ToMemory;
  1558. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1559. VAR mem: IntermediateCode.Operand;
  1560. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1561. componentType: SyntaxTree.Type;
  1562. BEGIN
  1563. type := type.resolved;
  1564. IF operand.mode = ModeReference THEN
  1565. IF type IS SyntaxTree.RangeType THEN
  1566. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1567. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1568. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1569. ReleaseOperand(operand);
  1570. operand.op := firstOp;
  1571. operand.tag := lastOp;
  1572. operand.extra := stepOp;
  1573. ELSIF type IS SyntaxTree.ComplexType THEN
  1574. componentType := type(SyntaxTree.ComplexType).componentType;
  1575. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1576. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1577. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1578. ReleaseOperand(operand);
  1579. operand.op := firstOp;
  1580. operand.tag := lastOp
  1581. ELSE
  1582. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1583. ReleaseIntermediateOperand(operand.op);
  1584. operand.op := mem;
  1585. END;
  1586. operand.mode := ModeValue;
  1587. END;
  1588. ASSERT(operand.mode = ModeValue);
  1589. END LoadValue;
  1590. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1591. VAR prevConditional: BOOLEAN;
  1592. BEGIN
  1593. prevConditional := conditional;
  1594. conditional := FALSE;
  1595. InitOperand(result, ModeUndefined);
  1596. Expression(x);
  1597. op := result;
  1598. LoadValue(op,x.type.resolved);
  1599. conditional := prevConditional;
  1600. END Evaluate;
  1601. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1602. VAR prevConditional: BOOLEAN;
  1603. BEGIN
  1604. prevConditional := conditional;
  1605. conditional := FALSE;
  1606. InitOperand(result,ModeUndefined);
  1607. Expression(x);
  1608. op := result;
  1609. (*
  1610. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1611. *)
  1612. conditional := prevConditional;
  1613. END Designate;
  1614. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1615. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1616. BEGIN
  1617. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1618. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1619. conditional := TRUE;
  1620. trueLabel := trueL; falseLabel := falseL;
  1621. Expression(x);
  1622. trueL := trueLabel; falseL := falseLabel;
  1623. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1624. END Condition;
  1625. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1626. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1627. BEGIN
  1628. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1629. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1630. RETURN op
  1631. END NewRegisterOperand;
  1632. PROCEDURE UnuseRegister(register: LONGINT);
  1633. BEGIN
  1634. IF (register > 0) THEN
  1635. register := registerUsageCount.Map(register);
  1636. registerUsageCount.DecUse(register);
  1637. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1638. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1639. END;
  1640. IF registerUsageCount.Use(register)=0 THEN
  1641. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1642. Warning(position, "register cannot be removed");
  1643. END;
  1644. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1645. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1646. END;
  1647. ELSIF registerUsageCount.Use(register)<0 THEN
  1648. Warning(position, "register removed too often");
  1649. IF dump # NIL THEN
  1650. dump.String("register removed too often"); dump.Ln; dump.Update;
  1651. END;
  1652. END;
  1653. END;
  1654. END UnuseRegister;
  1655. PROCEDURE UseRegister(register: LONGINT);
  1656. BEGIN
  1657. IF (register > 0) THEN
  1658. register := registerUsageCount.Map(register);
  1659. registerUsageCount.IncUse(register);
  1660. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1661. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1662. END;
  1663. IF registerUsageCount.Use(register)=1 THEN
  1664. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1665. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1666. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1667. END;
  1668. END;
  1669. END;
  1670. END UseRegister;
  1671. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1672. BEGIN
  1673. UnuseRegister(op.register)
  1674. END ReleaseIntermediateOperand;
  1675. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1676. BEGIN
  1677. UseRegister(op.register)
  1678. END UseIntermediateOperand;
  1679. PROCEDURE ReleaseOperand(CONST op: Operand);
  1680. BEGIN
  1681. UnuseRegister(op.op.register);
  1682. UnuseRegister(op.tag.register);
  1683. UnuseRegister(op.extra.register);
  1684. END ReleaseOperand;
  1685. (* save registers marked in array "markedRegisters" to the stack
  1686. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1687. *)
  1688. PROCEDURE SaveRegisters();
  1689. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1690. BEGIN
  1691. entry := usedRegisters;
  1692. WHILE entry # NIL DO
  1693. type := registerUsageCount.used[entry.register].type;
  1694. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1695. Emit(Push(position,op));
  1696. entry := entry.next;
  1697. END;
  1698. END SaveRegisters;
  1699. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1700. BEGIN
  1701. saved := usedRegisters;
  1702. usedRegisters := NIL;
  1703. END ReleaseUsedRegisters;
  1704. (** remove parameter registers from used queue *)
  1705. PROCEDURE ReleaseParameterRegisters;
  1706. VAR entry,prev,next: RegisterEntry;
  1707. BEGIN
  1708. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1709. WHILE entry # NIL DO
  1710. next := entry.next;
  1711. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1712. registerUsageCount.DecUse(entry.register);
  1713. ASSERT(registerUsageCount.Use(entry.register)=0);
  1714. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1715. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1716. END;
  1717. ELSIF prev = NIL THEN
  1718. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1719. ELSE
  1720. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1721. END;
  1722. entry := next;
  1723. END;
  1724. END ReleaseParameterRegisters;
  1725. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1726. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1727. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1728. BEGIN
  1729. entry := saved;
  1730. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1731. entry := prev;
  1732. WHILE entry # NIL DO
  1733. prev := entry.prev;
  1734. type := entry.type;
  1735. class := entry.registerClass;
  1736. IntermediateCode.InitRegister(op,type,class,entry.register);
  1737. (*
  1738. new := registerUsageCount.Next(type,class);
  1739. registerUsageCount.Remap(entry.register,new);
  1740. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1741. dump.String("remap register "); dump.Int(entry.register,1);
  1742. dump.String("to "); dump.Int(new,1);
  1743. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1744. END;
  1745. entry.register := new;
  1746. *)
  1747. Emit(Pop(position,op));
  1748. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1749. entry := prev;
  1750. END;
  1751. (*
  1752. usedRegisters := saved;
  1753. *)
  1754. END RestoreRegisters;
  1755. PROCEDURE CheckRegistersFree;
  1756. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1757. BEGIN
  1758. IF usedRegisters # NIL THEN
  1759. r := usedRegisters;
  1760. WHILE r # NIL DO
  1761. warning := "register ";
  1762. Strings.AppendInt(warning, r.register);
  1763. Strings.Append(warning, " not released.");
  1764. Warning(position,warning);
  1765. r := r .next;
  1766. END;
  1767. END;
  1768. FOR i := 0 TO registerUsageCount.count-1 DO
  1769. IF registerUsageCount.used[i].count < 0 THEN
  1770. warning := "register ";
  1771. Strings.AppendInt(warning, i);
  1772. Strings.Append(warning, " unused too often.");
  1773. Warning(position,warning);
  1774. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1775. warning := "register ";
  1776. Strings.AppendInt(warning, i);
  1777. Strings.Append(warning, " not unused often enough.");
  1778. Warning(position,warning);
  1779. END;
  1780. END;
  1781. END CheckRegistersFree;
  1782. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1783. Otherwise allocate a new register.
  1784. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1785. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1786. BEGIN
  1787. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1788. UseIntermediateOperand(result);
  1789. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1790. UseIntermediateOperand(result);
  1791. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1792. END;
  1793. END Reuse2;
  1794. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1795. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1796. If not then allocate a new register.
  1797. Does NOT necessarily keep the content of src1 or src2 in result!
  1798. *)
  1799. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1800. BEGIN
  1801. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1802. UseIntermediateOperand(result);
  1803. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1804. UseIntermediateOperand(result);
  1805. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1806. result := alternative; alternative := emptyOperand;
  1807. UseIntermediateOperand(result);
  1808. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1809. END;
  1810. END Reuse2a;
  1811. (* like reuse2 but only one source *)
  1812. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1813. BEGIN
  1814. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1815. UseIntermediateOperand(result);
  1816. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1817. END;
  1818. END Reuse1;
  1819. (* like reuse2a but only one source *)
  1820. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1821. BEGIN
  1822. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1823. UseIntermediateOperand(result);
  1824. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1825. UseIntermediateOperand(result);
  1826. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1827. END;
  1828. END Reuse1a;
  1829. (* like reuse1 but guarantees that content of src1 is in result *)
  1830. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1831. BEGIN
  1832. IF ReusableRegister(src1) THEN
  1833. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1834. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1835. UseIntermediateOperand(result);
  1836. ELSE
  1837. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1838. Emit(Mov(position,result,src1));
  1839. END
  1840. END ReuseCopy;
  1841. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1842. BEGIN
  1843. IF ReusableRegister(src) THEN
  1844. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1845. ELSE
  1846. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1847. Emit(Mov(position,result,src));
  1848. ReleaseIntermediateOperand(src);
  1849. END
  1850. END TransferToRegister;
  1851. (** labels and branches **)
  1852. PROCEDURE NewLabel(): Label;
  1853. VAR label: Label;
  1854. BEGIN
  1855. NEW(label,section); RETURN label;
  1856. END NewLabel;
  1857. PROCEDURE SetLabel(label: Label);
  1858. BEGIN label.Resolve(section.pc);
  1859. END SetLabel;
  1860. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1861. BEGIN
  1862. ASSERT(label # NIL);
  1863. IF label.pc < 0 THEN (* label not yet set *)
  1864. label.AddFixup(section.pc);
  1865. END;
  1866. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1867. END LabelOperand;
  1868. PROCEDURE BrL(label: Label);
  1869. BEGIN
  1870. Emit(Br(position,LabelOperand(label)));
  1871. END BrL;
  1872. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1873. BEGIN
  1874. Emit(Brge(position,LabelOperand(label),left,right));
  1875. END BrgeL;
  1876. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1877. BEGIN
  1878. Emit(Brlt(position,LabelOperand(label),left,right));
  1879. END BrltL;
  1880. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1881. BEGIN
  1882. Emit(Breq(position,LabelOperand(label),left,right));
  1883. END BreqL;
  1884. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1885. BEGIN
  1886. Emit(Brne(position,LabelOperand(label),left,right));
  1887. END BrneL;
  1888. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1889. VAR new: IntermediateCode.Operand;
  1890. BEGIN
  1891. IF Trace THEN TraceEnter("Convert") END;
  1892. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1893. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1894. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1895. & (operand.offset = 0)
  1896. THEN
  1897. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1898. Emit(Conv(position,new,operand));
  1899. ELSE
  1900. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1901. Emit(Conv(position,new,operand));
  1902. ReleaseIntermediateOperand(operand);
  1903. END;
  1904. operand := new;
  1905. ELSIF (operand.mode = IntermediateCode.ModeImmediate) & (operand.symbol.name = "") & (operand.type.sizeInBits <= type.sizeInBits) & (operand.type.form IN IntermediateCode.Integer) & (type.form IN IntermediateCode.Integer) THEN
  1906. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1907. ELSE
  1908. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1909. Emit(Conv(position,new,operand));
  1910. ReleaseIntermediateOperand(operand);
  1911. operand := new;
  1912. END;
  1913. IF Trace THEN TraceExit("Convert") END;
  1914. END Convert;
  1915. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1916. VAR exit: Label;
  1917. BEGIN
  1918. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1919. exit := NewLabel();
  1920. br(exit,left,right);
  1921. EmitTrap(position,trapNo);
  1922. SetLabel(exit);
  1923. END TrapC;
  1924. (** expressions *)
  1925. (** emit necessary runtime check for set elements **)
  1926. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1927. VAR max: IntermediateCode.Operand;
  1928. BEGIN
  1929. IF isUnchecked THEN RETURN END;
  1930. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1931. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1932. TrapC(BrgeL, max, o, SetElementTrap);
  1933. END;
  1934. END CheckSetElement;
  1935. (** the set that a range represents **)
  1936. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1937. VAR
  1938. operand: Operand;
  1939. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1940. BEGIN
  1941. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1942. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1943. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1944. one := IntermediateCode.Immediate(setType, 1);
  1945. Evaluate(x, operand);
  1946. Convert(operand.op, setType);
  1947. Convert(operand.tag, setType);
  1948. CheckSetElement(operand.op);
  1949. CheckSetElement(operand.tag);
  1950. (* create mask for lower bound
  1951. i.e. shift 11111111 to the left by the value of the lower bound
  1952. *)
  1953. Reuse1(temp, operand.op);
  1954. Emit(Shl(position,temp, allBits, operand.op));
  1955. ReleaseIntermediateOperand(operand.op);
  1956. operand.op := temp;
  1957. (* create mask for upper bound
  1958. i.e. shift 11111111 to the right by the difference between the
  1959. upper bound and the maximum number of set elements
  1960. *)
  1961. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1962. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1963. Reuse1(temp, operand.tag);
  1964. ELSE
  1965. Reuse1(temp, operand.tag);
  1966. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1967. Emit(Sub(position,temp, size, operand.tag));
  1968. END;
  1969. Emit(Shr(position,temp, allBits, operand.tag));
  1970. ReleaseIntermediateOperand(operand.tag);
  1971. operand.tag := temp;
  1972. Reuse2(resultingSet, operand.op, operand.tag);
  1973. (* intersect the two masks *)
  1974. Emit(And(position,resultingSet, operand.op, operand.tag));
  1975. ReleaseOperand(operand);
  1976. RETURN resultingSet
  1977. END SetFromRange;
  1978. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1979. VAR
  1980. res, operand: Operand;
  1981. temp, one, noBits, dest: IntermediateCode.Operand;
  1982. expression: SyntaxTree.Expression;
  1983. i: LONGINT;
  1984. BEGIN
  1985. IF Trace THEN TraceEnter("VisitSet") END;
  1986. dest := destination;
  1987. destination := emptyOperand;
  1988. noBits := IntermediateCode.Immediate(setType, 0);
  1989. one := IntermediateCode.Immediate(setType, 1);
  1990. (* start off with the empty set *)
  1991. InitOperand(res, ModeValue);
  1992. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1993. Emit(Mov(position,res.op, noBits));
  1994. FOR i := 0 TO x.elements.Length() - 1 DO
  1995. expression := x.elements.GetExpression(i);
  1996. IF expression IS SyntaxTree.RangeExpression THEN
  1997. (* range of set elements *)
  1998. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1999. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2000. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2001. ReleaseIntermediateOperand(temp)
  2002. ELSE
  2003. (* singelton element *)
  2004. Evaluate(expression, operand);
  2005. Convert(operand.op, setType);
  2006. CheckSetElement(operand.op);
  2007. (* create subset containing single element *)
  2008. Reuse1(temp, operand.op);
  2009. Emit(Shl(position,temp, one, operand.op));
  2010. ReleaseOperand(operand);
  2011. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2012. ReleaseIntermediateOperand(temp);
  2013. END
  2014. END;
  2015. result := res;
  2016. destination := dest;
  2017. IF Trace THEN TraceExit("VisitSet") END;
  2018. END VisitSet;
  2019. (* math arrays of the form [a,b,c]
  2020. x is a static array and thus does not provide any pointers
  2021. *)
  2022. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  2023. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2024. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2025. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2026. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2027. element: SyntaxTree.IntegerValue;
  2028. BEGIN
  2029. numberElements := x.elements.Length();
  2030. expression := index.parameters.GetExpression(dim);
  2031. element := expression(SyntaxTree.IntegerValue);
  2032. FOR i := 0 TO numberElements-1 DO
  2033. expression := x.elements.GetExpression(i);
  2034. element.SetValue(i);
  2035. IF expression IS SyntaxTree.MathArrayExpression THEN
  2036. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2037. ELSE
  2038. Assign(index,expression);
  2039. END;
  2040. END;
  2041. END RecursiveAssignment;
  2042. BEGIN
  2043. (*static math array not providing pointers anyway *)
  2044. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2045. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2046. designator.SetType(variable.type);
  2047. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  2048. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2049. FOR i := 0 TO dim-1 DO
  2050. element := SyntaxTree.NewIntegerValue(x.position,0);
  2051. element.SetType(system.longintType);
  2052. index.parameters.AddExpression(element);
  2053. END;
  2054. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2055. RecursiveAssignment(x,0);
  2056. Expression(designator);
  2057. END VisitMathArrayExpression;
  2058. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  2059. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2060. BEGIN
  2061. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2062. dest := destination; destination := emptyOperand;
  2063. IF x.operator = Scanner.Not THEN
  2064. IF conditional THEN
  2065. Condition(x.left,falseLabel,trueLabel)
  2066. ELSE
  2067. Evaluate(x.left,operand);
  2068. InitOperand(result,ModeValue);
  2069. Reuse1a(result.op,operand.op,dest);
  2070. Emit(Xor(position,result.op,operand.op,true));
  2071. ReleaseOperand(operand);
  2072. END;
  2073. ELSIF x.operator = Scanner.Minus THEN
  2074. Evaluate(x.left,operand);
  2075. InitOperand(result,ModeValue);
  2076. Reuse1a(result.op,operand.op,dest);
  2077. type := x.left.type.resolved;
  2078. IF type IS SyntaxTree.SetType THEN
  2079. Emit(Not(position,result.op,operand.op));
  2080. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2081. Reuse1(result.tag,operand.tag);
  2082. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2083. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2084. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2085. Emit(Neg(position,result.op,operand.op));
  2086. ELSE HALT(200)
  2087. END;
  2088. ReleaseOperand(operand);
  2089. ELSIF x.operator = Scanner.Address THEN
  2090. Designate(x.left,operand);
  2091. operand.mode := ModeValue;
  2092. t0 := x.left.type.resolved;
  2093. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2094. ReleaseIntermediateOperand(operand.op);
  2095. operand.op := operand.tag;
  2096. IntermediateCode.InitOperand(operand.tag);
  2097. END;
  2098. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2099. result := operand;
  2100. ELSE HALT(100)
  2101. END;
  2102. destination := dest;
  2103. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2104. END VisitUnaryExpression;
  2105. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2106. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2107. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2108. BEGIN
  2109. type := type.resolved;
  2110. originalType := type;
  2111. IF type IS SyntaxTree.PointerType THEN
  2112. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2113. END;
  2114. IF type IS SyntaxTree.ObjectType THEN
  2115. BrL(trueL);
  2116. ELSE
  2117. ASSERT(type IS SyntaxTree.RecordType);
  2118. (*
  2119. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2120. *)
  2121. ReuseCopy(left,tag);
  2122. right := TypeDescriptorAdr(type);
  2123. IF ~newObjectFile THEN
  2124. IntermediateCode.MakeMemory(right,addressType);
  2125. END;
  2126. IF backend.cooperative THEN
  2127. repeatL := NewLabel();
  2128. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2129. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2130. END;
  2131. SetLabel(repeatL);
  2132. BreqL(trueL,left,right);
  2133. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2134. BrneL(repeatL,left,nil);
  2135. ELSIF meta.simple THEN
  2136. level := type(SyntaxTree.RecordType).Level();
  2137. (* get type desc tag of level relative to base tag *)
  2138. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2139. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2140. IntermediateCode.MakeMemory(left,addressType);
  2141. BreqL(trueL,left,right);
  2142. ELSE
  2143. level := type(SyntaxTree.RecordType).Level();
  2144. (* get type desc tag of level relative to base tag *)
  2145. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2146. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2147. IntermediateCode.MakeMemory(left,addressType);
  2148. BreqL(trueL,left,right);
  2149. END;
  2150. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2151. BrL(falseL);
  2152. END;
  2153. END TypeTest;
  2154. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2155. BEGIN
  2156. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2157. IF dump # NIL THEN
  2158. dump.String(s); dump.Ln;
  2159. END;
  2160. END Error;
  2161. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2162. BEGIN
  2163. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2164. IF dump # NIL THEN
  2165. dump.String(s); dump.Ln; dump.Update;
  2166. END;
  2167. END Warning;
  2168. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2169. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2170. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2171. operand:Operand;
  2172. BEGIN
  2173. previousSection := section;
  2174. Global.GetModuleName(mod,name);
  2175. Strings.Append(name,".@Trace");
  2176. Basic.ToSegmentedName(name, pooledName);
  2177. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2178. IF dump # NIL THEN dump := section.comments END;
  2179. IF backend.hasLinkRegister THEN
  2180. Emit(Push(Basic.invalidPosition, lr));
  2181. END;
  2182. variable := mod.moduleScope.firstVariable;
  2183. WHILE variable # NIL DO
  2184. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2185. Symbol(variable, operand);
  2186. register := operand.op;
  2187. CallTraceMethod(register, variable.type);
  2188. ReleaseIntermediateOperand(register);
  2189. END;
  2190. variable := variable.nextVariable;
  2191. END;
  2192. IF backend.hasLinkRegister THEN
  2193. Emit(Pop(Basic.invalidPosition, lr));
  2194. END;
  2195. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2196. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2197. Emit(Br(position,op));
  2198. INC(statCoopTraceModule, section.pc);
  2199. section := previousSection;
  2200. IF dump # NIL THEN dump := section.comments END;
  2201. END CreateTraceModuleMethod;
  2202. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2203. BEGIN
  2204. Emit (Push(position, dst));
  2205. Emit (Push(position, src));
  2206. CallThis(position,"GarbageCollector","Assign", 2);
  2207. END CallAssignPointer;
  2208. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2209. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2210. BEGIN
  2211. IF SemanticChecker.IsPointerType (type) THEN
  2212. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2213. ELSIF type.IsRecordType() THEN
  2214. Emit (Push(position,dst));
  2215. Emit (Push(position,src));
  2216. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2217. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2218. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2219. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2220. ELSIF IsStaticArray(type) THEN
  2221. size := StaticArrayNumElements(type);
  2222. base := StaticArrayBaseType(type);
  2223. IF base.IsRecordType() THEN
  2224. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2225. Emit (Push(position, dst));
  2226. Emit (Push(position, src));
  2227. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2228. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2229. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2230. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2231. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2232. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2233. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2234. Emit (Push(position, dst));
  2235. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2236. Emit (Push(position, src));
  2237. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2238. ELSE
  2239. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2240. Emit (Push(position, dst));
  2241. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2242. Emit (Push(position, src));
  2243. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2244. ASSERT(StaticArrayBaseType(type).IsPointer());
  2245. END;
  2246. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2247. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2248. Emit (Push(position, dst));
  2249. Emit (Push(position, src));
  2250. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2251. ELSE HALT(100); (* missing ? *)
  2252. END;
  2253. END CallAssignMethod;
  2254. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2255. VAR name: Basic.SegmentedName;
  2256. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2257. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2258. context: Context;
  2259. BEGIN
  2260. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2261. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2262. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2263. GetRecordTypeName (recordType,name);
  2264. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2265. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2266. IF dump # NIL THEN dump := section.comments END;
  2267. IF backend.hasLinkRegister THEN
  2268. Emit(Push(Basic.invalidPosition, lr));
  2269. END;
  2270. variable := recordType.recordScope.firstVariable;
  2271. WHILE variable # NIL DO
  2272. IF variable.NeedsTrace() THEN
  2273. dst := NewRegisterOperand (addressType);
  2274. src := NewRegisterOperand (addressType);
  2275. Emit (Mov(position, dst, parameter1));
  2276. Emit (Mov(position, src, parameter2));
  2277. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2278. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2279. CallAssignMethod(dst, src, variable.type);
  2280. ReleaseIntermediateOperand(src);
  2281. ReleaseIntermediateOperand(dst);
  2282. END;
  2283. variable := variable.nextVariable;
  2284. END;
  2285. recordBase := recordType.GetBaseRecord();
  2286. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2287. IF backend.hasLinkRegister THEN
  2288. Emit(Pop(Basic.invalidPosition, lr));
  2289. END;
  2290. GetRecordTypeName (recordBase,name);
  2291. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2292. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2293. Emit(Br(position,op));
  2294. ELSE
  2295. Emit(Exit(position,0,0, 0));
  2296. END;
  2297. IF ~recordType.isObject THEN
  2298. GetRecordTypeName (recordType,name);
  2299. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2300. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2301. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2302. NEW(registerUsageCount);
  2303. usedRegisters := NIL;
  2304. dst := NewRegisterOperand (addressType);
  2305. src := NewRegisterOperand (addressType);
  2306. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2307. Emit(Mov(position, dst, parameter1));
  2308. Emit(Mov(position, src, parameter2));
  2309. label := NewLabel();
  2310. SetLabel(label);
  2311. Emit(Push(position, dst));
  2312. Emit(Push(position, src));
  2313. GetRecordTypeName (recordType,name);
  2314. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2315. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2316. Emit(Call(position, op, 0));
  2317. Emit(Pop(position, src));
  2318. Emit(Pop(position, dst));
  2319. Emit(Add(position, dst, dst, ofs));
  2320. Emit(Add(position, src, src, ofs));
  2321. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2322. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2323. Emit(Exit(position,0,0, 0));
  2324. END;
  2325. INC(statCoopAssignProcedure, section.pc);
  2326. ReturnToContext(context);
  2327. IF dump # NIL THEN dump := section.comments END;
  2328. END CreateAssignProcedure;
  2329. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2330. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2331. BEGIN
  2332. IF IsUnsafePointer (type) THEN
  2333. skip := NewLabel();
  2334. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2335. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2336. BreqL (skip, op, nil);
  2337. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2338. SetLabel (skip);
  2339. ELSIF SemanticChecker.IsPointerType (type) THEN
  2340. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2341. CallThis(position,"GarbageCollector","Mark", 1);
  2342. ELSIF type.IsRecordType() THEN
  2343. Emit (Push(position,register));
  2344. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2345. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2346. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2347. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2348. ELSIF IsStaticArray(type) THEN
  2349. size := StaticArrayNumElements(type);
  2350. base := StaticArrayBaseType(type);
  2351. IF base.IsRecordType() THEN
  2352. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2353. Emit (Push(position, register));
  2354. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2355. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2356. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2357. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2358. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2359. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2360. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2361. Emit (Push(position, register));
  2362. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2363. ELSE
  2364. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2365. Emit (Push(position, register));
  2366. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2367. ASSERT(base.IsPointer());
  2368. END;
  2369. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2370. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2371. CallThis(position,"GarbageCollector","Mark", 1);
  2372. ELSE HALT(100); (* missing ? *)
  2373. END;
  2374. END CallTraceMethod;
  2375. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2376. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2377. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2378. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2379. BEGIN
  2380. previousSection := section;
  2381. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2382. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2383. GetRecordTypeName (recordType,name);
  2384. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2385. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2386. IF dump # NIL THEN dump := section.comments END;
  2387. IF backend.hasLinkRegister THEN
  2388. Emit(Push(Basic.invalidPosition, lr));
  2389. END;
  2390. variable := recordType.recordScope.firstVariable;
  2391. WHILE variable # NIL DO
  2392. IF variable.NeedsTrace() THEN
  2393. register := NewRegisterOperand (addressType);
  2394. Emit (Mov(position,register,parameter1));
  2395. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2396. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2397. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2398. END;
  2399. CallTraceMethod(register, variable.type);
  2400. ReleaseIntermediateOperand(register);
  2401. END;
  2402. variable := variable.nextVariable;
  2403. END;
  2404. recordBase := recordType.GetBaseRecord();
  2405. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2406. recordBase := recordBase.GetBaseRecord();
  2407. END;
  2408. IF recordBase # NIL THEN
  2409. IF backend.hasLinkRegister THEN
  2410. Emit(Pop(Basic.invalidPosition, lr));
  2411. END;
  2412. GetRecordTypeName (recordBase,name);
  2413. IF HasExplicitTraceMethod (recordBase) THEN
  2414. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2415. ELSE
  2416. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2417. END;
  2418. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2419. Emit(Br(position,op));
  2420. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2421. Emit(Exit(position,0,0,0));
  2422. ELSE
  2423. IF backend.hasLinkRegister THEN
  2424. Emit(Pop(Basic.invalidPosition, lr));
  2425. END;
  2426. IF recordType.isObject THEN
  2427. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2428. ELSE
  2429. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2430. END;
  2431. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2432. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2433. Emit(Br(position,op));
  2434. END;
  2435. IF ~recordType.isObject THEN
  2436. GetRecordTypeName (recordType,name);
  2437. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2438. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2439. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2440. NEW(registerUsageCount);
  2441. usedRegisters := NIL;
  2442. IF dump # NIL THEN dump := section.comments END;
  2443. register := NewRegisterOperand (addressType);
  2444. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2445. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2446. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2447. END;
  2448. Emit (Push(position,register));
  2449. GetRecordTypeName (recordType,name);
  2450. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2451. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2452. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2453. ReleaseIntermediateOperand(register);
  2454. Emit(Exit(position,0,0,0));
  2455. GetRecordTypeName (recordType,name);
  2456. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2457. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2458. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2459. NEW(registerUsageCount);
  2460. usedRegisters := NIL;
  2461. register := NewRegisterOperand (addressType);
  2462. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2463. Emit(Mov(position, register, parameter1));
  2464. label := NewLabel();
  2465. SetLabel(label);
  2466. Emit(Push(position, register));
  2467. GetRecordTypeName (recordType,name);
  2468. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2469. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2470. Emit(Call(position, op, 0));
  2471. Emit(Pop(position, register));
  2472. Emit(Add(position, register, register, ofs));
  2473. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2474. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2475. Emit(Exit(position,0,0,0));
  2476. END;
  2477. INC(statCoopTraceMethod, section.pc);
  2478. ReturnToContext(context);
  2479. IF dump # NIL THEN dump := section.comments END;
  2480. END CreateTraceMethod;
  2481. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2482. VAR name: Basic.SegmentedName;
  2483. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2484. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2485. context: Context;
  2486. BEGIN
  2487. IF recordType.isObject THEN RETURN END;
  2488. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2489. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2490. GetRecordTypeName (recordType,name);
  2491. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2492. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2493. IF dump # NIL THEN dump := section.comments END;
  2494. IF backend.hasLinkRegister THEN
  2495. Emit(Push(Basic.invalidPosition, lr));
  2496. END;
  2497. variable := recordType.recordScope.firstVariable;
  2498. WHILE variable # NIL DO
  2499. IF variable.NeedsTrace() THEN
  2500. dst := NewRegisterOperand (addressType);
  2501. Emit (Mov(position, dst, parameter1));
  2502. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2503. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2504. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2505. END;
  2506. CallResetProcedure(dst, nil, variable.type);
  2507. ReleaseIntermediateOperand(dst);
  2508. END;
  2509. variable := variable.nextVariable;
  2510. END;
  2511. recordBase := recordType.GetBaseRecord();
  2512. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2513. IF backend.hasLinkRegister THEN
  2514. Emit(Pop(Basic.invalidPosition, lr));
  2515. END;
  2516. GetRecordTypeName (recordBase,name);
  2517. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2518. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2519. Emit(Br(position,op));
  2520. ELSE
  2521. Emit(Exit(position,0,0, 0));
  2522. END;
  2523. GetRecordTypeName (recordType,name);
  2524. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2525. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2526. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2527. NEW(registerUsageCount);
  2528. usedRegisters := NIL;
  2529. dst := NewRegisterOperand (addressType);
  2530. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2531. Emit(Mov(position, dst, parameter1));
  2532. label := NewLabel();
  2533. SetLabel(label);
  2534. Emit(Push(position, dst));
  2535. GetRecordTypeName (recordType,name);
  2536. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2537. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2538. Emit(Call(position, op, 0));
  2539. Emit(Pop(position, dst));
  2540. Emit(Add(position, dst, dst, ofs));
  2541. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2542. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2543. Emit(Exit(position,0,0, 0));
  2544. INC(statCoopResetProcedure, section.pc);
  2545. ReturnToContext(context);
  2546. IF dump # NIL THEN dump := section.comments END;
  2547. END CreateResetProcedure;
  2548. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2549. VAR name: Basic.SegmentedName; context: Context;
  2550. BEGIN
  2551. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2552. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2553. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2554. IF dump # NIL THEN dump := section.comments END;
  2555. IF backend.hasLinkRegister THEN
  2556. Emit(Push(Basic.invalidPosition, lr));
  2557. END;
  2558. Emit(Push(position,fp));
  2559. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2560. ResetVariables(scope);
  2561. Emit(Pop(position,fp));
  2562. Emit(Exit(position,0,0, 0));
  2563. ReturnToContext(context);
  2564. IF dump # NIL THEN dump := section.comments END;
  2565. END CreateResetMethod;
  2566. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2567. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2568. BEGIN
  2569. IF SemanticChecker.IsPointerType (type) THEN
  2570. Emit (Push(position, dest));
  2571. CallThis(position,"GarbageCollector","Reset", 1);
  2572. ELSIF type.IsRecordType() THEN
  2573. Emit (Push(position, dest));
  2574. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2575. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2576. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2577. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2578. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2579. size := GetArrayLength(type, tag);
  2580. base := ArrayBaseType(type);
  2581. IF base.IsRecordType() THEN
  2582. Emit (Push(position, size));
  2583. Emit (Push(position, dest));
  2584. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2585. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2586. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2587. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2588. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2589. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2590. Emit (Push(position, size));
  2591. Emit (Push(position, dest));
  2592. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2593. ELSE
  2594. Emit (Push(position, size));
  2595. Emit (Push(position, dest));
  2596. CallThis(position,"GarbageCollector","ResetArray", 2);
  2597. ASSERT(ArrayBaseType(type).IsPointer());
  2598. END;
  2599. ReleaseIntermediateOperand(size);
  2600. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2601. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2602. Emit (Push(position, dest));
  2603. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2604. ELSE HALT(100); (* missing ? *)
  2605. END;
  2606. END CallResetProcedure;
  2607. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2608. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2609. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2610. VAR operand: Operand;
  2611. BEGIN
  2612. Symbol (symbol, operand);
  2613. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2614. ReleaseOperand(operand);
  2615. END Reset;
  2616. BEGIN
  2617. previousScope := currentScope;
  2618. currentScope := scope;
  2619. pc := section.pc;
  2620. variable := scope.firstVariable;
  2621. WHILE variable # NIL DO
  2622. IF variable.NeedsTrace() THEN
  2623. Reset (variable);
  2624. END;
  2625. variable := variable.nextVariable;
  2626. END;
  2627. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2628. WHILE parameter # NIL DO
  2629. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2630. Reset (parameter);
  2631. END;
  2632. parameter := parameter.nextParameter;
  2633. END;
  2634. INC(statCoopResetVariables, section.pc - pc);
  2635. currentScope := previousScope;
  2636. END ResetVariables;
  2637. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2638. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2639. VAR op: IntermediateCode.Operand; context: Context;
  2640. BEGIN
  2641. previousSection := section;
  2642. GetCodeSectionNameForSymbol(procedure, name);
  2643. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2644. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2645. IF dump # NIL THEN dump := section.comments END;
  2646. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2647. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2648. Emit(Data(position,op));
  2649. Emit(Data(position,nil));
  2650. IF HasPointers (procedure.procedureScope) THEN
  2651. GetCodeSectionNameForSymbol(procedure, name);
  2652. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2653. ELSE
  2654. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2655. END;
  2656. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2657. Emit(Data(position,op));
  2658. ReturnToContext(context);
  2659. IF dump # NIL THEN dump := section.comments END;
  2660. END CreateProcedureDescriptor;
  2661. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2662. VAR import: SyntaxTree.Import;
  2663. s: Basic.MessageString;
  2664. selfName: SyntaxTree.IdentifierString;
  2665. BEGIN
  2666. moduleScope.ownerModule.GetName(selfName);
  2667. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2668. module := moduleScope.ownerModule
  2669. ELSE
  2670. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2671. IF import = NIL THEN
  2672. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2673. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2674. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2675. s := "Module ";
  2676. Strings.Append(s,moduleName);
  2677. Strings.Append(s," cannot be imported.");
  2678. IF force THEN
  2679. Error(position,s);
  2680. ELSIF canBeLoaded THEN
  2681. IF WarningDynamicLoading THEN
  2682. Strings.Append(s, "=> no dynamic linking.");
  2683. Warning(position, s);
  2684. END;
  2685. canBeLoaded := FALSE;
  2686. END;
  2687. RETURN FALSE
  2688. ELSE
  2689. SELF.module.imports.AddName(moduleName)
  2690. END;
  2691. ELSIF import.module = NIL THEN (* already tried *)
  2692. RETURN FALSE
  2693. END;
  2694. module := import.module;
  2695. END;
  2696. RETURN TRUE
  2697. END AddImport;
  2698. (* needed for old binary object file format*)
  2699. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2700. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2701. BEGIN
  2702. IF AddImport(moduleName,module,TRUE) THEN
  2703. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2704. IF procedure = NIL THEN
  2705. s := "Instruction not supported on target, emulation procedure ";
  2706. Strings.Append(s,moduleName);
  2707. Strings.Append(s,".");
  2708. Strings.Append(s,procedureName);
  2709. Strings.Append(s," not present");
  2710. Error(position,s);
  2711. ELSE
  2712. StaticCallOperand(r,procedure);
  2713. ReleaseOperand(r);
  2714. fp := GetFingerprint(procedure);
  2715. END;
  2716. END;
  2717. END EnsureSymbol;
  2718. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2719. VAR exit: Label; trueL,falseL: Label;
  2720. BEGIN
  2721. trueL := NewLabel();
  2722. falseL := NewLabel();
  2723. exit := NewLabel();
  2724. Condition(x,trueL,falseL);
  2725. InitOperand(result,ModeValue);
  2726. SetLabel(trueL);
  2727. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2728. Emit(Mov(position,result.op,true));
  2729. BrL(exit);
  2730. SetLabel(falseL);
  2731. Emit(MovReplace(position,result.op,false));
  2732. SetLabel(exit);
  2733. END ConditionToValue;
  2734. PROCEDURE ValueToCondition(VAR op: Operand);
  2735. BEGIN
  2736. LoadValue(op,system.booleanType);
  2737. BrneL(trueLabel,op.op, false);
  2738. ReleaseOperand(op);
  2739. BrL(falseLabel);
  2740. END ValueToCondition;
  2741. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2742. VAR size: LONGINT;
  2743. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2744. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2745. BEGIN
  2746. ASSERT(type.form = SyntaxTree.Open);
  2747. baseType := type.arrayBase.resolved;
  2748. IF IsOpenArray(baseType) THEN
  2749. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2750. ELSE
  2751. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2752. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2753. END;
  2754. len := tag;
  2755. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2756. IntermediateCode.MakeMemory(len,addressType);
  2757. UseIntermediateOperand(len);
  2758. Reuse2(res,sizeOperand,len);
  2759. Emit(Mul(position,res,sizeOperand,len));
  2760. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2761. RETURN res
  2762. END GetArraySize;
  2763. BEGIN
  2764. type := type.resolved;
  2765. IF IsOpenArray(type) THEN
  2766. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2767. RETURN tag
  2768. ELSE
  2769. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2770. END;
  2771. ELSE
  2772. size := ToMemoryUnits(system,system.SizeOf(type));
  2773. RETURN IntermediateCode.Immediate(addressType,size)
  2774. END;
  2775. END GetDynamicSize;
  2776. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2777. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2778. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2779. BEGIN
  2780. ASSERT(type.form = SyntaxTree.Open);
  2781. baseType := type.arrayBase.resolved;
  2782. IF IsOpenArray(baseType) THEN
  2783. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2784. ELSE
  2785. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2786. END;
  2787. len := tag;
  2788. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2789. IntermediateCode.MakeMemory(len,addressType);
  2790. UseIntermediateOperand(len);
  2791. Reuse2(res,sizeOperand,len);
  2792. Emit(Mul(position,res,sizeOperand,len));
  2793. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2794. RETURN res
  2795. END GetLength;
  2796. BEGIN
  2797. type := type.resolved;
  2798. IF IsOpenArray(type) THEN
  2799. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2800. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2801. ELSIF type IS SyntaxTree.StringType THEN
  2802. RETURN tag;
  2803. ELSE
  2804. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2805. END;
  2806. END GetArrayLength;
  2807. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2808. VAR result: IntermediateCode.Operand;
  2809. BEGIN
  2810. IF backend.cooperative THEN
  2811. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2812. ELSE
  2813. MakeMemory(result, tag, addressType, 0);
  2814. END;
  2815. RETURN result
  2816. END GetSizeFromTag;
  2817. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2818. VAR parameter: SyntaxTree.Parameter;
  2819. BEGIN
  2820. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2821. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2822. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2823. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2824. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2825. END;
  2826. RETURN GetDynamicSize(e.type, tag);
  2827. END GetArrayOfBytesSize;
  2828. (*
  2829. to find imported symbol. not needed ?
  2830. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2831. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2832. BEGIN
  2833. IF AddImport(moduleName,importedModule,FALSE) THEN
  2834. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2835. RETURN symbol
  2836. ELSE
  2837. RETURN NIL
  2838. END
  2839. END SymbolByName;
  2840. *)
  2841. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2842. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2843. BEGIN
  2844. IF AddImport(moduleName,runtimeModule,force) THEN
  2845. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2846. IF procedure = NIL THEN
  2847. s := "Procedure ";
  2848. Strings.Append(s,moduleName);
  2849. Strings.Append(s,".");
  2850. Strings.Append(s,procedureName);
  2851. Strings.Append(s," not present");
  2852. Error(position,s);
  2853. RETURN FALSE
  2854. ELSE
  2855. RETURN TRUE
  2856. END;
  2857. ELSE RETURN FALSE
  2858. END;
  2859. END GetRuntimeProcedure;
  2860. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2861. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2862. s: Basic.MessageString;
  2863. BEGIN
  2864. Basic.InitSegmentedName(name);
  2865. name[0] := Basic.MakeString(moduleName);
  2866. name[1] := Basic.MakeString(typeName);
  2867. name[2] := -1;
  2868. IF AddImport(moduleName,importedModule, FALSE) THEN
  2869. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2870. IF symbol = NIL THEN
  2871. s := "type ";
  2872. Strings.Append(s,moduleName);
  2873. Strings.Append(s,".");
  2874. Strings.Append(s,typeName);
  2875. Strings.Append(s," not present");
  2876. Error(position,s);
  2877. END;
  2878. ELSE symbol := NIL;
  2879. END;
  2880. IF importedModule = moduleScope.ownerModule THEN
  2881. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2882. ELSE
  2883. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2884. END;
  2885. RETURN symbol
  2886. END GetTypeDescriptor;
  2887. (* Call a runtime procedure. If numberParameters >= 0 then the procedure may be called without module import. Otherwise the signature has to be inferred from the import. *)
  2888. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2889. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2890. pooledName: Basic.SegmentedName; size: LONGINT;
  2891. BEGIN
  2892. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2893. StaticCallOperand(result,procedure);
  2894. IF numberParameters < 0 THEN
  2895. size := ProcedureParametersSize(system,procedure);
  2896. ELSE
  2897. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2898. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2899. Error(position,"runtime call parameter count mismatch");
  2900. END;
  2901. END;
  2902. Emit(Call(position, result.op, size));
  2903. ReleaseOperand(result);
  2904. ELSE (* only static linking possible *)
  2905. ASSERT(numberParameters >= 0);
  2906. Basic.InitSegmentedName(pooledName);
  2907. pooledName[0] := Basic.MakeString(moduleName);
  2908. pooledName[1] := Basic.MakeString(procedureName);
  2909. pooledName[2] := -1;
  2910. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2911. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2912. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2913. END;
  2914. END CallThisChecked;
  2915. (* Call a runtime procedure. If numberParameters >= 0 then the procedure may be called without module import. Otherwise the signature has to be inferred from the import. *)
  2916. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2917. BEGIN
  2918. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2919. END CallThis;
  2920. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2921. VAR
  2922. left,right: Operand;
  2923. leftSize, rightSize: IntermediateCode.Operand;
  2924. saved: RegisterEntry;
  2925. reg: IntermediateCode.Operand;
  2926. procedureName: SyntaxTree.IdentifierString;
  2927. BEGIN
  2928. procedureName := "CompareString";
  2929. SaveRegisters();ReleaseUsedRegisters(saved);
  2930. Designate(leftExpression,left);
  2931. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2932. Emit(Push(position,leftSize));
  2933. ReleaseIntermediateOperand(leftSize);
  2934. Emit(Push(position,left.op));
  2935. ReleaseOperand(left);
  2936. Designate(rightExpression,right);
  2937. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2938. Emit(Push(position,rightSize));
  2939. ReleaseIntermediateOperand(rightSize);
  2940. Emit(Push(position,right.op));
  2941. ReleaseOperand(right);
  2942. IF backend.cooperative THEN
  2943. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2944. ELSE
  2945. CallThis(position,runtimeModuleName,procedureName, 4);
  2946. END;
  2947. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2948. Emit(Result(position,reg));
  2949. (*
  2950. AcquireThisRegister(int8,IntermediateCode.Result);
  2951. *)
  2952. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2953. (*
  2954. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2955. *)
  2956. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2957. ReleaseIntermediateOperand(reg);
  2958. BrL(falseLabel);
  2959. END CompareString;
  2960. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2961. VAR
  2962. left,right: Operand;
  2963. leftSize, rightSize: IntermediateCode.Operand;
  2964. saved: RegisterEntry;
  2965. procedureName: SyntaxTree.IdentifierString;
  2966. BEGIN
  2967. procedureName := "CopyString";
  2968. SaveRegisters();ReleaseUsedRegisters(saved);
  2969. Designate(leftExpression,left);
  2970. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2971. Emit(Push(position,leftSize));
  2972. ReleaseIntermediateOperand(leftSize);
  2973. Emit(Push(position,left.op));
  2974. ReleaseOperand(left);
  2975. Designate(rightExpression,right);
  2976. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2977. Emit(Push(position,rightSize));
  2978. ReleaseIntermediateOperand(rightSize);
  2979. Emit(Push(position,right.op));
  2980. ReleaseOperand(right);
  2981. IF backend.cooperative THEN
  2982. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2983. ELSE
  2984. CallThis(position,runtimeModuleName,procedureName,4);
  2985. END;
  2986. RestoreRegisters(saved);
  2987. END CopyString;
  2988. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2989. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2990. leftType,rightType: SyntaxTree.Type;
  2991. leftExpression,rightExpression : SyntaxTree.Expression;
  2992. componentType: IntermediateCode.Type;
  2993. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2994. size: LONGINT;
  2995. BEGIN
  2996. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2997. dest := destination; destination := emptyOperand;
  2998. leftType := x.left.type.resolved;
  2999. rightType := x.right.type.resolved;
  3000. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3001. CASE x.operator OF
  3002. Scanner.Or:
  3003. (* shortcut evaluation of left OR right *)
  3004. IF ~conditional THEN ConditionToValue(x);
  3005. ELSE
  3006. next := NewLabel();
  3007. Condition(x.left,trueLabel,next);
  3008. SetLabel(next);
  3009. Condition(x.right,trueLabel,falseLabel);
  3010. END;
  3011. |Scanner.And:
  3012. (* shortcut evaluation of left & right *)
  3013. IF ~conditional THEN ConditionToValue(x);
  3014. ELSE
  3015. next := NewLabel();
  3016. Condition(x.left,next,falseLabel);
  3017. SetLabel(next);
  3018. Condition(x.right,trueLabel,falseLabel);
  3019. END;
  3020. |Scanner.Is:
  3021. IF ~conditional THEN ConditionToValue(x);
  3022. ELSE
  3023. (* get type desc tag *)
  3024. IF IsPointerToRecord(leftType,recordType) THEN
  3025. Evaluate(x.left,left);
  3026. Dereference(left,recordType,IsUnsafePointer(leftType))
  3027. ELSE
  3028. Designate(x.left,left);
  3029. END;
  3030. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3031. ReleaseOperand(left);
  3032. END;
  3033. |Scanner.Plus:
  3034. Evaluate(x.left,left);
  3035. Evaluate(x.right,right);
  3036. IF leftType IS SyntaxTree.SetType THEN
  3037. InitOperand(result,ModeValue);
  3038. Reuse2a(result.op,left.op,right.op,dest);
  3039. Emit(Or(position,result.op,left.op,right.op));
  3040. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3041. InitOperand(result,ModeValue);
  3042. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3043. Reuse2(result.tag,left.tag,right.tag);
  3044. Emit(Add(position,result.op,left.op,right.op));
  3045. Emit(Add(position,result.tag,left.tag,right.tag))
  3046. ELSE
  3047. InitOperand(result,ModeValue);
  3048. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3049. AddInt(result.op, left.op, right.op) ;
  3050. ELSE
  3051. *)
  3052. Reuse2a(result.op,left.op,right.op,dest);
  3053. Emit(Add(position,result.op,left.op,right.op));
  3054. (*
  3055. END;
  3056. *)
  3057. END;
  3058. ReleaseOperand(left); ReleaseOperand(right);
  3059. |Scanner.Minus:
  3060. Evaluate(x.left,left);
  3061. Evaluate(x.right,right);
  3062. IF leftType IS SyntaxTree.SetType THEN
  3063. InitOperand(result,ModeValue);
  3064. Reuse1(result.op,right.op);
  3065. Emit(Not(position,result.op,right.op));
  3066. ReleaseOperand(right);
  3067. Emit(And(position,result.op,result.op,left.op));
  3068. ReleaseOperand(left);
  3069. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3070. InitOperand(result,ModeValue);
  3071. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3072. Reuse2(result.tag,left.tag,right.tag);
  3073. Emit(Sub(position,result.op,left.op,right.op));
  3074. Emit(Sub(position,result.tag,left.tag,right.tag));
  3075. ReleaseOperand(left); ReleaseOperand(right)
  3076. ELSE
  3077. InitOperand(result,ModeValue);
  3078. Reuse2a(result.op,left.op,right.op,dest);
  3079. Emit(Sub(position,result.op,left.op,right.op));
  3080. ReleaseOperand(left); ReleaseOperand(right);
  3081. END;
  3082. |Scanner.Times:
  3083. Evaluate(x.left,left);
  3084. Evaluate(x.right,right);
  3085. IF leftType IS SyntaxTree.SetType THEN
  3086. InitOperand(result,ModeValue);
  3087. Reuse2a(result.op,left.op,right.op,dest);
  3088. Emit(And(position,result.op,left.op,right.op));
  3089. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3090. InitOperand(result, ModeValue);
  3091. componentType := left.op.type;
  3092. (* TODO: review this *)
  3093. (*
  3094. result.op = left.op * right.op - left.tag * right.tag
  3095. result.tag = left.tag * right.op + left.op * right.tag
  3096. *)
  3097. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3098. Emit(Mul(position,result.op, left.op, right.op));
  3099. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3100. Emit(Mul(position,tempReg, left.tag, right.tag));
  3101. Emit(Sub(position,result.op, result.op, tempReg));
  3102. Reuse2(result.tag, left.tag, right.op);
  3103. Emit(Mul(position,result.tag, left.tag, right.op));
  3104. Emit(Mul(position,tempReg, left.op, right.tag));
  3105. Emit(Add(position,result.tag, result.tag, tempReg));
  3106. ReleaseIntermediateOperand(tempReg)
  3107. ELSE
  3108. InitOperand(result,ModeValue);
  3109. Reuse2a(result.op,left.op,right.op,dest);
  3110. Emit(Mul(position,result.op,left.op,right.op));
  3111. END;
  3112. ReleaseOperand(left); ReleaseOperand(right);
  3113. |Scanner.Div:
  3114. Evaluate(x.left,left);
  3115. Evaluate(x.right,right);
  3116. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3117. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3118. IF ~isUnchecked THEN
  3119. exit := NewLabel();
  3120. BrltL(exit,zero,right.op);
  3121. EmitTrap(position,NegativeDivisorTrap);
  3122. SetLabel(exit);
  3123. END;
  3124. END;
  3125. InitOperand(result,ModeValue);
  3126. Reuse2a(result.op,left.op,right.op,dest);
  3127. Emit(Div(position,result.op,left.op,right.op));
  3128. ReleaseOperand(left); ReleaseOperand(right);
  3129. |Scanner.Mod:
  3130. Evaluate(x.left,left);
  3131. Evaluate(x.right,right);
  3132. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3133. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3134. IF ~isUnchecked THEN
  3135. exit := NewLabel();
  3136. BrltL(exit,zero,right.op);
  3137. EmitTrap(position,NegativeDivisorTrap);
  3138. SetLabel(exit);
  3139. END;
  3140. END;
  3141. InitOperand(result,ModeValue);
  3142. Reuse2a(result.op,left.op,right.op,dest);
  3143. Emit(Mod(position,result.op,left.op,right.op));
  3144. ReleaseOperand(left); ReleaseOperand(right);
  3145. |Scanner.Slash:
  3146. Evaluate(x.left,left);
  3147. Evaluate(x.right,right);
  3148. IF leftType IS SyntaxTree.SetType THEN
  3149. InitOperand(result,ModeValue);
  3150. Reuse2a(result.op,left.op,right.op,dest);
  3151. Emit(Xor(position,result.op,left.op,right.op));
  3152. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3153. InitOperand(result,ModeValue);
  3154. componentType := left.op.type;
  3155. (* review this *)
  3156. (*
  3157. divisor = right.op * right.op + right.tag * right.tag
  3158. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3159. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3160. *)
  3161. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3162. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3163. Emit(Mul(position,tempReg, right.op, right.op));
  3164. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3165. Emit(Add(position,tempReg, tempReg, tempReg2));
  3166. result.op := tempReg2;
  3167. Emit(Mul(position,result.op, left.op, right.op));
  3168. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3169. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3170. Emit(Add(position,result.op, result.op, tempReg2));
  3171. Emit(Div(position,result.op, result.op, tempReg));
  3172. Reuse2(result.tag, left.tag, right.op);
  3173. Emit(Mul(position,result.tag, left.tag, right.op));
  3174. Emit(Mul(position,tempReg2, left.op, right.tag));
  3175. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3176. Emit(Div(position,result.tag, result.tag, tempReg));
  3177. ReleaseIntermediateOperand(tempReg);
  3178. ReleaseIntermediateOperand(tempReg2)
  3179. ELSE
  3180. InitOperand(result,ModeValue);
  3181. Reuse2a(result.op,left.op,right.op,dest);
  3182. Emit(Div(position,result.op,left.op,right.op));
  3183. END;
  3184. ReleaseOperand(left); ReleaseOperand(right);
  3185. |Scanner.Equal:
  3186. IF ~conditional THEN ConditionToValue(x);
  3187. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3188. CompareString(BreqL,x.left,x.right);
  3189. ELSE
  3190. Evaluate(x.left,left);
  3191. Evaluate(x.right,right);
  3192. IF leftType IS SyntaxTree.RangeType THEN
  3193. ASSERT(rightType IS SyntaxTree.RangeType);
  3194. BrneL(falseLabel, left.op, right.op); (* first *)
  3195. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3196. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3197. ReleaseOperand(left); ReleaseOperand(right);
  3198. BrL(trueLabel)
  3199. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3200. BrneL(falseLabel, left.op, right.op); (* first *)
  3201. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3202. ReleaseOperand(left); ReleaseOperand(right);
  3203. BrL(trueLabel)
  3204. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3205. (* TODO: review this *)
  3206. BrneL(falseLabel, left.op, right.op); (* real part *)
  3207. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3208. ReleaseOperand(left); ReleaseOperand(right);
  3209. BrL(trueLabel)
  3210. ELSE
  3211. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3212. ReleaseOperand(left); ReleaseOperand(right);
  3213. BrL(trueLabel);
  3214. END;
  3215. END;
  3216. |Scanner.LessEqual:
  3217. IF ~conditional THEN ConditionToValue(x);
  3218. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3219. CompareString(BrgeL,x.right,x.left);
  3220. ELSE
  3221. Evaluate(x.left,left);
  3222. Evaluate(x.right,right);
  3223. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3224. Reuse1(temp.op,right.op);
  3225. Emit(And(position,temp.op,left.op,right.op));
  3226. ReleaseOperand(right);
  3227. BreqL(trueLabel,temp.op,left.op);
  3228. BrL(falseLabel);
  3229. ReleaseOperand(temp);ReleaseOperand(left);
  3230. ELSE
  3231. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3232. ReleaseOperand(left); ReleaseOperand(right);
  3233. BrL(trueLabel);
  3234. END;
  3235. END;
  3236. |Scanner.Less:
  3237. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3238. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3239. leftExpression.SetType(system.booleanType);
  3240. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3241. rightExpression.SetType(system.booleanType);
  3242. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3243. leftExpression.SetType(system.booleanType);
  3244. Expression(leftExpression);
  3245. ELSIF ~conditional THEN ConditionToValue(x);
  3246. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3247. CompareString(BrltL,x.left,x.right);
  3248. ELSE
  3249. Evaluate(x.left,left);
  3250. Evaluate(x.right,right);
  3251. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3252. ReleaseOperand(left); ReleaseOperand(right);
  3253. BrL(trueLabel);
  3254. END;
  3255. |Scanner.Greater:
  3256. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3257. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3258. leftExpression.SetType(system.booleanType);
  3259. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3260. rightExpression.SetType(system.booleanType);
  3261. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3262. leftExpression.SetType(system.booleanType);
  3263. Expression(leftExpression);
  3264. ELSIF ~conditional THEN ConditionToValue(x);
  3265. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3266. CompareString(BrltL,x.right,x.left);
  3267. ELSE
  3268. Evaluate(x.left,left);
  3269. Evaluate(x.right,right);
  3270. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3271. ReleaseOperand(left); ReleaseOperand(right);
  3272. BrL(trueLabel);
  3273. END;
  3274. |Scanner.GreaterEqual:
  3275. IF ~conditional THEN ConditionToValue(x);
  3276. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3277. CompareString(BrgeL,x.left,x.right);
  3278. ELSE
  3279. Evaluate(x.left,left);
  3280. Evaluate(x.right,right);
  3281. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3282. Reuse1(temp.op,left.op);
  3283. Emit(And(position,temp.op,left.op,right.op));
  3284. ReleaseOperand(left);
  3285. BreqL(trueLabel, temp.op,right.op);
  3286. ReleaseOperand(temp); ReleaseOperand(right);
  3287. BrL(falseLabel);
  3288. ELSE
  3289. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3290. ReleaseOperand(left); ReleaseOperand(right);
  3291. BrL(trueLabel);
  3292. END;
  3293. END;
  3294. |Scanner.Unequal:
  3295. IF ~conditional THEN ConditionToValue(x);
  3296. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3297. CompareString(BrneL,x.left,x.right);
  3298. ELSE
  3299. Evaluate(x.left,left);
  3300. Evaluate(x.right,right);
  3301. IF leftType IS SyntaxTree.RangeType THEN
  3302. ASSERT(rightType IS SyntaxTree.RangeType);
  3303. BrneL(trueLabel, left.op, right.op); (* first *)
  3304. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3305. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3306. ReleaseOperand(left); ReleaseOperand(right);
  3307. BrL(falseLabel)
  3308. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3309. BrneL(trueLabel, left.op, right.op); (* first *)
  3310. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3311. ReleaseOperand(left); ReleaseOperand(right);
  3312. BrL(falseLabel)
  3313. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3314. (* TODO: review this *)
  3315. BrneL(trueLabel, left.op, right.op); (* real part *)
  3316. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3317. ReleaseOperand(left); ReleaseOperand(right);
  3318. BrL(falseLabel)
  3319. ELSE
  3320. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3321. ReleaseOperand(left); ReleaseOperand(right);
  3322. BrL(trueLabel);
  3323. END;
  3324. END;
  3325. |Scanner.In:
  3326. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3327. Evaluate(x.left,left);
  3328. Evaluate(x.right,right);
  3329. Convert(left.op,setType);
  3330. ReuseCopy(temp.op,right.op);
  3331. Emit(Shr(position,temp.op,temp.op,left.op));
  3332. ReleaseOperand(right); ReleaseOperand(left);
  3333. IntermediateCode.InitImmediate(one,setType,1);
  3334. Emit(And(position,temp.op,temp.op,one));
  3335. IF conditional THEN
  3336. IntermediateCode.InitImmediate(zero,setType,0);
  3337. BrneL(trueLabel,temp.op,zero);
  3338. ReleaseOperand(temp);
  3339. BrL(falseLabel);
  3340. ELSE
  3341. Convert(temp.op,bool);
  3342. result.mode := ModeValue;
  3343. result.op := temp.op;
  3344. result.tag := nil; (* may be left over from calls to evaluate *)
  3345. END;
  3346. ELSE
  3347. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3348. IF x.operator = Scanner.Questionmarks THEN
  3349. leftExpression := x.left;
  3350. rightExpression := x.right;
  3351. ELSE
  3352. leftExpression := x.right;
  3353. rightExpression := x.left;
  3354. END;
  3355. Evaluate(leftExpression, left);
  3356. Emit(Push(position,left.op));
  3357. ReleaseOperand(left);
  3358. Designate(rightExpression, right);
  3359. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3360. IF ~backend.cellsAreObjects THEN
  3361. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3362. END;
  3363. Emit(Push(position,right.op));
  3364. ReleaseOperand(right);
  3365. IF backend.cellsAreObjects THEN
  3366. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3367. ELSE
  3368. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3369. END;
  3370. InitOperand(result, ModeValue);
  3371. result.op := NewRegisterOperand(bool);
  3372. Emit(Result(position,result.op));
  3373. IF conditional THEN
  3374. IntermediateCode.InitImmediate(zero,setType,0);
  3375. BrneL(trueLabel,result.op,zero);
  3376. ReleaseOperand(result);
  3377. BrL(falseLabel);
  3378. END;
  3379. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3380. leftExpression := x.left;
  3381. rightExpression := x.right;
  3382. Evaluate(leftExpression, left);
  3383. Emit(Push(position,left.op));
  3384. ReleaseOperand(left);
  3385. Evaluate(rightExpression, right);
  3386. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3387. IF ~backend.cellsAreObjects THEN
  3388. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3389. END;
  3390. Emit(Push(position,right.op));
  3391. ReleaseOperand(right);
  3392. IF backend.cellsAreObjects THEN
  3393. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3394. ELSE
  3395. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3396. END;
  3397. InitOperand(result, ModeValue);
  3398. result.op := NewRegisterOperand(bool);
  3399. Emit(Result(position,result.op));
  3400. IF conditional THEN
  3401. IntermediateCode.InitImmediate(zero,setType,0);
  3402. BrneL(trueLabel,result.op,zero);
  3403. ReleaseOperand(result);
  3404. BrL(falseLabel);
  3405. END;
  3406. ELSE
  3407. HALT(100);
  3408. END;
  3409. END;
  3410. destination := dest;
  3411. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3412. END VisitBinaryExpression;
  3413. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3414. VAR localResult, operand: Operand;
  3415. BEGIN
  3416. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3417. InitOperand(localResult, ModeValue);
  3418. ASSERT(x.first # NIL);
  3419. Evaluate(x.first, operand);
  3420. localResult.op := operand.op;
  3421. ReleaseOperand(operand);
  3422. UseIntermediateOperand(localResult.op);
  3423. ASSERT(x.last # NIL);
  3424. Evaluate(x.last, operand);
  3425. localResult.tag := operand.op;
  3426. ReleaseOperand(operand);
  3427. UseIntermediateOperand(localResult.tag);
  3428. IF x.step # NIL THEN
  3429. Evaluate(x.step, operand);
  3430. localResult.extra := operand.op;
  3431. ReleaseOperand(operand);
  3432. UseIntermediateOperand(localResult.extra);
  3433. END;
  3434. result := localResult;
  3435. IF Trace THEN TraceExit("VisitRangeExpression") END
  3436. END VisitRangeExpression;
  3437. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3438. BEGIN
  3439. HALT(100); (* should never be evaluated *)
  3440. END VisitTensorRangeExpression;
  3441. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3442. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3443. BEGIN
  3444. IF Trace THEN TraceEnter("VisitConversion") END;
  3445. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3446. dest := destination; destination := emptyOperand;
  3447. Evaluate(x.expression,old);
  3448. InitOperand(result,ModeValue);
  3449. result.op := old.op;
  3450. ASSERT(result.op.mode # 0);
  3451. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3452. (* convert TO a complex number *)
  3453. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3454. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3455. ASSERT(result.op.mode # 0);
  3456. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3457. (* convert FROM a complex number TO a complex number*)
  3458. result.tag := old.tag;
  3459. ASSERT(result.tag.mode # 0);
  3460. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3461. ASSERT(result.tag.mode # 0)
  3462. ELSE
  3463. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3464. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3465. END
  3466. ELSE
  3467. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3468. ASSERT(result.op.mode # 0);
  3469. result.tag := old.tag; (*! probably never used *)
  3470. END;
  3471. destination := dest;
  3472. IF Trace THEN TraceExit("VisitConversion") END;
  3473. END VisitConversion;
  3474. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3475. BEGIN
  3476. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3477. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3478. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3479. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3480. END VisitTypeDeclaration;
  3481. (** designators (expressions) *)
  3482. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3483. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3484. BEGIN
  3485. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3486. IF x.left # NIL THEN Expression(x.left) END;
  3487. Symbol(x.symbol,result);
  3488. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3489. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3490. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3491. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3492. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3493. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3494. END;
  3495. END;
  3496. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3497. END VisitSymbolDesignator;
  3498. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3499. BEGIN
  3500. IF isUnchecked THEN RETURN END;
  3501. IF tagsAvailable THEN
  3502. TrapC(BrltL,index,length,IndexCheckTrap);
  3503. END;
  3504. END BoundCheck;
  3505. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3506. VAR d: IntermediateCode.Operand;
  3507. BEGIN
  3508. IF isUnchecked THEN RETURN END;
  3509. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3510. TrapC(op,dim,d,ArraySizeTrap);
  3511. ReleaseIntermediateOperand(d);
  3512. END DimensionCheck;
  3513. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3514. VAR
  3515. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3516. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3517. expression: SyntaxTree.Expression;
  3518. resultingType, leftType, baseType: SyntaxTree.Type;
  3519. skipLabel1: Label;
  3520. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3521. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3522. variableOp: Operand;
  3523. variable: SyntaxTree.Variable;
  3524. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3525. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3526. VAR e: SyntaxTree.Expression; i: LONGINT;
  3527. BEGIN
  3528. tensorFound := FALSE;
  3529. FOR i := 0 TO parameters.Length()-1 DO
  3530. e := parameters.GetExpression(i);
  3531. IF e IS SyntaxTree.TensorRangeExpression THEN
  3532. ASSERT(~tensorFound);
  3533. tensorFound := TRUE;
  3534. ELSIF e IS SyntaxTree.RangeExpression THEN
  3535. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3536. ELSE
  3537. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3538. END;
  3539. END;
  3540. END CountIndices;
  3541. BEGIN
  3542. ASSERT(tagsAvailable);
  3543. resultingType := x.type.resolved; (* resulting type *)
  3544. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3545. InitOperand(localResult, ModeReference);
  3546. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3547. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3548. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3549. (* a globally defined array destination tag is available -> use and invalidate it*)
  3550. localResult.tag := arrayDestinationTag;
  3551. IntermediateCode.InitOperand(arrayDestinationTag)
  3552. ELSE
  3553. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3554. (* the result is of array range type and thus does not provide any collectable pointers *)
  3555. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3556. Symbol(variable, variableOp);
  3557. ReuseCopy(localResult.tag, variableOp.op);
  3558. ReleaseOperand(variableOp);
  3559. END
  3560. END;
  3561. indexListSize := x.parameters.Length();
  3562. CountIndices(x.parameters);
  3563. (*ASSERT(tensorRangeCount <= 1);*)
  3564. (* designate the array to be indexed over, perform tensor range check if known *)
  3565. Designate(x.left, array);
  3566. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3567. Dereference(array, leftType,FALSE);
  3568. IF ~tensorFound THEN
  3569. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, prefixRanges + prefixIndices), BreqL)
  3570. END
  3571. END;
  3572. (* default base offset *)
  3573. srcDimOffset := 0;
  3574. destDimOffset := 0;
  3575. indexDim := 0;
  3576. (* use address of source array as basis *)
  3577. localResult.op := array.op;
  3578. UseIntermediateOperand(localResult.op);
  3579. (* go through the index list *)
  3580. FOR i := 0 TO indexListSize - 1 DO
  3581. expression := x.parameters.GetExpression(i);
  3582. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3583. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3584. srcDimOffset := -indexListSize;
  3585. destDimOffset := -suffixRanges;
  3586. ELSE
  3587. (* determine which dimension of source array is currently looked at *)
  3588. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3589. (* get the memory operand pointing to array descriptor dimension *)
  3590. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3591. (* make a reusable register from it *)
  3592. ReuseCopy(srcDim, tmp);
  3593. ReleaseIntermediateOperand(tmp);
  3594. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3595. ELSE
  3596. srcDim := IntermediateCode.Immediate(int32, i);
  3597. END;
  3598. (* get length and increment of source array for current dimension *)
  3599. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3600. Convert(sourceLength.op, sizeType);
  3601. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3602. Convert(sourceIncrement.op, sizeType);
  3603. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3604. ReleaseIntermediateOperand(srcDim);
  3605. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3606. (* SINGLE INDEX *)
  3607. Evaluate(expression, index);
  3608. ReleaseIntermediateOperand(index.tag);
  3609. index.tag := emptyOperand;
  3610. Convert(index.op, sizeType);
  3611. (* lower bound check *)
  3612. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3613. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3614. ELSIF isUnchecked THEN (* do nothing *)
  3615. ELSE
  3616. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3617. END;
  3618. (* upper bound check *)
  3619. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3620. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3621. ELSIF isUnchecked THEN (* do nothing *)
  3622. ELSE
  3623. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3624. END;
  3625. ReleaseOperand(sourceLength);
  3626. Convert(index.op, addressType);
  3627. summand := index.op;
  3628. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3629. (* RANGE OF INDICES *)
  3630. Evaluate(expression, range);
  3631. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3632. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3633. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3634. ReleaseOperand(range);
  3635. Convert(firstIndex, sizeType);
  3636. Convert(lastIndex, sizeType);
  3637. Convert(stepSize, sizeType);
  3638. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3639. if it is 'MAX(LONGINT)' *)
  3640. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3641. TransferToRegister(lastIndex, lastIndex);
  3642. skipLabel1 := NewLabel();
  3643. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3644. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3645. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3646. SetLabel(skipLabel1)
  3647. END;
  3648. (* check if step size is valid *)
  3649. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3650. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3651. ELSIF isUnchecked THEN (* do nothing *)
  3652. ELSE
  3653. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3654. END;
  3655. (* check lower bound check *)
  3656. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3657. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3658. ELSIF isUnchecked THEN (* do nothing *)
  3659. ELSE
  3660. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3661. END;
  3662. (* check upper bound check *)
  3663. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3664. (* statically open range: nothing to do *)
  3665. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3666. ASSERT(staticLastIndex < staticSourceLength)
  3667. ELSIF isUnchecked THEN (* do nothing *)
  3668. ELSE
  3669. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3670. END;
  3671. (* determine length of target array for current dimension *)
  3672. (* 1. incorporate last index: *)
  3673. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3674. (* last index is static *)
  3675. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3676. targetLength := sourceLength.op
  3677. ELSE
  3678. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3679. END;
  3680. UseIntermediateOperand(targetLength);
  3681. ELSE
  3682. (* targetLength := lastIndex + 1
  3683. Reuse1(targetLength, lastIndex);
  3684. *)
  3685. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3686. END;
  3687. ReleaseOperand(sourceLength);
  3688. ReleaseIntermediateOperand(lastIndex);
  3689. (* 2. incorporate first index: *)
  3690. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3691. (* first index and current target length are static *)
  3692. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3693. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3694. (* first index = 0: nothing to do *)
  3695. ELSE
  3696. (* targetLength := targetLength - firstIndex *)
  3697. TransferToRegister(targetLength, targetLength);
  3698. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3699. END;
  3700. (* clip negative lengths to 0 *)
  3701. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3702. IF staticTargetLength < 0 THEN
  3703. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3704. END
  3705. ELSE
  3706. skipLabel1 := NewLabel();
  3707. TransferToRegister(targetLength, targetLength);
  3708. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3709. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3710. SetLabel(skipLabel1)
  3711. END;
  3712. (* 3. incorporate index step size: *)
  3713. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3714. (*step size and current target length are static *)
  3715. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3716. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3717. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3718. (* step size = 1: nothing to do *)
  3719. ELSE
  3720. (* emit code for this:
  3721. targetLength := (targetLength-1) DIV stepSize +1;
  3722. *)
  3723. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3724. DivInt(targetLength, targetLength, stepSize);
  3725. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3726. END;
  3727. (* determine increment of target array for current dimension *)
  3728. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3729. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3730. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3731. (* step size = 1 *)
  3732. targetIncrement := sourceIncrement.op;
  3733. UseIntermediateOperand(targetIncrement)
  3734. ELSE
  3735. (* targetIncrement := sourceIncrement * stepSize *)
  3736. Reuse1(targetIncrement, stepSize);
  3737. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3738. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3739. END;
  3740. ReleaseIntermediateOperand(stepSize);
  3741. (* write length and increment of target array to descriptor *)
  3742. IF destDimOffset < 0 THEN
  3743. (* determine which dimension of target array is currently looked at *)
  3744. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3745. TransferToRegister(destDim, tmp);
  3746. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3747. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3748. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3749. ReleaseIntermediateOperand(destDim);
  3750. INC(destDimOffset);
  3751. ELSE
  3752. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3753. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3754. END;
  3755. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3756. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3757. INC(indexDim);
  3758. Convert(firstIndex, addressType);
  3759. TransferToRegister(summand, firstIndex);
  3760. ELSE HALT(100);
  3761. END;
  3762. (*
  3763. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3764. *)
  3765. Convert(sourceIncrement.op, addressType);
  3766. Convert(summand, addressType);
  3767. MulInt(summand, summand, sourceIncrement.op);
  3768. ReleaseIntermediateOperand(sourceIncrement.op);
  3769. AddInt(localResult.op, localResult.op, summand);
  3770. ReleaseIntermediateOperand(summand);
  3771. END
  3772. END;
  3773. result := localResult;
  3774. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3775. ReleaseIntermediateOperand(result.tag);
  3776. result.tag := TypeDescriptorAdr(resultingType);
  3777. IF ~newObjectFile THEN
  3778. IntermediateCode.MakeMemory(result.tag,addressType);
  3779. END;
  3780. ELSIF IsDelegate(resultingType) THEN
  3781. ReleaseIntermediateOperand(result.tag);
  3782. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3783. UseIntermediateOperand(result.tag);
  3784. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3785. ReleaseIntermediateOperand(result.tag);
  3786. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3787. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3788. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3789. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3790. (* finalize target array descriptor *)
  3791. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3792. (* write lengths and increments of target array for remaining dimensions *)
  3793. i := indexListSize;
  3794. WHILE indexDim < targetArrayDimensionality DO
  3795. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3796. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3797. ReleaseOperand(sourceLength);
  3798. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3799. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3800. ReleaseOperand(sourceIncrement);
  3801. INC(i); INC(indexDim);
  3802. END;
  3803. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3804. tmp := nil;
  3805. ELSE
  3806. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3807. END;
  3808. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3809. ReleaseIntermediateOperand(tmp);
  3810. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3811. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3812. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3813. ELSE
  3814. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3815. END;
  3816. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3817. ReleaseIntermediateOperand(tmp);
  3818. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3819. (* write dimensionality *)
  3820. IF targetArrayDimensionality # 0 THEN
  3821. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3822. END;
  3823. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3824. END;
  3825. ReleaseOperand(array);
  3826. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3827. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3828. END;
  3829. END MathIndexDesignator;
  3830. (* get the length of an array , trying to make use of static information *)
  3831. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3832. VAR res: IntermediateCode.Operand; size: LONGINT;
  3833. BEGIN
  3834. type := type.resolved;
  3835. IF type IS SyntaxTree.ArrayType THEN
  3836. WITH type: SyntaxTree.ArrayType DO
  3837. IF type.form = SyntaxTree.Static THEN
  3838. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3839. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3840. Evaluate(type.length, op);
  3841. ReleaseIntermediateOperand(op.tag);
  3842. RETURN op.op;*)
  3843. ELSE
  3844. res := tag;
  3845. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3846. IntermediateCode.MakeMemory(res,addressType);
  3847. UseIntermediateOperand(res);
  3848. RETURN res
  3849. END
  3850. END;
  3851. ELSE
  3852. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3853. RETURN IntermediateCode.Immediate(addressType,size);
  3854. END;
  3855. END ArrayLength;
  3856. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  3857. BEGIN
  3858. IF IsImmediate(x) THEN
  3859. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  3860. ELSE
  3861. IF ~ReusableRegister(res) THEN
  3862. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3863. ELSE
  3864. UseIntermediateOperand(res);
  3865. END;
  3866. Emit(Mov(position,res,x))
  3867. END;
  3868. END CopyInt;
  3869. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3870. BEGIN
  3871. ReleaseIntermediateOperand(res);
  3872. IF IsImmediate(x) & IsImmediate(y) THEN
  3873. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3874. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3875. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3876. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3877. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3878. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3879. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3880. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3881. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3882. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3883. UseIntermediateOperand(res);
  3884. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3885. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3886. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3887. UseIntermediateOperand(res);
  3888. ELSE
  3889. IF ~ReusableRegister(res) THEN
  3890. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3891. ELSE
  3892. UseIntermediateOperand(res);
  3893. END;
  3894. IF IsImmediate(x) & (x.intValue = 0) THEN
  3895. Emit(Mov(position,res,y))
  3896. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3897. Emit(Mov(position,res,x))
  3898. ELSE
  3899. Emit(Add(position,res, x, y));
  3900. END;
  3901. END;
  3902. END AddInt;
  3903. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3904. BEGIN
  3905. ReleaseIntermediateOperand(res);
  3906. IF IsImmediate(x) & IsImmediate(y) THEN
  3907. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3908. ELSE
  3909. IF ~ReusableRegister(res) THEN
  3910. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3911. ELSE UseIntermediateOperand(res);
  3912. END;
  3913. IF IsImmediate(x) & (x.intValue = 1) THEN
  3914. Emit(Mov(position,res,y))
  3915. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3916. Emit(Mov(position,res,x))
  3917. ELSE
  3918. Emit(Mul(position,res, x, y));
  3919. END;
  3920. END;
  3921. END MulInt;
  3922. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3923. BEGIN
  3924. ReleaseIntermediateOperand(res);
  3925. IF IsImmediate(x) & IsImmediate(y) THEN
  3926. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3927. ELSE
  3928. IF ~ReusableRegister(res) THEN
  3929. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3930. ELSE UseIntermediateOperand(res);
  3931. END;
  3932. IF IsImmediate(x) & (x.intValue = 1) THEN
  3933. Emit(Mov(position,res,y))
  3934. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3935. Emit(Mov(position,res,x))
  3936. ELSE
  3937. Emit(Div(position,res, x, y));
  3938. END;
  3939. END;
  3940. END DivInt;
  3941. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3942. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3943. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3944. BEGIN
  3945. type := x.left.type.resolved;
  3946. IF type IS SyntaxTree.StringType THEN
  3947. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  3948. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3949. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  3950. type := atype;
  3951. x.left.SetType(type);
  3952. END;
  3953. IntermediateCode.InitImmediate(res,addressType,0);
  3954. maxDim := x.parameters.Length()-1;
  3955. (*
  3956. computation rule:
  3957. a: ARRAY X,Y,Z OF Element with size S
  3958. a[i,j,k] -->
  3959. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  3960. *)
  3961. FOR i := 0 TO maxDim DO
  3962. e := x.parameters.GetExpression(i);
  3963. Evaluate(e,index);
  3964. Convert(index.op,addressType);
  3965. AddInt(res, res, index.op);
  3966. IF i = 0 THEN
  3967. (*
  3968. ReuseCopy(res, index.op);
  3969. *)
  3970. Designate(x.left,array);
  3971. type := x.left.type.resolved;
  3972. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3973. Dereference(array, type, FALSE);
  3974. END;
  3975. (*
  3976. ELSE AddInt(res, res, index.op);
  3977. *)
  3978. END;
  3979. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3980. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3981. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3982. BoundCheck(index.op, length);
  3983. END;
  3984. ReleaseIntermediateOperand(length);
  3985. END;
  3986. ReleaseOperand(index);
  3987. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3988. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3989. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3990. MulInt(res,res,length);
  3991. END;
  3992. ReleaseIntermediateOperand(length);
  3993. END;
  3994. (* remaining open dimensions -- compute address *)
  3995. i := maxDim+1;
  3996. IF type IS SyntaxTree.ArrayType THEN
  3997. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3998. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  3999. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4000. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4001. MulInt(res,res,length);
  4002. END;
  4003. ReleaseIntermediateOperand(length);
  4004. INC(i);
  4005. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4006. END;
  4007. END;
  4008. IF (type IS SyntaxTree.ArrayType) THEN
  4009. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4010. size := StaticSize(system, type);
  4011. IF size # 1 THEN
  4012. length := IntermediateCode.Immediate(addressType,size);
  4013. MulInt(res,res,length);
  4014. END;
  4015. ELSE
  4016. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4017. IF size # 1 THEN
  4018. length := IntermediateCode.Immediate(addressType,size);
  4019. MulInt(res,res,length);
  4020. END;
  4021. END;
  4022. END;
  4023. AddInt(res,res,array.op);
  4024. InitOperand(result,ModeReference);
  4025. result.op := res;
  4026. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4027. ReleaseIntermediateOperand(result.tag);
  4028. result.tag := TypeDescriptorAdr(type);
  4029. IF ~newObjectFile THEN
  4030. IntermediateCode.MakeMemory(result.tag,addressType);
  4031. END
  4032. ELSIF IsDelegate(type) THEN
  4033. ReleaseIntermediateOperand(result.tag);
  4034. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4035. UseIntermediateOperand(result.tag);
  4036. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4037. ReleaseIntermediateOperand(result.tag);
  4038. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4039. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4040. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4041. END;
  4042. ReleaseOperand(array);
  4043. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4044. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4045. END;
  4046. END IndexDesignator;
  4047. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  4048. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4049. BEGIN
  4050. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4051. dest := destination; destination := emptyOperand;
  4052. type := x.left.type.resolved;
  4053. IF type IS SyntaxTree.MathArrayType THEN
  4054. MathIndexDesignator(x);
  4055. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4056. IndexDesignator(x);
  4057. END;
  4058. destination := dest;
  4059. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4060. END VisitIndexDesignator;
  4061. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4062. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4063. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4064. procedure: SyntaxTree.Procedure;
  4065. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4066. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4067. BEGIN
  4068. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4069. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4070. parameters := expression.parameters;
  4071. moduleName := "FoxArrayBase";
  4072. procedureName := "CopyDescriptor";
  4073. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4074. SaveRegisters();ReleaseUsedRegisters(saved);
  4075. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4076. IF procedure = NIL THEN
  4077. s := "procedure ";
  4078. Strings.Append(s,moduleName);
  4079. Strings.Append(s,".");
  4080. Strings.Append(s,procedureName);
  4081. Strings.Append(s," not present");
  4082. Error(position,s);
  4083. ELSE
  4084. (* push address of temporary variable *)
  4085. Symbol(variable,destOperand);
  4086. Emit(Push(position,destOperand.op));
  4087. ReleaseOperand(destOperand);
  4088. (* push src *)
  4089. Evaluate(expression.left,srcOperand);
  4090. (*
  4091. Dereference(srcOperand,expression.type.resolved);
  4092. Emit(Push(position,srcOperand.tag));
  4093. *)
  4094. Emit(Push(position,srcOperand.op));
  4095. ReleaseOperand(srcOperand);
  4096. tensorFound := FALSE;
  4097. FOR i := 0 TO parameters.Length()-1 DO
  4098. e := parameters.GetExpression(i);
  4099. IF e IS SyntaxTree.TensorRangeExpression THEN
  4100. tensorFound := TRUE;
  4101. ELSIF e IS SyntaxTree.RangeExpression THEN
  4102. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4103. ELSE
  4104. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4105. END;
  4106. END;
  4107. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  4108. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  4109. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  4110. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  4111. StaticCallOperand(procOp,procedure);
  4112. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4113. ReleaseOperand(procOp);
  4114. END;
  4115. RestoreRegisters(saved);
  4116. END;
  4117. RETURN variable
  4118. END PrepareTensorDescriptor;
  4119. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4120. VAR
  4121. type, descriptorType, baseType: SyntaxTree.Type;
  4122. operand, tmpOperand, variableOp, variable2Op: Operand;
  4123. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4124. variable, variable2: SyntaxTree.Variable;
  4125. dim, i, size: LONGINT;
  4126. (* TODO: needed? *)
  4127. oldArrayDestinationTag: IntermediateCode.Operand;
  4128. oldArrayDestinationDimension: LONGINT;
  4129. position: Position;
  4130. saved: RegisterEntry;
  4131. arrayFlags: SET;
  4132. m, n: LONGINT;
  4133. PROCEDURE Pass(op: IntermediateCode.Operand);
  4134. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4135. BEGIN
  4136. IF numberRegister >= 0 THEN
  4137. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  4138. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4139. Emit(Mov(position,parameterRegister, op));
  4140. ELSE
  4141. Emit(Push(position,op))
  4142. END
  4143. END Pass;
  4144. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4145. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4146. BEGIN
  4147. formalType := formalType.resolved; actualType := actualType.resolved;
  4148. IF IsOpenArray(formalType)THEN
  4149. IF actualType IS SyntaxTree.StringType THEN
  4150. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4151. RETURN;
  4152. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4153. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4154. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4155. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4156. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4157. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4158. ELSE
  4159. tmp := baseReg;
  4160. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4161. IntermediateCode.MakeMemory(tmp,addressType);
  4162. Pass((tmp));
  4163. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4164. END;
  4165. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4166. END;
  4167. END PushArrayLens;
  4168. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4169. BEGIN
  4170. CASE size OF
  4171. |2: INCL(flags,Size2Flag);
  4172. |3: INCL(flags,Size3Flag);
  4173. |4: INCL(flags,Size4Flag);
  4174. |5: INCL(flags,Size5Flag);
  4175. |6: INCL(flags,Size6Flag);
  4176. |7: INCL(flags,Size7Flag);
  4177. |8: INCL(flags,Size8Flag);
  4178. END;
  4179. END SetSmallArraySizeFlag;
  4180. BEGIN
  4181. IF Trace THEN TraceEnter("PushParameter") END;
  4182. position := expression.position;
  4183. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4184. type := expression.type.resolved;
  4185. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4186. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4187. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4188. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4189. );
  4190. (* TODO: needed? *)
  4191. oldArrayDestinationTag := arrayDestinationTag;
  4192. oldArrayDestinationDimension := arrayDestinationDimension;
  4193. IF IsArrayOfSystemByte(parameter.type) THEN
  4194. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4195. Designate(expression,operand);
  4196. ELSE
  4197. Evaluate(expression, tmpOperand);
  4198. (* array of system byte does not provide any pointers *)
  4199. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4200. Symbol(variable, operand);
  4201. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4202. Emit(Mov(position,tmp, tmpOperand.op));
  4203. ReleaseOperand(tmpOperand);
  4204. END;
  4205. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4206. ReleaseIntermediateOperand(operand.tag);
  4207. operand.tag := tmp;
  4208. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4209. Pass((operand.tag));
  4210. END;
  4211. Pass((operand.op));
  4212. ELSIF IsOpenArray(parameter.type) THEN
  4213. Designate(expression,operand);
  4214. baseReg := operand.tag;
  4215. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4216. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4217. END;
  4218. Pass((operand.op)); (* address of the array *)
  4219. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4220. (* case 1
  4221. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4222. *)
  4223. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4224. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4225. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4226. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4227. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4228. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4229. arrayDestinationTag := sp;
  4230. (* case 1b
  4231. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4232. *)
  4233. IF expression IS SyntaxTree.IndexDesignator THEN
  4234. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4235. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4236. arrayDestinationDimension := dim;
  4237. Designate(expression,operand);
  4238. (* case 1a
  4239. P(...,A,...) push: push array descriptor to stack
  4240. *)
  4241. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4242. Designate(expression,operand);
  4243. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4244. i := 0;
  4245. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4246. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4247. INC(i);
  4248. END;
  4249. type := expression.type.resolved;
  4250. WHILE (i<dim) DO (* remaining static dimensions *)
  4251. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4252. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4253. ReleaseOperand(tmpOperand);
  4254. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4255. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4256. ReleaseOperand(tmpOperand);
  4257. INC(i);
  4258. END;
  4259. dimOp := IntermediateCode.Immediate(addressType,dim);
  4260. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4261. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4262. (* case 1d
  4263. P(...,T,...) push: process left arguments, create array descriptor with given number of dimensions from T on stack
  4264. + case 1e
  4265. P(.. PT() ... );
  4266. *)
  4267. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4268. Designate(expression,operand);
  4269. Dereference(operand,type.resolved,FALSE);
  4270. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4271. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4272. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4273. (* case 1f
  4274. P(...,S,...) push: create array descriptor to S on stack
  4275. case 1g
  4276. P(... PS()...)
  4277. *)
  4278. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4279. Designate(expression,operand);
  4280. FOR i := 0 TO dim-1 DO
  4281. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4282. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4283. ReleaseOperand(tmpOperand);
  4284. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4285. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4286. ReleaseOperand(tmpOperand);
  4287. END;
  4288. (*******
  4289. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4290. *)
  4291. arrayFlags := {StaticFlag};
  4292. IF dim = 1 THEN
  4293. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4294. ReleaseOperand(tmpOperand);
  4295. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4296. m := LONGINT(tmpOperand.op.intValue);
  4297. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4298. ELSIF dim = 2 THEN
  4299. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4300. ReleaseOperand(tmpOperand);
  4301. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4302. m := LONGINT(tmpOperand.op.intValue);
  4303. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4304. ReleaseOperand(tmpOperand);
  4305. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4306. n := LONGINT(tmpOperand.op.intValue);
  4307. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4308. INCL(arrayFlags,SmallMatrixFlag);
  4309. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4310. END;
  4311. END;
  4312. (*******)
  4313. dimOp := IntermediateCode.Immediate(addressType,dim);
  4314. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4315. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4316. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4317. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4318. baseType := SemanticChecker.ArrayBase(type,dim);
  4319. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4320. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4321. ELSE HALT(100);
  4322. END;
  4323. (* case 2
  4324. procedure P([left args], var A: array [*,*] of Type, [right args])
  4325. *)
  4326. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4327. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4328. (* case 2b
  4329. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4330. push: push reference to pushed array descriptor
  4331. post: remove array descriptor.
  4332. *)
  4333. IF expression IS SyntaxTree.IndexDesignator THEN
  4334. descriptorType := GetMathArrayDescriptorType(dim);
  4335. (* range type : no allocation possible, should be untraced *)
  4336. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4337. Symbol(variable,variableOp);
  4338. arrayDestinationTag := variableOp.op;
  4339. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4340. arrayDestinationDimension := dim;
  4341. NeedDescriptor := TRUE;
  4342. Designate(expression,operand);
  4343. Pass((operand.tag));
  4344. NeedDescriptor := FALSE;
  4345. (* case 2a
  4346. P(...,A,...)
  4347. push: push reference to array descriptor on stack
  4348. *)
  4349. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4350. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4351. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4352. INC(i);
  4353. END;
  4354. IF i = dim THEN
  4355. Designate(expression,operand);
  4356. Pass((operand.tag));
  4357. ELSE (* open-static *)
  4358. type := expression.type.resolved;
  4359. descriptorType := GetMathArrayDescriptorType(dim);
  4360. (* static array , cannot be reallocated, untraced !*)
  4361. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4362. Symbol(variable,variableOp);
  4363. arrayDestinationTag := variableOp.op;
  4364. Designate(expression,operand);
  4365. FOR i := 0 TO dim-1 DO
  4366. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4367. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4368. ReleaseOperand(tmpOperand);
  4369. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4370. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4371. ReleaseOperand(tmpOperand);
  4372. END;
  4373. dimOp := IntermediateCode.Immediate(addressType,dim);
  4374. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4375. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4376. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4377. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4378. baseType := SemanticChecker.ArrayBase(type,dim);
  4379. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4380. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4381. Pass((arrayDestinationTag));
  4382. END;
  4383. (* case 2d
  4384. P(...,T,...) push: emit dimension check, push T
  4385. *)
  4386. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4387. Designate(expression,operand);
  4388. Dereference(operand,type.resolved,FALSE);
  4389. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4390. Pass((operand.tag));
  4391. (* case 2f
  4392. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4393. push: push reference to pushed array descriptor
  4394. post: remove array descriptor
  4395. *)
  4396. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4397. descriptorType := GetMathArrayDescriptorType(dim);
  4398. (* static array -- cannot be reallocatated, untraced *)
  4399. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4400. Symbol(variable,variableOp);
  4401. arrayDestinationTag := variableOp.op;
  4402. Designate(expression,operand);
  4403. FOR i := 0 TO dim-1 DO
  4404. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4405. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4406. ReleaseOperand(tmpOperand);
  4407. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4408. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4409. ReleaseOperand(tmpOperand);
  4410. END;
  4411. (*
  4412. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4413. *)
  4414. arrayFlags := {StaticFlag};
  4415. IF dim = 1 THEN
  4416. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4417. ReleaseOperand(tmpOperand);
  4418. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4419. m := LONGINT(tmpOperand.op.intValue);
  4420. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4421. ELSIF dim = 2 THEN
  4422. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4423. ReleaseOperand(tmpOperand);
  4424. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4425. m := LONGINT(tmpOperand.op.intValue);
  4426. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4427. ReleaseOperand(tmpOperand);
  4428. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4429. n := LONGINT(tmpOperand.op.intValue);
  4430. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4431. INCL(arrayFlags,SmallMatrixFlag);
  4432. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4433. END;
  4434. END;
  4435. (*******)
  4436. dimOp := IntermediateCode.Immediate(addressType,dim);
  4437. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4438. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4439. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4440. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4441. baseType := SemanticChecker.ArrayBase(type,dim);
  4442. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4443. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4444. Pass((arrayDestinationTag));
  4445. ELSE HALT(100);
  4446. END;
  4447. (* case 3
  4448. procedure P([left args], [const] A: array [?] of Type, [right args])
  4449. *)
  4450. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4451. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4452. (* case 3b
  4453. P(...,A[a..b,c..d],...)
  4454. *)
  4455. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4456. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4457. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4458. Symbol(variable,variableOp);
  4459. LoadValue(variableOp,system.addressType);
  4460. ELSE
  4461. descriptorType := GetMathArrayDescriptorType(dim);
  4462. (* range -- cannot be reallocated *)
  4463. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4464. Symbol(variable,variableOp);
  4465. END;
  4466. arrayDestinationTag := variableOp.op;
  4467. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4468. arrayDestinationDimension := 0;
  4469. Designate(expression,operand);
  4470. Pass((operand.tag));
  4471. (* case 3a
  4472. P(...,A,...)
  4473. *)
  4474. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4475. i := 0;
  4476. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4477. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4478. INC(i);
  4479. END;
  4480. IF i = dim THEN
  4481. Designate(expression,operand);
  4482. Pass((operand.tag));
  4483. ELSE (* open-static *)
  4484. type := expression.type.resolved;
  4485. descriptorType := GetMathArrayDescriptorType(dim);
  4486. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4487. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4488. Symbol(variable,variableOp);
  4489. arrayDestinationTag := variableOp.op;
  4490. Designate(expression,operand);
  4491. FOR i := 0 TO dim-1 DO
  4492. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4493. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4494. ReleaseOperand(tmpOperand);
  4495. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4496. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4497. ReleaseOperand(tmpOperand);
  4498. END;
  4499. dimOp := IntermediateCode.Immediate(addressType,dim);
  4500. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4501. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4502. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4503. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4504. baseType := SemanticChecker.ArrayBase(type,dim);
  4505. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4506. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4507. Pass((arrayDestinationTag));
  4508. END;
  4509. (* case 3d
  4510. P(...,T,...)
  4511. case 3e
  4512. P(...,PT(...),...)
  4513. *)
  4514. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4515. Designate(expression,operand);
  4516. Dereference(operand,type.resolved,FALSE);
  4517. Pass((operand.tag));
  4518. (* case 3f
  4519. P(...,S,...)
  4520. case 3g
  4521. P(...,PS(...),...)
  4522. *)
  4523. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4524. descriptorType := GetMathArrayDescriptorType(dim);
  4525. (* static array does not need to be traced *)
  4526. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4527. Symbol(variable,variableOp);
  4528. arrayDestinationTag := variableOp.op;
  4529. Designate(expression,operand);
  4530. IF operand.op.type.length >1 THEN (* vector register *)
  4531. (* static array does not need to be traced *)
  4532. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4533. Symbol(variable2, variable2Op);
  4534. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4535. Emit(Mov(position,tmp, operand.op));
  4536. ReleaseOperand(operand);
  4537. Symbol(variable2, operand);
  4538. END;
  4539. FOR i := 0 TO dim-1 DO
  4540. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4541. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4542. ReleaseOperand(tmpOperand);
  4543. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4544. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4545. ReleaseOperand(tmpOperand);
  4546. END;
  4547. dimOp := IntermediateCode.Immediate(addressType,dim);
  4548. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4549. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4550. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4551. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4552. baseType := SemanticChecker.ArrayBase(type,dim);
  4553. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4554. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4555. Pass((arrayDestinationTag));
  4556. ELSE HALT(100);
  4557. END;
  4558. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4559. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4560. (* case 4b
  4561. P(...,A[a..b,c..d],...)
  4562. *)
  4563. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4564. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4565. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4566. Symbol(variable,variableOp);
  4567. LoadValue(variableOp,system.addressType);
  4568. ELSE
  4569. descriptorType := GetMathArrayDescriptorType(dim);
  4570. (* range array -- cannot be allocated *)
  4571. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4572. Symbol(variable,variableOp);
  4573. END;
  4574. arrayDestinationTag := variableOp.op;
  4575. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4576. arrayDestinationDimension := 0;
  4577. Designate(expression,operand);
  4578. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4579. Symbol(variable,variableOp);
  4580. ELSE
  4581. (* alias to range -- untraced *)
  4582. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4583. Symbol(variable,variableOp);
  4584. MakeMemory(tmp,variableOp.op,addressType,0);
  4585. Emit(Mov(position,tmp,operand.tag));
  4586. ReleaseIntermediateOperand(tmp);
  4587. END;
  4588. Pass((variableOp.op));
  4589. ReleaseOperand(variableOp);
  4590. (* case 4a
  4591. P(...,A,...)
  4592. *)
  4593. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4594. i := 0;
  4595. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4596. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4597. INC(i);
  4598. END;
  4599. IF i = dim THEN
  4600. Designate(expression,operand);
  4601. arrayDestinationTag := operand.tag;
  4602. ELSE (* open-static *)
  4603. type := expression.type.resolved;
  4604. descriptorType := GetMathArrayDescriptorType(dim);
  4605. (* static array -- untraced *)
  4606. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4607. Symbol(variable,variableOp);
  4608. arrayDestinationTag := variableOp.op;
  4609. Designate(expression,operand);
  4610. FOR i := 0 TO dim-1 DO
  4611. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4612. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4613. ReleaseOperand(tmpOperand);
  4614. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4615. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4616. ReleaseOperand(tmpOperand);
  4617. END;
  4618. dimOp := IntermediateCode.Immediate(addressType,dim);
  4619. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4620. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4621. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4622. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4623. baseType := SemanticChecker.ArrayBase(type,dim);
  4624. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4625. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4626. END;
  4627. (* tensor alias to open array -- untraced *)
  4628. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4629. Symbol(variable,variableOp);
  4630. MakeMemory(tmp,variableOp.op,addressType,0);
  4631. Emit(Mov(position,tmp,arrayDestinationTag));
  4632. ReleaseIntermediateOperand(tmp);
  4633. Pass((variableOp.op));
  4634. ReleaseOperand(variableOp);
  4635. (* case 4d
  4636. P(...,T,...)
  4637. *)
  4638. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4639. Designate(expression,operand);
  4640. Pass((operand.op));
  4641. (* case 4f
  4642. P(...,S,...)
  4643. *)
  4644. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4645. descriptorType := GetMathArrayDescriptorType(dim);
  4646. (* static array -- cannot be reallocated, untraced *)
  4647. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4648. Symbol(variable,variableOp);
  4649. arrayDestinationTag := variableOp.op;
  4650. Designate(expression,operand);
  4651. FOR i := 0 TO dim-1 DO
  4652. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4653. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4654. ReleaseOperand(tmpOperand);
  4655. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4656. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4657. ReleaseOperand(tmpOperand);
  4658. END;
  4659. dimOp := IntermediateCode.Immediate(addressType,dim);
  4660. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4661. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4662. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4663. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4664. baseType := SemanticChecker.ArrayBase(type,dim);
  4665. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4666. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4667. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4668. Symbol(variable,variableOp);
  4669. MakeMemory(tmp,variableOp.op,addressType,0);
  4670. Emit(Mov(position,tmp,arrayDestinationTag));
  4671. ReleaseIntermediateOperand(tmp);
  4672. Pass((variableOp.op));
  4673. ReleaseOperand(variableOp);
  4674. ELSE HALT(100);
  4675. END;
  4676. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4677. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4678. Designate(expression,operand);
  4679. IF operand.op.type.length > 1 THEN
  4680. Emit(Push(position, operand.op));
  4681. ELSE
  4682. size := system.SizeOf(type);
  4683. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4684. size := ToMemoryUnits(system,size);
  4685. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4686. arrayDestinationTag := sp;
  4687. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4688. END;
  4689. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4690. Designate(expression,operand);
  4691. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4692. (* static array no pointer *)
  4693. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4694. Symbol(variable,variableOp);
  4695. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4696. Emit(Mov(position,tmp,operand.op));
  4697. Emit(Push(position,variableOp.op));
  4698. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4699. Pass((operand.op));
  4700. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4701. END;
  4702. ELSE HALT(200)
  4703. END;
  4704. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4705. IF parameter.kind = SyntaxTree.VarParameter THEN
  4706. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4707. Designate(expression, operand);
  4708. Pass((operand.op));
  4709. ELSE
  4710. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4711. Evaluate(expression, operand);
  4712. Pass((operand.extra)); (* step *)
  4713. Pass((operand.tag)); (* last *)
  4714. Pass((operand.op)) (* first *)
  4715. END
  4716. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4717. IF parameter.kind = SyntaxTree.VarParameter THEN
  4718. Designate(expression, operand);
  4719. Pass((operand.op));
  4720. ELSE
  4721. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4722. Evaluate(expression, operand);
  4723. Pass((operand.tag)); (* real part *)
  4724. Pass((operand.op)) (* imaginary part *)
  4725. END
  4726. ELSE
  4727. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4728. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4729. Designate(expression,operand);
  4730. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4731. (* stack allocation *)
  4732. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4733. (*! parameter alignment to be discussed ... *)
  4734. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4735. size := type(SyntaxTree.StringType).length;
  4736. END;
  4737. IF backend.cooperative & parameter.NeedsTrace() THEN
  4738. dst := NewRegisterOperand (addressType);
  4739. Emit(Mov(position,dst, sp));
  4740. IntermediateCode.InitImmediate(null, byteType, 0);
  4741. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4742. ReleaseIntermediateOperand(dst);
  4743. SaveRegisters();ReleaseUsedRegisters(saved);
  4744. (* register dst has been freed before SaveRegisters already *)
  4745. CallAssignMethod(dst, operand.op, parameter.type);
  4746. RestoreRegisters(saved);
  4747. END;
  4748. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4749. ELSIF IsOpenArray(parameter.type) THEN
  4750. Designate(expression,operand);
  4751. baseReg := operand.tag;
  4752. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4753. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4754. END;
  4755. Pass((operand.op)); (* address of the array *)
  4756. ELSIF IsDelegate(parameter.type) THEN
  4757. Evaluate(expression,operand);
  4758. IF backend.cooperative & parameter.NeedsTrace() THEN
  4759. Emit(Push(position, nil));
  4760. dst := NewRegisterOperand (addressType);
  4761. Emit(Mov(position,dst, sp));
  4762. ReleaseIntermediateOperand(dst);
  4763. SaveRegisters();ReleaseUsedRegisters(saved);
  4764. Emit(Push(position, dst));
  4765. (* register dst has been freed before SaveRegisters already *)
  4766. Emit(Push(position, operand.tag));
  4767. CallThis(position,"GarbageCollector","Assign",2);
  4768. RestoreRegisters(saved);
  4769. ELSE
  4770. Pass((operand.tag));
  4771. END;
  4772. Pass((operand.op));
  4773. ELSE
  4774. Evaluate(expression,operand);
  4775. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4776. Emit(Push(position, nil));
  4777. dst := NewRegisterOperand (addressType);
  4778. Emit(Mov(position,dst, sp));
  4779. ReleaseIntermediateOperand(dst);
  4780. SaveRegisters();ReleaseUsedRegisters(saved);
  4781. Emit(Push(position, dst));
  4782. (* register dst has been freed before SaveRegisters already *)
  4783. Emit(Push(position, operand.op));
  4784. CallThis(position,"GarbageCollector","Assign",2);
  4785. RestoreRegisters(saved);
  4786. ELSE
  4787. Pass((operand.op));
  4788. END;
  4789. END;
  4790. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4791. Evaluate(expression,operand);
  4792. Pass((operand.op));
  4793. ELSE (* var parameter *)
  4794. Designate(expression,operand);
  4795. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4796. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4797. Pass((operand.tag));
  4798. END;
  4799. END;
  4800. Pass((operand.op));
  4801. END;
  4802. END;
  4803. (* TODO: needed? *)
  4804. arrayDestinationTag := oldArrayDestinationTag;
  4805. arrayDestinationDimension := oldArrayDestinationDimension;
  4806. IF needsParameterBackup THEN
  4807. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4808. ReuseCopy(parameterBackup, operand.op)
  4809. END;
  4810. ReleaseOperand(operand);
  4811. IF Trace THEN TraceExit("PushParameter") END;
  4812. END PushParameter;
  4813. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4814. VAR prevConditional: BOOLEAN;
  4815. BEGIN
  4816. prevConditional := conditional;
  4817. conditional := FALSE;
  4818. IF (x.result # NIL) & ( x.result IS SyntaxTree.SymbolDesignator) & (x.result(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) & (x.result(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).useRegister) THEN
  4819. Expression(x.result); (* use register *)
  4820. END;
  4821. Statement(x.statement);
  4822. conditional := prevConditional;
  4823. IF x.result # NIL THEN Expression(x.result) END;
  4824. IF (x.result # NIL) & (x.result IS SyntaxTree.SymbolDesignator) & (x.result(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) & (x.result(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).useRegister) THEN
  4825. ReleaseIntermediateOperand(result.op);
  4826. END;
  4827. END VisitStatementDesignator;
  4828. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4829. VAR
  4830. procedure: SyntaxTree.Procedure;
  4831. procedureType: SyntaxTree.ProcedureType;
  4832. wasInline: BOOLEAN;
  4833. actualParameters: SyntaxTree.ExpressionList;
  4834. formalParameter: SyntaxTree.Parameter;
  4835. actualParameter: SyntaxTree.Expression;
  4836. i: LONGINT;
  4837. localVariable: SyntaxTree.Variable;
  4838. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4839. src, dest: Operand;
  4840. prevInlineExit : Label;
  4841. prevMapper: SymbolMapper;
  4842. tooComplex: BOOLEAN;
  4843. resultDesignator: SyntaxTree.Expression;
  4844. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4845. BEGIN
  4846. IF e = NIL THEN RETURN TRUE
  4847. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4848. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4849. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4850. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4851. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4852. ELSE RETURN FALSE
  4853. END;
  4854. END SimpleExpression;
  4855. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4856. BEGIN
  4857. RETURN checker.CanPassInRegister(type)
  4858. END FitsInRegister;
  4859. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4860. VAR
  4861. variable: SyntaxTree.Variable;
  4862. variableDesignator: SyntaxTree.Designator;
  4863. BEGIN
  4864. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  4865. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  4866. variableDesignator.SetType(type);
  4867. RETURN variableDesignator
  4868. END GetTemp;
  4869. BEGIN
  4870. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4871. wasInline := currentIsInline;
  4872. prevInlineExit := currentInlineExit;
  4873. prevMapper := currentMapper;
  4874. currentInlineExit := NewLabel();
  4875. tooComplex := FALSE;
  4876. NEW(currentMapper);
  4877. currentIsInline := TRUE;
  4878. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4879. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4880. formalParameter := procedureType.firstParameter;
  4881. actualParameters := x.parameters;
  4882. i := 0;
  4883. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4884. actualParameter := actualParameters.GetExpression(i);
  4885. IF actualParameter.resolved # NIL THEN
  4886. actualParameter := actualParameter.resolved
  4887. END;
  4888. (*
  4889. if expression is simple and can be passed immediately
  4890. or if type fits in register then we can proceed
  4891. otherwise we escape to ordinary procedure call.
  4892. *)
  4893. (* cases where the expression can be mapped identically *)
  4894. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4895. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  4896. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4897. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4898. (*
  4899. Assign(variableDesignator, actualParameter);
  4900. *)
  4901. Evaluate(actualParameter, src);
  4902. Designate(variableDesignator, dest);
  4903. Emit(Mov(x.position, dest.op, src.op));
  4904. ReleaseOperand(dest);
  4905. ReleaseOperand(src);
  4906. (* the src operand should now have been completely released ! *)
  4907. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  4908. ELSE tooComplex := TRUE
  4909. END;
  4910. (*
  4911. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4912. currentMapper.Add(formalParameter, actualParameter, NIL);
  4913. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4914. variableDesignator := GetTemp(system.addressType, FALSE);
  4915. Designate(actualParameter, src);
  4916. Designate(variableDesignator, dest);
  4917. IntermediateCode.MakeMemory(dest.op,addressType);
  4918. Emit(Mov(x.position, dest.op, src.op));
  4919. ReleaseOperand(dest);
  4920. IF src.tag.mode # IntermediateCode.Undefined THEN
  4921. tagDesignator := GetTemp(system.addressType, FALSE);
  4922. Designate(tagDesignator, dest);
  4923. IntermediateCode.MakeMemory(dest.op,addressType);
  4924. Emit(Mov(x.position, dest.op, src.op));
  4925. END;
  4926. ReleaseOperand(dest); ReleaseOperand(src);
  4927. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4928. END;
  4929. *)
  4930. formalParameter := formalParameter.nextParameter;
  4931. INC(i);
  4932. END;
  4933. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4934. IF resultDesignator # NIL THEN
  4935. returnDesignator := resultDesignator
  4936. ELSE
  4937. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4938. END;
  4939. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  4940. END;
  4941. localVariable := procedure.procedureScope.firstVariable;
  4942. WHILE ~tooComplex & (localVariable # NIL) DO
  4943. variableDesignator := GetTemp(localVariable.type, FALSE);
  4944. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  4945. localVariable := localVariable.nextVariable;
  4946. END;
  4947. IF ~tooComplex THEN
  4948. VisitStatementBlock(procedure.procedureScope.body);
  4949. SetLabel(currentInlineExit);
  4950. IF procedureType.returnType # NIL THEN
  4951. Designate(returnDesignator, result);
  4952. IF conditional THEN
  4953. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4954. ValueToCondition(result)
  4955. END;
  4956. END;
  4957. END;
  4958. currentMapper := prevMapper;
  4959. currentInlineExit := prevInlineExit;
  4960. currentIsInline := wasInline;
  4961. RETURN ~tooComplex
  4962. END InlineProcedureCall;
  4963. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4964. VAR
  4965. parameters: SyntaxTree.ExpressionList;
  4966. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4967. designator: SyntaxTree.Designator;
  4968. procedureType: SyntaxTree.ProcedureType;
  4969. formalParameter: SyntaxTree.Parameter;
  4970. operand, returnValue: Operand;
  4971. reg, size, mask, dest: IntermediateCode.Operand;
  4972. saved,saved2: RegisterEntry;
  4973. symbol: SyntaxTree.Symbol;
  4974. variable: SyntaxTree.Variable;
  4975. i, parametersSize, returnTypeSize : LONGINT;
  4976. structuredReturnType: BOOLEAN;
  4977. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4978. tempVariableDesignator: SyntaxTree.Designator;
  4979. gap, alignment: LONGINT; (*fld*)
  4980. (* TODO: remove unnecessary backup variables *)
  4981. oldResult: Operand;
  4982. oldCurrentScope: SyntaxTree.Scope;
  4983. oldArrayDestinationTag: IntermediateCode.Operand;
  4984. oldArrayDestinationDimension: LONGINT;
  4985. oldConstantDeclaration: SyntaxTree.Symbol;
  4986. oldDestination: IntermediateCode.Operand;
  4987. oldCurrentLoop: Label;
  4988. oldConditional: BOOLEAN;
  4989. oldTrueLabel, oldFalseLabel: Label;
  4990. oldLocked: BOOLEAN;
  4991. usedRegisters,oldUsedRegisters: RegisterEntry;
  4992. return: IntermediateCode.Operand;
  4993. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4994. arg: IntermediateCode.Operand;
  4995. dummy: IntermediateCode.Operand;
  4996. recordType: SyntaxTree.RecordType;
  4997. operatorSelectionProcedureOperand: Operand;
  4998. operatorSelectionProcedure: SyntaxTree.Procedure;
  4999. fingerPrint: SyntaxTree.FingerPrint;
  5000. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5001. identifierNumber: LONGINT;
  5002. parameterRegister: Backend.Registers;
  5003. parameterRegisters: LONGINT;
  5004. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5005. procedure: SyntaxTree.Procedure;
  5006. PROCEDURE BackupGlobalState;
  5007. BEGIN
  5008. oldResult := result;
  5009. oldCurrentScope := currentScope;
  5010. oldArrayDestinationTag := arrayDestinationTag;
  5011. oldArrayDestinationDimension := arrayDestinationDimension;
  5012. oldConstantDeclaration := constantDeclaration;
  5013. oldDestination := destination;
  5014. oldCurrentLoop := currentLoop;
  5015. oldConditional := conditional;
  5016. oldTrueLabel := trueLabel;
  5017. oldFalseLabel := falseLabel;
  5018. oldLocked := locked;
  5019. oldUsedRegisters := usedRegisters
  5020. END BackupGlobalState;
  5021. PROCEDURE RestoreGlobalState;
  5022. BEGIN
  5023. result := oldResult;
  5024. currentScope := oldCurrentScope;
  5025. arrayDestinationTag := oldArrayDestinationTag;
  5026. arrayDestinationDimension := oldArrayDestinationDimension;
  5027. constantDeclaration := oldConstantDeclaration;
  5028. destination := oldDestination;
  5029. currentLoop := oldCurrentLoop;
  5030. conditional := oldConditional;
  5031. trueLabel := oldTrueLabel;
  5032. falseLabel := oldFalseLabel;
  5033. locked := oldLocked;
  5034. usedRegisters := oldUsedRegisters
  5035. END RestoreGlobalState;
  5036. (** do preparations before parameter push for array-structured object types (ASOTs):
  5037. if ASOT is passed as VAR parameter:
  5038. - allocate temporary variable of math array type
  5039. - copy contents of ASOT to be passed to temporary variable
  5040. - use temporary variable as the actual parameter instead
  5041. - create and store a write-back call in a list (an index operator call that writes the contents of the temp. variable back into the ASOT)
  5042. **)
  5043. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5044. VAR
  5045. expression: SyntaxTree.Expression;
  5046. BEGIN
  5047. IF actualParameter IS SyntaxTree.Designator THEN
  5048. designator := actualParameter(SyntaxTree.Designator);
  5049. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5050. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5051. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5052. ASSERT(checker # NIL);
  5053. checker.SetCurrentScope(currentScope);
  5054. (* allocate temporary variable *)
  5055. ASSERT(actualParameter.type # NIL);
  5056. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5057. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5058. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5059. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5060. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5061. ASSERT(tempVariableDesignator.type # NIL);
  5062. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5063. (* copy math array stored in actual parameter to temporary variable *)
  5064. BackupGlobalState;
  5065. AssignMathArray(tempVariableDesignator, actualParameter);
  5066. RestoreGlobalState;
  5067. (* use temporary variable as actual parameter instead of the original one *)
  5068. actualParameter := tempVariableDesignator;
  5069. (* create write-back call and store it in linked list *)
  5070. (* create new list entry *)
  5071. IF firstWriteBackCall = NIL THEN
  5072. NEW(firstWriteBackCall);
  5073. currentWriteBackCall := firstWriteBackCall
  5074. ELSE
  5075. ASSERT(currentWriteBackCall # NIL);
  5076. NEW(currentWriteBackCall.next);
  5077. currentWriteBackCall := currentWriteBackCall.next
  5078. END;
  5079. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5080. ASSERT(expression.type = NIL);
  5081. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5082. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5083. (* prepare writeback for any other "normal" indexer *)
  5084. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5085. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5086. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5087. Assign(tempVariableDesignator, actualParameter);
  5088. actualParameter := tempVariableDesignator;
  5089. IF firstWriteBackCall = NIL THEN
  5090. NEW(firstWriteBackCall);
  5091. currentWriteBackCall := firstWriteBackCall
  5092. ELSE
  5093. ASSERT(currentWriteBackCall # NIL);
  5094. NEW(currentWriteBackCall.next);
  5095. currentWriteBackCall := currentWriteBackCall.next
  5096. END;
  5097. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5098. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5099. END
  5100. END
  5101. END PrepareParameter;
  5102. BEGIN
  5103. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5104. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5105. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5106. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5107. IF InlineProcedureCall(x) THEN
  5108. RETURN
  5109. ELSE
  5110. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5111. END
  5112. END;
  5113. END;
  5114. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5115. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5116. dest := destination; destination := emptyOperand;
  5117. SaveRegisters();ReleaseUsedRegisters(saved);
  5118. parameters := x.parameters;
  5119. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5120. (* an operator is called *)
  5121. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5122. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  5123. (* check if a dynamic operator call should be performed *)
  5124. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5125. ELSE
  5126. isCallOfDynamicOperator := FALSE
  5127. END;
  5128. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5129. Emit(Push(position, ap));
  5130. END;
  5131. alignment := procedureType.stackAlignment;
  5132. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize = 64) THEN
  5133. alignment := 16 (* bytes *);
  5134. END;
  5135. IF alignment > 1 THEN
  5136. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5137. Emit(Mov(position,reg, sp));
  5138. gap := ParametersSize(system, procedureType, FALSE);
  5139. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5140. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN
  5141. gap := 4*ToMemoryUnits(system,system.addressSize); (* at least four registers get pushed*)
  5142. END;
  5143. END;
  5144. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  5145. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5146. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5147. Emit(And(position,sp, sp, mask));
  5148. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5149. Emit(Push(position,reg));
  5150. (*
  5151. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  5152. Emit(Mov(position,mem,reg));
  5153. *)
  5154. ReleaseIntermediateOperand(reg);
  5155. END;
  5156. IF SysvABI(procedureType.callingConvention) & (system.addressSize = 32) THEN
  5157. (* align stack to 16-byte boundary *)
  5158. IntermediateCode.InitImmediate(mask,addressType,-16);
  5159. Emit(And(position,sp, sp, mask));
  5160. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5161. IF gap # 0 THEN
  5162. IntermediateCode.InitImmediate(size,addressType,gap);
  5163. Emit(Sub(position,sp,sp,size))
  5164. END;
  5165. END;
  5166. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5167. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5168. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5169. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5170. ELSE
  5171. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5172. END;
  5173. Evaluate(x.left, operand);
  5174. IF symbol IS SyntaxTree.Procedure THEN
  5175. IF (procedureType.selfParameter # NIL) THEN
  5176. Emit(Push(position,operand.tag));
  5177. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5178. Emit(Push(position,operand.tag));
  5179. ELSIF (procedureType.isDelegate) THEN
  5180. Emit(Push(position,operand.tag));
  5181. END;
  5182. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5183. IF (procedureType.selfParameter # NIL) THEN
  5184. Emit(Push(position,operand.tag));
  5185. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5186. Emit(Push(position,operand.tag));
  5187. END;
  5188. ELSE HALT(200);
  5189. END;
  5190. ReleaseIntermediateOperand(operand.tag);
  5191. operand.tag := emptyOperand;
  5192. (* determine if a structured return type is needed *)
  5193. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5194. IF structuredReturnType THEN
  5195. IF resultDesignator # NIL THEN
  5196. d := resultDesignator;
  5197. ELSE
  5198. (* temporary result that might be allocated, must potentially be traced *)
  5199. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5200. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5201. d.SetType(variable.type);
  5202. END;
  5203. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5204. Designate(d,returnValue);
  5205. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5206. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5207. Emit(Push(position,size));
  5208. Emit(Push(position,returnValue.op));
  5209. ReleaseOperand(returnValue);
  5210. ELSE*)
  5211. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5212. (*
  5213. END;
  5214. *)
  5215. END;
  5216. firstWriteBackCall := NIL; (* reset write-back call list *)
  5217. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5218. parameterRegister := backend.GetParameterRegisters(procedureType.callingConvention);
  5219. IF parameterRegister = NIL THEN parameterRegisters := 0
  5220. ELSE parameterRegisters := LEN(parameterRegister)
  5221. END;
  5222. passByRegister := parameterRegisters > 0;
  5223. registerNumber := 0;
  5224. formalParameter := procedureType.lastParameter;
  5225. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5226. actualParameter := parameters.GetExpression(i);
  5227. PrepareParameter(actualParameter, formalParameter);
  5228. IF passByRegister & (i < parameterRegisters) THEN
  5229. IF ~PassInRegister(formalParameter) THEN
  5230. Error(actualParameter.position,"cannot be passed by register")
  5231. ELSE
  5232. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,parameterRegister[i]);
  5233. END;
  5234. INC(registerNumber);
  5235. ELSE
  5236. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5237. END;
  5238. formalParameter := formalParameter.prevParameter;
  5239. END;
  5240. IF passByRegister (* & (registerNumber > 0)*) & ~SysvABI(procedureType.callingConvention) THEN
  5241. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5242. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5243. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5244. END;
  5245. ELSE
  5246. hasDynamicOperands := FALSE;
  5247. formalParameter := procedureType.firstParameter;
  5248. FOR i := 0 TO parameters.Length() - 1 DO
  5249. actualParameter := parameters.GetExpression(i);
  5250. IF formalParameter # NIL THEN (* TENTATIVE *)
  5251. PrepareParameter(actualParameter, formalParameter);
  5252. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5253. ASSERT(i < 2);
  5254. hasDynamicOperands := TRUE;
  5255. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5256. ELSE
  5257. IF passByRegister & (registerNumber > 0) THEN
  5258. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5259. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5260. END;
  5261. passByRegister := FALSE;
  5262. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5263. END;
  5264. formalParameter := formalParameter.nextParameter;
  5265. END;
  5266. END;
  5267. END;
  5268. IF symbol IS SyntaxTree.Procedure THEN
  5269. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5270. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5271. Emit(Push(position,reg));
  5272. ReleaseIntermediateOperand(reg);
  5273. END;
  5274. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5275. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5276. parametersSize := ParametersSize(system,procedureType,FALSE);
  5277. END;
  5278. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5279. (*
  5280. dynamic operator overloading:
  5281. first push parameters, regularly:
  5282. [self]
  5283. par1
  5284. par2
  5285. then push parameters for GetOperator
  5286. identifier
  5287. ptr1
  5288. tag
  5289. ptr2
  5290. tag
  5291. call GetOperatorRuntimeProc
  5292. call Operator
  5293. *)
  5294. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5295. (* push ID *)
  5296. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5297. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5298. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5299. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5300. formalParameter := procedureType.firstParameter;
  5301. FOR i := 0 TO parameters.Length() - 1 DO
  5302. IF formalParameter.access # SyntaxTree.Hidden THEN
  5303. ASSERT(i < 2);
  5304. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5305. (* push pointer *)
  5306. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5307. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5308. (* add dereference *)
  5309. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5310. (*! better: do refer to stack above than using parameter backups !!*)
  5311. ReleaseIntermediateOperand(parameterBackups[i]);
  5312. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5313. END;
  5314. Emit(Push(position,parameterBackups[i]));
  5315. ReleaseIntermediateOperand(parameterBackups[i]);
  5316. (* push typetag *)
  5317. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5318. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5319. arg := TypeDescriptorAdr(recordType);
  5320. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5321. Emit(Push(position,arg));
  5322. ELSE
  5323. (* push 'NonPointer' *)
  5324. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5325. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5326. (* push fingerprint *)
  5327. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5328. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5329. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5330. END
  5331. END;
  5332. formalParameter := formalParameter.nextParameter
  5333. END;
  5334. (* for unary operators: complete the information for the second parameter *)
  5335. IF procedureType.numberParameters < 2 THEN
  5336. (* push 'NonPointer' *)
  5337. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5338. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5339. (* push 'NoType' *)
  5340. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5341. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5342. END;
  5343. (* call operator selection procedure *)
  5344. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5345. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5346. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5347. ReleaseOperand(operatorSelectionProcedureOperand);
  5348. (* use the address that the operator selection procedure returned as the target address of the call *)
  5349. InitOperand(operand, ModeValue);
  5350. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5351. Emit(Result(position,operand.op))
  5352. END
  5353. END;
  5354. ReleaseParameterRegisters();
  5355. IF backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5356. SaveRegisters();ReleaseUsedRegisters(saved2);
  5357. CallThis(position,"Objects","LeaveA2",0);
  5358. RestoreRegisters(saved2);
  5359. END;
  5360. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR SysvABI(procedureType.callingConvention) THEN
  5361. Emit(Call(position,operand.op,0));
  5362. ELSE
  5363. Emit(Call(position,operand.op,parametersSize));
  5364. END;
  5365. ReleaseOperand(operand);
  5366. IF procedureType.noReturn THEN
  5367. EmitTrap(position,NoReturnTrap);
  5368. END;
  5369. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5370. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5371. Emit(Result(position,return));
  5372. END;
  5373. IF backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5374. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5375. Emit(Push(position, return));
  5376. CallThis(position,"Objects","ReenterA2",0);
  5377. Emit(Pop(position, return));
  5378. ELSE
  5379. CallThis(position,"Objects","ReenterA2",0);
  5380. END;
  5381. END;
  5382. (* === return parameter space === *)
  5383. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5384. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5385. (* cleanup all space for all parameters *)
  5386. IF parametersSize < 32 THEN
  5387. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5388. parametersSize := 32
  5389. END;
  5390. size := IntermediateCode.Immediate(addressType,parametersSize);
  5391. Emit(Add(position,sp,sp,size))
  5392. END;
  5393. IF SysvABI(procedureType.callingConvention) THEN
  5394. IF passByRegister THEN
  5395. IF parameters.Length() > parameterRegisters THEN
  5396. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5397. ELSE
  5398. parametersSize := 0
  5399. END;
  5400. ELSE
  5401. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5402. INC( parametersSize, (-parametersSize) MOD 16 )
  5403. END;
  5404. IF parametersSize > 0 THEN
  5405. size := IntermediateCode.Immediate(addressType,parametersSize);
  5406. Emit(Add(position,sp,sp,size))
  5407. END;
  5408. END;
  5409. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5410. IF structuredReturnType THEN
  5411. (* stack pointer rewinding done by callee
  5412. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5413. Emit(Add(position,sp,sp,size));
  5414. *)
  5415. RestoreRegisters(saved);
  5416. InitOperand(result,ModeReference);
  5417. Symbol(variable,result);
  5418. ELSE
  5419. RestoreRegisters(saved);
  5420. InitOperand(result,ModeValue);
  5421. result.op := return;
  5422. END;
  5423. END;
  5424. IF alignment > 1 THEN
  5425. Emit(Pop(position,sp));
  5426. END;
  5427. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5428. Emit(Pop(position, ap));
  5429. END;
  5430. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5431. ValueToCondition(result);
  5432. END;
  5433. destination := dest;
  5434. (* perform all write-back calls in the list *)
  5435. BackupGlobalState;
  5436. currentWriteBackCall := firstWriteBackCall;
  5437. WHILE currentWriteBackCall # NIL DO
  5438. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5439. currentWriteBackCall := currentWriteBackCall.next
  5440. END;
  5441. RestoreGlobalState;
  5442. (* TENATIVE *)
  5443. (*
  5444. IF isOperatorCall THEN
  5445. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5446. END;
  5447. *)
  5448. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5449. END VisitProcedureCallDesignator;
  5450. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5451. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5452. td: SyntaxTree.Symbol;
  5453. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5454. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5455. BEGIN
  5456. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5457. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5458. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5459. variable.SetType(system.anyType);
  5460. scope.AddVariable(variable);
  5461. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5462. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5463. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5464. typeDeclaration.SetScope(module.module.moduleScope);
  5465. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5466. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5467. END;
  5468. RETURN hiddenPointerType;
  5469. END GetHiddenPointerType;
  5470. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5471. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5472. BEGIN
  5473. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5474. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5475. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5476. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5477. scope.AddVariable(variable);
  5478. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5479. variable.SetType(system.anyType);
  5480. scope.AddVariable(variable);
  5481. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5482. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5483. typeDeclaration.SetDeclaredType(delegatePointerType);
  5484. typeDeclaration.SetScope(module.module.moduleScope);
  5485. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5486. delegatePointerType.SetState(SyntaxTree.Resolved);
  5487. END;
  5488. RETURN delegatePointerType
  5489. END GetDelegateType;
  5490. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5491. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5492. such as in VAR a: RECORD ... END;
  5493. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5494. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5495. *)
  5496. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5497. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5498. BEGIN (* no code emission *)
  5499. source := NIL;
  5500. x := x.resolved;
  5501. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5502. x := GetHiddenPointerType();
  5503. ELSIF IsDelegate(x) THEN
  5504. x := GetDelegateType();
  5505. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5506. ELSE HALT(200);
  5507. END;
  5508. td := x.typeDeclaration;
  5509. IF td = NIL THEN
  5510. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5511. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5512. ASSERT(td # NIL);
  5513. END;
  5514. IF newObjectFile THEN
  5515. GetCodeSectionNameForSymbol(td,name);
  5516. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5517. meta.CheckTypeDeclaration(x);
  5518. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5519. ELSE
  5520. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5521. END;
  5522. IF backend.cooperative OR meta.simple THEN
  5523. offset := 0;
  5524. ELSE
  5525. IF x IS SyntaxTree.CellType THEN
  5526. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5527. IF baseRecord = NIL THEN
  5528. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5529. ELSE
  5530. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5531. END;
  5532. ELSE
  5533. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5534. END;
  5535. END;
  5536. ELSE
  5537. offset := 0;
  5538. source := module.allSections.FindBySymbol(td); (*TODO*)
  5539. IF source = NIL THEN
  5540. null := 0;
  5541. GetCodeSectionNameForSymbol(td,name);
  5542. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5543. Basic.SuffixSegmentedName (name, module.module.name);
  5544. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5545. IntermediateCode.InitImmediate(op,addressType,0);
  5546. source(IntermediateCode.Section).Emit(Data(position,op));
  5547. source.SetReferenced(FALSE)
  5548. ELSE
  5549. name := source.name;
  5550. END;
  5551. END;
  5552. RETURN td
  5553. END GetBackendType;
  5554. BEGIN
  5555. (*td := t.typeDeclaration;*)
  5556. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5557. (*
  5558. IF t IS SyntaxTree.PointerType THEN
  5559. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5560. ELSE
  5561. source := GetBackendType(t);
  5562. END;
  5563. *)
  5564. IF newObjectFile THEN
  5565. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5566. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5567. IntermediateCode.SetOffset(res,offset);
  5568. ELSE
  5569. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5570. END;
  5571. (*
  5572. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5573. make memory should be used when tag is used, not earlier
  5574. *)
  5575. RETURN res
  5576. END TypeDescriptorAdr;
  5577. (*
  5578. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5579. VAR result: IntermediateCode.Operand;
  5580. BEGIN
  5581. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5582. operand.tag := TypeDescriptorAdr(operand.type);
  5583. IntermediateCode.MakeMemory(operand.tag,addressType);
  5584. UseIntermediateOperand(operand.tag);
  5585. END;
  5586. END MakeTypeTag;
  5587. *)
  5588. PROCEDURE ProfilerInit;
  5589. VAR reg: IntermediateCode.Operand;
  5590. BEGIN
  5591. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5592. Emit(Call(position,reg,0));
  5593. END ProfilerInit;
  5594. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5595. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5596. BEGIN
  5597. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5598. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5599. THEN
  5600. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5601. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5602. Emit(Push(position,reg));
  5603. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5604. Emit(Push(position,reg));
  5605. StaticCallOperand(result,procedure);
  5606. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5607. ReleaseOperand(result);
  5608. END;
  5609. END ProfilerEnterExit;
  5610. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5611. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5612. BEGIN
  5613. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5614. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5615. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5616. profileInit.Emit(Push(position,reg));
  5617. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5618. profileInit.Emit(Push(position,reg));
  5619. NEW(string, LEN(name)); COPY(name, string^);
  5620. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5621. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5622. sv.SetType(type);
  5623. Designate(sv,result);
  5624. profileInit.Emit(Push(position,result.tag));
  5625. profileInit.Emit(Push(position,result.op));
  5626. StaticCallOperand(result,procedure);
  5627. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5628. ReleaseOperand(result);
  5629. END;
  5630. END ProfilerAddProcedure;
  5631. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5632. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5633. BEGIN
  5634. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5635. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5636. profileInit.Emit(Push(position,reg));
  5637. profileInitPatchPosition := profileInit.pc;
  5638. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5639. NEW(string, LEN(name)); COPY(name, string^);
  5640. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5641. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5642. sv.SetType(type);
  5643. Designate(sv,result);
  5644. profileInit.Emit(Push(position,result.tag));
  5645. profileInit.Emit(Push(position,result.op));
  5646. StaticCallOperand(result,procedure);
  5647. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5648. ReleaseOperand(result);
  5649. END;
  5650. END ProfilerAddModule;
  5651. PROCEDURE ProfilerPatchInit;
  5652. VAR reg: IntermediateCode.Operand;
  5653. BEGIN
  5654. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5655. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5656. EmitLeave(profileInit,position,NIL,0);
  5657. profileInit.Emit(Exit(position,0,0,0));
  5658. END ProfilerPatchInit;
  5659. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5660. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5661. VAR
  5662. id: LONGINT;
  5663. leftType, rightType: SyntaxTree.Type;
  5664. procedureType: SyntaxTree.ProcedureType;
  5665. runtimeProcedure: SyntaxTree.Procedure;
  5666. runtimeProcedureOperand, operatorOperand: Operand;
  5667. kind: SET;
  5668. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5669. VAR
  5670. arg: IntermediateCode.Operand;
  5671. recordType: SyntaxTree.RecordType;
  5672. fingerPrint: SyntaxTree.FingerPrint;
  5673. BEGIN
  5674. IF type = NIL THEN
  5675. (* no type: push 'NoType' *)
  5676. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5677. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5678. ELSIF IsStrictlyPointerToRecord(type) THEN
  5679. (* pointer to record type: push typetag *)
  5680. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5681. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5682. arg := TypeDescriptorAdr(recordType);
  5683. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5684. ELSE
  5685. (* non-pointer to record type: push fingerprint *)
  5686. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5687. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5688. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5689. END;
  5690. operatorInitializationCodeSection.Emit(Push(position,arg))
  5691. END PushTypeInfo;
  5692. BEGIN
  5693. ASSERT(operatorInitializationCodeSection # NIL);
  5694. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5695. procedureType := operator.type(SyntaxTree.ProcedureType);
  5696. (* determine types *)
  5697. leftType := procedureType.firstParameter.type;
  5698. IF procedureType.numberParameters = 2 THEN
  5699. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5700. rightType := procedureType.firstParameter.nextParameter.type;
  5701. ELSE
  5702. rightType := NIL
  5703. END;
  5704. (* determine operator kind *)
  5705. IF IsStrictlyPointerToRecord(leftType) THEN
  5706. kind := {LhsIsPointer}
  5707. ELSE
  5708. kind := {}
  5709. END;
  5710. IF IsStrictlyPointerToRecord(rightType) THEN
  5711. kind := kind + {RhsIsPointer}
  5712. END;
  5713. IF kind # {} THEN (* TODO: to be removed later on *)
  5714. (* at least one of the types is a pointer to record *)
  5715. (* emit a code that registers this specific operator in the runtime *)
  5716. dump := operatorInitializationCodeSection.comments;
  5717. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5718. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5719. (* push ID *)
  5720. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5721. id := Global.GetSymbol(module.module.case, operator.name);
  5722. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5723. (* push kind *)
  5724. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5725. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5726. (* push type infos *)
  5727. PushTypeInfo(leftType);
  5728. PushTypeInfo(rightType);
  5729. (* push operator address *)
  5730. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5731. StaticCallOperand(operatorOperand, operator);
  5732. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5733. ReleaseOperand(operatorOperand);
  5734. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5735. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5736. ReleaseOperand(runtimeProcedureOperand)
  5737. END
  5738. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5739. END
  5740. END RegisterDynamicOperator;
  5741. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5742. VAR
  5743. traceModule: SyntaxTree.Module;
  5744. procedure: SyntaxTree.Procedure;
  5745. procedureVariable: SyntaxTree.Variable;
  5746. s,msg: Basic.MessageString;
  5747. res: Operand;
  5748. i: LONGINT;
  5749. sv: SyntaxTree.StringValue;
  5750. type: SyntaxTree.Type;
  5751. recordType: SyntaxTree.RecordType;
  5752. printout: Printout.Printer;
  5753. stringWriter: Streams.StringWriter;
  5754. expression: SyntaxTree.Expression;
  5755. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5756. BEGIN
  5757. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5758. IF procedure = NIL THEN
  5759. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5760. END;
  5761. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5762. s := "procedure ";
  5763. Strings.Append(s,backend.traceModuleName);
  5764. Strings.Append(s,".");
  5765. Strings.Append(s,procedureName);
  5766. Strings.Append(s," not present");
  5767. Error(position,s);
  5768. RETURN FALSE
  5769. ELSE
  5770. RETURN TRUE
  5771. END;
  5772. END GetProcedure;
  5773. PROCEDURE CallProcedure;
  5774. VAR size: LONGINT;
  5775. BEGIN
  5776. IF procedure # NIL THEN
  5777. StaticCallOperand(result,procedure);
  5778. size := ProcedureParametersSize(system,procedure);
  5779. ELSE
  5780. Symbol(procedureVariable, result);
  5781. LoadValue(result, procedureVariable.type.resolved);
  5782. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5783. END;
  5784. Emit(Call(position,result.op,size));
  5785. END CallProcedure;
  5786. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5787. VAR res: Operand; string: SyntaxTree.String;
  5788. BEGIN
  5789. IF GetProcedure("String") THEN
  5790. NEW(string, LEN(s)); COPY(s, string^);
  5791. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5792. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5793. sv.SetType(type);
  5794. Designate(sv,res);
  5795. Emit(Push(position,res.tag));
  5796. Emit(Push(position,res.op));
  5797. ReleaseOperand(res);
  5798. CallProcedure;
  5799. END;
  5800. END String;
  5801. PROCEDURE Integer(op: IntermediateCode.Operand);
  5802. BEGIN
  5803. IF GetProcedure("Int") THEN
  5804. Emit(Push(position,op));
  5805. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5806. CallProcedure;
  5807. END;
  5808. END Integer;
  5809. PROCEDURE Float(op: IntermediateCode.Operand);
  5810. BEGIN
  5811. IF GetProcedure("HIntHex") THEN
  5812. Emit(Push(position,op));
  5813. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5814. CallProcedure;
  5815. END;
  5816. END Float;
  5817. PROCEDURE Set(op: IntermediateCode.Operand);
  5818. BEGIN
  5819. IF GetProcedure("Set") THEN
  5820. Emit(Push(position,op));
  5821. (*
  5822. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5823. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5824. *)
  5825. CallProcedure;
  5826. END;
  5827. END Set;
  5828. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5829. BEGIN
  5830. IF GetProcedure("Boolean") THEN
  5831. Emit(Push(position,op));
  5832. CallProcedure;
  5833. END;
  5834. END Boolean;
  5835. PROCEDURE Char(op: IntermediateCode.Operand);
  5836. BEGIN
  5837. IF GetProcedure("Char") THEN
  5838. Emit(Push(position,op));
  5839. CallProcedure;
  5840. END;
  5841. END Char;
  5842. PROCEDURE Address(op: IntermediateCode.Operand);
  5843. BEGIN
  5844. IF GetProcedure("Address") THEN
  5845. Emit(Push(position,op));
  5846. CallProcedure;
  5847. END;
  5848. END Address;
  5849. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  5850. VAR len: IntermediateCode.Operand;
  5851. BEGIN
  5852. IF GetProcedure("String") THEN
  5853. len := GetArrayLength(type, op.tag);
  5854. Emit(Push(position,len));
  5855. ReleaseIntermediateOperand(len);
  5856. Emit(Push(position,op.op));
  5857. CallProcedure;
  5858. END;
  5859. END StringOperand;
  5860. PROCEDURE Ln;
  5861. BEGIN
  5862. IF GetProcedure("Ln") THEN
  5863. CallProcedure;
  5864. END;
  5865. END Ln;
  5866. BEGIN
  5867. IF backend.traceModuleName = "" THEN RETURN END;
  5868. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5869. IF GetProcedure("Enter") THEN
  5870. CallProcedure
  5871. END;
  5872. NEW(stringWriter,LEN(s));
  5873. FOR i := 0 TO x.Length()-1 DO
  5874. msg := "";
  5875. expression := x.GetExpression(i);
  5876. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5877. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5878. ELSE
  5879. Global.GetModuleName(module.module, s);
  5880. END;
  5881. IF i = 0 THEN
  5882. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  5883. stringWriter.String(":");
  5884. END;
  5885. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5886. IF ~(expression IS SyntaxTree.StringValue) THEN
  5887. printout.Expression(expression);
  5888. stringWriter.Get(s);
  5889. Strings.Append(msg,s);
  5890. Strings.Append(msg,"= ");
  5891. ELSE stringWriter.Get(s); (* remove from string writer *)
  5892. Strings.Append(msg, s);
  5893. END;
  5894. String(msg);
  5895. IF SemanticChecker.IsStringType(expression.type) THEN
  5896. Designate(expression,res);
  5897. StringOperand(res, expression.type);
  5898. ELSE
  5899. Evaluate(expression,res);
  5900. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5901. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5902. Convert(res.op,int64);
  5903. END;
  5904. Integer(res.op);
  5905. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5906. Boolean(res.op);
  5907. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5908. Set(res.op);
  5909. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5910. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5911. Convert(res.op,float64);
  5912. END;
  5913. Float(res.op);
  5914. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5915. Char(res.op);
  5916. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5917. Address(res.op);String("H");
  5918. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5919. Address(res.op);String("H");
  5920. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5921. Address(res.op);String("H");
  5922. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5923. Address(res.op);String("H");
  5924. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5925. String("NIL");
  5926. ELSE HALT(200);
  5927. END;
  5928. END;
  5929. ReleaseOperand(res);
  5930. String("; ");
  5931. END;
  5932. IF GetProcedure("Exit") THEN
  5933. CallProcedure
  5934. ELSE
  5935. Ln;
  5936. END;
  5937. END;
  5938. END SystemTrace;
  5939. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5940. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5941. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5942. BEGIN
  5943. type := type.resolved;
  5944. IF type IS SyntaxTree.RecordType THEN
  5945. WITH type: SyntaxTree.RecordType DO
  5946. baseType := type.baseType;
  5947. IF baseType # NIL THEN
  5948. baseType := baseType.resolved;
  5949. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5950. InitFields(baseType,adr,offset);
  5951. END;
  5952. variable := type.recordScope.firstVariable;
  5953. WHILE variable # NIL DO
  5954. IF variable.initializer # NIL THEN
  5955. Evaluate(variable.initializer,initializerOp);
  5956. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5957. Emit(Mov(position,mem,initializerOp.op));
  5958. ReleaseOperand(initializerOp);
  5959. ReleaseIntermediateOperand(mem);
  5960. END;
  5961. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5962. variable := variable.nextVariable
  5963. END;
  5964. END;
  5965. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5966. WITH type: SyntaxTree.ArrayType DO
  5967. IF type.form = SyntaxTree.Static THEN
  5968. baseType := type.arrayBase;
  5969. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5970. FOR i := 0 TO type.staticLength-1 DO
  5971. InitFields(baseType,adr,offset+i*size);
  5972. END;
  5973. END;
  5974. END;
  5975. ELSIF type IS SyntaxTree.MathArrayType THEN
  5976. WITH type: SyntaxTree.MathArrayType DO
  5977. IF type.form = SyntaxTree.Open THEN
  5978. dim := DynamicDim(type);
  5979. imm := IntermediateCode.Immediate(addressType,dim);
  5980. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5981. baseType := SemanticChecker.ArrayBase(type,dim);
  5982. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5983. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5984. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5985. ReleaseIntermediateOperand(imm);
  5986. (* flags remain empty (=0) for open array *)
  5987. ELSIF type.form = SyntaxTree.Static THEN
  5988. baseType := type.arrayBase;
  5989. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5990. ASSERT(type.staticLength < 1024*1024*1024);
  5991. FOR i := 0 TO type.staticLength-1 DO
  5992. InitFields(baseType,adr,offset+i*size);
  5993. END;
  5994. END;
  5995. END;
  5996. END;
  5997. END InitFields;
  5998. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  5999. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6000. BEGIN
  6001. type := variable.type.resolved;
  6002. IF (type IS SyntaxTree.MathArrayType) THEN
  6003. WITH type: SyntaxTree.MathArrayType DO
  6004. IF type.form = SyntaxTree.Open THEN
  6005. Symbol(variable,operand);
  6006. InitFields(type, operand.tag,0);
  6007. IF temporary THEN
  6008. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6009. END;
  6010. ELSIF type.form = SyntaxTree.Tensor THEN
  6011. Symbol(variable, operand);
  6012. MakeMemory(tmp,operand.op,addressType,0);
  6013. ReleaseOperand(operand);
  6014. IF temporary THEN
  6015. (* trick -- temporary object from array base *)
  6016. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6017. Symbol(symbol,operand);
  6018. MakeMemory(mem,operand.op,addressType,0);
  6019. ReleaseOperand(operand);
  6020. Emit(Mov(position,tmp, mem) );
  6021. ReleaseOperand(operand);
  6022. ELSE
  6023. Emit(Mov(position,tmp, nil ) );
  6024. END;
  6025. ReleaseIntermediateOperand(tmp);
  6026. END;
  6027. END;
  6028. ELSE
  6029. Symbol(variable,operand);
  6030. IF variable.initializer # NIL THEN
  6031. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6032. reference.SetType(variable.type.resolved);
  6033. reference.SetAssignable(TRUE);
  6034. Assign(reference,variable.initializer);
  6035. ELSIF temporary THEN
  6036. IF SemanticChecker.IsPointerType(variable.type) THEN
  6037. Symbol(variable, operand);
  6038. MakeMemory(tmp,operand.op,addressType,0);
  6039. ReleaseOperand(operand);
  6040. Emit(Mov(position,tmp, nil ) );
  6041. ReleaseIntermediateOperand(tmp);
  6042. END;
  6043. END;
  6044. InitFields(type, operand.op,0);
  6045. ReleaseOperand(operand);
  6046. END;
  6047. END InitVariable;
  6048. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6049. VAR end: Label;
  6050. BEGIN
  6051. IF type.form = SyntaxTree.Tensor THEN
  6052. InitOperand(result,ModeValue);
  6053. ReuseCopy(result.op,base);
  6054. end := NewLabel();
  6055. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6056. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6057. SetLabel(end);
  6058. Convert(result.op,int32);
  6059. ELSE
  6060. InitOperand(result,ModeValue);
  6061. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6062. END
  6063. END MathArrayDim;
  6064. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6065. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6066. BEGIN
  6067. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6068. MakeMemory(mem,base,addressType,offset);
  6069. Emit(Mov(position,mem,value));
  6070. ReleaseIntermediateOperand(mem);
  6071. END PutMathArrayField;
  6072. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6073. VAR mem: IntermediateCode.Operand;
  6074. BEGIN
  6075. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6076. MakeMemory(mem,base,addressType,offset);
  6077. Emit(Mov(position,mem,value));
  6078. ReleaseIntermediateOperand(mem);
  6079. END PutMathArrayFieldOffset;
  6080. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6081. BEGIN
  6082. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6083. MakeMemory(value,base,addressType,offset);
  6084. END GetMathArrayField;
  6085. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6086. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6087. BEGIN
  6088. IF incr THEN
  6089. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6090. ELSE
  6091. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6092. END;
  6093. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6094. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6095. ELSE
  6096. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6097. Emit(Mov(position,reg,dim));
  6098. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6099. Emit(Add(position,reg,reg,base));
  6100. MakeMemory(mem, reg, addressType, offset);
  6101. ReleaseIntermediateOperand(reg);
  6102. Emit(Mov(position,mem,value));
  6103. ReleaseIntermediateOperand(mem);
  6104. END;
  6105. END PutMathArrayLenOrIncr;
  6106. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6107. BEGIN
  6108. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6109. END PutMathArrayLength;
  6110. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6111. BEGIN
  6112. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6113. END PutMathArrayIncrement;
  6114. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6115. BEGIN
  6116. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6117. END GetMathArrayIncrement;
  6118. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6119. BEGIN
  6120. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6121. END GetMathArrayLength;
  6122. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6123. VAR dimOp: IntermediateCode.Operand;
  6124. BEGIN
  6125. dimOp := IntermediateCode.Immediate(int32, dim);
  6126. GetMathArrayLength(type, operand, dimOp, check, result);
  6127. END GetMathArrayLengthAt;
  6128. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6129. VAR dimOp: IntermediateCode.Operand;
  6130. BEGIN
  6131. dimOp := IntermediateCode.Immediate(int32, dim);
  6132. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6133. END GetMathArrayIncrementAt;
  6134. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6135. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6136. offset: LONGINT;
  6137. BEGIN
  6138. IF increment THEN
  6139. offset := MathIncrOffset;
  6140. ELSE
  6141. offset := MathLenOffset;
  6142. END;
  6143. INC(offset,operand.dimOffset*2);
  6144. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6145. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6146. END;
  6147. (* static dimension *)
  6148. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6149. IF check & (type.form = SyntaxTree.Tensor) THEN
  6150. DimensionCheck(operand.tag,dim,BrltL);
  6151. END;
  6152. val := SHORT(dim.intValue);
  6153. IF type.form # SyntaxTree.Tensor THEN
  6154. t := SemanticChecker.ArrayBase(type,val);
  6155. type := t.resolved(SyntaxTree.MathArrayType);
  6156. IF type.form = SyntaxTree.Static THEN
  6157. IF increment THEN
  6158. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6159. ELSE
  6160. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6161. END;
  6162. InitOperand(result,ModeValue);
  6163. result.op := res;
  6164. RETURN;
  6165. END;
  6166. END;
  6167. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6168. MakeMemory(res,operand.tag,addressType,offset);
  6169. (*
  6170. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6171. *)
  6172. InitOperand(result,ModeValue);
  6173. result.op := res;
  6174. ELSE
  6175. Convert(dim,addressType);
  6176. IF check THEN
  6177. IF type.form = SyntaxTree.Tensor THEN
  6178. DimensionCheck(operand.tag,dim,BrltL);
  6179. ELSIF isUnchecked THEN (* do nothing *)
  6180. ELSE
  6181. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6182. END;
  6183. END;
  6184. end := NewLabel(); next := NIL;
  6185. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6186. Emit(Mov(position,res,dim));
  6187. Convert(res,int32);
  6188. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6189. WHILE t IS SyntaxTree.MathArrayType DO
  6190. type := t(SyntaxTree.MathArrayType);
  6191. IF type.form = SyntaxTree.Static THEN
  6192. imm := IntermediateCode.Immediate(int32,val);
  6193. next := NewLabel();
  6194. BrneL(next,imm,res);
  6195. IF increment THEN
  6196. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  6197. ELSE
  6198. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6199. END;
  6200. Emit(MovReplace(position,res,imm));
  6201. BrL(end);
  6202. ELSE hasDynamicPart := TRUE;
  6203. END;
  6204. t := type.arrayBase.resolved;
  6205. val := val + 1;
  6206. IF next # NIL THEN SetLabel(next) END;
  6207. END;
  6208. IF hasDynamicPart THEN
  6209. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6210. Emit(Mov(position,res2,dim));
  6211. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6212. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6213. Emit(Add(position,res2,res2,imm));
  6214. Emit(Add(position,res2,res2,operand.tag));
  6215. IntermediateCode.MakeMemory(res2,int32);
  6216. Emit(MovReplace(position,res,res2));
  6217. ReleaseIntermediateOperand(res2);
  6218. END;
  6219. SetLabel(end);
  6220. Convert(res,int32);
  6221. InitOperand(result,ModeValue);
  6222. result.op := res;
  6223. END;
  6224. END MathArrayLenOrIncr;
  6225. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6226. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6227. offset: LONGINT;
  6228. BEGIN
  6229. offset := operand.dimOffset+DynamicDim(type)-1;
  6230. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6231. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6232. val := SHORT(dim.intValue);
  6233. t := SemanticChecker.ArrayBase(type,val);
  6234. type := t.resolved(SyntaxTree.ArrayType);
  6235. IF type.form = SyntaxTree.Static THEN
  6236. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6237. ELSE
  6238. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6239. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6240. END;
  6241. UseIntermediateOperand(res);
  6242. InitOperand(result,ModeValue);
  6243. result.op := res;
  6244. ELSE
  6245. Convert(dim,addressType);
  6246. IF ~isUnchecked THEN
  6247. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6248. END;
  6249. end := NewLabel(); next := NIL;
  6250. (* ReuseCopy(dim,res); *)
  6251. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6252. Emit(Mov(position,res,dim));
  6253. Convert(res,int32);
  6254. Convert(res,int32);
  6255. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6256. WHILE t IS SyntaxTree.ArrayType DO
  6257. type := t(SyntaxTree.ArrayType);
  6258. IF type.form = SyntaxTree.Static THEN
  6259. imm := IntermediateCode.Immediate(int32,val);
  6260. next := NewLabel();
  6261. BrneL(next,imm,res);
  6262. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6263. Emit(MovReplace(position,res,imm));
  6264. BrL(end);
  6265. ELSE hasDynamicPart := TRUE;
  6266. END;
  6267. t := type.arrayBase.resolved;
  6268. val := val + 1;
  6269. IF next # NIL THEN SetLabel(next) END;
  6270. END;
  6271. IF hasDynamicPart THEN
  6272. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6273. Convert(res2,addressType);
  6274. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6275. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6276. Emit(Sub(position,res2,imm,res2));
  6277. Emit(Add(position,res2,res2,operand.tag));
  6278. IntermediateCode.MakeMemory(res2,int32);
  6279. Emit(MovReplace(position,res,res2));
  6280. ReleaseIntermediateOperand(res2);
  6281. END;
  6282. SetLabel(end);
  6283. Convert(res,int32);
  6284. InitOperand(result,ModeValue);
  6285. result.op := res;
  6286. END;
  6287. END ArrayLen;
  6288. (**
  6289. create a temporary variable in current scope
  6290. **)
  6291. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6292. VAR name: SyntaxTree.Identifier; variable: SyntaxTree.Variable;
  6293. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6294. BEGIN
  6295. IF ~register THEN
  6296. variable := temporaries.GetFreeVariable(type, untraced, index);
  6297. ELSE
  6298. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6299. END;
  6300. scope := currentScope;
  6301. variable := NIL; (* disable free variable managemenet for the time being -- does not work *)
  6302. IF variable = NIL THEN
  6303. name := temporaries.GetUID();
  6304. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6305. variable.SetType(type);
  6306. variable.SetAccess(SyntaxTree.Hidden);
  6307. variable.SetUntraced(untraced);
  6308. IF ~register THEN
  6309. temporaries.AddVariable(variable);
  6310. IF scope.lastVariable # NIL THEN
  6311. offset := scope.lastVariable.offsetInBits;
  6312. ELSE
  6313. offset := 0;
  6314. END;
  6315. DEC(offset,system.SizeOf(variable.type));
  6316. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6317. variable(SyntaxTree.Variable).SetOffset(offset);
  6318. scope.AddVariable(variable(SyntaxTree.Variable));
  6319. scope.EnterSymbol(variable, duplicate);
  6320. ASSERT(~duplicate);
  6321. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6322. ELSE
  6323. variable.SetUseRegister(TRUE);
  6324. variable(SyntaxTree.Variable).SetOffset(0);
  6325. END;
  6326. ELSE
  6327. name := temporaries.GetUID();
  6328. offset := variable.offsetInBits;
  6329. (* create new variable on existing slot *)
  6330. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6331. variable.SetType(type);
  6332. variable.SetAccess(SyntaxTree.Hidden);
  6333. variable.SetUntraced(untraced);
  6334. variable(SyntaxTree.Variable).SetOffset(offset);
  6335. scope.AddVariable(variable(SyntaxTree.Variable));
  6336. scope.EnterSymbol(variable, duplicate);
  6337. ASSERT(~duplicate);
  6338. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6339. (*
  6340. ASSERT(variable.type.resolved = type.resolved)
  6341. *)
  6342. END;
  6343. RETURN variable(SyntaxTree.Variable)
  6344. END GetTemporaryVariable;
  6345. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6346. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6347. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6348. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6349. i: LONGINT; duplicate: BOOLEAN;
  6350. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6351. VAR variable: SyntaxTree.Variable;
  6352. BEGIN
  6353. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6354. variable.SetType(type);
  6355. recordScope.AddVariable(variable);
  6356. END AddVariable;
  6357. BEGIN
  6358. name := "@ArrayDescriptor";
  6359. Basic.AppendNumber(name,dimensions);
  6360. identifier := SyntaxTree.NewIdentifier(name);
  6361. parentScope := module.module.moduleScope;
  6362. symbol := parentScope.FindSymbol(identifier);
  6363. IF symbol # NIL THEN
  6364. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6365. type := typeDeclaration.declaredType;
  6366. ELSE
  6367. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6368. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6369. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6370. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6371. recordType.SetTypeDeclaration(typeDeclaration);
  6372. recordType.SetState(SyntaxTree.Resolved);
  6373. typeDeclaration.SetDeclaredType(recordType);
  6374. AddVariable("@ptr",system.anyType);
  6375. AddVariable("@adr",system.addressType);
  6376. AddVariable("@flags",system.addressType);
  6377. AddVariable("@dim",system.addressType);
  6378. AddVariable("@elementSize",system.addressType);
  6379. FOR i := 0 TO dimensions-1 DO
  6380. name := "@len";
  6381. Basic.AppendNumber(name,i);
  6382. AddVariable(name,system.addressType);
  6383. name := "@incr";
  6384. Basic.AppendNumber(name,i);
  6385. AddVariable(name,system.addressType);
  6386. END;
  6387. parentScope.AddTypeDeclaration(typeDeclaration);
  6388. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6389. ASSERT(~duplicate);
  6390. type := recordType;
  6391. END;
  6392. RETURN type
  6393. END GetMathArrayDescriptorType;
  6394. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6395. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6396. BEGIN
  6397. type := GetMathArrayDescriptorType(dimensions);
  6398. Emit(Push(position,op.op));
  6399. (* push type descriptor *)
  6400. reg := TypeDescriptorAdr(type);
  6401. IF ~newObjectFile THEN
  6402. IntermediateCode.MakeMemory(reg,addressType);
  6403. END;
  6404. Emit(Push(position,reg));
  6405. ReleaseIntermediateOperand(reg);
  6406. (* push realtime flag: false by default *)
  6407. Emit(Push(position,false));
  6408. CallThis(position,"Heaps","NewRec",3);
  6409. END NewMathArrayDescriptor;
  6410. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6411. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6412. BEGIN
  6413. NEW(string, LEN(s)); COPY(s, string^);
  6414. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6415. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6416. sv.SetType(type);
  6417. Designate(sv,res);
  6418. Emit(Push(position,res.tag));
  6419. Emit(Push(position,res.op));
  6420. ReleaseOperand(res);
  6421. END PushConstString;
  6422. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6423. BEGIN
  6424. IF b THEN
  6425. Emit(Push(Basic.invalidPosition, true));
  6426. ELSE
  6427. Emit(Push(Basic.invalidPosition, false));
  6428. END;
  6429. END PushConstBoolean;
  6430. PROCEDURE PushConstSet(v: SET);
  6431. VAR value: SyntaxTree.Value; op: Operand;
  6432. BEGIN
  6433. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6434. value.SetType(system.setType);
  6435. Evaluate(value, op);
  6436. Emit(Push(Basic.invalidPosition, op.op));
  6437. ReleaseOperand(op);
  6438. END PushConstSet;
  6439. PROCEDURE PushConstInteger(v: LONGINT);
  6440. VAR value: SyntaxTree.Value; op: Operand;
  6441. BEGIN
  6442. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6443. value.SetType(system.longintType);
  6444. Evaluate(value, op);
  6445. Emit(Push(Basic.invalidPosition, op.op));
  6446. ReleaseOperand(op);
  6447. END PushConstInteger;
  6448. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6449. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6450. section: IntermediateCode.Section;
  6451. BEGIN
  6452. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6453. Global.GetSymbolSegmentedName(symbol, name);
  6454. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6455. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6456. procedure.SetScope(moduleScope);
  6457. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6458. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6459. procedure.SetAccess(SyntaxTree.Hidden);
  6460. currentScope := procedureScope;
  6461. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6462. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6463. RETURN section;
  6464. END OpenInitializer;
  6465. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6466. BEGIN
  6467. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6468. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6469. section := prev;
  6470. END CloseInitializer;
  6471. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6472. VAR name: SyntaxTree.IdentifierString;
  6473. variable: SyntaxTree.Variable;
  6474. parameter: SyntaxTree.Parameter;
  6475. type: SyntaxTree.Type;
  6476. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6477. BEGIN
  6478. InitOperand(op,ModeReference);
  6479. op.op := fp;
  6480. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6481. Dereference(op, x, FALSE);
  6482. result := op;
  6483. Symbol(symbol, op);
  6484. END Field;
  6485. PROCEDURE Direction(direction: LONGINT): SET;
  6486. BEGIN
  6487. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6488. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6489. ELSE HALT(100);
  6490. END;
  6491. END Direction;
  6492. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6493. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6494. BEGIN
  6495. Field(port, op);
  6496. ToMemory(op.op,addressType,0);
  6497. Emit(Push(Basic.invalidPosition, op.op));
  6498. ReleaseOperand(op);
  6499. Basic.GetString(modifier.identifier, name);
  6500. PushConstString(name);
  6501. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6502. ASSERT(SemanticChecker.IsStringType(value.type));
  6503. Designate(value, op);
  6504. Emit(Push(modifier.position, op.tag));
  6505. Emit(Push(modifier.position, op.op));
  6506. ReleaseOperand(op);
  6507. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6508. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6509. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6510. Evaluate(value, op);
  6511. Emit(Push(modifier.position, op.op));
  6512. ReleaseOperand(op);
  6513. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6514. ELSE
  6515. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6516. END;
  6517. END AddPortProperty;
  6518. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6519. VAR modifier: SyntaxTree.Modifier;
  6520. BEGIN
  6521. modifier := parameter.modifiers;
  6522. WHILE modifier # NIL DO
  6523. AddPortProperty(parameter,modifier, modifier.expression);
  6524. modifier := modifier.nextModifier;
  6525. END;
  6526. END AddPortProperties;
  6527. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6528. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6529. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6530. PROCEDURE PushLens(type: SyntaxTree.Type);
  6531. BEGIN
  6532. IF IsSemiDynamicArray(type) THEN
  6533. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6534. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6535. Emit(Push(Basic.invalidPosition, op.op));
  6536. ReleaseOperand(op);
  6537. INC(dim);
  6538. ELSIF IsStaticArray(type) THEN
  6539. len := len * type(SyntaxTree.ArrayType).staticLength;
  6540. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6541. INC(dim);
  6542. ELSE
  6543. baseType := type;
  6544. END;
  6545. END PushLens;
  6546. BEGIN
  6547. (* cell *)
  6548. IF parameter.type IS SyntaxTree.ArrayType THEN
  6549. type := parameter.type;
  6550. dim := 0;
  6551. len := 1;
  6552. PushLens(type);
  6553. portType := baseType.resolved(SyntaxTree.PortType);
  6554. ELSE
  6555. portType := parameter.type(SyntaxTree.PortType);
  6556. END;
  6557. PushSelfPointer();
  6558. (* port / array of ports *)
  6559. IF IsStaticArray(type) THEN
  6560. PushConstInteger(len);
  6561. END;
  6562. Field(parameter, op);
  6563. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6564. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6565. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6566. Designate(d, op);*)
  6567. Emit(Push(Basic.invalidPosition, op.op));
  6568. ReleaseOperand(op);
  6569. (* name *)
  6570. PushConstString(name);
  6571. (* inout *)
  6572. PushConstSet(Direction(portType.direction));
  6573. (* width *)
  6574. PushConstInteger(portType.sizeInBits);
  6575. IF parameter.type IS SyntaxTree.PortType THEN
  6576. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6577. AddPortProperties(parameter);
  6578. ELSIF IsStaticArray(type)THEN
  6579. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6580. ELSIF IsSemiDynamicArray(type) THEN
  6581. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6582. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6583. Emit(Add(position,reg, sp, size));
  6584. (* dim *)
  6585. PushConstInteger(dim);
  6586. (* len array *)
  6587. Emit(Push(position, reg));
  6588. ReleaseIntermediateOperand(reg);
  6589. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6590. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6591. Emit(Add(position, sp,sp, size));
  6592. ELSE
  6593. HALT(100);
  6594. END;
  6595. END Parameter;
  6596. BEGIN
  6597. IF backend.cellsAreObjects THEN
  6598. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6599. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6600. END;
  6601. parameter := x.firstParameter;
  6602. WHILE (parameter # NIL) DO
  6603. type := parameter.type.resolved;
  6604. WHILE (type IS SyntaxTree.ArrayType) DO
  6605. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6606. END;
  6607. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6608. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6609. Parameter(name,parameter);
  6610. END;
  6611. parameter := parameter.nextParameter;
  6612. END;
  6613. ELSE HALT(200)
  6614. END;
  6615. END AddPorts;
  6616. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6617. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6618. BEGIN
  6619. Symbol(cell,op);
  6620. ToMemory(op.op,addressType,0);
  6621. Emit(Push(position,op.op));
  6622. ReleaseOperand(op);
  6623. property.GetName(name);
  6624. (* does not work when inheritance is used:
  6625. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6626. *)
  6627. PushConstString(name);
  6628. IF (value # NIL) THEN
  6629. ASSERT(
  6630. SemanticChecker.IsStringType(property.type)
  6631. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6632. OR (property.type.resolved IS SyntaxTree.FloatType)
  6633. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6634. OR (property.type.resolved IS SyntaxTree.SetType)
  6635. );
  6636. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6637. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6638. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6639. Designate(d, op);
  6640. IF SemanticChecker.IsStringType(property.type) THEN
  6641. Emit(Push(Basic.invalidPosition, op.tag))
  6642. END;
  6643. Emit(Push(Basic.invalidPosition, op.op));
  6644. ReleaseOperand(op);
  6645. END;
  6646. IF value = NIL THEN
  6647. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6648. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6649. ASSERT(SemanticChecker.IsStringType(value.type));
  6650. Designate(value, op);
  6651. PushString(op, value.type);
  6652. ReleaseOperand(op);
  6653. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6654. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6655. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6656. Evaluate(value, op);
  6657. Emit(Push(property.position, op.op));
  6658. ReleaseOperand(op);
  6659. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6660. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6661. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6662. Evaluate(value, op);
  6663. Emit(Push(property.position, op.op));
  6664. ReleaseOperand(op);
  6665. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6666. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6667. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6668. Evaluate(value, op);
  6669. Emit(Push(property.position, op.op));
  6670. ReleaseOperand(op);
  6671. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6672. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6673. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6674. Evaluate(value, op);
  6675. Emit(Push(property.position, op.op));
  6676. ReleaseOperand(op);
  6677. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6678. ELSE
  6679. HALT(200);
  6680. END;
  6681. END AddProperty;
  6682. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6683. VAR symbol: SyntaxTree.Symbol;
  6684. BEGIN
  6685. WHILE modifier # NIL DO
  6686. symbol := cellType.FindProperty(modifier.identifier);
  6687. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6688. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6689. modifier := modifier.nextModifier;
  6690. END;
  6691. END AddModifiers;
  6692. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6693. VAR last: SyntaxTree.Modifier;
  6694. BEGIN
  6695. IF to = NIL THEN
  6696. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6697. ELSE
  6698. last := to;
  6699. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6700. last := last.nextModifier;
  6701. END;
  6702. IF last.identifier # this.identifier THEN
  6703. ASSERT(last.nextModifier = NIL);
  6704. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6705. END;
  6706. END;
  6707. END AppendModifier;
  6708. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6709. BEGIN
  6710. WHILE this # NIL DO
  6711. AppendModifier(to, this);
  6712. this := this.nextModifier;
  6713. END;
  6714. END AppendModifiers;
  6715. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6716. VAR base: SyntaxTree.Type;
  6717. BEGIN
  6718. AppendModifiers(to, c.modifiers);
  6719. base := c.GetBaseValueType();
  6720. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6721. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6722. END;
  6723. END AppendCellTypeModifiers;
  6724. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6725. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6726. BEGIN
  6727. Basic.GetString(modifier.identifier, name);
  6728. PushConstString(name);
  6729. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6730. ASSERT(SemanticChecker.IsStringType(value.type));
  6731. Designate(value, op);
  6732. PushString(op, value.type);
  6733. ReleaseOperand(op);
  6734. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6735. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6736. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6737. Evaluate(value, op);
  6738. Emit(Push(modifier.position, op.op));
  6739. ReleaseOperand(op);
  6740. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6741. ELSE
  6742. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6743. END;
  6744. END AddPortProperty;
  6745. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6746. BEGIN
  6747. WHILE modifier # NIL DO
  6748. AddPortProperty(modifier, modifier.expression);
  6749. modifier := modifier.nextModifier;
  6750. END;
  6751. END AddPortProperties;
  6752. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6753. VAR op: Operand;
  6754. BEGIN
  6755. Evaluate(p, op);
  6756. Emit(Push(p.position, op.op));
  6757. ReleaseOperand(op);
  6758. IF p IS SyntaxTree.Designator THEN
  6759. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6760. END;
  6761. END PushPort;
  6762. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6763. VAR tmp: IntermediateCode.Operand;
  6764. BEGIN
  6765. actualType := actualType.resolved;
  6766. IF actualType IS SyntaxTree.StringType THEN
  6767. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6768. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6769. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6770. ELSE
  6771. tmp := op.tag;
  6772. IntermediateCode.MakeMemory(tmp,addressType);
  6773. Emit(Push(position,tmp));
  6774. END;
  6775. Emit(Push(position,op.op))
  6776. END PushString;
  6777. (* conservative check if x is potentially on the heap, excluding the module heap
  6778. required for generational garbage collector
  6779. *)
  6780. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6781. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6782. BEGIN
  6783. RETURN TRUE;
  6784. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6785. passed by reference.
  6786. pos := x.position.start;
  6787. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6788. x := x(SyntaxTree.Designator).left;
  6789. END;
  6790. RETURN x # NIL;
  6791. *)
  6792. END OnHeap;
  6793. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6794. VAR
  6795. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6796. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6797. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6798. tmp:IntermediateCode.Operand;
  6799. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6800. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6801. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6802. dest: IntermediateCode.Operand;
  6803. staticLength: LONGINT; itype: IntermediateCode.Type;
  6804. convert,isTensor: BOOLEAN;
  6805. recordType: SyntaxTree.RecordType;
  6806. baseType: SyntaxTree.Type;
  6807. flags: SET;
  6808. left: SyntaxTree.Expression;
  6809. call: SyntaxTree.Designator;
  6810. procedure: SyntaxTree.Procedure;
  6811. temporaryVariable: SyntaxTree.Variable;
  6812. dummy: IntermediateCode.Operand;
  6813. customBuiltin: SyntaxTree.CustomBuiltin;
  6814. isVarPar: ARRAY 3 OF BOOLEAN;
  6815. callsection: Sections.Section;
  6816. segmentedName: Basic.SegmentedName;
  6817. needsTrace: BOOLEAN;
  6818. n: ARRAY 256 OF CHAR;
  6819. modifier: SyntaxTree.Modifier;
  6820. previous, init: IntermediateCode.Section;
  6821. prevScope: SyntaxTree.Scope;
  6822. firstPar: LONGINT;
  6823. saved: RegisterEntry;
  6824. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6825. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6826. priority: IntermediateCode.Operand;
  6827. op,callop: Operand;
  6828. BEGIN
  6829. IF type = NIL THEN RETURN END;
  6830. type := type.resolved;
  6831. IF type IS SyntaxTree.PointerType THEN
  6832. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6833. END;
  6834. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6835. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6836. recordScope := type(SyntaxTree.RecordType).recordScope;
  6837. IF recordScope.bodyProcedure # NIL THEN
  6838. procedure := recordScope.bodyProcedure;
  6839. body := procedure.procedureScope.body;
  6840. Emit(Push(position,self));
  6841. IF body.isActive THEN
  6842. StaticCallOperand(callop,procedure);
  6843. Emit(Push(position,callop.op));
  6844. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6845. Convert(priority,sizeType);
  6846. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6847. END;
  6848. Emit(Push(position,priority));
  6849. ReleaseIntermediateOperand(priority);
  6850. IF backend.cooperative THEN
  6851. Emit(Push(position,self));
  6852. CallThis(position,"Activities","Create",3)
  6853. ELSE
  6854. flags := 0;
  6855. IF body.isSafe THEN
  6856. flags := 1;
  6857. END;
  6858. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6859. Emit(Push(position,self));
  6860. CallThis(position,"Objects","CreateProcess",4)
  6861. END;
  6862. ELSE
  6863. Emit(Push(position,self));
  6864. StaticCallOperand(callop,procedure);
  6865. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6866. END;
  6867. Emit(Pop(position,self));
  6868. END;
  6869. END CallBodies;
  6870. PROCEDURE PushTD(type: SyntaxTree.Type);
  6871. VAR op: IntermediateCode.Operand;
  6872. BEGIN
  6873. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6874. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6875. ELSE
  6876. IF type.resolved IS SyntaxTree.PointerType THEN
  6877. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6878. END;
  6879. op := TypeDescriptorAdr(type.resolved);
  6880. IF ~newObjectFile THEN
  6881. IntermediateCode.MakeMemory(op,addressType);
  6882. END;
  6883. Emit(Push(position,op));
  6884. END
  6885. END PushTD;
  6886. BEGIN
  6887. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6888. dest := destination; destination := emptyOperand;
  6889. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6890. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6891. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6892. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6893. CASE x.id OF
  6894. (* ---- COPY ----- *)
  6895. |Global.Copy:
  6896. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6897. (* ---- EXCL, INCL----- *)
  6898. |Global.Excl,Global.Incl:
  6899. Evaluate(p0,s0);
  6900. Evaluate(p1,s1);
  6901. Convert(s1.op,setType);
  6902. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6903. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6904. END;
  6905. ReuseCopy(res,s0.op);
  6906. ReleaseOperand(s0);
  6907. Reuse1(tmp,s1.op);
  6908. ReleaseOperand(s1);
  6909. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6910. IF x.id = Global.Excl THEN
  6911. Emit(Not(position,tmp,tmp));
  6912. Emit(And(position,res,res,tmp));
  6913. ELSE
  6914. Emit(Or(position,res,res,tmp));
  6915. END;
  6916. ReleaseIntermediateOperand(tmp);
  6917. Designate(p0,s0);
  6918. ToMemory(s0.op,setType,0);
  6919. Emit(Mov(position,s0.op,res));
  6920. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6921. (* ---- DISPOSE ----- *)
  6922. |Global.Dispose:
  6923. Designate(p0,s0);
  6924. Emit(Push(position,s0.op));
  6925. ReleaseOperand(s0);
  6926. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6927. (* ---- GETPROCEDURE ----- *)
  6928. |Global.GetProcedure:
  6929. Designate(p0,s0);
  6930. PushString(s0,p0.type);
  6931. Designate(p1,s1);
  6932. PushString(s1,p1.type);
  6933. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6934. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6935. ELSE PushTD(procedureType.firstParameter.type)
  6936. END;
  6937. PushTD(procedureType.returnType);
  6938. Designate(p2,s2);
  6939. Emit(Push(position,s2.op));
  6940. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6941. CallThis(position,"Modules","GetProcedure", 7);
  6942. (* ---- ASH, LSH, ROT ----- *)
  6943. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6944. Evaluate(p0,s0);
  6945. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6946. (* make unsigned arguments in order to produced a logical shift *)
  6947. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6948. convert:= TRUE;
  6949. itype := s0.op.type;
  6950. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6951. Convert(s0.op,itype);
  6952. ELSE
  6953. convert := FALSE;
  6954. END;
  6955. END;
  6956. Evaluate(p1,s1);
  6957. IF IsIntegerConstant(p1,hint) THEN
  6958. ReuseCopy(reg,s0.op);
  6959. IF hint > 0 THEN
  6960. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6961. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6962. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6963. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6964. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6965. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6966. END;
  6967. ELSIF hint < 0 THEN
  6968. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6969. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6970. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6971. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6972. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6973. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6974. END;
  6975. END;
  6976. ReleaseOperand(s0); ReleaseOperand(s1);
  6977. ELSE
  6978. exit := NewLabel();
  6979. end := NewLabel();
  6980. ReuseCopy(reg,s0.op);
  6981. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6982. Reuse1(tmp,s1.op);
  6983. Emit(Neg(position,tmp,s1.op));
  6984. Convert(tmp,s1.op.type);
  6985. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6986. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6987. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6988. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6989. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6990. END;
  6991. ReleaseIntermediateOperand(tmp);
  6992. BrL(end);
  6993. SetLabel(exit);
  6994. ReuseCopy(tmp,s1.op);
  6995. Convert(tmp,s1.op.type);
  6996. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6997. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6998. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6999. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7000. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7001. END;
  7002. ReleaseIntermediateOperand(tmp);
  7003. SetLabel(end);
  7004. ReleaseOperand(s0); ReleaseOperand(s1);
  7005. END;
  7006. InitOperand(result,ModeValue);
  7007. IF convert THEN
  7008. itype := reg.type;
  7009. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7010. Convert(reg,itype);
  7011. END;
  7012. result.op := reg;
  7013. (* ---- CAP ----- *)
  7014. |Global.Cap:
  7015. Evaluate(p0,result);
  7016. ReuseCopy(reg,result.op);
  7017. ReleaseIntermediateOperand(result.op);
  7018. ignore := NewLabel();
  7019. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7020. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7021. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7022. SetLabel(ignore);
  7023. result.op := reg;
  7024. (* ---- CHR ----- *)
  7025. |Global.Chr, Global.Chr32:
  7026. Evaluate(p0,result);
  7027. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7028. |Global.Entier, Global.EntierH:
  7029. Evaluate(p0,result);
  7030. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7031. (* ---- MIN and MAX ----- *)
  7032. |Global.Max,Global.Min:
  7033. Evaluate(p0,s0);
  7034. Evaluate(p1,s1);
  7035. Reuse2(res,s0.op,s1.op);
  7036. else := NewLabel();
  7037. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7038. ELSE BrltL(else,s1.op,s0.op) END;
  7039. Emit(Mov(position,res,s0.op));
  7040. ReleaseOperand(s0);
  7041. end := NewLabel();
  7042. BrL(end);
  7043. SetLabel(else);
  7044. Emit(MovReplace(position,res,s1.op));
  7045. SetLabel(end);
  7046. ReleaseOperand(s1);
  7047. InitOperand(result,ModeValue);
  7048. result.op := res;
  7049. (* ---- ODD ----- *)
  7050. |Global.Odd:
  7051. IF ~conditional THEN
  7052. ConditionToValue(x)
  7053. ELSE
  7054. Evaluate(p0,result);
  7055. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7056. Reuse1(res,result.op);
  7057. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7058. ReleaseIntermediateOperand(result.op);
  7059. result.op := res;
  7060. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7061. ReleaseOperand(result);
  7062. BrL(falseLabel);
  7063. END;
  7064. (* ---- ORD ----- *)
  7065. |Global.Ord, Global.Ord32:
  7066. Evaluate(p0,result);
  7067. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7068. (* ---- SHORT, LONG ----- *)
  7069. |Global.Short, Global.Long:
  7070. Evaluate(p0,result);
  7071. IF x.type IS SyntaxTree.ComplexType THEN
  7072. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7073. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7074. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7075. ELSE
  7076. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7077. END
  7078. (* ---- HALT, SYSTEM.HALT----- *)
  7079. |Global.Halt, Global.systemHalt:
  7080. val := p0.resolved(SyntaxTree.IntegerValue).value;
  7081. EmitTrap (position, val);
  7082. (* ---- ASSERT ----- *)
  7083. |Global.Assert:
  7084. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7085. trueL := NewLabel();
  7086. falseL := NewLabel();
  7087. Condition(p0,trueL,falseL);
  7088. IF p1 = NIL THEN val := AssertTrap
  7089. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  7090. END;
  7091. SetLabel(falseL);
  7092. EmitTrap(position,val);
  7093. SetLabel(trueL);
  7094. END;
  7095. (*
  7096. Emit(TrapC(result.op,val);
  7097. *)
  7098. (* ---- INC, DEC----- *)
  7099. |Global.Inc,Global.Dec:
  7100. Expression(p0); adr := result.op;
  7101. LoadValue(result,p0.type); l := result;
  7102. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7103. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7104. END;
  7105. IF x.id = Global.Inc THEN
  7106. Emit(Add(position,l.op,l.op,r.op));
  7107. ELSE
  7108. Emit(Sub(position,l.op,l.op,r.op));
  7109. END;
  7110. ReleaseOperand(l); ReleaseOperand(r);
  7111. (* ---- LEN ----- *)
  7112. |Global.Len: (* dynamic length, static length done by checker *)
  7113. Designate(p0,operand);
  7114. IF p1 = NIL THEN
  7115. InitOperand(l,ModeValue);
  7116. l.op := IntermediateCode.Immediate(int32,0);
  7117. ELSE
  7118. Evaluate(p1,l);
  7119. END;
  7120. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7121. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7122. Dereference(operand, p0.type.resolved, FALSE);
  7123. END;
  7124. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7125. ReleaseOperand(operand); ReleaseOperand(l);
  7126. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7127. ASSERT(p1 # NIL);
  7128. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7129. Dereference(operand,p0.type.resolved,FALSE);
  7130. END;
  7131. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7132. ReleaseOperand(operand); ReleaseOperand(l);
  7133. ELSE HALT(100);
  7134. END;
  7135. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7136. (* ---- FIRST ---- *)
  7137. |Global.First:
  7138. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7139. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7140. ELSE
  7141. Designate(p0, result)
  7142. END
  7143. (* ---- LAST ---- *)
  7144. |Global.Last:
  7145. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7146. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7147. ELSE
  7148. Designate(p0, result);
  7149. (* make sure result.op is a register *)
  7150. tmp := result.op;
  7151. ReuseCopy(result.op, result.op);
  7152. ReleaseIntermediateOperand(tmp);
  7153. (* add offset to result.op *)
  7154. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7155. END
  7156. (* ---- STEP ---- *)
  7157. |Global.Step:
  7158. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7159. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7160. ELSE
  7161. Designate(p0, result);
  7162. (* make sure result.op is a register *)
  7163. tmp := result.op;
  7164. ReuseCopy(result.op, result.op);
  7165. ReleaseIntermediateOperand(tmp);
  7166. (* add offset to result.op *)
  7167. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7168. END
  7169. (* ---- RE ---- *)
  7170. |Global.Re:
  7171. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7172. Designate(p0, result)
  7173. ELSE
  7174. Evaluate(p0, result)
  7175. END
  7176. (* ---- IM ---- *)
  7177. |Global.Im:
  7178. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7179. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7180. Designate(p0, result);
  7181. (* make sure result.op is a register *)
  7182. tmp := result.op;
  7183. ReuseCopy(result.op, result.op);
  7184. ReleaseIntermediateOperand(tmp);
  7185. (* add offset to result.op *)
  7186. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7187. (* ---- ABS ----- *)
  7188. |Global.Abs:
  7189. Evaluate(p0,operand);
  7190. type := p0.type.resolved;
  7191. InitOperand(result,ModeValue);
  7192. Reuse1a(result.op,operand.op,dest);
  7193. Emit(Abs(position,result.op,operand.op));
  7194. ReleaseOperand(operand);
  7195. (* ---- WAIT ----- *)
  7196. |Global.Wait:
  7197. Evaluate(p0,operand);
  7198. Emit(Push(position,operand.op));
  7199. ReleaseOperand(operand);
  7200. CallThis(position,"Activities","Wait", 1);
  7201. (* ---- NEW ----- *)
  7202. |Global.New:
  7203. (*! the following code is only correct for "standard" Oberon calling convention *)
  7204. IF x.type # NIL THEN
  7205. type := x.type.resolved;
  7206. firstPar := 0;
  7207. ELSE
  7208. type := p0.type.resolved;
  7209. firstPar := 1;
  7210. END;
  7211. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7212. THEN
  7213. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7214. IF backend.cooperative THEN
  7215. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7216. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7217. IF recordType.isObject THEN
  7218. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7219. IF recordType.IsActive() THEN
  7220. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7221. END;
  7222. IF recordType.IsProtected() THEN
  7223. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7224. END;
  7225. ELSE
  7226. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7227. END;
  7228. END;
  7229. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7230. CallThis(position,"Runtime","New", 1);
  7231. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7232. Emit(Result(position, pointer));
  7233. exit := NewLabel();
  7234. BreqL(exit,pointer,nil);
  7235. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7236. GetRecordTypeName (recordType,name);
  7237. IF ~recordType.isObject THEN
  7238. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7239. END;
  7240. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7241. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7242. IF recordType.isObject THEN
  7243. IF recordType.IsProtected() THEN
  7244. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7245. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7246. END;
  7247. IF recordType.IsActive() THEN
  7248. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7249. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7250. END;
  7251. END;
  7252. END;
  7253. (* initialize fields *)
  7254. IF type(SyntaxTree.PointerType).isPlain THEN
  7255. size := 0;
  7256. ELSIF recordType.isObject THEN
  7257. size := BaseObjectTypeSize;
  7258. ELSE
  7259. size := BaseRecordTypeSize;
  7260. END;
  7261. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7262. (* call initializer *)
  7263. constructor := GetConstructor(recordType);
  7264. IF constructor # NIL THEN
  7265. (*! should be unified with ProcedureCallDesignator *)
  7266. Emit(Push(position,pointer));
  7267. ReleaseIntermediateOperand(pointer);
  7268. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7269. FOR i := firstPar TO x.parameters.Length()-1 DO
  7270. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7271. formalParameter := formalParameter.nextParameter;
  7272. END;
  7273. (* static call of the constructor *)
  7274. GetCodeSectionNameForSymbol(constructor,name);
  7275. ASSERT(~constructor.isInline);
  7276. IF constructor.scope.ownerModule # module.module THEN
  7277. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7278. ELSE
  7279. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7280. END;
  7281. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7282. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7283. Emit(Pop(position,pointer));
  7284. END;
  7285. (* call bodies *)
  7286. CallBodies(pointer,type);
  7287. SetLabel(exit);
  7288. needsTrace := p0.NeedsTrace();
  7289. IF needsTrace THEN ModifyAssignments(true) END;
  7290. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7291. Emit(Push(position, pointer));
  7292. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7293. Emit(Pop(position, pointer));
  7294. END;
  7295. Designate(p0,l);
  7296. IF needsTrace THEN
  7297. CallAssignPointer(l.op, pointer);
  7298. ELSE
  7299. ToMemory(l.op,addressType,0);
  7300. Emit(Mov(position,l.op,pointer));
  7301. END;
  7302. ReleaseIntermediateOperand(pointer);
  7303. ReleaseOperand(l);
  7304. IF needsTrace THEN ModifyAssignments(false) END;
  7305. ELSE (* not cooperative backend *)
  7306. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7307. IF temporaryVariable # NIL THEN
  7308. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7309. ELSE
  7310. Designate(p0,l);
  7311. END;
  7312. (* l.op contains address of pointer to record *)
  7313. Emit(Push(position,l.op)); (* address for use after syscall *)
  7314. Emit(Push(position,l.op));
  7315. ReleaseOperand(l);
  7316. (* push type descriptor *)
  7317. reg := TypeDescriptorAdr(recordType);
  7318. IF ~newObjectFile THEN
  7319. IntermediateCode.MakeMemory(reg,addressType);
  7320. END;
  7321. Emit(Push(position,reg));
  7322. ReleaseIntermediateOperand(reg);
  7323. (* push realtime flag *)
  7324. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7325. ELSE Emit(Push(position,false));
  7326. END;
  7327. CallThis(position,"Heaps","NewRec", 3);
  7328. (* check allocation success, if not successful then do not call initializers and bodies *)
  7329. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7330. Emit(Pop(position,pointer));
  7331. MakeMemory(reg,pointer,addressType,0);
  7332. ReleaseIntermediateOperand(pointer);
  7333. pointer := reg;
  7334. exit := NewLabel();
  7335. BreqL(exit,pointer,nil);
  7336. Emit(Push(position,pointer));
  7337. (* initialize fields *)
  7338. InitFields(recordType, pointer,0);
  7339. (* call initializer *)
  7340. constructor := GetConstructor(recordType);
  7341. IF constructor # NIL THEN
  7342. (*! should be unified with ProcedureCallDesignator *)
  7343. Emit(Push(position,pointer));
  7344. ReleaseIntermediateOperand(pointer);
  7345. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7346. FOR i := firstPar TO x.parameters.Length()-1 DO
  7347. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7348. formalParameter := formalParameter.nextParameter;
  7349. END;
  7350. (* static call of the constructor *)
  7351. GetCodeSectionNameForSymbol(constructor,name);
  7352. ASSERT(~constructor.isInline);
  7353. IF constructor.scope.ownerModule # module.module THEN
  7354. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7355. ELSE
  7356. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7357. END;
  7358. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7359. ELSE
  7360. ReleaseIntermediateOperand(pointer);
  7361. END;
  7362. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7363. Emit(Pop(position,pointer));
  7364. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7365. Designate(p0,l);
  7366. IF backend.writeBarriers & OnHeap(p0) THEN
  7367. SaveRegisters();ReleaseUsedRegisters(saved);
  7368. Emit(Push(position,l.op));
  7369. Emit(Push(position,pointer));
  7370. CallThis(position,"Heaps","Assign",2);
  7371. RestoreRegisters(saved);
  7372. ELSE
  7373. ToMemory(l.op,addressType,0);
  7374. Emit(Mov(position,l.op,pointer));
  7375. END;
  7376. ReleaseOperand(l);
  7377. result.tag := emptyOperand;
  7378. ELSIF (x.type # NIL) THEN
  7379. result := l; (* temporary variable is the result of NEW Type() *)
  7380. END;
  7381. (* call bodies *)
  7382. CallBodies(pointer,type);
  7383. ReleaseIntermediateOperand(pointer);
  7384. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7385. end := NewLabel();
  7386. BrL(end);
  7387. SetLabel(exit);
  7388. Designate(p0,l);
  7389. ToMemory(l.op,addressType,0);
  7390. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7391. ReleaseOperand(l);
  7392. SetLabel(end);
  7393. ELSE
  7394. SetLabel(exit);
  7395. END;
  7396. END;
  7397. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7398. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7399. IF ~backend.cooperative THEN (* simpler version *)
  7400. (*
  7401. push len0
  7402. push len1
  7403. push len2
  7404. push len_size
  7405. push len_adr
  7406. push tag
  7407. push static elements
  7408. push element size
  7409. push adr
  7410. *)
  7411. dim := 0;
  7412. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7413. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7414. parameter := x.parameters.GetExpression(i);
  7415. Evaluate(parameter,r);
  7416. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7417. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7418. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7419. END;
  7420. Emit(Push(position,r.op));
  7421. ReleaseOperand(r);
  7422. INC(dim);
  7423. END;
  7424. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7425. Emit(Mov(position, adr, sp));
  7426. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7427. Emit(Push(position, adr));
  7428. ReleaseIntermediateOperand(adr);
  7429. openDim := dim;
  7430. staticLength := 1;
  7431. IF type IS SyntaxTree.ArrayType THEN
  7432. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7433. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7434. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7435. END;
  7436. END;
  7437. IF SemanticChecker.ContainsPointer(type) THEN
  7438. tmp := TypeDescriptorAdr(type);
  7439. IF ~newObjectFile THEN
  7440. IntermediateCode.MakeMemory(tmp,addressType);
  7441. END;
  7442. ELSE
  7443. tmp := nil;
  7444. END;
  7445. Emit(Push(position,tmp)); (* type descriptor *)
  7446. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7447. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7448. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7449. Designate(p0,l);
  7450. Emit(Push(position,l.op)); (* address *)
  7451. ReleaseOperand(l);
  7452. CallThis(position,"Heaps","NewArray", 6);
  7453. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7454. Emit(Add(position,sp,sp,tmp));
  7455. ELSE
  7456. dim := 0;
  7457. IntermediateCode.InitOperand(reg);
  7458. IF p1 # NIL THEN
  7459. FOR i := firstPar TO x.parameters.Length()-1 DO
  7460. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7461. parameter := x.parameters.GetExpression(i);
  7462. Evaluate(parameter,r);
  7463. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7464. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7465. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7466. END;
  7467. Emit(Push(position,r.op));
  7468. IF i=1 THEN
  7469. CopyInt(reg,r.op);
  7470. ELSE
  7471. MulInt(reg, reg, r.op);
  7472. END;
  7473. ReleaseOperand(r);
  7474. INC(dim);
  7475. END;
  7476. Convert(reg,addressType);
  7477. ELSE
  7478. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7479. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7480. END;
  7481. openDim := dim;
  7482. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7483. IF backend.cooperative THEN
  7484. size := ToMemoryUnits(system,system.SizeOf(type));
  7485. WHILE type IS SyntaxTree.ArrayType DO
  7486. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7487. END;
  7488. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7489. IF (size # 1) THEN
  7490. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7491. END;
  7492. Emit(Push(position,reg));
  7493. size := ToMemoryUnits(system,system.SizeOf(type));
  7494. IF (size # 1) THEN
  7495. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7496. END;
  7497. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7498. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7499. Emit(Push(position,reg));
  7500. ReleaseIntermediateOperand(reg);
  7501. CallThis(position,"Runtime","New", 1);
  7502. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7503. Emit(Result(position, pointer));
  7504. exit := NewLabel();
  7505. else := NewLabel();
  7506. BreqL(else,pointer,nil);
  7507. IF ~type.hasPointers THEN
  7508. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7509. ELSIF type IS SyntaxTree.RecordType THEN
  7510. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7511. ELSIF type IS SyntaxTree.ProcedureType THEN
  7512. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7513. ELSE
  7514. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7515. END;
  7516. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7517. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7518. 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))));
  7519. IF type IS SyntaxTree.RecordType THEN
  7520. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7521. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7522. ELSE
  7523. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7524. END;
  7525. i := openDim;
  7526. WHILE i > 0 DO
  7527. DEC (i);
  7528. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7529. END;
  7530. needsTrace := p0.NeedsTrace();
  7531. IF needsTrace THEN ModifyAssignments(true) END;
  7532. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7533. Emit(Push(position, pointer));
  7534. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7535. Emit(Pop(position, pointer));
  7536. END;
  7537. Designate(p0,l);
  7538. IF needsTrace THEN
  7539. CallAssignPointer(l.op, pointer);
  7540. ModifyAssignments(false);
  7541. ELSE
  7542. ToMemory(l.op,addressType,0);
  7543. Emit(Mov(position,l.op,pointer));
  7544. END;
  7545. ReleaseIntermediateOperand(pointer);
  7546. ReleaseOperand(l);
  7547. BrL(exit);
  7548. SetLabel(else);
  7549. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7550. Designate(p0,l);
  7551. IF needsTrace THEN
  7552. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7553. ELSE
  7554. ToMemory(l.op,addressType,0);
  7555. Emit(Mov(position,l.op,pointer));
  7556. END;
  7557. ReleaseOperand(l);
  7558. SetLabel(exit);
  7559. ELSE
  7560. (*! the following code is only correct for "standard" Oberon calling convention *)
  7561. IF SemanticChecker.ContainsPointer(type) THEN
  7562. IF type IS SyntaxTree.ArrayType THEN
  7563. staticLength := 1;
  7564. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7565. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7566. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7567. END;
  7568. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7569. MulInt(reg,reg,tmp);
  7570. END;
  7571. Designate(p0,l);
  7572. IF openDim > 0 THEN
  7573. Emit(Push(position,l.op)); (* address for use after syscall *)
  7574. END;
  7575. Emit(Push(position,l.op)); (* address *)
  7576. ReleaseOperand(l);
  7577. tmp := TypeDescriptorAdr(type);
  7578. IF ~newObjectFile THEN
  7579. IntermediateCode.MakeMemory(tmp,addressType);
  7580. END;
  7581. Emit(Push(position,tmp)); (* type descriptor *)
  7582. ReleaseIntermediateOperand(tmp);
  7583. Emit(Push(position,reg)); (* number Elements *)
  7584. ReleaseIntermediateOperand(reg);
  7585. tmp := IntermediateCode.Immediate(addressType,dim);
  7586. Emit(Push(position,tmp)); (* dimensions *)
  7587. (* push realtime flag *)
  7588. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7589. ELSE Emit(Push(position,false));
  7590. END;
  7591. CallThis(position,"Heaps","NewArr",5)
  7592. ELSE
  7593. size := ToMemoryUnits(system,system.SizeOf(type));
  7594. IF (size # 1) THEN
  7595. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7596. (*
  7597. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7598. *)
  7599. END;
  7600. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7601. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7602. AddInt(reg, reg, tmp);
  7603. (*
  7604. Emit(Add(position,reg,reg,tmp));
  7605. *)
  7606. Designate(p0,l);
  7607. IF openDim >0 THEN
  7608. Emit(Push(position,l.op)); (* address for use after syscall *)
  7609. END;
  7610. Emit(Push(position,l.op)); (* address for syscall *)
  7611. ReleaseOperand(l); (* pointer address *)
  7612. Emit(Push(position,reg)); (* size *)
  7613. ReleaseIntermediateOperand(reg);
  7614. (* push realtime flag *)
  7615. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7616. ELSE Emit(Push(position,false));
  7617. END;
  7618. CallThis(position,"Heaps","NewSys", 3)
  7619. END;
  7620. IF openDim > 0 THEN
  7621. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7622. Emit(Pop(position,adr));
  7623. ToMemory(adr,addressType,0);
  7624. ReuseCopy(tmp,adr);
  7625. ReleaseIntermediateOperand(adr);
  7626. adr := tmp;
  7627. else := NewLabel();
  7628. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7629. i := openDim-1;
  7630. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7631. WHILE (i >= 0) DO
  7632. Emit(Pop(position,reg));
  7633. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7634. Emit(Mov(position,res,reg));
  7635. DEC(i);
  7636. END;
  7637. ReleaseIntermediateOperand(adr);
  7638. ReleaseIntermediateOperand(reg);
  7639. exit := NewLabel();
  7640. BrL(exit);
  7641. SetLabel(else);
  7642. (* else part: array could not be allocated *)
  7643. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7644. Emit(Add(position,sp,sp,tmp));
  7645. SetLabel(exit);
  7646. END;
  7647. END;
  7648. END;
  7649. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7650. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7651. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7652. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7653. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7654. left.SetType(procedure.type);
  7655. formalParameter := procedureType.firstParameter;
  7656. (* push array to allocate *)
  7657. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7658. formalParameter :=formalParameter.nextParameter;
  7659. (* push length array *)
  7660. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7661. (* push size *)
  7662. type := t0;
  7663. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7664. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7665. END;
  7666. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7667. Emit(Push(position,tmp));
  7668. (* *)
  7669. IF SemanticChecker.ContainsPointer(type) THEN
  7670. tmp := TypeDescriptorAdr(type);
  7671. IF ~newObjectFile THEN
  7672. IntermediateCode.MakeMemory(tmp,addressType);
  7673. END;
  7674. ELSE
  7675. tmp := IntermediateCode.Immediate(addressType, 0);
  7676. END;
  7677. Emit(Push(position,tmp)); (* type descriptor *)
  7678. StaticCallOperand(result,procedure);
  7679. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7680. ReleaseOperand(result);
  7681. END;
  7682. (*
  7683. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7684. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7685. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7686. *)
  7687. ELSE
  7688. (*
  7689. push len0
  7690. push len1
  7691. push len2
  7692. push size
  7693. push len_adr
  7694. push element_size
  7695. push tag
  7696. push adr
  7697. *)
  7698. dim := 0;
  7699. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7700. isTensor := TRUE;
  7701. ELSE
  7702. isTensor := FALSE;
  7703. END;
  7704. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7705. IF ~isTensor THEN
  7706. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7707. END;
  7708. parameter := x.parameters.GetExpression(i);
  7709. Evaluate(parameter,r);
  7710. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7711. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7712. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7713. END;
  7714. Emit(Push(position,r.op));
  7715. ReleaseOperand(r);
  7716. INC(dim);
  7717. END;
  7718. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7719. Emit(Mov(position, adr, sp));
  7720. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7721. Emit(Push(position, adr));
  7722. ReleaseIntermediateOperand(adr);
  7723. openDim := dim;
  7724. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7725. IF isTensor THEN
  7726. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7727. ELSE
  7728. baseType := SemanticChecker.ArrayBase(type,openDim);
  7729. END;
  7730. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7731. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7732. IF SemanticChecker.ContainsPointer(baseType) THEN
  7733. tmp := TypeDescriptorAdr(baseType);
  7734. IF ~newObjectFile THEN
  7735. IntermediateCode.MakeMemory(tmp,addressType);
  7736. END;
  7737. ELSE
  7738. tmp := nil;
  7739. END;
  7740. Emit(Push(position,tmp)); (* type descriptor *)
  7741. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7742. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7743. ELSE (* error message has already been emited *)
  7744. RETURN;
  7745. END;
  7746. Designate(p0,l);
  7747. IF isTensor THEN
  7748. Emit(Push(position,l.op)); (* address *)
  7749. ELSE
  7750. Emit(Push(position,l.tag)); (* address *)
  7751. END;
  7752. ReleaseOperand(l);
  7753. StaticCallOperand(result,procedure);
  7754. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7755. ReleaseOperand(result);
  7756. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7757. Emit(Add(position,sp,sp,tmp));
  7758. END;
  7759. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7760. THEN
  7761. IF ~backend.cellsAreObjects THEN RETURN END;
  7762. IF InCellScope(currentScope) THEN
  7763. PushSelfPointer()
  7764. ELSE
  7765. Emit(Push(position, nil));
  7766. END;
  7767. (* push temp address *)
  7768. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7769. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7770. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7771. (* l.op contains address of pointer to record *)
  7772. Emit(Push(position,l.op)); (* address for use after syscall *)
  7773. ReleaseOperand(l);
  7774. (* push type descriptor *)
  7775. reg := TypeDescriptorAdr(baseType);
  7776. IF ~newObjectFile THEN
  7777. IntermediateCode.MakeMemory(reg,addressType);
  7778. END;
  7779. Emit(Push(position,reg));
  7780. ReleaseIntermediateOperand(reg);
  7781. (* push name *)
  7782. (*Global.GetSymbolName(p0, n);*)
  7783. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7784. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7785. ELSE
  7786. Global.GetModuleName(module.module, n);
  7787. END;
  7788. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7789. (*type.typeDeclaration.GetName(n);*)
  7790. PushConstString(n);
  7791. (* push cellnet boolean *)
  7792. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7793. (* push engine boolean *)
  7794. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7795. (* allocate *)
  7796. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7797. (* add capabilities *)
  7798. modifier := p0(SyntaxTree.Designator).modifiers;
  7799. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7800. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7801. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7802. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7803. END;
  7804. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7805. (*
  7806. modifier := baseType(SyntaxTree.CellType).modifiers;
  7807. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7808. modifier := p0(SyntaxTree.Designator).modifiers;
  7809. *)
  7810. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7811. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7812. (* l.op contains address of pointer to record *)
  7813. ToMemory(l.op,addressType,0);
  7814. (* l.op contains value of pointer to record *)
  7815. Emit(Push(position,l.op)); (* address for use after syscall *)
  7816. ReleaseOperand(l);
  7817. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7818. prevScope := currentScope;
  7819. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7820. previous := section;
  7821. section := init;
  7822. (* add ports *)
  7823. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7824. CloseInitializer(previous);
  7825. currentScope := prevScope;
  7826. Symbol(temporaryVariable,l);
  7827. ToMemory(l.op,addressType,0);
  7828. Emit(Push(position,l.op));
  7829. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7830. (*
  7831. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7832. IF constructor # NIL THEN
  7833. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7834. FOR i := 1 TO x.parameters.Length()-1 DO
  7835. p := x.parameters.GetExpression(i);
  7836. Global.GetSymbolName(parameter,name);
  7837. Evaluate(p, value);
  7838. ASSERT(value.type # NIL);
  7839. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7840. par := instance.AddParameter(name);
  7841. par.SetInteger(value.integer);
  7842. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7843. par := instance.AddParameter(name);
  7844. par.SetBoolean(value.boolean);
  7845. ELSE Error(x.position,NotYetImplemented)
  7846. END;
  7847. parameter := parameter.nextParameter
  7848. END;
  7849. END;
  7850. *)
  7851. (* call initializer *)
  7852. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7853. IF constructor # NIL THEN
  7854. (*! should be unified with ProcedureCallDesignator *)
  7855. IF backend.cellsAreObjects THEN
  7856. Symbol(temporaryVariable,l);
  7857. ToMemory(l.op,addressType,0);
  7858. Emit(Push(position,l.op));
  7859. ReleaseOperand(l);
  7860. END;
  7861. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7862. FOR i := firstPar TO x.parameters.Length()-1 DO
  7863. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7864. formalParameter := formalParameter.nextParameter;
  7865. END;
  7866. (* static call of the constructor *)
  7867. Global.GetSymbolSegmentedName(constructor,name);
  7868. ASSERT(~constructor.isInline);
  7869. IF constructor.scope.ownerModule # module.module THEN
  7870. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7871. ELSE
  7872. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7873. END;
  7874. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7875. (*ELSE
  7876. ReleaseIntermediateOperand(pointer);*)
  7877. END;
  7878. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7879. ToMemory(l.op, addressType, 0);
  7880. Designate(p0,s0);
  7881. ToMemory(s0.op,addressType,0);
  7882. Emit(Mov(position,s0.op,l.op));
  7883. ReleaseOperand(l);
  7884. ReleaseOperand(s0);
  7885. result.tag := emptyOperand;
  7886. (* start *)
  7887. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7888. (* push cell *)
  7889. Symbol(temporaryVariable, l);
  7890. ToMemory(l.op,addressType,0);
  7891. Emit(Push(Basic.invalidPosition,l.op));
  7892. (* push delegate *)
  7893. Emit(Push(Basic.invalidPosition,l.op));
  7894. ReleaseOperand(l);
  7895. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7896. Emit(Push(position, s1.op));
  7897. ReleaseOperand(s1);
  7898. CallThis(position,"ActiveCellsRuntime","Start",3);
  7899. END;
  7900. (*IF temporaryVariable # NIL THEN
  7901. end := NewLabel();
  7902. BrL(end);
  7903. SetLabel(exit);
  7904. Designate(p0,l);
  7905. ToMemory(l.op,addressType,0);
  7906. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7907. ReleaseOperand(l);
  7908. SetLabel(end);
  7909. ELSE
  7910. SetLabel(exit);
  7911. END;
  7912. *)
  7913. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7914. ELSE (* no pointer to record, no pointer to array *)
  7915. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7916. (* ignore new statement *)
  7917. Warning(p0.position, "cannot run on final hardware");
  7918. ELSE
  7919. HALT(200);
  7920. END;
  7921. END;
  7922. (* ---- ADDRESSOF----- *)
  7923. |Global.systemAdr:
  7924. Designate(p0,s0);
  7925. s0.mode := ModeValue;
  7926. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7927. ReleaseIntermediateOperand(s0.op);
  7928. s0.op := s0.tag;
  7929. IntermediateCode.InitOperand(s0.tag);
  7930. END;
  7931. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7932. result := s0;
  7933. (* ---- BIT ----- *)
  7934. |Global.systemBit:
  7935. Evaluate(p0,s0);
  7936. ToMemory(s0.op,addressType,0);
  7937. ReuseCopy(res,s0.op);
  7938. ReleaseOperand(s0);
  7939. Evaluate(p1,s1);
  7940. Emit(Ror(position,res,res,s1.op));
  7941. ReleaseOperand(s1);
  7942. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7943. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7944. IF ~conditional THEN
  7945. InitOperand(result,ModeValue); result.op := res;
  7946. ELSE
  7947. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7948. BrL(falseLabel);
  7949. ReleaseIntermediateOperand(res);
  7950. END;
  7951. (* --- MSK ----*)
  7952. |Global.systemMsk:
  7953. Evaluate(p0,s0);
  7954. Evaluate(p1,s1);
  7955. ReuseCopy(res,s0.op);
  7956. ReleaseOperand(s0);
  7957. Emit(And(position,res,res,s1.op));
  7958. ReleaseOperand(s1);
  7959. InitOperand(result,ModeValue);
  7960. result.op := res;
  7961. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7962. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7963. Evaluate(p0,s0);
  7964. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7965. ReleaseOperand(s0);
  7966. InitOperand(result,ModeValue);
  7967. result.op := res;
  7968. (* ---- SYSTEM.GetStackPointer ----- *)
  7969. |Global.systemGetStackPointer:
  7970. InitOperand(result,ModeValue);
  7971. result.op := sp;
  7972. (* ---- SYSTEM.GetFramePointer ----- *)
  7973. |Global.systemGetFramePointer:
  7974. InitOperand(result,ModeValue);
  7975. result.op := fp;
  7976. (* ---- SYSTEM.GetActivity ----- *)
  7977. |Global.systemGetActivity:
  7978. ASSERT(backend.cooperative);
  7979. InitOperand(result,ModeValue);
  7980. result.op := ap;
  7981. (* ---- SYSTEM.SetStackPointer ----- *)
  7982. |Global.systemSetStackPointer:
  7983. Evaluate(p0,s0); (* *)
  7984. Emit(Mov(position,sp,s0.op));
  7985. ReleaseOperand(s0);
  7986. (* ---- SYSTEM.SetFramePointer ----- *)
  7987. |Global.systemSetFramePointer:
  7988. Evaluate(p0,s0); (* *)
  7989. Emit(Mov(position,fp,s0.op));
  7990. ReleaseOperand(s0);
  7991. (* ---- SYSTEM.Activity ----- *)
  7992. |Global.systemSetActivity:
  7993. ASSERT(backend.cooperative);
  7994. Evaluate(p0,s0); (* *)
  7995. Emit(Mov(position,ap,s0.op));
  7996. ReleaseOperand(s0);
  7997. (* ---- SYSTEM.VAL ----- *)
  7998. |Global.systemVal:
  7999. Expression(p1);
  8000. s1 := result;
  8001. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8002. IF s1.mode = ModeReference THEN
  8003. (* nothing to be done if not record type, just take over new type *)
  8004. IF (type IS SyntaxTree.RecordType) THEN
  8005. ReleaseIntermediateOperand(s1.tag);
  8006. s1.tag := TypeDescriptorAdr(type);
  8007. IF ~newObjectFile THEN
  8008. IntermediateCode.MakeMemory(s1.tag,addressType);
  8009. END;
  8010. UseIntermediateOperand(s1.tag);
  8011. END;
  8012. result := s1;
  8013. ELSE (* copy over result to different type, may not use convert *)
  8014. itype := IntermediateCode.GetType(system,type);
  8015. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8016. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8017. Emit(Mov(position,s0.op,s1.op));
  8018. ReleaseOperand(s1);
  8019. InitOperand(result,ModeValue);
  8020. result.op := s0.op;
  8021. ELSE (* different size, must convert *)
  8022. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8023. Convert(s1.op, IntermediateCode.GetType(system,type));
  8024. result := s1;
  8025. END;
  8026. END;
  8027. (* ---- SYSTEM.GET ----- *)
  8028. |Global.systemGet:
  8029. Evaluate(p0,s0); (* adr *)
  8030. Designate(p1,s1); (* variable *)
  8031. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8032. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8033. Emit(Mov(position,s1.op,s0.op));
  8034. ReleaseOperand(s1);
  8035. ReleaseOperand(s0);
  8036. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8037. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8038. Evaluate(p0,s0); (* *)
  8039. Evaluate(p1,s1); (* variable *)
  8040. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8041. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8042. (* real part *)
  8043. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8044. Emit(Mov(position,res, s1.op));
  8045. ReleaseIntermediateOperand(res);
  8046. (* imaginary part *)
  8047. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8048. Emit(Mov(position,res, s1.tag));
  8049. ReleaseIntermediateOperand(res);
  8050. ReleaseOperand(s1);
  8051. ReleaseOperand(s0);
  8052. ELSE
  8053. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8054. ReleaseOperand(s0);
  8055. Emit(Mov(position,res,s1.op));
  8056. ReleaseIntermediateOperand(res);
  8057. ReleaseOperand(s1);
  8058. END;
  8059. (* ---- SYSTEM.MOVE ----- *)
  8060. |Global.systemMove:
  8061. Evaluate(p0,s0);
  8062. Evaluate(p1,s1);
  8063. Evaluate(p2,s2);
  8064. Emit(Copy(position,s1.op,s0.op,s2.op));
  8065. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8066. (* ---- SYSTEM.NEW ----- *)
  8067. |Global.systemNew:
  8068. Designate(p0,s0);
  8069. Emit(Push(position,s0.op));
  8070. ReleaseOperand(s0);
  8071. Evaluate(p1,s1);
  8072. Emit(Push(position,s1.op));
  8073. ReleaseOperand(s1);
  8074. (* push realtime flag: false by default *)
  8075. Emit(Push(position,false));
  8076. CallThis(position,"Heaps","NewSys",3);
  8077. (* ---- SYSTEM.CALL ----- *)
  8078. |Global.systemRef:
  8079. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8080. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8081. s0.mode := ModeValue;
  8082. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8083. result := s0
  8084. (* ---- INCR ----- *)
  8085. |Global.Incr:
  8086. Designate(p0,operand);
  8087. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8088. Dereference(operand,p0.type.resolved,FALSE);
  8089. END;
  8090. ASSERT(p1 # NIL);
  8091. Evaluate(p1,l);
  8092. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8093. ReleaseOperand(operand); ReleaseOperand(l);
  8094. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8095. (* ---- SUM ----- *)
  8096. |Global.Sum: HALT(200);
  8097. (* ---- ALL ----- *)
  8098. |Global.All: HALT(200);
  8099. (* ---- CAS ----- *)
  8100. |Global.Cas:
  8101. needsTrace := p0.NeedsTrace();
  8102. IF needsTrace THEN ModifyAssignments(true) END;
  8103. Designate(p0,s0);
  8104. Evaluate(p1,s1);
  8105. Evaluate(p2,s2);
  8106. IF needsTrace THEN
  8107. Emit(Push(position, s0.op));
  8108. Emit(Push(position, s1.op));
  8109. Emit(Push(position, s2.op));
  8110. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8111. ELSE
  8112. Emit(Cas(position,s0.op,s1.op,s2.op));
  8113. END;
  8114. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8115. IF needsTrace THEN ModifyAssignments(false) END;
  8116. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8117. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8118. IF conditional THEN
  8119. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8120. BrL(falseLabel);
  8121. ReleaseIntermediateOperand(res);
  8122. END;
  8123. (* ---- DIM ----- *)
  8124. |Global.Dim:
  8125. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8126. Designate(p0,s0);
  8127. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8128. Dereference(s0,p0.type.resolved,FALSE);
  8129. END;
  8130. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8131. ReleaseOperand(s0);
  8132. (* ---- RESHAPE ----- *)
  8133. |Global.Reshape:
  8134. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8135. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8136. left.SetType(procedure.type);
  8137. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8138. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8139. END;
  8140. (* ---- SYSTEM.TYPECODE ----- *)
  8141. |Global.systemTypeCode:
  8142. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8143. IF type.resolved IS SyntaxTree.PointerType THEN
  8144. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8145. END;
  8146. result.op := TypeDescriptorAdr(type);
  8147. IF ~newObjectFile THEN
  8148. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  8149. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  8150. END;
  8151. result.mode := ModeValue;
  8152. (* ---- SYSTEM.TRACE ----- *)
  8153. |Global.systemTrace:
  8154. SystemTrace(x.parameters, x.position);
  8155. (* ----- CONNECT ------*)
  8156. |Global.Connect:
  8157. IF backend.cellsAreObjects THEN
  8158. PushPort(p0);
  8159. PushPort(p1);
  8160. IF p2 # NIL THEN
  8161. Evaluate(p2, s2);
  8162. Emit(Push(p2.position, s2.op));
  8163. ReleaseOperand(s2);
  8164. ELSE
  8165. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8166. END;
  8167. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8168. ELSE
  8169. Warning(x.position, "cannot run on final hardware");
  8170. END;
  8171. (* ----- DELEGATE ------*)
  8172. |Global.Delegate:
  8173. IF backend.cellsAreObjects THEN
  8174. PushPort(p0);
  8175. PushPort(p1);
  8176. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8177. ELSE
  8178. Warning(x.position, "cannot run on final hardware");
  8179. END;
  8180. (* ----- SEND ------*)
  8181. |Global.Send:
  8182. Evaluate(p0,s0);
  8183. Evaluate(p1,s1);
  8184. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8185. Emit(Push(position,s0.op));
  8186. Emit(Push(position,s1.op));
  8187. (*
  8188. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8189. *)
  8190. IF ~backend.cellsAreObjects THEN
  8191. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8192. END;
  8193. ReleaseOperand(s0);
  8194. ReleaseOperand(s1);
  8195. IF backend.cellsAreObjects THEN
  8196. CallThis(position,"ActiveCellsRuntime","Send",2);
  8197. ELSE
  8198. CallThis(position,ChannelModuleName,"Send",2);
  8199. END;
  8200. (* ----- RECEIVE ------*)
  8201. |Global.Receive:
  8202. Evaluate(p0,s0);
  8203. Emit(Push(position,s0.op));
  8204. Designate(p1,s1);
  8205. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8206. Emit(Push(position,s1.op));
  8207. IF p2 # NIL THEN
  8208. Designate(p2,s2);
  8209. Emit(Push(position,s2.op));
  8210. END;
  8211. (*
  8212. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8213. *)
  8214. IF ~backend.cellsAreObjects THEN
  8215. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8216. END;
  8217. ReleaseOperand(s0);
  8218. ReleaseOperand(s1);
  8219. ReleaseOperand(s2);
  8220. IF backend.cellsAreObjects THEN
  8221. IF p2 = NIL THEN
  8222. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8223. ELSE
  8224. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8225. END;
  8226. ELSE
  8227. IF p2 = NIL THEN
  8228. CallThis(position,ChannelModuleName,"Receive",2)
  8229. ELSE
  8230. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8231. END;
  8232. END;
  8233. | Global.systemSpecial:
  8234. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8235. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8236. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8237. (* determine if parameters are of the VAR kind *)
  8238. ASSERT(x.parameters.Length() <= 3);
  8239. formalParameter := procedureType.firstParameter;
  8240. FOR i := 0 TO x.parameters.Length() - 1 DO
  8241. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8242. formalParameter := formalParameter.nextParameter
  8243. END;
  8244. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8245. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8246. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8247. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8248. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8249. IF procedureType.returnType # NIL THEN
  8250. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8251. Emit(Result(position, res));
  8252. (*InitOperand(result,ModeValue);
  8253. result.op := res;
  8254. *)
  8255. IF ~conditional THEN
  8256. InitOperand(result,ModeValue); result.op := res;
  8257. ELSE
  8258. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8259. BrL(falseLabel);
  8260. ReleaseIntermediateOperand(res);
  8261. END;
  8262. END
  8263. ELSE (* function not yet implemented *)
  8264. Error(position,"not yet implemented");
  8265. END;
  8266. destination := dest;
  8267. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8268. END VisitBuiltinCallDesignator;
  8269. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  8270. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8271. BEGIN
  8272. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8273. dest := destination; destination := emptyOperand;
  8274. Expression(x.left);
  8275. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8276. ELSIF isUnchecked THEN (* no check *)
  8277. ELSE
  8278. trueL := NewLabel();
  8279. falseL := NewLabel();
  8280. IF IsPointerToRecord(x.left.type,recordType) THEN
  8281. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8282. Emit(Mov(position,tag, result.op));
  8283. IF result.mode # ModeValue THEN
  8284. ptr := tag;
  8285. IntermediateCode.MakeMemory(ptr,addressType);
  8286. Emit(Mov(position,tag, ptr));
  8287. END;
  8288. IF ~backend.cooperative THEN
  8289. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8290. END;
  8291. IntermediateCode.MakeMemory(tag,addressType);
  8292. ELSE
  8293. tag := result.tag;
  8294. UseIntermediateOperand(tag);
  8295. END;
  8296. TypeTest(tag,x.type,trueL,falseL);
  8297. ReleaseIntermediateOperand(tag);
  8298. SetLabel(falseL);
  8299. EmitTrap(position,TypeCheckTrap);
  8300. SetLabel(trueL);
  8301. END;
  8302. destination := dest;
  8303. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8304. END VisitTypeGuardDesignator;
  8305. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8306. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8307. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8308. VAR label: Label; pc: LONGINT;
  8309. BEGIN
  8310. IF backend.cooperative & ~isUnchecked THEN
  8311. pc := section.pc;
  8312. label := NewLabel();
  8313. BrneL(label, operand.op, nil);
  8314. EmitTrap(position, NilPointerTrap);
  8315. SetLabel(label);
  8316. INC(statCoopNilCheck, section.pc - pc);
  8317. END;
  8318. END NilCheck;
  8319. BEGIN
  8320. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8321. ReuseCopy(dereferenced,operand.op);
  8322. ReleaseOperand(operand);
  8323. operand.mode := ModeReference;
  8324. operand.op := dereferenced;
  8325. operand.tag := dereferenced;
  8326. UseIntermediateOperand(operand.tag);
  8327. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8328. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8329. ReleaseIntermediateOperand(operand.tag);
  8330. operand.tag := TypeDescriptorAdr(type);
  8331. IF ~newObjectFile THEN
  8332. IntermediateCode.MakeMemory(operand.tag,addressType);
  8333. END;
  8334. ELSE
  8335. IF ~backend.cooperative THEN
  8336. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8337. END;
  8338. IntermediateCode.MakeMemory(operand.tag,addressType);
  8339. END;
  8340. NilCheck(operand.op);
  8341. ELSIF type IS SyntaxTree.ArrayType THEN
  8342. IF isUnsafe THEN
  8343. NilCheck(operand.op);
  8344. ReleaseIntermediateOperand(operand.tag);
  8345. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8346. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8347. ELSE
  8348. operand.tag := emptyOperand;
  8349. END;
  8350. ELSE
  8351. NilCheck(operand.op);
  8352. IF backend.cooperative THEN
  8353. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8354. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8355. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8356. ELSE
  8357. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8358. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8359. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8360. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8361. END;
  8362. END;
  8363. ELSIF type IS SyntaxTree.MathArrayType THEN
  8364. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8365. IntermediateCode.MakeMemory(operand.op,addressType);
  8366. ELSE HALT(100);
  8367. END;
  8368. END Dereference;
  8369. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8370. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8371. BEGIN
  8372. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8373. dest := destination; destination := emptyOperand;
  8374. Evaluate(x.left,d);
  8375. type := x.type.resolved;
  8376. prevIsUnchecked := isUnchecked;
  8377. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8378. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8379. END;
  8380. Dereference(d,type,IsUnsafePointer(x.left.type));
  8381. isUnchecked := prevIsUnchecked;
  8382. result := d;
  8383. 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
  8384. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8385. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8386. END;
  8387. END;
  8388. destination := dest;
  8389. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8390. END VisitDereferenceDesignator;
  8391. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8392. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8393. BEGIN
  8394. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8395. dest := destination; destination := emptyOperand;
  8396. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8397. tag := result.op;
  8398. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8399. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8400. StaticCallOperand(result,procedure.super);
  8401. ReleaseIntermediateOperand(result.tag);
  8402. UseIntermediateOperand(tag); (* necessary ? *)
  8403. result.tag := tag;
  8404. destination := dest;
  8405. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8406. END VisitSupercallDesignator;
  8407. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8408. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8409. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8410. name: Basic.SegmentedName;
  8411. procedure: SyntaxTree.Procedure;
  8412. procedureType: SyntaxTree.ProcedureType;
  8413. BEGIN
  8414. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8415. dest := destination; destination := emptyOperand;
  8416. scope := currentScope;
  8417. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8418. scope := scope.outerScope;
  8419. END;
  8420. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8421. IF newObjectFile THEN
  8422. moduleSection := meta.ModuleSection();
  8423. IF backend.cooperative THEN
  8424. moduleOffset := 0;
  8425. ELSE
  8426. moduleOffset := moduleSection.pc;
  8427. END;
  8428. result.mode := ModeValue;
  8429. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8430. ELSE
  8431. Symbol(moduleSelf,result);
  8432. IntermediateCode.MakeMemory(result.op,addressType);
  8433. END
  8434. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8435. result.mode := ModeValue;
  8436. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8437. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8438. ELSE
  8439. GetBaseRegister(basereg,currentScope,scope);
  8440. InitOperand(result,ModeReference);
  8441. result.op := basereg;
  8442. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8443. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8444. parametersSize := ProcedureParametersSize(system,procedure);
  8445. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8446. IF backend.cooperative THEN
  8447. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8448. END;
  8449. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8450. MakeMemory(result.op, result.op, addressType, 0);
  8451. END;
  8452. (* tag must be loaded when dereferencing SELF pointer *)
  8453. END;
  8454. destination := dest;
  8455. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8456. END VisitSelfDesignator;
  8457. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8458. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8459. BEGIN
  8460. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8461. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8462. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8463. parameter := procedureType.returnParameter;
  8464. IF currentIsInline THEN
  8465. map := currentMapper.Get(NIL);
  8466. IF map # NIL THEN
  8467. Designate(map.to, result);
  8468. ELSE
  8469. HALT(200);
  8470. END;
  8471. RETURN;
  8472. END;
  8473. VisitParameter(parameter);
  8474. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8475. END VisitResultDesignator;
  8476. (** values *)
  8477. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8478. BEGIN
  8479. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8480. IF conditional THEN
  8481. IF x.value THEN BrL(trueLabel)
  8482. ELSE BrL(falseLabel)
  8483. END;
  8484. ELSE
  8485. InitOperand(result,ModeValue);
  8486. IF x.value THEN result.op := true ELSE result.op := false END;
  8487. END;
  8488. END VisitBooleanValue;
  8489. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8490. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8491. BEGIN
  8492. Global.GetModuleSegmentedName(module.module, name);
  8493. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8494. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8495. RETURN section
  8496. END GetDataSection;
  8497. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8498. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8499. BEGIN
  8500. type := vop.type;
  8501. data := GetDataSection();
  8502. pc := EnterImmediate(data,vop);
  8503. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8504. IntermediateCode.MakeMemory(vop, type);
  8505. END GetImmediateMem;
  8506. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8507. BEGIN
  8508. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8509. InitOperand(result,ModeValue);
  8510. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8511. IF ~supportedImmediate(result.op) &~inData THEN
  8512. GetImmediateMem(result.op)
  8513. END;
  8514. END VisitIntegerValue;
  8515. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8516. BEGIN
  8517. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8518. InitOperand(result,ModeValue);
  8519. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8520. END VisitCharacterValue;
  8521. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8522. BEGIN
  8523. IF Trace THEN TraceEnter("VisitSetValue") END;
  8524. InitOperand(result,ModeValue);
  8525. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8526. END VisitSetValue;
  8527. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8528. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8529. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8530. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8531. BEGIN
  8532. numberElements := x.elements.Length();
  8533. FOR i := 0 TO numberElements-1 DO
  8534. expression := x.elements.GetExpression(i);
  8535. IF expression IS SyntaxTree.MathArrayExpression THEN
  8536. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8537. ELSE
  8538. inData := TRUE;
  8539. Evaluate(expression,op);
  8540. irv.Emit(Data(position,op.op));
  8541. inData := FALSE;
  8542. ReleaseOperand(op);
  8543. END;
  8544. END;
  8545. END RecursiveData;
  8546. BEGIN
  8547. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8548. IF ~TryConstantDeclaration() THEN
  8549. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8550. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8551. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8552. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8553. ELSE
  8554. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8555. END;
  8556. RecursiveData(x.array);
  8557. InitOperand(result,ModeReference);
  8558. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8559. END
  8560. END VisitMathArrayValue;
  8561. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8562. VAR constant: Sections.Section;
  8563. BEGIN
  8564. IF constantDeclaration = NIL THEN
  8565. RETURN FALSE
  8566. ELSE
  8567. (* Is a constant in this module: did we generate it already? *)
  8568. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8569. IF constant # NIL THEN
  8570. InitOperand(result,ModeReference);
  8571. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8572. RETURN TRUE;
  8573. END;
  8574. END;
  8575. RETURN FALSE
  8576. END TryConstantDeclaration;
  8577. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8578. BEGIN
  8579. constantDeclaration := x;
  8580. x.value.resolved.Accept(SELF);
  8581. END VisitConstant;
  8582. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8583. BEGIN
  8584. IF Trace THEN TraceEnter("VisitRealValue") END;
  8585. InitOperand(result,ModeValue);
  8586. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8587. END VisitRealValue;
  8588. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8589. VAR
  8590. componentType: SyntaxTree.Type;
  8591. BEGIN
  8592. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8593. ASSERT(x.type IS SyntaxTree.ComplexType);
  8594. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8595. InitOperand(result,ModeValue);
  8596. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8597. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8598. END VisitComplexValue;
  8599. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8600. VAR i: LONGINT; name: Basic.SegmentedName;
  8601. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8602. BEGIN
  8603. IF Trace THEN TraceEnter("VisitStringValue") END;
  8604. IF ~TryConstantDeclaration() THEN
  8605. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8606. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8607. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8608. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8609. ELSE
  8610. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8611. END;
  8612. FOR i := 0 TO x.length-1 DO
  8613. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8614. irv.Emit(Data(position,op));
  8615. END;
  8616. InitOperand(result,ModeReference);
  8617. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8618. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8619. END
  8620. END VisitStringValue;
  8621. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8622. BEGIN
  8623. IF Trace THEN TraceEnter("VisitNilValue") END;
  8624. InitOperand(result,ModeValue);
  8625. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8626. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8627. END VisitNilValue;
  8628. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8629. BEGIN
  8630. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8631. InitOperand(result,ModeValue);
  8632. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8633. END VisitEnumerationValue;
  8634. (** symbols *)
  8635. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8636. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8637. END VisitImport;
  8638. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8639. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8640. BEGIN
  8641. IF scope # baseScope THEN
  8642. (* left := [fp+8] *)
  8643. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8644. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8645. ReuseCopy(left,right);
  8646. ReleaseIntermediateOperand(right);
  8647. scope := scope.outerScope; DEC(level);
  8648. (* { left := [left+8] } *)
  8649. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8650. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8651. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8652. Emit(Mov(position,left,right));
  8653. scope := scope.outerScope; DEC(level);
  8654. END;
  8655. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8656. result := left;
  8657. ELSE
  8658. result := fp;
  8659. END;
  8660. END GetBaseRegister;
  8661. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8662. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8663. BEGIN
  8664. IF Trace THEN TraceEnter("VisitVariable"); END;
  8665. type := x.type.resolved;
  8666. IF (x.useRegister) THEN
  8667. InitOperand(result, ModeValue);
  8668. IF x.registerNumber < 0 THEN
  8669. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8670. reg := x.registerNumber;
  8671. ELSE
  8672. reg := registerUsageCount.Map(x.registerNumber);
  8673. UseRegister(reg);
  8674. END;
  8675. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8676. ELSIF x.externalName # NIL THEN
  8677. InitOperand(result,ModeReference);
  8678. Basic.ToSegmentedName(x.externalName^, name);
  8679. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8680. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8681. InitOperand(result,ModeReference);
  8682. GetBaseRegister(result.op,currentScope,x.scope);
  8683. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8684. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8685. InitOperand(result,ModeReference);
  8686. GetCodeSectionNameForSymbol(x,name);
  8687. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8688. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8689. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8690. InitOperand(result,ModeReference);
  8691. GetCodeSectionNameForSymbol(x,name);
  8692. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8693. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8694. ELSE (* field, left designator must have been emitted *)
  8695. ASSERT(result.mode = ModeReference);
  8696. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8697. ReuseCopy(temp,result.op);
  8698. ReleaseIntermediateOperand(result.op);
  8699. result.op := temp;
  8700. END;
  8701. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8702. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8703. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8704. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8705. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8706. END;
  8707. END;
  8708. END;
  8709. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8710. ValueToCondition(result);
  8711. ELSIF type IS SyntaxTree.ProcedureType THEN
  8712. ReleaseIntermediateOperand(result.tag);
  8713. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8714. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8715. UseIntermediateOperand(result.tag);
  8716. ELSE
  8717. result.tag := nil; (* nil *)
  8718. END;
  8719. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8720. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8721. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8722. ReleaseIntermediateOperand(result.tag);
  8723. Global.GetSymbolSegmentedName(x,name);
  8724. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8725. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8726. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8727. ELSE
  8728. END;
  8729. ELSE
  8730. ReleaseIntermediateOperand(result.tag);
  8731. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8732. END;
  8733. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8734. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8735. ReleaseIntermediateOperand(result.tag);
  8736. result.tag := result.op;
  8737. UseIntermediateOperand(result.tag);
  8738. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8739. IntermediateCode.MakeMemory(result.op,addressType);
  8740. END;
  8741. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8742. ReleaseIntermediateOperand(result.tag);
  8743. result.tag := TypeDescriptorAdr(type);
  8744. IF ~newObjectFile THEN
  8745. IntermediateCode.MakeMemory(result.tag,addressType);
  8746. END;
  8747. UseIntermediateOperand(result.tag);
  8748. (* tag for pointer type computed not here but during dereferencing *)
  8749. END;
  8750. IF Trace THEN TraceExit("VisitVariable") END;
  8751. END VisitVariable;
  8752. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8753. BEGIN
  8754. VisitVariable(property);
  8755. END VisitProperty;
  8756. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8757. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8758. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8759. BEGIN
  8760. type := x.type.resolved;
  8761. IF Trace THEN TraceEnter("VisitParameter") END;
  8762. IF x.ownerType IS SyntaxTree.CellType THEN
  8763. ptype := x.type.resolved;
  8764. IF backend.cellsAreObjects THEN
  8765. ASSERT(result.mode = ModeReference);
  8766. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8767. ReuseCopy(temp,result.op);
  8768. ReleaseIntermediateOperand(result.op);
  8769. result.op := temp;
  8770. END;
  8771. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8772. RETURN;
  8773. ELSE
  8774. InitOperand(result,ModeReference);
  8775. GetCodeSectionNameForSymbol(x,name);
  8776. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8777. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8778. RETURN;
  8779. END;
  8780. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8781. InitOperand(result,ModeReference);
  8782. GetCodeSectionNameForSymbol(x,name);
  8783. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8784. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8785. RETURN
  8786. ELSE
  8787. GetBaseRegister(basereg,currentScope,x.scope);
  8788. InitOperand(result,ModeReference);
  8789. result.op := basereg;
  8790. END;
  8791. IF IsOpenArray(type) THEN
  8792. result.tag := basereg;
  8793. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8794. IntermediateCode.MakeMemory(result.op,addressType);
  8795. IF Global.IsOberonProcedure(x.ownerType) THEN
  8796. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8797. UseIntermediateOperand(result.tag);
  8798. ELSE
  8799. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8800. END;
  8801. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8802. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8803. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8804. ELSIF IsStaticArray(type) THEN
  8805. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8806. IntermediateCode.MakeMemory(result.op,addressType);
  8807. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8808. ELSIF type IS SyntaxTree.MathArrayType THEN
  8809. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8810. WITH type: SyntaxTree.MathArrayType DO
  8811. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8812. IF type.form = SyntaxTree.Tensor THEN
  8813. ELSIF type.form = SyntaxTree.Open THEN
  8814. result.tag := result.op;
  8815. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8816. IntermediateCode.MakeMemory(result.op,addressType);
  8817. UseIntermediateOperand(result.tag);
  8818. ELSIF type.form = SyntaxTree.Static THEN
  8819. IF x.kind = SyntaxTree.ConstParameter THEN
  8820. IntermediateCode.MakeMemory(result.op,addressType);
  8821. END;
  8822. ELSE HALT(100)
  8823. END;
  8824. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8825. IF type.form = SyntaxTree.Tensor THEN
  8826. ToMemory(result.op,addressType,0);
  8827. ELSIF type.form = SyntaxTree.Open THEN
  8828. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8829. ReuseCopy(result.tag, mem);
  8830. ReleaseIntermediateOperand(mem);
  8831. ReleaseIntermediateOperand(result.op);
  8832. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8833. ELSIF type.form = SyntaxTree.Static THEN
  8834. IntermediateCode.MakeMemory(result.op,addressType);
  8835. ELSE HALT(100)
  8836. END;
  8837. ELSE HALT(100)
  8838. END;
  8839. END;
  8840. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8841. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8842. IntermediateCode.MakeMemory(result.op,addressType);
  8843. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8844. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  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. IF x.kind = SyntaxTree.VarParameter THEN
  8852. ReuseCopy(result.tag,result.op);
  8853. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8854. IntermediateCode.MakeMemory(result.tag,addressType);
  8855. ELSE
  8856. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8857. UseIntermediateOperand(result.tag);
  8858. END;
  8859. ELSE
  8860. result.tag := nil;
  8861. END;
  8862. (* tag for pointer type computed not here but during dereferencing *)
  8863. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  8864. ReleaseIntermediateOperand(result.tag);
  8865. result.tag := basereg;
  8866. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8867. IntermediateCode.MakeMemory(result.tag,addressType);
  8868. UseIntermediateOperand(result.tag);
  8869. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  8870. ReleaseIntermediateOperand(result.tag);
  8871. result.tag := TypeDescriptorAdr(type);
  8872. IF ~newObjectFile THEN
  8873. IntermediateCode.MakeMemory(result.tag,addressType);
  8874. END;
  8875. UseIntermediateOperand(result.tag);
  8876. END;
  8877. IF Trace THEN TraceExit("VisitParameter") END;
  8878. END VisitParameter;
  8879. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8880. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8881. BEGIN
  8882. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8883. (* left.p: left already emitted *)
  8884. tag := result.op; (* value of pointer to left *)
  8885. (* get type desc *)
  8886. tmp := result.tag;
  8887. IntermediateCode.MakeMemory(tmp,addressType);
  8888. (* get method adr *)
  8889. Reuse1(reg,tmp);
  8890. ReleaseIntermediateOperand(tmp);
  8891. IF backend.cooperative THEN
  8892. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8893. WHILE recordType.baseType # NIL DO
  8894. recordType := recordType.GetBaseRecord ();
  8895. END;
  8896. GetRecordTypeName (recordType,name);
  8897. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8898. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8899. offset := 0;
  8900. ELSE
  8901. offset := 2;
  8902. END;
  8903. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8904. ELSE
  8905. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8906. END;
  8907. InitOperand(operand,ModeReference);
  8908. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8909. operand.op := reg;
  8910. operand.tag := tag;
  8911. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8912. END DynamicCallOperand;
  8913. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8914. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8915. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8916. BEGIN
  8917. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8918. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8919. tag := operand.op;
  8920. ReleaseIntermediateOperand(operand.tag);
  8921. ELSE tag := nil
  8922. END;
  8923. IF x.isInline THEN
  8924. sectionType := Sections.InlineCodeSection;
  8925. ELSE
  8926. sectionType := Sections.CodeSection;
  8927. END;
  8928. IF x.externalName # NIL THEN
  8929. Basic.ToSegmentedName(x.externalName^, name);
  8930. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8931. ELSE
  8932. GetCodeSectionNameForSymbol(x, name);
  8933. IF (x.scope.ownerModule = module.module) THEN
  8934. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8935. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8936. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8937. IF source.pc = 0 THEN (* no code yet *)
  8938. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8939. END;
  8940. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8941. bits := x.procedureScope.body.code.inlineCode;
  8942. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8943. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8944. binary.CopyBits(bits, 0, bits.GetSize());
  8945. source.SetResolved(binary);
  8946. ELSE
  8947. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8948. END;
  8949. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8950. END;
  8951. InitOperand(operand,ModeValue);
  8952. operand.op := reg;
  8953. operand.tag := tag;
  8954. IF Trace THEN TraceExit("StaticCallOperand") END;
  8955. END StaticCallOperand;
  8956. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8957. (* handle expressions of the form designator.procedure or procedure *)
  8958. BEGIN
  8959. IF Trace THEN TraceEnter("VisitProcedure") END;
  8960. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  8961. DynamicCallOperand(result,x);
  8962. ELSIF x.isInline THEN
  8963. StaticCallOperand(result,x);
  8964. ELSE
  8965. StaticCallOperand(result,x);
  8966. END;
  8967. IF Trace THEN TraceExit("VisitProcedure") END;
  8968. END VisitProcedure;
  8969. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8970. BEGIN
  8971. VisitProcedure(x);
  8972. END VisitOperator;
  8973. (** statements *)
  8974. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8975. BEGIN
  8976. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8977. Expression(x.call);
  8978. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8979. ReleaseOperand(result)
  8980. END;
  8981. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8982. END VisitProcedureCallStatement;
  8983. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8984. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8985. leftBase, rightBase: SyntaxTree.Type;
  8986. procedureName,s: SyntaxTree.IdentifierString;
  8987. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8988. size: LONGINT; rightKind: LONGINT;
  8989. dummy: IntermediateCode.Operand;
  8990. CONST moduleName = "FoxArrayBase";
  8991. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8992. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8993. BEGIN
  8994. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8995. IF base IS SyntaxTree.MathArrayType THEN
  8996. base := OpenArray(base(SyntaxTree.MathArrayType));
  8997. END;
  8998. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8999. result.SetArrayBase(base);
  9000. RETURN result
  9001. END OpenArray;
  9002. BEGIN
  9003. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9004. SaveRegisters();ReleaseUsedRegisters(saved);
  9005. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9006. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9007. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9008. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9009. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9010. IF leftType.form = SyntaxTree.Tensor THEN
  9011. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9012. ELSIF leftType.form = SyntaxTree.Open THEN
  9013. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9014. ELSIF leftType.form = SyntaxTree.Static THEN
  9015. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9016. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9017. END;
  9018. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9019. IF procedure = NIL THEN
  9020. s := "Instruction not supported on target, emulation procedure ";
  9021. Strings.Append(s,moduleName);
  9022. Strings.Append(s,".");
  9023. Strings.Append(s,procedureName);
  9024. Strings.Append(s," not present");
  9025. Error(position,s);
  9026. ELSE
  9027. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9028. parameter.SetType(leftType);
  9029. parameter.SetAccess(SyntaxTree.Internal);
  9030. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9031. parameter.SetKind(rightKind);
  9032. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9033. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9034. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  9035. StaticCallOperand(result,procedure);
  9036. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  9037. ReleaseOperand(result);
  9038. END;
  9039. RestoreRegisters(saved);
  9040. END;
  9041. END AssignMathArray;
  9042. VAR modifyAssignmentCounter := 0: LONGINT;
  9043. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9044. VAR processor,mem,dst: IntermediateCode.Operand;
  9045. BEGIN
  9046. IF value.intValue = true.intValue THEN
  9047. INC(modifyAssignmentCounter);
  9048. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9049. modifyAssignmentsPC := section.pc;
  9050. ELSE
  9051. DEC(modifyAssignmentCounter);
  9052. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9053. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9054. END;
  9055. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9056. dst := NewRegisterOperand (addressType);
  9057. Emit(Mov(position,dst, processor));
  9058. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9059. Emit(Mov(position,mem, value));
  9060. ReleaseIntermediateOperand(dst);
  9061. END ModifyAssignments;
  9062. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9063. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9064. BEGIN
  9065. type := left.type.resolved;
  9066. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9067. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9068. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9069. IF procedureType.returnParameter = parameter THEN
  9070. (* this is the only case where the destination can be dynamically smaller than the source
  9071. in all other cases the dynamic size has to be taken
  9072. *)
  9073. IF backend.cooperative THEN
  9074. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9075. ELSE
  9076. MakeMemory(mem, tag, addressType, 0);
  9077. END;
  9078. RETURN mem;
  9079. END;
  9080. END;
  9081. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9082. END CopySize;
  9083. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9084. VAR
  9085. leftO, rightO: Operand;
  9086. arg,mem, sizeOp: IntermediateCode.Operand;
  9087. leftType, rightType, componentType, base: SyntaxTree.Type;
  9088. size: LONGINT;
  9089. parameters: SyntaxTree.ExpressionList;
  9090. procedure: SyntaxTree.Procedure;
  9091. call: SyntaxTree.ProcedureCallDesignator;
  9092. designator: SyntaxTree.Designator;
  9093. saved: RegisterEntry;
  9094. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9095. VAR procedureType: SyntaxTree.ProcedureType;
  9096. BEGIN
  9097. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9098. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9099. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9100. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9101. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9102. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9103. IF right.id = Global.Reshape THEN RETURN TRUE
  9104. END;
  9105. END;
  9106. END;
  9107. END;
  9108. RETURN FALSE
  9109. END CanPassAsResultParameter;
  9110. BEGIN
  9111. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9112. leftType := left.type.resolved; rightType:= right.type.resolved;
  9113. IF backend.cooperative & left.NeedsTrace() THEN
  9114. ModifyAssignments(true);
  9115. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9116. Designate(right, rightO);
  9117. Designate(left, leftO);
  9118. ASSERT(leftO.mode = ModeReference);
  9119. TransferToRegister(leftO.op, leftO.op);
  9120. TransferToRegister(rightO.op, rightO.op);
  9121. Emit(Push(position, leftO.op));
  9122. Emit(Push(position, rightO.op));
  9123. CallAssignMethod(leftO.op, rightO.op, left.type);
  9124. Emit(Pop(position, rightO.op));
  9125. Emit(Pop(position, leftO.op));
  9126. sizeOp := CopySize(left, leftO.tag);
  9127. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9128. ReleaseIntermediateOperand(sizeOp);
  9129. ReleaseOperand(leftO);
  9130. ReleaseOperand(rightO);
  9131. ELSE
  9132. Evaluate(right,rightO);
  9133. Designate(left,leftO);
  9134. ASSERT(leftO.mode = ModeReference);
  9135. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9136. (* copy procedure address first *)
  9137. MakeMemory(mem,leftO.op,addressType,0);
  9138. Emit(Mov(position,mem,rightO.op));
  9139. ReleaseIntermediateOperand(mem);
  9140. (* copy pointer address *)
  9141. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9142. CallAssignPointer(leftO.tag, rightO.tag);
  9143. ELSE
  9144. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9145. CallAssignPointer(leftO.op, rightO.op);
  9146. END;
  9147. ReleaseOperand(leftO);
  9148. ReleaseOperand(rightO);
  9149. END;
  9150. ModifyAssignments(false);
  9151. RETURN;
  9152. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9153. SaveRegisters();ReleaseUsedRegisters(saved);
  9154. IF SemanticChecker.IsPointerType(leftType) THEN
  9155. Evaluate(right,rightO);
  9156. Designate(left,leftO);
  9157. Emit(Push(position,leftO.op));
  9158. ReleaseOperand(leftO);
  9159. Emit(Push(position,rightO.op));
  9160. ReleaseOperand(rightO);
  9161. CallThis(position,"Heaps","Assign",2);
  9162. ELSIF leftType.IsRecordType() THEN
  9163. Designate(right,rightO);
  9164. Designate(left,leftO);
  9165. Emit(Push(position,leftO.op));
  9166. Emit(Push(position,leftO.tag)); (* type desc *)
  9167. ReleaseOperand(leftO);
  9168. Emit(Push(position,rightO.op));
  9169. ReleaseOperand(rightO);
  9170. CallThis(position,"Heaps","AssignRecord",3);
  9171. ELSIF IsStaticArray(leftType) THEN
  9172. size := StaticArrayNumElements(leftType);
  9173. base := StaticArrayBaseType(leftType);
  9174. Designate(right,rightO);
  9175. Designate(left,leftO);
  9176. Emit(Push(position,leftO.op));
  9177. ReleaseOperand(leftO);
  9178. arg := TypeDescriptorAdr(base);
  9179. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9180. Emit(Push(position,arg));
  9181. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9182. Emit(Push(position,rightO.op));
  9183. ReleaseOperand(rightO);
  9184. CallThis(position,"Heaps","AssignArray",4);
  9185. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9186. size := StaticMathArrayNumElements(leftType);
  9187. base := StaticMathArrayBaseType(leftType);
  9188. Designate(right,rightO);
  9189. Designate(left,leftO);
  9190. Emit(Push(position,leftO.op));
  9191. ReleaseOperand(leftO);
  9192. arg := TypeDescriptorAdr(base);
  9193. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9194. Emit(Push(position,arg));
  9195. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9196. Emit(Push(position,rightO.op));
  9197. ReleaseOperand(rightO);
  9198. CallThis(position,"Heaps","AssignArray",4);
  9199. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9200. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9201. Evaluate(right,rightO);
  9202. Designate(left,leftO);
  9203. MakeMemory(mem,leftO.op,addressType,0);
  9204. Emit(Mov(position,mem,rightO.op));
  9205. ReleaseIntermediateOperand(mem);
  9206. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9207. Emit (Push(position, leftO.tag));
  9208. ReleaseOperand(leftO);
  9209. Emit (Push(position, rightO.tag));
  9210. ReleaseOperand(rightO);
  9211. CallThis(position,"Heaps","Assign", 2);
  9212. ELSE HALT(100); (* missing ? *)
  9213. END;
  9214. RestoreRegisters(saved);
  9215. RETURN;
  9216. END;
  9217. IF CanPassAsResultParameter(right) THEN
  9218. procedureResultDesignator := left(SyntaxTree.Designator);
  9219. Expression(right);
  9220. procedureResultDesignator := NIL;
  9221. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9222. (* left <-- ALIAS OF right: zerocopy *)
  9223. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9224. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9225. designator.SetType(procedure.type);
  9226. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9227. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9228. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9229. END;
  9230. ELSIF leftType IS SyntaxTree.RangeType THEN
  9231. (* LHS is of array range type *)
  9232. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9233. Evaluate(right, rightO);
  9234. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9235. (* first *)
  9236. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  9237. Emit(Mov(position,mem, rightO.op));
  9238. ReleaseIntermediateOperand(mem);
  9239. (* last *)
  9240. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9241. Emit(Mov(position,mem, rightO.tag));
  9242. ReleaseIntermediateOperand(mem);
  9243. (* step *)
  9244. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9245. Emit(Mov(position,mem, rightO.extra));
  9246. ReleaseIntermediateOperand(mem);
  9247. ReleaseOperand(rightO);
  9248. ReleaseOperand(leftO)
  9249. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9250. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9251. Evaluate(right, rightO);
  9252. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9253. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9254. (* real part *)
  9255. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9256. Emit(Mov(position,mem, rightO.op));
  9257. ReleaseIntermediateOperand(mem);
  9258. (* imaginary part *)
  9259. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9260. Emit(Mov(position,mem, rightO.tag));
  9261. ReleaseIntermediateOperand(mem);
  9262. ReleaseOperand(rightO);
  9263. ReleaseOperand(leftO)
  9264. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9265. OR (leftType IS SyntaxTree.PortType) THEN
  9266. (* rightO := leftO;*)
  9267. Evaluate(right,rightO);
  9268. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9269. Designate(left,leftO);
  9270. IF leftO.mode = ModeReference THEN
  9271. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9272. destination := mem;
  9273. ELSE
  9274. destination := leftO.op;
  9275. END;
  9276. ReleaseOperand(leftO);
  9277. IF destination.mode # IntermediateCode.Undefined THEN
  9278. Emit(Mov(position,destination,rightO.op));
  9279. END;
  9280. ReleaseOperand(rightO);
  9281. ReleaseIntermediateOperand(mem);
  9282. IntermediateCode.InitOperand(destination);
  9283. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9284. Evaluate(right,rightO);
  9285. Designate(left,leftO);
  9286. MakeMemory(mem,leftO.op,addressType,0);
  9287. Emit(Mov(position,mem,rightO.op));
  9288. ReleaseIntermediateOperand(mem);
  9289. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9290. (* delegate *)
  9291. (*
  9292. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9293. *)
  9294. Emit(Mov(position,leftO.tag,rightO.tag));
  9295. END;
  9296. ReleaseOperand(leftO);
  9297. ReleaseOperand(rightO);
  9298. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9299. Designate(right,rightO);
  9300. Designate(left,leftO);
  9301. sizeOp := CopySize(left, leftO.tag);
  9302. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9303. ReleaseIntermediateOperand(sizeOp);
  9304. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9305. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9306. IF (rightType IS SyntaxTree.StringType) THEN
  9307. CopyString(left,right);
  9308. 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
  9309. Designate(right,rightO);
  9310. Designate(left,leftO);
  9311. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9312. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9313. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9314. ELSE
  9315. HALT(201)
  9316. END;
  9317. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9318. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9319. Designate(right,rightO);
  9320. Designate(left,leftO);
  9321. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9322. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9323. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9324. ELSE
  9325. AssignMathArray(left,right);
  9326. END;
  9327. ELSE
  9328. HALT(200);
  9329. END;
  9330. END Assign;
  9331. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  9332. BEGIN
  9333. IF Trace THEN TraceEnter("VisitAssignment") END;
  9334. Assign(x.left,x.right);
  9335. IF Trace THEN TraceExit("VisitAssignment") END;
  9336. END VisitAssignment;
  9337. PROCEDURE EmitCooperativeSwitch;
  9338. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9339. BEGIN
  9340. ASSERT (cooperativeSwitches);
  9341. pc := section.pc;
  9342. IF lastSwitchPC = section.pc THEN RETURN END;
  9343. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9344. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9345. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9346. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9347. INC(statCoopSwitch, section.pc - pc);
  9348. END EmitCooperativeSwitch;
  9349. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  9350. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9351. BEGIN
  9352. p0 := communication.left; p1 := communication.right;
  9353. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9354. Evaluate(p0,s0);
  9355. Evaluate(p1,s1);
  9356. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9357. Emit(Push(position,s0.op));
  9358. Emit(Push(position,s1.op));
  9359. (*
  9360. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9361. *)
  9362. IF ~backend.cellsAreObjects THEN
  9363. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9364. END;
  9365. ReleaseOperand(s0);
  9366. ReleaseOperand(s1);
  9367. IF backend.cellsAreObjects THEN
  9368. CallThis(position,"ActiveCellsRuntime","Send",2);
  9369. ELSE
  9370. CallThis(position,ChannelModuleName,"Send",2);
  9371. END;
  9372. (* ----- RECEIVE ------*)
  9373. ELSE
  9374. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9375. tmp := p0; p0 := p1; p1 := tmp;
  9376. END;
  9377. Evaluate(p0,s0);
  9378. Emit(Push(position,s0.op));
  9379. Designate(p1,s1);
  9380. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9381. Emit(Push(position,s1.op));
  9382. (*
  9383. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9384. *)
  9385. IF ~backend.cellsAreObjects THEN
  9386. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9387. END;
  9388. ReleaseOperand(s0);
  9389. ReleaseOperand(s1);
  9390. IF backend.cellsAreObjects THEN
  9391. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9392. ELSE
  9393. CallThis(position,ChannelModuleName,"Receive",2)
  9394. END;
  9395. END;
  9396. END VisitCommunicationStatement;
  9397. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  9398. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9399. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9400. VAR true, false: Label; condition, value: BOOLEAN;
  9401. BEGIN
  9402. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9403. IF condition THEN
  9404. true := NewLabel();
  9405. false := NewLabel();
  9406. Condition(if.condition,true,false);
  9407. SetLabel(true);
  9408. StatementSequence(if.statements);
  9409. BrL(end);
  9410. SetLabel(false);
  9411. ELSE
  9412. IF value THEN (* always true *)
  9413. escape := TRUE;
  9414. StatementSequence(if.statements);
  9415. (* no branch necessary -- rest skipped *)
  9416. END;
  9417. END;
  9418. END IfPart;
  9419. BEGIN
  9420. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9421. end := NewLabel();
  9422. elsifs := x.ElsifParts();
  9423. IfPart(x.ifPart);
  9424. FOR i := 0 TO elsifs-1 DO
  9425. IF ~escape THEN
  9426. elsif := x.GetElsifPart(i);
  9427. IfPart(elsif);
  9428. END;
  9429. END;
  9430. IF (x.elsePart # NIL) & ~escape THEN
  9431. StatementSequence(x.elsePart);
  9432. END;
  9433. SetLabel(end);
  9434. IF Trace THEN TraceExit("VisitIfStatement") END;
  9435. END VisitIfStatement;
  9436. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9437. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9438. BEGIN
  9439. (*IF x.variable.type.resolved = x.type.resolved THEN
  9440. (* always true, do nothing *)
  9441. ELSE*)
  9442. Designate(x.variable,res);
  9443. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9444. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9445. END;
  9446. trueL := NewLabel();
  9447. TypeTest(res.tag,x.type,trueL,falseL);
  9448. ReleaseOperand(res);
  9449. SetLabel(trueL);
  9450. StatementSequence(x.statements);
  9451. BrL(endL);
  9452. END WithPart;
  9453. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9454. VAR endL,falseL: Label;i: LONGINT;
  9455. BEGIN
  9456. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9457. endL := NewLabel();
  9458. FOR i := 0 TO x.WithParts()-1 DO
  9459. falseL := NewLabel();
  9460. WithPart(x.GetWithPart(i),falseL,endL);
  9461. SetLabel(falseL);
  9462. END;
  9463. IF x.elsePart = NIL THEN
  9464. IF ~isUnchecked THEN
  9465. EmitTrap(position,WithTrap);
  9466. END;
  9467. ELSE
  9468. StatementSequence(x.elsePart)
  9469. END;
  9470. SetLabel(endL);
  9471. IF Trace THEN TraceExit("VisitWithStatement") END;
  9472. END VisitWithStatement;
  9473. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9474. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9475. out,else: Label; label: Label;
  9476. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9477. symbol: SyntaxTree.Symbol;
  9478. BEGIN
  9479. (*! split case statement into if-elsif statements for large case label lists *)
  9480. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9481. size := x.max-x.min+1;
  9482. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9483. END;
  9484. Evaluate(x.variable,var);
  9485. ReuseCopy(tmp,var.op);
  9486. ReleaseIntermediateOperand(var.op);
  9487. var.op := tmp;
  9488. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9489. Convert(var.op,addressType);
  9490. size := x.max-x.min+1;
  9491. else := NewLabel();
  9492. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9493. (*
  9494. UniqueId(name,module.module,"case",caseId);
  9495. *)
  9496. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9497. Global.GetModuleSegmentedName(module.module, name);
  9498. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9499. symbol := SyntaxTree.NewSymbol(name[1]);
  9500. symbol.SetScope(moduleScope);
  9501. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9502. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9503. section.isCaseTable := TRUE;
  9504. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9505. ReuseCopy(res,var.op);
  9506. ReleaseOperand(var);
  9507. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9508. Emit(Add(position,res,res,jmp));
  9509. IntermediateCode.MakeMemory(res,addressType);
  9510. Emit(Br(position,res));
  9511. ReleaseIntermediateOperand(res);
  9512. out := NewLabel();
  9513. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9514. part := x.GetCasePart(i);
  9515. constant := part.firstConstant;
  9516. label := NewLabel();
  9517. SetLabel(label);
  9518. WHILE(constant # NIL) DO (* case labels for this case part *)
  9519. FOR j := constant.min TO constant.max DO
  9520. fixups[j-x.min] := label;
  9521. END;
  9522. constant := constant.next;
  9523. END;
  9524. StatementSequence(part.statements);
  9525. BrL(out);
  9526. END;
  9527. SetLabel(else);
  9528. FOR i := 0 TO size-1 DO
  9529. IF fixups[i] = NIL THEN
  9530. fixups[i] := else;
  9531. END;
  9532. END;
  9533. IF x.elsePart # NIL THEN
  9534. StatementSequence(x.elsePart);
  9535. ELSIF ~isUnchecked THEN
  9536. EmitTrap(position,CaseTrap);
  9537. END;
  9538. SetLabel(out);
  9539. FOR i := 0 TO size-1 DO
  9540. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9541. section.Emit(Data(position,op));
  9542. END;
  9543. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9544. END VisitCaseStatement;
  9545. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9546. VAR start: Label; true,false: Label;
  9547. BEGIN
  9548. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9549. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9550. start := NewLabel();
  9551. true := NewLabel();
  9552. false := NewLabel();
  9553. SetLabel(start);
  9554. Condition(x.condition,true,false);
  9555. SetLabel(true);
  9556. StatementSequence(x.statements);
  9557. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9558. BrL(start);
  9559. SetLabel(false);
  9560. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9561. END VisitWhileStatement;
  9562. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9563. VAR false,true: Label;
  9564. BEGIN
  9565. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9566. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9567. true := NewLabel();
  9568. false := NewLabel();
  9569. SetLabel(false);
  9570. StatementSequence(x.statements);
  9571. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9572. Condition(x.condition,true,false);
  9573. SetLabel(true);
  9574. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9575. END VisitRepeatStatement;
  9576. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9577. VAR
  9578. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9579. temporaryVariable: SyntaxTree.Variable;
  9580. temporaryVariableDesignator : SyntaxTree.Designator;
  9581. BEGIN
  9582. IF Trace THEN TraceEnter("VisitForStatement") END;
  9583. true := NewLabel();
  9584. false := NewLabel();
  9585. start := NewLabel();
  9586. Assign(x.variable,x.from);
  9587. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9588. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9589. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9590. Assign(temporaryVariableDesignator,x.to);
  9591. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9592. IF by > 0 THEN
  9593. cmp := Scanner.LessEqual
  9594. ELSE
  9595. cmp := Scanner.GreaterEqual
  9596. END;
  9597. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9598. binary.SetType(system.booleanType);
  9599. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9600. SetLabel(start);
  9601. Condition(binary,true,false);
  9602. SetLabel(true);
  9603. StatementSequence(x.statements);
  9604. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9605. binary.SetType(x.variable.type);
  9606. Assign(x.variable,binary);
  9607. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9608. BrL(start);
  9609. SetLabel(false);
  9610. IF Trace THEN TraceExit("VisitForStatement") END;
  9611. END VisitForStatement;
  9612. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9613. VAR prevLoop: Label;
  9614. BEGIN
  9615. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9616. prevLoop := currentLoop;
  9617. currentLoop := NewLabel();
  9618. StatementSequence(x.statements);
  9619. SetLabel(currentLoop);
  9620. currentLoop := prevLoop;
  9621. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9622. END VisitExitableBlock;
  9623. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9624. VAR prevLoop,start: Label;
  9625. BEGIN
  9626. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9627. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9628. start := NewLabel();
  9629. prevLoop := currentLoop;
  9630. SetLabel(start);
  9631. currentLoop := NewLabel();
  9632. StatementSequence(x.statements);
  9633. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9634. BrL(start);
  9635. SetLabel(currentLoop);
  9636. currentLoop := prevLoop;
  9637. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9638. END VisitLoopStatement;
  9639. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9640. VAR outer: SyntaxTree.Statement;
  9641. BEGIN
  9642. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9643. IF locked THEN (* r if we jump out of an exclusive block *)
  9644. outer := x.outer;
  9645. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9646. outer := outer.outer;
  9647. END;
  9648. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9649. Lock(FALSE);
  9650. END;
  9651. END;
  9652. BrL(currentLoop);
  9653. IF Trace THEN TraceExit("VisitExitStatement") END;
  9654. END VisitExitStatement;
  9655. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9656. VAR
  9657. expression, parameterDesignator: SyntaxTree.Expression;
  9658. type, componentType: SyntaxTree.Type;
  9659. res, right: Operand;
  9660. left, mem, reg: IntermediateCode.Operand;
  9661. parameter: SyntaxTree.Parameter;
  9662. procedure: SyntaxTree.Procedure;
  9663. procedureType: SyntaxTree.ProcedureType;
  9664. returnTypeOffset: LONGINT;
  9665. delegate: BOOLEAN;
  9666. map: SymbolMap;
  9667. cc, parametersSize: LONGINT;
  9668. BEGIN
  9669. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9670. expression := x.returnValue;
  9671. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9672. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9673. IF currentIsInline THEN
  9674. IF expression # NIL THEN
  9675. map := currentMapper.Get(NIL);
  9676. IF map # NIL THEN
  9677. Assign(map.to, expression);
  9678. ELSE
  9679. Evaluate(expression,res);
  9680. Emit(Return(position,res.op));
  9681. ReleaseOperand(res);
  9682. END;
  9683. END;
  9684. BrL(currentInlineExit);
  9685. RETURN;
  9686. END;
  9687. IF expression # NIL THEN
  9688. type := expression.type.resolved;
  9689. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9690. IF locked THEN Lock(FALSE) END;
  9691. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9692. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9693. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9694. (* return without structured return parameter *)
  9695. Evaluate(expression,res);
  9696. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9697. IF locked OR profile THEN
  9698. Emit(Push(position,res.op));
  9699. IF delegate THEN HALT(200) END;
  9700. ReleaseOperand(res);
  9701. IF locked THEN Lock(FALSE) END;
  9702. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9703. reg := NewRegisterOperand(res.op.type);
  9704. Emit(Pop(position,reg));
  9705. Emit(Return(position,reg));
  9706. ReleaseIntermediateOperand(reg);
  9707. ELSE
  9708. Emit(Return(position,res.op));
  9709. ReleaseOperand(res);
  9710. END;
  9711. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9712. THEN
  9713. (* return using structured return parameter *)
  9714. 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)
  9715. OR SemanticChecker.IsPointerType(type));
  9716. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9717. parameter :=procedureType.returnParameter;
  9718. ASSERT(parameter # NIL);
  9719. returnTypeOffset := parameter.offsetInBits;
  9720. (*
  9721. IF parameter# NIL THEN
  9722. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9723. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9724. ELSE
  9725. returnTypeOffset := system.offsetFirstParameter
  9726. END;
  9727. *)
  9728. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9729. IF type IS SyntaxTree.RangeType THEN
  9730. (* array range type *)
  9731. Evaluate(expression, right);
  9732. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9733. Emit(Mov(position,mem, right.op)); (* first *)
  9734. ReleaseIntermediateOperand(mem);
  9735. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9736. Emit(Mov(position,mem, right.tag)); (* last *)
  9737. ReleaseIntermediateOperand(mem);
  9738. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9739. Emit(Mov(position,mem, right.extra)); (* step *)
  9740. ReleaseIntermediateOperand(mem);
  9741. ReleaseOperand(right);
  9742. ELSIF type IS SyntaxTree.ComplexType THEN
  9743. Evaluate(expression, right);
  9744. componentType := type(SyntaxTree.ComplexType).componentType;
  9745. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9746. Emit(Mov(position,mem, right.op)); (* real part *)
  9747. ReleaseIntermediateOperand(mem);
  9748. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9749. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9750. ReleaseIntermediateOperand(mem);
  9751. ReleaseOperand(right);
  9752. ELSE (* covers cases: pointer / record / array *)
  9753. parameter := procedureType.returnParameter;
  9754. checker.SetCurrentScope(currentScope);
  9755. ASSERT(parameter # NIL);
  9756. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9757. Assign(parameterDesignator,expression);
  9758. END;
  9759. ReleaseIntermediateOperand(left);
  9760. IF locked THEN Lock(FALSE) END;
  9761. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9762. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9763. parameter := procedureType.returnParameter;
  9764. checker.SetCurrentScope(currentScope);
  9765. IF parameter = NIL THEN
  9766. Error(procedure.position, "structured return of parameter of procedure not found");
  9767. ELSE
  9768. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9769. Assign(parameterDesignator,expression);
  9770. END;
  9771. IF locked THEN Lock(FALSE) END;
  9772. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9773. ELSE
  9774. HALT(200);
  9775. END;
  9776. ELSE
  9777. IF locked THEN Lock(FALSE) END;
  9778. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9779. END;
  9780. IF backend.cooperative THEN
  9781. BrL(exitLabel);
  9782. ELSE
  9783. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  9784. IF cc = SyntaxTree.WinAPICallingConvention THEN
  9785. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9786. ELSE
  9787. parametersSize := 0;
  9788. END;
  9789. EmitLeave(section, position,procedure, procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9790. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention, parametersSize));
  9791. END;
  9792. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9793. END VisitReturnStatement;
  9794. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9795. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9796. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9797. statements: SyntaxTree.StatementSequence;
  9798. name, suffix: SyntaxTree.IdentifierString;
  9799. BEGIN
  9800. Strings.IntToStr(awaitProcCounter,suffix);
  9801. Strings.Concat("@AwaitProcedure",suffix,name);
  9802. identifier := SyntaxTree.NewIdentifier(name);
  9803. INC(awaitProcCounter);
  9804. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9805. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9806. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9807. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9808. procedure.SetAccess(SyntaxTree.Hidden);
  9809. procedure.SetScope(currentScope);
  9810. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9811. procedureType.SetReturnType(system.booleanType);
  9812. procedure.SetType(procedureType);
  9813. body := SyntaxTree.NewBody(x.position,procedureScope);
  9814. procedureScope.SetBody(body);
  9815. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9816. returnStatement.SetReturnValue(x.condition);
  9817. statements := SyntaxTree.NewStatementSequence();
  9818. statements.AddStatement(returnStatement);
  9819. body.SetStatementSequence(statements);
  9820. currentScope.AddProcedure(procedure);
  9821. RETURN procedure
  9822. END MakeAwaitProcedure;
  9823. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9824. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9825. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9826. BEGIN
  9827. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9828. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9829. IF backend.cooperative THEN
  9830. start := NewLabel();
  9831. true := NewLabel();
  9832. false := NewLabel();
  9833. SetLabel(start);
  9834. Condition(x.condition,true,false);
  9835. SetLabel(false);
  9836. PushSelfPointer();
  9837. CallThis(position,"ExclusiveBlocks","Await",1);
  9838. BrL(start);
  9839. SetLabel(true);
  9840. PushSelfPointer();
  9841. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9842. ELSE
  9843. proc := MakeAwaitProcedure(x);
  9844. Emit(Push(position,fp));
  9845. GetCodeSectionNameForSymbol(proc,name);
  9846. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9847. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9848. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9849. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9850. Emit(Result(position,res));
  9851. (*
  9852. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9853. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9854. *)
  9855. InitOperand(result,ModeValue);
  9856. result.op := res;
  9857. label := NewLabel();
  9858. BreqL(label, result.op, SELF.true);
  9859. ReleaseOperand(result);
  9860. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9861. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9862. Emit(Push(position,res));
  9863. Emit(Push(position,fp));
  9864. PushSelfPointer();
  9865. Emit(Push(position,nil));
  9866. CallThis(position,"Objects","Await",4);
  9867. SetLabel(label);
  9868. END;
  9869. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9870. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9871. END VisitAwaitStatement;
  9872. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9873. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9874. BEGIN
  9875. FOR i := 0 TO x.Length() - 1 DO
  9876. statement := x.GetStatement( i );
  9877. Statement(statement);
  9878. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9879. END;
  9880. END StatementSequence;
  9881. PROCEDURE PushSelfPointer;
  9882. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  9883. procedureType: SyntaxTree.ProcedureType;
  9884. BEGIN
  9885. scope := currentScope;
  9886. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9887. scope := scope.outerScope;
  9888. END;
  9889. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9890. IF ~newObjectFile THEN
  9891. Symbol(moduleSelf,op);
  9892. IntermediateCode.MakeMemory(op.op,addressType);
  9893. ELSE
  9894. moduleSection := meta.ModuleSection();
  9895. IF backend.cooperative THEN
  9896. moduleOffset := 0;
  9897. ELSE
  9898. moduleOffset := moduleSection.pc;
  9899. END;
  9900. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9901. END;
  9902. ELSE
  9903. GetBaseRegister(op.op,currentScope,scope);
  9904. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9905. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9906. parametersSize := ProcedureParametersSize(system,procedure);
  9907. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9908. IF backend.cooperative THEN
  9909. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9910. END;
  9911. IntermediateCode.MakeMemory(op.op,addressType);
  9912. END;
  9913. Emit(Push(position,op.op));
  9914. ReleaseOperand(op);
  9915. END PushSelfPointer;
  9916. PROCEDURE Lock(lock: BOOLEAN);
  9917. BEGIN
  9918. IF Trace THEN TraceEnter("Lock") END;
  9919. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9920. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9921. ASSERT(modifyAssignmentCounter = 0);
  9922. IF dump # NIL THEN
  9923. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9924. dump.Ln;dump.Update;
  9925. END;
  9926. PushSelfPointer;
  9927. IF backend.cooperative THEN
  9928. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9929. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9930. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9931. END;
  9932. ELSE
  9933. Emit(Push(position,true));
  9934. IF lock THEN CallThis(position,"Objects","Lock",2)
  9935. ELSE CallThis(position,"Objects","Unlock",2);
  9936. END;
  9937. END;
  9938. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9939. IF Trace THEN TraceExit("Lock") END;
  9940. END Lock;
  9941. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9942. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9943. BEGIN
  9944. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9945. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9946. previouslyUnchecked := isUnchecked;
  9947. isUnchecked := isUnchecked OR x.isUnchecked;
  9948. previouslyCooperativeSwitches := cooperativeSwitches;
  9949. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9950. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9951. IF x.statements # NIL THEN
  9952. StatementSequence(x.statements);
  9953. END;
  9954. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9955. isUnchecked := previouslyUnchecked;
  9956. cooperativeSwitches := previouslyCooperativeSwitches;
  9957. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9958. END VisitStatementBlock;
  9959. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9960. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9961. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9962. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9963. procedure: SyntaxTree.Procedure;
  9964. map: SymbolMap;
  9965. cc, parametersSize: LONGINT;
  9966. BEGIN
  9967. scope := currentScope;
  9968. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9969. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9970. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9971. return := emptyOperand;
  9972. IF Trace THEN TraceEnter("VisitCode") END;
  9973. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9974. NEW(in, x.inRules.Length());
  9975. FOR i := 0 TO LEN(in)-1 DO
  9976. statement := x.inRules.GetStatement(i);
  9977. WITH statement: SyntaxTree.Assignment DO
  9978. Evaluate(statement.right, operand);
  9979. result := operand.op;
  9980. NEW(str, 64);
  9981. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9982. in[i] := result; IntermediateCode.SetString(in[i], str);
  9983. ReleaseIntermediateOperand(operand.tag);
  9984. END;
  9985. END;
  9986. ELSE in := NIL
  9987. END;
  9988. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9989. NEW(out, x.outRules.Length());
  9990. FOR i := 0 TO LEN(out)-1 DO
  9991. statement := x.outRules.GetStatement(i);
  9992. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9993. WITH statement: SyntaxTree.Assignment DO
  9994. Designate(statement.left, operand);
  9995. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  9996. NEW(str, 64);
  9997. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9998. out[i] := result; IntermediateCode.SetString(out[i], str);
  9999. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10000. |statement: SyntaxTree.ReturnStatement DO
  10001. NEW(str, 64);
  10002. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10003. IF currentIsInline THEN
  10004. map := currentMapper.Get(NIL);
  10005. Designate(map.to, operand);
  10006. IF map.isAddress THEN
  10007. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10008. ELSE
  10009. result := operand.op;
  10010. END;
  10011. (*! only if it does not fit into register
  10012. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10013. *)
  10014. (*Evaluate(map.to, operand);*)
  10015. out[i] := result;
  10016. ELSE
  10017. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10018. END;
  10019. IntermediateCode.SetString(out[i], str);
  10020. ReleaseIntermediateOperand(operand.tag);
  10021. return := out[i];
  10022. ELSE
  10023. END;
  10024. END;
  10025. ELSE out := NIL
  10026. END;
  10027. Emit(Asm(x.position,x.sourceCode, in, out));
  10028. IF in # NIL THEN
  10029. FOR i := 0 TO LEN(in)-1 DO
  10030. ReleaseIntermediateOperand(in[i]);
  10031. END;
  10032. END;
  10033. IF out # NIL THEN
  10034. FOR i := 0 TO LEN(out)-1 DO
  10035. WITH statement: SyntaxTree.Assignment DO
  10036. ReleaseIntermediateOperand(out[i]);
  10037. |statement: SyntaxTree.ReturnStatement DO
  10038. (* release happens below *)
  10039. ELSE
  10040. END;
  10041. statement := x.outRules.GetStatement(i);
  10042. END;
  10043. END;
  10044. IF return.mode # IntermediateCode.Undefined THEN
  10045. IF currentIsInline THEN
  10046. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10047. Symbol(procedureType.returnParameter, par);
  10048. MakeMemory(mem, par.op, return.type, 0);
  10049. ReleaseOperand(par);
  10050. Emit(Mov(position, mem, return));
  10051. ReleaseIntermediateOperand(mem);
  10052. ELSE
  10053. Emit(Return(position,return));
  10054. END;
  10055. ReleaseIntermediateOperand(return);
  10056. IF currentIsInline THEN RETURN END;
  10057. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10058. IF cc = SyntaxTree.WinAPICallingConvention THEN
  10059. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10060. ELSE
  10061. parametersSize := 0;
  10062. END;
  10063. EmitLeave(section, position,procedure, cc);
  10064. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,cc, parametersSize));
  10065. END;
  10066. IF Trace THEN TraceExit("VisitCode") END;
  10067. END VisitCode;
  10068. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10069. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10070. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10071. const, call: IntermediateCode.Operand;
  10072. parameterDesignator: SyntaxTree.Expression;
  10073. saved: RegisterEntry;
  10074. name: Basic.SegmentedName;
  10075. BEGIN
  10076. IF Trace THEN TraceEnter("ParameterCopies") END;
  10077. parameter := x.firstParameter;
  10078. WHILE parameter # NIL DO
  10079. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10080. type := parameter.type.resolved;
  10081. IF IsOpenArray(type) THEN
  10082. VisitParameter(parameter);
  10083. op := result;
  10084. IF backend.cooperative & parameter.NeedsTrace() THEN
  10085. length := GetArrayLength(type, op.tag);
  10086. size := NewRegisterOperand(addressType);
  10087. base := ArrayBaseType(type);
  10088. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10089. Emit(Mul(position, size, length, const));
  10090. dst := NewRegisterOperand (addressType);
  10091. Emit(Mov(position, dst, size));
  10092. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10093. Emit(Sub(position,dst,sp,dst));
  10094. Emit(And(position,dst,dst,const));
  10095. Emit(Mov(position,sp,dst));
  10096. par := fp;
  10097. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10098. IntermediateCode.InitImmediate(null, byteType, 0);
  10099. Emit(Fill(position, dst, size, null));
  10100. ReleaseIntermediateOperand(dst);
  10101. ReleaseIntermediateOperand(length);
  10102. SaveRegisters();ReleaseUsedRegisters(saved);
  10103. (* register dst has been freed before SaveRegisters already *)
  10104. base := ArrayBaseType(type);
  10105. (* assign method of open array *)
  10106. IF base.IsRecordType() THEN
  10107. Emit (Push(position, length));
  10108. Emit (Push(position, dst));
  10109. Emit (Push(position, op.op));
  10110. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10111. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10112. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10113. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10114. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10115. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10116. Emit (Push(position,length));
  10117. Emit (Push(position, dst));
  10118. Emit (Push(position, length));
  10119. Emit (Push(position, op.op));
  10120. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10121. ELSE
  10122. Emit (Push(position, length));
  10123. Emit (Push(position, dst));
  10124. Emit (Push(position, length));
  10125. Emit (Push(position, op.op));
  10126. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10127. ASSERT(ArrayBaseType(type).IsPointer());
  10128. END;
  10129. RestoreRegisters(saved);
  10130. ELSE
  10131. temp := GetDynamicSize(type,op.tag);
  10132. ReuseCopy(size,temp);
  10133. ReleaseIntermediateOperand(temp);
  10134. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10135. Emit(Sub(position,size,sp,size));
  10136. Emit(And(position,size,size,const));
  10137. Emit(Mov(position,sp,size));
  10138. par := fp;
  10139. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10140. ReleaseIntermediateOperand(size);
  10141. size := GetDynamicSize(type,op.tag);
  10142. END;
  10143. Emit(Copy(position,sp,op.op,size));
  10144. ReleaseIntermediateOperand(size);
  10145. ReleaseOperand(op);
  10146. IntermediateCode.MakeMemory(par,addressType);
  10147. Emit(Mov(position,par,sp));
  10148. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10149. checker.SetCurrentScope(currentScope);
  10150. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10151. Assign(parameterDesignator,parameterDesignator);
  10152. END;
  10153. END;
  10154. parameter := parameter.nextParameter;
  10155. END;
  10156. IF Trace THEN TraceExit("ParameterCopies") END;
  10157. END ParameterCopies;
  10158. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10159. VAR x: SyntaxTree.Variable;
  10160. BEGIN
  10161. x := scope.firstVariable;
  10162. WHILE x # NIL DO
  10163. InitVariable(x,FALSE);
  10164. x := x.nextVariable;
  10165. END;
  10166. END InitVariables;
  10167. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10168. BEGIN
  10169. IF (symbol # NIL) THEN
  10170. RETURN fingerPrinter.SymbolFP(symbol).public
  10171. ELSE
  10172. RETURN 0
  10173. END;
  10174. END GetFingerprint;
  10175. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10176. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10177. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10178. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10179. name: Basic.SegmentedName;
  10180. offset: LONGINT;
  10181. BEGIN
  10182. IF Trace THEN TraceEnter("Body") END;
  10183. ReleaseUsedRegisters(saved); (* just in case ... *)
  10184. section := ir;
  10185. exitLabel := NewLabel ();
  10186. IF moduleBody THEN moduleBodySection := section END;
  10187. IF ir.comments # NIL THEN
  10188. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10189. commentPrintout.SingleStatement(TRUE);
  10190. dump := ir.comments;
  10191. ELSE
  10192. commentPrintout := NIL;
  10193. dump := NIL;
  10194. END;
  10195. prevScope := currentScope;
  10196. currentScope := scope;
  10197. lastSwitchPC := 0;
  10198. cooperativeSwitches := backend.cooperative;
  10199. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10200. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10201. IF x # NIL THEN
  10202. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10203. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10204. IF moduleBody THEN
  10205. ProfilerInit();
  10206. ELSE
  10207. Basic.SegmentedNameToString(ir.name, string);
  10208. ProfilerAddProcedure(numberProcedures,string);
  10209. ProfilerEnterExit(numberProcedures,TRUE);
  10210. END;
  10211. END;
  10212. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10213. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10214. END;
  10215. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10216. IF moduleBody & ~newObjectFile THEN
  10217. InitVariables(moduleScope)
  10218. END;
  10219. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10220. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10221. IF procedure = cellScope.bodyProcedure THEN
  10222. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10223. StaticCallOperand(op, cellScope.constructor);
  10224. Emit(Call(position,op.op,0));
  10225. END;
  10226. END;
  10227. END;
  10228. InitVariables(scope);
  10229. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10230. GetCodeSectionNameForSymbol(procedure, name);
  10231. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10232. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10233. IF ProtectModulesPointers THEN
  10234. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10235. ELSE
  10236. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10237. END;
  10238. IntermediateCode.SetOffset(right,offset); (* tag *)
  10239. IntermediateCode.InitMemory(left,addressType,fp,0);
  10240. Emit(Mov(position, left, right));
  10241. END;
  10242. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10243. ParameterCopies(procedureType);
  10244. IF x.code = NIL THEN
  10245. VisitStatementBlock(x);
  10246. ELSE
  10247. VisitCode(x.code)
  10248. END;
  10249. IF x.finally # NIL THEN (*! mark finally block for object file *)
  10250. ir.SetFinally(ir.pc);
  10251. StatementSequence(x.finally)
  10252. END;
  10253. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10254. IF ~backend.cooperative THEN
  10255. ProfilerEnterExit(numberProcedures,FALSE);
  10256. END;
  10257. INC(numberProcedures);
  10258. END;
  10259. END;
  10260. IF backend.cooperative THEN
  10261. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10262. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10263. END;
  10264. IF x # NIL THEN
  10265. SELF.position := x.position;
  10266. END;
  10267. CheckRegistersFree();
  10268. ASSERT(modifyAssignmentCounter = 0);
  10269. currentScope := prevScope;
  10270. IF Trace THEN TraceExit("Body") END;
  10271. END Body;
  10272. END ImplementationVisitor;
  10273. MetaDataGenerator=OBJECT
  10274. VAR
  10275. implementationVisitor: ImplementationVisitor;
  10276. declarationVisitor: DeclarationVisitor;
  10277. module: Sections.Module;
  10278. moduleName: ARRAY 128 OF CHAR;
  10279. moduleNamePool: Basic.HashTableInt;
  10280. moduleNamePoolSection: IntermediateCode.Section;
  10281. modulePointerSection: IntermediateCode.Section;
  10282. modulePointerSizePC: LONGINT;
  10283. modulePointerSectionOffset: LONGINT;
  10284. modulePointers: LONGINT;
  10285. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  10286. RecordBaseOffset: LONGINT;
  10287. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10288. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10289. TypeTags: LONGINT; (* type extension level support *)
  10290. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10291. patchInfoPC: LONGINT;
  10292. patchCRC: LONGINT;
  10293. CONST
  10294. EmptyBlockOffset = 2;
  10295. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10296. BEGIN
  10297. IF implementationVisitor.backend.cooperative THEN
  10298. TypeTags := MAX(LONGINT);
  10299. BaseTypesTableOffset := 0;
  10300. MethodTableOffset := 2;
  10301. TypeRecordBaseOffset := 0;
  10302. RecordBaseOffset := 0;
  10303. ELSIF simple THEN
  10304. TypeTags := 3; (* only 3 extensions allowed *)
  10305. BaseTypesTableOffset := 1;
  10306. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10307. TypeRecordBaseOffset := 0;
  10308. RecordBaseOffset := 1;
  10309. ELSE
  10310. TypeTags := 16;
  10311. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10312. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10313. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10314. (* change this when Heaps.HeapBlock is modified *)
  10315. RecordBaseOffset := 8;
  10316. END;
  10317. SELF.simple := simple;
  10318. SELF.implementationVisitor := implementationVisitor;
  10319. SELF.declarationVisitor := declarationVisitor;
  10320. implementationVisitor.meta := SELF;
  10321. declarationVisitor.meta := SELF;
  10322. END InitMetaDataGenerator;
  10323. PROCEDURE SetModule(module: Sections.Module);
  10324. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10325. BEGIN
  10326. SELF.module := module;
  10327. Global.GetModuleName(module.module,moduleName);
  10328. Global.GetSymbolSegmentedName(module.module, name);
  10329. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple & ~implementationVisitor.backend.cooperative THEN
  10330. NEW(moduleNamePool, 32);
  10331. (*! require GC protection *)
  10332. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10333. IF ProtectModulesPointers THEN
  10334. name := "Heaps.AnyPtr";
  10335. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10336. (* set base pointer *)
  10337. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10338. END;
  10339. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10340. modulePointers := 0;
  10341. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10342. AddPointer(moduleNamePoolSection, namePoolOffset);
  10343. END;
  10344. END SetModule;
  10345. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10346. BEGIN
  10347. IF ~implementationVisitor.backend.cooperative THEN
  10348. NamedSymbol(modulePointerSection, section.name, NIL, 0, offset);
  10349. INC(modulePointers);
  10350. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10351. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10352. END;
  10353. END AddPointer;
  10354. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10355. BEGIN
  10356. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10357. END GetTypeRecordBaseOffset;
  10358. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10359. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10360. BEGIN
  10361. (* change this when Heaps.HeapBlock is modified *)
  10362. INC(dataAdrOffset,6);
  10363. Info(section,"headerAdr");
  10364. Address(section,0);
  10365. Info(section,"typeDesc");
  10366. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10367. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10368. NamedSymbol(section, name, symbol, 0, offset);
  10369. Info(section,"mark: LONGINT;");
  10370. Longint(section,-1);
  10371. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10372. Info(section,"dataAdr-: ADDRESS");
  10373. Symbol(section,section, dataAdrOffset,0);
  10374. Info(section,"size-: SIZE");
  10375. Address(section,0);
  10376. Info(section,"nextMark: HeapBlock;");
  10377. Address(section,0);
  10378. END HeapBlock;
  10379. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10380. VAR i: LONGINT;
  10381. BEGIN
  10382. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10383. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10384. Info(section,"count*: LONGINT");
  10385. Longint(section,0);
  10386. Info(section,"locked*: BOOLEAN");
  10387. Longint(section,0);
  10388. Info(section,"awaitingLock*: ProcessQueue");
  10389. Address(section,0);
  10390. Address(section,0);
  10391. Info(section,"awaitingCond*: ProcessQueue");
  10392. Address(section,0);
  10393. Address(section,0);
  10394. Info(section,"lockedBy*: ANY");
  10395. Address(section,0);
  10396. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10397. Longint(section,1);
  10398. FOR i := 2 TO 6 DO
  10399. Longint(section,0);
  10400. END;
  10401. Info(section,"lock*: ANY");
  10402. Address(section,0);
  10403. END ProtectedHeapBlock;
  10404. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10405. BEGIN
  10406. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10407. END Info;
  10408. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10409. VAR op: IntermediateCode.Operand;
  10410. BEGIN
  10411. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10412. section.Emit(Data(Basic.invalidPosition,op));
  10413. END Address;
  10414. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10415. VAR op: IntermediateCode.Operand;
  10416. BEGIN
  10417. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10418. section.Emit(Data(Basic.invalidPosition,op));
  10419. END Size;
  10420. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10421. VAR op: IntermediateCode.Operand;
  10422. BEGIN
  10423. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10424. section.Emit(Data(Basic.invalidPosition,op));
  10425. END Set;
  10426. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10427. VAR op: IntermediateCode.Operand;
  10428. BEGIN
  10429. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10430. section.Emit(Data(Basic.invalidPosition,op));
  10431. END Longint;
  10432. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10433. VAR op,noOperand: IntermediateCode.Operand;
  10434. BEGIN
  10435. IntermediateCode.InitOperand(noOperand);
  10436. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10437. section.PatchOperands(pc,op,noOperand,noOperand);
  10438. END PatchAddress;
  10439. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10440. VAR op,noOperand: IntermediateCode.Operand;
  10441. BEGIN
  10442. IntermediateCode.InitOperand(noOperand);
  10443. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10444. section.PatchOperands(pc,op,noOperand,noOperand);
  10445. END PatchSize;
  10446. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10447. VAR op,noOperand: IntermediateCode.Operand;
  10448. BEGIN
  10449. IntermediateCode.InitOperand(noOperand);
  10450. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10451. section.PatchOperands(pc,op,noOperand,noOperand);
  10452. END PatchLongint;
  10453. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10454. VAR op, noOperand: IntermediateCode.Operand;
  10455. BEGIN
  10456. IntermediateCode.InitOperand(noOperand);
  10457. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10458. section.PatchOperands(pc,op,noOperand,noOperand);
  10459. END PatchSymbol;
  10460. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10461. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10462. BEGIN
  10463. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10464. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10465. section.Emit(Data(Basic.invalidPosition,op));
  10466. END Boolean;
  10467. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10468. VAR op: IntermediateCode.Operand;
  10469. BEGIN
  10470. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10471. section.Emit(Data(Basic.invalidPosition,op));
  10472. END Char;
  10473. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10474. VAR op: IntermediateCode.Operand;
  10475. BEGIN
  10476. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10477. section.Emit(Data(Basic.invalidPosition,op));
  10478. END Integer;
  10479. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10480. VAR i: LONGINT;
  10481. BEGIN
  10482. Info(section,str);
  10483. i := 0;
  10484. WHILE(str[i] # 0X) DO
  10485. Char(section,str[i]);
  10486. INC(i);
  10487. END;
  10488. Char(section,0X);
  10489. END String;
  10490. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10491. VAR s: Basic.SectionName;
  10492. BEGIN
  10493. StringPool.GetString(str, s);
  10494. String(section, s);
  10495. END String0;
  10496. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10497. VAR op: IntermediateCode.Operand;
  10498. BEGIN
  10499. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10500. IntermediateCode.SetOffset(op,realOffset);
  10501. section.Emit(Data(Basic.invalidPosition,op));
  10502. END NamedSymbol;
  10503. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10504. VAR op: IntermediateCode.Operand;
  10505. BEGIN
  10506. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10507. IntermediateCode.SetOffset(op,realOffset);
  10508. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10509. END NamedSymbolAt;
  10510. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10511. BEGIN
  10512. IF symbol= NIL THEN
  10513. Address( section, realOffset);
  10514. ASSERT(virtualOffset = 0);
  10515. ELSE
  10516. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10517. END;
  10518. END Symbol;
  10519. (* OutPointers delivers
  10520. {pointerOffset}
  10521. *)
  10522. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10523. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10524. BEGIN
  10525. type := type.resolved;
  10526. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10527. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10528. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10529. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10530. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10531. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10532. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10533. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10534. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10535. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10536. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10537. ELSIF (type IS SyntaxTree.RecordType) THEN
  10538. (* never treat a record like a pointer, even if the pointer field is set! *)
  10539. WITH type: SyntaxTree.RecordType DO
  10540. base := type.GetBaseRecord();
  10541. IF base # NIL THEN
  10542. Pointers(offset,symbol,section, base,numberPointers);
  10543. END;
  10544. variable := type.recordScope.firstVariable;
  10545. WHILE(variable # NIL) DO
  10546. IF ~(variable.untraced) THEN
  10547. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10548. END;
  10549. variable := variable.nextVariable;
  10550. END;
  10551. END;
  10552. ELSIF (type IS SyntaxTree.CellType) THEN
  10553. WITH type: SyntaxTree.CellType DO
  10554. base := type.GetBaseRecord();
  10555. IF base # NIL THEN
  10556. Pointers(offset,symbol,section, base,numberPointers);
  10557. END;
  10558. variable := type.cellScope.firstVariable;
  10559. WHILE(variable # NIL) DO
  10560. IF ~(variable.untraced) THEN
  10561. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10562. END;
  10563. variable := variable.nextVariable;
  10564. END;
  10565. property := type.firstProperty;
  10566. WHILE(property # NIL) DO
  10567. IF ~(property.untraced) THEN
  10568. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10569. END;
  10570. property := property.nextProperty;
  10571. END;
  10572. parameter := type.firstParameter;
  10573. WHILE(parameter # NIL) DO
  10574. IF ~(parameter.untraced) THEN
  10575. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10576. END;
  10577. parameter := parameter.nextParameter;
  10578. END;
  10579. END;
  10580. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10581. WITH type: SyntaxTree.ArrayType DO
  10582. IF type.form= SyntaxTree.Static THEN
  10583. n := type.staticLength;
  10584. base := type.arrayBase.resolved;
  10585. WHILE(base IS SyntaxTree.ArrayType) DO
  10586. type := base(SyntaxTree.ArrayType);
  10587. n := n* type.staticLength;
  10588. base := type.arrayBase.resolved;
  10589. END;
  10590. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10591. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10592. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10593. FOR i := 0 TO n-1 DO
  10594. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10595. END;
  10596. END;
  10597. ELSE
  10598. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10599. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10600. END;
  10601. END;
  10602. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10603. WITH type: SyntaxTree.MathArrayType DO
  10604. IF type.form = SyntaxTree.Static THEN
  10605. n := type.staticLength;
  10606. base := type.arrayBase.resolved;
  10607. WHILE(base IS SyntaxTree.MathArrayType) DO
  10608. type := base(SyntaxTree.MathArrayType);
  10609. n := n* type.staticLength;
  10610. base := type.arrayBase.resolved;
  10611. END;
  10612. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10613. IF SemanticChecker.ContainsPointer(base) THEN
  10614. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10615. FOR i := 0 TO n-1 DO
  10616. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10617. END;
  10618. END;
  10619. ELSE
  10620. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10621. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10622. END
  10623. END;
  10624. (* ELSE no pointers in type *)
  10625. END;
  10626. END Pointers;
  10627. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10628. VAR position,i: LONGINT; ch: CHAR;
  10629. BEGIN
  10630. IF pool.Has(index) THEN
  10631. RETURN pool.GetInt(index)
  10632. ELSE
  10633. position := source.pc;
  10634. pool.PutInt(index, position);
  10635. Info(source, name);
  10636. i := 0;
  10637. REPEAT
  10638. ch := name[i]; INC(i);
  10639. Char( source, ch);
  10640. UNTIL ch = 0X;
  10641. END;
  10642. RETURN position;
  10643. END EnterDynamicName;
  10644. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10645. VAR name: Basic.SectionName; position: LONGINT;
  10646. BEGIN
  10647. IF pool.Has(index) THEN
  10648. RETURN pool.GetInt(index)
  10649. ELSE
  10650. StringPool.GetString(index, name);
  10651. position := EnterDynamicName(source,name,index, pool);
  10652. END;
  10653. RETURN position;
  10654. END DynamicName;
  10655. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10656. VAR section: IntermediateCode.Section;
  10657. BEGIN
  10658. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10659. IF implementationVisitor.backend.cooperative THEN
  10660. Info(section, "TypeDescriptor");
  10661. Basic.ToSegmentedName("BaseTypes.Array", name);
  10662. NamedSymbol(section, name,NIL, 0, 0);
  10663. BasePointer(section);
  10664. offset := 0;
  10665. ELSE
  10666. IF ProtectModulesPointers THEN
  10667. HeapBlock(mName,typeName,section,2);
  10668. END;
  10669. Info(section, "HeapBlock");
  10670. IF ProtectModulesPointers THEN
  10671. Symbol(section,section,2,0);
  10672. ELSE
  10673. Address(section,0);
  10674. END;
  10675. Info(section, "TypeDescriptor");
  10676. Address(section,0);
  10677. offset := section.pc;
  10678. END;
  10679. RETURN section
  10680. END NamedBlock;
  10681. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10682. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10683. BEGIN
  10684. COPY(moduleName,name);
  10685. Strings.Append(name,suffix);
  10686. Basic.ToSegmentedName(name, pooledName);
  10687. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10688. END Block;
  10689. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10690. VAR name: Basic.SegmentedName;
  10691. BEGIN
  10692. Info(source,"ArrayHeader");
  10693. IF implementationVisitor.backend.cooperative THEN
  10694. sizePC := source.pc;
  10695. Address(source,0);
  10696. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10697. IF baseType # "" THEN
  10698. Basic.ToSegmentedName(baseType, name);
  10699. NamedSymbol(source, name,NIL, 0, 0);
  10700. ELSE
  10701. Address(source,0);
  10702. END;
  10703. Address(source,0);
  10704. ELSE
  10705. Address(source,0);
  10706. Address(source,0);
  10707. (* first pointer for GC *)
  10708. IF hasPointer THEN
  10709. (* points to first element in the array, this is NOT the base type descriptor *)
  10710. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10711. ELSE
  10712. Address(source,0);
  10713. END;
  10714. sizePC := source.pc;
  10715. Address(source,0);
  10716. Info(source,"array data");
  10717. END;
  10718. END ArrayBlock;
  10719. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10720. BEGIN
  10721. IF implementationVisitor.backend.cooperative THEN
  10722. PatchSize(section, pc, size);
  10723. PatchSize(section, pc + 3, size);
  10724. ELSE
  10725. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10726. PatchSize(section, pc, size);
  10727. END;
  10728. END PatchArray;
  10729. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10730. VAR
  10731. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10732. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10733. poolMap: Basic.HashTableInt;
  10734. namePool: IntermediateCode.Section;
  10735. namePoolOffset: LONGINT;
  10736. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10737. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10738. BEGIN
  10739. Basic.SegmentedNameToString(s1.name,n1);
  10740. Basic.SegmentedNameToString(s2.name,n2);
  10741. index := 0;
  10742. ch1 := n1[index];
  10743. ch2 := n2[index];
  10744. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10745. INC(index);
  10746. ch1 := n1[index];
  10747. ch2 := n2[index];
  10748. END;
  10749. RETURN ch1 < ch2;
  10750. END Compare;
  10751. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10752. VAR
  10753. i, j: LONGINT;
  10754. x, t: Sections.Section;
  10755. BEGIN
  10756. IF lo < hi THEN
  10757. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10758. WHILE i <= j DO
  10759. WHILE Compare(list[i], x) DO INC(i) END;
  10760. WHILE Compare(x, list[j]) DO DEC(j) END;
  10761. IF i <= j THEN
  10762. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10763. INC(i); DEC(j)
  10764. END
  10765. END;
  10766. IF lo < j THEN QuickSort(list, lo, j) END;
  10767. IF i < hi THEN QuickSort(list, i, hi) END
  10768. END;
  10769. END QuickSort;
  10770. (*
  10771. ExportDesc* = RECORD
  10772. fp*: ADDRESS;
  10773. name* {UNTRACED}: DynamicName;
  10774. adr*: ADDRESS;
  10775. exports*: LONGINT;
  10776. dsc* {UNTRACED}: ExportArray
  10777. END;
  10778. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10779. *)
  10780. PROCEDURE ExportDesc2(
  10781. source: IntermediateCode.Section;
  10782. namePool: IntermediateCode.Section;
  10783. fingerPrinter: FingerPrinter.FingerPrinter;
  10784. symbol: Sections.Section;
  10785. name: StringPool.Index;
  10786. VAR patchAdr: LONGINT
  10787. ): BOOLEAN;
  10788. VAR fingerPrint: SyntaxTree.FingerPrint;
  10789. BEGIN
  10790. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10791. & (symbol.type # Sections.InlineCodeSection)
  10792. THEN
  10793. *)
  10794. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10795. & (symbol.type # Sections.InlineCodeSection))
  10796. THEN
  10797. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10798. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10799. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10800. Longint(source,fingerPrint.public);
  10801. ELSE
  10802. Longint(source, 0);
  10803. END;
  10804. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10805. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10806. Symbol(source, symbol,0,0);
  10807. patchAdr := source.pc;
  10808. Longint(source, 0);
  10809. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10810. Address(source,0);
  10811. END;
  10812. RETURN TRUE
  10813. ELSE
  10814. RETURN FALSE
  10815. END;
  10816. END ExportDesc2;
  10817. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10818. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10819. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10820. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  10821. nextPatch: LONGINT;
  10822. TYPE
  10823. Scope = RECORD
  10824. elements: LONGINT;
  10825. gelements: LONGINT;
  10826. section: IntermediateCode.Section;
  10827. patchAdr: LONGINT;
  10828. arraySizePC: LONGINT;
  10829. beginPC: LONGINT; (* current scope start pc *)
  10830. END;
  10831. BEGIN
  10832. Basic.InitSegmentedName(prev);
  10833. olevel := -1;
  10834. scopes[0].section := source;
  10835. scopes[0].arraySizePC := MIN(LONGINT);
  10836. FOR s := 0 TO LEN(sections)-1 DO
  10837. symbol := sections[s];
  10838. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10839. this := sections[s].name;
  10840. level := 0;
  10841. WHILE (this[level] > 0) DO
  10842. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10843. INC(level);
  10844. END;
  10845. WHILE level < olevel DO
  10846. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10847. IF olevel > 0 THEN
  10848. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10849. nextPatch := scopes[olevel-1].patchAdr+1;
  10850. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10851. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10852. END;
  10853. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10854. DEC(olevel);
  10855. END;
  10856. IF (this[level] > 0) THEN
  10857. IF level > olevel THEN
  10858. (*TRACE("opening",level); *)
  10859. IF scopes[level].section = NIL THEN
  10860. arrayName := ".@ExportArray";
  10861. Strings.AppendInt(arrayName, level);
  10862. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  10863. AddPointer(scopes[level].section,offset);
  10864. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  10865. END;
  10866. scopes[level].beginPC := scopes[level].section.pc;
  10867. olevel := level;
  10868. scopes[olevel].elements := 0;
  10869. END;
  10870. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10871. sym := sections[s];
  10872. ELSE
  10873. sym := NIL;
  10874. END;
  10875. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10876. THEN
  10877. INC(scopes[olevel].elements);
  10878. END;
  10879. (* enter string in scope *)
  10880. INC(level);
  10881. END;
  10882. END;
  10883. Basic.SegmentedNameToString(this, name);
  10884. prev := this;
  10885. END;
  10886. END;
  10887. WHILE 0 <= olevel DO
  10888. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10889. IF olevel > 0 THEN
  10890. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10891. nextPatch := scopes[olevel-1].patchAdr+1;
  10892. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10893. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10894. END;
  10895. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10896. DEC(olevel);
  10897. END;
  10898. level := 0;
  10899. WHILE (level < LEN(scopes)) DO
  10900. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  10901. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10902. END;
  10903. INC(level);
  10904. END;
  10905. END Export;
  10906. BEGIN
  10907. NEW(fingerPrinter);
  10908. NEW(poolMap, 64);
  10909. (* 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 *)
  10910. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10911. NEW(sectionArray, module.allSections.Length());
  10912. FOR i := 0 TO module.allSections.Length() - 1 DO
  10913. section := module.allSections.GetSection(i);
  10914. sectionArray[i] := section;
  10915. END;
  10916. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10917. Export(sectionArray^);
  10918. END ExportDesc;
  10919. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10920. VAR
  10921. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10922. BEGIN
  10923. Info(source, "exception table offsets array descriptor");
  10924. size := 0;
  10925. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  10926. Info(source, "exception table content");
  10927. FOR i := 0 TO module.allSections.Length() - 1 DO
  10928. p := module.allSections.GetSection(i);
  10929. IF p.type = Sections.CodeSection THEN
  10930. finallyPC := p(IntermediateCode.Section).finally;
  10931. IF finallyPC>=0 THEN
  10932. Symbol( source, p, 0,0);
  10933. Symbol( source, p, finallyPC, 0);
  10934. Symbol( source, p, finallyPC,0);
  10935. INC(size);
  10936. END;
  10937. END
  10938. END;
  10939. PatchArray(source,sizePC,size);
  10940. END ExceptionArray;
  10941. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10942. VAR i: LONGINT; ch: CHAR;
  10943. BEGIN
  10944. i := 0;
  10945. REPEAT
  10946. ch := name[i]; INC(i);
  10947. Char( section, ch);
  10948. UNTIL ch = 0X;
  10949. WHILE i < 32 DO
  10950. Char( section, 0X); INC(i);
  10951. END;
  10952. END Name;
  10953. PROCEDURE References(section: IntermediateCode.Section);
  10954. CONST
  10955. sfTypeNone = 0X;
  10956. sfTypeCHAR = 01X;
  10957. sfTypeCHAR8 = 02X;
  10958. sfTypeCHAR16 = 03X;
  10959. sfTypeCHAR32 = 04X;
  10960. sfTypeRANGE = 05X;
  10961. sfTypeSHORTINT = 06X;
  10962. sfTypeINTEGER = 07X;
  10963. sfTypeLONGINT = 08X;
  10964. sfTypeHUGEINT = 09X;
  10965. sfTypeWORD = 0AX;
  10966. sfTypeLONGWORD = 0BX;
  10967. sfTypeSIGNED8 = 0CX;
  10968. sfTypeSIGNED16 = 0DX;
  10969. sfTypeSIGNED32 = 0EX;
  10970. sfTypeSIGNED64 = 0FX;
  10971. sfTypeUNSIGNED8 = 10X;
  10972. sfTypeUNSIGNED16 = 11X;
  10973. sfTypeUNSIGNED32 = 12X;
  10974. sfTypeUNSIGNED64 = 13X;
  10975. sfTypeREAL = 14X;
  10976. sfTypeLONGREAL = 15X;
  10977. sfTypeCOMPLEX = 16X;
  10978. sfTypeLONGCOMPLEX = 17X;
  10979. sfTypeBOOLEAN = 18X;
  10980. sfTypeSET = 19X;
  10981. sfTypeANY = 1AX;
  10982. sfTypeOBJECT = 1BX;
  10983. sfTypeBYTE = 1CX;
  10984. sfTypeADDRESS = 1DX;
  10985. sfTypeSIZE = 1EX;
  10986. sfTypeIndirect = 1FX;
  10987. sfTypeRecord = 20X;
  10988. sfTypePointerToRecord = 21X;
  10989. sfTypePointerToArray = 22X;
  10990. sfTypeOpenArray = 23X;
  10991. sfTypeStaticArray = 24X;
  10992. sfTypeDynamicArray = 25X;
  10993. sfTypeMathStaticArray = 26X;
  10994. sfTypeMathOpenArray = 27X;
  10995. sfTypeMathTensor = 28X;
  10996. sfTypeDelegate = 29X;
  10997. sfTypeENUM = 2AX;
  10998. sfTypeCELL = 2BX;
  10999. sfTypePORT = 2CX;
  11000. sfIN = 0X;
  11001. sfOUT = 1X;
  11002. flagDelegate = 0;
  11003. flagConstructor = 1;
  11004. (* variable / parameter addressing modes *)
  11005. sfAbsolute = 0X; (* global vars *)
  11006. sfRelative = 1X; (* variables, value parameters *)
  11007. sfIndirect = 2X; (* var parameters *)
  11008. sfScopeBegin = 0F0X;
  11009. sfScopeEnd = 0F1X;
  11010. sfProcedure = 0F2X;
  11011. sfVariable = 0F3X;
  11012. sfTypeDeclaration = 0F4X;
  11013. sfModule = 0FFX;
  11014. RefInfo = TRUE;
  11015. VAR
  11016. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11017. indirectTypes: Basic.HashTable;
  11018. PROCEDURE CurrentIndex(): SIZE;
  11019. VAR i: LONGINT;
  11020. BEGIN
  11021. FOR i := startPC TO section.pc -1 DO
  11022. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11023. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11024. END;
  11025. startPC := section.pc;
  11026. RETURN lastOffset;
  11027. END CurrentIndex;
  11028. (*
  11029. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11030. Module = sfModule prevSymbol:SIZE name:String Scope.
  11031. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11032. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11033. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11034. Type =
  11035. sfTypePointerToRecord
  11036. | sfTypePointerToArray Type
  11037. | sfTypeOpenArray Type
  11038. | sfTypeDynamicArray Type
  11039. | sfTypeStaticArray length:SIZE Type
  11040. | sfTypeMathOpenArray Type
  11041. | sfTypeMathStaticArray length:SIZE Type
  11042. | sfTypeMathTensor Type
  11043. | sfTypeRecord tdAdr:ADDRESS
  11044. | sfTypeDelegate {Parameter} return:Type
  11045. | sfTypePort (sfIN | sfOUT)
  11046. | sfTypeBOOLEAN
  11047. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11048. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11049. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11050. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11051. | sfTypeWORD | sfTypeLONGWORD
  11052. | sfTypeREAL | sfTypeLONGREAL
  11053. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11054. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11055. | sfTypeIndirect offset:SIZE.
  11056. *)
  11057. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11058. VAR offset: SIZE;
  11059. BEGIN
  11060. IF indirectTypes.Has(type) THEN
  11061. offset := indirectTypes.GetInt(type);
  11062. Char(section, sfTypeIndirect);
  11063. Size(section, offset);
  11064. RETURN TRUE;
  11065. ELSE
  11066. indirectTypes.PutInt(type, CurrentIndex());
  11067. RETURN FALSE;
  11068. END;
  11069. END Indirect;
  11070. PROCEDURE NType(type: SyntaxTree.Type);
  11071. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11072. segmentedName: Basic.SegmentedName; offset: SIZE; parameter: SyntaxTree.Parameter;
  11073. BEGIN
  11074. IF type = NIL THEN
  11075. Char(section, sfTypeNone)
  11076. ELSE
  11077. type := type.resolved;
  11078. size := type.sizeInBits;
  11079. WITH type:SyntaxTree.PointerType DO
  11080. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11081. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11082. Char(section, sfTypePointerToRecord);
  11083. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11084. ELSE
  11085. IF RefInfo THEN Info(section,"PointerToArray") END;
  11086. Char(section, sfTypePointerToArray);
  11087. NType(type.pointerBase);
  11088. END;
  11089. | type: SyntaxTree.ArrayType DO
  11090. IF ~Indirect(type) THEN
  11091. IF type.form = SyntaxTree.Open THEN
  11092. IF RefInfo THEN Info(section,"OpenArray") END;
  11093. Char(section, sfTypeOpenArray);
  11094. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11095. IF RefInfo THEN Info(section,"DynamicArray") END;
  11096. Char(section, sfTypeDynamicArray);
  11097. ELSIF type.form = SyntaxTree.Static THEN
  11098. IF RefInfo THEN Info(section,"StaticArray") END;
  11099. Char(section, sfTypeStaticArray);
  11100. Size(section, type.staticLength);
  11101. ELSE
  11102. HALT(100);
  11103. END;
  11104. NType(type.arrayBase);
  11105. END;
  11106. | type: SyntaxTree.MathArrayType DO
  11107. IF ~Indirect(type) THEN
  11108. IF type.form = SyntaxTree.Open THEN
  11109. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11110. Char(section, sfTypeMathOpenArray);
  11111. ELSIF type.form = SyntaxTree.Static THEN
  11112. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11113. Char(section, sfTypeMathStaticArray);
  11114. Size(section, type.staticLength);
  11115. ELSIF type.form = SyntaxTree.Tensor THEN
  11116. IF RefInfo THEN Info(section,"MathTensor") END;
  11117. Char(section, sfTypeMathTensor);
  11118. ELSE
  11119. HALT(100);
  11120. END;
  11121. NType(type.arrayBase);
  11122. END;
  11123. | type: SyntaxTree.RecordType DO
  11124. IF ~Indirect(type) THEN
  11125. IF type.pointerType # NIL (* OBJECT *) THEN
  11126. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11127. Char(section, sfTypePointerToRecord)
  11128. ELSE
  11129. IF RefInfo THEN Info(section,"Record") END;
  11130. Char(section, sfTypeRecord);
  11131. td := type.typeDeclaration;
  11132. IF RefInfo THEN Info(section,"TD") END;
  11133. IF (td # NIL) THEN
  11134. Global.GetSymbolSegmentedName(td,segmentedName);
  11135. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11136. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11137. ELSE
  11138. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11139. END;
  11140. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11141. Symbol(section, tir, 0, offset);
  11142. ELSE
  11143. Address(section, 0);
  11144. END;
  11145. END;
  11146. END;
  11147. | type: SyntaxTree.CellType DO
  11148. IF ~Indirect(type) THEN
  11149. IF RefInfo THEN Info(section,"Record") END;
  11150. Char(section, sfTypeRecord);
  11151. td := type.typeDeclaration;
  11152. IF RefInfo THEN Info(section,"TD") END;
  11153. IF (td # NIL) THEN
  11154. Global.GetSymbolSegmentedName(td,segmentedName);
  11155. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11156. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11157. ELSE
  11158. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11159. END;
  11160. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11161. Symbol(section, tir, 0, offset);
  11162. ELSE
  11163. Address(section, 0);
  11164. END;
  11165. END;
  11166. | type: SyntaxTree.PortType DO
  11167. Char(section, sfTypePORT);
  11168. IF type.direction = SyntaxTree.OutPort THEN
  11169. Char(section, sfOUT)
  11170. ELSE
  11171. Char(section, sfIN)
  11172. END;
  11173. | type: SyntaxTree.ProcedureType DO
  11174. IF ~Indirect(type) THEN
  11175. Char(section, sfTypeDelegate);
  11176. parameter := type.firstParameter;
  11177. WHILE(parameter # NIL) DO
  11178. NParameter(parameter, -1);
  11179. parameter := parameter.nextParameter;
  11180. END;
  11181. NType(type.returnType);
  11182. END;
  11183. | type:SyntaxTree.EnumerationType DO
  11184. Char(section, sfTypeENUM);
  11185. | type: SyntaxTree.BasicType DO
  11186. WITH type: SyntaxTree.BooleanType DO
  11187. IF RefInfo THEN Info(section,"Boolean") END;
  11188. Char(section, sfTypeBOOLEAN);
  11189. | type: SyntaxTree.CharacterType DO
  11190. IF type = module.system.characterType THEN
  11191. IF RefInfo THEN Info(section,"CHAR") END;
  11192. Char(section, sfTypeCHAR);
  11193. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11194. IF RefInfo THEN Info(section,"CHAR8") END;
  11195. Char(section, sfTypeCHAR8)
  11196. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11197. IF RefInfo THEN Info(section,"CHAR16") END;
  11198. Char(section, sfTypeCHAR16);
  11199. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11200. IF RefInfo THEN Info(section,"CHAR32") END;
  11201. Char(section, sfTypeCHAR32);
  11202. ELSE
  11203. HALT(100);
  11204. END;
  11205. |type: SyntaxTree.IntegerType DO
  11206. IF type(SyntaxTree.IntegerType).signed THEN
  11207. IF (type = module.system.shortintType) THEN
  11208. IF RefInfo THEN Info(section,"SHORTINT") END;
  11209. Char(section, sfTypeSHORTINT)
  11210. ELSIF (type = module.system.integerType) THEN
  11211. IF RefInfo THEN Info(section,"INTEGER") END;
  11212. Char(section, sfTypeINTEGER)
  11213. ELSIF (type = module.system.longintType) THEN
  11214. IF RefInfo THEN Info(section,"LONGINT") END;
  11215. Char(section, sfTypeLONGINT)
  11216. ELSIF (type = module.system.hugeintType) THEN
  11217. IF RefInfo THEN Info(section,"HUGEINT") END;
  11218. Char(section, sfTypeHUGEINT)
  11219. ELSIF (type = module.system.wordType) THEN
  11220. IF RefInfo THEN Info(section,"WORD") END;
  11221. Char(section, sfTypeWORD)
  11222. ELSIF (type = module.system.longWordType) THEN
  11223. IF RefInfo THEN Info(section,"LONGWORD") END;
  11224. Char(section, sfTypeLONGWORD);
  11225. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11226. IF RefInfo THEN Info(section,"SIGNED8") END;
  11227. Char(section, sfTypeSIGNED8)
  11228. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11229. IF RefInfo THEN Info(section,"SIGNED16") END;
  11230. Char(section, sfTypeSIGNED16)
  11231. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11232. IF RefInfo THEN Info(section,"SIGNED32") END;
  11233. Char(section, sfTypeSIGNED32)
  11234. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11235. IF RefInfo THEN Info(section,"SIGNED64") END;
  11236. Char(section, sfTypeSIGNED64)
  11237. ELSE
  11238. HALT(100);
  11239. END
  11240. ELSE (* unsigned *)
  11241. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11242. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11243. Char(section, sfTypeUNSIGNED8)
  11244. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11245. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11246. Char(section, sfTypeUNSIGNED16)
  11247. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11248. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11249. Char(section, sfTypeUNSIGNED32)
  11250. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11251. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11252. Char(section, sfTypeUNSIGNED64)
  11253. ELSE
  11254. HALT(100)
  11255. END
  11256. END;
  11257. | type: SyntaxTree.FloatType DO
  11258. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11259. IF RefInfo THEN Info(section,"REAL") END;
  11260. Char(section, sfTypeREAL);
  11261. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11262. IF RefInfo THEN Info(section,"LONGREAL") END;
  11263. Char(section, sfTypeLONGREAL);
  11264. ELSE
  11265. HALT(100);
  11266. END;
  11267. |type: SyntaxTree.ComplexType DO
  11268. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11269. IF RefInfo THEN Info(section,"COMPLEX") END;
  11270. Char(section, sfTypeCOMPLEX);
  11271. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11272. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11273. Char(section, sfTypeLONGCOMPLEX);
  11274. ELSE
  11275. HALT(100);
  11276. END;
  11277. |type:SyntaxTree.SetType DO
  11278. IF RefInfo THEN Info(section,"SET") END;
  11279. Char(section, sfTypeSET);
  11280. |type:SyntaxTree.AnyType DO
  11281. IF RefInfo THEN Info(section,"ANY") END;
  11282. Char(section, sfTypeANY);
  11283. |type:SyntaxTree.ObjectType DO
  11284. IF RefInfo THEN Info(section,"OBJECT") END;
  11285. Char(section, sfTypeOBJECT);
  11286. |type:SyntaxTree.ByteType DO
  11287. IF RefInfo THEN Info(section,"BYTE") END;
  11288. Char(section, sfTypeBYTE);
  11289. |type:SyntaxTree.RangeType DO
  11290. IF RefInfo THEN Info(section,"RANGE") END;
  11291. Char(section, sfTypeRANGE)
  11292. |type:SyntaxTree.AddressType DO
  11293. IF RefInfo THEN Info(section,"ADDRESS") END;
  11294. Char(section, sfTypeADDRESS)
  11295. |type:SyntaxTree.SizeType DO
  11296. IF RefInfo THEN Info(section,"SIZE") END;
  11297. Char(section, sfTypeSIZE)
  11298. ELSE
  11299. HALT(100)
  11300. END;
  11301. ELSE HALT(101);
  11302. END;
  11303. END;
  11304. END NType;
  11305. (*
  11306. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11307. *)
  11308. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11309. VAR pos: LONGINT; type: SyntaxTree.Type;
  11310. BEGIN
  11311. IF RefInfo THEN Info(section, "Parameter") END;
  11312. Char(section, sfVariable);
  11313. Size(section, procOffset);
  11314. String0(section, parameter.name);
  11315. type := parameter.type.resolved;
  11316. IF parameter.kind = SyntaxTree.VarParameter THEN
  11317. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11318. ELSE Char(section, sfIndirect)
  11319. END;
  11320. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11321. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11322. Char(section, sfIndirect);
  11323. ELSE
  11324. Char(section, sfRelative);
  11325. END;
  11326. ELSE
  11327. Char(section, sfRelative);
  11328. END;
  11329. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11330. NType(parameter.type);
  11331. END NParameter;
  11332. (*
  11333. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11334. *)
  11335. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11336. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11337. flags: SET;
  11338. BEGIN
  11339. IF procedure.externalName # NIL THEN RETURN END;
  11340. IF RefInfo THEN Info(section, "Procedure") END;
  11341. pos := CurrentIndex();
  11342. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11343. Char(section, sfProcedure);
  11344. Size(section, scopeOffset);
  11345. String0(section,procedure.name);
  11346. s := module.allSections.FindBySymbol(procedure);
  11347. Symbol(section,s,0,0); (* start *)
  11348. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11349. flags := {};
  11350. IF procedureType.isDelegate THEN
  11351. INCL(flags, flagDelegate);
  11352. END;
  11353. IF procedure.isConstructor THEN
  11354. INCL(flags, flagConstructor);
  11355. END;
  11356. Set(section, flags);
  11357. IF RefInfo THEN Info(section, "Parameters") END;
  11358. parameter := procedureType.firstParameter;
  11359. WHILE(parameter # NIL) DO
  11360. NParameter(parameter, pos);
  11361. parameter := parameter.nextParameter;
  11362. END;
  11363. IF procedureType.returnParameter # NIL THEN
  11364. NParameter(procedureType.returnParameter, pos);
  11365. END;
  11366. IF procedureType.selfParameter # NIL THEN
  11367. NParameter(procedureType.selfParameter, pos);
  11368. END;
  11369. IF RefInfo THEN Info(section, "ReturnType") END;
  11370. NType(procedureType.returnType);
  11371. NScope(procedure.procedureScope, pos);
  11372. END NProcedure;
  11373. (*
  11374. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11375. *)
  11376. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11377. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11378. BEGIN
  11379. IF RefInfo THEN Info(section, "Variable") END;
  11380. pos := CurrentIndex();
  11381. Char(section, sfVariable);
  11382. Size(section, scopeOffset);
  11383. String0(section, variable.name);
  11384. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11385. Char(section, sfAbsolute);
  11386. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11387. NamedSymbol(section, sn,variable, 0,0);
  11388. ELSE
  11389. Char(section, sfRelative);
  11390. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11391. END;
  11392. NType(variable.type);
  11393. s := module.allSections.FindBySymbol(variable);
  11394. END NVariable;
  11395. (*
  11396. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11397. *)
  11398. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11399. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11400. BEGIN
  11401. IF typeDeclaration = NIL THEN RETURN END;
  11402. pos := CurrentIndex();
  11403. s := module.allSections.FindBySymbol(typeDeclaration);
  11404. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11405. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11406. Char(section, sfTypeDeclaration);
  11407. Size(section, scopeOffset);
  11408. String0(section, typeDeclaration.name);
  11409. declared := typeDeclaration.declaredType.resolved;
  11410. IF (declared IS SyntaxTree.PointerType) THEN
  11411. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11412. END;
  11413. WITH declared: SyntaxTree.RecordType DO
  11414. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11415. Symbol(section, s, 0, offset);
  11416. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11417. Basic.AppendToSegmentedName(name,".@Info");
  11418. s := module.allSections.FindByName(name);
  11419. IF s # NIL THEN (* does not work for coop *)
  11420. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11421. END;
  11422. NScope(declared.recordScope, pos);
  11423. |declared: SyntaxTree.CellType DO
  11424. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11425. Symbol(section, s, 0, offset);
  11426. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11427. Basic.AppendToSegmentedName(name,".@Info");
  11428. s := module.allSections.FindByName(name);
  11429. IF s # NIL THEN
  11430. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11431. END;
  11432. NScope(declared.cellScope, pos);
  11433. ELSE
  11434. Address(section, 0);
  11435. END;
  11436. END NTypeDeclaration;
  11437. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11438. VAR pos: LONGINT;
  11439. BEGIN
  11440. pos := CurrentIndex();
  11441. Char(section,sfModule);
  11442. Size(section, prevSymbol);
  11443. String0(section, module.name);
  11444. NScope(module.moduleScope, pos);
  11445. END NModule;
  11446. (*
  11447. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11448. *)
  11449. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11450. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11451. BEGIN
  11452. IF scope = NIL THEN RETURN END;
  11453. IF RefInfo THEN Info(section, "Scope") END;
  11454. Char(section, sfScopeBegin);
  11455. variable := scope.firstVariable;
  11456. WHILE (variable # NIL) DO
  11457. NVariable(variable, prevSymbol);
  11458. variable := variable.nextVariable;
  11459. END;
  11460. WITH scope: SyntaxTree.ModuleScope DO
  11461. bodyProcedure := scope.bodyProcedure;
  11462. |scope: SyntaxTree.RecordScope DO
  11463. bodyProcedure := scope.bodyProcedure;
  11464. ELSE
  11465. bodyProcedure := NIL;
  11466. END;
  11467. IF bodyProcedure # NIL THEN
  11468. NProcedure(bodyProcedure, prevSymbol)
  11469. END;
  11470. procedure := scope.firstProcedure;
  11471. WHILE procedure # NIL DO
  11472. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11473. procedure := procedure.nextProcedure;
  11474. END;
  11475. typeDeclaration := scope.firstTypeDeclaration;
  11476. WHILE typeDeclaration # NIL DO
  11477. NTypeDeclaration(typeDeclaration, prevSymbol);
  11478. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11479. END;
  11480. Char(section, sfScopeEnd); (* scope ends *)
  11481. END NScope;
  11482. BEGIN
  11483. NEW(indirectTypes, 32);
  11484. ArrayBlock(section,sizePC,"", FALSE);
  11485. startPC := section.pc;
  11486. NModule(module.module, -1);
  11487. PatchArray(section,sizePC,CurrentIndex());
  11488. END References;
  11489. (*
  11490. Command* = RECORD
  11491. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11492. name*: Name; (* name of the procedure *)
  11493. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11494. entryAdr* : ADDRESS; (* entry address of procedure *)
  11495. END;
  11496. *)
  11497. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11498. VAR
  11499. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11500. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11501. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11502. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11503. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11504. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11505. BEGIN
  11506. RETURN
  11507. (type = NIL) OR
  11508. (type.resolved IS SyntaxTree.RecordType) OR
  11509. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11510. (type.resolved IS SyntaxTree.AnyType);
  11511. END TypeAllowed;
  11512. BEGIN
  11513. numberParameters := procedureType.numberParameters;
  11514. RETURN
  11515. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11516. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11517. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11518. END GetProcedureAllowed;
  11519. PROCEDURE WriteType(type : SyntaxTree.Type);
  11520. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11521. name: Basic.SegmentedName; offset: LONGINT;
  11522. BEGIN
  11523. IF type = NIL THEN
  11524. Address(source,0);
  11525. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11526. Address(source,1);
  11527. ELSE
  11528. type := type.resolved;
  11529. IF type IS SyntaxTree.PointerType THEN
  11530. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11531. END;
  11532. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11533. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11534. name[0] := typeDeclaration.name; name[1] := -1;
  11535. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11536. ASSERT(section # NIL);
  11537. ELSE
  11538. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11539. (* TODO *)
  11540. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11541. END;
  11542. IF implementationVisitor.backend.cooperative THEN
  11543. offset := 0;
  11544. ELSE
  11545. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11546. END;
  11547. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11548. END;
  11549. END WriteType;
  11550. BEGIN
  11551. Info(source, "command array descriptor");
  11552. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11553. numberCommands := 0;
  11554. Info(source, "command array content");
  11555. FOR i := 0 TO module.allSections.Length() - 1 DO
  11556. p := module.allSections.GetSection(i);
  11557. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11558. procedure := p.symbol(SyntaxTree.Procedure);
  11559. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11560. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11561. procedure.GetName(name);
  11562. Name(source,name);
  11563. numberParameters := procedureType.numberParameters;
  11564. (* offset of type of first parameter *)
  11565. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11566. ELSE WriteType(procedureType.firstParameter.type)
  11567. END;
  11568. (* offset of type of return parameter *)
  11569. WriteType(procedureType.returnType);
  11570. (* command name *)
  11571. (* command code offset *)
  11572. Symbol(source,p,0,0);
  11573. INC(numberCommands);
  11574. IF Trace THEN
  11575. D.Ln;
  11576. END;
  11577. END;
  11578. END
  11579. END;
  11580. PatchArray(source,sizePC,numberCommands);
  11581. END CommandArray;
  11582. (* to prevent from double import of different module aliases *)
  11583. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11584. VAR i: SyntaxTree.Import;
  11585. BEGIN
  11586. i := module.module.moduleScope.firstImport;
  11587. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11588. i := i.nextImport;
  11589. END;
  11590. RETURN i = import
  11591. END IsFirstDirectOccurence;
  11592. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11593. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11594. BEGIN
  11595. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11596. ArrayBlock(source,pc,"", FALSE);
  11597. Info(source, "import module array data");
  11598. IF implementationVisitor.backend.cooperative THEN
  11599. offset := 0;
  11600. ELSE
  11601. IF module.system.addressType.sizeInBits = 64 THEN
  11602. (* change this when Heaps.HeapBlock is modified *)
  11603. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11604. ELSE
  11605. (* change this when Heaps.HeapBlock is modified *)
  11606. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11607. END;
  11608. END;
  11609. import := module.module.moduleScope.firstImport;
  11610. numberImports := 0;
  11611. WHILE import # NIL DO
  11612. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11613. Global.GetModuleSegmentedName(import.module,name);
  11614. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11615. NamedSymbol(source, name, NIL, 0, offset);
  11616. INC(numberImports);
  11617. END;
  11618. import := import.nextImport
  11619. END;
  11620. PatchArray(source,pc,numberImports);
  11621. END ImportsArray;
  11622. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11623. VAR
  11624. p: Sections.Section; sizePC, size, i: LONGINT;
  11625. BEGIN
  11626. Info(source, "Type info section");
  11627. size := 0;
  11628. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11629. FOR i := 0 TO module.allSections.Length() - 1 DO
  11630. p := module.allSections.GetSection(i);
  11631. WITH p: IntermediateCode.Section DO
  11632. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11633. Symbol(source,p,EmptyBlockOffset,0);
  11634. INC(size);
  11635. END;
  11636. END
  11637. END;
  11638. PatchArray(source,sizePC,size);
  11639. END TypeInfoSection;
  11640. (*
  11641. ProcTableEntry* = RECORD
  11642. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11643. noPtr*: LONGINT;
  11644. END;
  11645. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11646. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11647. *)
  11648. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11649. VAR
  11650. numberPointers: SIZE;
  11651. procedure: SyntaxTree.Procedure;
  11652. BEGIN
  11653. Info(section,"pcFrom");
  11654. Symbol(section,procedureSection,0,0);
  11655. Info(section,"pcTo");
  11656. Symbol(section, procedureSection, procedureSection.pc, 0);
  11657. Info(section,"pointer to offsets array");
  11658. Symbol(section, section,section.pc+1,0);
  11659. Info(section,"offsets array");
  11660. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11661. PointerArray(section, procedure.procedureScope, numberPointers);
  11662. END ProcedureDescriptor;
  11663. (* only for tracing, the descriptor is otherwise not complete ! *)
  11664. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11665. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11666. BEGIN
  11667. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11668. name := procedureSection.name;
  11669. Basic.AppendToSegmentedName(name,".@Info");
  11670. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11671. Address(section,0);
  11672. Symbol(section,section,2,0);
  11673. (*
  11674. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11675. descSize: SIZE;
  11676. sentinel: ADDRESS; (* = MPO-4 *)
  11677. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11678. flags*: SET;
  11679. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11680. name*: Name;
  11681. END;
  11682. *)
  11683. Size(section, 0);
  11684. Address(section,0);
  11685. Address(section,0);
  11686. Set(section,{});
  11687. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); END;
  11688. moduleSection := ModuleSection();
  11689. Symbol( section, moduleSection, moduleSection.pc,0);
  11690. IF procedureSection.symbol = NIL THEN
  11691. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11692. ELSE
  11693. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11694. END;
  11695. Name(section, infoName);
  11696. Size(section, 0);
  11697. RETURN section;
  11698. END MakeProcedureDescriptorTag;
  11699. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11700. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11701. BEGIN
  11702. name := procedureSection.name;
  11703. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11704. IF implementationVisitor.backend.cooperative THEN
  11705. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11706. Info(section, "TypeDescriptor");
  11707. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11708. NamedSymbol(dest, name,NIL, 0, 0);
  11709. BaseRecord(dest);
  11710. offset := 0;
  11711. ELSIF CreateProcedureDescInfo THEN
  11712. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11713. Address(dest,0);
  11714. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11715. offset := dest.pc;
  11716. ELSE
  11717. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11718. END;
  11719. ProcedureDescriptor(dest, procedureSection);
  11720. Symbol(section, dest, offset, 0);
  11721. END ProcedureDescriptorPointer;
  11722. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11723. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11724. BEGIN
  11725. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11726. numberProcs := 0;
  11727. FOR i := 0 TO module.allSections.Length() - 1 DO
  11728. destination := module.allSections.GetSection(i);
  11729. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11730. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11731. INC(numberProcs);
  11732. END
  11733. END;
  11734. PatchArray(section, sizePC, numberProcs);
  11735. END ProcedureDescriptorArray;
  11736. (*
  11737. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11738. VAR
  11739. next*: Module; (** once a module is published, all fields are read-only *)
  11740. name*: Name;
  11741. init, published: BOOLEAN;
  11742. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11743. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11744. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11745. command*: POINTER TO ARRAY OF Command;
  11746. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11747. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11748. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11749. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11750. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11751. data*, code*: Bytes;
  11752. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11753. export*: ExportDesc;
  11754. term*: TerminationHandler;
  11755. exTable*: ExceptionTable;
  11756. noProcs*: LONGINT;
  11757. firstProc*: ADDRESS; <- done by loader
  11758. maxPtrs*: LONGINT;
  11759. crc*: LONGINT;
  11760. *)
  11761. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11762. BEGIN
  11763. Info(section, "cycle");
  11764. Size(section,0);
  11765. Info(section, "references");
  11766. Size(section,0);
  11767. Info(section, "nextMarked");
  11768. Address(section,0);
  11769. Info(section, "nextWatched");
  11770. Address(section,0);
  11771. END BasePointer;
  11772. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11773. BEGIN
  11774. BasePointer(section);
  11775. Info(section, "action");
  11776. Address(section,0);
  11777. Info(section, "monitor");
  11778. Address(section,0);
  11779. END BaseObject;
  11780. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11781. BEGIN
  11782. BasePointer(section);
  11783. Info(section, "action");
  11784. Address(section,0);
  11785. Info(section, "monitor");
  11786. Address(section,0);
  11787. END BaseRecord;
  11788. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11789. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11790. pooledName: Basic.SegmentedName;
  11791. symbol: SyntaxTree.Symbol;
  11792. BEGIN
  11793. Global.GetModuleName(module.module,name);
  11794. Strings.Append(name,".@Module.@Descriptor");
  11795. Basic.ToSegmentedName(name, pooledName);
  11796. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11797. Symbol(section,descriptorSection,0,0);
  11798. Info(descriptorSection, "descriptor");
  11799. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11800. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11801. Address(descriptorSection,0);
  11802. Global.GetModuleName(module.module,name);
  11803. Strings.Append(name,".@Trace");
  11804. Basic.ToSegmentedName(name, pooledName);
  11805. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11806. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11807. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11808. END ModuleDescriptor;
  11809. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11810. VAR name: ARRAY 128 OF CHAR;
  11811. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11812. symbol: SyntaxTree.Symbol;
  11813. BEGIN
  11814. ASSERT(implementationVisitor.backend.newObjectFile);
  11815. Global.GetModuleName(module.module,name);
  11816. Strings.Append(name,".@Module");
  11817. Basic.ToSegmentedName(name, pooledName);
  11818. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11819. moduleSection.SetExported(TRUE);
  11820. IF moduleSection.pc = 0 THEN
  11821. IF implementationVisitor.backend.cooperative THEN
  11822. Info(moduleSection, "descriptor");
  11823. ModuleDescriptor(moduleSection);
  11824. BaseObject(moduleSection);
  11825. implementationVisitor.CreateTraceModuleMethod(module.module);
  11826. ELSE
  11827. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11828. Info(moduleSection, "HeapBlock");
  11829. Symbol(moduleSection,moduleSection,2,0);
  11830. Info(moduleSection, "TypeDescriptor");
  11831. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11832. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11833. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11834. END;
  11835. END;
  11836. RETURN moduleSection;
  11837. END ModuleSection;
  11838. PROCEDURE NewModuleInfo();
  11839. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11840. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11841. sectionName: Basic.SectionName;
  11842. CONST MPO=-40000000H;
  11843. BEGIN
  11844. (*
  11845. TypeDesc* = POINTER TO RECORD
  11846. descSize: SIZE;
  11847. sentinel: LONGINT; (* = MPO-4 *)
  11848. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11849. flags*: SET;
  11850. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11851. name*: Name;
  11852. refsOffset: SIZE;
  11853. END;
  11854. *)
  11855. (*name is missing prefixes sometimes*)
  11856. Global.GetModuleSegmentedName(module.module,name);
  11857. Basic.AppendToSegmentedName(name,".@Info");
  11858. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11859. Info(source, "HeapBlock");
  11860. Address(source,0); (* an empty heap block prevents GC marking *)
  11861. Info(source, "TypeDescriptor");
  11862. Address(source,0);
  11863. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  11864. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11865. Address(source,MPO-4);
  11866. Info(source, "type tag pointer");
  11867. Address( source,0);
  11868. Info(source, "type flags");
  11869. flags := {};
  11870. Set( source, flags);
  11871. Info(source, "pointer to module");
  11872. moduleSection := ModuleSection();
  11873. Symbol( source, moduleSection, moduleSection.pc,0);
  11874. Info(source, "type name");
  11875. i := 0;
  11876. sectionName := "@Self";
  11877. (*
  11878. Global.GetSymbolSegmentedName(td,name);
  11879. Basic.SegmentedNameToString(name, sectionName);
  11880. *)
  11881. Name(source,sectionName);
  11882. source.SetReferenced(FALSE);
  11883. patchInfoPC := source.pc;
  11884. Size(source, 0);
  11885. END NewModuleInfo;
  11886. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11887. VAR
  11888. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11889. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  11890. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11891. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  11892. referenceSectionOffset : LONGINT;
  11893. name: Basic.SegmentedName; offset: LONGINT;
  11894. flags: SET;
  11895. BEGIN
  11896. NewModuleInfo();
  11897. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11898. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11899. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11900. ImportsArray(importSection);
  11901. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11902. CommandArray(commandsSection);
  11903. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11904. ExceptionArray(exceptionSection);
  11905. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11906. AddPointer(typeInfoSection, typeInfoSectionOffset);
  11907. TypeInfoSection(typeInfoSection);
  11908. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11909. References(referenceSection);
  11910. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11911. ProcedureDescriptorArray(procTableSection, numberProcs);
  11912. IF ProtectModulesPointers THEN
  11913. name := "Heaps.AnyPtr";
  11914. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11915. (* set base pointer *)
  11916. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  11917. END;
  11918. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11919. ArrayBlock(emptyArraySection,temp,"", FALSE);
  11920. moduleSection := ModuleSection();
  11921. Info(moduleSection, "nextRoot*: RootObject");
  11922. Address(moduleSection,0);
  11923. Info(moduleSection, "next*: Module");
  11924. Address(moduleSection,0);
  11925. Info(moduleSection, "name*: Name");
  11926. Name(moduleSection,moduleName);
  11927. Info(moduleSection, "init, published: BOOLEAN");
  11928. Boolean(moduleSection,FALSE);
  11929. Boolean(moduleSection,FALSE);
  11930. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11931. Boolean(moduleSection,FALSE);
  11932. Boolean(moduleSection,FALSE);
  11933. Info(moduleSection, "refcnt*: LONGINT");
  11934. Longint(moduleSection,0);
  11935. Info(moduleSection, "sb*: ADDRESS");
  11936. Address(moduleSection,0);
  11937. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11938. Address(moduleSection,0);
  11939. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11940. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11941. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11942. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11943. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11944. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11945. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11946. Symbol(moduleSection,importSection,importSectionOffset,0);
  11947. Info(moduleSection, "procTable*: ProcTable");
  11948. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11949. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11950. Address(moduleSection,0);
  11951. Address(moduleSection,0);
  11952. Address(moduleSection,0);
  11953. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  11954. Info(moduleSection, "export*: ExportDesc");
  11955. ExportDesc(moduleSection);
  11956. Info(moduleSection, "term*: TerminationHandler");
  11957. Address(moduleSection,0);
  11958. Info(moduleSection, "exTable*: ExceptionTable");
  11959. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  11960. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding -> alignment *)
  11961. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  11962. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  11963. Info(moduleSection, "crc*: LONGINT");
  11964. patchCRC:= moduleSection.pc;
  11965. Longint(moduleSection, 0); (*! must be implemented *)
  11966. Info(moduleSection, "body*: ADDRESS");
  11967. Symbol(moduleSection, bodyProc, 0,0);
  11968. Info(moduleSection, "module flags");
  11969. flags := {};
  11970. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  11971. Set( moduleSection, flags);
  11972. IF implementationVisitor.backend.cooperative THEN
  11973. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  11974. Info(moduleSection, "monitor.owner");
  11975. Address(moduleSection,0);
  11976. Info(moduleSection, "monitor.nestingLevel");
  11977. Address(moduleSection,0);
  11978. Info(moduleSection, "monitor.blockedQueue");
  11979. Address(moduleSection,0); Address(moduleSection,0);
  11980. Info(moduleSection, "monitor.waitingQueue");
  11981. Address(moduleSection,0); Address(moduleSection,0);
  11982. Info(moduleSection, "monitor.waitingSentinel");
  11983. Address(moduleSection,0);
  11984. END;
  11985. END Module;
  11986. PROCEDURE PatchCRC(crc: LONGINT);
  11987. BEGIN
  11988. IF implementationVisitor.newObjectFile & ~simple THEN
  11989. PatchLongint(ModuleSection(), patchCRC, crc);
  11990. END;
  11991. END PatchCRC;
  11992. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  11993. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: SIZE;
  11994. BEGIN
  11995. ArrayBlock(source,pc,"",FALSE);
  11996. Info(source, "pointer offsets array data");
  11997. IF scope IS SyntaxTree.RecordScope THEN
  11998. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  11999. ELSIF scope IS SyntaxTree.CellScope THEN
  12000. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12001. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12002. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12003. WHILE variable # NIL DO
  12004. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12005. symbol := module.allSections.FindBySymbol(variable);
  12006. ASSERT(symbol # NIL);
  12007. Pointers(0,symbol, source,variable.type,numberPointers);
  12008. END;
  12009. variable := variable.nextVariable;
  12010. END;
  12011. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12012. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12013. WHILE parameter # NIL DO
  12014. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12015. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12016. END;
  12017. parameter := parameter.nextParameter;
  12018. END;
  12019. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12020. parametersSize := ProcedureParametersSize(module.system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12021. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12022. IF implementationVisitor.backend.preciseGC THEN
  12023. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12024. END;
  12025. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12026. END;
  12027. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12028. WHILE(variable # NIL) DO
  12029. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12030. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12031. END;
  12032. variable := variable.nextVariable
  12033. END;
  12034. END;
  12035. PatchArray(source,pc,numberPointers);
  12036. END PointerArray;
  12037. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12038. VAR
  12039. name: Basic.SegmentedName;
  12040. section: IntermediateCode.Section;
  12041. BEGIN
  12042. ASSERT(implementationVisitor.newObjectFile);
  12043. Global.GetSymbolSegmentedName(symbol,name);
  12044. Basic.AppendToSegmentedName(name,suffix);
  12045. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12046. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12047. Info(section, "HeapBlock");
  12048. Address(section,0); (* empty such that GC does not go on traversing *)
  12049. Info(section, suffix);
  12050. Address(section,0);
  12051. pc := section.pc;
  12052. RETURN section;
  12053. END SymbolSection;
  12054. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12055. VAR recordType: SyntaxTree.RecordType;
  12056. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12057. section: Sections.Section; cellType: SyntaxTree.CellType;
  12058. tdInfoOffset: LONGINT;
  12059. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12060. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12061. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12062. sectionName: Basic.SectionName;
  12063. CONST MPO=-40000000H;
  12064. BEGIN
  12065. (*
  12066. TypeDesc* = POINTER TO RECORD
  12067. descSize: SIZE;
  12068. sentinel: LONGINT; (* = MPO-4 *)
  12069. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12070. flags*: SET;
  12071. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12072. name*: Name;
  12073. refsOffset: SIZE;
  12074. END;
  12075. *)
  12076. (* source := module.sections.FindByName(...) *)
  12077. Global.GetSymbolSegmentedName(td,name);
  12078. Basic.AppendToSegmentedName(name,".@Info");
  12079. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12080. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12081. Address(source,0);
  12082. Info(source, "TypeDescriptor");
  12083. Address(source,0);
  12084. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12085. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12086. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12087. Info(source, "type tag pointer");
  12088. Symbol( source, tag, offset, 0);
  12089. Info(source, "type flags");
  12090. flags := {};
  12091. IF isProtected THEN INCL(flags,31) END;
  12092. Set( source, flags);
  12093. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  12094. Info(source, "pointer to module");
  12095. moduleSection := ModuleSection();
  12096. Symbol( source, moduleSection, moduleSection.pc,0);
  12097. Info(source, "type name");
  12098. i := 0;
  12099. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12100. (*
  12101. Global.GetSymbolSegmentedName(td,name);
  12102. Basic.SegmentedNameToString(name, sectionName);
  12103. *)
  12104. Name(source,sectionName);
  12105. source.SetReferenced(FALSE);
  12106. Size(source, 0);
  12107. RETURN source;
  12108. END NewTypeDescriptorInfo;
  12109. PROCEDURE NewTypeDescriptor;
  12110. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12111. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12112. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12113. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12114. CONST MPO=-40000000H;
  12115. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12116. VAR i: LONGINT;
  12117. PROCEDURE Td(record: SyntaxTree.RecordType);
  12118. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12119. BEGIN
  12120. IF record # NIL THEN
  12121. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12122. baseTD := record.typeDeclaration;
  12123. Global.GetSymbolSegmentedName(baseTD,name);
  12124. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12125. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12126. ELSE
  12127. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12128. END;
  12129. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12130. Symbol(source, tir, 0, offset);
  12131. IF reverse THEN Td(record.GetBaseRecord()) END;
  12132. END;
  12133. END Td;
  12134. BEGIN
  12135. Info(source, "tag table");
  12136. baseRecord := recordType;
  12137. i := 0;
  12138. WHILE baseRecord # NIL DO
  12139. INC(i);
  12140. baseRecord := baseRecord.GetBaseRecord();
  12141. END;
  12142. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12143. IF ~reverse THEN Td(recordType) END;
  12144. WHILE i < size DO
  12145. Address(source,0);
  12146. INC(i);
  12147. END;
  12148. IF reverse THEN Td(recordType) END;
  12149. END TdTable;
  12150. PROCEDURE MethodTable(reverse: BOOLEAN);
  12151. VAR i,methods: LONGINT;
  12152. BEGIN
  12153. Info(source, "method table");
  12154. IF recordType # NIL THEN
  12155. methods := recordType.recordScope.numberMethods;
  12156. IF reverse THEN
  12157. FOR i := methods-1 TO 0 BY -1 DO
  12158. procedure := recordType.recordScope.FindMethod(i);
  12159. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12160. NamedSymbol(source, name,procedure, 0,0);
  12161. END;
  12162. ELSE
  12163. FOR i := 0 TO methods-1 DO
  12164. procedure := recordType.recordScope.FindMethod(i);
  12165. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12166. NamedSymbol(source, name,procedure, 0,0);
  12167. END;
  12168. END;
  12169. END;
  12170. END MethodTable;
  12171. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12172. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12173. BEGIN
  12174. Info(source, "method table");
  12175. baseRecord := recordType;
  12176. WHILE baseRecord.baseType # NIL DO
  12177. baseRecord := baseRecord.GetBaseRecord ();
  12178. END;
  12179. GetRecordTypeName (baseRecord, name);
  12180. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12181. IF name = stackFrame THEN
  12182. start := 0;
  12183. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12184. baseRecord := recordType;
  12185. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12186. baseRecord := baseRecord.GetBaseRecord ();
  12187. END;
  12188. IF baseRecord # NIL THEN
  12189. GetRecordTypeName (baseRecord, name);
  12190. IF pointer & ~baseRecord.isObject THEN
  12191. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12192. END;
  12193. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12194. ELSIF recordType.isObject THEN
  12195. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12196. ELSIF pointer THEN
  12197. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12198. ELSE
  12199. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12200. END;
  12201. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12202. Symbol(source, tir, 0, 0);
  12203. start := 0;
  12204. baseRecord := recordType;
  12205. WHILE (baseRecord # NIL) DO
  12206. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12207. baseRecord := baseRecord.GetBaseRecord ();
  12208. END;
  12209. ELSE
  12210. (* explicit trace method: *)
  12211. procedure := recordType.recordScope.FindMethod(0);
  12212. IF ~procedure.isFinalizer THEN
  12213. Global.GetSymbolSegmentedName(procedure, name);
  12214. NamedSymbol(source, name,procedure, 0,0);
  12215. END;
  12216. start := 1;
  12217. END;
  12218. IF (name # stackFrame) & recordType.isObject THEN
  12219. baseRecord := recordType;
  12220. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12221. baseRecord := baseRecord.GetBaseRecord ();
  12222. END;
  12223. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12224. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12225. ELSE
  12226. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12227. END;
  12228. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12229. Symbol(source, tir, 0, 0);
  12230. END;
  12231. methods := recordType.recordScope.numberMethods;
  12232. FOR i := start TO methods-1 DO
  12233. procedure := recordType.recordScope.FindMethod(i);
  12234. IF ~procedure.isFinalizer THEN
  12235. Global.GetSymbolSegmentedName(procedure, name);
  12236. NamedSymbol(source, name,procedure, 0,0);
  12237. END;
  12238. END;
  12239. END CooperativeMethodTable;
  12240. BEGIN
  12241. Global.GetSymbolSegmentedName(td,name);
  12242. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12243. source.SetExported(IsExported(td));
  12244. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12245. IF implementationVisitor.backend.cooperative THEN
  12246. base := NIL;
  12247. baseRecord := recordType.GetBaseRecord();
  12248. IF baseRecord # NIL THEN
  12249. baseTD := baseRecord.typeDeclaration;
  12250. END;
  12251. IF ~recordType.isObject THEN
  12252. Info(source, "parent");
  12253. IF baseRecord # NIL THEN
  12254. Global.GetSymbolSegmentedName(baseTD,name);
  12255. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12256. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12257. ELSE
  12258. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12259. END;
  12260. Symbol(source, tir, 0, 0);
  12261. ELSE
  12262. Address(source,0);
  12263. END;
  12264. Info(source, "record size");
  12265. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12266. source.SetReferenced(FALSE);
  12267. CooperativeMethodTable(FALSE);
  12268. base := source;
  12269. Global.GetSymbolSegmentedName(td,name);
  12270. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12271. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12272. source.SetExported(IsExported(td));
  12273. source.SetReferenced(FALSE);
  12274. END;
  12275. Info(source, "parent");
  12276. IF baseRecord # NIL THEN
  12277. Global.GetSymbolSegmentedName(baseTD,name);
  12278. sym := baseTD;
  12279. IF ~recordType.isObject THEN
  12280. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12281. sym := NIL;
  12282. END;
  12283. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12284. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12285. ELSE
  12286. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12287. END;
  12288. Symbol(source, tir, 0, 0);
  12289. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12290. Address(source,0);
  12291. ELSE
  12292. IF recordType.isObject THEN
  12293. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12294. ELSE
  12295. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12296. END;
  12297. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12298. Symbol(source, tir, 0, 0);
  12299. END;
  12300. Info(source, "base record descriptor");
  12301. Symbol(source, base, 0, 0);
  12302. CooperativeMethodTable(TRUE);
  12303. source.SetReferenced(FALSE);
  12304. IF recordType.hasPointers THEN
  12305. IF ~HasExplicitTraceMethod (recordType) THEN
  12306. implementationVisitor.CreateTraceMethod(recordType);
  12307. END;
  12308. implementationVisitor.CreateResetProcedure(recordType);
  12309. implementationVisitor.CreateAssignProcedure(recordType);
  12310. END;
  12311. ELSIF ~simple THEN
  12312. (*
  12313. MethodEnd = MPO
  12314. ---
  12315. methods (# methods)
  12316. ---
  12317. tags (16)
  12318. ---
  12319. TypeDesc = TypeInfoAdr
  12320. ---
  12321. td adr ---> rec size
  12322. ----
  12323. pointer offsets
  12324. ----
  12325. (padding)
  12326. -----
  12327. empty [2 addresses aligned]
  12328. empty
  12329. empty
  12330. numPtrs
  12331. ---
  12332. pointer offsets
  12333. ---
  12334. *)
  12335. Info(source, "MethodEnd = MPO");
  12336. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12337. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12338. MethodTable(TRUE);
  12339. TdTable(TypeTags, TRUE);
  12340. Info(source, "type descriptor info pointer");
  12341. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12342. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12343. IF (cellType # NIL) THEN
  12344. IF cellType.sizeInBits < 0 THEN
  12345. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12346. END;
  12347. Info(source, "cell size");
  12348. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12349. ELSE
  12350. Info(source, "record size");
  12351. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12352. END;
  12353. Info(source, "pointer offsets pointer");
  12354. padding := 1- source.pc MOD 2;
  12355. Symbol(source, source, source.pc+1+padding,0);
  12356. IF padding >0 THEN
  12357. Info(source, "padding");
  12358. FOR i := 1 TO padding DO Address(source,0) END;
  12359. END;
  12360. IF cellType # NIL THEN
  12361. PointerArray(source, cellType.cellScope, numberPointers);
  12362. ELSE
  12363. PointerArray(source, recordType.recordScope, numberPointers);
  12364. END;
  12365. ELSE
  12366. (*
  12367. simple:
  12368. td adr --> size
  12369. tag(1)
  12370. tag(2)
  12371. tag(3)
  12372. methods ->
  12373. *)
  12374. Info(source, "record size");
  12375. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12376. TdTable(TypeTags, FALSE);
  12377. MethodTable(FALSE);
  12378. source.SetReferenced(FALSE);
  12379. END;
  12380. END NewTypeDescriptor;
  12381. BEGIN
  12382. x := x.resolved;
  12383. IF (x IS SyntaxTree.PointerType) THEN
  12384. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12385. END;
  12386. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12387. recordType := x(SyntaxTree.RecordType);
  12388. td := x.typeDeclaration;
  12389. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12390. ASSERT(td # NIL);
  12391. section := module.allSections.FindBySymbol(td); (* TODO *)
  12392. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12393. IF implementationVisitor.newObjectFile THEN
  12394. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12395. NewTypeDescriptor
  12396. END;
  12397. ELSE
  12398. (* data section in intermediate code *)
  12399. Global.GetSymbolSegmentedName(td,name);
  12400. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  12401. Basic.SuffixSegmentedName (name, module.module.name);
  12402. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  12403. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  12404. tir.Emit(Data(Basic.invalidPosition,op));
  12405. END;
  12406. END;
  12407. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12408. cellType := x(SyntaxTree.CellType);
  12409. td := x.typeDeclaration;
  12410. section := module.allSections.FindBySymbol(td); (* TODO *)
  12411. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12412. IF implementationVisitor.newObjectFile THEN
  12413. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12414. NewTypeDescriptor
  12415. END;
  12416. END;
  12417. END;
  12418. END
  12419. END CheckTypeDeclaration
  12420. END MetaDataGenerator;
  12421. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12422. VAR
  12423. trace-: BOOLEAN;
  12424. traceString-: SyntaxTree.IdentifierString;
  12425. traceModuleName-: SyntaxTree.IdentifierString;
  12426. newObjectFile-: BOOLEAN;
  12427. profile-: BOOLEAN;
  12428. noRuntimeChecks: BOOLEAN;
  12429. simpleMetaData-: BOOLEAN;
  12430. noAsserts: BOOLEAN;
  12431. optimize-: BOOLEAN;
  12432. cooperative-: BOOLEAN;
  12433. preregisterStatic-: BOOLEAN;
  12434. dump-: Basic.Writer;
  12435. cellsAreObjects: BOOLEAN;
  12436. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12437. experiment: BOOLEAN;
  12438. PROCEDURE &InitIntermediateBackend*;
  12439. BEGIN
  12440. simpleMetaData := FALSE;
  12441. newObjectFile := FALSE;
  12442. InitBackend;
  12443. SetRuntimeModuleName(DefaultRuntimeModuleName);
  12444. SetTraceModuleName(DefaultTraceModuleName);
  12445. END InitIntermediateBackend;
  12446. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12447. VAR
  12448. declarationVisitor: DeclarationVisitor;
  12449. implementationVisitor: ImplementationVisitor;
  12450. module: Sections.Module;
  12451. name, platformName: SyntaxTree.IdentifierString;
  12452. meta: MetaDataGenerator;
  12453. crc: CRC.CRC32Stream;
  12454. BEGIN
  12455. ResetError;
  12456. Global.GetSymbolName(x,name);
  12457. NEW(module,x,system); (* backend structures *)
  12458. Global.GetModuleName(x, name);
  12459. module.SetModuleName(name);
  12460. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  12461. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12462. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12463. declarationVisitor.Module(x,module);
  12464. IF newObjectFile & ~meta.simple THEN
  12465. meta.Module(implementationVisitor.moduleBodySection);
  12466. END;
  12467. GetDescription(platformName);
  12468. module.SetPlatformName(platformName);
  12469. IF newObjectFile THEN
  12470. NEW(crc);
  12471. module.allSections.WriteRaw(crc);
  12472. crc.Update;
  12473. meta.PatchCRC(crc.GetCRC());
  12474. END;
  12475. RETURN module
  12476. END GenerateIntermediate;
  12477. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12478. BEGIN RETURN TRUE
  12479. END SupportedImmediate;
  12480. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12481. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12482. END ProcessSyntaxTreeModule;
  12483. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12484. VAR
  12485. result: Sections.Module;
  12486. traceName: Basic.MessageString;
  12487. BEGIN
  12488. ASSERT(intermediateCodeModule IS Sections.Module);
  12489. result := intermediateCodeModule(Sections.Module);
  12490. IF trace THEN
  12491. traceName := "intermediate code trace: ";
  12492. Strings.Append(traceName,traceString);
  12493. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12494. IF (traceString="") OR (traceString="*") THEN
  12495. result.Dump(dump);
  12496. dump.Update
  12497. ELSE
  12498. Sections.DumpFiltered(dump, result, traceString);
  12499. END
  12500. END;
  12501. RETURN result
  12502. END ProcessIntermediateCodeModule;
  12503. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12504. BEGIN instructionSet := "Intermediate";
  12505. END GetDescription;
  12506. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  12507. BEGIN
  12508. SELF.newObjectFile := newObjectFile;
  12509. SELF.simpleMetaData := simpleMetaData;
  12510. END SetNewObjectFile;
  12511. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12512. BEGIN COPY(name, traceModuleName)
  12513. END SetTraceModuleName;
  12514. PROCEDURE DefineOptions(options: Options.Options);
  12515. BEGIN
  12516. DefineOptions^(options);
  12517. options.Add(0X,"trace",Options.String);
  12518. options.Add(0X,"runtime",Options.String);
  12519. options.Add(0X,"newObjectFile",Options.Flag);
  12520. options.Add(0X,"traceModule",Options.String);
  12521. options.Add(0X,"profile",Options.Flag);
  12522. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12523. options.Add(0X,"noAsserts",Options.Flag);
  12524. options.Add(0X,"metaData",Options.String);
  12525. options.Add('o',"optimize", Options.Flag);
  12526. options.Add(0X,"preregisterStatic", Options.Flag);
  12527. options.Add(0X,"cellsAreObjects", Options.Flag);
  12528. options.Add(0X,"preciseGC", Options.Flag);
  12529. options.Add(0X,"trackLeave", Options.Flag);
  12530. options.Add(0X,"writeBarriers", Options.Flag);
  12531. options.Add(0X,"experiment", Options.Flag);
  12532. END DefineOptions;
  12533. PROCEDURE GetOptions(options: Options.Options);
  12534. VAR name,string: SyntaxTree.IdentifierString;
  12535. BEGIN
  12536. GetOptions^(options);
  12537. trace := options.GetString("trace",traceString);
  12538. profile := options.GetFlag("profile");
  12539. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12540. noAsserts := options.GetFlag("noAsserts");
  12541. cooperative := options.GetFlag("cooperative");
  12542. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  12543. IF cooperative THEN
  12544. SetRuntimeModuleName("CPU") END
  12545. END;
  12546. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12547. simpleMetaData := TRUE
  12548. END;
  12549. IF options.GetString("metaData",string) THEN
  12550. IF string = "simple" THEN simpleMetaData := TRUE
  12551. ELSIF string ="full" THEN simpleMetaData := FALSE
  12552. END;
  12553. END;
  12554. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  12555. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12556. optimize := options.GetFlag("optimize");
  12557. preregisterStatic := options.GetFlag("preregisterStatic");
  12558. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12559. preciseGC := options.GetFlag("preciseGC");
  12560. trackLeave := options.GetFlag("trackLeave");
  12561. writeBarriers := options.GetFlag("writeBarriers");
  12562. experiment := options.GetFlag("experiment");
  12563. END GetOptions;
  12564. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  12565. BEGIN RETURN SymbolFileFormat.Get()
  12566. END DefaultSymbolFileFormat;
  12567. END IntermediateBackend;
  12568. (* ----------------------------------- register allocation ------------------------------------- *)
  12569. (* register mapping scheme
  12570. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12571. spill offset
  12572. part(n) --> ticket <--> physical register
  12573. spill offset
  12574. *)
  12575. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12576. emptyOperand: IntermediateCode.Operand;
  12577. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12578. statCoopResetVariables: LONGINT;
  12579. statCoopModifyAssignments: LONGINT;
  12580. modifyAssignmentsPC : LONGINT;
  12581. statCoopNilCheck: LONGINT;
  12582. statCoopSwitch: LONGINT;
  12583. statCoopAssignProcedure: LONGINT;
  12584. statCoopTraceMethod: LONGINT;
  12585. statCoopResetProcedure: LONGINT;
  12586. statCoopTraceModule: LONGINT;
  12587. PROCEDURE ResetStatistics*;
  12588. BEGIN
  12589. statCoopResetVariables := 0;
  12590. statCoopModifyAssignments := 0;
  12591. statCoopNilCheck:= 0;
  12592. statCoopSwitch:= 0;
  12593. statCoopAssignProcedure:= 0;
  12594. statCoopTraceMethod:= 0;
  12595. statCoopResetProcedure:= 0;
  12596. statCoopTraceModule:= 0;
  12597. END ResetStatistics;
  12598. PROCEDURE Statistics*;
  12599. BEGIN
  12600. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12601. TRACE(statCoopNilCheck, statCoopSwitch);
  12602. TRACE(statCoopAssignProcedure,
  12603. statCoopTraceMethod,
  12604. statCoopResetProcedure,
  12605. statCoopTraceModule)
  12606. END Statistics;
  12607. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12608. VAR h: LONGINT;
  12609. BEGIN
  12610. WHILE b # 0 DO
  12611. h := a MOD b;
  12612. a := b;
  12613. b := h;
  12614. END;
  12615. RETURN a
  12616. END GCD;
  12617. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12618. BEGIN
  12619. RETURN a*b DIV GCD(a,b)
  12620. END SCM;
  12621. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12622. BEGIN
  12623. (*TRACE(a,b);*)
  12624. IF a = 0 THEN RETURN b
  12625. ELSIF b = 0 THEN RETURN a
  12626. ELSE RETURN SCM(a,b)
  12627. END;
  12628. END CommonAlignment;
  12629. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  12630. BEGIN
  12631. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12632. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12633. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12634. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12635. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12636. END
  12637. END PassBySingleReference;
  12638. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  12639. BEGIN
  12640. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  12641. END PassInRegister;
  12642. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12643. VAR new: RegisterEntry;
  12644. BEGIN
  12645. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12646. IF queue = NIL THEN
  12647. queue := new
  12648. ELSE
  12649. new.next := queue;
  12650. IF queue#NIL THEN queue.prev := new END;
  12651. queue := new
  12652. END;
  12653. END AddRegisterEntry;
  12654. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12655. VAR this: RegisterEntry;
  12656. BEGIN
  12657. this := queue;
  12658. WHILE (this # NIL) & (this.register # register) DO
  12659. this := this.next;
  12660. END;
  12661. IF this = NIL THEN
  12662. RETURN FALSE
  12663. END;
  12664. ASSERT(this # NIL);
  12665. IF this = queue THEN queue := queue.next END;
  12666. IF this.prev # NIL THEN this.prev.next := this.next END;
  12667. IF this.next # NIL THEN this.next.prev := this.prev END;
  12668. RETURN TRUE
  12669. END RemoveRegisterEntry;
  12670. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12671. BEGIN ASSERT(cond);
  12672. END Assert;
  12673. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12674. BEGIN
  12675. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12676. END ReusableRegister;
  12677. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12678. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12679. BEGIN
  12680. procedure := moduleScope.bodyProcedure;
  12681. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12682. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12683. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12684. procedure.SetScope(moduleScope);
  12685. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12686. procedure.SetAccess(SyntaxTree.Hidden);
  12687. moduleScope.SetBodyProcedure(procedure);
  12688. moduleScope.AddProcedure(procedure);
  12689. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12690. END;
  12691. END EnsureBodyProcedure;
  12692. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12693. VAR import: SyntaxTree.Import;
  12694. selfName: SyntaxTree.IdentifierString;
  12695. module: SyntaxTree.Module;
  12696. BEGIN
  12697. scope.ownerModule.GetName(selfName);
  12698. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12699. module := scope.ownerModule
  12700. ELSE
  12701. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12702. IF import = NIL THEN
  12703. RETURN NIL
  12704. ELSIF import.module = NIL THEN
  12705. RETURN NIL
  12706. ELSE module := import.module
  12707. END;
  12708. END;
  12709. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12710. END GetSymbol;
  12711. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12712. BEGIN
  12713. op.mode := mode;
  12714. IntermediateCode.InitOperand(op.op);
  12715. IntermediateCode.InitOperand(op.tag);
  12716. IntermediateCode.InitOperand(op.extra);
  12717. op.dimOffset := 0;
  12718. END InitOperand;
  12719. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12720. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12721. BEGIN RETURN IntermediateCode.GetType(system, type)
  12722. END GetType;
  12723. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12724. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12725. BEGIN
  12726. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12727. (*
  12728. UniqueId(name,module,name,adr);
  12729. *)
  12730. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12731. constant.SetValue(value);
  12732. constant.SetAccess(SyntaxTree.Hidden);
  12733. module.moduleScope.AddConstant(constant);
  12734. constant.SetScope(module.moduleScope);
  12735. RETURN constant
  12736. END BuildConstant;
  12737. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12738. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12739. BEGIN
  12740. variable := scope.firstVariable;
  12741. WHILE variable # NIL DO
  12742. IF variable.NeedsTrace() THEN
  12743. RETURN TRUE;
  12744. END;
  12745. variable := variable.nextVariable;
  12746. END;
  12747. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12748. WHILE parameter # NIL DO
  12749. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12750. RETURN TRUE;
  12751. END;
  12752. parameter := parameter.nextParameter;
  12753. END;
  12754. RETURN FALSE;
  12755. END HasPointers;
  12756. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12757. 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));
  12758. END IsVariableParameter;
  12759. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12760. VAR parameter: SyntaxTree.Parameter;
  12761. BEGIN
  12762. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12763. WHILE parameter # NIL DO
  12764. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12765. IF parameter.movable THEN RETURN TRUE END;
  12766. parameter := parameter.nextParameter;
  12767. END;
  12768. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12769. END HasVariableParameters;
  12770. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12771. BEGIN
  12772. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12773. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12774. END HasExplicitTraceMethod;
  12775. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12776. BEGIN
  12777. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12778. IF (expression IS SyntaxTree.IntegerValue) THEN
  12779. val := expression(SyntaxTree.IntegerValue).value;
  12780. RETURN TRUE
  12781. ELSE
  12782. RETURN FALSE
  12783. END;
  12784. END IsIntegerConstant;
  12785. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12786. BEGIN
  12787. IF val <= 0 THEN RETURN FALSE END;
  12788. exp := 0;
  12789. WHILE ~ODD(val) DO
  12790. val := val DIV 2;
  12791. INC(exp)
  12792. END;
  12793. RETURN val = 1
  12794. END PowerOf2;
  12795. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12796. VAR procedure: SyntaxTree.Procedure;
  12797. BEGIN
  12798. procedure := record.recordScope.constructor;
  12799. IF procedure = NIL THEN
  12800. record := record.GetBaseRecord();
  12801. IF record # NIL THEN
  12802. procedure := GetConstructor(record)
  12803. END;
  12804. END;
  12805. RETURN procedure;
  12806. END GetConstructor;
  12807. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12808. BEGIN
  12809. value := SHORT(op.intValue);
  12810. RETURN op.mode = IntermediateCode.ModeImmediate;
  12811. END IsIntegerImmediate;
  12812. (** whether a type strictily is a pointer to record or object type
  12813. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12814. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12815. BEGIN
  12816. IF type = NIL THEN
  12817. RETURN FALSE
  12818. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12819. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12820. ELSE
  12821. RETURN FALSE
  12822. END
  12823. END IsStrictlyPointerToRecord;
  12824. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12825. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12826. END IsUnsafePointer;
  12827. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12828. BEGIN type := type.resolved;
  12829. IF type IS SyntaxTree.PointerType THEN
  12830. type := type(SyntaxTree.PointerType).pointerBase;
  12831. type := type.resolved;
  12832. IF type IS SyntaxTree.RecordType THEN
  12833. recordType := type(SyntaxTree.RecordType);
  12834. RETURN TRUE
  12835. ELSE
  12836. RETURN FALSE
  12837. END
  12838. ELSIF type IS SyntaxTree.RecordType THEN
  12839. recordType := type(SyntaxTree.RecordType);
  12840. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12841. ELSIF type IS SyntaxTree.ObjectType THEN
  12842. RETURN TRUE
  12843. ELSIF type IS SyntaxTree.AnyType THEN
  12844. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12845. ELSE
  12846. RETURN FALSE
  12847. END;
  12848. END IsPointerToRecord;
  12849. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12850. BEGIN
  12851. type := type.resolved;
  12852. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12853. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12854. END IsArrayOfSystemByte;
  12855. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12856. BEGIN
  12857. IF type = NIL THEN RETURN FALSE END;
  12858. type := type.resolved;
  12859. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12860. END IsOpenArray;
  12861. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12862. BEGIN
  12863. IF type = NIL THEN RETURN FALSE END;
  12864. type := type.resolved;
  12865. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12866. END IsSemiDynamicArray;
  12867. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12868. BEGIN
  12869. IF type = NIL THEN RETURN FALSE END;
  12870. type := type.resolved;
  12871. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12872. END IsStaticArray;
  12873. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  12874. BEGIN
  12875. IF type = NIL THEN RETURN FALSE END;
  12876. type := type.resolved;
  12877. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  12878. END IsStaticMathArray;
  12879. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12880. BEGIN
  12881. WHILE (IsStaticMathArray(type)) DO
  12882. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12883. END;
  12884. RETURN type;
  12885. END StaticMathArrayBaseType;
  12886. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12887. VAR size: LONGINT;
  12888. BEGIN
  12889. size := 1;
  12890. WHILE (IsStaticArray(type)) DO
  12891. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12892. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12893. END;
  12894. RETURN size;
  12895. END StaticArrayNumElements;
  12896. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12897. VAR size: LONGINT;
  12898. BEGIN
  12899. size := 1;
  12900. WHILE (IsStaticMathArray(type)) DO
  12901. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  12902. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12903. END;
  12904. RETURN size;
  12905. END StaticMathArrayNumElements;
  12906. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12907. BEGIN
  12908. WHILE (IsStaticArray(type)) DO
  12909. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12910. END;
  12911. RETURN type;
  12912. END StaticArrayBaseType;
  12913. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12914. BEGIN
  12915. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12916. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12917. END;
  12918. RETURN type;
  12919. END ArrayBaseType;
  12920. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12921. BEGIN
  12922. IF type = NIL THEN RETURN FALSE END;
  12923. type := type.resolved;
  12924. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12925. END IsDelegate;
  12926. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12927. VAR i: LONGINT;
  12928. BEGIN
  12929. i := 0; type := type.resolved;
  12930. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12931. INC(i);
  12932. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12933. END;
  12934. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12935. INC(i);
  12936. type := type(SyntaxTree.MathArrayType).arrayBase;
  12937. IF type # NIL THEN type := type.resolved END;
  12938. END;
  12939. RETURN i
  12940. END DynamicDim;
  12941. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12942. BEGIN
  12943. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12944. type := type(SyntaxTree.ArrayType).arrayBase;
  12945. END;
  12946. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12947. type := type(SyntaxTree.MathArrayType).arrayBase;
  12948. END;
  12949. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12950. END StaticSize;
  12951. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12952. BEGIN
  12953. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12954. END IsImmediate;
  12955. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12956. BEGIN
  12957. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12958. END IsAddress;
  12959. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12960. BEGIN
  12961. RETURN (x.mode = IntermediateCode.ModeRegister);
  12962. END IsRegister;
  12963. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12964. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12965. BEGIN
  12966. typeDeclaration := recordType.typeDeclaration;
  12967. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12968. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12969. END GetRecordTypeName;
  12970. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12971. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12972. BEGIN
  12973. parSize := 0;
  12974. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  12975. parameter := procedureType.returnParameter;
  12976. INC(parSize,system.SizeOfParameter(parameter));
  12977. parSize := parSize + (-parSize) MOD system.addressSize;
  12978. END;
  12979. parameter :=procedureType.lastParameter;
  12980. WHILE (parameter # NIL) DO
  12981. IF SysvABIorWINAPI(procedureType.callingConvention) THEN
  12982. INC(parSize, system.addressSize);
  12983. ELSE
  12984. INC(parSize,system.SizeOfParameter(parameter));
  12985. parSize := parSize + (-parSize) MOD system.addressSize;
  12986. END;
  12987. parameter := parameter.prevParameter;
  12988. END;
  12989. IF procedureType.selfParameter # NIL THEN
  12990. parameter := procedureType.selfParameter;
  12991. INC(parSize,system.SizeOfParameter(parameter));
  12992. parSize := parSize + (-parSize) MOD system.addressSize;
  12993. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  12994. END; (* method => self pointer *)
  12995. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12996. RETURN ToMemoryUnits(system,parSize)
  12997. END ParametersSize;
  12998. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12999. BEGIN
  13000. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13001. END IsNested;
  13002. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13003. BEGIN
  13004. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13005. scope := scope.outerScope;
  13006. END;
  13007. RETURN scope # NIL;
  13008. END InCellScope;
  13009. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13010. BEGIN
  13011. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  13012. RETURN 0
  13013. ELSE
  13014. *)
  13015. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  13016. (*END;*)
  13017. END ProcedureParametersSize;
  13018. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  13019. VAR dataUnit: LONGINT;
  13020. BEGIN dataUnit := system.dataUnit;
  13021. ASSERT(size MOD system.dataUnit = 0);
  13022. RETURN size DIV system.dataUnit
  13023. END ToMemoryUnits;
  13024. PROCEDURE Get*(): Backend.Backend;
  13025. VAR backend: IntermediateBackend;
  13026. BEGIN NEW(backend); RETURN backend
  13027. END Get;
  13028. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13029. VAR instruction: IntermediateCode.Instruction;
  13030. BEGIN
  13031. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13032. RETURN instruction
  13033. END Nop;
  13034. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13035. VAR instruction: IntermediateCode.Instruction;
  13036. BEGIN
  13037. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13038. RETURN instruction
  13039. END Mov;
  13040. (* like Mov but ensures that no new register will be allocated for dest *)
  13041. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13042. VAR instruction: IntermediateCode.Instruction;
  13043. BEGIN
  13044. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13045. RETURN instruction
  13046. END MovReplace;
  13047. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13048. VAR instruction: IntermediateCode.Instruction;
  13049. BEGIN
  13050. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13051. RETURN instruction
  13052. END Conv;
  13053. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  13054. BEGIN
  13055. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  13056. END SysvABI;
  13057. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  13058. BEGIN
  13059. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  13060. END SysvABIorWINAPI;
  13061. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13062. VAR instruction: IntermediateCode.Instruction;
  13063. BEGIN
  13064. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13065. RETURN instruction
  13066. END Call;
  13067. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13068. VAR op1, op2, op3: IntermediateCode.Operand;
  13069. VAR instruction: IntermediateCode.Instruction;
  13070. BEGIN
  13071. IntermediateCode.InitNumber(op1,pcOffset);
  13072. IntermediateCode.InitNumber(op2,callingConvention);
  13073. IntermediateCode.InitNumber(op3,unwind);
  13074. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13075. RETURN instruction
  13076. END Exit;
  13077. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13078. VAR instruction: IntermediateCode.Instruction;
  13079. BEGIN
  13080. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13081. RETURN instruction
  13082. END Return;
  13083. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13084. VAR instruction: IntermediateCode.Instruction;
  13085. BEGIN
  13086. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13087. RETURN instruction
  13088. END Result;
  13089. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13090. VAR op1: IntermediateCode.Operand;
  13091. VAR instruction: IntermediateCode.Instruction;
  13092. BEGIN
  13093. IntermediateCode.InitNumber(op1,nr);
  13094. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13095. RETURN instruction
  13096. END Trap;
  13097. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13098. VAR instruction: IntermediateCode.Instruction;
  13099. BEGIN
  13100. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13101. RETURN instruction
  13102. END Br;
  13103. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13104. VAR instruction: IntermediateCode.Instruction;
  13105. BEGIN
  13106. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13107. RETURN instruction
  13108. END Breq;
  13109. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13110. VAR instruction: IntermediateCode.Instruction;
  13111. BEGIN
  13112. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13113. RETURN instruction
  13114. END Brne;
  13115. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13116. VAR instruction: IntermediateCode.Instruction;
  13117. BEGIN
  13118. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13119. RETURN instruction
  13120. END Brge;
  13121. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13122. VAR instruction: IntermediateCode.Instruction;
  13123. BEGIN
  13124. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13125. RETURN instruction
  13126. END Brlt;
  13127. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13128. VAR instruction: IntermediateCode.Instruction;
  13129. BEGIN
  13130. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13131. RETURN instruction
  13132. END Pop;
  13133. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13134. VAR instruction: IntermediateCode.Instruction;
  13135. BEGIN
  13136. ASSERT(op.mode # IntermediateCode.Undefined);
  13137. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13138. RETURN instruction
  13139. END Push;
  13140. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13141. VAR instruction: IntermediateCode.Instruction;
  13142. BEGIN
  13143. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13144. RETURN instruction
  13145. END Neg;
  13146. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13147. VAR instruction: IntermediateCode.Instruction;
  13148. BEGIN
  13149. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13150. RETURN instruction
  13151. END Not;
  13152. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13153. VAR instruction: IntermediateCode.Instruction;
  13154. BEGIN
  13155. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13156. RETURN instruction
  13157. END Abs;
  13158. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13159. VAR instruction: IntermediateCode.Instruction;
  13160. BEGIN
  13161. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13162. ASSERT(~IsImmediate(instruction.op1));
  13163. RETURN instruction
  13164. END Mul;
  13165. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13166. VAR instruction: IntermediateCode.Instruction;
  13167. BEGIN
  13168. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13169. RETURN instruction
  13170. END Div;
  13171. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13172. VAR instruction: IntermediateCode.Instruction;
  13173. BEGIN
  13174. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13175. RETURN instruction
  13176. END Mod;
  13177. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13178. VAR instruction: IntermediateCode.Instruction;
  13179. BEGIN
  13180. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13181. RETURN instruction
  13182. END Sub;
  13183. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13184. VAR instruction: IntermediateCode.Instruction;
  13185. BEGIN
  13186. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13187. RETURN instruction
  13188. END Add;
  13189. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13190. VAR instruction: IntermediateCode.Instruction;
  13191. BEGIN
  13192. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13193. RETURN instruction
  13194. END And;
  13195. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13196. VAR instruction: IntermediateCode.Instruction;
  13197. BEGIN
  13198. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13199. RETURN instruction
  13200. END Or;
  13201. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13202. VAR instruction: IntermediateCode.Instruction;
  13203. BEGIN
  13204. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13205. RETURN instruction
  13206. END Xor;
  13207. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13208. VAR instruction: IntermediateCode.Instruction;
  13209. BEGIN
  13210. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13211. RETURN instruction
  13212. END Shl;
  13213. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13214. VAR instruction: IntermediateCode.Instruction;
  13215. BEGIN
  13216. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13217. RETURN instruction
  13218. END Shr;
  13219. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13220. VAR instruction: IntermediateCode.Instruction;
  13221. BEGIN
  13222. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13223. RETURN instruction
  13224. END Rol;
  13225. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13226. VAR instruction: IntermediateCode.Instruction;
  13227. BEGIN
  13228. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13229. RETURN instruction
  13230. END Ror;
  13231. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13232. VAR instruction: IntermediateCode.Instruction;
  13233. BEGIN
  13234. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13235. RETURN instruction
  13236. END Cas;
  13237. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13238. VAR instruction: IntermediateCode.Instruction;
  13239. BEGIN
  13240. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13241. RETURN instruction
  13242. END Copy;
  13243. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13244. VAR instruction: IntermediateCode.Instruction;
  13245. BEGIN
  13246. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13247. RETURN instruction
  13248. END Fill;
  13249. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13250. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13251. BEGIN
  13252. string := IntermediateCode.String(s);
  13253. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13254. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13255. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13256. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13257. RETURN instruction
  13258. END Asm;
  13259. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13260. VAR instruction: IntermediateCode.Instruction;
  13261. BEGIN
  13262. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13263. RETURN instruction
  13264. END Data;
  13265. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13266. VAR instruction: IntermediateCode.Instruction;
  13267. BEGIN
  13268. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13269. IntermediateCode.SetSubType(instruction, subtype);
  13270. RETURN instruction
  13271. END SpecialInstruction;
  13272. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13273. VAR op1: IntermediateCode.Operand;
  13274. VAR instruction: IntermediateCode.Instruction;
  13275. BEGIN
  13276. (*! generate a warning if size exceeds a certain limit *)
  13277. (*
  13278. ASSERT(bytes < 1000000); (* sanity check *)
  13279. *)
  13280. ASSERT(0 <= units); (* sanity check *)
  13281. IntermediateCode.InitNumber(op1,units);
  13282. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13283. RETURN instruction
  13284. END Reserve;
  13285. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13286. VAR op1: IntermediateCode.Operand;
  13287. VAR instruction: IntermediateCode.Instruction;
  13288. BEGIN
  13289. IntermediateCode.InitNumber(op1,position.start);
  13290. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13291. RETURN instruction
  13292. END LabelInstruction;
  13293. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13294. VAR pc: LONGINT;
  13295. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13296. BEGIN
  13297. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13298. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13299. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13300. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13301. IF instr.op1.type.form = IntermediateCode.Float THEN
  13302. RETURN instr.op1.floatValue = op.floatValue
  13303. ELSE
  13304. RETURN instr.op1.intValue = op.intValue
  13305. END;
  13306. END ProvidesValue;
  13307. BEGIN
  13308. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13309. pc := 0;
  13310. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13311. INC(pc);
  13312. END;
  13313. IF pc = data.pc THEN
  13314. data.Emit(Data(Basic.invalidPosition,vop));
  13315. END;
  13316. RETURN pc
  13317. END EnterImmediate;
  13318. PROCEDURE Init;
  13319. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13320. BEGIN
  13321. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13322. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13323. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13324. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13325. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13326. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13327. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13328. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13329. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13330. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13331. IntermediateCode.InitOperand(emptyOperand);
  13332. FOR i := 0 TO NumberSystemCalls-1 DO
  13333. name := "@SystemCall";
  13334. Basic.AppendNumber(name,i);
  13335. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13336. END;
  13337. END Init;
  13338. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13339. BEGIN
  13340. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  13341. END IsExported;
  13342. BEGIN
  13343. Init;
  13344. END FoxIntermediateBackend.
  13345. Compiler.Compile -p=Win32G FoxIntermediateBackend.Mod ~
  13346. # Release.Build --path="/temp/obg/" IinAosNewObjectFile ~
  13347. # StaticLinker.Link --fileFormat=PE32 --fileName=A2Z.exe --extension=GofW --displacement=401000H --path="/temp/obg/" Runtime Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection GenericLoader BootConsole ~
  13348. # Release.Build --path="/temp/obg/" WinAosNewObjectFile ~
  13349. # StaticLinker.Link --fileFormat=PE32 --fileName=A2H.exe --extension=GofW --displacement=401000H Runtime Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection GenericLoader BootConsole ~
  13350. FSTools.CloseFiles A2Z.exe ~
  13351. SystemTools.FreeDownTo FoxIntermediateBackend ~
  13352. Compiler.Compile -p=Win32G --destPath=/temp/obg/ --traceModule=Trace
  13353. Runtime.Mod Trace.Mod Generic.Win32.Kernel32.Mod Win32.Machine.Mod Heaps.Mod
  13354. Generic.Modules.Mod Win32.Objects.Mod Win32.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13355. Commands.Mod I386.Reals.Mod Generic.Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13356. Win32.Traps.Mod Locks.Mod Win32.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13357. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13358. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Win32.User32.Mod
  13359. Win32.WinTrace.Mod Win32.ODBC.Mod Win32.Shell32.Mod Win32.SQL.Mod Win32.WinFS.Mod
  13360. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13361. GenericLinker.Mod GenericLoader.Mod BootConsole.Mod