FoxIntermediateBackend.Mod 582 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902139031390413905139061390713908139091391013911139121391313914139151391613917139181391913920139211392213923139241392513926139271392813929139301393113932139331393413935139361393713938139391394013941139421394313944139451394613947139481394913950139511395213953139541395513956139571395813959139601396113962139631396413965139661396713968139691397013971139721397313974139751397613977139781397913980139811398213983139841398513986139871398813989139901399113992139931399413995139961399713998139991400014001140021400314004140051400614007140081400914010140111401214013140141401514016140171401814019140201402114022140231402414025140261402714028140291403014031140321403314034140351403614037140381403914040140411404214043140441404514046140471404814049140501405114052140531405414055140561405714058140591406014061140621406314064140651406614067140681406914070140711407214073140741407514076140771407814079140801408114082140831408414085140861408714088140891409014091140921409314094140951409614097140981409914100141011410214103141041410514106141071410814109141101411114112141131411414115141161411714118141191412014121141221412314124141251412614127141281412914130141311413214133141341413514136141371413814139141401414114142141431414414145141461414714148141491415014151141521415314154141551415614157141581415914160141611416214163141641416514166141671416814169141701417114172141731417414175141761417714178141791418014181141821418314184141851418614187141881418914190141911419214193141941419514196141971419814199142001420114202142031420414205142061420714208142091421014211142121421314214142151421614217142181421914220142211422214223142241422514226142271422814229142301423114232142331423414235142361423714238142391424014241142421424314244142451424614247142481424914250142511425214253142541425514256142571425814259142601426114262142631426414265142661426714268142691427014271142721427314274142751427614277142781427914280142811428214283142841428514286142871428814289142901429114292142931429414295142961429714298142991430014301143021430314304143051430614307143081430914310143111431214313143141431514316143171431814319143201432114322143231432414325143261432714328143291433014331143321433314334143351433614337143381433914340143411434214343143441434514346143471434814349143501435114352143531435414355143561435714358143591436014361143621436314364143651436614367143681436914370143711437214373143741437514376143771437814379143801438114382143831438414385143861438714388143891439014391143921439314394143951439614397143981439914400144011440214403144041440514406144071440814409144101441114412144131441414415144161441714418144191442014421144221442314424144251442614427144281442914430144311443214433144341443514436144371443814439144401444114442144431444414445144461444714448144491445014451144521445314454144551445614457144581445914460144611446214463144641446514466144671446814469144701447114472144731447414475144761447714478144791448014481144821448314484144851448614487144881448914490144911449214493144941449514496144971449814499145001450114502145031450414505145061450714508145091451014511145121451314514145151451614517145181451914520145211452214523145241452514526145271452814529145301453114532145331453414535145361453714538145391454014541145421454314544145451454614547145481454914550145511455214553145541455514556145571455814559145601456114562145631456414565145661456714568145691457014571145721457314574145751457614577145781457914580145811458214583145841458514586145871458814589145901459114592145931459414595145961459714598145991460014601146021460314604146051460614607146081460914610146111461214613146141461514616146171461814619146201462114622146231462414625146261462714628146291463014631146321463314634146351463614637146381463914640146411464214643146441464514646146471464814649146501465114652146531465414655146561465714658146591466014661146621466314664146651466614667146681466914670146711467214673146741467514676146771467814679146801468114682146831468414685146861468714688146891469014691146921469314694146951469614697146981469914700147011470214703147041470514706147071470814709147101471114712147131471414715147161471714718147191472014721147221472314724147251472614727147281472914730147311473214733147341473514736147371473814739147401474114742147431474414745147461474714748147491475014751147521475314754147551475614757147581475914760147611476214763147641476514766147671476814769147701477114772147731477414775147761477714778147791478014781147821478314784147851478614787147881478914790147911479214793147941479514796147971479814799148001480114802148031480414805148061480714808148091481014811148121481314814148151481614817148181481914820148211482214823148241482514826148271482814829148301483114832148331483414835148361483714838148391484014841148421484314844148451484614847148481484914850148511485214853148541485514856148571485814859148601486114862148631486414865148661486714868148691487014871148721487314874148751487614877148781487914880148811488214883148841488514886148871488814889148901489114892148931489414895148961489714898148991490014901149021490314904149051490614907149081490914910149111491214913149141491514916149171491814919149201492114922149231492414925149261492714928149291493014931149321493314934149351493614937149381493914940149411494214943149441494514946149471494814949149501495114952149531495414955149561495714958149591496014961149621496314964149651496614967149681496914970149711497214973
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool, CRC;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. RethrowTrap* = 18; (* rethrow exception after unlock *)
  42. Trace = FALSE;
  43. TraceRegisterUsageCount=TRUE;
  44. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  45. (** system call numbers *)
  46. NumberSystemCalls* = 12;
  47. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  48. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  49. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  50. DefaultBuiltinsModuleName ="Builtins";
  51. DefaultTraceModuleName ="KernelLog";
  52. ChannelModuleName = "Channels";
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. BasePointerTypeSize = 5;
  59. BaseArrayTypeSize = BasePointerTypeSize + 3;
  60. LengthOffset = BasePointerTypeSize + 0;
  61. DataOffset = BasePointerTypeSize + 1;
  62. DescriptorOffset = BasePointerTypeSize + 2;
  63. BaseRecordTypeSize = BasePointerTypeSize + 2;
  64. ActionOffset = BasePointerTypeSize + 0;
  65. MonitorOffset = BasePointerTypeSize + 1;
  66. BaseObjectTypeSize = BaseRecordTypeSize;
  67. ActionTypeSize = 3;
  68. MonitorTypeSize = 7;
  69. ProcessorOffset = BaseObjectTypeSize + 1;
  70. StackLimitOffset* = BaseObjectTypeSize + 3;
  71. QuantumOffset = BaseObjectTypeSize + 4;
  72. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  73. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  74. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  75. Size2Flag = 4; (* size = 2 *)
  76. Size3Flag = 5; (* size = 3 *)
  77. Size4Flag = 6; (* size = 4 *)
  78. Size5Flag = 7; (* size = 5 *)
  79. Size6Flag = 8; (* size = 6 *)
  80. Size7Flag = 9; (* size = 7 *)
  81. Size8Flag = 10; (* size = 8 *)
  82. ReflectionSupport = TRUE;
  83. (* 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:
  84. 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
  85. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  86. *)
  87. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  88. ProtectModulesPointers = FALSE;
  89. CreateProcedureDescInfo = TRUE;
  90. WarningDynamicLoading = FALSE;
  91. SysvABI = {SyntaxTree.CCallingConvention};
  92. SysvABIorWINAPI = {SyntaxTree.CCallingConvention, SyntaxTree.WinAPICallingConvention};
  93. TYPE
  94. Position=SyntaxTree.Position;
  95. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  96. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  97. Operand = RECORD
  98. mode: SHORTINT;
  99. op: IntermediateCode.Operand;
  100. tag: IntermediateCode.Operand;
  101. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  102. dimOffset: LONGINT;
  103. availability: WORD; (* index *)
  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
  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, Streams.Invalid, s);
  164. END Error;
  165. (** types **)
  166. PROCEDURE Type(x: SyntaxTree.Type);
  167. BEGIN
  168. WITH x:
  169. SyntaxTree.QualifiedType DO QualifiedType(x)
  170. |SyntaxTree.MathArrayType DO meta.CheckTypeDeclaration(x)
  171. |SyntaxTree.PointerType DO meta.CheckTypeDeclaration(x) (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  172. |SyntaxTree.RecordType DO RecordType(x)
  173. |SyntaxTree.CellType DO CellType(x)
  174. ELSE
  175. END;
  176. END Type;
  177. PROCEDURE QualifiedType(x: SyntaxTree.QualifiedType);
  178. VAR type: SyntaxTree.Type;
  179. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  180. type := x.resolved;
  181. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  182. meta.CheckTypeDeclaration(type);
  183. END;
  184. END QualifiedType;
  185. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  186. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  187. BEGIN
  188. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  189. WHILE (this # NIL) & (this.identifier# id) DO
  190. this := this.nextModifier;
  191. END;
  192. RETURN this # NIL
  193. END HasFlag;
  194. PROCEDURE RecordType(x: SyntaxTree.RecordType);
  195. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  196. BEGIN (* no code emission *)
  197. meta.CheckTypeDeclaration(x);
  198. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  199. IF x.pointerType.typeDeclaration # NIL THEN
  200. td := x.pointerType.typeDeclaration
  201. ELSE
  202. td := x.typeDeclaration
  203. END;
  204. Global.GetSymbolName(td,name);
  205. (* code section for object *)
  206. END;
  207. Scope(x.recordScope);
  208. END RecordType;
  209. PROCEDURE CellType(x: SyntaxTree.CellType);
  210. VAR capabilities: SET;
  211. BEGIN
  212. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  213. capabilities := {};
  214. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  215. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  216. backend.SetCapabilities(capabilities);
  217. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  218. Scope(x.cellScope);
  219. END;
  220. END CellType;
  221. (* symbols *)
  222. PROCEDURE Variable(x: SyntaxTree.Variable);
  223. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  224. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  225. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  226. BEGIN
  227. type := type.resolved;
  228. IF type IS SyntaxTree.RecordType THEN
  229. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  230. ELSIF (type IS SyntaxTree.ArrayType) THEN
  231. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  232. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  233. END;
  234. ELSIF type IS SyntaxTree.MathArrayType THEN
  235. WITH type: SyntaxTree.MathArrayType DO
  236. IF type.form = SyntaxTree.Open THEN
  237. RETURN TRUE
  238. ELSIF type.form = SyntaxTree.Static THEN
  239. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  240. END;
  241. END;
  242. END;
  243. RETURN FALSE
  244. END TypeNeedsInitialization;
  245. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  246. VAR variable: SyntaxTree.Variable;
  247. BEGIN
  248. variable := scope.firstVariable;
  249. WHILE variable # NIL DO
  250. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  251. IF variable.initializer # NIL THEN RETURN TRUE END;
  252. variable := variable.nextVariable;
  253. END;
  254. RETURN FALSE
  255. END ScopeNeedsInitialization;
  256. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  257. VAR size: LONGINT;
  258. BEGIN
  259. size := offset - lastUpdated;
  260. IF size > 0 THEN
  261. irv.Emit(Reserve(x.position,size));
  262. END;
  263. irv.Emit(Data(x.position, op));
  264. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  265. END SingleInitialize;
  266. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  267. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  268. BEGIN
  269. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  270. WITH type:
  271. SyntaxTree.RecordType DO
  272. baseType := type.baseType;
  273. IF baseType # NIL THEN
  274. baseType := baseType.resolved;
  275. IF baseType IS SyntaxTree.PointerType THEN
  276. baseType := baseType(SyntaxTree.PointerType).pointerBase
  277. END;
  278. Initialize(baseType,NIL, offset);
  279. END;
  280. variable := type.recordScope.firstVariable;
  281. WHILE variable # NIL DO
  282. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  283. variable := variable.nextVariable
  284. END;
  285. | SyntaxTree.ArrayType DO
  286. IF type.form = SyntaxTree.Static THEN
  287. baseType := type.arrayBase;
  288. IF TypeNeedsInitialization(baseType) THEN
  289. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  290. FOR i := 0 TO type.staticLength-1 DO
  291. Initialize(baseType,NIL,offset+i*size);
  292. END;
  293. END;
  294. END;
  295. | SyntaxTree.MathArrayType DO
  296. IF type.form = SyntaxTree.Open THEN
  297. dim := DynamicDim(type);
  298. baseType := SemanticChecker.ArrayBase(type,dim);
  299. imm := IntermediateCode.Immediate(addressType,dim);
  300. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  301. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  302. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  303. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  304. (* flags remain empty (=0) for open array *)
  305. ELSIF type.form = SyntaxTree.Static THEN
  306. baseType := type.arrayBase;
  307. IF TypeNeedsInitialization(baseType) THEN
  308. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  309. ASSERT(type.staticLength < 1024*1024*1024);
  310. FOR i := 0 TO type.staticLength-1 DO
  311. Initialize(baseType,NIL,offset+i*size);
  312. END;
  313. END;
  314. END;
  315. ELSE
  316. IF initializer # NIL THEN
  317. implementationVisitor.Evaluate(initializer, op);
  318. SingleInitialize(op.op, offset);
  319. END;
  320. END;
  321. END Initialize;
  322. BEGIN
  323. IF x.externalName # NIL THEN RETURN END;
  324. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  325. (* code section for variable *)
  326. Global.GetSymbolSegmentedName(x,name);
  327. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  328. irv.SetExported(IsExported(x));
  329. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  330. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  331. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  332. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  333. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  334. FOR i := 0 TO DynamicDim(x.type)-1 DO
  335. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  336. END;
  337. ELSE
  338. lastUpdated:= 0;
  339. IF ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  340. Initialize(x.type, x.initializer, 0);
  341. END;
  342. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  343. IF size > 0 THEN
  344. irv.Emit(Reserve(x.position,size));
  345. END;
  346. IF ~x.fixed THEN
  347. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  348. ELSE
  349. align := x.alignment;
  350. END;
  351. irv.SetPositionOrAlignment(x.fixed, align);
  352. meta.CheckTypeDeclaration(x.type);
  353. END;
  354. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  355. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  356. END;
  357. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  358. END Variable;
  359. PROCEDURE Parameter(x: SyntaxTree.Parameter);
  360. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i: LONGINT;
  361. size: LONGINT; lastUpdated: LONGINT;
  362. BEGIN
  363. ASSERT(currentScope IS SyntaxTree.CellScope);
  364. Global.GetSymbolSegmentedName(x,name);
  365. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  366. irv.SetExported(IsExported(x));
  367. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  368. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  369. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  370. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  371. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  372. FOR i := 0 TO DynamicDim(x.type)-1 DO
  373. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  374. END;
  375. ELSE
  376. lastUpdated:= 0;
  377. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  378. IF size > 0 THEN
  379. irv.Emit(Reserve(x.position,size));
  380. END;
  381. IF ~x.fixed THEN
  382. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  383. ELSE
  384. align := x.alignment;
  385. END;
  386. irv.SetPositionOrAlignment(x.fixed, align);
  387. meta.CheckTypeDeclaration(x.type);
  388. END;
  389. END Parameter;
  390. PROCEDURE TypeDeclaration(x: SyntaxTree.TypeDeclaration);
  391. BEGIN
  392. Type(x.declaredType); (* => code in objects *)
  393. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  394. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  395. END;
  396. END TypeDeclaration;
  397. PROCEDURE Constant(x: SyntaxTree.Constant);
  398. BEGIN
  399. IF (SyntaxTree.Public * x.access # {}) THEN
  400. implementationVisitor.VisitConstant(x);
  401. END;
  402. END Constant;
  403. PROCEDURE Scope(x: SyntaxTree.Scope);
  404. VAR procedure: SyntaxTree.Procedure;
  405. constant: SyntaxTree.Constant;
  406. variable: SyntaxTree.Variable;
  407. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  408. cell: SyntaxTree.CellType;
  409. parameter: SyntaxTree.Parameter;
  410. property: SyntaxTree.Property;
  411. BEGIN
  412. prevScope := currentScope;
  413. currentScope := x;
  414. (* constants treated in implementation visitor *)
  415. WITH x: SyntaxTree.CellScope DO
  416. cell := x.ownerCell;
  417. parameter := cell.firstParameter;
  418. WHILE parameter # NIL DO
  419. Parameter(parameter);
  420. parameter := parameter.nextParameter;
  421. END;
  422. property := cell.firstProperty;
  423. WHILE property # NIL DO
  424. Variable(property);
  425. property := property.nextProperty;
  426. END;
  427. ELSE
  428. END;
  429. typeDeclaration := x.firstTypeDeclaration;
  430. WHILE typeDeclaration # NIL DO
  431. TypeDeclaration(typeDeclaration);
  432. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  433. END;
  434. variable := x.firstVariable;
  435. WHILE variable # NIL DO
  436. Variable(variable);
  437. variable := variable.nextVariable;
  438. END;
  439. procedure := x.firstProcedure;
  440. WHILE procedure # NIL DO
  441. Procedure(procedure);
  442. procedure := procedure.nextProcedure;
  443. END;
  444. constant := x.firstConstant;
  445. WHILE constant # NIL DO
  446. Constant(constant);
  447. constant := constant.nextConstant;
  448. END;
  449. currentScope := prevScope;
  450. END Scope;
  451. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  452. VAR parameter: SyntaxTree.Parameter;
  453. BEGIN
  454. parameter := first;
  455. WHILE parameter # NIL DO
  456. Parameter(parameter);
  457. parameter := parameter.nextParameter;
  458. END;
  459. END Parameters;
  460. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  461. VAR scope: SyntaxTree.ProcedureScope;
  462. prevScope: SyntaxTree.Scope;
  463. inline, finalizer: BOOLEAN;
  464. procedureType: SyntaxTree.ProcedureType;
  465. pc: LONGINT;
  466. memorySize: Basic.Integer; stackSize: LONGINT;
  467. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  468. null,size,src,dest,fp,res: IntermediateCode.Operand;
  469. callingConvention: LONGINT;
  470. cellType: SyntaxTree.CellType;
  471. register: WORD;
  472. registerClass: IntermediateCode.RegisterClass;
  473. type: IntermediateCode.Type;
  474. formalParameter: SyntaxTree.Parameter;
  475. recordType: SyntaxTree.RecordType;
  476. isModuleBody: BOOLEAN;
  477. parametersSize: LONGINT;
  478. position: LONGINT;
  479. variable: SyntaxTree.Variable;
  480. nonParameterRegisters: WORD;
  481. PROCEDURE Signature;
  482. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  483. BEGIN
  484. procedureType := x.type(SyntaxTree.ProcedureType);
  485. returnType := procedureType.returnType;
  486. IF returnType # NIL THEN
  487. meta.CheckTypeDeclaration(returnType)
  488. END;
  489. parameter := procedureType.firstParameter;
  490. WHILE parameter # NIL DO
  491. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  492. parameter := parameter.nextParameter;
  493. END;
  494. END Signature;
  495. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: Basic.Integer): BOOLEAN;
  496. VAR result: BOOLEAN;
  497. BEGIN
  498. result := FALSE;
  499. IF x = SyntaxTree.invalidExpression THEN
  500. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  501. result := TRUE;
  502. value := x.resolved(SyntaxTree.IntegerValue).value;
  503. ELSE
  504. Error(x.position,"expression is not an integer constant");
  505. END;
  506. RETURN result;
  507. END CheckIntegerValue;
  508. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: Basic.Integer): BOOLEAN;
  509. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  510. BEGIN
  511. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  512. WHILE (this # NIL) & (this.identifier # id) DO
  513. this := this.nextModifier;
  514. END;
  515. IF this # NIL THEN
  516. IF this.expression = NIL THEN
  517. Error(this.position,"expected expression value");
  518. ELSIF CheckIntegerValue(this.expression,value) THEN
  519. END;
  520. RETURN TRUE
  521. ELSE RETURN FALSE
  522. END;
  523. END HasValue;
  524. CONST DefaultDataMemorySize=512;
  525. BEGIN
  526. IF x.externalName # NIL THEN RETURN END;
  527. (*
  528. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  529. *)
  530. (* code section for this procedure *)
  531. position := x.position.start;
  532. scope := x.procedureScope;
  533. prevScope := currentScope;
  534. currentScope := scope;
  535. procedureType := x.type(SyntaxTree.ProcedureType);
  536. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  537. implementationVisitor.temporaries.Clear;
  538. implementationVisitor.usedRegisters := NIL;
  539. implementationVisitor.registerUsageCount.Init;
  540. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  541. IF (scope.body # NIL) & (x.isInline) THEN
  542. inline := TRUE;
  543. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  544. ir.SetExported(IsExported(x));
  545. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  546. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  547. IF backend.cellsAreObjects THEN
  548. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  549. ir.SetExported(IsExported(x));
  550. ELSE
  551. RETURN; (* cellnet cannot be compiled for final static hardware *)
  552. END;
  553. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  554. inline := FALSE;
  555. AddBodyCallStub(x);
  556. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  557. ir.SetExported(IsExported(x));
  558. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  559. inline := FALSE;
  560. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  561. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,memorySize) THEN memorySize := DefaultDataMemorySize END;
  562. AddBodyCallStub(x);
  563. AddStackAllocation(x,memorySize);
  564. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  565. ir.SetExported(IsExported(x));
  566. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  567. inline := FALSE;
  568. Parameters(procedureType.firstParameter);
  569. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  570. ir.SetExported(IsExported(x));
  571. ELSE
  572. inline := FALSE;
  573. IF x.isEntry OR x.isExit THEN
  574. IF x.isEntry THEN
  575. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  576. ELSE
  577. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  578. END;
  579. ir.SetExported(TRUE);
  580. ELSE
  581. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  582. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  583. END;
  584. END;
  585. callingConvention := procedureType.callingConvention;
  586. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  587. parametersSize := ProcedureParametersSize(backend.system,x);
  588. ELSE
  589. parametersSize := 0;
  590. END;
  591. IF scope.body # NIL THEN
  592. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  593. IF ~inline THEN
  594. IF scope.lastVariable = NIL THEN
  595. stackSize := 0
  596. ELSE
  597. stackSize := scope.lastVariable.offsetInBits;
  598. IF stackSize <0 THEN stackSize := -stackSize END;
  599. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  600. END;
  601. (*
  602. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  603. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  604. *)
  605. (*
  606. ir.Emit(Nop(position)); (* placeholder for fill *)
  607. *)
  608. IF (callingConvention # SyntaxTree.OberonCallingConvention) & (~(callingConvention IN SysvABI) OR (system.addressSize # 64)) THEN
  609. backend.ResetParameterRegisters();
  610. (* assumption: registers are passed left to right and left parameters are in registers *)
  611. formalParameter := procedureType.firstParameter;
  612. WHILE (formalParameter # NIL) DO
  613. IF PassInRegister(formalParameter, callingConvention) THEN
  614. IF formalParameter.type.IsRecordType() THEN
  615. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  616. type := addressType;
  617. ELSE
  618. type := GetType(system, formalParameter.type);
  619. END;
  620. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  621. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  622. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  623. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  624. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  625. implementationVisitor.ReleaseIntermediateOperand(src);
  626. END;
  627. END;
  628. formalParameter := formalParameter.nextParameter;
  629. END;
  630. END;
  631. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  632. implementationVisitor.EmitEnter(ir,x.position,x,callingConvention,ToMemoryUnits(system,stackSize));
  633. END;
  634. pc := ir.pc-1;
  635. IF (callingConvention IN SysvABI) & (system.addressSize = 64) THEN
  636. backend.ResetParameterRegisters();
  637. nonParameterRegisters := 0;
  638. (* assumption: registers are passed left to right and left parameters are in registers *)
  639. formalParameter := procedureType.firstParameter;
  640. WHILE (formalParameter # NIL) DO
  641. IF PassInRegister(formalParameter, callingConvention) THEN
  642. IF formalParameter.type.IsRecordType() THEN
  643. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  644. type := addressType;
  645. ELSE
  646. type := GetType(system, formalParameter.type);
  647. END;
  648. IF backend.GetParameterRegister(callingConvention, type, register) THEN
  649. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  650. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  651. implementationVisitor.currentScope := currentScope;
  652. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  653. formalParameter.SetOffset(variable.offsetInBits);
  654. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  655. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  656. implementationVisitor.ReleaseIntermediateOperand(src);
  657. ELSE
  658. INC(nonParameterRegisters);
  659. formalParameter.SetOffset(nonParameterRegisters * addressType.sizeInBits);
  660. END;
  661. END;
  662. formalParameter := formalParameter.nextParameter;
  663. END;
  664. END;
  665. END;
  666. implementationVisitor.tagsAvailable := callingConvention = SyntaxTree.OberonCallingConvention;
  667. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  668. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  669. IF scope.lastVariable # NIL THEN
  670. stackSize := scope.lastVariable.offsetInBits;
  671. IF stackSize <0 THEN stackSize := -stackSize END;
  672. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  673. END;
  674. END;
  675. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  676. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  677. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  678. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  679. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  680. ir.EmitAt(pc,Push(size));
  681. implementationVisitor.StaticCallOperand(result,procedure);
  682. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  683. END;
  684. *)
  685. END;
  686. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  687. IF stackSize > 0 THEN
  688. IF (stackSize MOD system.addressSize = 0) THEN
  689. null := IntermediateCode.Immediate(addressType,0);
  690. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  691. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  692. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  693. ELSE
  694. null := IntermediateCode.Immediate(int8,0);
  695. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  696. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  697. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  698. END;
  699. (*! should potentially be called by backend -- enter might initialize
  700. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  701. *)
  702. END;
  703. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  704. parametersSize := ProcedureParametersSize(backend.system,x);
  705. ELSE
  706. parametersSize := 0;
  707. END;
  708. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  709. finalizer := FALSE;
  710. IF backend.cooperative & x.isFinalizer THEN
  711. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  712. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  713. GetRecordTypeName(recordType,name);
  714. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  715. END;
  716. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  717. IF backend.cooperative THEN
  718. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  719. IF implementationVisitor.profile & ~isModuleBody THEN
  720. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  721. END;
  722. ELSE
  723. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  724. END;
  725. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  726. IF finalizer THEN
  727. IF backend.hasLinkRegister THEN
  728. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  729. END;
  730. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  731. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  732. ir.Emit(Br(x.position,dest));
  733. ELSE
  734. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  735. END;
  736. ELSE
  737. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  738. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  739. END;
  740. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  741. IF backend.cooperative THEN
  742. IF HasPointers (scope) THEN
  743. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  744. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  745. ir.Emit(Result(x.position, res));
  746. ir.Emit(Push(x.position, res));
  747. implementationVisitor.ResetVariables(scope);
  748. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  749. ir.Emit(Pop(x.position, res));
  750. ir.Emit(Return(x.position, res));
  751. ELSE
  752. implementationVisitor.ResetVariables(scope);
  753. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  754. END;
  755. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  756. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  757. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  758. ir.Emit(Result(x.position, res));
  759. ir.Emit(Push(x.position, res));
  760. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  761. ir.Emit(Pop(x.position, res));
  762. ir.Emit(Return(x.position, res));
  763. ELSE
  764. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  765. END;
  766. END;
  767. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  768. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  769. ELSE
  770. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  771. ir.Emit(Nop(x.position));
  772. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  773. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  774. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  775. END;
  776. END;
  777. END
  778. END;
  779. ELSE (* force body for procedures *)
  780. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0);
  781. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  782. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  783. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  784. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  785. END;
  786. Scope(scope);
  787. Signature;
  788. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  789. currentScope := prevScope;
  790. END Procedure;
  791. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  792. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  793. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  794. BEGIN
  795. ASSERT (bodyProcedure # NIL);
  796. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  797. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  798. procedure.SetScope(bodyProcedure.scope);
  799. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  800. procedure.SetAccess(SyntaxTree.Hidden);
  801. Global.GetSymbolSegmentedName (procedure,name);
  802. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  803. ir.SetExported(TRUE);
  804. Global.GetSymbolSegmentedName (bodyProcedure,name);
  805. IF ~meta.simple THEN
  806. implementationVisitor.currentScope := module.module.moduleScope;
  807. implementationVisitor.section := ir;
  808. implementationVisitor.PushSelfPointer();
  809. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  810. ELSIF backend.preregisterStatic THEN
  811. implementationVisitor.currentScope := module.module.moduleScope;
  812. implementationVisitor.section := ir;
  813. implementationVisitor.PushSelfPointer();
  814. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  815. ELSE
  816. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  817. ir.Emit(Call(bodyProcedure.position,op, 0));
  818. END;
  819. END AddBodyCallStub;
  820. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  821. VAR name: Basic.SegmentedName;
  822. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  823. BEGIN
  824. Global.GetSymbolSegmentedName (symbol,name);
  825. Basic.RemoveSuffix(name);
  826. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  827. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  828. ir.SetExported(TRUE);
  829. IntermediateCode.InitImmediate(op,addressType,initStack);
  830. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  831. END AddStackAllocation;
  832. (** entry function to visit a complete module *)
  833. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  834. VAR
  835. name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  836. hasDynamicOperatorDeclarations: BOOLEAN;
  837. operator: SyntaxTree.Operator;
  838. import: SyntaxTree.Import;
  839. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  840. BEGIN
  841. type := type.resolved;
  842. IF type IS SyntaxTree.RecordType THEN
  843. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  844. ELSIF (type IS SyntaxTree.ArrayType) THEN
  845. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  846. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  847. END;
  848. ELSIF type IS SyntaxTree.MathArrayType THEN
  849. WITH type: SyntaxTree.MathArrayType DO
  850. IF type.form = SyntaxTree.Open THEN
  851. RETURN TRUE
  852. ELSIF type.form = SyntaxTree.Static THEN
  853. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  854. END;
  855. END;
  856. END;
  857. RETURN FALSE
  858. END TypeNeedsInitialization;
  859. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  860. VAR variable: SyntaxTree.Variable;
  861. BEGIN
  862. variable := scope.firstVariable;
  863. WHILE variable # NIL DO
  864. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  865. IF variable.initializer # NIL THEN RETURN TRUE END;
  866. variable := variable.nextVariable;
  867. END;
  868. RETURN FALSE
  869. END ScopeNeedsInitialization;
  870. BEGIN
  871. ASSERT(x # NIL); ASSERT(module # NIL);
  872. SELF.module := module;
  873. (* add import names to the generated Sections.Module *)
  874. import := x.moduleScope.firstImport;
  875. WHILE import # NIL DO
  876. import.module.GetName(idstr);
  877. module.imports.AddName(idstr);
  878. import := import.nextImport
  879. END;
  880. implementationVisitor.module := module;
  881. implementationVisitor.moduleScope := x.moduleScope;
  882. implementationVisitor.moduleSelf := moduleSelf;
  883. implementationVisitor.canBeLoaded := TRUE;
  884. meta.SetModule(module);
  885. IF (forceModuleBody OR ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  886. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  887. END;
  888. IF backend.profile THEN
  889. EnsureBodyProcedure(x.moduleScope);
  890. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  891. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  892. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  893. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  894. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  895. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0);
  896. Global.GetModuleName(module.module,idstr);
  897. implementationVisitor.ProfilerAddModule(idstr);
  898. implementationVisitor.numberProcedures := 0;
  899. END;
  900. implementationVisitor.profile := backend.profile;
  901. (* check if there is at least one dynamic operator locally defined *)
  902. hasDynamicOperatorDeclarations := FALSE;
  903. operator := x.moduleScope.firstOperator;
  904. WHILE operator # NIL DO
  905. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  906. operator := operator.nextOperator
  907. END;
  908. (* add operator initialization code section *)
  909. IF hasDynamicOperatorDeclarations THEN
  910. EnsureBodyProcedure(x.moduleScope);
  911. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  912. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  913. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0);
  914. END;
  915. Scope(x.moduleScope);
  916. IF hasDynamicOperatorDeclarations THEN
  917. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  918. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  919. END;
  920. IF backend.profile THEN
  921. implementationVisitor.ProfilerPatchInit;
  922. END;
  923. END Module;
  924. END DeclarationVisitor;
  925. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  926. RegisterUsageCount*=OBJECT
  927. VAR used: UsedArray; count: LONGINT;
  928. PROCEDURE &Init;
  929. VAR i: LONGINT;
  930. BEGIN
  931. count := 0;
  932. IF used = NIL THEN NEW(used,64); END;
  933. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  934. END Init;
  935. PROCEDURE Grow;
  936. VAR new: UsedArray; size,i: LONGINT;
  937. BEGIN
  938. size := LEN(used)*2;
  939. NEW(new,size);
  940. FOR i := 0 TO LEN(used)-1 DO
  941. new[i].count := used[i].count;
  942. new[i].type := used[i].type;
  943. new[i].map := used[i].map
  944. END;
  945. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  946. used := new
  947. END Grow;
  948. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  949. BEGIN
  950. INC(count);
  951. IF count = LEN(used) THEN Grow END;
  952. used[count].type := type;
  953. used[count].class := class;
  954. used[count].map := count;
  955. RETURN count;
  956. END Next;
  957. PROCEDURE IncUse(register: LONGINT);
  958. BEGIN
  959. INC(used[register].count);
  960. (*
  961. IF (register = 1) & (count > 30) THEN
  962. D.TraceBack;
  963. END;
  964. *)
  965. END IncUse;
  966. PROCEDURE DecUse(register: LONGINT);
  967. BEGIN
  968. DEC(used[register].count);
  969. END DecUse;
  970. PROCEDURE Map(register: LONGINT): LONGINT;
  971. VAR map : LONGINT;
  972. BEGIN
  973. IF register > 0 THEN
  974. map := used[register].map;
  975. WHILE register # map DO register := map; map := used[register].map END;
  976. END;
  977. RETURN register
  978. END Map;
  979. PROCEDURE Use(register: LONGINT): LONGINT;
  980. BEGIN
  981. IF register< LEN(used) THEN
  982. RETURN used[register].count
  983. ELSE
  984. RETURN 0
  985. END
  986. END Use;
  987. END RegisterUsageCount;
  988. RegisterEntry = POINTER TO RECORD
  989. prev,next: RegisterEntry;
  990. register: LONGINT;
  991. registerClass: IntermediateCode.RegisterClass;
  992. type: IntermediateCode.Type;
  993. END;
  994. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  995. Variables = OBJECT (Basic.List)
  996. VAR
  997. inUse: VariableUse;
  998. registerIndex: LONGINT;
  999. nameIndex: LONGINT;
  1000. PROCEDURE & Init;
  1001. VAR i: LONGINT;
  1002. BEGIN
  1003. InitList(16);
  1004. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1005. registerIndex := 1024;
  1006. nameIndex := 0;
  1007. END Init;
  1008. PROCEDURE Clear*;
  1009. VAR i: LONGINT;
  1010. BEGIN
  1011. Clear^;
  1012. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1013. registerIndex := 1024;
  1014. nameIndex := 0;
  1015. END Clear;
  1016. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1017. VAR string: SyntaxTree.IdentifierString ;
  1018. BEGIN
  1019. COPY("@hiddenIRVar",string);
  1020. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1021. RETURN SyntaxTree.NewIdentifier(string);
  1022. END GetUID;
  1023. PROCEDURE GetUsage(VAR use: VariableUse);
  1024. BEGIN
  1025. use := inUse;
  1026. END GetUsage;
  1027. PROCEDURE SetUsage(CONST use: VariableUse);
  1028. BEGIN
  1029. inUse := use;
  1030. END SetUsage;
  1031. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1032. VAR any: ANY;
  1033. BEGIN
  1034. any := Get(i);
  1035. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1036. END GetVariable;
  1037. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1038. BEGIN
  1039. Set(pos, v);
  1040. END SetVariable;
  1041. PROCEDURE Occupy(pos: LONGINT);
  1042. BEGIN
  1043. INCL(inUse[pos DIV 32], pos MOD 32);
  1044. END Occupy;
  1045. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1046. BEGIN
  1047. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1048. END Occupied;
  1049. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1050. BEGIN
  1051. Occupy(Length());
  1052. Add(v);
  1053. END AddVariable;
  1054. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1055. BEGIN
  1056. t1 := t1.resolved;
  1057. t2 := t2.resolved;
  1058. (*RETURN t1.SameType(t2); *)
  1059. RETURN
  1060. (t1.SameType(t2))
  1061. OR
  1062. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1063. OR
  1064. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (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; i: LONGINT;
  1076. BEGIN
  1077. pos := Length();
  1078. FOR i := 0 TO pos-1 DO
  1079. IF ~(Occupied(i)) THEN
  1080. var := GetVariable(i);
  1081. IF (~var.useRegister) & CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1082. pos := i;
  1083. Occupy(i);
  1084. RETURN var;
  1085. END;
  1086. END;
  1087. END;
  1088. RETURN NIL
  1089. END GetFreeVariable;
  1090. END Variables;
  1091. SymbolMap = POINTER TO RECORD
  1092. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1093. isAddress: BOOLEAN;
  1094. END;
  1095. SymbolMapper = OBJECT
  1096. VAR
  1097. first: SymbolMap;
  1098. PROCEDURE & Init;
  1099. BEGIN
  1100. first := NIL;
  1101. END Init;
  1102. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1103. VAR new: SymbolMap;
  1104. BEGIN
  1105. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1106. new.next := first; first := new;
  1107. END Add;
  1108. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1109. VAR s: SymbolMap;
  1110. BEGIN
  1111. s := first;
  1112. WHILE (s # NIL) & (s.this # this) DO
  1113. s := s.next
  1114. END;
  1115. RETURN s
  1116. END Get;
  1117. END SymbolMapper;
  1118. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1119. VAR
  1120. system: Global.System;
  1121. section: IntermediateCode.Section;
  1122. module: Sections.Module;
  1123. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1124. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1125. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1126. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1127. checker: SemanticChecker.Checker;
  1128. backend: IntermediateBackend;
  1129. meta: MetaDataGenerator;
  1130. position: Position;
  1131. moduleSelf: SyntaxTree.Variable;
  1132. (* variables for hand over of variables / temporary state *)
  1133. currentScope: SyntaxTree.Scope;
  1134. constantDeclaration : SyntaxTree.Symbol;
  1135. result: Operand; (* result of the most recent expression / statement *)
  1136. destination: IntermediateCode.Operand;
  1137. arrayDestinationTag: IntermediateCode.Operand;
  1138. arrayDestinationDimension:LONGINT;
  1139. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1140. trueLabel, falseLabel, exitLabel: Label;
  1141. locked: BOOLEAN;
  1142. (*
  1143. usedRegisters: Registers;
  1144. *)
  1145. registerUsageCount: RegisterUsageCount;
  1146. usedRegisters: RegisterEntry;
  1147. (* useful operands and types *)
  1148. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1149. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1150. commentPrintout: Printout.Printer;
  1151. dump: Streams.Writer;
  1152. tagsAvailable : BOOLEAN;
  1153. supportedInstruction: SupportedInstructionProcedure;
  1154. supportedImmediate: SupportedImmediateProcedure;
  1155. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1156. emitLabels: BOOLEAN;
  1157. builtinsModuleName : SyntaxTree.IdentifierString;
  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. (* EXPERIMENTAL *)
  1177. availableSymbols: ARRAY 1024 OF
  1178. RECORD
  1179. symbol: SyntaxTree.Symbol;
  1180. inMemory, inRegister: BOOLEAN;
  1181. register: IntermediateCode.Operand;
  1182. memory: IntermediateCode.Operand;
  1183. END;
  1184. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend);
  1185. BEGIN
  1186. SELF.system := system;
  1187. SELF.builtinsModuleName := runtime;
  1188. currentScope := NIL;
  1189. hiddenPointerType := NIL;
  1190. delegatePointerType := NIL;
  1191. awaitProcCounter := 0;
  1192. labelId := 0; constId := 0; labelId := 0;
  1193. SELF.checker := checker;
  1194. SELF.backend := backend;
  1195. position := Basic.invalidPosition;
  1196. locked := FALSE;
  1197. InitOperand(result,ModeUndefined);
  1198. addressType := IntermediateCode.GetType(system,system.addressType);
  1199. setType := IntermediateCode.GetType(system,system.setType);
  1200. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1201. lenType := IntermediateCode.GetType(system, system.lenType);
  1202. byteType := IntermediateCode.GetType(system, system.byteType);
  1203. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1204. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1205. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1206. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1207. nil := IntermediateCode.Immediate(addressType,0);
  1208. one := IntermediateCode.Immediate(addressType,1);
  1209. IntermediateCode.InitOperand(destination);
  1210. tagsAvailable := TRUE;
  1211. supportedInstruction := supportedInstructionProcedure;
  1212. supportedImmediate := supportedImmediateProcedure;
  1213. inData := FALSE;
  1214. SELF.emitLabels := emitLabels;
  1215. IntermediateCode.InitOperand(arrayDestinationTag);
  1216. bool := IntermediateCode.GetType(system,system.booleanType);
  1217. IntermediateCode.InitImmediate(false,bool,0);
  1218. IntermediateCode.InitImmediate(true,bool,1);
  1219. indexCounter := 0;
  1220. NEW(registerUsageCount);
  1221. usedRegisters := NIL;
  1222. procedureResultDesignator := NIL;
  1223. NEW(fingerPrinter);
  1224. NEW(temporaries);
  1225. currentIsInline := FALSE;
  1226. NeedDescriptor := FALSE;
  1227. isUnchecked := backend.noRuntimeChecks;
  1228. END Init;
  1229. TYPE Context = RECORD
  1230. section: IntermediateCode.Section;
  1231. registerUsageCount: RegisterUsageCount;
  1232. usedRegisters: RegisterEntry;
  1233. temporaries: Variables;
  1234. END;
  1235. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1236. VAR context: Context;
  1237. BEGIN
  1238. context.section := section;
  1239. context.registerUsageCount := registerUsageCount;
  1240. context.usedRegisters := usedRegisters;
  1241. context.temporaries := temporaries;
  1242. section := new;
  1243. NEW(registerUsageCount);
  1244. NEW(temporaries);
  1245. usedRegisters := NIL;
  1246. RETURN context;
  1247. END SwitchContext;
  1248. PROCEDURE ReturnToContext(context: Context);
  1249. BEGIN
  1250. section := context.section;
  1251. registerUsageCount := context.registerUsageCount;
  1252. usedRegisters := context.usedRegisters;
  1253. temporaries := context.temporaries;
  1254. END ReturnToContext;
  1255. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1256. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1257. BEGIN
  1258. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1259. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1260. END;
  1261. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1262. section.SetExported(IsExported(syntaxTreeSymbol));
  1263. RETURN section
  1264. END NewSection;
  1265. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1266. VAR new: LONGINT;
  1267. BEGIN
  1268. new := registerUsageCount.Next(type,class);
  1269. UseRegister(new);
  1270. RETURN new
  1271. END AcquireRegister;
  1272. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1273. VAR
  1274. fingerPrint: SyntaxTree.FingerPrint;
  1275. fingerPrintString: ARRAY 32 OF CHAR;
  1276. BEGIN
  1277. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1278. string := "[";
  1279. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1280. Strings.Append(string, fingerPrintString);
  1281. Strings.Append(string, "]");
  1282. END GetFingerprintString;
  1283. (** get the name for the code section that represens a certain symbol
  1284. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1285. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1286. VAR string: ARRAY 32 OF CHAR;
  1287. BEGIN
  1288. Global.GetSymbolSegmentedName(symbol, name);
  1289. (* if the symbol is an operator, then append the fingerprint to the name *)
  1290. IF symbol IS SyntaxTree.Operator THEN
  1291. GetFingerprintString(symbol, string);
  1292. Basic.AppendToSegmentedName(name,string);
  1293. END
  1294. END GetCodeSectionNameForSymbol;
  1295. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1296. BEGIN
  1297. IF dump # NIL THEN
  1298. dump.String("enter "); dump.String(s); dump.Ln;
  1299. END;
  1300. END TraceEnter;
  1301. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1302. BEGIN
  1303. IF dump # NIL THEN
  1304. dump.String("exit "); dump.String(s); dump.Ln;
  1305. END;
  1306. END TraceExit;
  1307. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1308. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1309. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1310. VAR i: LONGINT;
  1311. BEGIN
  1312. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1313. IF op.rule # NIL THEN
  1314. FOR i := 0 TO LEN(op.rule)-1 DO
  1315. CheckRegister(op.rule[i])
  1316. END;
  1317. END;
  1318. END CheckRegister;
  1319. BEGIN
  1320. CheckRegister(instruction.op1);
  1321. CheckRegister(instruction.op2);
  1322. CheckRegister(instruction.op3);
  1323. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1324. ELSE section.Emit(instruction);
  1325. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1326. END;
  1327. END Emit;
  1328. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1329. VAR saved: RegisterEntry;
  1330. BEGIN
  1331. IF backend.cooperative THEN
  1332. ReleaseUsedRegisters(saved);
  1333. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1334. CallThis(position,"Runtime","Trap",1);
  1335. RestoreRegisterUse(saved);
  1336. ELSE
  1337. Emit(Trap(position,trapNo));
  1338. END;
  1339. END EmitTrap;
  1340. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT);
  1341. VAR name: Basic.SegmentedName;
  1342. VAR op1, op2, reg: IntermediateCode.Operand;
  1343. VAR call, nocall: Label;
  1344. VAR parametersSize: LONGINT;
  1345. VAR prevSection: IntermediateCode.Section;
  1346. VAR prevDump: Streams.Writer;
  1347. VAR body: SyntaxTree.Body;
  1348. VAR procedureType: SyntaxTree.ProcedureType;
  1349. BEGIN
  1350. IF procedure # NIL THEN
  1351. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1352. ELSE procedureType := NIL;
  1353. END;
  1354. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1355. prevSection := SELF.section;
  1356. SELF.section := section;
  1357. prevDump := dump;
  1358. dump := section.comments;
  1359. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1360. IF backend.hasLinkRegister THEN
  1361. Emit(Push(Basic.invalidPosition, lr));
  1362. END;
  1363. Emit(Push(Basic.invalidPosition,fp));
  1364. IF procedure # NIL THEN
  1365. body := procedure.procedureScope.body;
  1366. ELSE
  1367. body := NIL;
  1368. END;
  1369. IF backend.cooperative THEN
  1370. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1371. GetCodeSectionNameForSymbol(procedure, name);
  1372. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1373. ELSE
  1374. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1375. END;
  1376. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1377. IntermediateCode.AddOffset(op1, 1);
  1378. Emit(Push(Basic.invalidPosition,op1));
  1379. Emit(Mov(Basic.invalidPosition,fp, sp));
  1380. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1381. NEW(call, section);
  1382. NEW(nocall, section);
  1383. reg := NewRegisterOperand(addressType);
  1384. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1385. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1386. BrltL(call, sp, reg);
  1387. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1388. BrgeL(nocall, sp, op2);
  1389. call.Resolve(section.pc);
  1390. Emit(Push(Basic.invalidPosition, reg));
  1391. ReleaseIntermediateOperand(reg);
  1392. parametersSize := ProcParametersSize(procedure);
  1393. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1394. Emit(Push(Basic.invalidPosition, op2));
  1395. CallThis(position, "Activities","ExpandStack",2);
  1396. Emit(Result(Basic.invalidPosition, sp));
  1397. nocall.Resolve(section.pc);
  1398. END;
  1399. ELSE
  1400. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1401. Emit(Push(Basic.invalidPosition, one)) ;
  1402. procedureType.SetParametersOffset(1);
  1403. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1404. END;
  1405. Emit(Mov(Basic.invalidPosition, fp, sp));
  1406. END;
  1407. END;
  1408. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1409. SELF.section := prevSection;
  1410. dump := prevDump;
  1411. END EmitEnter;
  1412. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1413. VAR op1,op2: IntermediateCode.Operand;
  1414. VAR instruction: IntermediateCode.Instruction;
  1415. BEGIN
  1416. IntermediateCode.InitNumber(op1,callconv);
  1417. IntermediateCode.InitNumber(op2,varSize);
  1418. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1419. RETURN instruction
  1420. END Enter;
  1421. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1422. VAR op1: IntermediateCode.Operand;
  1423. VAR instruction: IntermediateCode.Instruction;
  1424. BEGIN
  1425. IntermediateCode.InitNumber(op1,callconv);
  1426. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1427. RETURN instruction
  1428. END Leave;
  1429. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1430. VAR prevSection: IntermediateCode.Section;
  1431. VAR op2: IntermediateCode.Operand;
  1432. VAR body: SyntaxTree.Body;
  1433. BEGIN
  1434. prevSection := SELF.section;
  1435. SELF.section := section;
  1436. Emit(Leave(position, callconv));
  1437. IF procedure # NIL THEN
  1438. body := procedure.procedureScope.body;
  1439. ELSE
  1440. body := NIL;
  1441. END;
  1442. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1443. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1444. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1445. Emit(Add(position, sp, fp, op2));
  1446. ELSE
  1447. Emit(Mov(position, sp, fp));
  1448. END;
  1449. Emit(Pop(position, fp));
  1450. END;
  1451. SELF.section := prevSection;
  1452. END EmitLeave;
  1453. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1454. VAR m: SymbolMap;
  1455. BEGIN
  1456. position := x.position;
  1457. IF currentIsInline THEN
  1458. m := currentMapper.Get(x);
  1459. IF m # NIL THEN
  1460. (*
  1461. Printout.Info("mapping from", x);
  1462. Printout.Info("mapping to ", m.to);
  1463. *)
  1464. VExpression(m.to);
  1465. op := result;
  1466. IF m.tag # NIL THEN
  1467. ReleaseIntermediateOperand(result.tag);
  1468. VExpression(m.tag);
  1469. op.tag := result.op;
  1470. ReleaseIntermediateOperand(result.tag);
  1471. END;
  1472. RETURN
  1473. END;
  1474. END;
  1475. VSymbol(x);
  1476. op := result;
  1477. END Symbol;
  1478. PROCEDURE Expression(x: SyntaxTree.Expression);
  1479. BEGIN
  1480. position := x.position;
  1481. constantDeclaration := NIL;
  1482. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1483. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1484. END;
  1485. IF x.resolved # NIL THEN
  1486. VExpression(x.resolved);
  1487. ELSE
  1488. VExpression(x);
  1489. END;
  1490. (* check this, was commented out in ActiveCells3 *)
  1491. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1492. Error(x.position, "unsupported modifier");
  1493. END;
  1494. END Expression;
  1495. (*
  1496. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1497. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1498. BEGIN
  1499. temporaries.GetUsage(current);
  1500. FOR i := 0 TO LEN(current)-1 DO
  1501. set := current[i] - previous[i];
  1502. IF set # {} THEN
  1503. FOR j := 0 TO MAX(SET)-1 DO
  1504. IF j IN set THEN
  1505. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1506. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1507. Symbol(variable, op);
  1508. MakeMemory(tmp,op.op,addressType,0);
  1509. ReleaseOperand(op);
  1510. Emit(Mov(position,tmp, nil ) );
  1511. ReleaseIntermediateOperand(tmp);
  1512. END;
  1513. END;
  1514. END;
  1515. END;
  1516. END;
  1517. END ResetUsedTemporaries;
  1518. *)
  1519. PROCEDURE Statement(x: SyntaxTree.Statement);
  1520. VAR use: VariableUse;
  1521. BEGIN
  1522. temporaries.GetUsage(use);
  1523. position := x.position;
  1524. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1525. IF commentPrintout # NIL THEN
  1526. commentPrintout.Statement(x);
  1527. dump.Ln;
  1528. (*dump.Update;*)
  1529. END;
  1530. VStatement(x);
  1531. (*
  1532. CheckRegistersFree();
  1533. *)
  1534. (*ResetUsedTemporaries(use);*)
  1535. temporaries.SetUsage(use);
  1536. END Statement;
  1537. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1538. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1539. *)
  1540. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1541. BEGIN
  1542. ASSERT(op.mode # IntermediateCode.Undefined);
  1543. IF op.mode = IntermediateCode.ModeMemory THEN
  1544. ReuseCopy(res,op);
  1545. ELSE
  1546. res := op;
  1547. UseIntermediateOperand(res);
  1548. END;
  1549. IntermediateCode.AddOffset(res,offset);
  1550. IntermediateCode.MakeMemory(res,type);
  1551. END MakeMemory;
  1552. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1553. VAR mem: IntermediateCode.Operand;
  1554. BEGIN
  1555. MakeMemory(mem,res,type,offset);
  1556. ReleaseIntermediateOperand(res);
  1557. res := mem;
  1558. END ToMemory;
  1559. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1560. VAR mem: IntermediateCode.Operand;
  1561. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1562. componentType: SyntaxTree.Type;
  1563. BEGIN
  1564. type := type.resolved;
  1565. IF operand.mode = ModeReference THEN
  1566. IF type IS SyntaxTree.RangeType THEN
  1567. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1568. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1569. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1570. ReleaseOperand(operand);
  1571. operand.op := firstOp;
  1572. operand.tag := lastOp;
  1573. operand.extra := stepOp;
  1574. ELSIF type IS SyntaxTree.ComplexType THEN
  1575. componentType := type(SyntaxTree.ComplexType).componentType;
  1576. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1577. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1578. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1579. ReleaseOperand(operand);
  1580. operand.op := firstOp;
  1581. operand.tag := lastOp
  1582. ELSE
  1583. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1584. ReleaseIntermediateOperand(operand.op);
  1585. (* EXPERIMENTAL *)
  1586. IF operand.availability >= 0 THEN
  1587. IF availableSymbols[operand.availability].inRegister THEN
  1588. operand.op := availableSymbols[operand.availability].register;
  1589. UseIntermediateOperand(operand.op);
  1590. ELSE
  1591. availableSymbols[operand.availability].register := NewRegisterOperand(IntermediateCode.GetType(system,type));
  1592. availableSymbols[operand.availability].memory := mem;
  1593. operand.op := availableSymbols[operand.availability].register;
  1594. Emit(Mov(position, operand.op, mem));
  1595. availableSymbols[operand.availability].inRegister := TRUE;
  1596. END;
  1597. ReleaseIntermediateOperand(mem);
  1598. ELSE
  1599. operand.op := mem;
  1600. END;
  1601. END;
  1602. operand.mode := ModeValue;
  1603. END;
  1604. ASSERT(operand.mode = ModeValue);
  1605. END LoadValue;
  1606. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1607. BEGIN
  1608. InitOperand(result, ModeUndefined);
  1609. Expression(x);
  1610. op := result;
  1611. LoadValue(op,x.type.resolved);
  1612. END Evaluate;
  1613. PROCEDURE EvaluateX(x: SyntaxTree.Expression): Operand;
  1614. VAR op: Operand;
  1615. BEGIN
  1616. Evaluate(x, op);
  1617. RETURN op;
  1618. END EvaluateX;
  1619. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1620. BEGIN
  1621. InitOperand(result,ModeUndefined);
  1622. Expression(x);
  1623. op := result;
  1624. END Designate;
  1625. PROCEDURE Condition(CONST x: SyntaxTree.Expression; label: Label; reason: BOOLEAN);
  1626. VAR skip: Label; recordType: SyntaxTree.RecordType; left, right: Operand;
  1627. leftType, rightType: SyntaxTree.Type; temp: IntermediateCode.Operand;
  1628. leftExpression, rightExpression: SyntaxTree.Expression;
  1629. BEGIN
  1630. ASSERT(label # NIL);
  1631. IF (x.resolved # NIL) & (x.resolved # x) THEN Condition(x.resolved, label, reason); RETURN END;
  1632. WITH x:
  1633. SyntaxTree.UnaryExpression DO
  1634. CASE x.operator OF
  1635. Scanner.Not:
  1636. Condition(x.left,label,~reason);
  1637. RETURN;
  1638. ELSE
  1639. END;
  1640. | SyntaxTree.BinaryExpression DO
  1641. leftType := x.left.type.resolved;
  1642. rightType := x.right.type.resolved;
  1643. CASE x.operator OF
  1644. Scanner.Or:
  1645. (* shortcut evaluation of left OR right *)
  1646. IF reason THEN (*left or right*)
  1647. Condition(x.left,label,TRUE);
  1648. Condition(x.right,label,TRUE);
  1649. ELSE (* ~ (left or right) = ~left & ~right *)
  1650. skip := NewLabel();
  1651. Condition(x.left,skip,TRUE);
  1652. Condition(x.right,label,FALSE);
  1653. SetLabel(skip);
  1654. END;
  1655. RETURN;
  1656. |Scanner.And:
  1657. (* shortcut evaluation of left & right *)
  1658. IF reason THEN (* left and right *)
  1659. skip := NewLabel();
  1660. Condition(x.left,skip,FALSE);
  1661. Condition(x.right,label,TRUE);
  1662. SetLabel(skip);
  1663. ELSE (* ~(left and right) = ~left or ~right *)
  1664. Condition(x.left,label,FALSE);
  1665. Condition(x.right,label,FALSE);
  1666. END;
  1667. RETURN;
  1668. |Scanner.Is:
  1669. (* get type desc tag *)
  1670. IF IsPointerToRecord(x.left.type,recordType) THEN
  1671. left := EvaluateX(x.left);
  1672. Dereference(left,recordType,IsUnsafePointer(x.left.type))
  1673. ELSE
  1674. Designate(x.left,left);
  1675. END;
  1676. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,label,reason,FALSE);
  1677. ReleaseOperand(left);
  1678. RETURN;
  1679. |Scanner.Equal:
  1680. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1681. IF reason THEN
  1682. CompareString(BreqL,label,x.left,x.right);
  1683. ELSE
  1684. CompareString(BrneL,label,x.left,x.right);
  1685. END;
  1686. ELSE
  1687. Evaluate(x.left,left);
  1688. Evaluate(x.right,right);
  1689. IF leftType IS SyntaxTree.RangeType THEN
  1690. ASSERT(rightType IS SyntaxTree.RangeType);
  1691. IF reason THEN
  1692. skip := NewLabel();
  1693. BrneL(skip, left.op, right.op); (* first *)
  1694. BrneL(skip, left.tag, right.tag); (* last *)
  1695. BreqL(label, left.extra, right.extra); (* step *)
  1696. SetLabel(skip);
  1697. ELSE
  1698. BrneL(label, left.op, right.op); (* first *)
  1699. BrneL(label, left.tag, right.tag); (* last *)
  1700. BrneL(label, left.extra, right.extra); (* step *)
  1701. END;
  1702. ReleaseOperand(left); ReleaseOperand(right);
  1703. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1704. IF reason THEN
  1705. skip := NewLabel();
  1706. BrneL(skip, left.op, right.op); (* first *)
  1707. BreqL(label, left.tag, right.tag); (* last *)
  1708. SetLabel(skip);
  1709. ELSE
  1710. BrneL(label, left.op, right.op); (* first *)
  1711. BrneL(label, left.tag, right.tag); (* last *)
  1712. END;
  1713. ReleaseOperand(left); ReleaseOperand(right);
  1714. ELSE
  1715. IF reason THEN
  1716. BreqL(label,left.op,right.op);
  1717. ELSE
  1718. BrneL(label,left.op,right.op);
  1719. END;
  1720. ReleaseOperand(left); ReleaseOperand(right);
  1721. END;
  1722. END;
  1723. RETURN;
  1724. |Scanner.LessEqual:
  1725. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1726. IF reason THEN
  1727. CompareString(BrgeL,label,x.right,x.left);
  1728. ELSE
  1729. CompareString(BrltL,label,x.right,x.left);
  1730. END;
  1731. ELSE
  1732. Evaluate(x.left,left);
  1733. Evaluate(x.right,right);
  1734. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  1735. Reuse1(temp,right.op);
  1736. Emit(And(position,temp,left.op,right.op));
  1737. ReleaseOperand(right);
  1738. IF reason THEN
  1739. BreqL(label,temp,left.op);
  1740. ELSE
  1741. BrneL(label,temp,left.op);
  1742. END;
  1743. ReleaseIntermediateOperand(temp);ReleaseOperand(left);
  1744. ELSE
  1745. IF reason THEN
  1746. BrgeL(label,right.op,left.op);
  1747. ELSE
  1748. BrltL(label,right.op,left.op);
  1749. END;
  1750. ReleaseOperand(left); ReleaseOperand(right);
  1751. END;
  1752. END;
  1753. RETURN;
  1754. |Scanner.Less:
  1755. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  1756. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  1757. leftExpression.SetType(system.booleanType);
  1758. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1759. rightExpression.SetType(system.booleanType);
  1760. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1761. leftExpression.SetType(system.booleanType);
  1762. Condition(leftExpression,label,reason);
  1763. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1764. IF reason THEN
  1765. CompareString(BrltL,label,x.left,x.right);
  1766. ELSE
  1767. CompareString(BrgeL,label,x.left,x.right);
  1768. END;
  1769. ELSE
  1770. Evaluate(x.left,left);
  1771. Evaluate(x.right,right);
  1772. IF reason THEN
  1773. BrltL(label,left.op,right.op);
  1774. ELSE
  1775. BrgeL(label,left.op,right.op);
  1776. END;
  1777. ReleaseOperand(left); ReleaseOperand(right);
  1778. END;
  1779. RETURN;
  1780. |Scanner.Greater:
  1781. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  1782. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  1783. leftExpression.SetType(system.booleanType);
  1784. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1785. rightExpression.SetType(system.booleanType);
  1786. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1787. leftExpression.SetType(system.booleanType);
  1788. Condition(leftExpression,label,reason);
  1789. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1790. IF reason THEN
  1791. CompareString(BrltL,label,x.right,x.left);
  1792. ELSE
  1793. CompareString(BrgeL,label,x.right,x.left);
  1794. END;
  1795. ELSE
  1796. Evaluate(x.left,left);
  1797. Evaluate(x.right,right);
  1798. IF reason THEN
  1799. BrltL(label, right.op,left.op);
  1800. ELSE
  1801. BrgeL(label, right.op,left.op);
  1802. END;
  1803. ReleaseOperand(left); ReleaseOperand(right);
  1804. END;
  1805. RETURN;
  1806. |Scanner.GreaterEqual:
  1807. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1808. IF reason THEN
  1809. CompareString(BrgeL,label,x.left,x.right);
  1810. ELSE
  1811. CompareString(BrltL,label,x.left,x.right);
  1812. END;
  1813. ELSE
  1814. Evaluate(x.left,left);
  1815. Evaluate(x.right,right);
  1816. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  1817. Reuse1(temp,left.op);
  1818. Emit(And(position,temp,left.op,right.op));
  1819. ReleaseOperand(left);
  1820. IF reason THEN
  1821. BreqL(label, temp, right.op);
  1822. ELSE
  1823. BrneL(label, temp, right.op);
  1824. END;
  1825. ReleaseIntermediateOperand(temp); ReleaseOperand(right);
  1826. ELSE
  1827. IF reason THEN
  1828. BrgeL(label,left.op,right.op);
  1829. ELSE
  1830. BrltL(label, left.op,right.op);
  1831. END;
  1832. ReleaseOperand(left); ReleaseOperand(right);
  1833. END;
  1834. END;
  1835. RETURN;
  1836. |Scanner.Unequal:
  1837. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1838. IF reason THEN
  1839. CompareString(BrneL,label,x.left,x.right);
  1840. ELSE
  1841. CompareString(BreqL,label,x.left,x.right);
  1842. END
  1843. ELSE
  1844. Evaluate(x.left,left);
  1845. Evaluate(x.right,right);
  1846. IF leftType IS SyntaxTree.RangeType THEN
  1847. ASSERT(rightType IS SyntaxTree.RangeType);
  1848. IF ~reason THEN
  1849. skip := NewLabel();
  1850. BrneL(skip, left.op, right.op); (* first *)
  1851. BrneL(skip, left.tag, right.tag); (* last *)
  1852. BreqL(label, left.extra, right.extra); (* step *)
  1853. SetLabel(skip);
  1854. ELSE
  1855. BrneL(label, left.op, right.op); (* first *)
  1856. BrneL(label, left.tag, right.tag); (* last *)
  1857. BrneL(label, left.extra, right.extra); (* step *)
  1858. END;
  1859. ReleaseOperand(left); ReleaseOperand(right);
  1860. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1861. IF reason THEN
  1862. BrneL(label, left.op, right.op);
  1863. BrneL(label, left.tag, right.tag);
  1864. ELSE
  1865. skip := NewLabel();
  1866. BrneL(skip, left.op, right.op);
  1867. BreqL(label, left.tag, right.tag);
  1868. SetLabel(skip);
  1869. END;
  1870. ReleaseOperand(left); ReleaseOperand(right);
  1871. ELSE
  1872. IF reason THEN
  1873. BrneL(label,left.op,right.op);
  1874. ELSE
  1875. BreqL(label,left.op,right.op);
  1876. END;
  1877. ReleaseOperand(left); ReleaseOperand(right);
  1878. END;
  1879. END;
  1880. RETURN;
  1881. ELSE (* case *)
  1882. END;
  1883. |SyntaxTree.BooleanValue DO
  1884. IF reason = x.value THEN BrL(label) END;
  1885. RETURN;
  1886. ELSE (* with *)
  1887. END;
  1888. (* default case: evaluate and compare result *)
  1889. left := EvaluateX(x);
  1890. IF reason THEN
  1891. BrneL(label,left.op, false);
  1892. ELSE
  1893. BreqL(label,left.op, false);
  1894. END;
  1895. ReleaseOperand(left);
  1896. END Condition;
  1897. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1898. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1899. BEGIN
  1900. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1901. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1902. RETURN op
  1903. END NewRegisterOperand;
  1904. PROCEDURE UnuseRegister(register: LONGINT);
  1905. BEGIN
  1906. IF (register > 0) THEN
  1907. register := registerUsageCount.Map(register);
  1908. registerUsageCount.DecUse(register);
  1909. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1910. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1911. END;
  1912. IF registerUsageCount.Use(register)=0 THEN
  1913. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1914. Warning(position, "register cannot be removed");
  1915. END;
  1916. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1917. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1918. END;
  1919. ELSIF registerUsageCount.Use(register)<0 THEN
  1920. Warning(position, "register removed too often");
  1921. IF dump # NIL THEN
  1922. dump.String("register removed too often"); dump.Ln; dump.Update;
  1923. END;
  1924. END;
  1925. END;
  1926. END UnuseRegister;
  1927. PROCEDURE UseRegister(register: LONGINT);
  1928. BEGIN
  1929. IF (register > 0) THEN
  1930. register := registerUsageCount.Map(register);
  1931. registerUsageCount.IncUse(register);
  1932. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1933. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1934. END;
  1935. IF registerUsageCount.Use(register)=1 THEN
  1936. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1937. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1938. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1939. END;
  1940. END;
  1941. END;
  1942. END UseRegister;
  1943. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1944. BEGIN
  1945. UnuseRegister(op.register)
  1946. END ReleaseIntermediateOperand;
  1947. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1948. BEGIN
  1949. UseRegister(op.register)
  1950. END UseIntermediateOperand;
  1951. PROCEDURE ReleaseOperand(CONST op: Operand);
  1952. BEGIN
  1953. UnuseRegister(op.op.register);
  1954. UnuseRegister(op.tag.register);
  1955. UnuseRegister(op.extra.register);
  1956. END ReleaseOperand;
  1957. (* save registers marked in array "markedRegisters" to the stack
  1958. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1959. *)
  1960. PROCEDURE SaveRegisters();
  1961. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1962. BEGIN
  1963. entry := usedRegisters;
  1964. WHILE entry # NIL DO
  1965. type := registerUsageCount.used[entry.register].type;
  1966. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1967. Emit(Push(position,op));
  1968. entry := entry.next;
  1969. END;
  1970. END SaveRegisters;
  1971. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1972. BEGIN
  1973. saved := usedRegisters;
  1974. usedRegisters := NIL;
  1975. END ReleaseUsedRegisters;
  1976. (** remove parameter registers from used queue *)
  1977. PROCEDURE ReleaseParameterRegisters;
  1978. VAR entry,prev,next: RegisterEntry;
  1979. BEGIN
  1980. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1981. WHILE entry # NIL DO
  1982. next := entry.next;
  1983. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1984. registerUsageCount.DecUse(entry.register);
  1985. ASSERT(registerUsageCount.Use(entry.register)=0);
  1986. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1987. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1988. END;
  1989. ELSIF prev = NIL THEN
  1990. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1991. ELSE
  1992. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1993. END;
  1994. entry := next;
  1995. END;
  1996. END ReleaseParameterRegisters;
  1997. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1998. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1999. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2000. BEGIN
  2001. entry := saved;
  2002. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2003. entry := prev;
  2004. WHILE entry # NIL DO
  2005. prev := entry.prev;
  2006. type := entry.type;
  2007. class := entry.registerClass;
  2008. IntermediateCode.InitRegister(op,type,class,entry.register);
  2009. Emit(Pop(position,op));
  2010. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2011. entry := prev;
  2012. END;
  2013. END RestoreRegisters;
  2014. (* re-enter registers from array saved into array markedRegisters (recursion possible) *)
  2015. PROCEDURE RestoreRegisterUse(CONST saved: RegisterEntry);
  2016. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2017. BEGIN
  2018. entry := saved;
  2019. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2020. entry := prev;
  2021. WHILE entry # NIL DO
  2022. prev := entry.prev;
  2023. type := entry.type;
  2024. class := entry.registerClass;
  2025. IntermediateCode.InitRegister(op,type,class,entry.register);
  2026. Emit(Mov(position,op,op));
  2027. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2028. entry := prev;
  2029. END;
  2030. END RestoreRegisterUse;
  2031. PROCEDURE CheckRegistersFree;
  2032. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  2033. BEGIN
  2034. IF usedRegisters # NIL THEN
  2035. r := usedRegisters;
  2036. WHILE r # NIL DO
  2037. warning := "register ";
  2038. Strings.AppendInt(warning, r.register);
  2039. Strings.Append(warning, " not released.");
  2040. Warning(position,warning);
  2041. r := r .next;
  2042. END;
  2043. END;
  2044. FOR i := 0 TO registerUsageCount.count-1 DO
  2045. IF registerUsageCount.used[i].count < 0 THEN
  2046. warning := "register ";
  2047. Strings.AppendInt(warning, i);
  2048. Strings.Append(warning, " unused too often.");
  2049. Warning(position,warning);
  2050. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  2051. warning := "register ";
  2052. Strings.AppendInt(warning, i);
  2053. Strings.Append(warning, " not unused often enough.");
  2054. Warning(position,warning);
  2055. END;
  2056. END;
  2057. END CheckRegistersFree;
  2058. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2059. Otherwise allocate a new register.
  2060. Does NOT necessarily keep the content of src1 or src2 in result! *)
  2061. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  2062. BEGIN
  2063. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2064. UseIntermediateOperand(result);
  2065. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2066. UseIntermediateOperand(result);
  2067. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  2068. END;
  2069. END Reuse2;
  2070. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2071. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  2072. If not then allocate a new register.
  2073. Does NOT necessarily keep the content of src1 or src2 in result!
  2074. *)
  2075. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2076. BEGIN
  2077. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2078. UseIntermediateOperand(result);
  2079. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2080. UseIntermediateOperand(result);
  2081. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  2082. result := alternative; alternative := emptyOperand;
  2083. UseIntermediateOperand(result);
  2084. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2085. END;
  2086. END Reuse2a;
  2087. (* like reuse2 but only one source *)
  2088. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2089. BEGIN
  2090. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2091. UseIntermediateOperand(result);
  2092. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2093. END;
  2094. END Reuse1;
  2095. (* like reuse2a but only one source *)
  2096. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2097. BEGIN
  2098. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2099. UseIntermediateOperand(result);
  2100. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  2101. UseIntermediateOperand(result);
  2102. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2103. END;
  2104. END Reuse1a;
  2105. (* like reuse1 but guarantees that content of src1 is in result *)
  2106. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2107. BEGIN
  2108. IF ReusableRegister(src1) THEN
  2109. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2110. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  2111. UseIntermediateOperand(result);
  2112. ELSE
  2113. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2114. Emit(Mov(position,result,src1));
  2115. END
  2116. END ReuseCopy;
  2117. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  2118. BEGIN
  2119. IF ReusableRegister(src) THEN
  2120. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  2121. ELSE
  2122. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  2123. Emit(Mov(position,result,src));
  2124. ReleaseIntermediateOperand(src);
  2125. END
  2126. END TransferToRegister;
  2127. (** labels and branches **)
  2128. PROCEDURE NewLabel(): Label;
  2129. VAR label: Label;
  2130. BEGIN
  2131. NEW(label,section); RETURN label;
  2132. END NewLabel;
  2133. (* EXPERIMENTAL *)
  2134. PROCEDURE EndBasicBlock;
  2135. VAR i: LONGINT;
  2136. BEGIN
  2137. i := 0;
  2138. WHILE (availableSymbols[i].symbol # NIL) DO
  2139. IF ~availableSymbols[i].inMemory & availableSymbols[i].inRegister THEN
  2140. Emit(Mov(position,availableSymbols[i].memory, availableSymbols[i].register));
  2141. END;
  2142. availableSymbols[i].symbol := NIL;
  2143. INC(i);
  2144. END;
  2145. END EndBasicBlock;
  2146. (* EXPERIMENTAL *)
  2147. PROCEDURE BeginBasicBlock;
  2148. BEGIN
  2149. ASSERT(availableSymbols[0].symbol = NIL);
  2150. END BeginBasicBlock;
  2151. PROCEDURE SetLabel(label: Label);
  2152. BEGIN
  2153. (* EXPERIMENTAL *)
  2154. EndBasicBlock;
  2155. BeginBasicBlock;
  2156. label.Resolve(section.pc);
  2157. END SetLabel;
  2158. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  2159. BEGIN
  2160. ASSERT(label # NIL);
  2161. IF label.pc < 0 THEN (* label not yet set *)
  2162. label.AddFixup(section.pc);
  2163. END;
  2164. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  2165. END LabelOperand;
  2166. PROCEDURE BrL(label: Label);
  2167. BEGIN
  2168. (* EXPERIMENTAL *)
  2169. EndBasicBlock;
  2170. Emit(Br(position,LabelOperand(label)));
  2171. END BrL;
  2172. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  2173. BEGIN
  2174. Emit(Brge(position,LabelOperand(label),left,right));
  2175. END BrgeL;
  2176. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  2177. BEGIN
  2178. Emit(Brlt(position,LabelOperand(label),left,right));
  2179. END BrltL;
  2180. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  2181. BEGIN
  2182. Emit(Breq(position,LabelOperand(label),left,right));
  2183. END BreqL;
  2184. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  2185. BEGIN
  2186. Emit(Brne(position,LabelOperand(label),left,right));
  2187. END BrneL;
  2188. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  2189. VAR new: IntermediateCode.Operand;
  2190. BEGIN
  2191. IF Trace THEN TraceEnter("Convert") END;
  2192. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  2193. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  2194. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  2195. & (operand.offset = 0)
  2196. THEN
  2197. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  2198. Emit(Conv(position,new,operand));
  2199. ELSE
  2200. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2201. Emit(Conv(position,new,operand));
  2202. ReleaseIntermediateOperand(operand);
  2203. END;
  2204. operand := new;
  2205. 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
  2206. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  2207. ELSE
  2208. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2209. Emit(Conv(position,new,operand));
  2210. ReleaseIntermediateOperand(operand);
  2211. operand := new;
  2212. END;
  2213. IF Trace THEN TraceExit("Convert") END;
  2214. END Convert;
  2215. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  2216. VAR exit: Label;
  2217. BEGIN
  2218. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  2219. exit := NewLabel();
  2220. br(exit,left,right);
  2221. EmitTrap(position,trapNo);
  2222. SetLabel(exit);
  2223. END TrapC;
  2224. (** expressions *)
  2225. (** emit necessary runtime check for set elements **)
  2226. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  2227. VAR max: IntermediateCode.Operand;
  2228. BEGIN
  2229. IF isUnchecked THEN RETURN END;
  2230. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  2231. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  2232. TrapC(BrgeL, max, o, SetElementTrap);
  2233. END;
  2234. END CheckSetElement;
  2235. (** the set that a range represents **)
  2236. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  2237. VAR
  2238. operand: Operand;
  2239. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  2240. BEGIN
  2241. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  2242. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  2243. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  2244. one := IntermediateCode.Immediate(setType, 1);
  2245. Evaluate(x, operand);
  2246. Convert(operand.op, setType);
  2247. Convert(operand.tag, setType);
  2248. CheckSetElement(operand.op);
  2249. CheckSetElement(operand.tag);
  2250. (* create mask for lower bound
  2251. i.e. shift 11111111 to the left by the value of the lower bound
  2252. *)
  2253. Reuse1(temp, operand.op);
  2254. Emit(Shl(position,temp, allBits, operand.op));
  2255. ReleaseIntermediateOperand(operand.op);
  2256. operand.op := temp;
  2257. (* create mask for upper bound
  2258. i.e. shift 11111111 to the right by the difference between the
  2259. upper bound and the maximum number of set elements
  2260. *)
  2261. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2262. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2263. Reuse1(temp, operand.tag);
  2264. ELSE
  2265. Reuse1(temp, operand.tag);
  2266. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2267. Emit(Sub(position,temp, size, operand.tag));
  2268. END;
  2269. Emit(Shr(position,temp, allBits, operand.tag));
  2270. ReleaseIntermediateOperand(operand.tag);
  2271. operand.tag := temp;
  2272. Reuse2(resultingSet, operand.op, operand.tag);
  2273. (* intersect the two masks *)
  2274. Emit(And(position,resultingSet, operand.op, operand.tag));
  2275. ReleaseOperand(operand);
  2276. RETURN resultingSet
  2277. END SetFromRange;
  2278. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2279. VAR
  2280. res, operand: Operand;
  2281. temp, one, noBits, dest: IntermediateCode.Operand;
  2282. expression: SyntaxTree.Expression;
  2283. i: LONGINT;
  2284. BEGIN
  2285. IF Trace THEN TraceEnter("VisitSet") END;
  2286. dest := destination;
  2287. destination := emptyOperand;
  2288. noBits := IntermediateCode.Immediate(setType, 0);
  2289. one := IntermediateCode.Immediate(setType, 1);
  2290. (* start off with the empty set *)
  2291. InitOperand(res, ModeValue);
  2292. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2293. Emit(Mov(position,res.op, noBits));
  2294. FOR i := 0 TO x.elements.Length() - 1 DO
  2295. expression := x.elements.GetExpression(i);
  2296. IF expression IS SyntaxTree.RangeExpression THEN
  2297. (* range of set elements *)
  2298. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2299. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2300. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2301. ReleaseIntermediateOperand(temp)
  2302. ELSE
  2303. (* singelton element *)
  2304. Evaluate(expression, operand);
  2305. Convert(operand.op, setType);
  2306. CheckSetElement(operand.op);
  2307. (* create subset containing single element *)
  2308. Reuse1(temp, operand.op);
  2309. Emit(Shl(position,temp, one, operand.op));
  2310. ReleaseOperand(operand);
  2311. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2312. ReleaseIntermediateOperand(temp);
  2313. END
  2314. END;
  2315. result := res;
  2316. destination := dest;
  2317. IF Trace THEN TraceExit("VisitSet") END;
  2318. END VisitSet;
  2319. (* math arrays of the form [a,b,c]
  2320. x is a static array and thus does not provide any pointers
  2321. *)
  2322. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2323. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2324. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2325. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2326. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2327. element: SyntaxTree.IntegerValue;
  2328. BEGIN
  2329. numberElements := x.elements.Length();
  2330. expression := index.parameters.GetExpression(dim);
  2331. element := expression(SyntaxTree.IntegerValue);
  2332. FOR i := 0 TO numberElements-1 DO
  2333. expression := x.elements.GetExpression(i);
  2334. element.SetValue(i);
  2335. IF expression IS SyntaxTree.MathArrayExpression THEN
  2336. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2337. ELSE
  2338. Assign(index,expression);
  2339. END;
  2340. END;
  2341. END RecursiveAssignment;
  2342. PROCEDURE Dimension(): LONGINT;
  2343. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2344. BEGIN
  2345. dim := 0;
  2346. expression := x;
  2347. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2348. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2349. INC(dim);
  2350. END;
  2351. RETURN dim;
  2352. END Dimension;
  2353. BEGIN
  2354. (*static math array not providing pointers anyway *)
  2355. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2356. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2357. designator.SetType(variable.type);
  2358. dim := Dimension();
  2359. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2360. FOR i := 0 TO dim-1 DO
  2361. element := SyntaxTree.NewIntegerValue(x.position,0);
  2362. element.SetType(system.longintType);
  2363. index.parameters.AddExpression(element);
  2364. END;
  2365. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2366. RecursiveAssignment(x,0);
  2367. Expression(designator);
  2368. END VisitMathArrayExpression;
  2369. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2370. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2371. BEGIN
  2372. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2373. dest := destination; destination := emptyOperand;
  2374. IF x.operator = Scanner.Not THEN
  2375. Evaluate(x.left,operand);
  2376. InitOperand(result,ModeValue);
  2377. Reuse1a(result.op,operand.op,dest);
  2378. Emit(Xor(position,result.op,operand.op,true));
  2379. ReleaseOperand(operand);
  2380. ELSIF x.operator = Scanner.Minus THEN
  2381. Evaluate(x.left,operand);
  2382. InitOperand(result,ModeValue);
  2383. Reuse1a(result.op,operand.op,dest);
  2384. type := x.left.type.resolved;
  2385. IF type IS SyntaxTree.SetType THEN
  2386. Emit(Not(position,result.op,operand.op));
  2387. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2388. Reuse1(result.tag,operand.tag);
  2389. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2390. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2391. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2392. Emit(Neg(position,result.op,operand.op));
  2393. ELSE HALT(200)
  2394. END;
  2395. ReleaseOperand(operand);
  2396. ELSIF x.operator = Scanner.Address THEN
  2397. Designate(x.left,operand);
  2398. operand.mode := ModeValue;
  2399. t0 := x.left.type.resolved;
  2400. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2401. ReleaseIntermediateOperand(operand.op);
  2402. operand.op := operand.tag;
  2403. IntermediateCode.InitOperand(operand.tag);
  2404. END;
  2405. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2406. result := operand;
  2407. ELSE HALT(100)
  2408. END;
  2409. destination := dest;
  2410. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2411. END VisitUnaryExpression;
  2412. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2413. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; label: Label; reason: BOOLEAN; withPart: BOOLEAN);
  2414. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL,skip: Label; originalType: SyntaxTree.Type;
  2415. BEGIN
  2416. type := type.resolved;
  2417. originalType := type;
  2418. IF type IS SyntaxTree.PointerType THEN
  2419. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2420. END;
  2421. IF (type IS SyntaxTree.ObjectType) & reason THEN
  2422. BrL(label);
  2423. ELSE
  2424. ASSERT(type IS SyntaxTree.RecordType);
  2425. (*
  2426. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2427. *)
  2428. IF withPart THEN
  2429. left := tag;
  2430. ELSE
  2431. ReuseCopy(left,tag);
  2432. END;
  2433. right := TypeDescriptorAdr(type);
  2434. IF backend.cooperative THEN
  2435. repeatL := NewLabel();
  2436. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2437. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2438. END;
  2439. SetLabel(repeatL);
  2440. IF reason THEN
  2441. BreqL(label,left,right);
  2442. ELSE
  2443. skip := NewLabel();
  2444. BreqL(skip,left,right);
  2445. END;
  2446. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2447. BrneL(repeatL,left,nil);
  2448. IF ~reason THEN
  2449. BrL(label);
  2450. SetLabel(skip);
  2451. END;
  2452. ELSIF meta.simple THEN
  2453. level := type(SyntaxTree.RecordType).Level();
  2454. (* get type desc tag of level relative to base tag *)
  2455. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2456. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2457. IntermediateCode.MakeMemory(left,addressType);
  2458. IF reason THEN
  2459. BreqL(label,left,right);
  2460. ELSE
  2461. BrneL(label,left,right);
  2462. END;
  2463. ELSE
  2464. level := type(SyntaxTree.RecordType).Level();
  2465. (* get type desc tag of level relative to base tag *)
  2466. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2467. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2468. IntermediateCode.MakeMemory(left,addressType);
  2469. IF reason THEN
  2470. BreqL(label,left,right);
  2471. ELSE
  2472. BrneL(label,left,right);
  2473. END;
  2474. END;
  2475. IF ~withPart THEN
  2476. ReleaseIntermediateOperand(left);
  2477. END;
  2478. ReleaseIntermediateOperand(right);
  2479. END;
  2480. END TypeTest;
  2481. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2482. BEGIN
  2483. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2484. IF dump # NIL THEN
  2485. dump.String(s); dump.Ln;
  2486. END;
  2487. END Error;
  2488. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2489. BEGIN
  2490. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2491. IF dump # NIL THEN
  2492. dump.String(s); dump.Ln; dump.Update;
  2493. END;
  2494. END Warning;
  2495. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2496. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2497. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2498. operand:Operand;
  2499. BEGIN
  2500. previousSection := section;
  2501. Global.GetModuleName(mod,name);
  2502. Strings.Append(name,".@Trace");
  2503. Basic.ToSegmentedName(name, pooledName);
  2504. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2505. IF dump # NIL THEN dump := section.comments END;
  2506. IF backend.hasLinkRegister THEN
  2507. Emit(Push(Basic.invalidPosition, lr));
  2508. END;
  2509. variable := mod.moduleScope.firstVariable;
  2510. WHILE variable # NIL DO
  2511. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2512. Symbol(variable, operand);
  2513. register := operand.op;
  2514. CallTraceMethod(register, variable.type);
  2515. ReleaseIntermediateOperand(register);
  2516. END;
  2517. variable := variable.nextVariable;
  2518. END;
  2519. IF backend.hasLinkRegister THEN
  2520. Emit(Pop(Basic.invalidPosition, lr));
  2521. END;
  2522. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2523. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2524. Emit(Br(position,op));
  2525. INC(statCoopTraceModule, section.pc);
  2526. section := previousSection;
  2527. IF dump # NIL THEN dump := section.comments END;
  2528. END CreateTraceModuleMethod;
  2529. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2530. BEGIN
  2531. Emit (Push(position, dst));
  2532. Emit (Push(position, src));
  2533. CallThis(position,"GarbageCollector","Assign", 2);
  2534. END CallAssignPointer;
  2535. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2536. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2537. BEGIN
  2538. IF SemanticChecker.IsPointerType (type) THEN
  2539. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2540. ELSIF type.IsRecordType() THEN
  2541. Emit (Push(position,dst));
  2542. Emit (Push(position,src));
  2543. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2544. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2545. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2546. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2547. ELSIF IsStaticArray(type) THEN
  2548. size := StaticArrayNumElements(type);
  2549. base := StaticArrayBaseType(type);
  2550. IF base.IsRecordType() THEN
  2551. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2552. Emit (Push(position, dst));
  2553. Emit (Push(position, src));
  2554. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2555. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2556. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2557. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2558. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2559. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2560. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2561. Emit (Push(position, dst));
  2562. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2563. Emit (Push(position, src));
  2564. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2565. ELSE
  2566. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2567. Emit (Push(position, dst));
  2568. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2569. Emit (Push(position, src));
  2570. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2571. ASSERT(StaticArrayBaseType(type).IsPointer());
  2572. END;
  2573. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2574. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2575. Emit (Push(position, dst));
  2576. Emit (Push(position, src));
  2577. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2578. ELSE HALT(100); (* missing ? *)
  2579. END;
  2580. END CallAssignMethod;
  2581. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2582. VAR name: Basic.SegmentedName;
  2583. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2584. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2585. context: Context;
  2586. BEGIN
  2587. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2588. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2589. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2590. GetRecordTypeName (recordType,name);
  2591. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2592. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2593. section.SetExported (TRUE);
  2594. IF dump # NIL THEN dump := section.comments END;
  2595. IF backend.hasLinkRegister THEN
  2596. Emit(Push(Basic.invalidPosition, lr));
  2597. END;
  2598. variable := recordType.recordScope.firstVariable;
  2599. WHILE variable # NIL DO
  2600. IF variable.NeedsTrace() THEN
  2601. dst := NewRegisterOperand (addressType);
  2602. src := NewRegisterOperand (addressType);
  2603. Emit (Mov(position, dst, parameter1));
  2604. Emit (Mov(position, src, parameter2));
  2605. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2606. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2607. CallAssignMethod(dst, src, variable.type);
  2608. ReleaseIntermediateOperand(src);
  2609. ReleaseIntermediateOperand(dst);
  2610. END;
  2611. variable := variable.nextVariable;
  2612. END;
  2613. recordBase := recordType.GetBaseRecord();
  2614. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2615. IF backend.hasLinkRegister THEN
  2616. Emit(Pop(Basic.invalidPosition, lr));
  2617. END;
  2618. GetRecordTypeName (recordBase,name);
  2619. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2620. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2621. Emit(Br(position,op));
  2622. ELSE
  2623. Emit(Exit(position,0,0, 0));
  2624. END;
  2625. IF ~recordType.isObject THEN
  2626. GetRecordTypeName (recordType,name);
  2627. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2628. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2629. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2630. section.SetExported (TRUE);
  2631. NEW(registerUsageCount);
  2632. usedRegisters := NIL;
  2633. dst := NewRegisterOperand (addressType);
  2634. src := NewRegisterOperand (addressType);
  2635. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2636. Emit(Mov(position, dst, parameter1));
  2637. Emit(Mov(position, src, parameter2));
  2638. label := NewLabel();
  2639. SetLabel(label);
  2640. Emit(Push(position, dst));
  2641. Emit(Push(position, src));
  2642. GetRecordTypeName (recordType,name);
  2643. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2644. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2645. Emit(Call(position, op, 0));
  2646. Emit(Pop(position, src));
  2647. Emit(Pop(position, dst));
  2648. Emit(Add(position, dst, dst, ofs));
  2649. Emit(Add(position, src, src, ofs));
  2650. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2651. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2652. Emit(Exit(position,0,0, 0));
  2653. END;
  2654. INC(statCoopAssignProcedure, section.pc);
  2655. ReturnToContext(context);
  2656. IF dump # NIL THEN dump := section.comments END;
  2657. END CreateAssignProcedure;
  2658. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2659. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2660. BEGIN
  2661. IF IsUnsafePointer (type) THEN
  2662. skip := NewLabel();
  2663. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2664. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2665. BreqL (skip, op, nil);
  2666. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2667. SetLabel (skip);
  2668. ELSIF SemanticChecker.IsPointerType (type) THEN
  2669. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2670. CallThis(position,"GarbageCollector","Mark", 1);
  2671. ELSIF type.IsRecordType() THEN
  2672. Emit (Push(position,register));
  2673. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2674. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2675. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2676. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2677. ELSIF IsStaticArray(type) THEN
  2678. size := StaticArrayNumElements(type);
  2679. base := StaticArrayBaseType(type);
  2680. IF base.IsRecordType() THEN
  2681. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2682. Emit (Push(position, register));
  2683. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2684. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2685. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2686. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2687. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2688. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2689. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2690. Emit (Push(position, register));
  2691. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2692. ELSE
  2693. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2694. Emit (Push(position, register));
  2695. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2696. ASSERT(base.IsPointer());
  2697. END;
  2698. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2699. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2700. CallThis(position,"GarbageCollector","Mark", 1);
  2701. ELSE HALT(100); (* missing ? *)
  2702. END;
  2703. END CallTraceMethod;
  2704. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2705. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2706. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2707. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2708. BEGIN
  2709. previousSection := section;
  2710. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2711. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2712. GetRecordTypeName (recordType,name);
  2713. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2714. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2715. section.SetExported (TRUE);
  2716. IF dump # NIL THEN dump := section.comments END;
  2717. IF backend.hasLinkRegister THEN
  2718. Emit(Push(Basic.invalidPosition, lr));
  2719. END;
  2720. variable := recordType.recordScope.firstVariable;
  2721. WHILE variable # NIL DO
  2722. IF variable.NeedsTrace() THEN
  2723. register := NewRegisterOperand (addressType);
  2724. Emit (Mov(position,register,parameter1));
  2725. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2726. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2727. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2728. END;
  2729. CallTraceMethod(register, variable.type);
  2730. ReleaseIntermediateOperand(register);
  2731. END;
  2732. variable := variable.nextVariable;
  2733. END;
  2734. recordBase := recordType.GetBaseRecord();
  2735. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2736. recordBase := recordBase.GetBaseRecord();
  2737. END;
  2738. IF recordBase # NIL THEN
  2739. IF backend.hasLinkRegister THEN
  2740. Emit(Pop(Basic.invalidPosition, lr));
  2741. END;
  2742. GetRecordTypeName (recordBase,name);
  2743. IF HasExplicitTraceMethod (recordBase) THEN
  2744. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2745. ELSE
  2746. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2747. END;
  2748. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2749. Emit(Br(position,op));
  2750. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2751. Emit(Exit(position,0,0,0));
  2752. ELSE
  2753. IF backend.hasLinkRegister THEN
  2754. Emit(Pop(Basic.invalidPosition, lr));
  2755. END;
  2756. IF recordType.isObject THEN
  2757. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2758. ELSE
  2759. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2760. END;
  2761. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2762. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2763. Emit(Br(position,op));
  2764. END;
  2765. IF ~recordType.isObject THEN
  2766. GetRecordTypeName (recordType,name);
  2767. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2768. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2769. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2770. section.SetExported (TRUE);
  2771. NEW(registerUsageCount);
  2772. usedRegisters := NIL;
  2773. IF dump # NIL THEN dump := section.comments END;
  2774. register := NewRegisterOperand (addressType);
  2775. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2776. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2777. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2778. END;
  2779. Emit (Push(position,register));
  2780. GetRecordTypeName (recordType,name);
  2781. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2782. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2783. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2784. ReleaseIntermediateOperand(register);
  2785. Emit(Exit(position,0,0,0));
  2786. GetRecordTypeName (recordType,name);
  2787. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2788. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2789. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2790. section.SetExported (TRUE);
  2791. NEW(registerUsageCount);
  2792. usedRegisters := NIL;
  2793. register := NewRegisterOperand (addressType);
  2794. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2795. Emit(Mov(position, register, parameter1));
  2796. label := NewLabel();
  2797. SetLabel(label);
  2798. Emit(Push(position, register));
  2799. GetRecordTypeName (recordType,name);
  2800. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2801. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2802. Emit(Call(position, op, 0));
  2803. Emit(Pop(position, register));
  2804. Emit(Add(position, register, register, ofs));
  2805. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2806. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2807. Emit(Exit(position,0,0,0));
  2808. END;
  2809. INC(statCoopTraceMethod, section.pc);
  2810. ReturnToContext(context);
  2811. IF dump # NIL THEN dump := section.comments END;
  2812. END CreateTraceMethod;
  2813. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2814. VAR name: Basic.SegmentedName;
  2815. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2816. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2817. context: Context;
  2818. BEGIN
  2819. IF recordType.isObject THEN RETURN END;
  2820. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2821. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2822. GetRecordTypeName (recordType,name);
  2823. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2824. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2825. section.SetExported (TRUE);
  2826. IF dump # NIL THEN dump := section.comments END;
  2827. IF backend.hasLinkRegister THEN
  2828. Emit(Push(Basic.invalidPosition, lr));
  2829. END;
  2830. variable := recordType.recordScope.firstVariable;
  2831. WHILE variable # NIL DO
  2832. IF variable.NeedsTrace() THEN
  2833. dst := NewRegisterOperand (addressType);
  2834. Emit (Mov(position, dst, parameter1));
  2835. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2836. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2837. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2838. END;
  2839. CallResetProcedure(dst, nil, variable.type);
  2840. ReleaseIntermediateOperand(dst);
  2841. END;
  2842. variable := variable.nextVariable;
  2843. END;
  2844. recordBase := recordType.GetBaseRecord();
  2845. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2846. IF backend.hasLinkRegister THEN
  2847. Emit(Pop(Basic.invalidPosition, lr));
  2848. END;
  2849. GetRecordTypeName (recordBase,name);
  2850. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2851. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2852. Emit(Br(position,op));
  2853. ELSE
  2854. Emit(Exit(position,0,0, 0));
  2855. END;
  2856. GetRecordTypeName (recordType,name);
  2857. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2858. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2859. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2860. section.SetExported (TRUE);
  2861. NEW(registerUsageCount);
  2862. usedRegisters := NIL;
  2863. dst := NewRegisterOperand (addressType);
  2864. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2865. Emit(Mov(position, dst, parameter1));
  2866. label := NewLabel();
  2867. SetLabel(label);
  2868. Emit(Push(position, dst));
  2869. GetRecordTypeName (recordType,name);
  2870. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2871. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2872. Emit(Call(position, op, 0));
  2873. Emit(Pop(position, dst));
  2874. Emit(Add(position, dst, dst, ofs));
  2875. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2876. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2877. Emit(Exit(position,0,0, 0));
  2878. INC(statCoopResetProcedure, section.pc);
  2879. ReturnToContext(context);
  2880. IF dump # NIL THEN dump := section.comments END;
  2881. END CreateResetProcedure;
  2882. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2883. VAR name: Basic.SegmentedName; context: Context;
  2884. BEGIN
  2885. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2886. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2887. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2888. IF dump # NIL THEN dump := section.comments END;
  2889. IF backend.hasLinkRegister THEN
  2890. Emit(Push(Basic.invalidPosition, lr));
  2891. END;
  2892. Emit(Push(position,fp));
  2893. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2894. ResetVariables(scope);
  2895. Emit(Pop(position,fp));
  2896. Emit(Exit(position,0,0, 0));
  2897. ReturnToContext(context);
  2898. IF dump # NIL THEN dump := section.comments END;
  2899. END CreateResetMethod;
  2900. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2901. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2902. BEGIN
  2903. IF SemanticChecker.IsPointerType (type) THEN
  2904. Emit (Push(position, dest));
  2905. CallThis(position,"GarbageCollector","Reset", 1);
  2906. ELSIF type.IsRecordType() THEN
  2907. Emit (Push(position, dest));
  2908. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2909. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2910. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2911. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2912. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2913. size := GetArrayLength(type, tag);
  2914. base := ArrayBaseType(type);
  2915. IF base.IsRecordType() THEN
  2916. Emit (Push(position, size));
  2917. Emit (Push(position, dest));
  2918. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2919. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2920. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2921. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2922. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2923. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2924. Emit (Push(position, size));
  2925. Emit (Push(position, dest));
  2926. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2927. ELSE
  2928. Emit (Push(position, size));
  2929. Emit (Push(position, dest));
  2930. CallThis(position,"GarbageCollector","ResetArray", 2);
  2931. ASSERT(ArrayBaseType(type).IsPointer());
  2932. END;
  2933. ReleaseIntermediateOperand(size);
  2934. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2935. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2936. Emit (Push(position, dest));
  2937. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2938. ELSE HALT(100); (* missing ? *)
  2939. END;
  2940. END CallResetProcedure;
  2941. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2942. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; prevOffset: SIZE; pc: LONGINT;
  2943. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2944. VAR operand: Operand;
  2945. BEGIN
  2946. Symbol (symbol, operand);
  2947. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2948. ReleaseOperand(operand);
  2949. END Reset;
  2950. BEGIN
  2951. previousScope := currentScope;
  2952. currentScope := scope;
  2953. pc := section.pc;
  2954. prevOffset := MAX(SIZE);
  2955. variable := scope.firstVariable;
  2956. WHILE variable # NIL DO
  2957. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2958. Reset (variable);
  2959. prevOffset := variable.offsetInBits;
  2960. END;
  2961. variable := variable.nextVariable;
  2962. END;
  2963. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2964. WHILE parameter # NIL DO
  2965. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  2966. Reset (parameter);
  2967. END;
  2968. parameter := parameter.nextParameter;
  2969. END;
  2970. INC(statCoopResetVariables, section.pc - pc);
  2971. currentScope := previousScope;
  2972. END ResetVariables;
  2973. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  2974. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  2975. BEGIN
  2976. type := symbol.type.resolved;
  2977. SaveRegisters();ReleaseUsedRegisters(saved);
  2978. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  2979. Symbol(symbol, operand);
  2980. ToMemory(operand.op,addressType,0);
  2981. Emit(Push(position,operand.op));
  2982. IF refer THEN
  2983. CallThis(position,"Heaps","Refer",1);
  2984. ELSE
  2985. CallThis(position,"Heaps","Reset",1);
  2986. END;
  2987. ELSIF type.IsRecordType() THEN
  2988. Symbol(symbol, operand);
  2989. Emit(Push(position,operand.op));
  2990. Emit(Push(position,operand.tag)); (* type desc *)
  2991. IF refer THEN
  2992. CallThis(position,"Heaps","ReferRecord",2);
  2993. ELSE
  2994. CallThis(position,"Heaps","ResetRecord",2);
  2995. END;
  2996. ELSIF IsStaticArray(type) THEN
  2997. size := StaticArrayNumElements(type);
  2998. base := StaticArrayBaseType(type);
  2999. Symbol(symbol, operand);
  3000. arg := TypeDescriptorAdr(base);
  3001. Emit(Push(position,operand.op));
  3002. Emit(Push(position,arg));
  3003. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  3004. ReleaseIntermediateOperand(arg);
  3005. IF refer THEN
  3006. CallThis(position,"Heaps","ReferArray",3);
  3007. ELSE
  3008. CallThis(position,"Heaps","ResetArray",3);
  3009. END;
  3010. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  3011. size := StaticMathArrayNumElements(type);
  3012. base := StaticMathArrayBaseType(type);
  3013. Symbol(symbol, operand);
  3014. arg := TypeDescriptorAdr(base);
  3015. Emit(Push(position,operand.op));
  3016. Emit(Push(position,arg));
  3017. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  3018. ReleaseIntermediateOperand(arg);
  3019. IF refer THEN
  3020. CallThis(position,"Heaps","ReferArray",3);
  3021. ELSE
  3022. CallThis(position,"Heaps","ResetArray",3);
  3023. END;
  3024. ELSIF type IS SyntaxTree.MathArrayType THEN
  3025. Symbol(symbol, operand);
  3026. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3027. Emit (Push(position, operand.op));
  3028. ELSE
  3029. Emit (Push(position, operand.tag));
  3030. END;
  3031. IF refer THEN
  3032. CallThis(position,"Heaps","ReferMathArray", 1);
  3033. ELSE
  3034. CallThis(position,"Heaps","ResetMathArray", 1);
  3035. END;
  3036. ELSIF type IS SyntaxTree.ProcedureType THEN
  3037. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  3038. Symbol(symbol, operand);
  3039. Emit (Push(position, operand.tag));
  3040. IF refer THEN
  3041. CallThis(position,"Heaps","Refer", 1);
  3042. ELSE
  3043. CallThis(position,"Heaps","Reset", 1);
  3044. END;
  3045. ELSE HALT(100); (* missing ? *)
  3046. END;
  3047. ReleaseOperand(operand);
  3048. RestoreRegisters(saved);
  3049. END Reset;
  3050. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  3051. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  3052. BEGIN
  3053. previousScope := currentScope;
  3054. currentScope := scope;
  3055. pc := section.pc;
  3056. IF ~ refer THEN
  3057. variable := scope.firstVariable;
  3058. prevOffset := MAX(SIZE);
  3059. WHILE variable # NIL DO
  3060. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  3061. Reset (variable,refer);
  3062. prevOffset := variable.offsetInBits;
  3063. END;
  3064. variable := variable.nextVariable;
  3065. END;
  3066. END;
  3067. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  3068. WHILE parameter # NIL DO
  3069. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  3070. Reset (parameter,refer);
  3071. END;
  3072. parameter := parameter.nextParameter;
  3073. END;
  3074. INC(statCoopResetVariables, section.pc - pc);
  3075. currentScope := previousScope;
  3076. END ResetVariables2;
  3077. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  3078. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  3079. VAR op: IntermediateCode.Operand; context: Context;
  3080. BEGIN
  3081. previousSection := section;
  3082. GetCodeSectionNameForSymbol(procedure, name);
  3083. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  3084. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  3085. IF dump # NIL THEN dump := section.comments END;
  3086. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  3087. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3088. Emit(Data(position,op));
  3089. Emit(Data(position,nil));
  3090. IF HasPointers (procedure.procedureScope) THEN
  3091. GetCodeSectionNameForSymbol(procedure, name);
  3092. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3093. ELSE
  3094. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  3095. END;
  3096. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3097. Emit(Data(position,op));
  3098. ReturnToContext(context);
  3099. IF dump # NIL THEN dump := section.comments END;
  3100. END CreateProcedureDescriptor;
  3101. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  3102. VAR import: SyntaxTree.Import;
  3103. s: Basic.MessageString;
  3104. selfName: SyntaxTree.IdentifierString;
  3105. BEGIN
  3106. moduleScope.ownerModule.GetName(selfName);
  3107. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  3108. module := moduleScope.ownerModule
  3109. ELSE
  3110. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  3111. IF import = NIL THEN
  3112. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  3113. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  3114. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  3115. s := "Module ";
  3116. Strings.Append(s,moduleName);
  3117. Strings.Append(s," cannot be imported.");
  3118. IF force THEN
  3119. Error(position,s);
  3120. ELSIF canBeLoaded THEN
  3121. IF WarningDynamicLoading THEN
  3122. Strings.Append(s, "=> no dynamic linking.");
  3123. Warning(position, s);
  3124. END;
  3125. canBeLoaded := FALSE;
  3126. END;
  3127. RETURN FALSE
  3128. ELSE
  3129. SELF.module.imports.AddName(moduleName)
  3130. END;
  3131. ELSIF import.module = NIL THEN (* already tried *)
  3132. RETURN FALSE
  3133. END;
  3134. module := import.module;
  3135. END;
  3136. RETURN TRUE
  3137. END AddImport;
  3138. (* needed for old binary object file format*)
  3139. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  3140. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  3141. BEGIN
  3142. IF AddImport(moduleName,module,TRUE) THEN
  3143. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3144. IF procedure = NIL THEN
  3145. s := "Instruction not supported on target, emulation procedure ";
  3146. Strings.Append(s,moduleName);
  3147. Strings.Append(s,".");
  3148. Strings.Append(s,procedureName);
  3149. Strings.Append(s," not present");
  3150. Error(position,s);
  3151. ELSE
  3152. StaticCallOperand(r,procedure);
  3153. ReleaseOperand(r);
  3154. fp := GetFingerprint(procedure);
  3155. END;
  3156. END;
  3157. END EnsureSymbol;
  3158. PROCEDURE ConditionValue(x: SyntaxTree.Expression): Operand;
  3159. VAR trueL, exitL: Label; op: Operand;
  3160. BEGIN
  3161. InitOperand(op,ModeValue);
  3162. trueL := NewLabel();
  3163. exitL := NewLabel();
  3164. Condition(x,trueL,TRUE);
  3165. IntermediateCode.InitRegister(op.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  3166. Emit(Mov(position,op.op,false));
  3167. BrL(exitL);
  3168. SetLabel(trueL);
  3169. Emit(MovReplace(position,op.op,true));
  3170. SetLabel(exitL);
  3171. RETURN op;
  3172. END ConditionValue;
  3173. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3174. VAR size: LONGINT;
  3175. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3176. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  3177. BEGIN
  3178. ASSERT(type.form = SyntaxTree.Open);
  3179. baseType := type.arrayBase.resolved;
  3180. IF IsOpenArray(baseType) THEN
  3181. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3182. ELSE
  3183. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  3184. sizeOperand := IntermediateCode.Immediate(addressType,size);
  3185. END;
  3186. len := tag;
  3187. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3188. IntermediateCode.MakeMemory(len,addressType);
  3189. UseIntermediateOperand(len);
  3190. Reuse2(res,sizeOperand,len);
  3191. Emit(Mul(position,res,sizeOperand,len));
  3192. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3193. RETURN res
  3194. END GetArraySize;
  3195. BEGIN
  3196. type := type.resolved;
  3197. IF IsOpenArray(type) THEN
  3198. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  3199. RETURN tag
  3200. ELSE
  3201. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  3202. END;
  3203. ELSE
  3204. size := ToMemoryUnits(system,system.SizeOf(type));
  3205. RETURN IntermediateCode.Immediate(addressType,size)
  3206. END;
  3207. END GetDynamicSize;
  3208. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3209. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3210. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  3211. BEGIN
  3212. ASSERT(type.form = SyntaxTree.Open);
  3213. baseType := type.arrayBase.resolved;
  3214. IF IsOpenArray(baseType) THEN
  3215. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3216. ELSE
  3217. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  3218. END;
  3219. len := tag;
  3220. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3221. IntermediateCode.MakeMemory(len,addressType);
  3222. UseIntermediateOperand(len);
  3223. Reuse2(res,sizeOperand,len);
  3224. Emit(Mul(position,res,sizeOperand,len));
  3225. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3226. RETURN res
  3227. END GetLength;
  3228. BEGIN
  3229. type := type.resolved;
  3230. IF IsOpenArray(type) THEN
  3231. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  3232. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  3233. ELSIF type IS SyntaxTree.StringType THEN
  3234. RETURN tag;
  3235. ELSE
  3236. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  3237. END;
  3238. END GetArrayLength;
  3239. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3240. VAR result: IntermediateCode.Operand;
  3241. BEGIN
  3242. IF backend.cooperative THEN
  3243. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  3244. ELSE
  3245. MakeMemory(result, tag, addressType, 0);
  3246. END;
  3247. RETURN result
  3248. END GetSizeFromTag;
  3249. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3250. VAR parameter: SyntaxTree.Parameter;
  3251. BEGIN
  3252. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  3253. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  3254. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3255. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  3256. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3257. END;
  3258. RETURN GetDynamicSize(e.type, tag);
  3259. END GetArrayOfBytesSize;
  3260. (*
  3261. to find imported symbol. not needed ?
  3262. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  3263. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  3264. BEGIN
  3265. IF AddImport(moduleName,importedModule,FALSE) THEN
  3266. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  3267. RETURN symbol
  3268. ELSE
  3269. RETURN NIL
  3270. END
  3271. END SymbolByName;
  3272. *)
  3273. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  3274. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  3275. BEGIN
  3276. IF AddImport(moduleName,runtimeModule,force) THEN
  3277. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3278. IF procedure = NIL THEN
  3279. s := "Procedure ";
  3280. Strings.Append(s,moduleName);
  3281. Strings.Append(s,".");
  3282. Strings.Append(s,procedureName);
  3283. Strings.Append(s," not present");
  3284. Error(position,s);
  3285. RETURN FALSE
  3286. ELSE
  3287. RETURN TRUE
  3288. END;
  3289. ELSE RETURN FALSE
  3290. END;
  3291. END GetRuntimeProcedure;
  3292. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3293. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3294. s: Basic.MessageString;
  3295. BEGIN
  3296. Basic.InitSegmentedName(name);
  3297. name[0] := Basic.MakeString(moduleName);
  3298. name[1] := Basic.MakeString(typeName);
  3299. name[2] := -1;
  3300. IF AddImport(moduleName,importedModule, FALSE) THEN
  3301. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3302. IF symbol = NIL THEN
  3303. s := "type ";
  3304. Strings.Append(s,moduleName);
  3305. Strings.Append(s,".");
  3306. Strings.Append(s,typeName);
  3307. Strings.Append(s," not present");
  3308. Error(position,s);
  3309. END;
  3310. ELSE symbol := NIL;
  3311. END;
  3312. IF importedModule = moduleScope.ownerModule THEN
  3313. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3314. ELSE
  3315. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3316. END;
  3317. RETURN symbol
  3318. END GetTypeDescriptor;
  3319. (* 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. *)
  3320. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3321. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3322. pooledName: Basic.SegmentedName; size: LONGINT;
  3323. BEGIN
  3324. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3325. StaticCallOperand(result,procedure);
  3326. IF numberParameters < 0 THEN
  3327. size := ProcParametersSize(procedure);
  3328. ELSE
  3329. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3330. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3331. Error(position,"runtime call parameter count mismatch");
  3332. END;
  3333. END;
  3334. Emit(Call(position, result.op, size));
  3335. ReleaseOperand(result);
  3336. ELSE (* only static linking possible *)
  3337. ASSERT(numberParameters >= 0);
  3338. Basic.InitSegmentedName(pooledName);
  3339. pooledName[0] := Basic.MakeString(moduleName);
  3340. pooledName[1] := Basic.MakeString(procedureName);
  3341. pooledName[2] := -1;
  3342. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3343. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3344. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3345. END;
  3346. END CallThisChecked;
  3347. (* 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. *)
  3348. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3349. BEGIN
  3350. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3351. END CallThis;
  3352. PROCEDURE CompareString(br: ConditionalBranch; label: Label; leftExpression,rightExpression: SyntaxTree.Expression);
  3353. VAR
  3354. left,right: Operand;
  3355. leftSize, rightSize: IntermediateCode.Operand;
  3356. saved: RegisterEntry;
  3357. reg: IntermediateCode.Operand;
  3358. procedureName: SyntaxTree.IdentifierString;
  3359. BEGIN
  3360. procedureName := "CompareString";
  3361. SaveRegisters();ReleaseUsedRegisters(saved);
  3362. Designate(leftExpression,left);
  3363. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3364. Emit(Push(position,leftSize));
  3365. ReleaseIntermediateOperand(leftSize);
  3366. Emit(Push(position,left.op));
  3367. ReleaseOperand(left);
  3368. Designate(rightExpression,right);
  3369. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3370. Emit(Push(position,rightSize));
  3371. ReleaseIntermediateOperand(rightSize);
  3372. Emit(Push(position,right.op));
  3373. ReleaseOperand(right);
  3374. CallThis(position,builtinsModuleName,procedureName, 4);
  3375. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3376. Emit(Result(position,reg));
  3377. RestoreRegisters(saved);
  3378. br(label,reg,IntermediateCode.Immediate(int8,0));
  3379. ReleaseIntermediateOperand(reg);
  3380. END CompareString;
  3381. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3382. VAR
  3383. left,right: Operand;
  3384. leftSize, rightSize: IntermediateCode.Operand;
  3385. saved: RegisterEntry;
  3386. procedureName: SyntaxTree.IdentifierString;
  3387. BEGIN
  3388. procedureName := "CopyString";
  3389. SaveRegisters();ReleaseUsedRegisters(saved);
  3390. Designate(leftExpression,left);
  3391. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3392. Emit(Push(position,leftSize));
  3393. ReleaseIntermediateOperand(leftSize);
  3394. Emit(Push(position,left.op));
  3395. ReleaseOperand(left);
  3396. Designate(rightExpression,right);
  3397. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3398. Emit(Push(position,rightSize));
  3399. ReleaseIntermediateOperand(rightSize);
  3400. Emit(Push(position,right.op));
  3401. ReleaseOperand(right);
  3402. CallThis(position,builtinsModuleName,procedureName,4);
  3403. RestoreRegisters(saved);
  3404. END CopyString;
  3405. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3406. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3407. leftType,rightType: SyntaxTree.Type;
  3408. leftExpression,rightExpression : SyntaxTree.Expression;
  3409. componentType: IntermediateCode.Type;
  3410. next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3411. size: LONGINT;
  3412. BEGIN
  3413. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3414. dest := destination; destination := emptyOperand;
  3415. leftType := x.left.type.resolved;
  3416. rightType := x.right.type.resolved;
  3417. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3418. CASE x.operator OF
  3419. Scanner.Or, Scanner.And, Scanner.Is:
  3420. result := ConditionValue(x);
  3421. |Scanner.Plus:
  3422. Evaluate(x.left,left);
  3423. Evaluate(x.right,right);
  3424. IF leftType IS SyntaxTree.SetType THEN
  3425. InitOperand(result,ModeValue);
  3426. Reuse2a(result.op,left.op,right.op,dest);
  3427. Emit(Or(position,result.op,left.op,right.op));
  3428. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3429. InitOperand(result,ModeValue);
  3430. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3431. Reuse2(result.tag,left.tag,right.tag);
  3432. Emit(Add(position,result.op,left.op,right.op));
  3433. Emit(Add(position,result.tag,left.tag,right.tag))
  3434. ELSE
  3435. InitOperand(result,ModeValue);
  3436. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3437. AddInt(result.op, left.op, right.op) ;
  3438. ELSE
  3439. *)
  3440. Reuse2a(result.op,left.op,right.op,dest);
  3441. Emit(Add(position,result.op,left.op,right.op));
  3442. (*
  3443. END;
  3444. *)
  3445. END;
  3446. ReleaseOperand(left); ReleaseOperand(right);
  3447. |Scanner.Minus:
  3448. Evaluate(x.left,left);
  3449. Evaluate(x.right,right);
  3450. IF leftType IS SyntaxTree.SetType THEN
  3451. InitOperand(result,ModeValue);
  3452. Reuse1(result.op,right.op);
  3453. Emit(Not(position,result.op,right.op));
  3454. ReleaseOperand(right);
  3455. Emit(And(position,result.op,result.op,left.op));
  3456. ReleaseOperand(left);
  3457. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3458. InitOperand(result,ModeValue);
  3459. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3460. Reuse2(result.tag,left.tag,right.tag);
  3461. Emit(Sub(position,result.op,left.op,right.op));
  3462. Emit(Sub(position,result.tag,left.tag,right.tag));
  3463. ReleaseOperand(left); ReleaseOperand(right)
  3464. ELSE
  3465. InitOperand(result,ModeValue);
  3466. Reuse2a(result.op,left.op,right.op,dest);
  3467. Emit(Sub(position,result.op,left.op,right.op));
  3468. ReleaseOperand(left); ReleaseOperand(right);
  3469. END;
  3470. |Scanner.Times:
  3471. Evaluate(x.left,left);
  3472. Evaluate(x.right,right);
  3473. IF leftType IS SyntaxTree.SetType THEN
  3474. InitOperand(result,ModeValue);
  3475. Reuse2a(result.op,left.op,right.op,dest);
  3476. Emit(And(position,result.op,left.op,right.op));
  3477. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3478. InitOperand(result, ModeValue);
  3479. componentType := left.op.type;
  3480. (* TODO: review this *)
  3481. (*
  3482. result.op = left.op * right.op - left.tag * right.tag
  3483. result.tag = left.tag * right.op + left.op * right.tag
  3484. *)
  3485. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3486. Emit(Mul(position,result.op, left.op, right.op));
  3487. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3488. Emit(Mul(position,tempReg, left.tag, right.tag));
  3489. Emit(Sub(position,result.op, result.op, tempReg));
  3490. Reuse2(result.tag, left.tag, right.op);
  3491. Emit(Mul(position,result.tag, left.tag, right.op));
  3492. Emit(Mul(position,tempReg, left.op, right.tag));
  3493. Emit(Add(position,result.tag, result.tag, tempReg));
  3494. ReleaseIntermediateOperand(tempReg)
  3495. ELSE
  3496. InitOperand(result,ModeValue);
  3497. Reuse2a(result.op,left.op,right.op,dest);
  3498. Emit(Mul(position,result.op,left.op,right.op));
  3499. END;
  3500. ReleaseOperand(left); ReleaseOperand(right);
  3501. |Scanner.Div:
  3502. Evaluate(x.left,left);
  3503. Evaluate(x.right,right);
  3504. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3505. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3506. IF ~isUnchecked THEN
  3507. exit := NewLabel();
  3508. BrltL(exit,zero,right.op);
  3509. EmitTrap(position,NegativeDivisorTrap);
  3510. SetLabel(exit);
  3511. END;
  3512. END;
  3513. InitOperand(result,ModeValue);
  3514. Reuse2a(result.op,left.op,right.op,dest);
  3515. Emit(Div(position,result.op,left.op,right.op));
  3516. ReleaseOperand(left); ReleaseOperand(right);
  3517. |Scanner.Mod:
  3518. Evaluate(x.left,left);
  3519. Evaluate(x.right,right);
  3520. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3521. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3522. IF ~isUnchecked THEN
  3523. exit := NewLabel();
  3524. BrltL(exit,zero,right.op);
  3525. EmitTrap(position,NegativeDivisorTrap);
  3526. SetLabel(exit);
  3527. END;
  3528. END;
  3529. InitOperand(result,ModeValue);
  3530. Reuse2a(result.op,left.op,right.op,dest);
  3531. Emit(Mod(position,result.op,left.op,right.op));
  3532. ReleaseOperand(left); ReleaseOperand(right);
  3533. |Scanner.Slash:
  3534. Evaluate(x.left,left);
  3535. Evaluate(x.right,right);
  3536. IF leftType IS SyntaxTree.SetType THEN
  3537. InitOperand(result,ModeValue);
  3538. Reuse2a(result.op,left.op,right.op,dest);
  3539. Emit(Xor(position,result.op,left.op,right.op));
  3540. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3541. InitOperand(result,ModeValue);
  3542. componentType := left.op.type;
  3543. (* review this *)
  3544. (*
  3545. divisor = right.op * right.op + right.tag * right.tag
  3546. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3547. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3548. *)
  3549. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3550. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3551. Emit(Mul(position,tempReg, right.op, right.op));
  3552. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3553. Emit(Add(position,tempReg, tempReg, tempReg2));
  3554. result.op := tempReg2;
  3555. Emit(Mul(position,result.op, left.op, right.op));
  3556. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3557. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3558. Emit(Add(position,result.op, result.op, tempReg2));
  3559. Emit(Div(position,result.op, result.op, tempReg));
  3560. Reuse2(result.tag, left.tag, right.op);
  3561. Emit(Mul(position,result.tag, left.tag, right.op));
  3562. Emit(Mul(position,tempReg2, left.op, right.tag));
  3563. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3564. Emit(Div(position,result.tag, result.tag, tempReg));
  3565. ReleaseIntermediateOperand(tempReg);
  3566. ReleaseIntermediateOperand(tempReg2)
  3567. ELSE
  3568. InitOperand(result,ModeValue);
  3569. Reuse2a(result.op,left.op,right.op,dest);
  3570. Emit(Div(position,result.op,left.op,right.op));
  3571. END;
  3572. ReleaseOperand(left); ReleaseOperand(right);
  3573. |Scanner.Equal, Scanner.LessEqual, Scanner.Less, Scanner.Greater, Scanner.GreaterEqual, Scanner.Unequal :
  3574. result := ConditionValue(x);
  3575. |Scanner.In:
  3576. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3577. Evaluate(x.left,left);
  3578. Evaluate(x.right,right);
  3579. Convert(left.op,setType);
  3580. Convert(right.op,setType);
  3581. ReuseCopy(temp.op,right.op);
  3582. Emit(Shr(position,temp.op,temp.op,left.op));
  3583. ReleaseOperand(right); ReleaseOperand(left);
  3584. IntermediateCode.InitImmediate(one,setType,1);
  3585. Emit(And(position,temp.op,temp.op,one));
  3586. Convert(temp.op,bool);
  3587. result.mode := ModeValue;
  3588. result.op := temp.op;
  3589. result.tag := nil; (* may be left over from calls to evaluate *)
  3590. ELSE
  3591. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3592. IF x.operator = Scanner.Questionmarks THEN
  3593. leftExpression := x.left;
  3594. rightExpression := x.right;
  3595. ELSE
  3596. leftExpression := x.right;
  3597. rightExpression := x.left;
  3598. END;
  3599. Evaluate(leftExpression, left);
  3600. Emit(Push(position,left.op));
  3601. ReleaseOperand(left);
  3602. Designate(rightExpression, right);
  3603. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3604. IF ~backend.cellsAreObjects THEN
  3605. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3606. END;
  3607. Emit(Push(position,right.op));
  3608. ReleaseOperand(right);
  3609. IF backend.cellsAreObjects THEN
  3610. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3611. ELSE
  3612. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3613. END;
  3614. InitOperand(result, ModeValue);
  3615. result.op := NewRegisterOperand(bool);
  3616. Emit(Result(position,result.op));
  3617. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3618. leftExpression := x.left;
  3619. rightExpression := x.right;
  3620. Evaluate(leftExpression, left);
  3621. Emit(Push(position,left.op));
  3622. ReleaseOperand(left);
  3623. Evaluate(rightExpression, right);
  3624. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3625. IF ~backend.cellsAreObjects THEN
  3626. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3627. END;
  3628. Emit(Push(position,right.op));
  3629. ReleaseOperand(right);
  3630. IF backend.cellsAreObjects THEN
  3631. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3632. ELSE
  3633. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3634. END;
  3635. InitOperand(result, ModeValue);
  3636. result.op := NewRegisterOperand(bool);
  3637. Emit(Result(position,result.op));
  3638. ELSE
  3639. HALT(100);
  3640. END;
  3641. END;
  3642. destination := dest;
  3643. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3644. END VisitBinaryExpression;
  3645. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3646. VAR localResult, operand: Operand;
  3647. BEGIN
  3648. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3649. InitOperand(localResult, ModeValue);
  3650. ASSERT(x.first # NIL);
  3651. Evaluate(x.first, operand);
  3652. localResult.op := operand.op;
  3653. ReleaseOperand(operand);
  3654. UseIntermediateOperand(localResult.op);
  3655. ASSERT(x.last # NIL);
  3656. Evaluate(x.last, operand);
  3657. localResult.tag := operand.op;
  3658. ReleaseOperand(operand);
  3659. UseIntermediateOperand(localResult.tag);
  3660. IF x.step # NIL THEN
  3661. Evaluate(x.step, operand);
  3662. localResult.extra := operand.op;
  3663. ReleaseOperand(operand);
  3664. UseIntermediateOperand(localResult.extra);
  3665. END;
  3666. result := localResult;
  3667. IF Trace THEN TraceExit("VisitRangeExpression") END
  3668. END VisitRangeExpression;
  3669. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3670. BEGIN
  3671. HALT(100); (* should never be evaluated *)
  3672. END VisitTensorRangeExpression;
  3673. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3674. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3675. BEGIN
  3676. IF Trace THEN TraceEnter("VisitConversion") END;
  3677. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3678. dest := destination; destination := emptyOperand;
  3679. Evaluate(x.expression,old);
  3680. InitOperand(result,ModeValue);
  3681. result.op := old.op;
  3682. ASSERT(result.op.mode # 0);
  3683. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3684. (* convert TO a complex number *)
  3685. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3686. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3687. ASSERT(result.op.mode # 0);
  3688. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3689. (* convert FROM a complex number TO a complex number*)
  3690. result.tag := old.tag;
  3691. ASSERT(result.tag.mode # 0);
  3692. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3693. ASSERT(result.tag.mode # 0)
  3694. ELSE
  3695. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3696. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3697. END
  3698. ELSE
  3699. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3700. ASSERT(result.op.mode # 0);
  3701. result.tag := old.tag; (*! probably never used *)
  3702. END;
  3703. destination := dest;
  3704. IF Trace THEN TraceExit("VisitConversion") END;
  3705. END VisitConversion;
  3706. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3707. BEGIN
  3708. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3709. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3710. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3711. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3712. END VisitTypeDeclaration;
  3713. (** designators (expressions) *)
  3714. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3715. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3716. BEGIN
  3717. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3718. IF x.left # NIL THEN Expression(x.left) END;
  3719. Symbol(x.symbol,result);
  3720. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3721. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3722. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3723. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3724. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3725. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3726. END;
  3727. END;
  3728. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3729. END VisitSymbolDesignator;
  3730. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3731. BEGIN
  3732. IF isUnchecked THEN RETURN END;
  3733. IF tagsAvailable THEN
  3734. TrapC(BrltL,index,length,IndexCheckTrap);
  3735. END;
  3736. END BoundCheck;
  3737. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3738. VAR d: IntermediateCode.Operand;
  3739. BEGIN
  3740. IF isUnchecked THEN RETURN END;
  3741. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3742. TrapC(op,dim,d,ArraySizeTrap);
  3743. ReleaseIntermediateOperand(d);
  3744. END DimensionCheck;
  3745. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3746. VAR
  3747. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3748. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3749. expression: SyntaxTree.Expression;
  3750. resultingType, leftType, baseType: SyntaxTree.Type;
  3751. skipLabel1: Label;
  3752. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3753. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3754. variableOp: Operand;
  3755. variable: SyntaxTree.Variable;
  3756. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3757. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3758. VAR e: SyntaxTree.Expression; i: LONGINT;
  3759. BEGIN
  3760. tensorFound := FALSE;
  3761. FOR i := 0 TO parameters.Length()-1 DO
  3762. e := parameters.GetExpression(i);
  3763. IF e IS SyntaxTree.TensorRangeExpression THEN
  3764. ASSERT(~tensorFound);
  3765. tensorFound := TRUE;
  3766. ELSIF e IS SyntaxTree.RangeExpression THEN
  3767. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3768. ELSE
  3769. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3770. END;
  3771. END;
  3772. END CountIndices;
  3773. BEGIN
  3774. ASSERT(tagsAvailable);
  3775. resultingType := x.type.resolved; (* resulting type *)
  3776. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3777. InitOperand(localResult, ModeReference);
  3778. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3779. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3780. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3781. (* a globally defined array destination tag is available -> use and invalidate it*)
  3782. localResult.tag := arrayDestinationTag;
  3783. IntermediateCode.InitOperand(arrayDestinationTag)
  3784. ELSE
  3785. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3786. (* the result is of array range type and thus does not provide any collectable pointers *)
  3787. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3788. Symbol(variable, variableOp);
  3789. ReuseCopy(localResult.tag, variableOp.op);
  3790. ReleaseOperand(variableOp);
  3791. END
  3792. END;
  3793. indexListSize := x.parameters.Length();
  3794. CountIndices(x.parameters);
  3795. (*ASSERT(tensorRangeCount <= 1);*)
  3796. (* designate the array to be indexed over, perform tensor range check if known *)
  3797. Designate(x.left, array);
  3798. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3799. Dereference(array, leftType,FALSE);
  3800. IF ~tensorFound THEN
  3801. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3802. END
  3803. END;
  3804. (* default base offset *)
  3805. srcDimOffset := 0;
  3806. destDimOffset := 0;
  3807. indexDim := 0;
  3808. (* use address of source array as basis *)
  3809. localResult.op := array.op;
  3810. UseIntermediateOperand(localResult.op);
  3811. (* go through the index list *)
  3812. FOR i := 0 TO indexListSize - 1 DO
  3813. expression := x.parameters.GetExpression(i);
  3814. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3815. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3816. srcDimOffset := -indexListSize;
  3817. destDimOffset := -suffixRanges;
  3818. ELSE
  3819. (* determine which dimension of source array is currently looked at *)
  3820. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3821. (* get the memory operand pointing to array descriptor dimension *)
  3822. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3823. (* make a reusable register from it *)
  3824. ReuseCopy(srcDim, tmp);
  3825. ReleaseIntermediateOperand(tmp);
  3826. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3827. ELSE
  3828. srcDim := IntermediateCode.Immediate(sizeType, i);
  3829. END;
  3830. (* get length and increment of source array for current dimension *)
  3831. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3832. Convert(sourceLength.op, sizeType);
  3833. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3834. Convert(sourceIncrement.op, sizeType);
  3835. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3836. ReleaseIntermediateOperand(srcDim);
  3837. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3838. (* SINGLE INDEX *)
  3839. Evaluate(expression, index);
  3840. ReleaseIntermediateOperand(index.tag);
  3841. index.tag := emptyOperand;
  3842. Convert(index.op, sizeType);
  3843. (* lower bound check *)
  3844. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3845. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3846. ELSIF isUnchecked THEN (* do nothing *)
  3847. ELSE
  3848. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3849. END;
  3850. (* upper bound check *)
  3851. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3852. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3853. ELSIF isUnchecked THEN (* do nothing *)
  3854. ELSE
  3855. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3856. END;
  3857. ReleaseOperand(sourceLength);
  3858. Convert(index.op, addressType);
  3859. summand := index.op;
  3860. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3861. (* RANGE OF INDICES *)
  3862. Evaluate(expression, range);
  3863. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3864. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3865. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3866. ReleaseOperand(range);
  3867. Convert(firstIndex, sizeType);
  3868. Convert(lastIndex, sizeType);
  3869. Convert(stepSize, sizeType);
  3870. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3871. if it is 'MAX(LONGINT)' *)
  3872. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3873. TransferToRegister(lastIndex, lastIndex);
  3874. skipLabel1 := NewLabel();
  3875. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3876. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3877. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3878. SetLabel(skipLabel1)
  3879. END;
  3880. (* check if step size is valid *)
  3881. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3882. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3883. ELSIF isUnchecked THEN (* do nothing *)
  3884. ELSE
  3885. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3886. END;
  3887. (* check lower bound check *)
  3888. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3889. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3890. ELSIF isUnchecked THEN (* do nothing *)
  3891. ELSE
  3892. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3893. END;
  3894. (* check upper bound check *)
  3895. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3896. (* statically open range: nothing to do *)
  3897. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3898. ASSERT(staticLastIndex < staticSourceLength)
  3899. ELSIF isUnchecked THEN (* do nothing *)
  3900. ELSE
  3901. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3902. END;
  3903. (* determine length of target array for current dimension *)
  3904. (* 1. incorporate last index: *)
  3905. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3906. (* last index is static *)
  3907. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3908. targetLength := sourceLength.op
  3909. ELSE
  3910. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3911. END;
  3912. UseIntermediateOperand(targetLength);
  3913. ELSE
  3914. (* targetLength := lastIndex + 1
  3915. Reuse1(targetLength, lastIndex);
  3916. *)
  3917. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3918. END;
  3919. ReleaseOperand(sourceLength);
  3920. ReleaseIntermediateOperand(lastIndex);
  3921. (* 2. incorporate first index: *)
  3922. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3923. (* first index and current target length are static *)
  3924. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3925. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3926. (* first index = 0: nothing to do *)
  3927. ELSE
  3928. (* targetLength := targetLength - firstIndex *)
  3929. TransferToRegister(targetLength, targetLength);
  3930. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3931. END;
  3932. (* clip negative lengths to 0 *)
  3933. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3934. IF staticTargetLength < 0 THEN
  3935. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3936. END
  3937. ELSE
  3938. skipLabel1 := NewLabel();
  3939. TransferToRegister(targetLength, targetLength);
  3940. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3941. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3942. SetLabel(skipLabel1)
  3943. END;
  3944. (* 3. incorporate index step size: *)
  3945. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3946. (*step size and current target length are static *)
  3947. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3948. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3949. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3950. (* step size = 1: nothing to do *)
  3951. ELSE
  3952. (* emit code for this:
  3953. targetLength := (targetLength-1) DIV stepSize +1;
  3954. *)
  3955. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3956. DivInt(targetLength, targetLength, stepSize);
  3957. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3958. END;
  3959. (* determine increment of target array for current dimension *)
  3960. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3961. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3962. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3963. (* step size = 1 *)
  3964. targetIncrement := sourceIncrement.op;
  3965. UseIntermediateOperand(targetIncrement)
  3966. ELSE
  3967. (* targetIncrement := sourceIncrement * stepSize *)
  3968. Reuse1(targetIncrement, stepSize);
  3969. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3970. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3971. END;
  3972. ReleaseIntermediateOperand(stepSize);
  3973. (* write length and increment of target array to descriptor *)
  3974. IF destDimOffset < 0 THEN
  3975. (* determine which dimension of target array is currently looked at *)
  3976. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3977. TransferToRegister(destDim, tmp);
  3978. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3979. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3980. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3981. ReleaseIntermediateOperand(destDim);
  3982. INC(destDimOffset);
  3983. ELSE
  3984. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3985. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3986. END;
  3987. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3988. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3989. INC(indexDim);
  3990. Convert(firstIndex, addressType);
  3991. TransferToRegister(summand, firstIndex);
  3992. ELSE HALT(100);
  3993. END;
  3994. (*
  3995. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3996. *)
  3997. Convert(sourceIncrement.op, addressType);
  3998. Convert(summand, addressType);
  3999. MulInt(summand, summand, sourceIncrement.op);
  4000. ReleaseIntermediateOperand(sourceIncrement.op);
  4001. AddInt(localResult.op, localResult.op, summand);
  4002. ReleaseIntermediateOperand(summand);
  4003. END
  4004. END;
  4005. result := localResult;
  4006. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  4007. ReleaseIntermediateOperand(result.tag);
  4008. result.tag := TypeDescriptorAdr(resultingType);
  4009. ELSIF IsDelegate(resultingType) THEN
  4010. ReleaseIntermediateOperand(result.tag);
  4011. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4012. UseIntermediateOperand(result.tag);
  4013. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4014. ReleaseIntermediateOperand(result.tag);
  4015. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  4016. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  4017. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  4018. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  4019. (* finalize target array descriptor *)
  4020. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  4021. (* write lengths and increments of target array for remaining dimensions *)
  4022. i := indexListSize;
  4023. WHILE indexDim < targetArrayDimensionality DO
  4024. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  4025. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  4026. ReleaseOperand(sourceLength);
  4027. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  4028. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  4029. ReleaseOperand(sourceIncrement);
  4030. INC(i); INC(indexDim);
  4031. END;
  4032. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4033. tmp := nil;
  4034. ELSE
  4035. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  4036. END;
  4037. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  4038. ReleaseIntermediateOperand(tmp);
  4039. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4040. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  4041. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4042. ELSE
  4043. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  4044. END;
  4045. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  4046. ReleaseIntermediateOperand(tmp);
  4047. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  4048. (* write dimensionality *)
  4049. IF targetArrayDimensionality # 0 THEN
  4050. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  4051. END;
  4052. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  4053. END;
  4054. ReleaseOperand(array);
  4055. END MathIndexDesignator;
  4056. (* get the length of an array , trying to make use of static information *)
  4057. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  4058. VAR res: IntermediateCode.Operand; size: LONGINT;
  4059. BEGIN
  4060. type := type.resolved;
  4061. IF type IS SyntaxTree.ArrayType THEN
  4062. WITH type: SyntaxTree.ArrayType DO
  4063. IF type.form = SyntaxTree.Static THEN
  4064. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  4065. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4066. Evaluate(type.length, op);
  4067. ReleaseIntermediateOperand(op.tag);
  4068. RETURN op.op;*)
  4069. ELSE
  4070. res := tag;
  4071. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  4072. IntermediateCode.MakeMemory(res,addressType);
  4073. UseIntermediateOperand(res);
  4074. RETURN res
  4075. END
  4076. END;
  4077. ELSE
  4078. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  4079. RETURN IntermediateCode.Immediate(addressType,size);
  4080. END;
  4081. END ArrayLength;
  4082. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4083. BEGIN
  4084. IF IsImmediate(x) THEN
  4085. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4086. ELSE
  4087. IF ~ReusableRegister(res) THEN
  4088. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4089. ELSE
  4090. UseIntermediateOperand(res);
  4091. END;
  4092. Emit(Mov(position,res,x))
  4093. END;
  4094. END CopyInt;
  4095. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4096. BEGIN
  4097. ReleaseIntermediateOperand(res);
  4098. IF IsImmediate(x) & IsImmediate(y) THEN
  4099. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4100. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4101. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4102. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4103. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4104. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4105. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4106. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4107. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4108. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4109. UseIntermediateOperand(res);
  4110. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4111. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4112. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4113. UseIntermediateOperand(res);
  4114. ELSE
  4115. IF ~ReusableRegister(res) THEN
  4116. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4117. ELSE
  4118. UseIntermediateOperand(res);
  4119. END;
  4120. IF IsImmediate(x) & (x.intValue = 0) THEN
  4121. Emit(Mov(position,res,y))
  4122. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4123. Emit(Mov(position,res,x))
  4124. ELSE
  4125. Emit(Add(position,res, x, y));
  4126. END;
  4127. END;
  4128. END AddInt;
  4129. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4130. BEGIN
  4131. ReleaseIntermediateOperand(res);
  4132. IF IsImmediate(x) & IsImmediate(y) THEN
  4133. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4134. ELSE
  4135. IF ~ReusableRegister(res) THEN
  4136. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4137. ELSE UseIntermediateOperand(res);
  4138. END;
  4139. IF IsImmediate(x) & (x.intValue = 1) THEN
  4140. Emit(Mov(position,res,y))
  4141. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4142. Emit(Mov(position,res,x))
  4143. ELSE
  4144. Emit(Mul(position,res, x, y));
  4145. END;
  4146. END;
  4147. END MulInt;
  4148. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4149. BEGIN
  4150. ReleaseIntermediateOperand(res);
  4151. IF IsImmediate(x) & IsImmediate(y) THEN
  4152. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4153. ELSE
  4154. IF ~ReusableRegister(res) THEN
  4155. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4156. ELSE UseIntermediateOperand(res);
  4157. END;
  4158. IF IsImmediate(x) & (x.intValue = 1) THEN
  4159. Emit(Mov(position,res,y))
  4160. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4161. Emit(Mov(position,res,x))
  4162. ELSE
  4163. Emit(Div(position,res, x, y));
  4164. END;
  4165. END;
  4166. END DivInt;
  4167. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4168. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4169. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4170. BEGIN
  4171. type := x.left.type.resolved;
  4172. IF type IS SyntaxTree.StringType THEN
  4173. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4174. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4175. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4176. type := atype;
  4177. x.left.SetType(type);
  4178. END;
  4179. IntermediateCode.InitImmediate(res,addressType,0);
  4180. maxDim := x.parameters.Length()-1;
  4181. (*
  4182. computation rule:
  4183. a: ARRAY X,Y,Z OF Element with size S
  4184. a[i,j,k] -->
  4185. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4186. *)
  4187. FOR i := 0 TO maxDim DO
  4188. e := x.parameters.GetExpression(i);
  4189. Evaluate(e,index);
  4190. Convert(index.op,addressType);
  4191. AddInt(res, res, index.op);
  4192. IF i = 0 THEN
  4193. (*
  4194. ReuseCopy(res, index.op);
  4195. *)
  4196. Designate(x.left,array);
  4197. type := x.left.type.resolved;
  4198. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4199. Dereference(array, type, FALSE);
  4200. END;
  4201. (*
  4202. ELSE AddInt(res, res, index.op);
  4203. *)
  4204. END;
  4205. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4206. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4207. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4208. BoundCheck(index.op, length);
  4209. END;
  4210. ReleaseIntermediateOperand(length);
  4211. END;
  4212. ReleaseOperand(index);
  4213. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4214. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4215. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4216. MulInt(res,res,length);
  4217. END;
  4218. ReleaseIntermediateOperand(length);
  4219. END;
  4220. (* remaining open dimensions -- compute address *)
  4221. i := maxDim+1;
  4222. IF type IS SyntaxTree.ArrayType THEN
  4223. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4224. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4225. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4226. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4227. MulInt(res,res,length);
  4228. END;
  4229. ReleaseIntermediateOperand(length);
  4230. INC(i);
  4231. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4232. END;
  4233. END;
  4234. IF (type IS SyntaxTree.ArrayType) THEN
  4235. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4236. size := StaticSize(system, type);
  4237. IF size # 1 THEN
  4238. length := IntermediateCode.Immediate(addressType,size);
  4239. MulInt(res,res,length);
  4240. END;
  4241. ELSE
  4242. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4243. IF size # 1 THEN
  4244. length := IntermediateCode.Immediate(addressType,size);
  4245. MulInt(res,res,length);
  4246. END;
  4247. END;
  4248. END;
  4249. AddInt(res,res,array.op);
  4250. InitOperand(result,ModeReference);
  4251. result.op := res;
  4252. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4253. ReleaseIntermediateOperand(result.tag);
  4254. result.tag := TypeDescriptorAdr(type);
  4255. ELSIF IsDelegate(type) THEN
  4256. ReleaseIntermediateOperand(result.tag);
  4257. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4258. UseIntermediateOperand(result.tag);
  4259. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4260. ReleaseIntermediateOperand(result.tag);
  4261. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4262. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4263. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4264. END;
  4265. ReleaseOperand(array);
  4266. END IndexDesignator;
  4267. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4268. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4269. BEGIN
  4270. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4271. dest := destination; destination := emptyOperand;
  4272. type := x.left.type.resolved;
  4273. IF type IS SyntaxTree.MathArrayType THEN
  4274. MathIndexDesignator(x);
  4275. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4276. IndexDesignator(x);
  4277. END;
  4278. destination := dest;
  4279. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4280. END VisitIndexDesignator;
  4281. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4282. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4283. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4284. procedure: SyntaxTree.Procedure;
  4285. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4286. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4287. BEGIN
  4288. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4289. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4290. parameters := expression.parameters;
  4291. moduleName := "FoxArrayBase";
  4292. procedureName := "CopyDescriptor";
  4293. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4294. SaveRegisters();ReleaseUsedRegisters(saved);
  4295. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4296. IF procedure = NIL THEN
  4297. s := "procedure ";
  4298. Strings.Append(s,moduleName);
  4299. Strings.Append(s,".");
  4300. Strings.Append(s,procedureName);
  4301. Strings.Append(s," not present");
  4302. Error(position,s);
  4303. ELSE
  4304. (* push address of temporary variable *)
  4305. Symbol(variable,destOperand);
  4306. Emit(Push(position,destOperand.op));
  4307. ReleaseOperand(destOperand);
  4308. (* push src *)
  4309. Evaluate(expression.left,srcOperand);
  4310. (*
  4311. Dereference(srcOperand,expression.type.resolved);
  4312. Emit(Push(position,srcOperand.tag));
  4313. *)
  4314. Emit(Push(position,srcOperand.op));
  4315. ReleaseOperand(srcOperand);
  4316. tensorFound := FALSE;
  4317. FOR i := 0 TO parameters.Length()-1 DO
  4318. e := parameters.GetExpression(i);
  4319. IF e IS SyntaxTree.TensorRangeExpression THEN
  4320. tensorFound := TRUE;
  4321. ELSIF e IS SyntaxTree.RangeExpression THEN
  4322. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4323. ELSE
  4324. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4325. END;
  4326. END;
  4327. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4328. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4329. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4330. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4331. StaticCallOperand(procOp,procedure);
  4332. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4333. ReleaseOperand(procOp);
  4334. END;
  4335. RestoreRegisters(saved);
  4336. END;
  4337. RETURN variable
  4338. END PrepareTensorDescriptor;
  4339. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; register: WORD);
  4340. VAR
  4341. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4342. operand, tmpOperand, variableOp, variable2Op: Operand;
  4343. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4344. variable, variable2: SyntaxTree.Variable;
  4345. dim, i, size: LONGINT;
  4346. (* TODO: needed? *)
  4347. oldArrayDestinationTag: IntermediateCode.Operand;
  4348. oldArrayDestinationDimension: LONGINT;
  4349. position: Position;
  4350. saved: RegisterEntry;
  4351. arrayFlags: SET;
  4352. m, n: LONGINT;
  4353. PROCEDURE Pass(op: IntermediateCode.Operand);
  4354. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4355. BEGIN
  4356. IF register >= 0 THEN
  4357. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  4358. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4359. Emit(Mov(position,parameterRegister, op));
  4360. ELSE
  4361. Emit(Push(position,op))
  4362. END
  4363. END Pass;
  4364. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4365. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4366. BEGIN
  4367. formalType := formalType.resolved; actualType := actualType.resolved;
  4368. IF IsOpenArray(formalType)THEN
  4369. IF actualType IS SyntaxTree.StringType THEN
  4370. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4371. RETURN;
  4372. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4373. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4374. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4375. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4376. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4377. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4378. ELSE
  4379. tmp := baseReg;
  4380. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4381. IntermediateCode.MakeMemory(tmp,addressType);
  4382. Pass((tmp));
  4383. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4384. END;
  4385. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4386. END;
  4387. END PushArrayLens;
  4388. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4389. BEGIN
  4390. CASE size OF
  4391. |2: INCL(flags,Size2Flag);
  4392. |3: INCL(flags,Size3Flag);
  4393. |4: INCL(flags,Size4Flag);
  4394. |5: INCL(flags,Size5Flag);
  4395. |6: INCL(flags,Size6Flag);
  4396. |7: INCL(flags,Size7Flag);
  4397. |8: INCL(flags,Size8Flag);
  4398. END;
  4399. END SetSmallArraySizeFlag;
  4400. BEGIN
  4401. IF Trace THEN TraceEnter("PushParameter") END;
  4402. position := expression.position;
  4403. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4404. type := expression.type.resolved;
  4405. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4406. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4407. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4408. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4409. );
  4410. (* TODO: needed? *)
  4411. oldArrayDestinationTag := arrayDestinationTag;
  4412. oldArrayDestinationDimension := arrayDestinationDimension;
  4413. IF IsArrayOfSystemByte(parameter.type) THEN
  4414. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4415. Designate(expression,operand);
  4416. ELSE
  4417. Evaluate(expression, tmpOperand);
  4418. (* array of system byte does not provide any pointers *)
  4419. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4420. Symbol(variable, operand);
  4421. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4422. Emit(Mov(position,tmp, tmpOperand.op));
  4423. ReleaseOperand(tmpOperand);
  4424. END;
  4425. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4426. ReleaseIntermediateOperand(operand.tag);
  4427. operand.tag := tmp;
  4428. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4429. Pass((operand.tag));
  4430. END;
  4431. Pass((operand.op));
  4432. ELSIF IsOpenArray(parameter.type) THEN
  4433. Designate(expression,operand);
  4434. baseReg := operand.tag;
  4435. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4436. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4437. END;
  4438. Pass((operand.op)); (* address of the array *)
  4439. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4440. (* case 1
  4441. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4442. *)
  4443. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4444. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4445. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4446. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4447. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4448. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4449. arrayDestinationTag := sp;
  4450. (* case 1b
  4451. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4452. *)
  4453. IF expression IS SyntaxTree.IndexDesignator THEN
  4454. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4455. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4456. arrayDestinationDimension := dim;
  4457. Designate(expression,operand);
  4458. (* case 1a
  4459. P(...,A,...) push: push array descriptor to stack
  4460. *)
  4461. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4462. Designate(expression,operand);
  4463. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4464. i := 0;
  4465. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4466. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4467. INC(i);
  4468. END;
  4469. type := expression.type.resolved;
  4470. WHILE (i<dim) DO (* remaining static dimensions *)
  4471. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4472. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4473. ReleaseOperand(tmpOperand);
  4474. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4475. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4476. ReleaseOperand(tmpOperand);
  4477. INC(i);
  4478. END;
  4479. dimOp := IntermediateCode.Immediate(addressType,dim);
  4480. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4481. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4482. (* case 1d
  4483. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4484. + case 1e
  4485. P(.. PT() ... );
  4486. *)
  4487. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4488. Designate(expression,operand);
  4489. Dereference(operand,type.resolved,FALSE);
  4490. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4491. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4492. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4493. (* case 1f
  4494. P(...,S,...) push: create array descriptor to S on stack
  4495. case 1g
  4496. P(... PS()...)
  4497. *)
  4498. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4499. Designate(expression,operand);
  4500. FOR i := 0 TO dim-1 DO
  4501. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4502. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4503. ReleaseOperand(tmpOperand);
  4504. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4505. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4506. ReleaseOperand(tmpOperand);
  4507. END;
  4508. (*******
  4509. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4510. *)
  4511. arrayFlags := {StaticFlag};
  4512. IF dim = 1 THEN
  4513. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4514. ReleaseOperand(tmpOperand);
  4515. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4516. m := LONGINT(tmpOperand.op.intValue);
  4517. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4518. ELSIF dim = 2 THEN
  4519. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4520. ReleaseOperand(tmpOperand);
  4521. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4522. m := LONGINT(tmpOperand.op.intValue);
  4523. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4524. ReleaseOperand(tmpOperand);
  4525. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4526. n := LONGINT(tmpOperand.op.intValue);
  4527. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4528. INCL(arrayFlags,SmallMatrixFlag);
  4529. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4530. END;
  4531. END;
  4532. (*******)
  4533. dimOp := IntermediateCode.Immediate(addressType,dim);
  4534. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4535. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4536. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4537. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4538. baseType := SemanticChecker.ArrayBase(type,dim);
  4539. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4540. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4541. ELSE HALT(100);
  4542. END;
  4543. (* case 2
  4544. procedure P([left args], var A: array [*,*] of Type, [right args])
  4545. *)
  4546. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4547. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4548. (* case 2b
  4549. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4550. push: push reference to pushed array descriptor
  4551. post: remove array descriptor.
  4552. *)
  4553. IF expression IS SyntaxTree.IndexDesignator THEN
  4554. descriptorType := GetMathArrayDescriptorType(dim);
  4555. (* range type : no allocation possible, should be untraced *)
  4556. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4557. Symbol(variable,variableOp);
  4558. arrayDestinationTag := variableOp.op;
  4559. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4560. arrayDestinationDimension := dim;
  4561. NeedDescriptor := TRUE;
  4562. Designate(expression,operand);
  4563. Pass((operand.tag));
  4564. NeedDescriptor := FALSE;
  4565. (* case 2a
  4566. P(...,A,...)
  4567. push: push reference to array descriptor on stack
  4568. *)
  4569. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4570. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4571. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4572. INC(i);
  4573. END;
  4574. IF i = dim THEN
  4575. Designate(expression,operand);
  4576. Pass((operand.tag));
  4577. ELSE (* open-static *)
  4578. type := expression.type.resolved;
  4579. descriptorType := GetMathArrayDescriptorType(dim);
  4580. (* static array , cannot be reallocated, untraced !*)
  4581. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4582. Symbol(variable,variableOp);
  4583. arrayDestinationTag := variableOp.op;
  4584. Designate(expression,operand);
  4585. FOR i := 0 TO dim-1 DO
  4586. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4587. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4588. ReleaseOperand(tmpOperand);
  4589. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4590. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4591. ReleaseOperand(tmpOperand);
  4592. END;
  4593. dimOp := IntermediateCode.Immediate(addressType,dim);
  4594. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4595. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4596. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4597. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4598. baseType := SemanticChecker.ArrayBase(type,dim);
  4599. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4600. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4601. Pass((arrayDestinationTag));
  4602. END;
  4603. (* case 2d
  4604. P(...,T,...) push: emit dimension check, push T
  4605. *)
  4606. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4607. Designate(expression,operand);
  4608. Dereference(operand,type.resolved,FALSE);
  4609. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4610. Pass((operand.tag));
  4611. (* case 2f
  4612. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4613. push: push reference to pushed array descriptor
  4614. post: remove array descriptor
  4615. *)
  4616. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4617. descriptorType := GetMathArrayDescriptorType(dim);
  4618. (* static array -- cannot be reallocatated, untraced *)
  4619. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4620. Symbol(variable,variableOp);
  4621. arrayDestinationTag := variableOp.op;
  4622. Designate(expression,operand);
  4623. FOR i := 0 TO dim-1 DO
  4624. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4625. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4626. ReleaseOperand(tmpOperand);
  4627. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4628. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4629. ReleaseOperand(tmpOperand);
  4630. END;
  4631. (*
  4632. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4633. *)
  4634. arrayFlags := {StaticFlag};
  4635. IF dim = 1 THEN
  4636. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4637. ReleaseOperand(tmpOperand);
  4638. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4639. m := LONGINT(tmpOperand.op.intValue);
  4640. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4641. ELSIF dim = 2 THEN
  4642. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4643. ReleaseOperand(tmpOperand);
  4644. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4645. m := LONGINT(tmpOperand.op.intValue);
  4646. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4647. ReleaseOperand(tmpOperand);
  4648. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4649. n := LONGINT(tmpOperand.op.intValue);
  4650. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4651. INCL(arrayFlags,SmallMatrixFlag);
  4652. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4653. END;
  4654. END;
  4655. (*******)
  4656. dimOp := IntermediateCode.Immediate(addressType,dim);
  4657. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4658. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4659. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4660. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4661. baseType := SemanticChecker.ArrayBase(type,dim);
  4662. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4663. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4664. Pass((arrayDestinationTag));
  4665. ELSE HALT(100);
  4666. END;
  4667. (* case 3
  4668. procedure P([left args], [const] A: array [?] of Type, [right args])
  4669. *)
  4670. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4671. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4672. (* case 3b
  4673. P(...,A[a..b,c..d],...)
  4674. *)
  4675. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4676. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4677. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4678. Symbol(variable,variableOp);
  4679. LoadValue(variableOp,system.addressType);
  4680. ELSE
  4681. descriptorType := GetMathArrayDescriptorType(dim);
  4682. (* range -- cannot be reallocated *)
  4683. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4684. Symbol(variable,variableOp);
  4685. END;
  4686. arrayDestinationTag := variableOp.op;
  4687. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4688. arrayDestinationDimension := 0;
  4689. Designate(expression,operand);
  4690. Pass((operand.tag));
  4691. (* case 3a
  4692. P(...,A,...)
  4693. *)
  4694. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4695. i := 0;
  4696. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4697. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4698. INC(i);
  4699. END;
  4700. IF i = dim THEN
  4701. Designate(expression,operand);
  4702. Pass((operand.tag));
  4703. ELSE (* open-static *)
  4704. type := expression.type.resolved;
  4705. descriptorType := GetMathArrayDescriptorType(dim);
  4706. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4707. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4708. Symbol(variable,variableOp);
  4709. arrayDestinationTag := variableOp.op;
  4710. Designate(expression,operand);
  4711. FOR i := 0 TO dim-1 DO
  4712. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4713. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4714. ReleaseOperand(tmpOperand);
  4715. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4716. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4717. ReleaseOperand(tmpOperand);
  4718. END;
  4719. dimOp := IntermediateCode.Immediate(addressType,dim);
  4720. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4721. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4722. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4723. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4724. baseType := SemanticChecker.ArrayBase(type,dim);
  4725. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4726. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4727. Pass((arrayDestinationTag));
  4728. END;
  4729. (* case 3d
  4730. P(...,T,...)
  4731. case 3e
  4732. P(...,PT(...),...)
  4733. *)
  4734. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4735. Designate(expression,operand);
  4736. Dereference(operand,type.resolved,FALSE);
  4737. Pass((operand.tag));
  4738. (* case 3f
  4739. P(...,S,...)
  4740. case 3g
  4741. P(...,PS(...),...)
  4742. *)
  4743. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4744. descriptorType := GetMathArrayDescriptorType(dim);
  4745. (* static array does not need to be traced *)
  4746. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4747. Symbol(variable,variableOp);
  4748. arrayDestinationTag := variableOp.op;
  4749. Designate(expression,operand);
  4750. IF operand.op.type.length >1 THEN (* vector register *)
  4751. (* static array does not need to be traced *)
  4752. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4753. Symbol(variable2, variable2Op);
  4754. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4755. Emit(Mov(position,tmp, operand.op));
  4756. ReleaseOperand(operand);
  4757. Symbol(variable2, operand);
  4758. END;
  4759. FOR i := 0 TO dim-1 DO
  4760. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4761. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4762. ReleaseOperand(tmpOperand);
  4763. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4764. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4765. ReleaseOperand(tmpOperand);
  4766. END;
  4767. dimOp := IntermediateCode.Immediate(addressType,dim);
  4768. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4769. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4770. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4771. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4772. baseType := SemanticChecker.ArrayBase(type,dim);
  4773. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4774. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4775. Pass((arrayDestinationTag));
  4776. ELSE HALT(100);
  4777. END;
  4778. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4779. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4780. (* case 4b
  4781. P(...,A[a..b,c..d],...)
  4782. *)
  4783. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4784. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4785. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4786. Symbol(variable,variableOp);
  4787. LoadValue(variableOp,system.addressType);
  4788. ELSE
  4789. descriptorType := GetMathArrayDescriptorType(dim);
  4790. (* range array -- cannot be allocated *)
  4791. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4792. Symbol(variable,variableOp);
  4793. END;
  4794. arrayDestinationTag := variableOp.op;
  4795. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4796. arrayDestinationDimension := 0;
  4797. Designate(expression,operand);
  4798. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4799. Symbol(variable,variableOp);
  4800. ELSE
  4801. (* alias to range -- untraced *)
  4802. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4803. Symbol(variable,variableOp);
  4804. MakeMemory(tmp,variableOp.op,addressType,0);
  4805. Emit(Mov(position,tmp,operand.tag));
  4806. ReleaseIntermediateOperand(tmp);
  4807. END;
  4808. Pass((variableOp.op));
  4809. ReleaseOperand(variableOp);
  4810. (* case 4a
  4811. P(...,A,...)
  4812. *)
  4813. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4814. i := 0;
  4815. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4816. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4817. INC(i);
  4818. END;
  4819. IF i = dim THEN
  4820. Designate(expression,operand);
  4821. arrayDestinationTag := operand.tag;
  4822. ELSE (* open-static *)
  4823. type := expression.type.resolved;
  4824. descriptorType := GetMathArrayDescriptorType(dim);
  4825. (* static array -- untraced *)
  4826. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4827. Symbol(variable,variableOp);
  4828. arrayDestinationTag := variableOp.op;
  4829. Designate(expression,operand);
  4830. FOR i := 0 TO dim-1 DO
  4831. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4832. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4833. ReleaseOperand(tmpOperand);
  4834. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4835. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4836. ReleaseOperand(tmpOperand);
  4837. END;
  4838. dimOp := IntermediateCode.Immediate(addressType,dim);
  4839. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4840. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4841. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4842. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4843. baseType := SemanticChecker.ArrayBase(type,dim);
  4844. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4845. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4846. END;
  4847. (* tensor alias to open array -- untraced *)
  4848. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4849. Symbol(variable,variableOp);
  4850. MakeMemory(tmp,variableOp.op,addressType,0);
  4851. Emit(Mov(position,tmp,arrayDestinationTag));
  4852. ReleaseIntermediateOperand(tmp);
  4853. Pass((variableOp.op));
  4854. ReleaseOperand(variableOp);
  4855. (* case 4d
  4856. P(...,T,...)
  4857. *)
  4858. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4859. Designate(expression,operand);
  4860. Pass((operand.op));
  4861. (* case 4f
  4862. P(...,S,...)
  4863. *)
  4864. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4865. descriptorType := GetMathArrayDescriptorType(dim);
  4866. (* static array -- cannot be reallocated, untraced *)
  4867. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4868. Symbol(variable,variableOp);
  4869. arrayDestinationTag := variableOp.op;
  4870. Designate(expression,operand);
  4871. FOR i := 0 TO dim-1 DO
  4872. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4873. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4874. ReleaseOperand(tmpOperand);
  4875. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4876. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4877. ReleaseOperand(tmpOperand);
  4878. END;
  4879. dimOp := IntermediateCode.Immediate(addressType,dim);
  4880. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4881. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4882. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4883. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4884. baseType := SemanticChecker.ArrayBase(type,dim);
  4885. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4886. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4887. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4888. Symbol(variable,variableOp);
  4889. MakeMemory(tmp,variableOp.op,addressType,0);
  4890. Emit(Mov(position,tmp,arrayDestinationTag));
  4891. ReleaseIntermediateOperand(tmp);
  4892. Pass((variableOp.op));
  4893. ReleaseOperand(variableOp);
  4894. ELSE HALT(100);
  4895. END;
  4896. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4897. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4898. Designate(expression,operand);
  4899. IF operand.op.type.length > 1 THEN
  4900. Emit(Push(position, operand.op));
  4901. ELSE
  4902. size := system.SizeOf(type);
  4903. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4904. size := ToMemoryUnits(system,size);
  4905. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4906. arrayDestinationTag := sp;
  4907. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4908. END;
  4909. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4910. Designate(expression,operand);
  4911. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4912. (* static array no pointer *)
  4913. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4914. Symbol(variable,variableOp);
  4915. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4916. Emit(Mov(position,tmp,operand.op));
  4917. Emit(Push(position,variableOp.op));
  4918. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4919. Pass((operand.op));
  4920. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4921. END;
  4922. ELSE HALT(200)
  4923. END;
  4924. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4925. IF parameter.kind = SyntaxTree.VarParameter THEN
  4926. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4927. Designate(expression, operand);
  4928. Pass((operand.op));
  4929. ELSE
  4930. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4931. Evaluate(expression, operand);
  4932. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,system.lenType) = system.AlignmentOf(system.variableAlignment,system.lenType)) THEN
  4933. Pass((operand.extra)); (* step *)
  4934. Pass((operand.tag)); (* last *)
  4935. Pass((operand.op)); (* first *)
  4936. ELSE
  4937. (* pass range as structure in order to comply with the variable alignment of its components *)
  4938. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  4939. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,system.lenType)));
  4940. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4941. tmp := sp;
  4942. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4943. Emit(Mov(position,tmp,operand.op)); (* first *)
  4944. size := ToMemoryUnits(system,system.AlignedSizeOf(system.lenType));
  4945. IntermediateCode.AddOffset(tmp,size);
  4946. Emit(Mov(position,tmp,operand.tag)); (* last *)
  4947. IntermediateCode.AddOffset(tmp,size);
  4948. Emit(Mov(position,tmp,operand.extra)); (* step *)
  4949. END;
  4950. END
  4951. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4952. IF parameter.kind = SyntaxTree.VarParameter THEN
  4953. Designate(expression, operand);
  4954. Pass((operand.op));
  4955. ELSE
  4956. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4957. Evaluate(expression, operand);
  4958. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  4959. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  4960. Pass((operand.tag)); (* imaginary part *)
  4961. Pass((operand.op)) (* real part *)
  4962. ELSE
  4963. (* pass complex as structure in order to comply with the variable alignment of its components *)
  4964. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  4965. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,componentType)));
  4966. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4967. tmp := sp;
  4968. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4969. Emit(Mov(position,tmp,operand.op)); (* real part *)
  4970. size := ToMemoryUnits(system,system.AlignedSizeOf(componentType));
  4971. IntermediateCode.AddOffset(tmp,size);
  4972. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  4973. END
  4974. END
  4975. ELSE
  4976. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4977. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4978. Designate(expression,operand);
  4979. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4980. (* stack allocation *)
  4981. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4982. (*! parameter alignment to be discussed ... *)
  4983. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4984. size := type(SyntaxTree.StringType).length;
  4985. END;
  4986. IF backend.cooperative & parameter.NeedsTrace() THEN
  4987. dst := NewRegisterOperand (addressType);
  4988. Emit(Mov(position,dst, sp));
  4989. IntermediateCode.InitImmediate(null, byteType, 0);
  4990. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4991. ReleaseIntermediateOperand(dst);
  4992. SaveRegisters();ReleaseUsedRegisters(saved);
  4993. (* register dst has been freed before SaveRegisters already *)
  4994. CallAssignMethod(dst, operand.op, parameter.type);
  4995. RestoreRegisters(saved);
  4996. END;
  4997. IF operand.op.type.length > 1 THEN (* vector *)
  4998. MakeMemory(tmp,sp,operand.op.type,0);
  4999. Emit(Mov(position, tmp, operand.op));
  5000. ELSE
  5001. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  5002. END;
  5003. ELSIF IsOpenArray(parameter.type) THEN
  5004. Designate(expression,operand);
  5005. baseReg := operand.tag;
  5006. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5007. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  5008. END;
  5009. Pass((operand.op)); (* address of the array *)
  5010. ELSIF IsDelegate(parameter.type) THEN
  5011. Evaluate(expression,operand);
  5012. IF backend.cooperative & parameter.NeedsTrace() THEN
  5013. Emit(Push(position, nil));
  5014. dst := NewRegisterOperand (addressType);
  5015. Emit(Mov(position,dst, sp));
  5016. ReleaseIntermediateOperand(dst);
  5017. SaveRegisters();ReleaseUsedRegisters(saved);
  5018. Emit(Push(position, dst));
  5019. (* register dst has been freed before SaveRegisters already *)
  5020. Emit(Push(position, operand.tag));
  5021. CallThis(position,"GarbageCollector","Assign",2);
  5022. RestoreRegisters(saved);
  5023. ELSE
  5024. Pass((operand.tag));
  5025. END;
  5026. Pass((operand.op));
  5027. ELSE
  5028. Evaluate(expression,operand);
  5029. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  5030. Emit(Push(position, nil));
  5031. dst := NewRegisterOperand (addressType);
  5032. Emit(Mov(position,dst, sp));
  5033. ReleaseIntermediateOperand(dst);
  5034. SaveRegisters();ReleaseUsedRegisters(saved);
  5035. Emit(Push(position, dst));
  5036. (* register dst has been freed before SaveRegisters already *)
  5037. Emit(Push(position, operand.op));
  5038. CallThis(position,"GarbageCollector","Assign",2);
  5039. RestoreRegisters(saved);
  5040. ELSE
  5041. Pass((operand.op));
  5042. END;
  5043. END;
  5044. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  5045. Evaluate(expression,operand);
  5046. Pass((operand.op));
  5047. ELSE (* var parameter *)
  5048. Designate(expression,operand);
  5049. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5050. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5051. Pass((operand.tag));
  5052. END;
  5053. END;
  5054. Pass((operand.op));
  5055. END;
  5056. END;
  5057. (* TODO: needed? *)
  5058. arrayDestinationTag := oldArrayDestinationTag;
  5059. arrayDestinationDimension := oldArrayDestinationDimension;
  5060. IF needsParameterBackup THEN
  5061. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5062. ReuseCopy(parameterBackup, operand.op)
  5063. END;
  5064. ReleaseOperand(operand);
  5065. IF Trace THEN TraceExit("PushParameter") END;
  5066. END PushParameter;
  5067. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  5068. BEGIN
  5069. 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
  5070. Expression(x.result); (* use register *)
  5071. END;
  5072. Statement(x.statement);
  5073. IF x.result # NIL THEN Expression(x.result) END;
  5074. 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
  5075. ReleaseIntermediateOperand(result.op);
  5076. END;
  5077. END VisitStatementDesignator;
  5078. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  5079. VAR
  5080. procedure: SyntaxTree.Procedure;
  5081. procedureType: SyntaxTree.ProcedureType;
  5082. wasInline: BOOLEAN;
  5083. actualParameters: SyntaxTree.ExpressionList;
  5084. formalParameter: SyntaxTree.Parameter;
  5085. actualParameter: SyntaxTree.Expression;
  5086. i: LONGINT;
  5087. localVariable: SyntaxTree.Variable;
  5088. variableDesignator, returnDesignator: SyntaxTree.Expression;
  5089. src, dest: Operand;
  5090. prevInlineExit : Label;
  5091. prevMapper: SymbolMapper;
  5092. tooComplex: BOOLEAN;
  5093. resultDesignator: SyntaxTree.Expression;
  5094. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5095. BEGIN
  5096. IF e = NIL THEN RETURN TRUE
  5097. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5098. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5099. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5100. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5101. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5102. ELSE RETURN FALSE
  5103. END;
  5104. END SimpleExpression;
  5105. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5106. BEGIN
  5107. RETURN checker.CanPassInRegister(type)
  5108. END FitsInRegister;
  5109. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5110. VAR
  5111. variable: SyntaxTree.Variable;
  5112. variableDesignator: SyntaxTree.Designator;
  5113. BEGIN
  5114. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5115. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5116. variableDesignator.SetType(type);
  5117. RETURN variableDesignator
  5118. END GetTemp;
  5119. BEGIN
  5120. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5121. wasInline := currentIsInline;
  5122. prevInlineExit := currentInlineExit;
  5123. prevMapper := currentMapper;
  5124. currentInlineExit := NewLabel();
  5125. tooComplex := FALSE;
  5126. NEW(currentMapper);
  5127. currentIsInline := TRUE;
  5128. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5129. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5130. formalParameter := procedureType.firstParameter;
  5131. actualParameters := x.parameters;
  5132. i := 0;
  5133. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5134. actualParameter := actualParameters.GetExpression(i);
  5135. IF actualParameter.resolved # NIL THEN
  5136. actualParameter := actualParameter.resolved
  5137. END;
  5138. (*
  5139. if expression is simple and can be passed immediately
  5140. or if type fits in register then we can proceed
  5141. otherwise we escape to ordinary procedure call.
  5142. *)
  5143. (* cases where the expression can be mapped identically *)
  5144. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5145. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5146. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5147. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5148. (*
  5149. Assign(variableDesignator, actualParameter);
  5150. *)
  5151. Evaluate(actualParameter, src);
  5152. Designate(variableDesignator, dest);
  5153. Emit(Mov(x.position, dest.op, src.op));
  5154. ReleaseOperand(dest);
  5155. ReleaseOperand(src);
  5156. (* the src operand should now have been completely released ! *)
  5157. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5158. ELSE tooComplex := TRUE
  5159. END;
  5160. (*
  5161. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5162. currentMapper.Add(formalParameter, actualParameter, NIL);
  5163. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5164. variableDesignator := GetTemp(system.addressType, FALSE);
  5165. Designate(actualParameter, src);
  5166. Designate(variableDesignator, dest);
  5167. IntermediateCode.MakeMemory(dest.op,addressType);
  5168. Emit(Mov(x.position, dest.op, src.op));
  5169. ReleaseOperand(dest);
  5170. IF src.tag.mode # IntermediateCode.Undefined THEN
  5171. tagDesignator := GetTemp(system.addressType, FALSE);
  5172. Designate(tagDesignator, dest);
  5173. IntermediateCode.MakeMemory(dest.op,addressType);
  5174. Emit(Mov(x.position, dest.op, src.op));
  5175. END;
  5176. ReleaseOperand(dest); ReleaseOperand(src);
  5177. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5178. END;
  5179. *)
  5180. formalParameter := formalParameter.nextParameter;
  5181. INC(i);
  5182. END;
  5183. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5184. IF resultDesignator # NIL THEN
  5185. returnDesignator := resultDesignator
  5186. ELSE
  5187. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5188. END;
  5189. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5190. END;
  5191. localVariable := procedure.procedureScope.firstVariable;
  5192. WHILE ~tooComplex & (localVariable # NIL) DO
  5193. variableDesignator := GetTemp(localVariable.type, FALSE);
  5194. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5195. localVariable := localVariable.nextVariable;
  5196. END;
  5197. IF ~tooComplex THEN
  5198. VisitStatementBlock(procedure.procedureScope.body);
  5199. SetLabel(currentInlineExit);
  5200. IF procedureType.returnType # NIL THEN
  5201. Designate(returnDesignator, result);
  5202. END;
  5203. END;
  5204. currentMapper := prevMapper;
  5205. currentInlineExit := prevInlineExit;
  5206. currentIsInline := wasInline;
  5207. RETURN ~tooComplex
  5208. END InlineProcedureCall;
  5209. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5210. VAR
  5211. parameters: SyntaxTree.ExpressionList;
  5212. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5213. designator: SyntaxTree.Designator;
  5214. procedureType: SyntaxTree.ProcedureType;
  5215. formalParameter: SyntaxTree.Parameter;
  5216. operand: Operand;
  5217. reg, size, mask, dest: IntermediateCode.Operand;
  5218. saved,saved2: RegisterEntry;
  5219. symbol: SyntaxTree.Symbol;
  5220. variable: SyntaxTree.Variable;
  5221. i, parametersSize : LONGINT;
  5222. structuredReturnType: BOOLEAN;
  5223. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5224. tempVariableDesignator: SyntaxTree.Designator;
  5225. gap, alignment: LONGINT; (*fld*)
  5226. (* TODO: remove unnecessary backup variables *)
  5227. oldResult: Operand;
  5228. oldCurrentScope: SyntaxTree.Scope;
  5229. oldArrayDestinationTag: IntermediateCode.Operand;
  5230. oldArrayDestinationDimension: LONGINT;
  5231. oldConstantDeclaration: SyntaxTree.Symbol;
  5232. oldDestination: IntermediateCode.Operand;
  5233. oldCurrentLoop: Label;
  5234. oldTrueLabel, oldFalseLabel: Label;
  5235. oldLocked: BOOLEAN;
  5236. usedRegisters,oldUsedRegisters: RegisterEntry;
  5237. return: IntermediateCode.Operand;
  5238. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5239. arg: IntermediateCode.Operand;
  5240. dummy: IntermediateCode.Operand;
  5241. recordType: SyntaxTree.RecordType;
  5242. operatorSelectionProcedureOperand: Operand;
  5243. operatorSelectionProcedure: SyntaxTree.Procedure;
  5244. fingerPrint: SyntaxTree.FingerPrint;
  5245. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5246. identifierNumber: LONGINT;
  5247. parameterRegisters: SIZE;
  5248. registers: ARRAY 64 OF WORD;
  5249. procedure: SyntaxTree.Procedure;
  5250. callingConvention: SyntaxTree.CallingConvention;
  5251. type: IntermediateCode.Type;
  5252. PROCEDURE BackupGlobalState;
  5253. BEGIN
  5254. oldResult := result;
  5255. oldCurrentScope := currentScope;
  5256. oldArrayDestinationTag := arrayDestinationTag;
  5257. oldArrayDestinationDimension := arrayDestinationDimension;
  5258. oldConstantDeclaration := constantDeclaration;
  5259. oldDestination := destination;
  5260. oldCurrentLoop := currentLoop;
  5261. oldTrueLabel := trueLabel;
  5262. oldFalseLabel := falseLabel;
  5263. oldLocked := locked;
  5264. oldUsedRegisters := usedRegisters
  5265. END BackupGlobalState;
  5266. PROCEDURE RestoreGlobalState;
  5267. BEGIN
  5268. result := oldResult;
  5269. currentScope := oldCurrentScope;
  5270. arrayDestinationTag := oldArrayDestinationTag;
  5271. arrayDestinationDimension := oldArrayDestinationDimension;
  5272. constantDeclaration := oldConstantDeclaration;
  5273. destination := oldDestination;
  5274. currentLoop := oldCurrentLoop;
  5275. trueLabel := oldTrueLabel;
  5276. falseLabel := oldFalseLabel;
  5277. locked := oldLocked;
  5278. usedRegisters := oldUsedRegisters
  5279. END RestoreGlobalState;
  5280. (** do preparations before parameter push for array-structured object types (ASOTs):
  5281. if ASOT is passed as VAR parameter:
  5282. - allocate temporary variable of math array type
  5283. - copy contents of ASOT to be passed to temporary variable
  5284. - use temporary variable as the actual parameter instead
  5285. - 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)
  5286. **)
  5287. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5288. VAR
  5289. expression: SyntaxTree.Expression;
  5290. BEGIN
  5291. IF actualParameter IS SyntaxTree.Designator THEN
  5292. designator := actualParameter(SyntaxTree.Designator);
  5293. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5294. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5295. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5296. ASSERT(checker # NIL);
  5297. checker.SetCurrentScope(currentScope);
  5298. (* allocate temporary variable *)
  5299. ASSERT(actualParameter.type # NIL);
  5300. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5301. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5302. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5303. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5304. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5305. ASSERT(tempVariableDesignator.type # NIL);
  5306. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5307. (* copy math array stored in actual parameter to temporary variable *)
  5308. BackupGlobalState;
  5309. AssignMathArray(tempVariableDesignator, actualParameter);
  5310. RestoreGlobalState;
  5311. (* use temporary variable as actual parameter instead of the original one *)
  5312. actualParameter := tempVariableDesignator;
  5313. (* create write-back call and store it in linked list *)
  5314. (* create new list entry *)
  5315. IF firstWriteBackCall = NIL THEN
  5316. NEW(firstWriteBackCall);
  5317. currentWriteBackCall := firstWriteBackCall
  5318. ELSE
  5319. ASSERT(currentWriteBackCall # NIL);
  5320. NEW(currentWriteBackCall.next);
  5321. currentWriteBackCall := currentWriteBackCall.next
  5322. END;
  5323. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5324. ASSERT(expression.type = NIL);
  5325. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5326. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5327. (* prepare writeback for any other "normal" indexer *)
  5328. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5329. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5330. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5331. Assign(tempVariableDesignator, actualParameter);
  5332. actualParameter := tempVariableDesignator;
  5333. IF firstWriteBackCall = NIL THEN
  5334. NEW(firstWriteBackCall);
  5335. currentWriteBackCall := firstWriteBackCall
  5336. ELSE
  5337. ASSERT(currentWriteBackCall # NIL);
  5338. NEW(currentWriteBackCall.next);
  5339. currentWriteBackCall := currentWriteBackCall.next
  5340. END;
  5341. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5342. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5343. END
  5344. END
  5345. END PrepareParameter;
  5346. BEGIN
  5347. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5348. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5349. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5350. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5351. IF InlineProcedureCall(x) THEN
  5352. RETURN
  5353. ELSE
  5354. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5355. END
  5356. END;
  5357. END;
  5358. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5359. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5360. callingConvention := procedureType.callingConvention;
  5361. dest := destination; destination := emptyOperand;
  5362. SaveRegisters();ReleaseUsedRegisters(saved);
  5363. parameters := x.parameters;
  5364. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5365. (* an operator is called *)
  5366. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5367. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5368. (* check if a dynamic operator call should be performed *)
  5369. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5370. ELSE
  5371. isCallOfDynamicOperator := FALSE
  5372. END;
  5373. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5374. Emit(Push(position, ap));
  5375. END;
  5376. alignment := procedureType.stackAlignment;
  5377. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5378. alignment := 16 (* bytes *);
  5379. END;
  5380. IF alignment > 1 THEN
  5381. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5382. Emit(Mov(position,reg, sp));
  5383. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5384. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5385. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5386. gap := 4*ToMemoryUnits(system,system.addressSize);
  5387. END;
  5388. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5389. backend.ResetParameterRegisters();
  5390. formalParameter := procedureType.firstParameter;
  5391. FOR i := 0 TO parameters.Length()-1 DO
  5392. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5393. type := addressType;
  5394. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5395. type := addressType;
  5396. ELSE
  5397. type := GetType(system, formalParameter.type);
  5398. END;
  5399. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5400. DEC (gap, ToMemoryUnits(system,system.addressSize))
  5401. END;
  5402. formalParameter := formalParameter.nextParameter;
  5403. END;
  5404. IF gap < 0 THEN
  5405. gap := 0
  5406. END;
  5407. ELSE
  5408. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5409. END;
  5410. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5411. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5412. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5413. Emit(And(position,sp, sp, mask));
  5414. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5415. Emit(Push(position,reg));
  5416. ReleaseIntermediateOperand(reg);
  5417. END;
  5418. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5419. (* align stack to 16-byte boundary *)
  5420. IntermediateCode.InitImmediate(mask,addressType,-16);
  5421. Emit(And(position,sp, sp, mask));
  5422. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5423. IF gap # 0 THEN
  5424. IntermediateCode.InitImmediate(size,addressType,gap);
  5425. Emit(Sub(position,sp,sp,size))
  5426. END;
  5427. END;
  5428. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5429. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5430. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5431. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5432. ELSE
  5433. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5434. END;
  5435. IF procedureType.selfParameter # NIL THEN (* type bound procedure in a record *)
  5436. Designate(x.left(SyntaxTree.Designator).left, operand);
  5437. Emit(Push(position, operand.tag));
  5438. Emit(Push(position, operand.op));
  5439. Symbol(symbol, operand);
  5440. LoadValue(operand, symbol.type);
  5441. (*
  5442. PushParameter(x.left(SyntaxTree.Designator).left, procedureType.selfParameter, callingConvention, FALSE, dummy,-1);
  5443. Evaluate(x.left, operand);
  5444. *)
  5445. ELSE
  5446. Evaluate(x.left, operand);
  5447. IF symbol IS SyntaxTree.Procedure THEN
  5448. IF (procedureType.selfParameter # NIL) THEN
  5449. Emit(Push(position,operand.tag));
  5450. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5451. Emit(Push(position,operand.tag));
  5452. ELSIF (procedureType.isDelegate) THEN
  5453. Emit(Push(position,operand.tag));
  5454. END;
  5455. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5456. IF (procedureType.selfParameter # NIL) THEN
  5457. Emit(Push(position,operand.tag));
  5458. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5459. Emit(Push(position,operand.tag));
  5460. END;
  5461. ELSE HALT(200);
  5462. END;
  5463. END;
  5464. ReleaseIntermediateOperand(operand.tag);
  5465. operand.tag := emptyOperand;
  5466. (* determine if a structured return type is needed *)
  5467. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5468. IF structuredReturnType THEN
  5469. IF resultDesignator # NIL THEN
  5470. d := resultDesignator;
  5471. ELSE
  5472. (* temporary result that might be allocated, must potentially be traced *)
  5473. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5474. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5475. d.SetType(variable.type);
  5476. END;
  5477. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5478. Designate(d,returnValue);
  5479. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5480. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5481. Emit(Push(position,size));
  5482. Emit(Push(position,returnValue.op));
  5483. ReleaseOperand(returnValue);
  5484. ELSE*)
  5485. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5486. (*
  5487. END;
  5488. *)
  5489. END;
  5490. firstWriteBackCall := NIL; (* reset write-back call list *)
  5491. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5492. parameterRegisters := 0;
  5493. backend.ResetParameterRegisters();
  5494. formalParameter := procedureType.firstParameter;
  5495. FOR i := 0 TO parameters.Length()-1 DO
  5496. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5497. type := addressType;
  5498. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5499. type := addressType;
  5500. ELSE
  5501. type := GetType(system, formalParameter.type);
  5502. END;
  5503. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5504. INC(parameterRegisters);
  5505. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5506. Error(actualParameter.position,"cannot be passed by register")
  5507. END;
  5508. ELSE
  5509. registers[i] := -1;
  5510. END;
  5511. formalParameter := formalParameter.nextParameter;
  5512. END;
  5513. formalParameter := procedureType.lastParameter;
  5514. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5515. actualParameter := parameters.GetExpression(i);
  5516. PrepareParameter(actualParameter, formalParameter);
  5517. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy, registers[i]);
  5518. formalParameter := formalParameter.prevParameter;
  5519. END;
  5520. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5521. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5522. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,32)));
  5523. END;
  5524. ELSE
  5525. hasDynamicOperands := FALSE;
  5526. formalParameter := procedureType.firstParameter;
  5527. FOR i := 0 TO parameters.Length() - 1 DO
  5528. actualParameter := parameters.GetExpression(i);
  5529. IF formalParameter # NIL THEN (* TENTATIVE *)
  5530. PrepareParameter(actualParameter, formalParameter);
  5531. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5532. ASSERT(i < 2);
  5533. hasDynamicOperands := TRUE;
  5534. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5535. ELSE
  5536. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5537. END;
  5538. formalParameter := formalParameter.nextParameter;
  5539. END;
  5540. END;
  5541. END;
  5542. IF symbol IS SyntaxTree.Procedure THEN
  5543. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5544. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5545. Emit(Push(position,reg));
  5546. ReleaseIntermediateOperand(reg);
  5547. END;
  5548. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5549. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5550. parametersSize := ParametersSize(system,procedureType, FALSE);
  5551. END;
  5552. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5553. (*
  5554. dynamic operator overloading:
  5555. first push parameters, regularly:
  5556. [self]
  5557. par1
  5558. par2
  5559. then push parameters for GetOperator
  5560. identifier
  5561. ptr1
  5562. tag
  5563. ptr2
  5564. tag
  5565. call GetOperatorRuntimeProc
  5566. call Operator
  5567. *)
  5568. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5569. (* push ID *)
  5570. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5571. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5572. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5573. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5574. formalParameter := procedureType.firstParameter;
  5575. FOR i := 0 TO parameters.Length() - 1 DO
  5576. IF formalParameter.access # SyntaxTree.Hidden THEN
  5577. ASSERT(i < 2);
  5578. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5579. (* push pointer *)
  5580. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5581. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5582. (* add dereference *)
  5583. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5584. (*! better: do refer to stack above than using parameter backups !!*)
  5585. ReleaseIntermediateOperand(parameterBackups[i]);
  5586. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5587. END;
  5588. Emit(Push(position,parameterBackups[i]));
  5589. ReleaseIntermediateOperand(parameterBackups[i]);
  5590. (* push typetag *)
  5591. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5592. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5593. arg := TypeDescriptorAdr(recordType);
  5594. Emit(Push(position,arg));
  5595. ELSE
  5596. (* push 'NonPointer' *)
  5597. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5598. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5599. (* push fingerprint *)
  5600. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5601. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5602. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5603. END
  5604. END;
  5605. formalParameter := formalParameter.nextParameter
  5606. END;
  5607. (* for unary operators: complete the information for the second parameter *)
  5608. IF procedureType.numberParameters < 2 THEN
  5609. (* push 'NonPointer' *)
  5610. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5611. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5612. (* push 'NoType' *)
  5613. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5614. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5615. END;
  5616. (* call operator selection procedure *)
  5617. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5618. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5619. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5620. ReleaseOperand(operatorSelectionProcedureOperand);
  5621. (* use the address that the operator selection procedure returned as the target address of the call *)
  5622. InitOperand(operand, ModeValue);
  5623. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5624. Emit(Result(position,operand.op))
  5625. END
  5626. END;
  5627. ReleaseParameterRegisters();
  5628. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5629. SaveRegisters();ReleaseUsedRegisters(saved2);
  5630. CallThis(position,"Objects","LeaveA2",0);
  5631. RestoreRegisters(saved2);
  5632. END;
  5633. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5634. Emit(Call(position,operand.op,0));
  5635. ELSE
  5636. Emit(Call(position,operand.op,parametersSize));
  5637. END;
  5638. ReleaseOperand(operand);
  5639. IF procedureType.noReturn THEN
  5640. EmitTrap(position,NoReturnTrap);
  5641. END;
  5642. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5643. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5644. Emit(Result(position,return));
  5645. END;
  5646. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5647. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5648. Emit(Push(position, return));
  5649. CallThis(position,"Objects","ReenterA2",0);
  5650. Emit(Pop(position, return));
  5651. ELSE
  5652. CallThis(position,"Objects","ReenterA2",0);
  5653. END;
  5654. END;
  5655. (* === return parameter space === *)
  5656. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5657. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5658. (* cleanup all space for all parameters *)
  5659. IF parametersSize < 32 THEN
  5660. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5661. parametersSize := 32
  5662. END;
  5663. size := IntermediateCode.Immediate(addressType,parametersSize);
  5664. Emit(Add(position,sp,sp,size))
  5665. END;
  5666. IF (callingConvention IN SysvABI) THEN
  5667. IF parameterRegisters > 0 THEN
  5668. IF parameters.Length() > parameterRegisters THEN
  5669. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5670. ELSE
  5671. parametersSize := 0
  5672. END;
  5673. ELSE
  5674. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5675. INC( parametersSize, (-parametersSize) MOD 16 )
  5676. END;
  5677. IF parametersSize > 0 THEN
  5678. size := IntermediateCode.Immediate(addressType,parametersSize);
  5679. Emit(Add(position,sp,sp,size))
  5680. END;
  5681. END;
  5682. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5683. IF structuredReturnType THEN
  5684. (* stack pointer rewinding done by callee
  5685. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5686. Emit(Add(position,sp,sp,size));
  5687. *)
  5688. RestoreRegisters(saved);
  5689. InitOperand(result,ModeReference);
  5690. Symbol(variable,result);
  5691. ELSE
  5692. RestoreRegisters(saved);
  5693. InitOperand(result,ModeValue);
  5694. result.op := return;
  5695. END;
  5696. END;
  5697. IF alignment > 1 THEN
  5698. Emit(Pop(position,sp));
  5699. END;
  5700. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5701. Emit(Pop(position, ap));
  5702. END;
  5703. destination := dest;
  5704. (* perform all write-back calls in the list *)
  5705. BackupGlobalState;
  5706. currentWriteBackCall := firstWriteBackCall;
  5707. WHILE currentWriteBackCall # NIL DO
  5708. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5709. currentWriteBackCall := currentWriteBackCall.next
  5710. END;
  5711. RestoreGlobalState;
  5712. (* TENATIVE *)
  5713. (*
  5714. IF isOperatorCall THEN
  5715. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5716. END;
  5717. *)
  5718. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5719. END VisitProcedureCallDesignator;
  5720. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5721. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5722. td: SyntaxTree.Symbol;
  5723. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5724. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5725. BEGIN
  5726. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5727. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5728. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5729. variable.SetType(system.anyType);
  5730. scope.AddVariable(variable);
  5731. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5732. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5733. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5734. typeDeclaration.SetScope(module.module.moduleScope);
  5735. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5736. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5737. END;
  5738. RETURN hiddenPointerType;
  5739. END GetHiddenPointerType;
  5740. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5741. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5742. BEGIN
  5743. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5744. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5745. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5746. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5747. scope.AddVariable(variable);
  5748. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5749. variable.SetType(system.anyType);
  5750. scope.AddVariable(variable);
  5751. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5752. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5753. typeDeclaration.SetDeclaredType(delegatePointerType);
  5754. typeDeclaration.SetScope(module.module.moduleScope);
  5755. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5756. delegatePointerType.SetState(SyntaxTree.Resolved);
  5757. END;
  5758. RETURN delegatePointerType
  5759. END GetDelegateType;
  5760. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5761. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5762. such as in VAR a: RECORD ... END;
  5763. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5764. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5765. *)
  5766. VAR source: Sections.Section;td: SyntaxTree.TypeDeclaration;
  5767. baseRecord: SyntaxTree.RecordType;
  5768. BEGIN (* no code emission *)
  5769. source := NIL;
  5770. x := x.resolved;
  5771. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5772. x := GetHiddenPointerType();
  5773. ELSIF IsDelegate(x) THEN
  5774. x := GetDelegateType();
  5775. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5776. ELSE HALT(200);
  5777. END;
  5778. td := x.typeDeclaration;
  5779. IF td = NIL THEN
  5780. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5781. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5782. ASSERT(td # NIL);
  5783. END;
  5784. GetCodeSectionNameForSymbol(td,name);
  5785. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5786. meta.CheckTypeDeclaration(x);
  5787. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5788. ELSE
  5789. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5790. END;
  5791. IF backend.cooperative OR meta.simple THEN
  5792. offset := 0;
  5793. ELSE
  5794. IF x IS SyntaxTree.CellType THEN
  5795. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5796. IF baseRecord = NIL THEN
  5797. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5798. ELSE
  5799. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5800. END;
  5801. ELSE
  5802. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5803. END;
  5804. END;
  5805. RETURN td
  5806. END GetBackendType;
  5807. BEGIN
  5808. (*td := t.typeDeclaration;*)
  5809. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5810. (*
  5811. IF t IS SyntaxTree.PointerType THEN
  5812. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5813. ELSE
  5814. source := GetBackendType(t);
  5815. END;
  5816. *)
  5817. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5818. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5819. IntermediateCode.SetOffset(res,offset);
  5820. (*
  5821. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5822. make memory should be used when tag is used, not earlier
  5823. *)
  5824. RETURN res
  5825. END TypeDescriptorAdr;
  5826. (*
  5827. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5828. VAR result: IntermediateCode.Operand;
  5829. BEGIN
  5830. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5831. operand.tag := TypeDescriptorAdr(operand.type);
  5832. IntermediateCode.MakeMemory(operand.tag,addressType);
  5833. UseIntermediateOperand(operand.tag);
  5834. END;
  5835. END MakeTypeTag;
  5836. *)
  5837. PROCEDURE ProfilerInit;
  5838. VAR reg: IntermediateCode.Operand;
  5839. BEGIN
  5840. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5841. Emit(Call(position,reg,0));
  5842. END ProfilerInit;
  5843. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5844. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5845. BEGIN
  5846. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5847. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5848. THEN
  5849. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5850. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5851. Emit(Push(position,reg));
  5852. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5853. Emit(Push(position,reg));
  5854. StaticCallOperand(result,procedure);
  5855. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5856. ReleaseOperand(result);
  5857. END;
  5858. END ProfilerEnterExit;
  5859. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5860. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5861. BEGIN
  5862. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5863. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5864. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5865. profileInit.Emit(Push(position,reg));
  5866. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5867. profileInit.Emit(Push(position,reg));
  5868. NEW(string, LEN(name)); COPY(name, string^);
  5869. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5870. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5871. sv.SetType(type);
  5872. Designate(sv,result);
  5873. profileInit.Emit(Push(position,result.tag));
  5874. profileInit.Emit(Push(position,result.op));
  5875. StaticCallOperand(result,procedure);
  5876. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5877. ReleaseOperand(result);
  5878. END;
  5879. END ProfilerAddProcedure;
  5880. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5881. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5882. BEGIN
  5883. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5884. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5885. profileInit.Emit(Push(position,reg));
  5886. profileInitPatchPosition := profileInit.pc;
  5887. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5888. NEW(string, LEN(name)); COPY(name, string^);
  5889. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5890. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5891. sv.SetType(type);
  5892. Designate(sv,result);
  5893. profileInit.Emit(Push(position,result.tag));
  5894. profileInit.Emit(Push(position,result.op));
  5895. StaticCallOperand(result,procedure);
  5896. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5897. ReleaseOperand(result);
  5898. END;
  5899. END ProfilerAddModule;
  5900. PROCEDURE ProfilerPatchInit;
  5901. VAR reg: IntermediateCode.Operand;
  5902. BEGIN
  5903. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5904. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5905. EmitLeave(profileInit,position,NIL,0);
  5906. profileInit.Emit(Exit(position,0,0,0));
  5907. END ProfilerPatchInit;
  5908. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5909. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5910. VAR
  5911. id: LONGINT;
  5912. leftType, rightType: SyntaxTree.Type;
  5913. procedureType: SyntaxTree.ProcedureType;
  5914. runtimeProcedure: SyntaxTree.Procedure;
  5915. runtimeProcedureOperand, operatorOperand: Operand;
  5916. kind: SET;
  5917. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5918. VAR
  5919. arg: IntermediateCode.Operand;
  5920. recordType: SyntaxTree.RecordType;
  5921. fingerPrint: SyntaxTree.FingerPrint;
  5922. BEGIN
  5923. IF type = NIL THEN
  5924. (* no type: push 'NoType' *)
  5925. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5926. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5927. ELSIF IsStrictlyPointerToRecord(type) THEN
  5928. (* pointer to record type: push typetag *)
  5929. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5930. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5931. arg := TypeDescriptorAdr(recordType);
  5932. ELSE
  5933. (* non-pointer to record type: push fingerprint *)
  5934. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5935. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5936. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5937. END;
  5938. operatorInitializationCodeSection.Emit(Push(position,arg))
  5939. END PushTypeInfo;
  5940. BEGIN
  5941. ASSERT(operatorInitializationCodeSection # NIL);
  5942. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5943. procedureType := operator.type(SyntaxTree.ProcedureType);
  5944. (* determine types *)
  5945. leftType := procedureType.firstParameter.type;
  5946. IF procedureType.numberParameters = 2 THEN
  5947. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5948. rightType := procedureType.firstParameter.nextParameter.type;
  5949. ELSE
  5950. rightType := NIL
  5951. END;
  5952. (* determine operator kind *)
  5953. IF IsStrictlyPointerToRecord(leftType) THEN
  5954. kind := {LhsIsPointer}
  5955. ELSE
  5956. kind := {}
  5957. END;
  5958. IF IsStrictlyPointerToRecord(rightType) THEN
  5959. kind := kind + {RhsIsPointer}
  5960. END;
  5961. IF kind # {} THEN (* TODO: to be removed later on *)
  5962. (* at least one of the types is a pointer to record *)
  5963. (* emit a code that registers this specific operator in the runtime *)
  5964. dump := operatorInitializationCodeSection.comments;
  5965. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5966. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5967. (* push ID *)
  5968. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5969. id := Global.GetSymbol(module.module.case, operator.name);
  5970. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5971. (* push kind *)
  5972. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5973. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5974. (* push type infos *)
  5975. PushTypeInfo(leftType);
  5976. PushTypeInfo(rightType);
  5977. (* push operator address *)
  5978. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5979. StaticCallOperand(operatorOperand, operator);
  5980. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5981. ReleaseOperand(operatorOperand);
  5982. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5983. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  5984. ReleaseOperand(runtimeProcedureOperand)
  5985. END
  5986. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5987. END
  5988. END RegisterDynamicOperator;
  5989. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5990. VAR
  5991. traceModule: SyntaxTree.Module;
  5992. procedure: SyntaxTree.Procedure;
  5993. procedureVariable: SyntaxTree.Variable;
  5994. s,msg: Basic.MessageString;
  5995. res: Operand;
  5996. i: LONGINT;
  5997. sv: SyntaxTree.StringValue;
  5998. type: SyntaxTree.Type;
  5999. recordType: SyntaxTree.RecordType;
  6000. printout: Printout.Printer;
  6001. stringWriter: Streams.StringWriter;
  6002. expression: SyntaxTree.Expression;
  6003. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  6004. BEGIN
  6005. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  6006. IF procedure = NIL THEN
  6007. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  6008. END;
  6009. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  6010. s := "procedure ";
  6011. Strings.Append(s,backend.traceModuleName);
  6012. Strings.Append(s,".");
  6013. Strings.Append(s,procedureName);
  6014. Strings.Append(s," not present");
  6015. Error(position,s);
  6016. RETURN FALSE
  6017. ELSE
  6018. RETURN TRUE
  6019. END;
  6020. END GetProcedure;
  6021. PROCEDURE CallProcedure;
  6022. VAR size: LONGINT;
  6023. BEGIN
  6024. IF procedure # NIL THEN
  6025. StaticCallOperand(result,procedure);
  6026. size := ProcParametersSize(procedure);
  6027. ELSE
  6028. Symbol(procedureVariable, result);
  6029. LoadValue(result, procedureVariable.type.resolved);
  6030. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  6031. END;
  6032. Emit(Call(position,result.op,size));
  6033. END CallProcedure;
  6034. PROCEDURE String(CONST s: ARRAY OF CHAR);
  6035. VAR res: Operand; string: SyntaxTree.String;
  6036. BEGIN
  6037. IF GetProcedure("String") THEN
  6038. NEW(string, LEN(s)); COPY(s, string^);
  6039. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6040. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6041. sv.SetType(type);
  6042. Designate(sv,res);
  6043. Emit(Push(position,res.tag));
  6044. Emit(Push(position,res.op));
  6045. ReleaseOperand(res);
  6046. CallProcedure;
  6047. END;
  6048. END String;
  6049. PROCEDURE Integer(op: IntermediateCode.Operand);
  6050. BEGIN
  6051. IF GetProcedure("Int") THEN
  6052. Emit(Push(position,op));
  6053. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  6054. CallProcedure;
  6055. END;
  6056. END Integer;
  6057. PROCEDURE Float(op: IntermediateCode.Operand);
  6058. BEGIN
  6059. IF GetProcedure("HIntHex") THEN
  6060. Emit(Push(position,op));
  6061. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  6062. CallProcedure;
  6063. END;
  6064. END Float;
  6065. PROCEDURE Set(op: IntermediateCode.Operand);
  6066. BEGIN
  6067. IF GetProcedure("Set") THEN
  6068. Emit(Push(position,op));
  6069. (*
  6070. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  6071. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  6072. *)
  6073. CallProcedure;
  6074. END;
  6075. END Set;
  6076. PROCEDURE Boolean(op: IntermediateCode.Operand);
  6077. BEGIN
  6078. IF GetProcedure("Boolean") THEN
  6079. Emit(Push(position,op));
  6080. CallProcedure;
  6081. END;
  6082. END Boolean;
  6083. PROCEDURE Char(op: IntermediateCode.Operand);
  6084. BEGIN
  6085. IF GetProcedure("Char") THEN
  6086. Emit(Push(position,op));
  6087. CallProcedure;
  6088. END;
  6089. END Char;
  6090. PROCEDURE Address(op: IntermediateCode.Operand);
  6091. BEGIN
  6092. IF GetProcedure("Address") THEN
  6093. Emit(Push(position,op));
  6094. CallProcedure;
  6095. END;
  6096. END Address;
  6097. PROCEDURE Size(op: IntermediateCode.Operand);
  6098. BEGIN
  6099. IF GetProcedure("Size") THEN
  6100. Emit(Push(position,op));
  6101. CallProcedure;
  6102. END;
  6103. END Size;
  6104. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6105. VAR len: IntermediateCode.Operand;
  6106. BEGIN
  6107. IF GetProcedure("String") THEN
  6108. len := GetArrayLength(type, op.tag);
  6109. Emit(Push(position,len));
  6110. ReleaseIntermediateOperand(len);
  6111. Emit(Push(position,op.op));
  6112. CallProcedure;
  6113. END;
  6114. END StringOperand;
  6115. PROCEDURE Ln;
  6116. BEGIN
  6117. IF GetProcedure("Ln") THEN
  6118. CallProcedure;
  6119. END;
  6120. END Ln;
  6121. BEGIN
  6122. IF backend.traceModuleName = "" THEN RETURN END;
  6123. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6124. IF GetProcedure("Enter") THEN
  6125. CallProcedure
  6126. END;
  6127. NEW(stringWriter,LEN(s));
  6128. FOR i := 0 TO x.Length()-1 DO
  6129. msg := "";
  6130. expression := x.GetExpression(i);
  6131. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6132. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6133. ELSE
  6134. Global.GetModuleName(module.module, s);
  6135. END;
  6136. IF i = 0 THEN
  6137. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6138. stringWriter.String(":");
  6139. END;
  6140. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6141. IF ~(expression IS SyntaxTree.StringValue) THEN
  6142. printout.Expression(expression);
  6143. stringWriter.Get(s);
  6144. Strings.Append(msg,s);
  6145. Strings.Append(msg,"= ");
  6146. ELSE stringWriter.Get(s); (* remove from string writer *)
  6147. Strings.Append(msg, s);
  6148. END;
  6149. String(msg);
  6150. IF SemanticChecker.IsStringType(expression.type) THEN
  6151. Designate(expression,res);
  6152. StringOperand(res, expression.type);
  6153. ELSE
  6154. Evaluate(expression,res);
  6155. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6156. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6157. Convert(res.op,int64);
  6158. END;
  6159. Integer(res.op);
  6160. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6161. Boolean(res.op);
  6162. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6163. Set(res.op);
  6164. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6165. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6166. Convert(res.op,float64);
  6167. END;
  6168. Float(res.op);
  6169. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6170. Char(res.op);
  6171. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6172. Address(res.op);String("H");
  6173. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6174. Size(res.op);
  6175. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6176. Address(res.op);String("H");
  6177. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6178. Address(res.op);String("H");
  6179. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6180. String("NIL");
  6181. ELSE HALT(200);
  6182. END;
  6183. END;
  6184. ReleaseOperand(res);
  6185. String("; ");
  6186. END;
  6187. IF GetProcedure("Exit") THEN
  6188. CallProcedure
  6189. ELSE
  6190. Ln;
  6191. END;
  6192. END;
  6193. END SystemTrace;
  6194. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6195. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6196. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6197. BEGIN
  6198. type := type.resolved;
  6199. IF type IS SyntaxTree.RecordType THEN
  6200. WITH type: SyntaxTree.RecordType DO
  6201. baseType := type.baseType;
  6202. IF baseType # NIL THEN
  6203. baseType := baseType.resolved;
  6204. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6205. InitFields(baseType,adr,offset);
  6206. END;
  6207. variable := type.recordScope.firstVariable;
  6208. WHILE variable # NIL DO
  6209. IF variable.initializer # NIL THEN
  6210. Evaluate(variable.initializer,initializerOp);
  6211. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6212. Emit(Mov(position,mem,initializerOp.op));
  6213. ReleaseOperand(initializerOp);
  6214. ReleaseIntermediateOperand(mem);
  6215. END;
  6216. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6217. variable := variable.nextVariable
  6218. END;
  6219. END;
  6220. ELSIF type IS SyntaxTree.CellType THEN
  6221. WITH type: SyntaxTree.CellType DO
  6222. baseType := type.baseType;
  6223. IF baseType # NIL THEN
  6224. baseType := baseType.resolved;
  6225. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6226. InitFields(baseType,adr,offset);
  6227. END;
  6228. variable := type.cellScope.firstVariable;
  6229. WHILE variable # NIL DO
  6230. IF variable.initializer # NIL THEN
  6231. Evaluate(variable.initializer,initializerOp);
  6232. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6233. Emit(Mov(position,mem,initializerOp.op));
  6234. ReleaseOperand(initializerOp);
  6235. ReleaseIntermediateOperand(mem);
  6236. END;
  6237. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6238. variable := variable.nextVariable
  6239. END;
  6240. END;
  6241. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6242. WITH type: SyntaxTree.ArrayType DO
  6243. IF type.form = SyntaxTree.Static THEN
  6244. baseType := type.arrayBase;
  6245. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6246. FOR i := 0 TO type.staticLength-1 DO
  6247. InitFields(baseType,adr,offset+i*size);
  6248. END;
  6249. END;
  6250. END;
  6251. ELSIF type IS SyntaxTree.MathArrayType THEN
  6252. WITH type: SyntaxTree.MathArrayType DO
  6253. IF type.form = SyntaxTree.Open THEN
  6254. dim := DynamicDim(type);
  6255. imm := IntermediateCode.Immediate(addressType,dim);
  6256. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6257. baseType := SemanticChecker.ArrayBase(type,dim);
  6258. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6259. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6260. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6261. ReleaseIntermediateOperand(imm);
  6262. (* flags remain empty (=0) for open array *)
  6263. ELSIF type.form = SyntaxTree.Static THEN
  6264. baseType := type.arrayBase;
  6265. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6266. ASSERT(type.staticLength < 1024*1024*1024);
  6267. FOR i := 0 TO type.staticLength-1 DO
  6268. InitFields(baseType,adr,offset+i*size);
  6269. END;
  6270. END;
  6271. END;
  6272. END;
  6273. END InitFields;
  6274. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6275. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6276. saved: RegisterEntry;
  6277. BEGIN
  6278. type := variable.type.resolved;
  6279. IF (type IS SyntaxTree.MathArrayType) THEN
  6280. WITH type: SyntaxTree.MathArrayType DO
  6281. IF type.form = SyntaxTree.Open THEN
  6282. Symbol(variable,operand);
  6283. InitFields(type, operand.tag,0);
  6284. IF temporary THEN
  6285. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6286. END;
  6287. ELSIF type.form = SyntaxTree.Tensor THEN
  6288. IF temporary & backend.writeBarriers THEN
  6289. SaveRegisters();ReleaseUsedRegisters(saved);
  6290. Symbol(variable, operand);
  6291. Emit(Push(position,operand.op));
  6292. ReleaseOperand(operand);
  6293. Emit(Push(position,nil));
  6294. CallThis(position,"FoxArrayBase","Assign",2);
  6295. RestoreRegisters(saved);
  6296. ELSE
  6297. Symbol(variable, operand);
  6298. MakeMemory(tmp,operand.op,addressType,0);
  6299. ReleaseOperand(operand);
  6300. IF FALSE & temporary THEN
  6301. (* trick -- temporary object from array base *)
  6302. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6303. Symbol(symbol,operand);
  6304. MakeMemory(mem,operand.op,addressType,0);
  6305. ReleaseOperand(operand);
  6306. Emit(Mov(position,tmp, mem) );
  6307. ReleaseOperand(operand);
  6308. ELSE
  6309. Emit(Mov(position,tmp, nil ) );
  6310. END;
  6311. ReleaseIntermediateOperand(tmp)
  6312. END;
  6313. END;
  6314. END;
  6315. ELSE
  6316. Symbol(variable,operand);
  6317. IF variable.initializer # NIL THEN
  6318. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6319. reference.SetType(variable.type.resolved);
  6320. reference.SetAssignable(TRUE);
  6321. Assign(reference,variable.initializer);
  6322. ELSIF temporary THEN
  6323. IF SemanticChecker.IsPointerType(variable.type) THEN
  6324. IF backend.cooperative THEN
  6325. SaveRegisters();ReleaseUsedRegisters(saved);
  6326. Symbol(variable, operand);
  6327. CallAssignPointer(operand.op, nil);
  6328. ReleaseOperand(operand);
  6329. RestoreRegisters(saved);
  6330. ELSIF backend.writeBarriers THEN
  6331. SaveRegisters();ReleaseUsedRegisters(saved);
  6332. Symbol(variable, operand);
  6333. Emit(Push(position,operand.op));
  6334. ReleaseOperand(operand);
  6335. Emit(Push(position,nil));
  6336. CallThis(position,"Heaps","Assign",2);
  6337. RestoreRegisters(saved);
  6338. ELSE
  6339. Symbol(variable, operand);
  6340. MakeMemory(tmp,operand.op,addressType,0);
  6341. ReleaseOperand(operand);
  6342. Emit(Mov(position,tmp, nil ) );
  6343. ReleaseIntermediateOperand(tmp);
  6344. END;
  6345. END;
  6346. END;
  6347. InitFields(type, operand.op,0);
  6348. ReleaseOperand(operand);
  6349. END;
  6350. END InitVariable;
  6351. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6352. VAR end: Label;
  6353. BEGIN
  6354. IF type.form = SyntaxTree.Tensor THEN
  6355. InitOperand(result,ModeValue);
  6356. ReuseCopy(result.op,base);
  6357. end := NewLabel();
  6358. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6359. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6360. SetLabel(end);
  6361. Convert(result.op,lenType);
  6362. ELSE
  6363. InitOperand(result,ModeValue);
  6364. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6365. END
  6366. END MathArrayDim;
  6367. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6368. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6369. BEGIN
  6370. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6371. MakeMemory(mem,base,addressType,offset);
  6372. Emit(Mov(position,mem,value));
  6373. ReleaseIntermediateOperand(mem);
  6374. END PutMathArrayField;
  6375. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6376. VAR mem: IntermediateCode.Operand;
  6377. BEGIN
  6378. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6379. MakeMemory(mem,base,addressType,offset);
  6380. Emit(Mov(position,mem,value));
  6381. ReleaseIntermediateOperand(mem);
  6382. END PutMathArrayFieldOffset;
  6383. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6384. BEGIN
  6385. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6386. MakeMemory(value,base,addressType,offset);
  6387. END GetMathArrayField;
  6388. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6389. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6390. BEGIN
  6391. IF incr THEN
  6392. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6393. ELSE
  6394. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6395. END;
  6396. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6397. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6398. ELSE
  6399. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6400. Emit(Mov(position,reg,dim));
  6401. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6402. Emit(Add(position,reg,reg,base));
  6403. MakeMemory(mem, reg, addressType, offset);
  6404. ReleaseIntermediateOperand(reg);
  6405. Emit(Mov(position,mem,value));
  6406. ReleaseIntermediateOperand(mem);
  6407. END;
  6408. END PutMathArrayLenOrIncr;
  6409. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6410. BEGIN
  6411. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6412. END PutMathArrayLength;
  6413. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6414. BEGIN
  6415. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6416. END PutMathArrayIncrement;
  6417. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6418. BEGIN
  6419. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6420. END GetMathArrayIncrement;
  6421. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6422. BEGIN
  6423. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6424. END GetMathArrayLength;
  6425. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6426. VAR dimOp: IntermediateCode.Operand;
  6427. BEGIN
  6428. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6429. GetMathArrayLength(type, operand, dimOp, check, result);
  6430. END GetMathArrayLengthAt;
  6431. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6432. VAR dimOp: IntermediateCode.Operand;
  6433. BEGIN
  6434. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6435. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6436. END GetMathArrayIncrementAt;
  6437. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6438. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6439. offset: LONGINT;
  6440. BEGIN
  6441. IF increment THEN
  6442. offset := MathIncrOffset;
  6443. ELSE
  6444. offset := MathLenOffset;
  6445. END;
  6446. INC(offset,operand.dimOffset*2);
  6447. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6448. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6449. END;
  6450. (* static dimension *)
  6451. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6452. IF check & (type.form = SyntaxTree.Tensor) THEN
  6453. DimensionCheck(operand.tag,dim,BrltL);
  6454. END;
  6455. val := SHORT(dim.intValue);
  6456. IF type.form # SyntaxTree.Tensor THEN
  6457. t := SemanticChecker.ArrayBase(type,val);
  6458. type := t.resolved(SyntaxTree.MathArrayType);
  6459. IF type.form = SyntaxTree.Static THEN
  6460. IF increment THEN
  6461. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6462. ELSE
  6463. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6464. END;
  6465. InitOperand(result,ModeValue);
  6466. result.op := res;
  6467. RETURN;
  6468. END;
  6469. END;
  6470. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6471. MakeMemory(res,operand.tag,addressType,offset);
  6472. (*
  6473. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6474. *)
  6475. InitOperand(result,ModeValue);
  6476. result.op := res;
  6477. ELSE
  6478. Convert(dim,addressType);
  6479. IF check THEN
  6480. IF type.form = SyntaxTree.Tensor THEN
  6481. DimensionCheck(operand.tag,dim,BrltL);
  6482. ELSIF isUnchecked THEN (* do nothing *)
  6483. ELSE
  6484. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6485. END;
  6486. END;
  6487. end := NewLabel(); next := NIL;
  6488. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6489. Emit(Mov(position,res,dim));
  6490. Convert(res,sizeType);
  6491. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6492. WHILE t IS SyntaxTree.MathArrayType DO
  6493. type := t(SyntaxTree.MathArrayType);
  6494. IF type.form = SyntaxTree.Static THEN
  6495. imm := IntermediateCode.Immediate(sizeType,val);
  6496. next := NewLabel();
  6497. BrneL(next,imm,res);
  6498. IF increment THEN
  6499. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6500. ELSE
  6501. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6502. END;
  6503. Emit(MovReplace(position,res,imm));
  6504. BrL(end);
  6505. ELSE hasDynamicPart := TRUE;
  6506. END;
  6507. t := type.arrayBase.resolved;
  6508. val := val + 1;
  6509. IF next # NIL THEN SetLabel(next) END;
  6510. END;
  6511. IF hasDynamicPart THEN
  6512. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6513. Emit(Mov(position,res2,dim));
  6514. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6515. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6516. Emit(Add(position,res2,res2,imm));
  6517. Emit(Add(position,res2,res2,operand.tag));
  6518. IntermediateCode.MakeMemory(res2,sizeType);
  6519. Emit(MovReplace(position,res,res2));
  6520. ReleaseIntermediateOperand(res2);
  6521. END;
  6522. SetLabel(end);
  6523. Convert(res,sizeType);
  6524. InitOperand(result,ModeValue);
  6525. result.op := res;
  6526. END;
  6527. END MathArrayLenOrIncr;
  6528. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6529. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6530. offset: LONGINT;
  6531. BEGIN
  6532. offset := operand.dimOffset+DynamicDim(type)-1;
  6533. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6534. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6535. val := SHORT(dim.intValue);
  6536. t := SemanticChecker.ArrayBase(type,val);
  6537. type := t.resolved(SyntaxTree.ArrayType);
  6538. IF type.form = SyntaxTree.Static THEN
  6539. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6540. ELSE
  6541. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6542. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6543. END;
  6544. UseIntermediateOperand(res);
  6545. InitOperand(result,ModeValue);
  6546. result.op := res;
  6547. ELSE
  6548. Convert(dim,addressType);
  6549. IF ~isUnchecked THEN
  6550. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6551. END;
  6552. end := NewLabel(); next := NIL;
  6553. (* ReuseCopy(dim,res); *)
  6554. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6555. Emit(Mov(position,res,dim));
  6556. Convert(res,sizeType);
  6557. Convert(res,sizeType);
  6558. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6559. WHILE t IS SyntaxTree.ArrayType DO
  6560. type := t(SyntaxTree.ArrayType);
  6561. IF type.form = SyntaxTree.Static THEN
  6562. imm := IntermediateCode.Immediate(sizeType,val);
  6563. next := NewLabel();
  6564. BrneL(next,imm,res);
  6565. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6566. Emit(MovReplace(position,res,imm));
  6567. BrL(end);
  6568. ELSE hasDynamicPart := TRUE;
  6569. END;
  6570. t := type.arrayBase.resolved;
  6571. val := val + 1;
  6572. IF next # NIL THEN SetLabel(next) END;
  6573. END;
  6574. IF hasDynamicPart THEN
  6575. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6576. Convert(res2,addressType);
  6577. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6578. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6579. Emit(Sub(position,res2,imm,res2));
  6580. Emit(Add(position,res2,res2,operand.tag));
  6581. IntermediateCode.MakeMemory(res2,sizeType);
  6582. Emit(MovReplace(position,res,res2));
  6583. ReleaseIntermediateOperand(res2);
  6584. END;
  6585. SetLabel(end);
  6586. Convert(res,sizeType);
  6587. InitOperand(result,ModeValue);
  6588. result.op := res;
  6589. END;
  6590. END ArrayLen;
  6591. (**
  6592. create a temporary variable in current scope
  6593. **)
  6594. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6595. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6596. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6597. BEGIN
  6598. IF ~register THEN
  6599. v := temporaries.GetFreeVariable(type, untraced, index);
  6600. ELSE
  6601. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6602. END;
  6603. scope := currentScope;
  6604. (*
  6605. v := NIL; (* disable free variable managemenet for the time being *)
  6606. *)
  6607. name := temporaries.GetUID();
  6608. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6609. variable.SetType(type);
  6610. variable.SetAccess(SyntaxTree.Hidden);
  6611. variable.SetUntraced(untraced);
  6612. IF v = NIL THEN
  6613. temporaries.AddVariable(variable);
  6614. IF ~register THEN
  6615. IF scope.lastVariable # NIL THEN
  6616. offset := scope.lastVariable.offsetInBits;
  6617. ELSE
  6618. offset := 0;
  6619. END;
  6620. DEC(offset,system.SizeOf(variable.type));
  6621. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6622. variable(SyntaxTree.Variable).SetOffset(offset);
  6623. scope.AddVariable(variable(SyntaxTree.Variable));
  6624. scope.EnterSymbol(variable, duplicate);
  6625. ASSERT(~duplicate);
  6626. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6627. ELSE
  6628. variable.SetUseRegister(TRUE);
  6629. variable(SyntaxTree.Variable).SetOffset(0);
  6630. END;
  6631. ELSE (* v # NIL *)
  6632. (* reuse slot for new variable, do not create new slot ! *)
  6633. temporaries.SetVariable(index, variable);
  6634. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6635. ASSERT(~register);
  6636. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6637. ASSERT(v.offsetInBits # 0);
  6638. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6639. scope.EnterSymbol(variable, duplicate);
  6640. ASSERT(~duplicate);
  6641. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6642. END;
  6643. RETURN variable(SyntaxTree.Variable)
  6644. END GetTemporaryVariable;
  6645. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6646. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6647. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6648. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6649. i: LONGINT; duplicate: BOOLEAN;
  6650. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6651. VAR variable: SyntaxTree.Variable;
  6652. BEGIN
  6653. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6654. variable.SetType(type);
  6655. recordScope.AddVariable(variable);
  6656. END AddVariable;
  6657. BEGIN
  6658. name := "@ArrayDescriptor";
  6659. Basic.AppendNumber(name,dimensions);
  6660. identifier := SyntaxTree.NewIdentifier(name);
  6661. parentScope := module.module.moduleScope;
  6662. symbol := parentScope.FindSymbol(identifier);
  6663. IF symbol # NIL THEN
  6664. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6665. type := typeDeclaration.declaredType;
  6666. ELSE
  6667. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6668. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6669. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6670. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6671. recordType.SetTypeDeclaration(typeDeclaration);
  6672. recordType.SetState(SyntaxTree.Resolved);
  6673. typeDeclaration.SetDeclaredType(recordType);
  6674. AddVariable("@ptr",system.anyType);
  6675. AddVariable("@adr",system.addressType);
  6676. AddVariable("@flags",system.addressType);
  6677. AddVariable("@dim",system.addressType);
  6678. AddVariable("@elementSize",system.addressType);
  6679. FOR i := 0 TO dimensions-1 DO
  6680. name := "@len";
  6681. Basic.AppendNumber(name,i);
  6682. AddVariable(name,system.addressType);
  6683. name := "@incr";
  6684. Basic.AppendNumber(name,i);
  6685. AddVariable(name,system.addressType);
  6686. END;
  6687. parentScope.AddTypeDeclaration(typeDeclaration);
  6688. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6689. ASSERT(~duplicate);
  6690. type := recordType;
  6691. END;
  6692. RETURN type
  6693. END GetMathArrayDescriptorType;
  6694. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6695. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6696. BEGIN
  6697. NEW(string, LEN(s)); COPY(s, string^);
  6698. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6699. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6700. sv.SetType(type);
  6701. Designate(sv,res);
  6702. Emit(Push(position,res.tag));
  6703. Emit(Push(position,res.op));
  6704. ReleaseOperand(res);
  6705. END PushConstString;
  6706. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6707. BEGIN
  6708. IF b THEN
  6709. Emit(Push(Basic.invalidPosition, true));
  6710. ELSE
  6711. Emit(Push(Basic.invalidPosition, false));
  6712. END;
  6713. END PushConstBoolean;
  6714. PROCEDURE PushConstSet(v: SET);
  6715. VAR value: SyntaxTree.Value; op: Operand;
  6716. BEGIN
  6717. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6718. value.SetType(system.setType);
  6719. Evaluate(value, op);
  6720. Emit(Push(Basic.invalidPosition, op.op));
  6721. ReleaseOperand(op);
  6722. END PushConstSet;
  6723. PROCEDURE PushConstInteger(v: LONGINT);
  6724. VAR value: SyntaxTree.Value; op: Operand;
  6725. BEGIN
  6726. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6727. value.SetType(system.longintType);
  6728. Evaluate(value, op);
  6729. Emit(Push(Basic.invalidPosition, op.op));
  6730. ReleaseOperand(op);
  6731. END PushConstInteger;
  6732. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6733. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6734. section: IntermediateCode.Section;
  6735. BEGIN
  6736. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6737. Global.GetSymbolSegmentedName(symbol, name);
  6738. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6739. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6740. procedure.SetScope(moduleScope);
  6741. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6742. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6743. procedure.SetAccess(SyntaxTree.Hidden);
  6744. currentScope := procedureScope;
  6745. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6746. EmitEnter(section, Basic.invalidPosition,procedure,0,0);
  6747. RETURN section;
  6748. END OpenInitializer;
  6749. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6750. BEGIN
  6751. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6752. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6753. section := prev;
  6754. END CloseInitializer;
  6755. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6756. VAR name: SyntaxTree.IdentifierString;
  6757. parameter: SyntaxTree.Parameter;
  6758. type: SyntaxTree.Type;
  6759. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6760. BEGIN
  6761. InitOperand(op,ModeReference);
  6762. op.op := fp;
  6763. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6764. Dereference(op, x, FALSE);
  6765. result := op;
  6766. Symbol(symbol, op);
  6767. END Field;
  6768. PROCEDURE Direction(direction: LONGINT): SET;
  6769. BEGIN
  6770. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6771. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6772. ELSE HALT(100);
  6773. END;
  6774. END Direction;
  6775. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6776. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6777. BEGIN
  6778. Field(port, op);
  6779. ToMemory(op.op,addressType,0);
  6780. Emit(Push(Basic.invalidPosition, op.op));
  6781. ReleaseOperand(op);
  6782. Basic.GetString(modifier.identifier, name);
  6783. PushConstString(name);
  6784. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6785. ASSERT(SemanticChecker.IsStringType(value.type));
  6786. Designate(value, op);
  6787. Emit(Push(modifier.position, op.tag));
  6788. Emit(Push(modifier.position, op.op));
  6789. ReleaseOperand(op);
  6790. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6791. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6792. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6793. Evaluate(value, op);
  6794. Emit(Push(modifier.position, op.op));
  6795. ReleaseOperand(op);
  6796. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6797. ELSE
  6798. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6799. END;
  6800. END AddPortProperty;
  6801. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6802. VAR modifier: SyntaxTree.Modifier;
  6803. BEGIN
  6804. modifier := parameter.modifiers;
  6805. WHILE modifier # NIL DO
  6806. AddPortProperty(parameter,modifier, modifier.expression);
  6807. modifier := modifier.nextModifier;
  6808. END;
  6809. END AddPortProperties;
  6810. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6811. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6812. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6813. PROCEDURE PushLens(type: SyntaxTree.Type);
  6814. BEGIN
  6815. IF IsSemiDynamicArray(type) THEN
  6816. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6817. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6818. Emit(Push(Basic.invalidPosition, op.op));
  6819. ReleaseOperand(op);
  6820. INC(dim);
  6821. ELSIF IsStaticArray(type) THEN
  6822. len := len * type(SyntaxTree.ArrayType).staticLength;
  6823. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6824. INC(dim);
  6825. ELSE
  6826. baseType := type;
  6827. END;
  6828. END PushLens;
  6829. BEGIN
  6830. (* cell *)
  6831. IF parameter.type IS SyntaxTree.ArrayType THEN
  6832. type := parameter.type;
  6833. dim := 0;
  6834. len := 1;
  6835. PushLens(type);
  6836. portType := baseType.resolved(SyntaxTree.PortType);
  6837. ELSE
  6838. portType := parameter.type(SyntaxTree.PortType);
  6839. END;
  6840. PushSelfPointer();
  6841. (* port / array of ports *)
  6842. IF IsStaticArray(type) THEN
  6843. PushConstInteger(len);
  6844. END;
  6845. Field(parameter, op);
  6846. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6847. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6848. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6849. Designate(d, op);*)
  6850. Emit(Push(Basic.invalidPosition, op.op));
  6851. ReleaseOperand(op);
  6852. (* name *)
  6853. PushConstString(name);
  6854. (* inout *)
  6855. PushConstSet(Direction(portType.direction));
  6856. (* width *)
  6857. PushConstInteger(portType.sizeInBits);
  6858. IF parameter.type IS SyntaxTree.PortType THEN
  6859. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6860. AddPortProperties(parameter);
  6861. ELSIF IsStaticArray(type)THEN
  6862. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6863. ELSIF IsSemiDynamicArray(type) THEN
  6864. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6865. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6866. Emit(Add(position,reg, sp, size));
  6867. (* dim *)
  6868. PushConstInteger(dim);
  6869. (* len array *)
  6870. Emit(Push(position, reg));
  6871. ReleaseIntermediateOperand(reg);
  6872. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6873. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6874. Emit(Add(position, sp,sp, size));
  6875. ELSE
  6876. HALT(100);
  6877. END;
  6878. END Parameter;
  6879. BEGIN
  6880. IF backend.cellsAreObjects THEN
  6881. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6882. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6883. END;
  6884. parameter := x.firstParameter;
  6885. WHILE (parameter # NIL) DO
  6886. type := parameter.type.resolved;
  6887. WHILE (type IS SyntaxTree.ArrayType) DO
  6888. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6889. END;
  6890. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6891. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6892. Parameter(name,parameter);
  6893. END;
  6894. parameter := parameter.nextParameter;
  6895. END;
  6896. ELSE HALT(200)
  6897. END;
  6898. END AddPorts;
  6899. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6900. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6901. BEGIN
  6902. Symbol(cell,op);
  6903. ToMemory(op.op,addressType,0);
  6904. Emit(Push(position,op.op));
  6905. ReleaseOperand(op);
  6906. property.GetName(name);
  6907. (* does not work when inheritance is used:
  6908. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6909. *)
  6910. PushConstString(name);
  6911. IF (value # NIL) THEN
  6912. ASSERT(
  6913. SemanticChecker.IsStringType(property.type)
  6914. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6915. OR (property.type.resolved IS SyntaxTree.FloatType)
  6916. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6917. OR (property.type.resolved IS SyntaxTree.SetType)
  6918. );
  6919. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6920. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6921. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6922. Designate(d, op);
  6923. IF SemanticChecker.IsStringType(property.type) THEN
  6924. Emit(Push(Basic.invalidPosition, op.tag))
  6925. END;
  6926. Emit(Push(Basic.invalidPosition, op.op));
  6927. ReleaseOperand(op);
  6928. END;
  6929. IF value = NIL THEN
  6930. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6931. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6932. ASSERT(SemanticChecker.IsStringType(value.type));
  6933. Designate(value, op);
  6934. PushString(op, value.type);
  6935. ReleaseOperand(op);
  6936. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6937. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6938. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6939. Evaluate(value, op);
  6940. Emit(Push(property.position, op.op));
  6941. ReleaseOperand(op);
  6942. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6943. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6944. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6945. Evaluate(value, op);
  6946. Emit(Push(property.position, op.op));
  6947. ReleaseOperand(op);
  6948. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6949. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6950. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6951. Evaluate(value, op);
  6952. Emit(Push(property.position, op.op));
  6953. ReleaseOperand(op);
  6954. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6955. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6956. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6957. Evaluate(value, op);
  6958. Emit(Push(property.position, op.op));
  6959. ReleaseOperand(op);
  6960. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6961. ELSE
  6962. HALT(200);
  6963. END;
  6964. END AddProperty;
  6965. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6966. VAR symbol: SyntaxTree.Symbol;
  6967. BEGIN
  6968. WHILE modifier # NIL DO
  6969. symbol := cellType.FindProperty(modifier.identifier);
  6970. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6971. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6972. modifier := modifier.nextModifier;
  6973. END;
  6974. END AddModifiers;
  6975. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6976. VAR last: SyntaxTree.Modifier;
  6977. BEGIN
  6978. IF to = NIL THEN
  6979. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6980. ELSE
  6981. last := to;
  6982. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6983. last := last.nextModifier;
  6984. END;
  6985. IF last.identifier # this.identifier THEN
  6986. ASSERT(last.nextModifier = NIL);
  6987. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6988. END;
  6989. END;
  6990. END AppendModifier;
  6991. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6992. BEGIN
  6993. WHILE this # NIL DO
  6994. AppendModifier(to, this);
  6995. this := this.nextModifier;
  6996. END;
  6997. END AppendModifiers;
  6998. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6999. VAR base: SyntaxTree.Type;
  7000. BEGIN
  7001. AppendModifiers(to, c.modifiers);
  7002. base := c.GetBaseValueType();
  7003. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  7004. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  7005. END;
  7006. END AppendCellTypeModifiers;
  7007. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  7008. VAR name: ARRAY 256 OF CHAR; op: Operand;
  7009. BEGIN
  7010. Basic.GetString(modifier.identifier, name);
  7011. PushConstString(name);
  7012. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  7013. ASSERT(SemanticChecker.IsStringType(value.type));
  7014. Designate(value, op);
  7015. PushString(op, value.type);
  7016. ReleaseOperand(op);
  7017. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  7018. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  7019. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7020. Evaluate(value, op);
  7021. Emit(Push(modifier.position, op.op));
  7022. ReleaseOperand(op);
  7023. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  7024. ELSE
  7025. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  7026. END;
  7027. END AddPortProperty;
  7028. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  7029. BEGIN
  7030. WHILE modifier # NIL DO
  7031. AddPortProperty(modifier, modifier.expression);
  7032. modifier := modifier.nextModifier;
  7033. END;
  7034. END AddPortProperties;
  7035. PROCEDURE PushPort(p: SyntaxTree.Expression);
  7036. VAR op: Operand;
  7037. BEGIN
  7038. Evaluate(p, op);
  7039. Emit(Push(p.position, op.op));
  7040. ReleaseOperand(op);
  7041. IF p IS SyntaxTree.Designator THEN
  7042. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  7043. END;
  7044. END PushPort;
  7045. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  7046. VAR tmp: IntermediateCode.Operand;
  7047. BEGIN
  7048. actualType := actualType.resolved;
  7049. IF actualType IS SyntaxTree.StringType THEN
  7050. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  7051. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7052. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  7053. ELSE
  7054. tmp := op.tag;
  7055. IntermediateCode.MakeMemory(tmp,addressType);
  7056. Emit(Push(position,tmp));
  7057. END;
  7058. Emit(Push(position,op.op))
  7059. END PushString;
  7060. (* conservative check if x is potentially on the heap, excluding the module heap
  7061. required for generational garbage collector
  7062. *)
  7063. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  7064. BEGIN
  7065. RETURN TRUE;
  7066. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  7067. passed by reference.
  7068. pos := x.position.start;
  7069. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  7070. x := x(SyntaxTree.Designator).left;
  7071. END;
  7072. RETURN x # NIL;
  7073. *)
  7074. END OnHeap;
  7075. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  7076. VAR
  7077. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  7078. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  7079. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  7080. tmp:IntermediateCode.Operand;
  7081. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  7082. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  7083. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  7084. dest: IntermediateCode.Operand;
  7085. staticLength: LONGINT; itype: IntermediateCode.Type;
  7086. convert,isTensor: BOOLEAN;
  7087. recordType: SyntaxTree.RecordType;
  7088. baseType: SyntaxTree.Type;
  7089. left: SyntaxTree.Expression;
  7090. call: SyntaxTree.Designator;
  7091. procedure: SyntaxTree.Procedure;
  7092. temporaryVariable: SyntaxTree.Variable;
  7093. dummy: IntermediateCode.Operand;
  7094. customBuiltin: SyntaxTree.CustomBuiltin;
  7095. isVarPar: ARRAY 3 OF BOOLEAN;
  7096. callsection: Sections.Section;
  7097. segmentedName: Basic.SegmentedName;
  7098. needsTrace: BOOLEAN;
  7099. n: ARRAY 256 OF CHAR;
  7100. modifier: SyntaxTree.Modifier;
  7101. previous, init: IntermediateCode.Section;
  7102. prevScope: SyntaxTree.Scope;
  7103. firstPar: LONGINT;
  7104. saved: RegisterEntry;
  7105. callingConvention: SyntaxTree.CallingConvention;
  7106. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7107. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7108. priority: IntermediateCode.Operand;
  7109. op,callop: Operand;
  7110. BEGIN
  7111. IF type = NIL THEN RETURN END;
  7112. type := type.resolved;
  7113. IF type IS SyntaxTree.PointerType THEN
  7114. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7115. END;
  7116. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7117. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7118. recordScope := type(SyntaxTree.RecordType).recordScope;
  7119. IF recordScope.bodyProcedure # NIL THEN
  7120. procedure := recordScope.bodyProcedure;
  7121. body := procedure.procedureScope.body;
  7122. Emit(Push(position,self));
  7123. IF body.isActive THEN
  7124. StaticCallOperand(callop,procedure);
  7125. Emit(Push(position,callop.op));
  7126. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7127. Convert(priority,sizeType);
  7128. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7129. END;
  7130. Emit(Push(position,priority));
  7131. ReleaseIntermediateOperand(priority);
  7132. IF backend.cooperative THEN
  7133. Emit(Push(position,self));
  7134. CallThis(position,"Activities","Create",3)
  7135. ELSE
  7136. flags := 0;
  7137. IF body.isSafe THEN
  7138. flags := 1;
  7139. END;
  7140. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7141. Emit(Push(position,self));
  7142. CallThis(position,"Objects","CreateProcess",4)
  7143. END;
  7144. ELSE
  7145. Emit(Push(position,self));
  7146. StaticCallOperand(callop,procedure);
  7147. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7148. END;
  7149. Emit(Pop(position,self));
  7150. END;
  7151. END CallBodies;
  7152. PROCEDURE PushTD(type: SyntaxTree.Type);
  7153. VAR op: IntermediateCode.Operand;
  7154. BEGIN
  7155. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7156. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7157. ELSE
  7158. IF type.resolved IS SyntaxTree.PointerType THEN
  7159. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7160. END;
  7161. op := TypeDescriptorAdr(type.resolved);
  7162. Emit(Push(position,op));
  7163. END
  7164. END PushTD;
  7165. BEGIN
  7166. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7167. dest := destination; destination := emptyOperand;
  7168. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7169. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7170. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7171. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7172. CASE x.id OF
  7173. (* ---- COPY ----- *)
  7174. |Global.Copy:
  7175. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7176. (* ---- EXCL, INCL----- *)
  7177. |Global.Excl,Global.Incl:
  7178. Evaluate(p0,s0);
  7179. Evaluate(p1,s1);
  7180. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7181. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7182. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7183. END;
  7184. ReuseCopy(res,s0.op);
  7185. ReleaseOperand(s0);
  7186. Reuse1(tmp,s1.op);
  7187. ReleaseOperand(s1);
  7188. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7189. IF x.id = Global.Excl THEN
  7190. Emit(Not(position,tmp,tmp));
  7191. Emit(And(position,res,res,tmp));
  7192. ELSE
  7193. Emit(Or(position,res,res,tmp));
  7194. END;
  7195. ReleaseIntermediateOperand(tmp);
  7196. Designate(p0,s0);
  7197. ToMemory(s0.op,s1.op.type,0);
  7198. Emit(Mov(position,s0.op,res));
  7199. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7200. (* ---- DISPOSE ----- *)
  7201. |Global.Dispose:
  7202. Designate(p0,s0);
  7203. Emit(Push(position,s0.op));
  7204. ReleaseOperand(s0);
  7205. CallThis(position,"Runtime","Dispose", 1);
  7206. (* ---- GETPROCEDURE ----- *)
  7207. |Global.GetProcedure:
  7208. Designate(p0,s0);
  7209. PushString(s0,p0.type);
  7210. Designate(p1,s1);
  7211. PushString(s1,p1.type);
  7212. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7213. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7214. ELSE PushTD(procedureType.firstParameter.type)
  7215. END;
  7216. PushTD(procedureType.returnType);
  7217. Designate(p2,s2);
  7218. Emit(Push(position,s2.op));
  7219. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7220. CallThis(position,"Modules","GetProcedure", 7);
  7221. (* ---- ASH, LSH, ROT ----- *)
  7222. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7223. Evaluate(p0,s0);
  7224. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7225. (* make unsigned arguments in order to produced a logical shift *)
  7226. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7227. convert:= TRUE;
  7228. itype := s0.op.type;
  7229. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7230. Convert(s0.op,itype);
  7231. ELSE
  7232. convert := FALSE;
  7233. END;
  7234. END;
  7235. Evaluate(p1,s1);
  7236. IF IsIntegerConstant(p1,hint) THEN
  7237. ReuseCopy(reg,s0.op);
  7238. IF hint > 0 THEN
  7239. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7240. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7241. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7242. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7243. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7244. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7245. END;
  7246. ELSIF hint < 0 THEN
  7247. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7248. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7249. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7250. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7251. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7252. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7253. END;
  7254. END;
  7255. ReleaseOperand(s0); ReleaseOperand(s1);
  7256. ELSE
  7257. exit := NewLabel();
  7258. end := NewLabel();
  7259. ReuseCopy(reg,s0.op);
  7260. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7261. Reuse1(tmp,s1.op);
  7262. Emit(Neg(position,tmp,s1.op));
  7263. Convert(tmp,s1.op.type);
  7264. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7265. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7266. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7267. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7268. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7269. END;
  7270. ReleaseIntermediateOperand(tmp);
  7271. BrL(end);
  7272. SetLabel(exit);
  7273. ReuseCopy(tmp,s1.op);
  7274. Convert(tmp,s1.op.type);
  7275. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7276. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7277. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7278. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7279. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7280. END;
  7281. ReleaseIntermediateOperand(tmp);
  7282. SetLabel(end);
  7283. ReleaseOperand(s0); ReleaseOperand(s1);
  7284. END;
  7285. InitOperand(result,ModeValue);
  7286. IF convert THEN
  7287. itype := reg.type;
  7288. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7289. Convert(reg,itype);
  7290. END;
  7291. result.op := reg;
  7292. (* ---- CAP ----- *)
  7293. |Global.Cap:
  7294. Evaluate(p0,result);
  7295. ReuseCopy(reg,result.op);
  7296. ReleaseIntermediateOperand(result.op);
  7297. ignore := NewLabel();
  7298. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7299. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7300. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7301. SetLabel(ignore);
  7302. result.op := reg;
  7303. (* ---- CHR ----- *)
  7304. |Global.Chr, Global.Chr32:
  7305. Evaluate(p0,result);
  7306. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7307. |Global.Entier, Global.EntierH:
  7308. Evaluate(p0,result);
  7309. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7310. (* ---- MIN and MAX ----- *)
  7311. |Global.Max,Global.Min:
  7312. Evaluate(p0,s0);
  7313. Evaluate(p1,s1);
  7314. Reuse2(res,s0.op,s1.op);
  7315. else := NewLabel();
  7316. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7317. ELSE BrltL(else,s1.op,s0.op) END;
  7318. Emit(Mov(position,res,s0.op));
  7319. ReleaseOperand(s0);
  7320. end := NewLabel();
  7321. BrL(end);
  7322. SetLabel(else);
  7323. Emit(MovReplace(position,res,s1.op));
  7324. SetLabel(end);
  7325. ReleaseOperand(s1);
  7326. InitOperand(result,ModeValue);
  7327. result.op := res;
  7328. (* ---- ODD ----- *)
  7329. |Global.Odd:
  7330. Evaluate(p0,result);
  7331. Reuse1(res,result.op);
  7332. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7333. ReleaseIntermediateOperand(result.op);
  7334. result.op := res;
  7335. Convert(result.op,bool);
  7336. (* ---- ORD ----- *)
  7337. |Global.Ord, Global.Ord32:
  7338. Evaluate(p0,result);
  7339. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7340. (* ---- SHORT, LONG ----- *)
  7341. |Global.Short, Global.Long:
  7342. Evaluate(p0,result);
  7343. IF x.type IS SyntaxTree.ComplexType THEN
  7344. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7345. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7346. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7347. ELSE
  7348. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7349. END
  7350. (* ---- HALT, SYSTEM.HALT----- *)
  7351. |Global.Halt, Global.systemHalt:
  7352. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7353. EmitTrap (position, val);
  7354. (* ---- ASSERT ----- *)
  7355. |Global.Assert:
  7356. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7357. trueL := NewLabel();
  7358. Condition(p0,trueL,TRUE);
  7359. IF p1 = NIL THEN val := AssertTrap
  7360. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7361. END;
  7362. EmitTrap(position,val);
  7363. SetLabel(trueL);
  7364. END;
  7365. (*
  7366. Emit(TrapC(result.op,val);
  7367. *)
  7368. (* ---- INC, DEC----- *)
  7369. |Global.Inc,Global.Dec:
  7370. Expression(p0); adr := result.op;
  7371. s0 := result;
  7372. LoadValue(result,p0.type);
  7373. (* EXPERIMENTAL *)
  7374. IF (s0.availability >= 0) & (availableSymbols[s0.availability].inRegister) THEN
  7375. availableSymbols[s0.availability].inMemory := FALSE;
  7376. END;
  7377. l := result;
  7378. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7379. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7380. END;
  7381. IF x.id = Global.Inc THEN
  7382. Emit(Add(position,l.op,l.op,r.op));
  7383. ELSE
  7384. Emit(Sub(position,l.op,l.op,r.op));
  7385. END;
  7386. ReleaseOperand(l); ReleaseOperand(r);
  7387. (* ---- LEN ----- *)
  7388. |Global.Len: (* dynamic length, static length done by checker *)
  7389. Designate(p0,operand);
  7390. IF p1 = NIL THEN
  7391. InitOperand(l,ModeValue);
  7392. l.op := IntermediateCode.Immediate(sizeType,0);
  7393. ELSE
  7394. Evaluate(p1,l);
  7395. END;
  7396. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7397. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7398. Dereference(operand, p0.type.resolved, FALSE);
  7399. END;
  7400. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7401. ReleaseOperand(operand); ReleaseOperand(l);
  7402. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7403. ASSERT(p1 # NIL);
  7404. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7405. Dereference(operand,p0.type.resolved,FALSE);
  7406. END;
  7407. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7408. ReleaseOperand(operand); ReleaseOperand(l);
  7409. ELSE HALT(100);
  7410. END;
  7411. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7412. (* ---- FIRST ---- *)
  7413. |Global.First:
  7414. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7415. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7416. ELSE
  7417. Designate(p0, result)
  7418. END
  7419. (* ---- LAST ---- *)
  7420. |Global.Last:
  7421. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7422. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7423. ELSE
  7424. Designate(p0, result);
  7425. (* make sure result.op is a register *)
  7426. tmp := result.op;
  7427. ReuseCopy(result.op, result.op);
  7428. ReleaseIntermediateOperand(tmp);
  7429. (* add offset to result.op *)
  7430. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7431. END
  7432. (* ---- STEP ---- *)
  7433. |Global.Step:
  7434. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7435. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7436. ELSE
  7437. Designate(p0, result);
  7438. (* make sure result.op is a register *)
  7439. tmp := result.op;
  7440. ReuseCopy(result.op, result.op);
  7441. ReleaseIntermediateOperand(tmp);
  7442. (* add offset to result.op *)
  7443. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7444. END
  7445. (* ---- RE ---- *)
  7446. |Global.Re:
  7447. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7448. Designate(p0, result)
  7449. ELSE
  7450. Evaluate(p0, result)
  7451. END
  7452. (* ---- IM ---- *)
  7453. |Global.Im:
  7454. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7455. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7456. Designate(p0, result);
  7457. (* make sure result.op is a register *)
  7458. tmp := result.op;
  7459. ReuseCopy(result.op, result.op);
  7460. ReleaseIntermediateOperand(tmp);
  7461. (* add offset to result.op *)
  7462. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7463. (* ---- ABS ----- *)
  7464. |Global.Abs:
  7465. Evaluate(p0,operand);
  7466. type := p0.type.resolved;
  7467. InitOperand(result,ModeValue);
  7468. Reuse1a(result.op,operand.op,dest);
  7469. Emit(Abs(position,result.op,operand.op));
  7470. ReleaseOperand(operand);
  7471. (* ---- WAIT ----- *)
  7472. |Global.Wait:
  7473. Evaluate(p0,operand);
  7474. Emit(Push(position,operand.op));
  7475. ReleaseOperand(operand);
  7476. CallThis(position,"Activities","Wait", 1);
  7477. (* ---- NEW ----- *)
  7478. |Global.New:
  7479. (*! the following code is only correct for "standard" Oberon calling convention *)
  7480. IF x.type # NIL THEN
  7481. type := x.type.resolved;
  7482. firstPar := 0;
  7483. ELSE
  7484. type := p0.type.resolved;
  7485. firstPar := 1;
  7486. END;
  7487. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7488. THEN
  7489. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7490. IF backend.cooperative THEN
  7491. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7492. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7493. IF recordType.isObject THEN
  7494. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7495. IF recordType.IsActive() THEN
  7496. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7497. END;
  7498. IF recordType.IsProtected() THEN
  7499. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7500. END;
  7501. ELSE
  7502. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7503. END;
  7504. END;
  7505. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7506. CallThis(position,"Runtime","New", 1);
  7507. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7508. Emit(Result(position, pointer));
  7509. exit := NewLabel();
  7510. BreqL(exit,pointer,nil);
  7511. GetRecordTypeName (recordType,name);
  7512. IF ~recordType.isObject THEN
  7513. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7514. END;
  7515. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7516. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7517. IF recordType.isObject THEN
  7518. IF recordType.IsProtected() THEN
  7519. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7520. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7521. END;
  7522. IF recordType.IsActive() THEN
  7523. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7524. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7525. END;
  7526. END;
  7527. (* initialize fields *)
  7528. IF type(SyntaxTree.PointerType).isPlain THEN
  7529. size := 0;
  7530. ELSIF recordType.isObject THEN
  7531. size := BaseObjectTypeSize;
  7532. ELSE
  7533. size := BaseRecordTypeSize;
  7534. END;
  7535. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7536. (* call initializer *)
  7537. constructor := GetConstructor(recordType);
  7538. IF constructor # NIL THEN
  7539. (*! should be unified with ProcedureCallDesignator *)
  7540. Emit(Push(position,pointer));
  7541. ReleaseIntermediateOperand(pointer);
  7542. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7543. FOR i := firstPar TO x.parameters.Length()-1 DO
  7544. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7545. formalParameter := formalParameter.nextParameter;
  7546. END;
  7547. (* static call of the constructor *)
  7548. GetCodeSectionNameForSymbol(constructor,name);
  7549. ASSERT(~constructor.isInline);
  7550. IF constructor.scope.ownerModule # module.module THEN
  7551. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7552. ELSE
  7553. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7554. END;
  7555. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7556. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7557. Emit(Pop(position,pointer));
  7558. END;
  7559. (* call bodies *)
  7560. CallBodies(pointer,type);
  7561. SetLabel(exit);
  7562. needsTrace := p0.NeedsTrace();
  7563. IF needsTrace THEN ModifyAssignments(true) END;
  7564. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7565. Emit(Push(position, pointer));
  7566. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7567. Emit(Pop(position, pointer));
  7568. END;
  7569. Designate(p0,l);
  7570. IF needsTrace THEN
  7571. CallAssignPointer(l.op, pointer);
  7572. ELSE
  7573. ToMemory(l.op,addressType,0);
  7574. Emit(Mov(position,l.op,pointer));
  7575. END;
  7576. ReleaseIntermediateOperand(pointer);
  7577. ReleaseOperand(l);
  7578. IF needsTrace THEN ModifyAssignments(false) END;
  7579. ELSE (* not cooperative backend *)
  7580. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7581. IF temporaryVariable # NIL THEN
  7582. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7583. ELSE
  7584. Designate(p0,l);
  7585. END;
  7586. (* l.op contains address of pointer to record *)
  7587. Emit(Push(position,l.op)); (* address for use after syscall *)
  7588. Emit(Push(position,l.op));
  7589. ReleaseOperand(l);
  7590. (* push type descriptor *)
  7591. reg := TypeDescriptorAdr(recordType);
  7592. Emit(Push(position,reg));
  7593. ReleaseIntermediateOperand(reg);
  7594. (* push realtime flag *)
  7595. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7596. ELSE Emit(Push(position,false));
  7597. END;
  7598. CallThis(position,"Heaps","NewRec", 3);
  7599. (* check allocation success, if not successful then do not call initializers and bodies *)
  7600. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7601. Emit(Pop(position,pointer));
  7602. MakeMemory(reg,pointer,addressType,0);
  7603. ReleaseIntermediateOperand(pointer);
  7604. pointer := reg;
  7605. exit := NewLabel();
  7606. BreqL(exit,pointer,nil);
  7607. Emit(Push(position,pointer));
  7608. (* initialize fields *)
  7609. InitFields(recordType, pointer,0);
  7610. (* call initializer *)
  7611. constructor := GetConstructor(recordType);
  7612. IF constructor # NIL THEN
  7613. (*! should be unified with ProcedureCallDesignator *)
  7614. Emit(Push(position,pointer));
  7615. ReleaseIntermediateOperand(pointer);
  7616. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7617. FOR i := firstPar TO x.parameters.Length()-1 DO
  7618. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7619. formalParameter := formalParameter.nextParameter;
  7620. END;
  7621. (* static call of the constructor *)
  7622. GetCodeSectionNameForSymbol(constructor,name);
  7623. ASSERT(~constructor.isInline);
  7624. IF constructor.scope.ownerModule # module.module THEN
  7625. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7626. ELSE
  7627. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7628. END;
  7629. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7630. ELSE
  7631. ReleaseIntermediateOperand(pointer);
  7632. END;
  7633. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7634. Emit(Pop(position,pointer));
  7635. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7636. Designate(p0,l);
  7637. IF backend.writeBarriers & OnHeap(p0) THEN
  7638. SaveRegisters();ReleaseUsedRegisters(saved);
  7639. Emit(Push(position,l.op));
  7640. Emit(Push(position,pointer));
  7641. CallThis(position,"Heaps","Assign",2);
  7642. RestoreRegisters(saved);
  7643. ELSE
  7644. ToMemory(l.op,addressType,0);
  7645. Emit(Mov(position,l.op,pointer));
  7646. END;
  7647. ReleaseOperand(l);
  7648. result.tag := emptyOperand;
  7649. ELSIF (x.type # NIL) THEN
  7650. result := l; (* temporary variable is the result of NEW Type() *)
  7651. END;
  7652. (* call bodies *)
  7653. CallBodies(pointer,type);
  7654. ReleaseIntermediateOperand(pointer);
  7655. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7656. end := NewLabel();
  7657. BrL(end);
  7658. SetLabel(exit);
  7659. Designate(p0,l);
  7660. ToMemory(l.op,addressType,0);
  7661. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7662. ReleaseOperand(l);
  7663. SetLabel(end);
  7664. ELSE
  7665. SetLabel(exit);
  7666. END;
  7667. END;
  7668. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7669. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7670. IF ~backend.cooperative THEN (* simpler version *)
  7671. (*
  7672. push len0
  7673. push len1
  7674. push len2
  7675. push len_size
  7676. push len_adr
  7677. push tag
  7678. push static elements
  7679. push element size
  7680. push adr
  7681. *)
  7682. dim := 0;
  7683. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7684. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7685. parameter := x.parameters.GetExpression(i);
  7686. Evaluate(parameter,r);
  7687. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7688. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7689. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7690. END;
  7691. Emit(Push(position,r.op));
  7692. ReleaseOperand(r);
  7693. INC(dim);
  7694. END;
  7695. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7696. Emit(Mov(position, adr, sp));
  7697. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7698. Emit(Push(position, adr));
  7699. ReleaseIntermediateOperand(adr);
  7700. openDim := dim;
  7701. staticLength := 1;
  7702. IF type IS SyntaxTree.ArrayType THEN
  7703. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7704. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7705. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7706. END;
  7707. END;
  7708. IF SemanticChecker.ContainsPointer(type) THEN
  7709. tmp := TypeDescriptorAdr(type);
  7710. ELSE
  7711. tmp := nil;
  7712. END;
  7713. Emit(Push(position,tmp)); (* type descriptor *)
  7714. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7715. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7716. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7717. Designate(p0,l);
  7718. Emit(Push(position,l.op)); (* address *)
  7719. ReleaseOperand(l);
  7720. CallThis(position,"Heaps","NewArray", 6);
  7721. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7722. Emit(Add(position,sp,sp,tmp));
  7723. ELSE
  7724. dim := 0;
  7725. IntermediateCode.InitOperand(reg);
  7726. IF p1 # NIL THEN
  7727. FOR i := firstPar TO x.parameters.Length()-1 DO
  7728. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7729. parameter := x.parameters.GetExpression(i);
  7730. Evaluate(parameter,r);
  7731. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7732. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7733. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7734. END;
  7735. Emit(Push(position,r.op));
  7736. IF i=1 THEN
  7737. CopyInt(reg,r.op);
  7738. ELSE
  7739. MulInt(reg, reg, r.op);
  7740. END;
  7741. ReleaseOperand(r);
  7742. INC(dim);
  7743. END;
  7744. Convert(reg,addressType);
  7745. ELSE
  7746. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7747. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7748. END;
  7749. openDim := dim;
  7750. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7751. IF backend.cooperative THEN
  7752. size := ToMemoryUnits(system,system.SizeOf(type));
  7753. WHILE type IS SyntaxTree.ArrayType DO
  7754. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7755. END;
  7756. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7757. IF (size # 1) THEN
  7758. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7759. END;
  7760. Emit(Push(position,reg));
  7761. size := ToMemoryUnits(system,system.SizeOf(type));
  7762. IF (size # 1) THEN
  7763. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7764. END;
  7765. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7766. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7767. Emit(Push(position,reg));
  7768. ReleaseIntermediateOperand(reg);
  7769. CallThis(position,"Runtime","New", 1);
  7770. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7771. Emit(Result(position, pointer));
  7772. exit := NewLabel();
  7773. else := NewLabel();
  7774. BreqL(else,pointer,nil);
  7775. IF ~type.hasPointers THEN
  7776. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7777. ELSIF type IS SyntaxTree.RecordType THEN
  7778. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7779. ELSIF type IS SyntaxTree.ProcedureType THEN
  7780. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7781. ELSE
  7782. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7783. END;
  7784. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7785. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7786. 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))));
  7787. IF type IS SyntaxTree.RecordType THEN
  7788. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7789. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7790. ELSE
  7791. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7792. END;
  7793. i := openDim;
  7794. WHILE i > 0 DO
  7795. DEC (i);
  7796. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7797. END;
  7798. needsTrace := p0.NeedsTrace();
  7799. IF needsTrace THEN ModifyAssignments(true) END;
  7800. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7801. Emit(Push(position, pointer));
  7802. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7803. Emit(Pop(position, pointer));
  7804. END;
  7805. Designate(p0,l);
  7806. IF needsTrace THEN
  7807. CallAssignPointer(l.op, pointer);
  7808. ModifyAssignments(false);
  7809. ELSE
  7810. ToMemory(l.op,addressType,0);
  7811. Emit(Mov(position,l.op,pointer));
  7812. END;
  7813. ReleaseIntermediateOperand(pointer);
  7814. ReleaseOperand(l);
  7815. BrL(exit);
  7816. SetLabel(else);
  7817. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7818. Designate(p0,l);
  7819. IF needsTrace THEN
  7820. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7821. ELSE
  7822. ToMemory(l.op,addressType,0);
  7823. Emit(Mov(position,l.op,pointer));
  7824. END;
  7825. ReleaseOperand(l);
  7826. SetLabel(exit);
  7827. ELSE
  7828. (*! the following code is only correct for "standard" Oberon calling convention *)
  7829. IF SemanticChecker.ContainsPointer(type) THEN
  7830. IF type IS SyntaxTree.ArrayType THEN
  7831. staticLength := 1;
  7832. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7833. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7834. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7835. END;
  7836. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7837. MulInt(reg,reg,tmp);
  7838. END;
  7839. Designate(p0,l);
  7840. IF openDim > 0 THEN
  7841. Emit(Push(position,l.op)); (* address for use after syscall *)
  7842. END;
  7843. Emit(Push(position,l.op)); (* address *)
  7844. ReleaseOperand(l);
  7845. tmp := TypeDescriptorAdr(type);
  7846. Emit(Push(position,tmp)); (* type descriptor *)
  7847. ReleaseIntermediateOperand(tmp);
  7848. Emit(Push(position,reg)); (* number Elements *)
  7849. ReleaseIntermediateOperand(reg);
  7850. tmp := IntermediateCode.Immediate(addressType,dim);
  7851. Emit(Push(position,tmp)); (* dimensions *)
  7852. (* push realtime flag *)
  7853. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7854. ELSE Emit(Push(position,false));
  7855. END;
  7856. CallThis(position,"Heaps","NewArr",5)
  7857. ELSE
  7858. size := ToMemoryUnits(system,system.SizeOf(type));
  7859. IF (size # 1) THEN
  7860. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7861. (*
  7862. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7863. *)
  7864. END;
  7865. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7866. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7867. AddInt(reg, reg, tmp);
  7868. (*
  7869. Emit(Add(position,reg,reg,tmp));
  7870. *)
  7871. Designate(p0,l);
  7872. IF openDim >0 THEN
  7873. Emit(Push(position,l.op)); (* address for use after syscall *)
  7874. END;
  7875. Emit(Push(position,l.op)); (* address for syscall *)
  7876. ReleaseOperand(l); (* pointer address *)
  7877. Emit(Push(position,reg)); (* size *)
  7878. ReleaseIntermediateOperand(reg);
  7879. (* push realtime flag *)
  7880. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7881. ELSE Emit(Push(position,false));
  7882. END;
  7883. CallThis(position,"Heaps","NewSys", 3)
  7884. END;
  7885. IF openDim > 0 THEN
  7886. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7887. Emit(Pop(position,adr));
  7888. ToMemory(adr,addressType,0);
  7889. ReuseCopy(tmp,adr);
  7890. ReleaseIntermediateOperand(adr);
  7891. adr := tmp;
  7892. else := NewLabel();
  7893. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7894. i := openDim-1;
  7895. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7896. WHILE (i >= 0) DO
  7897. Emit(Pop(position,reg));
  7898. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7899. Emit(Mov(position,res,reg));
  7900. DEC(i);
  7901. END;
  7902. ReleaseIntermediateOperand(adr);
  7903. ReleaseIntermediateOperand(reg);
  7904. exit := NewLabel();
  7905. BrL(exit);
  7906. SetLabel(else);
  7907. (* else part: array could not be allocated *)
  7908. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7909. Emit(Add(position,sp,sp,tmp));
  7910. SetLabel(exit);
  7911. END;
  7912. END;
  7913. END;
  7914. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7915. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7916. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7917. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7918. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7919. callingConvention := procedureType.callingConvention;
  7920. left.SetType(procedure.type);
  7921. formalParameter := procedureType.firstParameter;
  7922. (* push array to allocate *)
  7923. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  7924. formalParameter :=formalParameter.nextParameter;
  7925. (* push length array *)
  7926. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  7927. (* push size *)
  7928. type := t0;
  7929. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7930. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7931. END;
  7932. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7933. Emit(Push(position,tmp));
  7934. (* *)
  7935. IF SemanticChecker.ContainsPointer(type) THEN
  7936. tmp := TypeDescriptorAdr(type);
  7937. ELSE
  7938. tmp := IntermediateCode.Immediate(addressType, 0);
  7939. END;
  7940. Emit(Push(position,tmp)); (* type descriptor *)
  7941. StaticCallOperand(result,procedure);
  7942. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7943. ReleaseOperand(result);
  7944. END;
  7945. (*
  7946. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7947. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7948. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7949. *)
  7950. ELSE
  7951. (*
  7952. push len0
  7953. push len1
  7954. push len2
  7955. push size
  7956. push len_adr
  7957. push element_size
  7958. push tag
  7959. push adr
  7960. *)
  7961. dim := 0;
  7962. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7963. isTensor := TRUE;
  7964. ELSE
  7965. isTensor := FALSE;
  7966. END;
  7967. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7968. IF ~isTensor THEN
  7969. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7970. END;
  7971. parameter := x.parameters.GetExpression(i);
  7972. Evaluate(parameter,r);
  7973. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7974. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7975. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7976. END;
  7977. Emit(Push(position,r.op));
  7978. ReleaseOperand(r);
  7979. INC(dim);
  7980. END;
  7981. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7982. Emit(Mov(position, adr, sp));
  7983. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7984. Emit(Push(position, adr));
  7985. ReleaseIntermediateOperand(adr);
  7986. openDim := dim;
  7987. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7988. IF isTensor THEN
  7989. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7990. ELSE
  7991. baseType := SemanticChecker.ArrayBase(type,openDim);
  7992. END;
  7993. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7994. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7995. IF SemanticChecker.ContainsPointer(baseType) THEN
  7996. tmp := TypeDescriptorAdr(baseType);
  7997. ELSE
  7998. tmp := nil;
  7999. END;
  8000. Emit(Push(position,tmp)); (* type descriptor *)
  8001. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  8002. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  8003. ELSE (* error message has already been emited *)
  8004. RETURN;
  8005. END;
  8006. Designate(p0,l);
  8007. IF isTensor THEN
  8008. Emit(Push(position,l.op)); (* address *)
  8009. ELSE
  8010. Emit(Push(position,l.tag)); (* address *)
  8011. END;
  8012. ReleaseOperand(l);
  8013. StaticCallOperand(result,procedure);
  8014. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  8015. ReleaseOperand(result);
  8016. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  8017. Emit(Add(position,sp,sp,tmp));
  8018. END;
  8019. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  8020. THEN
  8021. IF ~backend.cellsAreObjects THEN RETURN END;
  8022. IF InCellScope(currentScope) THEN
  8023. PushSelfPointer()
  8024. ELSE
  8025. Emit(Push(position, nil));
  8026. END;
  8027. (* push temp address *)
  8028. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  8029. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  8030. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8031. (* l.op contains address of pointer to record *)
  8032. Emit(Push(position,l.op)); (* address for use after syscall *)
  8033. ReleaseOperand(l);
  8034. (* push type descriptor *)
  8035. reg := TypeDescriptorAdr(baseType);
  8036. Emit(Push(position,reg));
  8037. ReleaseIntermediateOperand(reg);
  8038. (* push name *)
  8039. (*Global.GetSymbolName(p0, n);*)
  8040. IF currentScope IS SyntaxTree.ProcedureScope THEN
  8041. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  8042. ELSE
  8043. Global.GetModuleName(module.module, n);
  8044. END;
  8045. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  8046. (*type.typeDeclaration.GetName(n);*)
  8047. PushConstString(n);
  8048. (* push cellnet boolean *)
  8049. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  8050. (* push engine boolean *)
  8051. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  8052. (* allocate *)
  8053. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  8054. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8055. (* l.op contains address of pointer to record *)
  8056. ToMemory(l.op,addressType,0);
  8057. (* l.op contains value of pointer to record *)
  8058. InitFields(baseType, l.op,0);
  8059. (* add capabilities *)
  8060. modifier := p0(SyntaxTree.Designator).modifiers;
  8061. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  8062. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  8063. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  8064. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  8065. END;
  8066. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  8067. (*
  8068. modifier := baseType(SyntaxTree.CellType).modifiers;
  8069. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  8070. modifier := p0(SyntaxTree.Designator).modifiers;
  8071. *)
  8072. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  8073. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8074. (* l.op contains address of pointer to record *)
  8075. ToMemory(l.op,addressType,0);
  8076. (* l.op contains value of pointer to record *)
  8077. Emit(Push(position,l.op)); (* address for use after syscall *)
  8078. ReleaseOperand(l);
  8079. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  8080. prevScope := currentScope;
  8081. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  8082. previous := section;
  8083. section := init;
  8084. (* add ports *)
  8085. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  8086. CloseInitializer(previous);
  8087. currentScope := prevScope;
  8088. Symbol(temporaryVariable,l);
  8089. ToMemory(l.op,addressType,0);
  8090. Emit(Push(position,l.op));
  8091. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8092. (*
  8093. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8094. IF constructor # NIL THEN
  8095. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8096. FOR i := 1 TO x.parameters.Length()-1 DO
  8097. p := x.parameters.GetExpression(i);
  8098. Global.GetSymbolName(parameter,name);
  8099. Evaluate(p, value);
  8100. ASSERT(value.type # NIL);
  8101. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8102. par := instance.AddParameter(name);
  8103. par.SetInteger(value.integer);
  8104. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8105. par := instance.AddParameter(name);
  8106. par.SetBoolean(value.boolean);
  8107. ELSE Error(x.position,NotYetImplemented)
  8108. END;
  8109. parameter := parameter.nextParameter
  8110. END;
  8111. END;
  8112. *)
  8113. (* call initializer *)
  8114. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8115. IF constructor # NIL THEN
  8116. (*! should be unified with ProcedureCallDesignator *)
  8117. IF backend.cellsAreObjects THEN
  8118. Symbol(temporaryVariable,l);
  8119. ToMemory(l.op,addressType,0);
  8120. Emit(Push(position,l.op));
  8121. ReleaseOperand(l);
  8122. END;
  8123. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8124. FOR i := firstPar TO x.parameters.Length()-1 DO
  8125. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8126. formalParameter := formalParameter.nextParameter;
  8127. END;
  8128. (* static call of the constructor *)
  8129. Global.GetSymbolSegmentedName(constructor,name);
  8130. ASSERT(~constructor.isInline);
  8131. IF constructor.scope.ownerModule # module.module THEN
  8132. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8133. ELSE
  8134. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8135. END;
  8136. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8137. (*ELSE
  8138. ReleaseIntermediateOperand(pointer);*)
  8139. END;
  8140. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8141. ToMemory(l.op, addressType, 0);
  8142. Designate(p0,s0);
  8143. ToMemory(s0.op,addressType,0);
  8144. Emit(Mov(position,s0.op,l.op));
  8145. ReleaseOperand(l);
  8146. ReleaseOperand(s0);
  8147. result.tag := emptyOperand;
  8148. (* start *)
  8149. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8150. (* push cell *)
  8151. Symbol(temporaryVariable, l);
  8152. ToMemory(l.op,addressType,0);
  8153. Emit(Push(Basic.invalidPosition,l.op));
  8154. (* push delegate *)
  8155. Emit(Push(Basic.invalidPosition,l.op));
  8156. ReleaseOperand(l);
  8157. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8158. Emit(Push(position, s1.op));
  8159. ReleaseOperand(s1);
  8160. CallThis(position,"ActiveCellsRuntime","Start",3);
  8161. END;
  8162. (*IF temporaryVariable # NIL THEN
  8163. end := NewLabel();
  8164. BrL(end);
  8165. SetLabel(exit);
  8166. Designate(p0,l);
  8167. ToMemory(l.op,addressType,0);
  8168. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8169. ReleaseOperand(l);
  8170. SetLabel(end);
  8171. ELSE
  8172. SetLabel(exit);
  8173. END;
  8174. *)
  8175. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8176. ELSE (* no pointer to record, no pointer to array *)
  8177. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8178. (* ignore new statement *)
  8179. Warning(p0.position, "cannot run on final hardware");
  8180. ELSE
  8181. HALT(200);
  8182. END;
  8183. END;
  8184. (* ---- ADDRESSOF----- *)
  8185. |Global.systemAdr:
  8186. Designate(p0,s0);
  8187. s0.mode := ModeValue;
  8188. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8189. ReleaseIntermediateOperand(s0.op);
  8190. s0.op := s0.tag;
  8191. IntermediateCode.InitOperand(s0.tag);
  8192. END;
  8193. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8194. result := s0;
  8195. (* ---- BIT ----- *)
  8196. |Global.systemBit:
  8197. Evaluate(p0,s0);
  8198. ToMemory(s0.op,addressType,0);
  8199. ReuseCopy(res,s0.op);
  8200. ReleaseOperand(s0);
  8201. Evaluate(p1,s1);
  8202. Emit(Ror(position,res,res,s1.op));
  8203. ReleaseOperand(s1);
  8204. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8205. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8206. InitOperand(result,ModeValue);
  8207. result.op := res;
  8208. (* --- MSK ----*)
  8209. |Global.systemMsk:
  8210. Evaluate(p0,s0);
  8211. Evaluate(p1,s1);
  8212. ReuseCopy(res,s0.op);
  8213. ReleaseOperand(s0);
  8214. Emit(And(position,res,res,s1.op));
  8215. ReleaseOperand(s1);
  8216. InitOperand(result,ModeValue);
  8217. result.op := res;
  8218. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8219. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8220. Evaluate(p0,s0);
  8221. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8222. ReleaseOperand(s0);
  8223. InitOperand(result,ModeValue);
  8224. result.op := res;
  8225. (* ---- SYSTEM.GetStackPointer ----- *)
  8226. |Global.systemGetStackPointer:
  8227. InitOperand(result,ModeValue);
  8228. result.op := sp;
  8229. (* ---- SYSTEM.GetFramePointer ----- *)
  8230. |Global.systemGetFramePointer:
  8231. InitOperand(result,ModeValue);
  8232. result.op := fp;
  8233. (* ---- SYSTEM.GetActivity ----- *)
  8234. |Global.systemGetActivity:
  8235. ASSERT(backend.cooperative);
  8236. InitOperand(result,ModeValue);
  8237. result.op := ap;
  8238. (* ---- SYSTEM.SetStackPointer ----- *)
  8239. |Global.systemSetStackPointer:
  8240. Evaluate(p0,s0); (* *)
  8241. Emit(Mov(position,sp,s0.op));
  8242. ReleaseOperand(s0);
  8243. (* ---- SYSTEM.SetFramePointer ----- *)
  8244. |Global.systemSetFramePointer:
  8245. Evaluate(p0,s0); (* *)
  8246. Emit(Mov(position,fp,s0.op));
  8247. ReleaseOperand(s0);
  8248. (* ---- SYSTEM.Activity ----- *)
  8249. |Global.systemSetActivity:
  8250. ASSERT(backend.cooperative);
  8251. Evaluate(p0,s0); (* *)
  8252. Emit(Mov(position,ap,s0.op));
  8253. ReleaseOperand(s0);
  8254. (* ---- SYSTEM.VAL ----- *)
  8255. |Global.systemVal:
  8256. Expression(p1);
  8257. s1 := result;
  8258. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8259. IF s1.mode = ModeReference THEN
  8260. (* nothing to be done if not record type, just take over new type *)
  8261. IF (type IS SyntaxTree.RecordType) THEN
  8262. ReleaseIntermediateOperand(s1.tag);
  8263. s1.tag := TypeDescriptorAdr(type);
  8264. UseIntermediateOperand(s1.tag);
  8265. END;
  8266. result := s1;
  8267. ELSE (* copy over result to different type, may not use convert *)
  8268. itype := IntermediateCode.GetType(system,type);
  8269. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8270. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8271. Emit(Mov(position,s0.op,s1.op));
  8272. ReleaseOperand(s1);
  8273. InitOperand(result,ModeValue);
  8274. result.op := s0.op;
  8275. ELSE (* different size, must convert *)
  8276. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8277. Convert(s1.op, IntermediateCode.GetType(system,type));
  8278. result := s1;
  8279. END;
  8280. END;
  8281. (* ---- SYSTEM.GET ----- *)
  8282. |Global.systemGet:
  8283. Evaluate(p0,s0); (* adr *)
  8284. Designate(p1,s1); (* variable *)
  8285. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8286. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8287. Emit(Mov(position,s1.op,s0.op));
  8288. ReleaseOperand(s1);
  8289. ReleaseOperand(s0);
  8290. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8291. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8292. Evaluate(p0,s0); (* *)
  8293. Evaluate(p1,s1); (* variable *)
  8294. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8295. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8296. (* real part *)
  8297. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8298. Emit(Mov(position,res, s1.op));
  8299. ReleaseIntermediateOperand(res);
  8300. (* imaginary part *)
  8301. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8302. Emit(Mov(position,res, s1.tag));
  8303. ReleaseIntermediateOperand(res);
  8304. ReleaseOperand(s1);
  8305. ReleaseOperand(s0);
  8306. ELSE
  8307. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8308. ReleaseOperand(s0);
  8309. Emit(Mov(position,res,s1.op));
  8310. ReleaseIntermediateOperand(res);
  8311. ReleaseOperand(s1);
  8312. END;
  8313. (* ---- SYSTEM.MOVE ----- *)
  8314. |Global.systemMove:
  8315. Evaluate(p0,s0);
  8316. Evaluate(p1,s1);
  8317. Evaluate(p2,s2);
  8318. Emit(Copy(position,s1.op,s0.op,s2.op));
  8319. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8320. (* ---- SYSTEM.NEW ----- *)
  8321. |Global.systemNew:
  8322. Designate(p0,s0);
  8323. Emit(Push(position,s0.op));
  8324. ReleaseOperand(s0);
  8325. Evaluate(p1,s1);
  8326. Emit(Push(position,s1.op));
  8327. ReleaseOperand(s1);
  8328. (* push realtime flag: false by default *)
  8329. Emit(Push(position,false));
  8330. CallThis(position,"Heaps","NewSys",3);
  8331. (* ---- SYSTEM.CALL ----- *)
  8332. |Global.systemRef:
  8333. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8334. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8335. s0.mode := ModeValue;
  8336. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8337. result := s0
  8338. (* ---- INCR ----- *)
  8339. |Global.Incr:
  8340. Designate(p0,operand);
  8341. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8342. Dereference(operand,p0.type.resolved,FALSE);
  8343. END;
  8344. ASSERT(p1 # NIL);
  8345. Evaluate(p1,l);
  8346. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8347. ReleaseOperand(operand); ReleaseOperand(l);
  8348. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8349. (* ---- SUM ----- *)
  8350. |Global.Sum: HALT(200);
  8351. (* ---- ALL ----- *)
  8352. |Global.All: HALT(200);
  8353. (* ---- CAS ----- *)
  8354. |Global.Cas:
  8355. needsTrace := p0.NeedsTrace();
  8356. IF needsTrace THEN ModifyAssignments(true) END;
  8357. Designate(p0,s0);
  8358. Evaluate(p1,s1);
  8359. Evaluate(p2,s2);
  8360. IF needsTrace THEN
  8361. Emit(Push(position, s0.op));
  8362. Emit(Push(position, s1.op));
  8363. Emit(Push(position, s2.op));
  8364. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8365. ELSE
  8366. Emit(Cas(position,s0.op,s1.op,s2.op));
  8367. END;
  8368. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8369. IF needsTrace THEN ModifyAssignments(false) END;
  8370. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8371. Emit(Result(position, res));
  8372. result.op := res;
  8373. result.mode := ModeValue;
  8374. (*
  8375. IF conditional THEN
  8376. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8377. BrL(falseLabel);
  8378. ReleaseIntermediateOperand(res);
  8379. END;
  8380. *)
  8381. (* ---- DIM ----- *)
  8382. |Global.Dim:
  8383. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8384. Designate(p0,s0);
  8385. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8386. Dereference(s0,p0.type.resolved,FALSE);
  8387. END;
  8388. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8389. ReleaseOperand(s0);
  8390. (* ---- RESHAPE ----- *)
  8391. |Global.Reshape:
  8392. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8393. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8394. left.SetType(procedure.type);
  8395. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8396. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8397. END;
  8398. (* ---- SYSTEM.TYPECODE ----- *)
  8399. |Global.systemTypeCode:
  8400. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8401. IF type.resolved IS SyntaxTree.PointerType THEN
  8402. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8403. END;
  8404. result.op := TypeDescriptorAdr(type);
  8405. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8406. result.mode := ModeValue;
  8407. (* ---- SYSTEM.TRACE ----- *)
  8408. |Global.systemTrace:
  8409. SystemTrace(x.parameters, x.position);
  8410. (* ----- CONNECT ------*)
  8411. |Global.Connect:
  8412. IF backend.cellsAreObjects THEN
  8413. PushPort(p0);
  8414. PushPort(p1);
  8415. IF p2 # NIL THEN
  8416. Evaluate(p2, s2);
  8417. Emit(Push(p2.position, s2.op));
  8418. ReleaseOperand(s2);
  8419. ELSE
  8420. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8421. END;
  8422. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8423. ELSE
  8424. Warning(x.position, "cannot run on final hardware");
  8425. END;
  8426. (* ----- DELEGATE ------*)
  8427. |Global.Delegate:
  8428. IF backend.cellsAreObjects THEN
  8429. PushPort(p0);
  8430. PushPort(p1);
  8431. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8432. ELSE
  8433. Warning(x.position, "cannot run on final hardware");
  8434. END;
  8435. (* ----- SEND ------*)
  8436. |Global.Send:
  8437. Evaluate(p0,s0);
  8438. Evaluate(p1,s1);
  8439. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8440. Emit(Push(position,s0.op));
  8441. Emit(Push(position,s1.op));
  8442. (*
  8443. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8444. *)
  8445. IF ~backend.cellsAreObjects THEN
  8446. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8447. END;
  8448. ReleaseOperand(s0);
  8449. ReleaseOperand(s1);
  8450. IF backend.cellsAreObjects THEN
  8451. CallThis(position,"ActiveCellsRuntime","Send",2);
  8452. ELSE
  8453. CallThis(position,ChannelModuleName,"Send",2);
  8454. END;
  8455. (* ----- RECEIVE ------*)
  8456. |Global.Receive:
  8457. Evaluate(p0,s0);
  8458. Emit(Push(position,s0.op));
  8459. Designate(p1,s1);
  8460. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8461. Emit(Push(position,s1.op));
  8462. IF p2 # NIL THEN
  8463. Designate(p2,s2);
  8464. Emit(Push(position,s2.op));
  8465. END;
  8466. (*
  8467. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8468. *)
  8469. IF ~backend.cellsAreObjects THEN
  8470. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8471. END;
  8472. ReleaseOperand(s0);
  8473. ReleaseOperand(s1);
  8474. ReleaseOperand(s2);
  8475. IF backend.cellsAreObjects THEN
  8476. IF p2 = NIL THEN
  8477. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8478. ELSE
  8479. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8480. END;
  8481. ELSE
  8482. IF p2 = NIL THEN
  8483. CallThis(position,ChannelModuleName,"Receive",2)
  8484. ELSE
  8485. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8486. END;
  8487. END;
  8488. | Global.systemSpecial:
  8489. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8490. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8491. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8492. (* determine if parameters are of the VAR kind *)
  8493. ASSERT(x.parameters.Length() <= 3);
  8494. formalParameter := procedureType.firstParameter;
  8495. FOR i := 0 TO x.parameters.Length() - 1 DO
  8496. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8497. formalParameter := formalParameter.nextParameter
  8498. END;
  8499. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8500. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8501. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8502. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8503. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8504. IF procedureType.returnType # NIL THEN
  8505. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8506. Emit(Result(position, res));
  8507. (*InitOperand(result,ModeValue);
  8508. result.op := res;
  8509. *)
  8510. InitOperand(result,ModeValue); result.op := res;
  8511. END
  8512. ELSE (* function not yet implemented *)
  8513. Error(position,"not yet implemented");
  8514. END;
  8515. destination := dest;
  8516. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8517. END VisitBuiltinCallDesignator;
  8518. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8519. VAR trueL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8520. BEGIN
  8521. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8522. dest := destination; destination := emptyOperand;
  8523. Expression(x.left);
  8524. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8525. ELSIF isUnchecked THEN (* no check *)
  8526. ELSE
  8527. trueL := NewLabel();
  8528. IF IsPointerToRecord(x.left.type,recordType) THEN
  8529. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8530. Emit(Mov(position,tag, result.op));
  8531. IF result.mode # ModeValue THEN
  8532. ptr := tag;
  8533. IntermediateCode.MakeMemory(ptr,addressType);
  8534. Emit(Mov(position,tag, ptr));
  8535. END;
  8536. IF ~backend.cooperative THEN
  8537. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8538. END;
  8539. IntermediateCode.MakeMemory(tag,addressType);
  8540. ELSE
  8541. tag := result.tag;
  8542. UseIntermediateOperand(tag);
  8543. END;
  8544. TypeTest(tag,x.type,trueL,TRUE,FALSE);
  8545. ReleaseIntermediateOperand(tag);
  8546. EmitTrap(position,TypeCheckTrap);
  8547. SetLabel(trueL);
  8548. END;
  8549. destination := dest;
  8550. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8551. END VisitTypeGuardDesignator;
  8552. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8553. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8554. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8555. VAR label: Label; pc: LONGINT;
  8556. BEGIN
  8557. IF backend.cooperative & ~isUnchecked THEN
  8558. pc := section.pc;
  8559. label := NewLabel();
  8560. BrneL(label, operand.op, nil);
  8561. EmitTrap(position, NilPointerTrap);
  8562. SetLabel(label);
  8563. INC(statCoopNilCheck, section.pc - pc);
  8564. END;
  8565. END NilCheck;
  8566. BEGIN
  8567. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8568. ReuseCopy(dereferenced,operand.op);
  8569. ReleaseOperand(operand);
  8570. operand.mode := ModeReference;
  8571. operand.op := dereferenced;
  8572. operand.tag := dereferenced;
  8573. UseIntermediateOperand(operand.tag);
  8574. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8575. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8576. ReleaseIntermediateOperand(operand.tag);
  8577. operand.tag := TypeDescriptorAdr(type);
  8578. ELSE
  8579. IF ~backend.cooperative THEN
  8580. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8581. END;
  8582. IntermediateCode.MakeMemory(operand.tag,addressType);
  8583. END;
  8584. NilCheck(operand.op);
  8585. ELSIF type IS SyntaxTree.ArrayType THEN
  8586. IF isUnsafe THEN
  8587. NilCheck(operand.op);
  8588. ReleaseIntermediateOperand(operand.tag);
  8589. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8590. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8591. ELSE
  8592. operand.tag := emptyOperand;
  8593. END;
  8594. ELSE
  8595. NilCheck(operand.op);
  8596. IF backend.cooperative THEN
  8597. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8598. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8599. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8600. ELSE
  8601. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8602. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8603. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8604. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8605. END;
  8606. END;
  8607. ELSIF type IS SyntaxTree.MathArrayType THEN
  8608. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8609. IntermediateCode.MakeMemory(operand.op,addressType);
  8610. ELSE HALT(100);
  8611. END;
  8612. END Dereference;
  8613. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8614. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8615. BEGIN
  8616. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8617. dest := destination; destination := emptyOperand;
  8618. Evaluate(x.left,d);
  8619. type := x.type.resolved;
  8620. prevIsUnchecked := isUnchecked;
  8621. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8622. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8623. END;
  8624. Dereference(d,type,IsUnsafePointer(x.left.type));
  8625. isUnchecked := prevIsUnchecked;
  8626. result := d;
  8627. 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
  8628. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8629. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8630. END;
  8631. END;
  8632. destination := dest;
  8633. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8634. END VisitDereferenceDesignator;
  8635. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8636. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8637. BEGIN
  8638. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8639. dest := destination; destination := emptyOperand;
  8640. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8641. tag := result.op;
  8642. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8643. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8644. StaticCallOperand(result,procedure.super);
  8645. ReleaseIntermediateOperand(result.tag);
  8646. UseIntermediateOperand(tag); (* necessary ? *)
  8647. result.tag := tag;
  8648. destination := dest;
  8649. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8650. END VisitSupercallDesignator;
  8651. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8652. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8653. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8654. name: Basic.SegmentedName;
  8655. procedure: SyntaxTree.Procedure;
  8656. procedureType: SyntaxTree.ProcedureType;
  8657. BEGIN
  8658. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8659. dest := destination; destination := emptyOperand;
  8660. scope := currentScope;
  8661. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8662. scope := scope.outerScope;
  8663. END;
  8664. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8665. moduleSection := meta.ModuleSection();
  8666. IF backend.cooperative THEN
  8667. moduleOffset := 0;
  8668. ELSE
  8669. moduleOffset := moduleSection.pc;
  8670. END;
  8671. result.mode := ModeValue;
  8672. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8673. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8674. result.mode := ModeValue;
  8675. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8676. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8677. ELSE
  8678. GetBaseRegister(basereg,currentScope,scope);
  8679. InitOperand(result,ModeReference);
  8680. result.op := basereg;
  8681. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8682. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8683. parametersSize := ProcParametersSize(procedure);
  8684. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8685. IF backend.cooperative THEN
  8686. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8687. END;
  8688. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8689. MakeMemory(result.op, result.op, addressType, 0);
  8690. END;
  8691. (* tag must be loaded when dereferencing SELF pointer *)
  8692. END;
  8693. destination := dest;
  8694. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8695. END VisitSelfDesignator;
  8696. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8697. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8698. BEGIN
  8699. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8700. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8701. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8702. parameter := procedureType.returnParameter;
  8703. IF currentIsInline THEN
  8704. map := currentMapper.Get(NIL);
  8705. IF map # NIL THEN
  8706. Designate(map.to, result);
  8707. ELSE
  8708. HALT(200);
  8709. END;
  8710. RETURN;
  8711. END;
  8712. VisitParameter(parameter);
  8713. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8714. END VisitResultDesignator;
  8715. (** values *)
  8716. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8717. BEGIN
  8718. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8719. InitOperand(result,ModeValue);
  8720. IF x.value THEN result.op := true ELSE result.op := false END;
  8721. END VisitBooleanValue;
  8722. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8723. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8724. BEGIN
  8725. Global.GetModuleSegmentedName(module.module, name);
  8726. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8727. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8728. RETURN section
  8729. END GetDataSection;
  8730. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8731. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8732. BEGIN
  8733. type := vop.type;
  8734. data := GetDataSection();
  8735. pc := EnterImmediate(data,vop);
  8736. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8737. IntermediateCode.MakeMemory(vop, type);
  8738. END GetImmediateMem;
  8739. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8740. BEGIN
  8741. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8742. InitOperand(result,ModeValue);
  8743. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8744. IF ~supportedImmediate(result.op) &~inData THEN
  8745. GetImmediateMem(result.op)
  8746. END;
  8747. END VisitIntegerValue;
  8748. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8749. BEGIN
  8750. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8751. InitOperand(result,ModeValue);
  8752. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8753. END VisitCharacterValue;
  8754. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8755. BEGIN
  8756. IF Trace THEN TraceEnter("VisitSetValue") END;
  8757. InitOperand(result,ModeValue);
  8758. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  8759. END VisitSetValue;
  8760. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8761. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8762. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8763. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8764. BEGIN
  8765. numberElements := x.elements.Length();
  8766. FOR i := 0 TO numberElements-1 DO
  8767. expression := x.elements.GetExpression(i);
  8768. IF expression IS SyntaxTree.MathArrayExpression THEN
  8769. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8770. ELSE
  8771. inData := TRUE;
  8772. Evaluate(expression,op);
  8773. irv.Emit(Data(position,op.op));
  8774. inData := FALSE;
  8775. ReleaseOperand(op);
  8776. END;
  8777. END;
  8778. END RecursiveData;
  8779. BEGIN
  8780. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8781. IF ~TryConstantDeclaration() THEN
  8782. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8783. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8784. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8785. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8786. ELSE
  8787. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8788. END;
  8789. RecursiveData(x.array);
  8790. InitOperand(result,ModeReference);
  8791. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8792. END
  8793. END VisitMathArrayValue;
  8794. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8795. VAR constant: Sections.Section;
  8796. BEGIN
  8797. IF constantDeclaration = NIL THEN
  8798. RETURN FALSE
  8799. ELSE
  8800. (* Is a constant in this module: did we generate it already? *)
  8801. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8802. IF constant # NIL THEN
  8803. InitOperand(result,ModeReference);
  8804. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8805. RETURN TRUE;
  8806. END;
  8807. END;
  8808. RETURN FALSE
  8809. END TryConstantDeclaration;
  8810. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8811. BEGIN
  8812. constantDeclaration := x;
  8813. VExpression(x.value.resolved);
  8814. END VisitConstant;
  8815. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8816. BEGIN
  8817. IF Trace THEN TraceEnter("VisitRealValue") END;
  8818. InitOperand(result,ModeValue);
  8819. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8820. END VisitRealValue;
  8821. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8822. VAR
  8823. componentType: SyntaxTree.Type;
  8824. BEGIN
  8825. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8826. ASSERT(x.type IS SyntaxTree.ComplexType);
  8827. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8828. InitOperand(result,ModeValue);
  8829. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8830. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8831. END VisitComplexValue;
  8832. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8833. VAR i: LONGINT; name: Basic.SegmentedName;
  8834. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8835. BEGIN
  8836. IF Trace THEN TraceEnter("VisitStringValue") END;
  8837. IF ~TryConstantDeclaration() THEN
  8838. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8839. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8840. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8841. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8842. ELSE
  8843. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8844. END;
  8845. FOR i := 0 TO x.length-1 DO
  8846. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8847. irv.Emit(Data(position,op));
  8848. END;
  8849. InitOperand(result,ModeReference);
  8850. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8851. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8852. END
  8853. END VisitStringValue;
  8854. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8855. BEGIN
  8856. IF Trace THEN TraceEnter("VisitNilValue") END;
  8857. InitOperand(result,ModeValue);
  8858. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8859. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8860. END VisitNilValue;
  8861. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8862. BEGIN
  8863. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8864. InitOperand(result,ModeValue);
  8865. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8866. END VisitEnumerationValue;
  8867. (** symbols *)
  8868. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8869. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8870. END VisitImport;
  8871. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8872. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8873. BEGIN
  8874. IF scope # baseScope THEN
  8875. (* left := [fp+8] *)
  8876. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8877. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8878. ReuseCopy(left,right);
  8879. ReleaseIntermediateOperand(right);
  8880. scope := scope.outerScope; DEC(level);
  8881. (* { left := [left+8] } *)
  8882. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8883. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8884. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8885. Emit(Mov(position,left,right));
  8886. scope := scope.outerScope; DEC(level);
  8887. END;
  8888. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8889. result := left;
  8890. ELSE
  8891. result := fp;
  8892. END;
  8893. END GetBaseRegister;
  8894. (* EXPERIMENTAL *)
  8895. PROCEDURE GetAvailability(x: SyntaxTree.Variable): WORD;
  8896. VAR i: WORD;
  8897. BEGIN
  8898. IF ~backend.experiment THEN RETURN -1 END;
  8899. i := 0;
  8900. WHILE (availableSymbols[i].symbol # NIL) & (availableSymbols[i].symbol # x) DO
  8901. INC(i);
  8902. END;
  8903. IF availableSymbols[i].symbol = NIL THEN
  8904. availableSymbols[i].inRegister := FALSE;
  8905. availableSymbols[i].inMemory := TRUE;
  8906. availableSymbols[i].symbol := x;
  8907. END;
  8908. RETURN i;
  8909. END GetAvailability;
  8910. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8911. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8912. BEGIN
  8913. IF Trace THEN TraceEnter("VisitVariable"); END;
  8914. type := x.type.resolved;
  8915. IF (x.useRegister) THEN
  8916. InitOperand(result, ModeValue);
  8917. IF x.registerNumber < 0 THEN
  8918. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8919. reg := x.registerNumber;
  8920. ELSE
  8921. reg := registerUsageCount.Map(x.registerNumber);
  8922. UseRegister(reg);
  8923. END;
  8924. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8925. ELSIF x.externalName # NIL THEN
  8926. InitOperand(result,ModeReference);
  8927. Basic.ToSegmentedName(x.externalName^, name);
  8928. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8929. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8930. InitOperand(result,ModeReference);
  8931. GetBaseRegister(result.op,currentScope,x.scope);
  8932. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8933. (* EXPERIMENTAL *)
  8934. result.availability := GetAvailability(x);
  8935. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8936. InitOperand(result,ModeReference);
  8937. GetCodeSectionNameForSymbol(x,name);
  8938. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8939. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8940. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8941. InitOperand(result,ModeReference);
  8942. GetCodeSectionNameForSymbol(x,name);
  8943. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8944. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8945. ELSE (* field, left designator must have been emitted *)
  8946. ASSERT(result.mode = ModeReference);
  8947. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8948. ReuseCopy(temp,result.op);
  8949. ReleaseIntermediateOperand(result.op);
  8950. result.op := temp;
  8951. END;
  8952. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8953. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8954. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8955. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8956. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8957. END;
  8958. END;
  8959. END;
  8960. IF type IS SyntaxTree.ProcedureType THEN
  8961. ReleaseIntermediateOperand(result.tag);
  8962. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8963. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8964. UseIntermediateOperand(result.tag);
  8965. ELSE
  8966. result.tag := nil; (* nil *)
  8967. END;
  8968. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8969. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8970. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8971. ReleaseIntermediateOperand(result.tag);
  8972. Global.GetSymbolSegmentedName(x,name);
  8973. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8974. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8975. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8976. ELSE
  8977. END;
  8978. ELSE
  8979. ReleaseIntermediateOperand(result.tag);
  8980. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8981. END;
  8982. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8983. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8984. ReleaseIntermediateOperand(result.tag);
  8985. result.tag := result.op;
  8986. UseIntermediateOperand(result.tag);
  8987. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8988. IntermediateCode.MakeMemory(result.op,addressType);
  8989. END;
  8990. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8991. ReleaseIntermediateOperand(result.tag);
  8992. result.tag := TypeDescriptorAdr(type);
  8993. UseIntermediateOperand(result.tag);
  8994. (* tag for pointer type computed not here but during dereferencing *)
  8995. END;
  8996. IF Trace THEN TraceExit("VisitVariable") END;
  8997. END VisitVariable;
  8998. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8999. BEGIN
  9000. VisitVariable(property);
  9001. END VisitProperty;
  9002. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  9003. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; symbol: Sections.Section;
  9004. name: Basic.SegmentedName; ptype: SyntaxTree.Type; temp: IntermediateCode.Operand;
  9005. BEGIN
  9006. type := x.type.resolved;
  9007. IF Trace THEN TraceEnter("VisitParameter") END;
  9008. IF x.ownerType IS SyntaxTree.CellType THEN
  9009. ptype := x.type.resolved;
  9010. IF backend.cellsAreObjects THEN
  9011. ASSERT(result.mode = ModeReference);
  9012. IF result.op.mode = IntermediateCode.ModeMemory THEN
  9013. ReuseCopy(temp,result.op);
  9014. ReleaseIntermediateOperand(result.op);
  9015. result.op := temp;
  9016. END;
  9017. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9018. RETURN;
  9019. ELSE
  9020. InitOperand(result,ModeReference);
  9021. GetCodeSectionNameForSymbol(x,name);
  9022. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9023. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9024. RETURN;
  9025. END;
  9026. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  9027. InitOperand(result,ModeReference);
  9028. GetCodeSectionNameForSymbol(x,name);
  9029. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9030. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9031. RETURN
  9032. ELSE
  9033. GetBaseRegister(basereg,currentScope,x.scope);
  9034. InitOperand(result,ModeReference);
  9035. result.op := basereg;
  9036. END;
  9037. IF IsOpenArray(type) THEN
  9038. result.tag := basereg;
  9039. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9040. IntermediateCode.MakeMemory(result.op,addressType);
  9041. IF Global.IsOberonProcedure(x.ownerType) THEN
  9042. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  9043. UseIntermediateOperand(result.tag);
  9044. ELSE
  9045. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  9046. END;
  9047. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  9048. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9049. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9050. ELSIF IsStaticArray(type) THEN
  9051. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9052. IntermediateCode.MakeMemory(result.op,addressType);
  9053. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9054. ELSIF type IS SyntaxTree.MathArrayType THEN
  9055. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9056. WITH type: SyntaxTree.MathArrayType DO
  9057. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9058. IF type.form = SyntaxTree.Tensor THEN
  9059. ELSIF type.form = SyntaxTree.Open THEN
  9060. result.tag := result.op;
  9061. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9062. IntermediateCode.MakeMemory(result.op,addressType);
  9063. UseIntermediateOperand(result.tag);
  9064. ELSIF type.form = SyntaxTree.Static THEN
  9065. IF x.kind = SyntaxTree.ConstParameter THEN
  9066. IntermediateCode.MakeMemory(result.op,addressType);
  9067. END;
  9068. ELSE HALT(100)
  9069. END;
  9070. ELSIF x.kind = SyntaxTree.VarParameter THEN
  9071. IF type.form = SyntaxTree.Tensor THEN
  9072. ToMemory(result.op,addressType,0);
  9073. ELSIF type.form = SyntaxTree.Open THEN
  9074. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  9075. ReuseCopy(result.tag, mem);
  9076. ReleaseIntermediateOperand(mem);
  9077. ReleaseIntermediateOperand(result.op);
  9078. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9079. ELSIF type.form = SyntaxTree.Static THEN
  9080. IntermediateCode.MakeMemory(result.op,addressType);
  9081. ELSE HALT(100)
  9082. END;
  9083. ELSE HALT(100)
  9084. END;
  9085. END;
  9086. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  9087. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9088. IntermediateCode.MakeMemory(result.op,addressType);
  9089. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9090. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9091. END;
  9092. IF type IS SyntaxTree.ProcedureType THEN
  9093. ReleaseIntermediateOperand(result.tag);
  9094. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9095. IF x.kind = SyntaxTree.VarParameter THEN
  9096. ReuseCopy(result.tag,result.op);
  9097. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9098. IntermediateCode.MakeMemory(result.tag,addressType);
  9099. ELSE
  9100. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9101. UseIntermediateOperand(result.tag);
  9102. END;
  9103. ELSE
  9104. result.tag := nil;
  9105. END;
  9106. (* tag for pointer type computed not here but during dereferencing *)
  9107. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) (* & ~(x.selfParameter) *) THEN
  9108. ReleaseIntermediateOperand(result.tag);
  9109. result.tag := basereg;
  9110. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9111. IntermediateCode.MakeMemory(result.tag,addressType);
  9112. UseIntermediateOperand(result.tag);
  9113. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9114. ReleaseIntermediateOperand(result.tag);
  9115. result.tag := TypeDescriptorAdr(type);
  9116. UseIntermediateOperand(result.tag);
  9117. END;
  9118. IF Trace THEN TraceExit("VisitParameter") END;
  9119. END VisitParameter;
  9120. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9121. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9122. BEGIN
  9123. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9124. (* left.p: left already emitted *)
  9125. tag := result.op; (* value of pointer to left *)
  9126. (* get type desc *)
  9127. tmp := result.tag;
  9128. IntermediateCode.MakeMemory(tmp,addressType);
  9129. (* get method adr *)
  9130. Reuse1(reg,tmp);
  9131. ReleaseIntermediateOperand(tmp);
  9132. IF backend.cooperative THEN
  9133. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9134. WHILE recordType.baseType # NIL DO
  9135. recordType := recordType.GetBaseRecord ();
  9136. END;
  9137. GetRecordTypeName (recordType,name);
  9138. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9139. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9140. offset := 0;
  9141. ELSE
  9142. offset := 2;
  9143. END;
  9144. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9145. ELSIF meta.simple THEN
  9146. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9147. ELSE
  9148. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9149. END;
  9150. InitOperand(operand,ModeReference);
  9151. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9152. operand.op := reg;
  9153. operand.tag := tag;
  9154. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9155. END DynamicCallOperand;
  9156. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9157. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9158. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9159. BEGIN
  9160. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9161. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9162. tag := operand.op;
  9163. ReleaseIntermediateOperand(operand.tag);
  9164. ELSE tag := nil
  9165. END;
  9166. IF x.isInline THEN
  9167. sectionType := Sections.InlineCodeSection;
  9168. ELSE
  9169. sectionType := Sections.CodeSection;
  9170. END;
  9171. IF x.externalName # NIL THEN
  9172. Basic.ToSegmentedName(x.externalName^, name);
  9173. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9174. ELSE
  9175. GetCodeSectionNameForSymbol(x, name);
  9176. IF (x.scope.ownerModule = module.module) THEN
  9177. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9178. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9179. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9180. IF source.pc = 0 THEN (* no code yet *)
  9181. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9182. END;
  9183. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9184. bits := x.procedureScope.body.code.inlineCode;
  9185. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9186. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9187. binary.CopyBits(bits, 0, bits.GetSize());
  9188. source.SetResolved(binary);
  9189. ELSE
  9190. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9191. END;
  9192. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9193. END;
  9194. InitOperand(operand,ModeValue);
  9195. operand.op := reg;
  9196. operand.tag := tag;
  9197. IF Trace THEN TraceExit("StaticCallOperand") END;
  9198. END StaticCallOperand;
  9199. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9200. (* handle expressions of the form designator.procedure or procedure *)
  9201. BEGIN
  9202. IF Trace THEN TraceEnter("VisitProcedure") END;
  9203. EndBasicBlock;
  9204. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9205. DynamicCallOperand(result,x);
  9206. ELSIF x.isInline THEN
  9207. StaticCallOperand(result,x);
  9208. ELSE
  9209. StaticCallOperand(result,x);
  9210. END;
  9211. IF Trace THEN TraceExit("VisitProcedure") END;
  9212. END VisitProcedure;
  9213. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9214. BEGIN
  9215. VisitProcedure(x);
  9216. END VisitOperator;
  9217. (** statements *)
  9218. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9219. BEGIN
  9220. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9221. Expression(x.call);
  9222. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9223. ReleaseOperand(result)
  9224. END;
  9225. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9226. END VisitProcedureCallStatement;
  9227. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9228. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9229. leftBase, rightBase: SyntaxTree.Type;
  9230. procedureName,s: SyntaxTree.IdentifierString;
  9231. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9232. size: LONGINT; rightKind: LONGINT;
  9233. dummy: IntermediateCode.Operand;
  9234. CONST moduleName = "FoxArrayBase";
  9235. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9236. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9237. BEGIN
  9238. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9239. IF base IS SyntaxTree.MathArrayType THEN
  9240. base := OpenArray(base(SyntaxTree.MathArrayType));
  9241. END;
  9242. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9243. result.SetArrayBase(base);
  9244. RETURN result
  9245. END OpenArray;
  9246. BEGIN
  9247. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9248. SaveRegisters();ReleaseUsedRegisters(saved);
  9249. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9250. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9251. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9252. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9253. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9254. IF leftType.form = SyntaxTree.Tensor THEN
  9255. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9256. ELSIF leftType.form = SyntaxTree.Open THEN
  9257. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9258. ELSIF leftType.form = SyntaxTree.Static THEN
  9259. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9260. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9261. END;
  9262. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9263. IF procedure = NIL THEN
  9264. s := "Instruction not supported on target, emulation procedure ";
  9265. Strings.Append(s,moduleName);
  9266. Strings.Append(s,".");
  9267. Strings.Append(s,procedureName);
  9268. Strings.Append(s," not present");
  9269. Error(position,s);
  9270. ELSE
  9271. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9272. parameter.SetType(leftType);
  9273. parameter.SetAccess(SyntaxTree.Internal);
  9274. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9275. parameter.SetKind(rightKind);
  9276. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9277. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9278. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9279. StaticCallOperand(result,procedure);
  9280. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  9281. ReleaseOperand(result);
  9282. END;
  9283. RestoreRegisters(saved);
  9284. END;
  9285. END AssignMathArray;
  9286. VAR modifyAssignmentCounter := 0: LONGINT;
  9287. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9288. VAR processor,mem,dst: IntermediateCode.Operand;
  9289. BEGIN
  9290. IF value.intValue = true.intValue THEN
  9291. INC(modifyAssignmentCounter);
  9292. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9293. modifyAssignmentsPC := section.pc;
  9294. ELSE
  9295. DEC(modifyAssignmentCounter);
  9296. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9297. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9298. END;
  9299. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9300. dst := NewRegisterOperand (addressType);
  9301. Emit(Mov(position,dst, processor));
  9302. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9303. Emit(Mov(position,mem, value));
  9304. ReleaseIntermediateOperand(dst);
  9305. END ModifyAssignments;
  9306. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9307. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9308. BEGIN
  9309. type := left.type.resolved;
  9310. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9311. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9312. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9313. IF procedureType.returnParameter = parameter THEN
  9314. (* this is the only case where the destination can be dynamically smaller than the source
  9315. in all other cases the dynamic size has to be taken
  9316. *)
  9317. IF backend.cooperative THEN
  9318. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9319. ELSE
  9320. MakeMemory(mem, tag, addressType, 0);
  9321. END;
  9322. RETURN mem;
  9323. END;
  9324. END;
  9325. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9326. END CopySize;
  9327. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9328. VAR
  9329. leftO, rightO: Operand;
  9330. arg,mem, sizeOp: IntermediateCode.Operand;
  9331. leftType, rightType, componentType, base: SyntaxTree.Type;
  9332. size: LONGINT;
  9333. parameters: SyntaxTree.ExpressionList;
  9334. procedure: SyntaxTree.Procedure;
  9335. call: SyntaxTree.ProcedureCallDesignator;
  9336. designator: SyntaxTree.Designator;
  9337. saved: RegisterEntry;
  9338. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9339. VAR procedureType: SyntaxTree.ProcedureType;
  9340. BEGIN
  9341. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9342. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9343. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9344. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9345. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9346. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9347. IF right.id = Global.Reshape THEN RETURN TRUE
  9348. END;
  9349. END;
  9350. END;
  9351. END;
  9352. RETURN FALSE
  9353. END CanPassAsResultParameter;
  9354. BEGIN
  9355. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9356. leftType := left.type.resolved; rightType:= right.type.resolved;
  9357. IF backend.cooperative & left.NeedsTrace() THEN
  9358. ModifyAssignments(true);
  9359. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9360. Designate(right, rightO);
  9361. Designate(left, leftO);
  9362. ASSERT(leftO.mode = ModeReference);
  9363. TransferToRegister(leftO.op, leftO.op);
  9364. TransferToRegister(rightO.op, rightO.op);
  9365. Emit(Push(position, leftO.op));
  9366. Emit(Push(position, rightO.op));
  9367. CallAssignMethod(leftO.op, rightO.op, left.type);
  9368. Emit(Pop(position, rightO.op));
  9369. Emit(Pop(position, leftO.op));
  9370. sizeOp := CopySize(left, leftO.tag);
  9371. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9372. ReleaseIntermediateOperand(sizeOp);
  9373. ReleaseOperand(leftO);
  9374. ReleaseOperand(rightO);
  9375. ELSE
  9376. Evaluate(right,rightO);
  9377. Designate(left,leftO);
  9378. ASSERT(leftO.mode = ModeReference);
  9379. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9380. (* copy procedure address first *)
  9381. MakeMemory(mem,leftO.op,addressType,0);
  9382. Emit(Mov(position,mem,rightO.op));
  9383. ReleaseIntermediateOperand(mem);
  9384. (* copy pointer address *)
  9385. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9386. CallAssignPointer(leftO.tag, rightO.tag);
  9387. ELSE
  9388. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9389. CallAssignPointer(leftO.op, rightO.op);
  9390. END;
  9391. ReleaseOperand(leftO);
  9392. ReleaseOperand(rightO);
  9393. END;
  9394. ModifyAssignments(false);
  9395. RETURN;
  9396. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9397. SaveRegisters();ReleaseUsedRegisters(saved);
  9398. IF SemanticChecker.IsPointerType(leftType) THEN
  9399. Evaluate(right,rightO);
  9400. Designate(left,leftO);
  9401. Emit(Push(position,leftO.op));
  9402. ReleaseOperand(leftO);
  9403. Emit(Push(position,rightO.op));
  9404. ReleaseOperand(rightO);
  9405. CallThis(position,"Heaps","Assign",2);
  9406. ELSIF leftType.IsRecordType() THEN
  9407. Designate(right,rightO);
  9408. Designate(left,leftO);
  9409. Emit(Push(position,leftO.op));
  9410. Emit(Push(position,leftO.tag)); (* type desc *)
  9411. ReleaseOperand(leftO);
  9412. Emit(Push(position,rightO.op));
  9413. ReleaseOperand(rightO);
  9414. CallThis(position,"Heaps","AssignRecord",3);
  9415. ELSIF IsStaticArray(leftType) THEN
  9416. size := StaticArrayNumElements(leftType);
  9417. base := StaticArrayBaseType(leftType);
  9418. Designate(right,rightO);
  9419. Designate(left,leftO);
  9420. Emit(Push(position,leftO.op));
  9421. ReleaseOperand(leftO);
  9422. arg := TypeDescriptorAdr(base);
  9423. Emit(Push(position,arg));
  9424. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9425. Emit(Push(position,rightO.op));
  9426. ReleaseOperand(rightO);
  9427. CallThis(position,"Heaps","AssignArray",4);
  9428. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9429. size := StaticMathArrayNumElements(leftType);
  9430. base := StaticMathArrayBaseType(leftType);
  9431. Designate(right,rightO);
  9432. Designate(left,leftO);
  9433. Emit(Push(position,leftO.op));
  9434. ReleaseOperand(leftO);
  9435. arg := TypeDescriptorAdr(base);
  9436. Emit(Push(position,arg));
  9437. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9438. Emit(Push(position,rightO.op));
  9439. ReleaseOperand(rightO);
  9440. CallThis(position,"Heaps","AssignArray",4);
  9441. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9442. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9443. Evaluate(right,rightO);
  9444. Designate(left,leftO);
  9445. MakeMemory(mem,leftO.op,addressType,0);
  9446. Emit(Mov(position,mem,rightO.op));
  9447. ReleaseIntermediateOperand(mem);
  9448. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9449. Emit (Push(position, leftO.tag));
  9450. ReleaseOperand(leftO);
  9451. Emit (Push(position, rightO.tag));
  9452. ReleaseOperand(rightO);
  9453. CallThis(position,"Heaps","Assign", 2);
  9454. ELSE HALT(100); (* missing ? *)
  9455. END;
  9456. RestoreRegisters(saved);
  9457. RETURN;
  9458. END;
  9459. IF CanPassAsResultParameter(right) THEN
  9460. procedureResultDesignator := left(SyntaxTree.Designator);
  9461. Expression(right);
  9462. procedureResultDesignator := NIL;
  9463. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9464. (* left <-- ALIAS OF right: zerocopy *)
  9465. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9466. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9467. designator.SetType(procedure.type);
  9468. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9469. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9470. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9471. END;
  9472. ELSIF leftType IS SyntaxTree.RangeType THEN
  9473. (* LHS is of array range type *)
  9474. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9475. Evaluate(right, rightO);
  9476. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9477. (* first *)
  9478. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9479. Emit(Mov(position,mem, rightO.op));
  9480. ReleaseIntermediateOperand(mem);
  9481. (* last *)
  9482. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9483. Emit(Mov(position,mem, rightO.tag));
  9484. ReleaseIntermediateOperand(mem);
  9485. (* step *)
  9486. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9487. Emit(Mov(position,mem, rightO.extra));
  9488. ReleaseIntermediateOperand(mem);
  9489. ReleaseOperand(rightO);
  9490. ReleaseOperand(leftO)
  9491. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9492. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9493. Evaluate(right, rightO);
  9494. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9495. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9496. (* real part *)
  9497. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9498. Emit(Mov(position,mem, rightO.op));
  9499. ReleaseIntermediateOperand(mem);
  9500. (* imaginary part *)
  9501. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9502. Emit(Mov(position,mem, rightO.tag));
  9503. ReleaseIntermediateOperand(mem);
  9504. ReleaseOperand(rightO);
  9505. ReleaseOperand(leftO)
  9506. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9507. OR (leftType IS SyntaxTree.PortType) THEN
  9508. (* rightO := leftO;*)
  9509. Evaluate(right,rightO);
  9510. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9511. Designate(left,leftO);
  9512. IF leftO.mode = ModeReference THEN
  9513. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9514. destination := mem;
  9515. ELSE
  9516. destination := leftO.op;
  9517. END;
  9518. ReleaseOperand(leftO);
  9519. (* EXPERIMENTAL *)
  9520. IF (leftO.availability >= 0) & (availableSymbols[leftO.availability].inRegister) THEN
  9521. ReleaseIntermediateOperand(destination);
  9522. destination := availableSymbols[leftO.availability].register;
  9523. UseIntermediateOperand(destination);
  9524. availableSymbols[leftO.availability].inMemory := FALSE;
  9525. END;
  9526. IF destination.mode # IntermediateCode.Undefined THEN
  9527. Emit(Mov(position,destination,rightO.op));
  9528. END;
  9529. ReleaseOperand(rightO);
  9530. ReleaseIntermediateOperand(mem);
  9531. IntermediateCode.InitOperand(destination);
  9532. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9533. Evaluate(right,rightO);
  9534. Designate(left,leftO);
  9535. MakeMemory(mem,leftO.op,addressType,0);
  9536. Emit(Mov(position,mem,rightO.op));
  9537. ReleaseIntermediateOperand(mem);
  9538. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9539. (* delegate *)
  9540. (*
  9541. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9542. *)
  9543. Emit(Mov(position,leftO.tag,rightO.tag));
  9544. END;
  9545. ReleaseOperand(leftO);
  9546. ReleaseOperand(rightO);
  9547. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9548. Designate(right,rightO);
  9549. Designate(left,leftO);
  9550. sizeOp := CopySize(left, leftO.tag);
  9551. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9552. ReleaseIntermediateOperand(sizeOp);
  9553. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9554. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9555. IF (rightType IS SyntaxTree.StringType) THEN
  9556. CopyString(left,right);
  9557. 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
  9558. Designate(right,rightO);
  9559. Designate(left,leftO);
  9560. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9561. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9562. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9563. ELSE
  9564. HALT(201)
  9565. END;
  9566. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9567. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9568. Designate(right,rightO);
  9569. Designate(left,leftO);
  9570. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9571. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  9572. MakeMemory(mem, rightO.op, leftO.op.type,0);
  9573. Emit(Mov(position, leftO.op, mem));
  9574. ReleaseIntermediateOperand(mem);
  9575. ELSE
  9576. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9577. END;
  9578. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9579. ELSE
  9580. AssignMathArray(left,right);
  9581. END;
  9582. ELSE
  9583. HALT(200);
  9584. END;
  9585. END Assign;
  9586. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9587. BEGIN
  9588. IF Trace THEN TraceEnter("VisitAssignment") END;
  9589. Assign(x.left,x.right);
  9590. IF Trace THEN TraceExit("VisitAssignment") END;
  9591. END VisitAssignment;
  9592. PROCEDURE EmitCooperativeSwitch;
  9593. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9594. BEGIN
  9595. ASSERT (cooperativeSwitches);
  9596. pc := section.pc;
  9597. IF lastSwitchPC = section.pc THEN RETURN END;
  9598. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9599. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9600. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9601. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9602. INC(statCoopSwitch, section.pc - pc);
  9603. END EmitCooperativeSwitch;
  9604. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9605. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9606. BEGIN
  9607. p0 := communication.left; p1 := communication.right;
  9608. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9609. Evaluate(p0,s0);
  9610. Evaluate(p1,s1);
  9611. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9612. Emit(Push(position,s0.op));
  9613. Emit(Push(position,s1.op));
  9614. (*
  9615. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9616. *)
  9617. IF ~backend.cellsAreObjects THEN
  9618. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9619. END;
  9620. ReleaseOperand(s0);
  9621. ReleaseOperand(s1);
  9622. IF backend.cellsAreObjects THEN
  9623. CallThis(position,"ActiveCellsRuntime","Send",2);
  9624. ELSE
  9625. CallThis(position,ChannelModuleName,"Send",2);
  9626. END;
  9627. (* ----- RECEIVE ------*)
  9628. ELSE
  9629. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9630. tmp := p0; p0 := p1; p1 := tmp;
  9631. END;
  9632. Evaluate(p0,s0);
  9633. Emit(Push(position,s0.op));
  9634. Designate(p1,s1);
  9635. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9636. Emit(Push(position,s1.op));
  9637. (*
  9638. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9639. *)
  9640. IF ~backend.cellsAreObjects THEN
  9641. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9642. END;
  9643. ReleaseOperand(s0);
  9644. ReleaseOperand(s1);
  9645. IF backend.cellsAreObjects THEN
  9646. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9647. ELSE
  9648. CallThis(position,ChannelModuleName,"Receive",2)
  9649. END;
  9650. END;
  9651. END VisitCommunicationStatement;
  9652. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9653. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9654. PROCEDURE IfPart(if: SyntaxTree.IfPart; last: BOOLEAN);
  9655. VAR false: Label; condition, value: BOOLEAN;
  9656. BEGIN
  9657. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9658. IF condition THEN
  9659. false := NewLabel();
  9660. Condition(if.condition,false,FALSE);
  9661. StatementSequence(if.statements);
  9662. IF ~last OR (x.elsePart # NIL) THEN BrL(end) END;
  9663. SetLabel(false);
  9664. ELSE
  9665. IF value THEN (* always true *)
  9666. escape := TRUE;
  9667. StatementSequence(if.statements);
  9668. (* no branch necessary -- rest skipped *)
  9669. END;
  9670. END;
  9671. END IfPart;
  9672. BEGIN
  9673. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9674. end := NewLabel();
  9675. elsifs := x.ElsifParts();
  9676. IfPart(x.ifPart,elsifs=0);
  9677. FOR i := 0 TO elsifs-1 DO
  9678. IF ~escape THEN
  9679. elsif := x.GetElsifPart(i);
  9680. IfPart(elsif, i=elsifs-1);
  9681. END;
  9682. END;
  9683. IF (x.elsePart # NIL) & ~escape THEN
  9684. StatementSequence(x.elsePart);
  9685. END;
  9686. SetLabel(end);
  9687. IF Trace THEN TraceExit("VisitIfStatement") END;
  9688. END VisitIfStatement;
  9689. PROCEDURE BrWithPart(CONST tag: IntermediateCode.Operand; x: SyntaxTree.WithPart; VAR trueL: Label);
  9690. VAR reg: IntermediateCode.Operand;
  9691. BEGIN
  9692. trueL := NewLabel();
  9693. IF backend.cooperative THEN
  9694. IntermediateCode.InitRegister(reg,tag.type,tag.registerClass, AcquireRegister(tag.type, tag.registerClass));
  9695. Emit(Mov(position,reg,tag));
  9696. TypeTest(reg, x.type, trueL, TRUE,TRUE);
  9697. ReleaseIntermediateOperand(reg);
  9698. ELSE
  9699. TypeTest(tag, x.type, trueL, TRUE,TRUE);
  9700. END;
  9701. END BrWithPart;
  9702. PROCEDURE EmitWithPart(x: SyntaxTree.WithPart);
  9703. BEGIN
  9704. StatementSequence(x.statements);
  9705. END EmitWithPart;
  9706. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9707. VAR endL,elseL: Label;i: LONGINT; trueL: POINTER TO ARRAY OF Label; res: Operand; recordType: SyntaxTree.RecordType;
  9708. tag: IntermediateCode.Operand;
  9709. BEGIN
  9710. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9711. endL := NewLabel();
  9712. elseL := NewLabel();
  9713. Designate(x.variable,res);
  9714. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9715. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9716. END;
  9717. ReuseCopy(tag, res.tag);
  9718. ReleaseOperand(res);
  9719. NEW(trueL, x.WithParts());
  9720. FOR i := 0 TO x.WithParts()-1 DO
  9721. BrWithPart(tag, x.GetWithPart(i), trueL[i]);
  9722. END;
  9723. ReleaseIntermediateOperand(tag);
  9724. BrL(elseL);
  9725. FOR i := 0 TO x.WithParts()-1 DO
  9726. SetLabel(trueL[i]);
  9727. EmitWithPart(x.GetWithPart(i));
  9728. BrL(endL);
  9729. END;
  9730. SetLabel(elseL);
  9731. IF x.elsePart = NIL THEN
  9732. IF ~isUnchecked THEN
  9733. EmitTrap(position,WithTrap);
  9734. END;
  9735. ELSE
  9736. StatementSequence(x.elsePart)
  9737. END;
  9738. SetLabel(endL);
  9739. IF Trace THEN TraceExit("VisitWithStatement") END;
  9740. END VisitWithStatement;
  9741. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9742. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9743. out,else: Label; label: Label;
  9744. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9745. symbol: SyntaxTree.Symbol;
  9746. table: BOOLEAN;
  9747. BEGIN
  9748. (*! split case statement into if-elsif statements for large case label lists *)
  9749. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9750. range := x.max-x.min+1;
  9751. IF (range < 0) OR (range > 1024) & (range DIV x.caseParts.Length() >10) THEN
  9752. (* if case table is larger than 1024 elements and only sparsely used, then do not employ a table *)
  9753. table := FALSE;
  9754. size := x.caseParts.Length();
  9755. ELSE
  9756. table := TRUE;
  9757. size := LONGINT(range);
  9758. END;
  9759. Evaluate(x.variable,var);
  9760. ReuseCopy(tmp,var.op);
  9761. ReleaseIntermediateOperand(var.op);
  9762. var.op := tmp;
  9763. (*
  9764. UniqueId(name,module.module,"case",caseId);
  9765. *)
  9766. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9767. else := NewLabel();
  9768. IF table THEN
  9769. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9770. Convert(var.op,addressType);
  9771. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9772. ReuseCopy(res,var.op);
  9773. ReleaseOperand(var);
  9774. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9775. Global.GetModuleSegmentedName(module.module, name);
  9776. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9777. symbol := SyntaxTree.NewSymbol(name[1]);
  9778. symbol.SetScope(moduleScope);
  9779. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9780. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9781. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9782. Emit(Add(position,res,res,jmp));
  9783. IntermediateCode.MakeMemory(res,addressType);
  9784. Emit(Br(position,res));
  9785. ReleaseIntermediateOperand(res);
  9786. ELSE
  9787. ReuseCopy(res,var.op); (* make sure it is in a register *)
  9788. ReleaseOperand(var);
  9789. BrltL(else,res,IntermediateCode.Immediate(res.type,x.min));
  9790. BrltL(else,IntermediateCode.Immediate(res.type,x.max),res);
  9791. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9792. part := x.GetCasePart(i);
  9793. constant := part.firstConstant;
  9794. fixups[i] := NewLabel();
  9795. WHILE(constant # NIL) DO (* case labels for this case part *)
  9796. IF constant.min = constant.max THEN
  9797. BreqL(fixups[i], res,IntermediateCode.Immediate(res.type,constant.min));
  9798. ELSE
  9799. label := NewLabel();
  9800. BrltL(label, res, IntermediateCode.Immediate(res.type,constant.min));
  9801. BrltL(label, IntermediateCode.Immediate(res.type,constant.max),res);
  9802. BrL(fixups[i]);
  9803. SetLabel(label);
  9804. END;
  9805. constant := constant.next;
  9806. END;
  9807. END;
  9808. BrL(else);
  9809. ReleaseIntermediateOperand(res);
  9810. END;
  9811. out := NewLabel();
  9812. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9813. part := x.GetCasePart(i);
  9814. constant := part.firstConstant;
  9815. IF table THEN
  9816. label := NewLabel();
  9817. SetLabel(label);
  9818. WHILE(constant # NIL) DO (* case labels for this case part *)
  9819. FOR j := constant.min TO constant.max DO
  9820. fixups[j-x.min] := label;
  9821. END;
  9822. constant := constant.next;
  9823. END;
  9824. ELSE
  9825. SetLabel(fixups[i]);
  9826. END;
  9827. StatementSequence(part.statements);
  9828. BrL(out);
  9829. END;
  9830. SetLabel(else);
  9831. FOR i := 0 TO size-1 DO
  9832. IF fixups[i] = NIL THEN
  9833. fixups[i] := else;
  9834. END;
  9835. END;
  9836. IF x.elsePart # NIL THEN
  9837. StatementSequence(x.elsePart);
  9838. ELSIF ~isUnchecked THEN
  9839. EmitTrap(position,CaseTrap);
  9840. END;
  9841. SetLabel(out);
  9842. IF table THEN
  9843. FOR i := 0 TO size-1 DO
  9844. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9845. section.Emit(Data(position,op));
  9846. END;
  9847. END;
  9848. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9849. END VisitCaseStatement;
  9850. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9851. VAR startL,falseL: Label;
  9852. BEGIN
  9853. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9854. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9855. startL := NewLabel();
  9856. falseL := NewLabel();
  9857. SetLabel(startL);
  9858. Condition(x.condition,falseL,FALSE);
  9859. StatementSequence(x.statements);
  9860. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9861. BrL(startL);
  9862. SetLabel(falseL);
  9863. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9864. END VisitWhileStatement;
  9865. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9866. VAR falseL: Label;
  9867. BEGIN
  9868. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9869. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9870. falseL := NewLabel();
  9871. SetLabel(falseL);
  9872. StatementSequence(x.statements);
  9873. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9874. Condition(x.condition,falseL,FALSE);
  9875. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9876. END VisitRepeatStatement;
  9877. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9878. VAR
  9879. binary: SyntaxTree.BinaryExpression; startL,falseL : Label; cmp: LONGINT; by: HUGEINT;
  9880. temporaryVariable: SyntaxTree.Variable;
  9881. temporaryVariableDesignator : SyntaxTree.Designator;
  9882. BEGIN
  9883. IF Trace THEN TraceEnter("VisitForStatement") END;
  9884. falseL := NewLabel();
  9885. startL := NewLabel();
  9886. Assign(x.variable,x.from);
  9887. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9888. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9889. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9890. Assign(temporaryVariableDesignator,x.to);
  9891. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  9892. IF by > 0 THEN
  9893. cmp := Scanner.LessEqual
  9894. ELSE
  9895. cmp := Scanner.GreaterEqual
  9896. END;
  9897. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9898. binary.SetType(system.booleanType);
  9899. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9900. SetLabel(startL);
  9901. Condition(binary,falseL, FALSE);
  9902. StatementSequence(x.statements);
  9903. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9904. binary.SetType(x.variable.type);
  9905. Assign(x.variable,binary);
  9906. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9907. BrL(startL);
  9908. SetLabel(falseL);
  9909. IF Trace THEN TraceExit("VisitForStatement") END;
  9910. END VisitForStatement;
  9911. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9912. VAR prevLoop: Label;
  9913. BEGIN
  9914. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9915. prevLoop := currentLoop;
  9916. currentLoop := NewLabel();
  9917. StatementSequence(x.statements);
  9918. SetLabel(currentLoop);
  9919. currentLoop := prevLoop;
  9920. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9921. END VisitExitableBlock;
  9922. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9923. VAR prevLoop,start: Label;
  9924. BEGIN
  9925. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9926. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9927. start := NewLabel();
  9928. prevLoop := currentLoop;
  9929. SetLabel(start);
  9930. currentLoop := NewLabel();
  9931. StatementSequence(x.statements);
  9932. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9933. BrL(start);
  9934. SetLabel(currentLoop);
  9935. currentLoop := prevLoop;
  9936. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9937. END VisitLoopStatement;
  9938. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9939. VAR outer: SyntaxTree.Statement;
  9940. BEGIN
  9941. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9942. IF locked THEN (* r if we jump out of an exclusive block *)
  9943. outer := x.outer;
  9944. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9945. outer := outer.outer;
  9946. END;
  9947. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9948. Lock(FALSE);
  9949. END;
  9950. END;
  9951. BrL(currentLoop);
  9952. IF Trace THEN TraceExit("VisitExitStatement") END;
  9953. END VisitExitStatement;
  9954. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9955. VAR
  9956. expression, parameterDesignator: SyntaxTree.Expression;
  9957. type, componentType: SyntaxTree.Type;
  9958. res, right: Operand;
  9959. left, mem, reg: IntermediateCode.Operand;
  9960. parameter: SyntaxTree.Parameter;
  9961. procedure: SyntaxTree.Procedure;
  9962. procedureType: SyntaxTree.ProcedureType;
  9963. returnTypeOffset: LONGINT;
  9964. delegate: BOOLEAN;
  9965. map: SymbolMap;
  9966. callingConvention, parametersSize: LONGINT;
  9967. BEGIN
  9968. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9969. expression := x.returnValue;
  9970. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9971. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9972. IF currentIsInline THEN
  9973. IF expression # NIL THEN
  9974. map := currentMapper.Get(NIL);
  9975. IF map # NIL THEN
  9976. Assign(map.to, expression);
  9977. ELSE
  9978. Evaluate(expression,res);
  9979. Emit(Return(position,res.op));
  9980. ReleaseOperand(res);
  9981. END;
  9982. END;
  9983. BrL(currentInlineExit);
  9984. RETURN;
  9985. END;
  9986. IF expression # NIL THEN
  9987. type := expression.type.resolved;
  9988. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9989. IF locked THEN Lock(FALSE) END;
  9990. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9991. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9992. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9993. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (type IS SyntaxTree.EnumerationType) OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9994. (* return without structured return parameter *)
  9995. Evaluate(expression,res);
  9996. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9997. IF locked OR profile THEN
  9998. Emit(Push(position,res.op));
  9999. IF delegate THEN HALT(200) END;
  10000. ReleaseOperand(res);
  10001. IF locked THEN Lock(FALSE) END;
  10002. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10003. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10004. reg := NewRegisterOperand(res.op.type);
  10005. Emit(Pop(position,reg));
  10006. Emit(Return(position,reg));
  10007. ReleaseIntermediateOperand(reg);
  10008. ELSE
  10009. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10010. Emit(Return(position,res.op));
  10011. ReleaseOperand(res);
  10012. END;
  10013. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  10014. THEN
  10015. (* return using structured return parameter *)
  10016. 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)
  10017. OR SemanticChecker.IsPointerType(type));
  10018. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  10019. parameter :=procedureType.returnParameter;
  10020. ASSERT(parameter # NIL);
  10021. returnTypeOffset := parameter.offsetInBits;
  10022. (*
  10023. IF parameter# NIL THEN
  10024. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  10025. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  10026. ELSE
  10027. returnTypeOffset := system.offsetFirstParameter
  10028. END;
  10029. *)
  10030. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  10031. IF type IS SyntaxTree.RangeType THEN
  10032. (* array range type *)
  10033. Evaluate(expression, right);
  10034. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  10035. Emit(Mov(position,mem, right.op)); (* first *)
  10036. ReleaseIntermediateOperand(mem);
  10037. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10038. Emit(Mov(position,mem, right.tag)); (* last *)
  10039. ReleaseIntermediateOperand(mem);
  10040. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10041. Emit(Mov(position,mem, right.extra)); (* step *)
  10042. ReleaseIntermediateOperand(mem);
  10043. ReleaseOperand(right);
  10044. ELSIF type IS SyntaxTree.ComplexType THEN
  10045. Evaluate(expression, right);
  10046. componentType := type(SyntaxTree.ComplexType).componentType;
  10047. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  10048. Emit(Mov(position,mem, right.op)); (* real part *)
  10049. ReleaseIntermediateOperand(mem);
  10050. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10051. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  10052. ReleaseIntermediateOperand(mem);
  10053. ReleaseOperand(right);
  10054. ELSE (* covers cases: pointer / record / array *)
  10055. parameter := procedureType.returnParameter;
  10056. checker.SetCurrentScope(currentScope);
  10057. ASSERT(parameter # NIL);
  10058. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10059. Assign(parameterDesignator,expression);
  10060. END;
  10061. ReleaseIntermediateOperand(left);
  10062. IF locked THEN Lock(FALSE) END;
  10063. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10064. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10065. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  10066. parameter := procedureType.returnParameter;
  10067. checker.SetCurrentScope(currentScope);
  10068. IF parameter = NIL THEN
  10069. Error(procedure.position, "structured return of parameter of procedure not found");
  10070. ELSE
  10071. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10072. Assign(parameterDesignator,expression);
  10073. END;
  10074. IF locked THEN Lock(FALSE) END;
  10075. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10076. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10077. ELSE
  10078. HALT(200);
  10079. END;
  10080. ELSE
  10081. IF locked THEN Lock(FALSE) END;
  10082. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10083. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10084. END;
  10085. IF backend.cooperative THEN
  10086. BrL(exitLabel);
  10087. ELSE
  10088. callingConvention := procedureType.callingConvention;
  10089. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10090. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10091. ELSE
  10092. parametersSize := 0;
  10093. END;
  10094. EmitLeave(section, position,procedure, callingConvention);
  10095. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10096. END;
  10097. IF Trace THEN TraceExit("VisitReturnStatement") END;
  10098. END VisitReturnStatement;
  10099. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  10100. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  10101. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  10102. statements: SyntaxTree.StatementSequence;
  10103. name, suffix: SyntaxTree.IdentifierString;
  10104. BEGIN
  10105. Strings.IntToStr(awaitProcCounter,suffix);
  10106. Strings.Concat("@AwaitProcedure",suffix,name);
  10107. identifier := SyntaxTree.NewIdentifier(name);
  10108. INC(awaitProcCounter);
  10109. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  10110. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  10111. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  10112. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  10113. procedure.SetAccess(SyntaxTree.Hidden);
  10114. procedure.SetScope(currentScope);
  10115. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  10116. procedureType.SetReturnType(system.booleanType);
  10117. procedure.SetType(procedureType);
  10118. body := SyntaxTree.NewBody(x.position,procedureScope);
  10119. procedureScope.SetBody(body);
  10120. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  10121. returnStatement.SetReturnValue(x.condition);
  10122. statements := SyntaxTree.NewStatementSequence();
  10123. statements.AddStatement(returnStatement);
  10124. body.SetStatementSequence(statements);
  10125. currentScope.AddProcedure(procedure);
  10126. RETURN procedure
  10127. END MakeAwaitProcedure;
  10128. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  10129. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  10130. call: IntermediateCode.Operand; label, startL, trueL, falseL: Label; name: Basic.SegmentedName;
  10131. BEGIN
  10132. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10133. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10134. IF backend.cooperative THEN
  10135. startL := NewLabel();
  10136. trueL := NewLabel();
  10137. SetLabel(startL);
  10138. Condition(x.condition,trueL,TRUE);
  10139. PushSelfPointer();
  10140. CallThis(position,"ExclusiveBlocks","Await",1);
  10141. BrL(startL);
  10142. SetLabel(trueL);
  10143. PushSelfPointer();
  10144. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10145. ELSE
  10146. proc := MakeAwaitProcedure(x);
  10147. Emit(Push(position,fp));
  10148. GetCodeSectionNameForSymbol(proc,name);
  10149. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10150. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10151. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10152. Emit(Call(position,call,ProcParametersSize(proc)));
  10153. Emit(Result(position,res));
  10154. (*
  10155. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10156. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10157. *)
  10158. InitOperand(result,ModeValue);
  10159. result.op := res;
  10160. label := NewLabel();
  10161. BreqL(label, result.op, SELF.true);
  10162. ReleaseOperand(result);
  10163. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10164. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10165. Emit(Push(position,res));
  10166. Emit(Push(position,fp));
  10167. PushSelfPointer();
  10168. Emit(Push(position,nil));
  10169. CallThis(position,"Objects","Await",4);
  10170. SetLabel(label);
  10171. END;
  10172. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10173. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  10174. END VisitAwaitStatement;
  10175. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  10176. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  10177. BEGIN
  10178. FOR i := 0 TO x.Length() - 1 DO
  10179. statement := x.GetStatement( i );
  10180. Statement(statement);
  10181. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  10182. END;
  10183. END StatementSequence;
  10184. PROCEDURE PushSelfPointer;
  10185. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  10186. procedureType: SyntaxTree.ProcedureType;
  10187. BEGIN
  10188. scope := currentScope;
  10189. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  10190. scope := scope.outerScope;
  10191. END;
  10192. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  10193. moduleSection := meta.ModuleSection();
  10194. IF backend.cooperative THEN
  10195. moduleOffset := 0;
  10196. ELSE
  10197. moduleOffset := moduleSection.pc;
  10198. END;
  10199. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  10200. ELSE
  10201. GetBaseRegister(op.op,currentScope,scope);
  10202. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10203. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10204. parametersSize := ProcParametersSize(procedure);
  10205. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  10206. IF backend.cooperative THEN
  10207. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  10208. END;
  10209. IntermediateCode.MakeMemory(op.op,addressType);
  10210. END;
  10211. Emit(Push(position,op.op));
  10212. ReleaseOperand(op);
  10213. END PushSelfPointer;
  10214. PROCEDURE Lock(lock: BOOLEAN);
  10215. BEGIN
  10216. IF Trace THEN TraceEnter("Lock") END;
  10217. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10218. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  10219. ASSERT(modifyAssignmentCounter = 0);
  10220. IF dump # NIL THEN
  10221. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  10222. dump.Ln;dump.Update;
  10223. END;
  10224. PushSelfPointer;
  10225. IF backend.cooperative THEN
  10226. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  10227. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  10228. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  10229. END;
  10230. ELSE
  10231. Emit(Push(position,true));
  10232. IF lock THEN CallThis(position,"Objects","Lock",2)
  10233. ELSE CallThis(position,"Objects","Unlock",2);
  10234. END;
  10235. END;
  10236. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10237. IF Trace THEN TraceExit("Lock") END;
  10238. END Lock;
  10239. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  10240. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  10241. BEGIN
  10242. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  10243. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10244. previouslyUnchecked := isUnchecked;
  10245. isUnchecked := isUnchecked OR x.isUnchecked;
  10246. previouslyCooperativeSwitches := cooperativeSwitches;
  10247. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  10248. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  10249. IF x.statements # NIL THEN
  10250. StatementSequence(x.statements);
  10251. END;
  10252. IF (x IS SyntaxTree.Body) THEN
  10253. IF (x(SyntaxTree.Body).finally # NIL) THEN
  10254. section.SetFinally(section.pc);
  10255. StatementSequence(x(SyntaxTree.Body).finally)
  10256. ELSIF x.isExclusive THEN
  10257. end := NewLabel();
  10258. BrL(end);
  10259. section.SetFinally(section.pc);
  10260. Lock(FALSE);
  10261. EmitTrap(position,RethrowTrap);
  10262. SetLabel(end);
  10263. END;
  10264. END;
  10265. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10266. isUnchecked := previouslyUnchecked;
  10267. cooperativeSwitches := previouslyCooperativeSwitches;
  10268. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10269. END VisitStatementBlock;
  10270. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10271. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10272. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10273. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10274. procedure: SyntaxTree.Procedure;
  10275. map: SymbolMap;
  10276. callingConvention, parametersSize: LONGINT;
  10277. BEGIN
  10278. scope := currentScope;
  10279. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10280. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10281. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10282. return := emptyOperand;
  10283. IF Trace THEN TraceEnter("VisitCode") END;
  10284. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10285. NEW(in, x.inRules.Length());
  10286. FOR i := 0 TO LEN(in)-1 DO
  10287. statement := x.inRules.GetStatement(i);
  10288. WITH statement: SyntaxTree.Assignment DO
  10289. Evaluate(statement.right, operand);
  10290. result := operand.op;
  10291. NEW(str, 64);
  10292. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10293. in[i] := result; IntermediateCode.SetString(in[i], str);
  10294. ReleaseIntermediateOperand(operand.tag);
  10295. END;
  10296. END;
  10297. ELSE in := NIL
  10298. END;
  10299. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10300. NEW(out, x.outRules.Length());
  10301. FOR i := 0 TO LEN(out)-1 DO
  10302. statement := x.outRules.GetStatement(i);
  10303. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10304. WITH statement:
  10305. SyntaxTree.Assignment DO
  10306. Designate(statement.left, operand);
  10307. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10308. NEW(str, 64);
  10309. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10310. out[i] := result; IntermediateCode.SetString(out[i], str);
  10311. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10312. | SyntaxTree.ReturnStatement DO
  10313. NEW(str, 64);
  10314. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10315. IF currentIsInline THEN
  10316. map := currentMapper.Get(NIL);
  10317. Designate(map.to, operand);
  10318. IF map.isAddress THEN
  10319. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10320. ELSE
  10321. result := operand.op;
  10322. END;
  10323. (*! only if it does not fit into register
  10324. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10325. *)
  10326. (*Evaluate(map.to, operand);*)
  10327. out[i] := result;
  10328. ELSE
  10329. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10330. END;
  10331. IntermediateCode.SetString(out[i], str);
  10332. ReleaseIntermediateOperand(operand.tag);
  10333. return := out[i];
  10334. ELSE
  10335. END;
  10336. END;
  10337. ELSE out := NIL
  10338. END;
  10339. Emit(Asm(x.position,x.sourceCode, in, out));
  10340. IF in # NIL THEN
  10341. FOR i := 0 TO LEN(in)-1 DO
  10342. ReleaseIntermediateOperand(in[i]);
  10343. END;
  10344. END;
  10345. IF out # NIL THEN
  10346. FOR i := 0 TO LEN(out)-1 DO
  10347. WITH statement:
  10348. SyntaxTree.Assignment DO
  10349. ReleaseIntermediateOperand(out[i]);
  10350. |SyntaxTree.ReturnStatement DO
  10351. (* release happens below *)
  10352. ELSE
  10353. END;
  10354. statement := x.outRules.GetStatement(i);
  10355. END;
  10356. END;
  10357. IF return.mode # IntermediateCode.Undefined THEN
  10358. IF currentIsInline THEN
  10359. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10360. Symbol(procedureType.returnParameter, par);
  10361. MakeMemory(mem, par.op, return.type, 0);
  10362. ReleaseOperand(par);
  10363. Emit(Mov(position, mem, return));
  10364. ReleaseIntermediateOperand(mem);
  10365. ELSE
  10366. Emit(Return(position,return));
  10367. END;
  10368. ReleaseIntermediateOperand(return);
  10369. IF currentIsInline THEN RETURN END;
  10370. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10371. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10372. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10373. ELSE
  10374. parametersSize := 0;
  10375. END;
  10376. EmitLeave(section, position,procedure, callingConvention);
  10377. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10378. END;
  10379. IF Trace THEN TraceExit("VisitCode") END;
  10380. END VisitCode;
  10381. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  10382. BEGIN
  10383. RETURN ProcedureParametersSize(system, procedure);
  10384. END ProcParametersSize;
  10385. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10386. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10387. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10388. const, call: IntermediateCode.Operand;
  10389. parameterDesignator: SyntaxTree.Expression;
  10390. saved: RegisterEntry;
  10391. name: Basic.SegmentedName;
  10392. BEGIN
  10393. IF Trace THEN TraceEnter("ParameterCopies") END;
  10394. parameter := x.firstParameter;
  10395. WHILE parameter # NIL DO
  10396. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10397. type := parameter.type.resolved;
  10398. IF IsOpenArray(type) THEN
  10399. VisitParameter(parameter);
  10400. op := result;
  10401. IF backend.cooperative & parameter.NeedsTrace() THEN
  10402. length := GetArrayLength(type, op.tag);
  10403. size := NewRegisterOperand(addressType);
  10404. base := ArrayBaseType(type);
  10405. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10406. Emit(Mul(position, size, length, const));
  10407. dst := NewRegisterOperand (addressType);
  10408. Emit(Mov(position, dst, size));
  10409. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10410. Emit(Sub(position,dst,sp,dst));
  10411. Emit(And(position,dst,dst,const));
  10412. Emit(Mov(position,sp,dst));
  10413. par := fp;
  10414. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10415. IntermediateCode.InitImmediate(null, byteType, 0);
  10416. Emit(Fill(position, dst, size, null));
  10417. ReleaseIntermediateOperand(dst);
  10418. ReleaseIntermediateOperand(length);
  10419. SaveRegisters();ReleaseUsedRegisters(saved);
  10420. (* register dst has been freed before SaveRegisters already *)
  10421. base := ArrayBaseType(type);
  10422. (* assign method of open array *)
  10423. IF base.IsRecordType() THEN
  10424. Emit (Push(position, length));
  10425. Emit (Push(position, dst));
  10426. Emit (Push(position, op.op));
  10427. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10428. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10429. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10430. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10431. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10432. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10433. Emit (Push(position,length));
  10434. Emit (Push(position, dst));
  10435. Emit (Push(position, length));
  10436. Emit (Push(position, op.op));
  10437. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10438. ELSE
  10439. Emit (Push(position, length));
  10440. Emit (Push(position, dst));
  10441. Emit (Push(position, length));
  10442. Emit (Push(position, op.op));
  10443. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10444. ASSERT(ArrayBaseType(type).IsPointer());
  10445. END;
  10446. RestoreRegisters(saved);
  10447. ELSE
  10448. temp := GetDynamicSize(type,op.tag);
  10449. ReuseCopy(size,temp);
  10450. ReleaseIntermediateOperand(temp);
  10451. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10452. Emit(Sub(position,size,sp,size));
  10453. Emit(And(position,size,size,const));
  10454. Emit(Mov(position,sp,size));
  10455. par := fp;
  10456. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10457. ReleaseIntermediateOperand(size);
  10458. size := GetDynamicSize(type,op.tag);
  10459. END;
  10460. Emit(Copy(position,sp,op.op,size));
  10461. ReleaseIntermediateOperand(size);
  10462. ReleaseOperand(op);
  10463. IntermediateCode.MakeMemory(par,addressType);
  10464. Emit(Mov(position,par,sp));
  10465. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10466. checker.SetCurrentScope(currentScope);
  10467. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10468. Assign(parameterDesignator,parameterDesignator);
  10469. END;
  10470. END;
  10471. parameter := parameter.nextParameter;
  10472. END;
  10473. IF Trace THEN TraceExit("ParameterCopies") END;
  10474. END ParameterCopies;
  10475. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10476. VAR x: SyntaxTree.Variable;
  10477. BEGIN
  10478. x := scope.firstVariable;
  10479. WHILE x # NIL DO
  10480. InitVariable(x,FALSE);
  10481. x := x.nextVariable;
  10482. END;
  10483. END InitVariables;
  10484. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10485. BEGIN
  10486. IF (symbol # NIL) THEN
  10487. RETURN fingerPrinter.SymbolFP(symbol).public
  10488. ELSE
  10489. RETURN 0
  10490. END;
  10491. END GetFingerprint;
  10492. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10493. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10494. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10495. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10496. name: Basic.SegmentedName;
  10497. offset: LONGINT;
  10498. BEGIN
  10499. IF Trace THEN TraceEnter("Body") END;
  10500. ReleaseUsedRegisters(saved); (* just in case ... *)
  10501. section := ir;
  10502. exitLabel := NewLabel ();
  10503. IF moduleBody THEN moduleBodySection := section END;
  10504. IF ir.comments # NIL THEN
  10505. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10506. commentPrintout.SingleStatement(TRUE);
  10507. dump := ir.comments;
  10508. ELSE
  10509. commentPrintout := NIL;
  10510. dump := NIL;
  10511. END;
  10512. prevScope := currentScope;
  10513. currentScope := scope;
  10514. lastSwitchPC := 0;
  10515. cooperativeSwitches := backend.cooperative;
  10516. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10517. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10518. IF x # NIL THEN
  10519. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10520. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10521. IF moduleBody THEN
  10522. ProfilerInit();
  10523. ELSE
  10524. Basic.SegmentedNameToString(ir.name, string);
  10525. ProfilerAddProcedure(numberProcedures,string);
  10526. ProfilerEnterExit(numberProcedures,TRUE);
  10527. END;
  10528. END;
  10529. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10530. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10531. END;
  10532. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10533. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10534. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10535. IF procedure = cellScope.bodyProcedure THEN
  10536. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10537. StaticCallOperand(op, cellScope.constructor);
  10538. Emit(Call(position,op.op,0));
  10539. END;
  10540. END;
  10541. END;
  10542. InitVariables(scope);
  10543. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10544. GetCodeSectionNameForSymbol(procedure, name);
  10545. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10546. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10547. IF ProtectModulesPointers THEN
  10548. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10549. ELSE
  10550. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10551. END;
  10552. IntermediateCode.SetOffset(right,offset); (* tag *)
  10553. IntermediateCode.InitMemory(left,addressType,fp,0);
  10554. Emit(Mov(position, left, right));
  10555. END;
  10556. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  10557. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10558. ParameterCopies(procedureType);
  10559. IF x.code = NIL THEN
  10560. VisitStatementBlock(x);
  10561. ELSE
  10562. VisitCode(x.code)
  10563. END;
  10564. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10565. IF ~backend.cooperative THEN
  10566. ProfilerEnterExit(numberProcedures,FALSE);
  10567. END;
  10568. INC(numberProcedures);
  10569. END;
  10570. END;
  10571. IF backend.cooperative THEN
  10572. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10573. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10574. END;
  10575. IF x # NIL THEN
  10576. SELF.position := x.position;
  10577. END;
  10578. EndBasicBlock;
  10579. CheckRegistersFree();
  10580. ASSERT(modifyAssignmentCounter = 0);
  10581. currentScope := prevScope;
  10582. IF Trace THEN TraceExit("Body") END;
  10583. END Body;
  10584. END ImplementationVisitor;
  10585. MetaDataGenerator=OBJECT
  10586. VAR
  10587. implementationVisitor: ImplementationVisitor;
  10588. declarationVisitor: DeclarationVisitor;
  10589. module: Sections.Module;
  10590. moduleName: ARRAY 128 OF CHAR;
  10591. moduleNamePool: Basic.HashTableInt;
  10592. moduleNamePoolSection: IntermediateCode.Section;
  10593. modulePointerSection: IntermediateCode.Section;
  10594. modulePointerSizePC: LONGINT;
  10595. modulePointerSectionOffset: LONGINT;
  10596. modulePointers: LONGINT;
  10597. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  10598. RecordBaseOffset: LONGINT;
  10599. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10600. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10601. TypeTags: LONGINT; (* type extension level support *)
  10602. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10603. patchInfoPC: LONGINT;
  10604. patchCRC: LONGINT;
  10605. CONST
  10606. EmptyBlockOffset = 2;
  10607. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10608. BEGIN
  10609. IF implementationVisitor.backend.cooperative THEN
  10610. TypeTags := MAX(LONGINT);
  10611. BaseTypesTableOffset := 0;
  10612. MethodTableOffset := 2;
  10613. TypeRecordBaseOffset := 0;
  10614. RecordBaseOffset := 0;
  10615. ELSIF simple THEN
  10616. TypeTags := 3; (* only 3 extensions allowed *)
  10617. BaseTypesTableOffset := 1;
  10618. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10619. TypeRecordBaseOffset := 0;
  10620. RecordBaseOffset := 1;
  10621. ELSE
  10622. TypeTags := 16;
  10623. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10624. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10625. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10626. (* change this when Heaps.HeapBlock is modified *)
  10627. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  10628. RecordBaseOffset := 8; (* addresses *)
  10629. ELSE
  10630. RecordBaseOffset := 9; (* addresses *)
  10631. END;
  10632. END;
  10633. SELF.simple := simple;
  10634. SELF.implementationVisitor := implementationVisitor;
  10635. SELF.declarationVisitor := declarationVisitor;
  10636. implementationVisitor.meta := SELF;
  10637. declarationVisitor.meta := SELF;
  10638. END InitMetaDataGenerator;
  10639. PROCEDURE SetModule(module: Sections.Module);
  10640. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10641. BEGIN
  10642. SELF.module := module;
  10643. Global.GetModuleName(module.module,moduleName);
  10644. Global.GetSymbolSegmentedName(module.module, name);
  10645. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  10646. NEW(moduleNamePool, 32);
  10647. (*! require GC protection *)
  10648. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10649. IF ProtectModulesPointers THEN
  10650. name := "Heaps.AnyPtr";
  10651. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10652. (* set base pointer *)
  10653. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10654. END;
  10655. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10656. modulePointers := 0;
  10657. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10658. AddPointer(moduleNamePoolSection, namePoolOffset);
  10659. END;
  10660. END SetModule;
  10661. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10662. BEGIN
  10663. IF ~implementationVisitor.backend.cooperative THEN
  10664. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10665. INC(modulePointers);
  10666. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10667. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10668. END;
  10669. END AddPointer;
  10670. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10671. BEGIN
  10672. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10673. END GetTypeRecordBaseOffset;
  10674. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10675. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10676. BEGIN
  10677. (* change this when Heaps.HeapBlock is modified *)
  10678. INC(dataAdrOffset,7);
  10679. Info(section,"headerAdr");
  10680. Address(section,0);
  10681. Info(section,"typeDesc");
  10682. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10683. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10684. NamedSymbol(section, name, symbol, 0, offset);
  10685. Info(section,"mark: LONGINT;");
  10686. Longint(section,-1);
  10687. Info(section,"refCount: LONGINT;");
  10688. Longint(section,0);
  10689. (*
  10690. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10691. *)
  10692. Info(section,"dataAdr-: ADDRESS");
  10693. Symbol(section,section, dataAdrOffset,0);
  10694. Info(section,"size-: SIZE");
  10695. Address(section,0);
  10696. Info(section,"nextMark: HeapBlock;");
  10697. Address(section,0);
  10698. END HeapBlock;
  10699. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10700. VAR i: LONGINT;
  10701. BEGIN
  10702. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10703. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10704. Info(section,"count*: LONGINT");
  10705. Longint(section,0);
  10706. Info(section,"locked*: BOOLEAN");
  10707. Longint(section,0);
  10708. Info(section,"awaitingLock*: ProcessQueue");
  10709. Address(section,0);
  10710. Address(section,0);
  10711. Info(section,"awaitingCond*: ProcessQueue");
  10712. Address(section,0);
  10713. Address(section,0);
  10714. Info(section,"lockedBy*: ANY");
  10715. Address(section,0);
  10716. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10717. Longint(section,1);
  10718. FOR i := 2 TO 6 DO
  10719. Longint(section,0);
  10720. END;
  10721. Info(section,"lock*: ANY");
  10722. Address(section,0);
  10723. END ProtectedHeapBlock;
  10724. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10725. BEGIN
  10726. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10727. END Info;
  10728. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10729. VAR op: IntermediateCode.Operand;
  10730. BEGIN
  10731. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10732. section.Emit(Data(Basic.invalidPosition,op));
  10733. END Address;
  10734. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10735. VAR op: IntermediateCode.Operand;
  10736. BEGIN
  10737. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10738. section.Emit(Data(Basic.invalidPosition,op));
  10739. END Size;
  10740. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  10741. VAR op: IntermediateCode.Operand;
  10742. BEGIN
  10743. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  10744. section.Emit(Data(Basic.invalidPosition,op));
  10745. END Set;
  10746. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10747. VAR op: IntermediateCode.Operand;
  10748. BEGIN
  10749. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10750. section.Emit(Data(Basic.invalidPosition,op));
  10751. END Longint;
  10752. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10753. VAR op,noOperand: IntermediateCode.Operand;
  10754. BEGIN
  10755. IntermediateCode.InitOperand(noOperand);
  10756. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10757. section.PatchOperands(pc,op,noOperand,noOperand);
  10758. END PatchSize;
  10759. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10760. VAR op,noOperand: IntermediateCode.Operand;
  10761. BEGIN
  10762. IntermediateCode.InitOperand(noOperand);
  10763. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10764. section.PatchOperands(pc,op,noOperand,noOperand);
  10765. END PatchLongint;
  10766. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10767. VAR op, noOperand: IntermediateCode.Operand;
  10768. BEGIN
  10769. IntermediateCode.InitOperand(noOperand);
  10770. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10771. section.PatchOperands(pc,op,noOperand,noOperand);
  10772. END PatchSymbol;
  10773. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10774. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10775. BEGIN
  10776. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10777. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10778. section.Emit(Data(Basic.invalidPosition,op));
  10779. END Boolean;
  10780. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10781. VAR op: IntermediateCode.Operand;
  10782. BEGIN
  10783. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10784. section.Emit(Data(Basic.invalidPosition,op));
  10785. END Char;
  10786. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10787. VAR i: LONGINT;
  10788. BEGIN
  10789. Info(section,str);
  10790. i := 0;
  10791. WHILE(str[i] # 0X) DO
  10792. Char(section,str[i]);
  10793. INC(i);
  10794. END;
  10795. Char(section,0X);
  10796. END String;
  10797. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10798. VAR s: Basic.SectionName;
  10799. BEGIN
  10800. StringPool.GetString(str, s);
  10801. String(section, s);
  10802. END String0;
  10803. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10804. VAR op: IntermediateCode.Operand;
  10805. BEGIN
  10806. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10807. IntermediateCode.SetOffset(op,realOffset);
  10808. section.Emit(Data(Basic.invalidPosition,op));
  10809. END NamedSymbol;
  10810. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10811. VAR op: IntermediateCode.Operand;
  10812. BEGIN
  10813. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10814. IntermediateCode.SetOffset(op,realOffset);
  10815. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10816. END NamedSymbolAt;
  10817. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10818. BEGIN
  10819. IF symbol= NIL THEN
  10820. Address( section, realOffset);
  10821. ASSERT(virtualOffset = 0);
  10822. ELSE
  10823. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10824. END;
  10825. END Symbol;
  10826. (* OutPointers delivers
  10827. {pointerOffset}
  10828. *)
  10829. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10830. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10831. BEGIN
  10832. type := type.resolved;
  10833. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10834. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10835. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10836. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10837. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10838. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10839. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10840. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10841. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10842. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10843. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10844. ELSIF (type IS SyntaxTree.RecordType) THEN
  10845. (* never treat a record like a pointer, even if the pointer field is set! *)
  10846. WITH type: SyntaxTree.RecordType DO
  10847. base := type.GetBaseRecord();
  10848. IF base # NIL THEN
  10849. Pointers(offset,symbol,section, base,numberPointers);
  10850. END;
  10851. variable := type.recordScope.firstVariable;
  10852. WHILE(variable # NIL) DO
  10853. IF ~(variable.untraced) THEN
  10854. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10855. END;
  10856. variable := variable.nextVariable;
  10857. END;
  10858. END;
  10859. ELSIF (type IS SyntaxTree.CellType) THEN
  10860. WITH type: SyntaxTree.CellType DO
  10861. base := type.GetBaseRecord();
  10862. IF base # NIL THEN
  10863. Pointers(offset,symbol,section, base,numberPointers);
  10864. END;
  10865. variable := type.cellScope.firstVariable;
  10866. WHILE(variable # NIL) DO
  10867. IF ~(variable.untraced) THEN
  10868. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10869. END;
  10870. variable := variable.nextVariable;
  10871. END;
  10872. property := type.firstProperty;
  10873. WHILE(property # NIL) DO
  10874. IF ~(property.untraced) THEN
  10875. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10876. END;
  10877. property := property.nextProperty;
  10878. END;
  10879. parameter := type.firstParameter;
  10880. WHILE(parameter # NIL) DO
  10881. IF ~(parameter.untraced) THEN
  10882. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10883. END;
  10884. parameter := parameter.nextParameter;
  10885. END;
  10886. END;
  10887. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10888. WITH type: SyntaxTree.ArrayType DO
  10889. IF type.form= SyntaxTree.Static THEN
  10890. n := type.staticLength;
  10891. base := type.arrayBase.resolved;
  10892. WHILE(base IS SyntaxTree.ArrayType) DO
  10893. type := base(SyntaxTree.ArrayType);
  10894. n := n* type.staticLength;
  10895. base := type.arrayBase.resolved;
  10896. END;
  10897. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10898. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10899. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10900. FOR i := 0 TO n-1 DO
  10901. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10902. END;
  10903. END;
  10904. ELSE
  10905. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10906. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10907. END;
  10908. END;
  10909. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10910. WITH type: SyntaxTree.MathArrayType DO
  10911. IF type.form = SyntaxTree.Static THEN
  10912. n := type.staticLength;
  10913. base := type.arrayBase.resolved;
  10914. WHILE(base IS SyntaxTree.MathArrayType) DO
  10915. type := base(SyntaxTree.MathArrayType);
  10916. n := n* type.staticLength;
  10917. base := type.arrayBase.resolved;
  10918. END;
  10919. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10920. IF SemanticChecker.ContainsPointer(base) THEN
  10921. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10922. FOR i := 0 TO n-1 DO
  10923. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10924. END;
  10925. END;
  10926. ELSE
  10927. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10928. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10929. END
  10930. END;
  10931. (* ELSE no pointers in type *)
  10932. END;
  10933. END Pointers;
  10934. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10935. VAR position,i: LONGINT; ch: CHAR;
  10936. BEGIN
  10937. IF pool.Has(index) THEN
  10938. RETURN pool.GetInt(index)
  10939. ELSE
  10940. position := source.pc;
  10941. pool.PutInt(index, position);
  10942. Info(source, name);
  10943. i := 0;
  10944. REPEAT
  10945. ch := name[i]; INC(i);
  10946. Char( source, ch);
  10947. UNTIL ch = 0X;
  10948. END;
  10949. RETURN position;
  10950. END EnterDynamicName;
  10951. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10952. VAR name: Basic.SectionName; position: LONGINT;
  10953. BEGIN
  10954. IF pool.Has(index) THEN
  10955. RETURN pool.GetInt(index)
  10956. ELSE
  10957. StringPool.GetString(index, name);
  10958. position := EnterDynamicName(source,name,index, pool);
  10959. END;
  10960. RETURN position;
  10961. END DynamicName;
  10962. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10963. VAR section: IntermediateCode.Section;
  10964. BEGIN
  10965. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10966. IF implementationVisitor.backend.cooperative THEN
  10967. Info(section, "TypeDescriptor");
  10968. Basic.ToSegmentedName("BaseTypes.Array", name);
  10969. NamedSymbol(section, name,NIL, 0, 0);
  10970. BasePointer(section);
  10971. offset := 0;
  10972. ELSE
  10973. IF ProtectModulesPointers THEN
  10974. HeapBlock(mName,typeName,section,2);
  10975. END;
  10976. Info(section, "HeapBlock");
  10977. IF ProtectModulesPointers THEN
  10978. Symbol(section,section,2,0);
  10979. ELSE
  10980. Address(section,0);
  10981. END;
  10982. Info(section, "TypeDescriptor");
  10983. Address(section,0);
  10984. offset := section.pc;
  10985. END;
  10986. RETURN section
  10987. END NamedBlock;
  10988. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10989. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10990. BEGIN
  10991. COPY(moduleName,name);
  10992. Strings.Append(name,suffix);
  10993. Basic.ToSegmentedName(name, pooledName);
  10994. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10995. END Block;
  10996. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10997. VAR name: Basic.SegmentedName;
  10998. BEGIN
  10999. Info(source,"ArrayHeader");
  11000. IF implementationVisitor.backend.cooperative THEN
  11001. sizePC := source.pc;
  11002. Address(source,0);
  11003. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  11004. IF baseType # "" THEN
  11005. Basic.ToSegmentedName(baseType, name);
  11006. NamedSymbol(source, name,NIL, 0, 0);
  11007. ELSE
  11008. Address(source,0);
  11009. END;
  11010. Address(source,0);
  11011. ELSE
  11012. Address(source,0);
  11013. Address(source,0);
  11014. (* first pointer for GC *)
  11015. IF hasPointer THEN
  11016. (* points to first element in the array, this is NOT the base type descriptor *)
  11017. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  11018. ELSE
  11019. Address(source,0);
  11020. END;
  11021. sizePC := source.pc;
  11022. Address(source,0);
  11023. Info(source,"array data");
  11024. END;
  11025. END ArrayBlock;
  11026. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  11027. BEGIN
  11028. IF implementationVisitor.backend.cooperative THEN
  11029. PatchSize(section, pc, size);
  11030. PatchSize(section, pc + 3, size);
  11031. ELSE
  11032. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  11033. PatchSize(section, pc, size);
  11034. END;
  11035. END PatchArray;
  11036. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  11037. VAR
  11038. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  11039. sectionArray: POINTER TO ARRAY OF Sections.Section;
  11040. poolMap: Basic.HashTableInt;
  11041. namePool: IntermediateCode.Section;
  11042. namePoolOffset: LONGINT;
  11043. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  11044. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  11045. BEGIN
  11046. Basic.SegmentedNameToString(s1.name,n1);
  11047. Basic.SegmentedNameToString(s2.name,n2);
  11048. index := 0;
  11049. ch1 := n1[index];
  11050. ch2 := n2[index];
  11051. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  11052. INC(index);
  11053. ch1 := n1[index];
  11054. ch2 := n2[index];
  11055. END;
  11056. RETURN ch1 < ch2;
  11057. END Compare;
  11058. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  11059. VAR
  11060. i, j: LONGINT;
  11061. x, t: Sections.Section;
  11062. BEGIN
  11063. IF lo < hi THEN
  11064. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  11065. WHILE i <= j DO
  11066. WHILE Compare(list[i], x) DO INC(i) END;
  11067. WHILE Compare(x, list[j]) DO DEC(j) END;
  11068. IF i <= j THEN
  11069. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  11070. INC(i); DEC(j)
  11071. END
  11072. END;
  11073. IF lo < j THEN QuickSort(list, lo, j) END;
  11074. IF i < hi THEN QuickSort(list, i, hi) END
  11075. END;
  11076. END QuickSort;
  11077. (*
  11078. ExportDesc* = RECORD
  11079. fp*: ADDRESS;
  11080. name* {UNTRACED}: DynamicName;
  11081. adr*: ADDRESS;
  11082. exports*: LONGINT;
  11083. dsc* {UNTRACED}: ExportArray
  11084. END;
  11085. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  11086. *)
  11087. PROCEDURE ExportDesc2(
  11088. source: IntermediateCode.Section;
  11089. namePool: IntermediateCode.Section;
  11090. fingerPrinter: FingerPrinter.FingerPrinter;
  11091. symbol: Sections.Section;
  11092. name: StringPool.Index;
  11093. VAR patchAdr: LONGINT
  11094. ): BOOLEAN;
  11095. VAR fingerPrint: SyntaxTree.FingerPrint;
  11096. BEGIN
  11097. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  11098. & (symbol.type # Sections.InlineCodeSection)
  11099. THEN
  11100. *)
  11101. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  11102. & (symbol.type # Sections.ExitCodeSection)
  11103. & (symbol.type # Sections.InlineCodeSection))
  11104. THEN
  11105. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  11106. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  11107. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  11108. Longint(source,fingerPrint.public);
  11109. ELSE
  11110. Longint(source, 0);
  11111. END;
  11112. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  11113. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  11114. Symbol(source, symbol,0,0);
  11115. patchAdr := source.pc;
  11116. Longint(source, 0);
  11117. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11118. Address(source,0);
  11119. END;
  11120. RETURN TRUE
  11121. ELSE
  11122. RETURN FALSE
  11123. END;
  11124. END ExportDesc2;
  11125. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  11126. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  11127. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11128. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11129. nextPatch: LONGINT;
  11130. TYPE
  11131. Scope = RECORD
  11132. elements: LONGINT;
  11133. gelements: LONGINT;
  11134. section: IntermediateCode.Section;
  11135. patchAdr: LONGINT;
  11136. arraySizePC: LONGINT;
  11137. beginPC: LONGINT; (* current scope start pc *)
  11138. END;
  11139. BEGIN
  11140. Basic.InitSegmentedName(prev);
  11141. olevel := -1;
  11142. scopes[0].section := source;
  11143. scopes[0].arraySizePC := MIN(LONGINT);
  11144. FOR s := 0 TO LEN(sections)-1 DO
  11145. symbol := sections[s];
  11146. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection) & (symbol.type # Sections.ExitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  11147. this := sections[s].name;
  11148. level := 0;
  11149. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11150. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11151. INC(level);
  11152. END;
  11153. WHILE level < olevel DO
  11154. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11155. IF olevel > 0 THEN
  11156. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11157. nextPatch := scopes[olevel-1].patchAdr+1;
  11158. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11159. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11160. END;
  11161. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11162. DEC(olevel);
  11163. END;
  11164. IF (level < LEN(this)) & (this[level] > 0) THEN
  11165. IF level > olevel THEN
  11166. (*TRACE("opening",level); *)
  11167. IF scopes[level].section = NIL THEN
  11168. arrayName := ".@ExportArray";
  11169. Strings.AppendInt(arrayName, level);
  11170. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11171. AddPointer(scopes[level].section,offset);
  11172. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11173. END;
  11174. scopes[level].beginPC := scopes[level].section.pc;
  11175. olevel := level;
  11176. scopes[olevel].elements := 0;
  11177. END;
  11178. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  11179. sym := sections[s];
  11180. ELSE
  11181. sym := NIL;
  11182. END;
  11183. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  11184. THEN
  11185. INC(scopes[olevel].elements);
  11186. END;
  11187. (* enter string in scope *)
  11188. INC(level);
  11189. END;
  11190. END;
  11191. Basic.SegmentedNameToString(this, name);
  11192. prev := this;
  11193. END;
  11194. END;
  11195. WHILE 0 <= olevel DO
  11196. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11197. IF olevel > 0 THEN
  11198. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11199. nextPatch := scopes[olevel-1].patchAdr+1;
  11200. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11201. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11202. END;
  11203. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11204. DEC(olevel);
  11205. END;
  11206. level := 0;
  11207. WHILE (level < LEN(scopes)) DO
  11208. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  11209. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  11210. END;
  11211. INC(level);
  11212. END;
  11213. END Export;
  11214. BEGIN
  11215. NEW(fingerPrinter);
  11216. NEW(poolMap, 64);
  11217. (* 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 *)
  11218. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  11219. NEW(sectionArray, module.allSections.Length());
  11220. FOR i := 0 TO module.allSections.Length() - 1 DO
  11221. section := module.allSections.GetSection(i);
  11222. sectionArray[i] := section;
  11223. END;
  11224. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  11225. Export(sectionArray^);
  11226. END ExportDesc;
  11227. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11228. VAR
  11229. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11230. BEGIN
  11231. Info(source, "exception table offsets array descriptor");
  11232. size := 0;
  11233. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11234. Info(source, "exception table content");
  11235. FOR i := 0 TO module.allSections.Length() - 1 DO
  11236. p := module.allSections.GetSection(i);
  11237. IF p.type = Sections.CodeSection THEN
  11238. finallyPC := p(IntermediateCode.Section).finally;
  11239. IF finallyPC>=0 THEN
  11240. Symbol( source, p, 0,0);
  11241. Symbol( source, p, finallyPC, 0);
  11242. Symbol( source, p, finallyPC,0);
  11243. INC(size);
  11244. END;
  11245. END
  11246. END;
  11247. PatchArray(source,sizePC,size);
  11248. END ExceptionArray;
  11249. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11250. VAR i: LONGINT; ch: CHAR;
  11251. BEGIN
  11252. i := 0;
  11253. REPEAT
  11254. ch := name[i]; INC(i);
  11255. Char( section, ch);
  11256. UNTIL ch = 0X;
  11257. WHILE i < 32 DO
  11258. Char( section, 0X); INC(i);
  11259. END;
  11260. END Name;
  11261. PROCEDURE References(section: IntermediateCode.Section);
  11262. CONST
  11263. sfTypeNone = 0X;
  11264. sfTypeCHAR = 01X;
  11265. sfTypeCHAR8 = 02X;
  11266. sfTypeCHAR16 = 03X;
  11267. sfTypeCHAR32 = 04X;
  11268. sfTypeRANGE = 05X;
  11269. sfTypeSHORTINT = 06X;
  11270. sfTypeINTEGER = 07X;
  11271. sfTypeLONGINT = 08X;
  11272. sfTypeHUGEINT = 09X;
  11273. sfTypeWORD = 0AX;
  11274. sfTypeLONGWORD = 0BX;
  11275. sfTypeSIGNED8 = 0CX;
  11276. sfTypeSIGNED16 = 0DX;
  11277. sfTypeSIGNED32 = 0EX;
  11278. sfTypeSIGNED64 = 0FX;
  11279. sfTypeUNSIGNED8 = 10X;
  11280. sfTypeUNSIGNED16 = 11X;
  11281. sfTypeUNSIGNED32 = 12X;
  11282. sfTypeUNSIGNED64 = 13X;
  11283. sfTypeREAL = 14X;
  11284. sfTypeLONGREAL = 15X;
  11285. sfTypeCOMPLEX = 16X;
  11286. sfTypeLONGCOMPLEX = 17X;
  11287. sfTypeBOOLEAN = 18X;
  11288. sfTypeSET = 19X;
  11289. sfTypeANY = 1AX;
  11290. sfTypeOBJECT = 1BX;
  11291. sfTypeBYTE = 1CX;
  11292. sfTypeADDRESS = 1DX;
  11293. sfTypeSIZE = 1EX;
  11294. sfTypeIndirect = 1FX;
  11295. sfTypeRecord = 20X;
  11296. sfTypePointerToRecord = 21X;
  11297. sfTypePointerToArray = 22X;
  11298. sfTypeOpenArray = 23X;
  11299. sfTypeStaticArray = 24X;
  11300. sfTypeDynamicArray = 25X;
  11301. sfTypeMathStaticArray = 26X;
  11302. sfTypeMathOpenArray = 27X;
  11303. sfTypeMathTensor = 28X;
  11304. sfTypeProcedure = 29X;
  11305. sfTypeDelegate = 2AX;
  11306. sfTypeENUM = 2BX;
  11307. (* sfTypeCELL = 2CX; *)
  11308. sfTypePORT = 2DX;
  11309. sfIN = 0X;
  11310. sfOUT = 1X;
  11311. flagDelegate = 0;
  11312. flagConstructor = 1;
  11313. (* variable / parameter addressing modes *)
  11314. sfAbsolute = 0X; (* global vars *)
  11315. sfRelative = 1X; (* variables, value parameters *)
  11316. sfIndirect = 2X; (* var parameters *)
  11317. sfScopeBegin = 0F0X;
  11318. sfScopeEnd = 0F1X;
  11319. sfProcedure = 0F2X;
  11320. sfVariable = 0F3X;
  11321. sfTypeDeclaration = 0F4X;
  11322. sfModule = 0FFX;
  11323. RefInfo = TRUE;
  11324. VAR
  11325. sizePC, startPC, lastOffset: LONGINT;
  11326. indirectTypes: Basic.HashTable;
  11327. PROCEDURE CurrentIndex(): LONGINT;
  11328. VAR i: LONGINT;
  11329. BEGIN
  11330. FOR i := startPC TO section.pc -1 DO
  11331. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11332. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11333. END;
  11334. startPC := section.pc;
  11335. RETURN lastOffset;
  11336. END CurrentIndex;
  11337. (*
  11338. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11339. Module = sfModule prevSymbol:SIZE name:String Scope.
  11340. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11341. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11342. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11343. Type =
  11344. sfTypePointerToRecord
  11345. | sfTypePointerToArray Type
  11346. | sfTypeOpenArray Type
  11347. | sfTypeDynamicArray Type
  11348. | sfTypeStaticArray length:SIZE Type
  11349. | sfTypeMathOpenArray Type
  11350. | sfTypeMathStaticArray length:SIZE Type
  11351. | sfTypeMathTensor Type
  11352. | sfTypeRecord tdAdr:ADDRESS
  11353. | sfTypeProcedure {Parameter} return:Type
  11354. | sfTypeDelegate {Parameter} return:Type
  11355. | sfTypePort (sfIN | sfOUT)
  11356. | sfTypeBOOLEAN
  11357. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11358. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11359. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11360. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11361. | sfTypeWORD | sfTypeLONGWORD
  11362. | sfTypeREAL | sfTypeLONGREAL
  11363. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11364. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11365. | sfTypeIndirect offset:SIZE.
  11366. *)
  11367. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11368. VAR offset: SIZE;
  11369. BEGIN
  11370. IF indirectTypes.Has(type) THEN
  11371. offset := indirectTypes.GetInt(type);
  11372. Char(section, sfTypeIndirect);
  11373. Size(section, offset);
  11374. RETURN TRUE;
  11375. ELSE
  11376. indirectTypes.PutInt(type, CurrentIndex());
  11377. RETURN FALSE;
  11378. END;
  11379. END Indirect;
  11380. PROCEDURE NType(type: SyntaxTree.Type);
  11381. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11382. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11383. BEGIN
  11384. IF type = NIL THEN
  11385. Char(section, sfTypeNone)
  11386. ELSE
  11387. type := type.resolved;
  11388. size := type.sizeInBits;
  11389. WITH type:
  11390. SyntaxTree.PointerType DO
  11391. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11392. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11393. Char(section, sfTypePointerToRecord);
  11394. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11395. ELSE
  11396. IF RefInfo THEN Info(section,"PointerToArray") END;
  11397. Char(section, sfTypePointerToArray);
  11398. NType(type.pointerBase);
  11399. END;
  11400. | SyntaxTree.ArrayType DO
  11401. IF ~Indirect(type) THEN
  11402. IF type.form = SyntaxTree.Open THEN
  11403. IF RefInfo THEN Info(section,"OpenArray") END;
  11404. Char(section, sfTypeOpenArray);
  11405. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11406. IF RefInfo THEN Info(section,"DynamicArray") END;
  11407. Char(section, sfTypeDynamicArray);
  11408. ELSIF type.form = SyntaxTree.Static THEN
  11409. IF RefInfo THEN Info(section,"StaticArray") END;
  11410. Char(section, sfTypeStaticArray);
  11411. Size(section, type.staticLength);
  11412. ELSE
  11413. HALT(100);
  11414. END;
  11415. NType(type.arrayBase);
  11416. END;
  11417. | SyntaxTree.MathArrayType DO
  11418. IF ~Indirect(type) THEN
  11419. IF type.form = SyntaxTree.Open THEN
  11420. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11421. Char(section, sfTypeMathOpenArray);
  11422. ELSIF type.form = SyntaxTree.Static THEN
  11423. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11424. Char(section, sfTypeMathStaticArray);
  11425. Size(section, type.staticLength);
  11426. ELSIF type.form = SyntaxTree.Tensor THEN
  11427. IF RefInfo THEN Info(section,"MathTensor") END;
  11428. Char(section, sfTypeMathTensor);
  11429. ELSE
  11430. HALT(100);
  11431. END;
  11432. NType(type.arrayBase);
  11433. END;
  11434. | SyntaxTree.RecordType DO
  11435. IF ~Indirect(type) THEN
  11436. IF type.pointerType # NIL (* OBJECT *) THEN
  11437. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11438. Char(section, sfTypePointerToRecord)
  11439. ELSE
  11440. IF RefInfo THEN Info(section,"Record") END;
  11441. Char(section, sfTypeRecord);
  11442. td := type.typeDeclaration;
  11443. IF RefInfo THEN Info(section,"TD") END;
  11444. IF (td # NIL) THEN
  11445. Global.GetSymbolSegmentedName(td,segmentedName);
  11446. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11447. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11448. ELSE
  11449. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11450. END;
  11451. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11452. Symbol(section, tir, 0, offset);
  11453. ELSE
  11454. Address(section, 0);
  11455. END;
  11456. END;
  11457. END;
  11458. | SyntaxTree.CellType DO
  11459. IF ~Indirect(type) THEN
  11460. IF RefInfo THEN Info(section,"Record") END;
  11461. Char(section, sfTypeRecord);
  11462. td := type.typeDeclaration;
  11463. IF RefInfo THEN Info(section,"TD") END;
  11464. IF (td # NIL) THEN
  11465. Global.GetSymbolSegmentedName(td,segmentedName);
  11466. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11467. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11468. ELSE
  11469. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11470. END;
  11471. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11472. Symbol(section, tir, 0, offset);
  11473. ELSE
  11474. Address(section, 0);
  11475. END;
  11476. END;
  11477. | SyntaxTree.PortType DO
  11478. Char(section, sfTypePORT);
  11479. IF type.direction = SyntaxTree.OutPort THEN
  11480. Char(section, sfOUT)
  11481. ELSE
  11482. Char(section, sfIN)
  11483. END;
  11484. | SyntaxTree.ProcedureType DO
  11485. IF ~Indirect(type) THEN
  11486. IF type.isDelegate THEN
  11487. Char(section, sfTypeDelegate);
  11488. ELSE
  11489. Char(section, sfTypeProcedure);
  11490. END;
  11491. parameter := type.firstParameter;
  11492. WHILE(parameter # NIL) DO
  11493. NParameter(parameter, -1);
  11494. parameter := parameter.nextParameter;
  11495. END;
  11496. NType(type.returnType);
  11497. END;
  11498. | SyntaxTree.EnumerationType DO
  11499. Char(section, sfTypeENUM);
  11500. | SyntaxTree.BasicType DO
  11501. WITH type:
  11502. SyntaxTree.BooleanType DO
  11503. IF RefInfo THEN Info(section,"Boolean") END;
  11504. Char(section, sfTypeBOOLEAN);
  11505. | SyntaxTree.CharacterType DO
  11506. IF type = module.system.characterType THEN
  11507. IF RefInfo THEN Info(section,"CHAR") END;
  11508. Char(section, sfTypeCHAR);
  11509. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11510. IF RefInfo THEN Info(section,"CHAR8") END;
  11511. Char(section, sfTypeCHAR8)
  11512. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11513. IF RefInfo THEN Info(section,"CHAR16") END;
  11514. Char(section, sfTypeCHAR16);
  11515. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11516. IF RefInfo THEN Info(section,"CHAR32") END;
  11517. Char(section, sfTypeCHAR32);
  11518. ELSE
  11519. HALT(100);
  11520. END;
  11521. |SyntaxTree.IntegerType DO
  11522. IF type(SyntaxTree.IntegerType).signed THEN
  11523. IF (type = module.system.shortintType) THEN
  11524. IF RefInfo THEN Info(section,"SHORTINT") END;
  11525. Char(section, sfTypeSHORTINT)
  11526. ELSIF (type = module.system.integerType) THEN
  11527. IF RefInfo THEN Info(section,"INTEGER") END;
  11528. Char(section, sfTypeINTEGER)
  11529. ELSIF (type = module.system.longintType) THEN
  11530. IF RefInfo THEN Info(section,"LONGINT") END;
  11531. Char(section, sfTypeLONGINT)
  11532. ELSIF (type = module.system.hugeintType) THEN
  11533. IF RefInfo THEN Info(section,"HUGEINT") END;
  11534. Char(section, sfTypeHUGEINT)
  11535. ELSIF (type = module.system.wordType) THEN
  11536. IF RefInfo THEN Info(section,"WORD") END;
  11537. Char(section, sfTypeWORD)
  11538. ELSIF (type = module.system.longWordType) THEN
  11539. IF RefInfo THEN Info(section,"LONGWORD") END;
  11540. Char(section, sfTypeLONGWORD);
  11541. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11542. IF RefInfo THEN Info(section,"SIGNED8") END;
  11543. Char(section, sfTypeSIGNED8)
  11544. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11545. IF RefInfo THEN Info(section,"SIGNED16") END;
  11546. Char(section, sfTypeSIGNED16)
  11547. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11548. IF RefInfo THEN Info(section,"SIGNED32") END;
  11549. Char(section, sfTypeSIGNED32)
  11550. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11551. IF RefInfo THEN Info(section,"SIGNED64") END;
  11552. Char(section, sfTypeSIGNED64)
  11553. ELSE
  11554. HALT(100);
  11555. END
  11556. ELSE (* unsigned *)
  11557. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11558. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11559. Char(section, sfTypeUNSIGNED8)
  11560. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11561. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11562. Char(section, sfTypeUNSIGNED16)
  11563. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11564. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11565. Char(section, sfTypeUNSIGNED32)
  11566. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11567. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11568. Char(section, sfTypeUNSIGNED64)
  11569. ELSE
  11570. HALT(100)
  11571. END
  11572. END;
  11573. | SyntaxTree.FloatType DO
  11574. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11575. IF RefInfo THEN Info(section,"REAL") END;
  11576. Char(section, sfTypeREAL);
  11577. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11578. IF RefInfo THEN Info(section,"LONGREAL") END;
  11579. Char(section, sfTypeLONGREAL);
  11580. ELSE
  11581. HALT(100);
  11582. END;
  11583. | SyntaxTree.ComplexType DO
  11584. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11585. IF RefInfo THEN Info(section,"COMPLEX") END;
  11586. Char(section, sfTypeCOMPLEX);
  11587. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11588. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11589. Char(section, sfTypeLONGCOMPLEX);
  11590. ELSE
  11591. HALT(100);
  11592. END;
  11593. |SyntaxTree.SetType DO
  11594. IF RefInfo THEN Info(section,"SET") END;
  11595. Char(section, sfTypeSET);
  11596. |SyntaxTree.AnyType DO
  11597. IF RefInfo THEN Info(section,"ANY") END;
  11598. Char(section, sfTypeANY);
  11599. |SyntaxTree.ObjectType DO
  11600. IF RefInfo THEN Info(section,"OBJECT") END;
  11601. Char(section, sfTypeOBJECT);
  11602. |SyntaxTree.ByteType DO
  11603. IF RefInfo THEN Info(section,"BYTE") END;
  11604. Char(section, sfTypeBYTE);
  11605. |SyntaxTree.RangeType DO
  11606. IF RefInfo THEN Info(section,"RANGE") END;
  11607. Char(section, sfTypeRANGE)
  11608. |SyntaxTree.AddressType DO
  11609. IF RefInfo THEN Info(section,"ADDRESS") END;
  11610. Char(section, sfTypeADDRESS)
  11611. |SyntaxTree.SizeType DO
  11612. IF RefInfo THEN Info(section,"SIZE") END;
  11613. Char(section, sfTypeSIZE)
  11614. ELSE
  11615. HALT(100)
  11616. END;
  11617. ELSE HALT(101);
  11618. END;
  11619. END;
  11620. END NType;
  11621. (*
  11622. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11623. *)
  11624. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11625. VAR type: SyntaxTree.Type;
  11626. BEGIN
  11627. IF RefInfo THEN Info(section, "Parameter") END;
  11628. Char(section, sfVariable);
  11629. Size(section, procOffset);
  11630. String0(section, parameter.name);
  11631. type := parameter.type.resolved;
  11632. IF parameter.kind = SyntaxTree.VarParameter THEN
  11633. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11634. ELSE Char(section, sfIndirect)
  11635. END;
  11636. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11637. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11638. Char(section, sfIndirect);
  11639. ELSE
  11640. Char(section, sfRelative);
  11641. END;
  11642. ELSE
  11643. Char(section, sfRelative);
  11644. END;
  11645. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11646. NType(parameter.type);
  11647. END NParameter;
  11648. (*
  11649. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11650. *)
  11651. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11652. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11653. flags: SET;
  11654. BEGIN
  11655. IF procedure.externalName # NIL THEN RETURN END;
  11656. IF RefInfo THEN Info(section, "Procedure") END;
  11657. pos := CurrentIndex();
  11658. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11659. Char(section, sfProcedure);
  11660. Size(section, scopeOffset);
  11661. String0(section,procedure.name);
  11662. s := module.allSections.FindBySymbol(procedure);
  11663. Symbol(section,s,0,0); (* start *)
  11664. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11665. flags := {};
  11666. IF procedureType.isDelegate THEN
  11667. INCL(flags, flagDelegate);
  11668. END;
  11669. IF procedure.isConstructor THEN
  11670. INCL(flags, flagConstructor);
  11671. END;
  11672. Set(section, flags);
  11673. IF RefInfo THEN Info(section, "Parameters") END;
  11674. parameter := procedureType.firstParameter;
  11675. WHILE(parameter # NIL) DO
  11676. NParameter(parameter, pos);
  11677. parameter := parameter.nextParameter;
  11678. END;
  11679. IF procedureType.returnParameter # NIL THEN
  11680. NParameter(procedureType.returnParameter, pos);
  11681. END;
  11682. IF procedureType.selfParameter # NIL THEN
  11683. NParameter(procedureType.selfParameter, pos);
  11684. END;
  11685. IF RefInfo THEN Info(section, "ReturnType") END;
  11686. NType(procedureType.returnType);
  11687. NScope(procedure.procedureScope, pos);
  11688. END NProcedure;
  11689. (*
  11690. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11691. *)
  11692. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11693. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11694. BEGIN
  11695. IF RefInfo THEN Info(section, "Variable") END;
  11696. pos := CurrentIndex();
  11697. Char(section, sfVariable);
  11698. Size(section, scopeOffset);
  11699. String0(section, variable.name);
  11700. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11701. Char(section, sfAbsolute);
  11702. IF variable.externalName # NIL THEN
  11703. sn := variable.externalName^;
  11704. NamedSymbol(section, sn,NIL, 0,0);
  11705. ELSE
  11706. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11707. NamedSymbol(section, sn,variable, 0,0);
  11708. END;
  11709. ELSE
  11710. Char(section, sfRelative);
  11711. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11712. END;
  11713. NType(variable.type);
  11714. s := module.allSections.FindBySymbol(variable);
  11715. END NVariable;
  11716. (*
  11717. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11718. *)
  11719. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11720. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11721. BEGIN
  11722. IF typeDeclaration = NIL THEN RETURN END;
  11723. pos := CurrentIndex();
  11724. s := module.allSections.FindBySymbol(typeDeclaration);
  11725. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11726. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11727. Char(section, sfTypeDeclaration);
  11728. Size(section, scopeOffset);
  11729. String0(section, typeDeclaration.name);
  11730. declared := typeDeclaration.declaredType.resolved;
  11731. IF (declared IS SyntaxTree.PointerType) THEN
  11732. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11733. END;
  11734. WITH declared:
  11735. SyntaxTree.RecordType DO
  11736. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11737. Symbol(section, s, 0, offset);
  11738. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11739. Basic.AppendToSegmentedName(name,".@Info");
  11740. s := module.allSections.FindByName(name);
  11741. IF s # NIL THEN (* does not work for coop *)
  11742. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11743. END;
  11744. NScope(declared.recordScope, pos);
  11745. |SyntaxTree.CellType DO
  11746. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11747. Symbol(section, s, 0, offset);
  11748. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11749. Basic.AppendToSegmentedName(name,".@Info");
  11750. s := module.allSections.FindByName(name);
  11751. IF s # NIL THEN
  11752. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11753. END;
  11754. NScope(declared.cellScope, pos);
  11755. ELSE
  11756. Address(section, 0);
  11757. END;
  11758. END NTypeDeclaration;
  11759. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11760. VAR pos: LONGINT;
  11761. BEGIN
  11762. pos := CurrentIndex();
  11763. Char(section,sfModule);
  11764. Size(section, prevSymbol);
  11765. String0(section, module.name);
  11766. NScope(module.moduleScope, pos);
  11767. END NModule;
  11768. (*
  11769. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11770. *)
  11771. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11772. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  11773. BEGIN
  11774. IF scope = NIL THEN RETURN END;
  11775. IF RefInfo THEN Info(section, "Scope") END;
  11776. Char(section, sfScopeBegin);
  11777. variable := scope.firstVariable;
  11778. WHILE (variable # NIL) DO
  11779. NVariable(variable, prevSymbol);
  11780. variable := variable.nextVariable;
  11781. END;
  11782. WITH scope:
  11783. SyntaxTree.ModuleScope DO
  11784. bodyProcedure := scope.bodyProcedure;
  11785. |SyntaxTree.RecordScope DO
  11786. bodyProcedure := scope.bodyProcedure;
  11787. ELSE
  11788. bodyProcedure := NIL;
  11789. END;
  11790. IF bodyProcedure # NIL THEN
  11791. NProcedure(bodyProcedure, prevSymbol)
  11792. END;
  11793. procedure := scope.firstProcedure;
  11794. WHILE procedure # NIL DO
  11795. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11796. procedure := procedure.nextProcedure;
  11797. END;
  11798. typeDeclaration := scope.firstTypeDeclaration;
  11799. WHILE typeDeclaration # NIL DO
  11800. NTypeDeclaration(typeDeclaration, prevSymbol);
  11801. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11802. END;
  11803. Char(section, sfScopeEnd); (* scope ends *)
  11804. END NScope;
  11805. BEGIN
  11806. NEW(indirectTypes, 32);
  11807. ArrayBlock(section,sizePC,"", FALSE);
  11808. startPC := section.pc;
  11809. NModule(module.module, -1);
  11810. PatchArray(section,sizePC,CurrentIndex());
  11811. END References;
  11812. (*
  11813. Command* = RECORD
  11814. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11815. name*: Name; (* name of the procedure *)
  11816. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11817. entryAdr* : ADDRESS; (* entry address of procedure *)
  11818. END;
  11819. *)
  11820. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11821. VAR
  11822. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11823. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11824. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11825. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11826. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11827. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11828. BEGIN
  11829. RETURN
  11830. (type = NIL) OR
  11831. (type.resolved IS SyntaxTree.RecordType) OR
  11832. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11833. (type.resolved IS SyntaxTree.AnyType);
  11834. END TypeAllowed;
  11835. BEGIN
  11836. numberParameters := procedureType.numberParameters;
  11837. RETURN
  11838. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11839. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11840. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11841. END GetProcedureAllowed;
  11842. PROCEDURE WriteType(type : SyntaxTree.Type);
  11843. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11844. name: Basic.SegmentedName; offset: LONGINT;
  11845. BEGIN
  11846. IF type = NIL THEN
  11847. Address(source,0);
  11848. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11849. Address(source,1);
  11850. ELSE
  11851. type := type.resolved;
  11852. IF type IS SyntaxTree.PointerType THEN
  11853. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11854. END;
  11855. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11856. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11857. name[0] := typeDeclaration.name; name[1] := -1;
  11858. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11859. ASSERT(section # NIL);
  11860. ELSE
  11861. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11862. (* TODO *)
  11863. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11864. END;
  11865. IF implementationVisitor.backend.cooperative THEN
  11866. offset := 0;
  11867. ELSE
  11868. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11869. END;
  11870. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11871. END;
  11872. END WriteType;
  11873. BEGIN
  11874. Info(source, "command array descriptor");
  11875. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11876. numberCommands := 0;
  11877. Info(source, "command array content");
  11878. FOR i := 0 TO module.allSections.Length() - 1 DO
  11879. p := module.allSections.GetSection(i);
  11880. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11881. procedure := p.symbol(SyntaxTree.Procedure);
  11882. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11883. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11884. procedure.GetName(name);
  11885. Name(source,name);
  11886. numberParameters := procedureType.numberParameters;
  11887. (* offset of type of first parameter *)
  11888. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11889. ELSE WriteType(procedureType.firstParameter.type)
  11890. END;
  11891. (* offset of type of return parameter *)
  11892. WriteType(procedureType.returnType);
  11893. (* command name *)
  11894. (* command code offset *)
  11895. Symbol(source,p,0,0);
  11896. INC(numberCommands);
  11897. IF Trace THEN
  11898. D.Ln;
  11899. END;
  11900. END;
  11901. END
  11902. END;
  11903. PatchArray(source,sizePC,numberCommands);
  11904. END CommandArray;
  11905. (* to prevent from double import of different module aliases *)
  11906. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11907. VAR i: SyntaxTree.Import;
  11908. BEGIN
  11909. i := module.module.moduleScope.firstImport;
  11910. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11911. i := i.nextImport;
  11912. END;
  11913. RETURN i = import
  11914. END IsFirstDirectOccurence;
  11915. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11916. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11917. BEGIN
  11918. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11919. ArrayBlock(source,pc,"", FALSE);
  11920. Info(source, "import module array data");
  11921. IF implementationVisitor.backend.cooperative THEN
  11922. offset := 0;
  11923. ELSE
  11924. IF module.system.addressType.sizeInBits = 64 THEN
  11925. (* change this when Heaps.HeapBlock is modified *)
  11926. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11927. ELSE
  11928. (* change this when Heaps.HeapBlock is modified *)
  11929. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11930. END;
  11931. END;
  11932. import := module.module.moduleScope.firstImport;
  11933. numberImports := 0;
  11934. WHILE import # NIL DO
  11935. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11936. Global.GetModuleSegmentedName(import.module,name);
  11937. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11938. NamedSymbol(source, name, NIL, 0, offset);
  11939. INC(numberImports);
  11940. END;
  11941. import := import.nextImport
  11942. END;
  11943. PatchArray(source,pc,numberImports);
  11944. END ImportsArray;
  11945. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11946. VAR
  11947. p: Sections.Section; sizePC, size, i: LONGINT;
  11948. BEGIN
  11949. Info(source, "Type info section");
  11950. size := 0;
  11951. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11952. FOR i := 0 TO module.allSections.Length() - 1 DO
  11953. p := module.allSections.GetSection(i);
  11954. WITH p: IntermediateCode.Section DO
  11955. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11956. Symbol(source,p,EmptyBlockOffset,0);
  11957. INC(size);
  11958. END;
  11959. END
  11960. END;
  11961. PatchArray(source,sizePC,size);
  11962. END TypeInfoSection;
  11963. (*
  11964. ProcTableEntry* = RECORD
  11965. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11966. noPtr*: LONGINT;
  11967. END;
  11968. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11969. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11970. *)
  11971. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11972. VAR
  11973. numberPointers: LONGINT;
  11974. procedure: SyntaxTree.Procedure;
  11975. BEGIN
  11976. Info(section,"pcFrom");
  11977. Symbol(section,procedureSection,0,0);
  11978. Info(section,"pcTo");
  11979. Symbol(section, procedureSection, procedureSection.pc, 0);
  11980. Info(section,"pointer to offsets array");
  11981. Symbol(section, section,section.pc+1,0);
  11982. Info(section,"offsets array");
  11983. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11984. PointerArray(section, procedure.procedureScope, numberPointers);
  11985. END ProcedureDescriptor;
  11986. (* only for tracing, the descriptor is otherwise not complete ! *)
  11987. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11988. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11989. BEGIN
  11990. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11991. name := procedureSection.name;
  11992. Basic.AppendToSegmentedName(name,".@Info");
  11993. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11994. Address(section,0);
  11995. Symbol(section,section,2,0);
  11996. (*
  11997. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11998. descSize: SIZE;
  11999. sentinel: ADDRESS; (* = MPO-4 *)
  12000. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12001. flags*: SET;
  12002. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12003. name*: Name;
  12004. END;
  12005. *)
  12006. Size(section, 0);
  12007. Address(section,0);
  12008. Address(section,0);
  12009. Set(section,{});
  12010. moduleSection := ModuleSection();
  12011. Symbol( section, moduleSection, moduleSection.pc,0);
  12012. IF procedureSection.symbol = NIL THEN
  12013. Basic.SegmentedNameToString(procedureSection.name, infoName);
  12014. ELSE
  12015. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  12016. END;
  12017. Name(section, infoName);
  12018. Size(section, 0);
  12019. RETURN section;
  12020. END MakeProcedureDescriptorTag;
  12021. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  12022. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  12023. BEGIN
  12024. name := procedureSection.name;
  12025. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  12026. IF implementationVisitor.backend.cooperative THEN
  12027. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12028. Info(section, "TypeDescriptor");
  12029. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  12030. NamedSymbol(dest, name,NIL, 0, 0);
  12031. BaseRecord(dest);
  12032. offset := 0;
  12033. ELSIF CreateProcedureDescInfo THEN
  12034. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12035. Address(dest,0);
  12036. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  12037. offset := dest.pc;
  12038. ELSE
  12039. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  12040. END;
  12041. ProcedureDescriptor(dest, procedureSection);
  12042. Symbol(section, dest, offset, 0);
  12043. END ProcedureDescriptorPointer;
  12044. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  12045. VAR sizePC, i: LONGINT; destination: Sections.Section;
  12046. BEGIN
  12047. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  12048. numberProcs := 0;
  12049. FOR i := 0 TO module.allSections.Length() - 1 DO
  12050. destination := module.allSections.GetSection(i);
  12051. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  12052. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  12053. INC(numberProcs);
  12054. END
  12055. END;
  12056. PatchArray(section, sizePC, numberProcs);
  12057. END ProcedureDescriptorArray;
  12058. (*
  12059. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  12060. VAR
  12061. next*: Module; (** once a module is published, all fields are read-only *)
  12062. name*: Name;
  12063. init, published: BOOLEAN;
  12064. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  12065. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  12066. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  12067. command*: POINTER TO ARRAY OF Command;
  12068. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  12069. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  12070. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  12071. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  12072. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  12073. data*, code*: Bytes;
  12074. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  12075. export*: ExportDesc;
  12076. term*: TerminationHandler;
  12077. exTable*: ExceptionTable;
  12078. noProcs*: LONGINT;
  12079. firstProc*: ADDRESS; <- done by loader
  12080. maxPtrs*: LONGINT;
  12081. crc*: LONGINT;
  12082. *)
  12083. PROCEDURE BasePointer (section: IntermediateCode.Section);
  12084. BEGIN
  12085. Info(section, "cycle");
  12086. Size(section,0);
  12087. Info(section, "references");
  12088. Size(section,0);
  12089. Info(section, "nextMarked");
  12090. Address(section,0);
  12091. Info(section, "nextWatched");
  12092. Address(section,0);
  12093. END BasePointer;
  12094. PROCEDURE BaseObject (section: IntermediateCode.Section);
  12095. BEGIN
  12096. BasePointer(section);
  12097. Info(section, "action");
  12098. Address(section,0);
  12099. Info(section, "monitor");
  12100. Address(section,0);
  12101. END BaseObject;
  12102. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  12103. BEGIN
  12104. BasePointer(section);
  12105. Info(section, "action");
  12106. Address(section,0);
  12107. Info(section, "monitor");
  12108. Address(section,0);
  12109. END BaseRecord;
  12110. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  12111. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  12112. pooledName: Basic.SegmentedName;
  12113. symbol: SyntaxTree.Symbol;
  12114. BEGIN
  12115. Global.GetModuleName(module.module,name);
  12116. Strings.Append(name,".@Module.@Descriptor");
  12117. Basic.ToSegmentedName(name, pooledName);
  12118. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12119. Symbol(section,descriptorSection,0,0);
  12120. Info(descriptorSection, "descriptor");
  12121. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12122. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  12123. Address(descriptorSection,0);
  12124. Global.GetModuleName(module.module,name);
  12125. Strings.Append(name,".@Trace");
  12126. Basic.ToSegmentedName(name, pooledName);
  12127. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12128. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  12129. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12130. END ModuleDescriptor;
  12131. PROCEDURE ModuleSection(): IntermediateCode.Section;
  12132. VAR name: ARRAY 128 OF CHAR;
  12133. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  12134. symbol: SyntaxTree.Symbol;
  12135. BEGIN
  12136. Global.GetModuleName(module.module,name);
  12137. Strings.Append(name,".@Module");
  12138. Basic.ToSegmentedName(name, pooledName);
  12139. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12140. moduleSection.SetExported(TRUE);
  12141. IF moduleSection.pc = 0 THEN
  12142. IF implementationVisitor.backend.cooperative THEN
  12143. Info(moduleSection, "descriptor");
  12144. ModuleDescriptor(moduleSection);
  12145. BaseObject(moduleSection);
  12146. implementationVisitor.CreateTraceModuleMethod(module.module);
  12147. ELSE
  12148. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12149. Info(moduleSection, "HeapBlock");
  12150. Symbol(moduleSection,moduleSection,2,0);
  12151. Info(moduleSection, "TypeDescriptor");
  12152. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12153. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12154. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12155. END;
  12156. END;
  12157. RETURN moduleSection;
  12158. END ModuleSection;
  12159. PROCEDURE NewModuleInfo();
  12160. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12161. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12162. sectionName: Basic.SectionName;
  12163. CONST MPO=-40000000H;
  12164. BEGIN
  12165. (*
  12166. TypeDesc* = POINTER TO RECORD
  12167. descSize: SIZE;
  12168. sentinel: LONGINT; (* = MPO-4 *)
  12169. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12170. flags*: SET;
  12171. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12172. name*: Name;
  12173. refsOffset: SIZE;
  12174. END;
  12175. *)
  12176. (*name is missing prefixes sometimes*)
  12177. Global.GetModuleSegmentedName(module.module,name);
  12178. Basic.AppendToSegmentedName(name,".@Info");
  12179. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12180. IF ~implementationVisitor.backend.cooperative THEN
  12181. Info(source, "HeapBlock");
  12182. Address(source,0); (* an empty heap block prevents GC marking *)
  12183. Info(source, "TypeDescriptor");
  12184. Address(source,0);
  12185. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12186. END;
  12187. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12188. Address(source,MPO-4);
  12189. Info(source, "type tag pointer");
  12190. Address( source,0);
  12191. Info(source, "type flags");
  12192. flags := {};
  12193. Set( source, flags);
  12194. Info(source, "pointer to module");
  12195. moduleSection := ModuleSection();
  12196. Symbol( source, moduleSection, moduleSection.pc,0);
  12197. Info(source, "type name");
  12198. i := 0;
  12199. sectionName := "@Self";
  12200. (*
  12201. Global.GetSymbolSegmentedName(td,name);
  12202. Basic.SegmentedNameToString(name, sectionName);
  12203. *)
  12204. Name(source,sectionName);
  12205. patchInfoPC := source.pc;
  12206. Size(source, 0);
  12207. END NewModuleInfo;
  12208. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  12209. VAR
  12210. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  12211. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  12212. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  12213. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, numberProcs,temp,
  12214. referenceSectionOffset : LONGINT;
  12215. name: Basic.SegmentedName; offset: LONGINT;
  12216. flags: SET;
  12217. BEGIN
  12218. NewModuleInfo();
  12219. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  12220. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  12221. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  12222. ImportsArray(importSection);
  12223. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  12224. CommandArray(commandsSection);
  12225. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  12226. ExceptionArray(exceptionSection);
  12227. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  12228. AddPointer(typeInfoSection, typeInfoSectionOffset);
  12229. TypeInfoSection(typeInfoSection);
  12230. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  12231. referenceSection.SetExported(TRUE);
  12232. References(referenceSection);
  12233. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  12234. ProcedureDescriptorArray(procTableSection, numberProcs);
  12235. IF ProtectModulesPointers THEN
  12236. name := "Heaps.AnyPtr";
  12237. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12238. (* set base pointer *)
  12239. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12240. END;
  12241. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12242. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12243. moduleSection := ModuleSection();
  12244. Info(moduleSection, "nextRoot*: RootObject");
  12245. Address(moduleSection,0);
  12246. Info(moduleSection, "next*: Module");
  12247. Address(moduleSection,0);
  12248. Info(moduleSection, "name*: Name");
  12249. Name(moduleSection,moduleName);
  12250. Info(moduleSection, "init, published: BOOLEAN");
  12251. Boolean(moduleSection,FALSE);
  12252. Boolean(moduleSection,FALSE);
  12253. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12254. Boolean(moduleSection,FALSE);
  12255. Boolean(moduleSection,FALSE);
  12256. Info(moduleSection, "refcnt*: LONGINT");
  12257. Longint(moduleSection,0);
  12258. Info(moduleSection, "sb*: ADDRESS");
  12259. Address(moduleSection,0);
  12260. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12261. Address(moduleSection,0);
  12262. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12263. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12264. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12265. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12266. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12267. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12268. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12269. Symbol(moduleSection,importSection,importSectionOffset,0);
  12270. Info(moduleSection, "procTable*: ProcTable");
  12271. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12272. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12273. Address(moduleSection,0);
  12274. Address(moduleSection,0);
  12275. Address(moduleSection,0);
  12276. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12277. Info(moduleSection, "export*: ExportDesc");
  12278. ExportDesc(moduleSection);
  12279. Info(moduleSection, "term*: TerminationHandler");
  12280. Address(moduleSection,0);
  12281. Info(moduleSection, "exTable*: ExceptionTable");
  12282. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12283. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12284. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12285. Info(moduleSection, "crc*: LONGINT");
  12286. patchCRC:= moduleSection.pc;
  12287. Longint(moduleSection, 0); (*! must be implemented *)
  12288. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12289. Info(moduleSection, "body*: ADDRESS");
  12290. Symbol(moduleSection, bodyProc, 0,0);
  12291. Info(moduleSection, "module flags");
  12292. flags := {};
  12293. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12294. Set( moduleSection, flags);
  12295. IF implementationVisitor.backend.cooperative THEN
  12296. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12297. Info(moduleSection, "monitor.owner");
  12298. Address(moduleSection,0);
  12299. Info(moduleSection, "monitor.nestingLevel");
  12300. Address(moduleSection,0);
  12301. Info(moduleSection, "monitor.blockedQueue");
  12302. Address(moduleSection,0); Address(moduleSection,0);
  12303. Info(moduleSection, "monitor.waitingQueue");
  12304. Address(moduleSection,0); Address(moduleSection,0);
  12305. Info(moduleSection, "monitor.waitingSentinel");
  12306. Address(moduleSection,0);
  12307. END;
  12308. END Module;
  12309. PROCEDURE PatchCRC(crc: LONGINT);
  12310. BEGIN
  12311. IF ~simple THEN
  12312. PatchLongint(ModuleSection(), patchCRC, crc);
  12313. END;
  12314. END PatchCRC;
  12315. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12316. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12317. BEGIN
  12318. ArrayBlock(source,pc,"",FALSE);
  12319. Info(source, "pointer offsets array data");
  12320. IF scope IS SyntaxTree.RecordScope THEN
  12321. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12322. ELSIF scope IS SyntaxTree.CellScope THEN
  12323. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12324. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12325. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12326. WHILE variable # NIL DO
  12327. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12328. symbol := module.allSections.FindBySymbol(variable);
  12329. ASSERT(symbol # NIL);
  12330. Pointers(0,symbol, source,variable.type,numberPointers);
  12331. END;
  12332. variable := variable.nextVariable;
  12333. END;
  12334. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12335. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12336. WHILE parameter # NIL DO
  12337. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  12338. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12339. END;
  12340. parameter := parameter.nextParameter;
  12341. END;
  12342. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12343. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12344. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12345. IF implementationVisitor.backend.preciseGC THEN
  12346. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12347. END;
  12348. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12349. END;
  12350. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12351. WHILE(variable # NIL) DO
  12352. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12353. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12354. END;
  12355. variable := variable.nextVariable
  12356. END;
  12357. END;
  12358. PatchArray(source,pc,numberPointers);
  12359. END PointerArray;
  12360. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12361. VAR recordType: SyntaxTree.RecordType;
  12362. tir, tdInfo: IntermediateCode.Section; td: SyntaxTree.TypeDeclaration;
  12363. section: Sections.Section; cellType: SyntaxTree.CellType;
  12364. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12365. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12366. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12367. sectionName: Basic.SectionName;
  12368. CONST MPO=-40000000H;
  12369. BEGIN
  12370. (*
  12371. TypeDesc* = POINTER TO RECORD
  12372. descSize: SIZE;
  12373. sentinel: LONGINT; (* = MPO-4 *)
  12374. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12375. flags*: SET;
  12376. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12377. name*: Name;
  12378. refsOffset: SIZE;
  12379. END;
  12380. *)
  12381. (* source := module.sections.FindByName(...) *)
  12382. Global.GetSymbolSegmentedName(td,name);
  12383. Basic.AppendToSegmentedName(name,".@Info");
  12384. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12385. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12386. Address(source,0);
  12387. Info(source, "TypeDescriptor");
  12388. Address(source,0);
  12389. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12390. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12391. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12392. Info(source, "type tag pointer");
  12393. Symbol( source, tag, offset, 0);
  12394. Info(source, "type flags");
  12395. flags := {};
  12396. IF isProtected THEN INCL(flags,31) END;
  12397. Set( source, flags);
  12398. Info(source, "pointer to module");
  12399. moduleSection := ModuleSection();
  12400. Symbol( source, moduleSection, moduleSection.pc,0);
  12401. Info(source, "type name");
  12402. i := 0;
  12403. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12404. (*
  12405. Global.GetSymbolSegmentedName(td,name);
  12406. Basic.SegmentedNameToString(name, sectionName);
  12407. *)
  12408. Name(source,sectionName);
  12409. Size(source, 0);
  12410. RETURN source;
  12411. END NewTypeDescriptorInfo;
  12412. PROCEDURE NewTypeDescriptor;
  12413. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12414. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12415. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12416. numberPointers: LONGINT; padding, i: LONGINT;
  12417. CONST MPO=-40000000H;
  12418. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12419. VAR i: LONGINT;
  12420. PROCEDURE Td(record: SyntaxTree.RecordType);
  12421. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12422. BEGIN
  12423. IF record # NIL THEN
  12424. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12425. baseTD := record.typeDeclaration;
  12426. Global.GetSymbolSegmentedName(baseTD,name);
  12427. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12428. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12429. ELSE
  12430. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12431. END;
  12432. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12433. Symbol(source, tir, 0, offset);
  12434. IF reverse THEN Td(record.GetBaseRecord()) END;
  12435. END;
  12436. END Td;
  12437. BEGIN
  12438. Info(source, "tag table");
  12439. baseRecord := recordType;
  12440. i := 0;
  12441. WHILE baseRecord # NIL DO
  12442. INC(i);
  12443. baseRecord := baseRecord.GetBaseRecord();
  12444. END;
  12445. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12446. IF ~reverse THEN Td(recordType) END;
  12447. WHILE i < size DO
  12448. Address(source,0);
  12449. INC(i);
  12450. END;
  12451. IF reverse THEN Td(recordType) END;
  12452. END TdTable;
  12453. PROCEDURE MethodTable(reverse: BOOLEAN);
  12454. VAR i,methods: LONGINT;
  12455. BEGIN
  12456. Info(source, "method table");
  12457. IF recordType # NIL THEN
  12458. methods := recordType.recordScope.numberMethods;
  12459. IF reverse THEN
  12460. FOR i := methods-1 TO 0 BY -1 DO
  12461. procedure := recordType.recordScope.FindMethod(i);
  12462. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12463. NamedSymbol(source, name,procedure, 0,0);
  12464. END;
  12465. ELSE
  12466. FOR i := 0 TO methods-1 DO
  12467. procedure := recordType.recordScope.FindMethod(i);
  12468. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12469. NamedSymbol(source, name,procedure, 0,0);
  12470. END;
  12471. END;
  12472. END;
  12473. END MethodTable;
  12474. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12475. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12476. BEGIN
  12477. Info(source, "method table");
  12478. baseRecord := recordType;
  12479. WHILE baseRecord.baseType # NIL DO
  12480. baseRecord := baseRecord.GetBaseRecord ();
  12481. END;
  12482. GetRecordTypeName (baseRecord, name);
  12483. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12484. IF name = stackFrame THEN
  12485. start := 0;
  12486. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12487. baseRecord := recordType;
  12488. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12489. baseRecord := baseRecord.GetBaseRecord ();
  12490. END;
  12491. IF baseRecord # NIL THEN
  12492. GetRecordTypeName (baseRecord, name);
  12493. IF pointer & ~baseRecord.isObject THEN
  12494. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12495. END;
  12496. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12497. ELSIF recordType.isObject THEN
  12498. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12499. ELSIF pointer THEN
  12500. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12501. ELSE
  12502. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12503. END;
  12504. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12505. Symbol(source, tir, 0, 0);
  12506. start := 0;
  12507. baseRecord := recordType;
  12508. WHILE (baseRecord # NIL) DO
  12509. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12510. baseRecord := baseRecord.GetBaseRecord ();
  12511. END;
  12512. ELSE
  12513. (* explicit trace method: *)
  12514. procedure := recordType.recordScope.FindMethod(0);
  12515. IF ~procedure.isFinalizer THEN
  12516. Global.GetSymbolSegmentedName(procedure, name);
  12517. NamedSymbol(source, name,procedure, 0,0);
  12518. END;
  12519. start := 1;
  12520. END;
  12521. IF (name # stackFrame) & recordType.isObject THEN
  12522. baseRecord := recordType;
  12523. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12524. baseRecord := baseRecord.GetBaseRecord ();
  12525. END;
  12526. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12527. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12528. ELSE
  12529. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12530. END;
  12531. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12532. Symbol(source, tir, 0, 0);
  12533. END;
  12534. methods := recordType.recordScope.numberMethods;
  12535. FOR i := start TO methods-1 DO
  12536. procedure := recordType.recordScope.FindMethod(i);
  12537. IF ~procedure.isFinalizer THEN
  12538. Global.GetSymbolSegmentedName(procedure, name);
  12539. NamedSymbol(source, name,procedure, 0,0);
  12540. END;
  12541. END;
  12542. END CooperativeMethodTable;
  12543. BEGIN
  12544. Global.GetSymbolSegmentedName(td,name);
  12545. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12546. source.SetExported(IsExported(td));
  12547. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12548. IF implementationVisitor.backend.cooperative THEN
  12549. base := NIL;
  12550. baseRecord := recordType.GetBaseRecord();
  12551. IF baseRecord # NIL THEN
  12552. baseTD := baseRecord.typeDeclaration;
  12553. END;
  12554. IF ~recordType.isObject THEN
  12555. Info(source, "parent");
  12556. IF baseRecord # NIL THEN
  12557. Global.GetSymbolSegmentedName(baseTD,name);
  12558. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12559. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12560. ELSE
  12561. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12562. END;
  12563. Symbol(source, tir, 0, 0);
  12564. ELSE
  12565. Address(source,0);
  12566. END;
  12567. Info(source, "record size");
  12568. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12569. CooperativeMethodTable(FALSE);
  12570. base := source;
  12571. Global.GetSymbolSegmentedName(td,name);
  12572. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12573. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12574. source.SetExported(IsExported(td));
  12575. END;
  12576. Info(source, "parent");
  12577. IF baseRecord # NIL THEN
  12578. Global.GetSymbolSegmentedName(baseTD,name);
  12579. sym := baseTD;
  12580. IF ~recordType.isObject THEN
  12581. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12582. sym := NIL;
  12583. END;
  12584. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12585. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12586. ELSE
  12587. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12588. END;
  12589. Symbol(source, tir, 0, 0);
  12590. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12591. Address(source,0);
  12592. ELSE
  12593. IF recordType.isObject THEN
  12594. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12595. ELSE
  12596. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12597. END;
  12598. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12599. Symbol(source, tir, 0, 0);
  12600. END;
  12601. Info(source, "base record descriptor");
  12602. Symbol(source, base, 0, 0);
  12603. CooperativeMethodTable(TRUE);
  12604. IF recordType.hasPointers THEN
  12605. IF ~HasExplicitTraceMethod (recordType) THEN
  12606. implementationVisitor.CreateTraceMethod(recordType);
  12607. END;
  12608. implementationVisitor.CreateResetProcedure(recordType);
  12609. implementationVisitor.CreateAssignProcedure(recordType);
  12610. END;
  12611. ELSIF ~simple THEN
  12612. (*
  12613. MethodEnd = MPO
  12614. ---
  12615. methods (# methods)
  12616. ---
  12617. tags (16)
  12618. ---
  12619. TypeDesc = TypeInfoAdr
  12620. ---
  12621. td adr ---> rec size
  12622. ----
  12623. pointer offsets
  12624. ----
  12625. (padding)
  12626. -----
  12627. empty [2 addresses aligned]
  12628. empty
  12629. empty
  12630. numPtrs
  12631. ---
  12632. pointer offsets
  12633. ---
  12634. *)
  12635. Info(source, "MethodEnd = MPO");
  12636. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12637. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12638. MethodTable(TRUE);
  12639. TdTable(TypeTags, TRUE);
  12640. Info(source, "type descriptor info pointer");
  12641. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12642. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12643. IF (cellType # NIL) THEN
  12644. IF cellType.sizeInBits < 0 THEN
  12645. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12646. END;
  12647. Info(source, "cell size");
  12648. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12649. ELSE
  12650. Info(source, "record size");
  12651. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12652. END;
  12653. Info(source, "pointer offsets pointer");
  12654. padding := 1- source.pc MOD 2;
  12655. Symbol(source, source, source.pc+1+padding,0);
  12656. IF padding >0 THEN
  12657. Info(source, "padding");
  12658. FOR i := 1 TO padding DO Address(source,0) END;
  12659. END;
  12660. IF cellType # NIL THEN
  12661. PointerArray(source, cellType.cellScope, numberPointers);
  12662. ELSE
  12663. PointerArray(source, recordType.recordScope, numberPointers);
  12664. END;
  12665. ELSE
  12666. (*
  12667. simple:
  12668. td adr --> size
  12669. tag(1)
  12670. tag(2)
  12671. tag(3)
  12672. methods ->
  12673. *)
  12674. Info(source, "record size");
  12675. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12676. TdTable(TypeTags, FALSE);
  12677. MethodTable(FALSE);
  12678. END;
  12679. END NewTypeDescriptor;
  12680. BEGIN
  12681. x := x.resolved;
  12682. IF (x IS SyntaxTree.PointerType) THEN
  12683. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12684. END;
  12685. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12686. recordType := x(SyntaxTree.RecordType);
  12687. td := x.typeDeclaration;
  12688. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12689. ASSERT(td # NIL);
  12690. section := module.allSections.FindBySymbol(td); (* TODO *)
  12691. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12692. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12693. NewTypeDescriptor
  12694. END;
  12695. END;
  12696. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12697. cellType := x(SyntaxTree.CellType);
  12698. td := x.typeDeclaration;
  12699. section := module.allSections.FindBySymbol(td); (* TODO *)
  12700. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12701. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12702. NewTypeDescriptor
  12703. END;
  12704. END;
  12705. END
  12706. END CheckTypeDeclaration
  12707. END MetaDataGenerator;
  12708. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12709. VAR
  12710. trace-: BOOLEAN;
  12711. traceString-: SyntaxTree.IdentifierString;
  12712. traceModuleName-: SyntaxTree.IdentifierString;
  12713. profile-: BOOLEAN;
  12714. noRuntimeChecks: BOOLEAN;
  12715. simpleMetaData-: BOOLEAN;
  12716. noAsserts: BOOLEAN;
  12717. optimize-: BOOLEAN;
  12718. cooperative-: BOOLEAN;
  12719. preregisterStatic-: BOOLEAN;
  12720. dump-: Basic.Writer;
  12721. cellsAreObjects: BOOLEAN;
  12722. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12723. experiment: BOOLEAN;
  12724. PROCEDURE &InitIntermediateBackend*;
  12725. BEGIN
  12726. simpleMetaData := FALSE;
  12727. InitBackend;
  12728. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  12729. SetTraceModuleName(DefaultTraceModuleName);
  12730. END InitIntermediateBackend;
  12731. (* must be overwritten by actual backend, if parameter registers should be used *)
  12732. PROCEDURE GetParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; VAR register: WORD): BOOLEAN;
  12733. BEGIN
  12734. register := -1;
  12735. RETURN FALSE;
  12736. END GetParameterRegister;
  12737. PROCEDURE ResetParameterRegisters*;
  12738. BEGIN
  12739. END ResetParameterRegisters;
  12740. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12741. VAR
  12742. declarationVisitor: DeclarationVisitor;
  12743. implementationVisitor: ImplementationVisitor;
  12744. module: Sections.Module;
  12745. name, platformName: SyntaxTree.IdentifierString;
  12746. meta: MetaDataGenerator;
  12747. crc: CRC.CRC32Stream;
  12748. BEGIN
  12749. ResetError;
  12750. Global.GetSymbolName(x,name);
  12751. NEW(module,x,system); (* backend structures *)
  12752. Global.GetModuleName(x, name);
  12753. module.SetModuleName(name);
  12754. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  12755. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12756. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12757. declarationVisitor.Module(x,module);
  12758. IF ~meta.simple THEN
  12759. meta.Module(implementationVisitor.moduleBodySection);
  12760. END;
  12761. GetDescription(platformName);
  12762. module.SetPlatformName(platformName);
  12763. NEW(crc);
  12764. module.allSections.WriteRaw(crc);
  12765. crc.Update;
  12766. meta.PatchCRC(crc.GetCRC());
  12767. RETURN module
  12768. END GenerateIntermediate;
  12769. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12770. BEGIN RETURN TRUE
  12771. END SupportedImmediate;
  12772. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12773. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12774. END ProcessSyntaxTreeModule;
  12775. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12776. VAR
  12777. result: Sections.Module;
  12778. traceName: Basic.MessageString;
  12779. BEGIN
  12780. ASSERT(intermediateCodeModule IS Sections.Module);
  12781. result := intermediateCodeModule(Sections.Module);
  12782. IF trace THEN
  12783. traceName := "intermediate code trace: ";
  12784. Strings.Append(traceName,traceString);
  12785. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12786. IF (traceString="") OR (traceString="*") THEN
  12787. result.Dump(dump);
  12788. dump.Update
  12789. ELSE
  12790. Sections.DumpFiltered(dump, result, traceString);
  12791. END
  12792. END;
  12793. RETURN result
  12794. END ProcessIntermediateCodeModule;
  12795. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12796. BEGIN instructionSet := "Intermediate";
  12797. END GetDescription;
  12798. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  12799. BEGIN
  12800. SELF.simpleMetaData := simpleMetaData;
  12801. END SetSimpleMetaData;
  12802. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12803. BEGIN COPY(name, traceModuleName)
  12804. END SetTraceModuleName;
  12805. PROCEDURE DefineOptions*(options: Options.Options);
  12806. BEGIN
  12807. DefineOptions^(options);
  12808. options.Add(0X,"trace",Options.String);
  12809. options.Add(0X,"builtinsModule",Options.String);
  12810. options.Add(0X,"traceModule",Options.String);
  12811. options.Add(0X,"profile",Options.Flag);
  12812. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12813. options.Add(0X,"noAsserts",Options.Flag);
  12814. options.Add(0X,"metaData",Options.String);
  12815. options.Add('o',"optimize", Options.Flag);
  12816. options.Add(0X,"preregisterStatic", Options.Flag);
  12817. options.Add(0X,"cellsAreObjects", Options.Flag);
  12818. options.Add(0X,"preciseGC", Options.Flag);
  12819. options.Add(0X,"trackLeave", Options.Flag);
  12820. options.Add(0X,"writeBarriers", Options.Flag);
  12821. options.Add(0X,"experiment", Options.Flag);
  12822. END DefineOptions;
  12823. PROCEDURE GetOptions*(options: Options.Options);
  12824. VAR name,string: SyntaxTree.IdentifierString;
  12825. BEGIN
  12826. GetOptions^(options);
  12827. trace := options.GetString("trace",traceString);
  12828. profile := options.GetFlag("profile");
  12829. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12830. noAsserts := options.GetFlag("noAsserts");
  12831. cooperative := options.GetFlag("cooperative");
  12832. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12833. simpleMetaData := TRUE
  12834. END;
  12835. IF options.GetString("metaData",string) THEN
  12836. IF string = "simple" THEN simpleMetaData := TRUE
  12837. ELSIF string ="full" THEN simpleMetaData := FALSE
  12838. END;
  12839. END;
  12840. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  12841. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12842. optimize := options.GetFlag("optimize");
  12843. preregisterStatic := options.GetFlag("preregisterStatic");
  12844. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12845. preciseGC := options.GetFlag("preciseGC");
  12846. trackLeave := options.GetFlag("trackLeave");
  12847. writeBarriers := options.GetFlag("writeBarriers");
  12848. experiment := options.GetFlag("experiment");
  12849. END GetOptions;
  12850. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12851. BEGIN RETURN SymbolFileFormat.Get()
  12852. END DefaultSymbolFileFormat;
  12853. END IntermediateBackend;
  12854. (* ----------------------------------- register allocation ------------------------------------- *)
  12855. (* register mapping scheme
  12856. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12857. spill offset
  12858. part(n) --> ticket <--> physical register
  12859. spill offset
  12860. *)
  12861. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12862. emptyOperand: IntermediateCode.Operand;
  12863. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12864. statCoopResetVariables: LONGINT;
  12865. statCoopModifyAssignments: LONGINT;
  12866. modifyAssignmentsPC : LONGINT;
  12867. statCoopNilCheck: LONGINT;
  12868. statCoopSwitch: LONGINT;
  12869. statCoopAssignProcedure: LONGINT;
  12870. statCoopTraceMethod: LONGINT;
  12871. statCoopResetProcedure: LONGINT;
  12872. statCoopTraceModule: LONGINT;
  12873. PROCEDURE ResetStatistics*;
  12874. BEGIN
  12875. statCoopResetVariables := 0;
  12876. statCoopModifyAssignments := 0;
  12877. statCoopNilCheck:= 0;
  12878. statCoopSwitch:= 0;
  12879. statCoopAssignProcedure:= 0;
  12880. statCoopTraceMethod:= 0;
  12881. statCoopResetProcedure:= 0;
  12882. statCoopTraceModule:= 0;
  12883. END ResetStatistics;
  12884. PROCEDURE Statistics*;
  12885. BEGIN
  12886. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12887. TRACE(statCoopNilCheck, statCoopSwitch);
  12888. TRACE(statCoopAssignProcedure,
  12889. statCoopTraceMethod,
  12890. statCoopResetProcedure,
  12891. statCoopTraceModule)
  12892. END Statistics;
  12893. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12894. VAR h: LONGINT;
  12895. BEGIN
  12896. WHILE b # 0 DO
  12897. h := a MOD b;
  12898. a := b;
  12899. b := h;
  12900. END;
  12901. RETURN a
  12902. END GCD;
  12903. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12904. BEGIN
  12905. RETURN a*b DIV GCD(a,b)
  12906. END SCM;
  12907. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12908. BEGIN
  12909. (*TRACE(a,b);*)
  12910. IF a = 0 THEN RETURN b
  12911. ELSIF b = 0 THEN RETURN a
  12912. ELSE RETURN SCM(a,b)
  12913. END;
  12914. END CommonAlignment;
  12915. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12916. BEGIN
  12917. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12918. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12919. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12920. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12921. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12922. END
  12923. END PassBySingleReference;
  12924. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12925. BEGIN
  12926. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  12927. END PassInRegister;
  12928. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12929. VAR new: RegisterEntry;
  12930. BEGIN
  12931. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12932. IF queue = NIL THEN
  12933. queue := new
  12934. ELSE
  12935. new.next := queue;
  12936. IF queue#NIL THEN queue.prev := new END;
  12937. queue := new
  12938. END;
  12939. END AddRegisterEntry;
  12940. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12941. VAR this: RegisterEntry;
  12942. BEGIN
  12943. this := queue;
  12944. WHILE (this # NIL) & (this.register # register) DO
  12945. this := this.next;
  12946. END;
  12947. IF this = NIL THEN
  12948. RETURN FALSE
  12949. END;
  12950. ASSERT(this # NIL);
  12951. IF this = queue THEN queue := queue.next END;
  12952. IF this.prev # NIL THEN this.prev.next := this.next END;
  12953. IF this.next # NIL THEN this.next.prev := this.prev END;
  12954. RETURN TRUE
  12955. END RemoveRegisterEntry;
  12956. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12957. BEGIN ASSERT(cond);
  12958. END Assert;
  12959. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12960. BEGIN
  12961. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12962. END ReusableRegister;
  12963. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12964. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12965. BEGIN
  12966. procedure := moduleScope.bodyProcedure;
  12967. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12968. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12969. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12970. procedure.SetScope(moduleScope);
  12971. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12972. procedure.SetAccess(SyntaxTree.Hidden);
  12973. moduleScope.SetBodyProcedure(procedure);
  12974. moduleScope.AddProcedure(procedure);
  12975. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12976. END;
  12977. END EnsureBodyProcedure;
  12978. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12979. VAR import: SyntaxTree.Import;
  12980. selfName: SyntaxTree.IdentifierString;
  12981. module: SyntaxTree.Module;
  12982. BEGIN
  12983. scope.ownerModule.GetName(selfName);
  12984. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12985. module := scope.ownerModule
  12986. ELSE
  12987. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12988. IF import = NIL THEN
  12989. RETURN NIL
  12990. ELSIF import.module = NIL THEN
  12991. RETURN NIL
  12992. ELSE module := import.module
  12993. END;
  12994. END;
  12995. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12996. END GetSymbol;
  12997. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12998. BEGIN
  12999. op.mode := mode;
  13000. IntermediateCode.InitOperand(op.op);
  13001. IntermediateCode.InitOperand(op.tag);
  13002. IntermediateCode.InitOperand(op.extra);
  13003. op.dimOffset := 0;
  13004. op.availability := -1;
  13005. END InitOperand;
  13006. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  13007. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  13008. BEGIN RETURN IntermediateCode.GetType(system, type)
  13009. END GetType;
  13010. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  13011. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  13012. BEGIN
  13013. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  13014. (*
  13015. UniqueId(name,module,name,adr);
  13016. *)
  13017. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  13018. constant.SetValue(value);
  13019. constant.SetAccess(SyntaxTree.Hidden);
  13020. module.moduleScope.AddConstant(constant);
  13021. constant.SetScope(module.moduleScope);
  13022. RETURN constant
  13023. END BuildConstant;
  13024. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13025. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  13026. BEGIN
  13027. variable := scope.firstVariable;
  13028. WHILE variable # NIL DO
  13029. IF variable.NeedsTrace() THEN
  13030. RETURN TRUE;
  13031. END;
  13032. variable := variable.nextVariable;
  13033. END;
  13034. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13035. WHILE parameter # NIL DO
  13036. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  13037. RETURN TRUE;
  13038. END;
  13039. parameter := parameter.nextParameter;
  13040. END;
  13041. RETURN FALSE;
  13042. END HasPointers;
  13043. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  13044. 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));
  13045. END IsVariableParameter;
  13046. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13047. VAR parameter: SyntaxTree.Parameter;
  13048. BEGIN
  13049. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13050. WHILE parameter # NIL DO
  13051. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  13052. IF parameter.movable THEN RETURN TRUE END;
  13053. parameter := parameter.nextParameter;
  13054. END;
  13055. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  13056. END HasVariableParameters;
  13057. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  13058. BEGIN
  13059. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  13060. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  13061. END HasExplicitTraceMethod;
  13062. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  13063. BEGIN
  13064. IF expression.resolved # NIL THEN expression := expression.resolved END;
  13065. IF (expression IS SyntaxTree.IntegerValue) THEN
  13066. val := expression(SyntaxTree.IntegerValue).value;
  13067. RETURN TRUE
  13068. ELSE
  13069. RETURN FALSE
  13070. END;
  13071. END IsIntegerConstant;
  13072. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  13073. BEGIN
  13074. IF val <= 0 THEN RETURN FALSE END;
  13075. exp := 0;
  13076. WHILE ~ODD(val) DO
  13077. val := val DIV 2;
  13078. INC(exp)
  13079. END;
  13080. RETURN val = 1
  13081. END PowerOf2;
  13082. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  13083. VAR procedure: SyntaxTree.Procedure;
  13084. BEGIN
  13085. procedure := record.recordScope.constructor;
  13086. IF procedure = NIL THEN
  13087. record := record.GetBaseRecord();
  13088. IF record # NIL THEN
  13089. procedure := GetConstructor(record)
  13090. END;
  13091. END;
  13092. RETURN procedure;
  13093. END GetConstructor;
  13094. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  13095. BEGIN
  13096. value := SHORT(op.intValue);
  13097. RETURN op.mode = IntermediateCode.ModeImmediate;
  13098. END IsIntegerImmediate;
  13099. (** whether a type strictily is a pointer to record or object type
  13100. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  13101. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  13102. BEGIN
  13103. IF type = NIL THEN
  13104. RETURN FALSE
  13105. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  13106. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  13107. ELSE
  13108. RETURN FALSE
  13109. END
  13110. END IsStrictlyPointerToRecord;
  13111. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  13112. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  13113. END IsUnsafePointer;
  13114. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  13115. BEGIN type := type.resolved;
  13116. IF type IS SyntaxTree.PointerType THEN
  13117. type := type(SyntaxTree.PointerType).pointerBase;
  13118. type := type.resolved;
  13119. IF type IS SyntaxTree.RecordType THEN
  13120. recordType := type(SyntaxTree.RecordType);
  13121. RETURN TRUE
  13122. ELSE
  13123. RETURN FALSE
  13124. END
  13125. ELSIF type IS SyntaxTree.RecordType THEN
  13126. recordType := type(SyntaxTree.RecordType);
  13127. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13128. ELSIF type IS SyntaxTree.ObjectType THEN
  13129. RETURN TRUE
  13130. ELSIF type IS SyntaxTree.AnyType THEN
  13131. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13132. ELSE
  13133. RETURN FALSE
  13134. END;
  13135. END IsPointerToRecord;
  13136. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13137. BEGIN
  13138. type := type.resolved;
  13139. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13140. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13141. END IsArrayOfSystemByte;
  13142. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13143. BEGIN
  13144. IF type = NIL THEN RETURN FALSE END;
  13145. type := type.resolved;
  13146. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13147. END IsOpenArray;
  13148. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13149. BEGIN
  13150. IF type = NIL THEN RETURN FALSE END;
  13151. type := type.resolved;
  13152. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13153. END IsSemiDynamicArray;
  13154. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13155. BEGIN
  13156. IF type = NIL THEN RETURN FALSE END;
  13157. type := type.resolved;
  13158. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13159. END IsStaticArray;
  13160. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13161. BEGIN
  13162. IF type = NIL THEN RETURN FALSE END;
  13163. type := type.resolved;
  13164. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13165. END IsStaticMathArray;
  13166. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13167. BEGIN
  13168. WHILE (IsStaticMathArray(type)) DO
  13169. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13170. END;
  13171. RETURN type;
  13172. END StaticMathArrayBaseType;
  13173. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13174. VAR size: LONGINT;
  13175. BEGIN
  13176. size := 1;
  13177. WHILE (IsStaticArray(type)) DO
  13178. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  13179. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13180. END;
  13181. RETURN size;
  13182. END StaticArrayNumElements;
  13183. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13184. VAR size: LONGINT;
  13185. BEGIN
  13186. size := 1;
  13187. WHILE (IsStaticMathArray(type)) DO
  13188. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  13189. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13190. END;
  13191. RETURN size;
  13192. END StaticMathArrayNumElements;
  13193. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13194. BEGIN
  13195. WHILE (IsStaticArray(type)) DO
  13196. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13197. END;
  13198. RETURN type;
  13199. END StaticArrayBaseType;
  13200. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13201. BEGIN
  13202. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  13203. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13204. END;
  13205. RETURN type;
  13206. END ArrayBaseType;
  13207. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  13208. BEGIN
  13209. IF type = NIL THEN RETURN FALSE END;
  13210. type := type.resolved;
  13211. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  13212. END IsDelegate;
  13213. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  13214. VAR i: LONGINT;
  13215. BEGIN
  13216. i := 0; type := type.resolved;
  13217. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13218. INC(i);
  13219. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  13220. END;
  13221. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13222. INC(i);
  13223. type := type(SyntaxTree.MathArrayType).arrayBase;
  13224. IF type # NIL THEN type := type.resolved END;
  13225. END;
  13226. RETURN i
  13227. END DynamicDim;
  13228. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13229. BEGIN
  13230. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13231. type := type(SyntaxTree.ArrayType).arrayBase;
  13232. END;
  13233. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13234. type := type(SyntaxTree.MathArrayType).arrayBase;
  13235. END;
  13236. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13237. END StaticSize;
  13238. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13239. BEGIN
  13240. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13241. END IsImmediate;
  13242. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13243. BEGIN
  13244. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13245. END IsAddress;
  13246. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13247. BEGIN
  13248. RETURN (x.mode = IntermediateCode.ModeRegister);
  13249. END IsRegister;
  13250. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13251. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13252. BEGIN
  13253. typeDeclaration := recordType.typeDeclaration;
  13254. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13255. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13256. END GetRecordTypeName;
  13257. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13258. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13259. BEGIN
  13260. parSize := 0;
  13261. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13262. parameter := procedureType.returnParameter;
  13263. INC(parSize,system.SizeOfParameter(parameter));
  13264. parSize := parSize + (-parSize) MOD system.addressSize;
  13265. END;
  13266. parameter :=procedureType.lastParameter;
  13267. WHILE (parameter # NIL) DO
  13268. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  13269. INC(parSize, system.addressSize);
  13270. ELSE
  13271. INC(parSize,system.SizeOfParameter(parameter));
  13272. parSize := parSize + (-parSize) MOD system.addressSize;
  13273. END;
  13274. parameter := parameter.prevParameter;
  13275. END;
  13276. IF procedureType.selfParameter # NIL THEN
  13277. parameter := procedureType.selfParameter;
  13278. INC(parSize,system.SizeOfParameter(parameter));
  13279. parSize := parSize + (-parSize) MOD system.addressSize;
  13280. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13281. END; (* method => self pointer *)
  13282. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13283. RETURN ToMemoryUnits(system,parSize)
  13284. END ParametersSize;
  13285. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13286. BEGIN
  13287. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13288. END IsNested;
  13289. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13290. BEGIN
  13291. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13292. scope := scope.outerScope;
  13293. END;
  13294. RETURN scope # NIL;
  13295. END InCellScope;
  13296. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13297. BEGIN
  13298. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  13299. END ProcedureParametersSize;
  13300. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13301. VAR dataUnit: LONGINT;
  13302. BEGIN dataUnit := system.dataUnit;
  13303. ASSERT(size MOD system.dataUnit = 0);
  13304. RETURN LONGINT(size DIV system.dataUnit)
  13305. END ToMemoryUnits;
  13306. PROCEDURE Get*(): Backend.Backend;
  13307. VAR backend: IntermediateBackend;
  13308. BEGIN NEW(backend); RETURN backend
  13309. END Get;
  13310. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13311. VAR instruction: IntermediateCode.Instruction;
  13312. BEGIN
  13313. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13314. RETURN instruction
  13315. END Nop;
  13316. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13317. VAR instruction: IntermediateCode.Instruction;
  13318. BEGIN
  13319. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13320. RETURN instruction
  13321. END Mov;
  13322. (* like Mov but ensures that no new register will be allocated for dest *)
  13323. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13324. VAR instruction: IntermediateCode.Instruction;
  13325. BEGIN
  13326. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13327. RETURN instruction
  13328. END MovReplace;
  13329. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13330. VAR instruction: IntermediateCode.Instruction;
  13331. BEGIN
  13332. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13333. RETURN instruction
  13334. END Conv;
  13335. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13336. VAR instruction: IntermediateCode.Instruction;
  13337. BEGIN
  13338. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13339. RETURN instruction
  13340. END Call;
  13341. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13342. VAR op1, op2, op3: IntermediateCode.Operand;
  13343. VAR instruction: IntermediateCode.Instruction;
  13344. BEGIN
  13345. IntermediateCode.InitNumber(op1,pcOffset);
  13346. IntermediateCode.InitNumber(op2,callingConvention);
  13347. IntermediateCode.InitNumber(op3,unwind);
  13348. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13349. RETURN instruction
  13350. END Exit;
  13351. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13352. VAR instruction: IntermediateCode.Instruction;
  13353. BEGIN
  13354. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13355. RETURN instruction
  13356. END Return;
  13357. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13358. VAR instruction: IntermediateCode.Instruction;
  13359. BEGIN
  13360. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13361. RETURN instruction
  13362. END Result;
  13363. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13364. VAR op1: IntermediateCode.Operand;
  13365. VAR instruction: IntermediateCode.Instruction;
  13366. BEGIN
  13367. IntermediateCode.InitNumber(op1,nr);
  13368. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13369. RETURN instruction
  13370. END Trap;
  13371. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13372. VAR instruction: IntermediateCode.Instruction;
  13373. BEGIN
  13374. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13375. RETURN instruction
  13376. END Br;
  13377. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13378. VAR instruction: IntermediateCode.Instruction;
  13379. BEGIN
  13380. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13381. RETURN instruction
  13382. END Breq;
  13383. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13384. VAR instruction: IntermediateCode.Instruction;
  13385. BEGIN
  13386. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13387. RETURN instruction
  13388. END Brne;
  13389. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13390. VAR instruction: IntermediateCode.Instruction;
  13391. BEGIN
  13392. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13393. RETURN instruction
  13394. END Brge;
  13395. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13396. VAR instruction: IntermediateCode.Instruction;
  13397. BEGIN
  13398. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13399. RETURN instruction
  13400. END Brlt;
  13401. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13402. VAR instruction: IntermediateCode.Instruction;
  13403. BEGIN
  13404. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13405. RETURN instruction
  13406. END Pop;
  13407. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13408. VAR instruction: IntermediateCode.Instruction;
  13409. BEGIN
  13410. ASSERT(op.mode # IntermediateCode.Undefined);
  13411. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13412. RETURN instruction
  13413. END Push;
  13414. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13415. VAR instruction: IntermediateCode.Instruction;
  13416. BEGIN
  13417. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13418. RETURN instruction
  13419. END Neg;
  13420. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13421. VAR instruction: IntermediateCode.Instruction;
  13422. BEGIN
  13423. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13424. RETURN instruction
  13425. END Not;
  13426. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13427. VAR instruction: IntermediateCode.Instruction;
  13428. BEGIN
  13429. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13430. RETURN instruction
  13431. END Abs;
  13432. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13433. VAR instruction: IntermediateCode.Instruction;
  13434. BEGIN
  13435. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13436. ASSERT(~IsImmediate(instruction.op1));
  13437. RETURN instruction
  13438. END Mul;
  13439. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13440. VAR instruction: IntermediateCode.Instruction;
  13441. BEGIN
  13442. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13443. RETURN instruction
  13444. END Div;
  13445. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13446. VAR instruction: IntermediateCode.Instruction;
  13447. BEGIN
  13448. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13449. RETURN instruction
  13450. END Mod;
  13451. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13452. VAR instruction: IntermediateCode.Instruction;
  13453. BEGIN
  13454. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13455. RETURN instruction
  13456. END Sub;
  13457. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13458. VAR instruction: IntermediateCode.Instruction;
  13459. BEGIN
  13460. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13461. RETURN instruction
  13462. END Add;
  13463. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13464. VAR instruction: IntermediateCode.Instruction;
  13465. BEGIN
  13466. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13467. RETURN instruction
  13468. END And;
  13469. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13470. VAR instruction: IntermediateCode.Instruction;
  13471. BEGIN
  13472. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13473. RETURN instruction
  13474. END Or;
  13475. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13476. VAR instruction: IntermediateCode.Instruction;
  13477. BEGIN
  13478. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13479. RETURN instruction
  13480. END Xor;
  13481. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13482. VAR instruction: IntermediateCode.Instruction;
  13483. BEGIN
  13484. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13485. RETURN instruction
  13486. END Shl;
  13487. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13488. VAR instruction: IntermediateCode.Instruction;
  13489. BEGIN
  13490. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13491. RETURN instruction
  13492. END Shr;
  13493. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13494. VAR instruction: IntermediateCode.Instruction;
  13495. BEGIN
  13496. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13497. RETURN instruction
  13498. END Rol;
  13499. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13500. VAR instruction: IntermediateCode.Instruction;
  13501. BEGIN
  13502. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13503. RETURN instruction
  13504. END Ror;
  13505. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13506. VAR instruction: IntermediateCode.Instruction;
  13507. BEGIN
  13508. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13509. RETURN instruction
  13510. END Cas;
  13511. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13512. VAR instruction: IntermediateCode.Instruction;
  13513. BEGIN
  13514. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  13515. ASSERT(~IntermediateCode.IsVectorRegister(src));
  13516. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13517. RETURN instruction
  13518. END Copy;
  13519. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13520. VAR instruction: IntermediateCode.Instruction;
  13521. BEGIN
  13522. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13523. RETURN instruction
  13524. END Fill;
  13525. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13526. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13527. BEGIN
  13528. string := IntermediateCode.String(s);
  13529. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13530. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13531. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13532. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13533. RETURN instruction
  13534. END Asm;
  13535. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13536. VAR instruction: IntermediateCode.Instruction;
  13537. BEGIN
  13538. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13539. RETURN instruction
  13540. END Data;
  13541. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13542. VAR instruction: IntermediateCode.Instruction;
  13543. BEGIN
  13544. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13545. IntermediateCode.SetSubType(instruction, subtype);
  13546. RETURN instruction
  13547. END SpecialInstruction;
  13548. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13549. VAR op1: IntermediateCode.Operand;
  13550. VAR instruction: IntermediateCode.Instruction;
  13551. BEGIN
  13552. (*! generate a warning if size exceeds a certain limit *)
  13553. (*
  13554. ASSERT(bytes < 1000000); (* sanity check *)
  13555. *)
  13556. ASSERT(0 <= units); (* sanity check *)
  13557. IntermediateCode.InitNumber(op1,units);
  13558. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13559. RETURN instruction
  13560. END Reserve;
  13561. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13562. VAR op1: IntermediateCode.Operand;
  13563. VAR instruction: IntermediateCode.Instruction;
  13564. BEGIN
  13565. IntermediateCode.InitNumber(op1,position.start);
  13566. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13567. RETURN instruction
  13568. END LabelInstruction;
  13569. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13570. VAR pc: LONGINT;
  13571. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13572. BEGIN
  13573. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13574. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13575. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13576. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13577. IF instr.op1.type.form = IntermediateCode.Float THEN
  13578. RETURN instr.op1.floatValue = op.floatValue
  13579. ELSE
  13580. RETURN instr.op1.intValue = op.intValue
  13581. END;
  13582. END ProvidesValue;
  13583. BEGIN
  13584. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13585. pc := 0;
  13586. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13587. INC(pc);
  13588. END;
  13589. IF pc = data.pc THEN
  13590. data.Emit(Data(Basic.invalidPosition,vop));
  13591. END;
  13592. RETURN pc
  13593. END EnterImmediate;
  13594. PROCEDURE Init;
  13595. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13596. BEGIN
  13597. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13598. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13599. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13600. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13601. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13602. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13603. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13604. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13605. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13606. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13607. IntermediateCode.InitOperand(emptyOperand);
  13608. FOR i := 0 TO NumberSystemCalls-1 DO
  13609. name := "@SystemCall";
  13610. Basic.AppendNumber(name,i);
  13611. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13612. END;
  13613. END Init;
  13614. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13615. BEGIN
  13616. RETURN (symbol # NIL) & symbol.NeedsSection();
  13617. END IsExported;
  13618. BEGIN
  13619. Init;
  13620. END FoxIntermediateBackend.
  13621. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  13622. # Release.Build --path="/temp/obg/" Win32 ~
  13623. # Linker.Link --fileFormat=PE32 --fileName=A2H.exe --extension=GofW --displacement=401000H Builtins Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection Loader BootConsole ~
  13624. FStols.CloseFiles A2Z.exe ~
  13625. System.FreeDownTo FoxIntermediateBackend ~
  13626. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  13627. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  13628. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13629. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13630. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13631. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13632. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  13633. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  13634. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13635. GenericLinker.Mod Loader.Mod BootConsole.Mod