FoxIntermediateBackend.Mod 541 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385238623872388238923902391239223932394239523962397239823992400240124022403240424052406240724082409241024112412241324142415241624172418241924202421242224232424242524262427242824292430243124322433243424352436243724382439244024412442244324442445244624472448244924502451245224532454245524562457245824592460246124622463246424652466246724682469247024712472247324742475247624772478247924802481248224832484248524862487248824892490249124922493249424952496249724982499250025012502250325042505250625072508250925102511251225132514251525162517251825192520252125222523252425252526252725282529253025312532253325342535253625372538253925402541254225432544254525462547254825492550255125522553255425552556255725582559256025612562256325642565256625672568256925702571257225732574257525762577257825792580258125822583258425852586258725882589259025912592259325942595259625972598259926002601260226032604260526062607260826092610261126122613261426152616261726182619262026212622262326242625262626272628262926302631263226332634263526362637263826392640264126422643264426452646264726482649265026512652265326542655265626572658265926602661266226632664266526662667266826692670267126722673267426752676267726782679268026812682268326842685268626872688268926902691269226932694269526962697269826992700270127022703270427052706270727082709271027112712271327142715271627172718271927202721272227232724272527262727272827292730273127322733273427352736273727382739274027412742274327442745274627472748274927502751275227532754275527562757275827592760276127622763276427652766276727682769277027712772277327742775277627772778277927802781278227832784278527862787278827892790279127922793279427952796279727982799280028012802280328042805280628072808280928102811281228132814281528162817281828192820282128222823282428252826282728282829283028312832283328342835283628372838283928402841284228432844284528462847284828492850285128522853285428552856285728582859286028612862286328642865286628672868286928702871287228732874287528762877287828792880288128822883288428852886288728882889289028912892289328942895289628972898289929002901290229032904290529062907290829092910291129122913291429152916291729182919292029212922292329242925292629272928292929302931293229332934293529362937293829392940294129422943294429452946294729482949295029512952295329542955295629572958295929602961296229632964296529662967296829692970297129722973297429752976297729782979298029812982298329842985298629872988298929902991299229932994299529962997299829993000300130023003300430053006300730083009301030113012301330143015301630173018301930203021302230233024302530263027302830293030303130323033303430353036303730383039304030413042304330443045304630473048304930503051305230533054305530563057305830593060306130623063306430653066306730683069307030713072307330743075307630773078307930803081308230833084308530863087308830893090309130923093309430953096309730983099310031013102310331043105310631073108310931103111311231133114311531163117311831193120312131223123312431253126312731283129313031313132313331343135313631373138313931403141314231433144314531463147314831493150315131523153315431553156315731583159316031613162316331643165316631673168316931703171317231733174317531763177317831793180318131823183318431853186318731883189319031913192319331943195319631973198319932003201320232033204320532063207320832093210321132123213321432153216321732183219322032213222322332243225322632273228322932303231323232333234323532363237323832393240324132423243324432453246324732483249325032513252325332543255325632573258325932603261326232633264326532663267326832693270327132723273327432753276327732783279328032813282328332843285328632873288328932903291329232933294329532963297329832993300330133023303330433053306330733083309331033113312331333143315331633173318331933203321332233233324332533263327332833293330333133323333333433353336333733383339334033413342334333443345334633473348334933503351335233533354335533563357335833593360336133623363336433653366336733683369337033713372337333743375337633773378337933803381338233833384338533863387338833893390339133923393339433953396339733983399340034013402340334043405340634073408340934103411341234133414341534163417341834193420342134223423342434253426342734283429343034313432343334343435343634373438343934403441344234433444344534463447344834493450345134523453345434553456345734583459346034613462346334643465346634673468346934703471347234733474347534763477347834793480348134823483348434853486348734883489349034913492349334943495349634973498349935003501350235033504350535063507350835093510351135123513351435153516351735183519352035213522352335243525352635273528352935303531353235333534353535363537353835393540354135423543354435453546354735483549355035513552355335543555355635573558355935603561356235633564356535663567356835693570357135723573357435753576357735783579358035813582358335843585358635873588358935903591359235933594359535963597359835993600360136023603360436053606360736083609361036113612361336143615361636173618361936203621362236233624362536263627362836293630363136323633363436353636363736383639364036413642364336443645364636473648364936503651365236533654365536563657365836593660366136623663366436653666366736683669367036713672367336743675367636773678367936803681368236833684368536863687368836893690369136923693369436953696369736983699370037013702370337043705370637073708370937103711371237133714371537163717371837193720372137223723372437253726372737283729373037313732373337343735373637373738373937403741374237433744374537463747374837493750375137523753375437553756375737583759376037613762376337643765376637673768376937703771377237733774377537763777377837793780378137823783378437853786378737883789379037913792379337943795379637973798379938003801380238033804380538063807380838093810381138123813381438153816381738183819382038213822382338243825382638273828382938303831383238333834383538363837383838393840384138423843384438453846384738483849385038513852385338543855385638573858385938603861386238633864386538663867386838693870387138723873387438753876387738783879388038813882388338843885388638873888388938903891389238933894389538963897389838993900390139023903390439053906390739083909391039113912391339143915391639173918391939203921392239233924392539263927392839293930393139323933393439353936393739383939394039413942394339443945394639473948394939503951395239533954395539563957395839593960396139623963396439653966396739683969397039713972397339743975397639773978397939803981398239833984398539863987398839893990399139923993399439953996399739983999400040014002400340044005400640074008400940104011401240134014401540164017401840194020402140224023402440254026402740284029403040314032403340344035403640374038403940404041404240434044404540464047404840494050405140524053405440554056405740584059406040614062406340644065406640674068406940704071407240734074407540764077407840794080408140824083408440854086408740884089409040914092409340944095409640974098409941004101410241034104410541064107410841094110411141124113411441154116411741184119412041214122412341244125412641274128412941304131413241334134413541364137413841394140414141424143414441454146414741484149415041514152415341544155415641574158415941604161416241634164416541664167416841694170417141724173417441754176417741784179418041814182418341844185418641874188418941904191419241934194419541964197419841994200420142024203420442054206420742084209421042114212421342144215421642174218421942204221422242234224422542264227422842294230423142324233423442354236423742384239424042414242424342444245424642474248424942504251425242534254425542564257425842594260426142624263426442654266426742684269427042714272427342744275427642774278427942804281428242834284428542864287428842894290429142924293429442954296429742984299430043014302430343044305430643074308430943104311431243134314431543164317431843194320432143224323432443254326432743284329433043314332433343344335433643374338433943404341434243434344434543464347434843494350435143524353435443554356435743584359436043614362436343644365436643674368436943704371437243734374437543764377437843794380438143824383438443854386438743884389439043914392439343944395439643974398439944004401440244034404440544064407440844094410441144124413441444154416441744184419442044214422442344244425442644274428442944304431443244334434443544364437443844394440444144424443444444454446444744484449445044514452445344544455445644574458445944604461446244634464446544664467446844694470447144724473447444754476447744784479448044814482448344844485448644874488448944904491449244934494449544964497449844994500450145024503450445054506450745084509451045114512451345144515451645174518451945204521452245234524452545264527452845294530453145324533453445354536453745384539454045414542454345444545454645474548454945504551455245534554455545564557455845594560456145624563456445654566456745684569457045714572457345744575457645774578457945804581458245834584458545864587458845894590459145924593459445954596459745984599460046014602460346044605460646074608460946104611461246134614461546164617461846194620462146224623462446254626462746284629463046314632463346344635463646374638463946404641464246434644464546464647464846494650465146524653465446554656465746584659466046614662466346644665466646674668466946704671467246734674467546764677467846794680468146824683468446854686468746884689469046914692469346944695469646974698469947004701470247034704470547064707470847094710471147124713471447154716471747184719472047214722472347244725472647274728472947304731473247334734473547364737473847394740474147424743474447454746474747484749475047514752475347544755475647574758475947604761476247634764476547664767476847694770477147724773477447754776477747784779478047814782478347844785478647874788478947904791479247934794479547964797479847994800480148024803480448054806480748084809481048114812481348144815481648174818481948204821482248234824482548264827482848294830483148324833483448354836483748384839484048414842484348444845484648474848484948504851485248534854485548564857485848594860486148624863486448654866486748684869487048714872487348744875487648774878487948804881488248834884488548864887488848894890489148924893489448954896489748984899490049014902490349044905490649074908490949104911491249134914491549164917491849194920492149224923492449254926492749284929493049314932493349344935493649374938493949404941494249434944494549464947494849494950495149524953495449554956495749584959496049614962496349644965496649674968496949704971497249734974497549764977497849794980498149824983498449854986498749884989499049914992499349944995499649974998499950005001500250035004500550065007500850095010501150125013501450155016501750185019502050215022502350245025502650275028502950305031503250335034503550365037503850395040504150425043504450455046504750485049505050515052505350545055505650575058505950605061506250635064506550665067506850695070507150725073507450755076507750785079508050815082508350845085508650875088508950905091509250935094509550965097509850995100510151025103510451055106510751085109511051115112511351145115511651175118511951205121512251235124512551265127512851295130513151325133513451355136513751385139514051415142514351445145514651475148514951505151515251535154515551565157515851595160516151625163516451655166516751685169517051715172517351745175517651775178517951805181518251835184518551865187518851895190519151925193519451955196519751985199520052015202520352045205520652075208520952105211521252135214521552165217521852195220522152225223522452255226522752285229523052315232523352345235523652375238523952405241524252435244524552465247524852495250525152525253525452555256525752585259526052615262526352645265526652675268526952705271527252735274527552765277527852795280528152825283528452855286528752885289529052915292529352945295529652975298529953005301530253035304530553065307530853095310531153125313531453155316531753185319532053215322532353245325532653275328532953305331533253335334533553365337533853395340534153425343534453455346534753485349535053515352535353545355535653575358535953605361536253635364536553665367536853695370537153725373537453755376537753785379538053815382538353845385538653875388538953905391539253935394539553965397539853995400540154025403540454055406540754085409541054115412541354145415541654175418541954205421542254235424542554265427542854295430543154325433543454355436543754385439544054415442544354445445544654475448544954505451545254535454545554565457545854595460546154625463546454655466546754685469547054715472547354745475547654775478547954805481548254835484548554865487548854895490549154925493549454955496549754985499550055015502550355045505550655075508550955105511551255135514551555165517551855195520552155225523552455255526552755285529553055315532553355345535553655375538553955405541554255435544554555465547554855495550555155525553555455555556555755585559556055615562556355645565556655675568556955705571557255735574557555765577557855795580558155825583558455855586558755885589559055915592559355945595559655975598559956005601560256035604560556065607560856095610561156125613561456155616561756185619562056215622562356245625562656275628562956305631563256335634563556365637563856395640564156425643564456455646564756485649565056515652565356545655565656575658565956605661566256635664566556665667566856695670567156725673567456755676567756785679568056815682568356845685568656875688568956905691569256935694569556965697569856995700570157025703570457055706570757085709571057115712571357145715571657175718571957205721572257235724572557265727572857295730573157325733573457355736573757385739574057415742574357445745574657475748574957505751575257535754575557565757575857595760576157625763576457655766576757685769577057715772577357745775577657775778577957805781578257835784578557865787578857895790579157925793579457955796579757985799580058015802580358045805580658075808580958105811581258135814581558165817581858195820582158225823582458255826582758285829583058315832583358345835583658375838583958405841584258435844584558465847584858495850585158525853585458555856585758585859586058615862586358645865586658675868586958705871587258735874587558765877587858795880588158825883588458855886588758885889589058915892589358945895589658975898589959005901590259035904590559065907590859095910591159125913591459155916591759185919592059215922592359245925592659275928592959305931593259335934593559365937593859395940594159425943594459455946594759485949595059515952595359545955595659575958595959605961596259635964596559665967596859695970597159725973597459755976597759785979598059815982598359845985598659875988598959905991599259935994599559965997599859996000600160026003600460056006600760086009601060116012601360146015601660176018601960206021602260236024602560266027602860296030603160326033603460356036603760386039604060416042604360446045604660476048604960506051605260536054605560566057605860596060606160626063606460656066606760686069607060716072607360746075607660776078607960806081608260836084608560866087608860896090609160926093609460956096609760986099610061016102610361046105610661076108610961106111611261136114611561166117611861196120612161226123612461256126612761286129613061316132613361346135613661376138613961406141614261436144614561466147614861496150615161526153615461556156615761586159616061616162616361646165616661676168616961706171617261736174617561766177617861796180618161826183618461856186618761886189619061916192619361946195619661976198619962006201620262036204620562066207620862096210621162126213621462156216621762186219622062216222622362246225622662276228622962306231623262336234623562366237623862396240624162426243624462456246624762486249625062516252625362546255625662576258625962606261626262636264626562666267626862696270627162726273627462756276627762786279628062816282628362846285628662876288628962906291629262936294629562966297629862996300630163026303630463056306630763086309631063116312631363146315631663176318631963206321632263236324632563266327632863296330633163326333633463356336633763386339634063416342634363446345634663476348634963506351635263536354635563566357635863596360636163626363636463656366636763686369637063716372637363746375637663776378637963806381638263836384638563866387638863896390639163926393639463956396639763986399640064016402640364046405640664076408640964106411641264136414641564166417641864196420642164226423642464256426642764286429643064316432643364346435643664376438643964406441644264436444644564466447644864496450645164526453645464556456645764586459646064616462646364646465646664676468646964706471647264736474647564766477647864796480648164826483648464856486648764886489649064916492649364946495649664976498649965006501650265036504650565066507650865096510651165126513651465156516651765186519652065216522652365246525652665276528652965306531653265336534653565366537653865396540654165426543654465456546654765486549655065516552655365546555655665576558655965606561656265636564656565666567656865696570657165726573657465756576657765786579658065816582658365846585658665876588658965906591659265936594659565966597659865996600660166026603660466056606660766086609661066116612661366146615661666176618661966206621662266236624662566266627662866296630663166326633663466356636663766386639664066416642664366446645664666476648664966506651665266536654665566566657665866596660666166626663666466656666666766686669667066716672667366746675667666776678667966806681668266836684668566866687668866896690669166926693669466956696669766986699670067016702670367046705670667076708670967106711671267136714671567166717671867196720672167226723672467256726672767286729673067316732673367346735673667376738673967406741674267436744674567466747674867496750675167526753675467556756675767586759676067616762676367646765676667676768676967706771677267736774677567766777677867796780678167826783678467856786678767886789679067916792679367946795679667976798679968006801680268036804680568066807680868096810681168126813681468156816681768186819682068216822682368246825682668276828682968306831683268336834683568366837683868396840684168426843684468456846684768486849685068516852685368546855685668576858685968606861686268636864686568666867686868696870687168726873687468756876687768786879688068816882688368846885688668876888688968906891689268936894689568966897689868996900690169026903690469056906690769086909691069116912691369146915691669176918691969206921692269236924692569266927692869296930693169326933693469356936693769386939694069416942694369446945694669476948694969506951695269536954695569566957695869596960696169626963696469656966696769686969697069716972697369746975697669776978697969806981698269836984698569866987698869896990699169926993699469956996699769986999700070017002700370047005700670077008700970107011701270137014701570167017701870197020702170227023702470257026702770287029703070317032703370347035703670377038703970407041704270437044704570467047704870497050705170527053705470557056705770587059706070617062706370647065706670677068706970707071707270737074707570767077707870797080708170827083708470857086708770887089709070917092709370947095709670977098709971007101710271037104710571067107710871097110711171127113711471157116711771187119712071217122712371247125712671277128712971307131713271337134713571367137713871397140714171427143714471457146714771487149715071517152715371547155715671577158715971607161716271637164716571667167716871697170717171727173717471757176717771787179718071817182718371847185718671877188718971907191719271937194719571967197719871997200720172027203720472057206720772087209721072117212721372147215721672177218721972207221722272237224722572267227722872297230723172327233723472357236723772387239724072417242724372447245724672477248724972507251725272537254725572567257725872597260726172627263726472657266726772687269727072717272727372747275727672777278727972807281728272837284728572867287728872897290729172927293729472957296729772987299730073017302730373047305730673077308730973107311731273137314731573167317731873197320732173227323732473257326732773287329733073317332733373347335733673377338733973407341734273437344734573467347734873497350735173527353735473557356735773587359736073617362736373647365736673677368736973707371737273737374737573767377737873797380738173827383738473857386738773887389739073917392739373947395739673977398739974007401740274037404740574067407740874097410741174127413741474157416741774187419742074217422742374247425742674277428742974307431743274337434743574367437743874397440744174427443744474457446744774487449745074517452745374547455745674577458745974607461746274637464746574667467746874697470747174727473747474757476747774787479748074817482748374847485748674877488748974907491749274937494749574967497749874997500750175027503750475057506750775087509751075117512751375147515751675177518751975207521752275237524752575267527752875297530753175327533753475357536753775387539754075417542754375447545754675477548754975507551755275537554755575567557755875597560756175627563756475657566756775687569757075717572757375747575757675777578757975807581758275837584758575867587758875897590759175927593759475957596759775987599760076017602760376047605760676077608760976107611761276137614761576167617761876197620762176227623762476257626762776287629763076317632763376347635763676377638763976407641764276437644764576467647764876497650765176527653765476557656765776587659766076617662766376647665766676677668766976707671767276737674767576767677767876797680768176827683768476857686768776887689769076917692769376947695769676977698769977007701770277037704770577067707770877097710771177127713771477157716771777187719772077217722772377247725772677277728772977307731773277337734773577367737773877397740774177427743774477457746774777487749775077517752775377547755775677577758775977607761776277637764776577667767776877697770777177727773777477757776777777787779778077817782778377847785778677877788778977907791779277937794779577967797779877997800780178027803780478057806780778087809781078117812781378147815781678177818781978207821782278237824782578267827782878297830783178327833783478357836783778387839784078417842784378447845784678477848784978507851785278537854785578567857785878597860786178627863786478657866786778687869787078717872787378747875787678777878787978807881788278837884788578867887788878897890789178927893789478957896789778987899790079017902790379047905790679077908790979107911791279137914791579167917791879197920792179227923792479257926792779287929793079317932793379347935793679377938793979407941794279437944794579467947794879497950795179527953795479557956795779587959796079617962796379647965796679677968796979707971797279737974797579767977797879797980798179827983798479857986798779887989799079917992799379947995799679977998799980008001800280038004800580068007800880098010801180128013801480158016801780188019802080218022802380248025802680278028802980308031803280338034803580368037803880398040804180428043804480458046804780488049805080518052805380548055805680578058805980608061806280638064806580668067806880698070807180728073807480758076807780788079808080818082808380848085808680878088808980908091809280938094809580968097809880998100810181028103810481058106810781088109811081118112811381148115811681178118811981208121812281238124812581268127812881298130813181328133813481358136813781388139814081418142814381448145814681478148814981508151815281538154815581568157815881598160816181628163816481658166816781688169817081718172817381748175817681778178817981808181818281838184818581868187818881898190819181928193819481958196819781988199820082018202820382048205820682078208820982108211821282138214821582168217821882198220822182228223822482258226822782288229823082318232823382348235823682378238823982408241824282438244824582468247824882498250825182528253825482558256825782588259826082618262826382648265826682678268826982708271827282738274827582768277827882798280828182828283828482858286828782888289829082918292829382948295829682978298829983008301830283038304830583068307830883098310831183128313831483158316831783188319832083218322832383248325832683278328832983308331833283338334833583368337833883398340834183428343834483458346834783488349835083518352835383548355835683578358835983608361836283638364836583668367836883698370837183728373837483758376837783788379838083818382838383848385838683878388838983908391839283938394839583968397839883998400840184028403840484058406840784088409841084118412841384148415841684178418841984208421842284238424842584268427842884298430843184328433843484358436843784388439844084418442844384448445844684478448844984508451845284538454845584568457845884598460846184628463846484658466846784688469847084718472847384748475847684778478847984808481848284838484848584868487848884898490849184928493849484958496849784988499850085018502850385048505850685078508850985108511851285138514851585168517851885198520852185228523852485258526852785288529853085318532853385348535853685378538853985408541854285438544854585468547854885498550855185528553855485558556855785588559856085618562856385648565856685678568856985708571857285738574857585768577857885798580858185828583858485858586858785888589859085918592859385948595859685978598859986008601860286038604860586068607860886098610861186128613861486158616861786188619862086218622862386248625862686278628862986308631863286338634863586368637863886398640864186428643864486458646864786488649865086518652865386548655865686578658865986608661866286638664866586668667866886698670867186728673867486758676867786788679868086818682868386848685868686878688868986908691869286938694869586968697869886998700870187028703870487058706870787088709871087118712871387148715871687178718871987208721872287238724872587268727872887298730873187328733873487358736873787388739874087418742874387448745874687478748874987508751875287538754875587568757875887598760876187628763876487658766876787688769877087718772877387748775877687778778877987808781878287838784878587868787878887898790879187928793879487958796879787988799880088018802880388048805880688078808880988108811881288138814881588168817881888198820882188228823882488258826882788288829883088318832883388348835883688378838883988408841884288438844884588468847884888498850885188528853885488558856885788588859886088618862886388648865886688678868886988708871887288738874887588768877887888798880888188828883888488858886888788888889889088918892889388948895889688978898889989008901890289038904890589068907890889098910891189128913891489158916891789188919892089218922892389248925892689278928892989308931893289338934893589368937893889398940894189428943894489458946894789488949895089518952895389548955895689578958895989608961896289638964896589668967896889698970897189728973897489758976897789788979898089818982898389848985898689878988898989908991899289938994899589968997899889999000900190029003900490059006900790089009901090119012901390149015901690179018901990209021902290239024902590269027902890299030903190329033903490359036903790389039904090419042904390449045904690479048904990509051905290539054905590569057905890599060906190629063906490659066906790689069907090719072907390749075907690779078907990809081908290839084908590869087908890899090909190929093909490959096909790989099910091019102910391049105910691079108910991109111911291139114911591169117911891199120912191229123912491259126912791289129913091319132913391349135913691379138913991409141914291439144914591469147914891499150915191529153915491559156915791589159916091619162916391649165916691679168916991709171917291739174917591769177917891799180918191829183918491859186918791889189919091919192919391949195919691979198919992009201920292039204920592069207920892099210921192129213921492159216921792189219922092219222922392249225922692279228922992309231923292339234923592369237923892399240924192429243924492459246924792489249925092519252925392549255925692579258925992609261926292639264926592669267926892699270927192729273927492759276927792789279928092819282928392849285928692879288928992909291929292939294929592969297929892999300930193029303930493059306930793089309931093119312931393149315931693179318931993209321932293239324932593269327932893299330933193329333933493359336933793389339934093419342934393449345934693479348934993509351935293539354935593569357935893599360936193629363936493659366936793689369937093719372937393749375937693779378937993809381938293839384938593869387938893899390939193929393939493959396939793989399940094019402940394049405940694079408940994109411941294139414941594169417941894199420942194229423942494259426942794289429943094319432943394349435943694379438943994409441944294439444944594469447944894499450945194529453945494559456945794589459946094619462946394649465946694679468946994709471947294739474947594769477947894799480948194829483948494859486948794889489949094919492949394949495949694979498949995009501950295039504950595069507950895099510951195129513951495159516951795189519952095219522952395249525952695279528952995309531953295339534953595369537953895399540954195429543954495459546954795489549955095519552955395549555955695579558955995609561956295639564956595669567956895699570957195729573957495759576957795789579958095819582958395849585958695879588958995909591959295939594959595969597959895999600960196029603960496059606960796089609961096119612961396149615961696179618961996209621962296239624962596269627962896299630963196329633963496359636963796389639964096419642964396449645964696479648964996509651965296539654965596569657965896599660966196629663966496659666966796689669967096719672967396749675967696779678967996809681968296839684968596869687968896899690969196929693969496959696969796989699970097019702970397049705970697079708970997109711971297139714971597169717971897199720972197229723972497259726972797289729973097319732973397349735973697379738973997409741974297439744974597469747974897499750975197529753975497559756975797589759976097619762976397649765976697679768976997709771977297739774977597769777977897799780978197829783978497859786978797889789979097919792979397949795979697979798979998009801980298039804980598069807980898099810981198129813981498159816981798189819982098219822982398249825982698279828982998309831983298339834983598369837983898399840984198429843984498459846984798489849985098519852985398549855985698579858985998609861986298639864986598669867986898699870987198729873987498759876987798789879988098819882988398849885988698879888988998909891989298939894989598969897989898999900990199029903990499059906990799089909991099119912991399149915991699179918991999209921992299239924992599269927992899299930993199329933993499359936993799389939994099419942994399449945994699479948994999509951995299539954995599569957995899599960996199629963996499659966996799689969997099719972997399749975997699779978997999809981998299839984998599869987998899899990999199929993999499959996999799989999100001000110002100031000410005100061000710008100091001010011100121001310014100151001610017100181001910020100211002210023100241002510026100271002810029100301003110032100331003410035100361003710038100391004010041100421004310044100451004610047100481004910050100511005210053100541005510056100571005810059100601006110062100631006410065100661006710068100691007010071100721007310074100751007610077100781007910080100811008210083100841008510086100871008810089100901009110092100931009410095100961009710098100991010010101101021010310104101051010610107101081010910110101111011210113101141011510116101171011810119101201012110122101231012410125101261012710128101291013010131101321013310134101351013610137101381013910140101411014210143101441014510146101471014810149101501015110152101531015410155101561015710158101591016010161101621016310164101651016610167101681016910170101711017210173101741017510176101771017810179101801018110182101831018410185101861018710188101891019010191101921019310194101951019610197101981019910200102011020210203102041020510206102071020810209102101021110212102131021410215102161021710218102191022010221102221022310224102251022610227102281022910230102311023210233102341023510236102371023810239102401024110242102431024410245102461024710248102491025010251102521025310254102551025610257102581025910260102611026210263102641026510266102671026810269102701027110272102731027410275102761027710278102791028010281102821028310284102851028610287102881028910290102911029210293102941029510296102971029810299103001030110302103031030410305103061030710308103091031010311103121031310314103151031610317103181031910320103211032210323103241032510326103271032810329103301033110332103331033410335103361033710338103391034010341103421034310344103451034610347103481034910350103511035210353103541035510356103571035810359103601036110362103631036410365103661036710368103691037010371103721037310374103751037610377103781037910380103811038210383103841038510386103871038810389103901039110392103931039410395103961039710398103991040010401104021040310404104051040610407104081040910410104111041210413104141041510416104171041810419104201042110422104231042410425104261042710428104291043010431104321043310434104351043610437104381043910440104411044210443104441044510446104471044810449104501045110452104531045410455104561045710458104591046010461104621046310464104651046610467104681046910470104711047210473104741047510476104771047810479104801048110482104831048410485104861048710488104891049010491104921049310494104951049610497104981049910500105011050210503105041050510506105071050810509105101051110512105131051410515105161051710518105191052010521105221052310524105251052610527105281052910530105311053210533105341053510536105371053810539105401054110542105431054410545105461054710548105491055010551105521055310554105551055610557105581055910560105611056210563105641056510566105671056810569105701057110572105731057410575105761057710578105791058010581105821058310584105851058610587105881058910590105911059210593105941059510596105971059810599106001060110602106031060410605106061060710608106091061010611106121061310614106151061610617106181061910620106211062210623106241062510626106271062810629106301063110632106331063410635106361063710638106391064010641106421064310644106451064610647106481064910650106511065210653106541065510656106571065810659106601066110662106631066410665106661066710668106691067010671106721067310674106751067610677106781067910680106811068210683106841068510686106871068810689106901069110692106931069410695106961069710698106991070010701107021070310704107051070610707107081070910710107111071210713107141071510716107171071810719107201072110722107231072410725107261072710728107291073010731107321073310734107351073610737107381073910740107411074210743107441074510746107471074810749107501075110752107531075410755107561075710758107591076010761107621076310764107651076610767107681076910770107711077210773107741077510776107771077810779107801078110782107831078410785107861078710788107891079010791107921079310794107951079610797107981079910800108011080210803108041080510806108071080810809108101081110812108131081410815108161081710818108191082010821108221082310824108251082610827108281082910830108311083210833108341083510836108371083810839108401084110842108431084410845108461084710848108491085010851108521085310854108551085610857108581085910860108611086210863108641086510866108671086810869108701087110872108731087410875108761087710878108791088010881108821088310884108851088610887108881088910890108911089210893108941089510896108971089810899109001090110902109031090410905109061090710908109091091010911109121091310914109151091610917109181091910920109211092210923109241092510926109271092810929109301093110932109331093410935109361093710938109391094010941109421094310944109451094610947109481094910950109511095210953109541095510956109571095810959109601096110962109631096410965109661096710968109691097010971109721097310974109751097610977109781097910980109811098210983109841098510986109871098810989109901099110992109931099410995109961099710998109991100011001110021100311004110051100611007110081100911010110111101211013110141101511016110171101811019110201102111022110231102411025110261102711028110291103011031110321103311034110351103611037110381103911040110411104211043110441104511046110471104811049110501105111052110531105411055110561105711058110591106011061110621106311064110651106611067110681106911070110711107211073110741107511076110771107811079110801108111082110831108411085110861108711088110891109011091110921109311094110951109611097110981109911100111011110211103111041110511106111071110811109111101111111112111131111411115111161111711118111191112011121111221112311124111251112611127111281112911130111311113211133111341113511136111371113811139111401114111142111431114411145111461114711148111491115011151111521115311154111551115611157111581115911160111611116211163111641116511166111671116811169111701117111172111731117411175111761117711178111791118011181111821118311184111851118611187111881118911190111911119211193111941119511196111971119811199112001120111202112031120411205112061120711208112091121011211112121121311214112151121611217112181121911220112211122211223112241122511226112271122811229112301123111232112331123411235112361123711238112391124011241112421124311244112451124611247112481124911250112511125211253112541125511256112571125811259112601126111262112631126411265112661126711268112691127011271112721127311274112751127611277112781127911280112811128211283112841128511286112871128811289112901129111292112931129411295112961129711298112991130011301113021130311304113051130611307113081130911310113111131211313113141131511316113171131811319113201132111322113231132411325113261132711328113291133011331113321133311334113351133611337113381133911340113411134211343113441134511346113471134811349113501135111352113531135411355113561135711358113591136011361113621136311364113651136611367113681136911370113711137211373113741137511376113771137811379113801138111382113831138411385113861138711388113891139011391113921139311394113951139611397113981139911400114011140211403114041140511406114071140811409114101141111412114131141411415114161141711418114191142011421114221142311424114251142611427114281142911430114311143211433114341143511436114371143811439114401144111442114431144411445114461144711448114491145011451114521145311454114551145611457114581145911460114611146211463114641146511466114671146811469114701147111472114731147411475114761147711478114791148011481114821148311484114851148611487114881148911490114911149211493114941149511496114971149811499115001150111502115031150411505115061150711508115091151011511115121151311514115151151611517115181151911520115211152211523115241152511526115271152811529115301153111532115331153411535115361153711538115391154011541115421154311544115451154611547115481154911550115511155211553115541155511556115571155811559115601156111562115631156411565115661156711568115691157011571115721157311574115751157611577115781157911580115811158211583115841158511586115871158811589115901159111592115931159411595115961159711598115991160011601116021160311604116051160611607116081160911610116111161211613116141161511616116171161811619116201162111622116231162411625116261162711628116291163011631116321163311634116351163611637116381163911640116411164211643116441164511646116471164811649116501165111652116531165411655116561165711658116591166011661116621166311664116651166611667116681166911670116711167211673116741167511676116771167811679116801168111682116831168411685116861168711688116891169011691116921169311694116951169611697116981169911700117011170211703117041170511706117071170811709117101171111712117131171411715117161171711718117191172011721117221172311724117251172611727117281172911730117311173211733117341173511736117371173811739117401174111742117431174411745117461174711748117491175011751117521175311754117551175611757117581175911760117611176211763117641176511766117671176811769117701177111772117731177411775117761177711778117791178011781117821178311784117851178611787117881178911790117911179211793117941179511796117971179811799118001180111802118031180411805118061180711808118091181011811118121181311814118151181611817118181181911820118211182211823118241182511826118271182811829118301183111832118331183411835118361183711838118391184011841118421184311844118451184611847118481184911850118511185211853118541185511856118571185811859118601186111862118631186411865118661186711868118691187011871118721187311874118751187611877118781187911880118811188211883118841188511886118871188811889118901189111892118931189411895118961189711898118991190011901119021190311904119051190611907119081190911910119111191211913119141191511916119171191811919119201192111922119231192411925119261192711928119291193011931119321193311934119351193611937119381193911940119411194211943119441194511946119471194811949119501195111952119531195411955119561195711958119591196011961119621196311964119651196611967119681196911970119711197211973119741197511976119771197811979119801198111982119831198411985119861198711988119891199011991119921199311994119951199611997119981199912000120011200212003120041200512006120071200812009120101201112012120131201412015120161201712018120191202012021120221202312024120251202612027120281202912030120311203212033120341203512036120371203812039120401204112042120431204412045120461204712048120491205012051120521205312054120551205612057120581205912060120611206212063120641206512066120671206812069120701207112072120731207412075120761207712078120791208012081120821208312084120851208612087120881208912090120911209212093120941209512096120971209812099121001210112102121031210412105121061210712108121091211012111121121211312114121151211612117121181211912120121211212212123121241212512126121271212812129121301213112132121331213412135121361213712138121391214012141121421214312144121451214612147121481214912150121511215212153121541215512156121571215812159121601216112162121631216412165121661216712168121691217012171121721217312174121751217612177121781217912180121811218212183121841218512186121871218812189121901219112192121931219412195121961219712198121991220012201122021220312204122051220612207122081220912210122111221212213122141221512216122171221812219122201222112222122231222412225122261222712228122291223012231122321223312234122351223612237122381223912240122411224212243122441224512246122471224812249122501225112252122531225412255122561225712258122591226012261122621226312264122651226612267122681226912270122711227212273122741227512276122771227812279122801228112282122831228412285122861228712288122891229012291122921229312294122951229612297122981229912300123011230212303123041230512306123071230812309123101231112312123131231412315123161231712318123191232012321123221232312324123251232612327123281232912330123311233212333123341233512336123371233812339123401234112342123431234412345123461234712348123491235012351123521235312354123551235612357123581235912360123611236212363123641236512366123671236812369123701237112372123731237412375123761237712378123791238012381123821238312384123851238612387123881238912390123911239212393123941239512396123971239812399124001240112402124031240412405124061240712408124091241012411124121241312414124151241612417124181241912420124211242212423124241242512426124271242812429124301243112432124331243412435124361243712438124391244012441124421244312444124451244612447124481244912450124511245212453124541245512456124571245812459124601246112462124631246412465124661246712468124691247012471124721247312474124751247612477124781247912480124811248212483124841248512486124871248812489124901249112492124931249412495124961249712498124991250012501125021250312504125051250612507125081250912510125111251212513125141251512516125171251812519125201252112522125231252412525125261252712528125291253012531125321253312534125351253612537125381253912540125411254212543125441254512546125471254812549125501255112552125531255412555125561255712558125591256012561125621256312564125651256612567125681256912570125711257212573125741257512576125771257812579125801258112582125831258412585125861258712588125891259012591125921259312594125951259612597125981259912600126011260212603126041260512606126071260812609126101261112612126131261412615126161261712618126191262012621126221262312624126251262612627126281262912630126311263212633126341263512636126371263812639126401264112642126431264412645126461264712648126491265012651126521265312654126551265612657126581265912660126611266212663126641266512666126671266812669126701267112672126731267412675126761267712678126791268012681126821268312684126851268612687126881268912690126911269212693126941269512696126971269812699127001270112702127031270412705127061270712708127091271012711127121271312714127151271612717127181271912720127211272212723127241272512726127271272812729127301273112732127331273412735127361273712738127391274012741127421274312744127451274612747127481274912750127511275212753127541275512756127571275812759127601276112762127631276412765127661276712768127691277012771127721277312774127751277612777127781277912780127811278212783127841278512786127871278812789127901279112792127931279412795127961279712798127991280012801128021280312804128051280612807128081280912810128111281212813128141281512816128171281812819128201282112822128231282412825128261282712828128291283012831128321283312834128351283612837128381283912840128411284212843128441284512846128471284812849128501285112852128531285412855128561285712858128591286012861128621286312864128651286612867128681286912870128711287212873128741287512876128771287812879128801288112882128831288412885128861288712888128891289012891128921289312894128951289612897128981289912900129011290212903129041290512906129071290812909129101291112912129131291412915129161291712918129191292012921129221292312924129251292612927129281292912930129311293212933129341293512936129371293812939129401294112942129431294412945129461294712948129491295012951129521295312954129551295612957129581295912960129611296212963129641296512966129671296812969129701297112972129731297412975129761297712978129791298012981129821298312984129851298612987129881298912990129911299212993129941299512996129971299812999130001300113002130031300413005130061300713008130091301013011130121301313014130151301613017130181301913020130211302213023130241302513026130271302813029130301303113032130331303413035130361303713038130391304013041130421304313044130451304613047130481304913050130511305213053130541305513056130571305813059130601306113062130631306413065130661306713068130691307013071130721307313074130751307613077130781307913080130811308213083130841308513086130871308813089130901309113092130931309413095130961309713098130991310013101131021310313104131051310613107131081310913110131111311213113131141311513116131171311813119131201312113122131231312413125131261312713128131291313013131131321313313134131351313613137131381313913140131411314213143131441314513146131471314813149131501315113152131531315413155131561315713158131591316013161131621316313164131651316613167131681316913170131711317213173131741317513176131771317813179131801318113182131831318413185131861318713188131891319013191131921319313194131951319613197131981319913200132011320213203132041320513206132071320813209132101321113212132131321413215132161321713218132191322013221132221322313224132251322613227132281322913230132311323213233132341323513236132371323813239132401324113242132431324413245132461324713248132491325013251132521325313254132551325613257132581325913260132611326213263132641326513266132671326813269132701327113272132731327413275132761327713278132791328013281132821328313284132851328613287132881328913290132911329213293132941329513296132971329813299133001330113302133031330413305133061330713308133091331013311133121331313314133151331613317133181331913320133211332213323133241332513326133271332813329133301333113332133331333413335133361333713338133391334013341133421334313344133451334613347133481334913350133511335213353133541335513356133571335813359133601336113362133631336413365133661336713368133691337013371133721337313374133751337613377133781337913380133811338213383133841338513386133871338813389133901339113392133931339413395133961339713398133991340013401134021340313404134051340613407134081340913410134111341213413134141341513416134171341813419134201342113422134231342413425134261342713428134291343013431134321343313434134351343613437134381343913440134411344213443134441344513446134471344813449134501345113452134531345413455134561345713458134591346013461134621346313464134651346613467134681346913470134711347213473134741347513476134771347813479134801348113482134831348413485134861348713488134891349013491134921349313494134951349613497134981349913500135011350213503135041350513506135071350813509135101351113512135131351413515135161351713518135191352013521135221352313524135251352613527135281352913530135311353213533135341353513536135371353813539135401354113542135431354413545135461354713548135491355013551135521355313554135551355613557135581355913560135611356213563135641356513566135671356813569135701357113572135731357413575135761357713578135791358013581135821358313584135851358613587135881358913590135911359213593135941359513596135971359813599136001360113602136031360413605136061360713608136091361013611136121361313614136151361613617136181361913620136211362213623136241362513626136271362813629136301363113632136331363413635136361363713638136391364013641136421364313644136451364613647136481364913650136511365213653136541365513656136571365813659136601366113662136631366413665136661366713668136691367013671136721367313674136751367613677136781367913680136811368213683136841368513686136871368813689136901369113692136931369413695136961369713698136991370013701137021370313704137051370613707137081370913710137111371213713137141371513716137171371813719137201372113722137231372413725137261372713728137291373013731137321373313734137351373613737137381373913740137411374213743137441374513746137471374813749137501375113752137531375413755137561375713758137591376013761137621376313764137651376613767137681376913770137711377213773137741377513776137771377813779137801378113782137831378413785137861378713788137891379013791137921379313794137951379613797137981379913800138011380213803138041380513806138071380813809138101381113812138131381413815138161381713818138191382013821138221382313824138251382613827138281382913830138311383213833138341383513836138371383813839138401384113842138431384413845138461384713848138491385013851138521385313854138551385613857138581385913860138611386213863138641386513866138671386813869138701387113872138731387413875138761387713878138791388013881138821388313884138851388613887138881388913890138911389213893138941389513896138971389813899139001390113902
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Diagnostics, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. Trace = FALSE;
  42. TraceRegisterUsageCount=TRUE;
  43. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  44. (** system call numbers *)
  45. NumberSystemCalls* = 12;
  46. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  47. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  48. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  49. DefaultRuntimeModuleName ="Runtime";
  50. DefaultTraceModuleName ="KernelLog";
  51. ChannelModuleName = "Channels";
  52. suppressModuleRegistration=FALSE;
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. EntryPriority=-4;
  59. FirstPriority=-3;
  60. InitPriority=-2;
  61. ExitPriority=-1;
  62. StrictChecks = FALSE;
  63. BasePointerTypeSize = 5;
  64. BaseArrayTypeSize = BasePointerTypeSize + 3;
  65. LengthOffset = BasePointerTypeSize + 0;
  66. DataOffset = BasePointerTypeSize + 1;
  67. DescriptorOffset = BasePointerTypeSize + 2;
  68. BaseRecordTypeSize = BasePointerTypeSize + 2;
  69. ActionOffset = BasePointerTypeSize + 0;
  70. MonitorOffset = BasePointerTypeSize + 1;
  71. BaseObjectTypeSize = BaseRecordTypeSize;
  72. ActionTypeSize = 3;
  73. MonitorTypeSize = 7;
  74. ProcessorOffset = BaseObjectTypeSize + 1;
  75. StackLimitOffset* = BaseObjectTypeSize + 3;
  76. QuantumOffset = BaseObjectTypeSize + 4;
  77. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  78. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  79. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  80. Size2Flag = 4; (* size = 2 *)
  81. Size3Flag = 5; (* size = 3 *)
  82. Size4Flag = 6; (* size = 4 *)
  83. Size5Flag = 7; (* size = 5 *)
  84. Size6Flag = 8; (* size = 6 *)
  85. Size7Flag = 9; (* size = 7 *)
  86. Size8Flag = 10; (* size = 8 *)
  87. ReflectionSupport = TRUE;
  88. TYPE
  89. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  90. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  91. Operand = RECORD
  92. mode: SHORTINT;
  93. op: IntermediateCode.Operand;
  94. tag: IntermediateCode.Operand;
  95. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  96. dimOffset: LONGINT;
  97. END;
  98. Fixup= POINTER TO RECORD
  99. pc: LONGINT;
  100. nextFixup: Fixup;
  101. END;
  102. WriteBackCall = POINTER TO RECORD
  103. call: SyntaxTree.ProcedureCallDesignator;
  104. next: WriteBackCall;
  105. END;
  106. Label= OBJECT
  107. VAR
  108. fixups: Fixup;
  109. section: IntermediateCode.Section;
  110. pc: LONGINT;
  111. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  112. BEGIN
  113. SELF.section := section; pc := -1;
  114. END InitLabel;
  115. PROCEDURE Resolve(pc: LONGINT);
  116. VAR at: LONGINT;
  117. BEGIN
  118. SELF.pc := pc;
  119. WHILE(fixups # NIL) DO
  120. at := fixups.pc;
  121. section.PatchAddress(at,pc);
  122. fixups := fixups.nextFixup;
  123. END;
  124. END Resolve;
  125. PROCEDURE AddFixup(at: LONGINT);
  126. VAR fixup: Fixup;
  127. BEGIN
  128. ASSERT(pc=-1);
  129. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  130. END AddFixup;
  131. END Label;
  132. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  133. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  134. VAR
  135. backend: IntermediateBackend;
  136. implementationVisitor: ImplementationVisitor;
  137. meta: MetaDataGenerator;
  138. system: Global.System;
  139. currentScope: SyntaxTree.Scope;
  140. module: Sections.Module;
  141. moduleSelf: SyntaxTree.Variable;
  142. dump: BOOLEAN;
  143. forceModuleBody: BOOLEAN;
  144. addressType: IntermediateCode.Type;
  145. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  146. BEGIN
  147. currentScope := NIL; module := NIL; moduleSelf := NIL;
  148. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  149. SELF.dump := dump;
  150. SELF.backend := backend;
  151. SELF.forceModuleBody := forceModuleBody;
  152. addressType := IntermediateCode.GetType(system,system.addressType)
  153. END Init;
  154. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  155. BEGIN
  156. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  157. END Error;
  158. PROCEDURE Type(x: SyntaxTree.Type);
  159. BEGIN
  160. x.Accept(SELF);
  161. END Type;
  162. (** types **)
  163. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  164. BEGIN (* no code emission *) END VisitBasicType;
  165. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  166. BEGIN (* no code emission *) END VisitCharacterType;
  167. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  168. BEGIN (* no code emission *) END VisitIntegerType;
  169. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  170. BEGIN (* no code emission *) END VisitFloatType;
  171. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  172. BEGIN (* no code emission *) END VisitComplexType;
  173. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  174. VAR type: SyntaxTree.Type;
  175. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  176. type := x.resolved;
  177. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  178. meta.CheckTypeDeclaration(type);
  179. END;
  180. END VisitQualifiedType;
  181. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  182. BEGIN (* no code emission *) END VisitStringType;
  183. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  184. BEGIN (* no code emission *)
  185. END VisitArrayRangeType;
  186. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  187. BEGIN (* no code emission *) END VisitArrayType;
  188. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  189. BEGIN
  190. meta.CheckTypeDeclaration(x);
  191. END VisitMathArrayType;
  192. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  193. BEGIN
  194. meta.CheckTypeDeclaration(x);
  195. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  196. END VisitPointerType;
  197. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  198. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  199. BEGIN (* no code emission *)
  200. meta.CheckTypeDeclaration(x);
  201. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  202. IF x.pointerType.typeDeclaration # NIL THEN
  203. td := x.pointerType.typeDeclaration
  204. ELSE
  205. td := x.typeDeclaration
  206. END;
  207. Global.GetSymbolName(td,name);
  208. (* code section for object *)
  209. END;
  210. Scope(x.recordScope);
  211. END VisitRecordType;
  212. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  213. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  214. BEGIN
  215. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  216. WHILE (this # NIL) & (this.identifier# id) DO
  217. this := this.nextModifier;
  218. END;
  219. RETURN this # NIL
  220. END HasFlag;
  221. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  222. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  223. (*
  224. PROCEDURE CreatePorts(type: SyntaxTree.Type; len: LONGINT);
  225. VAR i,len2: LONGINT; baseType: SyntaxTree.Type;
  226. BEGIN
  227. FOR i := 0 TO len-1 DO
  228. IF SemanticChecker.IsStaticArray(type, baseType, len2) THEN
  229. CreatePorts(baseType, len*len2);
  230. ELSIF IsSemiDynamicArray(type) THEN
  231. port := MIN(LONGINT); (* unknown port address from here on *)
  232. ELSE
  233. IntermediateCode.InitImmediate(op,addressType,adr);
  234. symbol.Emit(Data(-1,op));
  235. INC(port);
  236. END;
  237. END;
  238. END CreatePorts;
  239. *)
  240. BEGIN
  241. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  242. (*
  243. IF (x.cellScope.ownerModule = module.module) THEN
  244. td := x.typeDeclaration;
  245. Global.GetSymbolSegmentedName(td,name);
  246. (* code section for object *)
  247. END;
  248. *)
  249. (* unnecessary to generate space for ports: already represented as hidden variables *)
  250. (*
  251. port := 0;
  252. parameter := x.firstParameter;
  253. WHILE parameter # NIL DO
  254. type := parameter.type.resolved;
  255. Global.GetSymbolSegmentedName(parameter,name);
  256. symbol := implementationVisitor.NewSection(module.allSections, Sections.ConstSection,name,parameter,dump);
  257. IF port >= 0 THEN
  258. (*! could be used for optimization: query value here ???
  259. parameter.SetResolved(SyntaxTree.NewIntegerValue(-1, port));
  260. *)
  261. END;
  262. CreatePorts(type, 1);
  263. IF backend.cellsAreObjects THEN
  264. IF IsStaticArray(parameter.type.resolved) THEN
  265. Error(parameter.position, "static arrays of ports are currently not implemented, please use a property (array property of port)");
  266. END;
  267. END;
  268. parameter := parameter.nextParameter;
  269. END;
  270. *)
  271. capabilities := {};
  272. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  273. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  274. backend.SetCapabilities(capabilities);
  275. Scope(x.cellScope);
  276. END VisitCellType;
  277. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  278. BEGIN (* no code emission *) END VisitProcedureType;
  279. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  280. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  281. END VisitEnumerationType;
  282. (* symbols *)
  283. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  284. BEGIN
  285. Procedure(x);
  286. END VisitProcedure;
  287. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  288. BEGIN
  289. Procedure(x);
  290. END VisitOperator;
  291. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  292. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  293. size, addressSize: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  294. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  295. BEGIN
  296. type := type.resolved;
  297. IF type IS SyntaxTree.RecordType THEN
  298. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  299. ELSIF (type IS SyntaxTree.ArrayType) THEN
  300. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  301. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  302. END;
  303. ELSIF type IS SyntaxTree.MathArrayType THEN
  304. WITH type: SyntaxTree.MathArrayType DO
  305. IF type.form = SyntaxTree.Open THEN
  306. RETURN TRUE
  307. ELSIF type.form = SyntaxTree.Static THEN
  308. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  309. END;
  310. END;
  311. END;
  312. RETURN FALSE
  313. END TypeNeedsInitialization;
  314. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  315. VAR variable: SyntaxTree.Variable;
  316. BEGIN
  317. variable := scope.firstVariable;
  318. WHILE variable # NIL DO
  319. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  320. IF variable.initializer # NIL THEN RETURN TRUE END;
  321. variable := variable.nextVariable;
  322. END;
  323. RETURN FALSE
  324. END ScopeNeedsInitialization;
  325. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset: LONGINT);
  326. BEGIN
  327. size := offset - lastUpdated;
  328. IF size > 0 THEN
  329. irv.Emit(Reserve(x.position,size));
  330. END;
  331. irv.Emit(Data(x.position, op));
  332. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  333. END SingleInitialize;
  334. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset: LONGINT);
  335. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable;
  336. BEGIN
  337. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  338. WITH type: SyntaxTree.RecordType DO
  339. baseType := type.baseType;
  340. IF baseType # NIL THEN
  341. baseType := baseType.resolved;
  342. IF baseType IS SyntaxTree.PointerType THEN
  343. baseType := baseType(SyntaxTree.PointerType).pointerBase
  344. END;
  345. Initialize(baseType,NIL, offset);
  346. END;
  347. variable := type.recordScope.firstVariable;
  348. WHILE variable # NIL DO
  349. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  350. variable := variable.nextVariable
  351. END;
  352. | type: SyntaxTree.ArrayType DO
  353. IF type.form = SyntaxTree.Static THEN
  354. baseType := type.arrayBase;
  355. IF TypeNeedsInitialization(baseType) THEN
  356. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  357. FOR i := 0 TO type.staticLength-1 DO
  358. Initialize(baseType,NIL,offset+i*size);
  359. END;
  360. END;
  361. END;
  362. | type: SyntaxTree.MathArrayType DO
  363. IF type.form = SyntaxTree.Open THEN
  364. dim := DynamicDim(type);
  365. baseType := SemanticChecker.ArrayBase(type,dim);
  366. imm := IntermediateCode.Immediate(addressType,dim);
  367. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  368. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  369. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  370. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  371. (* flags remain empty (=0) for open array *)
  372. ELSIF type.form = SyntaxTree.Static THEN
  373. baseType := type.arrayBase;
  374. IF TypeNeedsInitialization(baseType) THEN
  375. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  376. ASSERT(type.staticLength < 1024*1024*1024);
  377. FOR i := 0 TO type.staticLength-1 DO
  378. Initialize(baseType,NIL,offset+i*size);
  379. END;
  380. END;
  381. END;
  382. ELSE
  383. IF initializer # NIL THEN
  384. implementationVisitor.Evaluate(initializer, op);
  385. SingleInitialize(op.op, offset);
  386. END;
  387. END;
  388. END Initialize;
  389. BEGIN
  390. IF x.externalName # NIL THEN RETURN END;
  391. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  392. (* code section for variable *)
  393. Global.GetSymbolSegmentedName(x,name);
  394. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  395. irv.SetExported(IsExported(x));
  396. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  397. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  398. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  399. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  400. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  401. FOR i := 0 TO DynamicDim(x.type)-1 DO
  402. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  403. END;
  404. ELSE
  405. lastUpdated:= 0;
  406. IF implementationVisitor.newObjectFile & ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  407. Initialize(x.type, x.initializer, 0);
  408. END;
  409. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  410. IF size > 0 THEN
  411. irv.Emit(Reserve(x.position,size));
  412. END;
  413. IF ~x.fixed THEN
  414. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  415. ELSE
  416. align := x.alignment;
  417. END;
  418. irv.SetPositionOrAlignment(x.fixed, align);
  419. meta.CheckTypeDeclaration(x.type);
  420. END;
  421. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  422. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  423. END;
  424. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  425. END VisitVariable;
  426. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  427. VAR name: Basic.SegmentedName; irv, irl: IntermediateCode.Section; op: Operand; dim: LONGINT;
  428. BEGIN
  429. HALT(100);
  430. (*
  431. ASSERT(currentScope.outerScope IS SyntaxTree.CellScope);
  432. (* code section for variable *)
  433. Global.GetSymbolSegmentedName(x,name);
  434. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  435. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  436. (*
  437. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  438. *)
  439. IF IsSemiDynamicArray(x.type) & ~backend.cellsAreObjects THEN
  440. HALT(100);
  441. irv.Emit(Reserve(x.position, system.addressSize));
  442. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  443. irl := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  444. irl.Emit(Reserve(x.position, DynamicDim(x.type) * system.addressSize));
  445. ELSIF x.defaultValue = NIL THEN
  446. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))))
  447. ELSE
  448. implementationVisitor.inData := TRUE;
  449. implementationVisitor.Evaluate(x.defaultValue, op);
  450. irv.Emit(Data(x.position,op.op));
  451. implementationVisitor.inData := FALSE;
  452. END;
  453. meta.CheckTypeDeclaration(x.type);
  454. *)
  455. END VisitParameter;
  456. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  457. BEGIN
  458. Type(x.declaredType); (* => code in objects *)
  459. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  460. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  461. END;
  462. END VisitTypeDeclaration;
  463. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  464. BEGIN
  465. IF (SyntaxTree.Public * x.access # {}) THEN
  466. implementationVisitor.VisitConstant(x);
  467. END;
  468. END VisitConstant;
  469. PROCEDURE Scope(x: SyntaxTree.Scope);
  470. VAR procedure: SyntaxTree.Procedure;
  471. constant: SyntaxTree.Constant;
  472. variable: SyntaxTree.Variable;
  473. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  474. BEGIN
  475. prevScope := currentScope;
  476. currentScope := x;
  477. (* constants treated in implementation visitor *)
  478. typeDeclaration := x.firstTypeDeclaration;
  479. WHILE typeDeclaration # NIL DO
  480. VisitTypeDeclaration(typeDeclaration);
  481. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  482. END;
  483. variable := x.firstVariable;
  484. WHILE variable # NIL DO
  485. VisitVariable(variable);
  486. variable := variable.nextVariable;
  487. END;
  488. procedure := x.firstProcedure;
  489. WHILE procedure # NIL DO
  490. VisitProcedure(procedure);
  491. procedure := procedure.nextProcedure;
  492. END;
  493. constant := x.firstConstant;
  494. WHILE constant # NIL DO
  495. VisitConstant(constant);
  496. constant := constant.nextConstant;
  497. END;
  498. currentScope := prevScope;
  499. END Scope;
  500. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  501. VAR parameter: SyntaxTree.Parameter;
  502. BEGIN
  503. parameter := first;
  504. WHILE parameter # NIL DO
  505. VisitParameter(parameter);
  506. parameter := parameter.nextParameter;
  507. END;
  508. END Parameters;
  509. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  510. VAR scope: SyntaxTree.ProcedureScope;
  511. prevScope: SyntaxTree.Scope;
  512. inline, finalizer: BOOLEAN;
  513. procedureType: SyntaxTree.ProcedureType;
  514. pc: LONGINT;
  515. stackSize: LONGINT;
  516. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  517. null,size,src,dest,fp,res: IntermediateCode.Operand;
  518. cc: LONGINT;
  519. cellType: SyntaxTree.CellType;
  520. registerNumber: LONGINT;
  521. registerParameter: Backend.Registers;
  522. registerParameters: LONGINT;
  523. registerClass: IntermediateCode.RegisterClass;
  524. type: IntermediateCode.Type;
  525. formalParameter: SyntaxTree.Parameter;
  526. recordType: SyntaxTree.RecordType;
  527. isModuleBody: BOOLEAN;
  528. PROCEDURE Signature;
  529. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  530. BEGIN
  531. procedureType := x.type(SyntaxTree.ProcedureType);
  532. returnType := procedureType.returnType;
  533. IF returnType # NIL THEN
  534. meta.CheckTypeDeclaration(returnType)
  535. END;
  536. parameter := procedureType.firstParameter;
  537. WHILE parameter # NIL DO
  538. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  539. parameter := parameter.nextParameter;
  540. END;
  541. END Signature;
  542. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  543. VAR result: BOOLEAN;
  544. BEGIN
  545. result := FALSE;
  546. IF x = SyntaxTree.invalidExpression THEN
  547. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  548. result := TRUE;
  549. value := x.resolved(SyntaxTree.IntegerValue).value;
  550. ELSE
  551. Error(x.position,"expression is not an integer constant");
  552. END;
  553. RETURN result;
  554. END CheckIntegerValue;
  555. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  556. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  557. BEGIN
  558. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  559. WHILE (this # NIL) & (this.identifier # id) DO
  560. this := this.nextModifier;
  561. END;
  562. IF this # NIL THEN
  563. IF this.expression = NIL THEN
  564. Error(this.position,"expected expression value");
  565. ELSIF CheckIntegerValue(this.expression,value) THEN
  566. END;
  567. RETURN TRUE
  568. ELSE RETURN FALSE
  569. END;
  570. END HasValue;
  571. CONST DefaultDataMemorySize=512;
  572. BEGIN
  573. IF x.externalName # NIL THEN RETURN END;
  574. (*
  575. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  576. *)
  577. (* code section for this procedure *)
  578. scope := x.procedureScope;
  579. prevScope := currentScope;
  580. currentScope := scope;
  581. procedureType := x.type(SyntaxTree.ProcedureType);
  582. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  583. implementationVisitor.temporaries.Init;
  584. implementationVisitor.usedRegisters := NIL;
  585. implementationVisitor.registerUsageCount.Init;
  586. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  587. IF (scope.body # NIL) & (x.isInline) THEN
  588. inline := TRUE;
  589. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  590. ir.SetExported(IsExported(x));
  591. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  592. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  593. IF backend.cellsAreObjects THEN
  594. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  595. ir.SetExported(IsExported(x));
  596. ELSE
  597. RETURN; (* cellnet cannot be compiled for final static hardware *)
  598. END;
  599. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  600. inline := FALSE;
  601. AddBodyCallStub(x);
  602. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  603. ir.SetExported(IsExported(x));
  604. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  605. inline := FALSE;
  606. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  607. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  608. AddBodyCallStub(x);
  609. AddStackAllocation(x,stackSize);
  610. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  611. ir.SetExported(IsExported(x));
  612. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  613. inline := FALSE;
  614. Parameters(procedureType.firstParameter);
  615. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  616. ir.SetExported(IsExported(x));
  617. ELSE
  618. inline := FALSE;
  619. IF x.isEntry OR x.isExit THEN
  620. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  621. ir.SetExported(TRUE);
  622. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  623. ELSE
  624. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  625. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  626. END;
  627. END;
  628. cc := procedureType.callingConvention;
  629. IF scope.body # NIL THEN
  630. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  631. registerNumber := 0;
  632. IF ~inline THEN
  633. IF scope.lastVariable = NIL THEN
  634. stackSize := 0
  635. ELSE
  636. stackSize := scope.lastVariable.offsetInBits;
  637. IF stackSize <0 THEN stackSize := -stackSize END;
  638. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  639. END;
  640. (*
  641. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  642. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  643. *)
  644. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  645. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  646. END;
  647. pc := ir.pc-1;
  648. (*
  649. ir.Emit(Nop(position)); (* placeholder for fill *)
  650. *)
  651. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  652. registerParameter := backend.GetParameterRegisters(procedureType.callingConvention);
  653. IF registerParameter = NIL THEN registerParameters := 0
  654. ELSE registerParameters := LEN(registerParameter)
  655. END;
  656. formalParameter := procedureType.lastParameter;
  657. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  658. IF ~PassInRegister(formalParameter) THEN
  659. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  660. ELSE
  661. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, registerParameter[registerNumber]);
  662. type := GetType(system, formalParameter.type);
  663. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  664. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  665. ir.Emit(Mov(-1,dest, src));
  666. implementationVisitor.ReleaseIntermediateOperand(src);
  667. INC(registerNumber);
  668. formalParameter := formalParameter.prevParameter;
  669. END;
  670. END;
  671. END;
  672. ir.EnterValidPAF;
  673. END;
  674. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  675. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  676. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  677. IF scope.lastVariable # NIL THEN
  678. stackSize := scope.lastVariable.offsetInBits;
  679. IF stackSize <0 THEN stackSize := -stackSize END;
  680. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  681. END;
  682. END;
  683. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  684. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  685. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  686. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  687. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  688. ir.EmitAt(pc,Push(size));
  689. implementationVisitor.StaticCallOperand(result,procedure);
  690. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  691. END;
  692. *)
  693. END;
  694. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  695. IF stackSize > 0 THEN
  696. IF (stackSize MOD system.addressSize = 0) THEN
  697. null := IntermediateCode.Immediate(addressType,0);
  698. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  699. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  700. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  701. ELSE
  702. null := IntermediateCode.Immediate(int8,0);
  703. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  704. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  705. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  706. END;
  707. (*! should potentially be called by backend -- enter might initialize
  708. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  709. *)
  710. END;
  711. ir.ExitValidPAF;
  712. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  713. finalizer := FALSE;
  714. IF backend.cooperative & x.isFinalizer THEN
  715. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  716. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  717. GetRecordTypeName(recordType,name);
  718. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  719. END;
  720. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  721. IF backend.cooperative THEN
  722. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  723. IF implementationVisitor.profile & ~isModuleBody THEN
  724. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  725. END;
  726. END;
  727. implementationVisitor.EmitLeave(ir, x.position,cc);
  728. IF finalizer THEN
  729. IF backend.hasLinkRegister THEN
  730. ir.Emit(Pop(-1, 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,cc));
  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 ~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 ~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,cc);
  770. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  771. ELSE
  772. ir.Emit(Nop(x.position));
  773. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  774. implementationVisitor.EmitLeave(ir,x.position,cc);
  775. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  776. END;
  777. END;
  778. END
  779. END;
  780. ELSE (* force body for procedures *)
  781. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  782. ir.EnterValidPAF;
  783. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  784. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  785. ir.ExitValidPAF;
  786. implementationVisitor.EmitLeave(ir,x.position,cc);
  787. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  788. END;
  789. Scope(scope);
  790. Signature;
  791. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  792. currentScope := prevScope;
  793. END Procedure;
  794. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  795. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  796. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  797. BEGIN
  798. ASSERT (bodyProcedure # NIL);
  799. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  800. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  801. procedure.SetScope(bodyProcedure.scope);
  802. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  803. procedure.SetAccess(SyntaxTree.Hidden);
  804. Global.GetSymbolSegmentedName (procedure,name);
  805. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  806. ir.SetExported(TRUE);
  807. ir.SetPriority(InitPriority);
  808. Global.GetSymbolSegmentedName (bodyProcedure,name);
  809. IF (backend.newObjectFile OR backend.cooperative) & ~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: LONGINT); (* 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.InitCodeSection,name,NIL,dump);
  832. ir.SetExported(TRUE);
  833. ir.SetPriority(FirstPriority);
  834. IntermediateCode.InitImmediate(op,addressType,initStack);
  835. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  836. END AddStackAllocation;
  837. (** entry function to visit a complete module *)
  838. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  839. VAR
  840. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  841. hasDynamicOperatorDeclarations: BOOLEAN;
  842. operator: SyntaxTree.Operator;
  843. import: SyntaxTree.Import;
  844. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  845. BEGIN
  846. type := type.resolved;
  847. IF type IS SyntaxTree.RecordType THEN
  848. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  849. ELSIF (type IS SyntaxTree.ArrayType) THEN
  850. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  851. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  852. END;
  853. ELSIF type IS SyntaxTree.MathArrayType THEN
  854. WITH type: SyntaxTree.MathArrayType DO
  855. IF type.form = SyntaxTree.Open THEN
  856. RETURN TRUE
  857. ELSIF type.form = SyntaxTree.Static THEN
  858. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  859. END;
  860. END;
  861. END;
  862. RETURN FALSE
  863. END TypeNeedsInitialization;
  864. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  865. VAR variable: SyntaxTree.Variable;
  866. BEGIN
  867. variable := scope.firstVariable;
  868. WHILE variable # NIL DO
  869. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  870. IF variable.initializer # NIL THEN RETURN TRUE END;
  871. variable := variable.nextVariable;
  872. END;
  873. RETURN FALSE
  874. END ScopeNeedsInitialization;
  875. BEGIN
  876. ASSERT(x # NIL); ASSERT(module # NIL);
  877. SELF.module := module;
  878. (* add import names to the generated Sections.Module *)
  879. import := x.moduleScope.firstImport;
  880. WHILE import # NIL DO
  881. import.module.GetName(idstr);
  882. module.imports.AddName(idstr);
  883. import := import.nextImport
  884. END;
  885. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  886. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  887. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  888. moduleSelf.SetType(system.anyType);
  889. moduleSelf.SetScope(x.moduleScope);
  890. moduleSelf.SetUntraced(TRUE);
  891. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  892. ir.SetExported(TRUE);
  893. IntermediateCode.InitImmediate(op,addressType,0);
  894. ir.Emit(Data(-1,op));
  895. END;
  896. implementationVisitor.module := module;
  897. implementationVisitor.moduleScope := x.moduleScope;
  898. implementationVisitor.moduleSelf := moduleSelf;
  899. implementationVisitor.canBeLoaded := TRUE;
  900. meta.SetModule(module);
  901. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  902. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  903. END;
  904. IF backend.profile THEN
  905. EnsureBodyProcedure(x.moduleScope);
  906. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  907. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  908. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  909. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  910. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  911. implementationVisitor.EmitEnter(implementationVisitor.profileInit,-1,NIL,0,0,0);
  912. Global.GetModuleName(module.module,idstr);
  913. implementationVisitor.ProfilerAddModule(idstr);
  914. implementationVisitor.numberProcedures := 0;
  915. END;
  916. implementationVisitor.profile := backend.profile;
  917. (* check if there is at least one dynamic operator locally defined *)
  918. hasDynamicOperatorDeclarations := FALSE;
  919. operator := x.moduleScope.firstOperator;
  920. WHILE operator # NIL DO
  921. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  922. operator := operator.nextOperator
  923. END;
  924. (* add operator initialization code section *)
  925. IF hasDynamicOperatorDeclarations THEN
  926. EnsureBodyProcedure(x.moduleScope);
  927. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  928. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  929. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,-1,NIL,0,0,0);
  930. END;
  931. Scope(x.moduleScope);
  932. IF hasDynamicOperatorDeclarations THEN
  933. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,-1,0);
  934. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  935. END;
  936. IF backend.profile THEN
  937. implementationVisitor.ProfilerPatchInit;
  938. END;
  939. END Module;
  940. END DeclarationVisitor;
  941. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  942. RegisterUsageCount*=OBJECT
  943. VAR used: UsedArray; count: LONGINT;
  944. PROCEDURE &Init;
  945. VAR i: LONGINT;
  946. BEGIN
  947. count := 0;
  948. IF used = NIL THEN NEW(used,64); END;
  949. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  950. END Init;
  951. PROCEDURE Grow;
  952. VAR new: UsedArray; size,i: LONGINT;
  953. BEGIN
  954. size := LEN(used)*2;
  955. NEW(new,size);
  956. FOR i := 0 TO LEN(used)-1 DO
  957. new[i].count := used[i].count;
  958. new[i].type := used[i].type;
  959. new[i].map := used[i].map
  960. END;
  961. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  962. used := new
  963. END Grow;
  964. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  965. BEGIN
  966. INC(count);
  967. IF count = LEN(used) THEN Grow END;
  968. used[count].type := type;
  969. used[count].class := class;
  970. used[count].map := count;
  971. RETURN count;
  972. END Next;
  973. PROCEDURE IncUse(register: LONGINT);
  974. BEGIN
  975. INC(used[register].count);
  976. (*
  977. IF (register = 1) & (count > 30) THEN
  978. D.TraceBack;
  979. END;
  980. *)
  981. END IncUse;
  982. PROCEDURE DecUse(register: LONGINT);
  983. BEGIN
  984. DEC(used[register].count);
  985. END DecUse;
  986. PROCEDURE Map(register: LONGINT): LONGINT;
  987. VAR map : LONGINT;
  988. BEGIN
  989. IF register > 0 THEN
  990. map := used[register].map;
  991. WHILE register # map DO register := map; map := used[register].map END;
  992. END;
  993. RETURN register
  994. END Map;
  995. PROCEDURE Use(register: LONGINT): LONGINT;
  996. BEGIN
  997. IF register< LEN(used) THEN
  998. RETURN used[register].count
  999. ELSE
  1000. RETURN 0
  1001. END
  1002. END Use;
  1003. END RegisterUsageCount;
  1004. RegisterEntry = POINTER TO RECORD
  1005. prev,next: RegisterEntry;
  1006. register: LONGINT;
  1007. registerClass: IntermediateCode.RegisterClass;
  1008. type: IntermediateCode.Type;
  1009. END;
  1010. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1011. Variables = OBJECT (Basic.List)
  1012. VAR
  1013. inUse: VariableUse;
  1014. registerIndex: LONGINT;
  1015. PROCEDURE & Init;
  1016. VAR i: LONGINT;
  1017. BEGIN
  1018. InitList(16);
  1019. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1020. registerIndex := 1024;
  1021. END Init;
  1022. PROCEDURE GetUsage(VAR use: VariableUse);
  1023. BEGIN
  1024. use := inUse;
  1025. END GetUsage;
  1026. PROCEDURE SetUsage(CONST use: VariableUse);
  1027. BEGIN
  1028. inUse := use;
  1029. END SetUsage;
  1030. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1031. VAR any: ANY;
  1032. BEGIN
  1033. any := Get(i);;
  1034. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1035. END GetVariable;
  1036. PROCEDURE Occupy(pos: LONGINT);
  1037. BEGIN
  1038. INCL(inUse[pos DIV 32], pos MOD 32);
  1039. END Occupy;
  1040. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1041. BEGIN
  1042. Occupy(Length());
  1043. Add(v);
  1044. END AddVariable;
  1045. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  1046. VAR var : SyntaxTree.Variable;
  1047. BEGIN
  1048. FOR pos := 0 TO Length()-1 DO
  1049. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  1050. var := GetVariable(pos);
  1051. IF type.SameType(var.type) THEN
  1052. Occupy(pos); RETURN var
  1053. END;
  1054. END;
  1055. END;
  1056. pos := Length();
  1057. RETURN NIL
  1058. END GetFreeVariable;
  1059. END Variables;
  1060. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  1061. SymbolMapper = OBJECT
  1062. VAR
  1063. first: SymbolMap;
  1064. PROCEDURE & Init;
  1065. BEGIN
  1066. first := NIL;
  1067. END Init;
  1068. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  1069. VAR new: SymbolMap;
  1070. BEGIN
  1071. NEW(new); new.this := this; new.to := to; new.tag := tag;
  1072. new.next := first; first := new;
  1073. END Add;
  1074. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1075. VAR s: SymbolMap;
  1076. BEGIN
  1077. s := first;
  1078. WHILE (s # NIL) & (s.this # this) DO
  1079. s := s.next
  1080. END;
  1081. RETURN s
  1082. END Get;
  1083. END SymbolMapper;
  1084. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1085. VAR
  1086. system: Global.System;
  1087. section: IntermediateCode.Section;
  1088. module: Sections.Module;
  1089. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1090. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1091. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1092. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1093. checker: SemanticChecker.Checker;
  1094. backend: IntermediateBackend;
  1095. meta: MetaDataGenerator;
  1096. position: LONGINT;
  1097. moduleSelf: SyntaxTree.Variable;
  1098. (* variables for hand over of variables / temporary state *)
  1099. currentScope: SyntaxTree.Scope;
  1100. constantDeclaration : SyntaxTree.Symbol;
  1101. result: Operand; (* result of the most recent expression / statement *)
  1102. destination: IntermediateCode.Operand;
  1103. arrayDestinationTag: IntermediateCode.Operand;
  1104. arrayDestinationDimension:LONGINT;
  1105. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1106. conditional: BOOLEAN;
  1107. trueLabel, falseLabel, exitLabel: Label;
  1108. locked: BOOLEAN;
  1109. (*
  1110. usedRegisters: Registers;
  1111. *)
  1112. registerUsageCount: RegisterUsageCount;
  1113. usedRegisters: RegisterEntry;
  1114. (* useful operands and types *)
  1115. nil,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1116. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  1117. commentPrintout: Printout.Printer;
  1118. dump: Streams.Writer;
  1119. tagsAvailable : BOOLEAN;
  1120. supportedInstruction: SupportedInstructionProcedure;
  1121. supportedImmediate: SupportedImmediateProcedure;
  1122. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1123. emitLabels: BOOLEAN;
  1124. runtimeModuleName : SyntaxTree.IdentifierString;
  1125. newObjectFile: BOOLEAN;
  1126. indexCounter: LONGINT;
  1127. profile: BOOLEAN;
  1128. profileId, profileInit: IntermediateCode.Section;
  1129. profileInitPatchPosition: LONGINT;
  1130. numberProcedures: LONGINT;
  1131. procedureResultDesignator : SyntaxTree.Designator;
  1132. operatorInitializationCodeSection: IntermediateCode.Section;
  1133. fingerPrinter: FingerPrinter.FingerPrinter;
  1134. temporaries: Variables;
  1135. canBeLoaded : BOOLEAN;
  1136. currentIsInline: BOOLEAN;
  1137. currentMapper: SymbolMapper;
  1138. currentInlineExit: Label;
  1139. moduleBodySection: IntermediateCode.Section;
  1140. NeedDescriptor : BOOLEAN;
  1141. cooperativeSwitches: BOOLEAN;
  1142. lastSwitchPC: LONGINT;
  1143. isUnchecked: BOOLEAN;
  1144. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1145. newObjectFile: BOOLEAN);
  1146. BEGIN
  1147. SELF.system := system;
  1148. SELF.runtimeModuleName := runtime;
  1149. currentScope := NIL;
  1150. hiddenPointerType := NIL;
  1151. delegatePointerType := NIL;
  1152. awaitProcCounter := 0;
  1153. labelId := 0; constId := 0; labelId := 0;
  1154. SELF.checker := checker;
  1155. SELF.backend := backend;
  1156. position := Diagnostics.Invalid;
  1157. conditional := FALSE;
  1158. locked := FALSE;
  1159. InitOperand(result,ModeUndefined);
  1160. addressType := IntermediateCode.GetType(system,system.addressType);
  1161. setType := IntermediateCode.GetType(system,system.setType);
  1162. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1163. byteType := IntermediateCode.GetType(system, system.byteType);
  1164. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1165. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1166. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1167. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1168. nil := IntermediateCode.Immediate(addressType,0);
  1169. IntermediateCode.InitOperand(destination);
  1170. tagsAvailable := TRUE;
  1171. supportedInstruction := supportedInstructionProcedure;
  1172. supportedImmediate := supportedImmediateProcedure;
  1173. inData := FALSE;
  1174. SELF.emitLabels := emitLabels;
  1175. IntermediateCode.InitOperand(arrayDestinationTag);
  1176. bool := IntermediateCode.GetType(system,system.booleanType);
  1177. IntermediateCode.InitImmediate(false,bool,0);
  1178. IntermediateCode.InitImmediate(true,bool,1);
  1179. SELF.newObjectFile := newObjectFile;
  1180. indexCounter := 0;
  1181. NEW(registerUsageCount);
  1182. usedRegisters := NIL;
  1183. procedureResultDesignator := NIL;
  1184. NEW(fingerPrinter, system);
  1185. NEW(temporaries);
  1186. currentIsInline := FALSE;
  1187. NeedDescriptor := FALSE;
  1188. isUnchecked := backend.noRuntimeChecks;
  1189. END Init;
  1190. TYPE Context = RECORD
  1191. section: IntermediateCode.Section;
  1192. registerUsageCount: RegisterUsageCount;
  1193. usedRegisters: RegisterEntry;
  1194. END;
  1195. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1196. VAR context: Context;
  1197. BEGIN
  1198. context.section := section;
  1199. context.registerUsageCount := registerUsageCount;
  1200. context.usedRegisters := usedRegisters;
  1201. section := new;
  1202. NEW(registerUsageCount);
  1203. usedRegisters := NIL;
  1204. RETURN context;
  1205. END SwitchContext;
  1206. PROCEDURE ReturnToContext(context: Context);
  1207. BEGIN
  1208. section := context.section;
  1209. registerUsageCount := context.registerUsageCount;
  1210. usedRegisters := context.usedRegisters;
  1211. END ReturnToContext;
  1212. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1213. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1214. BEGIN
  1215. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1216. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1217. END;
  1218. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1219. section.SetExported(IsExported(syntaxTreeSymbol));
  1220. RETURN section
  1221. END NewSection;
  1222. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1223. VAR new: LONGINT;
  1224. BEGIN
  1225. new := registerUsageCount.Next(type,class);
  1226. UseRegister(new);
  1227. RETURN new
  1228. END AcquireRegister;
  1229. (** get the name for the code section that represens a certain symbol
  1230. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1231. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1232. VAR
  1233. operatorFingerPrint: SyntaxTree.FingerPrint;
  1234. operatorFingerPrintString,string: ARRAY 32 OF CHAR;
  1235. BEGIN
  1236. Global.GetSymbolSegmentedName(symbol, name);
  1237. (* if the symbol is an operator, then append the fingerprint to the name *)
  1238. IF symbol IS SyntaxTree.Operator THEN
  1239. operatorFingerPrint := fingerPrinter.SymbolFP(symbol);
  1240. string := "[";
  1241. Strings.IntToHexStr(operatorFingerPrint.shallow, 8, operatorFingerPrintString);
  1242. Strings.Append(string, operatorFingerPrintString);
  1243. Strings.Append(string, "]");
  1244. Basic.AppendToSegmentedName(name,string);
  1245. END
  1246. END GetCodeSectionNameForSymbol;
  1247. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1248. BEGIN
  1249. IF dump # NIL THEN
  1250. dump.String("enter "); dump.String(s); dump.Ln;
  1251. END;
  1252. END TraceEnter;
  1253. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1254. BEGIN
  1255. IF dump # NIL THEN
  1256. dump.String("exit "); dump.String(s); dump.Ln;
  1257. END;
  1258. END TraceExit;
  1259. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1260. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1261. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1262. VAR i: LONGINT;
  1263. BEGIN
  1264. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1265. IF op.rule # NIL THEN
  1266. FOR i := 0 TO LEN(op.rule)-1 DO
  1267. CheckRegister(op.rule[i])
  1268. END;
  1269. END;
  1270. END CheckRegister;
  1271. BEGIN
  1272. CheckRegister(instruction.op1);
  1273. CheckRegister(instruction.op2);
  1274. CheckRegister(instruction.op3);
  1275. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1276. ELSE section.Emit(instruction);
  1277. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1278. END;
  1279. END Emit;
  1280. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1281. BEGIN
  1282. IF backend.cooperative THEN
  1283. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1284. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1285. ELSE
  1286. Emit(Trap(position,trapNo));
  1287. END;
  1288. END EmitTrap;
  1289. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1290. VAR name: Basic.SegmentedName;
  1291. VAR op1, op2, reg: IntermediateCode.Operand;
  1292. VAR call, nocall: Label;
  1293. VAR parametersSize: LONGINT;
  1294. VAR prevSection: IntermediateCode.Section;
  1295. VAR prevDump: Streams.Writer;
  1296. VAR body: SyntaxTree.Body;
  1297. BEGIN
  1298. ASSERT((procedure = NIL) OR ~procedure.type(SyntaxTree.ProcedureType).noPAF);
  1299. prevSection := SELF.section;
  1300. SELF.section := section;
  1301. prevDump := dump;
  1302. dump := section.comments;
  1303. IF backend.hasLinkRegister THEN
  1304. Emit(Push(-1, lr));
  1305. END;
  1306. Emit(Push(-1,fp));
  1307. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1308. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1309. GetCodeSectionNameForSymbol(procedure, name);
  1310. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1311. ELSE
  1312. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1313. END;
  1314. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1315. Emit(Push(-1,op1));
  1316. Emit(Mov(-1,fp, sp));
  1317. body := procedure.procedureScope.body;
  1318. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1319. NEW(call, section);
  1320. NEW(nocall, section);
  1321. reg := NewRegisterOperand(addressType);
  1322. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1323. Emit(Sub(-1,reg, sp, op1));
  1324. BrltL(call, sp, reg);
  1325. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1326. BrgeL(nocall, sp, op2);
  1327. call.Resolve(section.pc);
  1328. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1329. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1330. Emit(Push(-1, op2));
  1331. Emit(Push(-1, reg));
  1332. ReleaseIntermediateOperand(reg);
  1333. CallThis(position, "Activities","ExpandStack",2);
  1334. Emit(Result(-1, sp));
  1335. nocall.Resolve(section.pc);
  1336. END;
  1337. ELSE
  1338. Emit(Mov(-1, fp, sp));
  1339. END;
  1340. Emit(Enter(-1, callconv, varSize));
  1341. SELF.section := prevSection;
  1342. dump := prevDump;
  1343. END EmitEnter;
  1344. PROCEDURE Enter(position: LONGINT; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1345. VAR op1,op2: IntermediateCode.Operand;
  1346. VAR instruction: IntermediateCode.Instruction;
  1347. BEGIN
  1348. IntermediateCode.InitNumber(op1,callconv);
  1349. IntermediateCode.InitNumber(op2,varSize);
  1350. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1351. RETURN instruction
  1352. END Enter;
  1353. PROCEDURE Leave(position: LONGINT; callconv: LONGINT): IntermediateCode.Instruction;
  1354. VAR op1: IntermediateCode.Operand;
  1355. VAR instruction: IntermediateCode.Instruction;
  1356. BEGIN
  1357. IntermediateCode.InitNumber(op1,callconv);
  1358. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1359. RETURN instruction
  1360. END Leave;
  1361. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: LONGINT; callconv: LONGINT);
  1362. VAR prevSection: IntermediateCode.Section;
  1363. VAR op2: IntermediateCode.Operand;
  1364. BEGIN
  1365. prevSection := SELF.section;
  1366. SELF.section := section;
  1367. Emit(Leave(position, callconv));
  1368. IF backend.cooperative THEN
  1369. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1370. Emit(Add(position, sp, fp, op2));
  1371. ELSE
  1372. Emit(Mov(position, sp, fp));
  1373. END;
  1374. Emit(Pop(position, fp));
  1375. SELF.section := prevSection;
  1376. END EmitLeave;
  1377. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1378. VAR m: SymbolMap;
  1379. BEGIN
  1380. position := x.position;
  1381. IF currentIsInline THEN
  1382. m := currentMapper.Get(x);
  1383. IF m # NIL THEN
  1384. (*
  1385. Printout.Info("mapping from", x);
  1386. Printout.Info("mapping to ", m.to);
  1387. *)
  1388. m.to.Accept(SELF);
  1389. op := result;
  1390. IF m.tag # NIL THEN
  1391. ReleaseIntermediateOperand(result.tag);
  1392. m.tag.Accept(SELF);
  1393. op.tag := result.op;
  1394. ReleaseIntermediateOperand(result.tag);
  1395. END;
  1396. RETURN
  1397. END;
  1398. END;
  1399. x.Accept(SELF);
  1400. op := result;
  1401. END Symbol;
  1402. PROCEDURE Expression(x: SyntaxTree.Expression);
  1403. BEGIN
  1404. position := x.position;
  1405. constantDeclaration := NIL;
  1406. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1407. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1408. END;
  1409. IF x.resolved # NIL THEN
  1410. x.resolved.Accept(SELF)
  1411. ELSE
  1412. x.Accept(SELF)
  1413. END;
  1414. (* check this, was commented out in ActiveCells3 *)
  1415. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1416. Error(x.position, "unsupported modifier");
  1417. END;
  1418. END Expression;
  1419. (*
  1420. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1421. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1422. BEGIN
  1423. temporaries.GetUsage(current);
  1424. FOR i := 0 TO LEN(current)-1 DO
  1425. set := current[i] - previous[i];
  1426. IF set # {} THEN
  1427. FOR j := 0 TO MAX(SET)-1 DO
  1428. IF j IN set THEN
  1429. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1430. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1431. Symbol(variable, op);
  1432. MakeMemory(tmp,op.op,addressType,0);
  1433. ReleaseOperand(op);
  1434. Emit(Mov(position,tmp, nil ) );
  1435. ReleaseIntermediateOperand(tmp);
  1436. END;
  1437. END;
  1438. END;
  1439. END;
  1440. END;
  1441. END ResetUsedTemporaries;
  1442. *)
  1443. PROCEDURE Statement(x: SyntaxTree.Statement);
  1444. VAR use: VariableUse;
  1445. BEGIN
  1446. temporaries.GetUsage(use);
  1447. position := x.position;
  1448. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1449. IF commentPrintout # NIL THEN
  1450. commentPrintout.Statement(x);
  1451. dump.Ln;
  1452. (*dump.Update;*)
  1453. END;
  1454. x.Accept(SELF);
  1455. (*
  1456. CheckRegistersFree();
  1457. *)
  1458. (*ResetUsedTemporaries(use);*)
  1459. temporaries.SetUsage(use);
  1460. END Statement;
  1461. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1462. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1463. *)
  1464. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1465. BEGIN
  1466. IF op.mode = IntermediateCode.ModeMemory THEN
  1467. ReuseCopy(res,op);
  1468. ELSE
  1469. res := op;
  1470. UseIntermediateOperand(res);
  1471. END;
  1472. IntermediateCode.AddOffset(res,offset);
  1473. IntermediateCode.MakeMemory(res,type);
  1474. END MakeMemory;
  1475. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1476. VAR mem: IntermediateCode.Operand;
  1477. BEGIN
  1478. MakeMemory(mem,res,type,offset);
  1479. ReleaseIntermediateOperand(res);
  1480. res := mem;
  1481. END ToMemory;
  1482. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1483. VAR mem: IntermediateCode.Operand;
  1484. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1485. componentType: SyntaxTree.Type;
  1486. BEGIN
  1487. type := type.resolved;
  1488. IF operand.mode = ModeReference THEN
  1489. IF type IS SyntaxTree.RangeType THEN
  1490. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1491. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1492. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1493. ReleaseOperand(operand);
  1494. operand.op := firstOp;
  1495. operand.tag := lastOp;
  1496. operand.extra := stepOp;
  1497. ELSIF type IS SyntaxTree.ComplexType THEN
  1498. componentType := type(SyntaxTree.ComplexType).componentType;
  1499. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1500. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1501. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1502. ReleaseOperand(operand);
  1503. operand.op := firstOp;
  1504. operand.tag := lastOp
  1505. ELSE
  1506. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1507. ReleaseIntermediateOperand(operand.op);
  1508. operand.op := mem;
  1509. END;
  1510. operand.mode := ModeValue;
  1511. END;
  1512. ASSERT(operand.mode = ModeValue);
  1513. END LoadValue;
  1514. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1515. VAR prevConditional: BOOLEAN;
  1516. BEGIN
  1517. prevConditional := conditional;
  1518. conditional := FALSE;
  1519. InitOperand(result, ModeUndefined);
  1520. Expression(x);
  1521. op := result;
  1522. LoadValue(op,x.type.resolved);
  1523. conditional := prevConditional;
  1524. END Evaluate;
  1525. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1526. VAR prevConditional: BOOLEAN;
  1527. BEGIN
  1528. prevConditional := conditional;
  1529. conditional := FALSE;
  1530. InitOperand(result,ModeUndefined);
  1531. Expression(x);
  1532. op := result;
  1533. (*
  1534. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1535. *)
  1536. conditional := prevConditional;
  1537. END Designate;
  1538. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1539. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1540. BEGIN
  1541. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1542. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1543. conditional := TRUE;
  1544. trueLabel := trueL; falseLabel := falseL;
  1545. Expression(x);
  1546. trueL := trueLabel; falseL := falseLabel;
  1547. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1548. END Condition;
  1549. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1550. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1551. BEGIN
  1552. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1553. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1554. RETURN op
  1555. END NewRegisterOperand;
  1556. PROCEDURE UnuseRegister(register: LONGINT);
  1557. BEGIN
  1558. IF (register > 0) THEN
  1559. register := registerUsageCount.Map(register);
  1560. registerUsageCount.DecUse(register);
  1561. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1562. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1563. END;
  1564. IF registerUsageCount.Use(register)=0 THEN
  1565. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1566. Warning(position, "register cannot be removed");
  1567. END;
  1568. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1569. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1570. END;
  1571. ELSIF registerUsageCount.Use(register)<0 THEN
  1572. Warning(position, "register removed too often");
  1573. IF dump # NIL THEN
  1574. dump.String("register removed too often"); dump.Ln; dump.Update;
  1575. END;
  1576. D.TraceBack;
  1577. END;
  1578. END;
  1579. END UnuseRegister;
  1580. PROCEDURE UseRegister(register: LONGINT);
  1581. BEGIN
  1582. IF (register > 0) THEN
  1583. register := registerUsageCount.Map(register);
  1584. registerUsageCount.IncUse(register);
  1585. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1586. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1587. END;
  1588. IF registerUsageCount.Use(register)=1 THEN
  1589. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1590. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1591. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1592. END;
  1593. END;
  1594. END;
  1595. END UseRegister;
  1596. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1597. BEGIN
  1598. UnuseRegister(op.register)
  1599. END ReleaseIntermediateOperand;
  1600. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1601. BEGIN
  1602. UseRegister(op.register)
  1603. END UseIntermediateOperand;
  1604. PROCEDURE ReleaseOperand(CONST op: Operand);
  1605. BEGIN
  1606. UnuseRegister(op.op.register);
  1607. UnuseRegister(op.tag.register);
  1608. UnuseRegister(op.extra.register);
  1609. END ReleaseOperand;
  1610. (* save registers marked in array "markedRegisters" to the stack
  1611. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1612. *)
  1613. PROCEDURE SaveRegisters();
  1614. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1615. BEGIN
  1616. entry := usedRegisters;
  1617. WHILE entry # NIL DO
  1618. type := registerUsageCount.used[entry.register].type;
  1619. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1620. Emit(Push(position,op));
  1621. entry := entry.next;
  1622. END;
  1623. END SaveRegisters;
  1624. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1625. BEGIN
  1626. saved := usedRegisters;
  1627. usedRegisters := NIL;
  1628. END ReleaseUsedRegisters;
  1629. (** remove parameter registers from used queue *)
  1630. PROCEDURE ReleaseParameterRegisters;
  1631. VAR entry,prev,next: RegisterEntry;
  1632. BEGIN
  1633. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1634. WHILE entry # NIL DO
  1635. next := entry.next;
  1636. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1637. registerUsageCount.DecUse(entry.register);
  1638. ASSERT(registerUsageCount.Use(entry.register)=0);
  1639. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1640. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1641. END;
  1642. ELSIF prev = NIL THEN
  1643. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1644. ELSE
  1645. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1646. END;
  1647. entry := next;
  1648. END;
  1649. END ReleaseParameterRegisters;
  1650. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1651. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1652. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1653. BEGIN
  1654. entry := saved;
  1655. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1656. entry := prev;
  1657. WHILE entry # NIL DO
  1658. prev := entry.prev;
  1659. type := entry.type;
  1660. class := entry.registerClass;
  1661. IntermediateCode.InitRegister(op,type,class,entry.register);
  1662. (*
  1663. new := registerUsageCount.Next(type,class);
  1664. registerUsageCount.Remap(entry.register,new);
  1665. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1666. dump.String("remap register "); dump.Int(entry.register,1);
  1667. dump.String("to "); dump.Int(new,1);
  1668. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1669. END;
  1670. entry.register := new;
  1671. *)
  1672. Emit(Pop(position,op));
  1673. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1674. entry := prev;
  1675. END;
  1676. (*
  1677. usedRegisters := saved;
  1678. *)
  1679. END RestoreRegisters;
  1680. PROCEDURE CheckRegistersFree;
  1681. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1682. BEGIN
  1683. IF usedRegisters # NIL THEN
  1684. r := usedRegisters;
  1685. WHILE r # NIL DO
  1686. warning := "register ";
  1687. Strings.AppendInt(warning, r.register);
  1688. Strings.Append(warning, " not released.");
  1689. Warning(position,warning);
  1690. r := r .next;
  1691. END;
  1692. END;
  1693. FOR i := 0 TO registerUsageCount.count-1 DO
  1694. IF registerUsageCount.used[i].count < 0 THEN
  1695. warning := "register ";
  1696. Strings.AppendInt(warning, i);
  1697. Strings.Append(warning, " unused too often.");
  1698. Warning(position,warning);
  1699. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1700. warning := "register ";
  1701. Strings.AppendInt(warning, i);
  1702. Strings.Append(warning, " not unused often enough.");
  1703. Warning(position,warning);
  1704. END;
  1705. END;
  1706. END CheckRegistersFree;
  1707. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1708. Otherwise allocate a new register.
  1709. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1710. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1711. BEGIN
  1712. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1713. UseIntermediateOperand(result);
  1714. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1715. UseIntermediateOperand(result);
  1716. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1717. END;
  1718. END Reuse2;
  1719. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1720. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1721. If not then allocate a new register.
  1722. Does NOT necessarily keep the content of src1 or src2 in result!
  1723. *)
  1724. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1725. BEGIN
  1726. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1727. UseIntermediateOperand(result);
  1728. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1729. UseIntermediateOperand(result);
  1730. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1731. result := alternative; alternative := emptyOperand;
  1732. UseIntermediateOperand(result);
  1733. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1734. END;
  1735. END Reuse2a;
  1736. (* like reuse2 but only one source *)
  1737. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1738. BEGIN
  1739. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1740. UseIntermediateOperand(result);
  1741. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1742. END;
  1743. END Reuse1;
  1744. (* like reuse2a but only one source *)
  1745. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1746. BEGIN
  1747. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1748. UseIntermediateOperand(result);
  1749. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1750. UseIntermediateOperand(result);
  1751. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1752. END;
  1753. END Reuse1a;
  1754. (* like reuse1 but guarantees that content of src1 is in result *)
  1755. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1756. BEGIN
  1757. IF ReusableRegister(src1) THEN
  1758. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1759. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1760. UseIntermediateOperand(result);
  1761. ELSE
  1762. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1763. Emit(Mov(position,result,src1));
  1764. END
  1765. END ReuseCopy;
  1766. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1767. BEGIN
  1768. IF ReusableRegister(src) THEN
  1769. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1770. ELSE
  1771. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1772. Emit(Mov(position,result,src));
  1773. ReleaseIntermediateOperand(src);
  1774. END
  1775. END TransferToRegister;
  1776. (** labels and branches **)
  1777. PROCEDURE NewLabel(): Label;
  1778. VAR label: Label;
  1779. BEGIN
  1780. NEW(label,section); RETURN label;
  1781. END NewLabel;
  1782. PROCEDURE SetLabel(label: Label);
  1783. BEGIN label.Resolve(section.pc);
  1784. END SetLabel;
  1785. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1786. BEGIN
  1787. ASSERT(label # NIL);
  1788. IF label.pc < 0 THEN (* label not yet set *)
  1789. label.AddFixup(section.pc);
  1790. END;
  1791. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1792. END LabelOperand;
  1793. PROCEDURE BrL(label: Label);
  1794. BEGIN
  1795. Emit(Br(position,LabelOperand(label)));
  1796. END BrL;
  1797. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1798. BEGIN
  1799. Emit(Brge(position,LabelOperand(label),left,right));
  1800. END BrgeL;
  1801. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1802. BEGIN
  1803. Emit(Brlt(position,LabelOperand(label),left,right));
  1804. END BrltL;
  1805. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1806. BEGIN
  1807. Emit(Breq(position,LabelOperand(label),left,right));
  1808. END BreqL;
  1809. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1810. BEGIN
  1811. Emit(Brne(position,LabelOperand(label),left,right));
  1812. END BrneL;
  1813. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1814. VAR new: IntermediateCode.Operand;
  1815. BEGIN
  1816. IF Trace THEN TraceEnter("Convert") END;
  1817. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1818. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1819. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1820. & (operand.offset = 0)
  1821. THEN
  1822. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1823. Emit(Conv(position,new,operand));
  1824. ELSE
  1825. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1826. Emit(Conv(position,new,operand));
  1827. ReleaseIntermediateOperand(operand);
  1828. END;
  1829. operand := new;
  1830. 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
  1831. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1832. ELSE
  1833. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1834. Emit(Conv(position,new,operand));
  1835. ReleaseIntermediateOperand(operand);
  1836. operand := new;
  1837. END;
  1838. IF Trace THEN TraceExit("Convert") END;
  1839. END Convert;
  1840. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1841. VAR exit: Label;
  1842. BEGIN
  1843. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1844. exit := NewLabel();
  1845. br(exit,left,right);
  1846. EmitTrap(position,trapNo);
  1847. SetLabel(exit);
  1848. END TrapC;
  1849. (** expressions *)
  1850. (** emit necessary runtime check for set elements **)
  1851. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1852. VAR max: IntermediateCode.Operand;
  1853. BEGIN
  1854. IF isUnchecked THEN RETURN END;
  1855. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1856. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1857. TrapC(BrgeL, max, o, SetElementTrap);
  1858. END;
  1859. END CheckSetElement;
  1860. (** the set that a range represents **)
  1861. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1862. VAR
  1863. operand: Operand;
  1864. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1865. BEGIN
  1866. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1867. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1868. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1869. one := IntermediateCode.Immediate(setType, 1);
  1870. Evaluate(x, operand);
  1871. Convert(operand.op, setType);
  1872. Convert(operand.tag, setType);
  1873. CheckSetElement(operand.op);
  1874. CheckSetElement(operand.tag);
  1875. (* create mask for lower bound
  1876. i.e. shift 11111111 to the left by the value of the lower bound
  1877. *)
  1878. Reuse1(temp, operand.op);
  1879. Emit(Shl(position,temp, allBits, operand.op));
  1880. ReleaseIntermediateOperand(operand.op);
  1881. operand.op := temp;
  1882. (* create mask for upper bound
  1883. i.e. shift 11111111 to the right by the difference between the
  1884. upper bound and the maximum number of set elements
  1885. *)
  1886. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1887. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1888. Reuse1(temp, operand.tag);
  1889. ELSE
  1890. Reuse1(temp, operand.tag);
  1891. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1892. Emit(Sub(position,temp, size, operand.tag));
  1893. END;
  1894. Emit(Shr(position,temp, allBits, operand.tag));
  1895. ReleaseIntermediateOperand(operand.tag);
  1896. operand.tag := temp;
  1897. Reuse2(resultingSet, operand.op, operand.tag);
  1898. (* intersect the two masks *)
  1899. Emit(And(position,resultingSet, operand.op, operand.tag));
  1900. ReleaseOperand(operand);
  1901. RETURN resultingSet
  1902. END SetFromRange;
  1903. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1904. VAR
  1905. res, operand: Operand;
  1906. temp, one, noBits, dest: IntermediateCode.Operand;
  1907. expression: SyntaxTree.Expression;
  1908. i: LONGINT;
  1909. BEGIN
  1910. IF Trace THEN TraceEnter("VisitSet") END;
  1911. dest := destination;
  1912. destination := emptyOperand;
  1913. noBits := IntermediateCode.Immediate(setType, 0);
  1914. one := IntermediateCode.Immediate(setType, 1);
  1915. (* start off with the empty set *)
  1916. InitOperand(res, ModeValue);
  1917. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1918. Emit(Mov(position,res.op, noBits));
  1919. FOR i := 0 TO x.elements.Length() - 1 DO
  1920. expression := x.elements.GetExpression(i);
  1921. IF expression IS SyntaxTree.RangeExpression THEN
  1922. (* range of set elements *)
  1923. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1924. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1925. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1926. ReleaseIntermediateOperand(temp)
  1927. ELSE
  1928. (* singelton element *)
  1929. Evaluate(expression, operand);
  1930. Convert(operand.op, setType);
  1931. CheckSetElement(operand.op);
  1932. (* create subset containing single element *)
  1933. Reuse1(temp, operand.op);
  1934. Emit(Shl(position,temp, one, operand.op));
  1935. ReleaseOperand(operand);
  1936. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1937. ReleaseIntermediateOperand(temp);
  1938. END
  1939. END;
  1940. result := res;
  1941. destination := dest;
  1942. IF Trace THEN TraceExit("VisitSet") END;
  1943. END VisitSet;
  1944. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1945. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1946. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1947. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1948. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1949. element: SyntaxTree.IntegerValue;
  1950. BEGIN
  1951. numberElements := x.elements.Length();
  1952. expression := index.parameters.GetExpression(dim);
  1953. element := expression(SyntaxTree.IntegerValue);
  1954. FOR i := 0 TO numberElements-1 DO
  1955. expression := x.elements.GetExpression(i);
  1956. element.SetValue(i);
  1957. IF expression IS SyntaxTree.MathArrayExpression THEN
  1958. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1959. ELSE
  1960. Assign(index,expression);
  1961. END;
  1962. END;
  1963. END RecursiveAssignment;
  1964. BEGIN
  1965. variable := GetTemporaryVariable(x.type, FALSE);
  1966. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1967. designator.SetType(variable.type);
  1968. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1969. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1970. FOR i := 0 TO dim-1 DO
  1971. element := SyntaxTree.NewIntegerValue(x.position,0);
  1972. element.SetType(system.longintType);
  1973. index.parameters.AddExpression(element);
  1974. END;
  1975. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1976. RecursiveAssignment(x,0);
  1977. Expression(designator);
  1978. END VisitMathArrayExpression;
  1979. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1980. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1981. BEGIN
  1982. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  1983. dest := destination; destination := emptyOperand;
  1984. IF x.operator = Scanner.Not THEN
  1985. IF conditional THEN
  1986. Condition(x.left,falseLabel,trueLabel)
  1987. ELSE
  1988. Evaluate(x.left,operand);
  1989. InitOperand(result,ModeValue);
  1990. Reuse1a(result.op,operand.op,dest);
  1991. Emit(Xor(position,result.op,operand.op,true));
  1992. ReleaseOperand(operand);
  1993. END;
  1994. ELSIF x.operator = Scanner.Minus THEN
  1995. Evaluate(x.left,operand);
  1996. InitOperand(result,ModeValue);
  1997. Reuse1a(result.op,operand.op,dest);
  1998. type := x.left.type.resolved;
  1999. IF type IS SyntaxTree.SetType THEN
  2000. Emit(Not(position,result.op,operand.op));
  2001. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2002. Reuse1(result.tag,operand.tag);
  2003. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2004. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2005. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2006. Emit(Neg(position,result.op,operand.op));
  2007. ELSE HALT(200)
  2008. END;
  2009. ReleaseOperand(operand);
  2010. ELSIF x.operator = Scanner.Address THEN
  2011. Designate(x.left,operand);
  2012. operand.mode := ModeValue;
  2013. t0 := x.left.type.resolved;
  2014. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2015. ReleaseIntermediateOperand(operand.op);
  2016. operand.op := operand.tag;
  2017. IntermediateCode.InitOperand(operand.tag);
  2018. END;
  2019. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2020. result := operand;
  2021. ELSE HALT(100)
  2022. END;
  2023. destination := dest;
  2024. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2025. END VisitUnaryExpression;
  2026. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2027. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2028. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2029. BEGIN
  2030. type := type.resolved;
  2031. originalType := type;
  2032. IF type IS SyntaxTree.PointerType THEN
  2033. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2034. END;
  2035. IF type IS SyntaxTree.ObjectType THEN
  2036. BrL(trueL);
  2037. ELSE
  2038. ASSERT(type IS SyntaxTree.RecordType);
  2039. (*
  2040. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2041. *)
  2042. ReuseCopy(left,tag);
  2043. right := TypeDescriptorAdr(type);
  2044. IF ~newObjectFile THEN
  2045. IntermediateCode.MakeMemory(right,addressType);
  2046. END;
  2047. IF backend.cooperative THEN
  2048. repeatL := NewLabel();
  2049. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2050. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2051. END;
  2052. SetLabel(repeatL);
  2053. BreqL(trueL,left,right);
  2054. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2055. BrneL(repeatL,left,nil);
  2056. ELSIF meta.simple THEN
  2057. level := type(SyntaxTree.RecordType).Level();
  2058. (* get type desc tag of level relative to base tag *)
  2059. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2060. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2061. IntermediateCode.MakeMemory(left,addressType);
  2062. BreqL(trueL,left,right);
  2063. ELSE
  2064. level := type(SyntaxTree.RecordType).Level();
  2065. (* get type desc tag of level relative to base tag *)
  2066. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2067. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2068. IntermediateCode.MakeMemory(left,addressType);
  2069. BreqL(trueL,left,right);
  2070. END;
  2071. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2072. BrL(falseL);
  2073. END;
  2074. END TypeTest;
  2075. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  2076. BEGIN
  2077. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2078. IF dump # NIL THEN
  2079. dump.String(s); dump.Ln;
  2080. END;
  2081. END Error;
  2082. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  2083. BEGIN
  2084. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  2085. IF dump # NIL THEN
  2086. dump.String(s); dump.Ln; dump.Update;
  2087. END;
  2088. END Warning;
  2089. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2090. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2091. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2092. operand:Operand;
  2093. BEGIN
  2094. previousSection := section;
  2095. Global.GetModuleName(mod,name);
  2096. Strings.Append(name,".@Trace");
  2097. Basic.ToSegmentedName(name, pooledName);
  2098. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2099. IF dump # NIL THEN dump := section.comments END;
  2100. IF backend.hasLinkRegister THEN
  2101. Emit(Push(-1, lr));
  2102. END;
  2103. variable := mod.moduleScope.firstVariable;
  2104. WHILE variable # NIL DO
  2105. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2106. Symbol(variable, operand);
  2107. register := operand.op;
  2108. CallTraceMethod(register, variable.type);
  2109. ReleaseIntermediateOperand(register);
  2110. END;
  2111. variable := variable.nextVariable;
  2112. END;
  2113. IF backend.hasLinkRegister THEN
  2114. Emit(Pop(-1, lr));
  2115. END;
  2116. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2117. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2118. Emit(Br(position,op));
  2119. INC(statCoopTraceModule, section.pc);
  2120. section := previousSection;
  2121. IF dump # NIL THEN dump := section.comments END;
  2122. END CreateTraceModuleMethod;
  2123. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2124. BEGIN
  2125. Emit (Push(position, dst));
  2126. Emit (Push(position, src));
  2127. CallThis(position,"GarbageCollector","Assign", 2);
  2128. END CallAssignPointer;
  2129. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2130. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2131. BEGIN
  2132. IF SemanticChecker.IsPointerType (type) THEN
  2133. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2134. ELSIF type.IsRecordType() THEN
  2135. Emit (Push(position,dst));
  2136. Emit (Push(position,src));
  2137. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2138. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2139. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2140. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2141. ELSIF IsStaticArray(type) THEN
  2142. size := StaticArrayNumElements(type);
  2143. base := StaticArrayBaseType(type);
  2144. IF base.IsRecordType() THEN
  2145. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2146. Emit (Push(position, dst));
  2147. Emit (Push(position, src));
  2148. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2149. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2150. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2151. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2152. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2153. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2154. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2155. Emit (Push(position, dst));
  2156. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2157. Emit (Push(position, src));
  2158. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2159. ELSE
  2160. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2161. Emit (Push(position, dst));
  2162. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2163. Emit (Push(position, src));
  2164. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2165. ASSERT(StaticArrayBaseType(type).IsPointer());
  2166. END;
  2167. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2168. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2169. Emit (Push(position, dst));
  2170. Emit (Push(position, src));
  2171. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2172. ELSE HALT(100); (* missing ? *)
  2173. END;
  2174. END CallAssignMethod;
  2175. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2176. VAR name: Basic.SegmentedName;
  2177. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2178. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2179. context: Context;
  2180. BEGIN
  2181. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2182. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2183. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2184. GetRecordTypeName (recordType,name);
  2185. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2186. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2187. IF dump # NIL THEN dump := section.comments END;
  2188. IF backend.hasLinkRegister THEN
  2189. Emit(Push(-1, lr));
  2190. END;
  2191. variable := recordType.recordScope.firstVariable;
  2192. WHILE variable # NIL DO
  2193. IF variable.NeedsTrace() THEN
  2194. dst := NewRegisterOperand (addressType);
  2195. src := NewRegisterOperand (addressType);
  2196. Emit (Mov(position, dst, parameter1));
  2197. Emit (Mov(position, src, parameter2));
  2198. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2199. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2200. CallAssignMethod(dst, src, variable.type);
  2201. ReleaseIntermediateOperand(src);
  2202. ReleaseIntermediateOperand(dst);
  2203. END;
  2204. variable := variable.nextVariable;
  2205. END;
  2206. recordBase := recordType.GetBaseRecord();
  2207. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2208. IF backend.hasLinkRegister THEN
  2209. Emit(Pop(-1, lr));
  2210. END;
  2211. GetRecordTypeName (recordBase,name);
  2212. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2213. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2214. Emit(Br(position,op));
  2215. ELSE
  2216. Emit(Exit(position,0,0));
  2217. END;
  2218. IF ~recordType.isObject THEN
  2219. GetRecordTypeName (recordType,name);
  2220. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2221. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2222. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2223. NEW(registerUsageCount);
  2224. usedRegisters := NIL;
  2225. dst := NewRegisterOperand (addressType);
  2226. src := NewRegisterOperand (addressType);
  2227. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2228. Emit(Mov(position, dst, parameter1));
  2229. Emit(Mov(position, src, parameter2));
  2230. label := NewLabel();
  2231. SetLabel(label);
  2232. Emit(Push(position, dst));
  2233. Emit(Push(position, src));
  2234. GetRecordTypeName (recordType,name);
  2235. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2236. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2237. Emit(Call(position, op, 0));
  2238. Emit(Pop(position, src));
  2239. Emit(Pop(position, dst));
  2240. Emit(Add(position, dst, dst, ofs));
  2241. Emit(Add(position, src, src, ofs));
  2242. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2243. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2244. Emit(Exit(position,0,0));
  2245. END;
  2246. INC(statCoopAssignProcedure, section.pc);
  2247. ReturnToContext(context);
  2248. IF dump # NIL THEN dump := section.comments END;
  2249. END CreateAssignProcedure;
  2250. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2251. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2252. BEGIN
  2253. IF IsUnsafePointer (type) THEN
  2254. skip := NewLabel();
  2255. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2256. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2257. BreqL (skip, op, nil);
  2258. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2259. SetLabel (skip);
  2260. ELSIF SemanticChecker.IsPointerType (type) THEN
  2261. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2262. CallThis(position,"GarbageCollector","Mark", 1);
  2263. ELSIF type.IsRecordType() THEN
  2264. Emit (Push(position,register));
  2265. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2266. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2267. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2268. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2269. ELSIF IsStaticArray(type) THEN
  2270. size := StaticArrayNumElements(type);
  2271. base := StaticArrayBaseType(type);
  2272. IF base.IsRecordType() THEN
  2273. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2274. Emit (Push(position, register));
  2275. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2276. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2277. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2278. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2279. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2280. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2281. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2282. Emit (Push(position, register));
  2283. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2284. ELSE
  2285. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2286. Emit (Push(position, register));
  2287. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2288. ASSERT(base.IsPointer());
  2289. END;
  2290. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2291. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2292. CallThis(position,"GarbageCollector","Mark", 1);
  2293. ELSE HALT(100); (* missing ? *)
  2294. END;
  2295. END CallTraceMethod;
  2296. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2297. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2298. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2299. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2300. BEGIN
  2301. previousSection := section;
  2302. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2303. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2304. GetRecordTypeName (recordType,name);
  2305. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2306. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2307. IF dump # NIL THEN dump := section.comments END;
  2308. IF backend.hasLinkRegister THEN
  2309. Emit(Push(-1, lr));
  2310. END;
  2311. variable := recordType.recordScope.firstVariable;
  2312. WHILE variable # NIL DO
  2313. IF variable.NeedsTrace() THEN
  2314. register := NewRegisterOperand (addressType);
  2315. Emit (Mov(position,register,parameter1));
  2316. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2317. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2318. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2319. END;
  2320. CallTraceMethod(register, variable.type);
  2321. ReleaseIntermediateOperand(register);
  2322. END;
  2323. variable := variable.nextVariable;
  2324. END;
  2325. recordBase := recordType.GetBaseRecord();
  2326. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2327. recordBase := recordBase.GetBaseRecord();
  2328. END;
  2329. IF recordBase # NIL THEN
  2330. IF backend.hasLinkRegister THEN
  2331. Emit(Pop(-1, lr));
  2332. END;
  2333. GetRecordTypeName (recordBase,name);
  2334. IF HasExplicitTraceMethod (recordBase) THEN
  2335. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2336. ELSE
  2337. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2338. END;
  2339. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2340. Emit(Br(position,op));
  2341. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2342. Emit(Exit(position,0,0));
  2343. ELSE
  2344. IF backend.hasLinkRegister THEN
  2345. Emit(Pop(-1, lr));
  2346. END;
  2347. IF recordType.isObject THEN
  2348. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2349. ELSE
  2350. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2351. END;
  2352. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2353. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2354. Emit(Br(position,op));
  2355. END;
  2356. IF ~recordType.isObject THEN
  2357. GetRecordTypeName (recordType,name);
  2358. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2359. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2360. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2361. NEW(registerUsageCount);
  2362. usedRegisters := NIL;
  2363. IF dump # NIL THEN dump := section.comments END;
  2364. register := NewRegisterOperand (addressType);
  2365. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2366. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2367. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2368. END;
  2369. Emit (Push(position,register));
  2370. GetRecordTypeName (recordType,name);
  2371. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2372. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2373. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2374. ReleaseIntermediateOperand(register);
  2375. Emit(Exit(position,0,0));
  2376. GetRecordTypeName (recordType,name);
  2377. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2378. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2379. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2380. NEW(registerUsageCount);
  2381. usedRegisters := NIL;
  2382. register := NewRegisterOperand (addressType);
  2383. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2384. Emit(Mov(position, register, parameter1));
  2385. label := NewLabel();
  2386. SetLabel(label);
  2387. Emit(Push(position, register));
  2388. GetRecordTypeName (recordType,name);
  2389. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2390. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2391. Emit(Call(position, op, 0));
  2392. Emit(Pop(position, register));
  2393. Emit(Add(position, register, register, ofs));
  2394. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2395. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2396. Emit(Exit(position,0,0));
  2397. END;
  2398. INC(statCoopTraceMethod, section.pc);
  2399. ReturnToContext(context);
  2400. IF dump # NIL THEN dump := section.comments END;
  2401. END CreateTraceMethod;
  2402. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2403. VAR name: Basic.SegmentedName;
  2404. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2405. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2406. context: Context;
  2407. BEGIN
  2408. IF recordType.isObject THEN RETURN END;
  2409. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2410. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2411. GetRecordTypeName (recordType,name);
  2412. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2413. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2414. IF dump # NIL THEN dump := section.comments END;
  2415. IF backend.hasLinkRegister THEN
  2416. Emit(Push(-1, lr));
  2417. END;
  2418. variable := recordType.recordScope.firstVariable;
  2419. WHILE variable # NIL DO
  2420. IF variable.NeedsTrace() THEN
  2421. dst := NewRegisterOperand (addressType);
  2422. Emit (Mov(position, dst, parameter1));
  2423. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2424. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2425. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2426. END;
  2427. CallResetProcedure(dst, nil, variable.type);
  2428. ReleaseIntermediateOperand(dst);
  2429. END;
  2430. variable := variable.nextVariable;
  2431. END;
  2432. recordBase := recordType.GetBaseRecord();
  2433. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2434. IF backend.hasLinkRegister THEN
  2435. Emit(Pop(-1, lr));
  2436. END;
  2437. GetRecordTypeName (recordBase,name);
  2438. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2439. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2440. Emit(Br(position,op));
  2441. ELSE
  2442. Emit(Exit(position,0,0));
  2443. END;
  2444. GetRecordTypeName (recordType,name);
  2445. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2446. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2447. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2448. NEW(registerUsageCount);
  2449. usedRegisters := NIL;
  2450. dst := NewRegisterOperand (addressType);
  2451. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2452. Emit(Mov(position, dst, parameter1));
  2453. label := NewLabel();
  2454. SetLabel(label);
  2455. Emit(Push(position, dst));
  2456. GetRecordTypeName (recordType,name);
  2457. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2458. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2459. Emit(Call(position, op, 0));
  2460. Emit(Pop(position, dst));
  2461. Emit(Add(position, dst, dst, ofs));
  2462. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2463. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2464. Emit(Exit(position,0,0));
  2465. INC(statCoopResetProcedure, section.pc);
  2466. ReturnToContext(context);
  2467. IF dump # NIL THEN dump := section.comments END;
  2468. END CreateResetProcedure;
  2469. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2470. VAR name: Basic.SegmentedName; context: Context;
  2471. BEGIN
  2472. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2473. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2474. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2475. IF dump # NIL THEN dump := section.comments END;
  2476. IF backend.hasLinkRegister THEN
  2477. Emit(Push(-1, lr));
  2478. END;
  2479. Emit(Push(position,fp));
  2480. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2481. ResetVariables(scope);
  2482. Emit(Pop(position,fp));
  2483. Emit(Exit(position,0,0));
  2484. ReturnToContext(context);
  2485. IF dump # NIL THEN dump := section.comments END;
  2486. END CreateResetMethod;
  2487. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2488. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2489. BEGIN
  2490. IF SemanticChecker.IsPointerType (type) THEN
  2491. Emit (Push(position, dest));
  2492. CallThis(position,"GarbageCollector","Reset", 1);
  2493. ELSIF type.IsRecordType() THEN
  2494. Emit (Push(position, dest));
  2495. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2496. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2497. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2498. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2499. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2500. size := GetArrayLength(type, tag);
  2501. base := ArrayBaseType(type);
  2502. IF base.IsRecordType() THEN
  2503. Emit (Push(position, size));
  2504. Emit (Push(position, dest));
  2505. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2506. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2507. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2508. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2509. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2510. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2511. Emit (Push(position, size));
  2512. Emit (Push(position, dest));
  2513. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2514. ELSE
  2515. Emit (Push(position, size));
  2516. Emit (Push(position, dest));
  2517. CallThis(position,"GarbageCollector","ResetArray", 2);
  2518. ASSERT(ArrayBaseType(type).IsPointer());
  2519. END;
  2520. ReleaseIntermediateOperand(size);
  2521. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2522. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2523. Emit (Push(position, dest));
  2524. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2525. ELSE HALT(100); (* missing ? *)
  2526. END;
  2527. END CallResetProcedure;
  2528. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2529. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2530. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2531. VAR operand: Operand;
  2532. BEGIN
  2533. Symbol (symbol, operand);
  2534. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2535. ReleaseOperand(operand);
  2536. END Reset;
  2537. BEGIN
  2538. previousScope := currentScope;
  2539. currentScope := scope;
  2540. pc := section.pc;
  2541. variable := scope.firstVariable;
  2542. WHILE variable # NIL DO
  2543. IF variable.NeedsTrace() THEN
  2544. Reset (variable);
  2545. END;
  2546. variable := variable.nextVariable;
  2547. END;
  2548. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2549. WHILE parameter # NIL DO
  2550. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2551. Reset (parameter);
  2552. END;
  2553. parameter := parameter.nextParameter;
  2554. END;
  2555. INC(statCoopResetVariables, section.pc - pc);
  2556. currentScope := previousScope;
  2557. END ResetVariables;
  2558. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2559. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2560. VAR op: IntermediateCode.Operand; context: Context;
  2561. BEGIN
  2562. previousSection := section;
  2563. GetCodeSectionNameForSymbol(procedure, name);
  2564. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2565. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2566. IF dump # NIL THEN dump := section.comments END;
  2567. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2568. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2569. Emit(Data(position,op));
  2570. Emit(Data(position,nil));
  2571. IF HasPointers (procedure.procedureScope) THEN
  2572. GetCodeSectionNameForSymbol(procedure, name);
  2573. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2574. ELSE
  2575. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2576. END;
  2577. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2578. Emit(Data(position,op));
  2579. ReturnToContext(context);
  2580. IF dump # NIL THEN dump := section.comments END;
  2581. END CreateProcedureDescriptor;
  2582. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2583. VAR import: SyntaxTree.Import;
  2584. s: Basic.MessageString;
  2585. selfName: SyntaxTree.IdentifierString;
  2586. BEGIN
  2587. moduleScope.ownerModule.GetName(selfName);
  2588. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2589. module := moduleScope.ownerModule
  2590. ELSE
  2591. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2592. IF import = NIL THEN
  2593. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2594. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2595. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2596. s := "Module ";
  2597. Strings.Append(s,moduleName);
  2598. Strings.Append(s," cannot be imported.");
  2599. IF force THEN
  2600. Error(position,s);
  2601. ELSIF canBeLoaded THEN
  2602. Strings.Append(s, "=> no dynamic linking.");
  2603. Warning(position, s);
  2604. canBeLoaded := FALSE;
  2605. END;
  2606. RETURN FALSE
  2607. ELSE
  2608. SELF.module.imports.AddName(moduleName)
  2609. END;
  2610. ELSIF import.module = NIL THEN (* already tried *)
  2611. RETURN FALSE
  2612. END;
  2613. module := import.module;
  2614. END;
  2615. RETURN TRUE
  2616. END AddImport;
  2617. (* needed for old binary object file format*)
  2618. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2619. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2620. BEGIN
  2621. IF AddImport(moduleName,module,TRUE) THEN
  2622. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2623. IF procedure = NIL THEN
  2624. s := "Instruction not supported on target, emulation procedure ";
  2625. Strings.Append(s,moduleName);
  2626. Strings.Append(s,".");
  2627. Strings.Append(s,procedureName);
  2628. Strings.Append(s," not present");
  2629. Error(position,s);
  2630. ELSE
  2631. StaticCallOperand(r,procedure);
  2632. ReleaseOperand(r);
  2633. fp := GetFingerprint(procedure);
  2634. END;
  2635. END;
  2636. END EnsureSymbol;
  2637. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2638. VAR exit: Label; trueL,falseL: Label;
  2639. BEGIN
  2640. trueL := NewLabel();
  2641. falseL := NewLabel();
  2642. exit := NewLabel();
  2643. Condition(x,trueL,falseL);
  2644. InitOperand(result,ModeValue);
  2645. SetLabel(trueL);
  2646. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2647. Emit(Mov(position,result.op,true));
  2648. BrL(exit);
  2649. SetLabel(falseL);
  2650. Emit(MovReplace(position,result.op,false));
  2651. SetLabel(exit);
  2652. END ConditionToValue;
  2653. PROCEDURE ValueToCondition(VAR op: Operand);
  2654. BEGIN
  2655. LoadValue(op,system.booleanType);
  2656. BrneL(trueLabel,op.op, false);
  2657. ReleaseOperand(op);
  2658. BrL(falseLabel);
  2659. END ValueToCondition;
  2660. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2661. VAR size: LONGINT;
  2662. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2663. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2664. BEGIN
  2665. ASSERT(type.form = SyntaxTree.Open);
  2666. baseType := type.arrayBase.resolved;
  2667. IF IsOpenArray(baseType) THEN
  2668. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2669. ELSE
  2670. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2671. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2672. END;
  2673. len := tag;
  2674. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2675. IntermediateCode.MakeMemory(len,addressType);
  2676. UseIntermediateOperand(len);
  2677. Reuse2(res,sizeOperand,len);
  2678. Emit(Mul(position,res,sizeOperand,len));
  2679. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2680. RETURN res
  2681. END GetArraySize;
  2682. BEGIN
  2683. type := type.resolved;
  2684. IF IsOpenArray(type) THEN
  2685. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2686. RETURN tag
  2687. ELSE
  2688. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2689. END;
  2690. ELSE
  2691. size := ToMemoryUnits(system,system.SizeOf(type));
  2692. RETURN IntermediateCode.Immediate(addressType,size)
  2693. END;
  2694. END GetDynamicSize;
  2695. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2696. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2697. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2698. BEGIN
  2699. ASSERT(type.form = SyntaxTree.Open);
  2700. baseType := type.arrayBase.resolved;
  2701. IF IsOpenArray(baseType) THEN
  2702. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2703. ELSE
  2704. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2705. END;
  2706. len := tag;
  2707. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2708. IntermediateCode.MakeMemory(len,addressType);
  2709. UseIntermediateOperand(len);
  2710. Reuse2(res,sizeOperand,len);
  2711. Emit(Mul(position,res,sizeOperand,len));
  2712. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2713. RETURN res
  2714. END GetLength;
  2715. BEGIN
  2716. type := type.resolved;
  2717. IF IsOpenArray(type) THEN
  2718. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2719. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2720. ELSE
  2721. RETURN IntermediateCode.Immediate(addressType,1)
  2722. END;
  2723. END GetArrayLength;
  2724. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2725. VAR result: IntermediateCode.Operand;
  2726. BEGIN
  2727. IF backend.cooperative THEN
  2728. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2729. ELSE
  2730. MakeMemory(result, tag, addressType, 0);
  2731. END;
  2732. RETURN result
  2733. END GetSizeFromTag;
  2734. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2735. VAR parameter: SyntaxTree.Parameter;
  2736. BEGIN
  2737. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2738. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2739. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2740. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2741. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2742. END;
  2743. RETURN GetDynamicSize(e.type, tag);
  2744. END GetArrayOfBytesSize;
  2745. (*
  2746. to find imported symbol. not needed ?
  2747. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2748. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2749. BEGIN
  2750. IF AddImport(moduleName,importedModule,FALSE) THEN
  2751. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2752. RETURN symbol
  2753. ELSE
  2754. RETURN NIL
  2755. END
  2756. END SymbolByName;
  2757. *)
  2758. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2759. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2760. BEGIN
  2761. IF AddImport(moduleName,runtimeModule,force) THEN
  2762. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2763. IF procedure = NIL THEN
  2764. s := "Procedure ";
  2765. Strings.Append(s,moduleName);
  2766. Strings.Append(s,".");
  2767. Strings.Append(s,procedureName);
  2768. Strings.Append(s," not present");
  2769. Error(position,s);
  2770. RETURN FALSE
  2771. ELSE
  2772. RETURN TRUE
  2773. END;
  2774. ELSE RETURN FALSE
  2775. END;
  2776. END GetRuntimeProcedure;
  2777. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2778. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2779. s: Basic.MessageString;
  2780. BEGIN
  2781. Basic.InitSegmentedName(name);
  2782. name[0] := Basic.MakeString(moduleName);
  2783. name[1] := Basic.MakeString(typeName);
  2784. name[2] := -1;
  2785. IF AddImport(moduleName,importedModule, FALSE) THEN
  2786. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2787. IF symbol = NIL THEN
  2788. s := "type ";
  2789. Strings.Append(s,moduleName);
  2790. Strings.Append(s,".");
  2791. Strings.Append(s,typeName);
  2792. Strings.Append(s," not present");
  2793. Error(position,s);
  2794. END;
  2795. ELSE symbol := NIL;
  2796. END;
  2797. IF importedModule = moduleScope.ownerModule THEN
  2798. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2799. ELSE
  2800. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2801. END;
  2802. RETURN symbol
  2803. END GetTypeDescriptor;
  2804. (* 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. *)
  2805. PROCEDURE CallThisChecked(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2806. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2807. pooledName: Basic.SegmentedName; size: LONGINT;
  2808. BEGIN
  2809. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2810. StaticCallOperand(result,procedure);
  2811. IF numberParameters < 0 THEN
  2812. size := ProcedureParametersSize(system,procedure);
  2813. ELSE
  2814. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2815. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2816. Error(position,"runtime call parameter count mismatch");
  2817. END;
  2818. END;
  2819. Emit(Call(position, result.op, size));
  2820. ReleaseOperand(result);
  2821. ELSE (* only static linking possible *)
  2822. ASSERT(numberParameters >= 0);
  2823. Basic.InitSegmentedName(pooledName);
  2824. pooledName[0] := Basic.MakeString(moduleName);
  2825. pooledName[1] := Basic.MakeString(procedureName);
  2826. pooledName[2] := -1;
  2827. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2828. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2829. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2830. END;
  2831. END CallThisChecked;
  2832. (* 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. *)
  2833. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2834. BEGIN
  2835. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2836. END CallThis;
  2837. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2838. VAR
  2839. left,right: Operand;
  2840. leftSize, rightSize: IntermediateCode.Operand;
  2841. saved: RegisterEntry;
  2842. reg: IntermediateCode.Operand;
  2843. procedureName: SyntaxTree.IdentifierString;
  2844. BEGIN
  2845. procedureName := "CompareString";
  2846. SaveRegisters();ReleaseUsedRegisters(saved);
  2847. Designate(leftExpression,left);
  2848. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2849. Emit(Push(position,leftSize));
  2850. ReleaseIntermediateOperand(leftSize);
  2851. Emit(Push(position,left.op));
  2852. ReleaseOperand(left);
  2853. Designate(rightExpression,right);
  2854. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2855. Emit(Push(position,rightSize));
  2856. ReleaseIntermediateOperand(rightSize);
  2857. Emit(Push(position,right.op));
  2858. ReleaseOperand(right);
  2859. IF backend.cooperative THEN
  2860. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2861. ELSE
  2862. CallThis(position,runtimeModuleName,procedureName, 4);
  2863. END;
  2864. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2865. Emit(Result(position,reg));
  2866. (*
  2867. AcquireThisRegister(int8,IntermediateCode.Result);
  2868. *)
  2869. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2870. (*
  2871. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2872. *)
  2873. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2874. ReleaseIntermediateOperand(reg);
  2875. BrL(falseLabel);
  2876. END CompareString;
  2877. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2878. VAR
  2879. left,right: Operand;
  2880. leftSize, rightSize: IntermediateCode.Operand;
  2881. saved: RegisterEntry;
  2882. procedureName: SyntaxTree.IdentifierString;
  2883. BEGIN
  2884. procedureName := "CopyString";
  2885. SaveRegisters();ReleaseUsedRegisters(saved);
  2886. Designate(leftExpression,left);
  2887. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2888. Emit(Push(position,leftSize));
  2889. ReleaseIntermediateOperand(leftSize);
  2890. Emit(Push(position,left.op));
  2891. ReleaseOperand(left);
  2892. Designate(rightExpression,right);
  2893. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2894. Emit(Push(position,rightSize));
  2895. ReleaseIntermediateOperand(rightSize);
  2896. Emit(Push(position,right.op));
  2897. ReleaseOperand(right);
  2898. IF backend.cooperative THEN
  2899. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2900. ELSE
  2901. CallThis(position,runtimeModuleName,procedureName,4);
  2902. END;
  2903. RestoreRegisters(saved);
  2904. END CopyString;
  2905. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2906. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2907. leftType,rightType: SyntaxTree.Type;
  2908. leftExpression,rightExpression : SyntaxTree.Expression;
  2909. componentType: IntermediateCode.Type;
  2910. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2911. size: LONGINT;
  2912. BEGIN
  2913. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2914. dest := destination; destination := emptyOperand;
  2915. leftType := x.left.type.resolved;
  2916. rightType := x.right.type.resolved;
  2917. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2918. CASE x.operator OF
  2919. Scanner.Or:
  2920. (* shortcut evaluation of left OR right *)
  2921. IF ~conditional THEN ConditionToValue(x);
  2922. ELSE
  2923. next := NewLabel();
  2924. Condition(x.left,trueLabel,next);
  2925. SetLabel(next);
  2926. Condition(x.right,trueLabel,falseLabel);
  2927. END;
  2928. |Scanner.And:
  2929. (* shortcut evaluation of left & right *)
  2930. IF ~conditional THEN ConditionToValue(x);
  2931. ELSE
  2932. next := NewLabel();
  2933. Condition(x.left,next,falseLabel);
  2934. SetLabel(next);
  2935. Condition(x.right,trueLabel,falseLabel);
  2936. END;
  2937. |Scanner.Is:
  2938. IF ~conditional THEN ConditionToValue(x);
  2939. ELSE
  2940. (* get type desc tag *)
  2941. IF IsPointerToRecord(leftType,recordType) THEN
  2942. Evaluate(x.left,left);
  2943. Dereference(left,recordType,IsUnsafePointer(leftType))
  2944. ELSE
  2945. Designate(x.left,left);
  2946. END;
  2947. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2948. ReleaseOperand(left);
  2949. END;
  2950. |Scanner.Plus:
  2951. Evaluate(x.left,left);
  2952. Evaluate(x.right,right);
  2953. IF leftType IS SyntaxTree.SetType THEN
  2954. InitOperand(result,ModeValue);
  2955. Reuse2a(result.op,left.op,right.op,dest);
  2956. Emit(Or(position,result.op,left.op,right.op));
  2957. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2958. InitOperand(result,ModeValue);
  2959. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2960. Reuse2(result.tag,left.tag,right.tag);
  2961. Emit(Add(position,result.op,left.op,right.op));
  2962. Emit(Add(position,result.tag,left.tag,right.tag))
  2963. ELSE
  2964. InitOperand(result,ModeValue);
  2965. Reuse2a(result.op,left.op,right.op,dest);
  2966. Emit(Add(position,result.op,left.op,right.op));
  2967. END;
  2968. ReleaseOperand(left); ReleaseOperand(right);
  2969. |Scanner.Minus:
  2970. Evaluate(x.left,left);
  2971. Evaluate(x.right,right);
  2972. IF leftType IS SyntaxTree.SetType THEN
  2973. InitOperand(result,ModeValue);
  2974. Reuse1(result.op,right.op);
  2975. Emit(Not(position,result.op,right.op));
  2976. ReleaseOperand(right);
  2977. Emit(And(position,result.op,result.op,left.op));
  2978. ReleaseOperand(left);
  2979. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2980. InitOperand(result,ModeValue);
  2981. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2982. Reuse2(result.tag,left.tag,right.tag);
  2983. Emit(Sub(position,result.op,left.op,right.op));
  2984. Emit(Sub(position,result.tag,left.tag,right.tag));
  2985. ReleaseOperand(left); ReleaseOperand(right)
  2986. ELSE
  2987. InitOperand(result,ModeValue);
  2988. Reuse2a(result.op,left.op,right.op,dest);
  2989. Emit(Sub(position,result.op,left.op,right.op));
  2990. ReleaseOperand(left); ReleaseOperand(right);
  2991. END;
  2992. |Scanner.Times:
  2993. Evaluate(x.left,left);
  2994. Evaluate(x.right,right);
  2995. IF leftType IS SyntaxTree.SetType THEN
  2996. InitOperand(result,ModeValue);
  2997. Reuse2a(result.op,left.op,right.op,dest);
  2998. Emit(And(position,result.op,left.op,right.op));
  2999. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3000. InitOperand(result,ModeValue);
  3001. Reuse1a(result.op,left.op,dest);
  3002. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  3003. Emit(Shl(position,result.op,left.op,right.op));
  3004. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3005. InitOperand(result, ModeValue);
  3006. componentType := left.op.type;
  3007. (* TODO: review this *)
  3008. (*
  3009. result.op = left.op * right.op - left.tag * right.tag
  3010. result.tag = left.tag * right.op + left.op * right.tag
  3011. *)
  3012. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3013. Emit(Mul(position,result.op, left.op, right.op));
  3014. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3015. Emit(Mul(position,tempReg, left.tag, right.tag));
  3016. Emit(Sub(position,result.op, result.op, tempReg));
  3017. Reuse2(result.tag, left.tag, right.op);
  3018. Emit(Mul(position,result.tag, left.tag, right.op));
  3019. Emit(Mul(position,tempReg, left.op, right.tag));
  3020. Emit(Add(position,result.tag, result.tag, tempReg));
  3021. ReleaseIntermediateOperand(tempReg)
  3022. ELSE
  3023. InitOperand(result,ModeValue);
  3024. Reuse2a(result.op,left.op,right.op,dest);
  3025. Emit(Mul(position,result.op,left.op,right.op));
  3026. END;
  3027. ReleaseOperand(left); ReleaseOperand(right);
  3028. |Scanner.Div:
  3029. Evaluate(x.left,left);
  3030. Evaluate(x.right,right);
  3031. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3032. InitOperand(result,ModeValue);
  3033. Reuse1a(result.op,left.op,dest);
  3034. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  3035. Emit(Shr(position,result.op,left.op,right.op));
  3036. ELSE
  3037. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3038. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3039. IF ~isUnchecked THEN
  3040. exit := NewLabel();
  3041. BrltL(exit,zero,right.op);
  3042. EmitTrap(position,NegativeDivisorTrap);
  3043. SetLabel(exit);
  3044. END;
  3045. END;
  3046. InitOperand(result,ModeValue);
  3047. Reuse2a(result.op,left.op,right.op,dest);
  3048. Emit(Div(position,result.op,left.op,right.op));
  3049. END;
  3050. ReleaseOperand(left); ReleaseOperand(right);
  3051. |Scanner.Mod:
  3052. Evaluate(x.left,left);
  3053. Evaluate(x.right,right);
  3054. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  3055. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  3056. InitOperand(result,ModeValue);
  3057. Reuse1a(result.op,left.op,dest);
  3058. Emit(And(position,result.op,left.op,right.op));
  3059. ELSE
  3060. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3061. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3062. IF ~isUnchecked THEN
  3063. exit := NewLabel();
  3064. BrltL(exit,zero,right.op);
  3065. EmitTrap(position,NegativeDivisorTrap);
  3066. SetLabel(exit);
  3067. END;
  3068. END;
  3069. InitOperand(result,ModeValue);
  3070. Reuse2a(result.op,left.op,right.op,dest);
  3071. Emit(Mod(position,result.op,left.op,right.op));
  3072. END;
  3073. ReleaseOperand(left); ReleaseOperand(right);
  3074. |Scanner.Slash:
  3075. Evaluate(x.left,left);
  3076. Evaluate(x.right,right);
  3077. IF leftType IS SyntaxTree.SetType THEN
  3078. InitOperand(result,ModeValue);
  3079. Reuse2a(result.op,left.op,right.op,dest);
  3080. Emit(Xor(position,result.op,left.op,right.op));
  3081. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3082. InitOperand(result,ModeValue);
  3083. componentType := left.op.type;
  3084. (* review this *)
  3085. (*
  3086. divisor = right.op * right.op + right.tag * right.tag
  3087. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3088. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3089. *)
  3090. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3091. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3092. Emit(Mul(position,tempReg, right.op, right.op));
  3093. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3094. Emit(Add(position,tempReg, tempReg, tempReg2));
  3095. result.op := tempReg2;
  3096. Emit(Mul(position,result.op, left.op, right.op));
  3097. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3098. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3099. Emit(Add(position,result.op, result.op, tempReg2));
  3100. Emit(Div(position,result.op, result.op, tempReg));
  3101. Reuse2(result.tag, left.tag, right.op);
  3102. Emit(Mul(position,result.tag, left.tag, right.op));
  3103. Emit(Mul(position,tempReg2, left.op, right.tag));
  3104. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3105. Emit(Div(position,result.tag, result.tag, tempReg));
  3106. ReleaseIntermediateOperand(tempReg);
  3107. ReleaseIntermediateOperand(tempReg2)
  3108. ELSE
  3109. InitOperand(result,ModeValue);
  3110. Reuse2a(result.op,left.op,right.op,dest);
  3111. Emit(Div(position,result.op,left.op,right.op));
  3112. END;
  3113. ReleaseOperand(left); ReleaseOperand(right);
  3114. |Scanner.Equal:
  3115. IF ~conditional THEN ConditionToValue(x);
  3116. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3117. CompareString(BreqL,x.left,x.right);
  3118. ELSE
  3119. Evaluate(x.left,left);
  3120. Evaluate(x.right,right);
  3121. IF leftType IS SyntaxTree.RangeType THEN
  3122. ASSERT(rightType IS SyntaxTree.RangeType);
  3123. BrneL(falseLabel, left.op, right.op); (* first *)
  3124. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3125. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3126. ReleaseOperand(left); ReleaseOperand(right);
  3127. BrL(trueLabel)
  3128. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3129. BrneL(falseLabel, left.op, right.op); (* first *)
  3130. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3131. ReleaseOperand(left); ReleaseOperand(right);
  3132. BrL(trueLabel)
  3133. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3134. (* TODO: review this *)
  3135. BrneL(falseLabel, left.op, right.op); (* real part *)
  3136. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3137. ReleaseOperand(left); ReleaseOperand(right);
  3138. BrL(trueLabel)
  3139. ELSE
  3140. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3141. ReleaseOperand(left); ReleaseOperand(right);
  3142. BrL(trueLabel);
  3143. END;
  3144. END;
  3145. |Scanner.LessEqual:
  3146. IF ~conditional THEN ConditionToValue(x);
  3147. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3148. CompareString(BrgeL,x.right,x.left);
  3149. ELSE
  3150. Evaluate(x.left,left);
  3151. Evaluate(x.right,right);
  3152. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3153. Reuse1(temp.op,right.op);
  3154. Emit(And(position,temp.op,left.op,right.op));
  3155. ReleaseOperand(right);
  3156. BreqL(trueLabel,temp.op,left.op);
  3157. BrL(falseLabel);
  3158. ReleaseOperand(temp);ReleaseOperand(left);
  3159. ELSE
  3160. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3161. ReleaseOperand(left); ReleaseOperand(right);
  3162. BrL(trueLabel);
  3163. END;
  3164. END;
  3165. |Scanner.Less:
  3166. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3167. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  3168. leftExpression.SetType(system.booleanType);
  3169. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3170. rightExpression.SetType(system.booleanType);
  3171. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3172. leftExpression.SetType(system.booleanType);
  3173. Expression(leftExpression);
  3174. ELSIF ~conditional THEN ConditionToValue(x);
  3175. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3176. CompareString(BrltL,x.left,x.right);
  3177. ELSE
  3178. Evaluate(x.left,left);
  3179. Evaluate(x.right,right);
  3180. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3181. ReleaseOperand(left); ReleaseOperand(right);
  3182. BrL(trueLabel);
  3183. END;
  3184. |Scanner.Greater:
  3185. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3186. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  3187. leftExpression.SetType(system.booleanType);
  3188. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  3189. rightExpression.SetType(system.booleanType);
  3190. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  3191. leftExpression.SetType(system.booleanType);
  3192. Expression(leftExpression);
  3193. ELSIF ~conditional THEN ConditionToValue(x);
  3194. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3195. CompareString(BrltL,x.right,x.left);
  3196. ELSE
  3197. Evaluate(x.left,left);
  3198. Evaluate(x.right,right);
  3199. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3200. ReleaseOperand(left); ReleaseOperand(right);
  3201. BrL(trueLabel);
  3202. END;
  3203. |Scanner.GreaterEqual:
  3204. IF ~conditional THEN ConditionToValue(x);
  3205. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3206. CompareString(BrgeL,x.left,x.right);
  3207. ELSE
  3208. Evaluate(x.left,left);
  3209. Evaluate(x.right,right);
  3210. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3211. Reuse1(temp.op,left.op);
  3212. Emit(And(position,temp.op,left.op,right.op));
  3213. ReleaseOperand(left);
  3214. BreqL(trueLabel, temp.op,right.op);
  3215. ReleaseOperand(temp); ReleaseOperand(right);
  3216. BrL(falseLabel);
  3217. ELSE
  3218. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3219. ReleaseOperand(left); ReleaseOperand(right);
  3220. BrL(trueLabel);
  3221. END;
  3222. END;
  3223. |Scanner.Unequal:
  3224. IF ~conditional THEN ConditionToValue(x);
  3225. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3226. CompareString(BrneL,x.left,x.right);
  3227. ELSE
  3228. Evaluate(x.left,left);
  3229. Evaluate(x.right,right);
  3230. IF leftType IS SyntaxTree.RangeType THEN
  3231. ASSERT(rightType IS SyntaxTree.RangeType);
  3232. BrneL(trueLabel, left.op, right.op); (* first *)
  3233. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3234. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3235. ReleaseOperand(left); ReleaseOperand(right);
  3236. BrL(falseLabel)
  3237. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3238. BrneL(trueLabel, left.op, right.op); (* first *)
  3239. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3240. ReleaseOperand(left); ReleaseOperand(right);
  3241. BrL(falseLabel)
  3242. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3243. (* TODO: review this *)
  3244. BrneL(trueLabel, left.op, right.op); (* real part *)
  3245. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3246. ReleaseOperand(left); ReleaseOperand(right);
  3247. BrL(falseLabel)
  3248. ELSE
  3249. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3250. ReleaseOperand(left); ReleaseOperand(right);
  3251. BrL(trueLabel);
  3252. END;
  3253. END;
  3254. |Scanner.In:
  3255. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3256. Evaluate(x.left,left);
  3257. Evaluate(x.right,right);
  3258. Convert(left.op,setType);
  3259. ReuseCopy(temp.op,right.op);
  3260. Emit(Shr(position,temp.op,temp.op,left.op));
  3261. ReleaseOperand(right); ReleaseOperand(left);
  3262. IntermediateCode.InitImmediate(one,setType,1);
  3263. Emit(And(position,temp.op,temp.op,one));
  3264. IF conditional THEN
  3265. IntermediateCode.InitImmediate(zero,setType,0);
  3266. BrneL(trueLabel,temp.op,zero);
  3267. ReleaseOperand(temp);
  3268. BrL(falseLabel);
  3269. ELSE
  3270. Convert(temp.op,bool);
  3271. result.mode := ModeValue;
  3272. result.op := temp.op;
  3273. result.tag := nil; (* may be left over from calls to evaluate *)
  3274. END;
  3275. ELSE
  3276. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3277. IF x.operator = Scanner.Questionmarks THEN
  3278. leftExpression := x.left;
  3279. rightExpression := x.right;
  3280. ELSE
  3281. leftExpression := x.right;
  3282. rightExpression := x.left;
  3283. END;
  3284. Evaluate(leftExpression, left);
  3285. Emit(Push(position,left.op));
  3286. ReleaseOperand(left);
  3287. Designate(rightExpression, right);
  3288. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3289. IF ~backend.cellsAreObjects THEN
  3290. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3291. END;
  3292. Emit(Push(position,right.op));
  3293. ReleaseOperand(right);
  3294. IF backend.cellsAreObjects THEN
  3295. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3296. ELSE
  3297. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3298. END;
  3299. InitOperand(result, ModeValue);
  3300. result.op := NewRegisterOperand(bool);
  3301. Emit(Result(position,result.op));
  3302. IF conditional THEN
  3303. IntermediateCode.InitImmediate(zero,setType,0);
  3304. BrneL(trueLabel,result.op,zero);
  3305. ReleaseOperand(result);
  3306. BrL(falseLabel);
  3307. END;
  3308. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3309. leftExpression := x.left;
  3310. rightExpression := x.right;
  3311. Evaluate(leftExpression, left);
  3312. Emit(Push(position,left.op));
  3313. ReleaseOperand(left);
  3314. Evaluate(rightExpression, right);
  3315. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3316. IF ~backend.cellsAreObjects THEN
  3317. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3318. END;
  3319. Emit(Push(position,right.op));
  3320. ReleaseOperand(right);
  3321. IF backend.cellsAreObjects THEN
  3322. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3323. ELSE
  3324. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3325. END;
  3326. InitOperand(result, ModeValue);
  3327. result.op := NewRegisterOperand(bool);
  3328. Emit(Result(position,result.op));
  3329. IF conditional THEN
  3330. IntermediateCode.InitImmediate(zero,setType,0);
  3331. BrneL(trueLabel,result.op,zero);
  3332. ReleaseOperand(result);
  3333. BrL(falseLabel);
  3334. END;
  3335. ELSE
  3336. HALT(100);
  3337. END;
  3338. END;
  3339. destination := dest;
  3340. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3341. END VisitBinaryExpression;
  3342. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3343. VAR localResult, operand: Operand;
  3344. BEGIN
  3345. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3346. InitOperand(localResult, ModeValue);
  3347. ASSERT(x.first # NIL);
  3348. Evaluate(x.first, operand);
  3349. localResult.op := operand.op;
  3350. ReleaseOperand(operand);
  3351. UseIntermediateOperand(localResult.op);
  3352. ASSERT(x.last # NIL);
  3353. Evaluate(x.last, operand);
  3354. localResult.tag := operand.op;
  3355. ReleaseOperand(operand);
  3356. UseIntermediateOperand(localResult.tag);
  3357. IF x.step # NIL THEN
  3358. Evaluate(x.step, operand);
  3359. localResult.extra := operand.op;
  3360. ReleaseOperand(operand);
  3361. UseIntermediateOperand(localResult.extra);
  3362. END;
  3363. result := localResult;
  3364. IF Trace THEN TraceExit("VisitRangeExpression") END
  3365. END VisitRangeExpression;
  3366. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3367. BEGIN
  3368. HALT(100); (* should never be evaluated *)
  3369. END VisitTensorRangeExpression;
  3370. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3371. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3372. BEGIN
  3373. IF Trace THEN TraceEnter("VisitConversion") END;
  3374. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3375. dest := destination; destination := emptyOperand;
  3376. Evaluate(x.expression,old);
  3377. InitOperand(result,ModeValue);
  3378. result.op := old.op;
  3379. ASSERT(result.op.mode # 0);
  3380. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3381. (* convert TO a complex number *)
  3382. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3383. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3384. ASSERT(result.op.mode # 0);
  3385. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3386. (* convert FROM a complex number TO a complex number*)
  3387. result.tag := old.tag;
  3388. ASSERT(result.tag.mode # 0);
  3389. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3390. ASSERT(result.tag.mode # 0)
  3391. ELSE
  3392. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3393. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3394. END
  3395. ELSE
  3396. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3397. ASSERT(result.op.mode # 0);
  3398. result.tag := old.tag; (*! probably never used *)
  3399. END;
  3400. destination := dest;
  3401. IF Trace THEN TraceExit("VisitConversion") END;
  3402. END VisitConversion;
  3403. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3404. BEGIN
  3405. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3406. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3407. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3408. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3409. END VisitTypeDeclaration;
  3410. (** designators (expressions) *)
  3411. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3412. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3413. BEGIN
  3414. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3415. IF x.left # NIL THEN Expression(x.left) END;
  3416. Symbol(x.symbol,result);
  3417. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3418. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3419. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3420. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3421. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3422. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3423. END;
  3424. END;
  3425. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3426. END VisitSymbolDesignator;
  3427. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3428. BEGIN
  3429. IF isUnchecked THEN RETURN END;
  3430. IF tagsAvailable THEN
  3431. TrapC(BrltL,index,length,IndexCheckTrap);
  3432. END;
  3433. END BoundCheck;
  3434. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3435. VAR d: IntermediateCode.Operand;
  3436. BEGIN
  3437. IF isUnchecked THEN RETURN END;
  3438. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3439. TrapC(op,dim,d,ArraySizeTrap);
  3440. ReleaseIntermediateOperand(d);
  3441. END DimensionCheck;
  3442. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3443. VAR
  3444. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3445. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3446. expression: SyntaxTree.Expression;
  3447. resultingType, leftType, baseType: SyntaxTree.Type;
  3448. skipLabel1: Label;
  3449. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3450. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3451. variableOp: Operand;
  3452. variable: SyntaxTree.Variable;
  3453. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3454. VAR expression: SyntaxTree.Expression;
  3455. BEGIN
  3456. (* count the number of indices, ranges and tensorRanges in the index list *)
  3457. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3458. FOR i := 0 TO parameters.Length() - 1 DO
  3459. expression := parameters.GetExpression(i);
  3460. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3461. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3462. ELSE INC(indexCount)
  3463. END
  3464. END;
  3465. END CountIndices;
  3466. BEGIN
  3467. ASSERT(tagsAvailable);
  3468. resultingType := x.type.resolved; (* resulting type *)
  3469. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3470. InitOperand(localResult, ModeReference);
  3471. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3472. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3473. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3474. (* a globally defined array destination tag is available -> use and invalidate it*)
  3475. localResult.tag := arrayDestinationTag;
  3476. IntermediateCode.InitOperand(arrayDestinationTag)
  3477. ELSE
  3478. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3479. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3480. Symbol(variable, variableOp);
  3481. ReuseCopy(localResult.tag, variableOp.op);
  3482. ReleaseOperand(variableOp);
  3483. END
  3484. END;
  3485. indexListSize := x.parameters.Length();
  3486. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3487. ASSERT(tensorRangeCount <= 1);
  3488. (* designate the array to be indexed over, perform tensor range check if known *)
  3489. Designate(x.left, array);
  3490. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3491. Dereference(array, leftType,FALSE);
  3492. IF tensorRangeCount=0 THEN
  3493. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3494. END
  3495. END;
  3496. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3497. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3498. srcDimOffset := -indexListSize;
  3499. destDimOffset := -rangeCount
  3500. ELSE
  3501. srcDimOffset := 0;
  3502. destDimOffset := 0
  3503. END;
  3504. indexDim := 0;
  3505. (* use address of source array as basis *)
  3506. (*
  3507. ReuseCopy(localResult.op, array.op);
  3508. *)
  3509. localResult.op := array.op;
  3510. UseIntermediateOperand(localResult.op);
  3511. (* go through the index list *)
  3512. FOR i := 0 TO indexListSize - 1 DO
  3513. expression := x.parameters.GetExpression(i);
  3514. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3515. (* nothing to do *)
  3516. ELSE
  3517. (* determine which dimension of source array is currently looked at *)
  3518. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3519. (* get the memory operand pointing to array descriptor dimension *)
  3520. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3521. (* make a reusable register from it *)
  3522. ReuseCopy(srcDim, tmp);
  3523. ReleaseIntermediateOperand(tmp);
  3524. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3525. ELSE
  3526. srcDim := IntermediateCode.Immediate(int32, i)
  3527. END;
  3528. (* get length and increment of source array for current dimension *)
  3529. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3530. Convert(sourceLength.op, sizeType);
  3531. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3532. Convert(sourceIncrement.op, sizeType);
  3533. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3534. ReleaseIntermediateOperand(srcDim);
  3535. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3536. (* SINGLE INDEX *)
  3537. Evaluate(expression, index);
  3538. ReleaseIntermediateOperand(index.tag);
  3539. index.tag := emptyOperand;
  3540. Convert(index.op, sizeType);
  3541. (* lower bound check *)
  3542. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3543. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3544. ELSIF isUnchecked THEN (* do nothing *)
  3545. ELSE
  3546. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3547. END;
  3548. (* upper bound check *)
  3549. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3550. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3551. ELSIF isUnchecked THEN (* do nothing *)
  3552. ELSE
  3553. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3554. END;
  3555. ReleaseOperand(sourceLength);
  3556. Convert(index.op, addressType);
  3557. summand := index.op;
  3558. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3559. (* RANGE OF INDICES *)
  3560. Evaluate(expression, range);
  3561. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3562. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3563. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3564. ReleaseOperand(range);
  3565. Convert(firstIndex, sizeType);
  3566. Convert(lastIndex, sizeType);
  3567. Convert(stepSize, sizeType);
  3568. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3569. if it is 'MAX(LONGINT)' *)
  3570. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3571. TransferToRegister(lastIndex, lastIndex);
  3572. skipLabel1 := NewLabel();
  3573. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3574. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3575. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3576. SetLabel(skipLabel1)
  3577. END;
  3578. (* check if step size is valid *)
  3579. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3580. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3581. ELSIF isUnchecked THEN (* do nothing *)
  3582. ELSE
  3583. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3584. END;
  3585. (* check lower bound check *)
  3586. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3587. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3588. ELSIF isUnchecked THEN (* do nothing *)
  3589. ELSE
  3590. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3591. END;
  3592. (* check upper bound check *)
  3593. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3594. (* statically open range: nothing to do *)
  3595. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3596. ASSERT(staticLastIndex < staticSourceLength)
  3597. ELSIF isUnchecked THEN (* do nothing *)
  3598. ELSE
  3599. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3600. END;
  3601. (* determine length of target array for current dimension *)
  3602. (* 1. incorporate last index: *)
  3603. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3604. (* last index is static *)
  3605. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3606. targetLength := sourceLength.op
  3607. ELSE
  3608. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3609. END;
  3610. UseIntermediateOperand(targetLength);
  3611. ELSE
  3612. (* targetLength := lastIndex + 1
  3613. Reuse1(targetLength, lastIndex);
  3614. *)
  3615. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3616. END;
  3617. ReleaseOperand(sourceLength);
  3618. ReleaseIntermediateOperand(lastIndex);
  3619. (* 2. incorporate first index: *)
  3620. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3621. (* first index and current target length are static *)
  3622. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3623. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3624. (* first index = 0: nothing to do *)
  3625. ELSE
  3626. (* targetLength := targetLength - firstIndex *)
  3627. TransferToRegister(targetLength, targetLength);
  3628. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3629. END;
  3630. (* clip negative lengths to 0 *)
  3631. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3632. IF staticTargetLength < 0 THEN
  3633. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3634. END
  3635. ELSE
  3636. skipLabel1 := NewLabel();
  3637. TransferToRegister(targetLength, targetLength);
  3638. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3639. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3640. SetLabel(skipLabel1)
  3641. END;
  3642. (* 3. incorporate index step size: *)
  3643. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3644. (*step size and current target length are static *)
  3645. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3646. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3647. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3648. (* step size = 1: nothing to do *)
  3649. ELSE
  3650. (* emit code for this:
  3651. targetLength := (targetLength-1) DIV stepSize +1;
  3652. *)
  3653. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3654. DivInt(targetLength, targetLength, stepSize);
  3655. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3656. END;
  3657. (* determine increment of target array for current dimension *)
  3658. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3659. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3660. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3661. (* step size = 1 *)
  3662. targetIncrement := sourceIncrement.op;
  3663. UseIntermediateOperand(targetIncrement)
  3664. ELSE
  3665. (* targetIncrement := sourceIncrement * stepSize *)
  3666. Reuse1(targetIncrement, stepSize);
  3667. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3668. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3669. END;
  3670. ReleaseIntermediateOperand(stepSize);
  3671. (* write length and increment of target array to descriptor *)
  3672. IF destDimOffset < 0 THEN
  3673. (* determine which dimension of target array is currently looked at *)
  3674. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3675. TransferToRegister(destDim, tmp);
  3676. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3677. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3678. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3679. ReleaseIntermediateOperand(destDim)
  3680. ELSE
  3681. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3682. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3683. END;
  3684. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3685. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3686. INC(indexDim);
  3687. Convert(firstIndex, addressType);
  3688. TransferToRegister(summand, firstIndex);
  3689. ELSE HALT(100);
  3690. END;
  3691. (*
  3692. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3693. *)
  3694. Convert(sourceIncrement.op, addressType);
  3695. Convert(summand, addressType);
  3696. MulInt(summand, summand, sourceIncrement.op);
  3697. ReleaseIntermediateOperand(sourceIncrement.op);
  3698. AddInt(localResult.op, localResult.op, summand);
  3699. ReleaseIntermediateOperand(summand);
  3700. END
  3701. END;
  3702. result := localResult;
  3703. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3704. ReleaseIntermediateOperand(result.tag);
  3705. result.tag := TypeDescriptorAdr(resultingType);
  3706. IF ~newObjectFile THEN
  3707. IntermediateCode.MakeMemory(result.tag,addressType);
  3708. END;
  3709. ELSIF IsDelegate(resultingType) THEN
  3710. ReleaseIntermediateOperand(result.tag);
  3711. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3712. UseIntermediateOperand(result.tag);
  3713. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3714. ReleaseIntermediateOperand(result.tag);
  3715. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3716. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3717. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3718. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3719. (* finalize target array descriptor *)
  3720. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3721. (* write lengths and increments of target array for remaining dimensions *)
  3722. i := indexListSize;
  3723. WHILE indexDim < targetArrayDimensionality DO
  3724. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3725. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3726. ReleaseOperand(sourceLength);
  3727. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3728. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3729. ReleaseOperand(sourceIncrement);
  3730. INC(i); INC(indexDim);
  3731. END;
  3732. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3733. tmp := nil;
  3734. ELSE
  3735. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3736. END;
  3737. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3738. ReleaseIntermediateOperand(tmp);
  3739. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3740. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3741. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3742. ELSE
  3743. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3744. END;
  3745. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3746. ReleaseIntermediateOperand(tmp);
  3747. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3748. (* write dimensionality *)
  3749. IF targetArrayDimensionality # 0 THEN
  3750. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3751. END;
  3752. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3753. END;
  3754. ReleaseOperand(array);
  3755. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3756. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3757. END;
  3758. END MathIndexDesignator;
  3759. (* TENTATIVE *)
  3760. PROCEDURE DumpOperand(operand: Operand);
  3761. BEGIN
  3762. D.Log.String(" op = ");
  3763. IntermediateCode.DumpOperand(D.Log, operand.op );
  3764. D.Log.Ln;
  3765. D.Log.String(" tag = ");
  3766. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3767. D.Log.Ln;
  3768. D.Log.String(" extra = ");
  3769. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3770. D.Log.Ln;
  3771. D.Log.Update
  3772. END DumpOperand;
  3773. (* get the length of an array , trying to make use of static information *)
  3774. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3775. VAR res: IntermediateCode.Operand; size: LONGINT;
  3776. BEGIN
  3777. type := type.resolved;
  3778. IF type IS SyntaxTree.ArrayType THEN
  3779. WITH type: SyntaxTree.ArrayType DO
  3780. IF type.form = SyntaxTree.Static THEN
  3781. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3782. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3783. Evaluate(type.length, op);
  3784. ReleaseIntermediateOperand(op.tag);
  3785. RETURN op.op;*)
  3786. ELSE
  3787. res := tag;
  3788. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3789. IntermediateCode.MakeMemory(res,addressType);
  3790. UseIntermediateOperand(res);
  3791. RETURN res
  3792. END
  3793. END;
  3794. ELSE
  3795. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3796. RETURN IntermediateCode.Immediate(addressType,size);
  3797. END;
  3798. END ArrayLength;
  3799. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3800. BEGIN
  3801. ReleaseIntermediateOperand(res);
  3802. IF IsImmediate(x) & IsImmediate(y) THEN
  3803. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3804. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3805. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3806. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3807. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3808. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3809. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3810. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3811. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3812. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3813. UseIntermediateOperand(res);
  3814. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3815. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3816. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3817. UseIntermediateOperand(res);
  3818. ELSE
  3819. IF ~ReusableRegister(res) THEN
  3820. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3821. ELSE
  3822. UseIntermediateOperand(res);
  3823. END;
  3824. IF IsImmediate(x) & (x.intValue = 0) THEN
  3825. Emit(Mov(position,res,y))
  3826. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3827. Emit(Mov(position,res,x))
  3828. ELSE
  3829. Emit(Add(position,res, x, y));
  3830. END;
  3831. END;
  3832. END AddInt;
  3833. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3834. BEGIN
  3835. ReleaseIntermediateOperand(res);
  3836. IF IsImmediate(x) & IsImmediate(y) THEN
  3837. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3838. ELSE
  3839. IF ~ReusableRegister(res) THEN
  3840. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3841. ELSE UseIntermediateOperand(res);
  3842. END;
  3843. IF IsImmediate(x) & (x.intValue = 1) THEN
  3844. Emit(Mov(position,res,y))
  3845. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3846. Emit(Mov(position,res,x))
  3847. ELSE
  3848. Emit(Mul(position,res, x, y));
  3849. END;
  3850. END;
  3851. END MulInt;
  3852. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3853. BEGIN
  3854. ReleaseIntermediateOperand(res);
  3855. IF IsImmediate(x) & IsImmediate(y) THEN
  3856. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3857. ELSE
  3858. IF ~ReusableRegister(res) THEN
  3859. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3860. ELSE UseIntermediateOperand(res);
  3861. END;
  3862. IF IsImmediate(x) & (x.intValue = 1) THEN
  3863. Emit(Mov(position,res,y))
  3864. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3865. Emit(Mov(position,res,x))
  3866. ELSE
  3867. Emit(Div(position,res, x, y));
  3868. END;
  3869. END;
  3870. END DivInt;
  3871. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3872. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3873. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3874. BEGIN
  3875. type := x.left.type.resolved;
  3876. IF type IS SyntaxTree.StringType THEN
  3877. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3878. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3879. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3880. type := atype;
  3881. x.left.SetType(type);
  3882. END;
  3883. IntermediateCode.InitImmediate(res,addressType,0);
  3884. maxDim := x.parameters.Length()-1;
  3885. FOR i := 0 TO maxDim DO
  3886. e := x.parameters.GetExpression(i);
  3887. Evaluate(e,index);
  3888. Convert(index.op,addressType);
  3889. AddInt(res, res, index.op);
  3890. IF i = 0 THEN
  3891. (*
  3892. ReuseCopy(res, index.op);
  3893. *)
  3894. Designate(x.left,array);
  3895. type := x.left.type.resolved;
  3896. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3897. Dereference(array, type, FALSE);
  3898. END;
  3899. (*
  3900. ELSE AddInt(res, res, index.op);
  3901. *)
  3902. END;
  3903. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3904. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3905. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3906. BoundCheck(index.op, length);
  3907. END;
  3908. ReleaseIntermediateOperand(length);
  3909. END;
  3910. ReleaseOperand(index);
  3911. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3912. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3913. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3914. MulInt(res,res,length);
  3915. END;
  3916. ReleaseIntermediateOperand(length);
  3917. END;
  3918. IF (type IS SyntaxTree.ArrayType) THEN
  3919. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3920. size := StaticSize(system, type);
  3921. IF size # 1 THEN
  3922. length := IntermediateCode.Immediate(addressType,size);
  3923. MulInt(res,res,length);
  3924. END;
  3925. ELSE
  3926. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3927. IF size # 1 THEN
  3928. length := IntermediateCode.Immediate(addressType,size);
  3929. MulInt(res,res,length);
  3930. END;
  3931. END;
  3932. END;
  3933. AddInt(res,res,array.op);
  3934. InitOperand(result,ModeReference);
  3935. result.op := res;
  3936. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3937. ReleaseIntermediateOperand(result.tag);
  3938. result.tag := TypeDescriptorAdr(type);
  3939. IF ~newObjectFile THEN
  3940. IntermediateCode.MakeMemory(result.tag,addressType);
  3941. END
  3942. ELSIF IsDelegate(type) THEN
  3943. ReleaseIntermediateOperand(result.tag);
  3944. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3945. UseIntermediateOperand(result.tag);
  3946. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3947. ReleaseIntermediateOperand(result.tag);
  3948. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3949. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3950. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3951. END;
  3952. ReleaseOperand(array);
  3953. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3954. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3955. END;
  3956. END IndexDesignator;
  3957. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3958. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3959. BEGIN
  3960. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3961. dest := destination; destination := emptyOperand;
  3962. type := x.left.type.resolved;
  3963. IF type IS SyntaxTree.MathArrayType THEN
  3964. MathIndexDesignator(x);
  3965. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3966. IndexDesignator(x);
  3967. END;
  3968. destination := dest;
  3969. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3970. END VisitIndexDesignator;
  3971. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3972. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3973. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3974. procedure: SyntaxTree.Procedure;
  3975. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3976. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3977. BEGIN
  3978. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3979. parameters := expression.parameters;
  3980. moduleName := "FoxArrayBase";
  3981. procedureName := "CopyDescriptor";
  3982. IF AddImport(moduleName,arrayBase,TRUE) THEN
  3983. SaveRegisters();ReleaseUsedRegisters(saved);
  3984. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3985. IF procedure = NIL THEN
  3986. s := "procedure ";
  3987. Strings.Append(s,moduleName);
  3988. Strings.Append(s,".");
  3989. Strings.Append(s,procedureName);
  3990. Strings.Append(s," not present");
  3991. Error(position,s);
  3992. ELSE
  3993. (* push address of temporary variable *)
  3994. Symbol(variable,destOperand);
  3995. Emit(Push(position,destOperand.op));
  3996. ReleaseOperand(destOperand);
  3997. (* push src *)
  3998. Evaluate(expression.left,srcOperand);
  3999. (*
  4000. Dereference(srcOperand,expression.type.resolved);
  4001. Emit(Push(position,srcOperand.tag));
  4002. *)
  4003. Emit(Push(position,srcOperand.op));
  4004. ReleaseOperand(srcOperand);
  4005. tensorFound := FALSE;
  4006. FOR i := 0 TO parameters.Length()-1 DO
  4007. e := parameters.GetExpression(i);
  4008. IF e IS SyntaxTree.TensorRangeExpression THEN
  4009. tensorFound := TRUE;
  4010. ELSIF e IS SyntaxTree.RangeExpression THEN
  4011. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4012. ELSE
  4013. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4014. END;
  4015. END;
  4016. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  4017. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  4018. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  4019. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  4020. StaticCallOperand(procOp,procedure);
  4021. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4022. ReleaseOperand(procOp);
  4023. END;
  4024. RestoreRegisters(saved);
  4025. END;
  4026. RETURN variable
  4027. END PrepareTensorDescriptor;
  4028. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4029. VAR
  4030. type, descriptorType, baseType: SyntaxTree.Type;
  4031. operand, tmpOperand, variableOp, variable2Op: Operand;
  4032. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4033. variable, variable2: SyntaxTree.Variable;
  4034. dim, i, size: LONGINT;
  4035. (* TODO: needed? *)
  4036. oldArrayDestinationTag: IntermediateCode.Operand;
  4037. oldArrayDestinationDimension: LONGINT;
  4038. position: LONGINT;
  4039. saved: RegisterEntry;
  4040. arrayFlags: SET;
  4041. m, n: LONGINT;
  4042. PROCEDURE Pass(op: IntermediateCode.Operand);
  4043. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4044. BEGIN
  4045. IF numberRegister >= 0 THEN
  4046. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  4047. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4048. Emit(Mov(position,parameterRegister, op));
  4049. ELSE
  4050. Emit(Push(position,op))
  4051. END
  4052. END Pass;
  4053. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4054. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4055. BEGIN
  4056. formalType := formalType.resolved; actualType := actualType.resolved;
  4057. IF IsOpenArray(formalType)THEN
  4058. IF actualType IS SyntaxTree.StringType THEN
  4059. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4060. RETURN;
  4061. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4062. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4063. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4064. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4065. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4066. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4067. ELSE
  4068. tmp := baseReg;
  4069. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4070. IntermediateCode.MakeMemory(tmp,addressType);
  4071. Pass((tmp));
  4072. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4073. END;
  4074. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4075. END;
  4076. END PushArrayLens;
  4077. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4078. BEGIN
  4079. CASE size OF
  4080. |2: INCL(flags,Size2Flag);
  4081. |3: INCL(flags,Size3Flag);
  4082. |4: INCL(flags,Size4Flag);
  4083. |5: INCL(flags,Size5Flag);
  4084. |6: INCL(flags,Size6Flag);
  4085. |7: INCL(flags,Size7Flag);
  4086. |8: INCL(flags,Size8Flag);
  4087. END;
  4088. END SetSmallArraySizeFlag;
  4089. BEGIN
  4090. IF Trace THEN TraceEnter("PushParameter") END;
  4091. position := expression.position;
  4092. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4093. type := expression.type.resolved;
  4094. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4095. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4096. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4097. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4098. );
  4099. (* TODO: needed? *)
  4100. oldArrayDestinationTag := arrayDestinationTag;
  4101. oldArrayDestinationDimension := arrayDestinationDimension;
  4102. IF IsArrayOfSystemByte(parameter.type) THEN
  4103. Designate(expression,operand);
  4104. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4105. ReleaseIntermediateOperand(operand.tag);
  4106. operand.tag := tmp;
  4107. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4108. Pass((operand.tag));
  4109. END;
  4110. Pass((operand.op));
  4111. ELSIF IsOpenArray(parameter.type) THEN
  4112. Designate(expression,operand);
  4113. baseReg := operand.tag;
  4114. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4115. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4116. END;
  4117. Pass((operand.op)); (* address of the array *)
  4118. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4119. (* case 1 *)
  4120. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4121. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4122. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4123. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4124. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4125. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4126. arrayDestinationTag := sp;
  4127. (* case 1b *)
  4128. IF expression IS SyntaxTree.IndexDesignator THEN
  4129. (*
  4130. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4131. descriptorType := GetMathArrayDescriptorType(dim);
  4132. variable := GetTemporaryVariable(descriptorType,expression.position);
  4133. Symbol(variable,variableOp);
  4134. arrayDestinationTag := variableOp.op;
  4135. *)
  4136. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4137. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4138. arrayDestinationDimension := dim;
  4139. Designate(expression,operand);
  4140. (* case 1a *)
  4141. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4142. Designate(expression,operand);
  4143. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4144. i := 0;
  4145. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4146. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4147. INC(i);
  4148. END;
  4149. type := expression.type.resolved;
  4150. WHILE (i<dim) DO (* remaining static dimensions *)
  4151. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4152. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4153. ReleaseOperand(tmpOperand);
  4154. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4155. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4156. ReleaseOperand(tmpOperand);
  4157. INC(i);
  4158. END;
  4159. dimOp := IntermediateCode.Immediate(addressType,dim);
  4160. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4161. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4162. (* case 1d *)
  4163. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4164. Designate(expression,operand);
  4165. Dereference(operand,type.resolved,FALSE);
  4166. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4167. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4168. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4169. (* case 1f *)
  4170. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4171. Designate(expression,operand);
  4172. FOR i := 0 TO dim-1 DO
  4173. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4174. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4175. ReleaseOperand(tmpOperand);
  4176. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4177. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4178. ReleaseOperand(tmpOperand);
  4179. END;
  4180. (*******
  4181. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4182. *)
  4183. arrayFlags := {StaticFlag};
  4184. IF dim = 1 THEN
  4185. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4186. ReleaseOperand(tmpOperand);
  4187. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4188. m := LONGINT(tmpOperand.op.intValue);
  4189. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4190. ELSIF dim = 2 THEN
  4191. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4192. ReleaseOperand(tmpOperand);
  4193. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4194. m := LONGINT(tmpOperand.op.intValue);
  4195. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4196. ReleaseOperand(tmpOperand);
  4197. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4198. n := LONGINT(tmpOperand.op.intValue);
  4199. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4200. INCL(arrayFlags,SmallMatrixFlag);
  4201. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4202. END;
  4203. END;
  4204. (*******)
  4205. dimOp := IntermediateCode.Immediate(addressType,dim);
  4206. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4207. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4208. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4209. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4210. baseType := SemanticChecker.ArrayBase(type,dim);
  4211. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4212. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4213. ELSE HALT(100);
  4214. END;
  4215. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4216. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4217. (* case 2b *)
  4218. IF expression IS SyntaxTree.IndexDesignator THEN
  4219. descriptorType := GetMathArrayDescriptorType(dim);
  4220. variable := GetTemporaryVariable(descriptorType, FALSE);
  4221. Symbol(variable,variableOp);
  4222. arrayDestinationTag := variableOp.op;
  4223. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4224. arrayDestinationDimension := dim;
  4225. NeedDescriptor := TRUE;
  4226. Designate(expression,operand);
  4227. Pass((operand.tag));
  4228. NeedDescriptor := FALSE;
  4229. (* case 2a *)
  4230. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4231. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4232. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4233. INC(i);
  4234. END;
  4235. IF i = dim THEN
  4236. Designate(expression,operand);
  4237. Pass((operand.tag));
  4238. ELSE (* open-static *)
  4239. type := expression.type.resolved;
  4240. descriptorType := GetMathArrayDescriptorType(dim);
  4241. variable := GetTemporaryVariable(descriptorType, FALSE);
  4242. Symbol(variable,variableOp);
  4243. arrayDestinationTag := variableOp.op;
  4244. Designate(expression,operand);
  4245. FOR i := 0 TO dim-1 DO
  4246. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4247. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4248. ReleaseOperand(tmpOperand);
  4249. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4250. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4251. ReleaseOperand(tmpOperand);
  4252. END;
  4253. dimOp := IntermediateCode.Immediate(addressType,dim);
  4254. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4255. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4256. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4257. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4258. baseType := SemanticChecker.ArrayBase(type,dim);
  4259. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4260. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4261. Pass((arrayDestinationTag));
  4262. END;
  4263. (* case 2d *)
  4264. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4265. Designate(expression,operand);
  4266. Dereference(operand,type.resolved,FALSE);
  4267. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4268. Pass((operand.tag));
  4269. (* case 2f *)
  4270. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4271. descriptorType := GetMathArrayDescriptorType(dim);
  4272. variable := GetTemporaryVariable(descriptorType, FALSE);
  4273. Symbol(variable,variableOp);
  4274. arrayDestinationTag := variableOp.op;
  4275. Designate(expression,operand);
  4276. FOR i := 0 TO dim-1 DO
  4277. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4278. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4279. ReleaseOperand(tmpOperand);
  4280. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4281. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4282. ReleaseOperand(tmpOperand);
  4283. END;
  4284. (*
  4285. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4286. *)
  4287. arrayFlags := {StaticFlag};
  4288. IF dim = 1 THEN
  4289. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4290. ReleaseOperand(tmpOperand);
  4291. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4292. m := LONGINT(tmpOperand.op.intValue);
  4293. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4294. ELSIF dim = 2 THEN
  4295. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4296. ReleaseOperand(tmpOperand);
  4297. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4298. m := LONGINT(tmpOperand.op.intValue);
  4299. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4300. ReleaseOperand(tmpOperand);
  4301. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4302. n := LONGINT(tmpOperand.op.intValue);
  4303. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4304. INCL(arrayFlags,SmallMatrixFlag);
  4305. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4306. END;
  4307. END;
  4308. (*******)
  4309. dimOp := IntermediateCode.Immediate(addressType,dim);
  4310. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4311. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4312. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4313. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4314. baseType := SemanticChecker.ArrayBase(type,dim);
  4315. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4316. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4317. Pass((arrayDestinationTag));
  4318. ELSE HALT(100);
  4319. END;
  4320. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4321. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4322. (* case 3b *)
  4323. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4324. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4325. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4326. Symbol(variable,variableOp);
  4327. LoadValue(variableOp,system.addressType);
  4328. ELSE
  4329. descriptorType := GetMathArrayDescriptorType(dim);
  4330. variable := GetTemporaryVariable(descriptorType, FALSE);
  4331. Symbol(variable,variableOp);
  4332. END;
  4333. arrayDestinationTag := variableOp.op;
  4334. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4335. arrayDestinationDimension := 0;
  4336. Designate(expression,operand);
  4337. Pass((operand.tag));
  4338. (* case 3a *)
  4339. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4340. i := 0;
  4341. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4342. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4343. INC(i);
  4344. END;
  4345. IF i = dim THEN
  4346. Designate(expression,operand);
  4347. Pass((operand.tag));
  4348. ELSE (* open-static *)
  4349. type := expression.type.resolved;
  4350. descriptorType := GetMathArrayDescriptorType(dim);
  4351. variable := GetTemporaryVariable(descriptorType, FALSE);
  4352. Symbol(variable,variableOp);
  4353. arrayDestinationTag := variableOp.op;
  4354. Designate(expression,operand);
  4355. FOR i := 0 TO dim-1 DO
  4356. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4357. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4358. ReleaseOperand(tmpOperand);
  4359. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4360. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4361. ReleaseOperand(tmpOperand);
  4362. END;
  4363. dimOp := IntermediateCode.Immediate(addressType,dim);
  4364. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4365. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4366. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4367. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4368. baseType := SemanticChecker.ArrayBase(type,dim);
  4369. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4370. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4371. Pass((arrayDestinationTag));
  4372. END;
  4373. (* case 3d *)
  4374. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4375. Designate(expression,operand);
  4376. Dereference(operand,type.resolved,FALSE);
  4377. (*
  4378. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4379. *)
  4380. Pass((operand.tag));
  4381. (* case 3f *)
  4382. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4383. descriptorType := GetMathArrayDescriptorType(dim);
  4384. variable := GetTemporaryVariable(descriptorType, FALSE);
  4385. Symbol(variable,variableOp);
  4386. arrayDestinationTag := variableOp.op;
  4387. Designate(expression,operand);
  4388. IF operand.op.type.length >1 THEN (* vector register *)
  4389. variable2 := GetTemporaryVariable(type, FALSE);
  4390. Symbol(variable2, variable2Op);
  4391. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4392. Emit(Mov(position,tmp, operand.op));
  4393. ReleaseOperand(operand);
  4394. Symbol(variable2, operand);
  4395. END;
  4396. FOR i := 0 TO dim-1 DO
  4397. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4398. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4399. ReleaseOperand(tmpOperand);
  4400. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4401. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4402. ReleaseOperand(tmpOperand);
  4403. END;
  4404. dimOp := IntermediateCode.Immediate(addressType,dim);
  4405. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4406. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4407. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4408. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4409. baseType := SemanticChecker.ArrayBase(type,dim);
  4410. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4411. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4412. Pass((arrayDestinationTag));
  4413. ELSE HALT(100);
  4414. END;
  4415. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4416. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4417. (* case 4b *)
  4418. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4419. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4420. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4421. Symbol(variable,variableOp);
  4422. LoadValue(variableOp,system.addressType);
  4423. ELSE
  4424. descriptorType := GetMathArrayDescriptorType(dim);
  4425. variable := GetTemporaryVariable(descriptorType, FALSE);
  4426. Symbol(variable,variableOp);
  4427. END;
  4428. arrayDestinationTag := variableOp.op;
  4429. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4430. arrayDestinationDimension := 0;
  4431. Designate(expression,operand);
  4432. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4433. Symbol(variable,variableOp);
  4434. ELSE
  4435. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4436. Symbol(variable,variableOp);
  4437. MakeMemory(tmp,variableOp.op,addressType,0);
  4438. Emit(Mov(position,tmp,operand.tag));
  4439. ReleaseIntermediateOperand(tmp);
  4440. END;
  4441. Pass((variableOp.op));
  4442. ReleaseOperand(variableOp);
  4443. (* case 4a *)
  4444. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4445. i := 0;
  4446. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4447. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4448. INC(i);
  4449. END;
  4450. IF i = dim THEN
  4451. Designate(expression,operand);
  4452. arrayDestinationTag := operand.tag;
  4453. ELSE (* open-static *)
  4454. type := expression.type.resolved;
  4455. descriptorType := GetMathArrayDescriptorType(dim);
  4456. variable := GetTemporaryVariable(descriptorType, FALSE);
  4457. Symbol(variable,variableOp);
  4458. arrayDestinationTag := variableOp.op;
  4459. Designate(expression,operand);
  4460. FOR i := 0 TO dim-1 DO
  4461. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4462. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4463. ReleaseOperand(tmpOperand);
  4464. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4465. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4466. ReleaseOperand(tmpOperand);
  4467. END;
  4468. dimOp := IntermediateCode.Immediate(addressType,dim);
  4469. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4470. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4471. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4472. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4473. baseType := SemanticChecker.ArrayBase(type,dim);
  4474. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4475. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4476. END;
  4477. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4478. Symbol(variable,variableOp);
  4479. MakeMemory(tmp,variableOp.op,addressType,0);
  4480. Emit(Mov(position,tmp,arrayDestinationTag));
  4481. ReleaseIntermediateOperand(tmp);
  4482. Pass((variableOp.op));
  4483. ReleaseOperand(variableOp);
  4484. (* case 4d *)
  4485. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4486. Designate(expression,operand);
  4487. (*
  4488. Dereference(operand,type.resolved,FALSE);
  4489. *)
  4490. (*
  4491. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4492. *)
  4493. Pass((operand.op));
  4494. (* case 4f *)
  4495. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4496. descriptorType := GetMathArrayDescriptorType(dim);
  4497. variable := GetTemporaryVariable(descriptorType, FALSE);
  4498. Symbol(variable,variableOp);
  4499. arrayDestinationTag := variableOp.op;
  4500. Designate(expression,operand);
  4501. FOR i := 0 TO dim-1 DO
  4502. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4503. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4504. ReleaseOperand(tmpOperand);
  4505. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4506. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4507. ReleaseOperand(tmpOperand);
  4508. END;
  4509. dimOp := IntermediateCode.Immediate(addressType,dim);
  4510. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4511. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4512. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4513. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4514. baseType := SemanticChecker.ArrayBase(type,dim);
  4515. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4516. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4517. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4518. Symbol(variable,variableOp);
  4519. MakeMemory(tmp,variableOp.op,addressType,0);
  4520. Emit(Mov(position,tmp,arrayDestinationTag));
  4521. ReleaseIntermediateOperand(tmp);
  4522. Pass((variableOp.op));
  4523. ReleaseOperand(variableOp);
  4524. ELSE HALT(100);
  4525. END;
  4526. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4527. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4528. Designate(expression,operand);
  4529. IF operand.op.type.length > 1 THEN
  4530. Emit(Push(position, operand.op));
  4531. ReleaseOperand(operand);
  4532. ELSE
  4533. size := system.SizeOf(type);
  4534. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4535. size := ToMemoryUnits(system,size);
  4536. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4537. arrayDestinationTag := sp;
  4538. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4539. END;
  4540. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4541. Designate(expression,operand);
  4542. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4543. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4544. Symbol(variable,variableOp);
  4545. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4546. Emit(Mov(position,tmp,operand.op));
  4547. Emit(Push(position,variableOp.op));
  4548. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4549. Pass((operand.op));
  4550. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4551. END;
  4552. ELSE HALT(200)
  4553. END;
  4554. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4555. IF parameter.kind = SyntaxTree.VarParameter THEN
  4556. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4557. Designate(expression, operand);
  4558. Pass((operand.op));
  4559. ELSE
  4560. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4561. Evaluate(expression, operand);
  4562. Pass((operand.extra)); (* step *)
  4563. Pass((operand.tag)); (* last *)
  4564. Pass((operand.op)) (* first *)
  4565. END
  4566. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4567. IF parameter.kind = SyntaxTree.VarParameter THEN
  4568. Designate(expression, operand);
  4569. Pass((operand.op));
  4570. ELSE
  4571. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4572. Evaluate(expression, operand);
  4573. Pass((operand.tag)); (* real part *)
  4574. Pass((operand.op)) (* imaginary part *)
  4575. END
  4576. ELSE
  4577. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4578. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4579. Designate(expression,operand);
  4580. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4581. (* stack allocation *)
  4582. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4583. (*! parameter alignment to be discussed ... *)
  4584. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4585. size := type(SyntaxTree.StringType).length;
  4586. END;
  4587. IF backend.cooperative & parameter.NeedsTrace() THEN
  4588. dst := NewRegisterOperand (addressType);
  4589. Emit(Mov(position,dst, sp));
  4590. IntermediateCode.InitImmediate(null, byteType, 0);
  4591. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4592. ReleaseIntermediateOperand(dst);
  4593. SaveRegisters();ReleaseUsedRegisters(saved);
  4594. (* register dst has been freed before SaveRegisters already *)
  4595. CallAssignMethod(dst, operand.op, parameter.type);
  4596. RestoreRegisters(saved);
  4597. END;
  4598. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4599. ELSIF IsOpenArray(parameter.type) THEN
  4600. Designate(expression,operand);
  4601. baseReg := operand.tag;
  4602. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4603. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4604. END;
  4605. Pass((operand.op)); (* address of the array *)
  4606. ELSIF IsDelegate(parameter.type) THEN
  4607. Evaluate(expression,operand);
  4608. IF backend.cooperative & parameter.NeedsTrace() THEN
  4609. Emit(Push(position, nil));
  4610. dst := NewRegisterOperand (addressType);
  4611. Emit(Mov(position,dst, sp));
  4612. ReleaseIntermediateOperand(dst);
  4613. SaveRegisters();ReleaseUsedRegisters(saved);
  4614. Emit(Push(position, dst));
  4615. (* register dst has been freed before SaveRegisters already *)
  4616. Emit(Push(position, operand.tag));
  4617. CallThis(position,"GarbageCollector","Assign",2);
  4618. RestoreRegisters(saved);
  4619. ELSE
  4620. Pass((operand.tag));
  4621. END;
  4622. Pass((operand.op));
  4623. ELSE
  4624. Evaluate(expression,operand);
  4625. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4626. Emit(Push(position, nil));
  4627. dst := NewRegisterOperand (addressType);
  4628. Emit(Mov(position,dst, sp));
  4629. ReleaseIntermediateOperand(dst);
  4630. SaveRegisters();ReleaseUsedRegisters(saved);
  4631. Emit(Push(position, dst));
  4632. (* register dst has been freed before SaveRegisters already *)
  4633. Emit(Push(position, operand.op));
  4634. CallThis(position,"GarbageCollector","Assign",2);
  4635. RestoreRegisters(saved);
  4636. ELSE
  4637. Pass((operand.op));
  4638. END;
  4639. END;
  4640. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4641. Evaluate(expression,operand);
  4642. Pass((operand.op));
  4643. ELSE (* var parameter *)
  4644. Designate(expression,operand);
  4645. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4646. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4647. Pass((operand.tag));
  4648. END;
  4649. END;
  4650. Pass((operand.op));
  4651. END;
  4652. END;
  4653. (* TODO: needed? *)
  4654. arrayDestinationTag := oldArrayDestinationTag;
  4655. arrayDestinationDimension := oldArrayDestinationDimension;
  4656. IF needsParameterBackup THEN
  4657. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4658. ReuseCopy(parameterBackup, operand.op)
  4659. END;
  4660. ReleaseOperand(operand);
  4661. IF Trace THEN TraceExit("PushParameter") END;
  4662. END PushParameter;
  4663. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4664. VAR prevConditional: BOOLEAN;
  4665. BEGIN
  4666. prevConditional := conditional;
  4667. conditional := FALSE;
  4668. 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
  4669. Expression(x.result); (* use register *)
  4670. END;
  4671. Statement(x.statement);
  4672. conditional := prevConditional;
  4673. IF x.result # NIL THEN Expression(x.result) END;
  4674. 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
  4675. ReleaseIntermediateOperand(result.op);
  4676. END;
  4677. END VisitStatementDesignator;
  4678. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4679. VAR
  4680. procedure: SyntaxTree.Procedure;
  4681. procedureType: SyntaxTree.ProcedureType;
  4682. wasInline: BOOLEAN;
  4683. actualParameters: SyntaxTree.ExpressionList;
  4684. formalParameter: SyntaxTree.Parameter;
  4685. actualParameter: SyntaxTree.Expression;
  4686. i: LONGINT;
  4687. localVariable: SyntaxTree.Variable;
  4688. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4689. src, dest: Operand;
  4690. prevInlineExit : Label;
  4691. prevMapper: SymbolMapper;
  4692. tooComplex: BOOLEAN;
  4693. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4694. BEGIN
  4695. IF e = NIL THEN RETURN TRUE
  4696. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4697. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4698. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4699. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4700. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4701. ELSE RETURN FALSE
  4702. END;
  4703. END SimpleExpression;
  4704. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4705. BEGIN
  4706. RETURN checker.CanPassInRegister(type)
  4707. END FitsInRegister;
  4708. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4709. VAR
  4710. variable: SyntaxTree.Variable;
  4711. variableDesignator: SyntaxTree.Designator;
  4712. BEGIN
  4713. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4714. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4715. variableDesignator.SetType(type);
  4716. RETURN variableDesignator
  4717. END GetTemp;
  4718. BEGIN
  4719. wasInline := currentIsInline;
  4720. prevInlineExit := currentInlineExit;
  4721. prevMapper := currentMapper;
  4722. currentInlineExit := NewLabel();
  4723. tooComplex := FALSE;
  4724. NEW(currentMapper);
  4725. currentIsInline := TRUE;
  4726. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4727. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4728. formalParameter := procedureType.firstParameter;
  4729. actualParameters := x.parameters;
  4730. i := 0;
  4731. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4732. actualParameter := actualParameters.GetExpression(i);
  4733. IF actualParameter.resolved # NIL THEN
  4734. actualParameter := actualParameter.resolved
  4735. END;
  4736. (*
  4737. if expression is simple and can be passed immediately
  4738. or if type fits in register then we can proceed
  4739. otherwise we escape to ordinary procedure call.
  4740. *)
  4741. (* cases where the expression can be mapped identically *)
  4742. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4743. currentMapper.Add(formalParameter, actualParameter, NIL);
  4744. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4745. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4746. (*
  4747. Assign(variableDesignator, actualParameter);
  4748. *)
  4749. Evaluate(actualParameter, src);
  4750. Designate(variableDesignator, dest);
  4751. Emit(Mov(x.position, dest.op, src.op));
  4752. ReleaseOperand(dest);
  4753. ReleaseOperand(src);
  4754. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4755. ELSE tooComplex := TRUE
  4756. END;
  4757. (*
  4758. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4759. currentMapper.Add(formalParameter, actualParameter, NIL);
  4760. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4761. variableDesignator := GetTemp(system.addressType, FALSE);
  4762. Designate(actualParameter, src);
  4763. Designate(variableDesignator, dest);
  4764. IntermediateCode.MakeMemory(dest.op,addressType);
  4765. Emit(Mov(x.position, dest.op, src.op));
  4766. ReleaseOperand(dest);
  4767. IF src.tag.mode # IntermediateCode.Undefined THEN
  4768. tagDesignator := GetTemp(system.addressType, FALSE);
  4769. Designate(tagDesignator, dest);
  4770. IntermediateCode.MakeMemory(dest.op,addressType);
  4771. Emit(Mov(x.position, dest.op, src.op));
  4772. END;
  4773. ReleaseOperand(dest); ReleaseOperand(src);
  4774. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4775. END;
  4776. *)
  4777. formalParameter := formalParameter.nextParameter;
  4778. INC(i);
  4779. END;
  4780. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4781. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4782. currentMapper.Add(NIL, returnDesignator, NIL);
  4783. END;
  4784. localVariable := procedure.procedureScope.firstVariable;
  4785. WHILE ~tooComplex & (localVariable # NIL) DO
  4786. variableDesignator := GetTemp(localVariable.type, FALSE);
  4787. currentMapper.Add(localVariable, variableDesignator, NIL);
  4788. localVariable := localVariable.nextVariable;
  4789. END;
  4790. IF ~tooComplex THEN
  4791. VisitStatementBlock(procedure.procedureScope.body);
  4792. SetLabel(currentInlineExit);
  4793. IF procedureType.returnType # NIL THEN
  4794. Designate(returnDesignator, result);
  4795. IF conditional THEN
  4796. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4797. ValueToCondition(result)
  4798. END;
  4799. END;
  4800. END;
  4801. currentMapper := prevMapper;
  4802. currentInlineExit := prevInlineExit;
  4803. currentIsInline := wasInline;
  4804. RETURN ~tooComplex
  4805. END InlineProcedureCall;
  4806. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4807. VAR
  4808. parameters: SyntaxTree.ExpressionList;
  4809. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4810. designator: SyntaxTree.Designator;
  4811. procedureType: SyntaxTree.ProcedureType;
  4812. formalParameter: SyntaxTree.Parameter;
  4813. operand, returnValue: Operand;
  4814. reg, size, mask, dest: IntermediateCode.Operand;
  4815. saved: RegisterEntry;
  4816. symbol: SyntaxTree.Symbol;
  4817. variable: SyntaxTree.Variable;
  4818. i, parametersSize, returnTypeSize : LONGINT;
  4819. structuredReturnType: BOOLEAN;
  4820. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4821. tempVariableDesignator: SyntaxTree.Designator;
  4822. gap, alignment: LONGINT; (*fld*)
  4823. (* TODO: remove unnecessary backup variables *)
  4824. oldResult: Operand;
  4825. oldCurrentScope: SyntaxTree.Scope;
  4826. oldArrayDestinationTag: IntermediateCode.Operand;
  4827. oldArrayDestinationDimension: LONGINT;
  4828. oldConstantDeclaration: SyntaxTree.Symbol;
  4829. oldDestination: IntermediateCode.Operand;
  4830. oldCurrentLoop: Label;
  4831. oldConditional: BOOLEAN;
  4832. oldTrueLabel, oldFalseLabel: Label;
  4833. oldLocked: BOOLEAN;
  4834. usedRegisters,oldUsedRegisters: RegisterEntry;
  4835. return: IntermediateCode.Operand;
  4836. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4837. arg: IntermediateCode.Operand;
  4838. dummy: IntermediateCode.Operand;
  4839. recordType: SyntaxTree.RecordType;
  4840. operatorSelectionProcedureOperand: Operand;
  4841. operatorSelectionProcedure: SyntaxTree.Procedure;
  4842. fingerPrint: SyntaxTree.FingerPrint;
  4843. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4844. identifierNumber: LONGINT;
  4845. parameterRegister: Backend.Registers;
  4846. parameterRegisters: LONGINT;
  4847. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4848. procedure: SyntaxTree.Procedure;
  4849. PROCEDURE BackupGlobalState;
  4850. BEGIN
  4851. oldResult := result;
  4852. oldCurrentScope := currentScope;
  4853. oldArrayDestinationTag := arrayDestinationTag;
  4854. oldArrayDestinationDimension := arrayDestinationDimension;
  4855. oldConstantDeclaration := constantDeclaration;
  4856. oldDestination := destination;
  4857. oldCurrentLoop := currentLoop;
  4858. oldConditional := conditional;
  4859. oldTrueLabel := trueLabel;
  4860. oldFalseLabel := falseLabel;
  4861. oldLocked := locked;
  4862. oldUsedRegisters := usedRegisters
  4863. END BackupGlobalState;
  4864. PROCEDURE RestoreGlobalState;
  4865. BEGIN
  4866. result := oldResult;
  4867. currentScope := oldCurrentScope;
  4868. arrayDestinationTag := oldArrayDestinationTag;
  4869. arrayDestinationDimension := oldArrayDestinationDimension;
  4870. constantDeclaration := oldConstantDeclaration;
  4871. destination := oldDestination;
  4872. currentLoop := oldCurrentLoop;
  4873. conditional := oldConditional;
  4874. trueLabel := oldTrueLabel;
  4875. falseLabel := oldFalseLabel;
  4876. locked := oldLocked;
  4877. usedRegisters := oldUsedRegisters
  4878. END RestoreGlobalState;
  4879. (** do preparations before parameter push for array-structured object types (ASOTs):
  4880. if ASOT is passed as VAR parameter:
  4881. - allocate temporary variable of math array type
  4882. - copy contents of ASOT to be passed to temporary variable
  4883. - use temporary variable as the actual parameter instead
  4884. - 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)
  4885. **)
  4886. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4887. VAR
  4888. expression: SyntaxTree.Expression;
  4889. BEGIN
  4890. IF actualParameter IS SyntaxTree.Designator THEN
  4891. designator := actualParameter(SyntaxTree.Designator);
  4892. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4893. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4894. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4895. ASSERT(checker # NIL);
  4896. checker.SetCurrentScope(currentScope);
  4897. (* allocate temporary variable *)
  4898. ASSERT(actualParameter.type # NIL);
  4899. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4900. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4901. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4902. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4903. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4904. ASSERT(tempVariableDesignator.type # NIL);
  4905. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4906. (* copy math array stored in actual parameter to temporary variable *)
  4907. BackupGlobalState;
  4908. AssignMathArray(tempVariableDesignator, actualParameter);
  4909. RestoreGlobalState;
  4910. (* use temporary variable as actual parameter instead of the original one *)
  4911. actualParameter := tempVariableDesignator;
  4912. (* create write-back call and store it in linked list *)
  4913. (* create new list entry *)
  4914. IF firstWriteBackCall = NIL THEN
  4915. NEW(firstWriteBackCall);
  4916. currentWriteBackCall := firstWriteBackCall
  4917. ELSE
  4918. ASSERT(currentWriteBackCall # NIL);
  4919. NEW(currentWriteBackCall.next);
  4920. currentWriteBackCall := currentWriteBackCall.next
  4921. END;
  4922. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4923. ASSERT(expression.type = NIL);
  4924. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4925. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4926. (* prepare writeback for any other "normal" indexer *)
  4927. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4928. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4929. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4930. Assign(tempVariableDesignator, actualParameter);
  4931. actualParameter := tempVariableDesignator;
  4932. IF firstWriteBackCall = NIL THEN
  4933. NEW(firstWriteBackCall);
  4934. currentWriteBackCall := firstWriteBackCall
  4935. ELSE
  4936. ASSERT(currentWriteBackCall # NIL);
  4937. NEW(currentWriteBackCall.next);
  4938. currentWriteBackCall := currentWriteBackCall.next
  4939. END;
  4940. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4941. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4942. END
  4943. END
  4944. END PrepareParameter;
  4945. BEGIN
  4946. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4947. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4948. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4949. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4950. IF InlineProcedureCall(x) THEN
  4951. RETURN
  4952. ELSE
  4953. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4954. END
  4955. END;
  4956. END;
  4957. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4958. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4959. dest := destination; destination := emptyOperand;
  4960. SaveRegisters();ReleaseUsedRegisters(saved);
  4961. parameters := x.parameters;
  4962. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4963. (* an operator is called *)
  4964. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4965. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4966. (* check if a dynamic operator call should be performed *)
  4967. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4968. ELSE
  4969. isCallOfDynamicOperator := FALSE
  4970. END;
  4971. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4972. Emit(Push(position, ap));
  4973. END;
  4974. alignment := procedureType.stackAlignment;
  4975. IF alignment > 1 THEN
  4976. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4977. Emit(Mov(position,reg, sp));
  4978. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4979. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4980. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4981. Emit(And(position,sp, sp, mask));
  4982. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  4983. Emit(Push(position,reg));
  4984. (*
  4985. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  4986. Emit(Mov(position,mem,reg));
  4987. *)
  4988. ReleaseIntermediateOperand(reg);
  4989. END;
  4990. IF (procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention) & (system.addressSize = 32) THEN
  4991. (* align stack to 16-byte boundary *)
  4992. IntermediateCode.InitImmediate(mask,addressType,-16);
  4993. Emit(And(position,sp, sp, mask))
  4994. END;
  4995. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4996. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4997. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  4998. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4999. ELSE
  5000. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5001. END;
  5002. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5003. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5004. (* push ID *)
  5005. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5006. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5007. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5008. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5009. formalParameter := procedureType.firstParameter;
  5010. FOR i := 0 TO parameters.Length() - 1 DO
  5011. IF formalParameter.access # SyntaxTree.Hidden THEN
  5012. ASSERT(i < 2);
  5013. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5014. (* push pointer *)
  5015. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5016. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5017. (* add dereference *)
  5018. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5019. ReleaseIntermediateOperand(parameterBackups[i]);
  5020. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5021. END;
  5022. Emit(Push(position,parameterBackups[i]));
  5023. ReleaseIntermediateOperand(parameterBackups[i]);
  5024. (* push typetag *)
  5025. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5026. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5027. arg := TypeDescriptorAdr(recordType);
  5028. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5029. Emit(Push(position,arg));
  5030. ELSE
  5031. (* push 'NonPointer' *)
  5032. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5033. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5034. (* push fingerprint *)
  5035. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5036. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5037. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  5038. END
  5039. END;
  5040. formalParameter := formalParameter.nextParameter
  5041. END;
  5042. (* for unary operators: complete the information for the second parameter *)
  5043. IF procedureType.numberParameters < 2 THEN
  5044. (* push 'NonPointer' *)
  5045. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5046. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5047. (* push 'NoType' *)
  5048. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5049. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5050. END;
  5051. (* call operator selection procedure *)
  5052. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5053. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5054. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5055. ReleaseOperand(operatorSelectionProcedureOperand);
  5056. (* use the address that the operator selection procedure returned as the target address of the call *)
  5057. InitOperand(operand, ModeValue);
  5058. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5059. Emit(Result(position,operand.op))
  5060. END
  5061. ELSE
  5062. Evaluate(x.left, operand)
  5063. END;
  5064. IF symbol IS SyntaxTree.Procedure THEN
  5065. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5066. Emit(Push(position,operand.tag));
  5067. ELSIF (procedureType.isDelegate) THEN
  5068. Emit(Push(position,operand.tag));
  5069. END;
  5070. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5071. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5072. Emit(Push(position,operand.tag));
  5073. END;
  5074. ELSE HALT(200);
  5075. END;
  5076. ReleaseIntermediateOperand(operand.tag);
  5077. operand.tag := emptyOperand;
  5078. (* determine if a structured return type is needed *)
  5079. structuredReturnType := StructuredReturnType(procedureType);
  5080. IF structuredReturnType THEN
  5081. IF resultDesignator # NIL THEN
  5082. d := resultDesignator;
  5083. ELSE
  5084. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  5085. variable.SetUntraced(procedureType.hasUntracedReturn);
  5086. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  5087. d.SetType(variable.type);
  5088. END;
  5089. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5090. Designate(d,returnValue);
  5091. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5092. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5093. Emit(Push(position,size));
  5094. Emit(Push(position,returnValue.op));
  5095. ReleaseOperand(returnValue);
  5096. ELSE
  5097. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5098. END;
  5099. END;
  5100. firstWriteBackCall := NIL; (* reset write-back call list *)
  5101. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5102. parameterRegister := backend.GetParameterRegisters(procedureType.callingConvention);
  5103. IF parameterRegister = NIL THEN parameterRegisters := 0
  5104. ELSE parameterRegisters := LEN(parameterRegister)
  5105. END;
  5106. passByRegister := parameterRegisters > 0;
  5107. registerNumber := 0;
  5108. IF passByRegister & (parameters.Length() > parameterRegisters) THEN
  5109. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5110. IF gap # 0 THEN
  5111. IntermediateCode.InitImmediate(size,addressType,gap);
  5112. Emit(Sub(position,sp,sp,size))
  5113. END
  5114. END;
  5115. formalParameter := procedureType.lastParameter;
  5116. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5117. actualParameter := parameters.GetExpression(i);
  5118. PrepareParameter(actualParameter, formalParameter);
  5119. IF passByRegister & (i < parameterRegisters) THEN
  5120. IF ~PassInRegister(formalParameter) THEN
  5121. Error(actualParameter.position,"cannot be passed by register")
  5122. ELSE
  5123. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,parameterRegister[i]);
  5124. END;
  5125. INC(registerNumber);
  5126. ELSE
  5127. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5128. END;
  5129. formalParameter := formalParameter.prevParameter;
  5130. END;
  5131. IF passByRegister & (registerNumber > 0) & ~SysvABI(procedureType.callingConvention) THEN
  5132. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5133. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5134. END;
  5135. ELSE
  5136. hasDynamicOperands := FALSE;
  5137. formalParameter := procedureType.firstParameter;
  5138. FOR i := 0 TO parameters.Length() - 1 DO
  5139. actualParameter := parameters.GetExpression(i);
  5140. IF formalParameter # NIL THEN (* TENTATIVE *)
  5141. PrepareParameter(actualParameter, formalParameter);
  5142. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5143. ASSERT(i < 2);
  5144. hasDynamicOperands := TRUE;
  5145. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5146. ELSE
  5147. IF passByRegister & (registerNumber > 0) THEN
  5148. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5149. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5150. END;
  5151. passByRegister := FALSE;
  5152. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5153. END;
  5154. formalParameter := formalParameter.nextParameter;
  5155. END;
  5156. END;
  5157. END;
  5158. IF symbol IS SyntaxTree.Procedure THEN
  5159. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5160. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5161. Emit(Push(position,reg));
  5162. ReleaseIntermediateOperand(reg);
  5163. END;
  5164. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5165. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5166. parametersSize := ParametersSize(system,procedureType,FALSE);
  5167. END;
  5168. ReleaseParameterRegisters();
  5169. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR SysvABI(procedureType.callingConvention) THEN
  5170. Emit(Call(position,operand.op,0));
  5171. ELSE
  5172. Emit(Call(position,operand.op,parametersSize));
  5173. END;
  5174. ReleaseOperand(operand);
  5175. IF procedureType.noReturn THEN
  5176. EmitTrap(position,NoReturnTrap);
  5177. END;
  5178. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5179. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5180. Emit(Result(position,return));
  5181. END;
  5182. IF SysvABI(procedureType.callingConvention) THEN
  5183. IF passByRegister THEN
  5184. IF parameters.Length() > parameterRegisters THEN
  5185. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5186. ELSE
  5187. parametersSize := 0
  5188. END
  5189. ELSE
  5190. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits)
  5191. END;
  5192. IF parametersSize > 0 THEN
  5193. INC( parametersSize, (-parametersSize) MOD 16 );
  5194. size := IntermediateCode.Immediate(addressType,parametersSize);
  5195. Emit(Add(position,sp,sp,size))
  5196. END;
  5197. END;
  5198. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5199. IF structuredReturnType THEN
  5200. (* stack pointer rewinding done by callee
  5201. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5202. Emit(Add(position,sp,sp,size));
  5203. *)
  5204. RestoreRegisters(saved);
  5205. InitOperand(result,ModeReference);
  5206. Symbol(variable,result);
  5207. ELSE
  5208. RestoreRegisters(saved);
  5209. InitOperand(result,ModeValue);
  5210. result.op := return;
  5211. END;
  5212. END;
  5213. IF alignment > 1 THEN
  5214. Emit(Pop(position,sp));
  5215. END;
  5216. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5217. Emit(Pop(position, ap));
  5218. END;
  5219. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5220. ValueToCondition(result);
  5221. END;
  5222. destination := dest;
  5223. (* perform all write-back calls in the list *)
  5224. BackupGlobalState;
  5225. currentWriteBackCall := firstWriteBackCall;
  5226. WHILE currentWriteBackCall # NIL DO
  5227. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5228. currentWriteBackCall := currentWriteBackCall.next
  5229. END;
  5230. RestoreGlobalState;
  5231. (* TENATIVE *)
  5232. (*
  5233. IF isOperatorCall THEN
  5234. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5235. END;
  5236. *)
  5237. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5238. END VisitProcedureCallDesignator;
  5239. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5240. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5241. td: SyntaxTree.Symbol;
  5242. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5243. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5244. BEGIN
  5245. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5246. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5247. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5248. variable.SetType(system.anyType);
  5249. scope.AddVariable(variable);
  5250. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5251. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5252. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5253. typeDeclaration.SetScope(module.module.moduleScope);
  5254. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5255. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5256. END;
  5257. RETURN hiddenPointerType;
  5258. END GetHiddenPointerType;
  5259. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5260. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5261. BEGIN
  5262. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5263. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5264. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  5265. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  5266. scope.AddVariable(variable);
  5267. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  5268. variable.SetType(system.anyType);
  5269. scope.AddVariable(variable);
  5270. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  5271. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  5272. typeDeclaration.SetDeclaredType(delegatePointerType);
  5273. typeDeclaration.SetScope(module.module.moduleScope);
  5274. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5275. delegatePointerType.SetState(SyntaxTree.Resolved);
  5276. END;
  5277. RETURN delegatePointerType
  5278. END GetDelegateType;
  5279. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5280. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5281. such as in VAR a: RECORD ... END;
  5282. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5283. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5284. *)
  5285. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5286. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5287. BEGIN (* no code emission *)
  5288. source := NIL;
  5289. x := x.resolved;
  5290. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5291. x := GetHiddenPointerType();
  5292. ELSIF IsDelegate(x) THEN
  5293. x := GetDelegateType();
  5294. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5295. ELSE HALT(200);
  5296. END;
  5297. td := x.typeDeclaration;
  5298. IF td = NIL THEN
  5299. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5300. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5301. ASSERT(td # NIL);
  5302. END;
  5303. IF newObjectFile THEN
  5304. GetCodeSectionNameForSymbol(td,name);
  5305. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5306. meta.CheckTypeDeclaration(x);
  5307. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5308. ELSE
  5309. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5310. END;
  5311. IF backend.cooperative OR meta.simple THEN
  5312. offset := 0;
  5313. ELSE
  5314. IF x IS SyntaxTree.CellType THEN
  5315. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5316. IF baseRecord = NIL THEN
  5317. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5318. ELSE
  5319. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5320. END;
  5321. ELSE
  5322. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5323. END;
  5324. END;
  5325. ELSE
  5326. offset := 0;
  5327. source := module.allSections.FindBySymbol(td); (*TODO*)
  5328. IF source = NIL THEN
  5329. null := 0;
  5330. GetCodeSectionNameForSymbol(td,name);
  5331. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5332. Basic.SuffixSegmentedName (name, module.module.name);
  5333. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5334. IntermediateCode.InitImmediate(op,addressType,0);
  5335. source(IntermediateCode.Section).Emit(Data(position,op));
  5336. source.SetReferenced(FALSE)
  5337. ELSE
  5338. name := source.name;
  5339. END;
  5340. END;
  5341. RETURN td
  5342. END GetBackendType;
  5343. BEGIN
  5344. (*td := t.typeDeclaration;*)
  5345. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5346. (*
  5347. IF t IS SyntaxTree.PointerType THEN
  5348. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5349. ELSE
  5350. source := GetBackendType(t);
  5351. END;
  5352. *)
  5353. IF newObjectFile THEN
  5354. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5355. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5356. IntermediateCode.SetOffset(res,offset);
  5357. ELSE
  5358. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5359. END;
  5360. (*
  5361. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5362. make memory should be used when tag is used, not earlier
  5363. *)
  5364. RETURN res
  5365. END TypeDescriptorAdr;
  5366. (*
  5367. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5368. VAR result: IntermediateCode.Operand;
  5369. BEGIN
  5370. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5371. operand.tag := TypeDescriptorAdr(operand.type);
  5372. IntermediateCode.MakeMemory(operand.tag,addressType);
  5373. UseIntermediateOperand(operand.tag);
  5374. END;
  5375. END MakeTypeTag;
  5376. *)
  5377. PROCEDURE ProfilerInit;
  5378. VAR reg: IntermediateCode.Operand;
  5379. BEGIN
  5380. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5381. Emit(Call(position,reg,0));
  5382. END ProfilerInit;
  5383. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5384. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5385. BEGIN
  5386. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5387. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5388. THEN
  5389. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5390. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5391. Emit(Push(position,reg));
  5392. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5393. Emit(Push(position,reg));
  5394. StaticCallOperand(result,procedure);
  5395. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5396. ReleaseOperand(result);
  5397. END;
  5398. END ProfilerEnterExit;
  5399. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5400. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5401. BEGIN
  5402. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5403. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5404. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5405. profileInit.Emit(Push(position,reg));
  5406. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5407. profileInit.Emit(Push(position,reg));
  5408. NEW(string, LEN(name)); COPY(name, string^);
  5409. sv := SyntaxTree.NewStringValue(-1,string);
  5410. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5411. sv.SetType(type);
  5412. Designate(sv,result);
  5413. profileInit.Emit(Push(position,result.tag));
  5414. profileInit.Emit(Push(position,result.op));
  5415. StaticCallOperand(result,procedure);
  5416. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5417. ReleaseOperand(result);
  5418. END;
  5419. END ProfilerAddProcedure;
  5420. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5421. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5422. BEGIN
  5423. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5424. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5425. profileInit.Emit(Push(position,reg));
  5426. profileInitPatchPosition := profileInit.pc;
  5427. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5428. NEW(string, LEN(name)); COPY(name, string^);
  5429. sv := SyntaxTree.NewStringValue(-1,string);
  5430. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5431. sv.SetType(type);
  5432. Designate(sv,result);
  5433. profileInit.Emit(Push(position,result.tag));
  5434. profileInit.Emit(Push(position,result.op));
  5435. StaticCallOperand(result,procedure);
  5436. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5437. ReleaseOperand(result);
  5438. END;
  5439. END ProfilerAddModule;
  5440. PROCEDURE ProfilerPatchInit;
  5441. VAR reg: IntermediateCode.Operand;
  5442. BEGIN
  5443. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5444. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5445. EmitLeave(profileInit,position,0);
  5446. profileInit.Emit(Exit(position,0,0));
  5447. END ProfilerPatchInit;
  5448. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5449. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5450. VAR
  5451. id: LONGINT;
  5452. leftType, rightType: SyntaxTree.Type;
  5453. procedureType: SyntaxTree.ProcedureType;
  5454. runtimeProcedure: SyntaxTree.Procedure;
  5455. runtimeProcedureOperand, operatorOperand: Operand;
  5456. kind: SET;
  5457. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5458. VAR
  5459. arg: IntermediateCode.Operand;
  5460. recordType: SyntaxTree.RecordType;
  5461. fingerPrint: SyntaxTree.FingerPrint;
  5462. BEGIN
  5463. IF type = NIL THEN
  5464. (* no type: push 'NoType' *)
  5465. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5466. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5467. ELSIF IsStrictlyPointerToRecord(type) THEN
  5468. (* pointer to record type: push typetag *)
  5469. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5470. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5471. arg := TypeDescriptorAdr(recordType);
  5472. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5473. ELSE
  5474. (* non-pointer to record type: push fingerprint *)
  5475. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5476. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5477. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5478. END;
  5479. operatorInitializationCodeSection.Emit(Push(position,arg))
  5480. END PushTypeInfo;
  5481. BEGIN
  5482. ASSERT(operatorInitializationCodeSection # NIL);
  5483. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5484. procedureType := operator.type(SyntaxTree.ProcedureType);
  5485. (* determine types *)
  5486. leftType := procedureType.firstParameter.type;
  5487. IF procedureType.numberParameters = 2 THEN
  5488. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5489. rightType := procedureType.firstParameter.nextParameter.type;
  5490. ELSE
  5491. rightType := NIL
  5492. END;
  5493. (* determine operator kind *)
  5494. IF IsStrictlyPointerToRecord(leftType) THEN
  5495. kind := {LhsIsPointer}
  5496. ELSE
  5497. kind := {}
  5498. END;
  5499. IF IsStrictlyPointerToRecord(rightType) THEN
  5500. kind := kind + {RhsIsPointer}
  5501. END;
  5502. IF kind # {} THEN (* TODO: to be removed later on *)
  5503. (* at least one of the types is a pointer to record *)
  5504. (* emit a code that registers this specific operator in the runtime *)
  5505. dump := operatorInitializationCodeSection.comments;
  5506. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5507. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5508. (* push ID *)
  5509. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5510. id := Global.GetSymbol(module.module.case, operator.name);
  5511. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5512. (* push kind *)
  5513. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5514. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5515. (* push type infos *)
  5516. PushTypeInfo(leftType);
  5517. PushTypeInfo(rightType);
  5518. (* push operator address *)
  5519. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5520. StaticCallOperand(operatorOperand, operator);
  5521. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5522. ReleaseOperand(operatorOperand);
  5523. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5524. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5525. ReleaseOperand(runtimeProcedureOperand)
  5526. END
  5527. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5528. END
  5529. END RegisterDynamicOperator;
  5530. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5531. VAR
  5532. traceModule: SyntaxTree.Module;
  5533. procedure: SyntaxTree.Procedure;
  5534. procedureVariable: SyntaxTree.Variable;
  5535. s,msg: Basic.MessageString;
  5536. res: Operand;
  5537. i: LONGINT;
  5538. sv: SyntaxTree.StringValue;
  5539. type: SyntaxTree.Type;
  5540. recordType: SyntaxTree.RecordType;
  5541. printout: Printout.Printer;
  5542. stringWriter: Streams.StringWriter;
  5543. expression: SyntaxTree.Expression;
  5544. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5545. BEGIN
  5546. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5547. IF procedure = NIL THEN
  5548. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5549. END;
  5550. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5551. s := "procedure ";
  5552. Strings.Append(s,backend.traceModuleName);
  5553. Strings.Append(s,".");
  5554. Strings.Append(s,procedureName);
  5555. Strings.Append(s," not present");
  5556. Error(position,s);
  5557. RETURN FALSE
  5558. ELSE
  5559. RETURN TRUE
  5560. END;
  5561. END GetProcedure;
  5562. PROCEDURE CallProcedure;
  5563. VAR size: LONGINT;
  5564. BEGIN
  5565. IF procedure # NIL THEN
  5566. StaticCallOperand(result,procedure);
  5567. size := ProcedureParametersSize(system,procedure);
  5568. ELSE
  5569. Symbol(procedureVariable, result);
  5570. LoadValue(result, procedureVariable.type.resolved);
  5571. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5572. END;
  5573. Emit(Call(position,result.op,size));
  5574. END CallProcedure;
  5575. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5576. VAR res: Operand; string: SyntaxTree.String;
  5577. BEGIN
  5578. IF GetProcedure("String") THEN
  5579. NEW(string, LEN(s)); COPY(s, string^);
  5580. sv := SyntaxTree.NewStringValue(-1,string);
  5581. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5582. sv.SetType(type);
  5583. Designate(sv,res);
  5584. Emit(Push(position,res.tag));
  5585. Emit(Push(position,res.op));
  5586. ReleaseOperand(res);
  5587. CallProcedure;
  5588. END;
  5589. END String;
  5590. PROCEDURE Integer(op: IntermediateCode.Operand);
  5591. BEGIN
  5592. IF GetProcedure("Int") THEN
  5593. Emit(Push(position,op));
  5594. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5595. CallProcedure;
  5596. END;
  5597. END Integer;
  5598. PROCEDURE Float(op: IntermediateCode.Operand);
  5599. BEGIN
  5600. IF GetProcedure("HIntHex") THEN
  5601. Emit(Push(position,op));
  5602. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5603. CallProcedure;
  5604. END;
  5605. END Float;
  5606. PROCEDURE Set(op: IntermediateCode.Operand);
  5607. BEGIN
  5608. IF GetProcedure("Set") THEN
  5609. Emit(Push(position,op));
  5610. (*
  5611. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5612. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5613. *)
  5614. CallProcedure;
  5615. END;
  5616. END Set;
  5617. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5618. BEGIN
  5619. IF GetProcedure("Boolean") THEN
  5620. Emit(Push(position,op));
  5621. CallProcedure;
  5622. END;
  5623. END Boolean;
  5624. PROCEDURE Char(op: IntermediateCode.Operand);
  5625. BEGIN
  5626. IF GetProcedure("Char") THEN
  5627. Emit(Push(position,op));
  5628. CallProcedure;
  5629. END;
  5630. END Char;
  5631. PROCEDURE Address(op: IntermediateCode.Operand);
  5632. BEGIN
  5633. IF GetProcedure("Address") THEN
  5634. Emit(Push(position,op));
  5635. CallProcedure;
  5636. END;
  5637. END Address;
  5638. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5639. BEGIN
  5640. IF GetProcedure("String") THEN
  5641. Emit(Push(position,tag));
  5642. Emit(Push(position,op));
  5643. CallProcedure;
  5644. END;
  5645. END StringOperand;
  5646. PROCEDURE Ln;
  5647. BEGIN
  5648. IF GetProcedure("Ln") THEN
  5649. CallProcedure;
  5650. END;
  5651. END Ln;
  5652. BEGIN
  5653. IF backend.traceModuleName = "" THEN RETURN END;
  5654. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5655. IF GetProcedure("Enter") THEN
  5656. CallProcedure
  5657. END;
  5658. NEW(stringWriter,LEN(s));
  5659. FOR i := 0 TO x.Length()-1 DO
  5660. msg := "";
  5661. expression := x.GetExpression(i);
  5662. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5663. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5664. ELSE
  5665. Global.GetModuleName(module.module, s);
  5666. END;
  5667. IF i = 0 THEN
  5668. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5669. stringWriter.String(":");
  5670. END;
  5671. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5672. IF ~(expression IS SyntaxTree.StringValue) THEN
  5673. printout.Expression(expression);
  5674. stringWriter.Get(s);
  5675. Strings.Append(msg,s);
  5676. Strings.Append(msg,"= ");
  5677. ELSE stringWriter.Get(s); (* remove from string writer *)
  5678. Strings.Append(msg, s);
  5679. END;
  5680. String(msg);
  5681. IF SemanticChecker.IsStringType(expression.type) THEN
  5682. Designate(expression,res);
  5683. StringOperand(res.op,res.tag);
  5684. ELSE
  5685. Evaluate(expression,res);
  5686. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5687. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5688. Convert(res.op,int64);
  5689. END;
  5690. Integer(res.op);
  5691. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5692. Boolean(res.op);
  5693. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5694. Set(res.op);
  5695. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5696. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5697. Convert(res.op,float64);
  5698. END;
  5699. Float(res.op);
  5700. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5701. Char(res.op);
  5702. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5703. Address(res.op);String("H");
  5704. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5705. Address(res.op);String("H");
  5706. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5707. Address(res.op);String("H");
  5708. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5709. Address(res.op);String("H");
  5710. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5711. String("NIL");
  5712. ELSE HALT(200);
  5713. END;
  5714. END;
  5715. ReleaseOperand(res);
  5716. String("; ");
  5717. END;
  5718. IF GetProcedure("Exit") THEN
  5719. CallProcedure
  5720. ELSE
  5721. Ln;
  5722. END;
  5723. END;
  5724. END SystemTrace;
  5725. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5726. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5727. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5728. BEGIN
  5729. type := type.resolved;
  5730. IF type IS SyntaxTree.RecordType THEN
  5731. WITH type: SyntaxTree.RecordType DO
  5732. baseType := type.baseType;
  5733. IF baseType # NIL THEN
  5734. baseType := baseType.resolved;
  5735. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5736. InitFields(baseType,adr,offset);
  5737. END;
  5738. variable := type.recordScope.firstVariable;
  5739. WHILE variable # NIL DO
  5740. IF variable.initializer # NIL THEN
  5741. Evaluate(variable.initializer,initializerOp);
  5742. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5743. Emit(Mov(position,mem,initializerOp.op));
  5744. ReleaseOperand(initializerOp);
  5745. ReleaseIntermediateOperand(mem);
  5746. END;
  5747. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5748. variable := variable.nextVariable
  5749. END;
  5750. END;
  5751. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5752. WITH type: SyntaxTree.ArrayType DO
  5753. IF type.form = SyntaxTree.Static THEN
  5754. baseType := type.arrayBase;
  5755. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5756. FOR i := 0 TO type.staticLength-1 DO
  5757. InitFields(baseType,adr,offset+i*size);
  5758. END;
  5759. END;
  5760. END;
  5761. ELSIF type IS SyntaxTree.MathArrayType THEN
  5762. WITH type: SyntaxTree.MathArrayType DO
  5763. IF type.form = SyntaxTree.Open THEN
  5764. dim := DynamicDim(type);
  5765. imm := IntermediateCode.Immediate(addressType,dim);
  5766. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5767. baseType := SemanticChecker.ArrayBase(type,dim);
  5768. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5769. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5770. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5771. ReleaseIntermediateOperand(imm);
  5772. (* flags remain empty (=0) for open array *)
  5773. ELSIF type.form = SyntaxTree.Static THEN
  5774. baseType := type.arrayBase;
  5775. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5776. ASSERT(type.staticLength < 1024*1024*1024);
  5777. FOR i := 0 TO type.staticLength-1 DO
  5778. InitFields(baseType,adr,offset+i*size);
  5779. END;
  5780. END;
  5781. END;
  5782. END;
  5783. END InitFields;
  5784. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5785. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5786. BEGIN
  5787. type := variable.type.resolved;
  5788. IF (type IS SyntaxTree.MathArrayType) THEN
  5789. WITH type: SyntaxTree.MathArrayType DO
  5790. IF type.form = SyntaxTree.Open THEN
  5791. Symbol(variable,operand);
  5792. InitFields(type, operand.tag,0);
  5793. ELSIF type.form = SyntaxTree.Tensor THEN
  5794. Symbol(variable, operand);
  5795. MakeMemory(tmp,operand.op,addressType,0);
  5796. ReleaseOperand(operand);
  5797. Emit(Mov(position,tmp, nil ) );
  5798. ReleaseIntermediateOperand(tmp);
  5799. END;
  5800. END;
  5801. ELSE
  5802. Symbol(variable,operand);
  5803. IF variable.initializer # NIL THEN
  5804. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5805. reference.SetType(variable.type.resolved);
  5806. reference.SetAssignable(TRUE);
  5807. Assign(reference,variable.initializer);
  5808. END;
  5809. InitFields(type, operand.op,0);
  5810. ReleaseOperand(operand);
  5811. END;
  5812. END InitVariable;
  5813. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5814. VAR end: Label;
  5815. BEGIN
  5816. IF type.form = SyntaxTree.Tensor THEN
  5817. InitOperand(result,ModeValue);
  5818. ReuseCopy(result.op,base);
  5819. end := NewLabel();
  5820. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5821. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5822. SetLabel(end);
  5823. Convert(result.op,int32);
  5824. ELSE
  5825. InitOperand(result,ModeValue);
  5826. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5827. END
  5828. END MathArrayDim;
  5829. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5830. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5831. BEGIN
  5832. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5833. MakeMemory(mem,base,addressType,offset);
  5834. Emit(Mov(position,mem,value));
  5835. ReleaseIntermediateOperand(mem);
  5836. END PutMathArrayField;
  5837. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5838. VAR mem: IntermediateCode.Operand;
  5839. BEGIN
  5840. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5841. MakeMemory(mem,base,addressType,offset);
  5842. Emit(Mov(position,mem,value));
  5843. ReleaseIntermediateOperand(mem);
  5844. END PutMathArrayFieldOffset;
  5845. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5846. BEGIN
  5847. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5848. MakeMemory(value,base,addressType,offset);
  5849. END GetMathArrayField;
  5850. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5851. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5852. BEGIN
  5853. IF incr THEN
  5854. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5855. ELSE
  5856. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5857. END;
  5858. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5859. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5860. ELSE
  5861. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5862. Emit(Mov(position,reg,dim));
  5863. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5864. Emit(Add(position,reg,reg,base));
  5865. MakeMemory(mem, reg, addressType, offset);
  5866. ReleaseIntermediateOperand(reg);
  5867. Emit(Mov(position,mem,value));
  5868. ReleaseIntermediateOperand(mem);
  5869. END;
  5870. END PutMathArrayLenOrIncr;
  5871. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5872. BEGIN
  5873. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5874. END PutMathArrayLength;
  5875. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5876. BEGIN
  5877. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5878. END PutMathArrayIncrement;
  5879. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5880. BEGIN
  5881. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5882. END GetMathArrayIncrement;
  5883. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5884. BEGIN
  5885. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5886. END GetMathArrayLength;
  5887. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5888. VAR dimOp: IntermediateCode.Operand;
  5889. BEGIN
  5890. dimOp := IntermediateCode.Immediate(int32, dim);
  5891. GetMathArrayLength(type, operand, dimOp, check, result);
  5892. END GetMathArrayLengthAt;
  5893. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5894. VAR dimOp: IntermediateCode.Operand;
  5895. BEGIN
  5896. dimOp := IntermediateCode.Immediate(int32, dim);
  5897. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5898. END GetMathArrayIncrementAt;
  5899. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5900. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5901. offset: LONGINT;
  5902. BEGIN
  5903. IF increment THEN
  5904. offset := MathIncrOffset;
  5905. ELSE
  5906. offset := MathLenOffset;
  5907. END;
  5908. INC(offset,operand.dimOffset*2);
  5909. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5910. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5911. END;
  5912. (* static dimension *)
  5913. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5914. IF check & (type.form = SyntaxTree.Tensor) THEN
  5915. DimensionCheck(operand.tag,dim,BrltL);
  5916. END;
  5917. val := SHORT(dim.intValue);
  5918. IF type.form # SyntaxTree.Tensor THEN
  5919. t := SemanticChecker.ArrayBase(type,val);
  5920. type := t.resolved(SyntaxTree.MathArrayType);
  5921. IF type.form = SyntaxTree.Static THEN
  5922. IF increment THEN
  5923. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5924. ELSE
  5925. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5926. END;
  5927. InitOperand(result,ModeValue);
  5928. result.op := res;
  5929. RETURN;
  5930. END;
  5931. END;
  5932. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5933. MakeMemory(res,operand.tag,addressType,offset);
  5934. (*
  5935. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5936. *)
  5937. InitOperand(result,ModeValue);
  5938. result.op := res;
  5939. ELSE
  5940. Convert(dim,addressType);
  5941. IF check THEN
  5942. IF type.form = SyntaxTree.Tensor THEN
  5943. DimensionCheck(operand.tag,dim,BrltL);
  5944. ELSIF isUnchecked THEN (* do nothing *)
  5945. ELSE
  5946. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5947. END;
  5948. END;
  5949. end := NewLabel(); next := NIL;
  5950. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5951. Emit(Mov(position,res,dim));
  5952. Convert(res,int32);
  5953. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5954. WHILE t IS SyntaxTree.MathArrayType DO
  5955. type := t(SyntaxTree.MathArrayType);
  5956. IF type.form = SyntaxTree.Static THEN
  5957. imm := IntermediateCode.Immediate(int32,val);
  5958. next := NewLabel();
  5959. BrneL(next,imm,res);
  5960. IF increment THEN
  5961. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5962. ELSE
  5963. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5964. END;
  5965. Emit(MovReplace(position,res,imm));
  5966. BrL(end);
  5967. ELSE hasDynamicPart := TRUE;
  5968. END;
  5969. t := type.arrayBase.resolved;
  5970. val := val + 1;
  5971. IF next # NIL THEN SetLabel(next) END;
  5972. END;
  5973. IF hasDynamicPart THEN
  5974. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5975. Emit(Mov(position,res2,dim));
  5976. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5977. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5978. Emit(Add(position,res2,res2,imm));
  5979. Emit(Add(position,res2,res2,operand.tag));
  5980. IntermediateCode.MakeMemory(res2,int32);
  5981. Emit(MovReplace(position,res,res2));
  5982. ReleaseIntermediateOperand(res2);
  5983. END;
  5984. SetLabel(end);
  5985. Convert(res,int32);
  5986. InitOperand(result,ModeValue);
  5987. result.op := res;
  5988. END;
  5989. END MathArrayLenOrIncr;
  5990. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  5991. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5992. offset: LONGINT;
  5993. BEGIN
  5994. offset := operand.dimOffset+DynamicDim(type)-1;
  5995. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5996. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  5997. val := SHORT(dim.intValue);
  5998. t := SemanticChecker.ArrayBase(type,val);
  5999. type := t.resolved(SyntaxTree.ArrayType);
  6000. IF type.form = SyntaxTree.Static THEN
  6001. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6002. ELSE
  6003. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6004. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6005. END;
  6006. UseIntermediateOperand(res);
  6007. InitOperand(result,ModeValue);
  6008. result.op := res;
  6009. ELSE
  6010. Convert(dim,addressType);
  6011. IF ~isUnchecked THEN
  6012. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6013. END;
  6014. end := NewLabel(); next := NIL;
  6015. (* ReuseCopy(dim,res); *)
  6016. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6017. Emit(Mov(position,res,dim));
  6018. Convert(res,int32);
  6019. Convert(res,int32);
  6020. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6021. WHILE t IS SyntaxTree.ArrayType DO
  6022. type := t(SyntaxTree.ArrayType);
  6023. IF type.form = SyntaxTree.Static THEN
  6024. imm := IntermediateCode.Immediate(int32,val);
  6025. next := NewLabel();
  6026. BrneL(next,imm,res);
  6027. imm := IntermediateCode.Immediate(int32,type.staticLength);
  6028. Emit(MovReplace(position,res,imm));
  6029. BrL(end);
  6030. ELSE hasDynamicPart := TRUE;
  6031. END;
  6032. t := type.arrayBase.resolved;
  6033. val := val + 1;
  6034. IF next # NIL THEN SetLabel(next) END;
  6035. END;
  6036. IF hasDynamicPart THEN
  6037. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6038. Convert(res2,addressType);
  6039. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6040. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6041. Emit(Sub(position,res2,imm,res2));
  6042. Emit(Add(position,res2,res2,operand.tag));
  6043. IntermediateCode.MakeMemory(res2,int32);
  6044. Emit(MovReplace(position,res,res2));
  6045. ReleaseIntermediateOperand(res2);
  6046. END;
  6047. SetLabel(end);
  6048. Convert(res,int32);
  6049. InitOperand(result,ModeValue);
  6050. result.op := res;
  6051. END;
  6052. END ArrayLen;
  6053. (**
  6054. create a temporary variable in current scope
  6055. **)
  6056. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  6057. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  6058. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6059. BEGIN
  6060. IF ~register THEN
  6061. variable := temporaries.GetFreeVariable(type, index);
  6062. ELSE
  6063. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6064. END;
  6065. scope := currentScope;
  6066. IF variable = NIL THEN
  6067. COPY("@hiddenIRVar",string);
  6068. Basic.AppendNumber(string,index);
  6069. name := SyntaxTree.NewIdentifier(string);
  6070. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  6071. variable.SetType(type);
  6072. variable.SetAccess(SyntaxTree.Hidden);
  6073. IF ~register THEN
  6074. temporaries.AddVariable(variable);
  6075. IF scope.lastVariable # NIL THEN
  6076. offset := scope.lastVariable.offsetInBits;
  6077. ELSE
  6078. offset := 0;
  6079. END;
  6080. DEC(offset,system.SizeOf(variable.type));
  6081. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6082. variable(SyntaxTree.Variable).SetOffset(offset);
  6083. scope.AddVariable(variable(SyntaxTree.Variable));
  6084. scope.EnterSymbol(variable, duplicate);
  6085. ASSERT(~duplicate);
  6086. InitVariable(variable(SyntaxTree.Variable));
  6087. ELSE
  6088. variable.SetUseRegister(TRUE);
  6089. variable(SyntaxTree.Variable).SetOffset(0);
  6090. END;
  6091. ELSE
  6092. InitVariable(variable(SyntaxTree.Variable));
  6093. (*
  6094. ASSERT(variable.type.resolved = type.resolved)
  6095. *)
  6096. END;
  6097. RETURN variable(SyntaxTree.Variable)
  6098. END GetTemporaryVariable;
  6099. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6100. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6101. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6102. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6103. i: LONGINT; duplicate: BOOLEAN;
  6104. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6105. VAR variable: SyntaxTree.Variable;
  6106. BEGIN
  6107. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  6108. variable.SetType(type);
  6109. recordScope.AddVariable(variable);
  6110. END AddVariable;
  6111. BEGIN
  6112. name := "@ArrayDescriptor";
  6113. Basic.AppendNumber(name,dimensions);
  6114. identifier := SyntaxTree.NewIdentifier(name);
  6115. parentScope := module.module.moduleScope;
  6116. symbol := parentScope.FindSymbol(identifier);
  6117. IF symbol # NIL THEN
  6118. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6119. type := typeDeclaration.declaredType;
  6120. ELSE
  6121. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  6122. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6123. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6124. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  6125. recordType.SetTypeDeclaration(typeDeclaration);
  6126. recordType.SetState(SyntaxTree.Resolved);
  6127. typeDeclaration.SetDeclaredType(recordType);
  6128. AddVariable("@ptr",system.anyType);
  6129. AddVariable("@adr",system.addressType);
  6130. AddVariable("@flags",system.addressType);
  6131. AddVariable("@dim",system.addressType);
  6132. AddVariable("@elementSize",system.addressType);
  6133. FOR i := 0 TO dimensions-1 DO
  6134. name := "@len";
  6135. Basic.AppendNumber(name,i);
  6136. AddVariable(name,system.addressType);
  6137. name := "@incr";
  6138. Basic.AppendNumber(name,i);
  6139. AddVariable(name,system.addressType);
  6140. END;
  6141. parentScope.AddTypeDeclaration(typeDeclaration);
  6142. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6143. ASSERT(~duplicate);
  6144. type := recordType;
  6145. END;
  6146. RETURN type
  6147. END GetMathArrayDescriptorType;
  6148. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6149. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6150. BEGIN
  6151. type := GetMathArrayDescriptorType(dimensions);
  6152. Emit(Push(position,op.op));
  6153. (* push type descriptor *)
  6154. reg := TypeDescriptorAdr(type);
  6155. IF ~newObjectFile THEN
  6156. IntermediateCode.MakeMemory(reg,addressType);
  6157. END;
  6158. Emit(Push(position,reg));
  6159. ReleaseIntermediateOperand(reg);
  6160. (* push realtime flag: false by default *)
  6161. Emit(Push(position,false));
  6162. CallThis(position,"Heaps","NewRec",3);
  6163. END NewMathArrayDescriptor;
  6164. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6165. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6166. BEGIN
  6167. NEW(string, LEN(s)); COPY(s, string^);
  6168. sv := SyntaxTree.NewStringValue(-1,string);
  6169. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  6170. sv.SetType(type);
  6171. Designate(sv,res);
  6172. Emit(Push(position,res.tag));
  6173. Emit(Push(position,res.op));
  6174. ReleaseOperand(res);
  6175. END PushConstString;
  6176. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6177. BEGIN
  6178. IF b THEN
  6179. Emit(Push(-1, true));
  6180. ELSE
  6181. Emit(Push(-1, false));
  6182. END;
  6183. END PushConstBoolean;
  6184. PROCEDURE PushConstSet(v: SET);
  6185. VAR value: SyntaxTree.Value; op: Operand;
  6186. BEGIN
  6187. value := SyntaxTree.NewSetValue(-1, v);
  6188. value.SetType(system.setType);
  6189. Evaluate(value, op);
  6190. Emit(Push(-1, op.op));
  6191. ReleaseOperand(op);
  6192. END PushConstSet;
  6193. PROCEDURE PushConstInteger(v: LONGINT);
  6194. VAR value: SyntaxTree.Value; op: Operand;
  6195. BEGIN
  6196. value := SyntaxTree.NewIntegerValue(-1, v);
  6197. value.SetType(system.longintType);
  6198. Evaluate(value, op);
  6199. Emit(Push(-1, op.op));
  6200. ReleaseOperand(op);
  6201. END PushConstInteger;
  6202. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6203. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6204. section: IntermediateCode.Section;
  6205. BEGIN
  6206. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6207. Global.GetSymbolSegmentedName(symbol, name);
  6208. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6209. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  6210. procedure.SetScope(moduleScope);
  6211. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  6212. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6213. procedure.SetAccess(SyntaxTree.Hidden);
  6214. currentScope := procedureScope;
  6215. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6216. EmitEnter(section, -1,NIL,0,0,0);
  6217. RETURN section;
  6218. END OpenInitializer;
  6219. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6220. BEGIN
  6221. EmitLeave(section, 0, 0 );
  6222. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  6223. section := prev;
  6224. END CloseInitializer;
  6225. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6226. VAR name: SyntaxTree.IdentifierString;
  6227. variable: SyntaxTree.Variable;
  6228. type: SyntaxTree.Type;
  6229. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6230. BEGIN
  6231. InitOperand(op,ModeReference);
  6232. op.op := fp;
  6233. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6234. Dereference(op, x, FALSE);
  6235. result := op;
  6236. Symbol(symbol, op);
  6237. END Field;
  6238. PROCEDURE Direction(direction: LONGINT): SET;
  6239. BEGIN
  6240. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6241. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6242. ELSE HALT(100);
  6243. END;
  6244. END Direction;
  6245. PROCEDURE AddPortProperty(port: SyntaxTree.Variable; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6246. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6247. BEGIN
  6248. Field(port, op);
  6249. ToMemory(op.op,addressType,0);
  6250. Emit(Push(-1, op.op));
  6251. ReleaseOperand(op);
  6252. Basic.GetString(modifier.identifier, name);
  6253. PushConstString(name);
  6254. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6255. ASSERT(SemanticChecker.IsStringType(value.type));
  6256. Designate(value, op);
  6257. Emit(Push(modifier.position, op.tag));
  6258. Emit(Push(modifier.position, op.op));
  6259. ReleaseOperand(op);
  6260. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6261. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6262. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6263. Evaluate(value, op);
  6264. Emit(Push(modifier.position, op.op));
  6265. ReleaseOperand(op);
  6266. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6267. ELSE
  6268. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6269. END;
  6270. END AddPortProperty;
  6271. PROCEDURE AddPortProperties(variable: SyntaxTree.Variable);
  6272. VAR modifier: SyntaxTree.Modifier;
  6273. BEGIN
  6274. modifier := variable.modifiers;
  6275. WHILE modifier # NIL DO
  6276. AddPortProperty(variable,modifier, modifier.expression);
  6277. modifier := modifier.nextModifier;
  6278. END;
  6279. END AddPortProperties;
  6280. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  6281. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6282. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6283. PROCEDURE PushLens(type: SyntaxTree.Type);
  6284. BEGIN
  6285. IF IsSemiDynamicArray(type) THEN
  6286. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6287. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6288. Emit(Push(-1, op.op));
  6289. ReleaseOperand(op);
  6290. INC(dim);
  6291. ELSIF IsStaticArray(type) THEN
  6292. len := len * type(SyntaxTree.ArrayType).staticLength;
  6293. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6294. INC(dim);
  6295. ELSE
  6296. baseType := type;
  6297. END;
  6298. END PushLens;
  6299. BEGIN
  6300. (* cell *)
  6301. IF variable.type IS SyntaxTree.ArrayType THEN
  6302. type := variable.type;
  6303. dim := 0;
  6304. len := 1;
  6305. PushLens(type);
  6306. portType := baseType.resolved(SyntaxTree.PortType);
  6307. ELSE
  6308. portType := variable.type(SyntaxTree.PortType);
  6309. END;
  6310. PushSelfPointer();
  6311. (* port / array of ports *)
  6312. IF IsStaticArray(type) THEN
  6313. PushConstInteger(len);
  6314. END;
  6315. Field(variable, op);
  6316. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6317. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  6318. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  6319. Designate(d, op);*)
  6320. Emit(Push(-1, op.op));
  6321. ReleaseOperand(op);
  6322. (* name *)
  6323. PushConstString(name);
  6324. (* inout *)
  6325. PushConstSet(Direction(portType.direction));
  6326. (* width *)
  6327. PushConstInteger(portType.sizeInBits);
  6328. IF variable.type IS SyntaxTree.PortType THEN
  6329. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6330. AddPortProperties(variable);
  6331. ELSIF IsStaticArray(type)THEN
  6332. CallThis(variable.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6333. ELSIF IsSemiDynamicArray(type) THEN
  6334. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6335. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6336. Emit(Add(position,reg, sp, size));
  6337. (* dim *)
  6338. PushConstInteger(dim);
  6339. (* len array *)
  6340. Emit(Push(position, reg));
  6341. ReleaseIntermediateOperand(reg);
  6342. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6343. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6344. Emit(Add(position, sp,sp, size));
  6345. ELSE
  6346. HALT(100);
  6347. END;
  6348. END Variable;
  6349. BEGIN
  6350. IF backend.cellsAreObjects THEN
  6351. variable := x.cellScope.firstVariable;
  6352. WHILE (variable # NIL) DO
  6353. type := variable.type.resolved;
  6354. WHILE (type IS SyntaxTree.ArrayType) DO
  6355. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6356. END;
  6357. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6358. Global.GetSymbolNameInScope(variable,x.cellScope,name);
  6359. Variable(name,variable);
  6360. END;
  6361. variable := variable.nextVariable;
  6362. END;
  6363. ELSE HALT(200)
  6364. END;
  6365. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6366. (*
  6367. x.typeDeclaration.GetName(componentName);
  6368. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6369. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6370. instanceType.SetDataMemorySize(dataMemorySize);
  6371. END;
  6372. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6373. instanceType.SetInstructionMemorySize(codeMemorySize)
  6374. END;
  6375. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6376. instanceType.AddCapability(ActiveCells.VectorCapability)
  6377. END;
  6378. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6379. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6380. END;
  6381. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6382. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6383. END;
  6384. AddDevices(instanceType, x);
  6385. *)
  6386. (*
  6387. IF x.isCellNet THEN
  6388. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6389. END;
  6390. *)
  6391. (*currentActiveCellsScope := instanceType;*)
  6392. (*
  6393. parameter := x.firstParameter;
  6394. portIndex := 0;
  6395. WHILE parameter # NIL DO
  6396. parameter.GetName(parameterName);
  6397. parameterType := parameter.type.resolved;
  6398. Parameter(parameterName, parameterType);
  6399. (*
  6400. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6401. ParameterArray(parameterType);
  6402. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6403. FOR i := 0 TO len-1 DO
  6404. COPY(parameterName,name);
  6405. AppendIndex(name,i);
  6406. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6407. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6408. INC(portIndex);
  6409. END;
  6410. ELSE
  6411. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6412. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6413. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6414. INC(portIndex);
  6415. END;
  6416. *)
  6417. parameter := parameter.nextParameter;
  6418. END;
  6419. *)
  6420. (*
  6421. Scope(x.cellScope);
  6422. currentActiveCellsScope := prevActiveCellsScope;
  6423. AddModules(instanceType,x.cellScope);
  6424. *)
  6425. END AddPorts;
  6426. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6427. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6428. BEGIN
  6429. Symbol(cell,op);
  6430. ToMemory(op.op,addressType,0);
  6431. Emit(Push(position,op.op));
  6432. ReleaseOperand(op);
  6433. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6434. PushConstString(name);
  6435. IF (value # NIL) THEN
  6436. ASSERT(
  6437. SemanticChecker.IsStringType(property.type)
  6438. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6439. OR (property.type.resolved IS SyntaxTree.FloatType)
  6440. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6441. OR (property.type.resolved IS SyntaxTree.SetType)
  6442. );
  6443. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6444. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6445. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6446. Designate(d, op);
  6447. IF SemanticChecker.IsStringType(property.type) THEN
  6448. Emit(Push(-1, op.tag))
  6449. END;
  6450. Emit(Push(-1, op.op));
  6451. ReleaseOperand(op);
  6452. END;
  6453. IF value = NIL THEN
  6454. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6455. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6456. ASSERT(SemanticChecker.IsStringType(value.type));
  6457. Designate(value, op);
  6458. Emit(Push(property.position, op.tag));
  6459. Emit(Push(property.position, op.op));
  6460. ReleaseOperand(op);
  6461. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6462. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6463. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6464. Evaluate(value, op);
  6465. Emit(Push(property.position, op.op));
  6466. ReleaseOperand(op);
  6467. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6468. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6469. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6470. Evaluate(value, op);
  6471. Emit(Push(property.position, op.op));
  6472. ReleaseOperand(op);
  6473. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6474. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6475. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6476. Evaluate(value, op);
  6477. Emit(Push(property.position, op.op));
  6478. ReleaseOperand(op);
  6479. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6480. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6481. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6482. Evaluate(value, op);
  6483. Emit(Push(property.position, op.op));
  6484. ReleaseOperand(op);
  6485. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6486. ELSE
  6487. HALT(200);
  6488. END;
  6489. END AddProperty;
  6490. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6491. VAR symbol: SyntaxTree.Symbol;
  6492. BEGIN
  6493. WHILE modifier # NIL DO
  6494. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6495. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6496. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6497. ELSE
  6498. (*! move this check to checker *)
  6499. Error(modifier.position, "undefined property");
  6500. END;
  6501. modifier := modifier.nextModifier;
  6502. END;
  6503. END AddModifiers;
  6504. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6505. VAR last: SyntaxTree.Modifier;
  6506. BEGIN
  6507. IF to = NIL THEN
  6508. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6509. ELSE
  6510. last := to;
  6511. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6512. last := last.nextModifier;
  6513. END;
  6514. IF last.identifier # this.identifier THEN
  6515. ASSERT(last.nextModifier = NIL);
  6516. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6517. END;
  6518. END;
  6519. END AppendModifier;
  6520. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6521. BEGIN
  6522. WHILE this # NIL DO
  6523. AppendModifier(to, this);
  6524. this := this.nextModifier;
  6525. END;
  6526. END AppendModifiers;
  6527. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6528. VAR base: SyntaxTree.Type;
  6529. BEGIN
  6530. AppendModifiers(to, c.modifiers);
  6531. base := c.GetBaseValueType();
  6532. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6533. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6534. END;
  6535. END AppendCellTypeModifiers;
  6536. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6537. VAR op: Operand;
  6538. BEGIN
  6539. Evaluate(p, op);
  6540. Emit(Push(p.position, op.op));
  6541. ReleaseOperand(op);
  6542. (*
  6543. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6544. p := p(SyntaxTree.Designator).left;
  6545. END;
  6546. IF p # NIL THEN
  6547. Evaluate(p, op);
  6548. Emit(Push(p.position, op.op));
  6549. ReleaseOperand(op);
  6550. ELSE
  6551. Emit(Push(-1, nil));
  6552. END;
  6553. *)
  6554. END PushPort;
  6555. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6556. VAR
  6557. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6558. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6559. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6560. tmp:IntermediateCode.Operand;
  6561. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6562. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6563. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6564. dest: IntermediateCode.Operand;
  6565. staticLength: LONGINT; itype: IntermediateCode.Type;
  6566. convert,isTensor: BOOLEAN;
  6567. recordType: SyntaxTree.RecordType;
  6568. baseType: SyntaxTree.Type;
  6569. flags: SET;
  6570. left: SyntaxTree.Expression;
  6571. call: SyntaxTree.Designator;
  6572. procedure: SyntaxTree.Procedure;
  6573. temporaryVariable: SyntaxTree.Variable;
  6574. dummy: IntermediateCode.Operand;
  6575. customBuiltin: SyntaxTree.CustomBuiltin;
  6576. isVarPar: ARRAY 3 OF BOOLEAN;
  6577. callsection: Sections.Section;
  6578. segmentedName: Basic.SegmentedName;
  6579. needsTrace: BOOLEAN;
  6580. n: ARRAY 256 OF CHAR;
  6581. modifier: SyntaxTree.Modifier;
  6582. previous, init: IntermediateCode.Section;
  6583. prevScope: SyntaxTree.Scope;
  6584. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6585. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6586. priority: IntermediateCode.Operand;
  6587. op,callop: Operand;
  6588. BEGIN
  6589. IF type = NIL THEN RETURN END;
  6590. type := type.resolved;
  6591. IF type IS SyntaxTree.PointerType THEN
  6592. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6593. END;
  6594. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6595. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6596. recordScope := type(SyntaxTree.RecordType).recordScope;
  6597. IF recordScope.bodyProcedure # NIL THEN
  6598. procedure := recordScope.bodyProcedure;
  6599. body := procedure.procedureScope.body;
  6600. Emit(Push(position,self));
  6601. IF body.isActive THEN
  6602. StaticCallOperand(callop,procedure);
  6603. Emit(Push(position,callop.op));
  6604. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6605. Convert(priority,sizeType);
  6606. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6607. END;
  6608. Emit(Push(position,priority));
  6609. ReleaseIntermediateOperand(priority);
  6610. IF backend.cooperative THEN
  6611. Emit(Push(position,self));
  6612. CallThis(position,"Activities","Create",3)
  6613. ELSE
  6614. flags := 0;
  6615. IF body.isSafe THEN
  6616. flags := 1;
  6617. END;
  6618. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6619. Emit(Push(position,self));
  6620. CallThis(position,"Objects","CreateProcess",4)
  6621. END;
  6622. ELSE
  6623. Emit(Push(position,self));
  6624. StaticCallOperand(callop,procedure);
  6625. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6626. END;
  6627. Emit(Pop(position,self));
  6628. END;
  6629. END CallBodies;
  6630. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6631. BEGIN
  6632. actualType := actualType.resolved;
  6633. IF actualType IS SyntaxTree.StringType THEN
  6634. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6635. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6636. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6637. ELSE
  6638. tmp := op.tag;
  6639. IntermediateCode.MakeMemory(tmp,addressType);
  6640. Emit(Push(position,tmp));
  6641. END;
  6642. Emit(Push(position,op.op))
  6643. END PushString;
  6644. PROCEDURE PushTD(type: SyntaxTree.Type);
  6645. VAR op: IntermediateCode.Operand;
  6646. BEGIN
  6647. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6648. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6649. ELSE
  6650. IF type.resolved IS SyntaxTree.PointerType THEN
  6651. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6652. END;
  6653. op := TypeDescriptorAdr(type.resolved);
  6654. IF ~newObjectFile THEN
  6655. IntermediateCode.MakeMemory(op,addressType);
  6656. END;
  6657. Emit(Push(position,op));
  6658. END
  6659. END PushTD;
  6660. BEGIN
  6661. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6662. dest := destination; destination := emptyOperand;
  6663. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6664. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6665. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6666. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6667. CASE x.id OF
  6668. (* ---- COPY ----- *)
  6669. |Global.Copy:
  6670. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6671. (* ---- EXCL, INCL----- *)
  6672. |Global.Excl,Global.Incl:
  6673. Evaluate(p0,s0);
  6674. Evaluate(p1,s1);
  6675. Convert(s1.op,setType);
  6676. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6677. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6678. END;
  6679. ReuseCopy(res,s0.op);
  6680. ReleaseOperand(s0);
  6681. Reuse1(tmp,s1.op);
  6682. ReleaseOperand(s1);
  6683. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6684. IF x.id = Global.Excl THEN
  6685. Emit(Not(position,tmp,tmp));
  6686. Emit(And(position,res,res,tmp));
  6687. ELSE
  6688. Emit(Or(position,res,res,tmp));
  6689. END;
  6690. ReleaseIntermediateOperand(tmp);
  6691. Designate(p0,s0);
  6692. ToMemory(s0.op,setType,0);
  6693. Emit(Mov(position,s0.op,res));
  6694. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6695. (* ---- DISPOSE ----- *)
  6696. |Global.Dispose:
  6697. Designate(p0,s0);
  6698. Emit(Push(position,s0.op));
  6699. ReleaseOperand(s0);
  6700. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6701. (* ---- GETPROCEDURE ----- *)
  6702. |Global.GetProcedure:
  6703. Designate(p0,s0);
  6704. PushString(s0,p0.type);
  6705. Designate(p1,s1);
  6706. PushString(s1,p1.type);
  6707. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6708. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6709. ELSE PushTD(procedureType.firstParameter.type)
  6710. END;
  6711. PushTD(procedureType.returnType);
  6712. Designate(p2,s2);
  6713. Emit(Push(position,s2.op));
  6714. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6715. CallThis(position,"Modules","GetProcedure", 7);
  6716. (* ---- ASH, LSH, ROT ----- *)
  6717. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6718. Evaluate(p0,s0);
  6719. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6720. (* make unsigned arguments in order to produced a logical shift *)
  6721. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6722. convert:= TRUE;
  6723. itype := s0.op.type;
  6724. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6725. Convert(s0.op,itype);
  6726. ELSE
  6727. convert := FALSE;
  6728. END;
  6729. END;
  6730. Evaluate(p1,s1);
  6731. IF IsIntegerConstant(p1,hint) THEN
  6732. ReuseCopy(reg,s0.op);
  6733. IF hint > 0 THEN
  6734. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6735. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6736. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6737. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6738. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6739. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6740. END;
  6741. ELSIF hint < 0 THEN
  6742. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6743. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6744. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6745. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6746. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6747. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6748. END;
  6749. END;
  6750. ReleaseOperand(s0); ReleaseOperand(s1);
  6751. ELSE
  6752. exit := NewLabel();
  6753. end := NewLabel();
  6754. ReuseCopy(reg,s0.op);
  6755. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6756. Reuse1(tmp,s1.op);
  6757. Emit(Neg(position,tmp,s1.op));
  6758. Convert(tmp,s1.op.type);
  6759. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6760. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6761. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6762. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6763. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6764. END;
  6765. ReleaseIntermediateOperand(tmp);
  6766. BrL(end);
  6767. SetLabel(exit);
  6768. ReuseCopy(tmp,s1.op);
  6769. Convert(tmp,s1.op.type);
  6770. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6771. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6772. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6773. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6774. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6775. END;
  6776. ReleaseIntermediateOperand(tmp);
  6777. SetLabel(end);
  6778. ReleaseOperand(s0); ReleaseOperand(s1);
  6779. END;
  6780. InitOperand(result,ModeValue);
  6781. IF convert THEN
  6782. itype := reg.type;
  6783. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6784. Convert(reg,itype);
  6785. END;
  6786. result.op := reg;
  6787. (* ---- CAP ----- *)
  6788. |Global.Cap:
  6789. Evaluate(p0,result);
  6790. ReuseCopy(reg,result.op);
  6791. ReleaseIntermediateOperand(result.op);
  6792. ignore := NewLabel();
  6793. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6794. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6795. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6796. SetLabel(ignore);
  6797. result.op := reg;
  6798. (* ---- CHR ----- *)
  6799. |Global.Chr, Global.Chr32:
  6800. Evaluate(p0,result);
  6801. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6802. |Global.Entier, Global.EntierH:
  6803. Evaluate(p0,result);
  6804. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6805. (* ---- MIN and MAX ----- *)
  6806. |Global.Max,Global.Min:
  6807. Evaluate(p0,s0);
  6808. Evaluate(p1,s1);
  6809. Reuse2(res,s0.op,s1.op);
  6810. else := NewLabel();
  6811. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6812. ELSE BrltL(else,s1.op,s0.op) END;
  6813. Emit(Mov(position,res,s0.op));
  6814. ReleaseOperand(s0);
  6815. end := NewLabel();
  6816. BrL(end);
  6817. SetLabel(else);
  6818. Emit(MovReplace(position,res,s1.op));
  6819. SetLabel(end);
  6820. ReleaseOperand(s1);
  6821. InitOperand(result,ModeValue);
  6822. result.op := res;
  6823. (* ---- ODD ----- *)
  6824. |Global.Odd:
  6825. IF ~conditional THEN
  6826. ConditionToValue(x)
  6827. ELSE
  6828. Evaluate(p0,result);
  6829. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6830. Reuse1(res,result.op);
  6831. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6832. ReleaseIntermediateOperand(result.op);
  6833. result.op := res;
  6834. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6835. ReleaseOperand(result);
  6836. BrL(falseLabel);
  6837. END;
  6838. (* ---- ORD ----- *)
  6839. |Global.Ord, Global.Ord32:
  6840. Evaluate(p0,result);
  6841. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6842. (* ---- SHORT, LONG ----- *)
  6843. |Global.Short, Global.Long:
  6844. Evaluate(p0,result);
  6845. IF x.type IS SyntaxTree.ComplexType THEN
  6846. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6847. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6848. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6849. ELSE
  6850. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6851. END
  6852. (* ---- HALT, SYSTEM.HALT----- *)
  6853. |Global.Halt, Global.systemHalt:
  6854. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6855. EmitTrap (position, val);
  6856. (* ---- ASSERT ----- *)
  6857. |Global.Assert:
  6858. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6859. trueL := NewLabel();
  6860. falseL := NewLabel();
  6861. Condition(p0,trueL,falseL);
  6862. IF p1 = NIL THEN val := AssertTrap
  6863. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6864. END;
  6865. SetLabel(falseL);
  6866. EmitTrap(position,val);
  6867. SetLabel(trueL);
  6868. END;
  6869. (*
  6870. Emit(TrapC(result.op,val);
  6871. *)
  6872. (* ---- INC, DEC----- *)
  6873. |Global.Inc,Global.Dec:
  6874. Expression(p0); adr := result.op;
  6875. LoadValue(result,p0.type); l := result;
  6876. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6877. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6878. END;
  6879. IF x.id = Global.Inc THEN
  6880. Emit(Add(position,l.op,l.op,r.op));
  6881. ELSE
  6882. Emit(Sub(position,l.op,l.op,r.op));
  6883. END;
  6884. ReleaseOperand(l); ReleaseOperand(r);
  6885. (* ---- LEN ----- *)
  6886. |Global.Len: (* dynamic length, static length done by checker *)
  6887. Designate(p0,operand);
  6888. IF p1 = NIL THEN
  6889. InitOperand(l,ModeValue);
  6890. l.op := IntermediateCode.Immediate(int32,0);
  6891. ELSE
  6892. Evaluate(p1,l);
  6893. END;
  6894. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6895. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6896. Dereference(operand, p0.type.resolved, FALSE);
  6897. END;
  6898. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6899. ReleaseOperand(operand); ReleaseOperand(l);
  6900. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6901. ASSERT(p1 # NIL);
  6902. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6903. Dereference(operand,p0.type.resolved,FALSE);
  6904. END;
  6905. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6906. ReleaseOperand(operand); ReleaseOperand(l);
  6907. ELSE HALT(100);
  6908. END;
  6909. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6910. (* ---- FIRST ---- *)
  6911. |Global.First:
  6912. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6913. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6914. ELSE
  6915. Designate(p0, result)
  6916. END
  6917. (* ---- LAST ---- *)
  6918. |Global.Last:
  6919. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6920. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6921. ELSE
  6922. Designate(p0, result);
  6923. (* make sure result.op is a register *)
  6924. tmp := result.op;
  6925. ReuseCopy(result.op, result.op);
  6926. ReleaseIntermediateOperand(tmp);
  6927. (* add offset to result.op *)
  6928. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6929. END
  6930. (* ---- STEP ---- *)
  6931. |Global.Step:
  6932. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6933. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6934. ELSE
  6935. Designate(p0, result);
  6936. (* make sure result.op is a register *)
  6937. tmp := result.op;
  6938. ReuseCopy(result.op, result.op);
  6939. ReleaseIntermediateOperand(tmp);
  6940. (* add offset to result.op *)
  6941. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6942. END
  6943. (* ---- RE ---- *)
  6944. |Global.Re:
  6945. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6946. Designate(p0, result)
  6947. ELSE
  6948. Evaluate(p0, result)
  6949. END
  6950. (* ---- IM ---- *)
  6951. |Global.Im:
  6952. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6953. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6954. Designate(p0, result);
  6955. (* make sure result.op is a register *)
  6956. tmp := result.op;
  6957. ReuseCopy(result.op, result.op);
  6958. ReleaseIntermediateOperand(tmp);
  6959. (* add offset to result.op *)
  6960. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6961. (* ---- ABS ----- *)
  6962. |Global.Abs:
  6963. Evaluate(p0,operand);
  6964. type := p0.type.resolved;
  6965. InitOperand(result,ModeValue);
  6966. Reuse1a(result.op,operand.op,dest);
  6967. Emit(Abs(position,result.op,operand.op));
  6968. ReleaseOperand(operand);
  6969. (* ---- WAIT ----- *)
  6970. |Global.Wait:
  6971. Evaluate(p0,operand);
  6972. Emit(Push(position,operand.op));
  6973. ReleaseOperand(operand);
  6974. CallThis(position,"Activities","Wait", 1);
  6975. (* ---- NEW ----- *)
  6976. |Global.New:
  6977. (*! the following code is only correct for "standard" Oberon calling convention *)
  6978. type := p0.type.resolved;
  6979. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6980. THEN
  6981. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6982. IF backend.cooperative THEN
  6983. size := ToMemoryUnits(system,system.SizeOf(recordType));
  6984. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6985. IF recordType.isObject THEN
  6986. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6987. IF recordType.IsActive() THEN
  6988. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6989. END;
  6990. IF recordType.IsProtected() THEN
  6991. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6992. END;
  6993. ELSE
  6994. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6995. END;
  6996. END;
  6997. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  6998. CallThis(position,"Runtime","New", 1);
  6999. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7000. Emit(Result(position, pointer));
  7001. exit := NewLabel();
  7002. BreqL(exit,pointer,nil);
  7003. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7004. GetRecordTypeName (recordType,name);
  7005. IF ~recordType.isObject THEN
  7006. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7007. END;
  7008. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7009. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7010. IF recordType.isObject THEN
  7011. IF recordType.IsProtected() THEN
  7012. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7013. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7014. END;
  7015. IF recordType.IsActive() THEN
  7016. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7017. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7018. END;
  7019. END;
  7020. END;
  7021. (* initialize fields *)
  7022. IF type(SyntaxTree.PointerType).isPlain THEN
  7023. size := 0;
  7024. ELSIF recordType.isObject THEN
  7025. size := BaseObjectTypeSize;
  7026. ELSE
  7027. size := BaseRecordTypeSize;
  7028. END;
  7029. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7030. (* call initializer *)
  7031. constructor := GetConstructor(recordType);
  7032. IF constructor # NIL THEN
  7033. (*! should be unified with ProcedureCallDesignator *)
  7034. Emit(Push(position,pointer));
  7035. ReleaseIntermediateOperand(pointer);
  7036. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7037. FOR i := 1 TO x.parameters.Length()-1 DO
  7038. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7039. formalParameter := formalParameter.nextParameter;
  7040. END;
  7041. (* static call of the constructor *)
  7042. GetCodeSectionNameForSymbol(constructor,name);
  7043. ASSERT(~constructor.isInline);
  7044. IF constructor.scope.ownerModule # module.module THEN
  7045. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7046. ELSE
  7047. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7048. END;
  7049. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7050. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7051. Emit(Pop(position,pointer));
  7052. END;
  7053. (* call bodies *)
  7054. CallBodies(pointer,p0.type);
  7055. SetLabel(exit);
  7056. needsTrace := p0.NeedsTrace();
  7057. IF needsTrace THEN ModifyAssignments(true) END;
  7058. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7059. Emit(Push(position, pointer));
  7060. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7061. Emit(Pop(position, pointer));
  7062. END;
  7063. Designate(p0,l);
  7064. IF needsTrace THEN
  7065. CallAssignPointer(l.op, pointer);
  7066. ELSE
  7067. ToMemory(l.op,addressType,0);
  7068. Emit(Mov(position,l.op,pointer));
  7069. END;
  7070. ReleaseIntermediateOperand(pointer);
  7071. ReleaseOperand(l);
  7072. IF needsTrace THEN ModifyAssignments(false) END;
  7073. ELSE
  7074. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7075. IF temporaryVariable # NIL THEN
  7076. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7077. ELSE
  7078. Designate(p0,l);
  7079. END;
  7080. (* l.op contains address of pointer to record *)
  7081. Emit(Push(position,l.op)); (* address for use after syscall *)
  7082. Emit(Push(position,l.op));
  7083. ReleaseOperand(l);
  7084. (* push type descriptor *)
  7085. reg := TypeDescriptorAdr(recordType);
  7086. IF ~newObjectFile THEN
  7087. IntermediateCode.MakeMemory(reg,addressType);
  7088. END;
  7089. Emit(Push(position,reg));
  7090. ReleaseIntermediateOperand(reg);
  7091. (* push realtime flag *)
  7092. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7093. ELSE Emit(Push(position,false));
  7094. END;
  7095. CallThis(position,"Heaps","NewRec", 3);
  7096. (* check allocation success, if not successful then do not call initializers and bodies *)
  7097. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7098. Emit(Pop(position,pointer));
  7099. MakeMemory(reg,pointer,addressType,0);
  7100. ReleaseIntermediateOperand(pointer);
  7101. pointer := reg;
  7102. exit := NewLabel();
  7103. BreqL(exit,pointer,nil);
  7104. Emit(Push(position,pointer));
  7105. (* initialize fields *)
  7106. InitFields(recordType, pointer,0);
  7107. (* call initializer *)
  7108. constructor := GetConstructor(recordType);
  7109. IF constructor # NIL THEN
  7110. (*! should be unified with ProcedureCallDesignator *)
  7111. Emit(Push(position,pointer));
  7112. ReleaseIntermediateOperand(pointer);
  7113. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7114. FOR i := 1 TO x.parameters.Length()-1 DO
  7115. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7116. formalParameter := formalParameter.nextParameter;
  7117. END;
  7118. (* static call of the constructor *)
  7119. GetCodeSectionNameForSymbol(constructor,name);
  7120. ASSERT(~constructor.isInline);
  7121. IF constructor.scope.ownerModule # module.module THEN
  7122. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7123. ELSE
  7124. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7125. END;
  7126. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7127. ELSE
  7128. ReleaseIntermediateOperand(pointer);
  7129. END;
  7130. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7131. Emit(Pop(position,pointer));
  7132. IF temporaryVariable # NIL THEN
  7133. Designate(p0,l);
  7134. ToMemory(l.op,addressType,0);
  7135. Emit(Mov(position,l.op,pointer));
  7136. ReleaseOperand(l);
  7137. result.tag := emptyOperand;
  7138. END;
  7139. (* call bodies *)
  7140. CallBodies(pointer,p0.type);
  7141. ReleaseIntermediateOperand(pointer);
  7142. IF temporaryVariable # NIL THEN
  7143. end := NewLabel();
  7144. BrL(end);
  7145. SetLabel(exit);
  7146. Designate(p0,l);
  7147. ToMemory(l.op,addressType,0);
  7148. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7149. ReleaseOperand(l);
  7150. SetLabel(end);
  7151. ELSE
  7152. SetLabel(exit);
  7153. END;
  7154. END;
  7155. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7156. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7157. dim := 0;
  7158. IF p1 # NIL THEN
  7159. FOR i := 1 TO x.parameters.Length()-1 DO
  7160. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7161. parameter := x.parameters.GetExpression(i);
  7162. Evaluate(parameter,r);
  7163. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7164. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7165. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7166. END;
  7167. Emit(Push(position,r.op));
  7168. IF i=1 THEN
  7169. ReuseCopy(reg,r.op);
  7170. ELSE
  7171. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7172. END;
  7173. ReleaseOperand(r);
  7174. INC(dim);
  7175. END;
  7176. Convert(reg,addressType);
  7177. ELSE
  7178. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7179. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7180. END;
  7181. openDim := dim;
  7182. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7183. IF backend.cooperative THEN
  7184. size := ToMemoryUnits(system,system.SizeOf(type));
  7185. WHILE type IS SyntaxTree.ArrayType DO
  7186. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7187. END;
  7188. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7189. IF (size # 1) THEN
  7190. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7191. END;
  7192. Emit(Push(position,reg));
  7193. size := ToMemoryUnits(system,system.SizeOf(type));
  7194. IF (size # 1) THEN
  7195. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7196. END;
  7197. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  7198. Emit(Push(position,reg));
  7199. ReleaseIntermediateOperand(reg);
  7200. CallThis(position,"Runtime","New", 1);
  7201. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7202. Emit(Result(position, pointer));
  7203. exit := NewLabel();
  7204. else := NewLabel();
  7205. BreqL(else,pointer,nil);
  7206. IF ~type.hasPointers THEN
  7207. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7208. ELSIF type IS SyntaxTree.RecordType THEN
  7209. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7210. ELSIF type IS SyntaxTree.ProcedureType THEN
  7211. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7212. ELSE
  7213. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7214. END;
  7215. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7216. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7217. 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))));
  7218. IF type IS SyntaxTree.RecordType THEN
  7219. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7220. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7221. ELSE
  7222. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7223. END;
  7224. i := openDim;
  7225. WHILE i > 0 DO
  7226. DEC (i);
  7227. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7228. END;
  7229. needsTrace := p0.NeedsTrace();
  7230. IF needsTrace THEN ModifyAssignments(true) END;
  7231. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7232. Emit(Push(position, pointer));
  7233. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7234. Emit(Pop(position, pointer));
  7235. END;
  7236. Designate(p0,l);
  7237. IF needsTrace THEN
  7238. CallAssignPointer(l.op, pointer);
  7239. ModifyAssignments(false);
  7240. ELSE
  7241. ToMemory(l.op,addressType,0);
  7242. Emit(Mov(position,l.op,pointer));
  7243. END;
  7244. ReleaseIntermediateOperand(pointer);
  7245. ReleaseOperand(l);
  7246. BrL(exit);
  7247. SetLabel(else);
  7248. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7249. Designate(p0,l);
  7250. IF needsTrace THEN
  7251. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7252. ELSE
  7253. ToMemory(l.op,addressType,0);
  7254. Emit(Mov(position,l.op,pointer));
  7255. END;
  7256. ReleaseOperand(l);
  7257. SetLabel(exit);
  7258. ELSE
  7259. (*! the following code is only correct for "standard" Oberon calling convention *)
  7260. IF SemanticChecker.ContainsPointer(type) THEN
  7261. IF type IS SyntaxTree.ArrayType THEN
  7262. staticLength := 1;
  7263. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7264. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7265. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7266. END;
  7267. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7268. Emit(Mul(position,reg,reg,tmp));
  7269. END;
  7270. Designate(p0,l);
  7271. IF openDim > 0 THEN
  7272. Emit(Push(position,l.op)); (* address for use after syscall *)
  7273. END;
  7274. Emit(Push(position,l.op)); (* address *)
  7275. ReleaseOperand(l);
  7276. tmp := TypeDescriptorAdr(type);
  7277. IF ~newObjectFile THEN
  7278. IntermediateCode.MakeMemory(tmp,addressType);
  7279. END;
  7280. Emit(Push(position,tmp)); (* type descriptor *)
  7281. ReleaseIntermediateOperand(tmp);
  7282. Emit(Push(position,reg)); (* number Elements *)
  7283. ReleaseIntermediateOperand(reg);
  7284. tmp := IntermediateCode.Immediate(addressType,dim);
  7285. Emit(Push(position,tmp)); (* dimensions *)
  7286. (* push realtime flag *)
  7287. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7288. ELSE Emit(Push(position,false));
  7289. END;
  7290. CallThis(position,"Heaps","NewArr",5)
  7291. ELSE
  7292. size := ToMemoryUnits(system,system.SizeOf(type));
  7293. IF (size # 1) THEN
  7294. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7295. END;
  7296. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7297. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7298. Emit(Add(position,reg,reg,tmp));
  7299. Designate(p0,l);
  7300. IF openDim >0 THEN
  7301. Emit(Push(position,l.op)); (* address for use after syscall *)
  7302. END;
  7303. Emit(Push(position,l.op)); (* address for syscall *)
  7304. ReleaseOperand(l); (* pointer address *)
  7305. Emit(Push(position,reg)); (* size *)
  7306. ReleaseIntermediateOperand(reg);
  7307. (* push realtime flag *)
  7308. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7309. ELSE Emit(Push(position,false));
  7310. END;
  7311. CallThis(position,"Heaps","NewSys", 3)
  7312. END;
  7313. IF openDim > 0 THEN
  7314. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7315. Emit(Pop(position,adr));
  7316. ToMemory(adr,addressType,0);
  7317. ReuseCopy(tmp,adr);
  7318. ReleaseIntermediateOperand(adr);
  7319. adr := tmp;
  7320. else := NewLabel();
  7321. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7322. i := openDim-1;
  7323. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7324. WHILE (i >= 0) DO
  7325. Emit(Pop(position,reg));
  7326. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7327. Emit(Mov(position,res,reg));
  7328. DEC(i);
  7329. END;
  7330. ReleaseIntermediateOperand(adr);
  7331. ReleaseIntermediateOperand(reg);
  7332. exit := NewLabel();
  7333. BrL(exit);
  7334. SetLabel(else);
  7335. (* else part: array could not be allocated *)
  7336. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7337. Emit(Add(position,sp,sp,tmp));
  7338. SetLabel(exit);
  7339. END;
  7340. END;
  7341. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7342. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7343. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7344. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7345. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7346. left.SetType(procedure.type);
  7347. formalParameter := procedureType.firstParameter;
  7348. (* push array to allocate *)
  7349. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7350. formalParameter :=formalParameter.nextParameter;
  7351. (* push length array *)
  7352. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7353. (* push size *)
  7354. type := t0;
  7355. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7356. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7357. END;
  7358. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7359. Emit(Push(position,tmp));
  7360. (* *)
  7361. IF SemanticChecker.ContainsPointer(type) THEN
  7362. tmp := TypeDescriptorAdr(type);
  7363. IF ~newObjectFile THEN
  7364. IntermediateCode.MakeMemory(tmp,addressType);
  7365. END;
  7366. ELSE
  7367. tmp := IntermediateCode.Immediate(addressType, 0);
  7368. END;
  7369. Emit(Push(position,tmp)); (* type descriptor *)
  7370. StaticCallOperand(result,procedure);
  7371. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7372. ReleaseOperand(result);
  7373. END;
  7374. (*
  7375. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7376. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7377. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7378. *)
  7379. ELSE
  7380. dim := 0;
  7381. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7382. (* generate geometry descriptor *)
  7383. Designate(p0,l);
  7384. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7385. ReleaseOperand(l);
  7386. isTensor := TRUE;
  7387. ELSE
  7388. isTensor := FALSE;
  7389. END;
  7390. FOR i := 1 TO x.parameters.Length()-1 DO
  7391. IF ~isTensor THEN
  7392. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7393. END;
  7394. parameter := x.parameters.GetExpression(i);
  7395. Evaluate(parameter,r);
  7396. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7397. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7398. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7399. END;
  7400. Emit(Push(position,r.op));
  7401. IF i=1 THEN
  7402. ReuseCopy(reg,r.op);
  7403. ELSE
  7404. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7405. END;
  7406. ReleaseOperand(r);
  7407. INC(dim);
  7408. END;
  7409. Convert(reg,addressType);
  7410. openDim := dim;
  7411. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7412. (*! the following code is only correct for "standard" Oberon calling convention *)
  7413. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7414. t := type;
  7415. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7416. staticLength := 1;
  7417. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7418. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7419. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7420. END;
  7421. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7422. Emit(Mul(position,reg,reg,tmp));
  7423. END;
  7424. Designate(p0,l);
  7425. IF isTensor THEN
  7426. Dereference(l,type,FALSE);
  7427. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7428. END;
  7429. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7430. Emit(Push(position,l.tag)); (* address *)
  7431. ReleaseOperand(l);
  7432. tmp := TypeDescriptorAdr(t);
  7433. IF ~newObjectFile THEN
  7434. IntermediateCode.MakeMemory(tmp,addressType);
  7435. END;
  7436. Emit(Push(position,tmp)); (* type descriptor *)
  7437. ReleaseIntermediateOperand(tmp);
  7438. Emit(Push(position,reg)); (* number Elements *)
  7439. ReleaseIntermediateOperand(reg);
  7440. tmp := IntermediateCode.Immediate(addressType,0);
  7441. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7442. (* push realtime flag: false by default *)
  7443. Emit(Push(position,false));
  7444. CallThis(position,"Heaps","NewArr",5);
  7445. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7446. Emit(Pop(position,adr));
  7447. GetMathArrayField(tmp,adr,MathPtrOffset);
  7448. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7449. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7450. PutMathArrayField(adr,reg,MathAdrOffset);
  7451. ReleaseIntermediateOperand(tmp);
  7452. ReleaseIntermediateOperand(reg);
  7453. ELSE
  7454. IF isTensor THEN
  7455. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7456. ELSE
  7457. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7458. END;
  7459. IF (size # 1) THEN
  7460. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7461. END;
  7462. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7463. Emit(Add(position,reg,reg,tmp));
  7464. Designate(p0,l);
  7465. IF isTensor THEN
  7466. Dereference(l,type,FALSE);
  7467. END;
  7468. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7469. Emit(Push(position,l.tag)); (* address for syscall *)
  7470. ReleaseOperand(l); (* pointer address *)
  7471. Emit(Push(position,reg)); (* size *)
  7472. ReleaseIntermediateOperand(reg);
  7473. (* push realtime flag: false by default *)
  7474. Emit(Push(position,false));
  7475. CallThis(position,"Heaps","NewSys",3);
  7476. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7477. Emit(Pop(position,adr));
  7478. GetMathArrayField(tmp,adr,MathPtrOffset);
  7479. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7480. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7481. PutMathArrayField(adr,reg,MathAdrOffset);
  7482. ReleaseIntermediateOperand(tmp);
  7483. ReleaseIntermediateOperand(reg);
  7484. END;
  7485. flags := {};
  7486. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7487. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7488. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7489. PutMathArrayField(adr,tmp,MathDimOffset);
  7490. else := NewLabel();
  7491. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7492. i := openDim-1;
  7493. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7494. IF isTensor THEN
  7495. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7496. ELSE
  7497. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7498. END;
  7499. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7500. WHILE (i >= 0) DO
  7501. Emit(Pop(position,reg));
  7502. PutMathArrayLength(adr,reg,i);
  7503. PutMathArrayIncrement(adr,tmp,i);
  7504. IF i > 0 THEN
  7505. IF i=openDim-1 THEN
  7506. ReuseCopy(tmp,tmp);
  7507. END;
  7508. Emit(Mul(position,tmp,tmp,reg));
  7509. END;
  7510. DEC(i);
  7511. END;
  7512. ReleaseIntermediateOperand(adr);
  7513. ReleaseIntermediateOperand(reg);
  7514. ReleaseIntermediateOperand(tmp);
  7515. exit := NewLabel();
  7516. BrL(exit);
  7517. SetLabel(else);
  7518. (* else part: array could not be allocated *)
  7519. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7520. Emit(Add(position,sp,sp,tmp));
  7521. SetLabel(exit);
  7522. END;
  7523. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7524. THEN
  7525. IF ~backend.cellsAreObjects THEN RETURN END;
  7526. IF InCellScope(currentScope) THEN
  7527. PushSelfPointer()
  7528. ELSE
  7529. Emit(Push(position, nil));
  7530. END;
  7531. (* push temp address *)
  7532. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7533. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7534. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7535. (* l.op contains address of pointer to record *)
  7536. Emit(Push(position,l.op)); (* address for use after syscall *)
  7537. ReleaseOperand(l);
  7538. (* push type descriptor *)
  7539. reg := TypeDescriptorAdr(baseType);
  7540. IF ~newObjectFile THEN
  7541. IntermediateCode.MakeMemory(reg,addressType);
  7542. END;
  7543. Emit(Push(position,reg));
  7544. ReleaseIntermediateOperand(reg);
  7545. (* push name *)
  7546. (*Global.GetSymbolName(p0, n);*)
  7547. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7548. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7549. ELSE
  7550. Global.GetModuleName(module.module, n);
  7551. END;
  7552. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7553. (*type.typeDeclaration.GetName(n);*)
  7554. PushConstString(n);
  7555. (* push cellnet boolean *)
  7556. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7557. (* push engine boolean *)
  7558. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7559. (* allocate *)
  7560. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7561. (* add capabilities *)
  7562. modifier := p0(SyntaxTree.Designator).modifiers;
  7563. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7564. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7565. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7566. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7567. END;
  7568. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7569. (*
  7570. modifier := baseType(SyntaxTree.CellType).modifiers;
  7571. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7572. modifier := p0(SyntaxTree.Designator).modifiers;
  7573. *)
  7574. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7575. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7576. (* l.op contains address of pointer to record *)
  7577. ToMemory(l.op,addressType,0);
  7578. (* l.op contains value of pointer to record *)
  7579. Emit(Push(position,l.op)); (* address for use after syscall *)
  7580. ReleaseOperand(l);
  7581. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7582. prevScope := currentScope;
  7583. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7584. previous := section;
  7585. section := init;
  7586. (* add ports *)
  7587. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7588. CloseInitializer(previous);
  7589. currentScope := prevScope;
  7590. Symbol(temporaryVariable,l);
  7591. ToMemory(l.op,addressType,0);
  7592. Emit(Push(position,l.op));
  7593. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7594. (*
  7595. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7596. IF constructor # NIL THEN
  7597. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7598. FOR i := 1 TO x.parameters.Length()-1 DO
  7599. p := x.parameters.GetExpression(i);
  7600. Global.GetSymbolName(parameter,name);
  7601. Evaluate(p, value);
  7602. ASSERT(value.type # NIL);
  7603. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7604. par := instance.AddParameter(name);
  7605. par.SetInteger(value.integer);
  7606. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7607. par := instance.AddParameter(name);
  7608. par.SetBoolean(value.boolean);
  7609. ELSE Error(x.position,NotYetImplemented)
  7610. END;
  7611. parameter := parameter.nextParameter
  7612. END;
  7613. END;
  7614. *)
  7615. (* call initializer *)
  7616. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7617. IF constructor # NIL THEN
  7618. (*! should be unified with ProcedureCallDesignator *)
  7619. IF backend.cellsAreObjects THEN
  7620. Symbol(temporaryVariable,l);
  7621. ToMemory(l.op,addressType,0);
  7622. Emit(Push(position,l.op));
  7623. ReleaseOperand(l);
  7624. END;
  7625. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7626. FOR i := 1 TO x.parameters.Length()-1 DO
  7627. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7628. formalParameter := formalParameter.nextParameter;
  7629. END;
  7630. (* static call of the constructor *)
  7631. Global.GetSymbolSegmentedName(constructor,name);
  7632. ASSERT(~constructor.isInline);
  7633. IF constructor.scope.ownerModule # module.module THEN
  7634. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7635. ELSE
  7636. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7637. END;
  7638. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7639. (*ELSE
  7640. ReleaseIntermediateOperand(pointer);*)
  7641. END;
  7642. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7643. ToMemory(l.op, addressType, 0);
  7644. Designate(p0,s0);
  7645. ToMemory(s0.op,addressType,0);
  7646. Emit(Mov(position,s0.op,l.op));
  7647. ReleaseOperand(l);
  7648. ReleaseOperand(s0);
  7649. result.tag := emptyOperand;
  7650. (* start *)
  7651. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7652. (* push cell *)
  7653. Symbol(temporaryVariable, l);
  7654. ToMemory(l.op,addressType,0);
  7655. Emit(Push(-1,l.op));
  7656. (* push delegate *)
  7657. Emit(Push(-1,l.op));
  7658. ReleaseOperand(l);
  7659. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7660. Emit(Push(position, s1.op));
  7661. ReleaseOperand(s1);
  7662. CallThis(position,"ActiveCellsRuntime","Start",3);
  7663. END;
  7664. (*IF temporaryVariable # NIL THEN
  7665. end := NewLabel();
  7666. BrL(end);
  7667. SetLabel(exit);
  7668. Designate(p0,l);
  7669. ToMemory(l.op,addressType,0);
  7670. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7671. ReleaseOperand(l);
  7672. SetLabel(end);
  7673. ELSE
  7674. SetLabel(exit);
  7675. END;
  7676. *)
  7677. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7678. ELSE (* no pointer to record, no pointer to array *)
  7679. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7680. (* ignore new statement *)
  7681. Warning(p0.position, "cannot run on final hardware");
  7682. ELSE
  7683. HALT(200);
  7684. END;
  7685. END;
  7686. (* ---- ADDRESSOF----- *)
  7687. |Global.systemAdr:
  7688. Designate(p0,s0);
  7689. s0.mode := ModeValue;
  7690. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7691. ReleaseIntermediateOperand(s0.op);
  7692. s0.op := s0.tag;
  7693. IntermediateCode.InitOperand(s0.tag);
  7694. END;
  7695. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7696. result := s0;
  7697. (* ---- BIT ----- *)
  7698. |Global.systemBit:
  7699. Evaluate(p0,s0);
  7700. ToMemory(s0.op,addressType,0);
  7701. ReuseCopy(res,s0.op);
  7702. ReleaseOperand(s0);
  7703. Evaluate(p1,s1);
  7704. Emit(Ror(position,res,res,s1.op));
  7705. ReleaseOperand(s1);
  7706. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7707. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7708. IF ~conditional THEN
  7709. InitOperand(result,ModeValue); result.op := res;
  7710. ELSE
  7711. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7712. BrL(falseLabel);
  7713. ReleaseIntermediateOperand(res);
  7714. END;
  7715. (* --- MSK ----*)
  7716. |Global.systemMsk:
  7717. Evaluate(p0,s0);
  7718. Evaluate(p1,s1);
  7719. ReuseCopy(res,s0.op);
  7720. ReleaseOperand(s0);
  7721. Emit(And(position,res,res,s1.op));
  7722. ReleaseOperand(s1);
  7723. InitOperand(result,ModeValue);
  7724. result.op := res;
  7725. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7726. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7727. Evaluate(p0,s0);
  7728. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7729. ReleaseOperand(s0);
  7730. InitOperand(result,ModeValue);
  7731. result.op := res;
  7732. (* ---- SYSTEM.GetStackPointer ----- *)
  7733. |Global.systemGetStackPointer:
  7734. InitOperand(result,ModeValue);
  7735. result.op := sp;
  7736. (* ---- SYSTEM.GetFramePointer ----- *)
  7737. |Global.systemGetFramePointer:
  7738. InitOperand(result,ModeValue);
  7739. result.op := fp;
  7740. (* ---- SYSTEM.GetActivity ----- *)
  7741. |Global.systemGetActivity:
  7742. ASSERT(backend.cooperative);
  7743. InitOperand(result,ModeValue);
  7744. result.op := ap;
  7745. (* ---- SYSTEM.SetStackPointer ----- *)
  7746. |Global.systemSetStackPointer:
  7747. Evaluate(p0,s0); (* *)
  7748. Emit(Mov(position,sp,s0.op));
  7749. ReleaseOperand(s0);
  7750. (* ---- SYSTEM.SetFramePointer ----- *)
  7751. |Global.systemSetFramePointer:
  7752. Evaluate(p0,s0); (* *)
  7753. Emit(Mov(position,fp,s0.op));
  7754. ReleaseOperand(s0);
  7755. (* ---- SYSTEM.Activity ----- *)
  7756. |Global.systemSetActivity:
  7757. ASSERT(backend.cooperative);
  7758. Evaluate(p0,s0); (* *)
  7759. Emit(Mov(position,ap,s0.op));
  7760. ReleaseOperand(s0);
  7761. (* ---- SYSTEM.VAL ----- *)
  7762. |Global.systemVal:
  7763. Expression(p1);
  7764. s1 := result;
  7765. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7766. IF s1.mode = ModeReference THEN
  7767. (* nothing to be done if not record type, just take over new type *)
  7768. IF (type IS SyntaxTree.RecordType) THEN
  7769. ReleaseIntermediateOperand(s1.tag);
  7770. s1.tag := TypeDescriptorAdr(type);
  7771. IF ~newObjectFile THEN
  7772. IntermediateCode.MakeMemory(s1.tag,addressType);
  7773. END;
  7774. UseIntermediateOperand(s1.tag);
  7775. END;
  7776. result := s1;
  7777. ELSE (* copy over result to different type, may not use convert *)
  7778. itype := IntermediateCode.GetType(system,type);
  7779. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7780. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7781. Emit(Mov(position,s0.op,s1.op));
  7782. ReleaseOperand(s1);
  7783. InitOperand(result,ModeValue);
  7784. result.op := s0.op;
  7785. ELSE (* different size, must convert *)
  7786. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7787. Convert(s1.op, IntermediateCode.GetType(system,type));
  7788. result := s1;
  7789. END;
  7790. END;
  7791. (* ---- SYSTEM.GET ----- *)
  7792. |Global.systemGet:
  7793. Evaluate(p0,s0); (* adr *)
  7794. Designate(p1,s1); (* variable *)
  7795. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7796. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7797. Emit(Mov(position,s1.op,s0.op));
  7798. ReleaseOperand(s1);
  7799. ReleaseOperand(s0);
  7800. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7801. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7802. Evaluate(p0,s0); (* *)
  7803. Evaluate(p1,s1); (* variable *)
  7804. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7805. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7806. (* real part *)
  7807. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7808. Emit(Mov(position,res, s1.op));
  7809. ReleaseIntermediateOperand(res);
  7810. (* imaginary part *)
  7811. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7812. Emit(Mov(position,res, s1.tag));
  7813. ReleaseIntermediateOperand(res);
  7814. ReleaseOperand(s1);
  7815. ReleaseOperand(s0);
  7816. ELSE
  7817. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7818. ReleaseOperand(s0);
  7819. Emit(Mov(position,res,s1.op));
  7820. ReleaseIntermediateOperand(res);
  7821. ReleaseOperand(s1);
  7822. END;
  7823. (* ---- SYSTEM.MOVE ----- *)
  7824. |Global.systemMove:
  7825. Evaluate(p0,s0);
  7826. Evaluate(p1,s1);
  7827. Evaluate(p2,s2);
  7828. Emit(Copy(position,s1.op,s0.op,s2.op));
  7829. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7830. (* ---- SYSTEM.NEW ----- *)
  7831. |Global.systemNew:
  7832. Designate(p0,s0);
  7833. Emit(Push(position,s0.op));
  7834. ReleaseOperand(s0);
  7835. Evaluate(p1,s1);
  7836. Emit(Push(position,s1.op));
  7837. ReleaseOperand(s1);
  7838. (* push realtime flag: false by default *)
  7839. Emit(Push(position,false));
  7840. CallThis(position,"Heaps","NewSys",3);
  7841. (* ---- SYSTEM.CALL ----- *)
  7842. |Global.systemRef:
  7843. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7844. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7845. s0.mode := ModeValue;
  7846. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7847. result := s0
  7848. (* ---- INCR ----- *)
  7849. |Global.Incr:
  7850. Designate(p0,operand);
  7851. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7852. Dereference(operand,p0.type.resolved,FALSE);
  7853. END;
  7854. ASSERT(p1 # NIL);
  7855. Evaluate(p1,l);
  7856. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7857. ReleaseOperand(operand); ReleaseOperand(l);
  7858. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7859. (* ---- SUM ----- *)
  7860. |Global.Sum: HALT(200);
  7861. (* ---- ALL ----- *)
  7862. |Global.All: HALT(200);
  7863. (* ---- CAS ----- *)
  7864. |Global.Cas:
  7865. needsTrace := p0.NeedsTrace();
  7866. IF needsTrace THEN ModifyAssignments(true) END;
  7867. Designate(p0,s0);
  7868. Evaluate(p1,s1);
  7869. Evaluate(p2,s2);
  7870. IF needsTrace THEN
  7871. Emit(Push(position, s0.op));
  7872. Emit(Push(position, s1.op));
  7873. Emit(Push(position, s2.op));
  7874. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7875. ELSE
  7876. Emit(Cas(position,s0.op,s1.op,s2.op));
  7877. END;
  7878. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7879. IF needsTrace THEN ModifyAssignments(false) END;
  7880. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7881. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7882. IF conditional THEN
  7883. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7884. BrL(falseLabel);
  7885. ReleaseIntermediateOperand(res);
  7886. END;
  7887. (* ---- DIM ----- *)
  7888. |Global.Dim:
  7889. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7890. Designate(p0,s0);
  7891. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7892. Dereference(s0,p0.type.resolved,FALSE);
  7893. END;
  7894. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7895. ReleaseOperand(s0);
  7896. (* ---- RESHAPE ----- *)
  7897. |Global.Reshape:
  7898. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7899. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7900. left.SetType(procedure.type);
  7901. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7902. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7903. END;
  7904. (* ---- SYSTEM.TYPECODE ----- *)
  7905. |Global.systemTypeCode:
  7906. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7907. IF type.resolved IS SyntaxTree.PointerType THEN
  7908. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7909. END;
  7910. result.op := TypeDescriptorAdr(type);
  7911. IF ~newObjectFile THEN
  7912. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7913. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7914. END;
  7915. result.mode := ModeValue;
  7916. (* ---- SYSTEM.TRACE ----- *)
  7917. |Global.systemTrace:
  7918. SystemTrace(x.parameters, x.position);
  7919. (* ----- CONNECT ------*)
  7920. |Global.Connect:
  7921. IF backend.cellsAreObjects THEN
  7922. PushPort(p0);
  7923. PushPort(p1);
  7924. IF p2 # NIL THEN
  7925. Evaluate(p2, s2);
  7926. Emit(Push(p2.position, s2.op));
  7927. ReleaseOperand(s2);
  7928. ELSE
  7929. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7930. END;
  7931. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7932. ELSE
  7933. Warning(x.position, "cannot run on final hardware");
  7934. END;
  7935. (* ----- DELEGATE ------*)
  7936. |Global.Delegate:
  7937. IF backend.cellsAreObjects THEN
  7938. PushPort(p0);
  7939. PushPort(p1);
  7940. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7941. ELSE
  7942. Warning(x.position, "cannot run on final hardware");
  7943. END;
  7944. (* ----- SEND ------*)
  7945. |Global.Send:
  7946. Evaluate(p0,s0);
  7947. Evaluate(p1,s1);
  7948. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7949. Emit(Push(position,s0.op));
  7950. Emit(Push(position,s1.op));
  7951. (*
  7952. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7953. *)
  7954. IF ~backend.cellsAreObjects THEN
  7955. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7956. END;
  7957. ReleaseOperand(s0);
  7958. ReleaseOperand(s1);
  7959. IF backend.cellsAreObjects THEN
  7960. CallThis(position,"ActiveCellsRuntime","Send",2);
  7961. ELSE
  7962. CallThis(position,ChannelModuleName,"Send",2);
  7963. END;
  7964. (* ----- RECEIVE ------*)
  7965. |Global.Receive:
  7966. Evaluate(p0,s0);
  7967. Emit(Push(position,s0.op));
  7968. Designate(p1,s1);
  7969. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7970. Emit(Push(position,s1.op));
  7971. IF p2 # NIL THEN
  7972. Designate(p2,s2);
  7973. Emit(Push(position,s2.op));
  7974. END;
  7975. (*
  7976. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7977. *)
  7978. IF ~backend.cellsAreObjects THEN
  7979. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7980. END;
  7981. ReleaseOperand(s0);
  7982. ReleaseOperand(s1);
  7983. ReleaseOperand(s2);
  7984. IF backend.cellsAreObjects THEN
  7985. IF p2 = NIL THEN
  7986. CallThis(position,"ActiveCellsRuntime","Receive",2)
  7987. ELSE
  7988. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  7989. END;
  7990. ELSE
  7991. IF p2 = NIL THEN
  7992. CallThis(position,ChannelModuleName,"Receive",2)
  7993. ELSE
  7994. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  7995. END;
  7996. END;
  7997. | Global.systemSpecial:
  7998. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  7999. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8000. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8001. (* determine if parameters are of the VAR kind *)
  8002. ASSERT(x.parameters.Length() <= 3);
  8003. formalParameter := procedureType.firstParameter;
  8004. FOR i := 0 TO x.parameters.Length() - 1 DO
  8005. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8006. formalParameter := formalParameter.nextParameter
  8007. END;
  8008. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8009. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8010. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8011. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8012. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8013. IF procedureType.returnType # NIL THEN
  8014. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8015. Emit(Result(position, res));
  8016. (*InitOperand(result,ModeValue);
  8017. result.op := res;
  8018. *)
  8019. IF ~conditional THEN
  8020. InitOperand(result,ModeValue); result.op := res;
  8021. ELSE
  8022. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8023. BrL(falseLabel);
  8024. ReleaseIntermediateOperand(res);
  8025. END;
  8026. END
  8027. ELSE (* function not yet implemented *)
  8028. Error(position,"not yet implemented");
  8029. END;
  8030. destination := dest;
  8031. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8032. END VisitBuiltinCallDesignator;
  8033. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  8034. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8035. BEGIN
  8036. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8037. dest := destination; destination := emptyOperand;
  8038. Expression(x.left);
  8039. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8040. ELSIF isUnchecked THEN (* no check *)
  8041. ELSE
  8042. trueL := NewLabel();
  8043. falseL := NewLabel();
  8044. IF IsPointerToRecord(x.left.type,recordType) THEN
  8045. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8046. Emit(Mov(position,tag, result.op));
  8047. IF result.mode # ModeValue THEN
  8048. ptr := tag;
  8049. IntermediateCode.MakeMemory(ptr,addressType);
  8050. Emit(Mov(position,tag, ptr));
  8051. END;
  8052. IF ~backend.cooperative THEN
  8053. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8054. END;
  8055. IntermediateCode.MakeMemory(tag,addressType);
  8056. ELSE
  8057. tag := result.tag;
  8058. END;
  8059. TypeTest(tag,x.type,trueL,falseL);
  8060. ReleaseIntermediateOperand(tag);
  8061. SetLabel(falseL);
  8062. EmitTrap(position,TypeCheckTrap);
  8063. SetLabel(trueL);
  8064. END;
  8065. destination := dest;
  8066. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8067. END VisitTypeGuardDesignator;
  8068. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8069. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8070. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8071. VAR label: Label; pc: LONGINT;
  8072. BEGIN
  8073. IF backend.cooperative & ~isUnchecked THEN
  8074. pc := section.pc;
  8075. label := NewLabel();
  8076. BrneL(label, operand.op, nil);
  8077. EmitTrap(position, NilPointerTrap);
  8078. SetLabel(label);
  8079. INC(statCoopNilCheck, section.pc - pc);
  8080. END;
  8081. END NilCheck;
  8082. BEGIN
  8083. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8084. ReuseCopy(dereferenced,operand.op);
  8085. ReleaseOperand(operand);
  8086. operand.mode := ModeReference;
  8087. operand.op := dereferenced;
  8088. operand.tag := dereferenced;
  8089. UseIntermediateOperand(operand.tag);
  8090. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8091. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8092. ReleaseIntermediateOperand(operand.tag);
  8093. operand.tag := TypeDescriptorAdr(type);
  8094. IF ~newObjectFile THEN
  8095. IntermediateCode.MakeMemory(operand.tag,addressType);
  8096. END;
  8097. ELSE
  8098. IF ~backend.cooperative THEN
  8099. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8100. END;
  8101. IntermediateCode.MakeMemory(operand.tag,addressType);
  8102. END;
  8103. NilCheck(operand.op);
  8104. ELSIF type IS SyntaxTree.ArrayType THEN
  8105. IF isUnsafe THEN
  8106. NilCheck(operand.op);
  8107. ReleaseIntermediateOperand(operand.tag);
  8108. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8109. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8110. ELSE
  8111. operand.tag := emptyOperand;
  8112. END;
  8113. ELSE
  8114. NilCheck(operand.op);
  8115. IF backend.cooperative THEN
  8116. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8117. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8118. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8119. ELSE
  8120. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8121. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8122. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8123. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8124. END;
  8125. END;
  8126. ELSIF type IS SyntaxTree.MathArrayType THEN
  8127. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8128. IntermediateCode.MakeMemory(operand.op,addressType);
  8129. ELSE HALT(100);
  8130. END;
  8131. END Dereference;
  8132. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  8133. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8134. BEGIN
  8135. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8136. dest := destination; destination := emptyOperand;
  8137. Evaluate(x.left,d);
  8138. type := x.type.resolved;
  8139. prevIsUnchecked := isUnchecked;
  8140. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8141. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8142. END;
  8143. Dereference(d,type,IsUnsafePointer(x.left.type));
  8144. isUnchecked := prevIsUnchecked;
  8145. result := d;
  8146. 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
  8147. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8148. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8149. END;
  8150. END;
  8151. destination := dest;
  8152. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8153. END VisitDereferenceDesignator;
  8154. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  8155. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8156. BEGIN
  8157. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8158. dest := destination; destination := emptyOperand;
  8159. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8160. tag := result.op;
  8161. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8162. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8163. StaticCallOperand(result,procedure.super);
  8164. ReleaseIntermediateOperand(result.tag);
  8165. UseIntermediateOperand(tag); (* necessary ? *)
  8166. result.tag := tag;
  8167. destination := dest;
  8168. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8169. END VisitSupercallDesignator;
  8170. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  8171. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8172. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8173. name: Basic.SegmentedName;
  8174. BEGIN
  8175. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8176. dest := destination; destination := emptyOperand;
  8177. scope := currentScope;
  8178. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8179. scope := scope.outerScope;
  8180. END;
  8181. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8182. IF newObjectFile THEN
  8183. moduleSection := meta.ModuleSection();
  8184. IF backend.cooperative THEN
  8185. moduleOffset := 0;
  8186. ELSE
  8187. moduleOffset := moduleSection.pc;
  8188. END;
  8189. result.mode := ModeValue;
  8190. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8191. ELSE
  8192. Symbol(moduleSelf,result);
  8193. IntermediateCode.MakeMemory(result.op,addressType);
  8194. END
  8195. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8196. result.mode := ModeValue;
  8197. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8198. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8199. ELSE
  8200. GetBaseRegister(basereg,currentScope,scope);
  8201. InitOperand(result,ModeReference);
  8202. result.op := basereg;
  8203. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  8204. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  8205. IF backend.cooperative THEN
  8206. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8207. END;
  8208. (* tag must be loaded when dereferencing SELF pointer *)
  8209. END;
  8210. destination := dest;
  8211. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8212. END VisitSelfDesignator;
  8213. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  8214. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8215. BEGIN
  8216. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8217. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8218. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8219. parameter := procedureType.returnParameter;
  8220. VisitParameter(parameter);
  8221. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8222. END VisitResultDesignator;
  8223. (** values *)
  8224. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  8225. BEGIN
  8226. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8227. IF conditional THEN
  8228. IF x.value THEN BrL(trueLabel)
  8229. ELSE BrL(falseLabel)
  8230. END;
  8231. ELSE
  8232. InitOperand(result,ModeValue);
  8233. IF x.value THEN result.op := true ELSE result.op := false END;
  8234. END;
  8235. END VisitBooleanValue;
  8236. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8237. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8238. BEGIN
  8239. Global.GetModuleSegmentedName(module.module, name);
  8240. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8241. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  8242. RETURN section
  8243. END GetDataSection;
  8244. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8245. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8246. BEGIN
  8247. type := vop.type;
  8248. data := GetDataSection();
  8249. pc := EnterImmediate(data,vop);
  8250. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8251. IntermediateCode.MakeMemory(vop, type);
  8252. END GetImmediateMem;
  8253. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  8254. BEGIN
  8255. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8256. InitOperand(result,ModeValue);
  8257. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8258. IF ~supportedImmediate(result.op) &~inData THEN
  8259. GetImmediateMem(result.op)
  8260. END;
  8261. END VisitIntegerValue;
  8262. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  8263. BEGIN
  8264. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8265. InitOperand(result,ModeValue);
  8266. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8267. END VisitCharacterValue;
  8268. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  8269. BEGIN
  8270. IF Trace THEN TraceEnter("VisitSetValue") END;
  8271. InitOperand(result,ModeValue);
  8272. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8273. END VisitSetValue;
  8274. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  8275. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8276. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8277. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8278. BEGIN
  8279. numberElements := x.elements.Length();
  8280. FOR i := 0 TO numberElements-1 DO
  8281. expression := x.elements.GetExpression(i);
  8282. IF expression IS SyntaxTree.MathArrayExpression THEN
  8283. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8284. ELSE
  8285. inData := TRUE;
  8286. Evaluate(expression,op);
  8287. irv.Emit(Data(position,op.op));
  8288. inData := FALSE;
  8289. ReleaseOperand(op);
  8290. END;
  8291. END;
  8292. END RecursiveData;
  8293. BEGIN
  8294. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8295. IF ~TryConstantDeclaration() THEN
  8296. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8297. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8298. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8299. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8300. ELSE
  8301. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8302. END;
  8303. RecursiveData(x.array);
  8304. InitOperand(result,ModeReference);
  8305. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8306. END
  8307. END VisitMathArrayValue;
  8308. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8309. VAR constant: Sections.Section;
  8310. BEGIN
  8311. IF constantDeclaration = NIL THEN
  8312. RETURN FALSE
  8313. ELSE
  8314. (* Is a constant in this module: did we generate it already? *)
  8315. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8316. IF constant # NIL THEN
  8317. InitOperand(result,ModeReference);
  8318. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8319. RETURN TRUE;
  8320. END;
  8321. END;
  8322. RETURN FALSE
  8323. END TryConstantDeclaration;
  8324. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  8325. BEGIN
  8326. constantDeclaration := x;
  8327. x.value.resolved.Accept(SELF);
  8328. END VisitConstant;
  8329. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  8330. BEGIN
  8331. IF Trace THEN TraceEnter("VisitRealValue") END;
  8332. InitOperand(result,ModeValue);
  8333. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8334. END VisitRealValue;
  8335. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  8336. VAR
  8337. componentType: SyntaxTree.Type;
  8338. BEGIN
  8339. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8340. ASSERT(x.type IS SyntaxTree.ComplexType);
  8341. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8342. InitOperand(result,ModeValue);
  8343. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8344. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8345. END VisitComplexValue;
  8346. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  8347. VAR i: LONGINT; name: Basic.SegmentedName;
  8348. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8349. BEGIN
  8350. IF Trace THEN TraceEnter("VisitStringValue") END;
  8351. IF ~TryConstantDeclaration() THEN
  8352. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8353. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8354. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8355. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8356. ELSE
  8357. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8358. END;
  8359. FOR i := 0 TO x.length-1 DO
  8360. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8361. irv.Emit(Data(position,op));
  8362. END;
  8363. InitOperand(result,ModeReference);
  8364. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8365. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8366. END
  8367. END VisitStringValue;
  8368. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8369. BEGIN
  8370. IF Trace THEN TraceEnter("VisitNilValue") END;
  8371. InitOperand(result,ModeValue);
  8372. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8373. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8374. END VisitNilValue;
  8375. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8376. BEGIN
  8377. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8378. InitOperand(result,ModeValue);
  8379. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8380. END VisitEnumerationValue;
  8381. (** symbols *)
  8382. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8383. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8384. END VisitImport;
  8385. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8386. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8387. BEGIN
  8388. IF scope # baseScope THEN
  8389. (* left := [fp+8] *)
  8390. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8391. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8392. ReuseCopy(left,right);
  8393. ReleaseIntermediateOperand(right);
  8394. scope := scope.outerScope; DEC(level);
  8395. (* { left := [left+8] } *)
  8396. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8397. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8398. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8399. Emit(Mov(position,left,right));
  8400. scope := scope.outerScope; DEC(level);
  8401. END;
  8402. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8403. result := left;
  8404. ELSE
  8405. result := fp;
  8406. END;
  8407. END GetBaseRegister;
  8408. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8409. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8410. BEGIN
  8411. IF Trace THEN TraceEnter("VisitVariable"); END;
  8412. type := x.type.resolved;
  8413. IF (x.useRegister) THEN
  8414. InitOperand(result, ModeValue);
  8415. IF x.registerNumber < 0 THEN
  8416. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8417. reg := x.registerNumber;
  8418. ELSE
  8419. reg := registerUsageCount.Map(x.registerNumber);
  8420. UseRegister(reg);
  8421. END;
  8422. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8423. ELSIF x.externalName # NIL THEN
  8424. InitOperand(result,ModeReference);
  8425. Basic.ToSegmentedName(x.externalName^, name);
  8426. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8427. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8428. InitOperand(result,ModeReference);
  8429. GetBaseRegister(result.op,currentScope,x.scope);
  8430. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8431. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8432. InitOperand(result,ModeReference);
  8433. GetCodeSectionNameForSymbol(x,name);
  8434. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8435. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8436. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8437. InitOperand(result,ModeReference);
  8438. GetCodeSectionNameForSymbol(x,name);
  8439. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8440. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8441. ELSE (* field, left designator must have been emitted *)
  8442. ASSERT(result.mode = ModeReference);
  8443. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8444. ReuseCopy(temp,result.op);
  8445. ReleaseIntermediateOperand(result.op);
  8446. result.op := temp;
  8447. END;
  8448. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8449. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8450. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8451. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8452. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8453. END;
  8454. END;
  8455. END;
  8456. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8457. ValueToCondition(result);
  8458. ELSIF type IS SyntaxTree.ProcedureType THEN
  8459. ReleaseIntermediateOperand(result.tag);
  8460. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8461. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8462. UseIntermediateOperand(result.tag);
  8463. ELSE
  8464. result.tag := nil; (* nil *)
  8465. END;
  8466. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8467. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8468. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8469. ReleaseIntermediateOperand(result.tag);
  8470. Global.GetSymbolSegmentedName(x,name);
  8471. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8472. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8473. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8474. ELSE
  8475. END;
  8476. ELSE
  8477. ReleaseIntermediateOperand(result.tag);
  8478. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8479. END;
  8480. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8481. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8482. ReleaseIntermediateOperand(result.tag);
  8483. result.tag := result.op;
  8484. UseIntermediateOperand(result.tag);
  8485. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8486. IntermediateCode.MakeMemory(result.op,addressType);
  8487. END;
  8488. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8489. ReleaseIntermediateOperand(result.tag);
  8490. result.tag := TypeDescriptorAdr(type);
  8491. IF ~newObjectFile THEN
  8492. IntermediateCode.MakeMemory(result.tag,addressType);
  8493. END;
  8494. UseIntermediateOperand(result.tag);
  8495. (* tag for pointer type computed not here but during dereferencing *)
  8496. END;
  8497. IF Trace THEN TraceExit("VisitVariable") END;
  8498. END VisitVariable;
  8499. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8500. BEGIN
  8501. VisitVariable(property);
  8502. END VisitProperty;
  8503. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8504. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8505. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8506. BEGIN
  8507. type := x.type.resolved;
  8508. IF Trace THEN TraceEnter("VisitParameter") END;
  8509. IF x.ownerType IS SyntaxTree.CellType THEN
  8510. ptype := x.type.resolved;
  8511. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8512. IF ~(ptype IS SyntaxTree.PortType) THEN
  8513. InitOperand(result,ModeReference);
  8514. GetCodeSectionNameForSymbol(x,name);
  8515. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8516. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8517. RETURN
  8518. ELSE
  8519. InitOperand(result, ModeValue);
  8520. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8521. adr := 0;
  8522. WHILE parameter # x DO
  8523. parameterType := parameter.type;
  8524. inc := 1;
  8525. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8526. INC(adr, inc);
  8527. parameter := parameter.nextParameter
  8528. END;
  8529. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8530. RETURN
  8531. END;
  8532. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8533. InitOperand(result,ModeReference);
  8534. GetCodeSectionNameForSymbol(x,name);
  8535. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8536. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8537. RETURN
  8538. ELSE
  8539. GetBaseRegister(basereg,currentScope,x.scope);
  8540. InitOperand(result,ModeReference);
  8541. result.op := basereg;
  8542. END;
  8543. IF IsOpenArray(type) THEN
  8544. result.tag := basereg;
  8545. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8546. IntermediateCode.MakeMemory(result.op,addressType);
  8547. IF Global.IsOberonProcedure(x.ownerType) THEN
  8548. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8549. UseIntermediateOperand(result.tag);
  8550. ELSE
  8551. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8552. END;
  8553. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8554. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8555. ELSIF IsStaticArray(type) THEN
  8556. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8557. IntermediateCode.MakeMemory(result.op,addressType);
  8558. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8559. ELSIF type IS SyntaxTree.MathArrayType THEN
  8560. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8561. WITH type: SyntaxTree.MathArrayType DO
  8562. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8563. IF type.form = SyntaxTree.Tensor THEN
  8564. ELSIF type.form = SyntaxTree.Open THEN
  8565. result.tag := result.op;
  8566. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8567. IntermediateCode.MakeMemory(result.op,addressType);
  8568. UseIntermediateOperand(result.tag);
  8569. ELSIF type.form = SyntaxTree.Static THEN
  8570. IF x.kind = SyntaxTree.ConstParameter THEN
  8571. IntermediateCode.MakeMemory(result.op,addressType);
  8572. END;
  8573. ELSE HALT(100)
  8574. END;
  8575. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8576. IF type.form = SyntaxTree.Tensor THEN
  8577. ToMemory(result.op,addressType,0);
  8578. ELSIF type.form = SyntaxTree.Open THEN
  8579. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8580. ReuseCopy(result.tag, mem);
  8581. ReleaseIntermediateOperand(mem);
  8582. ReleaseIntermediateOperand(result.op);
  8583. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8584. ELSIF type.form = SyntaxTree.Static THEN
  8585. IntermediateCode.MakeMemory(result.op,addressType);
  8586. ELSE HALT(100)
  8587. END;
  8588. ELSE HALT(100)
  8589. END;
  8590. END;
  8591. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8592. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8593. IntermediateCode.MakeMemory(result.op,addressType);
  8594. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8595. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8596. END;
  8597. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8598. ValueToCondition(result);
  8599. ELSIF type IS SyntaxTree.ProcedureType THEN
  8600. ReleaseIntermediateOperand(result.tag);
  8601. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8602. IF x.kind = SyntaxTree.VarParameter THEN
  8603. ReuseCopy(result.tag,result.op);
  8604. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8605. IntermediateCode.MakeMemory(result.tag,addressType);
  8606. ELSE
  8607. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8608. UseIntermediateOperand(result.tag);
  8609. END;
  8610. ELSE
  8611. result.tag := nil;
  8612. END;
  8613. (* tag for pointer type computed not here but during dereferencing *)
  8614. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8615. ReleaseIntermediateOperand(result.tag);
  8616. result.tag := basereg;
  8617. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8618. IntermediateCode.MakeMemory(result.tag,addressType);
  8619. UseIntermediateOperand(result.tag);
  8620. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8621. ReleaseIntermediateOperand(result.tag);
  8622. result.tag := TypeDescriptorAdr(type);
  8623. IF ~newObjectFile THEN
  8624. IntermediateCode.MakeMemory(result.tag,addressType);
  8625. END;
  8626. UseIntermediateOperand(result.tag);
  8627. END;
  8628. IF Trace THEN TraceExit("VisitParameter") END;
  8629. END VisitParameter;
  8630. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8631. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8632. BEGIN
  8633. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8634. (* left.p: left already emitted *)
  8635. tag := result.op; (* value of pointer to left *)
  8636. (* get type desc *)
  8637. tmp := result.tag;
  8638. IntermediateCode.MakeMemory(tmp,addressType);
  8639. (* get method adr *)
  8640. Reuse1(reg,tmp);
  8641. ReleaseIntermediateOperand(tmp);
  8642. IF backend.cooperative THEN
  8643. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8644. WHILE recordType.baseType # NIL DO
  8645. recordType := recordType.GetBaseRecord ();
  8646. END;
  8647. GetRecordTypeName (recordType,name);
  8648. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8649. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8650. offset := 0;
  8651. ELSE
  8652. offset := 2;
  8653. END;
  8654. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8655. ELSE
  8656. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8657. END;
  8658. InitOperand(operand,ModeReference);
  8659. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8660. operand.op := reg;
  8661. operand.tag := tag;
  8662. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8663. END DynamicCallOperand;
  8664. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8665. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8666. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8667. BEGIN
  8668. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8669. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8670. tag := operand.op;
  8671. ReleaseIntermediateOperand(operand.tag);
  8672. ELSE tag := nil
  8673. END;
  8674. IF x.isInline THEN
  8675. sectionType := Sections.InlineCodeSection;
  8676. ELSE
  8677. sectionType := Sections.CodeSection;
  8678. END;
  8679. IF x.externalName # NIL THEN
  8680. Basic.ToSegmentedName(x.externalName^, name);
  8681. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8682. ELSE
  8683. GetCodeSectionNameForSymbol(x, name);
  8684. IF (x.scope.ownerModule = module.module) THEN
  8685. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8686. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8687. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8688. IF source.pc = 0 THEN (* no code yet *)
  8689. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8690. END;
  8691. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8692. bits := x.procedureScope.body.code.inlineCode;
  8693. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8694. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8695. binary.CopyBits(bits, 0, bits.GetSize());
  8696. source.SetResolved(binary);
  8697. ELSE
  8698. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8699. END;
  8700. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8701. END;
  8702. InitOperand(operand,ModeValue);
  8703. operand.op := reg;
  8704. operand.tag := tag;
  8705. IF Trace THEN TraceExit("StaticCallOperand") END;
  8706. END StaticCallOperand;
  8707. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8708. (* handle expressions of the form designator.procedure or procedure *)
  8709. BEGIN
  8710. IF Trace THEN TraceEnter("VisitProcedure") END;
  8711. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8712. DynamicCallOperand(result,x);
  8713. ELSIF x.isInline THEN
  8714. StaticCallOperand(result,x);
  8715. ELSE
  8716. StaticCallOperand(result,x);
  8717. END;
  8718. IF Trace THEN TraceExit("VisitProcedure") END;
  8719. END VisitProcedure;
  8720. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8721. BEGIN
  8722. VisitProcedure(x);
  8723. END VisitOperator;
  8724. (** statements *)
  8725. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8726. BEGIN
  8727. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8728. Expression(x.call);
  8729. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8730. ReleaseOperand(result)
  8731. END;
  8732. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8733. END VisitProcedureCallStatement;
  8734. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8735. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8736. leftBase, rightBase: SyntaxTree.Type;
  8737. procedureName,s: SyntaxTree.IdentifierString;
  8738. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8739. size: LONGINT; rightKind: LONGINT;
  8740. dummy: IntermediateCode.Operand;
  8741. CONST moduleName = "FoxArrayBase";
  8742. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8743. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8744. BEGIN
  8745. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8746. IF base IS SyntaxTree.MathArrayType THEN
  8747. base := OpenArray(base(SyntaxTree.MathArrayType));
  8748. END;
  8749. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8750. result.SetArrayBase(base);
  8751. RETURN result
  8752. END OpenArray;
  8753. BEGIN
  8754. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8755. SaveRegisters();ReleaseUsedRegisters(saved);
  8756. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8757. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8758. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8759. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8760. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8761. IF leftType.form = SyntaxTree.Tensor THEN
  8762. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8763. ELSIF leftType.form = SyntaxTree.Open THEN
  8764. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8765. ELSIF leftType.form = SyntaxTree.Static THEN
  8766. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8767. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8768. END;
  8769. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8770. IF procedure = NIL THEN
  8771. s := "Instruction not supported on target, emulation procedure ";
  8772. Strings.Append(s,moduleName);
  8773. Strings.Append(s,".");
  8774. Strings.Append(s,procedureName);
  8775. Strings.Append(s," not present");
  8776. Error(position,s);
  8777. ELSE
  8778. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8779. parameter.SetType(leftType);
  8780. parameter.SetAccess(SyntaxTree.Internal);
  8781. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8782. parameter.SetKind(rightKind);
  8783. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8784. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8785. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8786. StaticCallOperand(result,procedure);
  8787. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8788. ReleaseOperand(result);
  8789. END;
  8790. RestoreRegisters(saved);
  8791. END;
  8792. END AssignMathArray;
  8793. VAR modifyAssignmentCounter := 0: LONGINT;
  8794. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8795. VAR processor,mem,dst: IntermediateCode.Operand;
  8796. BEGIN
  8797. IF value.intValue = true.intValue THEN
  8798. INC(modifyAssignmentCounter);
  8799. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8800. modifyAssignmentsPC := section.pc;
  8801. ELSE
  8802. DEC(modifyAssignmentCounter);
  8803. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8804. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8805. END;
  8806. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8807. dst := NewRegisterOperand (addressType);
  8808. Emit(Mov(position,dst, processor));
  8809. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8810. Emit(Mov(position,mem, value));
  8811. ReleaseIntermediateOperand(dst);
  8812. END ModifyAssignments;
  8813. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8814. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8815. BEGIN
  8816. type := left.type.resolved;
  8817. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8818. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8819. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8820. IF procedureType.returnParameter = parameter THEN
  8821. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8822. END;
  8823. END;
  8824. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8825. END CopySize;
  8826. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8827. VAR
  8828. leftO, rightO: Operand;
  8829. mem, sizeOp: IntermediateCode.Operand;
  8830. leftType, rightType, componentType: SyntaxTree.Type;
  8831. size: LONGINT;
  8832. parameters: SyntaxTree.ExpressionList;
  8833. procedure: SyntaxTree.Procedure;
  8834. call: SyntaxTree.ProcedureCallDesignator;
  8835. designator: SyntaxTree.Designator;
  8836. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8837. VAR procedureType: SyntaxTree.ProcedureType;
  8838. BEGIN
  8839. IF ReturnedAsParameter(right.type) THEN
  8840. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8841. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8842. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8843. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8844. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8845. IF right.id = Global.Reshape THEN RETURN TRUE
  8846. END;
  8847. END;
  8848. END;
  8849. END;
  8850. RETURN FALSE
  8851. END CanPassAsResultParameter;
  8852. BEGIN
  8853. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8854. leftType := left.type.resolved; rightType:= right.type.resolved;
  8855. IF backend.cooperative & left.NeedsTrace() THEN
  8856. ModifyAssignments(true);
  8857. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8858. Designate(right, rightO);
  8859. Designate(left, leftO);
  8860. ASSERT(leftO.mode = ModeReference);
  8861. TransferToRegister(leftO.op, leftO.op);
  8862. TransferToRegister(rightO.op, rightO.op);
  8863. Emit(Push(position, leftO.op));
  8864. Emit(Push(position, rightO.op));
  8865. CallAssignMethod(leftO.op, rightO.op, left.type);
  8866. Emit(Pop(position, rightO.op));
  8867. Emit(Pop(position, leftO.op));
  8868. sizeOp := CopySize(left);
  8869. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8870. ReleaseOperand(leftO);
  8871. ReleaseOperand(rightO);
  8872. ELSE
  8873. Evaluate(right,rightO);
  8874. Designate(left,leftO);
  8875. ASSERT(leftO.mode = ModeReference);
  8876. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8877. (* copy procedure address first *)
  8878. MakeMemory(mem,leftO.op,addressType,0);
  8879. Emit(Mov(position,mem,rightO.op));
  8880. ReleaseIntermediateOperand(mem);
  8881. (* copy pointer address *)
  8882. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8883. CallAssignPointer(leftO.tag, rightO.tag);
  8884. ELSE
  8885. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8886. CallAssignPointer(leftO.op, rightO.op);
  8887. END;
  8888. ReleaseOperand(leftO);
  8889. ReleaseOperand(rightO);
  8890. END;
  8891. ModifyAssignments(false);
  8892. RETURN;
  8893. END;
  8894. IF CanPassAsResultParameter(right) THEN
  8895. procedureResultDesignator := left(SyntaxTree.Designator);
  8896. Expression(right);
  8897. procedureResultDesignator := NIL;
  8898. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8899. (* left <-- ALIAS OF right: zerocopy *)
  8900. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8901. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8902. designator.SetType(procedure.type);
  8903. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8904. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8905. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8906. END;
  8907. ELSIF leftType IS SyntaxTree.RangeType THEN
  8908. (* LHS is of array range type *)
  8909. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8910. Evaluate(right, rightO);
  8911. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8912. (* first *)
  8913. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8914. Emit(Mov(position,mem, rightO.op));
  8915. ReleaseIntermediateOperand(mem);
  8916. (* last *)
  8917. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8918. Emit(Mov(position,mem, rightO.tag));
  8919. ReleaseIntermediateOperand(mem);
  8920. (* step *)
  8921. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8922. Emit(Mov(position,mem, rightO.extra));
  8923. ReleaseIntermediateOperand(mem);
  8924. ReleaseOperand(rightO);
  8925. ReleaseOperand(leftO)
  8926. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8927. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8928. Evaluate(right, rightO);
  8929. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8930. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8931. (* real part *)
  8932. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8933. Emit(Mov(position,mem, rightO.op));
  8934. ReleaseIntermediateOperand(mem);
  8935. (* imaginary part *)
  8936. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8937. Emit(Mov(position,mem, rightO.tag));
  8938. ReleaseIntermediateOperand(mem);
  8939. ReleaseOperand(rightO);
  8940. ReleaseOperand(leftO)
  8941. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8942. OR (leftType IS SyntaxTree.PortType) THEN
  8943. (* rightO := leftO;*)
  8944. Evaluate(right,rightO);
  8945. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8946. Designate(left,leftO);
  8947. IF leftO.mode = ModeReference THEN
  8948. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8949. destination := mem;
  8950. ELSE
  8951. destination := leftO.op;
  8952. END;
  8953. ReleaseOperand(leftO);
  8954. IF destination.mode # IntermediateCode.Undefined THEN
  8955. Emit(Mov(position,destination,rightO.op));
  8956. END;
  8957. ReleaseOperand(rightO);
  8958. ReleaseIntermediateOperand(mem);
  8959. IntermediateCode.InitOperand(destination);
  8960. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8961. Evaluate(right,rightO);
  8962. Designate(left,leftO);
  8963. MakeMemory(mem,leftO.op,addressType,0);
  8964. Emit(Mov(position,mem,rightO.op));
  8965. ReleaseIntermediateOperand(mem);
  8966. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8967. (* delegate *)
  8968. (*
  8969. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8970. *)
  8971. Emit(Mov(position,leftO.tag,rightO.tag));
  8972. END;
  8973. ReleaseOperand(leftO);
  8974. ReleaseOperand(rightO);
  8975. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8976. Designate(right,rightO);
  8977. Designate(left,leftO);
  8978. sizeOp := CopySize(left);
  8979. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8980. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8981. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  8982. IF (rightType IS SyntaxTree.StringType) THEN
  8983. CopyString(left,right);
  8984. 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
  8985. Designate(right,rightO);
  8986. Designate(left,leftO);
  8987. size := ToMemoryUnits(system,system.SizeOf(rightType));
  8988. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  8989. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8990. ELSE
  8991. HALT(201)
  8992. END;
  8993. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  8994. AssignMathArray(left,right);
  8995. ELSE
  8996. HALT(200);
  8997. END;
  8998. END Assign;
  8999. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  9000. BEGIN
  9001. IF Trace THEN TraceEnter("VisitAssignment") END;
  9002. Assign(x.left,x.right);
  9003. IF Trace THEN TraceExit("VisitAssignment") END;
  9004. END VisitAssignment;
  9005. PROCEDURE EmitCooperativeSwitch;
  9006. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9007. BEGIN
  9008. ASSERT (cooperativeSwitches);
  9009. pc := section.pc;
  9010. IF lastSwitchPC = section.pc THEN RETURN END;
  9011. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9012. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9013. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9014. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9015. INC(statCoopSwitch, section.pc - pc);
  9016. END EmitCooperativeSwitch;
  9017. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  9018. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9019. BEGIN
  9020. p0 := communication.left; p1 := communication.right;
  9021. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9022. Evaluate(p0,s0);
  9023. Evaluate(p1,s1);
  9024. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9025. Emit(Push(position,s0.op));
  9026. Emit(Push(position,s1.op));
  9027. (*
  9028. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9029. *)
  9030. IF ~backend.cellsAreObjects THEN
  9031. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9032. END;
  9033. ReleaseOperand(s0);
  9034. ReleaseOperand(s1);
  9035. IF backend.cellsAreObjects THEN
  9036. CallThis(position,"ActiveCellsRuntime","Send",2);
  9037. ELSE
  9038. CallThis(position,ChannelModuleName,"Send",2);
  9039. END;
  9040. (* ----- RECEIVE ------*)
  9041. ELSE
  9042. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9043. tmp := p0; p0 := p1; p1 := tmp;
  9044. END;
  9045. Evaluate(p0,s0);
  9046. Emit(Push(position,s0.op));
  9047. Designate(p1,s1);
  9048. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9049. Emit(Push(position,s1.op));
  9050. (*
  9051. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9052. *)
  9053. IF ~backend.cellsAreObjects THEN
  9054. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9055. END;
  9056. ReleaseOperand(s0);
  9057. ReleaseOperand(s1);
  9058. IF backend.cellsAreObjects THEN
  9059. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9060. ELSE
  9061. CallThis(position,ChannelModuleName,"Receive",2)
  9062. END;
  9063. END;
  9064. END VisitCommunicationStatement;
  9065. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  9066. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9067. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9068. VAR true, false: Label; condition, value: BOOLEAN;
  9069. BEGIN
  9070. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9071. IF condition THEN
  9072. true := NewLabel();
  9073. false := NewLabel();
  9074. Condition(if.condition,true,false);
  9075. SetLabel(true);
  9076. StatementSequence(if.statements);
  9077. BrL(end);
  9078. SetLabel(false);
  9079. ELSE
  9080. IF value THEN (* always true *)
  9081. escape := TRUE;
  9082. StatementSequence(if.statements);
  9083. (* no branch necessary -- rest skipped *)
  9084. END;
  9085. END;
  9086. END IfPart;
  9087. BEGIN
  9088. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9089. end := NewLabel();
  9090. elsifs := x.ElsifParts();
  9091. IfPart(x.ifPart);
  9092. FOR i := 0 TO elsifs-1 DO
  9093. IF ~escape THEN
  9094. elsif := x.GetElsifPart(i);
  9095. IfPart(elsif);
  9096. END;
  9097. END;
  9098. IF (x.elsePart # NIL) & ~escape THEN
  9099. StatementSequence(x.elsePart);
  9100. END;
  9101. SetLabel(end);
  9102. IF Trace THEN TraceExit("VisitIfStatement") END;
  9103. END VisitIfStatement;
  9104. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9105. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9106. BEGIN
  9107. (*IF x.variable.type.resolved = x.type.resolved THEN
  9108. (* always true, do nothing *)
  9109. ELSE*)
  9110. Designate(x.variable,res);
  9111. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9112. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9113. END;
  9114. trueL := NewLabel();
  9115. TypeTest(res.tag,x.type,trueL,falseL);
  9116. ReleaseOperand(res);
  9117. SetLabel(trueL);
  9118. StatementSequence(x.statements);
  9119. BrL(endL);
  9120. END WithPart;
  9121. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  9122. VAR endL,falseL: Label;i: LONGINT;
  9123. BEGIN
  9124. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9125. endL := NewLabel();
  9126. FOR i := 0 TO x.WithParts()-1 DO
  9127. falseL := NewLabel();
  9128. WithPart(x.GetWithPart(i),falseL,endL);
  9129. SetLabel(falseL);
  9130. END;
  9131. IF x.elsePart = NIL THEN
  9132. IF ~isUnchecked THEN
  9133. EmitTrap(position,WithTrap);
  9134. END;
  9135. ELSE
  9136. StatementSequence(x.elsePart)
  9137. END;
  9138. SetLabel(endL);
  9139. IF Trace THEN TraceExit("VisitWithStatement") END;
  9140. END VisitWithStatement;
  9141. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  9142. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9143. out,else: Label; label: Label;
  9144. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9145. symbol: SyntaxTree.Symbol;
  9146. BEGIN
  9147. (*! split case statement into if-elsif statements for large case label lists *)
  9148. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9149. size := x.max-x.min+1;
  9150. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9151. END;
  9152. Evaluate(x.variable,var);
  9153. ReuseCopy(tmp,var.op);
  9154. ReleaseIntermediateOperand(var.op);
  9155. var.op := tmp;
  9156. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9157. Convert(var.op,addressType);
  9158. size := x.max-x.min+1;
  9159. else := NewLabel();
  9160. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9161. (*
  9162. UniqueId(name,module.module,"case",caseId);
  9163. *)
  9164. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9165. Global.GetModuleSegmentedName(module.module, name);
  9166. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9167. symbol := SyntaxTree.NewSymbol(name[1]);
  9168. symbol.SetScope(moduleScope);
  9169. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9170. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9171. section.isCaseTable := TRUE;
  9172. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9173. ReuseCopy(res,var.op);
  9174. ReleaseOperand(var);
  9175. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9176. Emit(Add(position,res,res,jmp));
  9177. IntermediateCode.MakeMemory(res,addressType);
  9178. Emit(Br(position,res));
  9179. ReleaseIntermediateOperand(res);
  9180. out := NewLabel();
  9181. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9182. part := x.GetCasePart(i);
  9183. constant := part.firstConstant;
  9184. label := NewLabel();
  9185. SetLabel(label);
  9186. WHILE(constant # NIL) DO (* case labels for this case part *)
  9187. FOR j := constant.min TO constant.max DO
  9188. fixups[j-x.min] := label;
  9189. END;
  9190. constant := constant.next;
  9191. END;
  9192. StatementSequence(part.statements);
  9193. BrL(out);
  9194. END;
  9195. SetLabel(else);
  9196. FOR i := 0 TO size-1 DO
  9197. IF fixups[i] = NIL THEN
  9198. fixups[i] := else;
  9199. END;
  9200. END;
  9201. IF x.elsePart # NIL THEN
  9202. StatementSequence(x.elsePart);
  9203. ELSIF ~isUnchecked THEN
  9204. EmitTrap(position,CaseTrap);
  9205. END;
  9206. SetLabel(out);
  9207. FOR i := 0 TO size-1 DO
  9208. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9209. section.Emit(Data(position,op));
  9210. END;
  9211. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9212. END VisitCaseStatement;
  9213. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  9214. VAR start: Label; true,false: Label;
  9215. BEGIN
  9216. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9217. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9218. start := NewLabel();
  9219. true := NewLabel();
  9220. false := NewLabel();
  9221. SetLabel(start);
  9222. Condition(x.condition,true,false);
  9223. SetLabel(true);
  9224. StatementSequence(x.statements);
  9225. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9226. BrL(start);
  9227. SetLabel(false);
  9228. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9229. END VisitWhileStatement;
  9230. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  9231. VAR false,true: Label;
  9232. BEGIN
  9233. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9234. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9235. true := NewLabel();
  9236. false := NewLabel();
  9237. SetLabel(false);
  9238. StatementSequence(x.statements);
  9239. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9240. Condition(x.condition,true,false);
  9241. SetLabel(true);
  9242. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9243. END VisitRepeatStatement;
  9244. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  9245. VAR
  9246. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9247. temporaryVariable: SyntaxTree.Variable;
  9248. temporaryVariableDesignator : SyntaxTree.Designator;
  9249. BEGIN
  9250. IF Trace THEN TraceEnter("VisitForStatement") END;
  9251. true := NewLabel();
  9252. false := NewLabel();
  9253. start := NewLabel();
  9254. Assign(x.variable,x.from);
  9255. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  9256. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  9257. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9258. Assign(temporaryVariableDesignator,x.to);
  9259. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9260. IF by > 0 THEN
  9261. cmp := Scanner.LessEqual
  9262. ELSE
  9263. cmp := Scanner.GreaterEqual
  9264. END;
  9265. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  9266. binary.SetType(system.booleanType);
  9267. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9268. SetLabel(start);
  9269. Condition(binary,true,false);
  9270. SetLabel(true);
  9271. StatementSequence(x.statements);
  9272. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  9273. binary.SetType(x.variable.type);
  9274. Assign(x.variable,binary);
  9275. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9276. BrL(start);
  9277. SetLabel(false);
  9278. IF Trace THEN TraceExit("VisitForStatement") END;
  9279. END VisitForStatement;
  9280. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  9281. VAR prevLoop: Label;
  9282. BEGIN
  9283. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9284. prevLoop := currentLoop;
  9285. currentLoop := NewLabel();
  9286. StatementSequence(x.statements);
  9287. SetLabel(currentLoop);
  9288. currentLoop := prevLoop;
  9289. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9290. END VisitExitableBlock;
  9291. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  9292. VAR prevLoop,start: Label;
  9293. BEGIN
  9294. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9295. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9296. start := NewLabel();
  9297. prevLoop := currentLoop;
  9298. SetLabel(start);
  9299. currentLoop := NewLabel();
  9300. StatementSequence(x.statements);
  9301. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9302. BrL(start);
  9303. SetLabel(currentLoop);
  9304. currentLoop := prevLoop;
  9305. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9306. END VisitLoopStatement;
  9307. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  9308. VAR outer: SyntaxTree.Statement;
  9309. BEGIN
  9310. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9311. IF locked THEN (* r if we jump out of an exclusive block *)
  9312. outer := x.outer;
  9313. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9314. outer := outer.outer;
  9315. END;
  9316. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9317. Lock(FALSE);
  9318. END;
  9319. END;
  9320. BrL(currentLoop);
  9321. IF Trace THEN TraceExit("VisitExitStatement") END;
  9322. END VisitExitStatement;
  9323. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  9324. VAR
  9325. expression, parameterDesignator: SyntaxTree.Expression;
  9326. type, componentType: SyntaxTree.Type;
  9327. res, right: Operand;
  9328. left, mem, reg: IntermediateCode.Operand;
  9329. parameter: SyntaxTree.Parameter;
  9330. procedure: SyntaxTree.Procedure;
  9331. procedureType: SyntaxTree.ProcedureType;
  9332. returnTypeOffset: LONGINT;
  9333. delegate: BOOLEAN;
  9334. map: SymbolMap;
  9335. BEGIN
  9336. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9337. expression := x.returnValue;
  9338. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9339. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9340. IF currentIsInline THEN
  9341. IF expression # NIL THEN
  9342. map := currentMapper.Get(NIL);
  9343. IF map # NIL THEN
  9344. Assign(map.to, expression);
  9345. END;
  9346. END;
  9347. BrL(currentInlineExit);
  9348. RETURN;
  9349. END;
  9350. IF expression # NIL THEN
  9351. type := expression.type.resolved;
  9352. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9353. IF locked THEN Lock(FALSE) END;
  9354. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9355. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9356. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9357. (* return without structured return parameter *)
  9358. Evaluate(expression,res);
  9359. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9360. IF locked OR profile THEN
  9361. Emit(Push(position,res.op));
  9362. IF delegate THEN HALT(200) END;
  9363. ReleaseOperand(res);
  9364. IF locked THEN Lock(FALSE) END;
  9365. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9366. reg := NewRegisterOperand(res.op.type);
  9367. Emit(Pop(position,reg));
  9368. Emit(Return(position,reg));
  9369. ReleaseIntermediateOperand(reg);
  9370. ELSE
  9371. Emit(Return(position,res.op));
  9372. ReleaseOperand(res);
  9373. END;
  9374. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9375. THEN
  9376. (* return using structured return parameter *)
  9377. 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)
  9378. OR SemanticChecker.IsPointerType(type));
  9379. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9380. parameter :=procedureType.returnParameter;
  9381. ASSERT(parameter # NIL);
  9382. returnTypeOffset := parameter.offsetInBits;
  9383. (*
  9384. IF parameter# NIL THEN
  9385. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9386. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9387. ELSE
  9388. returnTypeOffset := system.offsetFirstParameter
  9389. END;
  9390. *)
  9391. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9392. IF type IS SyntaxTree.RangeType THEN
  9393. (* array range type *)
  9394. Evaluate(expression, right);
  9395. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9396. Emit(Mov(position,mem, right.op)); (* first *)
  9397. ReleaseIntermediateOperand(mem);
  9398. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9399. Emit(Mov(position,mem, right.tag)); (* last *)
  9400. ReleaseIntermediateOperand(mem);
  9401. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9402. Emit(Mov(position,mem, right.extra)); (* step *)
  9403. ReleaseIntermediateOperand(mem);
  9404. ReleaseOperand(right);
  9405. ELSIF type IS SyntaxTree.ComplexType THEN
  9406. Evaluate(expression, right);
  9407. componentType := type(SyntaxTree.ComplexType).componentType;
  9408. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9409. Emit(Mov(position,mem, right.op)); (* real part *)
  9410. ReleaseIntermediateOperand(mem);
  9411. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9412. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9413. ReleaseIntermediateOperand(mem);
  9414. ReleaseOperand(right);
  9415. ELSE (* covers cases: pointer / record / array *)
  9416. parameter := procedureType.returnParameter;
  9417. checker.SetCurrentScope(currentScope);
  9418. ASSERT(parameter # NIL);
  9419. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9420. Assign(parameterDesignator,expression);
  9421. END;
  9422. ReleaseIntermediateOperand(left);
  9423. IF locked THEN Lock(FALSE) END;
  9424. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9425. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9426. parameter := procedureType.returnParameter;
  9427. checker.SetCurrentScope(currentScope);
  9428. IF parameter = NIL THEN
  9429. Error(procedure.position, "structured return of parameter of procedure not found");
  9430. ELSE
  9431. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9432. Assign(parameterDesignator,expression);
  9433. END;
  9434. IF locked THEN Lock(FALSE) END;
  9435. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9436. ELSE
  9437. HALT(200);
  9438. END;
  9439. ELSE
  9440. IF locked THEN Lock(FALSE) END;
  9441. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9442. END;
  9443. IF backend.cooperative THEN
  9444. BrL(exitLabel);
  9445. ELSE
  9446. EmitLeave(section, position,procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9447. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9448. END;
  9449. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9450. END VisitReturnStatement;
  9451. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9452. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9453. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9454. statements: SyntaxTree.StatementSequence;
  9455. name, suffix: SyntaxTree.IdentifierString;
  9456. BEGIN
  9457. Strings.IntToStr(awaitProcCounter,suffix);
  9458. Strings.Concat("@AwaitProcedure",suffix,name);
  9459. identifier := SyntaxTree.NewIdentifier(name);
  9460. INC(awaitProcCounter);
  9461. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9462. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9463. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9464. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9465. procedure.SetAccess(SyntaxTree.Hidden);
  9466. procedure.SetScope(currentScope);
  9467. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9468. procedureType.SetReturnType(system.booleanType);
  9469. procedure.SetType(procedureType);
  9470. body := SyntaxTree.NewBody(x.position,procedureScope);
  9471. procedureScope.SetBody(body);
  9472. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9473. returnStatement.SetReturnValue(x.condition);
  9474. statements := SyntaxTree.NewStatementSequence();
  9475. statements.AddStatement(returnStatement);
  9476. body.SetStatementSequence(statements);
  9477. currentScope.AddProcedure(procedure);
  9478. RETURN procedure
  9479. END MakeAwaitProcedure;
  9480. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9481. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9482. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9483. BEGIN
  9484. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9485. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9486. IF backend.cooperative THEN
  9487. start := NewLabel();
  9488. true := NewLabel();
  9489. false := NewLabel();
  9490. SetLabel(start);
  9491. Condition(x.condition,true,false);
  9492. SetLabel(false);
  9493. PushSelfPointer();
  9494. CallThis(position,"ExclusiveBlocks","Await",1);
  9495. BrL(start);
  9496. SetLabel(true);
  9497. PushSelfPointer();
  9498. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9499. ELSE
  9500. proc := MakeAwaitProcedure(x);
  9501. Emit(Push(position,fp));
  9502. GetCodeSectionNameForSymbol(proc,name);
  9503. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9504. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9505. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9506. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9507. Emit(Result(position,res));
  9508. (*
  9509. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9510. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9511. *)
  9512. InitOperand(result,ModeValue);
  9513. result.op := res;
  9514. label := NewLabel();
  9515. BreqL(label, result.op, SELF.true);
  9516. ReleaseOperand(result);
  9517. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9518. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9519. Emit(Push(position,res));
  9520. Emit(Push(position,fp));
  9521. PushSelfPointer();
  9522. Emit(Push(position,nil));
  9523. CallThis(position,"Objects","Await",4);
  9524. SetLabel(label);
  9525. END;
  9526. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9527. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9528. END VisitAwaitStatement;
  9529. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9530. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9531. BEGIN
  9532. FOR i := 0 TO x.Length() - 1 DO
  9533. statement := x.GetStatement( i );
  9534. Statement(statement);
  9535. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9536. END;
  9537. END StatementSequence;
  9538. PROCEDURE PushSelfPointer;
  9539. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9540. BEGIN
  9541. scope := currentScope;
  9542. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9543. scope := scope.outerScope;
  9544. END;
  9545. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9546. IF ~newObjectFile THEN
  9547. Symbol(moduleSelf,op);
  9548. IntermediateCode.MakeMemory(op.op,addressType);
  9549. ELSE
  9550. moduleSection := meta.ModuleSection();
  9551. IF backend.cooperative THEN
  9552. moduleOffset := 0;
  9553. ELSE
  9554. moduleOffset := moduleSection.pc;
  9555. END;
  9556. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9557. END;
  9558. ELSE
  9559. GetBaseRegister(op.op,currentScope,scope);
  9560. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9561. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9562. IF backend.cooperative THEN
  9563. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9564. END;
  9565. IntermediateCode.MakeMemory(op.op,addressType);
  9566. END;
  9567. Emit(Push(position,op.op));
  9568. ReleaseOperand(op);
  9569. END PushSelfPointer;
  9570. PROCEDURE Lock(lock: BOOLEAN);
  9571. BEGIN
  9572. IF Trace THEN TraceEnter("Lock") END;
  9573. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9574. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9575. ASSERT(modifyAssignmentCounter = 0);
  9576. IF dump # NIL THEN
  9577. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9578. dump.Ln;dump.Update;
  9579. END;
  9580. PushSelfPointer;
  9581. IF backend.cooperative THEN
  9582. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9583. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9584. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9585. END;
  9586. ELSE
  9587. Emit(Push(position,true));
  9588. IF lock THEN CallThis(position,"Objects","Lock",2)
  9589. ELSE CallThis(position,"Objects","Unlock",2);
  9590. END;
  9591. END;
  9592. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9593. IF Trace THEN TraceExit("Lock") END;
  9594. END Lock;
  9595. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9596. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9597. BEGIN
  9598. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9599. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9600. previouslyUnchecked := isUnchecked;
  9601. isUnchecked := isUnchecked OR x.isUnchecked;
  9602. previouslyCooperativeSwitches := cooperativeSwitches;
  9603. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9604. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9605. IF x.statements # NIL THEN
  9606. StatementSequence(x.statements);
  9607. END;
  9608. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9609. isUnchecked := previouslyUnchecked;
  9610. cooperativeSwitches := previouslyCooperativeSwitches;
  9611. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9612. END VisitStatementBlock;
  9613. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9614. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9615. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9616. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9617. procedure: SyntaxTree.Procedure;
  9618. map: SymbolMap;
  9619. BEGIN
  9620. scope := currentScope;
  9621. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9622. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9623. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9624. return := emptyOperand;
  9625. IF Trace THEN TraceEnter("VisitCode") END;
  9626. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9627. NEW(in, x.inRules.Length());
  9628. FOR i := 0 TO LEN(in)-1 DO
  9629. statement := x.inRules.GetStatement(i);
  9630. WITH statement: SyntaxTree.Assignment DO
  9631. Evaluate(statement.right, operand);
  9632. result := operand.op;
  9633. NEW(str, 64);
  9634. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9635. in[i] := result; IntermediateCode.SetString(in[i], str);
  9636. ReleaseIntermediateOperand(operand.tag);
  9637. END;
  9638. END;
  9639. ELSE in := NIL
  9640. END;
  9641. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9642. NEW(out, x.outRules.Length());
  9643. FOR i := 0 TO LEN(out)-1 DO
  9644. statement := x.outRules.GetStatement(i);
  9645. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9646. WITH statement: SyntaxTree.Assignment DO
  9647. Evaluate(statement.left, operand); (*?? or designate *)
  9648. result := operand.op;
  9649. NEW(str, 64);
  9650. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9651. out[i] := result; IntermediateCode.SetString(out[i], str);
  9652. ReleaseIntermediateOperand(operand.tag);
  9653. |statement: SyntaxTree.ReturnStatement DO
  9654. NEW(str, 64);
  9655. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9656. IF currentIsInline THEN
  9657. map := currentMapper.Get(NIL);
  9658. Evaluate(map.to, operand);
  9659. out[i] := operand.op;
  9660. ELSE
  9661. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9662. END;
  9663. IntermediateCode.SetString(out[i], str);
  9664. ReleaseIntermediateOperand(operand.tag);
  9665. return := out[i];
  9666. ELSE
  9667. END;
  9668. END;
  9669. ELSE out := NIL
  9670. END;
  9671. Emit(Asm(x.position,x.sourceCode, in, out));
  9672. IF in # NIL THEN
  9673. FOR i := 0 TO LEN(in)-1 DO
  9674. ReleaseIntermediateOperand(in[i]);
  9675. END;
  9676. END;
  9677. IF out # NIL THEN
  9678. FOR i := 0 TO LEN(out)-1 DO
  9679. WITH statement: SyntaxTree.Assignment DO
  9680. ReleaseIntermediateOperand(out[i]);
  9681. ELSE
  9682. IF currentIsInline THEN
  9683. ReleaseIntermediateOperand(out[i]);
  9684. END;
  9685. END;
  9686. statement := x.outRules.GetStatement(i);
  9687. END;
  9688. END;
  9689. IF return.mode # IntermediateCode.Undefined THEN
  9690. IF currentIsInline THEN
  9691. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9692. Symbol(procedureType.returnParameter, par);
  9693. MakeMemory(mem, par.op, return.type, 0);
  9694. ReleaseOperand(par);
  9695. Emit(Mov(position, mem, return));
  9696. ReleaseIntermediateOperand(mem);
  9697. ELSE
  9698. Emit(Return(position,return));
  9699. END;
  9700. IF currentIsInline THEN RETURN END;
  9701. EmitLeave(section, position,procedureType(SyntaxTree.ProcedureType).callingConvention);
  9702. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9703. ReleaseIntermediateOperand(return);
  9704. END;
  9705. IF Trace THEN TraceExit("VisitCode") END;
  9706. END VisitCode;
  9707. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9708. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9709. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9710. const, call: IntermediateCode.Operand;
  9711. parameterDesignator: SyntaxTree.Expression;
  9712. saved: RegisterEntry;
  9713. name: Basic.SegmentedName;
  9714. BEGIN
  9715. IF Trace THEN TraceEnter("ParameterCopies") END;
  9716. parameter := x.firstParameter;
  9717. WHILE parameter # NIL DO
  9718. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9719. type := parameter.type.resolved;
  9720. IF IsOpenArray(type) THEN
  9721. VisitParameter(parameter);
  9722. op := result;
  9723. IF backend.cooperative & parameter.NeedsTrace() THEN
  9724. length := GetArrayLength(type, op.tag);
  9725. size := NewRegisterOperand(addressType);
  9726. base := ArrayBaseType(type);
  9727. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9728. Emit(Mul(position, size, length, const));
  9729. dst := NewRegisterOperand (addressType);
  9730. Emit(Mov(position, dst, size));
  9731. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9732. Emit(Sub(position,dst,sp,dst));
  9733. Emit(And(position,dst,dst,const));
  9734. Emit(Mov(position,sp,dst));
  9735. par := fp;
  9736. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9737. IntermediateCode.InitImmediate(null, byteType, 0);
  9738. Emit(Fill(position, dst, size, null));
  9739. ReleaseIntermediateOperand(dst);
  9740. ReleaseIntermediateOperand(length);
  9741. SaveRegisters();ReleaseUsedRegisters(saved);
  9742. (* register dst has been freed before SaveRegisters already *)
  9743. base := ArrayBaseType(type);
  9744. (* assign method of open array *)
  9745. IF base.IsRecordType() THEN
  9746. Emit (Push(position, length));
  9747. Emit (Push(position, dst));
  9748. Emit (Push(position, op.op));
  9749. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9750. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9751. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9752. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9753. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9754. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9755. Emit (Push(position,length));
  9756. Emit (Push(position, dst));
  9757. Emit (Push(position, length));
  9758. Emit (Push(position, op.op));
  9759. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9760. ELSE
  9761. Emit (Push(position, length));
  9762. Emit (Push(position, dst));
  9763. Emit (Push(position, length));
  9764. Emit (Push(position, op.op));
  9765. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9766. ASSERT(ArrayBaseType(type).IsPointer());
  9767. END;
  9768. RestoreRegisters(saved);
  9769. ELSE
  9770. temp := GetDynamicSize(type,op.tag);
  9771. ReuseCopy(size,temp);
  9772. ReleaseIntermediateOperand(temp);
  9773. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9774. Emit(Sub(position,size,sp,size));
  9775. Emit(And(position,size,size,const));
  9776. Emit(Mov(position,sp,size));
  9777. par := fp;
  9778. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9779. ReleaseIntermediateOperand(size);
  9780. size := GetDynamicSize(type,op.tag);
  9781. END;
  9782. Emit(Copy(position,sp,op.op,size));
  9783. ReleaseIntermediateOperand(size);
  9784. ReleaseOperand(op);
  9785. IntermediateCode.MakeMemory(par,addressType);
  9786. Emit(Mov(position,par,sp));
  9787. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9788. checker.SetCurrentScope(currentScope);
  9789. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9790. Assign(parameterDesignator,parameterDesignator);
  9791. END;
  9792. END;
  9793. parameter := parameter.nextParameter;
  9794. END;
  9795. IF Trace THEN TraceExit("ParameterCopies") END;
  9796. END ParameterCopies;
  9797. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9798. VAR x: SyntaxTree.Variable;
  9799. BEGIN
  9800. x := scope.firstVariable;
  9801. WHILE x # NIL DO
  9802. InitVariable(x);
  9803. x := x.nextVariable;
  9804. END;
  9805. END InitVariables;
  9806. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9807. BEGIN
  9808. IF (symbol # NIL) THEN
  9809. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9810. ELSE
  9811. RETURN 0
  9812. END;
  9813. END GetFingerprint;
  9814. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9815. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9816. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9817. saved: RegisterEntry;
  9818. BEGIN
  9819. IF Trace THEN TraceEnter("Body") END;
  9820. ReleaseUsedRegisters(saved); (* just in case ... *)
  9821. section := ir;
  9822. exitLabel := NewLabel ();
  9823. IF moduleBody THEN moduleBodySection := section END;
  9824. IF ir.comments # NIL THEN
  9825. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9826. commentPrintout.SingleStatement(TRUE);
  9827. dump := ir.comments;
  9828. ELSE
  9829. commentPrintout := NIL;
  9830. dump := NIL;
  9831. END;
  9832. prevScope := currentScope;
  9833. currentScope := scope;
  9834. lastSwitchPC := 0;
  9835. cooperativeSwitches := backend.cooperative;
  9836. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9837. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9838. IF x # NIL THEN
  9839. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9840. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9841. IF moduleBody THEN
  9842. ProfilerInit();
  9843. ELSE
  9844. Basic.SegmentedNameToString(ir.name, string);
  9845. ProfilerAddProcedure(numberProcedures,string);
  9846. ProfilerEnterExit(numberProcedures,TRUE);
  9847. END;
  9848. END;
  9849. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9850. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9851. END;
  9852. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9853. IF moduleBody & ~newObjectFile THEN
  9854. InitVariables(moduleScope)
  9855. END;
  9856. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9857. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9858. IF procedure = cellScope.bodyProcedure THEN
  9859. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9860. StaticCallOperand(op, cellScope.constructor);
  9861. Emit(Call(position,op.op,0));
  9862. END;
  9863. END;
  9864. END;
  9865. ParameterCopies(procedureType);
  9866. InitVariables(scope);
  9867. IF x.code = NIL THEN
  9868. VisitStatementBlock(x);
  9869. ELSE
  9870. VisitCode(x.code)
  9871. END;
  9872. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9873. ir.SetFinally(ir.pc);
  9874. StatementSequence(x.finally)
  9875. END;
  9876. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9877. IF ~backend.cooperative THEN
  9878. ProfilerEnterExit(numberProcedures,FALSE);
  9879. END;
  9880. INC(numberProcedures);
  9881. END;
  9882. END;
  9883. IF backend.cooperative THEN
  9884. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9885. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9886. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9887. (*! not required any more? check and delete!
  9888. PushSelfPointer();
  9889. CallThis(position,"Modules","SetInitialized",1);
  9890. *)
  9891. (*
  9892. SetLabel(end);
  9893. *)
  9894. END;
  9895. IF x # NIL THEN
  9896. SELF.position := x.position;
  9897. END;
  9898. CheckRegistersFree();
  9899. ASSERT(modifyAssignmentCounter = 0);
  9900. currentScope := prevScope;
  9901. IF Trace THEN TraceExit("Body") END;
  9902. END Body;
  9903. END ImplementationVisitor;
  9904. MetaDataGenerator=OBJECT
  9905. VAR
  9906. implementationVisitor: ImplementationVisitor;
  9907. declarationVisitor: DeclarationVisitor;
  9908. module: Sections.Module;
  9909. moduleName: ARRAY 128 OF CHAR;
  9910. moduleNamePool: Basic.HashTableInt;
  9911. moduleNamePoolSection: IntermediateCode.Section;
  9912. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9913. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9914. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9915. TypeTags: LONGINT; (* type extension level support *)
  9916. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9917. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9918. BEGIN
  9919. IF implementationVisitor.backend.cooperative THEN
  9920. TypeTags := MAX(LONGINT);
  9921. BaseTypesTableOffset := 0;
  9922. MethodTableOffset := 2;
  9923. TypeRecordBaseOffset := 0;
  9924. ELSIF simple THEN
  9925. TypeTags := 3; (* only 3 extensions allowed *)
  9926. BaseTypesTableOffset := 1;
  9927. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  9928. TypeRecordBaseOffset := 0;
  9929. ELSE
  9930. TypeTags := 16;
  9931. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9932. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9933. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9934. END;
  9935. SELF.simple := simple;
  9936. SELF.implementationVisitor := implementationVisitor;
  9937. SELF.declarationVisitor := declarationVisitor;
  9938. implementationVisitor.meta := SELF;
  9939. declarationVisitor.meta := SELF;
  9940. END InitMetaDataGenerator;
  9941. PROCEDURE SetModule(module: Sections.Module);
  9942. VAR namePoolOffset: LONGINT;
  9943. BEGIN
  9944. SELF.module := module;
  9945. Global.GetModuleName(module.module,moduleName);
  9946. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple THEN
  9947. NEW(moduleNamePool, 32);
  9948. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  9949. END;
  9950. END SetModule;
  9951. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9952. BEGIN
  9953. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9954. END GetTypeRecordBaseOffset;
  9955. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9956. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9957. BEGIN
  9958. INC(dataAdrOffset,6);
  9959. Info(section,"headerAdr");
  9960. Address(section,0);
  9961. Info(section,"typeDesc");
  9962. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9963. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9964. NamedSymbol(section, name, symbol, 0, offset);
  9965. Info(section,"mark: LONGINT;");
  9966. Longint(section,-1);
  9967. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0);END;
  9968. Info(section,"dataAdr-: ADDRESS");
  9969. Symbol(section,section, dataAdrOffset,0);
  9970. Info(section,"size-: SIZE");
  9971. Address(section,0);
  9972. Info(section,"nextRealtime: HeapBlock;");
  9973. Address(section,0);
  9974. END HeapBlock;
  9975. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9976. VAR i: LONGINT;
  9977. BEGIN
  9978. INC(dataAdrOffset,14);
  9979. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9980. Info(section,"count*: LONGINT");
  9981. Longint(section,0);
  9982. Info(section,"locked*: BOOLEAN");
  9983. Longint(section,0);
  9984. Info(section,"awaitingLock*: ProcessQueue");
  9985. Address(section,0);
  9986. Address(section,0);
  9987. Info(section,"awaitingCond*: ProcessQueue");
  9988. Address(section,0);
  9989. Address(section,0);
  9990. Info(section,"lockedBy*: ANY");
  9991. Address(section,0);
  9992. Info(section,"lock*: ANY");
  9993. Address(section,0);
  9994. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  9995. Longint(section,1);
  9996. FOR i := 2 TO 6 DO
  9997. Longint(section,0);
  9998. END;
  9999. END ProtectedHeapBlock;
  10000. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10001. BEGIN
  10002. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10003. END Info;
  10004. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  10005. VAR op: IntermediateCode.Operand;
  10006. BEGIN
  10007. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10008. section.Emit(Data(-11,op));
  10009. END Address;
  10010. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  10011. VAR op: IntermediateCode.Operand;
  10012. BEGIN
  10013. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10014. section.Emit(Data(-12,op));
  10015. END Size;
  10016. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10017. VAR op: IntermediateCode.Operand;
  10018. BEGIN
  10019. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10020. section.Emit(Data(-1,op));
  10021. END Set;
  10022. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10023. VAR op: IntermediateCode.Operand;
  10024. BEGIN
  10025. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10026. section.Emit(Data(-1,op));
  10027. END Longint;
  10028. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10029. VAR op,noOperand: IntermediateCode.Operand;
  10030. BEGIN
  10031. IntermediateCode.InitOperand(noOperand);
  10032. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10033. section.PatchOperands(pc,op,noOperand,noOperand);
  10034. END PatchAddress;
  10035. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10036. VAR op,noOperand: IntermediateCode.Operand;
  10037. BEGIN
  10038. IntermediateCode.InitOperand(noOperand);
  10039. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10040. section.PatchOperands(pc,op,noOperand,noOperand);
  10041. END PatchSize;
  10042. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10043. VAR op,noOperand: IntermediateCode.Operand;
  10044. BEGIN
  10045. IntermediateCode.InitOperand(noOperand);
  10046. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10047. section.PatchOperands(pc,op,noOperand,noOperand);
  10048. END PatchLongint;
  10049. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10050. VAR op, noOperand: IntermediateCode.Operand;
  10051. BEGIN
  10052. IntermediateCode.InitOperand(noOperand);
  10053. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10054. section.PatchOperands(pc,op,noOperand,noOperand);
  10055. END PatchSymbol;
  10056. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10057. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10058. BEGIN
  10059. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10060. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10061. section.Emit(Data(-1,op));
  10062. END Boolean;
  10063. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10064. VAR op: IntermediateCode.Operand;
  10065. BEGIN
  10066. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10067. section.Emit(Data(-1,op));
  10068. END Char;
  10069. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10070. VAR i: LONGINT;
  10071. BEGIN
  10072. Info(section,str);
  10073. i := 0;
  10074. WHILE(str[i] # 0X) DO
  10075. Char(section,str[i]);
  10076. INC(i);
  10077. END;
  10078. Char(section,0X);
  10079. END String;
  10080. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10081. VAR op: IntermediateCode.Operand;
  10082. BEGIN
  10083. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10084. IntermediateCode.SetOffset(op,realOffset);
  10085. section.Emit(Data(-1,op));
  10086. END NamedSymbol;
  10087. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10088. BEGIN
  10089. IF symbol= NIL THEN
  10090. Address( section, realOffset);
  10091. ASSERT(virtualOffset = 0);
  10092. ELSE
  10093. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10094. END;
  10095. END Symbol;
  10096. (* OutPointers delivers
  10097. {pointerOffset}
  10098. *)
  10099. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10100. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  10101. BEGIN
  10102. type := type.resolved;
  10103. IF type IS SyntaxTree.AnyType THEN
  10104. Symbol(section, symbol, 0, (offset ));
  10105. INC(numberPointers);
  10106. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10107. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10108. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10109. ELSIF type IS SyntaxTree.PointerType THEN
  10110. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10111. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10112. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10113. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10114. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10115. ELSIF (type IS SyntaxTree.RecordType) THEN
  10116. (* never treat a record like a pointer, even if the pointer field is set! *)
  10117. WITH type: SyntaxTree.RecordType DO
  10118. base := type.GetBaseRecord();
  10119. IF base # NIL THEN
  10120. Pointers(offset,symbol,section, base,numberPointers);
  10121. END;
  10122. variable := type.recordScope.firstVariable;
  10123. WHILE(variable # NIL) DO
  10124. IF ~(variable.untraced) THEN
  10125. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10126. END;
  10127. variable := variable.nextVariable;
  10128. END;
  10129. END;
  10130. ELSIF (type IS SyntaxTree.CellType) THEN
  10131. WITH type: SyntaxTree.CellType DO
  10132. base := type.GetBaseRecord();
  10133. IF base # NIL THEN
  10134. Pointers(offset,symbol,section, base,numberPointers);
  10135. END;
  10136. variable := type.cellScope.firstVariable;
  10137. WHILE(variable # NIL) DO
  10138. IF ~(variable.untraced) THEN
  10139. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10140. END;
  10141. variable := variable.nextVariable;
  10142. END;
  10143. END;
  10144. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10145. WITH type: SyntaxTree.ArrayType DO
  10146. IF type.form= SyntaxTree.Static THEN
  10147. n := type.staticLength;
  10148. base := type.arrayBase.resolved;
  10149. WHILE(base IS SyntaxTree.ArrayType) DO
  10150. type := base(SyntaxTree.ArrayType);
  10151. n := n* type.staticLength;
  10152. base := type.arrayBase.resolved;
  10153. END;
  10154. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10155. IF SemanticChecker.ContainsPointer(base) THEN
  10156. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10157. FOR i := 0 TO n-1 DO
  10158. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10159. END;
  10160. END;
  10161. ELSE
  10162. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10163. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10164. END;
  10165. END;
  10166. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10167. WITH type: SyntaxTree.MathArrayType DO
  10168. IF type.form = SyntaxTree.Static THEN
  10169. n := type.staticLength;
  10170. base := type.arrayBase.resolved;
  10171. WHILE(base IS SyntaxTree.MathArrayType) DO
  10172. type := base(SyntaxTree.MathArrayType);
  10173. n := n* type.staticLength;
  10174. base := type.arrayBase.resolved;
  10175. END;
  10176. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10177. IF SemanticChecker.ContainsPointer(base) THEN
  10178. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10179. FOR i := 0 TO n-1 DO
  10180. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10181. END;
  10182. END;
  10183. ELSE
  10184. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10185. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10186. END
  10187. END;
  10188. (* ELSE no pointers in type *)
  10189. END;
  10190. END Pointers;
  10191. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10192. VAR position,i: LONGINT; ch: CHAR;
  10193. BEGIN
  10194. IF pool.Has(index) THEN
  10195. RETURN pool.GetInt(index)
  10196. ELSE
  10197. position := source.pc;
  10198. pool.PutInt(index, position);
  10199. Info(source, name);
  10200. i := 0;
  10201. REPEAT
  10202. ch := name[i]; INC(i);
  10203. Char( source, ch);
  10204. UNTIL ch = 0X;
  10205. END;
  10206. RETURN position;
  10207. END EnterDynamicName;
  10208. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10209. VAR name: Basic.SectionName; position: LONGINT;
  10210. BEGIN
  10211. IF pool.Has(index) THEN
  10212. RETURN pool.GetInt(index)
  10213. ELSE
  10214. StringPool.GetString(index, name);
  10215. position := EnterDynamicName(source,name,index, pool);
  10216. END;
  10217. RETURN position;
  10218. END DynamicName;
  10219. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10220. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  10221. BEGIN
  10222. COPY(moduleName,name);
  10223. Strings.Append(name,suffix);
  10224. Basic.ToSegmentedName(name, pooledName);
  10225. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  10226. IF implementationVisitor.backend.cooperative THEN
  10227. Info(section, "TypeDescriptor");
  10228. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  10229. NamedSymbol(section, pooledName,NIL, 0, 0);
  10230. BasePointer(section);
  10231. offset := 0;
  10232. ELSE
  10233. HeapBlock(mName,typeName,section,2);
  10234. Info(section, "HeapBlock");
  10235. (*
  10236. Symbol(section,section,2,0);
  10237. *)
  10238. Address(section,0); (* empty such that GC does not go on traversing *)
  10239. Info(section, "TypeDescriptor");
  10240. Address(section,0);
  10241. offset := section.pc;
  10242. END;
  10243. RETURN section
  10244. END Block;
  10245. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  10246. VAR name: Basic.SegmentedName;
  10247. BEGIN
  10248. Info(source,"ArrayHeader");
  10249. IF implementationVisitor.backend.cooperative THEN
  10250. sizePC := source.pc;
  10251. Address(source,0);
  10252. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10253. IF baseType # "" THEN
  10254. Basic.ToSegmentedName(baseType, name);
  10255. NamedSymbol(source, name,NIL, 0, 0);
  10256. ELSE
  10257. Address(source,0);
  10258. END;
  10259. Address(source,0);
  10260. ELSE
  10261. Address(source,0);
  10262. Address(source,0);
  10263. Address(source,0);
  10264. sizePC := source.pc;
  10265. Address(source,0);
  10266. Info(source,"array data");
  10267. END;
  10268. END Array;
  10269. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10270. BEGIN
  10271. IF implementationVisitor.backend.cooperative THEN
  10272. PatchSize(section, pc, size);
  10273. PatchSize(section, pc + 3, size);
  10274. ELSE
  10275. PatchSize(section, pc, size);
  10276. END;
  10277. END PatchArray;
  10278. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10279. VAR
  10280. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10281. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10282. poolMap: Basic.HashTableInt;
  10283. namePool: IntermediateCode.Section;
  10284. namePoolOffset: LONGINT;
  10285. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10286. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10287. BEGIN
  10288. Basic.SegmentedNameToString(s1.name,n1);
  10289. Basic.SegmentedNameToString(s2.name,n2);
  10290. index := 0;
  10291. ch1 := n1[index];
  10292. ch2 := n2[index];
  10293. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10294. INC(index);
  10295. ch1 := n1[index];
  10296. ch2 := n2[index];
  10297. END;
  10298. RETURN ch1 < ch2;
  10299. END Compare;
  10300. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10301. VAR
  10302. i, j: LONGINT;
  10303. x, t: Sections.Section;
  10304. BEGIN
  10305. IF lo < hi THEN
  10306. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10307. WHILE i <= j DO
  10308. WHILE Compare(list[i], x) DO INC(i) END;
  10309. WHILE Compare(x, list[j]) DO DEC(j) END;
  10310. IF i <= j THEN
  10311. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10312. INC(i); DEC(j)
  10313. END
  10314. END;
  10315. IF lo < j THEN QuickSort(list, lo, j) END;
  10316. IF i < hi THEN QuickSort(list, i, hi) END
  10317. END;
  10318. END QuickSort;
  10319. (*
  10320. ExportDesc* = RECORD
  10321. fp*: ADDRESS;
  10322. name* {UNTRACED}: DynamicName;
  10323. adr*: ADDRESS;
  10324. exports*: LONGINT;
  10325. dsc* {UNTRACED}: ExportArray
  10326. END;
  10327. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10328. *)
  10329. PROCEDURE ExportDesc2(
  10330. source: IntermediateCode.Section;
  10331. namePool: IntermediateCode.Section;
  10332. fingerPrinter: FingerPrinter.FingerPrinter;
  10333. symbol: Sections.Section;
  10334. name: StringPool.Index;
  10335. VAR patchAdr: LONGINT
  10336. ): BOOLEAN;
  10337. VAR fingerPrint: SyntaxTree.FingerPrint;
  10338. BEGIN
  10339. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10340. & (symbol.type # Sections.InlineCodeSection)
  10341. THEN
  10342. *)
  10343. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10344. & (symbol.type # Sections.InlineCodeSection))
  10345. THEN
  10346. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10347. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10348. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10349. Longint(source,fingerPrint.shallow);
  10350. ELSE
  10351. Longint(source, 0);
  10352. END;
  10353. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10354. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10355. Symbol(source, symbol,0,0);
  10356. patchAdr := source.pc;
  10357. Longint(source, 0);
  10358. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10359. Address(source,0);
  10360. END;
  10361. RETURN TRUE
  10362. ELSE
  10363. RETURN FALSE
  10364. END;
  10365. END ExportDesc2;
  10366. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10367. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10368. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10369. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10370. nextPatch: LONGINT;
  10371. TYPE
  10372. Scope = RECORD
  10373. elements: LONGINT;
  10374. gelements: LONGINT;
  10375. section: IntermediateCode.Section;
  10376. patchAdr: LONGINT;
  10377. arraySizePC: LONGINT;
  10378. beginPC: LONGINT; (* current scope start pc *)
  10379. END;
  10380. BEGIN
  10381. Basic.InitSegmentedName(prev);
  10382. olevel := -1;
  10383. scopes[0].section := source;
  10384. scopes[0].arraySizePC := MIN(LONGINT);
  10385. FOR s := 0 TO LEN(sections)-1 DO
  10386. symbol := sections[s];
  10387. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10388. this := sections[s].name;
  10389. level := 0;
  10390. WHILE (this[level] > 0) DO
  10391. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10392. INC(level);
  10393. END;
  10394. WHILE level < olevel DO
  10395. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10396. IF olevel > 0 THEN
  10397. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10398. nextPatch := scopes[olevel-1].patchAdr+1;
  10399. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10400. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10401. END;
  10402. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10403. DEC(olevel);
  10404. END;
  10405. IF (this[level] > 0) THEN
  10406. IF level > olevel THEN
  10407. (*TRACE("opening",level); *)
  10408. IF scopes[level].section = NIL THEN
  10409. arrayName := ".@ExportArray";
  10410. Strings.AppendInt(arrayName, level);
  10411. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10412. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10413. END;
  10414. scopes[level].beginPC := scopes[level].section.pc;
  10415. olevel := level;
  10416. scopes[olevel].elements := 0;
  10417. END;
  10418. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10419. sym := sections[s];
  10420. ELSE
  10421. sym := NIL;
  10422. END;
  10423. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10424. THEN
  10425. INC(scopes[olevel].elements);
  10426. END;
  10427. (*StringPool.GetString(this[level], name);*)
  10428. (*TRACE(level, name);*)
  10429. (* enter string in scope *)
  10430. INC(level);
  10431. END;
  10432. END;
  10433. Basic.SegmentedNameToString(this, name);
  10434. (*TRACE(level, "enter", name);*)
  10435. prev := this;
  10436. END;
  10437. END;
  10438. WHILE 0 <= olevel DO
  10439. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10440. IF olevel > 0 THEN
  10441. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10442. nextPatch := scopes[olevel-1].patchAdr+1;
  10443. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10444. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10445. END;
  10446. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10447. DEC(olevel);
  10448. END;
  10449. level := 0;
  10450. WHILE (level < LEN(scopes)) DO
  10451. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  10452. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10453. END;
  10454. INC(level);
  10455. END;
  10456. END Export;
  10457. BEGIN
  10458. NEW(fingerPrinter, module.system);
  10459. NEW(poolMap, 64);
  10460. (* 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 *)
  10461. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10462. NEW(sectionArray, module.allSections.Length());
  10463. FOR i := 0 TO module.allSections.Length() - 1 DO
  10464. section := module.allSections.GetSection(i);
  10465. sectionArray[i] := section;
  10466. END;
  10467. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10468. Export(sectionArray^);
  10469. END ExportDesc;
  10470. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10471. VAR
  10472. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10473. BEGIN
  10474. Info(source, "exception table offsets array descriptor");
  10475. size := 0;
  10476. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10477. Info(source, "exception table content");
  10478. FOR i := 0 TO module.allSections.Length() - 1 DO
  10479. p := module.allSections.GetSection(i);
  10480. IF p.type = Sections.CodeSection THEN
  10481. finallyPC := p(IntermediateCode.Section).finally;
  10482. IF finallyPC>=0 THEN
  10483. Symbol( source, p, 0,0);
  10484. Symbol( source, p, finallyPC, 0);
  10485. Symbol( source, p, finallyPC,0);
  10486. INC(size);
  10487. END;
  10488. END
  10489. END;
  10490. PatchArray(source,sizePC,size);
  10491. END ExceptionArray;
  10492. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10493. VAR i: LONGINT; ch: CHAR;
  10494. BEGIN
  10495. i := 0;
  10496. REPEAT
  10497. ch := name[i]; INC(i);
  10498. Char( section, ch);
  10499. UNTIL ch = 0X;
  10500. WHILE i < 32 DO
  10501. Char( section, 0X); INC(i);
  10502. END;
  10503. END Name;
  10504. PROCEDURE References(section: IntermediateCode.Section);
  10505. CONST
  10506. rfDirect = 1X; rfIndirect = 3X;
  10507. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10508. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10509. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10510. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfComplex = 17X; rfLongcomplex = 18X;
  10511. rfPort = 19X;
  10512. rfRecordPointer=1DX;
  10513. rfArrayFlag = 80X;
  10514. VAR
  10515. s: Sections.Section; sizePC, i, startPC, endPC: LONGINT;
  10516. PROCEDURE BaseType(type: SyntaxTree.Type): CHAR;
  10517. VAR char: CHAR;
  10518. BEGIN
  10519. IF type = NIL THEN char := rfLongint
  10520. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10521. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10522. ELSIF type IS SyntaxTree.CharacterType THEN
  10523. IF type.sizeInBits = 8 THEN char := rfChar8
  10524. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10525. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10526. END;
  10527. ELSIF (type IS SyntaxTree.IntegerType) OR (type IS SyntaxTree.AddressType) OR (type IS SyntaxTree.SizeType) THEN
  10528. IF type.sizeInBits = 8 THEN char := rfShortint
  10529. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10530. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10531. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10532. END;
  10533. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10534. ELSIF type IS SyntaxTree.FloatType THEN
  10535. IF type.sizeInBits = 32 THEN char := rfReal
  10536. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10537. END;
  10538. ELSIF type IS SyntaxTree.ComplexType THEN
  10539. IF type.sizeInBits = 64 THEN char := rfComplex
  10540. ELSIF type.sizeInBits = 128 THEN char := rfLongcomplex
  10541. END;
  10542. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10543. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10544. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10545. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10546. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10547. ELSIF type IS SyntaxTree.RangeType THEN char := rfRange
  10548. ELSIF type IS SyntaxTree.PortType THEN char := rfPort
  10549. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10550. END;
  10551. RETURN char
  10552. END BaseType;
  10553. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10554. VAR destination: Sections.Section;
  10555. BEGIN
  10556. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10557. IF type.pointerType # NIL THEN
  10558. Char(section,rfRecordPointer)
  10559. ELSE
  10560. Char(section,rfRecord);
  10561. END;
  10562. IF destination = NIL THEN
  10563. Longint(section,0);
  10564. ELSE
  10565. Longint(section,destination.offset); (* used for ? *)
  10566. END;
  10567. END RecordType;
  10568. PROCEDURE StaticArrayLength(type: SyntaxTree.ArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10569. BEGIN
  10570. baseType := type.arrayBase.resolved;
  10571. IF type.form = SyntaxTree.Static THEN
  10572. IF baseType IS SyntaxTree.ArrayType THEN
  10573. RETURN type.staticLength * StaticArrayLength(baseType(SyntaxTree.ArrayType),baseType)
  10574. ELSE
  10575. RETURN type.staticLength
  10576. END
  10577. ELSE
  10578. RETURN 0
  10579. END;
  10580. END StaticArrayLength;
  10581. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10582. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10583. BEGIN
  10584. length := StaticArrayLength(type, baseType);
  10585. char := BaseType(baseType);
  10586. IF type.form # SyntaxTree.Open THEN
  10587. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10588. Longint(section, length)
  10589. ELSE
  10590. length :=0;
  10591. (*length := 1+SemanticChecker.Dimension(type,{SyntaxTree.Open});*)
  10592. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10593. Longint(section, length)
  10594. END;
  10595. END ArrayType;
  10596. PROCEDURE StaticMathArrayLength(type: SyntaxTree.MathArrayType; VAR baseType: SyntaxTree.Type): LONGINT;
  10597. BEGIN
  10598. baseType := type.arrayBase;
  10599. IF baseType # NIL THEN
  10600. baseType := baseType.resolved;
  10601. END;
  10602. IF type.form = SyntaxTree.Static THEN
  10603. IF (baseType # NIL) & (baseType IS SyntaxTree.MathArrayType) THEN
  10604. RETURN type.staticLength * StaticMathArrayLength(baseType(SyntaxTree.MathArrayType),baseType)
  10605. ELSE
  10606. RETURN type.staticLength
  10607. END
  10608. ELSE
  10609. RETURN 0
  10610. END;
  10611. END StaticMathArrayLength;
  10612. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10613. VAR length: LONGINT; baseType: SyntaxTree.Type; char: CHAR;
  10614. BEGIN
  10615. length := StaticMathArrayLength(type, baseType);
  10616. char := BaseType(baseType);
  10617. IF type.form = SyntaxTree.Open THEN
  10618. char := BaseType(module.system.addressType);
  10619. length := 5+2*SemanticChecker.Dimension(type,{SyntaxTree.Open});
  10620. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10621. Longint(section, length)
  10622. ELSIF type.form=SyntaxTree.Tensor THEN
  10623. char := BaseType(module.system.addressType);
  10624. Char(section, CHR(ORD(char)));
  10625. ELSE
  10626. Char(section, CHR(ORD(char)+ORD(rfArrayFlag)));
  10627. Longint(section, length)
  10628. END;
  10629. END MathArrayType;
  10630. PROCEDURE Type(type: SyntaxTree.Type);
  10631. BEGIN
  10632. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10633. IF type IS SyntaxTree.BasicType THEN
  10634. Char(section, BaseType(type));
  10635. ELSIF type IS SyntaxTree.RecordType THEN
  10636. RecordType(type(SyntaxTree.RecordType));
  10637. ELSIF type IS SyntaxTree.ArrayType THEN
  10638. ArrayType(type(SyntaxTree.ArrayType))
  10639. ELSIF type IS SyntaxTree.EnumerationType THEN
  10640. Char(section, BaseType(module.system.longintType))
  10641. ELSIF type IS SyntaxTree.PointerType THEN
  10642. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10643. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10644. ELSE
  10645. Char(section, BaseType(type))
  10646. END;
  10647. ELSIF type IS SyntaxTree.ProcedureType THEN
  10648. Char(section, BaseType(type));
  10649. ELSIF type IS SyntaxTree.MathArrayType THEN
  10650. MathArrayType(type(SyntaxTree.MathArrayType));
  10651. ELSIF type IS SyntaxTree.CellType THEN
  10652. Char(section, BaseType(module.system.anyType));
  10653. ELSIF type IS SyntaxTree.PortType THEN
  10654. Char(section, rfPort);
  10655. ELSE HALT(200)
  10656. END;
  10657. END Type;
  10658. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10659. VAR name: ARRAY 256 OF CHAR;
  10660. BEGIN
  10661. IF variable.externalName # NIL THEN RETURN END;
  10662. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10663. variable.GetName(name);
  10664. Type(variable.type);
  10665. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10666. String(section,name);
  10667. END WriteVariable;
  10668. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10669. VAR name: ARRAY 256 OF CHAR;
  10670. BEGIN
  10671. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10672. variable.GetName(name);
  10673. Type(variable.type);
  10674. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10675. variable.GetName(name);
  10676. String(section,name);
  10677. END WriteParameter;
  10678. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10679. BEGIN
  10680. IF type = NIL THEN Char(section,0X); RETURN ELSE type := type.resolved END;
  10681. IF type IS SyntaxTree.ArrayType THEN
  10682. WITH type: SyntaxTree.ArrayType DO
  10683. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10684. ELSE Char(section,rfOpenArray)
  10685. END;
  10686. END
  10687. ELSIF type IS SyntaxTree.MathArrayType THEN
  10688. WITH type: SyntaxTree.MathArrayType DO
  10689. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10690. ELSE Char(section,rfOpenArray)
  10691. END;
  10692. END
  10693. ELSIF type IS SyntaxTree.RecordType THEN
  10694. Char(section,rfRecord);
  10695. ELSE
  10696. Char(section, BaseType(type));
  10697. END;
  10698. END ReturnType;
  10699. PROCEDURE Procedure(s: Sections.Section);
  10700. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10701. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10702. name: ARRAY 256 OF CHAR;
  10703. BEGIN
  10704. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10705. (*procedure.name,name);*)
  10706. Global.GetSymbolNameInScope(procedure,module.module.moduleScope,name);
  10707. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10708. Char(section,0F9X);
  10709. Symbol(section,s,0,0);
  10710. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10711. Longint(section,procedureType.numberParameters);
  10712. ReturnType(procedureType.returnType);
  10713. Longint(section,0); (*! level *)
  10714. Longint(section,0);
  10715. (*
  10716. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10717. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10718. recordName := "";
  10719. IF record.pointerType # NIL THEN
  10720. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10721. ELSE
  10722. DeclarationName(record.typeDeclaration,recordName);
  10723. END;
  10724. i := 0;
  10725. Info(section,recordName);
  10726. WHILE recordName[i] # 0X DO
  10727. Char(section,recordName[i]); INC(i);
  10728. INC(size);
  10729. END;
  10730. Char(section,".");
  10731. INC(size);
  10732. END;
  10733. *)
  10734. String(section,name);
  10735. parameter := procedureType.firstParameter;
  10736. WHILE(parameter # NIL) DO
  10737. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10738. parameter := parameter.nextParameter;
  10739. END;
  10740. variable := procedure.procedureScope.firstVariable;
  10741. WHILE(variable # NIL) DO
  10742. WriteVariable(variable,FALSE);
  10743. variable := variable.nextVariable;
  10744. END;
  10745. END Procedure;
  10746. PROCEDURE Scope(s: Sections.Section);
  10747. BEGIN
  10748. Char(section,0F8X);
  10749. Symbol(section,s,0,0); (* start *)
  10750. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10751. String(section,"$$");
  10752. (* removed variables -- wrongly interpreted by Reflection
  10753. variable := module.module.moduleScope.firstVariable;
  10754. WHILE(variable # NIL) DO
  10755. WriteVariable(variable,FALSE);
  10756. variable := variable.nextVariable;
  10757. END;
  10758. *)
  10759. END Scope;
  10760. PROCEDURE ComputeSize(startPC, endPC: LONGINT): SIZE;
  10761. VAR result, i: LONGINT;
  10762. BEGIN
  10763. FOR i := startPC TO endPC -1 DO
  10764. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  10765. INC(result, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  10766. END;
  10767. RETURN result;
  10768. END ComputeSize;
  10769. BEGIN
  10770. Array(section,sizePC,"");
  10771. startPC := section.pc;
  10772. Char(section,0FFX); (* sign for trap writer *)
  10773. FOR i := 0 TO module.allSections.Length() - 1 DO
  10774. s := module.allSections.GetSection(i);
  10775. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10776. Scope(s) (*! must be first procedure in ref section *)
  10777. END
  10778. END;
  10779. FOR i := 0 TO module.allSections.Length() - 1 DO
  10780. s := module.allSections.GetSection(i);
  10781. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10782. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10783. Procedure(s)
  10784. END
  10785. END;
  10786. endPC := section.pc;
  10787. PatchArray(section,sizePC,ComputeSize(startPC, endPC));
  10788. END References;
  10789. (*
  10790. Command* = RECORD
  10791. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10792. name*: Name; (* name of the procedure *)
  10793. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10794. entryAdr* : ADDRESS; (* entry address of procedure *)
  10795. END;
  10796. *)
  10797. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10798. VAR
  10799. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10800. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10801. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  10802. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10803. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10804. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10805. BEGIN
  10806. RETURN
  10807. (type = NIL) OR
  10808. (type.resolved IS SyntaxTree.RecordType) OR
  10809. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10810. (type.resolved IS SyntaxTree.AnyType);
  10811. END TypeAllowed;
  10812. BEGIN
  10813. numberParameters := procedureType.numberParameters;
  10814. RETURN
  10815. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10816. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10817. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10818. END GetProcedureAllowed;
  10819. PROCEDURE WriteType(type : SyntaxTree.Type);
  10820. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10821. name: Basic.SegmentedName; offset: LONGINT;
  10822. BEGIN
  10823. IF type = NIL THEN
  10824. Address(source,0);
  10825. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10826. Address(source,1);
  10827. ELSE
  10828. type := type.resolved;
  10829. IF type IS SyntaxTree.PointerType THEN
  10830. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10831. END;
  10832. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10833. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10834. name[0] := typeDeclaration.name; name[1] := -1;
  10835. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10836. ASSERT(section # NIL);
  10837. ELSE
  10838. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10839. (* TODO *)
  10840. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10841. END;
  10842. IF implementationVisitor.backend.cooperative THEN
  10843. offset := 0;
  10844. ELSE
  10845. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10846. END;
  10847. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10848. END;
  10849. END WriteType;
  10850. BEGIN
  10851. Info(source, "command array descriptor");
  10852. Array(source,sizePC,"Modules.Command");
  10853. numberCommands := 0;
  10854. Info(source, "command array content");
  10855. FOR i := 0 TO module.allSections.Length() - 1 DO
  10856. p := module.allSections.GetSection(i);
  10857. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10858. procedure := p.symbol(SyntaxTree.Procedure);
  10859. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10860. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10861. procedure.GetName(name);
  10862. Name(source,name);
  10863. numberParameters := procedureType.numberParameters;
  10864. (* offset of type of first parameter *)
  10865. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10866. ELSE WriteType(procedureType.firstParameter.type)
  10867. END;
  10868. (* offset of type of return parameter *)
  10869. WriteType(procedureType.returnType);
  10870. (* command name *)
  10871. (* command code offset *)
  10872. Symbol(source,p,0,0);
  10873. INC(numberCommands);
  10874. IF Trace THEN
  10875. D.Ln;
  10876. END;
  10877. END;
  10878. END
  10879. END;
  10880. PatchArray(source,sizePC,numberCommands);
  10881. END CommandArray;
  10882. (* to prevent from double import of different module aliases *)
  10883. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10884. VAR i: SyntaxTree.Import;
  10885. BEGIN
  10886. i := module.module.moduleScope.firstImport;
  10887. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10888. i := i.nextImport;
  10889. END;
  10890. RETURN i = import
  10891. END IsFirstDirectOccurence;
  10892. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10893. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10894. BEGIN
  10895. Array(source,pc,"");
  10896. Info(source, "import module array data");
  10897. IF implementationVisitor.backend.cooperative THEN
  10898. offset := 0;
  10899. ELSE
  10900. IF module.system.addressType.sizeInBits = 64 THEN
  10901. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10902. ELSE
  10903. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10904. END;
  10905. END;
  10906. import := module.module.moduleScope.firstImport;
  10907. numberImports := 0;
  10908. WHILE import # NIL DO
  10909. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10910. Global.GetModuleSegmentedName(import.module,name);
  10911. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10912. NamedSymbol(source, name, NIL, 0, offset);
  10913. INC(numberImports);
  10914. END;
  10915. import := import.nextImport
  10916. END;
  10917. PatchArray(source,pc,numberImports);
  10918. END ImportsArray;
  10919. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10920. VAR
  10921. p: Sections.Section; sizePC, size, i: LONGINT;
  10922. BEGIN
  10923. Info(source, "Type info section");
  10924. size := 0;
  10925. Array(source,sizePC,"Modules.TypeDesc");
  10926. FOR i := 0 TO module.allSections.Length() - 1 DO
  10927. p := module.allSections.GetSection(i);
  10928. WITH p: IntermediateCode.Section DO
  10929. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10930. Symbol(source,p,0,0);
  10931. INC(size);
  10932. END;
  10933. END
  10934. END;
  10935. PatchArray(source,sizePC,size);
  10936. END TypeInfoSection;
  10937. (*
  10938. ProcTableEntry* = RECORD
  10939. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10940. noPtr*: LONGINT;
  10941. END;
  10942. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10943. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10944. *)
  10945. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10946. VAR
  10947. destination: Sections.Section;
  10948. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10949. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10950. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10951. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10952. BEGIN
  10953. Info(procArray,"pcFrom");
  10954. Symbol(procArray,destination,0,0);
  10955. Info(procArray,"pcTo");
  10956. Symbol(procArray,destination,destination.pc,0);
  10957. Info(procArray,"pcStatementBegin");
  10958. Symbol(procArray,destination,destination.validPAFEnter,0);
  10959. Info(procArray,"pcStatementEnd");
  10960. Symbol(procArray,destination,destination.validPAFExit,0);
  10961. IF ~implementationVisitor.backend.cooperative THEN
  10962. Basic.SegmentedNameToString(destination.name, string);
  10963. Info(pointerArray,string);
  10964. procedure := destination.symbol(SyntaxTree.Procedure);
  10965. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10966. variable := procedure.procedureScope.firstVariable;
  10967. WHILE(variable # NIL) DO
  10968. IF ~(variable.untraced) THEN
  10969. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10970. END;
  10971. variable := variable.nextVariable
  10972. END;
  10973. parameter := procedureType.firstParameter;
  10974. WHILE(parameter # NIL) DO
  10975. IF ~(parameter.untraced) THEN
  10976. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10977. END;
  10978. parameter := parameter.nextParameter;
  10979. END;
  10980. END;
  10981. Info(procArray,"numberPointers");
  10982. Longint(procArray,numberPointers);
  10983. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  10984. INC(pointerArraySize, numberPointers);
  10985. END PointerOffsets;
  10986. BEGIN
  10987. maxPointers := 0;
  10988. Info(procArray, "proc array descriptor");
  10989. Address(procArray,0);
  10990. Address(procArray,0);
  10991. Address(procArray,0);
  10992. procArraySizePC := procArray.pc;
  10993. Address(procArray,0);
  10994. procArraySize := 0;
  10995. IF ~implementationVisitor.backend.cooperative THEN
  10996. Info(pointerArray, "pointer array descriptor");
  10997. Address(pointerArray,0);
  10998. Address(pointerArray,0);
  10999. Address(pointerArray,0);
  11000. pointerArraySizePC := pointerArray.pc;
  11001. Address(pointerArray,0);
  11002. pointerArraySize := 0;
  11003. END;
  11004. procArraySize := 0;
  11005. FOR i := 0 TO module.allSections.Length() - 1 DO
  11006. destination := module.allSections.GetSection(i);
  11007. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11008. PointerOffsets(destination(IntermediateCode.Section));
  11009. INC(procArraySize);
  11010. END
  11011. END;
  11012. PatchLongint(procArray,procArraySizePC,procArraySize);
  11013. IF ~implementationVisitor.backend.cooperative THEN
  11014. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  11015. END;
  11016. END PointersInProcTables;
  11017. (*
  11018. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11019. VAR
  11020. next*: Module; (** once a module is published, all fields are read-only *)
  11021. name*: Name;
  11022. init, published: BOOLEAN;
  11023. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11024. sb*: ADDRESS; <- set to beginning of data section by loader
  11025. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11026. command*: POINTER TO ARRAY OF Command;
  11027. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11028. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11029. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11030. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11031. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11032. data*, code*: Bytes;
  11033. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11034. export*: ExportDesc;
  11035. term*: TerminationHandler;
  11036. exTable*: ExceptionTable;
  11037. noProcs*: LONGINT;
  11038. firstProc*: ADDRESS; <- done by loader
  11039. maxPtrs*: LONGINT;
  11040. crc*: LONGINT;
  11041. *)
  11042. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11043. BEGIN
  11044. Info(section, "cycle");
  11045. Size(section,0);
  11046. Info(section, "references");
  11047. Size(section,0);
  11048. Info(section, "nextMarked");
  11049. Address(section,0);
  11050. Info(section, "nextWatched");
  11051. Address(section,0);
  11052. END BasePointer;
  11053. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11054. BEGIN
  11055. BasePointer(section);
  11056. Info(section, "action");
  11057. Address(section,0);
  11058. Info(section, "monitor");
  11059. Address(section,0);
  11060. END BaseObject;
  11061. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11062. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11063. pooledName: Basic.SegmentedName;
  11064. symbol: SyntaxTree.Symbol;
  11065. BEGIN
  11066. Global.GetModuleName(module.module,name);
  11067. Strings.Append(name,".@Module.@Descriptor");
  11068. Basic.ToSegmentedName(name, pooledName);
  11069. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  11070. Symbol(section,descriptorSection,0,0);
  11071. Info(descriptorSection, "descriptor");
  11072. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11073. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11074. Address(descriptorSection,0);
  11075. Global.GetModuleName(module.module,name);
  11076. Strings.Append(name,".@Trace");
  11077. Basic.ToSegmentedName(name, pooledName);
  11078. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11079. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11080. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11081. END ModuleDescriptor;
  11082. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11083. VAR name: ARRAY 128 OF CHAR;
  11084. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11085. symbol: SyntaxTree.Symbol;
  11086. BEGIN
  11087. Global.GetModuleName(module.module,name);
  11088. Strings.Append(name,".@Module");
  11089. Basic.ToSegmentedName(name, pooledName);
  11090. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  11091. moduleSection.SetExported(TRUE);
  11092. IF moduleSection.pc = 0 THEN
  11093. IF implementationVisitor.backend.cooperative THEN
  11094. Info(moduleSection, "descriptor");
  11095. ModuleDescriptor(moduleSection);
  11096. BaseObject(moduleSection);
  11097. implementationVisitor.CreateTraceModuleMethod(module.module);
  11098. ELSE
  11099. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11100. Info(moduleSection, "HeapBlock");
  11101. Symbol(moduleSection,moduleSection,2,0);
  11102. Info(moduleSection, "TypeDescriptor");
  11103. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11104. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11105. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11106. END;
  11107. END;
  11108. RETURN moduleSection;
  11109. END ModuleSection;
  11110. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11111. VAR
  11112. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11113. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  11114. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11115. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  11116. referenceSectionOffset : LONGINT;
  11117. BEGIN
  11118. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11119. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11120. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11121. ImportsArray(importSection);
  11122. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11123. CommandArray(commandsSection);
  11124. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11125. ExceptionArray(exceptionSection);
  11126. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11127. TypeInfoSection(typeInfoSection);
  11128. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11129. References(referenceSection);
  11130. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11131. IF ~implementationVisitor.backend.cooperative THEN
  11132. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  11133. ELSE
  11134. ptrTableSection := NIL;
  11135. END;
  11136. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  11137. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11138. Array(emptyArraySection,temp,"");
  11139. moduleSection := ModuleSection();
  11140. Info(moduleSection, "nextRoot*: RootObject");
  11141. Address(moduleSection,0);
  11142. Info(moduleSection, "next*: Module");
  11143. Address(moduleSection,0);
  11144. Info(moduleSection, "name*: Name");
  11145. Name(moduleSection,moduleName);
  11146. Info(moduleSection, "init, published: BOOLEAN");
  11147. Boolean(moduleSection,FALSE);
  11148. Boolean(moduleSection,FALSE);
  11149. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11150. Boolean(moduleSection,FALSE);
  11151. Boolean(moduleSection,FALSE);
  11152. Info(moduleSection, "refcnt*: LONGINT");
  11153. Longint(moduleSection,0);
  11154. Info(moduleSection, "sb*: ADDRESS");
  11155. Address(moduleSection,0);
  11156. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11157. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11158. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11159. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11160. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11161. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11162. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11163. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11164. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11165. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  11166. Info(moduleSection, "procTable*: ProcTable");
  11167. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11168. Info(moduleSection, "ptrTable*: PtrTable");
  11169. IF ~implementationVisitor.backend.cooperative THEN
  11170. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  11171. ELSE
  11172. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11173. END;
  11174. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11175. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11176. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11177. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  11178. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  11179. Info(moduleSection, "export*: ExportDesc");
  11180. ExportDesc(moduleSection);
  11181. Info(moduleSection, "term*: TerminationHandler");
  11182. Address(moduleSection,0);
  11183. Info(moduleSection, "exTable*: ExceptionTable");
  11184. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  11185. Info(moduleSection, "noProcs*: LONGINT");
  11186. Longint(moduleSection,numberProcs);
  11187. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END;
  11188. Info(moduleSection, "firstProc*: ADDRESS");
  11189. Address(moduleSection,0);
  11190. Info(moduleSection, "maxPtrs*: LONGINT");
  11191. Longint(moduleSection,maxPointers);
  11192. Info(moduleSection, "crc*: LONGINT");
  11193. Longint(moduleSection, 0); (*! must be implemented *)
  11194. Info(moduleSection, "body*: ADDRESS");
  11195. Symbol(moduleSection, bodyProc, 0,0);
  11196. IF implementationVisitor.backend.cooperative THEN
  11197. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  11198. Info(moduleSection, "monitor.owner");
  11199. Address(moduleSection,0);
  11200. Info(moduleSection, "monitor.nestingLevel");
  11201. Address(moduleSection,0);
  11202. Info(moduleSection, "monitor.blockedQueue");
  11203. Address(moduleSection,0); Address(moduleSection,0);
  11204. Info(moduleSection, "monitor.waitingQueue");
  11205. Address(moduleSection,0); Address(moduleSection,0);
  11206. Info(moduleSection, "monitor.waitingSentinel");
  11207. Address(moduleSection,0);
  11208. END;
  11209. END Module;
  11210. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  11211. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  11212. BEGIN
  11213. Array(source,pc,"");
  11214. Info(source, "pointer offsets array data");
  11215. IF scope IS SyntaxTree.RecordScope THEN
  11216. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  11217. ELSIF scope IS SyntaxTree.CellScope THEN
  11218. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  11219. ELSIF scope IS SyntaxTree.ModuleScope THEN
  11220. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  11221. WHILE variable # NIL DO
  11222. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  11223. symbol := module.allSections.FindBySymbol(variable);
  11224. ASSERT(symbol # NIL);
  11225. Pointers(0,symbol, source,variable.type,numberPointers);
  11226. END;
  11227. variable := variable.nextVariable;
  11228. END;
  11229. END;
  11230. PatchArray(source,pc,numberPointers);
  11231. END PointerArray;
  11232. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  11233. VAR
  11234. name: Basic.SegmentedName;
  11235. section: IntermediateCode.Section;
  11236. BEGIN
  11237. ASSERT(implementationVisitor.newObjectFile);
  11238. Global.GetSymbolSegmentedName(symbol,name);
  11239. Basic.AppendToSegmentedName(name,suffix);
  11240. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11241. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  11242. Info(section, "HeapBlock");
  11243. Address(section,0); (* empty such that GC does not go on traversing *)
  11244. Info(section, suffix);
  11245. Address(section,0);
  11246. pc := section.pc;
  11247. RETURN section;
  11248. END SymbolSection;
  11249. PROCEDURE ReflectVariables(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11250. VAR type: SyntaxTree.Type; variable: SyntaxTree.Variable; pc: LONGINT; section: IntermediateCode.Section;
  11251. BEGIN
  11252. ASSERT(implementationVisitor.newObjectFile);
  11253. IF ~ReflectionSupport OR simple THEN variable := NIL
  11254. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11255. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11256. IF type IS SyntaxTree.PointerType THEN
  11257. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11258. END;
  11259. IF type IS SyntaxTree.RecordType THEN
  11260. variable := type(SyntaxTree.RecordType).recordScope.firstVariable
  11261. ELSIF type IS SyntaxTree.CellType THEN
  11262. variable := type(SyntaxTree.CellType).cellScope.firstVariable;
  11263. END;
  11264. ELSIF symbol IS SyntaxTree.Procedure THEN
  11265. variable := symbol(SyntaxTree.Procedure).procedureScope.firstVariable;
  11266. END;
  11267. Info(in, "variables");
  11268. IF variable # NIL THEN
  11269. section := SymbolSection(symbol, "@Variables",pc);
  11270. VariableArray(section, variable);
  11271. Symbol(in, section, pc, 0);
  11272. ELSE
  11273. Address(in, 0);
  11274. END;
  11275. END ReflectVariables;
  11276. PROCEDURE ReflectProcedures(in: IntermediateCode.Section; symbol: SyntaxTree.Symbol);
  11277. VAR type: SyntaxTree.Type; procedure: SyntaxTree.Procedure; pc: LONGINT; section: IntermediateCode.Section;
  11278. BEGIN
  11279. ASSERT(implementationVisitor.newObjectFile);
  11280. IF ~ReflectionSupport OR simple THEN procedure := NIL
  11281. ELSIF symbol IS SyntaxTree.TypeDeclaration THEN
  11282. type := symbol(SyntaxTree.TypeDeclaration).declaredType.resolved;
  11283. IF type IS SyntaxTree.PointerType THEN
  11284. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11285. END;
  11286. IF type IS SyntaxTree.RecordType THEN
  11287. procedure := type(SyntaxTree.RecordType).recordScope.firstProcedure
  11288. ELSIF type IS SyntaxTree.CellType THEN
  11289. procedure := type(SyntaxTree.CellType).cellScope.firstProcedure;
  11290. END;
  11291. ELSIF symbol IS SyntaxTree.Procedure THEN
  11292. procedure := symbol(SyntaxTree.Procedure).procedureScope.firstProcedure;
  11293. END;
  11294. Info(in, "procedures");
  11295. IF procedure # NIL THEN
  11296. section := SymbolSection(symbol, "@Procedures",pc);
  11297. ProcedureArray(section, procedure);
  11298. Symbol(in, section, pc, 0);
  11299. ELSE
  11300. Address(in, 0);
  11301. END;
  11302. END ReflectProcedures;
  11303. PROCEDURE VariableArray(source: IntermediateCode.Section; variable: SyntaxTree.Variable);
  11304. VAR pc, offset: LONGINT; tir: Sections.Section; size: LONGINT;
  11305. segmentedName: Basic.SegmentedName;
  11306. td: SyntaxTree.TypeDeclaration;
  11307. type: SyntaxTree.Type;
  11308. BEGIN
  11309. Array(source,pc,"Modules.FieldEntry");
  11310. Info(source, "FieldArray");
  11311. size :=0;
  11312. WHILE variable # NIL DO
  11313. Info(source,"name");
  11314. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, variable.name, moduleNamePool), 0); (* reference to dynamic name *)
  11315. type := variable.type.resolved;
  11316. Info(source,"offset");
  11317. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  11318. Info(source,"type class");
  11319. IF type IS SyntaxTree.PointerType THEN
  11320. Size(source, 1);
  11321. ELSIF type IS SyntaxTree.RecordType THEN
  11322. Size(source, 2);
  11323. ELSIF type IS SyntaxTree.NumberType THEN
  11324. Size(source, 3);
  11325. ELSE
  11326. Size(source, 0);
  11327. END;
  11328. Info(source, "type desc");
  11329. IF type IS SyntaxTree.RecordType THEN
  11330. td := type(SyntaxTree.RecordType).typeDeclaration;
  11331. Global.GetSymbolSegmentedName(td,segmentedName);
  11332. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11333. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11334. ELSE
  11335. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11336. END;
  11337. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11338. Symbol(source, tir, 0, offset);
  11339. ELSE
  11340. Address(source, 0);
  11341. END;
  11342. Info(source,"flags");
  11343. Set(source, {});
  11344. variable := variable.nextVariable;
  11345. INC(size);
  11346. END;
  11347. PatchArray(source,pc,size);
  11348. END VariableArray;
  11349. PROCEDURE ProcedureArray(source: IntermediateCode.Section; procedure: SyntaxTree.Procedure);
  11350. VAR pc: LONGINT; size: LONGINT;
  11351. segmentedName: Basic.SegmentedName;
  11352. BEGIN
  11353. Array(source,pc,"Modules.ProcedureEntry");
  11354. Info(source, "ProcedureArray");
  11355. size :=0;
  11356. WHILE procedure # NIL DO
  11357. Info(source,"name");
  11358. Symbol(source, moduleNamePoolSection, DynamicName(moduleNamePoolSection, procedure.name, moduleNamePool), 0); (* reference to dynamic name *)
  11359. Global.GetSymbolSegmentedName(procedure, segmentedName);
  11360. NamedSymbol(source, segmentedName, procedure, 0 , 0);
  11361. (* size *)
  11362. Size(source, 0);
  11363. (* parameters *)
  11364. Address(source, 0);
  11365. (* variables *)
  11366. ReflectVariables(source, procedure);
  11367. ReflectProcedures(source, procedure);
  11368. (* return type entry *)
  11369. Address(source, 0);
  11370. Address(source, 0);
  11371. procedure := procedure.nextProcedure;
  11372. INC(size);
  11373. END;
  11374. PatchArray(source,pc,size);
  11375. END ProcedureArray;
  11376. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  11377. VAR recordType: SyntaxTree.RecordType;
  11378. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  11379. section: Sections.Section; cellType: SyntaxTree.CellType;
  11380. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  11381. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11382. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11383. sectionName: Basic.SectionName;
  11384. CONST MPO=-40000000H;
  11385. BEGIN
  11386. (*
  11387. TypeDesc* = POINTER TO RECORD
  11388. descSize: LONGINT;
  11389. sentinel: LONGINT; (* = MPO-4 *)
  11390. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11391. flags*: SET;
  11392. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11393. name*: Name;
  11394. END;
  11395. *)
  11396. (* source := module.sections.FindByName(...) *)
  11397. Global.GetSymbolSegmentedName(td,name);
  11398. Basic.AppendToSegmentedName(name,"@Info");
  11399. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11400. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11401. Address(source,MPO-4);
  11402. Info(source, "type tag pointer");
  11403. Symbol( source, tag, offset, 0);
  11404. Info(source, "type flags");
  11405. flags := {};
  11406. IF isProtected THEN INCL(flags,31) END;
  11407. Set( source, flags);
  11408. Info(source, "pointer to module");
  11409. moduleSection := ModuleSection();
  11410. Symbol( source, moduleSection, moduleSection.pc,0);
  11411. Info(source, "type name");
  11412. i := 0;
  11413. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  11414. (*
  11415. Global.GetSymbolSegmentedName(td,name);
  11416. Basic.SegmentedNameToString(name, sectionName);
  11417. *)
  11418. Name(source,sectionName);
  11419. source.SetReferenced(FALSE);
  11420. Global.GetSymbolSegmentedName(td,name);
  11421. Basic.AppendToSegmentedName(name,"@Fields");
  11422. ReflectVariables(source, td);
  11423. ReflectProcedures(source, td);
  11424. (*
  11425. fieldSection := VariableArray(
  11426. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11427. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11428. Info(fieldSection, "HeapBlock");
  11429. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11430. Info(fieldSection, "TypeDescriptor");
  11431. Address(fieldSection,0);
  11432. Info(source, "FieldArray ref");
  11433. Symbol(source, fieldSection, fieldSection.pc, 0);
  11434. FieldArray(fieldSection);
  11435. Global.GetSymbolSegmentedName(td,name);
  11436. Basic.AppendToSegmentedName(name,"@Procedures");
  11437. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  11438. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  11439. Info(fieldSection, "HeapBlock");
  11440. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  11441. Info(fieldSection, "TypeDescriptor");
  11442. Address(fieldSection,0);
  11443. Info(source, "Procedure Array ref");
  11444. Symbol(source, fieldSection, fieldSection.pc, 0);
  11445. ProcedureArray(fieldSection);
  11446. *)
  11447. RETURN source;
  11448. END NewTypeDescriptorInfo;
  11449. PROCEDURE NewTypeDescriptor;
  11450. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  11451. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  11452. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11453. numberPointers: LONGINT; padding, i: LONGINT;
  11454. CONST MPO=-40000000H;
  11455. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  11456. VAR i: LONGINT;
  11457. PROCEDURE Td(record: SyntaxTree.RecordType);
  11458. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  11459. BEGIN
  11460. IF record # NIL THEN
  11461. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  11462. baseTD := record.typeDeclaration;
  11463. Global.GetSymbolSegmentedName(baseTD,name);
  11464. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11465. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11466. ELSE
  11467. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11468. END;
  11469. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  11470. Symbol(source, tir, 0, offset);
  11471. IF reverse THEN Td(record.GetBaseRecord()) END;
  11472. END;
  11473. END Td;
  11474. BEGIN
  11475. Info(source, "tag table");
  11476. baseRecord := recordType;
  11477. i := 0;
  11478. WHILE baseRecord # NIL DO
  11479. INC(i);
  11480. baseRecord := baseRecord.GetBaseRecord();
  11481. END;
  11482. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11483. IF ~reverse THEN Td(recordType) END;
  11484. WHILE i < size DO
  11485. Address(source,0);
  11486. INC(i);
  11487. END;
  11488. IF reverse THEN Td(recordType) END;
  11489. END TdTable;
  11490. PROCEDURE MethodTable(reverse: BOOLEAN);
  11491. VAR i,methods: LONGINT;
  11492. BEGIN
  11493. Info(source, "method table");
  11494. IF recordType # NIL THEN
  11495. methods := recordType.recordScope.numberMethods;
  11496. IF reverse THEN
  11497. FOR i := methods-1 TO 0 BY -1 DO
  11498. procedure := recordType.recordScope.FindMethod(i);
  11499. Global.GetSymbolSegmentedName(procedure, name);
  11500. NamedSymbol(source, name,procedure, 0,0);
  11501. END;
  11502. ELSE
  11503. FOR i := 0 TO methods-1 DO
  11504. procedure := recordType.recordScope.FindMethod(i);
  11505. Global.GetSymbolSegmentedName(procedure, name);
  11506. NamedSymbol(source, name,procedure, 0,0);
  11507. END;
  11508. END;
  11509. END;
  11510. END MethodTable;
  11511. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11512. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11513. BEGIN
  11514. Info(source, "method table");
  11515. baseRecord := recordType;
  11516. WHILE baseRecord.baseType # NIL DO
  11517. baseRecord := baseRecord.GetBaseRecord ();
  11518. END;
  11519. GetRecordTypeName (baseRecord, name);
  11520. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11521. IF name = stackFrame THEN
  11522. start := 0;
  11523. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11524. baseRecord := recordType;
  11525. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11526. baseRecord := baseRecord.GetBaseRecord ();
  11527. END;
  11528. IF baseRecord # NIL THEN
  11529. GetRecordTypeName (baseRecord, name);
  11530. IF pointer & ~baseRecord.isObject THEN
  11531. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11532. END;
  11533. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11534. ELSIF recordType.isObject THEN
  11535. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11536. ELSIF pointer THEN
  11537. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11538. ELSE
  11539. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11540. END;
  11541. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11542. Symbol(source, tir, 0, 0);
  11543. start := 0;
  11544. baseRecord := recordType;
  11545. WHILE (baseRecord # NIL) DO
  11546. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11547. baseRecord := baseRecord.GetBaseRecord ();
  11548. END;
  11549. ELSE
  11550. (* explicit trace method: *)
  11551. procedure := recordType.recordScope.FindMethod(0);
  11552. IF ~procedure.isFinalizer THEN
  11553. Global.GetSymbolSegmentedName(procedure, name);
  11554. NamedSymbol(source, name,procedure, 0,0);
  11555. END;
  11556. start := 1;
  11557. END;
  11558. IF (name # stackFrame) & recordType.isObject THEN
  11559. baseRecord := recordType;
  11560. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11561. baseRecord := baseRecord.GetBaseRecord ();
  11562. END;
  11563. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11564. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11565. ELSE
  11566. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11567. END;
  11568. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11569. Symbol(source, tir, 0, 0);
  11570. END;
  11571. methods := recordType.recordScope.numberMethods;
  11572. FOR i := start TO methods-1 DO
  11573. procedure := recordType.recordScope.FindMethod(i);
  11574. IF ~procedure.isFinalizer THEN
  11575. Global.GetSymbolSegmentedName(procedure, name);
  11576. NamedSymbol(source, name,procedure, 0,0);
  11577. END;
  11578. END;
  11579. END CooperativeMethodTable;
  11580. BEGIN
  11581. Global.GetSymbolSegmentedName(td,name);
  11582. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11583. source.SetExported(IsExported(td));
  11584. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11585. IF implementationVisitor.backend.cooperative THEN
  11586. base := NIL;
  11587. baseRecord := recordType.GetBaseRecord();
  11588. IF baseRecord # NIL THEN
  11589. baseTD := baseRecord.typeDeclaration;
  11590. END;
  11591. IF ~recordType.isObject THEN
  11592. Info(source, "parent");
  11593. IF baseRecord # NIL THEN
  11594. Global.GetSymbolSegmentedName(baseTD,name);
  11595. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11596. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11597. ELSE
  11598. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11599. END;
  11600. Symbol(source, tir, 0, 0);
  11601. ELSE
  11602. Address(source,0);
  11603. END;
  11604. Info(source, "record size");
  11605. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11606. source.SetReferenced(FALSE);
  11607. CooperativeMethodTable(FALSE);
  11608. base := source;
  11609. Global.GetSymbolSegmentedName(td,name);
  11610. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11611. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11612. source.SetExported(IsExported(td));
  11613. source.SetReferenced(FALSE);
  11614. END;
  11615. Info(source, "parent");
  11616. IF baseRecord # NIL THEN
  11617. Global.GetSymbolSegmentedName(baseTD,name);
  11618. sym := baseTD;
  11619. IF ~recordType.isObject THEN
  11620. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11621. sym := NIL;
  11622. END;
  11623. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11624. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11625. ELSE
  11626. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11627. END;
  11628. Symbol(source, tir, 0, 0);
  11629. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11630. Address(source,0);
  11631. ELSE
  11632. IF recordType.isObject THEN
  11633. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11634. ELSE
  11635. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11636. END;
  11637. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11638. Symbol(source, tir, 0, 0);
  11639. END;
  11640. Info(source, "base record descriptor");
  11641. Symbol(source, base, 0, 0);
  11642. CooperativeMethodTable(TRUE);
  11643. source.SetReferenced(FALSE);
  11644. IF recordType.hasPointers THEN
  11645. IF ~HasExplicitTraceMethod (recordType) THEN
  11646. implementationVisitor.CreateTraceMethod(recordType);
  11647. END;
  11648. implementationVisitor.CreateResetProcedure(recordType);
  11649. implementationVisitor.CreateAssignProcedure(recordType);
  11650. END;
  11651. ELSIF ~simple THEN
  11652. (*
  11653. MethodEnd = MPO
  11654. ---
  11655. methods (# methods)
  11656. ---
  11657. tags (16)
  11658. ---
  11659. TypeDesc = TypeInfoAdr
  11660. ---
  11661. td adr ---> rec size
  11662. ----
  11663. pointer offsets
  11664. ----
  11665. (padding)
  11666. -----
  11667. empty [2 addresses aligned]
  11668. empty
  11669. empty
  11670. numPtrs
  11671. ---
  11672. pointer offsets
  11673. ---
  11674. *)
  11675. Info(source, "MethodEnd = MPO");
  11676. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11677. source(IntermediateCode.Section).Emit(Data(-1,op));
  11678. MethodTable(TRUE);
  11679. TdTable(TypeTags, TRUE);
  11680. Info(source, "type descriptor info pointer");
  11681. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11682. IF (cellType # NIL) THEN
  11683. IF cellType.sizeInBits < 0 THEN
  11684. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11685. END;
  11686. Info(source, "cell size");
  11687. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11688. ELSE
  11689. Info(source, "record size");
  11690. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11691. END;
  11692. Info(source, "pointer offsets pointer");
  11693. padding := 1- source.pc MOD 2;
  11694. Symbol(source, source, source.pc+1+padding,0);
  11695. IF padding >0 THEN
  11696. Info(source, "padding");
  11697. FOR i := 1 TO padding DO Address(source,0) END;
  11698. END;
  11699. IF cellType # NIL THEN
  11700. PointerArray(source, cellType.cellScope, numberPointers);
  11701. ELSE
  11702. PointerArray(source, recordType.recordScope, numberPointers);
  11703. END;
  11704. ELSE
  11705. (*
  11706. simple:
  11707. td adr --> size
  11708. tag(1)
  11709. tag(2)
  11710. tag(3)
  11711. methods ->
  11712. *)
  11713. Info(source, "record size");
  11714. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11715. TdTable(TypeTags, FALSE);
  11716. MethodTable(FALSE);
  11717. source.SetReferenced(FALSE);
  11718. END;
  11719. END NewTypeDescriptor;
  11720. BEGIN
  11721. x := x.resolved;
  11722. IF (x IS SyntaxTree.PointerType) THEN
  11723. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11724. END;
  11725. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11726. recordType := x(SyntaxTree.RecordType);
  11727. td := x.typeDeclaration;
  11728. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11729. ASSERT(td # NIL);
  11730. section := module.allSections.FindBySymbol(td); (* TODO *)
  11731. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11732. IF implementationVisitor.newObjectFile THEN
  11733. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11734. NewTypeDescriptor
  11735. END;
  11736. ELSE
  11737. (* data section in intermediate code *)
  11738. Global.GetSymbolSegmentedName(td,name);
  11739. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  11740. Basic.SuffixSegmentedName (name, module.module.name);
  11741. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11742. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11743. tir.Emit(Data(-1,op));
  11744. END;
  11745. END;
  11746. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11747. cellType := x(SyntaxTree.CellType);
  11748. td := x.typeDeclaration;
  11749. section := module.allSections.FindBySymbol(td); (* TODO *)
  11750. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11751. IF implementationVisitor.newObjectFile THEN
  11752. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11753. NewTypeDescriptor
  11754. END;
  11755. END;
  11756. END;
  11757. END
  11758. END CheckTypeDeclaration
  11759. END MetaDataGenerator;
  11760. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11761. VAR
  11762. trace-: BOOLEAN;
  11763. traceString-: SyntaxTree.IdentifierString;
  11764. traceModuleName-: SyntaxTree.IdentifierString;
  11765. newObjectFile-: BOOLEAN;
  11766. profile-: BOOLEAN;
  11767. noRuntimeChecks: BOOLEAN;
  11768. simpleMetaData-: BOOLEAN;
  11769. noAsserts: BOOLEAN;
  11770. optimize-: BOOLEAN;
  11771. cooperative-: BOOLEAN;
  11772. preregisterStatic-: BOOLEAN;
  11773. dump-: Basic.Writer;
  11774. cellsAreObjects: BOOLEAN;
  11775. PROCEDURE &InitIntermediateBackend*;
  11776. BEGIN
  11777. simpleMetaData := FALSE;
  11778. newObjectFile := FALSE;
  11779. InitBackend;
  11780. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11781. SetTraceModuleName(DefaultTraceModuleName);
  11782. END InitIntermediateBackend;
  11783. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11784. VAR
  11785. declarationVisitor: DeclarationVisitor;
  11786. implementationVisitor: ImplementationVisitor;
  11787. module: Sections.Module;
  11788. name, platformName: SyntaxTree.IdentifierString;
  11789. meta: MetaDataGenerator;
  11790. BEGIN
  11791. ResetError;
  11792. Global.GetSymbolName(x,name);
  11793. NEW(module,x,system); (* backend structures *)
  11794. Global.GetModuleName(x, name);
  11795. module.SetModuleName(name);
  11796. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11797. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11798. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11799. declarationVisitor.Module(x,module);
  11800. IF newObjectFile & ~meta.simple THEN
  11801. meta.Module(implementationVisitor.moduleBodySection);
  11802. END;
  11803. GetDescription(platformName);
  11804. module.SetPlatformName(platformName);
  11805. RETURN module
  11806. END GenerateIntermediate;
  11807. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11808. BEGIN RETURN TRUE
  11809. END SupportedImmediate;
  11810. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11811. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11812. END ProcessSyntaxTreeModule;
  11813. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11814. VAR
  11815. result: Sections.Module;
  11816. traceName: Basic.MessageString;
  11817. BEGIN
  11818. ASSERT(intermediateCodeModule IS Sections.Module);
  11819. result := intermediateCodeModule(Sections.Module);
  11820. IF trace THEN
  11821. traceName := "intermediate code trace: ";
  11822. Strings.Append(traceName,traceString);
  11823. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11824. IF (traceString="") OR (traceString="*") THEN
  11825. result.Dump(dump);
  11826. dump.Update
  11827. ELSE
  11828. Sections.DumpFiltered(dump, result, traceString);
  11829. END
  11830. END;
  11831. RETURN result
  11832. END ProcessIntermediateCodeModule;
  11833. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11834. BEGIN instructionSet := "Intermediate";
  11835. END GetDescription;
  11836. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11837. BEGIN
  11838. SELF.newObjectFile := newObjectFile;
  11839. SELF.simpleMetaData := simpleMetaData;
  11840. END SetNewObjectFile;
  11841. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11842. BEGIN COPY(name, traceModuleName)
  11843. END SetTraceModuleName;
  11844. PROCEDURE DefineOptions(options: Options.Options);
  11845. BEGIN
  11846. DefineOptions^(options);
  11847. options.Add(0X,"trace",Options.String);
  11848. options.Add(0X,"runtime",Options.String);
  11849. options.Add(0X,"newObjectFile",Options.Flag);
  11850. options.Add(0X,"traceModule",Options.String);
  11851. options.Add(0X,"profile",Options.Flag);
  11852. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11853. options.Add(0X,"noAsserts",Options.Flag);
  11854. options.Add(0X,"metaData",Options.String);
  11855. options.Add('o',"optimize", Options.Flag);
  11856. options.Add(0X,"preregisterStatic", Options.Flag);
  11857. options.Add(0X,"cellsAreObjects", Options.Flag);
  11858. END DefineOptions;
  11859. PROCEDURE GetOptions(options: Options.Options);
  11860. VAR name,string: SyntaxTree.IdentifierString;
  11861. BEGIN
  11862. GetOptions^(options);
  11863. trace := options.GetString("trace",traceString);
  11864. profile := options.GetFlag("profile");
  11865. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11866. noAsserts := options.GetFlag("noAsserts");
  11867. cooperative := options.GetFlag("cooperative");
  11868. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11869. IF cooperative THEN
  11870. SetRuntimeModuleName("CPU") END
  11871. END;
  11872. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11873. simpleMetaData := TRUE
  11874. END;
  11875. IF options.GetString("metaData",string) THEN
  11876. IF string = "simple" THEN simpleMetaData := TRUE
  11877. ELSIF string ="full" THEN simpleMetaData := FALSE
  11878. END;
  11879. END;
  11880. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11881. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11882. optimize := options.GetFlag("optimize");
  11883. preregisterStatic := options.GetFlag("preregisterStatic");
  11884. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11885. END GetOptions;
  11886. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11887. BEGIN RETURN SymbolFileFormat.Get()
  11888. END DefaultSymbolFileFormat;
  11889. END IntermediateBackend;
  11890. (* ----------------------------------- register allocation ------------------------------------- *)
  11891. (* register mapping scheme
  11892. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11893. spill offset
  11894. part(n) --> ticket <--> physical register
  11895. spill offset
  11896. *)
  11897. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11898. emptyOperand: IntermediateCode.Operand;
  11899. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11900. statCoopResetVariables: LONGINT;
  11901. statCoopModifyAssignments: LONGINT;
  11902. modifyAssignmentsPC : LONGINT;
  11903. statCoopNilCheck: LONGINT;
  11904. statCoopSwitch: LONGINT;
  11905. statCoopAssignProcedure: LONGINT;
  11906. statCoopTraceMethod: LONGINT;
  11907. statCoopResetProcedure: LONGINT;
  11908. statCoopTraceModule: LONGINT;
  11909. PROCEDURE ResetStatistics*;
  11910. BEGIN
  11911. statCoopResetVariables := 0;
  11912. statCoopModifyAssignments := 0;
  11913. statCoopNilCheck:= 0;
  11914. statCoopSwitch:= 0;
  11915. statCoopAssignProcedure:= 0;
  11916. statCoopTraceMethod:= 0;
  11917. statCoopResetProcedure:= 0;
  11918. statCoopTraceModule:= 0;
  11919. END ResetStatistics;
  11920. PROCEDURE Statistics*;
  11921. BEGIN
  11922. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11923. TRACE(statCoopNilCheck, statCoopSwitch);
  11924. TRACE(statCoopAssignProcedure,
  11925. statCoopTraceMethod,
  11926. statCoopResetProcedure,
  11927. statCoopTraceModule)
  11928. END Statistics;
  11929. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  11930. VAR h: LONGINT;
  11931. BEGIN
  11932. WHILE b # 0 DO
  11933. h := a MOD b;
  11934. a := b;
  11935. b := h;
  11936. END;
  11937. RETURN a
  11938. END GCD;
  11939. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  11940. BEGIN
  11941. RETURN a*b DIV GCD(a,b)
  11942. END SCM;
  11943. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  11944. BEGIN
  11945. (*TRACE(a,b);*)
  11946. IF a = 0 THEN RETURN b
  11947. ELSIF b = 0 THEN RETURN a
  11948. ELSE RETURN SCM(a,b)
  11949. END;
  11950. END CommonAlignment;
  11951. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11952. BEGIN
  11953. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11954. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11955. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  11956. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11957. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  11958. END
  11959. END PassBySingleReference;
  11960. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11961. BEGIN
  11962. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11963. END PassInRegister;
  11964. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11965. VAR new: RegisterEntry;
  11966. BEGIN
  11967. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11968. IF queue = NIL THEN
  11969. queue := new
  11970. ELSE
  11971. new.next := queue;
  11972. IF queue#NIL THEN queue.prev := new END;
  11973. queue := new
  11974. END;
  11975. END AddRegisterEntry;
  11976. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11977. VAR this: RegisterEntry;
  11978. BEGIN
  11979. this := queue;
  11980. WHILE (this # NIL) & (this.register # register) DO
  11981. this := this.next;
  11982. END;
  11983. IF this = NIL THEN
  11984. RETURN FALSE
  11985. END;
  11986. ASSERT(this # NIL);
  11987. IF this = queue THEN queue := queue.next END;
  11988. IF this.prev # NIL THEN this.prev.next := this.next END;
  11989. IF this.next # NIL THEN this.next.prev := this.prev END;
  11990. RETURN TRUE
  11991. END RemoveRegisterEntry;
  11992. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  11993. BEGIN ASSERT(cond);
  11994. END Assert;
  11995. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  11996. BEGIN
  11997. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  11998. END ReusableRegister;
  11999. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12000. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12001. BEGIN
  12002. procedure := moduleScope.bodyProcedure;
  12003. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12004. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12005. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  12006. procedure.SetScope(moduleScope);
  12007. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  12008. procedure.SetAccess(SyntaxTree.Hidden);
  12009. moduleScope.SetBodyProcedure(procedure);
  12010. moduleScope.AddProcedure(procedure);
  12011. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  12012. END;
  12013. END EnsureBodyProcedure;
  12014. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12015. VAR import: SyntaxTree.Import;
  12016. selfName: SyntaxTree.IdentifierString;
  12017. module: SyntaxTree.Module;
  12018. BEGIN
  12019. scope.ownerModule.GetName(selfName);
  12020. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12021. module := scope.ownerModule
  12022. ELSE
  12023. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12024. IF import = NIL THEN
  12025. RETURN NIL
  12026. ELSIF import.module = NIL THEN
  12027. RETURN NIL
  12028. ELSE module := import.module
  12029. END;
  12030. END;
  12031. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12032. END GetSymbol;
  12033. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12034. BEGIN
  12035. op.mode := mode;
  12036. IntermediateCode.InitOperand(op.op);
  12037. IntermediateCode.InitOperand(op.tag);
  12038. IntermediateCode.InitOperand(op.extra);
  12039. op.dimOffset := 0;
  12040. END InitOperand;
  12041. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12042. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12043. BEGIN RETURN IntermediateCode.GetType(system, type)
  12044. END GetType;
  12045. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12046. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12047. BEGIN
  12048. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12049. (*
  12050. UniqueId(name,module,name,adr);
  12051. *)
  12052. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  12053. constant.SetValue(value);
  12054. module.moduleScope.AddConstant(constant);
  12055. constant.SetScope(module.moduleScope);
  12056. RETURN constant
  12057. END BuildConstant;
  12058. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12059. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12060. BEGIN
  12061. variable := scope.firstVariable;
  12062. WHILE variable # NIL DO
  12063. IF variable.NeedsTrace() THEN
  12064. RETURN TRUE;
  12065. END;
  12066. variable := variable.nextVariable;
  12067. END;
  12068. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12069. WHILE parameter # NIL DO
  12070. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12071. RETURN TRUE;
  12072. END;
  12073. parameter := parameter.nextParameter;
  12074. END;
  12075. RETURN FALSE;
  12076. END HasPointers;
  12077. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12078. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  12079. END IsVariableParameter;
  12080. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12081. VAR parameter: SyntaxTree.Parameter;
  12082. BEGIN
  12083. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12084. WHILE parameter # NIL DO
  12085. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12086. IF parameter.movable THEN RETURN TRUE END;
  12087. parameter := parameter.nextParameter;
  12088. END;
  12089. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12090. END HasVariableParameters;
  12091. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12092. BEGIN
  12093. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12094. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12095. END HasExplicitTraceMethod;
  12096. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12097. BEGIN
  12098. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12099. IF (expression IS SyntaxTree.IntegerValue) THEN
  12100. val := expression(SyntaxTree.IntegerValue).value;
  12101. RETURN TRUE
  12102. ELSE
  12103. RETURN FALSE
  12104. END;
  12105. END IsIntegerConstant;
  12106. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12107. BEGIN
  12108. IF val <= 0 THEN RETURN FALSE END;
  12109. exp := 0;
  12110. WHILE ~ODD(val) DO
  12111. val := val DIV 2;
  12112. INC(exp)
  12113. END;
  12114. RETURN val = 1
  12115. END PowerOf2;
  12116. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12117. VAR procedure: SyntaxTree.Procedure;
  12118. BEGIN
  12119. procedure := record.recordScope.constructor;
  12120. IF procedure = NIL THEN
  12121. record := record.GetBaseRecord();
  12122. IF record # NIL THEN
  12123. procedure := GetConstructor(record)
  12124. END;
  12125. END;
  12126. RETURN procedure;
  12127. END GetConstructor;
  12128. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12129. BEGIN
  12130. value := SHORT(op.intValue);
  12131. RETURN op.mode = IntermediateCode.ModeImmediate;
  12132. END IsIntegerImmediate;
  12133. (** whether a type strictily is a pointer to record or object type
  12134. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12135. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12136. BEGIN
  12137. IF type = NIL THEN
  12138. RETURN FALSE
  12139. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12140. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12141. ELSE
  12142. RETURN FALSE
  12143. END
  12144. END IsStrictlyPointerToRecord;
  12145. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12146. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12147. END IsUnsafePointer;
  12148. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12149. BEGIN type := type.resolved;
  12150. IF type IS SyntaxTree.PointerType THEN
  12151. type := type(SyntaxTree.PointerType).pointerBase;
  12152. type := type.resolved;
  12153. IF type IS SyntaxTree.RecordType THEN
  12154. recordType := type(SyntaxTree.RecordType);
  12155. RETURN TRUE
  12156. ELSE
  12157. RETURN FALSE
  12158. END
  12159. ELSIF type IS SyntaxTree.RecordType THEN
  12160. recordType := type(SyntaxTree.RecordType);
  12161. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12162. ELSIF type IS SyntaxTree.ObjectType THEN
  12163. RETURN TRUE
  12164. ELSIF type IS SyntaxTree.AnyType THEN
  12165. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12166. ELSE
  12167. RETURN FALSE
  12168. END;
  12169. END IsPointerToRecord;
  12170. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12171. BEGIN
  12172. type := type.resolved;
  12173. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12174. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12175. END IsArrayOfSystemByte;
  12176. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12177. BEGIN
  12178. IF type = NIL THEN RETURN FALSE END;
  12179. type := type.resolved;
  12180. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12181. END IsOpenArray;
  12182. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12183. BEGIN
  12184. IF type = NIL THEN RETURN FALSE END;
  12185. type := type.resolved;
  12186. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12187. END IsSemiDynamicArray;
  12188. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12189. BEGIN
  12190. IF type = NIL THEN RETURN FALSE END;
  12191. type := type.resolved;
  12192. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12193. END IsStaticArray;
  12194. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12195. VAR size: LONGINT;
  12196. BEGIN
  12197. size := 1;
  12198. WHILE (IsStaticArray(type)) DO
  12199. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12200. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12201. END;
  12202. RETURN size;
  12203. END StaticArrayNumElements;
  12204. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12205. BEGIN
  12206. WHILE (IsStaticArray(type)) DO
  12207. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12208. END;
  12209. RETURN type;
  12210. END StaticArrayBaseType;
  12211. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12212. BEGIN
  12213. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12214. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12215. END;
  12216. RETURN type;
  12217. END ArrayBaseType;
  12218. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12219. BEGIN
  12220. IF type = NIL THEN RETURN FALSE END;
  12221. type := type.resolved;
  12222. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12223. END IsDelegate;
  12224. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12225. VAR i: LONGINT;
  12226. BEGIN
  12227. i := 0; type := type.resolved;
  12228. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12229. INC(i);
  12230. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12231. END;
  12232. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12233. INC(i);
  12234. type := type(SyntaxTree.MathArrayType).arrayBase;
  12235. IF type # NIL THEN type := type.resolved END;
  12236. END;
  12237. RETURN i
  12238. END DynamicDim;
  12239. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  12240. BEGIN
  12241. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12242. type := type(SyntaxTree.ArrayType).arrayBase;
  12243. END;
  12244. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12245. type := type(SyntaxTree.MathArrayType).arrayBase;
  12246. END;
  12247. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  12248. END StaticSize;
  12249. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  12250. BEGIN
  12251. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  12252. END IsImmediate;
  12253. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  12254. BEGIN
  12255. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  12256. END IsAddress;
  12257. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  12258. BEGIN
  12259. RETURN (x.mode = IntermediateCode.ModeRegister);
  12260. END IsRegister;
  12261. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  12262. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  12263. BEGIN
  12264. typeDeclaration := recordType.typeDeclaration;
  12265. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12266. Global.GetSymbolSegmentedName(typeDeclaration,name);
  12267. END GetRecordTypeName;
  12268. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  12269. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  12270. BEGIN
  12271. parSize := 0;
  12272. IF StructuredReturnType(procedureType) THEN
  12273. parameter := procedureType.returnParameter;
  12274. INC(parSize,system.SizeOfParameter(parameter));
  12275. parSize := parSize + (-parSize) MOD system.addressSize;
  12276. END;
  12277. parameter :=procedureType.lastParameter;
  12278. WHILE (parameter # NIL) DO
  12279. INC(parSize,system.SizeOfParameter(parameter));
  12280. parSize := parSize + (-parSize) MOD system.addressSize;
  12281. parameter := parameter.prevParameter;
  12282. END;
  12283. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  12284. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  12285. RETURN ToMemoryUnits(system,parSize)
  12286. END ParametersSize;
  12287. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  12288. BEGIN
  12289. IF type = NIL THEN RETURN FALSE
  12290. ELSE
  12291. type := type.resolved;
  12292. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  12293. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  12294. END
  12295. END ReturnedAsParameter;
  12296. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  12297. BEGIN
  12298. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  12299. END StructuredReturnType;
  12300. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  12301. BEGIN
  12302. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  12303. END IsNested;
  12304. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  12305. BEGIN
  12306. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  12307. scope := scope.outerScope;
  12308. END;
  12309. RETURN scope # NIL;
  12310. END InCellScope;
  12311. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  12312. BEGIN
  12313. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  12314. RETURN 0
  12315. ELSE
  12316. *)
  12317. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  12318. (*END;*)
  12319. END ProcedureParametersSize;
  12320. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  12321. VAR dataUnit: LONGINT;
  12322. BEGIN dataUnit := system.dataUnit;
  12323. ASSERT(size MOD system.dataUnit = 0);
  12324. RETURN size DIV system.dataUnit
  12325. END ToMemoryUnits;
  12326. PROCEDURE Get*(): Backend.Backend;
  12327. VAR backend: IntermediateBackend;
  12328. BEGIN NEW(backend); RETURN backend
  12329. END Get;
  12330. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  12331. VAR instruction: IntermediateCode.Instruction;
  12332. BEGIN
  12333. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  12334. RETURN instruction
  12335. END Nop;
  12336. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12337. VAR instruction: IntermediateCode.Instruction;
  12338. BEGIN
  12339. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  12340. RETURN instruction
  12341. END Mov;
  12342. (* like Mov but ensures that no new register will be allocated for dest *)
  12343. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12344. VAR instruction: IntermediateCode.Instruction;
  12345. BEGIN
  12346. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  12347. RETURN instruction
  12348. END MovReplace;
  12349. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12350. VAR instruction: IntermediateCode.Instruction;
  12351. BEGIN
  12352. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  12353. RETURN instruction
  12354. END Conv;
  12355. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  12356. BEGIN
  12357. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  12358. END SysvABI;
  12359. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  12360. BEGIN
  12361. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  12362. END SysvABIorWINAPI;
  12363. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  12364. VAR instruction: IntermediateCode.Instruction;
  12365. BEGIN
  12366. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  12367. RETURN instruction
  12368. END Call;
  12369. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  12370. VAR op1, op2: IntermediateCode.Operand;
  12371. VAR instruction: IntermediateCode.Instruction;
  12372. BEGIN
  12373. IntermediateCode.InitNumber(op1,pcOffset);
  12374. IntermediateCode.InitNumber(op2,callingConvention);
  12375. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  12376. RETURN instruction
  12377. END Exit;
  12378. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12379. VAR instruction: IntermediateCode.Instruction;
  12380. BEGIN
  12381. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  12382. RETURN instruction
  12383. END Return;
  12384. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  12385. VAR instruction: IntermediateCode.Instruction;
  12386. BEGIN
  12387. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  12388. RETURN instruction
  12389. END Result;
  12390. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  12391. VAR op1: IntermediateCode.Operand;
  12392. VAR instruction: IntermediateCode.Instruction;
  12393. BEGIN
  12394. IntermediateCode.InitNumber(op1,nr);
  12395. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  12396. RETURN instruction
  12397. END Trap;
  12398. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  12399. VAR instruction: IntermediateCode.Instruction;
  12400. BEGIN
  12401. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  12402. RETURN instruction
  12403. END Br;
  12404. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12405. VAR instruction: IntermediateCode.Instruction;
  12406. BEGIN
  12407. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  12408. RETURN instruction
  12409. END Breq;
  12410. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12411. VAR instruction: IntermediateCode.Instruction;
  12412. BEGIN
  12413. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  12414. RETURN instruction
  12415. END Brne;
  12416. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12417. VAR instruction: IntermediateCode.Instruction;
  12418. BEGIN
  12419. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  12420. RETURN instruction
  12421. END Brge;
  12422. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12423. VAR instruction: IntermediateCode.Instruction;
  12424. BEGIN
  12425. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  12426. RETURN instruction
  12427. END Brlt;
  12428. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  12429. VAR instruction: IntermediateCode.Instruction;
  12430. BEGIN
  12431. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  12432. RETURN instruction
  12433. END Pop;
  12434. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12435. VAR instruction: IntermediateCode.Instruction;
  12436. BEGIN
  12437. ASSERT(op.mode # IntermediateCode.Undefined);
  12438. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  12439. RETURN instruction
  12440. END Push;
  12441. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12442. VAR instruction: IntermediateCode.Instruction;
  12443. BEGIN
  12444. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  12445. RETURN instruction
  12446. END Neg;
  12447. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12448. VAR instruction: IntermediateCode.Instruction;
  12449. BEGIN
  12450. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  12451. RETURN instruction
  12452. END Not;
  12453. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  12454. VAR instruction: IntermediateCode.Instruction;
  12455. BEGIN
  12456. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  12457. RETURN instruction
  12458. END Abs;
  12459. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12460. VAR instruction: IntermediateCode.Instruction;
  12461. BEGIN
  12462. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  12463. RETURN instruction
  12464. END Mul;
  12465. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12466. VAR instruction: IntermediateCode.Instruction;
  12467. BEGIN
  12468. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  12469. RETURN instruction
  12470. END Div;
  12471. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12472. VAR instruction: IntermediateCode.Instruction;
  12473. BEGIN
  12474. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  12475. RETURN instruction
  12476. END Mod;
  12477. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12478. VAR instruction: IntermediateCode.Instruction;
  12479. BEGIN
  12480. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  12481. RETURN instruction
  12482. END Sub;
  12483. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12484. VAR instruction: IntermediateCode.Instruction;
  12485. BEGIN
  12486. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  12487. RETURN instruction
  12488. END Add;
  12489. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12490. VAR instruction: IntermediateCode.Instruction;
  12491. BEGIN
  12492. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  12493. RETURN instruction
  12494. END And;
  12495. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12496. VAR instruction: IntermediateCode.Instruction;
  12497. BEGIN
  12498. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12499. RETURN instruction
  12500. END Or;
  12501. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12502. VAR instruction: IntermediateCode.Instruction;
  12503. BEGIN
  12504. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12505. RETURN instruction
  12506. END Xor;
  12507. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12508. VAR instruction: IntermediateCode.Instruction;
  12509. BEGIN
  12510. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12511. RETURN instruction
  12512. END Shl;
  12513. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12514. VAR instruction: IntermediateCode.Instruction;
  12515. BEGIN
  12516. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12517. RETURN instruction
  12518. END Shr;
  12519. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12520. VAR instruction: IntermediateCode.Instruction;
  12521. BEGIN
  12522. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12523. RETURN instruction
  12524. END Rol;
  12525. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12526. VAR instruction: IntermediateCode.Instruction;
  12527. BEGIN
  12528. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12529. RETURN instruction
  12530. END Ror;
  12531. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12532. VAR instruction: IntermediateCode.Instruction;
  12533. BEGIN
  12534. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12535. RETURN instruction
  12536. END Cas;
  12537. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12538. VAR instruction: IntermediateCode.Instruction;
  12539. BEGIN
  12540. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12541. RETURN instruction
  12542. END Copy;
  12543. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12544. VAR instruction: IntermediateCode.Instruction;
  12545. BEGIN
  12546. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12547. RETURN instruction
  12548. END Fill;
  12549. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12550. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12551. BEGIN
  12552. string := IntermediateCode.String(s);
  12553. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12554. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12555. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12556. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12557. RETURN instruction
  12558. END Asm;
  12559. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12560. VAR instruction: IntermediateCode.Instruction;
  12561. BEGIN
  12562. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12563. RETURN instruction
  12564. END Data;
  12565. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12566. VAR instruction: IntermediateCode.Instruction;
  12567. BEGIN
  12568. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12569. IntermediateCode.SetSubType(instruction, subtype);
  12570. RETURN instruction
  12571. END SpecialInstruction;
  12572. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12573. VAR op1: IntermediateCode.Operand;
  12574. VAR instruction: IntermediateCode.Instruction;
  12575. BEGIN
  12576. (*! generate a warning if size exceeds a certain limit *)
  12577. (*
  12578. ASSERT(bytes < 1000000); (* sanity check *)
  12579. *)
  12580. ASSERT(0 <= units); (* sanity check *)
  12581. IntermediateCode.InitNumber(op1,units);
  12582. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12583. RETURN instruction
  12584. END Reserve;
  12585. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12586. VAR op1: IntermediateCode.Operand;
  12587. VAR instruction: IntermediateCode.Instruction;
  12588. BEGIN
  12589. IntermediateCode.InitNumber(op1,position);
  12590. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12591. RETURN instruction
  12592. END LabelInstruction;
  12593. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12594. VAR pc: LONGINT;
  12595. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12596. BEGIN
  12597. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12598. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12599. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12600. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12601. IF instr.op1.type.form = IntermediateCode.Float THEN
  12602. RETURN instr.op1.floatValue = op.floatValue
  12603. ELSE
  12604. RETURN instr.op1.intValue = op.intValue
  12605. END;
  12606. END ProvidesValue;
  12607. BEGIN
  12608. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12609. pc := 0;
  12610. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12611. INC(pc);
  12612. END;
  12613. IF pc = data.pc THEN
  12614. data.Emit(Data(-1,vop));
  12615. END;
  12616. RETURN pc
  12617. END EnterImmediate;
  12618. PROCEDURE Init;
  12619. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12620. BEGIN
  12621. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12622. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12623. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12624. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12625. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12626. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12627. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12628. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12629. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12630. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12631. IntermediateCode.InitOperand(emptyOperand);
  12632. FOR i := 0 TO NumberSystemCalls-1 DO
  12633. name := "@SystemCall";
  12634. Basic.AppendNumber(name,i);
  12635. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12636. END;
  12637. END Init;
  12638. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12639. BEGIN
  12640. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12641. END IsExported;
  12642. BEGIN
  12643. Init;
  12644. END FoxIntermediateBackend.
  12645. Compiler.Compile FoxIntermediateBackend.Mod ~