2
0

FoxIntermediateBackend.Mod 614 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977397839793980398139823983398439853986398739883989399039913992399339943995399639973998399940004001400240034004400540064007400840094010401140124013401440154016401740184019402040214022402340244025402640274028402940304031403240334034403540364037403840394040404140424043404440454046404740484049405040514052405340544055405640574058405940604061406240634064406540664067406840694070407140724073407440754076407740784079408040814082408340844085408640874088408940904091409240934094409540964097409840994100410141024103410441054106410741084109411041114112411341144115411641174118411941204121412241234124412541264127412841294130413141324133413441354136413741384139414041414142414341444145414641474148414941504151415241534154415541564157415841594160416141624163416441654166416741684169417041714172417341744175417641774178417941804181418241834184418541864187418841894190419141924193419441954196419741984199420042014202420342044205420642074208420942104211421242134214421542164217421842194220422142224223422442254226422742284229423042314232423342344235423642374238423942404241424242434244424542464247424842494250425142524253425442554256425742584259426042614262426342644265426642674268426942704271427242734274427542764277427842794280428142824283428442854286428742884289429042914292429342944295429642974298429943004301430243034304430543064307430843094310431143124313431443154316431743184319432043214322432343244325432643274328432943304331433243334334433543364337433843394340434143424343434443454346434743484349435043514352435343544355435643574358435943604361436243634364436543664367436843694370437143724373437443754376437743784379438043814382438343844385438643874388438943904391439243934394439543964397439843994400440144024403440444054406440744084409441044114412441344144415441644174418441944204421442244234424442544264427442844294430443144324433443444354436443744384439444044414442444344444445444644474448444944504451445244534454445544564457445844594460446144624463446444654466446744684469447044714472447344744475447644774478447944804481448244834484448544864487448844894490449144924493449444954496449744984499450045014502450345044505450645074508450945104511451245134514451545164517451845194520452145224523452445254526452745284529453045314532453345344535453645374538453945404541454245434544454545464547454845494550455145524553455445554556455745584559456045614562456345644565456645674568456945704571457245734574457545764577457845794580458145824583458445854586458745884589459045914592459345944595459645974598459946004601460246034604460546064607460846094610461146124613461446154616461746184619462046214622462346244625462646274628462946304631463246334634463546364637463846394640464146424643464446454646464746484649465046514652465346544655465646574658465946604661466246634664466546664667466846694670467146724673467446754676467746784679468046814682468346844685468646874688468946904691469246934694469546964697469846994700470147024703470447054706470747084709471047114712471347144715471647174718471947204721472247234724472547264727472847294730473147324733473447354736473747384739474047414742474347444745474647474748474947504751475247534754475547564757475847594760476147624763476447654766476747684769477047714772477347744775477647774778477947804781478247834784478547864787478847894790479147924793479447954796479747984799480048014802480348044805480648074808480948104811481248134814481548164817481848194820482148224823482448254826482748284829483048314832483348344835483648374838483948404841484248434844484548464847484848494850485148524853485448554856485748584859486048614862486348644865486648674868486948704871487248734874487548764877487848794880488148824883488448854886488748884889489048914892489348944895489648974898489949004901490249034904490549064907490849094910491149124913491449154916491749184919492049214922492349244925492649274928492949304931493249334934493549364937493849394940494149424943494449454946494749484949495049514952495349544955495649574958495949604961496249634964496549664967496849694970497149724973497449754976497749784979498049814982498349844985498649874988498949904991499249934994499549964997499849995000500150025003500450055006500750085009501050115012501350145015501650175018501950205021502250235024502550265027502850295030503150325033503450355036503750385039504050415042504350445045504650475048504950505051505250535054505550565057505850595060506150625063506450655066506750685069507050715072507350745075507650775078507950805081508250835084508550865087508850895090509150925093509450955096509750985099510051015102510351045105510651075108510951105111511251135114511551165117511851195120512151225123512451255126512751285129513051315132513351345135513651375138513951405141514251435144514551465147514851495150515151525153515451555156515751585159516051615162516351645165516651675168516951705171517251735174517551765177517851795180518151825183518451855186518751885189519051915192519351945195519651975198519952005201520252035204520552065207520852095210521152125213521452155216521752185219522052215222522352245225522652275228522952305231523252335234523552365237523852395240524152425243524452455246524752485249525052515252525352545255525652575258525952605261526252635264526552665267526852695270527152725273527452755276527752785279528052815282528352845285528652875288528952905291529252935294529552965297529852995300530153025303530453055306530753085309531053115312531353145315531653175318531953205321532253235324532553265327532853295330533153325333533453355336533753385339534053415342534353445345534653475348534953505351535253535354535553565357535853595360536153625363536453655366536753685369537053715372537353745375537653775378537953805381538253835384538553865387538853895390539153925393539453955396539753985399540054015402540354045405540654075408540954105411541254135414541554165417541854195420542154225423542454255426542754285429543054315432543354345435543654375438543954405441544254435444544554465447544854495450545154525453545454555456545754585459546054615462546354645465546654675468546954705471547254735474547554765477547854795480548154825483548454855486548754885489549054915492549354945495549654975498549955005501550255035504550555065507550855095510551155125513551455155516551755185519552055215522552355245525552655275528552955305531553255335534553555365537553855395540554155425543554455455546554755485549555055515552555355545555555655575558555955605561556255635564556555665567556855695570557155725573557455755576557755785579558055815582558355845585558655875588558955905591559255935594559555965597559855995600560156025603560456055606560756085609561056115612561356145615561656175618561956205621562256235624562556265627562856295630563156325633563456355636563756385639564056415642564356445645564656475648564956505651565256535654565556565657565856595660566156625663566456655666566756685669567056715672567356745675567656775678567956805681568256835684568556865687568856895690569156925693569456955696569756985699570057015702570357045705570657075708570957105711571257135714571557165717571857195720572157225723572457255726572757285729573057315732573357345735573657375738573957405741574257435744574557465747574857495750575157525753575457555756575757585759576057615762576357645765576657675768576957705771577257735774577557765777577857795780578157825783578457855786578757885789579057915792579357945795579657975798579958005801580258035804580558065807580858095810581158125813581458155816581758185819582058215822582358245825582658275828582958305831583258335834583558365837583858395840584158425843584458455846584758485849585058515852585358545855585658575858585958605861586258635864586558665867586858695870587158725873587458755876587758785879588058815882588358845885588658875888588958905891589258935894589558965897589858995900590159025903590459055906590759085909591059115912591359145915591659175918591959205921592259235924592559265927592859295930593159325933593459355936593759385939594059415942594359445945594659475948594959505951595259535954595559565957595859595960596159625963596459655966596759685969597059715972597359745975597659775978597959805981598259835984598559865987598859895990599159925993599459955996599759985999600060016002600360046005600660076008600960106011601260136014601560166017601860196020602160226023602460256026602760286029603060316032603360346035603660376038603960406041604260436044604560466047604860496050605160526053605460556056605760586059606060616062606360646065606660676068606960706071607260736074607560766077607860796080608160826083608460856086608760886089609060916092609360946095609660976098609961006101610261036104610561066107610861096110611161126113611461156116611761186119612061216122612361246125612661276128612961306131613261336134613561366137613861396140614161426143614461456146614761486149615061516152615361546155615661576158615961606161616261636164616561666167616861696170617161726173617461756176617761786179618061816182618361846185618661876188618961906191619261936194619561966197619861996200620162026203620462056206620762086209621062116212621362146215621662176218621962206221622262236224622562266227622862296230623162326233623462356236623762386239624062416242624362446245624662476248624962506251625262536254625562566257625862596260626162626263626462656266626762686269627062716272627362746275627662776278627962806281628262836284628562866287628862896290629162926293629462956296629762986299630063016302630363046305630663076308630963106311631263136314631563166317631863196320632163226323632463256326632763286329633063316332633363346335633663376338633963406341634263436344634563466347634863496350635163526353635463556356635763586359636063616362636363646365636663676368636963706371637263736374637563766377637863796380638163826383638463856386638763886389639063916392639363946395639663976398639964006401640264036404640564066407640864096410641164126413641464156416641764186419642064216422642364246425642664276428642964306431643264336434643564366437643864396440644164426443644464456446644764486449645064516452645364546455645664576458645964606461646264636464646564666467646864696470647164726473647464756476647764786479648064816482648364846485648664876488648964906491649264936494649564966497649864996500650165026503650465056506650765086509651065116512651365146515651665176518651965206521652265236524652565266527652865296530653165326533653465356536653765386539654065416542654365446545654665476548654965506551655265536554655565566557655865596560656165626563656465656566656765686569657065716572657365746575657665776578657965806581658265836584658565866587658865896590659165926593659465956596659765986599660066016602660366046605660666076608660966106611661266136614661566166617661866196620662166226623662466256626662766286629663066316632663366346635663666376638663966406641664266436644664566466647664866496650665166526653665466556656665766586659666066616662666366646665666666676668666966706671667266736674667566766677667866796680668166826683668466856686668766886689669066916692669366946695669666976698669967006701670267036704670567066707670867096710671167126713671467156716671767186719672067216722672367246725672667276728672967306731673267336734673567366737673867396740674167426743674467456746674767486749675067516752675367546755675667576758675967606761676267636764676567666767676867696770677167726773677467756776677767786779678067816782678367846785678667876788678967906791679267936794679567966797679867996800680168026803680468056806680768086809681068116812681368146815681668176818681968206821682268236824682568266827682868296830683168326833683468356836683768386839684068416842684368446845684668476848684968506851685268536854685568566857685868596860686168626863686468656866686768686869687068716872687368746875687668776878687968806881688268836884688568866887688868896890689168926893689468956896689768986899690069016902690369046905690669076908690969106911691269136914691569166917691869196920692169226923692469256926692769286929693069316932693369346935693669376938693969406941694269436944694569466947694869496950695169526953695469556956695769586959696069616962696369646965696669676968696969706971697269736974697569766977697869796980698169826983698469856986698769886989699069916992699369946995699669976998699970007001700270037004700570067007700870097010701170127013701470157016701770187019702070217022702370247025702670277028702970307031703270337034703570367037703870397040704170427043704470457046704770487049705070517052705370547055705670577058705970607061706270637064706570667067706870697070707170727073707470757076707770787079708070817082708370847085708670877088708970907091709270937094709570967097709870997100710171027103710471057106710771087109711071117112711371147115711671177118711971207121712271237124712571267127712871297130713171327133713471357136713771387139714071417142714371447145714671477148714971507151715271537154715571567157715871597160716171627163716471657166716771687169717071717172717371747175717671777178717971807181718271837184718571867187718871897190719171927193719471957196719771987199720072017202720372047205720672077208720972107211721272137214721572167217721872197220722172227223722472257226722772287229723072317232723372347235723672377238723972407241724272437244724572467247724872497250725172527253725472557256725772587259726072617262726372647265726672677268726972707271727272737274727572767277727872797280728172827283728472857286728772887289729072917292729372947295729672977298729973007301730273037304730573067307730873097310731173127313731473157316731773187319732073217322732373247325732673277328732973307331733273337334733573367337733873397340734173427343734473457346734773487349735073517352735373547355735673577358735973607361736273637364736573667367736873697370737173727373737473757376737773787379738073817382738373847385738673877388738973907391739273937394739573967397739873997400740174027403740474057406740774087409741074117412741374147415741674177418741974207421742274237424742574267427742874297430743174327433743474357436743774387439744074417442744374447445744674477448744974507451745274537454745574567457745874597460746174627463746474657466746774687469747074717472747374747475747674777478747974807481748274837484748574867487748874897490749174927493749474957496749774987499750075017502750375047505750675077508750975107511751275137514751575167517751875197520752175227523752475257526752775287529753075317532753375347535753675377538753975407541754275437544754575467547754875497550755175527553755475557556755775587559756075617562756375647565756675677568756975707571757275737574757575767577757875797580758175827583758475857586758775887589759075917592759375947595759675977598759976007601760276037604760576067607760876097610761176127613761476157616761776187619762076217622762376247625762676277628762976307631763276337634763576367637763876397640764176427643764476457646764776487649765076517652765376547655765676577658765976607661766276637664766576667667766876697670767176727673767476757676767776787679768076817682768376847685768676877688768976907691769276937694769576967697769876997700770177027703770477057706770777087709771077117712771377147715771677177718771977207721772277237724772577267727772877297730773177327733773477357736773777387739774077417742774377447745774677477748774977507751775277537754775577567757775877597760776177627763776477657766776777687769777077717772777377747775777677777778777977807781778277837784778577867787778877897790779177927793779477957796779777987799780078017802780378047805780678077808780978107811781278137814781578167817781878197820782178227823782478257826782778287829783078317832783378347835783678377838783978407841784278437844784578467847784878497850785178527853785478557856785778587859786078617862786378647865786678677868786978707871787278737874787578767877787878797880788178827883788478857886788778887889789078917892789378947895789678977898789979007901790279037904790579067907790879097910791179127913791479157916791779187919792079217922792379247925792679277928792979307931793279337934793579367937793879397940794179427943794479457946794779487949795079517952795379547955795679577958795979607961796279637964796579667967796879697970797179727973797479757976797779787979798079817982798379847985798679877988798979907991799279937994799579967997799879998000800180028003800480058006800780088009801080118012801380148015801680178018801980208021802280238024802580268027802880298030803180328033803480358036803780388039804080418042804380448045804680478048804980508051805280538054805580568057805880598060806180628063806480658066806780688069807080718072807380748075807680778078807980808081808280838084808580868087808880898090809180928093809480958096809780988099810081018102810381048105810681078108810981108111811281138114811581168117811881198120812181228123812481258126812781288129813081318132813381348135813681378138813981408141814281438144814581468147814881498150815181528153815481558156815781588159816081618162816381648165816681678168816981708171817281738174817581768177817881798180818181828183818481858186818781888189819081918192819381948195819681978198819982008201820282038204820582068207820882098210821182128213821482158216821782188219822082218222822382248225822682278228822982308231823282338234823582368237823882398240824182428243824482458246824782488249825082518252825382548255825682578258825982608261826282638264826582668267826882698270827182728273827482758276827782788279828082818282828382848285828682878288828982908291829282938294829582968297829882998300830183028303830483058306830783088309831083118312831383148315831683178318831983208321832283238324832583268327832883298330833183328333833483358336833783388339834083418342834383448345834683478348834983508351835283538354835583568357835883598360836183628363836483658366836783688369837083718372837383748375837683778378837983808381838283838384838583868387838883898390839183928393839483958396839783988399840084018402840384048405840684078408840984108411841284138414841584168417841884198420842184228423842484258426842784288429843084318432843384348435843684378438843984408441844284438444844584468447844884498450845184528453845484558456845784588459846084618462846384648465846684678468846984708471847284738474847584768477847884798480848184828483848484858486848784888489849084918492849384948495849684978498849985008501850285038504850585068507850885098510851185128513851485158516851785188519852085218522852385248525852685278528852985308531853285338534853585368537853885398540854185428543854485458546854785488549855085518552855385548555855685578558855985608561856285638564856585668567856885698570857185728573857485758576857785788579858085818582858385848585858685878588858985908591859285938594859585968597859885998600860186028603860486058606860786088609861086118612861386148615861686178618861986208621862286238624862586268627862886298630863186328633863486358636863786388639864086418642864386448645864686478648864986508651865286538654865586568657865886598660866186628663866486658666866786688669867086718672867386748675867686778678867986808681868286838684868586868687868886898690869186928693869486958696869786988699870087018702870387048705870687078708870987108711871287138714871587168717871887198720872187228723872487258726872787288729873087318732873387348735873687378738873987408741874287438744874587468747874887498750875187528753875487558756875787588759876087618762876387648765876687678768876987708771877287738774877587768777877887798780878187828783878487858786878787888789879087918792879387948795879687978798879988008801880288038804880588068807880888098810881188128813881488158816881788188819882088218822882388248825882688278828882988308831883288338834883588368837883888398840884188428843884488458846884788488849885088518852885388548855885688578858885988608861886288638864886588668867886888698870887188728873887488758876887788788879888088818882888388848885888688878888888988908891889288938894889588968897889888998900890189028903890489058906890789088909891089118912891389148915891689178918891989208921892289238924892589268927892889298930893189328933893489358936893789388939894089418942894389448945894689478948894989508951895289538954895589568957895889598960896189628963896489658966896789688969897089718972897389748975897689778978897989808981898289838984898589868987898889898990899189928993899489958996899789988999900090019002900390049005900690079008900990109011901290139014901590169017901890199020902190229023902490259026902790289029903090319032903390349035903690379038903990409041904290439044904590469047904890499050905190529053905490559056905790589059906090619062906390649065906690679068906990709071907290739074907590769077907890799080908190829083908490859086908790889089909090919092909390949095909690979098909991009101910291039104910591069107910891099110911191129113911491159116911791189119912091219122912391249125912691279128912991309131913291339134913591369137913891399140914191429143914491459146914791489149915091519152915391549155915691579158915991609161916291639164916591669167916891699170917191729173917491759176917791789179918091819182918391849185918691879188918991909191919291939194919591969197919891999200920192029203920492059206920792089209921092119212921392149215921692179218921992209221922292239224922592269227922892299230923192329233923492359236923792389239924092419242924392449245924692479248924992509251925292539254925592569257925892599260926192629263926492659266926792689269927092719272927392749275927692779278927992809281928292839284928592869287928892899290929192929293929492959296929792989299930093019302930393049305930693079308930993109311931293139314931593169317931893199320932193229323932493259326932793289329933093319332933393349335933693379338933993409341934293439344934593469347934893499350935193529353935493559356935793589359936093619362936393649365936693679368936993709371937293739374937593769377937893799380938193829383938493859386938793889389939093919392939393949395939693979398939994009401940294039404940594069407940894099410941194129413941494159416941794189419942094219422942394249425942694279428942994309431943294339434943594369437943894399440944194429443944494459446944794489449945094519452945394549455945694579458945994609461946294639464946594669467946894699470947194729473947494759476947794789479948094819482948394849485948694879488948994909491949294939494949594969497949894999500950195029503950495059506950795089509951095119512951395149515951695179518951995209521952295239524952595269527952895299530953195329533953495359536953795389539954095419542954395449545954695479548954995509551955295539554955595569557955895599560956195629563956495659566956795689569957095719572957395749575957695779578957995809581958295839584958595869587958895899590959195929593959495959596959795989599960096019602960396049605960696079608960996109611961296139614961596169617961896199620962196229623962496259626962796289629963096319632963396349635963696379638963996409641964296439644964596469647964896499650965196529653965496559656965796589659966096619662966396649665966696679668966996709671967296739674967596769677967896799680968196829683968496859686968796889689969096919692969396949695969696979698969997009701970297039704970597069707970897099710971197129713971497159716971797189719972097219722972397249725972697279728972997309731973297339734973597369737973897399740974197429743974497459746974797489749975097519752975397549755975697579758975997609761976297639764976597669767976897699770977197729773977497759776977797789779978097819782978397849785978697879788978997909791979297939794979597969797979897999800980198029803980498059806980798089809981098119812981398149815981698179818981998209821982298239824982598269827982898299830983198329833983498359836983798389839984098419842984398449845984698479848984998509851985298539854985598569857985898599860986198629863986498659866986798689869987098719872987398749875987698779878987998809881988298839884988598869887988898899890989198929893989498959896989798989899990099019902990399049905990699079908990999109911991299139914991599169917991899199920992199229923992499259926992799289929993099319932993399349935993699379938993999409941994299439944994599469947994899499950995199529953995499559956995799589959996099619962996399649965996699679968996999709971997299739974997599769977997899799980998199829983998499859986998799889989999099919992999399949995999699979998999910000100011000210003100041000510006100071000810009100101001110012100131001410015100161001710018100191002010021100221002310024100251002610027100281002910030100311003210033100341003510036100371003810039100401004110042100431004410045100461004710048100491005010051100521005310054100551005610057100581005910060100611006210063100641006510066100671006810069100701007110072100731007410075100761007710078100791008010081100821008310084100851008610087100881008910090100911009210093100941009510096100971009810099101001010110102101031010410105101061010710108101091011010111101121011310114101151011610117101181011910120101211012210123101241012510126101271012810129101301013110132101331013410135101361013710138101391014010141101421014310144101451014610147101481014910150101511015210153101541015510156101571015810159101601016110162101631016410165101661016710168101691017010171101721017310174101751017610177101781017910180101811018210183101841018510186101871018810189101901019110192101931019410195101961019710198101991020010201102021020310204102051020610207102081020910210102111021210213102141021510216102171021810219102201022110222102231022410225102261022710228102291023010231102321023310234102351023610237102381023910240102411024210243102441024510246102471024810249102501025110252102531025410255102561025710258102591026010261102621026310264102651026610267102681026910270102711027210273102741027510276102771027810279102801028110282102831028410285102861028710288102891029010291102921029310294102951029610297102981029910300103011030210303103041030510306103071030810309103101031110312103131031410315103161031710318103191032010321103221032310324103251032610327103281032910330103311033210333103341033510336103371033810339103401034110342103431034410345103461034710348103491035010351103521035310354103551035610357103581035910360103611036210363103641036510366103671036810369103701037110372103731037410375103761037710378103791038010381103821038310384103851038610387103881038910390103911039210393103941039510396103971039810399104001040110402104031040410405104061040710408104091041010411104121041310414104151041610417104181041910420104211042210423104241042510426104271042810429104301043110432104331043410435104361043710438104391044010441104421044310444104451044610447104481044910450104511045210453104541045510456104571045810459104601046110462104631046410465104661046710468104691047010471104721047310474104751047610477104781047910480104811048210483104841048510486104871048810489104901049110492104931049410495104961049710498104991050010501105021050310504105051050610507105081050910510105111051210513105141051510516105171051810519105201052110522105231052410525105261052710528105291053010531105321053310534105351053610537105381053910540105411054210543105441054510546105471054810549105501055110552105531055410555105561055710558105591056010561105621056310564105651056610567105681056910570105711057210573105741057510576105771057810579105801058110582105831058410585105861058710588105891059010591105921059310594105951059610597105981059910600106011060210603106041060510606106071060810609106101061110612106131061410615106161061710618106191062010621106221062310624106251062610627106281062910630106311063210633106341063510636106371063810639106401064110642106431064410645106461064710648106491065010651106521065310654106551065610657106581065910660106611066210663106641066510666106671066810669106701067110672106731067410675106761067710678106791068010681106821068310684106851068610687106881068910690106911069210693106941069510696106971069810699107001070110702107031070410705107061070710708107091071010711107121071310714107151071610717107181071910720107211072210723107241072510726107271072810729107301073110732107331073410735107361073710738107391074010741107421074310744107451074610747107481074910750107511075210753107541075510756107571075810759107601076110762107631076410765107661076710768107691077010771107721077310774107751077610777107781077910780107811078210783107841078510786107871078810789107901079110792107931079410795107961079710798107991080010801108021080310804108051080610807108081080910810108111081210813108141081510816108171081810819108201082110822108231082410825108261082710828108291083010831108321083310834108351083610837108381083910840108411084210843108441084510846108471084810849108501085110852108531085410855108561085710858108591086010861108621086310864108651086610867108681086910870108711087210873108741087510876108771087810879108801088110882108831088410885108861088710888108891089010891108921089310894108951089610897108981089910900109011090210903109041090510906109071090810909109101091110912109131091410915109161091710918109191092010921109221092310924109251092610927109281092910930109311093210933109341093510936109371093810939109401094110942109431094410945109461094710948109491095010951109521095310954109551095610957109581095910960109611096210963109641096510966109671096810969109701097110972109731097410975109761097710978109791098010981109821098310984109851098610987109881098910990109911099210993109941099510996109971099810999110001100111002110031100411005110061100711008110091101011011110121101311014110151101611017110181101911020110211102211023110241102511026110271102811029110301103111032110331103411035110361103711038110391104011041110421104311044110451104611047110481104911050110511105211053110541105511056110571105811059110601106111062110631106411065110661106711068110691107011071110721107311074110751107611077110781107911080110811108211083110841108511086110871108811089110901109111092110931109411095110961109711098110991110011101111021110311104111051110611107111081110911110111111111211113111141111511116111171111811119111201112111122111231112411125111261112711128111291113011131111321113311134111351113611137111381113911140111411114211143111441114511146111471114811149111501115111152111531115411155111561115711158111591116011161111621116311164111651116611167111681116911170111711117211173111741117511176111771117811179111801118111182111831118411185111861118711188111891119011191111921119311194111951119611197111981119911200112011120211203112041120511206112071120811209112101121111212112131121411215112161121711218112191122011221112221122311224112251122611227112281122911230112311123211233112341123511236112371123811239112401124111242112431124411245112461124711248112491125011251112521125311254112551125611257112581125911260112611126211263112641126511266112671126811269112701127111272112731127411275112761127711278112791128011281112821128311284112851128611287112881128911290112911129211293112941129511296112971129811299113001130111302113031130411305113061130711308113091131011311113121131311314113151131611317113181131911320113211132211323113241132511326113271132811329113301133111332113331133411335113361133711338113391134011341113421134311344113451134611347113481134911350113511135211353113541135511356113571135811359113601136111362113631136411365113661136711368113691137011371113721137311374113751137611377113781137911380113811138211383113841138511386113871138811389113901139111392113931139411395113961139711398113991140011401114021140311404114051140611407114081140911410114111141211413114141141511416114171141811419114201142111422114231142411425114261142711428114291143011431114321143311434114351143611437114381143911440114411144211443114441144511446114471144811449114501145111452114531145411455114561145711458114591146011461114621146311464114651146611467114681146911470114711147211473114741147511476114771147811479114801148111482114831148411485114861148711488114891149011491114921149311494114951149611497114981149911500115011150211503115041150511506115071150811509115101151111512115131151411515115161151711518115191152011521115221152311524115251152611527115281152911530115311153211533115341153511536115371153811539115401154111542115431154411545115461154711548115491155011551115521155311554115551155611557115581155911560115611156211563115641156511566115671156811569115701157111572115731157411575115761157711578115791158011581115821158311584115851158611587115881158911590115911159211593115941159511596115971159811599116001160111602116031160411605116061160711608116091161011611116121161311614116151161611617116181161911620116211162211623116241162511626116271162811629116301163111632116331163411635116361163711638116391164011641116421164311644116451164611647116481164911650116511165211653116541165511656116571165811659116601166111662116631166411665116661166711668116691167011671116721167311674116751167611677116781167911680116811168211683116841168511686116871168811689116901169111692116931169411695116961169711698116991170011701117021170311704117051170611707117081170911710117111171211713117141171511716117171171811719117201172111722117231172411725117261172711728117291173011731117321173311734117351173611737117381173911740117411174211743117441174511746117471174811749117501175111752117531175411755117561175711758117591176011761117621176311764117651176611767117681176911770117711177211773117741177511776117771177811779117801178111782117831178411785117861178711788117891179011791117921179311794117951179611797117981179911800118011180211803118041180511806118071180811809118101181111812118131181411815118161181711818118191182011821118221182311824118251182611827118281182911830118311183211833118341183511836118371183811839118401184111842118431184411845118461184711848118491185011851118521185311854118551185611857118581185911860118611186211863118641186511866118671186811869118701187111872118731187411875118761187711878118791188011881118821188311884118851188611887118881188911890118911189211893118941189511896118971189811899119001190111902119031190411905119061190711908119091191011911119121191311914119151191611917119181191911920119211192211923119241192511926119271192811929119301193111932119331193411935119361193711938119391194011941119421194311944119451194611947119481194911950119511195211953119541195511956119571195811959119601196111962119631196411965119661196711968119691197011971119721197311974119751197611977119781197911980119811198211983119841198511986119871198811989119901199111992119931199411995119961199711998119991200012001120021200312004120051200612007120081200912010120111201212013120141201512016120171201812019120201202112022120231202412025120261202712028120291203012031120321203312034120351203612037120381203912040120411204212043120441204512046120471204812049120501205112052120531205412055120561205712058120591206012061120621206312064120651206612067120681206912070120711207212073120741207512076120771207812079120801208112082120831208412085120861208712088120891209012091120921209312094120951209612097120981209912100121011210212103121041210512106121071210812109121101211112112121131211412115121161211712118121191212012121121221212312124121251212612127121281212912130121311213212133121341213512136121371213812139121401214112142121431214412145121461214712148121491215012151121521215312154121551215612157121581215912160121611216212163121641216512166121671216812169121701217112172121731217412175121761217712178121791218012181121821218312184121851218612187121881218912190121911219212193121941219512196121971219812199122001220112202122031220412205122061220712208122091221012211122121221312214122151221612217122181221912220122211222212223122241222512226122271222812229122301223112232122331223412235122361223712238122391224012241122421224312244122451224612247122481224912250122511225212253122541225512256122571225812259122601226112262122631226412265122661226712268122691227012271122721227312274122751227612277122781227912280122811228212283122841228512286122871228812289122901229112292122931229412295122961229712298122991230012301123021230312304123051230612307123081230912310123111231212313123141231512316123171231812319123201232112322123231232412325123261232712328123291233012331123321233312334123351233612337123381233912340123411234212343123441234512346123471234812349123501235112352123531235412355123561235712358123591236012361123621236312364123651236612367123681236912370123711237212373123741237512376123771237812379123801238112382123831238412385123861238712388123891239012391123921239312394123951239612397123981239912400124011240212403124041240512406124071240812409124101241112412124131241412415124161241712418124191242012421124221242312424124251242612427124281242912430124311243212433124341243512436124371243812439124401244112442124431244412445124461244712448124491245012451124521245312454124551245612457124581245912460124611246212463124641246512466124671246812469124701247112472124731247412475124761247712478124791248012481124821248312484124851248612487124881248912490124911249212493124941249512496124971249812499125001250112502125031250412505125061250712508125091251012511125121251312514125151251612517125181251912520125211252212523125241252512526125271252812529125301253112532125331253412535125361253712538125391254012541125421254312544125451254612547125481254912550125511255212553125541255512556125571255812559125601256112562125631256412565125661256712568125691257012571125721257312574125751257612577125781257912580125811258212583125841258512586125871258812589125901259112592125931259412595125961259712598125991260012601126021260312604126051260612607126081260912610126111261212613126141261512616126171261812619126201262112622126231262412625126261262712628126291263012631126321263312634126351263612637126381263912640126411264212643126441264512646126471264812649126501265112652126531265412655126561265712658126591266012661126621266312664126651266612667126681266912670126711267212673126741267512676126771267812679126801268112682126831268412685126861268712688126891269012691126921269312694126951269612697126981269912700127011270212703127041270512706127071270812709127101271112712127131271412715127161271712718127191272012721127221272312724127251272612727127281272912730127311273212733127341273512736127371273812739127401274112742127431274412745127461274712748127491275012751127521275312754127551275612757127581275912760127611276212763127641276512766127671276812769127701277112772127731277412775127761277712778127791278012781127821278312784127851278612787127881278912790127911279212793127941279512796127971279812799128001280112802128031280412805128061280712808128091281012811128121281312814128151281612817128181281912820128211282212823128241282512826128271282812829128301283112832128331283412835128361283712838128391284012841128421284312844128451284612847128481284912850128511285212853128541285512856128571285812859128601286112862128631286412865128661286712868128691287012871128721287312874128751287612877128781287912880128811288212883128841288512886128871288812889128901289112892128931289412895128961289712898128991290012901129021290312904129051290612907129081290912910129111291212913129141291512916129171291812919129201292112922129231292412925129261292712928129291293012931129321293312934129351293612937129381293912940129411294212943129441294512946129471294812949129501295112952129531295412955129561295712958129591296012961129621296312964129651296612967129681296912970129711297212973129741297512976129771297812979129801298112982129831298412985129861298712988129891299012991129921299312994129951299612997129981299913000130011300213003130041300513006130071300813009130101301113012130131301413015130161301713018130191302013021130221302313024130251302613027130281302913030130311303213033130341303513036130371303813039130401304113042130431304413045130461304713048130491305013051130521305313054130551305613057130581305913060130611306213063130641306513066130671306813069130701307113072130731307413075130761307713078130791308013081130821308313084130851308613087130881308913090130911309213093130941309513096130971309813099131001310113102131031310413105131061310713108131091311013111131121311313114131151311613117131181311913120131211312213123131241312513126131271312813129131301313113132131331313413135131361313713138131391314013141131421314313144131451314613147131481314913150131511315213153131541315513156131571315813159131601316113162131631316413165131661316713168131691317013171131721317313174131751317613177131781317913180131811318213183131841318513186131871318813189131901319113192131931319413195131961319713198131991320013201132021320313204132051320613207132081320913210132111321213213132141321513216132171321813219132201322113222132231322413225132261322713228132291323013231132321323313234132351323613237132381323913240132411324213243132441324513246132471324813249132501325113252132531325413255132561325713258132591326013261132621326313264132651326613267132681326913270132711327213273132741327513276132771327813279132801328113282132831328413285132861328713288132891329013291132921329313294132951329613297132981329913300133011330213303133041330513306133071330813309133101331113312133131331413315133161331713318133191332013321133221332313324133251332613327133281332913330133311333213333133341333513336133371333813339133401334113342133431334413345133461334713348133491335013351133521335313354133551335613357133581335913360133611336213363133641336513366133671336813369133701337113372133731337413375133761337713378133791338013381133821338313384133851338613387133881338913390133911339213393133941339513396133971339813399134001340113402134031340413405134061340713408134091341013411134121341313414134151341613417134181341913420134211342213423134241342513426134271342813429134301343113432134331343413435134361343713438134391344013441134421344313444134451344613447134481344913450134511345213453134541345513456134571345813459134601346113462134631346413465134661346713468134691347013471134721347313474134751347613477134781347913480134811348213483134841348513486134871348813489134901349113492134931349413495134961349713498134991350013501135021350313504135051350613507135081350913510135111351213513135141351513516135171351813519135201352113522135231352413525135261352713528135291353013531135321353313534135351353613537135381353913540135411354213543135441354513546135471354813549135501355113552135531355413555135561355713558135591356013561135621356313564135651356613567135681356913570135711357213573135741357513576135771357813579135801358113582135831358413585135861358713588135891359013591135921359313594135951359613597135981359913600136011360213603136041360513606136071360813609136101361113612136131361413615136161361713618136191362013621136221362313624136251362613627136281362913630136311363213633136341363513636136371363813639136401364113642136431364413645136461364713648136491365013651136521365313654136551365613657136581365913660136611366213663136641366513666136671366813669136701367113672136731367413675136761367713678136791368013681136821368313684136851368613687136881368913690136911369213693136941369513696136971369813699137001370113702137031370413705137061370713708137091371013711137121371313714137151371613717137181371913720137211372213723137241372513726137271372813729137301373113732137331373413735137361373713738137391374013741137421374313744137451374613747137481374913750137511375213753137541375513756137571375813759137601376113762137631376413765137661376713768137691377013771137721377313774137751377613777137781377913780137811378213783137841378513786137871378813789137901379113792137931379413795137961379713798137991380013801138021380313804138051380613807138081380913810138111381213813138141381513816138171381813819138201382113822138231382413825138261382713828138291383013831138321383313834138351383613837138381383913840138411384213843138441384513846138471384813849138501385113852138531385413855138561385713858138591386013861138621386313864138651386613867138681386913870138711387213873138741387513876138771387813879138801388113882138831388413885138861388713888138891389013891138921389313894138951389613897138981389913900139011390213903139041390513906139071390813909139101391113912139131391413915139161391713918139191392013921139221392313924139251392613927139281392913930139311393213933139341393513936139371393813939139401394113942139431394413945139461394713948139491395013951139521395313954139551395613957139581395913960139611396213963139641396513966139671396813969139701397113972139731397413975139761397713978139791398013981139821398313984139851398613987139881398913990139911399213993139941399513996139971399813999140001400114002140031400414005140061400714008140091401014011140121401314014140151401614017140181401914020140211402214023140241402514026140271402814029140301403114032140331403414035140361403714038140391404014041140421404314044140451404614047140481404914050140511405214053140541405514056140571405814059140601406114062140631406414065140661406714068140691407014071140721407314074140751407614077140781407914080140811408214083140841408514086140871408814089140901409114092140931409414095140961409714098140991410014101141021410314104141051410614107141081410914110141111411214113141141411514116141171411814119141201412114122141231412414125141261412714128141291413014131141321413314134141351413614137141381413914140141411414214143141441414514146141471414814149141501415114152141531415414155141561415714158141591416014161141621416314164141651416614167141681416914170141711417214173141741417514176141771417814179141801418114182141831418414185141861418714188141891419014191141921419314194141951419614197141981419914200142011420214203142041420514206142071420814209142101421114212142131421414215142161421714218142191422014221142221422314224142251422614227142281422914230142311423214233142341423514236142371423814239142401424114242142431424414245142461424714248142491425014251142521425314254142551425614257142581425914260142611426214263142641426514266142671426814269142701427114272142731427414275142761427714278142791428014281142821428314284142851428614287142881428914290142911429214293142941429514296142971429814299143001430114302143031430414305143061430714308143091431014311143121431314314143151431614317143181431914320143211432214323143241432514326143271432814329143301433114332143331433414335143361433714338143391434014341143421434314344143451434614347143481434914350143511435214353143541435514356143571435814359143601436114362143631436414365143661436714368143691437014371143721437314374143751437614377143781437914380143811438214383143841438514386143871438814389143901439114392143931439414395143961439714398143991440014401144021440314404144051440614407144081440914410144111441214413144141441514416144171441814419144201442114422144231442414425144261442714428144291443014431144321443314434144351443614437144381443914440144411444214443144441444514446144471444814449144501445114452144531445414455144561445714458144591446014461144621446314464144651446614467144681446914470144711447214473144741447514476144771447814479144801448114482144831448414485144861448714488144891449014491144921449314494144951449614497144981449914500145011450214503145041450514506145071450814509145101451114512145131451414515145161451714518145191452014521145221452314524145251452614527145281452914530145311453214533145341453514536145371453814539145401454114542145431454414545145461454714548145491455014551145521455314554145551455614557145581455914560145611456214563145641456514566145671456814569145701457114572145731457414575145761457714578145791458014581145821458314584145851458614587145881458914590145911459214593145941459514596145971459814599146001460114602146031460414605146061460714608146091461014611146121461314614146151461614617146181461914620146211462214623146241462514626146271462814629146301463114632146331463414635146361463714638146391464014641146421464314644146451464614647146481464914650146511465214653146541465514656146571465814659146601466114662146631466414665146661466714668146691467014671146721467314674146751467614677146781467914680146811468214683146841468514686146871468814689146901469114692146931469414695146961469714698146991470014701147021470314704147051470614707147081470914710147111471214713147141471514716147171471814719147201472114722147231472414725147261472714728147291473014731147321473314734147351473614737147381473914740147411474214743147441474514746147471474814749147501475114752147531475414755147561475714758147591476014761147621476314764147651476614767147681476914770147711477214773147741477514776147771477814779147801478114782147831478414785147861478714788147891479014791147921479314794147951479614797147981479914800148011480214803148041480514806148071480814809148101481114812148131481414815148161481714818148191482014821148221482314824148251482614827148281482914830148311483214833148341483514836148371483814839148401484114842148431484414845148461484714848148491485014851148521485314854148551485614857148581485914860148611486214863148641486514866148671486814869148701487114872148731487414875148761487714878148791488014881148821488314884148851488614887148881488914890148911489214893148941489514896148971489814899149001490114902149031490414905149061490714908149091491014911149121491314914149151491614917149181491914920149211492214923149241492514926149271492814929149301493114932149331493414935149361493714938149391494014941149421494314944149451494614947149481494914950149511495214953149541495514956149571495814959149601496114962149631496414965149661496714968149691497014971149721497314974149751497614977149781497914980149811498214983149841498514986149871498814989149901499114992149931499414995149961499714998149991500015001150021500315004150051500615007150081500915010150111501215013150141501515016150171501815019150201502115022150231502415025150261502715028150291503015031150321503315034150351503615037150381503915040150411504215043150441504515046150471504815049150501505115052150531505415055150561505715058150591506015061150621506315064150651506615067150681506915070150711507215073150741507515076150771507815079150801508115082150831508415085150861508715088150891509015091150921509315094150951509615097150981509915100151011510215103151041510515106151071510815109151101511115112151131511415115151161511715118151191512015121151221512315124151251512615127151281512915130151311513215133151341513515136151371513815139151401514115142151431514415145151461514715148151491515015151151521515315154151551515615157151581515915160151611516215163151641516515166151671516815169151701517115172151731517415175151761517715178151791518015181151821518315184151851518615187151881518915190151911519215193151941519515196151971519815199152001520115202152031520415205152061520715208152091521015211152121521315214152151521615217152181521915220152211522215223152241522515226152271522815229152301523115232152331523415235152361523715238152391524015241152421524315244152451524615247152481524915250152511525215253152541525515256152571525815259152601526115262152631526415265152661526715268152691527015271152721527315274152751527615277152781527915280152811528215283152841528515286152871528815289152901529115292152931529415295152961529715298152991530015301153021530315304153051530615307153081530915310153111531215313153141531515316153171531815319153201532115322153231532415325153261532715328153291533015331153321533315334153351533615337153381533915340153411534215343153441534515346153471534815349153501535115352153531535415355153561535715358153591536015361153621536315364153651536615367153681536915370153711537215373153741537515376153771537815379153801538115382153831538415385153861538715388153891539015391153921539315394153951539615397153981539915400154011540215403154041540515406154071540815409154101541115412154131541415415154161541715418154191542015421154221542315424154251542615427154281542915430154311543215433154341543515436154371543815439154401544115442154431544415445154461544715448154491545015451154521545315454154551545615457154581545915460154611546215463154641546515466154671546815469154701547115472154731547415475154761547715478154791548015481154821548315484154851548615487154881548915490154911549215493154941549515496154971549815499155001550115502155031550415505155061550715508155091551015511155121551315514155151551615517155181551915520155211552215523155241552515526155271552815529155301553115532155331553415535155361553715538155391554015541155421554315544155451554615547155481554915550155511555215553155541555515556155571555815559155601556115562155631556415565155661556715568155691557015571155721557315574155751557615577155781557915580155811558215583155841558515586155871558815589155901559115592155931559415595155961559715598155991560015601156021560315604156051560615607156081560915610156111561215613156141561515616156171561815619156201562115622156231562415625156261562715628156291563015631156321563315634156351563615637156381563915640156411564215643156441564515646156471564815649156501565115652156531565415655156561565715658156591566015661156621566315664156651566615667156681566915670156711567215673156741567515676156771567815679156801568115682156831568415685156861568715688156891569015691156921569315694156951569615697156981569915700157011570215703157041570515706157071570815709157101571115712157131571415715157161571715718157191572015721157221572315724157251572615727157281572915730157311573215733157341573515736157371573815739157401574115742157431574415745157461574715748157491575015751157521575315754157551575615757157581575915760157611576215763157641576515766157671576815769157701577115772157731577415775157761577715778157791578015781157821578315784157851578615787157881578915790157911579215793157941579515796157971579815799158001580115802158031580415805158061580715808158091581015811158121581315814158151581615817158181581915820158211582215823158241582515826158271582815829158301583115832
  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. WriteBackCall = POINTER TO RECORD
  98. call: SyntaxTree.ProcedureCallDesignator;
  99. next: WriteBackCall;
  100. END;
  101. Operand = RECORD
  102. mode: SHORTINT;
  103. op: IntermediateCode.Operand;
  104. tag: IntermediateCode.Operand;
  105. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  106. dimOffset: LONGINT;
  107. availability: WORD; (* index *)
  108. END;
  109. Fixup= POINTER TO RECORD
  110. pc: LONGINT;
  111. nextFixup: Fixup;
  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. (*
  677. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  678. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  679. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  680. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  681. ir.EmitAt(pc,Push(size));
  682. implementationVisitor.StaticCallOperand(result,procedure);
  683. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  684. END;
  685. *)
  686. END;
  687. *)
  688. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  689. IF stackSize > 0 THEN
  690. IF (stackSize MOD system.addressSize = 0) THEN
  691. null := IntermediateCode.Immediate(addressType,0);
  692. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  693. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  694. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  695. ELSE
  696. null := IntermediateCode.Immediate(int8,0);
  697. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  698. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  699. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  700. END;
  701. (*! should potentially be called by backend -- enter might initialize
  702. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  703. *)
  704. END;
  705. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  706. parametersSize := ProcedureParametersSize(backend.system,x);
  707. ELSE
  708. parametersSize := 0;
  709. END;
  710. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  711. finalizer := FALSE;
  712. IF backend.cooperative & x.isFinalizer THEN
  713. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  714. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  715. GetRecordTypeName(recordType,name);
  716. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  717. END;
  718. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  719. IF backend.cooperative THEN
  720. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  721. IF implementationVisitor.profile & ~isModuleBody THEN
  722. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  723. END;
  724. ELSE
  725. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  726. END;
  727. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  728. IF finalizer THEN
  729. IF backend.hasLinkRegister THEN
  730. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  731. END;
  732. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  733. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  734. ir.Emit(Br(x.position,dest));
  735. ELSE
  736. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  737. END;
  738. ELSE
  739. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  740. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  741. END;
  742. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  743. IF backend.cooperative THEN
  744. IF HasPointers (scope) THEN
  745. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  746. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  747. ir.Emit(Result(x.position, res));
  748. ir.Emit(Push(x.position, res));
  749. implementationVisitor.ResetVariables(scope);
  750. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  751. ir.Emit(Pop(x.position, res));
  752. ir.Emit(Return(x.position, res));
  753. ELSE
  754. implementationVisitor.ResetVariables(scope);
  755. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  756. END;
  757. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  758. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  759. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  760. ir.Emit(Result(x.position, res));
  761. ir.Emit(Push(x.position, res));
  762. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  763. ir.Emit(Pop(x.position, res));
  764. ir.Emit(Return(x.position, res));
  765. ELSE
  766. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  767. END;
  768. END;
  769. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  770. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  771. ELSE
  772. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  773. ir.Emit(Nop(x.position));
  774. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  775. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  776. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  777. END;
  778. END;
  779. END
  780. ELSIF ~inline THEN
  781. ir.Emit(Nop(x.position)); (* jump label *)
  782. END;
  783. ELSE (* force body for procedures *)
  784. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0);
  785. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  786. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  787. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  788. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  789. END;
  790. Scope(scope);
  791. Signature;
  792. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  793. currentScope := prevScope;
  794. END Procedure;
  795. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  796. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  797. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  798. BEGIN
  799. ASSERT (bodyProcedure # NIL);
  800. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  801. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  802. procedure.SetScope(bodyProcedure.scope);
  803. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  804. procedure.SetAccess(SyntaxTree.Hidden);
  805. Global.GetSymbolSegmentedName (procedure,name);
  806. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  807. ir.SetExported(TRUE);
  808. Global.GetSymbolSegmentedName (bodyProcedure,name);
  809. IF ~meta.simple THEN
  810. implementationVisitor.currentScope := module.module.moduleScope;
  811. implementationVisitor.section := ir;
  812. implementationVisitor.PushSelfPointer();
  813. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  814. ELSIF backend.preregisterStatic THEN
  815. implementationVisitor.currentScope := module.module.moduleScope;
  816. implementationVisitor.section := ir;
  817. implementationVisitor.PushSelfPointer();
  818. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  819. ELSE
  820. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  821. ir.Emit(Call(bodyProcedure.position,op, 0));
  822. END;
  823. END AddBodyCallStub;
  824. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  825. VAR name: Basic.SegmentedName;
  826. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  827. BEGIN
  828. Global.GetSymbolSegmentedName (symbol,name);
  829. Basic.RemoveSuffix(name);
  830. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  831. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  832. ir.SetExported(TRUE);
  833. IntermediateCode.InitImmediate(op,addressType,initStack);
  834. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  835. END AddStackAllocation;
  836. (** entry function to visit a complete module *)
  837. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  838. VAR
  839. name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  840. hasDynamicOperatorDeclarations: BOOLEAN;
  841. operator: SyntaxTree.Operator;
  842. import: SyntaxTree.Import;
  843. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  844. BEGIN
  845. type := type.resolved;
  846. IF type IS SyntaxTree.RecordType THEN
  847. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  848. ELSIF (type IS SyntaxTree.ArrayType) THEN
  849. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  850. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  851. END;
  852. ELSIF type IS SyntaxTree.MathArrayType THEN
  853. WITH type: SyntaxTree.MathArrayType DO
  854. IF type.form = SyntaxTree.Open THEN
  855. RETURN TRUE
  856. ELSIF type.form = SyntaxTree.Static THEN
  857. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  858. END;
  859. END;
  860. END;
  861. RETURN FALSE
  862. END TypeNeedsInitialization;
  863. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  864. VAR variable: SyntaxTree.Variable;
  865. BEGIN
  866. variable := scope.firstVariable;
  867. WHILE variable # NIL DO
  868. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  869. IF variable.initializer # NIL THEN RETURN TRUE END;
  870. variable := variable.nextVariable;
  871. END;
  872. RETURN FALSE
  873. END ScopeNeedsInitialization;
  874. BEGIN
  875. ASSERT(x # NIL); ASSERT(module # NIL);
  876. SELF.module := module;
  877. (* add import names to the generated Sections.Module *)
  878. import := x.moduleScope.firstImport;
  879. WHILE import # NIL DO
  880. import.module.GetName(idstr);
  881. module.imports.AddName(idstr);
  882. import := import.nextImport
  883. END;
  884. implementationVisitor.module := module;
  885. implementationVisitor.moduleScope := x.moduleScope;
  886. implementationVisitor.moduleSelf := moduleSelf;
  887. implementationVisitor.canBeLoaded := TRUE;
  888. meta.SetModule(module);
  889. IF (forceModuleBody OR ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  890. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  891. END;
  892. IF backend.profile THEN
  893. EnsureBodyProcedure(x.moduleScope);
  894. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  895. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  896. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  897. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  898. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  899. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0);
  900. Global.GetModuleName(module.module,idstr);
  901. implementationVisitor.ProfilerAddModule(idstr);
  902. implementationVisitor.numberProcedures := 0;
  903. END;
  904. implementationVisitor.profile := backend.profile;
  905. (* check if there is at least one dynamic operator locally defined *)
  906. hasDynamicOperatorDeclarations := FALSE;
  907. operator := x.moduleScope.firstOperator;
  908. WHILE operator # NIL DO
  909. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  910. operator := operator.nextOperator
  911. END;
  912. (* add operator initialization code section *)
  913. IF hasDynamicOperatorDeclarations THEN
  914. EnsureBodyProcedure(x.moduleScope);
  915. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  916. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  917. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0);
  918. END;
  919. Scope(x.moduleScope);
  920. IF hasDynamicOperatorDeclarations THEN
  921. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  922. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  923. END;
  924. IF backend.profile THEN
  925. implementationVisitor.ProfilerPatchInit;
  926. END;
  927. END Module;
  928. END DeclarationVisitor;
  929. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  930. RegisterUsageCount*=OBJECT
  931. VAR used: UsedArray; count: LONGINT;
  932. PROCEDURE &Init;
  933. VAR i: LONGINT;
  934. BEGIN
  935. count := 0;
  936. IF used = NIL THEN NEW(used,64); END;
  937. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  938. END Init;
  939. PROCEDURE Grow;
  940. VAR new: UsedArray; size,i: LONGINT;
  941. BEGIN
  942. size := LEN(used)*2;
  943. NEW(new,size);
  944. FOR i := 0 TO LEN(used)-1 DO
  945. new[i].count := used[i].count;
  946. new[i].type := used[i].type;
  947. new[i].map := used[i].map
  948. END;
  949. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  950. used := new
  951. END Grow;
  952. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  953. BEGIN
  954. INC(count);
  955. IF count = LEN(used) THEN Grow END;
  956. used[count].type := type;
  957. used[count].class := class;
  958. used[count].map := count;
  959. RETURN count;
  960. END Next;
  961. PROCEDURE IncUse(register: LONGINT);
  962. BEGIN
  963. INC(used[register].count);
  964. (*
  965. IF (register = 1) & (count > 30) THEN
  966. D.TraceBack;
  967. END;
  968. *)
  969. END IncUse;
  970. PROCEDURE DecUse(register: LONGINT);
  971. BEGIN
  972. DEC(used[register].count);
  973. END DecUse;
  974. PROCEDURE Map(register: LONGINT): LONGINT;
  975. VAR map : LONGINT;
  976. BEGIN
  977. IF register > 0 THEN
  978. map := used[register].map;
  979. WHILE register # map DO register := map; map := used[register].map END;
  980. END;
  981. RETURN register
  982. END Map;
  983. PROCEDURE Use(register: LONGINT): LONGINT;
  984. BEGIN
  985. IF register< LEN(used) THEN
  986. RETURN used[register].count
  987. ELSE
  988. RETURN 0
  989. END
  990. END Use;
  991. END RegisterUsageCount;
  992. RegisterEntry = POINTER TO RECORD
  993. prev,next: RegisterEntry;
  994. register: LONGINT;
  995. registerClass: IntermediateCode.RegisterClass;
  996. type: IntermediateCode.Type;
  997. END;
  998. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  999. Variables = OBJECT (Basic.List)
  1000. VAR
  1001. inUse: VariableUse;
  1002. registerIndex: LONGINT;
  1003. nameIndex: LONGINT;
  1004. PROCEDURE & Init;
  1005. VAR i: LONGINT;
  1006. BEGIN
  1007. InitList(16);
  1008. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1009. registerIndex := 1024;
  1010. nameIndex := 0;
  1011. END Init;
  1012. PROCEDURE Clear*;
  1013. VAR i: LONGINT;
  1014. BEGIN
  1015. Clear^;
  1016. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1017. registerIndex := 1024;
  1018. nameIndex := 0;
  1019. END Clear;
  1020. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1021. VAR string: SyntaxTree.IdentifierString ;
  1022. BEGIN
  1023. COPY("@hiddenIRVar",string);
  1024. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1025. RETURN SyntaxTree.NewIdentifier(string);
  1026. END GetUID;
  1027. PROCEDURE GetUsage(VAR use: VariableUse);
  1028. BEGIN
  1029. use := inUse;
  1030. END GetUsage;
  1031. PROCEDURE SetUsage(CONST use: VariableUse);
  1032. BEGIN
  1033. inUse := use;
  1034. END SetUsage;
  1035. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1036. VAR any: ANY;
  1037. BEGIN
  1038. any := Get(i);
  1039. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1040. END GetVariable;
  1041. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1042. BEGIN
  1043. Set(pos, v);
  1044. END SetVariable;
  1045. PROCEDURE Occupy(pos: LONGINT);
  1046. BEGIN
  1047. INCL(inUse[pos DIV 32], pos MOD 32);
  1048. END Occupy;
  1049. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1050. BEGIN
  1051. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1052. END Occupied;
  1053. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1054. BEGIN
  1055. Occupy(Length());
  1056. Add(v);
  1057. END AddVariable;
  1058. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1059. BEGIN
  1060. t1 := t1.resolved;
  1061. t2 := t2.resolved;
  1062. (*RETURN t1.SameType(t2); *)
  1063. RETURN
  1064. (t1.SameType(t2))
  1065. OR
  1066. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1067. OR
  1068. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (t1.sizeInBits = t2.sizeInBits)
  1069. OR
  1070. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1071. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1072. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1073. OR
  1074. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1075. (DynamicDim(t1) = DynamicDim(t2))
  1076. );
  1077. END CompatibleType;
  1078. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1079. VAR var : SyntaxTree.Variable; i: LONGINT;
  1080. BEGIN
  1081. pos := Length();
  1082. FOR i := 0 TO pos-1 DO
  1083. IF ~(Occupied(i)) THEN
  1084. var := GetVariable(i);
  1085. IF (~var.useRegister) & CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1086. pos := i;
  1087. Occupy(i);
  1088. RETURN var;
  1089. END;
  1090. END;
  1091. END;
  1092. RETURN NIL
  1093. END GetFreeVariable;
  1094. END Variables;
  1095. SymbolMap = POINTER TO RECORD
  1096. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1097. isAddress: BOOLEAN;
  1098. END;
  1099. SymbolMapper = OBJECT
  1100. VAR
  1101. first: SymbolMap;
  1102. PROCEDURE & Init;
  1103. BEGIN
  1104. first := NIL;
  1105. END Init;
  1106. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1107. VAR new: SymbolMap;
  1108. BEGIN
  1109. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1110. new.next := first; first := new;
  1111. END Add;
  1112. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1113. VAR s: SymbolMap;
  1114. BEGIN
  1115. s := first;
  1116. WHILE (s # NIL) & (s.this # this) DO
  1117. s := s.next
  1118. END;
  1119. RETURN s
  1120. END Get;
  1121. END SymbolMapper;
  1122. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1123. VAR
  1124. system: Global.System;
  1125. section: IntermediateCode.Section;
  1126. module: Sections.Module;
  1127. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1128. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1129. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1130. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1131. checker: SemanticChecker.Checker;
  1132. backend: IntermediateBackend;
  1133. meta: MetaDataGenerator;
  1134. position: Position;
  1135. moduleSelf: SyntaxTree.Variable;
  1136. (* variables for hand over of variables / temporary state *)
  1137. currentScope: SyntaxTree.Scope;
  1138. constantDeclaration : SyntaxTree.Symbol;
  1139. result: Operand; (* result of the most recent expression / statement *)
  1140. destination: IntermediateCode.Operand;
  1141. arrayDestinationTag: IntermediateCode.Operand;
  1142. arrayDestinationDimension:LONGINT;
  1143. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1144. exitLabel: Label;
  1145. locked: BOOLEAN;
  1146. (*
  1147. usedRegisters: Registers;
  1148. *)
  1149. registerUsageCount: RegisterUsageCount;
  1150. usedRegisters: RegisterEntry;
  1151. (* useful operands and types *)
  1152. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1153. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1154. commentPrintout: Printout.Printer;
  1155. dump: Streams.Writer;
  1156. tagsAvailable : BOOLEAN;
  1157. supportedInstruction: SupportedInstructionProcedure;
  1158. supportedImmediate: SupportedImmediateProcedure;
  1159. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1160. emitLabels: BOOLEAN;
  1161. builtinsModuleName : SyntaxTree.IdentifierString;
  1162. indexCounter: LONGINT;
  1163. profile: BOOLEAN;
  1164. profileId, profileInit: IntermediateCode.Section;
  1165. profileInitPatchPosition: LONGINT;
  1166. numberProcedures: LONGINT;
  1167. procedureResultDesignator : SyntaxTree.Designator;
  1168. operatorInitializationCodeSection: IntermediateCode.Section;
  1169. fingerPrinter: FingerPrinter.FingerPrinter;
  1170. temporaries: Variables;
  1171. canBeLoaded : BOOLEAN;
  1172. currentIsInline: BOOLEAN;
  1173. currentMapper: SymbolMapper;
  1174. currentInlineExit: Label;
  1175. moduleBodySection: IntermediateCode.Section;
  1176. NeedDescriptor : BOOLEAN;
  1177. cooperativeSwitches: BOOLEAN;
  1178. lastSwitchPC: LONGINT;
  1179. isUnchecked: BOOLEAN;
  1180. (* EXPERIMENTAL *)
  1181. availableSymbols: ARRAY 1024 OF
  1182. RECORD
  1183. symbol: SyntaxTree.Symbol;
  1184. inMemory, inRegister: BOOLEAN;
  1185. register: IntermediateCode.Operand;
  1186. memory: IntermediateCode.Operand;
  1187. END;
  1188. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend);
  1189. BEGIN
  1190. SELF.system := system;
  1191. SELF.builtinsModuleName := runtime;
  1192. currentScope := NIL;
  1193. hiddenPointerType := NIL;
  1194. delegatePointerType := NIL;
  1195. awaitProcCounter := 0;
  1196. labelId := 0; constId := 0; labelId := 0;
  1197. SELF.checker := checker;
  1198. SELF.backend := backend;
  1199. position := Basic.invalidPosition;
  1200. locked := FALSE;
  1201. InitOperand(result,ModeUndefined);
  1202. addressType := IntermediateCode.GetType(system,system.addressType);
  1203. setType := IntermediateCode.GetType(system,system.setType);
  1204. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1205. lenType := IntermediateCode.GetType(system, system.lenType);
  1206. byteType := IntermediateCode.GetType(system, system.byteType);
  1207. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1208. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1209. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1210. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1211. nil := IntermediateCode.Immediate(addressType,0);
  1212. one := IntermediateCode.Immediate(addressType,1);
  1213. IntermediateCode.InitOperand(destination);
  1214. tagsAvailable := TRUE;
  1215. supportedInstruction := supportedInstructionProcedure;
  1216. supportedImmediate := supportedImmediateProcedure;
  1217. inData := FALSE;
  1218. SELF.emitLabels := emitLabels;
  1219. IntermediateCode.InitOperand(arrayDestinationTag);
  1220. bool := IntermediateCode.GetType(system,system.booleanType);
  1221. IntermediateCode.InitImmediate(false,bool,0);
  1222. IntermediateCode.InitImmediate(true,bool,1);
  1223. indexCounter := 0;
  1224. NEW(registerUsageCount);
  1225. usedRegisters := NIL;
  1226. procedureResultDesignator := NIL;
  1227. NEW(fingerPrinter);
  1228. NEW(temporaries);
  1229. currentIsInline := FALSE;
  1230. NeedDescriptor := FALSE;
  1231. isUnchecked := backend.noRuntimeChecks;
  1232. END Init;
  1233. TYPE Context = RECORD
  1234. section: IntermediateCode.Section;
  1235. registerUsageCount: RegisterUsageCount;
  1236. usedRegisters: RegisterEntry;
  1237. temporaries: Variables;
  1238. END;
  1239. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1240. VAR context: Context;
  1241. BEGIN
  1242. context.section := section;
  1243. context.registerUsageCount := registerUsageCount;
  1244. context.usedRegisters := usedRegisters;
  1245. context.temporaries := temporaries;
  1246. section := new;
  1247. NEW(registerUsageCount);
  1248. NEW(temporaries);
  1249. usedRegisters := NIL;
  1250. RETURN context;
  1251. END SwitchContext;
  1252. PROCEDURE ReturnToContext(context: Context);
  1253. BEGIN
  1254. section := context.section;
  1255. registerUsageCount := context.registerUsageCount;
  1256. usedRegisters := context.usedRegisters;
  1257. temporaries := context.temporaries;
  1258. END ReturnToContext;
  1259. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1260. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1261. BEGIN
  1262. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1263. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1264. END;
  1265. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1266. section.SetExported(IsExported(syntaxTreeSymbol));
  1267. RETURN section
  1268. END NewSection;
  1269. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1270. VAR new: LONGINT;
  1271. BEGIN
  1272. new := registerUsageCount.Next(type,class);
  1273. UseRegister(new);
  1274. RETURN new
  1275. END AcquireRegister;
  1276. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1277. VAR
  1278. fingerPrint: SyntaxTree.FingerPrint;
  1279. fingerPrintString: ARRAY 32 OF CHAR;
  1280. BEGIN
  1281. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1282. string := "[";
  1283. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1284. Strings.Append(string, fingerPrintString);
  1285. Strings.Append(string, "]");
  1286. END GetFingerprintString;
  1287. (** get the name for the code section that represens a certain symbol
  1288. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1289. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1290. VAR string: ARRAY 32 OF CHAR;
  1291. BEGIN
  1292. Global.GetSymbolSegmentedName(symbol, name);
  1293. (* if the symbol is an operator, then append the fingerprint to the name *)
  1294. IF symbol IS SyntaxTree.Operator THEN
  1295. GetFingerprintString(symbol, string);
  1296. Basic.AppendToSegmentedName(name,string);
  1297. END
  1298. END GetCodeSectionNameForSymbol;
  1299. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1300. BEGIN
  1301. IF dump # NIL THEN
  1302. dump.String("enter "); dump.String(s); dump.Ln;
  1303. END;
  1304. END TraceEnter;
  1305. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1306. BEGIN
  1307. IF dump # NIL THEN
  1308. dump.String("exit "); dump.String(s); dump.Ln;
  1309. END;
  1310. END TraceExit;
  1311. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1312. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1313. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1314. VAR i: LONGINT;
  1315. BEGIN
  1316. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1317. IF op.rule # NIL THEN
  1318. FOR i := 0 TO LEN(op.rule)-1 DO
  1319. CheckRegister(op.rule[i])
  1320. END;
  1321. END;
  1322. END CheckRegister;
  1323. BEGIN
  1324. CheckRegister(instruction.op1);
  1325. CheckRegister(instruction.op2);
  1326. CheckRegister(instruction.op3);
  1327. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1328. ELSE section.Emit(instruction);
  1329. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1330. END;
  1331. END Emit;
  1332. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1333. VAR saved: RegisterEntry;
  1334. BEGIN
  1335. IF backend.cooperative THEN
  1336. ReleaseUsedRegisters(saved);
  1337. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1338. CallThis(position,"Runtime","Trap",1);
  1339. RestoreRegisterUse(saved);
  1340. ELSE
  1341. Emit(Trap(position,trapNo));
  1342. END;
  1343. END EmitTrap;
  1344. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT);
  1345. VAR name: Basic.SegmentedName;
  1346. VAR op1, op2, reg: IntermediateCode.Operand;
  1347. VAR call, nocall: Label;
  1348. VAR parametersSize: LONGINT;
  1349. VAR prevSection: IntermediateCode.Section;
  1350. VAR prevDump: Streams.Writer;
  1351. VAR body: SyntaxTree.Body;
  1352. VAR procedureType: SyntaxTree.ProcedureType;
  1353. BEGIN
  1354. IF procedure # NIL THEN
  1355. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1356. ELSE procedureType := NIL;
  1357. END;
  1358. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1359. prevSection := SELF.section;
  1360. SELF.section := section;
  1361. prevDump := dump;
  1362. dump := section.comments;
  1363. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1364. IF backend.hasLinkRegister THEN
  1365. Emit(Push(Basic.invalidPosition, lr));
  1366. END;
  1367. Emit(Push(Basic.invalidPosition,fp));
  1368. IF procedure # NIL THEN
  1369. body := procedure.procedureScope.body;
  1370. ELSE
  1371. body := NIL;
  1372. END;
  1373. IF backend.cooperative THEN
  1374. IF callconv IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention} THEN
  1375. Emit(Push(Basic.invalidPosition, one)) ;
  1376. ELSE
  1377. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1378. GetCodeSectionNameForSymbol(procedure, name);
  1379. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1380. ELSE
  1381. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1382. END;
  1383. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1384. IntermediateCode.AddOffset(op1, 1);
  1385. Emit(Push(Basic.invalidPosition,op1));
  1386. END;
  1387. Emit(Mov(Basic.invalidPosition,fp, sp));
  1388. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1389. NEW(call, section);
  1390. NEW(nocall, section);
  1391. reg := NewRegisterOperand(addressType);
  1392. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1393. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1394. BrltL(call, sp, reg);
  1395. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1396. BrgeL(nocall, sp, op2);
  1397. call.Resolve(section.pc);
  1398. Emit(Push(Basic.invalidPosition, reg));
  1399. ReleaseIntermediateOperand(reg);
  1400. parametersSize := ProcParametersSize(procedure);
  1401. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1402. Emit(Push(Basic.invalidPosition, op2));
  1403. CallThis(position, "Activities","ExpandStack",2);
  1404. Emit(Result(Basic.invalidPosition, sp));
  1405. nocall.Resolve(section.pc);
  1406. END;
  1407. ELSE
  1408. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1409. Emit(Push(Basic.invalidPosition, one)) ;
  1410. procedureType.SetParametersOffset(1);
  1411. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1412. END;
  1413. Emit(Mov(Basic.invalidPosition, fp, sp));
  1414. END;
  1415. END;
  1416. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1417. SELF.section := prevSection;
  1418. dump := prevDump;
  1419. END EmitEnter;
  1420. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1421. VAR op1,op2: IntermediateCode.Operand;
  1422. VAR instruction: IntermediateCode.Instruction;
  1423. BEGIN
  1424. IntermediateCode.InitNumber(op1,callconv);
  1425. IntermediateCode.InitNumber(op2,varSize);
  1426. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1427. RETURN instruction
  1428. END Enter;
  1429. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1430. VAR op1: IntermediateCode.Operand;
  1431. VAR instruction: IntermediateCode.Instruction;
  1432. BEGIN
  1433. IntermediateCode.InitNumber(op1,callconv);
  1434. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1435. RETURN instruction
  1436. END Leave;
  1437. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1438. VAR prevSection: IntermediateCode.Section;
  1439. VAR op2: IntermediateCode.Operand;
  1440. VAR body: SyntaxTree.Body;
  1441. BEGIN
  1442. prevSection := SELF.section;
  1443. SELF.section := section;
  1444. Emit(Leave(position, callconv));
  1445. IF procedure # NIL THEN
  1446. body := procedure.procedureScope.body;
  1447. ELSE
  1448. body := NIL;
  1449. END;
  1450. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1451. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1452. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1453. Emit(Add(position, sp, fp, op2));
  1454. ELSE
  1455. Emit(Mov(position, sp, fp));
  1456. END;
  1457. Emit(Pop(position, fp));
  1458. END;
  1459. SELF.section := prevSection;
  1460. END EmitLeave;
  1461. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1462. VAR m: SymbolMap;
  1463. BEGIN
  1464. position := x.position;
  1465. IF currentIsInline THEN
  1466. m := currentMapper.Get(x);
  1467. IF m # NIL THEN
  1468. (*
  1469. Printout.Info("mapping from", x);
  1470. Printout.Info("mapping to ", m.to);
  1471. *)
  1472. VExpression(m.to);
  1473. op := result;
  1474. IF m.tag # NIL THEN
  1475. ReleaseIntermediateOperand(result.tag);
  1476. VExpression(m.tag);
  1477. op.tag := result.op;
  1478. ReleaseIntermediateOperand(result.tag);
  1479. END;
  1480. RETURN
  1481. END;
  1482. END;
  1483. VSymbol(x);
  1484. op := result;
  1485. END Symbol;
  1486. PROCEDURE Expression(x: SyntaxTree.Expression);
  1487. BEGIN
  1488. position := x.position;
  1489. constantDeclaration := NIL;
  1490. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1491. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1492. END;
  1493. IF x.resolved # NIL THEN
  1494. VExpression(x.resolved);
  1495. ELSE
  1496. VExpression(x);
  1497. END;
  1498. (* check this, was commented out in ActiveCells3 *)
  1499. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1500. Error(x.position, "unsupported modifier");
  1501. END;
  1502. END Expression;
  1503. (*
  1504. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1505. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1506. BEGIN
  1507. temporaries.GetUsage(current);
  1508. FOR i := 0 TO LEN(current)-1 DO
  1509. set := current[i] - previous[i];
  1510. IF set # {} THEN
  1511. FOR j := 0 TO MAX(SET)-1 DO
  1512. IF j IN set THEN
  1513. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1514. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1515. Symbol(variable, op);
  1516. MakeMemory(tmp,op.op,addressType,0);
  1517. ReleaseOperand(op);
  1518. Emit(Mov(position,tmp, nil ) );
  1519. ReleaseIntermediateOperand(tmp);
  1520. END;
  1521. END;
  1522. END;
  1523. END;
  1524. END;
  1525. END ResetUsedTemporaries;
  1526. *)
  1527. PROCEDURE Statement(x: SyntaxTree.Statement);
  1528. VAR use: VariableUse;
  1529. BEGIN
  1530. temporaries.GetUsage(use);
  1531. position := x.position;
  1532. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1533. IF commentPrintout # NIL THEN
  1534. commentPrintout.Statement(x);
  1535. dump.Ln;
  1536. (*dump.Update;*)
  1537. END;
  1538. VStatement(x);
  1539. (*
  1540. CheckRegistersFree();
  1541. *)
  1542. (*ResetUsedTemporaries(use);*)
  1543. temporaries.SetUsage(use);
  1544. END Statement;
  1545. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1546. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1547. *)
  1548. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1549. BEGIN
  1550. ASSERT(op.mode # IntermediateCode.Undefined);
  1551. IF op.mode = IntermediateCode.ModeMemory THEN
  1552. ReuseCopy(res,op);
  1553. ELSE
  1554. res := op;
  1555. UseIntermediateOperand(res);
  1556. END;
  1557. IntermediateCode.AddOffset(res,offset);
  1558. IntermediateCode.MakeMemory(res,type);
  1559. END MakeMemory;
  1560. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1561. VAR mem: IntermediateCode.Operand;
  1562. BEGIN
  1563. MakeMemory(mem,res,type,offset);
  1564. ReleaseIntermediateOperand(res);
  1565. res := mem;
  1566. END ToMemory;
  1567. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1568. VAR mem: IntermediateCode.Operand;
  1569. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1570. componentType: SyntaxTree.Type;
  1571. BEGIN
  1572. type := type.resolved;
  1573. IF operand.mode = ModeReference THEN
  1574. IF type IS SyntaxTree.RangeType THEN
  1575. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1576. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1577. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1578. ReleaseOperand(operand);
  1579. operand.op := firstOp;
  1580. operand.tag := lastOp;
  1581. operand.extra := stepOp;
  1582. ELSIF type IS SyntaxTree.ComplexType THEN
  1583. componentType := type(SyntaxTree.ComplexType).componentType;
  1584. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1585. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1586. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1587. ReleaseOperand(operand);
  1588. operand.op := firstOp;
  1589. operand.tag := lastOp
  1590. ELSE
  1591. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1592. ReleaseIntermediateOperand(operand.op);
  1593. (* EXPERIMENTAL *)
  1594. IF operand.availability >= 0 THEN
  1595. IF availableSymbols[operand.availability].inRegister THEN
  1596. operand.op := availableSymbols[operand.availability].register;
  1597. UseIntermediateOperand(operand.op);
  1598. ELSE
  1599. availableSymbols[operand.availability].register := NewRegisterOperand(IntermediateCode.GetType(system,type));
  1600. availableSymbols[operand.availability].memory := mem;
  1601. operand.op := availableSymbols[operand.availability].register;
  1602. Emit(Mov(position, operand.op, mem));
  1603. availableSymbols[operand.availability].inRegister := TRUE;
  1604. END;
  1605. ReleaseIntermediateOperand(mem);
  1606. ELSE
  1607. operand.op := mem;
  1608. END;
  1609. END;
  1610. operand.mode := ModeValue;
  1611. END;
  1612. ASSERT(operand.mode = ModeValue);
  1613. END LoadValue;
  1614. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1615. BEGIN
  1616. InitOperand(result, ModeUndefined);
  1617. Expression(x);
  1618. op := result;
  1619. LoadValue(op,x.type.resolved);
  1620. END Evaluate;
  1621. PROCEDURE EvaluateX(CONST x: SyntaxTree.Expression; VAR result: Operand);
  1622. VAR operand: Operand; type: SyntaxTree.Type; symbol: SyntaxTree.Symbol;
  1623. BEGIN
  1624. Evaluate(x, result); RETURN;
  1625. IF (x.resolved # NIL) & (x.resolved # x) THEN EvaluateX(x.resolved, result); RETURN END;
  1626. WITH x:
  1627. SyntaxTree.UnaryExpression DO
  1628. EvaluateUnaryExpression(x, result);
  1629. RETURN;
  1630. |SyntaxTree.BinaryExpression DO
  1631. EvaluateBinaryExpression(x, result);
  1632. RETURN;
  1633. |SyntaxTree.Set DO
  1634. EvaluateSet(x, result);
  1635. RETURN;
  1636. |SyntaxTree.RangeExpression DO
  1637. InitOperand(result, ModeValue);
  1638. ASSERT(x.first # NIL);
  1639. EvaluateX(x.first, operand);
  1640. result.op := operand.op;
  1641. UseIntermediateOperand(result.op);
  1642. ReleaseOperand(operand);
  1643. ASSERT(x.last # NIL);
  1644. EvaluateX(x.last, operand);
  1645. result.tag := operand.op;
  1646. UseIntermediateOperand(result.tag);
  1647. ReleaseOperand(operand);
  1648. IF x.step # NIL THEN
  1649. EvaluateX(x.step, operand);
  1650. result.extra := operand.op;
  1651. UseIntermediateOperand(result.extra);
  1652. ReleaseOperand(operand);
  1653. END;
  1654. |SyntaxTree.SymbolDesignator DO
  1655. symbol := x.symbol;
  1656. WITH symbol: SyntaxTree.Constant DO
  1657. EvaluateX(symbol.value, result);
  1658. RETURN
  1659. ELSE (* designate and load --> below *)
  1660. END;
  1661. |SyntaxTree.BuiltinCallDesignator DO
  1662. EvaluateBuiltinCallDesignator(x,result);
  1663. (*
  1664. |SyntaxTree.Conversion DO
  1665. |SyntaxTree.ProcedureCallDesignator
  1666. |SyntaxTree.TypeGuardDesignator
  1667. |SyntaxTree.DereferenceDesignator
  1668. |SyntaxTree.SupercallDesignator
  1669. |SyntaxTree.SelfDesignator
  1670. *)
  1671. |SyntaxTree.BooleanValue DO
  1672. InitOperand(result,ModeValue);
  1673. IF x.value THEN result.op := true ELSE result.op := false END;
  1674. RETURN;
  1675. |SyntaxTree.IntegerValue DO
  1676. InitOperand(result,ModeValue);
  1677. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  1678. IF ~supportedImmediate(result.op) &~inData THEN
  1679. GetImmediateMem(result.op)
  1680. END;
  1681. RETURN;
  1682. |SyntaxTree.CharacterValue DO
  1683. InitOperand(result,ModeValue);
  1684. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  1685. RETURN;
  1686. |SyntaxTree.RealValue DO
  1687. InitOperand(result,ModeValue);
  1688. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  1689. RETURN;
  1690. |SyntaxTree.ComplexValue DO
  1691. ASSERT(x.type IS SyntaxTree.ComplexType);
  1692. type := x.type(SyntaxTree.ComplexType).componentType;
  1693. InitOperand(result,ModeValue);
  1694. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,type),x.realValue); (* real part *)
  1695. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,type),x.imagValue); (* imaginary part *)
  1696. RETURN;
  1697. |SyntaxTree.NilValue DO
  1698. InitOperand(result,ModeValue);
  1699. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  1700. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  1701. RETURN;
  1702. |SyntaxTree.EnumerationValue DO
  1703. InitOperand(result,ModeValue);
  1704. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  1705. RETURN;
  1706. ELSE (* other designators *)
  1707. END;
  1708. Designate(x, result);
  1709. LoadValue(result, x.type);
  1710. END EvaluateX;
  1711. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1712. BEGIN
  1713. InitOperand(result,ModeUndefined);
  1714. Expression(x);
  1715. (* ASSERT(x.mode = ModeReference *)
  1716. op := result;
  1717. END Designate;
  1718. PROCEDURE Condition(CONST x: SyntaxTree.Expression; label: Label; reason: BOOLEAN);
  1719. VAR skip: Label; recordType: SyntaxTree.RecordType; left, right: Operand;
  1720. leftType, rightType: SyntaxTree.Type; temp: IntermediateCode.Operand;
  1721. leftExpression, rightExpression: SyntaxTree.Expression;
  1722. BEGIN
  1723. ASSERT(label # NIL);
  1724. IF (x.resolved # NIL) & (x.resolved # x) THEN Condition(x.resolved, label, reason); RETURN END;
  1725. WITH x:
  1726. SyntaxTree.UnaryExpression DO
  1727. CASE x.operator OF
  1728. Scanner.Not:
  1729. Condition(x.left,label,~reason);
  1730. RETURN;
  1731. ELSE
  1732. END;
  1733. | SyntaxTree.BinaryExpression DO
  1734. leftType := x.left.type.resolved;
  1735. rightType := x.right.type.resolved;
  1736. CASE x.operator OF
  1737. Scanner.Or:
  1738. (* shortcut evaluation of left OR right *)
  1739. IF reason THEN (*left or right*)
  1740. Condition(x.left,label,TRUE);
  1741. Condition(x.right,label,TRUE);
  1742. ELSE (* ~ (left or right) = ~left & ~right *)
  1743. skip := NewLabel();
  1744. Condition(x.left,skip,TRUE);
  1745. Condition(x.right,label,FALSE);
  1746. SetLabel(skip);
  1747. END;
  1748. RETURN;
  1749. |Scanner.And:
  1750. (* shortcut evaluation of left & right *)
  1751. IF reason THEN (* left and right *)
  1752. skip := NewLabel();
  1753. Condition(x.left,skip,FALSE);
  1754. Condition(x.right,label,TRUE);
  1755. SetLabel(skip);
  1756. ELSE (* ~(left and right) = ~left or ~right *)
  1757. Condition(x.left,label,FALSE);
  1758. Condition(x.right,label,FALSE);
  1759. END;
  1760. RETURN;
  1761. |Scanner.Is:
  1762. (* get type desc tag *)
  1763. IF IsPointerToRecord(x.left.type,recordType) THEN
  1764. EvaluateX(x.left, left);
  1765. Dereference(left,recordType,IsUnsafePointer(x.left.type))
  1766. ELSE
  1767. Designate(x.left,left);
  1768. END;
  1769. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,label,reason,FALSE);
  1770. ReleaseOperand(left);
  1771. RETURN;
  1772. |Scanner.Equal:
  1773. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1774. IF reason THEN
  1775. CompareString(BreqL,label,x.left,x.right);
  1776. ELSE
  1777. CompareString(BrneL,label,x.left,x.right);
  1778. END;
  1779. ELSE
  1780. Evaluate(x.left,left);
  1781. Evaluate(x.right,right);
  1782. IF leftType IS SyntaxTree.RangeType THEN
  1783. ASSERT(rightType IS SyntaxTree.RangeType);
  1784. IF reason THEN
  1785. skip := NewLabel();
  1786. BrneL(skip, left.op, right.op); (* first *)
  1787. BrneL(skip, left.tag, right.tag); (* last *)
  1788. BreqL(label, left.extra, right.extra); (* step *)
  1789. SetLabel(skip);
  1790. ELSE
  1791. BrneL(label, left.op, right.op); (* first *)
  1792. BrneL(label, left.tag, right.tag); (* last *)
  1793. BrneL(label, left.extra, right.extra); (* step *)
  1794. END;
  1795. ReleaseOperand(left); ReleaseOperand(right);
  1796. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1797. IF reason THEN
  1798. skip := NewLabel();
  1799. BrneL(skip, left.op, right.op); (* first *)
  1800. BreqL(label, left.tag, right.tag); (* last *)
  1801. SetLabel(skip);
  1802. ELSE
  1803. BrneL(label, left.op, right.op); (* first *)
  1804. BrneL(label, left.tag, right.tag); (* last *)
  1805. END;
  1806. ReleaseOperand(left); ReleaseOperand(right);
  1807. ELSE
  1808. IF reason THEN
  1809. BreqL(label,left.op,right.op);
  1810. ELSE
  1811. BrneL(label,left.op,right.op);
  1812. END;
  1813. ReleaseOperand(left); ReleaseOperand(right);
  1814. END;
  1815. END;
  1816. RETURN;
  1817. |Scanner.LessEqual:
  1818. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1819. IF reason THEN
  1820. CompareString(BrgeL,label,x.right,x.left);
  1821. ELSE
  1822. CompareString(BrltL,label,x.right,x.left);
  1823. END;
  1824. ELSE
  1825. Evaluate(x.left,left);
  1826. Evaluate(x.right,right);
  1827. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  1828. Reuse1(temp,right.op);
  1829. Emit(And(position,temp,left.op,right.op));
  1830. ReleaseOperand(right);
  1831. IF reason THEN
  1832. BreqL(label,temp,left.op);
  1833. ELSE
  1834. BrneL(label,temp,left.op);
  1835. END;
  1836. ReleaseIntermediateOperand(temp);ReleaseOperand(left);
  1837. ELSE
  1838. IF reason THEN
  1839. BrgeL(label,right.op,left.op);
  1840. ELSE
  1841. BrltL(label,right.op,left.op);
  1842. END;
  1843. ReleaseOperand(left); ReleaseOperand(right);
  1844. END;
  1845. END;
  1846. RETURN;
  1847. |Scanner.Less:
  1848. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  1849. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  1850. leftExpression.SetType(system.booleanType);
  1851. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1852. rightExpression.SetType(system.booleanType);
  1853. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1854. leftExpression.SetType(system.booleanType);
  1855. Condition(leftExpression,label,reason);
  1856. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1857. IF reason THEN
  1858. CompareString(BrltL,label,x.left,x.right);
  1859. ELSE
  1860. CompareString(BrgeL,label,x.left,x.right);
  1861. END;
  1862. ELSE
  1863. Evaluate(x.left,left);
  1864. Evaluate(x.right,right);
  1865. IF reason THEN
  1866. BrltL(label,left.op,right.op);
  1867. ELSE
  1868. BrgeL(label,left.op,right.op);
  1869. END;
  1870. ReleaseOperand(left); ReleaseOperand(right);
  1871. END;
  1872. RETURN;
  1873. |Scanner.Greater:
  1874. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  1875. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  1876. leftExpression.SetType(system.booleanType);
  1877. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  1878. rightExpression.SetType(system.booleanType);
  1879. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  1880. leftExpression.SetType(system.booleanType);
  1881. Condition(leftExpression,label,reason);
  1882. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1883. IF reason THEN
  1884. CompareString(BrltL,label,x.right,x.left);
  1885. ELSE
  1886. CompareString(BrgeL,label,x.right,x.left);
  1887. END;
  1888. ELSE
  1889. Evaluate(x.left,left);
  1890. Evaluate(x.right,right);
  1891. IF reason THEN
  1892. BrltL(label, right.op,left.op);
  1893. ELSE
  1894. BrgeL(label, right.op,left.op);
  1895. END;
  1896. ReleaseOperand(left); ReleaseOperand(right);
  1897. END;
  1898. RETURN;
  1899. |Scanner.GreaterEqual:
  1900. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1901. IF reason THEN
  1902. CompareString(BrgeL,label,x.left,x.right);
  1903. ELSE
  1904. CompareString(BrltL,label,x.left,x.right);
  1905. END;
  1906. ELSE
  1907. Evaluate(x.left,left);
  1908. Evaluate(x.right,right);
  1909. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  1910. Reuse1(temp,left.op);
  1911. Emit(And(position,temp,left.op,right.op));
  1912. ReleaseOperand(left);
  1913. IF reason THEN
  1914. BreqL(label, temp, right.op);
  1915. ELSE
  1916. BrneL(label, temp, right.op);
  1917. END;
  1918. ReleaseIntermediateOperand(temp); ReleaseOperand(right);
  1919. ELSE
  1920. IF reason THEN
  1921. BrgeL(label,left.op,right.op);
  1922. ELSE
  1923. BrltL(label, left.op,right.op);
  1924. END;
  1925. ReleaseOperand(left); ReleaseOperand(right);
  1926. END;
  1927. END;
  1928. RETURN;
  1929. |Scanner.Unequal:
  1930. IF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  1931. IF reason THEN
  1932. CompareString(BrneL,label,x.left,x.right);
  1933. ELSE
  1934. CompareString(BreqL,label,x.left,x.right);
  1935. END
  1936. ELSE
  1937. Evaluate(x.left,left);
  1938. Evaluate(x.right,right);
  1939. IF leftType IS SyntaxTree.RangeType THEN
  1940. ASSERT(rightType IS SyntaxTree.RangeType);
  1941. IF ~reason THEN
  1942. skip := NewLabel();
  1943. BrneL(skip, left.op, right.op); (* first *)
  1944. BrneL(skip, left.tag, right.tag); (* last *)
  1945. BreqL(label, left.extra, right.extra); (* step *)
  1946. SetLabel(skip);
  1947. ELSE
  1948. BrneL(label, left.op, right.op); (* first *)
  1949. BrneL(label, left.tag, right.tag); (* last *)
  1950. BrneL(label, left.extra, right.extra); (* step *)
  1951. END;
  1952. ReleaseOperand(left); ReleaseOperand(right);
  1953. ELSIF IsDelegate(leftType) OR (leftType IS SyntaxTree.ComplexType) THEN (* pair comparison *)
  1954. IF reason THEN
  1955. BrneL(label, left.op, right.op);
  1956. BrneL(label, left.tag, right.tag);
  1957. ELSE
  1958. skip := NewLabel();
  1959. BrneL(skip, left.op, right.op);
  1960. BreqL(label, left.tag, right.tag);
  1961. SetLabel(skip);
  1962. END;
  1963. ReleaseOperand(left); ReleaseOperand(right);
  1964. ELSE
  1965. IF reason THEN
  1966. BrneL(label,left.op,right.op);
  1967. ELSE
  1968. BreqL(label,left.op,right.op);
  1969. END;
  1970. ReleaseOperand(left); ReleaseOperand(right);
  1971. END;
  1972. END;
  1973. RETURN;
  1974. ELSE (* case *)
  1975. END;
  1976. |SyntaxTree.BooleanValue DO
  1977. IF reason = x.value THEN BrL(label) END;
  1978. RETURN;
  1979. ELSE (* with *)
  1980. END;
  1981. (* default case: evaluate and compare result *)
  1982. EvaluateX(x,left);
  1983. IF reason THEN
  1984. BrneL(label,left.op, false);
  1985. ELSE
  1986. BreqL(label,left.op, false);
  1987. END;
  1988. ReleaseOperand(left);
  1989. END Condition;
  1990. PROCEDURE EvaluateUnaryExpression(x: SyntaxTree.UnaryExpression; VAR result: Operand);
  1991. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1992. BEGIN
  1993. IF Trace THEN TraceEnter("EvaluateUnaryExpression") END;
  1994. dest := destination; destination := emptyOperand;
  1995. CASE x.operator OF
  1996. Scanner.Not:
  1997. EvaluateX(x.left, operand);
  1998. InitOperand(result,ModeValue);
  1999. Reuse1a(result.op,operand.op,dest);
  2000. Emit(Xor(position,result.op,operand.op,true));
  2001. ReleaseOperand(operand);
  2002. |Scanner.Minus:
  2003. EvaluateX(x.left, operand);
  2004. InitOperand(result,ModeValue);
  2005. Reuse1a(result.op,operand.op,dest);
  2006. type := x.left.type.resolved;
  2007. IF type IS SyntaxTree.SetType THEN
  2008. Emit(Not(position,result.op,operand.op));
  2009. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2010. Reuse1(result.tag,operand.tag);
  2011. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2012. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2013. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2014. Emit(Neg(position,result.op,operand.op));
  2015. ELSE HALT(200)
  2016. END;
  2017. ReleaseOperand(operand);
  2018. |Scanner.Address:
  2019. Designate(x.left,result);
  2020. result.mode := ModeValue;
  2021. t0 := x.left.type.resolved;
  2022. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2023. ReleaseIntermediateOperand(result.op);
  2024. result.op := result.tag;
  2025. IntermediateCode.InitOperand(result.tag);
  2026. END;
  2027. Convert(result.op,IntermediateCode.GetType(system,x.type));
  2028. END;
  2029. destination := dest;
  2030. IF Trace THEN TraceExit("UnaryExpression") END;
  2031. END EvaluateUnaryExpression;
  2032. PROCEDURE EvaluateBinaryExpression(x: SyntaxTree.BinaryExpression; VAR result: Operand);
  2033. VAR left,right: Operand;zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2034. leftType,rightType: SyntaxTree.Type;
  2035. leftExpression,rightExpression : SyntaxTree.Expression;
  2036. componentType: IntermediateCode.Type;
  2037. exit: Label; dest: IntermediateCode.Operand;
  2038. size: LONGINT;
  2039. BEGIN
  2040. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2041. dest := destination; destination := emptyOperand;
  2042. leftType := x.left.type.resolved;
  2043. rightType := x.right.type.resolved;
  2044. CASE x.operator OF
  2045. Scanner.Or, Scanner.And, Scanner.Is:
  2046. result := ConditionValue(x);
  2047. |Scanner.Plus:
  2048. EvaluateX(x.left,left);
  2049. EvaluateX(x.right,right);
  2050. IF leftType IS SyntaxTree.SetType THEN
  2051. InitOperand(result,ModeValue);
  2052. Reuse2a(result.op,left.op,right.op,dest);
  2053. Emit(Or(position,result.op,left.op,right.op));
  2054. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2055. InitOperand(result,ModeValue);
  2056. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2057. Reuse2(result.tag,left.tag,right.tag);
  2058. Emit(Add(position,result.op,left.op,right.op));
  2059. Emit(Add(position,result.tag,left.tag,right.tag))
  2060. ELSE
  2061. InitOperand(result,ModeValue);
  2062. Reuse2a(result.op,left.op,right.op,dest);
  2063. Emit(Add(position,result.op,left.op,right.op));
  2064. END;
  2065. ReleaseOperand(left); ReleaseOperand(right);
  2066. |Scanner.Minus:
  2067. EvaluateX(x.left,left);
  2068. EvaluateX(x.right,right);
  2069. IF leftType IS SyntaxTree.SetType THEN
  2070. InitOperand(result,ModeValue);
  2071. Reuse1(result.op,right.op);
  2072. Emit(Not(position,result.op,right.op));
  2073. ReleaseOperand(right);
  2074. Emit(And(position,result.op,result.op,left.op));
  2075. ReleaseOperand(left);
  2076. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2077. InitOperand(result,ModeValue);
  2078. Reuse2a(result.op,left.op,right.op,dest);
  2079. Reuse2(result.tag,left.tag,right.tag);
  2080. Emit(Sub(position,result.op,left.op,right.op));
  2081. Emit(Sub(position,result.tag,left.tag,right.tag));
  2082. ReleaseOperand(left); ReleaseOperand(right)
  2083. ELSE
  2084. InitOperand(result,ModeValue);
  2085. Reuse2a(result.op,left.op,right.op,dest);
  2086. Emit(Sub(position,result.op,left.op,right.op));
  2087. ReleaseOperand(left); ReleaseOperand(right);
  2088. END;
  2089. |Scanner.Times:
  2090. EvaluateX(x.left, left);
  2091. EvaluateX(x.right, right);
  2092. IF leftType IS SyntaxTree.SetType THEN
  2093. InitOperand(result,ModeValue);
  2094. Reuse2a(result.op,left.op,right.op,dest);
  2095. Emit(And(position,result.op,left.op,right.op));
  2096. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2097. InitOperand(result, ModeValue);
  2098. componentType := left.op.type;
  2099. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2100. Emit(Mul(position,result.op, left.op, right.op));
  2101. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2102. Emit(Mul(position,tempReg, left.tag, right.tag));
  2103. Emit(Sub(position,result.op, result.op, tempReg));
  2104. Reuse2(result.tag, left.tag, right.op);
  2105. Emit(Mul(position,result.tag, left.tag, right.op));
  2106. Emit(Mul(position,tempReg, left.op, right.tag));
  2107. Emit(Add(position,result.tag, result.tag, tempReg));
  2108. ReleaseIntermediateOperand(tempReg)
  2109. ELSE
  2110. InitOperand(result,ModeValue);
  2111. Reuse2a(result.op,left.op,right.op,dest);
  2112. Emit(Mul(position,result.op,left.op,right.op));
  2113. END;
  2114. ReleaseOperand(left); ReleaseOperand(right);
  2115. |Scanner.Div:
  2116. EvaluateX(x.left, left);
  2117. EvaluateX(x.right, right);
  2118. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2119. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2120. IF ~isUnchecked THEN
  2121. exit := NewLabel();
  2122. BrltL(exit,zero,right.op);
  2123. EmitTrap(position,NegativeDivisorTrap);
  2124. SetLabel(exit);
  2125. END;
  2126. END;
  2127. InitOperand(result,ModeValue);
  2128. Reuse2a(result.op,left.op,right.op,dest);
  2129. Emit(Div(position,result.op,left.op,right.op));
  2130. ReleaseOperand(left); ReleaseOperand(right);
  2131. |Scanner.Mod:
  2132. EvaluateX(x.left, left);
  2133. EvaluateX(x.right, right);
  2134. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2135. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2136. IF ~isUnchecked THEN
  2137. exit := NewLabel();
  2138. BrltL(exit,zero,right.op);
  2139. EmitTrap(position,NegativeDivisorTrap);
  2140. SetLabel(exit);
  2141. END;
  2142. END;
  2143. InitOperand(result,ModeValue);
  2144. Reuse2a(result.op,left.op,right.op,dest);
  2145. Emit(Mod(position,result.op,left.op,right.op));
  2146. ReleaseOperand(left); ReleaseOperand(right);
  2147. |Scanner.Slash:
  2148. EvaluateX(x.left, left);
  2149. EvaluateX(x.right, right);
  2150. IF leftType IS SyntaxTree.SetType THEN
  2151. InitOperand(result,ModeValue);
  2152. Reuse2a(result.op,left.op,right.op,dest);
  2153. Emit(Xor(position,result.op,left.op,right.op));
  2154. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2155. InitOperand(result,ModeValue);
  2156. componentType := left.op.type;
  2157. (*
  2158. divisor = right.op * right.op + right.tag * right.tag
  2159. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2160. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2161. *)
  2162. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2163. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2164. Emit(Mul(position,tempReg, right.op, right.op));
  2165. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2166. Emit(Add(position,tempReg, tempReg, tempReg2));
  2167. result.op := tempReg2;
  2168. Emit(Mul(position,result.op, left.op, right.op));
  2169. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2170. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2171. Emit(Add(position,result.op, result.op, tempReg2));
  2172. Emit(Div(position,result.op, result.op, tempReg));
  2173. Reuse2(result.tag, left.tag, right.op);
  2174. Emit(Mul(position,result.tag, left.tag, right.op));
  2175. Emit(Mul(position,tempReg2, left.op, right.tag));
  2176. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2177. Emit(Div(position,result.tag, result.tag, tempReg));
  2178. ReleaseIntermediateOperand(tempReg);
  2179. ReleaseIntermediateOperand(tempReg2)
  2180. ELSE
  2181. InitOperand(result,ModeValue);
  2182. Reuse2a(result.op,left.op,right.op,dest);
  2183. Emit(Div(position,result.op,left.op,right.op));
  2184. END;
  2185. ReleaseOperand(left); ReleaseOperand(right);
  2186. |Scanner.Equal, Scanner.LessEqual, Scanner.Less, Scanner.Greater, Scanner.GreaterEqual, Scanner.Unequal :
  2187. result := ConditionValue(x);
  2188. |Scanner.In:
  2189. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  2190. EvaluateX(x.left, left);
  2191. EvaluateX(x.right, right);
  2192. Convert(left.op,setType);
  2193. Convert(right.op,setType);
  2194. result.mode := ModeValue;
  2195. result.tag := nil; (* may be left over from calls to evaluate *)
  2196. ReuseCopy(result.op,right.op);
  2197. Emit(Shr(position,result.op,result.op,left.op));
  2198. ReleaseOperand(right); ReleaseOperand(left);
  2199. IntermediateCode.InitImmediate(one,setType,1);
  2200. Emit(And(position,result.op,result.op,one));
  2201. Convert(result.op,bool);
  2202. ELSE
  2203. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  2204. IF x.operator = Scanner.Questionmarks THEN
  2205. leftExpression := x.left;
  2206. rightExpression := x.right;
  2207. ELSE
  2208. leftExpression := x.right;
  2209. rightExpression := x.left;
  2210. END;
  2211. EvaluateX(leftExpression, left);
  2212. Emit(Push(position,left.op));
  2213. ReleaseOperand(left);
  2214. Designate(rightExpression, right);
  2215. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  2216. IF ~backend.cellsAreObjects THEN
  2217. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  2218. END;
  2219. Emit(Push(position,right.op));
  2220. ReleaseOperand(right);
  2221. IF backend.cellsAreObjects THEN
  2222. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  2223. ELSE
  2224. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  2225. END;
  2226. InitOperand(result, ModeValue);
  2227. result.op := NewRegisterOperand(bool);
  2228. Emit(Result(position,result.op));
  2229. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  2230. leftExpression := x.left;
  2231. rightExpression := x.right;
  2232. EvaluateX(leftExpression, left);
  2233. Emit(Push(position,left.op));
  2234. ReleaseOperand(left);
  2235. EvaluateX(rightExpression, right);
  2236. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  2237. IF ~backend.cellsAreObjects THEN
  2238. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  2239. END;
  2240. Emit(Push(position,right.op));
  2241. ReleaseOperand(right);
  2242. IF backend.cellsAreObjects THEN
  2243. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  2244. ELSE
  2245. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  2246. END;
  2247. InitOperand(result, ModeValue);
  2248. result.op := NewRegisterOperand(bool);
  2249. Emit(Result(position,result.op));
  2250. ELSE
  2251. HALT(100);
  2252. END;
  2253. END;
  2254. destination := dest;
  2255. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  2256. END EvaluateBinaryExpression;
  2257. PROCEDURE EvaluateSet(x: SyntaxTree.Set; VAR result: Operand);
  2258. VAR
  2259. operand: Operand;
  2260. temp, one, noBits, dest: IntermediateCode.Operand;
  2261. expression: SyntaxTree.Expression;
  2262. i: LONGINT;
  2263. BEGIN
  2264. IF Trace THEN TraceEnter("VisitSet") END;
  2265. dest := destination;
  2266. destination := emptyOperand;
  2267. noBits := IntermediateCode.Immediate(setType, 0);
  2268. one := IntermediateCode.Immediate(setType, 1);
  2269. (* start off with the empty set *)
  2270. InitOperand(result, ModeValue);
  2271. IntermediateCode.InitRegister(result.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2272. Emit(Mov(position,result.op, noBits));
  2273. FOR i := 0 TO x.elements.Length() - 1 DO
  2274. expression := x.elements.GetExpression(i);
  2275. IF expression IS SyntaxTree.RangeExpression THEN
  2276. (* range of set elements *)
  2277. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2278. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2279. Emit(Or(position,result.op, result.op, temp)); (* unify subset with current set *)
  2280. ReleaseIntermediateOperand(temp)
  2281. ELSE
  2282. (* singelton element *)
  2283. Evaluate(expression, operand);
  2284. Convert(operand.op, setType);
  2285. CheckSetElement(operand.op);
  2286. (* create subset containing single element *)
  2287. Reuse1(temp, operand.op);
  2288. Emit(Shl(position,temp, one, operand.op));
  2289. ReleaseOperand(operand);
  2290. Emit(Or(position,result.op, result.op, temp)); (* unify subset with current set *)
  2291. ReleaseIntermediateOperand(temp);
  2292. END
  2293. END;
  2294. destination := dest;
  2295. IF Trace THEN TraceExit("VisitSet") END;
  2296. END EvaluateSet;
  2297. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  2298. VAR op: IntermediateCode.Operand; reg: LONGINT;
  2299. BEGIN
  2300. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  2301. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  2302. RETURN op
  2303. END NewRegisterOperand;
  2304. PROCEDURE UnuseRegister(register: LONGINT);
  2305. BEGIN
  2306. IF (register > 0) THEN
  2307. register := registerUsageCount.Map(register);
  2308. registerUsageCount.DecUse(register);
  2309. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2310. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  2311. END;
  2312. IF registerUsageCount.Use(register)=0 THEN
  2313. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  2314. Warning(position, "register cannot be removed");
  2315. END;
  2316. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2317. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  2318. END;
  2319. ELSIF registerUsageCount.Use(register)<0 THEN
  2320. Warning(position, "register removed too often");
  2321. IF dump # NIL THEN
  2322. dump.String("register removed too often"); dump.Ln; dump.Update;
  2323. END;
  2324. END;
  2325. END;
  2326. END UnuseRegister;
  2327. PROCEDURE UseRegister(register: LONGINT);
  2328. BEGIN
  2329. IF (register > 0) THEN
  2330. register := registerUsageCount.Map(register);
  2331. registerUsageCount.IncUse(register);
  2332. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2333. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  2334. END;
  2335. IF registerUsageCount.Use(register)=1 THEN
  2336. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  2337. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2338. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  2339. END;
  2340. END;
  2341. END;
  2342. END UseRegister;
  2343. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  2344. BEGIN
  2345. UnuseRegister(op.register)
  2346. END ReleaseIntermediateOperand;
  2347. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  2348. BEGIN
  2349. UseRegister(op.register)
  2350. END UseIntermediateOperand;
  2351. PROCEDURE ReleaseOperand(CONST op: Operand);
  2352. BEGIN
  2353. UnuseRegister(op.op.register);
  2354. UnuseRegister(op.tag.register);
  2355. UnuseRegister(op.extra.register);
  2356. END ReleaseOperand;
  2357. (* save registers marked in array "markedRegisters" to the stack
  2358. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  2359. *)
  2360. PROCEDURE SaveRegisters();
  2361. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  2362. BEGIN
  2363. entry := usedRegisters;
  2364. WHILE entry # NIL DO
  2365. type := registerUsageCount.used[entry.register].type;
  2366. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  2367. Emit(Push(position,op));
  2368. entry := entry.next;
  2369. END;
  2370. END SaveRegisters;
  2371. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  2372. BEGIN
  2373. saved := usedRegisters;
  2374. usedRegisters := NIL;
  2375. END ReleaseUsedRegisters;
  2376. (** remove parameter registers from used queue *)
  2377. PROCEDURE ReleaseParameterRegisters;
  2378. VAR entry,prev,next: RegisterEntry;
  2379. BEGIN
  2380. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  2381. WHILE entry # NIL DO
  2382. next := entry.next;
  2383. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  2384. registerUsageCount.DecUse(entry.register);
  2385. ASSERT(registerUsageCount.Use(entry.register)=0);
  2386. IF TraceRegisterUsageCount & (dump# NIL) THEN
  2387. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  2388. END;
  2389. ELSIF prev = NIL THEN
  2390. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  2391. ELSE
  2392. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  2393. END;
  2394. entry := next;
  2395. END;
  2396. END ReleaseParameterRegisters;
  2397. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  2398. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  2399. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2400. BEGIN
  2401. entry := saved;
  2402. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2403. entry := prev;
  2404. WHILE entry # NIL DO
  2405. prev := entry.prev;
  2406. type := entry.type;
  2407. class := entry.registerClass;
  2408. IntermediateCode.InitRegister(op,type,class,entry.register);
  2409. Emit(Pop(position,op));
  2410. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2411. entry := prev;
  2412. END;
  2413. END RestoreRegisters;
  2414. (* re-enter registers from array saved into array markedRegisters (recursion possible) *)
  2415. PROCEDURE RestoreRegisterUse(CONST saved: RegisterEntry);
  2416. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  2417. BEGIN
  2418. entry := saved;
  2419. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  2420. entry := prev;
  2421. WHILE entry # NIL DO
  2422. prev := entry.prev;
  2423. type := entry.type;
  2424. class := entry.registerClass;
  2425. IntermediateCode.InitRegister(op,type,class,entry.register);
  2426. Emit(Mov(position,op,op));
  2427. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  2428. entry := prev;
  2429. END;
  2430. END RestoreRegisterUse;
  2431. PROCEDURE CheckRegistersFree;
  2432. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  2433. BEGIN
  2434. IF usedRegisters # NIL THEN
  2435. r := usedRegisters;
  2436. WHILE r # NIL DO
  2437. warning := "register ";
  2438. Strings.AppendInt(warning, r.register);
  2439. Strings.Append(warning, " not released.");
  2440. Warning(position,warning);
  2441. r := r .next;
  2442. END;
  2443. END;
  2444. FOR i := 0 TO registerUsageCount.count-1 DO
  2445. IF registerUsageCount.used[i].count < 0 THEN
  2446. warning := "register ";
  2447. Strings.AppendInt(warning, i);
  2448. Strings.Append(warning, " unused too often.");
  2449. Warning(position,warning);
  2450. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  2451. warning := "register ";
  2452. Strings.AppendInt(warning, i);
  2453. Strings.Append(warning, " not unused often enough.");
  2454. Warning(position,warning);
  2455. END;
  2456. END;
  2457. END CheckRegistersFree;
  2458. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2459. Otherwise allocate a new register.
  2460. Does NOT necessarily keep the content of src1 or src2 in result! *)
  2461. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  2462. BEGIN
  2463. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2464. UseIntermediateOperand(result);
  2465. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2466. UseIntermediateOperand(result);
  2467. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  2468. END;
  2469. END Reuse2;
  2470. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  2471. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  2472. If not then allocate a new register.
  2473. Does NOT necessarily keep the content of src1 or src2 in result!
  2474. *)
  2475. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2476. BEGIN
  2477. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2478. UseIntermediateOperand(result);
  2479. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  2480. UseIntermediateOperand(result);
  2481. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  2482. result := alternative; alternative := emptyOperand;
  2483. UseIntermediateOperand(result);
  2484. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2485. END;
  2486. END Reuse2a;
  2487. (* like reuse2 but only one source *)
  2488. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2489. BEGIN
  2490. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2491. UseIntermediateOperand(result);
  2492. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2493. END;
  2494. END Reuse1;
  2495. (* like reuse2a but only one source *)
  2496. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  2497. BEGIN
  2498. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2499. UseIntermediateOperand(result);
  2500. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  2501. UseIntermediateOperand(result);
  2502. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2503. END;
  2504. END Reuse1a;
  2505. (* like reuse1 but guarantees that content of src1 is in result *)
  2506. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  2507. BEGIN
  2508. IF ReusableRegister(src1) THEN
  2509. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  2510. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  2511. UseIntermediateOperand(result);
  2512. ELSE
  2513. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  2514. Emit(Mov(position,result,src1));
  2515. END
  2516. END ReuseCopy;
  2517. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  2518. BEGIN
  2519. IF ReusableRegister(src) THEN
  2520. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  2521. ELSE
  2522. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  2523. Emit(Mov(position,result,src));
  2524. ReleaseIntermediateOperand(src);
  2525. END
  2526. END TransferToRegister;
  2527. (** labels and branches **)
  2528. PROCEDURE NewLabel(): Label;
  2529. VAR label: Label;
  2530. BEGIN
  2531. NEW(label,section); RETURN label;
  2532. END NewLabel;
  2533. (* EXPERIMENTAL *)
  2534. PROCEDURE EndBasicBlock;
  2535. VAR i: LONGINT;
  2536. BEGIN
  2537. i := 0;
  2538. WHILE (availableSymbols[i].symbol # NIL) DO
  2539. IF ~availableSymbols[i].inMemory & availableSymbols[i].inRegister THEN
  2540. Emit(Mov(position,availableSymbols[i].memory, availableSymbols[i].register));
  2541. END;
  2542. availableSymbols[i].symbol := NIL;
  2543. INC(i);
  2544. END;
  2545. END EndBasicBlock;
  2546. (* EXPERIMENTAL *)
  2547. PROCEDURE BeginBasicBlock;
  2548. BEGIN
  2549. ASSERT(availableSymbols[0].symbol = NIL);
  2550. END BeginBasicBlock;
  2551. PROCEDURE SetLabel(label: Label);
  2552. BEGIN
  2553. (* EXPERIMENTAL *)
  2554. EndBasicBlock;
  2555. BeginBasicBlock;
  2556. label.Resolve(section.pc);
  2557. END SetLabel;
  2558. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  2559. BEGIN
  2560. ASSERT(label # NIL);
  2561. IF label.pc < 0 THEN (* label not yet set *)
  2562. label.AddFixup(section.pc);
  2563. END;
  2564. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  2565. END LabelOperand;
  2566. PROCEDURE BrL(label: Label);
  2567. BEGIN
  2568. (* EXPERIMENTAL *)
  2569. EndBasicBlock;
  2570. Emit(Br(position,LabelOperand(label)));
  2571. END BrL;
  2572. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  2573. BEGIN
  2574. Emit(Brge(position,LabelOperand(label),left,right));
  2575. END BrgeL;
  2576. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  2577. BEGIN
  2578. Emit(Brlt(position,LabelOperand(label),left,right));
  2579. END BrltL;
  2580. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  2581. BEGIN
  2582. Emit(Breq(position,LabelOperand(label),left,right));
  2583. END BreqL;
  2584. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  2585. BEGIN
  2586. Emit(Brne(position,LabelOperand(label),left,right));
  2587. END BrneL;
  2588. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  2589. VAR new: IntermediateCode.Operand;
  2590. BEGIN
  2591. IF Trace THEN TraceEnter("Convert") END;
  2592. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  2593. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  2594. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  2595. & (operand.offset = 0)
  2596. THEN
  2597. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  2598. Emit(Conv(position,new,operand));
  2599. ELSE
  2600. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2601. Emit(Conv(position,new,operand));
  2602. ReleaseIntermediateOperand(operand);
  2603. END;
  2604. operand := new;
  2605. 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
  2606. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  2607. ELSE
  2608. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  2609. Emit(Conv(position,new,operand));
  2610. ReleaseIntermediateOperand(operand);
  2611. operand := new;
  2612. END;
  2613. IF Trace THEN TraceExit("Convert") END;
  2614. END Convert;
  2615. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  2616. VAR exit: Label;
  2617. BEGIN
  2618. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  2619. exit := NewLabel();
  2620. br(exit,left,right);
  2621. EmitTrap(position,trapNo);
  2622. SetLabel(exit);
  2623. END TrapC;
  2624. (** expressions *)
  2625. (** emit necessary runtime check for set elements **)
  2626. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  2627. VAR max: IntermediateCode.Operand;
  2628. BEGIN
  2629. IF isUnchecked THEN RETURN END;
  2630. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  2631. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  2632. TrapC(BrgeL, max, o, SetElementTrap);
  2633. END;
  2634. END CheckSetElement;
  2635. (** the set that a range represents **)
  2636. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  2637. VAR
  2638. operand: Operand;
  2639. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  2640. BEGIN
  2641. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  2642. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  2643. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  2644. one := IntermediateCode.Immediate(setType, 1);
  2645. Evaluate(x, operand);
  2646. Convert(operand.op, setType);
  2647. Convert(operand.tag, setType);
  2648. CheckSetElement(operand.op);
  2649. CheckSetElement(operand.tag);
  2650. (* create mask for lower bound
  2651. i.e. shift 11111111 to the left by the value of the lower bound
  2652. *)
  2653. Reuse1(temp, operand.op);
  2654. Emit(Shl(position,temp, allBits, operand.op));
  2655. ReleaseIntermediateOperand(operand.op);
  2656. operand.op := temp;
  2657. (* create mask for upper bound
  2658. i.e. shift 11111111 to the right by the difference between the
  2659. upper bound and the maximum number of set elements
  2660. *)
  2661. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2662. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2663. Reuse1(temp, operand.tag);
  2664. ELSE
  2665. Reuse1(temp, operand.tag);
  2666. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2667. Emit(Sub(position,temp, size, operand.tag));
  2668. END;
  2669. Emit(Shr(position,temp, allBits, operand.tag));
  2670. ReleaseIntermediateOperand(operand.tag);
  2671. operand.tag := temp;
  2672. Reuse2(resultingSet, operand.op, operand.tag);
  2673. (* intersect the two masks *)
  2674. Emit(And(position,resultingSet, operand.op, operand.tag));
  2675. ReleaseOperand(operand);
  2676. RETURN resultingSet
  2677. END SetFromRange;
  2678. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2679. VAR
  2680. res, operand: Operand;
  2681. temp, one, noBits, dest: IntermediateCode.Operand;
  2682. expression: SyntaxTree.Expression;
  2683. i: LONGINT;
  2684. BEGIN
  2685. IF Trace THEN TraceEnter("VisitSet") END;
  2686. dest := destination;
  2687. destination := emptyOperand;
  2688. noBits := IntermediateCode.Immediate(setType, 0);
  2689. one := IntermediateCode.Immediate(setType, 1);
  2690. (* start off with the empty set *)
  2691. InitOperand(res, ModeValue);
  2692. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2693. Emit(Mov(position,res.op, noBits));
  2694. FOR i := 0 TO x.elements.Length() - 1 DO
  2695. expression := x.elements.GetExpression(i);
  2696. IF expression IS SyntaxTree.RangeExpression THEN
  2697. (* range of set elements *)
  2698. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2699. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2700. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2701. ReleaseIntermediateOperand(temp)
  2702. ELSE
  2703. (* singelton element *)
  2704. Evaluate(expression, operand);
  2705. Convert(operand.op, setType);
  2706. CheckSetElement(operand.op);
  2707. (* create subset containing single element *)
  2708. Reuse1(temp, operand.op);
  2709. Emit(Shl(position,temp, one, operand.op));
  2710. ReleaseOperand(operand);
  2711. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2712. ReleaseIntermediateOperand(temp);
  2713. END
  2714. END;
  2715. result := res;
  2716. destination := dest;
  2717. IF Trace THEN TraceExit("VisitSet") END;
  2718. END VisitSet;
  2719. (* math arrays of the form [a,b,c]
  2720. x is a static array and thus does not provide any pointers
  2721. *)
  2722. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2723. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2724. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2725. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2726. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2727. element: SyntaxTree.IntegerValue;
  2728. BEGIN
  2729. numberElements := x.elements.Length();
  2730. expression := index.parameters.GetExpression(dim);
  2731. element := expression(SyntaxTree.IntegerValue);
  2732. FOR i := 0 TO numberElements-1 DO
  2733. expression := x.elements.GetExpression(i);
  2734. element.SetValue(i);
  2735. IF expression IS SyntaxTree.MathArrayExpression THEN
  2736. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2737. ELSE
  2738. Assign(index,expression);
  2739. END;
  2740. END;
  2741. END RecursiveAssignment;
  2742. PROCEDURE Dimension(): LONGINT;
  2743. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2744. BEGIN
  2745. dim := 0;
  2746. expression := x;
  2747. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2748. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2749. INC(dim);
  2750. END;
  2751. RETURN dim;
  2752. END Dimension;
  2753. BEGIN
  2754. (*static math array not providing pointers anyway *)
  2755. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2756. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2757. designator.SetType(variable.type);
  2758. dim := Dimension();
  2759. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2760. FOR i := 0 TO dim-1 DO
  2761. element := SyntaxTree.NewIntegerValue(x.position,0);
  2762. element.SetType(system.longintType);
  2763. index.parameters.AddExpression(element);
  2764. END;
  2765. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2766. RecursiveAssignment(x,0);
  2767. Expression(designator);
  2768. END VisitMathArrayExpression;
  2769. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2770. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2771. BEGIN
  2772. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2773. dest := destination; destination := emptyOperand;
  2774. IF x.operator = Scanner.Not THEN
  2775. Evaluate(x.left,operand);
  2776. InitOperand(result,ModeValue);
  2777. Reuse1a(result.op,operand.op,dest);
  2778. Emit(Xor(position,result.op,operand.op,true));
  2779. ReleaseOperand(operand);
  2780. ELSIF x.operator = Scanner.Minus THEN
  2781. Evaluate(x.left,operand);
  2782. InitOperand(result,ModeValue);
  2783. Reuse1a(result.op,operand.op,dest);
  2784. type := x.left.type.resolved;
  2785. IF type IS SyntaxTree.SetType THEN
  2786. Emit(Not(position,result.op,operand.op));
  2787. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2788. Reuse1(result.tag,operand.tag);
  2789. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2790. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2791. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2792. Emit(Neg(position,result.op,operand.op));
  2793. ELSE HALT(200)
  2794. END;
  2795. ReleaseOperand(operand);
  2796. ELSIF x.operator = Scanner.Address THEN
  2797. Designate(x.left,operand);
  2798. operand.mode := ModeValue;
  2799. t0 := x.left.type.resolved;
  2800. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2801. ReleaseIntermediateOperand(operand.op);
  2802. operand.op := operand.tag;
  2803. IntermediateCode.InitOperand(operand.tag);
  2804. END;
  2805. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2806. result := operand;
  2807. ELSE HALT(100)
  2808. END;
  2809. destination := dest;
  2810. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2811. END VisitUnaryExpression;
  2812. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2813. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; label: Label; reason: BOOLEAN; withPart: BOOLEAN);
  2814. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL,skip: Label; originalType: SyntaxTree.Type;
  2815. BEGIN
  2816. type := type.resolved;
  2817. originalType := type;
  2818. IF type IS SyntaxTree.PointerType THEN
  2819. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2820. END;
  2821. IF (type IS SyntaxTree.ObjectType) & reason THEN
  2822. BrL(label);
  2823. ELSE
  2824. ASSERT(type IS SyntaxTree.RecordType);
  2825. (*
  2826. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2827. *)
  2828. IF withPart THEN
  2829. left := tag;
  2830. ELSE
  2831. ReuseCopy(left,tag);
  2832. END;
  2833. right := TypeDescriptorAdr(type);
  2834. IF backend.cooperative THEN
  2835. repeatL := NewLabel();
  2836. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2837. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2838. END;
  2839. SetLabel(repeatL);
  2840. IF reason THEN
  2841. BreqL(label,left,right);
  2842. ELSE
  2843. skip := NewLabel();
  2844. BreqL(skip,left,right);
  2845. END;
  2846. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2847. BrneL(repeatL,left,nil);
  2848. IF ~reason THEN
  2849. BrL(label);
  2850. SetLabel(skip);
  2851. END;
  2852. ELSIF meta.simple THEN
  2853. level := type(SyntaxTree.RecordType).Level();
  2854. (* get type desc tag of level relative to base tag *)
  2855. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2856. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2857. IntermediateCode.MakeMemory(left,addressType);
  2858. IF reason THEN
  2859. BreqL(label,left,right);
  2860. ELSE
  2861. BrneL(label,left,right);
  2862. END;
  2863. ELSE
  2864. level := type(SyntaxTree.RecordType).Level();
  2865. (* get type desc tag of level relative to base tag *)
  2866. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2867. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2868. IntermediateCode.MakeMemory(left,addressType);
  2869. IF reason THEN
  2870. BreqL(label,left,right);
  2871. ELSE
  2872. BrneL(label,left,right);
  2873. END;
  2874. END;
  2875. IF ~withPart THEN
  2876. ReleaseIntermediateOperand(left);
  2877. END;
  2878. ReleaseIntermediateOperand(right);
  2879. END;
  2880. END TypeTest;
  2881. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2882. BEGIN
  2883. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2884. IF dump # NIL THEN
  2885. dump.String(s); dump.Ln;
  2886. END;
  2887. END Error;
  2888. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2889. BEGIN
  2890. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2891. IF dump # NIL THEN
  2892. dump.String(s); dump.Ln; dump.Update;
  2893. END;
  2894. END Warning;
  2895. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2896. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2897. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2898. operand:Operand;
  2899. BEGIN
  2900. previousSection := section;
  2901. Global.GetModuleName(mod,name);
  2902. Strings.Append(name,".@Trace");
  2903. Basic.ToSegmentedName(name, pooledName);
  2904. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2905. IF dump # NIL THEN dump := section.comments END;
  2906. IF backend.hasLinkRegister THEN
  2907. Emit(Push(Basic.invalidPosition, lr));
  2908. END;
  2909. variable := mod.moduleScope.firstVariable;
  2910. WHILE variable # NIL DO
  2911. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2912. Symbol(variable, operand);
  2913. register := operand.op;
  2914. CallTraceMethod(register, variable.type);
  2915. ReleaseIntermediateOperand(register);
  2916. END;
  2917. variable := variable.nextVariable;
  2918. END;
  2919. IF backend.hasLinkRegister THEN
  2920. Emit(Pop(Basic.invalidPosition, lr));
  2921. END;
  2922. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2923. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2924. Emit(Br(position,op));
  2925. INC(statCoopTraceModule, section.pc);
  2926. section := previousSection;
  2927. IF dump # NIL THEN dump := section.comments END;
  2928. END CreateTraceModuleMethod;
  2929. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2930. BEGIN
  2931. Emit (Push(position, dst));
  2932. Emit (Push(position, src));
  2933. CallThis(position,"GarbageCollector","Assign", 2);
  2934. END CallAssignPointer;
  2935. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2936. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2937. BEGIN
  2938. IF SemanticChecker.IsPointerType (type) THEN
  2939. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2940. ELSIF type.IsRecordType() THEN
  2941. Emit (Push(position,dst));
  2942. Emit (Push(position,src));
  2943. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2944. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2945. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2946. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2947. ELSIF IsStaticArray(type) THEN
  2948. size := StaticArrayNumElements(type);
  2949. base := StaticArrayBaseType(type);
  2950. IF base.IsRecordType() THEN
  2951. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2952. Emit (Push(position, dst));
  2953. Emit (Push(position, src));
  2954. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2955. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2956. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2957. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2958. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2959. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2960. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2961. Emit (Push(position, dst));
  2962. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2963. Emit (Push(position, src));
  2964. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2965. ELSE
  2966. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2967. Emit (Push(position, dst));
  2968. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2969. Emit (Push(position, src));
  2970. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2971. ASSERT(StaticArrayBaseType(type).IsPointer());
  2972. END;
  2973. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2974. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2975. Emit (Push(position, dst));
  2976. Emit (Push(position, src));
  2977. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2978. ELSE HALT(100); (* missing ? *)
  2979. END;
  2980. END CallAssignMethod;
  2981. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2982. VAR name: Basic.SegmentedName;
  2983. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2984. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2985. context: Context;
  2986. BEGIN
  2987. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2988. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2989. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2990. GetRecordTypeName (recordType,name);
  2991. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2992. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2993. section.SetExported (TRUE);
  2994. IF dump # NIL THEN dump := section.comments END;
  2995. IF backend.hasLinkRegister THEN
  2996. Emit(Push(Basic.invalidPosition, lr));
  2997. END;
  2998. variable := recordType.recordScope.firstVariable;
  2999. WHILE variable # NIL DO
  3000. IF variable.NeedsTrace() THEN
  3001. dst := NewRegisterOperand (addressType);
  3002. src := NewRegisterOperand (addressType);
  3003. Emit (Mov(position, dst, parameter1));
  3004. Emit (Mov(position, src, parameter2));
  3005. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  3006. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  3007. CallAssignMethod(dst, src, variable.type);
  3008. ReleaseIntermediateOperand(src);
  3009. ReleaseIntermediateOperand(dst);
  3010. END;
  3011. variable := variable.nextVariable;
  3012. END;
  3013. recordBase := recordType.GetBaseRecord();
  3014. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  3015. IF backend.hasLinkRegister THEN
  3016. Emit(Pop(Basic.invalidPosition, lr));
  3017. END;
  3018. GetRecordTypeName (recordBase,name);
  3019. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3020. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3021. Emit(Br(position,op));
  3022. ELSE
  3023. Emit(Exit(position,0,0, 0));
  3024. END;
  3025. IF ~recordType.isObject THEN
  3026. GetRecordTypeName (recordType,name);
  3027. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3028. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3029. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  3030. section.SetExported (TRUE);
  3031. NEW(registerUsageCount);
  3032. usedRegisters := NIL;
  3033. dst := NewRegisterOperand (addressType);
  3034. src := NewRegisterOperand (addressType);
  3035. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3036. Emit(Mov(position, dst, parameter1));
  3037. Emit(Mov(position, src, parameter2));
  3038. label := NewLabel();
  3039. SetLabel(label);
  3040. Emit(Push(position, dst));
  3041. Emit(Push(position, src));
  3042. GetRecordTypeName (recordType,name);
  3043. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  3044. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3045. Emit(Call(position, op, 0));
  3046. Emit(Pop(position, src));
  3047. Emit(Pop(position, dst));
  3048. Emit(Add(position, dst, dst, ofs));
  3049. Emit(Add(position, src, src, ofs));
  3050. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3051. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3052. Emit(Exit(position,0,0, 0));
  3053. END;
  3054. INC(statCoopAssignProcedure, section.pc);
  3055. ReturnToContext(context);
  3056. IF dump # NIL THEN dump := section.comments END;
  3057. END CreateAssignProcedure;
  3058. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  3059. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  3060. BEGIN
  3061. IF IsUnsafePointer (type) THEN
  3062. skip := NewLabel();
  3063. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  3064. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  3065. BreqL (skip, op, nil);
  3066. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  3067. SetLabel (skip);
  3068. ELSIF SemanticChecker.IsPointerType (type) THEN
  3069. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  3070. CallThis(position,"GarbageCollector","Mark", 1);
  3071. ELSIF type.IsRecordType() THEN
  3072. Emit (Push(position,register));
  3073. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  3074. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3075. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3076. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3077. ELSIF IsStaticArray(type) THEN
  3078. size := StaticArrayNumElements(type);
  3079. base := StaticArrayBaseType(type);
  3080. IF base.IsRecordType() THEN
  3081. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3082. Emit (Push(position, register));
  3083. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  3084. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3085. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3086. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3087. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  3088. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  3089. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3090. Emit (Push(position, register));
  3091. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  3092. ELSE
  3093. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  3094. Emit (Push(position, register));
  3095. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  3096. ASSERT(base.IsPointer());
  3097. END;
  3098. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  3099. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  3100. CallThis(position,"GarbageCollector","Mark", 1);
  3101. ELSE HALT(100); (* missing ? *)
  3102. END;
  3103. END CallTraceMethod;
  3104. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  3105. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  3106. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  3107. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  3108. BEGIN
  3109. previousSection := section;
  3110. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  3111. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  3112. GetRecordTypeName (recordType,name);
  3113. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3114. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3115. section.SetExported (TRUE);
  3116. IF dump # NIL THEN dump := section.comments END;
  3117. IF backend.hasLinkRegister THEN
  3118. Emit(Push(Basic.invalidPosition, lr));
  3119. END;
  3120. variable := recordType.recordScope.firstVariable;
  3121. WHILE variable # NIL DO
  3122. IF variable.NeedsTrace() THEN
  3123. register := NewRegisterOperand (addressType);
  3124. Emit (Mov(position,register,parameter1));
  3125. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  3126. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  3127. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3128. END;
  3129. CallTraceMethod(register, variable.type);
  3130. ReleaseIntermediateOperand(register);
  3131. END;
  3132. variable := variable.nextVariable;
  3133. END;
  3134. recordBase := recordType.GetBaseRecord();
  3135. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  3136. recordBase := recordBase.GetBaseRecord();
  3137. END;
  3138. IF recordBase # NIL THEN
  3139. IF backend.hasLinkRegister THEN
  3140. Emit(Pop(Basic.invalidPosition, lr));
  3141. END;
  3142. GetRecordTypeName (recordBase,name);
  3143. IF HasExplicitTraceMethod (recordBase) THEN
  3144. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  3145. ELSE
  3146. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3147. END;
  3148. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3149. Emit(Br(position,op));
  3150. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  3151. Emit(Exit(position,0,0,0));
  3152. ELSE
  3153. IF backend.hasLinkRegister THEN
  3154. Emit(Pop(Basic.invalidPosition, lr));
  3155. END;
  3156. IF recordType.isObject THEN
  3157. Basic.ToSegmentedName ("BaseTypes.Object",name);
  3158. ELSE
  3159. Basic.ToSegmentedName ("BaseTypes.Record",name);
  3160. END;
  3161. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3162. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3163. Emit(Br(position,op));
  3164. END;
  3165. IF ~recordType.isObject THEN
  3166. GetRecordTypeName (recordType,name);
  3167. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  3168. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3169. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  3170. section.SetExported (TRUE);
  3171. NEW(registerUsageCount);
  3172. usedRegisters := NIL;
  3173. IF dump # NIL THEN dump := section.comments END;
  3174. register := NewRegisterOperand (addressType);
  3175. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  3176. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  3177. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3178. END;
  3179. Emit (Push(position,register));
  3180. GetRecordTypeName (recordType,name);
  3181. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3182. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3183. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3184. ReleaseIntermediateOperand(register);
  3185. Emit(Exit(position,0,0,0));
  3186. GetRecordTypeName (recordType,name);
  3187. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3188. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3189. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  3190. section.SetExported (TRUE);
  3191. NEW(registerUsageCount);
  3192. usedRegisters := NIL;
  3193. register := NewRegisterOperand (addressType);
  3194. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3195. Emit(Mov(position, register, parameter1));
  3196. label := NewLabel();
  3197. SetLabel(label);
  3198. Emit(Push(position, register));
  3199. GetRecordTypeName (recordType,name);
  3200. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  3201. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3202. Emit(Call(position, op, 0));
  3203. Emit(Pop(position, register));
  3204. Emit(Add(position, register, register, ofs));
  3205. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3206. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3207. Emit(Exit(position,0,0,0));
  3208. END;
  3209. INC(statCoopTraceMethod, section.pc);
  3210. ReturnToContext(context);
  3211. IF dump # NIL THEN dump := section.comments END;
  3212. END CreateTraceMethod;
  3213. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  3214. VAR name: Basic.SegmentedName;
  3215. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  3216. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  3217. context: Context;
  3218. BEGIN
  3219. IF recordType.isObject THEN RETURN END;
  3220. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  3221. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  3222. GetRecordTypeName (recordType,name);
  3223. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3224. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3225. section.SetExported (TRUE);
  3226. IF dump # NIL THEN dump := section.comments END;
  3227. IF backend.hasLinkRegister THEN
  3228. Emit(Push(Basic.invalidPosition, lr));
  3229. END;
  3230. variable := recordType.recordScope.firstVariable;
  3231. WHILE variable # NIL DO
  3232. IF variable.NeedsTrace() THEN
  3233. dst := NewRegisterOperand (addressType);
  3234. Emit (Mov(position, dst, parameter1));
  3235. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  3236. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  3237. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3238. END;
  3239. CallResetProcedure(dst, nil, variable.type);
  3240. ReleaseIntermediateOperand(dst);
  3241. END;
  3242. variable := variable.nextVariable;
  3243. END;
  3244. recordBase := recordType.GetBaseRecord();
  3245. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  3246. IF backend.hasLinkRegister THEN
  3247. Emit(Pop(Basic.invalidPosition, lr));
  3248. END;
  3249. GetRecordTypeName (recordBase,name);
  3250. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3251. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3252. Emit(Br(position,op));
  3253. ELSE
  3254. Emit(Exit(position,0,0, 0));
  3255. END;
  3256. GetRecordTypeName (recordType,name);
  3257. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3258. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3259. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  3260. section.SetExported (TRUE);
  3261. NEW(registerUsageCount);
  3262. usedRegisters := NIL;
  3263. dst := NewRegisterOperand (addressType);
  3264. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  3265. Emit(Mov(position, dst, parameter1));
  3266. label := NewLabel();
  3267. SetLabel(label);
  3268. Emit(Push(position, dst));
  3269. GetRecordTypeName (recordType,name);
  3270. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3271. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3272. Emit(Call(position, op, 0));
  3273. Emit(Pop(position, dst));
  3274. Emit(Add(position, dst, dst, ofs));
  3275. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  3276. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  3277. Emit(Exit(position,0,0, 0));
  3278. INC(statCoopResetProcedure, section.pc);
  3279. ReturnToContext(context);
  3280. IF dump # NIL THEN dump := section.comments END;
  3281. END CreateResetProcedure;
  3282. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  3283. VAR name: Basic.SegmentedName; context: Context;
  3284. BEGIN
  3285. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  3286. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3287. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  3288. IF dump # NIL THEN dump := section.comments END;
  3289. IF backend.hasLinkRegister THEN
  3290. Emit(Push(Basic.invalidPosition, lr));
  3291. END;
  3292. Emit(Push(position,fp));
  3293. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  3294. ResetVariables(scope);
  3295. Emit(Pop(position,fp));
  3296. Emit(Exit(position,0,0, 0));
  3297. ReturnToContext(context);
  3298. IF dump # NIL THEN dump := section.comments END;
  3299. END CreateResetMethod;
  3300. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  3301. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  3302. BEGIN
  3303. IF SemanticChecker.IsPointerType (type) THEN
  3304. Emit (Push(position, dest));
  3305. CallThis(position,"GarbageCollector","Reset", 1);
  3306. ELSIF type.IsRecordType() THEN
  3307. Emit (Push(position, dest));
  3308. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  3309. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3310. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3311. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  3312. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  3313. size := GetArrayLength(type, tag);
  3314. base := ArrayBaseType(type);
  3315. IF base.IsRecordType() THEN
  3316. Emit (Push(position, size));
  3317. Emit (Push(position, dest));
  3318. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  3319. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  3320. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3321. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3322. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  3323. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  3324. Emit (Push(position, size));
  3325. Emit (Push(position, dest));
  3326. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  3327. ELSE
  3328. Emit (Push(position, size));
  3329. Emit (Push(position, dest));
  3330. CallThis(position,"GarbageCollector","ResetArray", 2);
  3331. ASSERT(ArrayBaseType(type).IsPointer());
  3332. END;
  3333. ReleaseIntermediateOperand(size);
  3334. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  3335. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  3336. Emit (Push(position, dest));
  3337. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  3338. ELSE HALT(100); (* missing ? *)
  3339. END;
  3340. END CallResetProcedure;
  3341. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  3342. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; prevOffset: SIZE; pc: LONGINT;
  3343. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  3344. VAR operand: Operand;
  3345. BEGIN
  3346. Symbol (symbol, operand);
  3347. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  3348. ReleaseOperand(operand);
  3349. END Reset;
  3350. BEGIN
  3351. previousScope := currentScope;
  3352. currentScope := scope;
  3353. pc := section.pc;
  3354. prevOffset := MAX(SIZE);
  3355. variable := scope.firstVariable;
  3356. WHILE variable # NIL DO
  3357. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  3358. Reset (variable);
  3359. prevOffset := variable.offsetInBits;
  3360. END;
  3361. variable := variable.nextVariable;
  3362. END;
  3363. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  3364. WHILE parameter # NIL DO
  3365. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  3366. Reset (parameter);
  3367. END;
  3368. parameter := parameter.nextParameter;
  3369. END;
  3370. INC(statCoopResetVariables, section.pc - pc);
  3371. currentScope := previousScope;
  3372. END ResetVariables;
  3373. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  3374. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  3375. BEGIN
  3376. type := symbol.type.resolved;
  3377. SaveRegisters();ReleaseUsedRegisters(saved);
  3378. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  3379. Symbol(symbol, operand);
  3380. ToMemory(operand.op,addressType,0);
  3381. Emit(Push(position,operand.op));
  3382. IF refer THEN
  3383. CallThis(position,"Heaps","Refer",1);
  3384. ELSE
  3385. CallThis(position,"Heaps","Reset",1);
  3386. END;
  3387. ELSIF type.IsRecordType() THEN
  3388. Symbol(symbol, operand);
  3389. Emit(Push(position,operand.op));
  3390. Emit(Push(position,operand.tag)); (* type desc *)
  3391. IF refer THEN
  3392. CallThis(position,"Heaps","ReferRecord",2);
  3393. ELSE
  3394. CallThis(position,"Heaps","ResetRecord",2);
  3395. END;
  3396. ELSIF IsStaticArray(type) THEN
  3397. size := StaticArrayNumElements(type);
  3398. base := StaticArrayBaseType(type);
  3399. Symbol(symbol, operand);
  3400. arg := TypeDescriptorAdr(base);
  3401. Emit(Push(position,operand.op));
  3402. Emit(Push(position,arg));
  3403. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  3404. ReleaseIntermediateOperand(arg);
  3405. IF refer THEN
  3406. CallThis(position,"Heaps","ReferArray",3);
  3407. ELSE
  3408. CallThis(position,"Heaps","ResetArray",3);
  3409. END;
  3410. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  3411. size := StaticMathArrayNumElements(type);
  3412. base := StaticMathArrayBaseType(type);
  3413. Symbol(symbol, operand);
  3414. arg := TypeDescriptorAdr(base);
  3415. Emit(Push(position,operand.op));
  3416. Emit(Push(position,arg));
  3417. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  3418. ReleaseIntermediateOperand(arg);
  3419. IF refer THEN
  3420. CallThis(position,"Heaps","ReferArray",3);
  3421. ELSE
  3422. CallThis(position,"Heaps","ResetArray",3);
  3423. END;
  3424. ELSIF type IS SyntaxTree.MathArrayType THEN
  3425. Symbol(symbol, operand);
  3426. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3427. Emit (Push(position, operand.op));
  3428. ELSE
  3429. Emit (Push(position, operand.tag));
  3430. END;
  3431. IF refer THEN
  3432. CallThis(position,"Heaps","ReferMathArray", 1);
  3433. ELSE
  3434. CallThis(position,"Heaps","ResetMathArray", 1);
  3435. END;
  3436. ELSIF type IS SyntaxTree.ProcedureType THEN
  3437. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  3438. Symbol(symbol, operand);
  3439. Emit (Push(position, operand.tag));
  3440. IF refer THEN
  3441. CallThis(position,"Heaps","Refer", 1);
  3442. ELSE
  3443. CallThis(position,"Heaps","Reset", 1);
  3444. END;
  3445. ELSE HALT(100); (* missing ? *)
  3446. END;
  3447. ReleaseOperand(operand);
  3448. RestoreRegisters(saved);
  3449. END Reset;
  3450. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  3451. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  3452. BEGIN
  3453. previousScope := currentScope;
  3454. currentScope := scope;
  3455. pc := section.pc;
  3456. IF ~ refer THEN
  3457. variable := scope.firstVariable;
  3458. prevOffset := MAX(SIZE);
  3459. WHILE variable # NIL DO
  3460. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  3461. Reset (variable,refer);
  3462. prevOffset := variable.offsetInBits;
  3463. END;
  3464. variable := variable.nextVariable;
  3465. END;
  3466. END;
  3467. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  3468. WHILE parameter # NIL DO
  3469. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  3470. Reset (parameter,refer);
  3471. END;
  3472. parameter := parameter.nextParameter;
  3473. END;
  3474. INC(statCoopResetVariables, section.pc - pc);
  3475. currentScope := previousScope;
  3476. END ResetVariables2;
  3477. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  3478. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  3479. VAR op: IntermediateCode.Operand; context: Context;
  3480. BEGIN
  3481. previousSection := section;
  3482. GetCodeSectionNameForSymbol(procedure, name);
  3483. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  3484. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  3485. IF dump # NIL THEN dump := section.comments END;
  3486. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  3487. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3488. Emit(Data(position,op));
  3489. Emit(Data(position,nil));
  3490. IF HasPointers (procedure.procedureScope) THEN
  3491. GetCodeSectionNameForSymbol(procedure, name);
  3492. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  3493. ELSE
  3494. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  3495. END;
  3496. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  3497. Emit(Data(position,op));
  3498. ReturnToContext(context);
  3499. IF dump # NIL THEN dump := section.comments END;
  3500. END CreateProcedureDescriptor;
  3501. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  3502. VAR import: SyntaxTree.Import;
  3503. s: Basic.MessageString;
  3504. selfName: SyntaxTree.IdentifierString;
  3505. BEGIN
  3506. moduleScope.ownerModule.GetName(selfName);
  3507. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  3508. module := moduleScope.ownerModule
  3509. ELSE
  3510. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  3511. IF import = NIL THEN
  3512. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  3513. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  3514. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  3515. s := "Module ";
  3516. Strings.Append(s,moduleName);
  3517. Strings.Append(s," cannot be imported.");
  3518. IF force THEN
  3519. Error(position,s);
  3520. ELSIF canBeLoaded THEN
  3521. IF WarningDynamicLoading THEN
  3522. Strings.Append(s, "=> no dynamic linking.");
  3523. Warning(position, s);
  3524. END;
  3525. canBeLoaded := FALSE;
  3526. END;
  3527. RETURN FALSE
  3528. ELSE
  3529. SELF.module.imports.AddName(moduleName)
  3530. END;
  3531. ELSIF import.module = NIL THEN (* already tried *)
  3532. RETURN FALSE
  3533. END;
  3534. module := import.module;
  3535. END;
  3536. RETURN TRUE
  3537. END AddImport;
  3538. (* needed for old binary object file format*)
  3539. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  3540. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  3541. BEGIN
  3542. IF AddImport(moduleName,module,TRUE) THEN
  3543. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3544. IF procedure = NIL THEN
  3545. s := "Instruction not supported on target, emulation procedure ";
  3546. Strings.Append(s,moduleName);
  3547. Strings.Append(s,".");
  3548. Strings.Append(s,procedureName);
  3549. Strings.Append(s," not present");
  3550. Error(position,s);
  3551. ELSE
  3552. StaticCallOperand(r,procedure);
  3553. ReleaseOperand(r);
  3554. fp := GetFingerprint(procedure);
  3555. END;
  3556. END;
  3557. END EnsureSymbol;
  3558. PROCEDURE ConditionValue(x: SyntaxTree.Expression): Operand;
  3559. VAR trueL, exitL: Label; op: Operand;
  3560. BEGIN
  3561. InitOperand(op,ModeValue);
  3562. trueL := NewLabel();
  3563. exitL := NewLabel();
  3564. Condition(x,trueL,TRUE);
  3565. IntermediateCode.InitRegister(op.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  3566. Emit(Mov(position,op.op,false));
  3567. BrL(exitL);
  3568. SetLabel(trueL);
  3569. Emit(MovReplace(position,op.op,true));
  3570. SetLabel(exitL);
  3571. RETURN op;
  3572. END ConditionValue;
  3573. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3574. VAR size: LONGINT;
  3575. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3576. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  3577. BEGIN
  3578. ASSERT(type.form = SyntaxTree.Open);
  3579. baseType := type.arrayBase.resolved;
  3580. IF IsOpenArray(baseType) THEN
  3581. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3582. ELSE
  3583. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  3584. sizeOperand := IntermediateCode.Immediate(addressType,size);
  3585. END;
  3586. len := tag;
  3587. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3588. IntermediateCode.MakeMemory(len,addressType);
  3589. UseIntermediateOperand(len);
  3590. Reuse2(res,sizeOperand,len);
  3591. Emit(Mul(position,res,sizeOperand,len));
  3592. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3593. RETURN res
  3594. END GetArraySize;
  3595. BEGIN
  3596. type := type.resolved;
  3597. IF IsOpenArray(type) THEN
  3598. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  3599. RETURN tag
  3600. ELSE
  3601. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  3602. END;
  3603. ELSE
  3604. size := ToMemoryUnits(system,system.SizeOf(type));
  3605. RETURN IntermediateCode.Immediate(addressType,size)
  3606. END;
  3607. END GetDynamicSize;
  3608. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  3609. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  3610. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  3611. BEGIN
  3612. ASSERT(type.form = SyntaxTree.Open);
  3613. baseType := type.arrayBase.resolved;
  3614. IF IsOpenArray(baseType) THEN
  3615. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  3616. ELSE
  3617. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  3618. END;
  3619. len := tag;
  3620. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  3621. IntermediateCode.MakeMemory(len,addressType);
  3622. UseIntermediateOperand(len);
  3623. Reuse2(res,sizeOperand,len);
  3624. Emit(Mul(position,res,sizeOperand,len));
  3625. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  3626. RETURN res
  3627. END GetLength;
  3628. BEGIN
  3629. type := type.resolved;
  3630. IF IsOpenArray(type) THEN
  3631. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  3632. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  3633. ELSIF type IS SyntaxTree.StringType THEN
  3634. RETURN tag;
  3635. ELSE
  3636. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  3637. END;
  3638. END GetArrayLength;
  3639. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3640. VAR result: IntermediateCode.Operand;
  3641. BEGIN
  3642. IF backend.cooperative THEN
  3643. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  3644. ELSE
  3645. MakeMemory(result, tag, addressType, 0);
  3646. END;
  3647. RETURN result
  3648. END GetSizeFromTag;
  3649. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3650. VAR parameter: SyntaxTree.Parameter;
  3651. BEGIN
  3652. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  3653. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  3654. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3655. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  3656. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  3657. END;
  3658. RETURN GetDynamicSize(e.type, tag);
  3659. END GetArrayOfBytesSize;
  3660. (*
  3661. to find imported symbol. not needed ?
  3662. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  3663. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  3664. BEGIN
  3665. IF AddImport(moduleName,importedModule,FALSE) THEN
  3666. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  3667. RETURN symbol
  3668. ELSE
  3669. RETURN NIL
  3670. END
  3671. END SymbolByName;
  3672. *)
  3673. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  3674. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  3675. BEGIN
  3676. IF AddImport(moduleName,runtimeModule,force) THEN
  3677. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3678. IF procedure = NIL THEN
  3679. s := "Procedure ";
  3680. Strings.Append(s,moduleName);
  3681. Strings.Append(s,".");
  3682. Strings.Append(s,procedureName);
  3683. Strings.Append(s," not present");
  3684. Error(position,s);
  3685. RETURN FALSE
  3686. ELSE
  3687. RETURN TRUE
  3688. END;
  3689. ELSE RETURN FALSE
  3690. END;
  3691. END GetRuntimeProcedure;
  3692. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3693. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3694. s: Basic.MessageString;
  3695. BEGIN
  3696. Basic.InitSegmentedName(name);
  3697. name[0] := Basic.MakeString(moduleName);
  3698. name[1] := Basic.MakeString(typeName);
  3699. name[2] := -1;
  3700. IF AddImport(moduleName,importedModule, FALSE) THEN
  3701. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3702. IF symbol = NIL THEN
  3703. s := "type ";
  3704. Strings.Append(s,moduleName);
  3705. Strings.Append(s,".");
  3706. Strings.Append(s,typeName);
  3707. Strings.Append(s," not present");
  3708. Error(position,s);
  3709. END;
  3710. ELSE symbol := NIL;
  3711. END;
  3712. IF importedModule = moduleScope.ownerModule THEN
  3713. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3714. ELSE
  3715. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3716. END;
  3717. RETURN symbol
  3718. END GetTypeDescriptor;
  3719. (* 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. *)
  3720. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3721. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3722. pooledName: Basic.SegmentedName; size: LONGINT;
  3723. BEGIN
  3724. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3725. StaticCallOperand(result,procedure);
  3726. IF numberParameters < 0 THEN
  3727. size := ProcParametersSize(procedure);
  3728. ELSE
  3729. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3730. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3731. Error(position,"runtime call parameter count mismatch");
  3732. END;
  3733. END;
  3734. Emit(Call(position, result.op, size));
  3735. ReleaseOperand(result);
  3736. ELSE (* only static linking possible *)
  3737. ASSERT(numberParameters >= 0);
  3738. Basic.InitSegmentedName(pooledName);
  3739. pooledName[0] := Basic.MakeString(moduleName);
  3740. pooledName[1] := Basic.MakeString(procedureName);
  3741. pooledName[2] := -1;
  3742. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3743. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3744. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3745. END;
  3746. END CallThisChecked;
  3747. (* 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. *)
  3748. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3749. BEGIN
  3750. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3751. END CallThis;
  3752. PROCEDURE CompareString(br: ConditionalBranch; label: Label; leftExpression,rightExpression: SyntaxTree.Expression);
  3753. VAR
  3754. left,right: Operand;
  3755. leftSize, rightSize: IntermediateCode.Operand;
  3756. saved: RegisterEntry;
  3757. reg: IntermediateCode.Operand;
  3758. procedureName: SyntaxTree.IdentifierString;
  3759. BEGIN
  3760. procedureName := "CompareString";
  3761. SaveRegisters();ReleaseUsedRegisters(saved);
  3762. Designate(leftExpression,left);
  3763. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3764. Emit(Push(position,leftSize));
  3765. ReleaseIntermediateOperand(leftSize);
  3766. Emit(Push(position,left.op));
  3767. ReleaseOperand(left);
  3768. Designate(rightExpression,right);
  3769. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3770. Emit(Push(position,rightSize));
  3771. ReleaseIntermediateOperand(rightSize);
  3772. Emit(Push(position,right.op));
  3773. ReleaseOperand(right);
  3774. CallThis(position,builtinsModuleName,procedureName, 4);
  3775. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3776. Emit(Result(position,reg));
  3777. RestoreRegisters(saved);
  3778. br(label,reg,IntermediateCode.Immediate(int8,0));
  3779. ReleaseIntermediateOperand(reg);
  3780. END CompareString;
  3781. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3782. VAR
  3783. left,right: Operand;
  3784. leftSize, rightSize: IntermediateCode.Operand;
  3785. saved: RegisterEntry;
  3786. procedureName: SyntaxTree.IdentifierString;
  3787. BEGIN
  3788. procedureName := "CopyString";
  3789. SaveRegisters();ReleaseUsedRegisters(saved);
  3790. Designate(leftExpression,left);
  3791. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3792. Emit(Push(position,leftSize));
  3793. ReleaseIntermediateOperand(leftSize);
  3794. Emit(Push(position,left.op));
  3795. ReleaseOperand(left);
  3796. Designate(rightExpression,right);
  3797. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3798. Emit(Push(position,rightSize));
  3799. ReleaseIntermediateOperand(rightSize);
  3800. Emit(Push(position,right.op));
  3801. ReleaseOperand(right);
  3802. CallThis(position,builtinsModuleName,procedureName,4);
  3803. RestoreRegisters(saved);
  3804. END CopyString;
  3805. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3806. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3807. leftType,rightType: SyntaxTree.Type;
  3808. leftExpression,rightExpression : SyntaxTree.Expression;
  3809. componentType: IntermediateCode.Type;
  3810. exit: Label; dest: IntermediateCode.Operand;
  3811. size: LONGINT;
  3812. BEGIN
  3813. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3814. dest := destination; destination := emptyOperand;
  3815. leftType := x.left.type.resolved;
  3816. rightType := x.right.type.resolved;
  3817. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3818. CASE x.operator OF
  3819. Scanner.Or, Scanner.And, Scanner.Is:
  3820. result := ConditionValue(x);
  3821. |Scanner.Plus:
  3822. Evaluate(x.left,left);
  3823. Evaluate(x.right,right);
  3824. IF leftType IS SyntaxTree.SetType THEN
  3825. InitOperand(result,ModeValue);
  3826. Reuse2a(result.op,left.op,right.op,dest);
  3827. Emit(Or(position,result.op,left.op,right.op));
  3828. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3829. InitOperand(result,ModeValue);
  3830. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3831. Reuse2(result.tag,left.tag,right.tag);
  3832. Emit(Add(position,result.op,left.op,right.op));
  3833. Emit(Add(position,result.tag,left.tag,right.tag))
  3834. ELSE
  3835. InitOperand(result,ModeValue);
  3836. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3837. AddInt(result.op, left.op, right.op) ;
  3838. ELSE
  3839. *)
  3840. Reuse2a(result.op,left.op,right.op,dest);
  3841. Emit(Add(position,result.op,left.op,right.op));
  3842. (*
  3843. END;
  3844. *)
  3845. END;
  3846. ReleaseOperand(left); ReleaseOperand(right);
  3847. |Scanner.Minus:
  3848. Evaluate(x.left,left);
  3849. Evaluate(x.right,right);
  3850. IF leftType IS SyntaxTree.SetType THEN
  3851. InitOperand(result,ModeValue);
  3852. Reuse1(result.op,right.op);
  3853. Emit(Not(position,result.op,right.op));
  3854. ReleaseOperand(right);
  3855. Emit(And(position,result.op,result.op,left.op));
  3856. ReleaseOperand(left);
  3857. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3858. InitOperand(result,ModeValue);
  3859. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3860. Reuse2(result.tag,left.tag,right.tag);
  3861. Emit(Sub(position,result.op,left.op,right.op));
  3862. Emit(Sub(position,result.tag,left.tag,right.tag));
  3863. ReleaseOperand(left); ReleaseOperand(right)
  3864. ELSE
  3865. InitOperand(result,ModeValue);
  3866. Reuse2a(result.op,left.op,right.op,dest);
  3867. Emit(Sub(position,result.op,left.op,right.op));
  3868. ReleaseOperand(left); ReleaseOperand(right);
  3869. END;
  3870. |Scanner.Times:
  3871. Evaluate(x.left,left);
  3872. Evaluate(x.right,right);
  3873. IF leftType IS SyntaxTree.SetType THEN
  3874. InitOperand(result,ModeValue);
  3875. Reuse2a(result.op,left.op,right.op,dest);
  3876. Emit(And(position,result.op,left.op,right.op));
  3877. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3878. InitOperand(result, ModeValue);
  3879. componentType := left.op.type;
  3880. (* TODO: review this *)
  3881. (*
  3882. result.op = left.op * right.op - left.tag * right.tag
  3883. result.tag = left.tag * right.op + left.op * right.tag
  3884. *)
  3885. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3886. Emit(Mul(position,result.op, left.op, right.op));
  3887. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3888. Emit(Mul(position,tempReg, left.tag, right.tag));
  3889. Emit(Sub(position,result.op, result.op, tempReg));
  3890. Reuse2(result.tag, left.tag, right.op);
  3891. Emit(Mul(position,result.tag, left.tag, right.op));
  3892. Emit(Mul(position,tempReg, left.op, right.tag));
  3893. Emit(Add(position,result.tag, result.tag, tempReg));
  3894. ReleaseIntermediateOperand(tempReg)
  3895. ELSE
  3896. InitOperand(result,ModeValue);
  3897. Reuse2a(result.op,left.op,right.op,dest);
  3898. Emit(Mul(position,result.op,left.op,right.op));
  3899. END;
  3900. ReleaseOperand(left); ReleaseOperand(right);
  3901. |Scanner.Div:
  3902. Evaluate(x.left,left);
  3903. Evaluate(x.right,right);
  3904. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3905. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3906. IF ~isUnchecked THEN
  3907. exit := NewLabel();
  3908. BrltL(exit,zero,right.op);
  3909. EmitTrap(position,NegativeDivisorTrap);
  3910. SetLabel(exit);
  3911. END;
  3912. END;
  3913. InitOperand(result,ModeValue);
  3914. Reuse2a(result.op,left.op,right.op,dest);
  3915. Emit(Div(position,result.op,left.op,right.op));
  3916. ReleaseOperand(left); ReleaseOperand(right);
  3917. |Scanner.Mod:
  3918. Evaluate(x.left,left);
  3919. Evaluate(x.right,right);
  3920. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3921. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3922. IF ~isUnchecked THEN
  3923. exit := NewLabel();
  3924. BrltL(exit,zero,right.op);
  3925. EmitTrap(position,NegativeDivisorTrap);
  3926. SetLabel(exit);
  3927. END;
  3928. END;
  3929. InitOperand(result,ModeValue);
  3930. Reuse2a(result.op,left.op,right.op,dest);
  3931. Emit(Mod(position,result.op,left.op,right.op));
  3932. ReleaseOperand(left); ReleaseOperand(right);
  3933. |Scanner.Slash:
  3934. Evaluate(x.left,left);
  3935. Evaluate(x.right,right);
  3936. IF leftType IS SyntaxTree.SetType THEN
  3937. InitOperand(result,ModeValue);
  3938. Reuse2a(result.op,left.op,right.op,dest);
  3939. Emit(Xor(position,result.op,left.op,right.op));
  3940. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3941. InitOperand(result,ModeValue);
  3942. componentType := left.op.type;
  3943. (* review this *)
  3944. (*
  3945. divisor = right.op * right.op + right.tag * right.tag
  3946. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3947. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3948. *)
  3949. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3950. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3951. Emit(Mul(position,tempReg, right.op, right.op));
  3952. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3953. Emit(Add(position,tempReg, tempReg, tempReg2));
  3954. result.op := tempReg2;
  3955. Emit(Mul(position,result.op, left.op, right.op));
  3956. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3957. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3958. Emit(Add(position,result.op, result.op, tempReg2));
  3959. Emit(Div(position,result.op, result.op, tempReg));
  3960. Reuse2(result.tag, left.tag, right.op);
  3961. Emit(Mul(position,result.tag, left.tag, right.op));
  3962. Emit(Mul(position,tempReg2, left.op, right.tag));
  3963. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3964. Emit(Div(position,result.tag, result.tag, tempReg));
  3965. ReleaseIntermediateOperand(tempReg);
  3966. ReleaseIntermediateOperand(tempReg2)
  3967. ELSE
  3968. InitOperand(result,ModeValue);
  3969. Reuse2a(result.op,left.op,right.op,dest);
  3970. Emit(Div(position,result.op,left.op,right.op));
  3971. END;
  3972. ReleaseOperand(left); ReleaseOperand(right);
  3973. |Scanner.Equal, Scanner.LessEqual, Scanner.Less, Scanner.Greater, Scanner.GreaterEqual, Scanner.Unequal :
  3974. result := ConditionValue(x);
  3975. |Scanner.In:
  3976. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3977. Evaluate(x.left,left);
  3978. Evaluate(x.right,right);
  3979. Convert(left.op,setType);
  3980. Convert(right.op,setType);
  3981. ReuseCopy(temp.op,right.op);
  3982. Emit(Shr(position,temp.op,temp.op,left.op));
  3983. ReleaseOperand(right); ReleaseOperand(left);
  3984. IntermediateCode.InitImmediate(one,setType,1);
  3985. Emit(And(position,temp.op,temp.op,one));
  3986. Convert(temp.op,bool);
  3987. result.mode := ModeValue;
  3988. result.op := temp.op;
  3989. result.tag := nil; (* may be left over from calls to evaluate *)
  3990. ELSE
  3991. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3992. IF x.operator = Scanner.Questionmarks THEN
  3993. leftExpression := x.left;
  3994. rightExpression := x.right;
  3995. ELSE
  3996. leftExpression := x.right;
  3997. rightExpression := x.left;
  3998. END;
  3999. Evaluate(leftExpression, left);
  4000. Emit(Push(position,left.op));
  4001. ReleaseOperand(left);
  4002. Designate(rightExpression, right);
  4003. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  4004. IF ~backend.cellsAreObjects THEN
  4005. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  4006. END;
  4007. Emit(Push(position,right.op));
  4008. ReleaseOperand(right);
  4009. IF backend.cellsAreObjects THEN
  4010. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  4011. ELSE
  4012. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  4013. END;
  4014. InitOperand(result, ModeValue);
  4015. result.op := NewRegisterOperand(bool);
  4016. Emit(Result(position,result.op));
  4017. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  4018. leftExpression := x.left;
  4019. rightExpression := x.right;
  4020. Evaluate(leftExpression, left);
  4021. Emit(Push(position,left.op));
  4022. ReleaseOperand(left);
  4023. Evaluate(rightExpression, right);
  4024. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  4025. IF ~backend.cellsAreObjects THEN
  4026. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  4027. END;
  4028. Emit(Push(position,right.op));
  4029. ReleaseOperand(right);
  4030. IF backend.cellsAreObjects THEN
  4031. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  4032. ELSE
  4033. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  4034. END;
  4035. InitOperand(result, ModeValue);
  4036. result.op := NewRegisterOperand(bool);
  4037. Emit(Result(position,result.op));
  4038. ELSE
  4039. HALT(100);
  4040. END;
  4041. END;
  4042. destination := dest;
  4043. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  4044. END VisitBinaryExpression;
  4045. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  4046. VAR localResult, operand: Operand;
  4047. BEGIN
  4048. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  4049. InitOperand(localResult, ModeValue);
  4050. ASSERT(x.first # NIL);
  4051. Evaluate(x.first, operand);
  4052. localResult.op := operand.op;
  4053. ReleaseOperand(operand);
  4054. UseIntermediateOperand(localResult.op);
  4055. ASSERT(x.last # NIL);
  4056. Evaluate(x.last, operand);
  4057. localResult.tag := operand.op;
  4058. ReleaseOperand(operand);
  4059. UseIntermediateOperand(localResult.tag);
  4060. IF x.step # NIL THEN
  4061. Evaluate(x.step, operand);
  4062. localResult.extra := operand.op;
  4063. ReleaseOperand(operand);
  4064. UseIntermediateOperand(localResult.extra);
  4065. END;
  4066. result := localResult;
  4067. IF Trace THEN TraceExit("VisitRangeExpression") END
  4068. END VisitRangeExpression;
  4069. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  4070. BEGIN
  4071. HALT(100); (* should never be evaluated *)
  4072. END VisitTensorRangeExpression;
  4073. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  4074. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  4075. BEGIN
  4076. IF Trace THEN TraceEnter("VisitConversion") END;
  4077. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  4078. dest := destination; destination := emptyOperand;
  4079. Evaluate(x.expression,old);
  4080. InitOperand(result,ModeValue);
  4081. result.op := old.op;
  4082. ASSERT(result.op.mode # 0);
  4083. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  4084. (* convert TO a complex number *)
  4085. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  4086. Convert(result.op,IntermediateCode.GetType(system, componentType));
  4087. ASSERT(result.op.mode # 0);
  4088. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  4089. (* convert FROM a complex number TO a complex number*)
  4090. result.tag := old.tag;
  4091. ASSERT(result.tag.mode # 0);
  4092. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  4093. ASSERT(result.tag.mode # 0)
  4094. ELSE
  4095. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  4096. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  4097. END
  4098. ELSE
  4099. Convert(result.op,IntermediateCode.GetType(system,x.type));
  4100. ASSERT(result.op.mode # 0);
  4101. result.tag := old.tag; (*! probably never used *)
  4102. END;
  4103. destination := dest;
  4104. IF Trace THEN TraceExit("VisitConversion") END;
  4105. END VisitConversion;
  4106. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  4107. BEGIN
  4108. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  4109. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  4110. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  4111. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  4112. END VisitTypeDeclaration;
  4113. (** designators (expressions) *)
  4114. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  4115. VAR ownerType, designatorType: SyntaxTree.RecordType;
  4116. BEGIN
  4117. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  4118. IF x.left # NIL THEN Expression(x.left) END;
  4119. Symbol(x.symbol,result);
  4120. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  4121. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  4122. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  4123. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  4124. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  4125. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  4126. END;
  4127. END;
  4128. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  4129. END VisitSymbolDesignator;
  4130. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  4131. BEGIN
  4132. IF isUnchecked THEN RETURN END;
  4133. IF tagsAvailable THEN
  4134. TrapC(BrltL,index,length,IndexCheckTrap);
  4135. END;
  4136. END BoundCheck;
  4137. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  4138. VAR d: IntermediateCode.Operand;
  4139. BEGIN
  4140. IF isUnchecked THEN RETURN END;
  4141. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  4142. TrapC(op,dim,d,ArraySizeTrap);
  4143. ReleaseIntermediateOperand(d);
  4144. END DimensionCheck;
  4145. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  4146. VAR
  4147. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  4148. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  4149. expression: SyntaxTree.Expression;
  4150. resultingType, leftType, baseType: SyntaxTree.Type;
  4151. skipLabel1: Label;
  4152. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  4153. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  4154. variableOp: Operand;
  4155. variable: SyntaxTree.Variable;
  4156. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  4157. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  4158. VAR e: SyntaxTree.Expression; i: LONGINT;
  4159. BEGIN
  4160. tensorFound := FALSE;
  4161. FOR i := 0 TO parameters.Length()-1 DO
  4162. e := parameters.GetExpression(i);
  4163. IF e IS SyntaxTree.TensorRangeExpression THEN
  4164. ASSERT(~tensorFound);
  4165. tensorFound := TRUE;
  4166. ELSIF e IS SyntaxTree.RangeExpression THEN
  4167. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4168. ELSE
  4169. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4170. END;
  4171. END;
  4172. END CountIndices;
  4173. BEGIN
  4174. ASSERT(tagsAvailable);
  4175. resultingType := x.type.resolved; (* resulting type *)
  4176. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  4177. InitOperand(localResult, ModeReference);
  4178. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  4179. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  4180. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  4181. (* a globally defined array destination tag is available -> use and invalidate it*)
  4182. localResult.tag := arrayDestinationTag;
  4183. IntermediateCode.InitOperand(arrayDestinationTag)
  4184. ELSE
  4185. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  4186. (* the result is of array range type and thus does not provide any collectable pointers *)
  4187. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  4188. Symbol(variable, variableOp);
  4189. ReuseCopy(localResult.tag, variableOp.op);
  4190. ReleaseOperand(variableOp);
  4191. END
  4192. END;
  4193. indexListSize := x.parameters.Length();
  4194. CountIndices(x.parameters);
  4195. (*ASSERT(tensorRangeCount <= 1);*)
  4196. (* designate the array to be indexed over, perform tensor range check if known *)
  4197. Designate(x.left, array);
  4198. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4199. Dereference(array, leftType,FALSE);
  4200. IF ~tensorFound THEN
  4201. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  4202. END
  4203. END;
  4204. (* default base offset *)
  4205. srcDimOffset := 0;
  4206. destDimOffset := 0;
  4207. indexDim := 0;
  4208. (* use address of source array as basis *)
  4209. localResult.op := array.op;
  4210. UseIntermediateOperand(localResult.op);
  4211. (* go through the index list *)
  4212. FOR i := 0 TO indexListSize - 1 DO
  4213. expression := x.parameters.GetExpression(i);
  4214. IF expression IS SyntaxTree.TensorRangeExpression THEN
  4215. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  4216. srcDimOffset := -indexListSize;
  4217. destDimOffset := -suffixRanges;
  4218. ELSE
  4219. (* determine which dimension of source array is currently looked at *)
  4220. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  4221. (* get the memory operand pointing to array descriptor dimension *)
  4222. GetMathArrayField(tmp, array.tag, MathDimOffset);
  4223. (* make a reusable register from it *)
  4224. ReuseCopy(srcDim, tmp);
  4225. ReleaseIntermediateOperand(tmp);
  4226. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  4227. ELSE
  4228. srcDim := IntermediateCode.Immediate(sizeType, i);
  4229. END;
  4230. (* get length and increment of source array for current dimension *)
  4231. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  4232. Convert(sourceLength.op, sizeType);
  4233. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  4234. Convert(sourceIncrement.op, sizeType);
  4235. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  4236. ReleaseIntermediateOperand(srcDim);
  4237. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  4238. (* SINGLE INDEX *)
  4239. Evaluate(expression, index);
  4240. ReleaseIntermediateOperand(index.tag);
  4241. index.tag := emptyOperand;
  4242. Convert(index.op, sizeType);
  4243. (* lower bound check *)
  4244. IF IsIntegerImmediate(index.op, staticIndex) THEN
  4245. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  4246. ELSIF isUnchecked THEN (* do nothing *)
  4247. ELSE
  4248. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  4249. END;
  4250. (* upper bound check *)
  4251. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  4252. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  4253. ELSIF isUnchecked THEN (* do nothing *)
  4254. ELSE
  4255. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  4256. END;
  4257. ReleaseOperand(sourceLength);
  4258. Convert(index.op, addressType);
  4259. summand := index.op;
  4260. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  4261. (* RANGE OF INDICES *)
  4262. Evaluate(expression, range);
  4263. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  4264. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  4265. stepSize := range.extra; UseIntermediateOperand(stepSize);
  4266. ReleaseOperand(range);
  4267. Convert(firstIndex, sizeType);
  4268. Convert(lastIndex, sizeType);
  4269. Convert(stepSize, sizeType);
  4270. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  4271. if it is 'MAX(LONGINT)' *)
  4272. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  4273. TransferToRegister(lastIndex, lastIndex);
  4274. skipLabel1 := NewLabel();
  4275. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  4276. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  4277. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  4278. SetLabel(skipLabel1)
  4279. END;
  4280. (* check if step size is valid *)
  4281. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  4282. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  4283. ELSIF isUnchecked THEN (* do nothing *)
  4284. ELSE
  4285. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  4286. END;
  4287. (* check lower bound check *)
  4288. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  4289. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  4290. ELSIF isUnchecked THEN (* do nothing *)
  4291. ELSE
  4292. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  4293. END;
  4294. (* check upper bound check *)
  4295. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  4296. (* statically open range: nothing to do *)
  4297. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  4298. ASSERT(staticLastIndex < staticSourceLength)
  4299. ELSIF isUnchecked THEN (* do nothing *)
  4300. ELSE
  4301. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  4302. END;
  4303. (* determine length of target array for current dimension *)
  4304. (* 1. incorporate last index: *)
  4305. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  4306. (* last index is static *)
  4307. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  4308. targetLength := sourceLength.op
  4309. ELSE
  4310. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  4311. END;
  4312. UseIntermediateOperand(targetLength);
  4313. ELSE
  4314. (* targetLength := lastIndex + 1
  4315. Reuse1(targetLength, lastIndex);
  4316. *)
  4317. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  4318. END;
  4319. ReleaseOperand(sourceLength);
  4320. ReleaseIntermediateOperand(lastIndex);
  4321. (* 2. incorporate first index: *)
  4322. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4323. (* first index and current target length are static *)
  4324. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  4325. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  4326. (* first index = 0: nothing to do *)
  4327. ELSE
  4328. (* targetLength := targetLength - firstIndex *)
  4329. TransferToRegister(targetLength, targetLength);
  4330. Emit(Sub(position,targetLength, targetLength, firstIndex))
  4331. END;
  4332. (* clip negative lengths to 0 *)
  4333. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4334. IF staticTargetLength < 0 THEN
  4335. targetLength := IntermediateCode.Immediate(sizeType, 0)
  4336. END
  4337. ELSE
  4338. skipLabel1 := NewLabel();
  4339. TransferToRegister(targetLength, targetLength);
  4340. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  4341. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  4342. SetLabel(skipLabel1)
  4343. END;
  4344. (* 3. incorporate index step size: *)
  4345. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  4346. (*step size and current target length are static *)
  4347. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  4348. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  4349. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  4350. (* step size = 1: nothing to do *)
  4351. ELSE
  4352. (* emit code for this:
  4353. targetLength := (targetLength-1) DIV stepSize +1;
  4354. *)
  4355. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  4356. DivInt(targetLength, targetLength, stepSize);
  4357. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  4358. END;
  4359. (* determine increment of target array for current dimension *)
  4360. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  4361. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  4362. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  4363. (* step size = 1 *)
  4364. targetIncrement := sourceIncrement.op;
  4365. UseIntermediateOperand(targetIncrement)
  4366. ELSE
  4367. (* targetIncrement := sourceIncrement * stepSize *)
  4368. Reuse1(targetIncrement, stepSize);
  4369. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  4370. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  4371. END;
  4372. ReleaseIntermediateOperand(stepSize);
  4373. (* write length and increment of target array to descriptor *)
  4374. IF destDimOffset < 0 THEN
  4375. (* determine which dimension of target array is currently looked at *)
  4376. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  4377. TransferToRegister(destDim, tmp);
  4378. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  4379. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  4380. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  4381. ReleaseIntermediateOperand(destDim);
  4382. INC(destDimOffset);
  4383. ELSE
  4384. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  4385. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  4386. END;
  4387. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  4388. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  4389. INC(indexDim);
  4390. Convert(firstIndex, addressType);
  4391. TransferToRegister(summand, firstIndex);
  4392. ELSE HALT(100);
  4393. END;
  4394. (*
  4395. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  4396. *)
  4397. Convert(sourceIncrement.op, addressType);
  4398. Convert(summand, addressType);
  4399. MulInt(summand, summand, sourceIncrement.op);
  4400. ReleaseIntermediateOperand(sourceIncrement.op);
  4401. AddInt(localResult.op, localResult.op, summand);
  4402. ReleaseIntermediateOperand(summand);
  4403. END
  4404. END;
  4405. result := localResult;
  4406. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  4407. ReleaseIntermediateOperand(result.tag);
  4408. result.tag := TypeDescriptorAdr(resultingType);
  4409. ELSIF IsDelegate(resultingType) THEN
  4410. ReleaseIntermediateOperand(result.tag);
  4411. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4412. UseIntermediateOperand(result.tag);
  4413. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4414. ReleaseIntermediateOperand(result.tag);
  4415. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  4416. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  4417. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  4418. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  4419. (* finalize target array descriptor *)
  4420. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  4421. (* write lengths and increments of target array for remaining dimensions *)
  4422. i := indexListSize;
  4423. WHILE indexDim < targetArrayDimensionality DO
  4424. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  4425. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  4426. ReleaseOperand(sourceLength);
  4427. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  4428. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  4429. ReleaseOperand(sourceIncrement);
  4430. INC(i); INC(indexDim);
  4431. END;
  4432. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4433. tmp := nil;
  4434. ELSE
  4435. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  4436. END;
  4437. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  4438. ReleaseIntermediateOperand(tmp);
  4439. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4440. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  4441. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4442. ELSE
  4443. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  4444. END;
  4445. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  4446. ReleaseIntermediateOperand(tmp);
  4447. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  4448. (* write dimensionality *)
  4449. IF targetArrayDimensionality # 0 THEN
  4450. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  4451. END;
  4452. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  4453. END;
  4454. ReleaseOperand(array);
  4455. END MathIndexDesignator;
  4456. (* get the length of an array , trying to make use of static information *)
  4457. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  4458. VAR res: IntermediateCode.Operand; size: LONGINT;
  4459. BEGIN
  4460. type := type.resolved;
  4461. IF type IS SyntaxTree.ArrayType THEN
  4462. WITH type: SyntaxTree.ArrayType DO
  4463. IF type.form = SyntaxTree.Static THEN
  4464. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  4465. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4466. Evaluate(type.length, op);
  4467. ReleaseIntermediateOperand(op.tag);
  4468. RETURN op.op;*)
  4469. ELSE
  4470. res := tag;
  4471. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  4472. IntermediateCode.MakeMemory(res,addressType);
  4473. UseIntermediateOperand(res);
  4474. RETURN res
  4475. END
  4476. END;
  4477. ELSE
  4478. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  4479. RETURN IntermediateCode.Immediate(addressType,size);
  4480. END;
  4481. END ArrayLength;
  4482. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4483. BEGIN
  4484. IF IsImmediate(x) THEN
  4485. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4486. ELSE
  4487. IF ~ReusableRegister(res) THEN
  4488. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4489. ELSE
  4490. UseIntermediateOperand(res);
  4491. END;
  4492. Emit(Mov(position,res,x))
  4493. END;
  4494. END CopyInt;
  4495. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4496. BEGIN
  4497. ReleaseIntermediateOperand(res);
  4498. IF IsImmediate(x) & IsImmediate(y) THEN
  4499. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4500. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4501. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4502. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4503. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4504. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4505. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4506. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4507. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4508. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4509. UseIntermediateOperand(res);
  4510. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4511. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4512. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4513. UseIntermediateOperand(res);
  4514. ELSE
  4515. IF ~ReusableRegister(res) THEN
  4516. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4517. ELSE
  4518. UseIntermediateOperand(res);
  4519. END;
  4520. IF IsImmediate(x) & (x.intValue = 0) THEN
  4521. Emit(Mov(position,res,y))
  4522. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4523. Emit(Mov(position,res,x))
  4524. ELSE
  4525. Emit(Add(position,res, x, y));
  4526. END;
  4527. END;
  4528. END AddInt;
  4529. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4530. BEGIN
  4531. ReleaseIntermediateOperand(res);
  4532. IF IsImmediate(x) & IsImmediate(y) THEN
  4533. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4534. ELSE
  4535. IF ~ReusableRegister(res) THEN
  4536. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4537. ELSE UseIntermediateOperand(res);
  4538. END;
  4539. IF IsImmediate(x) & (x.intValue = 1) THEN
  4540. Emit(Mov(position,res,y))
  4541. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4542. Emit(Mov(position,res,x))
  4543. ELSE
  4544. Emit(Mul(position,res, x, y));
  4545. END;
  4546. END;
  4547. END MulInt;
  4548. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4549. BEGIN
  4550. ReleaseIntermediateOperand(res);
  4551. IF IsImmediate(x) & IsImmediate(y) THEN
  4552. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4553. ELSE
  4554. IF ~ReusableRegister(res) THEN
  4555. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4556. ELSE UseIntermediateOperand(res);
  4557. END;
  4558. IF IsImmediate(x) & (x.intValue = 1) THEN
  4559. Emit(Mov(position,res,y))
  4560. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4561. Emit(Mov(position,res,x))
  4562. ELSE
  4563. Emit(Div(position,res, x, y));
  4564. END;
  4565. END;
  4566. END DivInt;
  4567. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4568. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4569. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4570. BEGIN
  4571. type := x.left.type.resolved;
  4572. IF type IS SyntaxTree.StringType THEN
  4573. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4574. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4575. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4576. type := atype;
  4577. x.left.SetType(type);
  4578. END;
  4579. IntermediateCode.InitImmediate(res,addressType,0);
  4580. maxDim := x.parameters.Length()-1;
  4581. (*
  4582. computation rule:
  4583. a: ARRAY X,Y,Z OF Element with size S
  4584. a[i,j,k] -->
  4585. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4586. *)
  4587. FOR i := 0 TO maxDim DO
  4588. e := x.parameters.GetExpression(i);
  4589. Evaluate(e,index);
  4590. Convert(index.op,addressType);
  4591. AddInt(res, res, index.op);
  4592. IF i = 0 THEN
  4593. (*
  4594. ReuseCopy(res, index.op);
  4595. *)
  4596. Designate(x.left,array);
  4597. type := x.left.type.resolved;
  4598. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4599. Dereference(array, type, FALSE);
  4600. END;
  4601. (*
  4602. ELSE AddInt(res, res, index.op);
  4603. *)
  4604. END;
  4605. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4606. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4607. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4608. BoundCheck(index.op, length);
  4609. END;
  4610. ReleaseIntermediateOperand(length);
  4611. END;
  4612. ReleaseOperand(index);
  4613. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4614. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4615. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4616. MulInt(res,res,length);
  4617. END;
  4618. ReleaseIntermediateOperand(length);
  4619. END;
  4620. (* remaining open dimensions -- compute address *)
  4621. i := maxDim+1;
  4622. IF type IS SyntaxTree.ArrayType THEN
  4623. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4624. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4625. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4626. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4627. MulInt(res,res,length);
  4628. END;
  4629. ReleaseIntermediateOperand(length);
  4630. INC(i);
  4631. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4632. END;
  4633. END;
  4634. IF (type IS SyntaxTree.ArrayType) THEN
  4635. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4636. size := StaticSize(system, type);
  4637. IF size # 1 THEN
  4638. length := IntermediateCode.Immediate(addressType,size);
  4639. MulInt(res,res,length);
  4640. END;
  4641. ELSE
  4642. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4643. IF size # 1 THEN
  4644. length := IntermediateCode.Immediate(addressType,size);
  4645. MulInt(res,res,length);
  4646. END;
  4647. END;
  4648. END;
  4649. AddInt(res,res,array.op);
  4650. InitOperand(result,ModeReference);
  4651. result.op := res;
  4652. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4653. ReleaseIntermediateOperand(result.tag);
  4654. result.tag := TypeDescriptorAdr(type);
  4655. ELSIF IsDelegate(type) THEN
  4656. ReleaseIntermediateOperand(result.tag);
  4657. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4658. UseIntermediateOperand(result.tag);
  4659. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4660. ReleaseIntermediateOperand(result.tag);
  4661. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4662. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4663. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4664. END;
  4665. ReleaseOperand(array);
  4666. END IndexDesignator;
  4667. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4668. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4669. BEGIN
  4670. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4671. dest := destination; destination := emptyOperand;
  4672. type := x.left.type.resolved;
  4673. IF type IS SyntaxTree.MathArrayType THEN
  4674. MathIndexDesignator(x);
  4675. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4676. IndexDesignator(x);
  4677. END;
  4678. destination := dest;
  4679. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4680. END VisitIndexDesignator;
  4681. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4682. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4683. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4684. procedure: SyntaxTree.Procedure;
  4685. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4686. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4687. BEGIN
  4688. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4689. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4690. parameters := expression.parameters;
  4691. moduleName := "FoxArrayBase";
  4692. procedureName := "CopyDescriptor";
  4693. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4694. SaveRegisters();ReleaseUsedRegisters(saved);
  4695. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4696. IF procedure = NIL THEN
  4697. s := "procedure ";
  4698. Strings.Append(s,moduleName);
  4699. Strings.Append(s,".");
  4700. Strings.Append(s,procedureName);
  4701. Strings.Append(s," not present");
  4702. Error(position,s);
  4703. ELSE
  4704. (* push address of temporary variable *)
  4705. Symbol(variable,destOperand);
  4706. Emit(Push(position,destOperand.op));
  4707. ReleaseOperand(destOperand);
  4708. (* push src *)
  4709. Evaluate(expression.left,srcOperand);
  4710. (*
  4711. Dereference(srcOperand,expression.type.resolved);
  4712. Emit(Push(position,srcOperand.tag));
  4713. *)
  4714. Emit(Push(position,srcOperand.op));
  4715. ReleaseOperand(srcOperand);
  4716. tensorFound := FALSE;
  4717. FOR i := 0 TO parameters.Length()-1 DO
  4718. e := parameters.GetExpression(i);
  4719. IF e IS SyntaxTree.TensorRangeExpression THEN
  4720. tensorFound := TRUE;
  4721. ELSIF e IS SyntaxTree.RangeExpression THEN
  4722. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4723. ELSE
  4724. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4725. END;
  4726. END;
  4727. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4728. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4729. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4730. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4731. StaticCallOperand(procOp,procedure);
  4732. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4733. ReleaseOperand(procOp);
  4734. END;
  4735. RestoreRegisters(saved);
  4736. END;
  4737. RETURN variable
  4738. END PrepareTensorDescriptor;
  4739. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; register: WORD);
  4740. VAR
  4741. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4742. operand, tmpOperand, variableOp, variable2Op: Operand;
  4743. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4744. variable, variable2: SyntaxTree.Variable;
  4745. dim, i, size: LONGINT;
  4746. (* TODO: needed? *)
  4747. oldArrayDestinationTag: IntermediateCode.Operand;
  4748. oldArrayDestinationDimension: LONGINT;
  4749. position: Position;
  4750. saved: RegisterEntry;
  4751. arrayFlags: SET;
  4752. m, n: LONGINT;
  4753. PROCEDURE Pass(op: IntermediateCode.Operand);
  4754. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4755. BEGIN
  4756. IF register >= 0 THEN
  4757. IntermediateCode.InitParameterRegisterClass(registerClass, register);
  4758. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4759. Emit(Mov(position,parameterRegister, op));
  4760. ELSE
  4761. Emit(Push(position,op))
  4762. END
  4763. END Pass;
  4764. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4765. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4766. BEGIN
  4767. formalType := formalType.resolved; actualType := actualType.resolved;
  4768. IF IsOpenArray(formalType)THEN
  4769. IF actualType IS SyntaxTree.StringType THEN
  4770. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4771. RETURN;
  4772. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4773. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4774. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4775. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4776. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4777. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4778. ELSE
  4779. tmp := baseReg;
  4780. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4781. IntermediateCode.MakeMemory(tmp,addressType);
  4782. Pass((tmp));
  4783. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4784. END;
  4785. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4786. END;
  4787. END PushArrayLens;
  4788. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4789. BEGIN
  4790. CASE size OF
  4791. |2: INCL(flags,Size2Flag);
  4792. |3: INCL(flags,Size3Flag);
  4793. |4: INCL(flags,Size4Flag);
  4794. |5: INCL(flags,Size5Flag);
  4795. |6: INCL(flags,Size6Flag);
  4796. |7: INCL(flags,Size7Flag);
  4797. |8: INCL(flags,Size8Flag);
  4798. END;
  4799. END SetSmallArraySizeFlag;
  4800. BEGIN
  4801. IF Trace THEN TraceEnter("PushParameter") END;
  4802. position := expression.position;
  4803. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4804. type := expression.type.resolved;
  4805. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4806. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4807. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4808. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4809. );
  4810. (* TODO: needed? *)
  4811. oldArrayDestinationTag := arrayDestinationTag;
  4812. oldArrayDestinationDimension := arrayDestinationDimension;
  4813. IF IsArrayOfSystemByte(parameter.type) THEN
  4814. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4815. Designate(expression,operand);
  4816. ELSE
  4817. Evaluate(expression, tmpOperand);
  4818. (* array of system byte does not provide any pointers *)
  4819. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4820. Symbol(variable, operand);
  4821. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4822. Emit(Mov(position,tmp, tmpOperand.op));
  4823. ReleaseOperand(tmpOperand);
  4824. END;
  4825. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4826. ReleaseIntermediateOperand(operand.tag);
  4827. operand.tag := tmp;
  4828. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4829. Pass((operand.tag));
  4830. END;
  4831. Pass((operand.op));
  4832. ELSIF IsOpenArray(parameter.type) THEN
  4833. Designate(expression,operand);
  4834. baseReg := operand.tag;
  4835. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4836. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4837. END;
  4838. Pass((operand.op)); (* address of the array *)
  4839. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4840. (* case 1
  4841. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4842. *)
  4843. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4844. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4845. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4846. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4847. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4848. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4849. arrayDestinationTag := sp;
  4850. (* case 1b
  4851. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4852. *)
  4853. IF expression IS SyntaxTree.IndexDesignator THEN
  4854. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4855. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4856. arrayDestinationDimension := dim;
  4857. Designate(expression,operand);
  4858. (* case 1a
  4859. P(...,A,...) push: push array descriptor to stack
  4860. *)
  4861. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4862. Designate(expression,operand);
  4863. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4864. i := 0;
  4865. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4866. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4867. INC(i);
  4868. END;
  4869. type := expression.type.resolved;
  4870. WHILE (i<dim) DO (* remaining static dimensions *)
  4871. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4872. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4873. ReleaseOperand(tmpOperand);
  4874. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4875. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4876. ReleaseOperand(tmpOperand);
  4877. INC(i);
  4878. END;
  4879. dimOp := IntermediateCode.Immediate(addressType,dim);
  4880. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4881. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4882. (* case 1d
  4883. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4884. + case 1e
  4885. P(.. PT() ... );
  4886. *)
  4887. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4888. Designate(expression,operand);
  4889. Dereference(operand,type.resolved,FALSE);
  4890. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4891. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4892. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4893. (* case 1f
  4894. P(...,S,...) push: create array descriptor to S on stack
  4895. case 1g
  4896. P(... PS()...)
  4897. *)
  4898. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4899. Designate(expression,operand);
  4900. FOR i := 0 TO dim-1 DO
  4901. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4902. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4903. ReleaseOperand(tmpOperand);
  4904. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4905. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4906. ReleaseOperand(tmpOperand);
  4907. END;
  4908. (*******
  4909. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4910. *)
  4911. arrayFlags := {StaticFlag};
  4912. IF dim = 1 THEN
  4913. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4914. ReleaseOperand(tmpOperand);
  4915. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4916. m := LONGINT(tmpOperand.op.intValue);
  4917. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4918. ELSIF dim = 2 THEN
  4919. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4920. ReleaseOperand(tmpOperand);
  4921. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4922. m := LONGINT(tmpOperand.op.intValue);
  4923. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4924. ReleaseOperand(tmpOperand);
  4925. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4926. n := LONGINT(tmpOperand.op.intValue);
  4927. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4928. INCL(arrayFlags,SmallMatrixFlag);
  4929. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4930. END;
  4931. END;
  4932. (*******)
  4933. dimOp := IntermediateCode.Immediate(addressType,dim);
  4934. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4935. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4936. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4937. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4938. baseType := SemanticChecker.ArrayBase(type,dim);
  4939. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4940. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4941. ELSE HALT(100);
  4942. END;
  4943. (* case 2
  4944. procedure P([left args], var A: array [*,*] of Type, [right args])
  4945. *)
  4946. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4947. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4948. (* case 2b
  4949. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4950. push: push reference to pushed array descriptor
  4951. post: remove array descriptor.
  4952. *)
  4953. IF expression IS SyntaxTree.IndexDesignator THEN
  4954. descriptorType := GetMathArrayDescriptorType(dim);
  4955. (* range type : no allocation possible, should be untraced *)
  4956. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4957. Symbol(variable,variableOp);
  4958. arrayDestinationTag := variableOp.op;
  4959. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4960. arrayDestinationDimension := dim;
  4961. NeedDescriptor := TRUE;
  4962. Designate(expression,operand);
  4963. Pass((operand.tag));
  4964. NeedDescriptor := FALSE;
  4965. (* case 2a
  4966. P(...,A,...)
  4967. push: push reference to array descriptor on stack
  4968. *)
  4969. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4970. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4971. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4972. INC(i);
  4973. END;
  4974. IF i = dim THEN
  4975. Designate(expression,operand);
  4976. Pass((operand.tag));
  4977. ELSE (* open-static *)
  4978. type := expression.type.resolved;
  4979. descriptorType := GetMathArrayDescriptorType(dim);
  4980. (* static array , cannot be reallocated, untraced !*)
  4981. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4982. Symbol(variable,variableOp);
  4983. arrayDestinationTag := variableOp.op;
  4984. Designate(expression,operand);
  4985. FOR i := 0 TO dim-1 DO
  4986. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4987. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4988. ReleaseOperand(tmpOperand);
  4989. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4990. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4991. ReleaseOperand(tmpOperand);
  4992. END;
  4993. dimOp := IntermediateCode.Immediate(addressType,dim);
  4994. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4995. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4996. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4997. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4998. baseType := SemanticChecker.ArrayBase(type,dim);
  4999. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5000. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5001. Pass((arrayDestinationTag));
  5002. END;
  5003. (* case 2d
  5004. P(...,T,...) push: emit dimension check, push T
  5005. *)
  5006. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5007. Designate(expression,operand);
  5008. Dereference(operand,type.resolved,FALSE);
  5009. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  5010. Pass((operand.tag));
  5011. (* case 2f
  5012. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  5013. push: push reference to pushed array descriptor
  5014. post: remove array descriptor
  5015. *)
  5016. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5017. descriptorType := GetMathArrayDescriptorType(dim);
  5018. (* static array -- cannot be reallocatated, untraced *)
  5019. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5020. Symbol(variable,variableOp);
  5021. arrayDestinationTag := variableOp.op;
  5022. Designate(expression,operand);
  5023. FOR i := 0 TO dim-1 DO
  5024. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5025. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5026. ReleaseOperand(tmpOperand);
  5027. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5028. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5029. ReleaseOperand(tmpOperand);
  5030. END;
  5031. (*
  5032. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  5033. *)
  5034. arrayFlags := {StaticFlag};
  5035. IF dim = 1 THEN
  5036. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  5037. ReleaseOperand(tmpOperand);
  5038. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5039. m := LONGINT(tmpOperand.op.intValue);
  5040. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  5041. ELSIF dim = 2 THEN
  5042. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  5043. ReleaseOperand(tmpOperand);
  5044. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5045. m := LONGINT(tmpOperand.op.intValue);
  5046. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  5047. ReleaseOperand(tmpOperand);
  5048. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  5049. n := LONGINT(tmpOperand.op.intValue);
  5050. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  5051. INCL(arrayFlags,SmallMatrixFlag);
  5052. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  5053. END;
  5054. END;
  5055. (*******)
  5056. dimOp := IntermediateCode.Immediate(addressType,dim);
  5057. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5058. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5059. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5060. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  5061. baseType := SemanticChecker.ArrayBase(type,dim);
  5062. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5063. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5064. Pass((arrayDestinationTag));
  5065. ELSE HALT(100);
  5066. END;
  5067. (* case 3
  5068. procedure P([left args], [const] A: array [?] of Type, [right args])
  5069. *)
  5070. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  5071. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  5072. (* case 3b
  5073. P(...,A[a..b,c..d],...)
  5074. *)
  5075. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  5076. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  5077. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  5078. Symbol(variable,variableOp);
  5079. LoadValue(variableOp,system.addressType);
  5080. ELSE
  5081. descriptorType := GetMathArrayDescriptorType(dim);
  5082. (* range -- cannot be reallocated *)
  5083. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5084. Symbol(variable,variableOp);
  5085. END;
  5086. arrayDestinationTag := variableOp.op;
  5087. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  5088. arrayDestinationDimension := 0;
  5089. Designate(expression,operand);
  5090. Pass((operand.tag));
  5091. (* case 3a
  5092. P(...,A,...)
  5093. *)
  5094. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  5095. i := 0;
  5096. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  5097. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  5098. INC(i);
  5099. END;
  5100. IF i = dim THEN
  5101. Designate(expression,operand);
  5102. Pass((operand.tag));
  5103. ELSE (* open-static *)
  5104. type := expression.type.resolved;
  5105. descriptorType := GetMathArrayDescriptorType(dim);
  5106. (* static array -- cannot be reallocated -- no pointer to be traced *)
  5107. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5108. Symbol(variable,variableOp);
  5109. arrayDestinationTag := variableOp.op;
  5110. Designate(expression,operand);
  5111. FOR i := 0 TO dim-1 DO
  5112. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5113. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5114. ReleaseOperand(tmpOperand);
  5115. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5116. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5117. ReleaseOperand(tmpOperand);
  5118. END;
  5119. dimOp := IntermediateCode.Immediate(addressType,dim);
  5120. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5121. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5122. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5123. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  5124. baseType := SemanticChecker.ArrayBase(type,dim);
  5125. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5126. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5127. Pass((arrayDestinationTag));
  5128. END;
  5129. (* case 3d
  5130. P(...,T,...)
  5131. case 3e
  5132. P(...,PT(...),...)
  5133. *)
  5134. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5135. Designate(expression,operand);
  5136. Dereference(operand,type.resolved,FALSE);
  5137. Pass((operand.tag));
  5138. (* case 3f
  5139. P(...,S,...)
  5140. case 3g
  5141. P(...,PS(...),...)
  5142. *)
  5143. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5144. descriptorType := GetMathArrayDescriptorType(dim);
  5145. (* static array does not need to be traced *)
  5146. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5147. Symbol(variable,variableOp);
  5148. arrayDestinationTag := variableOp.op;
  5149. Designate(expression,operand);
  5150. IF operand.op.type.length >1 THEN (* vector register *)
  5151. (* static array does not need to be traced *)
  5152. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  5153. Symbol(variable2, variable2Op);
  5154. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  5155. Emit(Mov(position,tmp, operand.op));
  5156. ReleaseOperand(operand);
  5157. Symbol(variable2, operand);
  5158. END;
  5159. FOR i := 0 TO dim-1 DO
  5160. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5161. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5162. ReleaseOperand(tmpOperand);
  5163. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5164. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5165. ReleaseOperand(tmpOperand);
  5166. END;
  5167. dimOp := IntermediateCode.Immediate(addressType,dim);
  5168. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5169. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5170. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5171. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  5172. baseType := SemanticChecker.ArrayBase(type,dim);
  5173. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5174. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5175. Pass((arrayDestinationTag));
  5176. ELSE HALT(100);
  5177. END;
  5178. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  5179. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  5180. (* case 4b
  5181. P(...,A[a..b,c..d],...)
  5182. *)
  5183. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  5184. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  5185. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  5186. Symbol(variable,variableOp);
  5187. LoadValue(variableOp,system.addressType);
  5188. ELSE
  5189. descriptorType := GetMathArrayDescriptorType(dim);
  5190. (* range array -- cannot be allocated *)
  5191. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5192. Symbol(variable,variableOp);
  5193. END;
  5194. arrayDestinationTag := variableOp.op;
  5195. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  5196. arrayDestinationDimension := 0;
  5197. Designate(expression,operand);
  5198. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5199. Symbol(variable,variableOp);
  5200. ELSE
  5201. (* alias to range -- untraced *)
  5202. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5203. Symbol(variable,variableOp);
  5204. MakeMemory(tmp,variableOp.op,addressType,0);
  5205. Emit(Mov(position,tmp,operand.tag));
  5206. ReleaseIntermediateOperand(tmp);
  5207. END;
  5208. Pass((variableOp.op));
  5209. ReleaseOperand(variableOp);
  5210. (* case 4a
  5211. P(...,A,...)
  5212. *)
  5213. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  5214. i := 0;
  5215. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  5216. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  5217. INC(i);
  5218. END;
  5219. IF i = dim THEN
  5220. Designate(expression,operand);
  5221. arrayDestinationTag := operand.tag;
  5222. ELSE (* open-static *)
  5223. type := expression.type.resolved;
  5224. descriptorType := GetMathArrayDescriptorType(dim);
  5225. (* static array -- untraced *)
  5226. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5227. Symbol(variable,variableOp);
  5228. arrayDestinationTag := variableOp.op;
  5229. Designate(expression,operand);
  5230. FOR i := 0 TO dim-1 DO
  5231. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5232. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5233. ReleaseOperand(tmpOperand);
  5234. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5235. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5236. ReleaseOperand(tmpOperand);
  5237. END;
  5238. dimOp := IntermediateCode.Immediate(addressType,dim);
  5239. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5240. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5241. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5242. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  5243. baseType := SemanticChecker.ArrayBase(type,dim);
  5244. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5245. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5246. END;
  5247. (* tensor alias to open array -- untraced *)
  5248. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5249. Symbol(variable,variableOp);
  5250. MakeMemory(tmp,variableOp.op,addressType,0);
  5251. Emit(Mov(position,tmp,arrayDestinationTag));
  5252. ReleaseIntermediateOperand(tmp);
  5253. Pass((variableOp.op));
  5254. ReleaseOperand(variableOp);
  5255. (* case 4d
  5256. P(...,T,...)
  5257. *)
  5258. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  5259. Designate(expression,operand);
  5260. Pass((operand.op));
  5261. (* case 4f
  5262. P(...,S,...)
  5263. *)
  5264. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5265. descriptorType := GetMathArrayDescriptorType(dim);
  5266. (* static array -- cannot be reallocated, untraced *)
  5267. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  5268. Symbol(variable,variableOp);
  5269. arrayDestinationTag := variableOp.op;
  5270. Designate(expression,operand);
  5271. FOR i := 0 TO dim-1 DO
  5272. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5273. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  5274. ReleaseOperand(tmpOperand);
  5275. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  5276. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  5277. ReleaseOperand(tmpOperand);
  5278. END;
  5279. dimOp := IntermediateCode.Immediate(addressType,dim);
  5280. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  5281. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  5282. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  5283. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  5284. baseType := SemanticChecker.ArrayBase(type,dim);
  5285. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  5286. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  5287. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5288. Symbol(variable,variableOp);
  5289. MakeMemory(tmp,variableOp.op,addressType,0);
  5290. Emit(Mov(position,tmp,arrayDestinationTag));
  5291. ReleaseIntermediateOperand(tmp);
  5292. Pass((variableOp.op));
  5293. ReleaseOperand(variableOp);
  5294. ELSE HALT(100);
  5295. END;
  5296. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  5297. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  5298. Designate(expression,operand);
  5299. IF operand.op.type.length > 1 THEN
  5300. Emit(Push(position, operand.op));
  5301. ELSE
  5302. size := system.SizeOf(type);
  5303. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  5304. size := ToMemoryUnits(system,size);
  5305. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5306. arrayDestinationTag := sp;
  5307. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  5308. END;
  5309. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  5310. Designate(expression,operand);
  5311. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  5312. (* static array no pointer *)
  5313. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  5314. Symbol(variable,variableOp);
  5315. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  5316. Emit(Mov(position,tmp,operand.op));
  5317. Emit(Push(position,variableOp.op));
  5318. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  5319. Pass((operand.op));
  5320. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  5321. END;
  5322. ELSE HALT(200)
  5323. END;
  5324. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  5325. IF parameter.kind = SyntaxTree.VarParameter THEN
  5326. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  5327. Designate(expression, operand);
  5328. Pass((operand.op));
  5329. ELSE
  5330. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  5331. Evaluate(expression, operand);
  5332. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,system.lenType) = system.AlignmentOf(system.variableAlignment,system.lenType)) THEN
  5333. Pass((operand.extra)); (* step *)
  5334. Pass((operand.tag)); (* last *)
  5335. Pass((operand.op)); (* first *)
  5336. ELSE
  5337. (* pass range as structure in order to comply with the variable alignment of its components *)
  5338. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  5339. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,system.lenType)));
  5340. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5341. tmp := sp;
  5342. IntermediateCode.MakeMemory(tmp,operand.op.type);
  5343. Emit(Mov(position,tmp,operand.op)); (* first *)
  5344. size := ToMemoryUnits(system,system.AlignedSizeOf(system.lenType));
  5345. IntermediateCode.AddOffset(tmp,size);
  5346. Emit(Mov(position,tmp,operand.tag)); (* last *)
  5347. IntermediateCode.AddOffset(tmp,size);
  5348. Emit(Mov(position,tmp,operand.extra)); (* step *)
  5349. END;
  5350. END
  5351. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  5352. IF parameter.kind = SyntaxTree.VarParameter THEN
  5353. Designate(expression, operand);
  5354. Pass((operand.op));
  5355. ELSE
  5356. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  5357. Evaluate(expression, operand);
  5358. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  5359. IF (register >= 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  5360. Pass((operand.tag)); (* imaginary part *)
  5361. Pass((operand.op)) (* real part *)
  5362. ELSE
  5363. (* pass complex as structure in order to comply with the variable alignment of its components *)
  5364. size := ToMemoryUnits(system,system.AlignedSizeOf(parameter.type));
  5365. Basic.Align(size,ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,componentType)));
  5366. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  5367. tmp := sp;
  5368. IntermediateCode.MakeMemory(tmp,operand.op.type);
  5369. Emit(Mov(position,tmp,operand.op)); (* real part *)
  5370. size := ToMemoryUnits(system,system.AlignedSizeOf(componentType));
  5371. IntermediateCode.AddOffset(tmp,size);
  5372. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  5373. END
  5374. END
  5375. ELSE
  5376. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5377. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  5378. Designate(expression,operand);
  5379. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  5380. (* stack allocation *)
  5381. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  5382. (*! parameter alignment to be discussed ... *)
  5383. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  5384. size := type(SyntaxTree.StringType).length;
  5385. END;
  5386. IF backend.cooperative & parameter.NeedsTrace() THEN
  5387. dst := NewRegisterOperand (addressType);
  5388. Emit(Mov(position,dst, sp));
  5389. IntermediateCode.InitImmediate(null, byteType, 0);
  5390. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  5391. ReleaseIntermediateOperand(dst);
  5392. SaveRegisters();ReleaseUsedRegisters(saved);
  5393. (* register dst has been freed before SaveRegisters already *)
  5394. CallAssignMethod(dst, operand.op, parameter.type);
  5395. RestoreRegisters(saved);
  5396. END;
  5397. IF operand.op.type.length > 1 THEN (* vector *)
  5398. MakeMemory(tmp,sp,operand.op.type,0);
  5399. Emit(Mov(position, tmp, operand.op));
  5400. ELSE
  5401. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  5402. END;
  5403. ELSIF IsOpenArray(parameter.type) THEN
  5404. Designate(expression,operand);
  5405. baseReg := operand.tag;
  5406. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5407. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  5408. END;
  5409. Pass((operand.op)); (* address of the array *)
  5410. ELSIF IsDelegate(parameter.type) THEN
  5411. Evaluate(expression,operand);
  5412. IF backend.cooperative & parameter.NeedsTrace() THEN
  5413. Emit(Push(position, nil));
  5414. dst := NewRegisterOperand (addressType);
  5415. Emit(Mov(position,dst, sp));
  5416. ReleaseIntermediateOperand(dst);
  5417. SaveRegisters();ReleaseUsedRegisters(saved);
  5418. Emit(Push(position, dst));
  5419. (* register dst has been freed before SaveRegisters already *)
  5420. Emit(Push(position, operand.tag));
  5421. CallThis(position,"GarbageCollector","Assign",2);
  5422. RestoreRegisters(saved);
  5423. ELSE
  5424. Pass((operand.tag));
  5425. END;
  5426. Pass((operand.op));
  5427. ELSE
  5428. Evaluate(expression,operand);
  5429. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  5430. Emit(Push(position, nil));
  5431. dst := NewRegisterOperand (addressType);
  5432. Emit(Mov(position,dst, sp));
  5433. ReleaseIntermediateOperand(dst);
  5434. SaveRegisters();ReleaseUsedRegisters(saved);
  5435. Emit(Push(position, dst));
  5436. (* register dst has been freed before SaveRegisters already *)
  5437. Emit(Push(position, operand.op));
  5438. CallThis(position,"GarbageCollector","Assign",2);
  5439. RestoreRegisters(saved);
  5440. ELSE
  5441. Pass((operand.op));
  5442. END;
  5443. END;
  5444. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  5445. Evaluate(expression,operand);
  5446. Pass((operand.op));
  5447. ELSE (* var parameter *)
  5448. Designate(expression,operand);
  5449. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5450. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  5451. Pass((operand.tag));
  5452. END;
  5453. END;
  5454. Pass((operand.op));
  5455. END;
  5456. END;
  5457. (* TODO: needed? *)
  5458. arrayDestinationTag := oldArrayDestinationTag;
  5459. arrayDestinationDimension := oldArrayDestinationDimension;
  5460. IF needsParameterBackup THEN
  5461. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5462. ReuseCopy(parameterBackup, operand.op)
  5463. END;
  5464. ReleaseOperand(operand);
  5465. IF Trace THEN TraceExit("PushParameter") END;
  5466. END PushParameter;
  5467. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  5468. BEGIN
  5469. 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
  5470. Expression(x.result); (* use register *)
  5471. END;
  5472. Statement(x.statement);
  5473. IF x.result # NIL THEN Expression(x.result) END;
  5474. 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
  5475. ReleaseIntermediateOperand(result.op);
  5476. END;
  5477. END VisitStatementDesignator;
  5478. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  5479. VAR
  5480. procedure: SyntaxTree.Procedure;
  5481. procedureType: SyntaxTree.ProcedureType;
  5482. wasInline: BOOLEAN;
  5483. actualParameters: SyntaxTree.ExpressionList;
  5484. formalParameter: SyntaxTree.Parameter;
  5485. actualParameter: SyntaxTree.Expression;
  5486. i: LONGINT;
  5487. localVariable: SyntaxTree.Variable;
  5488. variableDesignator, returnDesignator: SyntaxTree.Expression;
  5489. src, dest: Operand;
  5490. prevInlineExit : Label;
  5491. prevMapper: SymbolMapper;
  5492. tooComplex: BOOLEAN;
  5493. resultDesignator: SyntaxTree.Expression;
  5494. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5495. BEGIN
  5496. IF e = NIL THEN RETURN TRUE
  5497. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5498. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5499. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5500. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5501. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5502. ELSE RETURN FALSE
  5503. END;
  5504. END SimpleExpression;
  5505. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5506. BEGIN
  5507. RETURN checker.CanPassInRegister(type)
  5508. END FitsInRegister;
  5509. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5510. VAR
  5511. variable: SyntaxTree.Variable;
  5512. variableDesignator: SyntaxTree.Designator;
  5513. BEGIN
  5514. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5515. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5516. variableDesignator.SetType(type);
  5517. RETURN variableDesignator
  5518. END GetTemp;
  5519. BEGIN
  5520. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5521. wasInline := currentIsInline;
  5522. prevInlineExit := currentInlineExit;
  5523. prevMapper := currentMapper;
  5524. currentInlineExit := NewLabel();
  5525. tooComplex := FALSE;
  5526. NEW(currentMapper);
  5527. currentIsInline := TRUE;
  5528. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5529. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5530. formalParameter := procedureType.firstParameter;
  5531. actualParameters := x.parameters;
  5532. i := 0;
  5533. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5534. actualParameter := actualParameters.GetExpression(i);
  5535. IF actualParameter.resolved # NIL THEN
  5536. actualParameter := actualParameter.resolved
  5537. END;
  5538. (*
  5539. if expression is simple and can be passed immediately
  5540. or if type fits in register then we can proceed
  5541. otherwise we escape to ordinary procedure call.
  5542. *)
  5543. (* cases where the expression can be mapped identically *)
  5544. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5545. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5546. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5547. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5548. (*
  5549. Assign(variableDesignator, actualParameter);
  5550. *)
  5551. Evaluate(actualParameter, src);
  5552. Designate(variableDesignator, dest);
  5553. Emit(Mov(x.position, dest.op, src.op));
  5554. ReleaseOperand(dest);
  5555. ReleaseOperand(src);
  5556. (* the src operand should now have been completely released ! *)
  5557. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5558. ELSE tooComplex := TRUE
  5559. END;
  5560. (*
  5561. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5562. currentMapper.Add(formalParameter, actualParameter, NIL);
  5563. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5564. variableDesignator := GetTemp(system.addressType, FALSE);
  5565. Designate(actualParameter, src);
  5566. Designate(variableDesignator, dest);
  5567. IntermediateCode.MakeMemory(dest.op,addressType);
  5568. Emit(Mov(x.position, dest.op, src.op));
  5569. ReleaseOperand(dest);
  5570. IF src.tag.mode # IntermediateCode.Undefined THEN
  5571. tagDesignator := GetTemp(system.addressType, FALSE);
  5572. Designate(tagDesignator, dest);
  5573. IntermediateCode.MakeMemory(dest.op,addressType);
  5574. Emit(Mov(x.position, dest.op, src.op));
  5575. END;
  5576. ReleaseOperand(dest); ReleaseOperand(src);
  5577. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5578. END;
  5579. *)
  5580. formalParameter := formalParameter.nextParameter;
  5581. INC(i);
  5582. END;
  5583. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5584. IF resultDesignator # NIL THEN
  5585. returnDesignator := resultDesignator
  5586. ELSE
  5587. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5588. END;
  5589. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5590. END;
  5591. localVariable := procedure.procedureScope.firstVariable;
  5592. WHILE ~tooComplex & (localVariable # NIL) DO
  5593. variableDesignator := GetTemp(localVariable.type, FALSE);
  5594. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5595. localVariable := localVariable.nextVariable;
  5596. END;
  5597. IF ~tooComplex THEN
  5598. VisitStatementBlock(procedure.procedureScope.body);
  5599. SetLabel(currentInlineExit);
  5600. IF procedureType.returnType # NIL THEN
  5601. Designate(returnDesignator, result);
  5602. END;
  5603. END;
  5604. currentMapper := prevMapper;
  5605. currentInlineExit := prevInlineExit;
  5606. currentIsInline := wasInline;
  5607. RETURN ~tooComplex
  5608. END InlineProcedureCall;
  5609. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5610. VAR
  5611. parameters: SyntaxTree.ExpressionList;
  5612. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5613. procedureType: SyntaxTree.ProcedureType;
  5614. formalParameter: SyntaxTree.Parameter;
  5615. operand: Operand;
  5616. reg, size, mask, dest: IntermediateCode.Operand;
  5617. saved,saved2: RegisterEntry;
  5618. symbol: SyntaxTree.Symbol;
  5619. variable: SyntaxTree.Variable;
  5620. i, parametersSize : LONGINT;
  5621. structuredReturnType: BOOLEAN;
  5622. gap, alignment: LONGINT; (*fld*)
  5623. return: IntermediateCode.Operand;
  5624. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5625. arg: IntermediateCode.Operand;
  5626. dummy: IntermediateCode.Operand;
  5627. recordType: SyntaxTree.RecordType;
  5628. operatorSelectionProcedureOperand: Operand;
  5629. operatorSelectionProcedure: SyntaxTree.Procedure;
  5630. fingerPrint: SyntaxTree.FingerPrint;
  5631. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5632. identifierNumber: LONGINT;
  5633. parameterRegisters: SIZE;
  5634. registers: ARRAY 64 OF WORD;
  5635. procedure: SyntaxTree.Procedure;
  5636. callingConvention: SyntaxTree.CallingConvention;
  5637. type: IntermediateCode.Type;
  5638. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5639. (** do preparations before parameter push for array-structured object types (ASOTs):
  5640. if ASOT is passed as VAR parameter:
  5641. - allocate temporary variable of math array type
  5642. - copy contents of ASOT to be passed to temporary variable
  5643. - use temporary variable as the actual parameter instead
  5644. - 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)
  5645. **)
  5646. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5647. VAR
  5648. expression, left: SyntaxTree.Expression; tempVariableDesignator : SyntaxTree.Designator;
  5649. BEGIN
  5650. IF (formalParameter.kind = SyntaxTree.VarParameter) & SemanticChecker.IsIndexOperator(actualParameter) THEN
  5651. WITH actualParameter: SyntaxTree.ProcedureCallDesignator DO
  5652. (* prepare writeback for any other "normal" indexer *)
  5653. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5654. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5655. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5656. Assign(tempVariableDesignator, actualParameter);
  5657. IF firstWriteBackCall = NIL THEN
  5658. NEW(firstWriteBackCall);
  5659. currentWriteBackCall := firstWriteBackCall
  5660. ELSE
  5661. ASSERT(currentWriteBackCall # NIL);
  5662. NEW(currentWriteBackCall.next);
  5663. currentWriteBackCall := currentWriteBackCall.next
  5664. END;
  5665. (* a [^] . P[] ()*)
  5666. left := actualParameter.left; (* procedure call designator --> procedure call *)
  5667. left := left(SyntaxTree.Designator).left; (* procedure call --> caller object *)
  5668. IF left IS SyntaxTree.DereferenceDesignator THEN (* dereference, if required *)
  5669. left := left(SyntaxTree.Designator).left;
  5670. END;
  5671. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, left, 0, actualParameter.parameters, tempVariableDesignator);
  5672. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5673. END;
  5674. actualParameter := tempVariableDesignator;
  5675. END
  5676. END PrepareParameter;
  5677. BEGIN
  5678. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5679. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5680. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5681. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5682. IF InlineProcedureCall(x) THEN
  5683. RETURN
  5684. ELSE
  5685. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5686. END
  5687. END;
  5688. END;
  5689. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5690. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5691. callingConvention := procedureType.callingConvention;
  5692. dest := destination; destination := emptyOperand;
  5693. SaveRegisters();ReleaseUsedRegisters(saved);
  5694. parameters := x.parameters;
  5695. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5696. (* an operator is called *)
  5697. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5698. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5699. (* check if a dynamic operator call should be performed *)
  5700. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5701. ELSE
  5702. isCallOfDynamicOperator := FALSE
  5703. END;
  5704. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5705. Emit(Push(position, ap));
  5706. END;
  5707. alignment := procedureType.stackAlignment;
  5708. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5709. alignment := 16 (* bytes *);
  5710. END;
  5711. IF alignment > 1 THEN
  5712. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5713. Emit(Mov(position,reg, sp));
  5714. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5715. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5716. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5717. gap := 4*ToMemoryUnits(system,system.addressSize);
  5718. END;
  5719. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5720. backend.ResetParameterRegisters();
  5721. formalParameter := procedureType.firstParameter;
  5722. FOR i := 0 TO parameters.Length()-1 DO
  5723. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5724. type := addressType;
  5725. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5726. type := addressType;
  5727. ELSE
  5728. type := GetType(system, formalParameter.type);
  5729. END;
  5730. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5731. DEC (gap, ToMemoryUnits(system,system.addressSize))
  5732. END;
  5733. formalParameter := formalParameter.nextParameter;
  5734. END;
  5735. IF gap < 0 THEN
  5736. gap := 0
  5737. END;
  5738. ELSE
  5739. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5740. END;
  5741. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5742. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5743. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5744. Emit(And(position,sp, sp, mask));
  5745. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5746. Emit(Push(position,reg));
  5747. ReleaseIntermediateOperand(reg);
  5748. END;
  5749. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5750. (* align stack to 16-byte boundary *)
  5751. IntermediateCode.InitImmediate(mask,addressType,-16);
  5752. Emit(And(position,sp, sp, mask));
  5753. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5754. IF gap # 0 THEN
  5755. IntermediateCode.InitImmediate(size,addressType,gap);
  5756. Emit(Sub(position,sp,sp,size))
  5757. END;
  5758. END;
  5759. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5760. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5761. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5762. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5763. ELSE
  5764. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5765. END;
  5766. IF procedureType.selfParameter # NIL THEN (* type bound procedure in a record *)
  5767. Designate(x.left(SyntaxTree.Designator).left, operand);
  5768. Emit(Push(position, operand.tag));
  5769. Emit(Push(position, operand.op));
  5770. Symbol(symbol, operand);
  5771. LoadValue(operand, symbol.type);
  5772. (*
  5773. PushParameter(x.left(SyntaxTree.Designator).left, procedureType.selfParameter, callingConvention, FALSE, dummy,-1);
  5774. Evaluate(x.left, operand);
  5775. *)
  5776. ELSE
  5777. Evaluate(x.left, operand);
  5778. IF symbol IS SyntaxTree.Procedure THEN
  5779. IF (procedureType.selfParameter # NIL) THEN
  5780. Emit(Push(position,operand.tag));
  5781. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5782. Emit(Push(position,operand.tag));
  5783. ELSIF (procedureType.isDelegate) THEN
  5784. Emit(Push(position,operand.tag));
  5785. END;
  5786. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5787. IF (procedureType.selfParameter # NIL) THEN
  5788. Emit(Push(position,operand.tag));
  5789. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5790. Emit(Push(position,operand.tag));
  5791. END;
  5792. ELSE HALT(200);
  5793. END;
  5794. END;
  5795. ReleaseIntermediateOperand(operand.tag);
  5796. operand.tag := emptyOperand;
  5797. (* determine if a structured return type is needed *)
  5798. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5799. IF structuredReturnType THEN
  5800. IF resultDesignator # NIL THEN
  5801. d := resultDesignator;
  5802. ELSE
  5803. (* temporary result that might be allocated, must potentially be traced *)
  5804. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5805. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5806. d.SetType(variable.type);
  5807. END;
  5808. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5809. Designate(d,returnValue);
  5810. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5811. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5812. Emit(Push(position,size));
  5813. Emit(Push(position,returnValue.op));
  5814. ReleaseOperand(returnValue);
  5815. ELSE*)
  5816. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5817. (*
  5818. END;
  5819. *)
  5820. END;
  5821. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5822. parameterRegisters := 0;
  5823. backend.ResetParameterRegisters();
  5824. formalParameter := procedureType.firstParameter;
  5825. FOR i := 0 TO parameters.Length()-1 DO
  5826. IF (formalParameter.kind = SyntaxTree.VarParameter) THEN
  5827. type := addressType;
  5828. ELSIF formalParameter.type.IsRecordType() OR (formalParameter.type.resolved IS SyntaxTree.ArrayType) THEN
  5829. type := addressType;
  5830. ELSE
  5831. type := GetType(system, formalParameter.type);
  5832. END;
  5833. IF backend.GetParameterRegister(callingConvention, type, registers[i]) THEN
  5834. INC(parameterRegisters);
  5835. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5836. Error(actualParameter.position,"cannot be passed by register")
  5837. END;
  5838. ELSE
  5839. registers[i] := -1;
  5840. END;
  5841. formalParameter := formalParameter.nextParameter;
  5842. END;
  5843. formalParameter := procedureType.lastParameter;
  5844. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5845. actualParameter := parameters.GetExpression(i);
  5846. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy, registers[i]);
  5847. formalParameter := formalParameter.prevParameter;
  5848. END;
  5849. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5850. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5851. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,32)));
  5852. END;
  5853. ELSE
  5854. hasDynamicOperands := FALSE;
  5855. formalParameter := procedureType.firstParameter;
  5856. FOR i := 0 TO parameters.Length() - 1 DO
  5857. actualParameter := parameters.GetExpression(i);
  5858. PrepareParameter(actualParameter, formalParameter);
  5859. IF formalParameter # NIL THEN (* TENTATIVE *)
  5860. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5861. ASSERT(i < 2);
  5862. hasDynamicOperands := TRUE;
  5863. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5864. ELSE
  5865. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5866. END;
  5867. formalParameter := formalParameter.nextParameter;
  5868. END;
  5869. END;
  5870. END;
  5871. IF symbol IS SyntaxTree.Procedure THEN
  5872. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5873. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5874. Emit(Push(position,reg));
  5875. ReleaseIntermediateOperand(reg);
  5876. END;
  5877. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5878. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5879. parametersSize := ParametersSize(system,procedureType, FALSE);
  5880. END;
  5881. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5882. (*
  5883. dynamic operator overloading:
  5884. first push parameters, regularly:
  5885. [self]
  5886. par1
  5887. par2
  5888. then push parameters for GetOperator
  5889. identifier
  5890. ptr1
  5891. tag
  5892. ptr2
  5893. tag
  5894. call GetOperatorRuntimeProc
  5895. call Operator
  5896. *)
  5897. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5898. (* push ID *)
  5899. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5900. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5901. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5902. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5903. formalParameter := procedureType.firstParameter;
  5904. FOR i := 0 TO parameters.Length() - 1 DO
  5905. IF formalParameter.access # SyntaxTree.Hidden THEN
  5906. ASSERT(i < 2);
  5907. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5908. (* push pointer *)
  5909. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5910. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5911. (* add dereference *)
  5912. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5913. (*! better: do refer to stack above than using parameter backups !!*)
  5914. ReleaseIntermediateOperand(parameterBackups[i]);
  5915. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5916. END;
  5917. Emit(Push(position,parameterBackups[i]));
  5918. ReleaseIntermediateOperand(parameterBackups[i]);
  5919. (* push typetag *)
  5920. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5921. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5922. arg := TypeDescriptorAdr(recordType);
  5923. Emit(Push(position,arg));
  5924. ELSE
  5925. (* push 'NonPointer' *)
  5926. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5927. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5928. (* push fingerprint *)
  5929. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5930. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5931. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5932. END
  5933. END;
  5934. formalParameter := formalParameter.nextParameter
  5935. END;
  5936. (* for unary operators: complete the information for the second parameter *)
  5937. IF procedureType.numberParameters < 2 THEN
  5938. (* push 'NonPointer' *)
  5939. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5940. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5941. (* push 'NoType' *)
  5942. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5943. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5944. END;
  5945. (* call operator selection procedure *)
  5946. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5947. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5948. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5949. ReleaseOperand(operatorSelectionProcedureOperand);
  5950. (* use the address that the operator selection procedure returned as the target address of the call *)
  5951. InitOperand(operand, ModeValue);
  5952. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5953. Emit(Result(position,operand.op))
  5954. END
  5955. END;
  5956. ReleaseParameterRegisters();
  5957. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5958. SaveRegisters();ReleaseUsedRegisters(saved2);
  5959. CallThis(position,"Objects","LeaveA2",0);
  5960. RestoreRegisters(saved2);
  5961. END;
  5962. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5963. Emit(Call(position,operand.op,0));
  5964. ELSE
  5965. Emit(Call(position,operand.op,parametersSize));
  5966. END;
  5967. ReleaseOperand(operand);
  5968. IF procedureType.noReturn THEN
  5969. EmitTrap(position,NoReturnTrap);
  5970. END;
  5971. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5972. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5973. Emit(Result(position,return));
  5974. END;
  5975. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5976. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5977. Emit(Push(position, return));
  5978. CallThis(position,"Objects","ReenterA2",0);
  5979. Emit(Pop(position, return));
  5980. ELSE
  5981. CallThis(position,"Objects","ReenterA2",0);
  5982. END;
  5983. END;
  5984. (* === return parameter space === *)
  5985. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (addressType.sizeInBits = 64) THEN
  5986. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5987. (* cleanup all space for all parameters *)
  5988. IF parametersSize < 32 THEN
  5989. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5990. parametersSize := 32
  5991. END;
  5992. size := IntermediateCode.Immediate(addressType,parametersSize);
  5993. Emit(Add(position,sp,sp,size))
  5994. END;
  5995. IF (callingConvention IN SysvABI) THEN
  5996. IF parameterRegisters > 0 THEN
  5997. IF parameters.Length() > parameterRegisters THEN
  5998. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5999. ELSE
  6000. parametersSize := 0
  6001. END;
  6002. ELSE
  6003. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  6004. INC( parametersSize, (-parametersSize) MOD 16 )
  6005. END;
  6006. IF parametersSize > 0 THEN
  6007. size := IntermediateCode.Immediate(addressType,parametersSize);
  6008. Emit(Add(position,sp,sp,size))
  6009. END;
  6010. END;
  6011. IF alignment > 1 THEN
  6012. Emit(Pop(position,sp));
  6013. END;
  6014. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  6015. Emit(Pop(position, ap));
  6016. END;
  6017. IF firstWriteBackCall # NIL THEN
  6018. SaveRegisters(); ReleaseUsedRegisters(saved2);
  6019. (* perform all write-back calls in the list *)
  6020. currentWriteBackCall := firstWriteBackCall;
  6021. WHILE currentWriteBackCall # NIL DO
  6022. VisitProcedureCallDesignator(currentWriteBackCall.call);
  6023. currentWriteBackCall := currentWriteBackCall.next
  6024. END;
  6025. RestoreRegisters(saved2);
  6026. END;
  6027. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  6028. IF structuredReturnType THEN
  6029. RestoreRegisters(saved);
  6030. InitOperand(result,ModeReference);
  6031. Symbol(variable,result);
  6032. ELSE
  6033. RestoreRegisters(saved);
  6034. InitOperand(result,ModeValue);
  6035. result.op := return;
  6036. END;
  6037. END;
  6038. destination := dest;
  6039. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  6040. END VisitProcedureCallDesignator;
  6041. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  6042. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  6043. td: SyntaxTree.Symbol;
  6044. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  6045. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  6046. BEGIN
  6047. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  6048. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  6049. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  6050. variable.SetType(system.anyType);
  6051. scope.AddVariable(variable);
  6052. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  6053. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  6054. typeDeclaration.SetDeclaredType(hiddenPointerType);
  6055. typeDeclaration.SetScope(module.module.moduleScope);
  6056. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  6057. hiddenPointerType.SetState(SyntaxTree.Resolved);
  6058. END;
  6059. RETURN hiddenPointerType;
  6060. END GetHiddenPointerType;
  6061. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  6062. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  6063. BEGIN
  6064. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  6065. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  6066. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  6067. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  6068. scope.AddVariable(variable);
  6069. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  6070. variable.SetType(system.anyType);
  6071. scope.AddVariable(variable);
  6072. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  6073. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  6074. typeDeclaration.SetDeclaredType(delegatePointerType);
  6075. typeDeclaration.SetScope(module.module.moduleScope);
  6076. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  6077. delegatePointerType.SetState(SyntaxTree.Resolved);
  6078. END;
  6079. RETURN delegatePointerType
  6080. END GetDelegateType;
  6081. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  6082. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  6083. such as in VAR a: RECORD ... END;
  6084. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  6085. and variables, constants and procedures the same mechanism can be used for fixups etc.
  6086. *)
  6087. VAR source: Sections.Section;td: SyntaxTree.TypeDeclaration;
  6088. baseRecord: SyntaxTree.RecordType;
  6089. BEGIN (* no code emission *)
  6090. source := NIL;
  6091. x := x.resolved;
  6092. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  6093. x := GetHiddenPointerType();
  6094. ELSIF IsDelegate(x) THEN
  6095. x := GetDelegateType();
  6096. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  6097. ELSE HALT(200);
  6098. END;
  6099. td := x.typeDeclaration;
  6100. IF td = NIL THEN
  6101. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  6102. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  6103. ASSERT(td # NIL);
  6104. END;
  6105. GetCodeSectionNameForSymbol(td,name);
  6106. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  6107. meta.CheckTypeDeclaration(x);
  6108. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  6109. ELSE
  6110. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  6111. END;
  6112. IF backend.cooperative OR meta.simple THEN
  6113. offset := 0;
  6114. ELSE
  6115. IF x IS SyntaxTree.CellType THEN
  6116. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  6117. IF baseRecord = NIL THEN
  6118. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  6119. ELSE
  6120. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  6121. END;
  6122. ELSE
  6123. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  6124. END;
  6125. END;
  6126. RETURN td
  6127. END GetBackendType;
  6128. BEGIN
  6129. (*td := t.typeDeclaration;*)
  6130. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  6131. (*
  6132. IF t IS SyntaxTree.PointerType THEN
  6133. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  6134. ELSE
  6135. source := GetBackendType(t);
  6136. END;
  6137. *)
  6138. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  6139. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  6140. IntermediateCode.SetOffset(res,offset);
  6141. (*
  6142. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  6143. make memory should be used when tag is used, not earlier
  6144. *)
  6145. RETURN res
  6146. END TypeDescriptorAdr;
  6147. (*
  6148. PROCEDURE MakeTypeTag(VAR operand: Operand);
  6149. VAR result: IntermediateCode.Operand;
  6150. BEGIN
  6151. IF operand.tag.mode = IntermediateCode.Undefined THEN
  6152. operand.tag := TypeDescriptorAdr(operand.type);
  6153. IntermediateCode.MakeMemory(operand.tag,addressType);
  6154. UseIntermediateOperand(operand.tag);
  6155. END;
  6156. END MakeTypeTag;
  6157. *)
  6158. PROCEDURE ProfilerInit;
  6159. VAR reg: IntermediateCode.Operand;
  6160. BEGIN
  6161. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  6162. Emit(Call(position,reg,0));
  6163. END ProfilerInit;
  6164. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  6165. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  6166. BEGIN
  6167. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  6168. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  6169. THEN
  6170. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6171. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  6172. Emit(Push(position,reg));
  6173. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  6174. Emit(Push(position,reg));
  6175. StaticCallOperand(result,procedure);
  6176. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6177. ReleaseOperand(result);
  6178. END;
  6179. END ProfilerEnterExit;
  6180. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  6181. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  6182. BEGIN
  6183. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  6184. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6185. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  6186. profileInit.Emit(Push(position,reg));
  6187. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  6188. profileInit.Emit(Push(position,reg));
  6189. NEW(string, LEN(name)); COPY(name, string^);
  6190. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6191. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  6192. sv.SetType(type);
  6193. Designate(sv,result);
  6194. profileInit.Emit(Push(position,result.tag));
  6195. profileInit.Emit(Push(position,result.op));
  6196. StaticCallOperand(result,procedure);
  6197. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6198. ReleaseOperand(result);
  6199. END;
  6200. END ProfilerAddProcedure;
  6201. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  6202. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  6203. BEGIN
  6204. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  6205. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  6206. profileInit.Emit(Push(position,reg));
  6207. profileInitPatchPosition := profileInit.pc;
  6208. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  6209. NEW(string, LEN(name)); COPY(name, string^);
  6210. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  6211. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  6212. sv.SetType(type);
  6213. Designate(sv,result);
  6214. profileInit.Emit(Push(position,result.tag));
  6215. profileInit.Emit(Push(position,result.op));
  6216. StaticCallOperand(result,procedure);
  6217. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  6218. ReleaseOperand(result);
  6219. END;
  6220. END ProfilerAddModule;
  6221. PROCEDURE ProfilerPatchInit;
  6222. VAR reg: IntermediateCode.Operand;
  6223. BEGIN
  6224. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  6225. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  6226. EmitLeave(profileInit,position,NIL,0);
  6227. profileInit.Emit(Exit(position,0,0,0));
  6228. END ProfilerPatchInit;
  6229. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  6230. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  6231. VAR
  6232. id: LONGINT;
  6233. leftType, rightType: SyntaxTree.Type;
  6234. procedureType: SyntaxTree.ProcedureType;
  6235. runtimeProcedure: SyntaxTree.Procedure;
  6236. runtimeProcedureOperand, operatorOperand: Operand;
  6237. kind: SET;
  6238. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  6239. VAR
  6240. arg: IntermediateCode.Operand;
  6241. recordType: SyntaxTree.RecordType;
  6242. fingerPrint: SyntaxTree.FingerPrint;
  6243. BEGIN
  6244. IF type = NIL THEN
  6245. (* no type: push 'NoType' *)
  6246. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6247. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  6248. ELSIF IsStrictlyPointerToRecord(type) THEN
  6249. (* pointer to record type: push typetag *)
  6250. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6251. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6252. arg := TypeDescriptorAdr(recordType);
  6253. ELSE
  6254. (* non-pointer to record type: push fingerprint *)
  6255. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6256. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  6257. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  6258. END;
  6259. operatorInitializationCodeSection.Emit(Push(position,arg))
  6260. END PushTypeInfo;
  6261. BEGIN
  6262. ASSERT(operatorInitializationCodeSection # NIL);
  6263. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  6264. procedureType := operator.type(SyntaxTree.ProcedureType);
  6265. (* determine types *)
  6266. leftType := procedureType.firstParameter.type;
  6267. IF procedureType.numberParameters = 2 THEN
  6268. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  6269. rightType := procedureType.firstParameter.nextParameter.type;
  6270. ELSE
  6271. rightType := NIL
  6272. END;
  6273. (* determine operator kind *)
  6274. IF IsStrictlyPointerToRecord(leftType) THEN
  6275. kind := {LhsIsPointer}
  6276. ELSE
  6277. kind := {}
  6278. END;
  6279. IF IsStrictlyPointerToRecord(rightType) THEN
  6280. kind := kind + {RhsIsPointer}
  6281. END;
  6282. IF kind # {} THEN (* TODO: to be removed later on *)
  6283. (* at least one of the types is a pointer to record *)
  6284. (* emit a code that registers this specific operator in the runtime *)
  6285. dump := operatorInitializationCodeSection.comments;
  6286. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6287. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  6288. (* push ID *)
  6289. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6290. id := Global.GetSymbol(module.module.case, operator.name);
  6291. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  6292. (* push kind *)
  6293. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6294. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  6295. (* push type infos *)
  6296. PushTypeInfo(leftType);
  6297. PushTypeInfo(rightType);
  6298. (* push operator address *)
  6299. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  6300. StaticCallOperand(operatorOperand, operator);
  6301. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  6302. ReleaseOperand(operatorOperand);
  6303. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  6304. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  6305. ReleaseOperand(runtimeProcedureOperand)
  6306. END
  6307. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  6308. END
  6309. END RegisterDynamicOperator;
  6310. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  6311. VAR
  6312. traceModule: SyntaxTree.Module;
  6313. procedure: SyntaxTree.Procedure;
  6314. procedureVariable: SyntaxTree.Variable;
  6315. s,msg: Basic.MessageString;
  6316. res: Operand;
  6317. i: LONGINT;
  6318. sv: SyntaxTree.StringValue;
  6319. type: SyntaxTree.Type;
  6320. recordType: SyntaxTree.RecordType;
  6321. printout: Printout.Printer;
  6322. stringWriter: Streams.StringWriter;
  6323. expression: SyntaxTree.Expression;
  6324. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  6325. BEGIN
  6326. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  6327. IF procedure = NIL THEN
  6328. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  6329. END;
  6330. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  6331. s := "procedure ";
  6332. Strings.Append(s,backend.traceModuleName);
  6333. Strings.Append(s,".");
  6334. Strings.Append(s,procedureName);
  6335. Strings.Append(s," not present");
  6336. Error(position,s);
  6337. RETURN FALSE
  6338. ELSE
  6339. RETURN TRUE
  6340. END;
  6341. END GetProcedure;
  6342. PROCEDURE CallProcedure;
  6343. VAR size: LONGINT;
  6344. BEGIN
  6345. IF procedure # NIL THEN
  6346. StaticCallOperand(result,procedure);
  6347. size := ProcParametersSize(procedure);
  6348. ELSE
  6349. Symbol(procedureVariable, result);
  6350. LoadValue(result, procedureVariable.type.resolved);
  6351. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  6352. END;
  6353. Emit(Call(position,result.op,size));
  6354. END CallProcedure;
  6355. PROCEDURE String(CONST s: ARRAY OF CHAR);
  6356. VAR res: Operand; string: SyntaxTree.String;
  6357. BEGIN
  6358. IF GetProcedure("String") THEN
  6359. NEW(string, LEN(s)); COPY(s, string^);
  6360. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6361. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6362. sv.SetType(type);
  6363. Designate(sv,res);
  6364. Emit(Push(position,res.tag));
  6365. Emit(Push(position,res.op));
  6366. ReleaseOperand(res);
  6367. CallProcedure;
  6368. END;
  6369. END String;
  6370. PROCEDURE Integer(op: IntermediateCode.Operand);
  6371. BEGIN
  6372. IF GetProcedure("Int") THEN
  6373. Emit(Push(position,op));
  6374. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  6375. CallProcedure;
  6376. END;
  6377. END Integer;
  6378. PROCEDURE Float(op: IntermediateCode.Operand);
  6379. BEGIN
  6380. IF GetProcedure("HIntHex") THEN
  6381. Emit(Push(position,op));
  6382. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  6383. CallProcedure;
  6384. END;
  6385. END Float;
  6386. PROCEDURE Set(op: IntermediateCode.Operand);
  6387. BEGIN
  6388. IF GetProcedure("Set") THEN
  6389. Emit(Push(position,op));
  6390. (*
  6391. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  6392. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  6393. *)
  6394. CallProcedure;
  6395. END;
  6396. END Set;
  6397. PROCEDURE Boolean(op: IntermediateCode.Operand);
  6398. BEGIN
  6399. IF GetProcedure("Boolean") THEN
  6400. Emit(Push(position,op));
  6401. CallProcedure;
  6402. END;
  6403. END Boolean;
  6404. PROCEDURE Char(op: IntermediateCode.Operand);
  6405. BEGIN
  6406. IF GetProcedure("Char") THEN
  6407. Emit(Push(position,op));
  6408. CallProcedure;
  6409. END;
  6410. END Char;
  6411. PROCEDURE Address(op: IntermediateCode.Operand);
  6412. BEGIN
  6413. IF GetProcedure("Address") THEN
  6414. Emit(Push(position,op));
  6415. CallProcedure;
  6416. END;
  6417. END Address;
  6418. PROCEDURE Size(op: IntermediateCode.Operand);
  6419. BEGIN
  6420. IF GetProcedure("Size") THEN
  6421. Emit(Push(position,op));
  6422. CallProcedure;
  6423. END;
  6424. END Size;
  6425. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6426. VAR len: IntermediateCode.Operand;
  6427. BEGIN
  6428. IF GetProcedure("String") THEN
  6429. len := GetArrayLength(type, op.tag);
  6430. Emit(Push(position,len));
  6431. ReleaseIntermediateOperand(len);
  6432. Emit(Push(position,op.op));
  6433. CallProcedure;
  6434. END;
  6435. END StringOperand;
  6436. PROCEDURE Ln;
  6437. BEGIN
  6438. IF GetProcedure("Ln") THEN
  6439. CallProcedure;
  6440. END;
  6441. END Ln;
  6442. BEGIN
  6443. IF backend.traceModuleName = "" THEN RETURN END;
  6444. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6445. IF GetProcedure("Enter") THEN
  6446. CallProcedure
  6447. END;
  6448. NEW(stringWriter,LEN(s));
  6449. FOR i := 0 TO x.Length()-1 DO
  6450. msg := "";
  6451. expression := x.GetExpression(i);
  6452. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6453. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6454. ELSE
  6455. Global.GetModuleName(module.module, s);
  6456. END;
  6457. IF i = 0 THEN
  6458. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6459. stringWriter.String(":");
  6460. END;
  6461. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6462. IF ~(expression IS SyntaxTree.StringValue) THEN
  6463. printout.Expression(expression);
  6464. stringWriter.Get(s);
  6465. Strings.Append(msg,s);
  6466. Strings.Append(msg,"= ");
  6467. ELSE stringWriter.Get(s); (* remove from string writer *)
  6468. Strings.Append(msg, s);
  6469. END;
  6470. String(msg);
  6471. IF SemanticChecker.IsStringType(expression.type) THEN
  6472. Designate(expression,res);
  6473. StringOperand(res, expression.type);
  6474. ELSE
  6475. Evaluate(expression,res);
  6476. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6477. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6478. Convert(res.op,int64);
  6479. END;
  6480. Integer(res.op);
  6481. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6482. Boolean(res.op);
  6483. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6484. Set(res.op);
  6485. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6486. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6487. Convert(res.op,float64);
  6488. END;
  6489. Float(res.op);
  6490. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6491. Char(res.op);
  6492. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6493. Address(res.op);String("H");
  6494. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6495. Size(res.op);
  6496. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6497. Address(res.op);String("H");
  6498. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6499. Address(res.op);String("H");
  6500. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6501. String("NIL");
  6502. ELSE HALT(200);
  6503. END;
  6504. END;
  6505. ReleaseOperand(res);
  6506. String("; ");
  6507. END;
  6508. IF GetProcedure("Exit") THEN
  6509. CallProcedure
  6510. ELSE
  6511. Ln;
  6512. END;
  6513. END;
  6514. END SystemTrace;
  6515. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6516. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6517. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6518. BEGIN
  6519. type := type.resolved;
  6520. IF type IS SyntaxTree.RecordType THEN
  6521. WITH type: SyntaxTree.RecordType DO
  6522. baseType := type.baseType;
  6523. IF baseType # NIL THEN
  6524. baseType := baseType.resolved;
  6525. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6526. InitFields(baseType,adr,offset);
  6527. END;
  6528. variable := type.recordScope.firstVariable;
  6529. WHILE variable # NIL DO
  6530. IF variable.initializer # NIL THEN
  6531. Evaluate(variable.initializer,initializerOp);
  6532. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6533. Emit(Mov(position,mem,initializerOp.op));
  6534. ReleaseOperand(initializerOp);
  6535. ReleaseIntermediateOperand(mem);
  6536. END;
  6537. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6538. variable := variable.nextVariable
  6539. END;
  6540. END;
  6541. ELSIF type IS SyntaxTree.CellType THEN
  6542. WITH type: SyntaxTree.CellType DO
  6543. baseType := type.baseType;
  6544. IF baseType # NIL THEN
  6545. baseType := baseType.resolved;
  6546. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6547. InitFields(baseType,adr,offset);
  6548. END;
  6549. variable := type.cellScope.firstVariable;
  6550. WHILE variable # NIL DO
  6551. IF variable.initializer # NIL THEN
  6552. Evaluate(variable.initializer,initializerOp);
  6553. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6554. Emit(Mov(position,mem,initializerOp.op));
  6555. ReleaseOperand(initializerOp);
  6556. ReleaseIntermediateOperand(mem);
  6557. END;
  6558. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6559. variable := variable.nextVariable
  6560. END;
  6561. END;
  6562. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6563. WITH type: SyntaxTree.ArrayType DO
  6564. IF type.form = SyntaxTree.Static THEN
  6565. baseType := type.arrayBase;
  6566. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6567. FOR i := 0 TO type.staticLength-1 DO
  6568. InitFields(baseType,adr,offset+i*size);
  6569. END;
  6570. END;
  6571. END;
  6572. ELSIF type IS SyntaxTree.MathArrayType THEN
  6573. WITH type: SyntaxTree.MathArrayType DO
  6574. IF type.form = SyntaxTree.Open THEN
  6575. dim := DynamicDim(type);
  6576. imm := IntermediateCode.Immediate(addressType,dim);
  6577. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6578. baseType := SemanticChecker.ArrayBase(type,dim);
  6579. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6580. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6581. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6582. ReleaseIntermediateOperand(imm);
  6583. (* flags remain empty (=0) for open array *)
  6584. ELSIF type.form = SyntaxTree.Static THEN
  6585. baseType := type.arrayBase;
  6586. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6587. ASSERT(type.staticLength < 1024*1024*1024);
  6588. FOR i := 0 TO type.staticLength-1 DO
  6589. InitFields(baseType,adr,offset+i*size);
  6590. END;
  6591. END;
  6592. END;
  6593. END;
  6594. END InitFields;
  6595. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6596. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6597. saved: RegisterEntry;
  6598. BEGIN
  6599. type := variable.type.resolved;
  6600. IF (type IS SyntaxTree.MathArrayType) THEN
  6601. WITH type: SyntaxTree.MathArrayType DO
  6602. IF type.form = SyntaxTree.Open THEN
  6603. Symbol(variable,operand);
  6604. InitFields(type, operand.tag,0);
  6605. IF temporary THEN
  6606. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6607. END;
  6608. ELSIF type.form = SyntaxTree.Tensor THEN
  6609. IF temporary & backend.writeBarriers THEN
  6610. SaveRegisters();ReleaseUsedRegisters(saved);
  6611. Symbol(variable, operand);
  6612. Emit(Push(position,operand.op));
  6613. ReleaseOperand(operand);
  6614. Emit(Push(position,nil));
  6615. CallThis(position,"FoxArrayBase","Assign",2);
  6616. RestoreRegisters(saved);
  6617. ELSE
  6618. Symbol(variable, operand);
  6619. MakeMemory(tmp,operand.op,addressType,0);
  6620. ReleaseOperand(operand);
  6621. IF FALSE & temporary THEN
  6622. (* trick -- temporary object from array base *)
  6623. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6624. Symbol(symbol,operand);
  6625. MakeMemory(mem,operand.op,addressType,0);
  6626. ReleaseOperand(operand);
  6627. Emit(Mov(position,tmp, mem) );
  6628. ReleaseOperand(operand);
  6629. ELSE
  6630. Emit(Mov(position,tmp, nil ) );
  6631. END;
  6632. ReleaseIntermediateOperand(tmp)
  6633. END;
  6634. END;
  6635. END;
  6636. ELSE
  6637. Symbol(variable,operand);
  6638. IF variable.initializer # NIL THEN
  6639. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6640. reference.SetType(variable.type.resolved);
  6641. reference.SetAssignable(TRUE);
  6642. Assign(reference,variable.initializer);
  6643. ELSIF temporary THEN
  6644. IF SemanticChecker.IsPointerType(variable.type) THEN
  6645. IF backend.cooperative THEN
  6646. SaveRegisters();ReleaseUsedRegisters(saved);
  6647. Symbol(variable, operand);
  6648. CallAssignPointer(operand.op, nil);
  6649. ReleaseOperand(operand);
  6650. RestoreRegisters(saved);
  6651. ELSIF backend.writeBarriers THEN
  6652. SaveRegisters();ReleaseUsedRegisters(saved);
  6653. Symbol(variable, operand);
  6654. Emit(Push(position,operand.op));
  6655. ReleaseOperand(operand);
  6656. Emit(Push(position,nil));
  6657. CallThis(position,"Heaps","Assign",2);
  6658. RestoreRegisters(saved);
  6659. ELSE
  6660. Symbol(variable, operand);
  6661. MakeMemory(tmp,operand.op,addressType,0);
  6662. ReleaseOperand(operand);
  6663. Emit(Mov(position,tmp, nil ) );
  6664. ReleaseIntermediateOperand(tmp);
  6665. END;
  6666. END;
  6667. END;
  6668. InitFields(type, operand.op,0);
  6669. ReleaseOperand(operand);
  6670. END;
  6671. END InitVariable;
  6672. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6673. VAR end: Label;
  6674. BEGIN
  6675. IF type.form = SyntaxTree.Tensor THEN
  6676. InitOperand(result,ModeValue);
  6677. ReuseCopy(result.op,base);
  6678. end := NewLabel();
  6679. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6680. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6681. SetLabel(end);
  6682. Convert(result.op,lenType);
  6683. ELSE
  6684. InitOperand(result,ModeValue);
  6685. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6686. END
  6687. END MathArrayDim;
  6688. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6689. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6690. BEGIN
  6691. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6692. MakeMemory(mem,base,addressType,offset);
  6693. Emit(Mov(position,mem,value));
  6694. ReleaseIntermediateOperand(mem);
  6695. END PutMathArrayField;
  6696. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6697. VAR mem: IntermediateCode.Operand;
  6698. BEGIN
  6699. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6700. MakeMemory(mem,base,addressType,offset);
  6701. Emit(Mov(position,mem,value));
  6702. ReleaseIntermediateOperand(mem);
  6703. END PutMathArrayFieldOffset;
  6704. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6705. BEGIN
  6706. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6707. MakeMemory(value,base,addressType,offset);
  6708. END GetMathArrayField;
  6709. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6710. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6711. BEGIN
  6712. IF incr THEN
  6713. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6714. ELSE
  6715. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6716. END;
  6717. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6718. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6719. ELSE
  6720. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6721. Emit(Mov(position,reg,dim));
  6722. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6723. Emit(Add(position,reg,reg,base));
  6724. MakeMemory(mem, reg, addressType, offset);
  6725. ReleaseIntermediateOperand(reg);
  6726. Emit(Mov(position,mem,value));
  6727. ReleaseIntermediateOperand(mem);
  6728. END;
  6729. END PutMathArrayLenOrIncr;
  6730. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6731. BEGIN
  6732. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6733. END PutMathArrayLength;
  6734. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6735. BEGIN
  6736. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6737. END PutMathArrayIncrement;
  6738. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6739. BEGIN
  6740. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6741. END GetMathArrayIncrement;
  6742. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6743. BEGIN
  6744. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6745. END GetMathArrayLength;
  6746. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6747. VAR dimOp: IntermediateCode.Operand;
  6748. BEGIN
  6749. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6750. GetMathArrayLength(type, operand, dimOp, check, result);
  6751. END GetMathArrayLengthAt;
  6752. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6753. VAR dimOp: IntermediateCode.Operand;
  6754. BEGIN
  6755. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6756. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6757. END GetMathArrayIncrementAt;
  6758. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6759. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6760. offset: LONGINT;
  6761. BEGIN
  6762. IF increment THEN
  6763. offset := MathIncrOffset;
  6764. ELSE
  6765. offset := MathLenOffset;
  6766. END;
  6767. INC(offset,operand.dimOffset*2);
  6768. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6769. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6770. END;
  6771. (* static dimension *)
  6772. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6773. IF check & (type.form = SyntaxTree.Tensor) THEN
  6774. DimensionCheck(operand.tag,dim,BrltL);
  6775. END;
  6776. val := SHORT(dim.intValue);
  6777. IF type.form # SyntaxTree.Tensor THEN
  6778. t := SemanticChecker.ArrayBase(type,val);
  6779. type := t.resolved(SyntaxTree.MathArrayType);
  6780. IF type.form = SyntaxTree.Static THEN
  6781. IF increment THEN
  6782. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6783. ELSE
  6784. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6785. END;
  6786. InitOperand(result,ModeValue);
  6787. result.op := res;
  6788. RETURN;
  6789. END;
  6790. END;
  6791. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6792. MakeMemory(res,operand.tag,addressType,offset);
  6793. (*
  6794. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6795. *)
  6796. InitOperand(result,ModeValue);
  6797. result.op := res;
  6798. ELSE
  6799. Convert(dim,addressType);
  6800. IF check THEN
  6801. IF type.form = SyntaxTree.Tensor THEN
  6802. DimensionCheck(operand.tag,dim,BrltL);
  6803. ELSIF isUnchecked THEN (* do nothing *)
  6804. ELSE
  6805. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6806. END;
  6807. END;
  6808. end := NewLabel(); next := NIL;
  6809. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6810. Emit(Mov(position,res,dim));
  6811. Convert(res,sizeType);
  6812. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6813. WHILE t IS SyntaxTree.MathArrayType DO
  6814. type := t(SyntaxTree.MathArrayType);
  6815. IF type.form = SyntaxTree.Static THEN
  6816. imm := IntermediateCode.Immediate(sizeType,val);
  6817. next := NewLabel();
  6818. BrneL(next,imm,res);
  6819. IF increment THEN
  6820. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6821. ELSE
  6822. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6823. END;
  6824. Emit(MovReplace(position,res,imm));
  6825. BrL(end);
  6826. ELSE hasDynamicPart := TRUE;
  6827. END;
  6828. t := type.arrayBase.resolved;
  6829. val := val + 1;
  6830. IF next # NIL THEN SetLabel(next) END;
  6831. END;
  6832. IF hasDynamicPart THEN
  6833. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6834. Emit(Mov(position,res2,dim));
  6835. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6836. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6837. Emit(Add(position,res2,res2,imm));
  6838. Emit(Add(position,res2,res2,operand.tag));
  6839. IntermediateCode.MakeMemory(res2,sizeType);
  6840. Emit(MovReplace(position,res,res2));
  6841. ReleaseIntermediateOperand(res2);
  6842. END;
  6843. SetLabel(end);
  6844. Convert(res,sizeType);
  6845. InitOperand(result,ModeValue);
  6846. result.op := res;
  6847. END;
  6848. END MathArrayLenOrIncr;
  6849. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6850. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6851. offset: LONGINT;
  6852. BEGIN
  6853. offset := operand.dimOffset+DynamicDim(type)-1;
  6854. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6855. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6856. val := SHORT(dim.intValue);
  6857. t := SemanticChecker.ArrayBase(type,val);
  6858. type := t.resolved(SyntaxTree.ArrayType);
  6859. IF type.form = SyntaxTree.Static THEN
  6860. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6861. ELSE
  6862. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6863. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6864. END;
  6865. UseIntermediateOperand(res);
  6866. InitOperand(result,ModeValue);
  6867. result.op := res;
  6868. ELSE
  6869. Convert(dim,addressType);
  6870. IF ~isUnchecked THEN
  6871. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6872. END;
  6873. end := NewLabel(); next := NIL;
  6874. (* ReuseCopy(dim,res); *)
  6875. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6876. Emit(Mov(position,res,dim));
  6877. Convert(res,sizeType);
  6878. Convert(res,sizeType);
  6879. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6880. WHILE t IS SyntaxTree.ArrayType DO
  6881. type := t(SyntaxTree.ArrayType);
  6882. IF type.form = SyntaxTree.Static THEN
  6883. imm := IntermediateCode.Immediate(sizeType,val);
  6884. next := NewLabel();
  6885. BrneL(next,imm,res);
  6886. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6887. Emit(MovReplace(position,res,imm));
  6888. BrL(end);
  6889. ELSE hasDynamicPart := TRUE;
  6890. END;
  6891. t := type.arrayBase.resolved;
  6892. val := val + 1;
  6893. IF next # NIL THEN SetLabel(next) END;
  6894. END;
  6895. IF hasDynamicPart THEN
  6896. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6897. Convert(res2,addressType);
  6898. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6899. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6900. Emit(Sub(position,res2,imm,res2));
  6901. Emit(Add(position,res2,res2,operand.tag));
  6902. IntermediateCode.MakeMemory(res2,sizeType);
  6903. Emit(MovReplace(position,res,res2));
  6904. ReleaseIntermediateOperand(res2);
  6905. END;
  6906. SetLabel(end);
  6907. Convert(res,sizeType);
  6908. InitOperand(result,ModeValue);
  6909. result.op := res;
  6910. END;
  6911. END ArrayLen;
  6912. (**
  6913. create a temporary variable in current scope
  6914. **)
  6915. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6916. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6917. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6918. BEGIN
  6919. IF ~register THEN
  6920. v := temporaries.GetFreeVariable(type, untraced, index);
  6921. ELSE
  6922. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6923. END;
  6924. scope := currentScope;
  6925. IF (scope IS SyntaxTree.ProcedureScope) & (scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).noPAF) THEN
  6926. Error(scope(SyntaxTree.ProcedureScope).ownerProcedure.position,"implementation restriction: cannot allocate temporary variable in procedure without activation frame");
  6927. END;
  6928. (*
  6929. v := NIL; (* disable free variable managemenet for the time being *)
  6930. *)
  6931. name := temporaries.GetUID();
  6932. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6933. variable.SetType(type);
  6934. variable.SetAccess(SyntaxTree.Hidden);
  6935. variable.SetUntraced(untraced);
  6936. IF v = NIL THEN
  6937. temporaries.AddVariable(variable);
  6938. IF ~register THEN
  6939. IF scope.lastVariable # NIL THEN
  6940. offset := scope.lastVariable.offsetInBits;
  6941. ELSE
  6942. offset := 0;
  6943. END;
  6944. DEC(offset,system.SizeOf(variable.type));
  6945. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6946. variable(SyntaxTree.Variable).SetOffset(offset);
  6947. scope.AddVariable(variable(SyntaxTree.Variable));
  6948. scope.EnterSymbol(variable, duplicate);
  6949. ASSERT(~duplicate);
  6950. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6951. ELSE
  6952. variable.SetUseRegister(TRUE);
  6953. variable(SyntaxTree.Variable).SetOffset(0);
  6954. END;
  6955. ELSE (* v # NIL *)
  6956. (* reuse slot for new variable, do not create new slot ! *)
  6957. temporaries.SetVariable(index, variable);
  6958. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6959. ASSERT(~register);
  6960. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6961. ASSERT(v.offsetInBits # 0);
  6962. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6963. scope.EnterSymbol(variable, duplicate);
  6964. ASSERT(~duplicate);
  6965. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6966. END;
  6967. RETURN variable(SyntaxTree.Variable)
  6968. END GetTemporaryVariable;
  6969. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6970. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6971. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6972. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6973. i: LONGINT; duplicate: BOOLEAN;
  6974. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6975. VAR variable: SyntaxTree.Variable;
  6976. BEGIN
  6977. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6978. variable.SetType(type);
  6979. recordScope.AddVariable(variable);
  6980. END AddVariable;
  6981. BEGIN
  6982. name := "@ArrayDescriptor";
  6983. Basic.AppendNumber(name,dimensions);
  6984. identifier := SyntaxTree.NewIdentifier(name);
  6985. parentScope := module.module.moduleScope;
  6986. symbol := parentScope.FindSymbol(identifier);
  6987. IF symbol # NIL THEN
  6988. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6989. type := typeDeclaration.declaredType;
  6990. ELSE
  6991. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6992. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6993. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6994. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6995. recordType.SetTypeDeclaration(typeDeclaration);
  6996. recordType.SetState(SyntaxTree.Resolved);
  6997. typeDeclaration.SetDeclaredType(recordType);
  6998. AddVariable("@ptr",system.anyType);
  6999. AddVariable("@adr",system.addressType);
  7000. AddVariable("@flags",system.addressType);
  7001. AddVariable("@dim",system.addressType);
  7002. AddVariable("@elementSize",system.addressType);
  7003. FOR i := 0 TO dimensions-1 DO
  7004. name := "@len";
  7005. Basic.AppendNumber(name,i);
  7006. AddVariable(name,system.addressType);
  7007. name := "@incr";
  7008. Basic.AppendNumber(name,i);
  7009. AddVariable(name,system.addressType);
  7010. END;
  7011. parentScope.AddTypeDeclaration(typeDeclaration);
  7012. parentScope.EnterSymbol(typeDeclaration,duplicate);
  7013. ASSERT(~duplicate);
  7014. type := recordType;
  7015. END;
  7016. RETURN type
  7017. END GetMathArrayDescriptorType;
  7018. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  7019. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  7020. BEGIN
  7021. NEW(string, LEN(s)); COPY(s, string^);
  7022. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  7023. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  7024. sv.SetType(type);
  7025. Designate(sv,res);
  7026. Emit(Push(position,res.tag));
  7027. Emit(Push(position,res.op));
  7028. ReleaseOperand(res);
  7029. END PushConstString;
  7030. PROCEDURE PushConstBoolean(b: BOOLEAN);
  7031. BEGIN
  7032. IF b THEN
  7033. Emit(Push(Basic.invalidPosition, true));
  7034. ELSE
  7035. Emit(Push(Basic.invalidPosition, false));
  7036. END;
  7037. END PushConstBoolean;
  7038. PROCEDURE PushConstSet(v: SET);
  7039. VAR value: SyntaxTree.Value; op: Operand;
  7040. BEGIN
  7041. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  7042. value.SetType(system.setType);
  7043. Evaluate(value, op);
  7044. Emit(Push(Basic.invalidPosition, op.op));
  7045. ReleaseOperand(op);
  7046. END PushConstSet;
  7047. PROCEDURE PushConstInteger(v: LONGINT);
  7048. VAR value: SyntaxTree.Value; op: Operand;
  7049. BEGIN
  7050. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  7051. value.SetType(system.longintType);
  7052. Evaluate(value, op);
  7053. Emit(Push(Basic.invalidPosition, op.op));
  7054. ReleaseOperand(op);
  7055. END PushConstInteger;
  7056. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  7057. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  7058. section: IntermediateCode.Section;
  7059. BEGIN
  7060. procedureScope := SyntaxTree.NewProcedureScope(scope);
  7061. Global.GetSymbolSegmentedName(symbol, name);
  7062. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  7063. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  7064. procedure.SetScope(moduleScope);
  7065. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  7066. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  7067. procedure.SetAccess(SyntaxTree.Hidden);
  7068. currentScope := procedureScope;
  7069. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  7070. EmitEnter(section, Basic.invalidPosition,procedure,0,0);
  7071. RETURN section;
  7072. END OpenInitializer;
  7073. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  7074. BEGIN
  7075. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  7076. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  7077. section := prev;
  7078. END CloseInitializer;
  7079. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  7080. VAR name: SyntaxTree.IdentifierString;
  7081. parameter: SyntaxTree.Parameter;
  7082. type: SyntaxTree.Type;
  7083. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  7084. BEGIN
  7085. InitOperand(op,ModeReference);
  7086. op.op := fp;
  7087. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  7088. Dereference(op, x, FALSE);
  7089. result := op;
  7090. Symbol(symbol, op);
  7091. END Field;
  7092. PROCEDURE Direction(direction: LONGINT): SET;
  7093. BEGIN
  7094. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  7095. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  7096. ELSE HALT(100);
  7097. END;
  7098. END Direction;
  7099. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  7100. VAR name: ARRAY 256 OF CHAR; op: Operand;
  7101. BEGIN
  7102. Field(port, op);
  7103. ToMemory(op.op,addressType,0);
  7104. Emit(Push(Basic.invalidPosition, op.op));
  7105. ReleaseOperand(op);
  7106. Basic.GetString(modifier.identifier, name);
  7107. PushConstString(name);
  7108. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  7109. ASSERT(SemanticChecker.IsStringType(value.type));
  7110. Designate(value, op);
  7111. Emit(Push(modifier.position, op.tag));
  7112. Emit(Push(modifier.position, op.op));
  7113. ReleaseOperand(op);
  7114. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  7115. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  7116. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7117. Evaluate(value, op);
  7118. Emit(Push(modifier.position, op.op));
  7119. ReleaseOperand(op);
  7120. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  7121. ELSE
  7122. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  7123. END;
  7124. END AddPortProperty;
  7125. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  7126. VAR modifier: SyntaxTree.Modifier;
  7127. BEGIN
  7128. modifier := parameter.modifiers;
  7129. WHILE modifier # NIL DO
  7130. AddPortProperty(parameter,modifier, modifier.expression);
  7131. modifier := modifier.nextModifier;
  7132. END;
  7133. END AddPortProperties;
  7134. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  7135. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  7136. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  7137. PROCEDURE PushLens(type: SyntaxTree.Type);
  7138. BEGIN
  7139. IF IsSemiDynamicArray(type) THEN
  7140. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  7141. Evaluate(type(SyntaxTree.ArrayType).length, op);
  7142. Emit(Push(Basic.invalidPosition, op.op));
  7143. ReleaseOperand(op);
  7144. INC(dim);
  7145. ELSIF IsStaticArray(type) THEN
  7146. len := len * type(SyntaxTree.ArrayType).staticLength;
  7147. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  7148. INC(dim);
  7149. ELSE
  7150. baseType := type;
  7151. END;
  7152. END PushLens;
  7153. BEGIN
  7154. (* cell *)
  7155. IF parameter.type IS SyntaxTree.ArrayType THEN
  7156. type := parameter.type;
  7157. dim := 0;
  7158. len := 1;
  7159. PushLens(type);
  7160. portType := baseType.resolved(SyntaxTree.PortType);
  7161. ELSE
  7162. portType := parameter.type(SyntaxTree.PortType);
  7163. END;
  7164. PushSelfPointer();
  7165. (* port / array of ports *)
  7166. IF IsStaticArray(type) THEN
  7167. PushConstInteger(len);
  7168. END;
  7169. Field(parameter, op);
  7170. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  7171. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  7172. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  7173. Designate(d, op);*)
  7174. Emit(Push(Basic.invalidPosition, op.op));
  7175. ReleaseOperand(op);
  7176. (* name *)
  7177. PushConstString(name);
  7178. (* inout *)
  7179. PushConstSet(Direction(portType.direction));
  7180. (* width *)
  7181. PushConstInteger(portType.sizeInBits);
  7182. IF parameter.type IS SyntaxTree.PortType THEN
  7183. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  7184. AddPortProperties(parameter);
  7185. ELSIF IsStaticArray(type)THEN
  7186. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  7187. ELSIF IsSemiDynamicArray(type) THEN
  7188. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7189. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  7190. Emit(Add(position,reg, sp, size));
  7191. (* dim *)
  7192. PushConstInteger(dim);
  7193. (* len array *)
  7194. Emit(Push(position, reg));
  7195. ReleaseIntermediateOperand(reg);
  7196. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  7197. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  7198. Emit(Add(position, sp,sp, size));
  7199. ELSE
  7200. HALT(100);
  7201. END;
  7202. END Parameter;
  7203. BEGIN
  7204. IF backend.cellsAreObjects THEN
  7205. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  7206. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  7207. END;
  7208. parameter := x.firstParameter;
  7209. WHILE (parameter # NIL) DO
  7210. type := parameter.type.resolved;
  7211. WHILE (type IS SyntaxTree.ArrayType) DO
  7212. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7213. END;
  7214. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  7215. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  7216. Parameter(name,parameter);
  7217. END;
  7218. parameter := parameter.nextParameter;
  7219. END;
  7220. ELSE HALT(200)
  7221. END;
  7222. END AddPorts;
  7223. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  7224. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  7225. BEGIN
  7226. Symbol(cell,op);
  7227. ToMemory(op.op,addressType,0);
  7228. Emit(Push(position,op.op));
  7229. ReleaseOperand(op);
  7230. property.GetName(name);
  7231. (* does not work when inheritance is used:
  7232. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  7233. *)
  7234. PushConstString(name);
  7235. IF (value # NIL) THEN
  7236. ASSERT(
  7237. SemanticChecker.IsStringType(property.type)
  7238. OR (property.type.resolved IS SyntaxTree.IntegerType)
  7239. OR (property.type.resolved IS SyntaxTree.FloatType)
  7240. OR (property.type.resolved IS SyntaxTree.BooleanType)
  7241. OR (property.type.resolved IS SyntaxTree.SetType)
  7242. );
  7243. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  7244. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  7245. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  7246. Designate(d, op);
  7247. IF SemanticChecker.IsStringType(property.type) THEN
  7248. Emit(Push(Basic.invalidPosition, op.tag))
  7249. END;
  7250. Emit(Push(Basic.invalidPosition, op.op));
  7251. ReleaseOperand(op);
  7252. END;
  7253. IF value = NIL THEN
  7254. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  7255. ELSIF SemanticChecker.IsStringType(property.type) THEN
  7256. ASSERT(SemanticChecker.IsStringType(value.type));
  7257. Designate(value, op);
  7258. PushString(op, value.type);
  7259. ReleaseOperand(op);
  7260. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  7261. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  7262. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7263. Evaluate(value, op);
  7264. Emit(Push(property.position, op.op));
  7265. ReleaseOperand(op);
  7266. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  7267. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  7268. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  7269. Evaluate(value, op);
  7270. Emit(Push(property.position, op.op));
  7271. ReleaseOperand(op);
  7272. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  7273. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  7274. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  7275. Evaluate(value, op);
  7276. Emit(Push(property.position, op.op));
  7277. ReleaseOperand(op);
  7278. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  7279. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  7280. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  7281. Evaluate(value, op);
  7282. Emit(Push(property.position, op.op));
  7283. ReleaseOperand(op);
  7284. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  7285. ELSE
  7286. HALT(200);
  7287. END;
  7288. END AddProperty;
  7289. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  7290. VAR symbol: SyntaxTree.Symbol;
  7291. BEGIN
  7292. WHILE modifier # NIL DO
  7293. symbol := cellType.FindProperty(modifier.identifier);
  7294. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  7295. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  7296. modifier := modifier.nextModifier;
  7297. END;
  7298. END AddModifiers;
  7299. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  7300. VAR last: SyntaxTree.Modifier;
  7301. BEGIN
  7302. IF to = NIL THEN
  7303. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  7304. ELSE
  7305. last := to;
  7306. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  7307. last := last.nextModifier;
  7308. END;
  7309. IF last.identifier # this.identifier THEN
  7310. ASSERT(last.nextModifier = NIL);
  7311. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  7312. END;
  7313. END;
  7314. END AppendModifier;
  7315. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  7316. BEGIN
  7317. WHILE this # NIL DO
  7318. AppendModifier(to, this);
  7319. this := this.nextModifier;
  7320. END;
  7321. END AppendModifiers;
  7322. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  7323. VAR base: SyntaxTree.Type;
  7324. BEGIN
  7325. AppendModifiers(to, c.modifiers);
  7326. base := c.GetBaseValueType();
  7327. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  7328. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  7329. END;
  7330. END AppendCellTypeModifiers;
  7331. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  7332. VAR name: ARRAY 256 OF CHAR; op: Operand;
  7333. BEGIN
  7334. Basic.GetString(modifier.identifier, name);
  7335. PushConstString(name);
  7336. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  7337. ASSERT(SemanticChecker.IsStringType(value.type));
  7338. Designate(value, op);
  7339. PushString(op, value.type);
  7340. ReleaseOperand(op);
  7341. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  7342. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  7343. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  7344. Evaluate(value, op);
  7345. Emit(Push(modifier.position, op.op));
  7346. ReleaseOperand(op);
  7347. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  7348. ELSE
  7349. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  7350. END;
  7351. END AddPortProperty;
  7352. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  7353. BEGIN
  7354. WHILE modifier # NIL DO
  7355. AddPortProperty(modifier, modifier.expression);
  7356. modifier := modifier.nextModifier;
  7357. END;
  7358. END AddPortProperties;
  7359. PROCEDURE PushPort(p: SyntaxTree.Expression);
  7360. VAR op: Operand;
  7361. BEGIN
  7362. Evaluate(p, op);
  7363. Emit(Push(p.position, op.op));
  7364. ReleaseOperand(op);
  7365. IF p IS SyntaxTree.Designator THEN
  7366. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  7367. END;
  7368. END PushPort;
  7369. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  7370. VAR tmp: IntermediateCode.Operand;
  7371. BEGIN
  7372. actualType := actualType.resolved;
  7373. IF actualType IS SyntaxTree.StringType THEN
  7374. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  7375. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7376. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  7377. ELSE
  7378. tmp := op.tag;
  7379. IntermediateCode.MakeMemory(tmp,addressType);
  7380. Emit(Push(position,tmp));
  7381. END;
  7382. Emit(Push(position,op.op))
  7383. END PushString;
  7384. (* conservative check if x is potentially on the heap, excluding the module heap
  7385. required for generational garbage collector
  7386. *)
  7387. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  7388. BEGIN
  7389. RETURN TRUE;
  7390. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  7391. passed by reference.
  7392. pos := x.position.start;
  7393. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  7394. x := x(SyntaxTree.Designator).left;
  7395. END;
  7396. RETURN x # NIL;
  7397. *)
  7398. END OnHeap;
  7399. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  7400. VAR
  7401. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  7402. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  7403. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  7404. tmp:IntermediateCode.Operand;
  7405. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t0,t1,t2: SyntaxTree.Type; trueL,ignore: Label;
  7406. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  7407. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  7408. dest: IntermediateCode.Operand;
  7409. staticLength: LONGINT; itype: IntermediateCode.Type;
  7410. convert,isTensor: BOOLEAN;
  7411. recordType: SyntaxTree.RecordType;
  7412. baseType: SyntaxTree.Type;
  7413. left: SyntaxTree.Expression;
  7414. call: SyntaxTree.Designator;
  7415. procedure: SyntaxTree.Procedure;
  7416. temporaryVariable: SyntaxTree.Variable;
  7417. dummy: IntermediateCode.Operand;
  7418. customBuiltin: SyntaxTree.CustomBuiltin;
  7419. isVarPar: ARRAY 3 OF BOOLEAN;
  7420. callsection: Sections.Section;
  7421. segmentedName: Basic.SegmentedName;
  7422. needsTrace: BOOLEAN;
  7423. n: ARRAY 256 OF CHAR;
  7424. modifier: SyntaxTree.Modifier;
  7425. previous, init: IntermediateCode.Section;
  7426. prevScope: SyntaxTree.Scope;
  7427. firstPar: LONGINT;
  7428. saved: RegisterEntry;
  7429. callingConvention: SyntaxTree.CallingConvention;
  7430. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7431. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7432. priority: IntermediateCode.Operand;
  7433. op,callop: Operand;
  7434. BEGIN
  7435. IF type = NIL THEN RETURN END;
  7436. type := type.resolved;
  7437. IF type IS SyntaxTree.PointerType THEN
  7438. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7439. END;
  7440. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7441. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7442. recordScope := type(SyntaxTree.RecordType).recordScope;
  7443. IF recordScope.bodyProcedure # NIL THEN
  7444. procedure := recordScope.bodyProcedure;
  7445. body := procedure.procedureScope.body;
  7446. Emit(Push(position,self));
  7447. IF body.isActive THEN
  7448. StaticCallOperand(callop,procedure);
  7449. Emit(Push(position,callop.op));
  7450. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7451. Convert(priority,sizeType);
  7452. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7453. END;
  7454. Emit(Push(position,priority));
  7455. ReleaseIntermediateOperand(priority);
  7456. IF backend.cooperative THEN
  7457. Emit(Push(position,self));
  7458. CallThis(position,"Activities","Create",3)
  7459. ELSE
  7460. flags := 0;
  7461. IF body.isSafe THEN
  7462. flags := 1;
  7463. END;
  7464. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7465. Emit(Push(position,self));
  7466. CallThis(position,"Objects","CreateProcess",4)
  7467. END;
  7468. ELSE
  7469. Emit(Push(position,self));
  7470. StaticCallOperand(callop,procedure);
  7471. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7472. END;
  7473. Emit(Pop(position,self));
  7474. END;
  7475. END CallBodies;
  7476. PROCEDURE PushTD(type: SyntaxTree.Type);
  7477. VAR op: IntermediateCode.Operand;
  7478. BEGIN
  7479. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7480. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7481. ELSE
  7482. IF type.resolved IS SyntaxTree.PointerType THEN
  7483. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7484. END;
  7485. op := TypeDescriptorAdr(type.resolved);
  7486. Emit(Push(position,op));
  7487. END
  7488. END PushTD;
  7489. BEGIN
  7490. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7491. dest := destination; destination := emptyOperand;
  7492. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7493. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7494. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7495. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7496. CASE x.id OF
  7497. (* ---- COPY ----- *)
  7498. |Global.Copy:
  7499. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7500. (* ---- EXCL, INCL----- *)
  7501. |Global.Excl,Global.Incl:
  7502. Evaluate(p0,s0);
  7503. Evaluate(p1,s1);
  7504. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7505. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7506. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7507. END;
  7508. ReuseCopy(res,s0.op);
  7509. ReleaseOperand(s0);
  7510. Reuse1(tmp,s1.op);
  7511. ReleaseOperand(s1);
  7512. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7513. IF x.id = Global.Excl THEN
  7514. Emit(Not(position,tmp,tmp));
  7515. Emit(And(position,res,res,tmp));
  7516. ELSE
  7517. Emit(Or(position,res,res,tmp));
  7518. END;
  7519. ReleaseIntermediateOperand(tmp);
  7520. Designate(p0,s0);
  7521. ToMemory(s0.op,s1.op.type,0);
  7522. Emit(Mov(position,s0.op,res));
  7523. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7524. (* ---- DISPOSE ----- *)
  7525. |Global.Dispose:
  7526. Designate(p0,s0);
  7527. Emit(Push(position,s0.op));
  7528. ReleaseOperand(s0);
  7529. CallThis(position,"Runtime","Dispose", 1);
  7530. (* ---- GETPROCEDURE ----- *)
  7531. |Global.GetProcedure:
  7532. Designate(p0,s0);
  7533. PushString(s0,p0.type);
  7534. Designate(p1,s1);
  7535. PushString(s1,p1.type);
  7536. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7537. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7538. ELSE PushTD(procedureType.firstParameter.type)
  7539. END;
  7540. PushTD(procedureType.returnType);
  7541. Designate(p2,s2);
  7542. Emit(Push(position,s2.op));
  7543. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7544. CallThis(position,"Modules","GetProcedure", 7);
  7545. (* ---- ASH, LSH, ROT ----- *)
  7546. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7547. Evaluate(p0,s0);
  7548. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7549. (* make unsigned arguments in order to produced a logical shift *)
  7550. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7551. convert:= TRUE;
  7552. itype := s0.op.type;
  7553. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7554. Convert(s0.op,itype);
  7555. ELSE
  7556. convert := FALSE;
  7557. END;
  7558. END;
  7559. Evaluate(p1,s1);
  7560. IF IsIntegerConstant(p1,hint) THEN
  7561. ReuseCopy(reg,s0.op);
  7562. IF hint > 0 THEN
  7563. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7564. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7565. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7566. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7567. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7568. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7569. END;
  7570. ELSIF hint < 0 THEN
  7571. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7572. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7573. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7574. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7575. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7576. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7577. END;
  7578. END;
  7579. ReleaseOperand(s0); ReleaseOperand(s1);
  7580. ELSE
  7581. exit := NewLabel();
  7582. end := NewLabel();
  7583. ReuseCopy(reg,s0.op);
  7584. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7585. Reuse1(tmp,s1.op);
  7586. Emit(Neg(position,tmp,s1.op));
  7587. Convert(tmp,s1.op.type);
  7588. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7589. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7590. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7591. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7592. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7593. END;
  7594. ReleaseIntermediateOperand(tmp);
  7595. BrL(end);
  7596. SetLabel(exit);
  7597. ReuseCopy(tmp,s1.op);
  7598. Convert(tmp,s1.op.type);
  7599. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7600. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7601. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7602. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7603. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7604. END;
  7605. ReleaseIntermediateOperand(tmp);
  7606. SetLabel(end);
  7607. ReleaseOperand(s0); ReleaseOperand(s1);
  7608. END;
  7609. InitOperand(result,ModeValue);
  7610. IF convert THEN
  7611. itype := reg.type;
  7612. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7613. Convert(reg,itype);
  7614. END;
  7615. result.op := reg;
  7616. (* ---- CAP ----- *)
  7617. |Global.Cap:
  7618. Evaluate(p0,result);
  7619. ReuseCopy(reg,result.op);
  7620. ReleaseIntermediateOperand(result.op);
  7621. ignore := NewLabel();
  7622. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7623. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7624. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7625. SetLabel(ignore);
  7626. result.op := reg;
  7627. (* ---- CHR ----- *)
  7628. |Global.Chr, Global.Chr32:
  7629. Evaluate(p0,result);
  7630. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7631. |Global.Entier, Global.EntierH:
  7632. Evaluate(p0,result);
  7633. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7634. (* ---- MIN and MAX ----- *)
  7635. |Global.Max,Global.Min:
  7636. Evaluate(p0,s0);
  7637. Evaluate(p1,s1);
  7638. Reuse2(res,s0.op,s1.op);
  7639. else := NewLabel();
  7640. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7641. ELSE BrltL(else,s1.op,s0.op) END;
  7642. Emit(Mov(position,res,s0.op));
  7643. ReleaseOperand(s0);
  7644. end := NewLabel();
  7645. BrL(end);
  7646. SetLabel(else);
  7647. Emit(MovReplace(position,res,s1.op));
  7648. SetLabel(end);
  7649. ReleaseOperand(s1);
  7650. InitOperand(result,ModeValue);
  7651. result.op := res;
  7652. (* ---- ODD ----- *)
  7653. |Global.Odd:
  7654. Evaluate(p0,result);
  7655. Reuse1(res,result.op);
  7656. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7657. ReleaseIntermediateOperand(result.op);
  7658. result.op := res;
  7659. Convert(result.op,bool);
  7660. (* ---- ORD ----- *)
  7661. |Global.Ord, Global.Ord32:
  7662. Evaluate(p0,result);
  7663. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7664. (* ---- SHORT, LONG ----- *)
  7665. |Global.Short, Global.Long:
  7666. Evaluate(p0,result);
  7667. IF x.type IS SyntaxTree.ComplexType THEN
  7668. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7669. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7670. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7671. ELSE
  7672. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7673. END
  7674. (* ---- HALT, SYSTEM.HALT----- *)
  7675. |Global.Halt, Global.systemHalt:
  7676. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7677. EmitTrap (position, val);
  7678. (* ---- ASSERT ----- *)
  7679. |Global.Assert:
  7680. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7681. trueL := NewLabel();
  7682. Condition(p0,trueL,TRUE);
  7683. IF p1 = NIL THEN val := AssertTrap
  7684. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7685. END;
  7686. EmitTrap(position,val);
  7687. SetLabel(trueL);
  7688. END;
  7689. (*
  7690. Emit(TrapC(result.op,val);
  7691. *)
  7692. (* ---- INC, DEC----- *)
  7693. |Global.Inc,Global.Dec:
  7694. Expression(p0); adr := result.op;
  7695. s0 := result;
  7696. LoadValue(result,p0.type);
  7697. (* EXPERIMENTAL *)
  7698. IF (s0.availability >= 0) & (availableSymbols[s0.availability].inRegister) THEN
  7699. availableSymbols[s0.availability].inMemory := FALSE;
  7700. END;
  7701. l := result;
  7702. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7703. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7704. END;
  7705. IF x.id = Global.Inc THEN
  7706. Emit(Add(position,l.op,l.op,r.op));
  7707. ELSE
  7708. Emit(Sub(position,l.op,l.op,r.op));
  7709. END;
  7710. ReleaseOperand(l); ReleaseOperand(r);
  7711. (* ---- LEN ----- *)
  7712. |Global.Len: (* dynamic length, static length done by checker *)
  7713. Designate(p0,operand);
  7714. IF p1 = NIL THEN
  7715. InitOperand(l,ModeValue);
  7716. l.op := IntermediateCode.Immediate(sizeType,0);
  7717. ELSE
  7718. Evaluate(p1,l);
  7719. END;
  7720. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7721. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7722. Dereference(operand, p0.type.resolved, FALSE);
  7723. END;
  7724. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7725. ReleaseOperand(operand); ReleaseOperand(l);
  7726. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7727. ASSERT(p1 # NIL);
  7728. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7729. Dereference(operand,p0.type.resolved,FALSE);
  7730. END;
  7731. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7732. ReleaseOperand(operand); ReleaseOperand(l);
  7733. ELSE HALT(100);
  7734. END;
  7735. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7736. (* ---- FIRST ---- *)
  7737. |Global.First:
  7738. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7739. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7740. ELSE
  7741. Designate(p0, result)
  7742. END
  7743. (* ---- LAST ---- *)
  7744. |Global.Last:
  7745. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7746. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7747. ELSE
  7748. Designate(p0, result);
  7749. (* make sure result.op is a register *)
  7750. tmp := result.op;
  7751. ReuseCopy(result.op, result.op);
  7752. ReleaseIntermediateOperand(tmp);
  7753. (* add offset to result.op *)
  7754. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7755. END
  7756. (* ---- STEP ---- *)
  7757. |Global.Step:
  7758. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7759. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7760. ELSE
  7761. Designate(p0, result);
  7762. (* make sure result.op is a register *)
  7763. tmp := result.op;
  7764. ReuseCopy(result.op, result.op);
  7765. ReleaseIntermediateOperand(tmp);
  7766. (* add offset to result.op *)
  7767. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7768. END
  7769. (* ---- RE ---- *)
  7770. |Global.Re:
  7771. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7772. Designate(p0, result)
  7773. ELSE
  7774. Evaluate(p0, result)
  7775. END
  7776. (* ---- IM ---- *)
  7777. |Global.Im:
  7778. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7779. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7780. Designate(p0, result);
  7781. (* make sure result.op is a register *)
  7782. tmp := result.op;
  7783. ReuseCopy(result.op, result.op);
  7784. ReleaseIntermediateOperand(tmp);
  7785. (* add offset to result.op *)
  7786. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7787. (* ---- ABS ----- *)
  7788. |Global.Abs:
  7789. Evaluate(p0,operand);
  7790. type := p0.type.resolved;
  7791. InitOperand(result,ModeValue);
  7792. Reuse1a(result.op,operand.op,dest);
  7793. Emit(Abs(position,result.op,operand.op));
  7794. ReleaseOperand(operand);
  7795. (* ---- WAIT ----- *)
  7796. |Global.Wait:
  7797. Evaluate(p0,operand);
  7798. Emit(Push(position,operand.op));
  7799. ReleaseOperand(operand);
  7800. CallThis(position,"Activities","Wait", 1);
  7801. (* ---- NEW ----- *)
  7802. |Global.New:
  7803. (*! the following code is only correct for "standard" Oberon calling convention *)
  7804. IF x.type # NIL THEN
  7805. type := x.type.resolved;
  7806. firstPar := 0;
  7807. ELSE
  7808. type := p0.type.resolved;
  7809. firstPar := 1;
  7810. END;
  7811. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7812. THEN
  7813. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7814. IF backend.cooperative THEN
  7815. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7816. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7817. IF recordType.isObject THEN
  7818. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7819. IF recordType.IsActive() THEN
  7820. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7821. END;
  7822. IF recordType.IsProtected() THEN
  7823. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7824. END;
  7825. ELSE
  7826. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7827. END;
  7828. END;
  7829. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7830. CallThis(position,"Runtime","New", 1);
  7831. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7832. Emit(Result(position, pointer));
  7833. exit := NewLabel();
  7834. BreqL(exit,pointer,nil);
  7835. GetRecordTypeName (recordType,name);
  7836. IF ~recordType.isObject THEN
  7837. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7838. END;
  7839. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7840. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7841. IF recordType.isObject THEN
  7842. IF recordType.IsProtected() THEN
  7843. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7844. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7845. END;
  7846. IF recordType.IsActive() THEN
  7847. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7848. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7849. END;
  7850. END;
  7851. (* initialize fields *)
  7852. IF type(SyntaxTree.PointerType).isPlain THEN
  7853. size := 0;
  7854. ELSIF recordType.isObject THEN
  7855. size := BaseObjectTypeSize;
  7856. ELSE
  7857. size := BaseRecordTypeSize;
  7858. END;
  7859. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7860. (* call initializer *)
  7861. constructor := GetConstructor(recordType);
  7862. IF constructor # NIL THEN
  7863. (*! should be unified with ProcedureCallDesignator *)
  7864. Emit(Push(position,pointer));
  7865. ReleaseIntermediateOperand(pointer);
  7866. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7867. FOR i := firstPar TO x.parameters.Length()-1 DO
  7868. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7869. formalParameter := formalParameter.nextParameter;
  7870. END;
  7871. (* static call of the constructor *)
  7872. GetCodeSectionNameForSymbol(constructor,name);
  7873. ASSERT(~constructor.isInline);
  7874. IF constructor.scope.ownerModule # module.module THEN
  7875. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7876. ELSE
  7877. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7878. END;
  7879. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7880. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7881. Emit(Pop(position,pointer));
  7882. END;
  7883. (* call bodies *)
  7884. CallBodies(pointer,type);
  7885. SetLabel(exit);
  7886. needsTrace := p0.NeedsTrace();
  7887. IF needsTrace THEN ModifyAssignments(true) END;
  7888. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7889. Emit(Push(position, pointer));
  7890. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7891. Emit(Pop(position, pointer));
  7892. END;
  7893. Designate(p0,l);
  7894. IF needsTrace THEN
  7895. CallAssignPointer(l.op, pointer);
  7896. ELSE
  7897. ToMemory(l.op,addressType,0);
  7898. Emit(Mov(position,l.op,pointer));
  7899. END;
  7900. ReleaseIntermediateOperand(pointer);
  7901. ReleaseOperand(l);
  7902. IF needsTrace THEN ModifyAssignments(false) END;
  7903. ELSE (* not cooperative backend *)
  7904. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7905. IF temporaryVariable # NIL THEN
  7906. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7907. ELSE
  7908. Designate(p0,l);
  7909. END;
  7910. (* l.op contains address of pointer to record *)
  7911. Emit(Push(position,l.op)); (* address for use after syscall *)
  7912. Emit(Push(position,l.op));
  7913. ReleaseOperand(l);
  7914. (* push type descriptor *)
  7915. reg := TypeDescriptorAdr(recordType);
  7916. Emit(Push(position,reg));
  7917. ReleaseIntermediateOperand(reg);
  7918. (* push realtime flag *)
  7919. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7920. ELSE Emit(Push(position,false));
  7921. END;
  7922. CallThis(position,"Heaps","NewRec", 3);
  7923. (* check allocation success, if not successful then do not call initializers and bodies *)
  7924. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7925. Emit(Pop(position,pointer));
  7926. MakeMemory(reg,pointer,addressType,0);
  7927. ReleaseIntermediateOperand(pointer);
  7928. pointer := reg;
  7929. exit := NewLabel();
  7930. BreqL(exit,pointer,nil);
  7931. Emit(Push(position,pointer));
  7932. (* initialize fields *)
  7933. InitFields(recordType, pointer,0);
  7934. (* call initializer *)
  7935. constructor := GetConstructor(recordType);
  7936. IF constructor # NIL THEN
  7937. (*! should be unified with ProcedureCallDesignator *)
  7938. Emit(Push(position,pointer));
  7939. ReleaseIntermediateOperand(pointer);
  7940. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7941. FOR i := firstPar TO x.parameters.Length()-1 DO
  7942. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7943. formalParameter := formalParameter.nextParameter;
  7944. END;
  7945. (* static call of the constructor *)
  7946. GetCodeSectionNameForSymbol(constructor,name);
  7947. ASSERT(~constructor.isInline);
  7948. IF constructor.scope.ownerModule # module.module THEN
  7949. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7950. ELSE
  7951. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7952. END;
  7953. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7954. ELSE
  7955. ReleaseIntermediateOperand(pointer);
  7956. END;
  7957. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7958. Emit(Pop(position,pointer));
  7959. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7960. Designate(p0,l);
  7961. IF backend.writeBarriers & OnHeap(p0) THEN
  7962. SaveRegisters();ReleaseUsedRegisters(saved);
  7963. Emit(Push(position,l.op));
  7964. Emit(Push(position,pointer));
  7965. CallThis(position,"Heaps","Assign",2);
  7966. RestoreRegisters(saved);
  7967. ELSE
  7968. ToMemory(l.op,addressType,0);
  7969. Emit(Mov(position,l.op,pointer));
  7970. END;
  7971. ReleaseOperand(l);
  7972. result.tag := emptyOperand;
  7973. ELSIF (x.type # NIL) THEN
  7974. result := l; (* temporary variable is the result of NEW Type() *)
  7975. END;
  7976. (* call bodies *)
  7977. CallBodies(pointer,type);
  7978. ReleaseIntermediateOperand(pointer);
  7979. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7980. end := NewLabel();
  7981. BrL(end);
  7982. SetLabel(exit);
  7983. Designate(p0,l);
  7984. ToMemory(l.op,addressType,0);
  7985. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7986. ReleaseOperand(l);
  7987. SetLabel(end);
  7988. ELSE
  7989. SetLabel(exit);
  7990. END;
  7991. END;
  7992. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7993. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7994. IF ~backend.cooperative THEN (* simpler version *)
  7995. (*
  7996. push len0
  7997. push len1
  7998. push len2
  7999. push len_size
  8000. push len_adr
  8001. push tag
  8002. push static elements
  8003. push element size
  8004. push adr
  8005. *)
  8006. dim := 0;
  8007. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  8008. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8009. parameter := x.parameters.GetExpression(i);
  8010. Evaluate(parameter,r);
  8011. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8012. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8013. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8014. END;
  8015. Emit(Push(position,r.op));
  8016. ReleaseOperand(r);
  8017. INC(dim);
  8018. END;
  8019. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8020. Emit(Mov(position, adr, sp));
  8021. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  8022. Emit(Push(position, adr));
  8023. ReleaseIntermediateOperand(adr);
  8024. openDim := dim;
  8025. staticLength := 1;
  8026. IF type IS SyntaxTree.ArrayType THEN
  8027. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  8028. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  8029. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8030. END;
  8031. END;
  8032. IF SemanticChecker.ContainsPointer(type) THEN
  8033. tmp := TypeDescriptorAdr(type);
  8034. ELSE
  8035. tmp := nil;
  8036. END;
  8037. Emit(Push(position,tmp)); (* type descriptor *)
  8038. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  8039. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  8040. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  8041. Designate(p0,l);
  8042. Emit(Push(position,l.op)); (* address *)
  8043. ReleaseOperand(l);
  8044. CallThis(position,"Heaps","NewArray", 6);
  8045. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  8046. Emit(Add(position,sp,sp,tmp));
  8047. ELSE
  8048. dim := 0;
  8049. IntermediateCode.InitOperand(reg);
  8050. IF p1 # NIL THEN
  8051. FOR i := firstPar TO x.parameters.Length()-1 DO
  8052. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8053. parameter := x.parameters.GetExpression(i);
  8054. Evaluate(parameter,r);
  8055. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8056. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8057. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8058. END;
  8059. Emit(Push(position,r.op));
  8060. IF i=1 THEN
  8061. CopyInt(reg,r.op);
  8062. ELSE
  8063. MulInt(reg, reg, r.op);
  8064. END;
  8065. ReleaseOperand(r);
  8066. INC(dim);
  8067. END;
  8068. Convert(reg,addressType);
  8069. ELSE
  8070. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8071. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  8072. END;
  8073. openDim := dim;
  8074. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  8075. IF backend.cooperative THEN
  8076. size := ToMemoryUnits(system,system.SizeOf(type));
  8077. WHILE type IS SyntaxTree.ArrayType DO
  8078. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8079. END;
  8080. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  8081. IF (size # 1) THEN
  8082. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  8083. END;
  8084. Emit(Push(position,reg));
  8085. size := ToMemoryUnits(system,system.SizeOf(type));
  8086. IF (size # 1) THEN
  8087. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  8088. END;
  8089. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  8090. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  8091. Emit(Push(position,reg));
  8092. ReleaseIntermediateOperand(reg);
  8093. CallThis(position,"Runtime","New", 1);
  8094. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8095. Emit(Result(position, pointer));
  8096. exit := NewLabel();
  8097. else := NewLabel();
  8098. BreqL(else,pointer,nil);
  8099. IF ~type.hasPointers THEN
  8100. Basic.ToSegmentedName ("BaseTypes.Array",name);
  8101. ELSIF type IS SyntaxTree.RecordType THEN
  8102. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  8103. ELSIF type IS SyntaxTree.ProcedureType THEN
  8104. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  8105. ELSE
  8106. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  8107. END;
  8108. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  8109. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  8110. 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))));
  8111. IF type IS SyntaxTree.RecordType THEN
  8112. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  8113. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  8114. ELSE
  8115. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  8116. END;
  8117. i := openDim;
  8118. WHILE i > 0 DO
  8119. DEC (i);
  8120. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  8121. END;
  8122. needsTrace := p0.NeedsTrace();
  8123. IF needsTrace THEN ModifyAssignments(true) END;
  8124. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  8125. Emit(Push(position, pointer));
  8126. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  8127. Emit(Pop(position, pointer));
  8128. END;
  8129. Designate(p0,l);
  8130. IF needsTrace THEN
  8131. CallAssignPointer(l.op, pointer);
  8132. ModifyAssignments(false);
  8133. ELSE
  8134. ToMemory(l.op,addressType,0);
  8135. Emit(Mov(position,l.op,pointer));
  8136. END;
  8137. ReleaseIntermediateOperand(pointer);
  8138. ReleaseOperand(l);
  8139. BrL(exit);
  8140. SetLabel(else);
  8141. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  8142. Designate(p0,l);
  8143. IF needsTrace THEN
  8144. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  8145. ELSE
  8146. ToMemory(l.op,addressType,0);
  8147. Emit(Mov(position,l.op,pointer));
  8148. END;
  8149. ReleaseOperand(l);
  8150. SetLabel(exit);
  8151. ELSE
  8152. (*! the following code is only correct for "standard" Oberon calling convention *)
  8153. IF SemanticChecker.ContainsPointer(type) THEN
  8154. IF type IS SyntaxTree.ArrayType THEN
  8155. staticLength := 1;
  8156. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  8157. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  8158. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  8159. END;
  8160. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  8161. MulInt(reg,reg,tmp);
  8162. END;
  8163. Designate(p0,l);
  8164. IF openDim > 0 THEN
  8165. Emit(Push(position,l.op)); (* address for use after syscall *)
  8166. END;
  8167. Emit(Push(position,l.op)); (* address *)
  8168. ReleaseOperand(l);
  8169. tmp := TypeDescriptorAdr(type);
  8170. Emit(Push(position,tmp)); (* type descriptor *)
  8171. ReleaseIntermediateOperand(tmp);
  8172. Emit(Push(position,reg)); (* number Elements *)
  8173. ReleaseIntermediateOperand(reg);
  8174. tmp := IntermediateCode.Immediate(addressType,dim);
  8175. Emit(Push(position,tmp)); (* dimensions *)
  8176. (* push realtime flag *)
  8177. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  8178. ELSE Emit(Push(position,false));
  8179. END;
  8180. CallThis(position,"Heaps","NewArr",5)
  8181. ELSE
  8182. size := ToMemoryUnits(system,system.SizeOf(type));
  8183. IF (size # 1) THEN
  8184. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  8185. (*
  8186. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  8187. *)
  8188. END;
  8189. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  8190. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  8191. AddInt(reg, reg, tmp);
  8192. (*
  8193. Emit(Add(position,reg,reg,tmp));
  8194. *)
  8195. Designate(p0,l);
  8196. IF openDim >0 THEN
  8197. Emit(Push(position,l.op)); (* address for use after syscall *)
  8198. END;
  8199. Emit(Push(position,l.op)); (* address for syscall *)
  8200. ReleaseOperand(l); (* pointer address *)
  8201. Emit(Push(position,reg)); (* size *)
  8202. ReleaseIntermediateOperand(reg);
  8203. (* push realtime flag *)
  8204. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  8205. ELSE Emit(Push(position,false));
  8206. END;
  8207. CallThis(position,"Heaps","NewSys", 3)
  8208. END;
  8209. IF openDim > 0 THEN
  8210. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8211. Emit(Pop(position,adr));
  8212. ToMemory(adr,addressType,0);
  8213. ReuseCopy(tmp,adr);
  8214. ReleaseIntermediateOperand(adr);
  8215. adr := tmp;
  8216. else := NewLabel();
  8217. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  8218. i := openDim-1;
  8219. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8220. WHILE (i >= 0) DO
  8221. Emit(Pop(position,reg));
  8222. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  8223. Emit(Mov(position,res,reg));
  8224. DEC(i);
  8225. END;
  8226. ReleaseIntermediateOperand(adr);
  8227. ReleaseIntermediateOperand(reg);
  8228. exit := NewLabel();
  8229. BrL(exit);
  8230. SetLabel(else);
  8231. (* else part: array could not be allocated *)
  8232. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  8233. Emit(Add(position,sp,sp,tmp));
  8234. SetLabel(exit);
  8235. END;
  8236. END;
  8237. END;
  8238. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8239. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  8240. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  8241. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8242. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8243. callingConvention := procedureType.callingConvention;
  8244. left.SetType(procedure.type);
  8245. formalParameter := procedureType.firstParameter;
  8246. (* push array to allocate *)
  8247. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  8248. formalParameter :=formalParameter.nextParameter;
  8249. (* push length array *)
  8250. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  8251. (* push size *)
  8252. type := t0;
  8253. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  8254. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  8255. END;
  8256. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  8257. Emit(Push(position,tmp));
  8258. (* *)
  8259. IF SemanticChecker.ContainsPointer(type) THEN
  8260. tmp := TypeDescriptorAdr(type);
  8261. ELSE
  8262. tmp := IntermediateCode.Immediate(addressType, 0);
  8263. END;
  8264. Emit(Push(position,tmp)); (* type descriptor *)
  8265. StaticCallOperand(result,procedure);
  8266. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  8267. ReleaseOperand(result);
  8268. END;
  8269. (*
  8270. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  8271. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  8272. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  8273. *)
  8274. ELSE
  8275. (*
  8276. push len0
  8277. push len1
  8278. push len2
  8279. push size
  8280. push len_adr
  8281. push element_size
  8282. push tag
  8283. push adr
  8284. *)
  8285. dim := 0;
  8286. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8287. isTensor := TRUE;
  8288. ELSE
  8289. isTensor := FALSE;
  8290. END;
  8291. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  8292. IF ~isTensor THEN
  8293. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  8294. END;
  8295. parameter := x.parameters.GetExpression(i);
  8296. Evaluate(parameter,r);
  8297. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  8298. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  8299. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  8300. END;
  8301. Emit(Push(position,r.op));
  8302. ReleaseOperand(r);
  8303. INC(dim);
  8304. END;
  8305. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8306. Emit(Mov(position, adr, sp));
  8307. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  8308. Emit(Push(position, adr));
  8309. ReleaseIntermediateOperand(adr);
  8310. openDim := dim;
  8311. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  8312. IF isTensor THEN
  8313. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  8314. ELSE
  8315. baseType := SemanticChecker.ArrayBase(type,openDim);
  8316. END;
  8317. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  8318. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  8319. IF SemanticChecker.ContainsPointer(baseType) THEN
  8320. tmp := TypeDescriptorAdr(baseType);
  8321. ELSE
  8322. tmp := nil;
  8323. END;
  8324. Emit(Push(position,tmp)); (* type descriptor *)
  8325. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  8326. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  8327. ELSE (* error message has already been emited *)
  8328. RETURN;
  8329. END;
  8330. Designate(p0,l);
  8331. IF isTensor THEN
  8332. Emit(Push(position,l.op)); (* address *)
  8333. ELSE
  8334. Emit(Push(position,l.tag)); (* address *)
  8335. END;
  8336. ReleaseOperand(l);
  8337. StaticCallOperand(result,procedure);
  8338. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  8339. ReleaseOperand(result);
  8340. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  8341. Emit(Add(position,sp,sp,tmp));
  8342. END;
  8343. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  8344. THEN
  8345. IF ~backend.cellsAreObjects THEN RETURN END;
  8346. IF InCellScope(currentScope) THEN
  8347. PushSelfPointer()
  8348. ELSE
  8349. Emit(Push(position, nil));
  8350. END;
  8351. (* push temp address *)
  8352. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  8353. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  8354. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8355. (* l.op contains address of pointer to record *)
  8356. Emit(Push(position,l.op)); (* address for use after syscall *)
  8357. ReleaseOperand(l);
  8358. (* push type descriptor *)
  8359. reg := TypeDescriptorAdr(baseType);
  8360. Emit(Push(position,reg));
  8361. ReleaseIntermediateOperand(reg);
  8362. (* push name *)
  8363. (*Global.GetSymbolName(p0, n);*)
  8364. IF currentScope IS SyntaxTree.ProcedureScope THEN
  8365. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  8366. ELSE
  8367. Global.GetModuleName(module.module, n);
  8368. END;
  8369. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  8370. (*type.typeDeclaration.GetName(n);*)
  8371. PushConstString(n);
  8372. (* push cellnet boolean *)
  8373. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  8374. (* push engine boolean *)
  8375. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  8376. (* allocate *)
  8377. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  8378. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8379. (* l.op contains address of pointer to record *)
  8380. ToMemory(l.op,addressType,0);
  8381. (* l.op contains value of pointer to record *)
  8382. InitFields(baseType, l.op,0);
  8383. (* add capabilities *)
  8384. modifier := p0(SyntaxTree.Designator).modifiers;
  8385. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  8386. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  8387. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  8388. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  8389. END;
  8390. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  8391. (*
  8392. modifier := baseType(SyntaxTree.CellType).modifiers;
  8393. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  8394. modifier := p0(SyntaxTree.Designator).modifiers;
  8395. *)
  8396. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  8397. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8398. (* l.op contains address of pointer to record *)
  8399. ToMemory(l.op,addressType,0);
  8400. (* l.op contains value of pointer to record *)
  8401. Emit(Push(position,l.op)); (* address for use after syscall *)
  8402. ReleaseOperand(l);
  8403. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  8404. prevScope := currentScope;
  8405. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  8406. previous := section;
  8407. section := init;
  8408. (* add ports *)
  8409. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  8410. CloseInitializer(previous);
  8411. currentScope := prevScope;
  8412. Symbol(temporaryVariable,l);
  8413. ToMemory(l.op,addressType,0);
  8414. Emit(Push(position,l.op));
  8415. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8416. (*
  8417. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8418. IF constructor # NIL THEN
  8419. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8420. FOR i := 1 TO x.parameters.Length()-1 DO
  8421. p := x.parameters.GetExpression(i);
  8422. Global.GetSymbolName(parameter,name);
  8423. Evaluate(p, value);
  8424. ASSERT(value.type # NIL);
  8425. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8426. par := instance.AddParameter(name);
  8427. par.SetInteger(value.integer);
  8428. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8429. par := instance.AddParameter(name);
  8430. par.SetBoolean(value.boolean);
  8431. ELSE Error(x.position,NotYetImplemented)
  8432. END;
  8433. parameter := parameter.nextParameter
  8434. END;
  8435. END;
  8436. *)
  8437. (* call initializer *)
  8438. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8439. IF constructor # NIL THEN
  8440. (*! should be unified with ProcedureCallDesignator *)
  8441. IF backend.cellsAreObjects THEN
  8442. Symbol(temporaryVariable,l);
  8443. ToMemory(l.op,addressType,0);
  8444. Emit(Push(position,l.op));
  8445. ReleaseOperand(l);
  8446. END;
  8447. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8448. FOR i := firstPar TO x.parameters.Length()-1 DO
  8449. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8450. formalParameter := formalParameter.nextParameter;
  8451. END;
  8452. (* static call of the constructor *)
  8453. Global.GetSymbolSegmentedName(constructor,name);
  8454. ASSERT(~constructor.isInline);
  8455. IF constructor.scope.ownerModule # module.module THEN
  8456. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8457. ELSE
  8458. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8459. END;
  8460. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8461. (*ELSE
  8462. ReleaseIntermediateOperand(pointer);*)
  8463. END;
  8464. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8465. ToMemory(l.op, addressType, 0);
  8466. Designate(p0,s0);
  8467. ToMemory(s0.op,addressType,0);
  8468. Emit(Mov(position,s0.op,l.op));
  8469. ReleaseOperand(l);
  8470. ReleaseOperand(s0);
  8471. result.tag := emptyOperand;
  8472. (* start *)
  8473. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8474. (* push cell *)
  8475. Symbol(temporaryVariable, l);
  8476. ToMemory(l.op,addressType,0);
  8477. Emit(Push(Basic.invalidPosition,l.op));
  8478. (* push delegate *)
  8479. Emit(Push(Basic.invalidPosition,l.op));
  8480. ReleaseOperand(l);
  8481. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8482. Emit(Push(position, s1.op));
  8483. ReleaseOperand(s1);
  8484. CallThis(position,"ActiveCellsRuntime","Start",3);
  8485. END;
  8486. (*IF temporaryVariable # NIL THEN
  8487. end := NewLabel();
  8488. BrL(end);
  8489. SetLabel(exit);
  8490. Designate(p0,l);
  8491. ToMemory(l.op,addressType,0);
  8492. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8493. ReleaseOperand(l);
  8494. SetLabel(end);
  8495. ELSE
  8496. SetLabel(exit);
  8497. END;
  8498. *)
  8499. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8500. ELSE (* no pointer to record, no pointer to array *)
  8501. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8502. (* ignore new statement *)
  8503. Warning(p0.position, "cannot run on final hardware");
  8504. ELSE
  8505. HALT(200);
  8506. END;
  8507. END;
  8508. (* ---- ADDRESSOF----- *)
  8509. |Global.systemAdr:
  8510. Designate(p0,s0);
  8511. s0.mode := ModeValue;
  8512. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8513. ReleaseIntermediateOperand(s0.op);
  8514. s0.op := s0.tag;
  8515. IntermediateCode.InitOperand(s0.tag);
  8516. END;
  8517. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8518. result := s0;
  8519. (* ---- BIT ----- *)
  8520. |Global.systemBit:
  8521. Evaluate(p0,s0);
  8522. ToMemory(s0.op,addressType,0);
  8523. ReuseCopy(res,s0.op);
  8524. ReleaseOperand(s0);
  8525. Evaluate(p1,s1);
  8526. Emit(Ror(position,res,res,s1.op));
  8527. ReleaseOperand(s1);
  8528. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8529. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8530. InitOperand(result,ModeValue);
  8531. result.op := res;
  8532. (* --- MSK ----*)
  8533. |Global.systemMsk:
  8534. Evaluate(p0,s0);
  8535. Evaluate(p1,s1);
  8536. ReuseCopy(res,s0.op);
  8537. ReleaseOperand(s0);
  8538. Emit(And(position,res,res,s1.op));
  8539. ReleaseOperand(s1);
  8540. InitOperand(result,ModeValue);
  8541. result.op := res;
  8542. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8543. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8544. Evaluate(p0,s0);
  8545. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8546. ReleaseOperand(s0);
  8547. InitOperand(result,ModeValue);
  8548. result.op := res;
  8549. (* ---- SYSTEM.GetStackPointer ----- *)
  8550. |Global.systemGetStackPointer:
  8551. InitOperand(result,ModeValue);
  8552. result.op := sp;
  8553. (* ---- SYSTEM.GetFramePointer ----- *)
  8554. |Global.systemGetFramePointer:
  8555. InitOperand(result,ModeValue);
  8556. result.op := fp;
  8557. (* ---- SYSTEM.GetActivity ----- *)
  8558. |Global.systemGetActivity:
  8559. ASSERT(backend.cooperative);
  8560. InitOperand(result,ModeValue);
  8561. result.op := ap;
  8562. (* ---- SYSTEM.SetStackPointer ----- *)
  8563. |Global.systemSetStackPointer:
  8564. Evaluate(p0,s0); (* *)
  8565. Emit(Mov(position,sp,s0.op));
  8566. ReleaseOperand(s0);
  8567. (* ---- SYSTEM.SetFramePointer ----- *)
  8568. |Global.systemSetFramePointer:
  8569. Evaluate(p0,s0); (* *)
  8570. Emit(Mov(position,fp,s0.op));
  8571. ReleaseOperand(s0);
  8572. (* ---- SYSTEM.Activity ----- *)
  8573. |Global.systemSetActivity:
  8574. ASSERT(backend.cooperative);
  8575. Evaluate(p0,s0); (* *)
  8576. Emit(Mov(position,ap,s0.op));
  8577. ReleaseOperand(s0);
  8578. (* ---- SYSTEM.VAL ----- *)
  8579. |Global.systemVal:
  8580. Expression(p1);
  8581. s1 := result;
  8582. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8583. IF s1.mode = ModeReference THEN
  8584. (* nothing to be done if not record type, just take over new type *)
  8585. IF (type IS SyntaxTree.RecordType) THEN
  8586. ReleaseIntermediateOperand(s1.tag);
  8587. s1.tag := TypeDescriptorAdr(type);
  8588. UseIntermediateOperand(s1.tag);
  8589. END;
  8590. result := s1;
  8591. ELSE (* copy over result to different type, may not use convert *)
  8592. itype := IntermediateCode.GetType(system,type);
  8593. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8594. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8595. Emit(Mov(position,s0.op,s1.op));
  8596. ReleaseOperand(s1);
  8597. InitOperand(result,ModeValue);
  8598. result.op := s0.op;
  8599. ELSE (* different size, must convert *)
  8600. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8601. Convert(s1.op, IntermediateCode.GetType(system,type));
  8602. result := s1;
  8603. END;
  8604. END;
  8605. (* ---- SYSTEM.GET ----- *)
  8606. |Global.systemGet:
  8607. Evaluate(p0,s0); (* adr *)
  8608. Designate(p1,s1); (* variable *)
  8609. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8610. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8611. Emit(Mov(position,s1.op,s0.op));
  8612. ReleaseOperand(s1);
  8613. ReleaseOperand(s0);
  8614. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8615. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8616. Evaluate(p0,s0); (* *)
  8617. Evaluate(p1,s1); (* variable *)
  8618. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8619. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8620. (* real part *)
  8621. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8622. Emit(Mov(position,res, s1.op));
  8623. ReleaseIntermediateOperand(res);
  8624. (* imaginary part *)
  8625. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8626. Emit(Mov(position,res, s1.tag));
  8627. ReleaseIntermediateOperand(res);
  8628. ReleaseOperand(s1);
  8629. ReleaseOperand(s0);
  8630. ELSE
  8631. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8632. ReleaseOperand(s0);
  8633. Emit(Mov(position,res,s1.op));
  8634. ReleaseIntermediateOperand(res);
  8635. ReleaseOperand(s1);
  8636. END;
  8637. (* ---- SYSTEM.MOVE ----- *)
  8638. |Global.systemMove:
  8639. Evaluate(p0,s0);
  8640. Evaluate(p1,s1);
  8641. Evaluate(p2,s2);
  8642. Emit(Copy(position,s1.op,s0.op,s2.op));
  8643. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8644. (* ---- SYSTEM.NEW ----- *)
  8645. |Global.systemNew:
  8646. Designate(p0,s0);
  8647. Emit(Push(position,s0.op));
  8648. ReleaseOperand(s0);
  8649. Evaluate(p1,s1);
  8650. Emit(Push(position,s1.op));
  8651. ReleaseOperand(s1);
  8652. (* push realtime flag: false by default *)
  8653. Emit(Push(position,false));
  8654. CallThis(position,"Heaps","NewSys",3);
  8655. (* ---- SYSTEM.CALL ----- *)
  8656. |Global.systemRef:
  8657. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8658. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8659. s0.mode := ModeValue;
  8660. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8661. result := s0
  8662. (* ---- INCR ----- *)
  8663. |Global.Incr:
  8664. Designate(p0,operand);
  8665. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8666. Dereference(operand,p0.type.resolved,FALSE);
  8667. END;
  8668. ASSERT(p1 # NIL);
  8669. Evaluate(p1,l);
  8670. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8671. ReleaseOperand(operand); ReleaseOperand(l);
  8672. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8673. (* ---- SUM ----- *)
  8674. |Global.Sum: HALT(200);
  8675. (* ---- ALL ----- *)
  8676. |Global.All: HALT(200);
  8677. (* ---- CAS ----- *)
  8678. |Global.Cas:
  8679. needsTrace := p0.NeedsTrace();
  8680. IF needsTrace THEN ModifyAssignments(true) END;
  8681. Designate(p0,s0);
  8682. Evaluate(p1,s1);
  8683. Evaluate(p2,s2);
  8684. IF needsTrace THEN
  8685. Emit(Push(position, s0.op));
  8686. Emit(Push(position, s1.op));
  8687. Emit(Push(position, s2.op));
  8688. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8689. ELSE
  8690. Emit(Cas(position,s0.op,s1.op,s2.op));
  8691. END;
  8692. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8693. IF needsTrace THEN ModifyAssignments(false) END;
  8694. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8695. Emit(Result(position, res));
  8696. result.op := res;
  8697. result.mode := ModeValue;
  8698. (*
  8699. IF conditional THEN
  8700. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8701. BrL(falseLabel);
  8702. ReleaseIntermediateOperand(res);
  8703. END;
  8704. *)
  8705. (* ---- DIM ----- *)
  8706. |Global.Dim:
  8707. Designate(p0,s0);
  8708. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8709. Dereference(s0,p0.type.resolved,FALSE);
  8710. END;
  8711. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8712. ReleaseOperand(s0);
  8713. (* ---- RESHAPE ----- *)
  8714. |Global.Reshape:
  8715. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8716. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8717. left.SetType(procedure.type);
  8718. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8719. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8720. END;
  8721. (* ---- SYSTEM.TYPECODE ----- *)
  8722. |Global.systemTypeCode:
  8723. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8724. IF type.resolved IS SyntaxTree.PointerType THEN
  8725. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8726. END;
  8727. result.op := TypeDescriptorAdr(type);
  8728. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8729. result.mode := ModeValue;
  8730. (* ---- SYSTEM.TRACE ----- *)
  8731. |Global.systemTrace:
  8732. SystemTrace(x.parameters, x.position);
  8733. (* ----- CONNECT ------*)
  8734. |Global.Connect:
  8735. IF backend.cellsAreObjects THEN
  8736. PushPort(p0);
  8737. PushPort(p1);
  8738. IF p2 # NIL THEN
  8739. Evaluate(p2, s2);
  8740. Emit(Push(p2.position, s2.op));
  8741. ReleaseOperand(s2);
  8742. ELSE
  8743. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8744. END;
  8745. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8746. ELSE
  8747. Warning(x.position, "cannot run on final hardware");
  8748. END;
  8749. (* ----- DELEGATE ------*)
  8750. |Global.Delegate:
  8751. IF backend.cellsAreObjects THEN
  8752. PushPort(p0);
  8753. PushPort(p1);
  8754. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8755. ELSE
  8756. Warning(x.position, "cannot run on final hardware");
  8757. END;
  8758. (* ----- SEND ------*)
  8759. |Global.Send:
  8760. Evaluate(p0,s0);
  8761. Evaluate(p1,s1);
  8762. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8763. Emit(Push(position,s0.op));
  8764. Emit(Push(position,s1.op));
  8765. (*
  8766. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8767. *)
  8768. IF ~backend.cellsAreObjects THEN
  8769. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8770. END;
  8771. ReleaseOperand(s0);
  8772. ReleaseOperand(s1);
  8773. IF backend.cellsAreObjects THEN
  8774. CallThis(position,"ActiveCellsRuntime","Send",2);
  8775. ELSE
  8776. CallThis(position,ChannelModuleName,"Send",2);
  8777. END;
  8778. (* ----- RECEIVE ------*)
  8779. |Global.Receive:
  8780. Evaluate(p0,s0);
  8781. Emit(Push(position,s0.op));
  8782. Designate(p1,s1);
  8783. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8784. Emit(Push(position,s1.op));
  8785. IF p2 # NIL THEN
  8786. Designate(p2,s2);
  8787. Emit(Push(position,s2.op));
  8788. END;
  8789. (*
  8790. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8791. *)
  8792. IF ~backend.cellsAreObjects THEN
  8793. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8794. END;
  8795. ReleaseOperand(s0);
  8796. ReleaseOperand(s1);
  8797. ReleaseOperand(s2);
  8798. IF backend.cellsAreObjects THEN
  8799. IF p2 = NIL THEN
  8800. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8801. ELSE
  8802. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8803. END;
  8804. ELSE
  8805. IF p2 = NIL THEN
  8806. CallThis(position,ChannelModuleName,"Receive",2)
  8807. ELSE
  8808. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8809. END;
  8810. END;
  8811. | Global.systemSpecial:
  8812. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8813. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8814. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8815. (* determine if parameters are of the VAR kind *)
  8816. ASSERT(x.parameters.Length() <= 3);
  8817. formalParameter := procedureType.firstParameter;
  8818. FOR i := 0 TO x.parameters.Length() - 1 DO
  8819. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8820. formalParameter := formalParameter.nextParameter
  8821. END;
  8822. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8823. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8824. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8825. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8826. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8827. IF procedureType.returnType # NIL THEN
  8828. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8829. Emit(Result(position, res));
  8830. (*InitOperand(result,ModeValue);
  8831. result.op := res;
  8832. *)
  8833. InitOperand(result,ModeValue); result.op := res;
  8834. END
  8835. ELSE (* function not yet implemented *)
  8836. Error(position,"not yet implemented");
  8837. END;
  8838. destination := dest;
  8839. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8840. END VisitBuiltinCallDesignator;
  8841. PROCEDURE EvaluateBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator; VAR result: Operand);
  8842. VAR
  8843. p0,p1,p2: SyntaxTree.Expression; len: LONGINT; l: Operand; res,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  8844. s0,s1,s2: Operand; hint: HUGEINT;
  8845. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  8846. tmp:IntermediateCode.Operand;
  8847. t0,t1,t2: SyntaxTree.Type; ignore: Label;
  8848. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  8849. operand: Operand;
  8850. dest: IntermediateCode.Operand;
  8851. itype: IntermediateCode.Type;
  8852. convert: BOOLEAN;
  8853. customBuiltin: SyntaxTree.CustomBuiltin;
  8854. isVarPar: ARRAY 3 OF BOOLEAN;
  8855. callsection: Sections.Section;
  8856. segmentedName: Basic.SegmentedName;
  8857. needsTrace: BOOLEAN;
  8858. BEGIN
  8859. IF Trace THEN TraceEnter("EvaluateBuiltinCallDesignator") END;
  8860. dest := destination; destination := emptyOperand;
  8861. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  8862. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  8863. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  8864. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  8865. CASE x.id OF
  8866. (* ---- ASH, LSH, ROT ----- *)
  8867. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  8868. EvaluateX(p0, s0);
  8869. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  8870. (* make unsigned arguments in order to produced a logical shift *)
  8871. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  8872. convert:= TRUE;
  8873. itype := s0.op.type;
  8874. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  8875. Convert(s0.op,itype);
  8876. ELSE
  8877. convert := FALSE;
  8878. END;
  8879. END;
  8880. EvaluateX(p1,s1);
  8881. IF IsIntegerConstant(p1,hint) THEN
  8882. ReuseCopy(reg,s0.op);
  8883. IF hint > 0 THEN
  8884. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  8885. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  8886. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  8887. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  8888. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  8889. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  8890. END;
  8891. ELSIF hint < 0 THEN
  8892. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  8893. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  8894. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  8895. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  8896. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  8897. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  8898. END;
  8899. END;
  8900. ReleaseOperand(s0); ReleaseOperand(s1);
  8901. ELSE
  8902. exit := NewLabel();
  8903. end := NewLabel();
  8904. ReuseCopy(reg,s0.op);
  8905. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  8906. Reuse1(tmp,s1.op);
  8907. Emit(Neg(position,tmp,s1.op));
  8908. Convert(tmp,s1.op.type);
  8909. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  8910. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  8911. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  8912. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  8913. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  8914. END;
  8915. ReleaseIntermediateOperand(tmp);
  8916. BrL(end);
  8917. SetLabel(exit);
  8918. ReuseCopy(tmp,s1.op);
  8919. Convert(tmp,s1.op.type);
  8920. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  8921. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  8922. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  8923. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  8924. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  8925. END;
  8926. ReleaseIntermediateOperand(tmp);
  8927. SetLabel(end);
  8928. ReleaseOperand(s0); ReleaseOperand(s1);
  8929. END;
  8930. InitOperand(result,ModeValue);
  8931. IF convert THEN
  8932. itype := reg.type;
  8933. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  8934. Convert(reg,itype);
  8935. END;
  8936. result.op := reg;
  8937. (* ---- CAP ----- *)
  8938. |Global.Cap:
  8939. EvaluateX(p0,result);
  8940. ReuseCopy(reg,result.op);
  8941. ReleaseIntermediateOperand(result.op);
  8942. ignore := NewLabel();
  8943. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  8944. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  8945. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  8946. SetLabel(ignore);
  8947. result.op := reg;
  8948. (* ---- CHR ----- *)
  8949. |Global.Chr, Global.Chr32:
  8950. EvaluateX(p0, result);
  8951. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8952. |Global.Entier, Global.EntierH:
  8953. EvaluateX(p0, result);
  8954. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8955. (* ---- MIN and MAX ----- *)
  8956. |Global.Max,Global.Min:
  8957. EvaluateX(p0, s0);
  8958. EvaluateX(p1, s1);
  8959. Reuse2(res,s0.op,s1.op);
  8960. else := NewLabel();
  8961. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  8962. ELSE BrltL(else,s1.op,s0.op) END;
  8963. Emit(Mov(position,res,s0.op));
  8964. ReleaseOperand(s0);
  8965. end := NewLabel();
  8966. BrL(end);
  8967. SetLabel(else);
  8968. Emit(MovReplace(position,res,s1.op));
  8969. SetLabel(end);
  8970. ReleaseOperand(s1);
  8971. InitOperand(result,ModeValue);
  8972. result.op := res;
  8973. (* ---- ODD ----- *)
  8974. |Global.Odd:
  8975. EvaluateX(p0, result);
  8976. Reuse1(res,result.op);
  8977. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8978. ReleaseIntermediateOperand(result.op);
  8979. result.op := res;
  8980. Convert(result.op,bool);
  8981. (* ---- ORD ----- *)
  8982. |Global.Ord, Global.Ord32:
  8983. EvaluateX(p0, result);
  8984. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8985. (* ---- SHORT, LONG ----- *)
  8986. |Global.Short, Global.Long:
  8987. EvaluateX(p0, result);
  8988. IF x.type IS SyntaxTree.ComplexType THEN
  8989. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8990. Convert(result.op, IntermediateCode.GetType(system, componentType));
  8991. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  8992. ELSE
  8993. Convert(result.op,IntermediateCode.GetType(system,x.type));
  8994. END
  8995. (* ---- LEN ----- *)
  8996. |Global.Len: (* dynamic length, static length done by checker *)
  8997. Designate(p0,operand);
  8998. IF p1 = NIL THEN
  8999. InitOperand(l,ModeValue);
  9000. l.op := IntermediateCode.Immediate(sizeType,0);
  9001. ELSE
  9002. Evaluate(p1,l);
  9003. END;
  9004. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  9005. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  9006. Dereference(operand, p0.type.resolved, FALSE);
  9007. END;
  9008. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  9009. ReleaseOperand(operand); ReleaseOperand(l);
  9010. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  9011. ASSERT(p1 # NIL);
  9012. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9013. Dereference(operand,p0.type.resolved,FALSE);
  9014. END;
  9015. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  9016. ReleaseOperand(operand); ReleaseOperand(l);
  9017. ELSE HALT(100);
  9018. END;
  9019. Convert(result.op,IntermediateCode.GetType(system, x.type));
  9020. (* ---- FIRST ---- *)
  9021. |Global.First:
  9022. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9023. EvaluateX(p0(SyntaxTree.RangeExpression).first, result)
  9024. ELSE
  9025. Designate(p0, result)
  9026. END
  9027. (* ---- LAST ---- *)
  9028. |Global.Last:
  9029. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9030. EvaluateX(p0(SyntaxTree.RangeExpression).last, result)
  9031. ELSE
  9032. Designate(p0, result);
  9033. (* make sure result.op is a register *)
  9034. tmp := result.op;
  9035. ReuseCopy(result.op, result.op);
  9036. ReleaseIntermediateOperand(tmp);
  9037. (* add offset to result.op *)
  9038. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  9039. END
  9040. (* ---- STEP ---- *)
  9041. |Global.Step:
  9042. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  9043. EvaluateX(p0(SyntaxTree.RangeExpression).step, result)
  9044. ELSE
  9045. Designate(p0, result);
  9046. (* make sure result.op is a register *)
  9047. tmp := result.op;
  9048. ReuseCopy(result.op, result.op);
  9049. ReleaseIntermediateOperand(tmp);
  9050. (* add offset to result.op *)
  9051. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  9052. END
  9053. (* ---- RE ---- *)
  9054. |Global.Re:
  9055. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  9056. Designate(p0, result)
  9057. ELSE
  9058. EvaluateX(p0, result)
  9059. END
  9060. (* ---- IM ---- *)
  9061. |Global.Im:
  9062. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  9063. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  9064. Designate(p0, result);
  9065. (* make sure result.op is a register *)
  9066. tmp := result.op;
  9067. ReuseCopy(result.op, result.op);
  9068. ReleaseIntermediateOperand(tmp);
  9069. (* add offset to result.op *)
  9070. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  9071. (* ---- ABS ----- *)
  9072. |Global.Abs:
  9073. EvaluateX(p0,operand);
  9074. type := p0.type.resolved;
  9075. InitOperand(result,ModeValue);
  9076. Reuse1a(result.op,operand.op,dest);
  9077. Emit(Abs(position,result.op,operand.op));
  9078. ReleaseOperand(operand);
  9079. (* ---- ADDRESSOF----- *)
  9080. |Global.systemAdr:
  9081. Designate(p0,s0);
  9082. s0.mode := ModeValue;
  9083. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  9084. ReleaseIntermediateOperand(s0.op);
  9085. s0.op := s0.tag;
  9086. IntermediateCode.InitOperand(s0.tag);
  9087. END;
  9088. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  9089. result := s0;
  9090. (* ---- BIT ----- *)
  9091. |Global.systemBit:
  9092. EvaluateX(p0,s0);
  9093. ToMemory(s0.op,addressType,0);
  9094. ReuseCopy(res,s0.op);
  9095. ReleaseOperand(s0);
  9096. EvaluateX(p1, s1);
  9097. Emit(Ror(position,res,res,s1.op));
  9098. ReleaseOperand(s1);
  9099. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  9100. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  9101. InitOperand(result,ModeValue);
  9102. result.op := res;
  9103. (* --- MSK ----*)
  9104. |Global.systemMsk:
  9105. EvaluateX(p0, s0);
  9106. EvaluateX(p1, s1);
  9107. ReuseCopy(res,s0.op);
  9108. ReleaseOperand(s0);
  9109. Emit(And(position,res,res,s1.op));
  9110. ReleaseOperand(s1);
  9111. InitOperand(result,ModeValue);
  9112. result.op := res;
  9113. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  9114. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  9115. EvaluateX(p0, s0);
  9116. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  9117. ReleaseOperand(s0);
  9118. InitOperand(result,ModeValue);
  9119. result.op := res;
  9120. (* ---- SYSTEM.GetStackPointer ----- *)
  9121. |Global.systemGetStackPointer:
  9122. InitOperand(result,ModeValue);
  9123. result.op := sp;
  9124. (* ---- SYSTEM.GetFramePointer ----- *)
  9125. |Global.systemGetFramePointer:
  9126. InitOperand(result,ModeValue);
  9127. result.op := fp;
  9128. (* ---- SYSTEM.GetActivity ----- *)
  9129. |Global.systemGetActivity:
  9130. ASSERT(backend.cooperative);
  9131. InitOperand(result,ModeValue);
  9132. result.op := ap;
  9133. (* ---- SYSTEM.SetStackPointer ----- *)
  9134. |Global.systemSetStackPointer:
  9135. Evaluate(p0,s0); (* *)
  9136. Emit(Mov(position,sp,s0.op));
  9137. ReleaseOperand(s0);
  9138. (* ---- SYSTEM.SetFramePointer ----- *)
  9139. |Global.systemSetFramePointer:
  9140. Evaluate(p0,s0); (* *)
  9141. Emit(Mov(position,fp,s0.op));
  9142. ReleaseOperand(s0);
  9143. (* ---- SYSTEM.Activity ----- *)
  9144. |Global.systemSetActivity:
  9145. ASSERT(backend.cooperative);
  9146. Evaluate(p0,s0); (* *)
  9147. Emit(Mov(position,ap,s0.op));
  9148. ReleaseOperand(s0);
  9149. (* ---- SYSTEM.VAL ----- *)
  9150. |Global.systemVal:
  9151. Expression(p1);
  9152. s1 := result;
  9153. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  9154. IF s1.mode = ModeReference THEN
  9155. (* nothing to be done if not record type, just take over new type *)
  9156. IF (type IS SyntaxTree.RecordType) THEN
  9157. ReleaseIntermediateOperand(s1.tag);
  9158. s1.tag := TypeDescriptorAdr(type);
  9159. UseIntermediateOperand(s1.tag);
  9160. END;
  9161. result := s1;
  9162. ELSE (* copy over result to different type, may not use convert *)
  9163. itype := IntermediateCode.GetType(system,type);
  9164. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  9165. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  9166. Emit(Mov(position,s0.op,s1.op));
  9167. ReleaseOperand(s1);
  9168. InitOperand(result,ModeValue);
  9169. result.op := s0.op;
  9170. ELSE (* different size, must convert *)
  9171. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  9172. Convert(s1.op, IntermediateCode.GetType(system,type));
  9173. result := s1;
  9174. END;
  9175. END;
  9176. (* ---- SYSTEM.GET ----- *)
  9177. |Global.systemGet:
  9178. Evaluate(p0,s0); (* adr *)
  9179. Designate(p1,s1); (* variable *)
  9180. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  9181. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  9182. Emit(Mov(position,s1.op,s0.op));
  9183. ReleaseOperand(s1);
  9184. ReleaseOperand(s0);
  9185. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  9186. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  9187. Evaluate(p0,s0); (* *)
  9188. Evaluate(p1,s1); (* variable *)
  9189. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  9190. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  9191. (* real part *)
  9192. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  9193. Emit(Mov(position,res, s1.op));
  9194. ReleaseIntermediateOperand(res);
  9195. (* imaginary part *)
  9196. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9197. Emit(Mov(position,res, s1.tag));
  9198. ReleaseIntermediateOperand(res);
  9199. ReleaseOperand(s1);
  9200. ReleaseOperand(s0);
  9201. ELSE
  9202. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  9203. ReleaseOperand(s0);
  9204. Emit(Mov(position,res,s1.op));
  9205. ReleaseIntermediateOperand(res);
  9206. ReleaseOperand(s1);
  9207. END;
  9208. (* ---- SYSTEM.MOVE ----- *)
  9209. |Global.systemMove:
  9210. Evaluate(p0,s0);
  9211. Evaluate(p1,s1);
  9212. Evaluate(p2,s2);
  9213. Emit(Copy(position,s1.op,s0.op,s2.op));
  9214. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9215. (* ---- SYSTEM.NEW ----- *)
  9216. |Global.systemNew:
  9217. Designate(p0,s0);
  9218. Emit(Push(position,s0.op));
  9219. ReleaseOperand(s0);
  9220. Evaluate(p1,s1);
  9221. Emit(Push(position,s1.op));
  9222. ReleaseOperand(s1);
  9223. (* push realtime flag: false by default *)
  9224. Emit(Push(position,false));
  9225. CallThis(position,"Heaps","NewSys",3);
  9226. (* ---- SYSTEM.CALL ----- *)
  9227. |Global.systemRef:
  9228. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  9229. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  9230. s0.mode := ModeValue;
  9231. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  9232. result := s0
  9233. (* ---- INCR ----- *)
  9234. |Global.Incr:
  9235. Designate(p0,operand);
  9236. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9237. Dereference(operand,p0.type.resolved,FALSE);
  9238. END;
  9239. ASSERT(p1 # NIL);
  9240. Evaluate(p1,l);
  9241. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  9242. ReleaseOperand(operand); ReleaseOperand(l);
  9243. Convert(result.op,IntermediateCode.GetType(system, x.type));
  9244. (* ---- SUM ----- *)
  9245. |Global.Sum: HALT(200);
  9246. (* ---- ALL ----- *)
  9247. |Global.All: HALT(200);
  9248. (* ---- CAS ----- *)
  9249. |Global.Cas:
  9250. needsTrace := p0.NeedsTrace();
  9251. IF needsTrace THEN ModifyAssignments(true) END;
  9252. Designate(p0,s0);
  9253. Evaluate(p1,s1);
  9254. Evaluate(p2,s2);
  9255. IF needsTrace THEN
  9256. Emit(Push(position, s0.op));
  9257. Emit(Push(position, s1.op));
  9258. Emit(Push(position, s2.op));
  9259. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  9260. ELSE
  9261. Emit(Cas(position,s0.op,s1.op,s2.op));
  9262. END;
  9263. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9264. IF needsTrace THEN ModifyAssignments(false) END;
  9265. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  9266. Emit(Result(position, res));
  9267. result.op := res;
  9268. result.mode := ModeValue;
  9269. (*
  9270. IF conditional THEN
  9271. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  9272. BrL(falseLabel);
  9273. ReleaseIntermediateOperand(res);
  9274. END;
  9275. *)
  9276. (* ---- DIM ----- *)
  9277. |Global.Dim:
  9278. Designate(p0,s0);
  9279. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  9280. Dereference(s0,p0.type.resolved,FALSE);
  9281. END;
  9282. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  9283. ReleaseOperand(s0);
  9284. (* ---- SYSTEM.TYPECODE ----- *)
  9285. |Global.systemTypeCode:
  9286. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  9287. IF type.resolved IS SyntaxTree.PointerType THEN
  9288. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  9289. END;
  9290. result.op := TypeDescriptorAdr(type);
  9291. Convert(result.op, IntermediateCode.GetType(system,x.type));
  9292. result.mode := ModeValue;
  9293. (* ---- SYSTEM.TRACE ----- *)
  9294. |Global.systemTrace:
  9295. SystemTrace(x.parameters, x.position);
  9296. (* ----- CONNECT ------*)
  9297. |Global.Connect:
  9298. IF backend.cellsAreObjects THEN
  9299. PushPort(p0);
  9300. PushPort(p1);
  9301. IF p2 # NIL THEN
  9302. Evaluate(p2, s2);
  9303. Emit(Push(p2.position, s2.op));
  9304. ReleaseOperand(s2);
  9305. ELSE
  9306. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  9307. END;
  9308. CallThis(position,"ActiveCellsRuntime","Connect",3);
  9309. ELSE
  9310. Warning(x.position, "cannot run on final hardware");
  9311. END;
  9312. | Global.systemSpecial:
  9313. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  9314. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  9315. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  9316. (* determine if parameters are of the VAR kind *)
  9317. ASSERT(x.parameters.Length() <= 3);
  9318. formalParameter := procedureType.firstParameter;
  9319. FOR i := 0 TO x.parameters.Length() - 1 DO
  9320. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  9321. formalParameter := formalParameter.nextParameter
  9322. END;
  9323. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  9324. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  9325. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  9326. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  9327. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  9328. IF procedureType.returnType # NIL THEN
  9329. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9330. Emit(Result(position, res));
  9331. (*InitOperand(result,ModeValue);
  9332. result.op := res;
  9333. *)
  9334. InitOperand(result,ModeValue); result.op := res;
  9335. END
  9336. ELSE (* function not yet implemented *)
  9337. Error(position,"not yet implemented");
  9338. END;
  9339. destination := dest;
  9340. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  9341. END EvaluateBuiltinCallDesignator;
  9342. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  9343. VAR trueL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  9344. BEGIN
  9345. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  9346. dest := destination; destination := emptyOperand;
  9347. Expression(x.left);
  9348. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  9349. ELSIF isUnchecked THEN (* no check *)
  9350. ELSE
  9351. trueL := NewLabel();
  9352. IF IsPointerToRecord(x.left.type,recordType) THEN
  9353. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  9354. Emit(Mov(position,tag, result.op));
  9355. IF result.mode # ModeValue THEN
  9356. ptr := tag;
  9357. IntermediateCode.MakeMemory(ptr,addressType);
  9358. Emit(Mov(position,tag, ptr));
  9359. END;
  9360. IF ~backend.cooperative THEN
  9361. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  9362. END;
  9363. IntermediateCode.MakeMemory(tag,addressType);
  9364. ELSE
  9365. tag := result.tag;
  9366. UseIntermediateOperand(tag);
  9367. END;
  9368. TypeTest(tag,x.type,trueL,TRUE,FALSE);
  9369. ReleaseIntermediateOperand(tag);
  9370. EmitTrap(position,TypeCheckTrap);
  9371. SetLabel(trueL);
  9372. END;
  9373. destination := dest;
  9374. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  9375. END VisitTypeGuardDesignator;
  9376. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  9377. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  9378. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  9379. VAR label: Label; pc: LONGINT;
  9380. BEGIN
  9381. IF backend.cooperative & ~isUnchecked THEN
  9382. pc := section.pc;
  9383. label := NewLabel();
  9384. BrneL(label, operand.op, nil);
  9385. EmitTrap(position, NilPointerTrap);
  9386. SetLabel(label);
  9387. INC(statCoopNilCheck, section.pc - pc);
  9388. END;
  9389. END NilCheck;
  9390. BEGIN
  9391. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  9392. ReuseCopy(dereferenced,operand.op);
  9393. ReleaseOperand(operand);
  9394. operand.mode := ModeReference;
  9395. operand.op := dereferenced;
  9396. operand.tag := dereferenced;
  9397. UseIntermediateOperand(operand.tag);
  9398. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  9399. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  9400. ReleaseIntermediateOperand(operand.tag);
  9401. operand.tag := TypeDescriptorAdr(type);
  9402. ELSE
  9403. IF ~backend.cooperative THEN
  9404. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  9405. END;
  9406. IntermediateCode.MakeMemory(operand.tag,addressType);
  9407. END;
  9408. NilCheck(operand.op);
  9409. ELSIF type IS SyntaxTree.ArrayType THEN
  9410. IF isUnsafe THEN
  9411. NilCheck(operand.op);
  9412. ReleaseIntermediateOperand(operand.tag);
  9413. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  9414. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9415. ELSE
  9416. operand.tag := emptyOperand;
  9417. END;
  9418. ELSE
  9419. NilCheck(operand.op);
  9420. IF backend.cooperative THEN
  9421. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  9422. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  9423. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  9424. ELSE
  9425. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  9426. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  9427. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  9428. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  9429. END;
  9430. END;
  9431. ELSIF type IS SyntaxTree.MathArrayType THEN
  9432. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9433. IntermediateCode.MakeMemory(operand.op,addressType);
  9434. ELSE HALT(100);
  9435. END;
  9436. END Dereference;
  9437. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  9438. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  9439. BEGIN
  9440. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  9441. dest := destination; destination := emptyOperand;
  9442. Evaluate(x.left,d);
  9443. type := x.type.resolved;
  9444. prevIsUnchecked := isUnchecked;
  9445. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  9446. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  9447. END;
  9448. Dereference(d,type,IsUnsafePointer(x.left.type));
  9449. isUnchecked := prevIsUnchecked;
  9450. result := d;
  9451. 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
  9452. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  9453. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  9454. END;
  9455. END;
  9456. destination := dest;
  9457. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  9458. END VisitDereferenceDesignator;
  9459. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  9460. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  9461. BEGIN
  9462. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  9463. dest := destination; destination := emptyOperand;
  9464. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  9465. tag := result.op;
  9466. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  9467. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  9468. StaticCallOperand(result,procedure.super);
  9469. ReleaseIntermediateOperand(result.tag);
  9470. UseIntermediateOperand(tag); (* necessary ? *)
  9471. result.tag := tag;
  9472. destination := dest;
  9473. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  9474. END VisitSupercallDesignator;
  9475. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  9476. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  9477. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9478. name: Basic.SegmentedName;
  9479. procedure: SyntaxTree.Procedure;
  9480. procedureType: SyntaxTree.ProcedureType;
  9481. BEGIN
  9482. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  9483. dest := destination; destination := emptyOperand;
  9484. scope := currentScope;
  9485. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9486. scope := scope.outerScope;
  9487. END;
  9488. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9489. moduleSection := meta.ModuleSection();
  9490. IF backend.cooperative THEN
  9491. moduleOffset := 0;
  9492. ELSE
  9493. moduleOffset := moduleSection.pc;
  9494. END;
  9495. result.mode := ModeValue;
  9496. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9497. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  9498. result.mode := ModeValue;
  9499. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  9500. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  9501. ELSE
  9502. GetBaseRegister(basereg,currentScope,scope);
  9503. InitOperand(result,ModeReference);
  9504. result.op := basereg;
  9505. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9506. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9507. parametersSize := ProcParametersSize(procedure);
  9508. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9509. IF backend.cooperative THEN
  9510. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  9511. END;
  9512. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  9513. MakeMemory(result.op, result.op, addressType, 0);
  9514. END;
  9515. (* tag must be loaded when dereferencing SELF pointer *)
  9516. END;
  9517. destination := dest;
  9518. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  9519. END VisitSelfDesignator;
  9520. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  9521. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  9522. BEGIN
  9523. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  9524. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9525. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9526. parameter := procedureType.returnParameter;
  9527. IF currentIsInline THEN
  9528. map := currentMapper.Get(NIL);
  9529. IF map # NIL THEN
  9530. Designate(map.to, result);
  9531. ELSE
  9532. HALT(200);
  9533. END;
  9534. RETURN;
  9535. END;
  9536. VisitParameter(parameter);
  9537. IF Trace THEN TraceExit("VisitResultDesignator") END;
  9538. END VisitResultDesignator;
  9539. (** values *)
  9540. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  9541. BEGIN
  9542. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  9543. InitOperand(result,ModeValue);
  9544. IF x.value THEN result.op := true ELSE result.op := false END;
  9545. END VisitBooleanValue;
  9546. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  9547. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  9548. BEGIN
  9549. Global.GetModuleSegmentedName(module.module, name);
  9550. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  9551. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  9552. RETURN section
  9553. END GetDataSection;
  9554. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  9555. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  9556. BEGIN
  9557. type := vop.type;
  9558. data := GetDataSection();
  9559. pc := EnterImmediate(data,vop);
  9560. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  9561. IntermediateCode.MakeMemory(vop, type);
  9562. END GetImmediateMem;
  9563. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  9564. BEGIN
  9565. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  9566. InitOperand(result,ModeValue);
  9567. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  9568. IF ~supportedImmediate(result.op) &~inData THEN
  9569. GetImmediateMem(result.op)
  9570. END;
  9571. END VisitIntegerValue;
  9572. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  9573. BEGIN
  9574. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  9575. InitOperand(result,ModeValue);
  9576. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  9577. END VisitCharacterValue;
  9578. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  9579. BEGIN
  9580. IF Trace THEN TraceEnter("VisitSetValue") END;
  9581. InitOperand(result,ModeValue);
  9582. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  9583. END VisitSetValue;
  9584. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  9585. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  9586. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  9587. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  9588. BEGIN
  9589. numberElements := x.elements.Length();
  9590. FOR i := 0 TO numberElements-1 DO
  9591. expression := x.elements.GetExpression(i);
  9592. IF expression IS SyntaxTree.MathArrayExpression THEN
  9593. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  9594. ELSE
  9595. inData := TRUE;
  9596. Evaluate(expression,op);
  9597. irv.Emit(Data(position,op.op));
  9598. inData := FALSE;
  9599. ReleaseOperand(op);
  9600. END;
  9601. END;
  9602. END RecursiveData;
  9603. BEGIN
  9604. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  9605. IF ~TryConstantDeclaration() THEN
  9606. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  9607. GetCodeSectionNameForSymbol(constantDeclaration,name);
  9608. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  9609. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  9610. ELSE
  9611. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9612. END;
  9613. RecursiveData(x.array);
  9614. InitOperand(result,ModeReference);
  9615. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  9616. END
  9617. END VisitMathArrayValue;
  9618. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  9619. VAR constant: Sections.Section;
  9620. BEGIN
  9621. IF constantDeclaration = NIL THEN
  9622. RETURN FALSE
  9623. ELSE
  9624. (* Is a constant in this module: did we generate it already? *)
  9625. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  9626. IF constant # NIL THEN
  9627. InitOperand(result,ModeReference);
  9628. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  9629. RETURN TRUE;
  9630. END;
  9631. END;
  9632. RETURN FALSE
  9633. END TryConstantDeclaration;
  9634. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  9635. BEGIN
  9636. constantDeclaration := x;
  9637. VExpression(x.value.resolved);
  9638. END VisitConstant;
  9639. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  9640. BEGIN
  9641. IF Trace THEN TraceEnter("VisitRealValue") END;
  9642. InitOperand(result,ModeValue);
  9643. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  9644. END VisitRealValue;
  9645. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  9646. VAR
  9647. componentType: SyntaxTree.Type;
  9648. BEGIN
  9649. IF Trace THEN TraceEnter("VisitComplexValue") END;
  9650. ASSERT(x.type IS SyntaxTree.ComplexType);
  9651. componentType := x.type(SyntaxTree.ComplexType).componentType;
  9652. InitOperand(result,ModeValue);
  9653. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  9654. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  9655. END VisitComplexValue;
  9656. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  9657. VAR i: LONGINT; name: Basic.SegmentedName;
  9658. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  9659. BEGIN
  9660. IF Trace THEN TraceEnter("VisitStringValue") END;
  9661. IF ~TryConstantDeclaration() THEN
  9662. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  9663. GetCodeSectionNameForSymbol(constantDeclaration,name);
  9664. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  9665. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9666. ELSE
  9667. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  9668. END;
  9669. FOR i := 0 TO x.length-1 DO
  9670. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  9671. irv.Emit(Data(position,op));
  9672. END;
  9673. InitOperand(result,ModeReference);
  9674. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  9675. result.tag := IntermediateCode.Immediate(addressType,x.length);
  9676. END
  9677. END VisitStringValue;
  9678. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  9679. BEGIN
  9680. IF Trace THEN TraceEnter("VisitNilValue") END;
  9681. InitOperand(result,ModeValue);
  9682. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  9683. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  9684. END VisitNilValue;
  9685. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  9686. BEGIN
  9687. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  9688. InitOperand(result,ModeValue);
  9689. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  9690. END VisitEnumerationValue;
  9691. (** symbols *)
  9692. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  9693. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  9694. END VisitImport;
  9695. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  9696. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  9697. BEGIN
  9698. IF scope # baseScope THEN
  9699. (* left := [fp+8] *)
  9700. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  9701. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  9702. ReuseCopy(left,right);
  9703. ReleaseIntermediateOperand(right);
  9704. scope := scope.outerScope; DEC(level);
  9705. (* { left := [left+8] } *)
  9706. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  9707. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  9708. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  9709. Emit(Mov(position,left,right));
  9710. scope := scope.outerScope; DEC(level);
  9711. END;
  9712. ASSERT((scope = baseScope) OR (baseScope = NIL));
  9713. result := left;
  9714. ELSE
  9715. result := fp;
  9716. END;
  9717. END GetBaseRegister;
  9718. (* EXPERIMENTAL *)
  9719. PROCEDURE GetAvailability(x: SyntaxTree.Variable): WORD;
  9720. VAR i: WORD;
  9721. BEGIN
  9722. IF ~backend.experiment THEN RETURN -1 END;
  9723. i := 0;
  9724. WHILE (availableSymbols[i].symbol # NIL) & (availableSymbols[i].symbol # x) DO
  9725. INC(i);
  9726. END;
  9727. IF availableSymbols[i].symbol = NIL THEN
  9728. availableSymbols[i].inRegister := FALSE;
  9729. availableSymbols[i].inMemory := TRUE;
  9730. availableSymbols[i].symbol := x;
  9731. END;
  9732. RETURN i;
  9733. END GetAvailability;
  9734. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  9735. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  9736. BEGIN
  9737. IF Trace THEN TraceEnter("VisitVariable"); END;
  9738. type := x.type.resolved;
  9739. IF (x.useRegister) THEN
  9740. InitOperand(result, ModeValue);
  9741. IF x.registerNumber < 0 THEN
  9742. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  9743. reg := x.registerNumber;
  9744. ELSE
  9745. reg := registerUsageCount.Map(x.registerNumber);
  9746. UseRegister(reg);
  9747. END;
  9748. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  9749. ELSIF x.externalName # NIL THEN
  9750. InitOperand(result,ModeReference);
  9751. Basic.ToSegmentedName(x.externalName^, name);
  9752. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  9753. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  9754. InitOperand(result,ModeReference);
  9755. GetBaseRegister(result.op,currentScope,x.scope);
  9756. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9757. (* EXPERIMENTAL *)
  9758. result.availability := GetAvailability(x);
  9759. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  9760. InitOperand(result,ModeReference);
  9761. GetCodeSectionNameForSymbol(x,name);
  9762. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9763. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9764. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  9765. InitOperand(result,ModeReference);
  9766. GetCodeSectionNameForSymbol(x,name);
  9767. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9768. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  9769. ELSE (* field, left designator must have been emitted *)
  9770. ASSERT(result.mode = ModeReference);
  9771. IF result.op.mode = IntermediateCode.ModeMemory THEN
  9772. ReuseCopy(temp,result.op);
  9773. ReleaseIntermediateOperand(result.op);
  9774. result.op := temp;
  9775. END;
  9776. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9777. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  9778. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9779. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  9780. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  9781. END;
  9782. END;
  9783. END;
  9784. IF type IS SyntaxTree.ProcedureType THEN
  9785. ReleaseIntermediateOperand(result.tag);
  9786. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9787. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9788. UseIntermediateOperand(result.tag);
  9789. ELSE
  9790. result.tag := nil; (* nil *)
  9791. END;
  9792. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9793. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  9794. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  9795. ReleaseIntermediateOperand(result.tag);
  9796. Global.GetSymbolSegmentedName(x,name);
  9797. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  9798. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  9799. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  9800. ELSE
  9801. END;
  9802. ELSE
  9803. ReleaseIntermediateOperand(result.tag);
  9804. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9805. END;
  9806. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9807. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  9808. ReleaseIntermediateOperand(result.tag);
  9809. result.tag := result.op;
  9810. UseIntermediateOperand(result.tag);
  9811. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9812. IntermediateCode.MakeMemory(result.op,addressType);
  9813. END;
  9814. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  9815. ReleaseIntermediateOperand(result.tag);
  9816. result.tag := TypeDescriptorAdr(type);
  9817. UseIntermediateOperand(result.tag);
  9818. (* tag for pointer type computed not here but during dereferencing *)
  9819. END;
  9820. IF Trace THEN TraceExit("VisitVariable") END;
  9821. END VisitVariable;
  9822. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  9823. BEGIN
  9824. VisitVariable(property);
  9825. END VisitProperty;
  9826. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  9827. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; symbol: Sections.Section;
  9828. name: Basic.SegmentedName; ptype: SyntaxTree.Type; temp: IntermediateCode.Operand;
  9829. BEGIN
  9830. type := x.type.resolved;
  9831. IF Trace THEN TraceEnter("VisitParameter") END;
  9832. IF x.ownerType IS SyntaxTree.CellType THEN
  9833. ptype := x.type.resolved;
  9834. IF backend.cellsAreObjects THEN
  9835. ASSERT(result.mode = ModeReference);
  9836. IF result.op.mode = IntermediateCode.ModeMemory THEN
  9837. ReuseCopy(temp,result.op);
  9838. ReleaseIntermediateOperand(result.op);
  9839. result.op := temp;
  9840. END;
  9841. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9842. RETURN;
  9843. ELSE
  9844. InitOperand(result,ModeReference);
  9845. GetCodeSectionNameForSymbol(x,name);
  9846. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9847. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9848. RETURN;
  9849. END;
  9850. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  9851. InitOperand(result,ModeReference);
  9852. GetCodeSectionNameForSymbol(x,name);
  9853. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  9854. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  9855. RETURN
  9856. ELSE
  9857. GetBaseRegister(basereg,currentScope,x.scope);
  9858. InitOperand(result,ModeReference);
  9859. result.op := basereg;
  9860. END;
  9861. IF IsOpenArray(type) THEN
  9862. result.tag := basereg;
  9863. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9864. IntermediateCode.MakeMemory(result.op,addressType);
  9865. IF Global.IsOberonProcedure(x.ownerType) THEN
  9866. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  9867. UseIntermediateOperand(result.tag);
  9868. ELSE
  9869. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  9870. END;
  9871. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  9872. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9873. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9874. ELSIF IsStaticArray(type) THEN
  9875. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9876. IntermediateCode.MakeMemory(result.op,addressType);
  9877. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  9878. ELSIF type IS SyntaxTree.MathArrayType THEN
  9879. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9880. WITH type: SyntaxTree.MathArrayType DO
  9881. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9882. IF type.form = SyntaxTree.Tensor THEN
  9883. ELSIF type.form = SyntaxTree.Open THEN
  9884. result.tag := result.op;
  9885. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9886. IntermediateCode.MakeMemory(result.op,addressType);
  9887. UseIntermediateOperand(result.tag);
  9888. ELSIF type.form = SyntaxTree.Static THEN
  9889. IF x.kind = SyntaxTree.ConstParameter THEN
  9890. IntermediateCode.MakeMemory(result.op,addressType);
  9891. END;
  9892. ELSE HALT(100)
  9893. END;
  9894. ELSIF x.kind = SyntaxTree.VarParameter THEN
  9895. IF type.form = SyntaxTree.Tensor THEN
  9896. ToMemory(result.op,addressType,0);
  9897. ELSIF type.form = SyntaxTree.Open THEN
  9898. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  9899. ReuseCopy(result.tag, mem);
  9900. ReleaseIntermediateOperand(mem);
  9901. ReleaseIntermediateOperand(result.op);
  9902. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  9903. ELSIF type.form = SyntaxTree.Static THEN
  9904. IntermediateCode.MakeMemory(result.op,addressType);
  9905. ELSE HALT(100)
  9906. END;
  9907. ELSE HALT(100)
  9908. END;
  9909. END;
  9910. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  9911. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9912. IntermediateCode.MakeMemory(result.op,addressType);
  9913. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9914. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9915. END;
  9916. IF type IS SyntaxTree.ProcedureType THEN
  9917. ReleaseIntermediateOperand(result.tag);
  9918. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9919. IF x.kind = SyntaxTree.VarParameter THEN
  9920. ReuseCopy(result.tag,result.op);
  9921. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9922. IntermediateCode.MakeMemory(result.tag,addressType);
  9923. ELSE
  9924. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9925. UseIntermediateOperand(result.tag);
  9926. END;
  9927. ELSE
  9928. result.tag := nil;
  9929. END;
  9930. (* tag for pointer type computed not here but during dereferencing *)
  9931. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) (* & ~(x.selfParameter) *) THEN
  9932. ReleaseIntermediateOperand(result.tag);
  9933. result.tag := basereg;
  9934. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9935. IntermediateCode.MakeMemory(result.tag,addressType);
  9936. UseIntermediateOperand(result.tag);
  9937. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9938. ReleaseIntermediateOperand(result.tag);
  9939. result.tag := TypeDescriptorAdr(type);
  9940. UseIntermediateOperand(result.tag);
  9941. END;
  9942. IF Trace THEN TraceExit("VisitParameter") END;
  9943. END VisitParameter;
  9944. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9945. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9946. BEGIN
  9947. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9948. (* left.p: left already emitted *)
  9949. tag := result.op; (* value of pointer to left *)
  9950. (* get type desc *)
  9951. tmp := result.tag;
  9952. IntermediateCode.MakeMemory(tmp,addressType);
  9953. (* get method adr *)
  9954. Reuse1(reg,tmp);
  9955. ReleaseIntermediateOperand(tmp);
  9956. IF backend.cooperative THEN
  9957. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9958. WHILE recordType.baseType # NIL DO
  9959. recordType := recordType.GetBaseRecord ();
  9960. END;
  9961. GetRecordTypeName (recordType,name);
  9962. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9963. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9964. offset := 0;
  9965. ELSE
  9966. offset := 2;
  9967. END;
  9968. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9969. ELSIF meta.simple THEN
  9970. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9971. ELSE
  9972. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9973. END;
  9974. InitOperand(operand,ModeReference);
  9975. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9976. operand.op := reg;
  9977. operand.tag := tag;
  9978. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9979. END DynamicCallOperand;
  9980. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9981. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9982. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9983. BEGIN
  9984. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9985. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9986. tag := operand.op;
  9987. ReleaseIntermediateOperand(operand.tag);
  9988. ELSE tag := nil
  9989. END;
  9990. IF x.isInline THEN
  9991. sectionType := Sections.InlineCodeSection;
  9992. ELSE
  9993. sectionType := Sections.CodeSection;
  9994. END;
  9995. IF x.externalName # NIL THEN
  9996. Basic.ToSegmentedName(x.externalName^, name);
  9997. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9998. ELSE
  9999. GetCodeSectionNameForSymbol(x, name);
  10000. IF (x.scope.ownerModule = module.module) THEN
  10001. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  10002. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  10003. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  10004. IF source.pc = 0 THEN (* no code yet *)
  10005. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  10006. END;
  10007. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  10008. bits := x.procedureScope.body.code.inlineCode;
  10009. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  10010. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  10011. binary.CopyBits(bits, 0, bits.GetSize());
  10012. source.SetResolved(binary);
  10013. ELSE
  10014. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  10015. END;
  10016. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  10017. END;
  10018. InitOperand(operand,ModeValue);
  10019. operand.op := reg;
  10020. operand.tag := tag;
  10021. IF Trace THEN TraceExit("StaticCallOperand") END;
  10022. END StaticCallOperand;
  10023. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  10024. (* handle expressions of the form designator.procedure or procedure *)
  10025. BEGIN
  10026. IF Trace THEN TraceEnter("VisitProcedure") END;
  10027. EndBasicBlock;
  10028. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  10029. DynamicCallOperand(result,x);
  10030. ELSIF x.isInline THEN
  10031. StaticCallOperand(result,x);
  10032. ELSE
  10033. StaticCallOperand(result,x);
  10034. END;
  10035. IF Trace THEN TraceExit("VisitProcedure") END;
  10036. END VisitProcedure;
  10037. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  10038. BEGIN
  10039. VisitProcedure(x);
  10040. END VisitOperator;
  10041. (** statements *)
  10042. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  10043. BEGIN
  10044. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  10045. Expression(x.call);
  10046. IF (x.call.type # NIL) THEN (* procedure returning ignored value *)
  10047. ReleaseOperand(result)
  10048. END;
  10049. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  10050. END VisitProcedureCallStatement;
  10051. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  10052. VAR leftType, rightType: SyntaxTree.MathArrayType;
  10053. leftBase, rightBase: SyntaxTree.Type;
  10054. procedureName,s: SyntaxTree.IdentifierString;
  10055. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  10056. size: LONGINT; rightKind: LONGINT;
  10057. dummy: IntermediateCode.Operand;
  10058. CONST moduleName = "FoxArrayBase";
  10059. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  10060. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  10061. BEGIN
  10062. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  10063. IF base IS SyntaxTree.MathArrayType THEN
  10064. base := OpenArray(base(SyntaxTree.MathArrayType));
  10065. END;
  10066. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  10067. result.SetArrayBase(base);
  10068. RETURN result
  10069. END OpenArray;
  10070. BEGIN
  10071. IF AddImport(moduleName,arrayBase,TRUE) THEN
  10072. SaveRegisters();ReleaseUsedRegisters(saved);
  10073. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  10074. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  10075. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  10076. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  10077. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  10078. IF leftType.form = SyntaxTree.Tensor THEN
  10079. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  10080. ELSIF leftType.form = SyntaxTree.Open THEN
  10081. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  10082. ELSIF leftType.form = SyntaxTree.Static THEN
  10083. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  10084. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  10085. END;
  10086. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  10087. IF procedure = NIL THEN
  10088. s := "Instruction not supported on target, emulation procedure ";
  10089. Strings.Append(s,moduleName);
  10090. Strings.Append(s,".");
  10091. Strings.Append(s,procedureName);
  10092. Strings.Append(s," not present");
  10093. Error(position,s);
  10094. ELSE
  10095. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  10096. parameter.SetType(leftType);
  10097. parameter.SetAccess(SyntaxTree.Internal);
  10098. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  10099. parameter.SetKind(rightKind);
  10100. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  10101. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  10102. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  10103. StaticCallOperand(result,procedure);
  10104. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  10105. ReleaseOperand(result);
  10106. END;
  10107. RestoreRegisters(saved);
  10108. END;
  10109. END AssignMathArray;
  10110. VAR modifyAssignmentCounter := 0: LONGINT;
  10111. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  10112. VAR processor,mem,dst: IntermediateCode.Operand;
  10113. BEGIN
  10114. IF value.intValue = true.intValue THEN
  10115. INC(modifyAssignmentCounter);
  10116. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  10117. modifyAssignmentsPC := section.pc;
  10118. ELSE
  10119. DEC(modifyAssignmentCounter);
  10120. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  10121. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  10122. END;
  10123. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  10124. dst := NewRegisterOperand (addressType);
  10125. Emit(Mov(position,dst, processor));
  10126. IntermediateCode.InitMemory(mem,bool, dst, 0);
  10127. Emit(Mov(position,mem, value));
  10128. ReleaseIntermediateOperand(dst);
  10129. END ModifyAssignments;
  10130. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  10131. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  10132. BEGIN
  10133. type := left.type.resolved;
  10134. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  10135. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  10136. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  10137. IF procedureType.returnParameter = parameter THEN
  10138. (* this is the only case where the destination can be dynamically smaller than the source
  10139. in all other cases the dynamic size has to be taken
  10140. *)
  10141. IF backend.cooperative THEN
  10142. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  10143. ELSE
  10144. MakeMemory(mem, tag, addressType, 0);
  10145. END;
  10146. RETURN mem;
  10147. END;
  10148. END;
  10149. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  10150. END CopySize;
  10151. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  10152. VAR
  10153. leftO, rightO: Operand;
  10154. arg,mem, sizeOp: IntermediateCode.Operand;
  10155. leftType, rightType, componentType, base: SyntaxTree.Type;
  10156. size: LONGINT;
  10157. parameters: SyntaxTree.ExpressionList;
  10158. procedure: SyntaxTree.Procedure;
  10159. call: SyntaxTree.ProcedureCallDesignator;
  10160. designator: SyntaxTree.Designator;
  10161. saved: RegisterEntry;
  10162. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  10163. VAR procedureType: SyntaxTree.ProcedureType;
  10164. BEGIN
  10165. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  10166. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  10167. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  10168. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  10169. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  10170. WITH right: SyntaxTree.BuiltinCallDesignator DO
  10171. IF right.id = Global.Reshape THEN RETURN TRUE
  10172. END;
  10173. END;
  10174. END;
  10175. END;
  10176. RETURN FALSE
  10177. END CanPassAsResultParameter;
  10178. BEGIN
  10179. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  10180. leftType := left.type.resolved; rightType:= right.type.resolved;
  10181. IF backend.cooperative & left.NeedsTrace() THEN
  10182. ModifyAssignments(true);
  10183. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  10184. Designate(right, rightO);
  10185. Designate(left, leftO);
  10186. ASSERT(leftO.mode = ModeReference);
  10187. TransferToRegister(leftO.op, leftO.op);
  10188. TransferToRegister(rightO.op, rightO.op);
  10189. Emit(Push(position, leftO.op));
  10190. Emit(Push(position, rightO.op));
  10191. CallAssignMethod(leftO.op, rightO.op, left.type);
  10192. Emit(Pop(position, rightO.op));
  10193. Emit(Pop(position, leftO.op));
  10194. sizeOp := CopySize(left, leftO.tag);
  10195. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  10196. ReleaseIntermediateOperand(sizeOp);
  10197. ReleaseOperand(leftO);
  10198. ReleaseOperand(rightO);
  10199. ELSE
  10200. Evaluate(right,rightO);
  10201. Designate(left,leftO);
  10202. ASSERT(leftO.mode = ModeReference);
  10203. IF (leftType IS SyntaxTree.ProcedureType) THEN
  10204. (* copy procedure address first *)
  10205. MakeMemory(mem,leftO.op,addressType,0);
  10206. Emit(Mov(position,mem,rightO.op));
  10207. ReleaseIntermediateOperand(mem);
  10208. (* copy pointer address *)
  10209. IntermediateCode.MakeAddress(leftO.tag, addressType);
  10210. CallAssignPointer(leftO.tag, rightO.tag);
  10211. ELSE
  10212. ASSERT(system.SizeOf(left.type) = system.addressSize);
  10213. CallAssignPointer(leftO.op, rightO.op);
  10214. END;
  10215. ReleaseOperand(leftO);
  10216. ReleaseOperand(rightO);
  10217. END;
  10218. ModifyAssignments(false);
  10219. RETURN;
  10220. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  10221. SaveRegisters();ReleaseUsedRegisters(saved);
  10222. IF SemanticChecker.IsPointerType(leftType) THEN
  10223. Evaluate(right,rightO);
  10224. Designate(left,leftO);
  10225. Emit(Push(position,leftO.op));
  10226. ReleaseOperand(leftO);
  10227. Emit(Push(position,rightO.op));
  10228. ReleaseOperand(rightO);
  10229. CallThis(position,"Heaps","Assign",2);
  10230. ELSIF leftType.IsRecordType() THEN
  10231. Designate(right,rightO);
  10232. Designate(left,leftO);
  10233. Emit(Push(position,leftO.op));
  10234. Emit(Push(position,leftO.tag)); (* type desc *)
  10235. ReleaseOperand(leftO);
  10236. Emit(Push(position,rightO.op));
  10237. ReleaseOperand(rightO);
  10238. CallThis(position,"Heaps","AssignRecord",3);
  10239. ELSIF IsStaticArray(leftType) THEN
  10240. size := StaticArrayNumElements(leftType);
  10241. base := StaticArrayBaseType(leftType);
  10242. Designate(right,rightO);
  10243. Designate(left,leftO);
  10244. Emit(Push(position,leftO.op));
  10245. ReleaseOperand(leftO);
  10246. arg := TypeDescriptorAdr(base);
  10247. Emit(Push(position,arg));
  10248. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10249. Emit(Push(position,rightO.op));
  10250. ReleaseOperand(rightO);
  10251. CallThis(position,"Heaps","AssignArray",4);
  10252. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  10253. size := StaticMathArrayNumElements(leftType);
  10254. base := StaticMathArrayBaseType(leftType);
  10255. Designate(right,rightO);
  10256. Designate(left,leftO);
  10257. Emit(Push(position,leftO.op));
  10258. ReleaseOperand(leftO);
  10259. arg := TypeDescriptorAdr(base);
  10260. Emit(Push(position,arg));
  10261. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10262. Emit(Push(position,rightO.op));
  10263. ReleaseOperand(rightO);
  10264. CallThis(position,"Heaps","AssignArray",4);
  10265. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  10266. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  10267. Evaluate(right,rightO);
  10268. Designate(left,leftO);
  10269. MakeMemory(mem,leftO.op,addressType,0);
  10270. Emit(Mov(position,mem,rightO.op));
  10271. ReleaseIntermediateOperand(mem);
  10272. IntermediateCode.MakeAddress(leftO.tag, addressType);
  10273. Emit (Push(position, leftO.tag));
  10274. ReleaseOperand(leftO);
  10275. Emit (Push(position, rightO.tag));
  10276. ReleaseOperand(rightO);
  10277. CallThis(position,"Heaps","Assign", 2);
  10278. ELSE HALT(100); (* missing ? *)
  10279. END;
  10280. RestoreRegisters(saved);
  10281. RETURN;
  10282. END;
  10283. IF CanPassAsResultParameter(right) THEN
  10284. procedureResultDesignator := left(SyntaxTree.Designator);
  10285. Expression(right);
  10286. procedureResultDesignator := NIL;
  10287. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  10288. (* left <-- ALIAS OF right: zerocopy *)
  10289. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  10290. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  10291. designator.SetType(procedure.type);
  10292. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  10293. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  10294. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  10295. END;
  10296. ELSIF leftType IS SyntaxTree.RangeType THEN
  10297. (* LHS is of array range type *)
  10298. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  10299. Evaluate(right, rightO);
  10300. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  10301. (* first *)
  10302. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  10303. Emit(Mov(position,mem, rightO.op));
  10304. ReleaseIntermediateOperand(mem);
  10305. (* last *)
  10306. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10307. Emit(Mov(position,mem, rightO.tag));
  10308. ReleaseIntermediateOperand(mem);
  10309. (* step *)
  10310. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10311. Emit(Mov(position,mem, rightO.extra));
  10312. ReleaseIntermediateOperand(mem);
  10313. ReleaseOperand(rightO);
  10314. ReleaseOperand(leftO)
  10315. ELSIF leftType IS SyntaxTree.ComplexType THEN
  10316. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  10317. Evaluate(right, rightO);
  10318. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  10319. componentType := leftType(SyntaxTree.ComplexType).componentType;
  10320. (* real part *)
  10321. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  10322. Emit(Mov(position,mem, rightO.op));
  10323. ReleaseIntermediateOperand(mem);
  10324. (* imaginary part *)
  10325. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10326. Emit(Mov(position,mem, rightO.tag));
  10327. ReleaseIntermediateOperand(mem);
  10328. ReleaseOperand(rightO);
  10329. ReleaseOperand(leftO)
  10330. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  10331. OR (leftType IS SyntaxTree.PortType) THEN
  10332. (* rightO := leftO;*)
  10333. Evaluate(right,rightO);
  10334. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  10335. Designate(left,leftO);
  10336. IF leftO.mode = ModeReference THEN
  10337. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  10338. destination := mem;
  10339. ELSE
  10340. destination := leftO.op;
  10341. END;
  10342. ReleaseOperand(leftO);
  10343. (* EXPERIMENTAL *)
  10344. IF (leftO.availability >= 0) & (availableSymbols[leftO.availability].inRegister) THEN
  10345. ReleaseIntermediateOperand(destination);
  10346. destination := availableSymbols[leftO.availability].register;
  10347. UseIntermediateOperand(destination);
  10348. availableSymbols[leftO.availability].inMemory := FALSE;
  10349. END;
  10350. IF destination.mode # IntermediateCode.Undefined THEN
  10351. Emit(Mov(position,destination,rightO.op));
  10352. END;
  10353. ReleaseOperand(rightO);
  10354. ReleaseIntermediateOperand(mem);
  10355. IntermediateCode.InitOperand(destination);
  10356. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  10357. Evaluate(right,rightO);
  10358. Designate(left,leftO);
  10359. MakeMemory(mem,leftO.op,addressType,0);
  10360. Emit(Mov(position,mem,rightO.op));
  10361. ReleaseIntermediateOperand(mem);
  10362. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  10363. (* delegate *)
  10364. (*
  10365. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  10366. *)
  10367. Emit(Mov(position,leftO.tag,rightO.tag));
  10368. END;
  10369. ReleaseOperand(leftO);
  10370. ReleaseOperand(rightO);
  10371. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  10372. Designate(right,rightO);
  10373. Designate(left,leftO);
  10374. sizeOp := CopySize(left, leftO.tag);
  10375. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  10376. ReleaseIntermediateOperand(sizeOp);
  10377. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10378. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  10379. IF (rightType IS SyntaxTree.StringType) THEN
  10380. CopyString(left,right);
  10381. 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
  10382. Designate(right,rightO);
  10383. Designate(left,leftO);
  10384. size := ToMemoryUnits(system,system.SizeOf(rightType));
  10385. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  10386. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10387. ELSE
  10388. HALT(201)
  10389. END;
  10390. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  10391. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  10392. Designate(right,rightO);
  10393. Designate(left,leftO);
  10394. size := ToMemoryUnits(system,system.SizeOf(rightType));
  10395. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  10396. MakeMemory(mem, rightO.op, leftO.op.type,0);
  10397. Emit(Mov(position, leftO.op, mem));
  10398. ReleaseIntermediateOperand(mem);
  10399. ELSE
  10400. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  10401. END;
  10402. ReleaseOperand(leftO); ReleaseOperand(rightO);
  10403. ELSE
  10404. AssignMathArray(left,right);
  10405. END;
  10406. ELSE
  10407. HALT(200);
  10408. END;
  10409. END Assign;
  10410. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  10411. BEGIN
  10412. IF Trace THEN TraceEnter("VisitAssignment") END;
  10413. Assign(x.left,x.right);
  10414. IF Trace THEN TraceExit("VisitAssignment") END;
  10415. END VisitAssignment;
  10416. PROCEDURE EmitCooperativeSwitch;
  10417. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  10418. BEGIN
  10419. ASSERT (cooperativeSwitches);
  10420. pc := section.pc;
  10421. IF lastSwitchPC = section.pc THEN RETURN END;
  10422. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  10423. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  10424. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  10425. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  10426. INC(statCoopSwitch, section.pc - pc);
  10427. END EmitCooperativeSwitch;
  10428. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  10429. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  10430. BEGIN
  10431. p0 := communication.left; p1 := communication.right;
  10432. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  10433. Evaluate(p0,s0);
  10434. Evaluate(p1,s1);
  10435. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  10436. Emit(Push(position,s0.op));
  10437. Emit(Push(position,s1.op));
  10438. (*
  10439. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10440. *)
  10441. IF ~backend.cellsAreObjects THEN
  10442. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  10443. END;
  10444. ReleaseOperand(s0);
  10445. ReleaseOperand(s1);
  10446. IF backend.cellsAreObjects THEN
  10447. CallThis(position,"ActiveCellsRuntime","Send",2);
  10448. ELSE
  10449. CallThis(position,ChannelModuleName,"Send",2);
  10450. END;
  10451. (* ----- RECEIVE ------*)
  10452. ELSE
  10453. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  10454. tmp := p0; p0 := p1; p1 := tmp;
  10455. END;
  10456. Evaluate(p0,s0);
  10457. Emit(Push(position,s0.op));
  10458. Designate(p1,s1);
  10459. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  10460. Emit(Push(position,s1.op));
  10461. (*
  10462. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  10463. *)
  10464. IF ~backend.cellsAreObjects THEN
  10465. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  10466. END;
  10467. ReleaseOperand(s0);
  10468. ReleaseOperand(s1);
  10469. IF backend.cellsAreObjects THEN
  10470. CallThis(position,"ActiveCellsRuntime","Receive",2);
  10471. ELSE
  10472. CallThis(position,ChannelModuleName,"Receive",2)
  10473. END;
  10474. END;
  10475. END VisitCommunicationStatement;
  10476. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  10477. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  10478. PROCEDURE IfPart(if: SyntaxTree.IfPart; last: BOOLEAN);
  10479. VAR false: Label; condition, value: BOOLEAN;
  10480. BEGIN
  10481. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  10482. IF condition THEN
  10483. false := NewLabel();
  10484. Condition(if.condition,false,FALSE);
  10485. StatementSequence(if.statements);
  10486. IF ~last OR (x.elsePart # NIL) THEN BrL(end) END;
  10487. SetLabel(false);
  10488. ELSE
  10489. IF value THEN (* always true *)
  10490. escape := TRUE;
  10491. StatementSequence(if.statements);
  10492. (* no branch necessary -- rest skipped *)
  10493. END;
  10494. END;
  10495. END IfPart;
  10496. BEGIN
  10497. IF Trace THEN TraceEnter("VisitIfStatement") END;
  10498. end := NewLabel();
  10499. elsifs := x.ElsifParts();
  10500. IfPart(x.ifPart,elsifs=0);
  10501. FOR i := 0 TO elsifs-1 DO
  10502. IF ~escape THEN
  10503. elsif := x.GetElsifPart(i);
  10504. IfPart(elsif, i=elsifs-1);
  10505. END;
  10506. END;
  10507. IF (x.elsePart # NIL) & ~escape THEN
  10508. StatementSequence(x.elsePart);
  10509. END;
  10510. SetLabel(end);
  10511. IF Trace THEN TraceExit("VisitIfStatement") END;
  10512. END VisitIfStatement;
  10513. PROCEDURE BrWithPart(CONST tag: IntermediateCode.Operand; x: SyntaxTree.WithPart; VAR trueL: Label);
  10514. VAR reg: IntermediateCode.Operand;
  10515. BEGIN
  10516. trueL := NewLabel();
  10517. IF backend.cooperative THEN
  10518. IntermediateCode.InitRegister(reg,tag.type,tag.registerClass, AcquireRegister(tag.type, tag.registerClass));
  10519. Emit(Mov(position,reg,tag));
  10520. TypeTest(reg, x.type, trueL, TRUE,TRUE);
  10521. ReleaseIntermediateOperand(reg);
  10522. ELSE
  10523. TypeTest(tag, x.type, trueL, TRUE,TRUE);
  10524. END;
  10525. END BrWithPart;
  10526. PROCEDURE EmitWithPart(x: SyntaxTree.WithPart);
  10527. BEGIN
  10528. StatementSequence(x.statements);
  10529. END EmitWithPart;
  10530. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  10531. VAR endL,elseL: Label;i: LONGINT; trueL: POINTER TO ARRAY OF Label; res: Operand; recordType: SyntaxTree.RecordType;
  10532. tag: IntermediateCode.Operand;
  10533. BEGIN
  10534. IF Trace THEN TraceEnter("VisitWithStatement") END;
  10535. endL := NewLabel();
  10536. elseL := NewLabel();
  10537. Designate(x.variable,res);
  10538. IF IsPointerToRecord(x.variable.type,recordType) THEN
  10539. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  10540. END;
  10541. ReuseCopy(tag, res.tag);
  10542. ReleaseOperand(res);
  10543. NEW(trueL, x.WithParts());
  10544. FOR i := 0 TO x.WithParts()-1 DO
  10545. BrWithPart(tag, x.GetWithPart(i), trueL[i]);
  10546. END;
  10547. ReleaseIntermediateOperand(tag);
  10548. BrL(elseL);
  10549. FOR i := 0 TO x.WithParts()-1 DO
  10550. SetLabel(trueL[i]);
  10551. EmitWithPart(x.GetWithPart(i));
  10552. BrL(endL);
  10553. END;
  10554. SetLabel(elseL);
  10555. IF x.elsePart = NIL THEN
  10556. IF ~isUnchecked THEN
  10557. EmitTrap(position,WithTrap);
  10558. END;
  10559. ELSE
  10560. StatementSequence(x.elsePart)
  10561. END;
  10562. SetLabel(endL);
  10563. IF Trace THEN TraceExit("VisitWithStatement") END;
  10564. END VisitWithStatement;
  10565. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  10566. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  10567. out,else: Label; label: Label;
  10568. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  10569. symbol: SyntaxTree.Symbol;
  10570. table: BOOLEAN;
  10571. BEGIN
  10572. (*! split case statement into if-elsif statements for large case label lists *)
  10573. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  10574. range := x.max-x.min+1;
  10575. IF (range < 0) OR (range > 1024) & (range DIV x.caseParts.Length() >10) THEN
  10576. (* if case table is larger than 1024 elements and only sparsely used, then do not employ a table *)
  10577. table := FALSE;
  10578. size := x.caseParts.Length();
  10579. ELSE
  10580. table := TRUE;
  10581. size := LONGINT(range);
  10582. END;
  10583. Evaluate(x.variable,var);
  10584. ReuseCopy(tmp,var.op);
  10585. ReleaseIntermediateOperand(var.op);
  10586. var.op := tmp;
  10587. (*
  10588. UniqueId(name,module.module,"case",caseId);
  10589. *)
  10590. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  10591. else := NewLabel();
  10592. IF table THEN
  10593. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  10594. Convert(var.op,addressType);
  10595. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  10596. ReuseCopy(res,var.op);
  10597. ReleaseOperand(var);
  10598. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  10599. Global.GetModuleSegmentedName(module.module, name);
  10600. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  10601. symbol := SyntaxTree.NewSymbol(name[1]);
  10602. symbol.SetScope(moduleScope);
  10603. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  10604. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  10605. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  10606. Emit(Add(position,res,res,jmp));
  10607. IntermediateCode.MakeMemory(res,addressType);
  10608. Emit(Br(position,res));
  10609. ReleaseIntermediateOperand(res);
  10610. ELSE
  10611. ReuseCopy(res,var.op); (* make sure it is in a register *)
  10612. ReleaseOperand(var);
  10613. BrltL(else,res,IntermediateCode.Immediate(res.type,x.min));
  10614. BrltL(else,IntermediateCode.Immediate(res.type,x.max),res);
  10615. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  10616. part := x.GetCasePart(i);
  10617. constant := part.firstConstant;
  10618. fixups[i] := NewLabel();
  10619. WHILE(constant # NIL) DO (* case labels for this case part *)
  10620. IF constant.min = constant.max THEN
  10621. BreqL(fixups[i], res,IntermediateCode.Immediate(res.type,constant.min));
  10622. ELSE
  10623. label := NewLabel();
  10624. BrltL(label, res, IntermediateCode.Immediate(res.type,constant.min));
  10625. BrltL(label, IntermediateCode.Immediate(res.type,constant.max),res);
  10626. BrL(fixups[i]);
  10627. SetLabel(label);
  10628. END;
  10629. constant := constant.next;
  10630. END;
  10631. END;
  10632. BrL(else);
  10633. ReleaseIntermediateOperand(res);
  10634. END;
  10635. out := NewLabel();
  10636. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  10637. part := x.GetCasePart(i);
  10638. constant := part.firstConstant;
  10639. IF table THEN
  10640. label := NewLabel();
  10641. SetLabel(label);
  10642. WHILE(constant # NIL) DO (* case labels for this case part *)
  10643. FOR j := constant.min TO constant.max DO
  10644. fixups[j-x.min] := label;
  10645. END;
  10646. constant := constant.next;
  10647. END;
  10648. ELSE
  10649. SetLabel(fixups[i]);
  10650. END;
  10651. StatementSequence(part.statements);
  10652. BrL(out);
  10653. END;
  10654. SetLabel(else);
  10655. FOR i := 0 TO size-1 DO
  10656. IF fixups[i] = NIL THEN
  10657. fixups[i] := else;
  10658. END;
  10659. END;
  10660. IF x.elsePart # NIL THEN
  10661. StatementSequence(x.elsePart);
  10662. ELSIF ~isUnchecked THEN
  10663. EmitTrap(position,CaseTrap);
  10664. END;
  10665. SetLabel(out);
  10666. IF table THEN
  10667. FOR i := 0 TO size-1 DO
  10668. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  10669. section.Emit(Data(position,op));
  10670. END;
  10671. END;
  10672. IF Trace THEN TraceExit("VisitCaseStatement") END;
  10673. END VisitCaseStatement;
  10674. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  10675. VAR startL,falseL: Label;
  10676. BEGIN
  10677. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  10678. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10679. startL := NewLabel();
  10680. falseL := NewLabel();
  10681. SetLabel(startL);
  10682. Condition(x.condition,falseL,FALSE);
  10683. StatementSequence(x.statements);
  10684. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10685. BrL(startL);
  10686. SetLabel(falseL);
  10687. IF Trace THEN TraceExit("VisitWhileStatement") END;
  10688. END VisitWhileStatement;
  10689. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  10690. VAR falseL: Label;
  10691. BEGIN
  10692. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  10693. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10694. falseL := NewLabel();
  10695. SetLabel(falseL);
  10696. StatementSequence(x.statements);
  10697. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10698. Condition(x.condition,falseL,FALSE);
  10699. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  10700. END VisitRepeatStatement;
  10701. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  10702. VAR
  10703. binary: SyntaxTree.BinaryExpression; startL,falseL : Label; cmp: LONGINT; by: HUGEINT;
  10704. temporaryVariable: SyntaxTree.Variable;
  10705. temporaryVariableDesignator : SyntaxTree.Designator;
  10706. BEGIN
  10707. IF Trace THEN TraceEnter("VisitForStatement") END;
  10708. falseL := NewLabel();
  10709. startL := NewLabel();
  10710. Assign(x.variable,x.from);
  10711. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  10712. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  10713. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  10714. Assign(temporaryVariableDesignator,x.to);
  10715. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  10716. IF by > 0 THEN
  10717. cmp := Scanner.LessEqual
  10718. ELSE
  10719. cmp := Scanner.GreaterEqual
  10720. END;
  10721. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  10722. binary.SetType(system.booleanType);
  10723. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10724. SetLabel(startL);
  10725. Condition(binary,falseL, FALSE);
  10726. StatementSequence(x.statements);
  10727. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  10728. binary.SetType(x.variable.type);
  10729. Assign(x.variable,binary);
  10730. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10731. BrL(startL);
  10732. SetLabel(falseL);
  10733. IF Trace THEN TraceExit("VisitForStatement") END;
  10734. END VisitForStatement;
  10735. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  10736. VAR prevLoop: Label;
  10737. BEGIN
  10738. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  10739. prevLoop := currentLoop;
  10740. currentLoop := NewLabel();
  10741. StatementSequence(x.statements);
  10742. SetLabel(currentLoop);
  10743. currentLoop := prevLoop;
  10744. IF Trace THEN TraceExit("VisitExitableBlock") END;
  10745. END VisitExitableBlock;
  10746. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  10747. VAR prevLoop,start: Label;
  10748. BEGIN
  10749. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  10750. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10751. start := NewLabel();
  10752. prevLoop := currentLoop;
  10753. SetLabel(start);
  10754. currentLoop := NewLabel();
  10755. StatementSequence(x.statements);
  10756. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  10757. BrL(start);
  10758. SetLabel(currentLoop);
  10759. currentLoop := prevLoop;
  10760. IF Trace THEN TraceExit("VisitLoopStatement") END;
  10761. END VisitLoopStatement;
  10762. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  10763. VAR outer: SyntaxTree.Statement;
  10764. BEGIN
  10765. IF Trace THEN TraceEnter("VisitExitStatement") END;
  10766. IF locked THEN (* r if we jump out of an exclusive block *)
  10767. outer := x.outer;
  10768. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  10769. outer := outer.outer;
  10770. END;
  10771. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  10772. Lock(FALSE);
  10773. END;
  10774. END;
  10775. BrL(currentLoop);
  10776. IF Trace THEN TraceExit("VisitExitStatement") END;
  10777. END VisitExitStatement;
  10778. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  10779. VAR
  10780. expression, parameterDesignator: SyntaxTree.Expression;
  10781. type, componentType: SyntaxTree.Type;
  10782. res, right: Operand;
  10783. left, mem, reg: IntermediateCode.Operand;
  10784. parameter: SyntaxTree.Parameter;
  10785. procedure: SyntaxTree.Procedure;
  10786. procedureType: SyntaxTree.ProcedureType;
  10787. returnTypeOffset: LONGINT;
  10788. delegate: BOOLEAN;
  10789. map: SymbolMap;
  10790. callingConvention, parametersSize: LONGINT;
  10791. BEGIN
  10792. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  10793. expression := x.returnValue;
  10794. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  10795. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10796. IF currentIsInline THEN
  10797. IF expression # NIL THEN
  10798. map := currentMapper.Get(NIL);
  10799. IF map # NIL THEN
  10800. Assign(map.to, expression);
  10801. ELSE
  10802. Evaluate(expression,res);
  10803. Emit(Return(position,res.op));
  10804. ReleaseOperand(res);
  10805. END;
  10806. END;
  10807. BrL(currentInlineExit);
  10808. RETURN;
  10809. END;
  10810. IF expression # NIL THEN
  10811. type := expression.type.resolved;
  10812. IF (expression IS SyntaxTree.ResultDesignator) THEN
  10813. IF locked THEN Lock(FALSE) END;
  10814. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10815. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10816. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  10817. 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
  10818. (* return without structured return parameter *)
  10819. Evaluate(expression,res);
  10820. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  10821. IF locked OR profile THEN
  10822. Emit(Push(position,res.op));
  10823. IF delegate THEN HALT(200) END;
  10824. ReleaseOperand(res);
  10825. IF locked THEN Lock(FALSE) END;
  10826. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10827. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10828. reg := NewRegisterOperand(res.op.type);
  10829. Emit(Pop(position,reg));
  10830. Emit(Return(position,reg));
  10831. ReleaseIntermediateOperand(reg);
  10832. ELSE
  10833. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10834. Emit(Return(position,res.op));
  10835. ReleaseOperand(res);
  10836. END;
  10837. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.StringType) OR type.IsPointer()
  10838. THEN
  10839. (* return using structured return parameter *)
  10840. 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)
  10841. OR (type IS SyntaxTree.StringType)
  10842. OR SemanticChecker.IsPointerType(type));
  10843. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  10844. parameter :=procedureType.returnParameter;
  10845. ASSERT(parameter # NIL);
  10846. returnTypeOffset := parameter.offsetInBits;
  10847. (*
  10848. IF parameter# NIL THEN
  10849. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  10850. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  10851. ELSE
  10852. returnTypeOffset := system.offsetFirstParameter
  10853. END;
  10854. *)
  10855. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  10856. IF type IS SyntaxTree.RangeType THEN
  10857. (* array range type *)
  10858. Evaluate(expression, right);
  10859. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  10860. Emit(Mov(position,mem, right.op)); (* first *)
  10861. ReleaseIntermediateOperand(mem);
  10862. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10863. Emit(Mov(position,mem, right.tag)); (* last *)
  10864. ReleaseIntermediateOperand(mem);
  10865. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  10866. Emit(Mov(position,mem, right.extra)); (* step *)
  10867. ReleaseIntermediateOperand(mem);
  10868. ReleaseOperand(right);
  10869. ELSIF type IS SyntaxTree.ComplexType THEN
  10870. Evaluate(expression, right);
  10871. componentType := type(SyntaxTree.ComplexType).componentType;
  10872. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  10873. Emit(Mov(position,mem, right.op)); (* real part *)
  10874. ReleaseIntermediateOperand(mem);
  10875. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  10876. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  10877. ReleaseIntermediateOperand(mem);
  10878. ReleaseOperand(right);
  10879. ELSE (* covers cases: pointer / record / array *)
  10880. parameter := procedureType.returnParameter;
  10881. checker.SetCurrentScope(currentScope);
  10882. ASSERT(parameter # NIL);
  10883. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10884. Assign(parameterDesignator,expression);
  10885. END;
  10886. ReleaseIntermediateOperand(left);
  10887. IF locked THEN Lock(FALSE) END;
  10888. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10889. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10890. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  10891. parameter := procedureType.returnParameter;
  10892. checker.SetCurrentScope(currentScope);
  10893. IF parameter = NIL THEN
  10894. Error(procedure.position, "structured return of parameter of procedure not found");
  10895. ELSE
  10896. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  10897. Assign(parameterDesignator,expression);
  10898. END;
  10899. IF locked THEN Lock(FALSE) END;
  10900. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10901. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10902. ELSE
  10903. HALT(200);
  10904. END;
  10905. ELSE
  10906. IF locked THEN Lock(FALSE) END;
  10907. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  10908. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  10909. END;
  10910. IF backend.cooperative THEN
  10911. BrL(exitLabel);
  10912. ELSE
  10913. callingConvention := procedureType.callingConvention;
  10914. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10915. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10916. ELSE
  10917. parametersSize := 0;
  10918. END;
  10919. EmitLeave(section, position,procedure, callingConvention);
  10920. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10921. END;
  10922. IF Trace THEN TraceExit("VisitReturnStatement") END;
  10923. END VisitReturnStatement;
  10924. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  10925. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  10926. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  10927. statements: SyntaxTree.StatementSequence;
  10928. name, suffix: SyntaxTree.IdentifierString;
  10929. BEGIN
  10930. Strings.IntToStr(awaitProcCounter,suffix);
  10931. Strings.Concat("@AwaitProcedure",suffix,name);
  10932. identifier := SyntaxTree.NewIdentifier(name);
  10933. INC(awaitProcCounter);
  10934. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  10935. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  10936. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  10937. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  10938. procedure.SetAccess(SyntaxTree.Hidden);
  10939. procedure.SetScope(currentScope);
  10940. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  10941. procedureType.SetReturnType(system.booleanType);
  10942. procedure.SetType(procedureType);
  10943. body := SyntaxTree.NewBody(x.position,procedureScope);
  10944. procedureScope.SetBody(body);
  10945. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  10946. returnStatement.SetReturnValue(x.condition);
  10947. statements := SyntaxTree.NewStatementSequence();
  10948. statements.AddStatement(returnStatement);
  10949. body.SetStatementSequence(statements);
  10950. currentScope.AddProcedure(procedure);
  10951. RETURN procedure
  10952. END MakeAwaitProcedure;
  10953. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  10954. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  10955. call: IntermediateCode.Operand; label, startL, trueL: Label; name: Basic.SegmentedName;
  10956. BEGIN
  10957. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  10958. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10959. IF backend.cooperative THEN
  10960. startL := NewLabel();
  10961. trueL := NewLabel();
  10962. SetLabel(startL);
  10963. Condition(x.condition,trueL,TRUE);
  10964. PushSelfPointer();
  10965. CallThis(position,"ExclusiveBlocks","Await",1);
  10966. BrL(startL);
  10967. SetLabel(trueL);
  10968. PushSelfPointer();
  10969. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10970. ELSE
  10971. proc := MakeAwaitProcedure(x);
  10972. Emit(Push(position,fp));
  10973. GetCodeSectionNameForSymbol(proc,name);
  10974. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10975. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10976. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10977. Emit(Call(position,call,ProcParametersSize(proc)));
  10978. Emit(Result(position,res));
  10979. (*
  10980. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10981. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10982. *)
  10983. InitOperand(result,ModeValue);
  10984. result.op := res;
  10985. label := NewLabel();
  10986. BreqL(label, result.op, SELF.true);
  10987. ReleaseOperand(result);
  10988. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10989. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10990. Emit(Push(position,res));
  10991. Emit(Push(position,fp));
  10992. PushSelfPointer();
  10993. Emit(Push(position,nil));
  10994. CallThis(position,"Objects","Await",4);
  10995. SetLabel(label);
  10996. END;
  10997. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10998. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  10999. END VisitAwaitStatement;
  11000. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  11001. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  11002. BEGIN
  11003. FOR i := 0 TO x.Length() - 1 DO
  11004. statement := x.GetStatement( i );
  11005. Statement(statement);
  11006. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  11007. END;
  11008. END StatementSequence;
  11009. PROCEDURE PushSelfPointer;
  11010. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  11011. procedureType: SyntaxTree.ProcedureType;
  11012. BEGIN
  11013. scope := currentScope;
  11014. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  11015. scope := scope.outerScope;
  11016. END;
  11017. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  11018. moduleSection := meta.ModuleSection();
  11019. IF backend.cooperative THEN
  11020. moduleOffset := 0;
  11021. ELSE
  11022. moduleOffset := moduleSection.pc;
  11023. END;
  11024. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  11025. ELSE
  11026. GetBaseRegister(op.op,currentScope,scope);
  11027. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11028. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11029. parametersSize := ProcParametersSize(procedure);
  11030. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  11031. IF backend.cooperative THEN
  11032. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  11033. END;
  11034. IntermediateCode.MakeMemory(op.op,addressType);
  11035. END;
  11036. Emit(Push(position,op.op));
  11037. ReleaseOperand(op);
  11038. END PushSelfPointer;
  11039. PROCEDURE Lock(lock: BOOLEAN);
  11040. BEGIN
  11041. IF Trace THEN TraceEnter("Lock") END;
  11042. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  11043. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  11044. ASSERT(modifyAssignmentCounter = 0);
  11045. IF dump # NIL THEN
  11046. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  11047. dump.Ln;dump.Update;
  11048. END;
  11049. PushSelfPointer;
  11050. IF backend.cooperative THEN
  11051. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  11052. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  11053. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  11054. END;
  11055. ELSE
  11056. Emit(Push(position,true));
  11057. IF lock THEN CallThis(position,"Objects","Lock",2)
  11058. ELSE CallThis(position,"Objects","Unlock",2);
  11059. END;
  11060. END;
  11061. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  11062. IF Trace THEN TraceExit("Lock") END;
  11063. END Lock;
  11064. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  11065. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  11066. BEGIN
  11067. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  11068. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  11069. previouslyUnchecked := isUnchecked;
  11070. isUnchecked := isUnchecked OR x.isUnchecked;
  11071. previouslyCooperativeSwitches := cooperativeSwitches;
  11072. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  11073. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  11074. IF x.statements # NIL THEN
  11075. StatementSequence(x.statements);
  11076. END;
  11077. IF (x IS SyntaxTree.Body) THEN
  11078. IF (x(SyntaxTree.Body).finally # NIL) THEN
  11079. section.SetFinally(section.pc);
  11080. StatementSequence(x(SyntaxTree.Body).finally)
  11081. ELSIF x.isExclusive THEN
  11082. end := NewLabel();
  11083. BrL(end);
  11084. section.SetFinally(section.pc);
  11085. Lock(FALSE);
  11086. EmitTrap(position,RethrowTrap);
  11087. SetLabel(end);
  11088. END;
  11089. END;
  11090. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  11091. isUnchecked := previouslyUnchecked;
  11092. cooperativeSwitches := previouslyCooperativeSwitches;
  11093. IF Trace THEN TraceExit("VisitStatementBlock") END;
  11094. END VisitStatementBlock;
  11095. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  11096. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  11097. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  11098. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  11099. procedure: SyntaxTree.Procedure;
  11100. map: SymbolMap;
  11101. callingConvention, parametersSize: LONGINT;
  11102. BEGIN
  11103. scope := currentScope;
  11104. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  11105. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11106. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11107. return := emptyOperand;
  11108. IF Trace THEN TraceEnter("VisitCode") END;
  11109. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  11110. NEW(in, x.inRules.Length());
  11111. FOR i := 0 TO LEN(in)-1 DO
  11112. statement := x.inRules.GetStatement(i);
  11113. WITH statement: SyntaxTree.Assignment DO
  11114. Evaluate(statement.right, operand);
  11115. result := operand.op;
  11116. NEW(str, 64);
  11117. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  11118. in[i] := result; IntermediateCode.SetString(in[i], str);
  11119. ReleaseIntermediateOperand(operand.tag);
  11120. END;
  11121. END;
  11122. ELSE in := NIL
  11123. END;
  11124. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  11125. NEW(out, x.outRules.Length());
  11126. FOR i := 0 TO LEN(out)-1 DO
  11127. statement := x.outRules.GetStatement(i);
  11128. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  11129. WITH statement:
  11130. SyntaxTree.Assignment DO
  11131. Designate(statement.left, operand);
  11132. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  11133. NEW(str, 64);
  11134. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  11135. out[i] := result; IntermediateCode.SetString(out[i], str);
  11136. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  11137. | SyntaxTree.ReturnStatement DO
  11138. NEW(str, 64);
  11139. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  11140. IF currentIsInline THEN
  11141. map := currentMapper.Get(NIL);
  11142. Designate(map.to, operand);
  11143. IF map.isAddress THEN
  11144. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  11145. ELSE
  11146. result := operand.op;
  11147. END;
  11148. (*! only if it does not fit into register
  11149. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  11150. *)
  11151. (*Evaluate(map.to, operand);*)
  11152. out[i] := result;
  11153. ELSE
  11154. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  11155. END;
  11156. IntermediateCode.SetString(out[i], str);
  11157. ReleaseIntermediateOperand(operand.tag);
  11158. return := out[i];
  11159. ELSE
  11160. END;
  11161. END;
  11162. ELSE out := NIL
  11163. END;
  11164. Emit(Asm(x.position,x.sourceCode, in, out));
  11165. IF in # NIL THEN
  11166. FOR i := 0 TO LEN(in)-1 DO
  11167. ReleaseIntermediateOperand(in[i]);
  11168. END;
  11169. END;
  11170. IF out # NIL THEN
  11171. FOR i := 0 TO LEN(out)-1 DO
  11172. WITH statement:
  11173. SyntaxTree.Assignment DO
  11174. ReleaseIntermediateOperand(out[i]);
  11175. |SyntaxTree.ReturnStatement DO
  11176. (* release happens below *)
  11177. ELSE
  11178. END;
  11179. statement := x.outRules.GetStatement(i);
  11180. END;
  11181. END;
  11182. IF return.mode # IntermediateCode.Undefined THEN
  11183. IF currentIsInline THEN
  11184. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  11185. Symbol(procedureType.returnParameter, par);
  11186. MakeMemory(mem, par.op, return.type, 0);
  11187. ReleaseOperand(par);
  11188. Emit(Mov(position, mem, return));
  11189. ReleaseIntermediateOperand(mem);
  11190. ELSE
  11191. Emit(Return(position,return));
  11192. END;
  11193. ReleaseIntermediateOperand(return);
  11194. IF currentIsInline THEN RETURN END;
  11195. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  11196. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  11197. parametersSize := ProcedureParametersSize(backend.system,procedure);
  11198. ELSE
  11199. parametersSize := 0;
  11200. END;
  11201. EmitLeave(section, position,procedure, callingConvention);
  11202. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  11203. END;
  11204. IF Trace THEN TraceExit("VisitCode") END;
  11205. END VisitCode;
  11206. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  11207. BEGIN
  11208. RETURN ProcedureParametersSize(system, procedure);
  11209. END ProcParametersSize;
  11210. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  11211. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  11212. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  11213. const, call: IntermediateCode.Operand;
  11214. parameterDesignator: SyntaxTree.Expression;
  11215. saved: RegisterEntry;
  11216. name: Basic.SegmentedName;
  11217. BEGIN
  11218. IF Trace THEN TraceEnter("ParameterCopies") END;
  11219. parameter := x.firstParameter;
  11220. WHILE parameter # NIL DO
  11221. IF parameter.kind = SyntaxTree.ValueParameter THEN
  11222. type := parameter.type.resolved;
  11223. IF IsOpenArray(type) THEN
  11224. VisitParameter(parameter);
  11225. op := result;
  11226. IF backend.cooperative & parameter.NeedsTrace() THEN
  11227. length := GetArrayLength(type, op.tag);
  11228. size := NewRegisterOperand(addressType);
  11229. base := ArrayBaseType(type);
  11230. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  11231. Emit(Mul(position, size, length, const));
  11232. dst := NewRegisterOperand (addressType);
  11233. Emit(Mov(position, dst, size));
  11234. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  11235. Emit(Sub(position,dst,sp,dst));
  11236. Emit(And(position,dst,dst,const));
  11237. Emit(Mov(position,sp,dst));
  11238. par := fp;
  11239. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  11240. IntermediateCode.InitImmediate(null, byteType, 0);
  11241. Emit(Fill(position, dst, size, null));
  11242. ReleaseIntermediateOperand(dst);
  11243. ReleaseIntermediateOperand(length);
  11244. SaveRegisters();ReleaseUsedRegisters(saved);
  11245. (* register dst has been freed before SaveRegisters already *)
  11246. base := ArrayBaseType(type);
  11247. (* assign method of open array *)
  11248. IF base.IsRecordType() THEN
  11249. Emit (Push(position, length));
  11250. Emit (Push(position, dst));
  11251. Emit (Push(position, op.op));
  11252. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  11253. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  11254. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  11255. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  11256. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  11257. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  11258. Emit (Push(position,length));
  11259. Emit (Push(position, dst));
  11260. Emit (Push(position, length));
  11261. Emit (Push(position, op.op));
  11262. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  11263. ELSE
  11264. Emit (Push(position, length));
  11265. Emit (Push(position, dst));
  11266. Emit (Push(position, length));
  11267. Emit (Push(position, op.op));
  11268. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  11269. ASSERT(ArrayBaseType(type).IsPointer());
  11270. END;
  11271. RestoreRegisters(saved);
  11272. ELSE
  11273. temp := GetDynamicSize(type,op.tag);
  11274. ReuseCopy(size,temp);
  11275. ReleaseIntermediateOperand(temp);
  11276. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  11277. Emit(Sub(position,size,sp,size));
  11278. Emit(And(position,size,size,const));
  11279. Emit(Mov(position,sp,size));
  11280. par := fp;
  11281. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  11282. ReleaseIntermediateOperand(size);
  11283. size := GetDynamicSize(type,op.tag);
  11284. END;
  11285. Emit(Copy(position,sp,op.op,size));
  11286. ReleaseIntermediateOperand(size);
  11287. ReleaseOperand(op);
  11288. IntermediateCode.MakeMemory(par,addressType);
  11289. Emit(Mov(position,par,sp));
  11290. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  11291. checker.SetCurrentScope(currentScope);
  11292. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  11293. Assign(parameterDesignator,parameterDesignator);
  11294. END;
  11295. END;
  11296. parameter := parameter.nextParameter;
  11297. END;
  11298. IF Trace THEN TraceExit("ParameterCopies") END;
  11299. END ParameterCopies;
  11300. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  11301. VAR x: SyntaxTree.Variable;
  11302. BEGIN
  11303. x := scope.firstVariable;
  11304. WHILE x # NIL DO
  11305. InitVariable(x,FALSE);
  11306. x := x.nextVariable;
  11307. END;
  11308. END InitVariables;
  11309. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  11310. BEGIN
  11311. IF (symbol # NIL) THEN
  11312. RETURN fingerPrinter.SymbolFP(symbol).public
  11313. ELSE
  11314. RETURN 0
  11315. END;
  11316. END GetFingerprint;
  11317. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  11318. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  11319. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  11320. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  11321. name: Basic.SegmentedName;
  11322. offset: LONGINT;
  11323. BEGIN
  11324. IF Trace THEN TraceEnter("Body") END;
  11325. ReleaseUsedRegisters(saved); (* just in case ... *)
  11326. section := ir;
  11327. exitLabel := NewLabel ();
  11328. IF moduleBody THEN moduleBodySection := section END;
  11329. IF ir.comments # NIL THEN
  11330. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  11331. commentPrintout.SingleStatement(TRUE);
  11332. dump := ir.comments;
  11333. ELSE
  11334. commentPrintout := NIL;
  11335. dump := NIL;
  11336. END;
  11337. prevScope := currentScope;
  11338. currentScope := scope;
  11339. lastSwitchPC := 0;
  11340. cooperativeSwitches := backend.cooperative;
  11341. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  11342. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11343. IF x # NIL THEN
  11344. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  11345. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  11346. IF moduleBody THEN
  11347. ProfilerInit();
  11348. ELSE
  11349. Basic.SegmentedNameToString(ir.name, string);
  11350. ProfilerAddProcedure(numberProcedures,string);
  11351. ProfilerEnterExit(numberProcedures,TRUE);
  11352. END;
  11353. END;
  11354. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  11355. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  11356. END;
  11357. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  11358. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  11359. cellScope := scope.outerScope(SyntaxTree.CellScope);
  11360. IF procedure = cellScope.bodyProcedure THEN
  11361. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  11362. StaticCallOperand(op, cellScope.constructor);
  11363. Emit(Call(position,op.op,0));
  11364. END;
  11365. END;
  11366. END;
  11367. InitVariables(scope);
  11368. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  11369. GetCodeSectionNameForSymbol(procedure, name);
  11370. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  11371. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  11372. IF ProtectModulesPointers THEN
  11373. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  11374. ELSE
  11375. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  11376. END;
  11377. IntermediateCode.SetOffset(right,offset); (* tag *)
  11378. IntermediateCode.InitMemory(left,addressType,fp,0);
  11379. Emit(Mov(position, left, right));
  11380. END;
  11381. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  11382. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  11383. ParameterCopies(procedureType);
  11384. IF x.code = NIL THEN
  11385. VisitStatementBlock(x);
  11386. ELSE
  11387. VisitCode(x.code)
  11388. END;
  11389. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  11390. IF ~backend.cooperative THEN
  11391. ProfilerEnterExit(numberProcedures,FALSE);
  11392. END;
  11393. INC(numberProcedures);
  11394. END;
  11395. END;
  11396. IF backend.cooperative THEN
  11397. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  11398. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  11399. END;
  11400. IF x # NIL THEN
  11401. SELF.position := x.position;
  11402. END;
  11403. EndBasicBlock;
  11404. CheckRegistersFree();
  11405. ASSERT(modifyAssignmentCounter = 0);
  11406. currentScope := prevScope;
  11407. IF Trace THEN TraceExit("Body") END;
  11408. END Body;
  11409. END ImplementationVisitor;
  11410. MetaDataGenerator=OBJECT
  11411. VAR
  11412. implementationVisitor: ImplementationVisitor;
  11413. declarationVisitor: DeclarationVisitor;
  11414. module: Sections.Module;
  11415. moduleName: ARRAY 128 OF CHAR;
  11416. moduleNamePool: Basic.HashTableInt;
  11417. moduleNamePoolSection: IntermediateCode.Section;
  11418. modulePointerSection: IntermediateCode.Section;
  11419. modulePointerSizePC: LONGINT;
  11420. modulePointerSectionOffset: LONGINT;
  11421. modulePointers: LONGINT;
  11422. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  11423. RecordBaseOffset: LONGINT;
  11424. MethodTableOffset: LONGINT; (* method table offset from zero *)
  11425. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  11426. TypeTags: LONGINT; (* type extension level support *)
  11427. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  11428. patchInfoPC: LONGINT;
  11429. patchCRC: LONGINT;
  11430. CONST
  11431. EmptyBlockOffset = 2;
  11432. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  11433. BEGIN
  11434. IF implementationVisitor.backend.cooperative THEN
  11435. TypeTags := MAX(LONGINT);
  11436. BaseTypesTableOffset := 0;
  11437. MethodTableOffset := 2;
  11438. TypeRecordBaseOffset := 0;
  11439. RecordBaseOffset := 0;
  11440. ELSIF simple THEN
  11441. TypeTags := 3; (* only 3 extensions allowed *)
  11442. BaseTypesTableOffset := 1;
  11443. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  11444. TypeRecordBaseOffset := 0;
  11445. RecordBaseOffset := 1;
  11446. ELSE
  11447. TypeTags := 16;
  11448. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  11449. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  11450. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  11451. (* change this when Heaps.HeapBlock is modified *)
  11452. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  11453. RecordBaseOffset := 8; (* addresses *)
  11454. ELSE
  11455. RecordBaseOffset := 9; (* addresses *)
  11456. END;
  11457. END;
  11458. SELF.simple := simple;
  11459. SELF.implementationVisitor := implementationVisitor;
  11460. SELF.declarationVisitor := declarationVisitor;
  11461. implementationVisitor.meta := SELF;
  11462. declarationVisitor.meta := SELF;
  11463. END InitMetaDataGenerator;
  11464. PROCEDURE SetModule(module: Sections.Module);
  11465. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  11466. BEGIN
  11467. SELF.module := module;
  11468. Global.GetModuleName(module.module,moduleName);
  11469. Global.GetSymbolSegmentedName(module.module, name);
  11470. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  11471. NEW(moduleNamePool, 32);
  11472. (*! require GC protection *)
  11473. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  11474. IF ProtectModulesPointers THEN
  11475. name := "Heaps.AnyPtr";
  11476. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11477. (* set base pointer *)
  11478. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  11479. END;
  11480. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  11481. modulePointers := 0;
  11482. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  11483. AddPointer(moduleNamePoolSection, namePoolOffset);
  11484. END;
  11485. END SetModule;
  11486. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  11487. BEGIN
  11488. IF ~implementationVisitor.backend.cooperative THEN
  11489. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  11490. INC(modulePointers);
  11491. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  11492. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  11493. END;
  11494. END AddPointer;
  11495. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  11496. BEGIN
  11497. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  11498. END GetTypeRecordBaseOffset;
  11499. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  11500. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  11501. BEGIN
  11502. (* change this when Heaps.HeapBlock is modified *)
  11503. INC(dataAdrOffset,7);
  11504. Info(section,"headerAdr");
  11505. Address(section,0);
  11506. Info(section,"typeDesc");
  11507. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  11508. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11509. NamedSymbol(section, name, symbol, 0, offset);
  11510. Info(section,"mark: LONGINT;");
  11511. Longint(section,-1);
  11512. Info(section,"refCount: LONGINT;");
  11513. Longint(section,0);
  11514. (*
  11515. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  11516. *)
  11517. Info(section,"dataAdr-: ADDRESS");
  11518. Symbol(section,section, dataAdrOffset,0);
  11519. Info(section,"size-: SIZE");
  11520. Address(section,0);
  11521. Info(section,"nextMark: HeapBlock;");
  11522. Address(section,0);
  11523. END HeapBlock;
  11524. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  11525. VAR i: LONGINT;
  11526. BEGIN
  11527. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  11528. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  11529. Info(section,"count*: LONGINT");
  11530. Longint(section,0);
  11531. Info(section,"locked*: BOOLEAN");
  11532. Longint(section,0);
  11533. Info(section,"awaitingLock*: ProcessQueue");
  11534. Address(section,0);
  11535. Address(section,0);
  11536. Info(section,"awaitingCond*: ProcessQueue");
  11537. Address(section,0);
  11538. Address(section,0);
  11539. Info(section,"lockedBy*: ANY");
  11540. Address(section,0);
  11541. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  11542. Longint(section,1);
  11543. FOR i := 2 TO 6 DO
  11544. Longint(section,0);
  11545. END;
  11546. Info(section,"lock*: ANY");
  11547. Address(section,0);
  11548. END ProtectedHeapBlock;
  11549. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  11550. BEGIN
  11551. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  11552. END Info;
  11553. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  11554. VAR op: IntermediateCode.Operand;
  11555. BEGIN
  11556. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  11557. section.Emit(Data(Basic.invalidPosition,op));
  11558. END Address;
  11559. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  11560. VAR op: IntermediateCode.Operand;
  11561. BEGIN
  11562. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  11563. section.Emit(Data(Basic.invalidPosition,op));
  11564. END Size;
  11565. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  11566. VAR op: IntermediateCode.Operand;
  11567. BEGIN
  11568. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  11569. section.Emit(Data(Basic.invalidPosition,op));
  11570. END Set;
  11571. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  11572. VAR op: IntermediateCode.Operand;
  11573. BEGIN
  11574. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  11575. section.Emit(Data(Basic.invalidPosition,op));
  11576. END Longint;
  11577. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  11578. VAR op,noOperand: IntermediateCode.Operand;
  11579. BEGIN
  11580. IntermediateCode.InitOperand(noOperand);
  11581. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  11582. section.PatchOperands(pc,op,noOperand,noOperand);
  11583. END PatchSize;
  11584. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  11585. VAR op,noOperand: IntermediateCode.Operand;
  11586. BEGIN
  11587. IntermediateCode.InitOperand(noOperand);
  11588. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  11589. section.PatchOperands(pc,op,noOperand,noOperand);
  11590. END PatchLongint;
  11591. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11592. VAR op, noOperand: IntermediateCode.Operand;
  11593. BEGIN
  11594. IntermediateCode.InitOperand(noOperand);
  11595. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11596. section.PatchOperands(pc,op,noOperand,noOperand);
  11597. END PatchSymbol;
  11598. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  11599. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  11600. BEGIN
  11601. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  11602. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  11603. section.Emit(Data(Basic.invalidPosition,op));
  11604. END Boolean;
  11605. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  11606. VAR op: IntermediateCode.Operand;
  11607. BEGIN
  11608. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  11609. section.Emit(Data(Basic.invalidPosition,op));
  11610. END Char;
  11611. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  11612. VAR i: LONGINT;
  11613. BEGIN
  11614. Info(section,str);
  11615. i := 0;
  11616. WHILE(str[i] # 0X) DO
  11617. Char(section,str[i]);
  11618. INC(i);
  11619. END;
  11620. Char(section,0X);
  11621. END String;
  11622. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  11623. VAR s: Basic.SectionName;
  11624. BEGIN
  11625. StringPool.GetString(str, s);
  11626. String(section, s);
  11627. END String0;
  11628. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11629. VAR op: IntermediateCode.Operand;
  11630. BEGIN
  11631. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11632. IntermediateCode.SetOffset(op,realOffset);
  11633. section.Emit(Data(Basic.invalidPosition,op));
  11634. END NamedSymbol;
  11635. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  11636. VAR op: IntermediateCode.Operand;
  11637. BEGIN
  11638. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  11639. IntermediateCode.SetOffset(op,realOffset);
  11640. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  11641. END NamedSymbolAt;
  11642. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  11643. BEGIN
  11644. IF symbol= NIL THEN
  11645. Address( section, realOffset);
  11646. ASSERT(virtualOffset = 0);
  11647. ELSE
  11648. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  11649. END;
  11650. END Symbol;
  11651. (* OutPointers delivers
  11652. {pointerOffset}
  11653. *)
  11654. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  11655. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  11656. BEGIN
  11657. type := type.resolved;
  11658. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  11659. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  11660. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11661. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  11662. Symbol(section, symbol, 0, offset); INC(numberPointers);
  11663. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  11664. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  11665. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  11666. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  11667. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  11668. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  11669. ELSIF (type IS SyntaxTree.RecordType) THEN
  11670. (* never treat a record like a pointer, even if the pointer field is set! *)
  11671. WITH type: SyntaxTree.RecordType DO
  11672. base := type.GetBaseRecord();
  11673. IF base # NIL THEN
  11674. Pointers(offset,symbol,section, base,numberPointers);
  11675. END;
  11676. variable := type.recordScope.firstVariable;
  11677. WHILE(variable # NIL) DO
  11678. IF ~(variable.untraced) THEN
  11679. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  11680. END;
  11681. variable := variable.nextVariable;
  11682. END;
  11683. END;
  11684. ELSIF (type IS SyntaxTree.CellType) THEN
  11685. WITH type: SyntaxTree.CellType DO
  11686. base := type.GetBaseRecord();
  11687. IF base # NIL THEN
  11688. Pointers(offset,symbol,section, base,numberPointers);
  11689. END;
  11690. variable := type.cellScope.firstVariable;
  11691. WHILE(variable # NIL) DO
  11692. IF ~(variable.untraced) THEN
  11693. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  11694. END;
  11695. variable := variable.nextVariable;
  11696. END;
  11697. property := type.firstProperty;
  11698. WHILE(property # NIL) DO
  11699. IF ~(property.untraced) THEN
  11700. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  11701. END;
  11702. property := property.nextProperty;
  11703. END;
  11704. parameter := type.firstParameter;
  11705. WHILE(parameter # NIL) DO
  11706. IF ~(parameter.untraced) THEN
  11707. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  11708. END;
  11709. parameter := parameter.nextParameter;
  11710. END;
  11711. END;
  11712. ELSIF (type IS SyntaxTree.ArrayType) THEN
  11713. WITH type: SyntaxTree.ArrayType DO
  11714. IF type.form= SyntaxTree.Static THEN
  11715. n := type.staticLength;
  11716. base := type.arrayBase.resolved;
  11717. WHILE(base IS SyntaxTree.ArrayType) DO
  11718. type := base(SyntaxTree.ArrayType);
  11719. n := n* type.staticLength;
  11720. base := type.arrayBase.resolved;
  11721. END;
  11722. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  11723. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  11724. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  11725. FOR i := 0 TO n-1 DO
  11726. Pointers(offset+i*size, symbol, section, base,numberPointers);
  11727. END;
  11728. END;
  11729. ELSE
  11730. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  11731. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11732. END;
  11733. END;
  11734. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  11735. WITH type: SyntaxTree.MathArrayType DO
  11736. IF type.form = SyntaxTree.Static THEN
  11737. n := type.staticLength;
  11738. base := type.arrayBase.resolved;
  11739. WHILE(base IS SyntaxTree.MathArrayType) DO
  11740. type := base(SyntaxTree.MathArrayType);
  11741. n := n* type.staticLength;
  11742. base := type.arrayBase.resolved;
  11743. END;
  11744. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  11745. IF SemanticChecker.ContainsPointer(base) THEN
  11746. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  11747. FOR i := 0 TO n-1 DO
  11748. Pointers(offset+i*size, symbol, section, base,numberPointers);
  11749. END;
  11750. END;
  11751. ELSE
  11752. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  11753. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  11754. END
  11755. END;
  11756. (* ELSE no pointers in type *)
  11757. END;
  11758. END Pointers;
  11759. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  11760. VAR position,i: LONGINT; ch: CHAR;
  11761. BEGIN
  11762. IF pool.Has(index) THEN
  11763. RETURN pool.GetInt(index)
  11764. ELSE
  11765. position := source.pc;
  11766. pool.PutInt(index, position);
  11767. Info(source, name);
  11768. i := 0;
  11769. REPEAT
  11770. ch := name[i]; INC(i);
  11771. Char( source, ch);
  11772. UNTIL ch = 0X;
  11773. END;
  11774. RETURN position;
  11775. END EnterDynamicName;
  11776. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  11777. VAR name: Basic.SectionName; position: LONGINT;
  11778. BEGIN
  11779. IF pool.Has(index) THEN
  11780. RETURN pool.GetInt(index)
  11781. ELSE
  11782. StringPool.GetString(index, name);
  11783. position := EnterDynamicName(source,name,index, pool);
  11784. END;
  11785. RETURN position;
  11786. END DynamicName;
  11787. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  11788. VAR section: IntermediateCode.Section;
  11789. BEGIN
  11790. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11791. IF implementationVisitor.backend.cooperative THEN
  11792. Info(section, "TypeDescriptor");
  11793. Basic.ToSegmentedName("BaseTypes.Array", name);
  11794. NamedSymbol(section, name,NIL, 0, 0);
  11795. BasePointer(section);
  11796. offset := 0;
  11797. ELSE
  11798. IF ProtectModulesPointers THEN
  11799. HeapBlock(mName,typeName,section,2);
  11800. END;
  11801. Info(section, "HeapBlock");
  11802. IF ProtectModulesPointers THEN
  11803. Symbol(section,section,2,0);
  11804. ELSE
  11805. Address(section,0);
  11806. END;
  11807. Info(section, "TypeDescriptor");
  11808. Address(section,0);
  11809. offset := section.pc;
  11810. END;
  11811. RETURN section
  11812. END NamedBlock;
  11813. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  11814. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  11815. BEGIN
  11816. COPY(moduleName,name);
  11817. Strings.Append(name,suffix);
  11818. Basic.ToSegmentedName(name, pooledName);
  11819. RETURN NamedBlock(mName, typeName, pooledName, offset);
  11820. END Block;
  11821. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  11822. VAR name: Basic.SegmentedName;
  11823. BEGIN
  11824. Info(source,"ArrayHeader");
  11825. IF implementationVisitor.backend.cooperative THEN
  11826. sizePC := source.pc;
  11827. Address(source,0);
  11828. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  11829. IF baseType # "" THEN
  11830. Basic.ToSegmentedName(baseType, name);
  11831. NamedSymbol(source, name,NIL, 0, 0);
  11832. ELSE
  11833. Address(source,0);
  11834. END;
  11835. Address(source,0);
  11836. ELSE
  11837. Address(source,0);
  11838. Address(source,0);
  11839. (* first pointer for GC *)
  11840. IF hasPointer THEN
  11841. (* points to first element in the array, this is NOT the base type descriptor *)
  11842. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  11843. ELSE
  11844. Address(source,0);
  11845. END;
  11846. sizePC := source.pc;
  11847. Address(source,0);
  11848. Info(source,"array data");
  11849. END;
  11850. END ArrayBlock;
  11851. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  11852. BEGIN
  11853. IF implementationVisitor.backend.cooperative THEN
  11854. PatchSize(section, pc, size);
  11855. PatchSize(section, pc + 3, size);
  11856. ELSE
  11857. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  11858. PatchSize(section, pc, size);
  11859. END;
  11860. END PatchArray;
  11861. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  11862. VAR
  11863. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  11864. sectionArray: POINTER TO ARRAY OF Sections.Section;
  11865. poolMap: Basic.HashTableInt;
  11866. namePool: IntermediateCode.Section;
  11867. namePoolOffset: LONGINT;
  11868. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  11869. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  11870. BEGIN
  11871. Basic.SegmentedNameToString(s1.name,n1);
  11872. Basic.SegmentedNameToString(s2.name,n2);
  11873. index := 0;
  11874. ch1 := n1[index];
  11875. ch2 := n2[index];
  11876. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  11877. INC(index);
  11878. ch1 := n1[index];
  11879. ch2 := n2[index];
  11880. END;
  11881. RETURN ch1 < ch2;
  11882. END Compare;
  11883. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  11884. VAR
  11885. i, j: LONGINT;
  11886. x, t: Sections.Section;
  11887. BEGIN
  11888. IF lo < hi THEN
  11889. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  11890. WHILE i <= j DO
  11891. WHILE Compare(list[i], x) DO INC(i) END;
  11892. WHILE Compare(x, list[j]) DO DEC(j) END;
  11893. IF i <= j THEN
  11894. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  11895. INC(i); DEC(j)
  11896. END
  11897. END;
  11898. IF lo < j THEN QuickSort(list, lo, j) END;
  11899. IF i < hi THEN QuickSort(list, i, hi) END
  11900. END;
  11901. END QuickSort;
  11902. (*
  11903. ExportDesc* = RECORD
  11904. fp*: ADDRESS;
  11905. name* {UNTRACED}: DynamicName;
  11906. adr*: ADDRESS;
  11907. exports*: LONGINT;
  11908. dsc* {UNTRACED}: ExportArray
  11909. END;
  11910. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  11911. *)
  11912. PROCEDURE ExportDesc2(
  11913. source: IntermediateCode.Section;
  11914. namePool: IntermediateCode.Section;
  11915. fingerPrinter: FingerPrinter.FingerPrinter;
  11916. symbol: Sections.Section;
  11917. name: StringPool.Index;
  11918. VAR patchAdr: LONGINT
  11919. ): BOOLEAN;
  11920. VAR fingerPrint: SyntaxTree.FingerPrint;
  11921. BEGIN
  11922. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  11923. & (symbol.type # Sections.InlineCodeSection)
  11924. THEN
  11925. *)
  11926. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  11927. & (symbol.type # Sections.ExitCodeSection)
  11928. & (symbol.type # Sections.InlineCodeSection))
  11929. THEN
  11930. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  11931. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  11932. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  11933. Longint(source,fingerPrint.public);
  11934. ELSE
  11935. Longint(source, 0);
  11936. END;
  11937. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  11938. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  11939. Symbol(source, symbol,0,0);
  11940. patchAdr := source.pc;
  11941. Longint(source, 0);
  11942. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11943. Address(source,0);
  11944. END;
  11945. RETURN TRUE
  11946. ELSE
  11947. RETURN FALSE
  11948. END;
  11949. END ExportDesc2;
  11950. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  11951. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  11952. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11953. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11954. nextPatch: LONGINT;
  11955. TYPE
  11956. Scope = RECORD
  11957. elements: LONGINT;
  11958. gelements: LONGINT;
  11959. section: IntermediateCode.Section;
  11960. patchAdr: LONGINT;
  11961. arraySizePC: LONGINT;
  11962. beginPC: LONGINT; (* current scope start pc *)
  11963. END;
  11964. BEGIN
  11965. Basic.InitSegmentedName(prev);
  11966. olevel := -1;
  11967. scopes[0].section := source;
  11968. scopes[0].arraySizePC := MIN(LONGINT);
  11969. FOR s := 0 TO LEN(sections)-1 DO
  11970. symbol := sections[s];
  11971. 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
  11972. this := sections[s].name;
  11973. level := 0;
  11974. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11975. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11976. INC(level);
  11977. END;
  11978. WHILE level < olevel DO
  11979. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11980. IF olevel > 0 THEN
  11981. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11982. nextPatch := scopes[olevel-1].patchAdr+1;
  11983. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11984. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11985. END;
  11986. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11987. DEC(olevel);
  11988. END;
  11989. IF (level < LEN(this)) & (this[level] > 0) THEN
  11990. IF level > olevel THEN
  11991. (*TRACE("opening",level); *)
  11992. IF scopes[level].section = NIL THEN
  11993. arrayName := ".@ExportArray";
  11994. Strings.AppendInt(arrayName, level);
  11995. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11996. AddPointer(scopes[level].section,offset);
  11997. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11998. END;
  11999. scopes[level].beginPC := scopes[level].section.pc;
  12000. olevel := level;
  12001. scopes[olevel].elements := 0;
  12002. END;
  12003. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  12004. sym := sections[s];
  12005. ELSE
  12006. sym := NIL;
  12007. END;
  12008. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  12009. THEN
  12010. INC(scopes[olevel].elements);
  12011. END;
  12012. (* enter string in scope *)
  12013. INC(level);
  12014. END;
  12015. END;
  12016. Basic.SegmentedNameToString(this, name);
  12017. prev := this;
  12018. END;
  12019. END;
  12020. WHILE 0 <= olevel DO
  12021. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  12022. IF olevel > 0 THEN
  12023. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  12024. nextPatch := scopes[olevel-1].patchAdr+1;
  12025. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  12026. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  12027. END;
  12028. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  12029. DEC(olevel);
  12030. END;
  12031. level := 0;
  12032. WHILE (level < LEN(scopes)) DO
  12033. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  12034. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  12035. END;
  12036. INC(level);
  12037. END;
  12038. END Export;
  12039. BEGIN
  12040. NEW(fingerPrinter);
  12041. NEW(poolMap, 64);
  12042. (* 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 *)
  12043. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  12044. NEW(sectionArray, module.allSections.Length());
  12045. FOR i := 0 TO module.allSections.Length() - 1 DO
  12046. section := module.allSections.GetSection(i);
  12047. sectionArray[i] := section;
  12048. END;
  12049. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  12050. Export(sectionArray^);
  12051. END ExportDesc;
  12052. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  12053. VAR
  12054. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  12055. BEGIN
  12056. Info(source, "exception table offsets array descriptor");
  12057. size := 0;
  12058. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  12059. Info(source, "exception table content");
  12060. FOR i := 0 TO module.allSections.Length() - 1 DO
  12061. p := module.allSections.GetSection(i);
  12062. IF p.type = Sections.CodeSection THEN
  12063. finallyPC := p(IntermediateCode.Section).finally;
  12064. IF finallyPC>=0 THEN
  12065. Symbol( source, p, 0,0);
  12066. Symbol( source, p, finallyPC, 0);
  12067. Symbol( source, p, finallyPC,0);
  12068. INC(size);
  12069. END;
  12070. END
  12071. END;
  12072. PatchArray(source,sizePC,size);
  12073. END ExceptionArray;
  12074. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  12075. VAR i: LONGINT; ch: CHAR;
  12076. BEGIN
  12077. i := 0;
  12078. REPEAT
  12079. ch := name[i]; INC(i);
  12080. Char( section, ch);
  12081. UNTIL ch = 0X;
  12082. WHILE i < 32 DO
  12083. Char( section, 0X); INC(i);
  12084. END;
  12085. END Name;
  12086. PROCEDURE References(section: IntermediateCode.Section);
  12087. CONST
  12088. sfTypeNone = 0X;
  12089. sfTypeCHAR = 01X;
  12090. sfTypeCHAR8 = 02X;
  12091. sfTypeCHAR16 = 03X;
  12092. sfTypeCHAR32 = 04X;
  12093. sfTypeRANGE = 05X;
  12094. sfTypeSHORTINT = 06X;
  12095. sfTypeINTEGER = 07X;
  12096. sfTypeLONGINT = 08X;
  12097. sfTypeHUGEINT = 09X;
  12098. sfTypeWORD = 0AX;
  12099. sfTypeLONGWORD = 0BX;
  12100. sfTypeSIGNED8 = 0CX;
  12101. sfTypeSIGNED16 = 0DX;
  12102. sfTypeSIGNED32 = 0EX;
  12103. sfTypeSIGNED64 = 0FX;
  12104. sfTypeUNSIGNED8 = 10X;
  12105. sfTypeUNSIGNED16 = 11X;
  12106. sfTypeUNSIGNED32 = 12X;
  12107. sfTypeUNSIGNED64 = 13X;
  12108. sfTypeREAL = 14X;
  12109. sfTypeLONGREAL = 15X;
  12110. sfTypeCOMPLEX = 16X;
  12111. sfTypeLONGCOMPLEX = 17X;
  12112. sfTypeBOOLEAN = 18X;
  12113. sfTypeSET = 19X;
  12114. sfTypeANY = 1AX;
  12115. sfTypeOBJECT = 1BX;
  12116. sfTypeBYTE = 1CX;
  12117. sfTypeADDRESS = 1DX;
  12118. sfTypeSIZE = 1EX;
  12119. sfTypeIndirect = 1FX;
  12120. sfTypeRecord = 20X;
  12121. sfTypePointerToRecord = 21X;
  12122. sfTypePointerToArray = 22X;
  12123. sfTypeOpenArray = 23X;
  12124. sfTypeStaticArray = 24X;
  12125. sfTypeDynamicArray = 25X;
  12126. sfTypeMathStaticArray = 26X;
  12127. sfTypeMathOpenArray = 27X;
  12128. sfTypeMathTensor = 28X;
  12129. sfTypeProcedure = 29X;
  12130. sfTypeDelegate = 2AX;
  12131. sfTypeENUM = 2BX;
  12132. (* sfTypeCELL = 2CX; *)
  12133. sfTypePORT = 2DX;
  12134. sfIN = 0X;
  12135. sfOUT = 1X;
  12136. flagDelegate = 0;
  12137. flagConstructor = 1;
  12138. (* variable / parameter addressing modes *)
  12139. sfAbsolute = 0X; (* global vars *)
  12140. sfRelative = 1X; (* variables, value parameters *)
  12141. sfIndirect = 2X; (* var parameters *)
  12142. sfScopeBegin = 0F0X;
  12143. sfScopeEnd = 0F1X;
  12144. sfProcedure = 0F2X;
  12145. sfVariable = 0F3X;
  12146. sfTypeDeclaration = 0F4X;
  12147. sfModule = 0FFX;
  12148. RefInfo = TRUE;
  12149. VAR
  12150. sizePC, startPC, lastOffset: LONGINT;
  12151. indirectTypes: Basic.HashTable;
  12152. PROCEDURE CurrentIndex(): LONGINT;
  12153. VAR i: LONGINT;
  12154. BEGIN
  12155. FOR i := startPC TO section.pc -1 DO
  12156. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  12157. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  12158. END;
  12159. startPC := section.pc;
  12160. RETURN lastOffset;
  12161. END CurrentIndex;
  12162. (*
  12163. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  12164. Module = sfModule prevSymbol:SIZE name:String Scope.
  12165. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  12166. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  12167. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  12168. Type =
  12169. sfTypePointerToRecord
  12170. | sfTypePointerToArray Type
  12171. | sfTypeOpenArray Type
  12172. | sfTypeDynamicArray Type
  12173. | sfTypeStaticArray length:SIZE Type
  12174. | sfTypeMathOpenArray Type
  12175. | sfTypeMathStaticArray length:SIZE Type
  12176. | sfTypeMathTensor Type
  12177. | sfTypeRecord tdAdr:ADDRESS
  12178. | sfTypeProcedure {Parameter} return:Type
  12179. | sfTypeDelegate {Parameter} return:Type
  12180. | sfTypePort (sfIN | sfOUT)
  12181. | sfTypeBOOLEAN
  12182. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  12183. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  12184. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  12185. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  12186. | sfTypeWORD | sfTypeLONGWORD
  12187. | sfTypeREAL | sfTypeLONGREAL
  12188. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  12189. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  12190. | sfTypeIndirect offset:SIZE.
  12191. *)
  12192. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  12193. VAR offset: SIZE;
  12194. BEGIN
  12195. IF indirectTypes.Has(type) THEN
  12196. offset := indirectTypes.GetInt(type);
  12197. Char(section, sfTypeIndirect);
  12198. Size(section, offset);
  12199. RETURN TRUE;
  12200. ELSE
  12201. indirectTypes.PutInt(type, CurrentIndex());
  12202. RETURN FALSE;
  12203. END;
  12204. END Indirect;
  12205. PROCEDURE NType(type: SyntaxTree.Type);
  12206. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  12207. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  12208. BEGIN
  12209. IF type = NIL THEN
  12210. Char(section, sfTypeNone)
  12211. ELSE
  12212. type := type.resolved;
  12213. size := type.sizeInBits;
  12214. WITH type:
  12215. SyntaxTree.PointerType DO
  12216. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  12217. IF RefInfo THEN Info(section,"PointerToRecord") END;
  12218. Char(section, sfTypePointerToRecord);
  12219. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  12220. ELSE
  12221. IF RefInfo THEN Info(section,"PointerToArray") END;
  12222. Char(section, sfTypePointerToArray);
  12223. NType(type.pointerBase);
  12224. END;
  12225. | SyntaxTree.ArrayType DO
  12226. IF ~Indirect(type) THEN
  12227. IF type.form = SyntaxTree.Open THEN
  12228. IF RefInfo THEN Info(section,"OpenArray") END;
  12229. Char(section, sfTypeOpenArray);
  12230. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  12231. IF RefInfo THEN Info(section,"DynamicArray") END;
  12232. Char(section, sfTypeDynamicArray);
  12233. ELSIF type.form = SyntaxTree.Static THEN
  12234. IF RefInfo THEN Info(section,"StaticArray") END;
  12235. Char(section, sfTypeStaticArray);
  12236. Size(section, type.staticLength);
  12237. ELSE
  12238. HALT(100);
  12239. END;
  12240. NType(type.arrayBase);
  12241. END;
  12242. | SyntaxTree.MathArrayType DO
  12243. IF ~Indirect(type) THEN
  12244. IF type.form = SyntaxTree.Open THEN
  12245. IF RefInfo THEN Info(section,"MathOpenArray") END;
  12246. Char(section, sfTypeMathOpenArray);
  12247. ELSIF type.form = SyntaxTree.Static THEN
  12248. IF RefInfo THEN Info(section,"MathStaticArray") END;
  12249. Char(section, sfTypeMathStaticArray);
  12250. Size(section, type.staticLength);
  12251. ELSIF type.form = SyntaxTree.Tensor THEN
  12252. IF RefInfo THEN Info(section,"MathTensor") END;
  12253. Char(section, sfTypeMathTensor);
  12254. ELSE
  12255. HALT(100);
  12256. END;
  12257. NType(type.arrayBase);
  12258. END;
  12259. | SyntaxTree.RecordType DO
  12260. IF ~Indirect(type) THEN
  12261. IF type.pointerType # NIL (* OBJECT *) THEN
  12262. IF RefInfo THEN Info(section,"PointerToRecord") END;
  12263. Char(section, sfTypePointerToRecord)
  12264. ELSE
  12265. IF RefInfo THEN Info(section,"Record") END;
  12266. Char(section, sfTypeRecord);
  12267. td := type.typeDeclaration;
  12268. IF RefInfo THEN Info(section,"TD") END;
  12269. IF (td # NIL) THEN
  12270. Global.GetSymbolSegmentedName(td,segmentedName);
  12271. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12272. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12273. ELSE
  12274. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12275. END;
  12276. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  12277. Symbol(section, tir, 0, offset);
  12278. ELSE
  12279. Address(section, 0);
  12280. END;
  12281. END;
  12282. END;
  12283. | SyntaxTree.CellType DO
  12284. IF ~Indirect(type) THEN
  12285. IF RefInfo THEN Info(section,"Record") END;
  12286. Char(section, sfTypeRecord);
  12287. td := type.typeDeclaration;
  12288. IF RefInfo THEN Info(section,"TD") END;
  12289. IF (td # NIL) THEN
  12290. Global.GetSymbolSegmentedName(td,segmentedName);
  12291. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12292. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12293. ELSE
  12294. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  12295. END;
  12296. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  12297. Symbol(section, tir, 0, offset);
  12298. ELSE
  12299. Address(section, 0);
  12300. END;
  12301. END;
  12302. | SyntaxTree.PortType DO
  12303. Char(section, sfTypePORT);
  12304. IF type.direction = SyntaxTree.OutPort THEN
  12305. Char(section, sfOUT)
  12306. ELSE
  12307. Char(section, sfIN)
  12308. END;
  12309. | SyntaxTree.ProcedureType DO
  12310. IF ~Indirect(type) THEN
  12311. IF type.isDelegate THEN
  12312. Char(section, sfTypeDelegate);
  12313. ELSE
  12314. Char(section, sfTypeProcedure);
  12315. END;
  12316. parameter := type.firstParameter;
  12317. WHILE(parameter # NIL) DO
  12318. NParameter(parameter, -1);
  12319. parameter := parameter.nextParameter;
  12320. END;
  12321. NType(type.returnType);
  12322. END;
  12323. | SyntaxTree.EnumerationType DO
  12324. Char(section, sfTypeENUM);
  12325. | SyntaxTree.BasicType DO
  12326. WITH type:
  12327. SyntaxTree.BooleanType DO
  12328. IF RefInfo THEN Info(section,"Boolean") END;
  12329. Char(section, sfTypeBOOLEAN);
  12330. | SyntaxTree.CharacterType DO
  12331. IF type = module.system.characterType THEN
  12332. IF RefInfo THEN Info(section,"CHAR") END;
  12333. Char(section, sfTypeCHAR);
  12334. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  12335. IF RefInfo THEN Info(section,"CHAR8") END;
  12336. Char(section, sfTypeCHAR8)
  12337. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  12338. IF RefInfo THEN Info(section,"CHAR16") END;
  12339. Char(section, sfTypeCHAR16);
  12340. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  12341. IF RefInfo THEN Info(section,"CHAR32") END;
  12342. Char(section, sfTypeCHAR32);
  12343. ELSE
  12344. HALT(100);
  12345. END;
  12346. |SyntaxTree.IntegerType DO
  12347. IF type(SyntaxTree.IntegerType).signed THEN
  12348. IF (type = module.system.shortintType) THEN
  12349. IF RefInfo THEN Info(section,"SHORTINT") END;
  12350. Char(section, sfTypeSHORTINT)
  12351. ELSIF (type = module.system.integerType) THEN
  12352. IF RefInfo THEN Info(section,"INTEGER") END;
  12353. Char(section, sfTypeINTEGER)
  12354. ELSIF (type = module.system.longintType) THEN
  12355. IF RefInfo THEN Info(section,"LONGINT") END;
  12356. Char(section, sfTypeLONGINT)
  12357. ELSIF (type = module.system.hugeintType) THEN
  12358. IF RefInfo THEN Info(section,"HUGEINT") END;
  12359. Char(section, sfTypeHUGEINT)
  12360. ELSIF (type = module.system.wordType) THEN
  12361. IF RefInfo THEN Info(section,"WORD") END;
  12362. Char(section, sfTypeWORD)
  12363. ELSIF (type = module.system.longWordType) THEN
  12364. IF RefInfo THEN Info(section,"LONGWORD") END;
  12365. Char(section, sfTypeLONGWORD);
  12366. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  12367. IF RefInfo THEN Info(section,"SIGNED8") END;
  12368. Char(section, sfTypeSIGNED8)
  12369. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  12370. IF RefInfo THEN Info(section,"SIGNED16") END;
  12371. Char(section, sfTypeSIGNED16)
  12372. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  12373. IF RefInfo THEN Info(section,"SIGNED32") END;
  12374. Char(section, sfTypeSIGNED32)
  12375. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  12376. IF RefInfo THEN Info(section,"SIGNED64") END;
  12377. Char(section, sfTypeSIGNED64)
  12378. ELSE
  12379. HALT(100);
  12380. END
  12381. ELSE (* unsigned *)
  12382. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  12383. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  12384. Char(section, sfTypeUNSIGNED8)
  12385. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  12386. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  12387. Char(section, sfTypeUNSIGNED16)
  12388. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  12389. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  12390. Char(section, sfTypeUNSIGNED32)
  12391. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  12392. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  12393. Char(section, sfTypeUNSIGNED64)
  12394. ELSE
  12395. HALT(100)
  12396. END
  12397. END;
  12398. | SyntaxTree.FloatType DO
  12399. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  12400. IF RefInfo THEN Info(section,"REAL") END;
  12401. Char(section, sfTypeREAL);
  12402. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  12403. IF RefInfo THEN Info(section,"LONGREAL") END;
  12404. Char(section, sfTypeLONGREAL);
  12405. ELSE
  12406. HALT(100);
  12407. END;
  12408. | SyntaxTree.ComplexType DO
  12409. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  12410. IF RefInfo THEN Info(section,"COMPLEX") END;
  12411. Char(section, sfTypeCOMPLEX);
  12412. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  12413. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  12414. Char(section, sfTypeLONGCOMPLEX);
  12415. ELSE
  12416. HALT(100);
  12417. END;
  12418. |SyntaxTree.SetType DO
  12419. IF RefInfo THEN Info(section,"SET") END;
  12420. Char(section, sfTypeSET);
  12421. |SyntaxTree.AnyType DO
  12422. IF RefInfo THEN Info(section,"ANY") END;
  12423. Char(section, sfTypeANY);
  12424. |SyntaxTree.ObjectType DO
  12425. IF RefInfo THEN Info(section,"OBJECT") END;
  12426. Char(section, sfTypeOBJECT);
  12427. |SyntaxTree.ByteType DO
  12428. IF RefInfo THEN Info(section,"BYTE") END;
  12429. Char(section, sfTypeBYTE);
  12430. |SyntaxTree.RangeType DO
  12431. IF RefInfo THEN Info(section,"RANGE") END;
  12432. Char(section, sfTypeRANGE)
  12433. |SyntaxTree.AddressType DO
  12434. IF RefInfo THEN Info(section,"ADDRESS") END;
  12435. Char(section, sfTypeADDRESS)
  12436. |SyntaxTree.SizeType DO
  12437. IF RefInfo THEN Info(section,"SIZE") END;
  12438. Char(section, sfTypeSIZE)
  12439. ELSE
  12440. HALT(100)
  12441. END;
  12442. ELSE HALT(101);
  12443. END;
  12444. END;
  12445. END NType;
  12446. (*
  12447. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  12448. *)
  12449. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  12450. VAR type: SyntaxTree.Type;
  12451. BEGIN
  12452. IF RefInfo THEN Info(section, "Parameter") END;
  12453. Char(section, sfVariable);
  12454. Size(section, procOffset);
  12455. String0(section, parameter.name);
  12456. type := parameter.type.resolved;
  12457. IF parameter.kind = SyntaxTree.VarParameter THEN
  12458. IF IsOpenArray(type) THEN Char(section, sfRelative)
  12459. ELSE Char(section, sfIndirect)
  12460. END;
  12461. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12462. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  12463. Char(section, sfIndirect);
  12464. ELSE
  12465. Char(section, sfRelative);
  12466. END;
  12467. ELSE
  12468. Char(section, sfRelative);
  12469. END;
  12470. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  12471. NType(parameter.type);
  12472. END NParameter;
  12473. (*
  12474. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  12475. *)
  12476. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  12477. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  12478. flags: SET;
  12479. BEGIN
  12480. IF procedure.externalName # NIL THEN RETURN END;
  12481. IF RefInfo THEN Info(section, "Procedure") END;
  12482. pos := CurrentIndex();
  12483. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  12484. Char(section, sfProcedure);
  12485. Size(section, scopeOffset);
  12486. String0(section,procedure.name);
  12487. s := module.allSections.FindBySymbol(procedure);
  12488. Symbol(section,s,0,0); (* start *)
  12489. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  12490. flags := {};
  12491. IF procedureType.isDelegate THEN
  12492. INCL(flags, flagDelegate);
  12493. END;
  12494. IF procedure.isConstructor THEN
  12495. INCL(flags, flagConstructor);
  12496. END;
  12497. Set(section, flags);
  12498. IF RefInfo THEN Info(section, "Parameters") END;
  12499. parameter := procedureType.firstParameter;
  12500. WHILE(parameter # NIL) DO
  12501. NParameter(parameter, pos);
  12502. parameter := parameter.nextParameter;
  12503. END;
  12504. IF procedureType.returnParameter # NIL THEN
  12505. NParameter(procedureType.returnParameter, pos);
  12506. END;
  12507. IF procedureType.selfParameter # NIL THEN
  12508. NParameter(procedureType.selfParameter, pos);
  12509. END;
  12510. IF RefInfo THEN Info(section, "ReturnType") END;
  12511. NType(procedureType.returnType);
  12512. NScope(procedure.procedureScope, pos);
  12513. END NProcedure;
  12514. (*
  12515. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  12516. *)
  12517. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  12518. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  12519. BEGIN
  12520. IF RefInfo THEN Info(section, "Variable") END;
  12521. pos := CurrentIndex();
  12522. Char(section, sfVariable);
  12523. Size(section, scopeOffset);
  12524. String0(section, variable.name);
  12525. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  12526. Char(section, sfAbsolute);
  12527. IF variable.externalName # NIL THEN
  12528. sn := variable.externalName^;
  12529. NamedSymbol(section, sn,NIL, 0,0);
  12530. ELSE
  12531. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  12532. NamedSymbol(section, sn,variable, 0,0);
  12533. END;
  12534. ELSE
  12535. Char(section, sfRelative);
  12536. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  12537. END;
  12538. NType(variable.type);
  12539. s := module.allSections.FindBySymbol(variable);
  12540. END NVariable;
  12541. (*
  12542. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  12543. *)
  12544. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  12545. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  12546. BEGIN
  12547. IF typeDeclaration = NIL THEN RETURN END;
  12548. pos := CurrentIndex();
  12549. s := module.allSections.FindBySymbol(typeDeclaration);
  12550. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  12551. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  12552. Char(section, sfTypeDeclaration);
  12553. Size(section, scopeOffset);
  12554. String0(section, typeDeclaration.name);
  12555. declared := typeDeclaration.declaredType.resolved;
  12556. IF (declared IS SyntaxTree.PointerType) THEN
  12557. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  12558. END;
  12559. WITH declared:
  12560. SyntaxTree.RecordType DO
  12561. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  12562. Symbol(section, s, 0, offset);
  12563. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12564. Basic.AppendToSegmentedName(name,".@Info");
  12565. s := module.allSections.FindByName(name);
  12566. IF s # NIL THEN (* does not work for coop *)
  12567. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  12568. END;
  12569. NScope(declared.recordScope, pos);
  12570. |SyntaxTree.CellType DO
  12571. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  12572. Symbol(section, s, 0, offset);
  12573. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12574. Basic.AppendToSegmentedName(name,".@Info");
  12575. s := module.allSections.FindByName(name);
  12576. IF s # NIL THEN
  12577. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  12578. END;
  12579. NScope(declared.cellScope, pos);
  12580. ELSE
  12581. Address(section, 0);
  12582. END;
  12583. END NTypeDeclaration;
  12584. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  12585. VAR pos: LONGINT;
  12586. BEGIN
  12587. pos := CurrentIndex();
  12588. Char(section,sfModule);
  12589. Size(section, prevSymbol);
  12590. String0(section, module.name);
  12591. NScope(module.moduleScope, pos);
  12592. END NModule;
  12593. (*
  12594. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  12595. *)
  12596. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  12597. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  12598. BEGIN
  12599. IF scope = NIL THEN RETURN END;
  12600. IF RefInfo THEN Info(section, "Scope") END;
  12601. Char(section, sfScopeBegin);
  12602. variable := scope.firstVariable;
  12603. WHILE (variable # NIL) DO
  12604. NVariable(variable, prevSymbol);
  12605. variable := variable.nextVariable;
  12606. END;
  12607. WITH scope:
  12608. SyntaxTree.ModuleScope DO
  12609. bodyProcedure := scope.bodyProcedure;
  12610. |SyntaxTree.RecordScope DO
  12611. bodyProcedure := scope.bodyProcedure;
  12612. ELSE
  12613. bodyProcedure := NIL;
  12614. END;
  12615. IF bodyProcedure # NIL THEN
  12616. NProcedure(bodyProcedure, prevSymbol)
  12617. END;
  12618. procedure := scope.firstProcedure;
  12619. WHILE procedure # NIL DO
  12620. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  12621. procedure := procedure.nextProcedure;
  12622. END;
  12623. typeDeclaration := scope.firstTypeDeclaration;
  12624. WHILE typeDeclaration # NIL DO
  12625. NTypeDeclaration(typeDeclaration, prevSymbol);
  12626. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  12627. END;
  12628. Char(section, sfScopeEnd); (* scope ends *)
  12629. END NScope;
  12630. BEGIN
  12631. NEW(indirectTypes, 32);
  12632. ArrayBlock(section,sizePC,"", FALSE);
  12633. startPC := section.pc;
  12634. NModule(module.module, -1);
  12635. PatchArray(section,sizePC,CurrentIndex());
  12636. END References;
  12637. (*
  12638. Command* = RECORD
  12639. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  12640. name*: Name; (* name of the procedure *)
  12641. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  12642. entryAdr* : ADDRESS; (* entry address of procedure *)
  12643. END;
  12644. *)
  12645. PROCEDURE CommandArray(source: IntermediateCode.Section);
  12646. VAR
  12647. p: Sections.Section; sizePC, numberCommands: LONGINT;
  12648. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  12649. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  12650. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  12651. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  12652. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  12653. BEGIN
  12654. RETURN
  12655. (type = NIL) OR
  12656. (type.resolved IS SyntaxTree.RecordType) OR
  12657. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  12658. (type.resolved IS SyntaxTree.AnyType);
  12659. END TypeAllowed;
  12660. BEGIN
  12661. numberParameters := procedureType.numberParameters;
  12662. RETURN
  12663. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  12664. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  12665. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  12666. END GetProcedureAllowed;
  12667. PROCEDURE WriteType(type : SyntaxTree.Type);
  12668. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  12669. name: Basic.SegmentedName; offset: LONGINT;
  12670. BEGIN
  12671. IF type = NIL THEN
  12672. Address(source,0);
  12673. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  12674. Address(source,1);
  12675. ELSE
  12676. type := type.resolved;
  12677. IF type IS SyntaxTree.PointerType THEN
  12678. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  12679. END;
  12680. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  12681. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  12682. name[0] := typeDeclaration.name; name[1] := -1;
  12683. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  12684. ASSERT(section # NIL);
  12685. ELSE
  12686. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12687. (* TODO *)
  12688. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  12689. END;
  12690. IF implementationVisitor.backend.cooperative THEN
  12691. offset := 0;
  12692. ELSE
  12693. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  12694. END;
  12695. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  12696. END;
  12697. END WriteType;
  12698. BEGIN
  12699. Info(source, "command array descriptor");
  12700. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  12701. numberCommands := 0;
  12702. Info(source, "command array content");
  12703. FOR i := 0 TO module.allSections.Length() - 1 DO
  12704. p := module.allSections.GetSection(i);
  12705. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  12706. procedure := p.symbol(SyntaxTree.Procedure);
  12707. procedureType := procedure.type(SyntaxTree.ProcedureType);
  12708. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  12709. procedure.GetName(name);
  12710. Name(source,name);
  12711. numberParameters := procedureType.numberParameters;
  12712. (* offset of type of first parameter *)
  12713. IF (numberParameters = 0 ) THEN WriteType(NIL)
  12714. ELSE WriteType(procedureType.firstParameter.type)
  12715. END;
  12716. (* offset of type of return parameter *)
  12717. WriteType(procedureType.returnType);
  12718. (* command name *)
  12719. (* command code offset *)
  12720. Symbol(source,p,0,0);
  12721. INC(numberCommands);
  12722. IF Trace THEN
  12723. D.Ln;
  12724. END;
  12725. END;
  12726. END
  12727. END;
  12728. PatchArray(source,sizePC,numberCommands);
  12729. END CommandArray;
  12730. (* to prevent from double import of different module aliases *)
  12731. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  12732. VAR i: SyntaxTree.Import;
  12733. BEGIN
  12734. i := module.module.moduleScope.firstImport;
  12735. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  12736. i := i.nextImport;
  12737. END;
  12738. RETURN i = import
  12739. END IsFirstDirectOccurence;
  12740. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  12741. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  12742. BEGIN
  12743. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  12744. ArrayBlock(source,pc,"", FALSE);
  12745. Info(source, "import module array data");
  12746. IF implementationVisitor.backend.cooperative THEN
  12747. offset := 0;
  12748. ELSE
  12749. IF module.system.addressType.sizeInBits = 64 THEN
  12750. (* change this when Heaps.HeapBlock is modified *)
  12751. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  12752. ELSE
  12753. (* change this when Heaps.HeapBlock is modified *)
  12754. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  12755. END;
  12756. END;
  12757. import := module.module.moduleScope.firstImport;
  12758. numberImports := 0;
  12759. WHILE import # NIL DO
  12760. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  12761. Global.GetModuleSegmentedName(import.module,name);
  12762. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  12763. NamedSymbol(source, name, NIL, 0, offset);
  12764. INC(numberImports);
  12765. END;
  12766. import := import.nextImport
  12767. END;
  12768. PatchArray(source,pc,numberImports);
  12769. END ImportsArray;
  12770. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  12771. VAR
  12772. p: Sections.Section; sizePC, size, i: LONGINT;
  12773. BEGIN
  12774. Info(source, "Type info section");
  12775. size := 0;
  12776. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  12777. FOR i := 0 TO module.allSections.Length() - 1 DO
  12778. p := module.allSections.GetSection(i);
  12779. WITH p: IntermediateCode.Section DO
  12780. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  12781. Symbol(source,p,EmptyBlockOffset,0);
  12782. INC(size);
  12783. END;
  12784. END
  12785. END;
  12786. PatchArray(source,sizePC,size);
  12787. END TypeInfoSection;
  12788. (*
  12789. ProcTableEntry* = RECORD
  12790. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  12791. noPtr*: LONGINT;
  12792. END;
  12793. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  12794. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  12795. *)
  12796. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  12797. VAR
  12798. numberPointers: LONGINT;
  12799. procedure: SyntaxTree.Procedure;
  12800. BEGIN
  12801. Info(section,"pcFrom");
  12802. Symbol(section,procedureSection,0,0);
  12803. Info(section,"pcTo");
  12804. Symbol(section, procedureSection, procedureSection.pc, 0);
  12805. Info(section,"pointer to offsets array");
  12806. Symbol(section, section,section.pc+1,0);
  12807. Info(section,"offsets array");
  12808. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  12809. PointerArray(section, procedure.procedureScope, numberPointers);
  12810. END ProcedureDescriptor;
  12811. (* only for tracing, the descriptor is otherwise not complete ! *)
  12812. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  12813. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  12814. BEGIN
  12815. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  12816. name := procedureSection.name;
  12817. Basic.AppendToSegmentedName(name,".@Info");
  12818. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12819. Address(section,0);
  12820. Symbol(section,section,2,0);
  12821. (*
  12822. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  12823. descSize: SIZE;
  12824. sentinel: ADDRESS; (* = MPO-4 *)
  12825. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12826. flags*: SET;
  12827. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12828. name*: Name;
  12829. END;
  12830. *)
  12831. Size(section, 0);
  12832. Address(section,0);
  12833. Address(section,0);
  12834. Set(section,{});
  12835. moduleSection := ModuleSection();
  12836. Symbol( section, moduleSection, moduleSection.pc,0);
  12837. IF procedureSection.symbol = NIL THEN
  12838. Basic.SegmentedNameToString(procedureSection.name, infoName);
  12839. ELSE
  12840. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  12841. END;
  12842. Name(section, infoName);
  12843. Size(section, 0);
  12844. RETURN section;
  12845. END MakeProcedureDescriptorTag;
  12846. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  12847. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  12848. BEGIN
  12849. name := procedureSection.name;
  12850. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  12851. IF implementationVisitor.backend.cooperative THEN
  12852. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12853. Info(section, "TypeDescriptor");
  12854. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  12855. NamedSymbol(dest, name,NIL, 0, 0);
  12856. BaseRecord(dest);
  12857. offset := 0;
  12858. ELSIF CreateProcedureDescInfo THEN
  12859. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  12860. Address(dest,0);
  12861. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  12862. offset := dest.pc;
  12863. ELSE
  12864. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  12865. END;
  12866. ProcedureDescriptor(dest, procedureSection);
  12867. Symbol(section, dest, offset, 0);
  12868. END ProcedureDescriptorPointer;
  12869. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  12870. VAR sizePC, i: LONGINT; destination: Sections.Section;
  12871. BEGIN
  12872. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  12873. numberProcs := 0;
  12874. FOR i := 0 TO module.allSections.Length() - 1 DO
  12875. destination := module.allSections.GetSection(i);
  12876. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  12877. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  12878. INC(numberProcs);
  12879. END
  12880. END;
  12881. PatchArray(section, sizePC, numberProcs);
  12882. END ProcedureDescriptorArray;
  12883. (*
  12884. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  12885. VAR
  12886. next*: Module; (** once a module is published, all fields are read-only *)
  12887. name*: Name;
  12888. init, published: BOOLEAN;
  12889. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  12890. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  12891. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  12892. command*: POINTER TO ARRAY OF Command;
  12893. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  12894. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  12895. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  12896. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  12897. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  12898. data*, code*: Bytes;
  12899. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  12900. export*: ExportDesc;
  12901. term*: TerminationHandler;
  12902. exTable*: ExceptionTable;
  12903. noProcs*: LONGINT;
  12904. firstProc*: ADDRESS; <- done by loader
  12905. maxPtrs*: LONGINT;
  12906. crc*: LONGINT;
  12907. *)
  12908. PROCEDURE BasePointer (section: IntermediateCode.Section);
  12909. BEGIN
  12910. Info(section, "cycle");
  12911. Size(section,0);
  12912. Info(section, "references");
  12913. Size(section,0);
  12914. Info(section, "nextMarked");
  12915. Address(section,0);
  12916. Info(section, "nextWatched");
  12917. Address(section,0);
  12918. END BasePointer;
  12919. PROCEDURE BaseObject (section: IntermediateCode.Section);
  12920. BEGIN
  12921. BasePointer(section);
  12922. Info(section, "action");
  12923. Address(section,0);
  12924. Info(section, "monitor");
  12925. Address(section,0);
  12926. END BaseObject;
  12927. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  12928. BEGIN
  12929. BasePointer(section);
  12930. Info(section, "action");
  12931. Address(section,0);
  12932. Info(section, "monitor");
  12933. Address(section,0);
  12934. END BaseRecord;
  12935. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  12936. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  12937. pooledName: Basic.SegmentedName;
  12938. symbol: SyntaxTree.Symbol;
  12939. BEGIN
  12940. Global.GetModuleName(module.module,name);
  12941. Strings.Append(name,".@Module.@Descriptor");
  12942. Basic.ToSegmentedName(name, pooledName);
  12943. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12944. Symbol(section,descriptorSection,0,0);
  12945. Info(descriptorSection, "descriptor");
  12946. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12947. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  12948. Address(descriptorSection,0);
  12949. Global.GetModuleName(module.module,name);
  12950. Strings.Append(name,".@Trace");
  12951. Basic.ToSegmentedName(name, pooledName);
  12952. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12953. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  12954. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  12955. END ModuleDescriptor;
  12956. PROCEDURE ModuleSection(): IntermediateCode.Section;
  12957. VAR name: ARRAY 128 OF CHAR;
  12958. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  12959. symbol: SyntaxTree.Symbol;
  12960. BEGIN
  12961. Global.GetModuleName(module.module,name);
  12962. Strings.Append(name,".@Module");
  12963. Basic.ToSegmentedName(name, pooledName);
  12964. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12965. moduleSection.SetExported(TRUE);
  12966. IF moduleSection.pc = 0 THEN
  12967. IF implementationVisitor.backend.cooperative THEN
  12968. Info(moduleSection, "descriptor");
  12969. ModuleDescriptor(moduleSection);
  12970. BaseObject(moduleSection);
  12971. implementationVisitor.CreateTraceModuleMethod(module.module);
  12972. ELSE
  12973. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12974. Info(moduleSection, "HeapBlock");
  12975. Symbol(moduleSection,moduleSection,2,0);
  12976. Info(moduleSection, "TypeDescriptor");
  12977. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12978. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12979. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12980. END;
  12981. END;
  12982. RETURN moduleSection;
  12983. END ModuleSection;
  12984. PROCEDURE NewModuleInfo();
  12985. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12986. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12987. sectionName: Basic.SectionName;
  12988. CONST MPO=-40000000H;
  12989. BEGIN
  12990. (*
  12991. TypeDesc* = POINTER TO RECORD
  12992. descSize: SIZE;
  12993. sentinel: LONGINT; (* = MPO-4 *)
  12994. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12995. flags*: SET;
  12996. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12997. name*: Name;
  12998. refsOffset: SIZE;
  12999. END;
  13000. *)
  13001. (*name is missing prefixes sometimes*)
  13002. Global.GetModuleSegmentedName(module.module,name);
  13003. Basic.AppendToSegmentedName(name,".@Info");
  13004. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13005. IF ~implementationVisitor.backend.cooperative THEN
  13006. Info(source, "HeapBlock");
  13007. Address(source,0); (* an empty heap block prevents GC marking *)
  13008. Info(source, "TypeDescriptor");
  13009. Address(source,0);
  13010. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  13011. END;
  13012. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  13013. Address(source,MPO-4);
  13014. Info(source, "type tag pointer");
  13015. Address( source,0);
  13016. Info(source, "type flags");
  13017. flags := {};
  13018. Set( source, flags);
  13019. Info(source, "pointer to module");
  13020. moduleSection := ModuleSection();
  13021. Symbol( source, moduleSection, moduleSection.pc,0);
  13022. Info(source, "type name");
  13023. i := 0;
  13024. sectionName := "@Self";
  13025. (*
  13026. Global.GetSymbolSegmentedName(td,name);
  13027. Basic.SegmentedNameToString(name, sectionName);
  13028. *)
  13029. Name(source,sectionName);
  13030. patchInfoPC := source.pc;
  13031. Size(source, 0);
  13032. END NewModuleInfo;
  13033. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  13034. VAR
  13035. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  13036. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  13037. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  13038. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, numberProcs,temp,
  13039. referenceSectionOffset : LONGINT;
  13040. name: Basic.SegmentedName; offset: LONGINT;
  13041. flags: SET;
  13042. BEGIN
  13043. NewModuleInfo();
  13044. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  13045. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  13046. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  13047. ImportsArray(importSection);
  13048. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  13049. CommandArray(commandsSection);
  13050. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  13051. ExceptionArray(exceptionSection);
  13052. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  13053. AddPointer(typeInfoSection, typeInfoSectionOffset);
  13054. TypeInfoSection(typeInfoSection);
  13055. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  13056. referenceSection.SetExported(TRUE);
  13057. References(referenceSection);
  13058. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  13059. ProcedureDescriptorArray(procTableSection, numberProcs);
  13060. IF ProtectModulesPointers THEN
  13061. name := "Heaps.AnyPtr";
  13062. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  13063. (* set base pointer *)
  13064. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  13065. END;
  13066. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  13067. ArrayBlock(emptyArraySection,temp,"", FALSE);
  13068. moduleSection := ModuleSection();
  13069. Info(moduleSection, "nextRoot*: RootObject");
  13070. Address(moduleSection,0);
  13071. Info(moduleSection, "next*: Module");
  13072. Address(moduleSection,0);
  13073. Info(moduleSection, "name*: Name");
  13074. Name(moduleSection,moduleName);
  13075. Info(moduleSection, "init, published: BOOLEAN");
  13076. Boolean(moduleSection,FALSE);
  13077. Boolean(moduleSection,FALSE);
  13078. Info(moduleSection,"filler"); (*! introduce alignment! *)
  13079. Boolean(moduleSection,FALSE);
  13080. Boolean(moduleSection,FALSE);
  13081. Info(moduleSection, "refcnt*: LONGINT");
  13082. Longint(moduleSection,0);
  13083. Info(moduleSection, "sb*: ADDRESS");
  13084. Address(moduleSection,0);
  13085. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  13086. Address(moduleSection,0);
  13087. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  13088. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  13089. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  13090. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  13091. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  13092. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  13093. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  13094. Symbol(moduleSection,importSection,importSectionOffset,0);
  13095. Info(moduleSection, "procTable*: ProcTable");
  13096. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  13097. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  13098. Address(moduleSection,0);
  13099. Address(moduleSection,0);
  13100. Address(moduleSection,0);
  13101. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  13102. Info(moduleSection, "export*: ExportDesc");
  13103. ExportDesc(moduleSection);
  13104. Info(moduleSection, "term*: TerminationHandler");
  13105. Address(moduleSection,0);
  13106. Info(moduleSection, "exTable*: ExceptionTable");
  13107. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  13108. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  13109. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  13110. Info(moduleSection, "crc*: LONGINT");
  13111. patchCRC:= moduleSection.pc;
  13112. Longint(moduleSection, 0); (*! must be implemented *)
  13113. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  13114. Info(moduleSection, "body*: ADDRESS");
  13115. Symbol(moduleSection, bodyProc, 0,0);
  13116. Info(moduleSection, "module flags");
  13117. flags := {};
  13118. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  13119. Set( moduleSection, flags);
  13120. IF implementationVisitor.backend.cooperative THEN
  13121. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  13122. Info(moduleSection, "monitor.owner");
  13123. Address(moduleSection,0);
  13124. Info(moduleSection, "monitor.nestingLevel");
  13125. Address(moduleSection,0);
  13126. Info(moduleSection, "monitor.blockedQueue");
  13127. Address(moduleSection,0); Address(moduleSection,0);
  13128. Info(moduleSection, "monitor.waitingQueue");
  13129. Address(moduleSection,0); Address(moduleSection,0);
  13130. Info(moduleSection, "monitor.waitingSentinel");
  13131. Address(moduleSection,0);
  13132. END;
  13133. END Module;
  13134. PROCEDURE PatchCRC(crc: LONGINT);
  13135. BEGIN
  13136. IF ~simple THEN
  13137. PatchLongint(ModuleSection(), patchCRC, crc);
  13138. END;
  13139. END PatchCRC;
  13140. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  13141. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  13142. BEGIN
  13143. ArrayBlock(source,pc,"",FALSE);
  13144. Info(source, "pointer offsets array data");
  13145. IF scope IS SyntaxTree.RecordScope THEN
  13146. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  13147. ELSIF scope IS SyntaxTree.CellScope THEN
  13148. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  13149. ELSIF scope IS SyntaxTree.ModuleScope THEN
  13150. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  13151. WHILE variable # NIL DO
  13152. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  13153. symbol := module.allSections.FindBySymbol(variable);
  13154. ASSERT(symbol # NIL);
  13155. Pointers(0,symbol, source,variable.type,numberPointers);
  13156. END;
  13157. variable := variable.nextVariable;
  13158. END;
  13159. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  13160. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13161. WHILE parameter # NIL DO
  13162. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  13163. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  13164. END;
  13165. parameter := parameter.nextParameter;
  13166. END;
  13167. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  13168. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  13169. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  13170. IF implementationVisitor.backend.preciseGC THEN
  13171. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  13172. END;
  13173. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  13174. END;
  13175. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  13176. WHILE(variable # NIL) DO
  13177. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  13178. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  13179. END;
  13180. variable := variable.nextVariable
  13181. END;
  13182. END;
  13183. PatchArray(source,pc,numberPointers);
  13184. END PointerArray;
  13185. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  13186. VAR recordType: SyntaxTree.RecordType;
  13187. tir, tdInfo: IntermediateCode.Section; td: SyntaxTree.TypeDeclaration;
  13188. section: Sections.Section; cellType: SyntaxTree.CellType;
  13189. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  13190. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  13191. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  13192. sectionName: Basic.SectionName;
  13193. CONST MPO=-40000000H;
  13194. BEGIN
  13195. (*
  13196. TypeDesc* = POINTER TO RECORD
  13197. descSize: SIZE;
  13198. sentinel: LONGINT; (* = MPO-4 *)
  13199. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  13200. flags*: SET;
  13201. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  13202. name*: Name;
  13203. refsOffset: SIZE;
  13204. END;
  13205. *)
  13206. (* source := module.sections.FindByName(...) *)
  13207. Global.GetSymbolSegmentedName(td,name);
  13208. Basic.AppendToSegmentedName(name,".@Info");
  13209. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13210. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  13211. Address(source,0);
  13212. Info(source, "TypeDescriptor");
  13213. Address(source,0);
  13214. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  13215. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  13216. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  13217. Info(source, "type tag pointer");
  13218. Symbol( source, tag, offset, 0);
  13219. Info(source, "type flags");
  13220. flags := {};
  13221. IF isProtected THEN INCL(flags,31) END;
  13222. Set( source, flags);
  13223. Info(source, "pointer to module");
  13224. moduleSection := ModuleSection();
  13225. Symbol( source, moduleSection, moduleSection.pc,0);
  13226. Info(source, "type name");
  13227. i := 0;
  13228. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  13229. (*
  13230. Global.GetSymbolSegmentedName(td,name);
  13231. Basic.SegmentedNameToString(name, sectionName);
  13232. *)
  13233. Name(source,sectionName);
  13234. Size(source, 0);
  13235. RETURN source;
  13236. END NewTypeDescriptorInfo;
  13237. PROCEDURE NewTypeDescriptor;
  13238. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  13239. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  13240. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  13241. numberPointers: LONGINT; padding, i: LONGINT;
  13242. CONST MPO=-40000000H;
  13243. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  13244. VAR i: LONGINT;
  13245. PROCEDURE Td(record: SyntaxTree.RecordType);
  13246. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  13247. BEGIN
  13248. IF record # NIL THEN
  13249. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  13250. baseTD := record.typeDeclaration;
  13251. Global.GetSymbolSegmentedName(baseTD,name);
  13252. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13253. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13254. ELSE
  13255. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13256. END;
  13257. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  13258. Symbol(source, tir, 0, offset);
  13259. IF reverse THEN Td(record.GetBaseRecord()) END;
  13260. END;
  13261. END Td;
  13262. BEGIN
  13263. Info(source, "tag table");
  13264. baseRecord := recordType;
  13265. i := 0;
  13266. WHILE baseRecord # NIL DO
  13267. INC(i);
  13268. baseRecord := baseRecord.GetBaseRecord();
  13269. END;
  13270. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  13271. IF ~reverse THEN Td(recordType) END;
  13272. WHILE i < size DO
  13273. Address(source,0);
  13274. INC(i);
  13275. END;
  13276. IF reverse THEN Td(recordType) END;
  13277. END TdTable;
  13278. PROCEDURE MethodTable(reverse: BOOLEAN);
  13279. VAR i,methods: LONGINT;
  13280. BEGIN
  13281. Info(source, "method table");
  13282. IF recordType # NIL THEN
  13283. methods := recordType.recordScope.numberMethods;
  13284. IF reverse THEN
  13285. FOR i := methods-1 TO 0 BY -1 DO
  13286. procedure := recordType.recordScope.FindMethod(i);
  13287. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  13288. NamedSymbol(source, name,procedure, 0,0);
  13289. END;
  13290. ELSE
  13291. FOR i := 0 TO methods-1 DO
  13292. procedure := recordType.recordScope.FindMethod(i);
  13293. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  13294. NamedSymbol(source, name,procedure, 0,0);
  13295. END;
  13296. END;
  13297. END;
  13298. END MethodTable;
  13299. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  13300. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  13301. BEGIN
  13302. Info(source, "method table");
  13303. baseRecord := recordType;
  13304. WHILE baseRecord.baseType # NIL DO
  13305. baseRecord := baseRecord.GetBaseRecord ();
  13306. END;
  13307. GetRecordTypeName (baseRecord, name);
  13308. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  13309. IF name = stackFrame THEN
  13310. start := 0;
  13311. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  13312. baseRecord := recordType;
  13313. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  13314. baseRecord := baseRecord.GetBaseRecord ();
  13315. END;
  13316. IF baseRecord # NIL THEN
  13317. GetRecordTypeName (baseRecord, name);
  13318. IF pointer & ~baseRecord.isObject THEN
  13319. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13320. END;
  13321. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  13322. ELSIF recordType.isObject THEN
  13323. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  13324. ELSIF pointer THEN
  13325. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  13326. ELSE
  13327. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  13328. END;
  13329. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13330. Symbol(source, tir, 0, 0);
  13331. start := 0;
  13332. baseRecord := recordType;
  13333. WHILE (baseRecord # NIL) DO
  13334. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  13335. baseRecord := baseRecord.GetBaseRecord ();
  13336. END;
  13337. ELSE
  13338. (* explicit trace method: *)
  13339. procedure := recordType.recordScope.FindMethod(0);
  13340. IF ~procedure.isFinalizer THEN
  13341. Global.GetSymbolSegmentedName(procedure, name);
  13342. NamedSymbol(source, name,procedure, 0,0);
  13343. END;
  13344. start := 1;
  13345. END;
  13346. IF (name # stackFrame) & recordType.isObject THEN
  13347. baseRecord := recordType;
  13348. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  13349. baseRecord := baseRecord.GetBaseRecord ();
  13350. END;
  13351. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  13352. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  13353. ELSE
  13354. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  13355. END;
  13356. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13357. Symbol(source, tir, 0, 0);
  13358. END;
  13359. methods := recordType.recordScope.numberMethods;
  13360. FOR i := start TO methods-1 DO
  13361. procedure := recordType.recordScope.FindMethod(i);
  13362. IF ~procedure.isFinalizer THEN
  13363. Global.GetSymbolSegmentedName(procedure, name);
  13364. NamedSymbol(source, name,procedure, 0,0);
  13365. END;
  13366. END;
  13367. END CooperativeMethodTable;
  13368. BEGIN
  13369. Global.GetSymbolSegmentedName(td,name);
  13370. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  13371. source.SetExported(IsExported(td));
  13372. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  13373. IF implementationVisitor.backend.cooperative THEN
  13374. base := NIL;
  13375. baseRecord := recordType.GetBaseRecord();
  13376. IF baseRecord # NIL THEN
  13377. baseTD := baseRecord.typeDeclaration;
  13378. END;
  13379. IF ~recordType.isObject THEN
  13380. Info(source, "parent");
  13381. IF baseRecord # NIL THEN
  13382. Global.GetSymbolSegmentedName(baseTD,name);
  13383. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13384. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13385. ELSE
  13386. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  13387. END;
  13388. Symbol(source, tir, 0, 0);
  13389. ELSE
  13390. Address(source,0);
  13391. END;
  13392. Info(source, "record size");
  13393. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13394. CooperativeMethodTable(FALSE);
  13395. base := source;
  13396. Global.GetSymbolSegmentedName(td,name);
  13397. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13398. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13399. source.SetExported(IsExported(td));
  13400. END;
  13401. Info(source, "parent");
  13402. IF baseRecord # NIL THEN
  13403. Global.GetSymbolSegmentedName(baseTD,name);
  13404. sym := baseTD;
  13405. IF ~recordType.isObject THEN
  13406. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  13407. sym := NIL;
  13408. END;
  13409. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  13410. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  13411. ELSE
  13412. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  13413. END;
  13414. Symbol(source, tir, 0, 0);
  13415. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  13416. Address(source,0);
  13417. ELSE
  13418. IF recordType.isObject THEN
  13419. Basic.ToSegmentedName ("BaseTypes.Object",name);
  13420. ELSE
  13421. Basic.ToSegmentedName ("BaseTypes.Record",name);
  13422. END;
  13423. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  13424. Symbol(source, tir, 0, 0);
  13425. END;
  13426. Info(source, "base record descriptor");
  13427. Symbol(source, base, 0, 0);
  13428. CooperativeMethodTable(TRUE);
  13429. IF recordType.hasPointers THEN
  13430. IF ~HasExplicitTraceMethod (recordType) THEN
  13431. implementationVisitor.CreateTraceMethod(recordType);
  13432. END;
  13433. implementationVisitor.CreateResetProcedure(recordType);
  13434. implementationVisitor.CreateAssignProcedure(recordType);
  13435. END;
  13436. ELSIF ~simple THEN
  13437. (*
  13438. MethodEnd = MPO
  13439. ---
  13440. methods (# methods)
  13441. ---
  13442. tags (16)
  13443. ---
  13444. TypeDesc = TypeInfoAdr
  13445. ---
  13446. td adr ---> rec size
  13447. ----
  13448. pointer offsets
  13449. ----
  13450. (padding)
  13451. -----
  13452. empty [2 addresses aligned]
  13453. empty
  13454. empty
  13455. numPtrs
  13456. ---
  13457. pointer offsets
  13458. ---
  13459. *)
  13460. Info(source, "MethodEnd = MPO");
  13461. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  13462. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  13463. MethodTable(TRUE);
  13464. TdTable(TypeTags, TRUE);
  13465. Info(source, "type descriptor info pointer");
  13466. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  13467. Symbol(source, tdInfo,EmptyBlockOffset,0);
  13468. IF (cellType # NIL) THEN
  13469. IF cellType.sizeInBits < 0 THEN
  13470. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  13471. END;
  13472. Info(source, "cell size");
  13473. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  13474. ELSE
  13475. Info(source, "record size");
  13476. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13477. END;
  13478. Info(source, "pointer offsets pointer");
  13479. padding := 1- source.pc MOD 2;
  13480. Symbol(source, source, source.pc+1+padding,0);
  13481. IF padding >0 THEN
  13482. Info(source, "padding");
  13483. FOR i := 1 TO padding DO Address(source,0) END;
  13484. END;
  13485. IF cellType # NIL THEN
  13486. PointerArray(source, cellType.cellScope, numberPointers);
  13487. ELSE
  13488. PointerArray(source, recordType.recordScope, numberPointers);
  13489. END;
  13490. ELSE
  13491. (*
  13492. simple:
  13493. td adr --> size
  13494. tag(1)
  13495. tag(2)
  13496. tag(3)
  13497. methods ->
  13498. *)
  13499. Info(source, "record size");
  13500. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  13501. TdTable(TypeTags, FALSE);
  13502. MethodTable(FALSE);
  13503. END;
  13504. END NewTypeDescriptor;
  13505. BEGIN
  13506. x := x.resolved;
  13507. IF (x IS SyntaxTree.PointerType) THEN
  13508. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  13509. END;
  13510. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  13511. recordType := x(SyntaxTree.RecordType);
  13512. td := x.typeDeclaration;
  13513. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13514. ASSERT(td # NIL);
  13515. section := module.allSections.FindBySymbol(td); (* TODO *)
  13516. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  13517. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  13518. NewTypeDescriptor
  13519. END;
  13520. END;
  13521. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  13522. cellType := x(SyntaxTree.CellType);
  13523. td := x.typeDeclaration;
  13524. section := module.allSections.FindBySymbol(td); (* TODO *)
  13525. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  13526. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  13527. NewTypeDescriptor
  13528. END;
  13529. END;
  13530. END
  13531. END CheckTypeDeclaration
  13532. END MetaDataGenerator;
  13533. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  13534. VAR
  13535. trace-: BOOLEAN;
  13536. traceString-: SyntaxTree.IdentifierString;
  13537. traceModuleName-: SyntaxTree.IdentifierString;
  13538. profile-: BOOLEAN;
  13539. noRuntimeChecks: BOOLEAN;
  13540. simpleMetaData-: BOOLEAN;
  13541. noAsserts: BOOLEAN;
  13542. optimize-: BOOLEAN;
  13543. cooperative-: BOOLEAN;
  13544. preregisterStatic-: BOOLEAN;
  13545. dump-: Basic.Writer;
  13546. cellsAreObjects: BOOLEAN;
  13547. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  13548. experiment: BOOLEAN;
  13549. PROCEDURE &InitIntermediateBackend*;
  13550. BEGIN
  13551. simpleMetaData := FALSE;
  13552. InitBackend;
  13553. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  13554. SetTraceModuleName(DefaultTraceModuleName);
  13555. END InitIntermediateBackend;
  13556. (* must be overwritten by actual backend, if parameter registers should be used *)
  13557. PROCEDURE GetParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; VAR register: WORD): BOOLEAN;
  13558. BEGIN
  13559. register := -1;
  13560. RETURN FALSE;
  13561. END GetParameterRegister;
  13562. PROCEDURE ResetParameterRegisters*;
  13563. BEGIN
  13564. END ResetParameterRegisters;
  13565. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  13566. VAR
  13567. declarationVisitor: DeclarationVisitor;
  13568. implementationVisitor: ImplementationVisitor;
  13569. module: Sections.Module;
  13570. name, platformName: SyntaxTree.IdentifierString;
  13571. meta: MetaDataGenerator;
  13572. crc: CRC.CRC32Stream;
  13573. BEGIN
  13574. ResetError;
  13575. Global.GetSymbolName(x,name);
  13576. NEW(module,x,system); (* backend structures *)
  13577. Global.GetModuleName(x, name);
  13578. module.SetModuleName(name);
  13579. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  13580. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  13581. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  13582. declarationVisitor.Module(x,module);
  13583. IF ~meta.simple THEN
  13584. meta.Module(implementationVisitor.moduleBodySection);
  13585. END;
  13586. GetDescription(platformName);
  13587. module.SetPlatformName(platformName);
  13588. NEW(crc);
  13589. module.allSections.WriteRaw(crc);
  13590. crc.Update;
  13591. meta.PatchCRC(crc.GetCRC());
  13592. RETURN module
  13593. END GenerateIntermediate;
  13594. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  13595. BEGIN RETURN TRUE
  13596. END SupportedImmediate;
  13597. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  13598. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  13599. END ProcessSyntaxTreeModule;
  13600. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  13601. VAR
  13602. result: Sections.Module;
  13603. traceName: Basic.MessageString;
  13604. BEGIN
  13605. ASSERT(intermediateCodeModule IS Sections.Module);
  13606. result := intermediateCodeModule(Sections.Module);
  13607. IF trace THEN
  13608. traceName := "intermediate code trace: ";
  13609. Strings.Append(traceName,traceString);
  13610. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  13611. IF (traceString="") OR (traceString="*") THEN
  13612. result.Dump(dump);
  13613. dump.Update
  13614. ELSE
  13615. Sections.DumpFiltered(dump, result, traceString);
  13616. END
  13617. END;
  13618. RETURN result
  13619. END ProcessIntermediateCodeModule;
  13620. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  13621. BEGIN instructionSet := "Intermediate";
  13622. END GetDescription;
  13623. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  13624. BEGIN
  13625. SELF.simpleMetaData := simpleMetaData;
  13626. END SetSimpleMetaData;
  13627. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  13628. BEGIN COPY(name, traceModuleName)
  13629. END SetTraceModuleName;
  13630. PROCEDURE DefineOptions*(options: Options.Options);
  13631. BEGIN
  13632. DefineOptions^(options);
  13633. options.Add(0X,"trace",Options.String);
  13634. options.Add(0X,"builtinsModule",Options.String);
  13635. options.Add(0X,"traceModule",Options.String);
  13636. options.Add(0X,"profile",Options.Flag);
  13637. options.Add(0X,"noRuntimeChecks",Options.Flag);
  13638. options.Add(0X,"noAsserts",Options.Flag);
  13639. options.Add(0X,"metaData",Options.String);
  13640. options.Add('o',"optimize", Options.Flag);
  13641. options.Add(0X,"preregisterStatic", Options.Flag);
  13642. options.Add(0X,"cellsAreObjects", Options.Flag);
  13643. options.Add(0X,"preciseGC", Options.Flag);
  13644. options.Add(0X,"trackLeave", Options.Flag);
  13645. options.Add(0X,"writeBarriers", Options.Flag);
  13646. options.Add(0X,"experiment", Options.Flag);
  13647. END DefineOptions;
  13648. PROCEDURE GetOptions*(options: Options.Options);
  13649. VAR name,string: SyntaxTree.IdentifierString;
  13650. BEGIN
  13651. GetOptions^(options);
  13652. trace := options.GetString("trace",traceString);
  13653. profile := options.GetFlag("profile");
  13654. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  13655. noAsserts := options.GetFlag("noAsserts");
  13656. cooperative := options.GetFlag("cooperative");
  13657. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  13658. simpleMetaData := TRUE
  13659. END;
  13660. IF options.GetString("metaData",string) THEN
  13661. IF string = "simple" THEN simpleMetaData := TRUE
  13662. ELSIF string ="full" THEN simpleMetaData := FALSE
  13663. END;
  13664. END;
  13665. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  13666. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  13667. optimize := options.GetFlag("optimize");
  13668. preregisterStatic := options.GetFlag("preregisterStatic");
  13669. cellsAreObjects := options.GetFlag("cellsAreObjects");
  13670. preciseGC := options.GetFlag("preciseGC");
  13671. trackLeave := options.GetFlag("trackLeave");
  13672. writeBarriers := options.GetFlag("writeBarriers");
  13673. experiment := options.GetFlag("experiment");
  13674. IF simpleMetaData THEN preciseGC := FALSE END;
  13675. END GetOptions;
  13676. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  13677. BEGIN RETURN SymbolFileFormat.Get()
  13678. END DefaultSymbolFileFormat;
  13679. END IntermediateBackend;
  13680. (* ----------------------------------- register allocation ------------------------------------- *)
  13681. (* register mapping scheme
  13682. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  13683. spill offset
  13684. part(n) --> ticket <--> physical register
  13685. spill offset
  13686. *)
  13687. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  13688. emptyOperand: IntermediateCode.Operand;
  13689. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  13690. statCoopResetVariables: LONGINT;
  13691. statCoopModifyAssignments: LONGINT;
  13692. modifyAssignmentsPC : LONGINT;
  13693. statCoopNilCheck: LONGINT;
  13694. statCoopSwitch: LONGINT;
  13695. statCoopAssignProcedure: LONGINT;
  13696. statCoopTraceMethod: LONGINT;
  13697. statCoopResetProcedure: LONGINT;
  13698. statCoopTraceModule: LONGINT;
  13699. PROCEDURE ResetStatistics*;
  13700. BEGIN
  13701. statCoopResetVariables := 0;
  13702. statCoopModifyAssignments := 0;
  13703. statCoopNilCheck:= 0;
  13704. statCoopSwitch:= 0;
  13705. statCoopAssignProcedure:= 0;
  13706. statCoopTraceMethod:= 0;
  13707. statCoopResetProcedure:= 0;
  13708. statCoopTraceModule:= 0;
  13709. END ResetStatistics;
  13710. PROCEDURE Statistics*;
  13711. BEGIN
  13712. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  13713. TRACE(statCoopNilCheck, statCoopSwitch);
  13714. TRACE(statCoopAssignProcedure,
  13715. statCoopTraceMethod,
  13716. statCoopResetProcedure,
  13717. statCoopTraceModule)
  13718. END Statistics;
  13719. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  13720. VAR h: LONGINT;
  13721. BEGIN
  13722. WHILE b # 0 DO
  13723. h := a MOD b;
  13724. a := b;
  13725. b := h;
  13726. END;
  13727. RETURN a
  13728. END GCD;
  13729. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  13730. BEGIN
  13731. RETURN a*b DIV GCD(a,b)
  13732. END SCM;
  13733. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  13734. BEGIN
  13735. (*TRACE(a,b);*)
  13736. IF a = 0 THEN RETURN b
  13737. ELSIF b = 0 THEN RETURN a
  13738. ELSE RETURN SCM(a,b)
  13739. END;
  13740. END CommonAlignment;
  13741. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  13742. BEGIN
  13743. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  13744. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  13745. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  13746. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  13747. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  13748. END
  13749. END PassBySingleReference;
  13750. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  13751. BEGIN
  13752. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  13753. END PassInRegister;
  13754. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  13755. VAR new: RegisterEntry;
  13756. BEGIN
  13757. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  13758. IF queue = NIL THEN
  13759. queue := new
  13760. ELSE
  13761. new.next := queue;
  13762. IF queue#NIL THEN queue.prev := new END;
  13763. queue := new
  13764. END;
  13765. END AddRegisterEntry;
  13766. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  13767. VAR this: RegisterEntry;
  13768. BEGIN
  13769. this := queue;
  13770. WHILE (this # NIL) & (this.register # register) DO
  13771. this := this.next;
  13772. END;
  13773. IF this = NIL THEN
  13774. RETURN FALSE
  13775. END;
  13776. ASSERT(this # NIL);
  13777. IF this = queue THEN queue := queue.next END;
  13778. IF this.prev # NIL THEN this.prev.next := this.next END;
  13779. IF this.next # NIL THEN this.next.prev := this.prev END;
  13780. RETURN TRUE
  13781. END RemoveRegisterEntry;
  13782. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  13783. BEGIN ASSERT(cond);
  13784. END Assert;
  13785. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  13786. BEGIN
  13787. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  13788. END ReusableRegister;
  13789. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  13790. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  13791. BEGIN
  13792. procedure := moduleScope.bodyProcedure;
  13793. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  13794. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  13795. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  13796. procedure.SetScope(moduleScope);
  13797. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  13798. procedure.SetAccess(SyntaxTree.Hidden);
  13799. moduleScope.SetBodyProcedure(procedure);
  13800. moduleScope.AddProcedure(procedure);
  13801. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  13802. END;
  13803. END EnsureBodyProcedure;
  13804. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  13805. VAR import: SyntaxTree.Import;
  13806. selfName: SyntaxTree.IdentifierString;
  13807. module: SyntaxTree.Module;
  13808. BEGIN
  13809. scope.ownerModule.GetName(selfName);
  13810. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  13811. module := scope.ownerModule
  13812. ELSE
  13813. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  13814. IF import = NIL THEN
  13815. RETURN NIL
  13816. ELSIF import.module = NIL THEN
  13817. RETURN NIL
  13818. ELSE module := import.module
  13819. END;
  13820. END;
  13821. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  13822. END GetSymbol;
  13823. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  13824. BEGIN
  13825. op.mode := mode;
  13826. IntermediateCode.InitOperand(op.op);
  13827. IntermediateCode.InitOperand(op.tag);
  13828. IntermediateCode.InitOperand(op.extra);
  13829. op.dimOffset := 0;
  13830. op.availability := -1;
  13831. END InitOperand;
  13832. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  13833. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  13834. BEGIN RETURN IntermediateCode.GetType(system, type)
  13835. END GetType;
  13836. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  13837. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  13838. BEGIN
  13839. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  13840. (*
  13841. UniqueId(name,module,name,adr);
  13842. *)
  13843. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  13844. constant.SetValue(value);
  13845. constant.SetAccess(SyntaxTree.Hidden);
  13846. module.moduleScope.AddConstant(constant);
  13847. constant.SetScope(module.moduleScope);
  13848. RETURN constant
  13849. END BuildConstant;
  13850. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13851. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  13852. BEGIN
  13853. variable := scope.firstVariable;
  13854. WHILE variable # NIL DO
  13855. IF variable.NeedsTrace() THEN
  13856. RETURN TRUE;
  13857. END;
  13858. variable := variable.nextVariable;
  13859. END;
  13860. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13861. WHILE parameter # NIL DO
  13862. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  13863. RETURN TRUE;
  13864. END;
  13865. parameter := parameter.nextParameter;
  13866. END;
  13867. RETURN FALSE;
  13868. END HasPointers;
  13869. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  13870. 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));
  13871. END IsVariableParameter;
  13872. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  13873. VAR parameter: SyntaxTree.Parameter;
  13874. BEGIN
  13875. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  13876. WHILE parameter # NIL DO
  13877. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  13878. IF parameter.movable THEN RETURN TRUE END;
  13879. parameter := parameter.nextParameter;
  13880. END;
  13881. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  13882. END HasVariableParameters;
  13883. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  13884. BEGIN
  13885. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  13886. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  13887. END HasExplicitTraceMethod;
  13888. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  13889. BEGIN
  13890. IF expression.resolved # NIL THEN expression := expression.resolved END;
  13891. IF (expression IS SyntaxTree.IntegerValue) THEN
  13892. val := expression(SyntaxTree.IntegerValue).value;
  13893. RETURN TRUE
  13894. ELSE
  13895. RETURN FALSE
  13896. END;
  13897. END IsIntegerConstant;
  13898. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  13899. BEGIN
  13900. IF val <= 0 THEN RETURN FALSE END;
  13901. exp := 0;
  13902. WHILE ~ODD(val) DO
  13903. val := val DIV 2;
  13904. INC(exp)
  13905. END;
  13906. RETURN val = 1
  13907. END PowerOf2;
  13908. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  13909. VAR procedure: SyntaxTree.Procedure;
  13910. BEGIN
  13911. procedure := record.recordScope.constructor;
  13912. IF procedure = NIL THEN
  13913. record := record.GetBaseRecord();
  13914. IF record # NIL THEN
  13915. procedure := GetConstructor(record)
  13916. END;
  13917. END;
  13918. RETURN procedure;
  13919. END GetConstructor;
  13920. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  13921. BEGIN
  13922. value := SHORT(op.intValue);
  13923. RETURN op.mode = IntermediateCode.ModeImmediate;
  13924. END IsIntegerImmediate;
  13925. (** whether a type strictily is a pointer to record or object type
  13926. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  13927. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  13928. BEGIN
  13929. IF type = NIL THEN
  13930. RETURN FALSE
  13931. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  13932. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  13933. ELSE
  13934. RETURN FALSE
  13935. END
  13936. END IsStrictlyPointerToRecord;
  13937. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  13938. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  13939. END IsUnsafePointer;
  13940. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  13941. BEGIN type := type.resolved;
  13942. IF type IS SyntaxTree.PointerType THEN
  13943. type := type(SyntaxTree.PointerType).pointerBase;
  13944. type := type.resolved;
  13945. IF type IS SyntaxTree.RecordType THEN
  13946. recordType := type(SyntaxTree.RecordType);
  13947. RETURN TRUE
  13948. ELSE
  13949. RETURN FALSE
  13950. END
  13951. ELSIF type IS SyntaxTree.RecordType THEN
  13952. recordType := type(SyntaxTree.RecordType);
  13953. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13954. ELSIF type IS SyntaxTree.ObjectType THEN
  13955. RETURN TRUE
  13956. ELSIF type IS SyntaxTree.AnyType THEN
  13957. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13958. ELSE
  13959. RETURN FALSE
  13960. END;
  13961. END IsPointerToRecord;
  13962. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13963. BEGIN
  13964. type := type.resolved;
  13965. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13966. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13967. END IsArrayOfSystemByte;
  13968. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13969. BEGIN
  13970. IF type = NIL THEN RETURN FALSE END;
  13971. type := type.resolved;
  13972. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13973. END IsOpenArray;
  13974. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13975. BEGIN
  13976. IF type = NIL THEN RETURN FALSE END;
  13977. type := type.resolved;
  13978. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13979. END IsSemiDynamicArray;
  13980. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13981. BEGIN
  13982. IF type = NIL THEN RETURN FALSE END;
  13983. type := type.resolved;
  13984. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13985. END IsStaticArray;
  13986. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13987. BEGIN
  13988. IF type = NIL THEN RETURN FALSE END;
  13989. type := type.resolved;
  13990. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13991. END IsStaticMathArray;
  13992. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13993. BEGIN
  13994. WHILE (IsStaticMathArray(type)) DO
  13995. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13996. END;
  13997. RETURN type;
  13998. END StaticMathArrayBaseType;
  13999. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  14000. VAR size: LONGINT;
  14001. BEGIN
  14002. size := 1;
  14003. WHILE (IsStaticArray(type)) DO
  14004. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  14005. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14006. END;
  14007. RETURN size;
  14008. END StaticArrayNumElements;
  14009. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  14010. VAR size: LONGINT;
  14011. BEGIN
  14012. size := 1;
  14013. WHILE (IsStaticMathArray(type)) DO
  14014. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  14015. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  14016. END;
  14017. RETURN size;
  14018. END StaticMathArrayNumElements;
  14019. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14020. BEGIN
  14021. WHILE (IsStaticArray(type)) DO
  14022. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14023. END;
  14024. RETURN type;
  14025. END StaticArrayBaseType;
  14026. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  14027. BEGIN
  14028. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  14029. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  14030. END;
  14031. RETURN type;
  14032. END ArrayBaseType;
  14033. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  14034. BEGIN
  14035. IF type = NIL THEN RETURN FALSE END;
  14036. type := type.resolved;
  14037. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  14038. END IsDelegate;
  14039. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  14040. VAR i: LONGINT;
  14041. BEGIN
  14042. i := 0; type := type.resolved;
  14043. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  14044. INC(i);
  14045. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  14046. END;
  14047. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  14048. INC(i);
  14049. type := type(SyntaxTree.MathArrayType).arrayBase;
  14050. IF type # NIL THEN type := type.resolved END;
  14051. END;
  14052. RETURN i
  14053. END DynamicDim;
  14054. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  14055. BEGIN
  14056. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  14057. type := type(SyntaxTree.ArrayType).arrayBase;
  14058. END;
  14059. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  14060. type := type(SyntaxTree.MathArrayType).arrayBase;
  14061. END;
  14062. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  14063. END StaticSize;
  14064. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  14065. BEGIN
  14066. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  14067. END IsImmediate;
  14068. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  14069. BEGIN
  14070. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  14071. END IsAddress;
  14072. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  14073. BEGIN
  14074. RETURN (x.mode = IntermediateCode.ModeRegister);
  14075. END IsRegister;
  14076. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  14077. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  14078. BEGIN
  14079. typeDeclaration := recordType.typeDeclaration;
  14080. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  14081. Global.GetSymbolSegmentedName(typeDeclaration,name);
  14082. END GetRecordTypeName;
  14083. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  14084. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  14085. BEGIN
  14086. parSize := 0;
  14087. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  14088. parameter := procedureType.returnParameter;
  14089. INC(parSize,system.SizeOfParameter(parameter));
  14090. parSize := parSize + (-parSize) MOD system.addressSize;
  14091. END;
  14092. parameter :=procedureType.lastParameter;
  14093. WHILE (parameter # NIL) DO
  14094. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  14095. INC(parSize, system.addressSize);
  14096. ELSE
  14097. INC(parSize,system.SizeOfParameter(parameter));
  14098. parSize := parSize + (-parSize) MOD system.addressSize;
  14099. END;
  14100. parameter := parameter.prevParameter;
  14101. END;
  14102. IF procedureType.selfParameter # NIL THEN
  14103. parameter := procedureType.selfParameter;
  14104. INC(parSize,system.SizeOfParameter(parameter));
  14105. parSize := parSize + (-parSize) MOD system.addressSize;
  14106. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  14107. END; (* method => self pointer *)
  14108. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  14109. RETURN ToMemoryUnits(system,parSize)
  14110. END ParametersSize;
  14111. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  14112. BEGIN
  14113. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  14114. END IsNested;
  14115. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  14116. BEGIN
  14117. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  14118. scope := scope.outerScope;
  14119. END;
  14120. RETURN scope # NIL;
  14121. END InCellScope;
  14122. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  14123. BEGIN
  14124. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  14125. END ProcedureParametersSize;
  14126. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  14127. VAR dataUnit: LONGINT;
  14128. BEGIN dataUnit := system.dataUnit;
  14129. ASSERT(size MOD system.dataUnit = 0);
  14130. RETURN LONGINT(size DIV system.dataUnit)
  14131. END ToMemoryUnits;
  14132. PROCEDURE Get*(): Backend.Backend;
  14133. VAR backend: IntermediateBackend;
  14134. BEGIN NEW(backend); RETURN backend
  14135. END Get;
  14136. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  14137. VAR instruction: IntermediateCode.Instruction;
  14138. BEGIN
  14139. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  14140. RETURN instruction
  14141. END Nop;
  14142. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14143. VAR instruction: IntermediateCode.Instruction;
  14144. BEGIN
  14145. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  14146. RETURN instruction
  14147. END Mov;
  14148. (* like Mov but ensures that no new register will be allocated for dest *)
  14149. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14150. VAR instruction: IntermediateCode.Instruction;
  14151. BEGIN
  14152. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  14153. RETURN instruction
  14154. END MovReplace;
  14155. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14156. VAR instruction: IntermediateCode.Instruction;
  14157. BEGIN
  14158. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  14159. RETURN instruction
  14160. END Conv;
  14161. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  14162. VAR instruction: IntermediateCode.Instruction;
  14163. BEGIN
  14164. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  14165. RETURN instruction
  14166. END Call;
  14167. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  14168. VAR op1, op2, op3: IntermediateCode.Operand;
  14169. VAR instruction: IntermediateCode.Instruction;
  14170. BEGIN
  14171. IntermediateCode.InitNumber(op1,pcOffset);
  14172. IntermediateCode.InitNumber(op2,callingConvention);
  14173. IntermediateCode.InitNumber(op3,unwind);
  14174. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  14175. RETURN instruction
  14176. END Exit;
  14177. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  14178. VAR instruction: IntermediateCode.Instruction;
  14179. BEGIN
  14180. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  14181. RETURN instruction
  14182. END Return;
  14183. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  14184. VAR instruction: IntermediateCode.Instruction;
  14185. BEGIN
  14186. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  14187. RETURN instruction
  14188. END Result;
  14189. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  14190. VAR op1: IntermediateCode.Operand;
  14191. VAR instruction: IntermediateCode.Instruction;
  14192. BEGIN
  14193. IntermediateCode.InitNumber(op1,nr);
  14194. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  14195. RETURN instruction
  14196. END Trap;
  14197. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  14198. VAR instruction: IntermediateCode.Instruction;
  14199. BEGIN
  14200. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  14201. RETURN instruction
  14202. END Br;
  14203. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14204. VAR instruction: IntermediateCode.Instruction;
  14205. BEGIN
  14206. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  14207. RETURN instruction
  14208. END Breq;
  14209. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14210. VAR instruction: IntermediateCode.Instruction;
  14211. BEGIN
  14212. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  14213. RETURN instruction
  14214. END Brne;
  14215. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14216. VAR instruction: IntermediateCode.Instruction;
  14217. BEGIN
  14218. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  14219. RETURN instruction
  14220. END Brge;
  14221. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14222. VAR instruction: IntermediateCode.Instruction;
  14223. BEGIN
  14224. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  14225. RETURN instruction
  14226. END Brlt;
  14227. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  14228. VAR instruction: IntermediateCode.Instruction;
  14229. BEGIN
  14230. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  14231. RETURN instruction
  14232. END Pop;
  14233. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  14234. VAR instruction: IntermediateCode.Instruction;
  14235. BEGIN
  14236. ASSERT(op.mode # IntermediateCode.Undefined);
  14237. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  14238. RETURN instruction
  14239. END Push;
  14240. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14241. VAR instruction: IntermediateCode.Instruction;
  14242. BEGIN
  14243. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  14244. RETURN instruction
  14245. END Neg;
  14246. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14247. VAR instruction: IntermediateCode.Instruction;
  14248. BEGIN
  14249. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  14250. RETURN instruction
  14251. END Not;
  14252. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  14253. VAR instruction: IntermediateCode.Instruction;
  14254. BEGIN
  14255. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  14256. RETURN instruction
  14257. END Abs;
  14258. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14259. VAR instruction: IntermediateCode.Instruction;
  14260. BEGIN
  14261. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  14262. ASSERT(~IsImmediate(instruction.op1));
  14263. RETURN instruction
  14264. END Mul;
  14265. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14266. VAR instruction: IntermediateCode.Instruction;
  14267. BEGIN
  14268. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  14269. RETURN instruction
  14270. END Div;
  14271. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14272. VAR instruction: IntermediateCode.Instruction;
  14273. BEGIN
  14274. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  14275. RETURN instruction
  14276. END Mod;
  14277. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14278. VAR instruction: IntermediateCode.Instruction;
  14279. BEGIN
  14280. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  14281. RETURN instruction
  14282. END Sub;
  14283. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14284. VAR instruction: IntermediateCode.Instruction;
  14285. BEGIN
  14286. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  14287. RETURN instruction
  14288. END Add;
  14289. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14290. VAR instruction: IntermediateCode.Instruction;
  14291. BEGIN
  14292. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  14293. RETURN instruction
  14294. END And;
  14295. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14296. VAR instruction: IntermediateCode.Instruction;
  14297. BEGIN
  14298. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  14299. RETURN instruction
  14300. END Or;
  14301. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14302. VAR instruction: IntermediateCode.Instruction;
  14303. BEGIN
  14304. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  14305. RETURN instruction
  14306. END Xor;
  14307. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14308. VAR instruction: IntermediateCode.Instruction;
  14309. BEGIN
  14310. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  14311. RETURN instruction
  14312. END Shl;
  14313. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14314. VAR instruction: IntermediateCode.Instruction;
  14315. BEGIN
  14316. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  14317. RETURN instruction
  14318. END Shr;
  14319. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14320. VAR instruction: IntermediateCode.Instruction;
  14321. BEGIN
  14322. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  14323. RETURN instruction
  14324. END Rol;
  14325. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  14326. VAR instruction: IntermediateCode.Instruction;
  14327. BEGIN
  14328. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  14329. RETURN instruction
  14330. END Ror;
  14331. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  14332. VAR instruction: IntermediateCode.Instruction;
  14333. BEGIN
  14334. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  14335. RETURN instruction
  14336. END Cas;
  14337. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  14338. VAR instruction: IntermediateCode.Instruction;
  14339. BEGIN
  14340. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  14341. ASSERT(~IntermediateCode.IsVectorRegister(src));
  14342. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  14343. RETURN instruction
  14344. END Copy;
  14345. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  14346. VAR instruction: IntermediateCode.Instruction;
  14347. BEGIN
  14348. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  14349. RETURN instruction
  14350. END Fill;
  14351. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  14352. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  14353. BEGIN
  14354. string := IntermediateCode.String(s);
  14355. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  14356. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  14357. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  14358. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  14359. RETURN instruction
  14360. END Asm;
  14361. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  14362. VAR instruction: IntermediateCode.Instruction;
  14363. BEGIN
  14364. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  14365. RETURN instruction
  14366. END Data;
  14367. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  14368. VAR instruction: IntermediateCode.Instruction;
  14369. BEGIN
  14370. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  14371. IntermediateCode.SetSubType(instruction, subtype);
  14372. RETURN instruction
  14373. END SpecialInstruction;
  14374. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  14375. VAR op1: IntermediateCode.Operand;
  14376. VAR instruction: IntermediateCode.Instruction;
  14377. BEGIN
  14378. (*! generate a warning if size exceeds a certain limit *)
  14379. (*
  14380. ASSERT(bytes < 1000000); (* sanity check *)
  14381. *)
  14382. ASSERT(0 <= units); (* sanity check *)
  14383. IntermediateCode.InitNumber(op1,units);
  14384. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  14385. RETURN instruction
  14386. END Reserve;
  14387. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  14388. VAR op1: IntermediateCode.Operand;
  14389. VAR instruction: IntermediateCode.Instruction;
  14390. BEGIN
  14391. IntermediateCode.InitNumber(op1,position.start);
  14392. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  14393. RETURN instruction
  14394. END LabelInstruction;
  14395. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  14396. VAR pc: LONGINT;
  14397. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  14398. BEGIN
  14399. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  14400. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  14401. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  14402. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  14403. IF instr.op1.type.form = IntermediateCode.Float THEN
  14404. RETURN instr.op1.floatValue = op.floatValue
  14405. ELSE
  14406. RETURN instr.op1.intValue = op.intValue
  14407. END;
  14408. END ProvidesValue;
  14409. BEGIN
  14410. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  14411. pc := 0;
  14412. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  14413. INC(pc);
  14414. END;
  14415. IF pc = data.pc THEN
  14416. data.Emit(Data(Basic.invalidPosition,vop));
  14417. END;
  14418. RETURN pc
  14419. END EnterImmediate;
  14420. PROCEDURE Init;
  14421. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  14422. BEGIN
  14423. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  14424. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  14425. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  14426. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  14427. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  14428. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  14429. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  14430. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  14431. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  14432. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  14433. IntermediateCode.InitOperand(emptyOperand);
  14434. FOR i := 0 TO NumberSystemCalls-1 DO
  14435. name := "@SystemCall";
  14436. Basic.AppendNumber(name,i);
  14437. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  14438. END;
  14439. END Init;
  14440. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  14441. BEGIN
  14442. RETURN (symbol # NIL) & symbol.NeedsSection();
  14443. END IsExported;
  14444. BEGIN
  14445. Init;
  14446. END FoxIntermediateBackend.
  14447. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  14448. # Release.Build --path="/temp/obg/" Win32 ~
  14449. # 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 ~
  14450. FStols.CloseFiles A2Z.exe ~
  14451. System.FreeDownTo FoxIntermediateBackend ~
  14452. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  14453. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  14454. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  14455. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  14456. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  14457. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  14458. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  14459. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  14460. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  14461. GenericLinker.Mod Loader.Mod BootConsole.Mod