FoxIntermediateBackend.Mod 520 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772107731077410775107761077710778107791078010781107821078310784107851078610787107881078910790107911079210793107941079510796107971079810799108001080110802108031080410805108061080710808108091081010811108121081310814108151081610817108181081910820108211082210823108241082510826108271082810829108301083110832108331083410835108361083710838108391084010841108421084310844108451084610847108481084910850108511085210853108541085510856108571085810859108601086110862108631086410865108661086710868108691087010871108721087310874108751087610877108781087910880108811088210883108841088510886108871088810889108901089110892108931089410895108961089710898108991090010901109021090310904109051090610907109081090910910109111091210913109141091510916109171091810919109201092110922109231092410925109261092710928109291093010931109321093310934109351093610937109381093910940109411094210943109441094510946109471094810949109501095110952109531095410955109561095710958109591096010961109621096310964109651096610967109681096910970109711097210973109741097510976109771097810979109801098110982109831098410985109861098710988109891099010991109921099310994109951099610997109981099911000110011100211003110041100511006110071100811009110101101111012110131101411015110161101711018110191102011021110221102311024110251102611027110281102911030110311103211033110341103511036110371103811039110401104111042110431104411045110461104711048110491105011051110521105311054110551105611057110581105911060110611106211063110641106511066110671106811069110701107111072110731107411075110761107711078110791108011081110821108311084110851108611087110881108911090110911109211093110941109511096110971109811099111001110111102111031110411105111061110711108111091111011111111121111311114111151111611117111181111911120111211112211123111241112511126111271112811129111301113111132111331113411135111361113711138111391114011141111421114311144111451114611147111481114911150111511115211153111541115511156111571115811159111601116111162111631116411165111661116711168111691117011171111721117311174111751117611177111781117911180111811118211183111841118511186111871118811189111901119111192111931119411195111961119711198111991120011201112021120311204112051120611207112081120911210112111121211213112141121511216112171121811219112201122111222112231122411225112261122711228112291123011231112321123311234112351123611237112381123911240112411124211243112441124511246112471124811249112501125111252112531125411255112561125711258112591126011261112621126311264112651126611267112681126911270112711127211273112741127511276112771127811279112801128111282112831128411285112861128711288112891129011291112921129311294112951129611297112981129911300113011130211303113041130511306113071130811309113101131111312113131131411315113161131711318113191132011321113221132311324113251132611327113281132911330113311133211333113341133511336113371133811339113401134111342113431134411345113461134711348113491135011351113521135311354113551135611357113581135911360113611136211363113641136511366113671136811369113701137111372113731137411375113761137711378113791138011381113821138311384113851138611387113881138911390113911139211393113941139511396113971139811399114001140111402114031140411405114061140711408114091141011411114121141311414114151141611417114181141911420114211142211423114241142511426114271142811429114301143111432114331143411435114361143711438114391144011441114421144311444114451144611447114481144911450114511145211453114541145511456114571145811459114601146111462114631146411465114661146711468114691147011471114721147311474114751147611477114781147911480114811148211483114841148511486114871148811489114901149111492114931149411495114961149711498114991150011501115021150311504115051150611507115081150911510115111151211513115141151511516115171151811519115201152111522115231152411525115261152711528115291153011531115321153311534115351153611537115381153911540115411154211543115441154511546115471154811549115501155111552115531155411555115561155711558115591156011561115621156311564115651156611567115681156911570115711157211573115741157511576115771157811579115801158111582115831158411585115861158711588115891159011591115921159311594115951159611597115981159911600116011160211603116041160511606116071160811609116101161111612116131161411615116161161711618116191162011621116221162311624116251162611627116281162911630116311163211633116341163511636116371163811639116401164111642116431164411645116461164711648116491165011651116521165311654116551165611657116581165911660116611166211663116641166511666116671166811669116701167111672116731167411675116761167711678116791168011681116821168311684116851168611687116881168911690116911169211693116941169511696116971169811699117001170111702117031170411705117061170711708117091171011711117121171311714117151171611717117181171911720117211172211723117241172511726117271172811729117301173111732117331173411735117361173711738117391174011741117421174311744117451174611747117481174911750117511175211753117541175511756117571175811759117601176111762117631176411765117661176711768117691177011771117721177311774117751177611777117781177911780117811178211783117841178511786117871178811789117901179111792117931179411795117961179711798117991180011801118021180311804118051180611807118081180911810118111181211813118141181511816118171181811819118201182111822118231182411825118261182711828118291183011831118321183311834118351183611837118381183911840118411184211843118441184511846118471184811849118501185111852118531185411855118561185711858118591186011861118621186311864118651186611867118681186911870118711187211873118741187511876118771187811879118801188111882118831188411885118861188711888118891189011891118921189311894118951189611897118981189911900119011190211903119041190511906119071190811909119101191111912119131191411915119161191711918119191192011921119221192311924119251192611927119281192911930119311193211933119341193511936119371193811939119401194111942119431194411945119461194711948119491195011951119521195311954119551195611957119581195911960119611196211963119641196511966119671196811969119701197111972119731197411975119761197711978119791198011981119821198311984119851198611987119881198911990119911199211993119941199511996119971199811999120001200112002120031200412005120061200712008120091201012011120121201312014120151201612017120181201912020120211202212023120241202512026120271202812029120301203112032120331203412035120361203712038120391204012041120421204312044120451204612047120481204912050120511205212053120541205512056120571205812059120601206112062120631206412065120661206712068120691207012071120721207312074120751207612077120781207912080120811208212083120841208512086120871208812089120901209112092120931209412095120961209712098120991210012101121021210312104121051210612107121081210912110121111211212113121141211512116121171211812119121201212112122121231212412125121261212712128121291213012131121321213312134121351213612137121381213912140121411214212143121441214512146121471214812149121501215112152121531215412155121561215712158121591216012161121621216312164121651216612167121681216912170121711217212173121741217512176121771217812179121801218112182121831218412185121861218712188121891219012191121921219312194121951219612197121981219912200122011220212203122041220512206122071220812209122101221112212122131221412215122161221712218122191222012221122221222312224122251222612227122281222912230122311223212233122341223512236122371223812239122401224112242122431224412245122461224712248122491225012251122521225312254122551225612257122581225912260122611226212263122641226512266122671226812269122701227112272122731227412275122761227712278122791228012281122821228312284122851228612287122881228912290122911229212293122941229512296122971229812299123001230112302123031230412305123061230712308123091231012311123121231312314123151231612317123181231912320123211232212323123241232512326123271232812329123301233112332123331233412335123361233712338123391234012341123421234312344123451234612347123481234912350123511235212353123541235512356123571235812359123601236112362123631236412365123661236712368123691237012371123721237312374123751237612377123781237912380123811238212383123841238512386123871238812389123901239112392123931239412395123961239712398123991240012401124021240312404124051240612407124081240912410124111241212413124141241512416124171241812419124201242112422124231242412425124261242712428124291243012431124321243312434124351243612437124381243912440124411244212443124441244512446124471244812449124501245112452124531245412455124561245712458124591246012461124621246312464124651246612467124681246912470124711247212473124741247512476124771247812479124801248112482124831248412485124861248712488124891249012491124921249312494124951249612497124981249912500125011250212503125041250512506125071250812509125101251112512125131251412515125161251712518125191252012521125221252312524125251252612527125281252912530125311253212533125341253512536125371253812539125401254112542125431254412545125461254712548125491255012551125521255312554125551255612557125581255912560125611256212563125641256512566125671256812569125701257112572125731257412575125761257712578125791258012581125821258312584125851258612587125881258912590125911259212593125941259512596125971259812599126001260112602126031260412605126061260712608126091261012611126121261312614126151261612617126181261912620126211262212623126241262512626126271262812629126301263112632126331263412635126361263712638126391264012641126421264312644126451264612647126481264912650126511265212653126541265512656126571265812659126601266112662126631266412665126661266712668126691267012671126721267312674126751267612677126781267912680126811268212683126841268512686126871268812689126901269112692126931269412695126961269712698126991270012701127021270312704127051270612707127081270912710127111271212713127141271512716127171271812719127201272112722127231272412725127261272712728127291273012731127321273312734127351273612737127381273912740127411274212743127441274512746127471274812749127501275112752127531275412755127561275712758127591276012761127621276312764127651276612767127681276912770127711277212773127741277512776127771277812779127801278112782127831278412785127861278712788127891279012791127921279312794127951279612797127981279912800128011280212803128041280512806128071280812809128101281112812128131281412815128161281712818128191282012821128221282312824128251282612827128281282912830128311283212833128341283512836128371283812839128401284112842128431284412845128461284712848128491285012851128521285312854128551285612857128581285912860128611286212863128641286512866128671286812869128701287112872128731287412875128761287712878128791288012881128821288312884128851288612887128881288912890128911289212893128941289512896128971289812899129001290112902129031290412905129061290712908129091291012911129121291312914129151291612917129181291912920129211292212923129241292512926129271292812929129301293112932129331293412935129361293712938129391294012941129421294312944129451294612947129481294912950129511295212953129541295512956129571295812959129601296112962129631296412965129661296712968129691297012971129721297312974129751297612977129781297912980129811298212983129841298512986129871298812989129901299112992129931299412995129961299712998129991300013001130021300313004130051300613007130081300913010130111301213013130141301513016130171301813019130201302113022130231302413025130261302713028130291303013031130321303313034130351303613037130381303913040130411304213043130441304513046130471304813049130501305113052130531305413055130561305713058130591306013061130621306313064130651306613067130681306913070130711307213073130741307513076130771307813079130801308113082130831308413085130861308713088130891309013091130921309313094130951309613097130981309913100131011310213103131041310513106131071310813109131101311113112131131311413115131161311713118131191312013121131221312313124131251312613127131281312913130131311313213133131341313513136131371313813139131401314113142131431314413145131461314713148131491315013151131521315313154131551315613157131581315913160131611316213163131641316513166131671316813169131701317113172131731317413175131761317713178131791318013181131821318313184131851318613187131881318913190131911319213193131941319513196131971319813199132001320113202132031320413205132061320713208132091321013211132121321313214132151321613217132181321913220132211322213223132241322513226132271322813229132301323113232132331323413235132361323713238132391324013241132421324313244132451324613247132481324913250132511325213253132541325513256132571325813259132601326113262132631326413265132661326713268132691327013271132721327313274132751327613277132781327913280132811328213283132841328513286132871328813289132901329113292132931329413295132961329713298132991330013301133021330313304133051330613307133081330913310133111331213313133141331513316133171331813319133201332113322133231332413325133261332713328133291333013331133321333313334133351333613337133381333913340133411334213343133441334513346
  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, ActiveCells := FoxActiveCells;
  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. TYPE
  78. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  79. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  80. Operand = RECORD
  81. mode: SHORTINT;
  82. op: IntermediateCode.Operand;
  83. tag: IntermediateCode.Operand;
  84. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  85. dimOffset: LONGINT;
  86. END;
  87. Fixup= POINTER TO RECORD
  88. pc: LONGINT;
  89. nextFixup: Fixup;
  90. END;
  91. WriteBackCall = POINTER TO RECORD
  92. call: SyntaxTree.ProcedureCallDesignator;
  93. next: WriteBackCall;
  94. END;
  95. Label= OBJECT
  96. VAR
  97. fixups: Fixup;
  98. section: IntermediateCode.Section;
  99. pc: LONGINT;
  100. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  101. BEGIN
  102. SELF.section := section; pc := -1;
  103. END InitLabel;
  104. PROCEDURE Resolve(pc: LONGINT);
  105. VAR at: LONGINT;
  106. BEGIN
  107. SELF.pc := pc;
  108. WHILE(fixups # NIL) DO
  109. at := fixups.pc;
  110. section.PatchAddress(at,pc);
  111. fixups := fixups.nextFixup;
  112. END;
  113. END Resolve;
  114. PROCEDURE AddFixup(at: LONGINT);
  115. VAR fixup: Fixup;
  116. BEGIN
  117. ASSERT(pc=-1);
  118. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  119. END AddFixup;
  120. END Label;
  121. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  122. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  123. VAR
  124. backend: IntermediateBackend;
  125. implementationVisitor: ImplementationVisitor;
  126. meta: MetaDataGenerator;
  127. system: Global.System;
  128. currentScope: SyntaxTree.Scope;
  129. module: Sections.Module;
  130. moduleSelf: SyntaxTree.Variable;
  131. dump: BOOLEAN;
  132. forceModuleBody: BOOLEAN;
  133. addressType: IntermediateCode.Type;
  134. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  135. BEGIN
  136. currentScope := NIL; module := NIL; moduleSelf := NIL;
  137. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  138. SELF.dump := dump;
  139. SELF.backend := backend;
  140. SELF.forceModuleBody := forceModuleBody;
  141. addressType := IntermediateCode.GetType(system,system.addressType)
  142. END Init;
  143. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  144. BEGIN
  145. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  146. END Error;
  147. PROCEDURE Type(x: SyntaxTree.Type);
  148. BEGIN
  149. x.Accept(SELF);
  150. END Type;
  151. (** types **)
  152. PROCEDURE VisitBasicType(x: SyntaxTree.BasicType);
  153. BEGIN (* no code emission *) END VisitBasicType;
  154. PROCEDURE VisitCharacterType(x: SyntaxTree.CharacterType);
  155. BEGIN (* no code emission *) END VisitCharacterType;
  156. PROCEDURE VisitIntegerType(x: SyntaxTree.IntegerType);
  157. BEGIN (* no code emission *) END VisitIntegerType;
  158. PROCEDURE VisitFloatType(x: SyntaxTree.FloatType);
  159. BEGIN (* no code emission *) END VisitFloatType;
  160. PROCEDURE VisitComplexType(x: SyntaxTree.ComplexType);
  161. BEGIN (* no code emission *) END VisitComplexType;
  162. PROCEDURE VisitQualifiedType(x: SyntaxTree.QualifiedType);
  163. VAR type: SyntaxTree.Type;
  164. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  165. type := x.resolved;
  166. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  167. meta.CheckTypeDeclaration(type);
  168. END;
  169. END VisitQualifiedType;
  170. PROCEDURE VisitStringType(x: SyntaxTree.StringType);
  171. BEGIN (* no code emission *) END VisitStringType;
  172. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  173. BEGIN (* no code emission *)
  174. END VisitArrayRangeType;
  175. PROCEDURE VisitArrayType(x: SyntaxTree.ArrayType);
  176. BEGIN (* no code emission *) END VisitArrayType;
  177. PROCEDURE VisitMathArrayType(x: SyntaxTree.MathArrayType);
  178. BEGIN
  179. meta.CheckTypeDeclaration(x);
  180. END VisitMathArrayType;
  181. PROCEDURE VisitPointerType(x: SyntaxTree.PointerType);
  182. BEGIN
  183. meta.CheckTypeDeclaration(x);
  184. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  185. END VisitPointerType;
  186. PROCEDURE VisitRecordType(x: SyntaxTree.RecordType);
  187. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  188. BEGIN (* no code emission *)
  189. meta.CheckTypeDeclaration(x);
  190. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  191. IF x.pointerType.typeDeclaration # NIL THEN
  192. td := x.pointerType.typeDeclaration
  193. ELSE
  194. td := x.typeDeclaration
  195. END;
  196. Global.GetSymbolName(td,name);
  197. (* code section for object *)
  198. END;
  199. Scope(x.recordScope);
  200. END VisitRecordType;
  201. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  202. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  203. BEGIN
  204. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  205. WHILE (this # NIL) & (this.identifier# id) DO
  206. this := this.nextModifier;
  207. END;
  208. RETURN this # NIL
  209. END HasFlag;
  210. PROCEDURE VisitCellType(x: SyntaxTree.CellType);
  211. VAR name:Basic.SegmentedName; td: SyntaxTree.TypeDeclaration; type: SyntaxTree.Type; len,port,adr: LONGINT;
  212. parameter: SyntaxTree.Parameter; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  213. PROCEDURE CreatePortArray(type: SyntaxTree.Type; len: LONGINT);
  214. VAR i,len2: LONGINT; baseType: SyntaxTree.Type;
  215. BEGIN
  216. FOR i := 0 TO len-1 DO
  217. IF SemanticChecker.IsStaticArray(type, baseType, len2) THEN
  218. CreatePortArray(baseType, len2);
  219. ELSE
  220. IF backend.cellsAreObjects THEN
  221. adr := port
  222. ELSE
  223. (*! add check from ActiveCells2 *)
  224. adr := backend.activeCellsSpecification.GetPortAddress(port);
  225. END;
  226. IntermediateCode.InitImmediate(op,addressType,adr);
  227. symbol.Emit(Data(-1,op));
  228. INC(port);
  229. END;
  230. END;
  231. END CreatePortArray;
  232. BEGIN
  233. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  234. IF (x.cellScope.ownerModule = module.module) THEN
  235. td := x.typeDeclaration;
  236. Global.GetSymbolSegmentedName(td,name);
  237. (* code section for object *)
  238. END;
  239. port := 0;
  240. parameter := x.firstParameter;
  241. WHILE parameter # NIL DO
  242. type := parameter.type.resolved;
  243. IF type IS SyntaxTree.PortType THEN
  244. len := 1;
  245. INC(port);
  246. ELSIF SemanticChecker.IsStaticArray(type,type,len) OR SemanticChecker.IsDynamicArray(type, type) THEN
  247. IF backend.cellsAreObjects THEN
  248. IF IsStaticArray(parameter.type.resolved) THEN
  249. Error(parameter.position, "static arrays of ports are currently not implemented, please use a property (array property of port)");
  250. END;
  251. (* do nothing *)
  252. ELSE
  253. Global.GetSymbolSegmentedName(parameter,name);
  254. symbol := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,parameter,dump);
  255. CreatePortArray(type, len);
  256. (*
  257. WHILE len > 0 DO
  258. adr := backend.activeCellsSpecification.GetPortAddress(port);
  259. IntermediateCode.InitImmediate(op,addressType,adr);
  260. symbol.Emit(Data(-1,op));
  261. DEC(len); INC(port);
  262. END;
  263. *)
  264. END;
  265. ELSE
  266. Error(parameter.position,"should never happen, check semantic checker!");
  267. END;
  268. parameter := parameter.nextParameter;
  269. END;
  270. capabilities := {};
  271. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  272. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  273. backend.SetCapabilities(capabilities);
  274. Scope(x.cellScope);
  275. END VisitCellType;
  276. PROCEDURE VisitProcedureType(x: SyntaxTree.ProcedureType);
  277. BEGIN (* no code emission *) END VisitProcedureType;
  278. PROCEDURE VisitEnumerationType(x: SyntaxTree.EnumerationType);
  279. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  280. END VisitEnumerationType;
  281. (* symbols *)
  282. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  283. BEGIN
  284. Procedure(x);
  285. END VisitProcedure;
  286. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  287. BEGIN
  288. Procedure(x);
  289. END VisitOperator;
  290. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  291. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section;
  292. BEGIN
  293. IF x.externalName # NIL THEN RETURN END;
  294. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  295. (* code section for variable *)
  296. Global.GetSymbolSegmentedName(x,name);
  297. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  298. irv.SetExported(IsExported(x));
  299. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  300. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  301. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))));
  302. meta.CheckTypeDeclaration(x.type);
  303. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  304. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  305. END;
  306. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  307. END VisitVariable;
  308. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  309. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; op: Operand;
  310. BEGIN
  311. ASSERT(currentScope.outerScope IS SyntaxTree.CellScope);
  312. (* code section for variable *)
  313. Global.GetSymbolSegmentedName(x,name);
  314. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  315. irv.SetPositionOrAlignment(x.fixed, x.alignment);
  316. (*
  317. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  318. *)
  319. IF x.defaultValue = NIL THEN
  320. irv.Emit(Reserve(x.position,ToMemoryUnits(system,system.SizeOf(x.type))))
  321. ELSE
  322. implementationVisitor.inData := TRUE;
  323. implementationVisitor.Evaluate(x.defaultValue, op);
  324. irv.Emit(Data(x.position,op.op));
  325. implementationVisitor.inData := FALSE;
  326. END;
  327. meta.CheckTypeDeclaration(x.type);
  328. END VisitParameter;
  329. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  330. BEGIN
  331. Type(x.declaredType); (* => code in objects *)
  332. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  333. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  334. END;
  335. END VisitTypeDeclaration;
  336. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  337. BEGIN
  338. IF (SyntaxTree.Public * x.access # {}) THEN
  339. implementationVisitor.VisitConstant(x);
  340. END;
  341. END VisitConstant;
  342. PROCEDURE Scope(x: SyntaxTree.Scope);
  343. VAR procedure: SyntaxTree.Procedure;
  344. constant: SyntaxTree.Constant;
  345. variable: SyntaxTree.Variable;
  346. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  347. BEGIN
  348. prevScope := currentScope;
  349. currentScope := x;
  350. (* constants treated in implementation visitor *)
  351. typeDeclaration := x.firstTypeDeclaration;
  352. WHILE typeDeclaration # NIL DO
  353. VisitTypeDeclaration(typeDeclaration);
  354. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  355. END;
  356. variable := x.firstVariable;
  357. WHILE variable # NIL DO
  358. VisitVariable(variable);
  359. variable := variable.nextVariable;
  360. END;
  361. procedure := x.firstProcedure;
  362. WHILE procedure # NIL DO
  363. VisitProcedure(procedure);
  364. procedure := procedure.nextProcedure;
  365. END;
  366. constant := x.firstConstant;
  367. WHILE constant # NIL DO
  368. VisitConstant(constant);
  369. constant := constant.nextConstant;
  370. END;
  371. currentScope := prevScope;
  372. END Scope;
  373. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  374. VAR parameter: SyntaxTree.Parameter;
  375. BEGIN
  376. parameter := first;
  377. WHILE parameter # NIL DO
  378. VisitParameter(parameter);
  379. parameter := parameter.nextParameter;
  380. END;
  381. END Parameters;
  382. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  383. VAR scope: SyntaxTree.ProcedureScope;
  384. prevScope: SyntaxTree.Scope;
  385. inline, finalizer: BOOLEAN;
  386. procedureType: SyntaxTree.ProcedureType;
  387. pc: LONGINT;
  388. stackSize: LONGINT;
  389. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  390. null,size,src,dest,fp,res: IntermediateCode.Operand;
  391. cc: LONGINT;
  392. cellType: SyntaxTree.CellType;
  393. registerNumber: LONGINT;
  394. registerClass: IntermediateCode.RegisterClass;
  395. type: IntermediateCode.Type;
  396. formalParameter: SyntaxTree.Parameter;
  397. recordType: SyntaxTree.RecordType;
  398. priority: INTEGER;
  399. isModuleBody: BOOLEAN;
  400. PROCEDURE Signature;
  401. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  402. BEGIN
  403. procedureType := x.type(SyntaxTree.ProcedureType);
  404. returnType := procedureType.returnType;
  405. IF returnType # NIL THEN
  406. meta.CheckTypeDeclaration(returnType)
  407. END;
  408. parameter := procedureType.firstParameter;
  409. WHILE parameter # NIL DO
  410. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  411. parameter := parameter.nextParameter;
  412. END;
  413. END Signature;
  414. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  415. VAR result: BOOLEAN;
  416. BEGIN
  417. result := FALSE;
  418. IF x = SyntaxTree.invalidExpression THEN
  419. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  420. result := TRUE;
  421. value := x.resolved(SyntaxTree.IntegerValue).value;
  422. ELSE
  423. Error(x.position,"expression is not an integer constant");
  424. END;
  425. RETURN result;
  426. END CheckIntegerValue;
  427. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  428. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  429. BEGIN
  430. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  431. WHILE (this # NIL) & (this.identifier # id) DO
  432. this := this.nextModifier;
  433. END;
  434. IF this # NIL THEN
  435. IF this.expression = NIL THEN
  436. Error(this.position,"expected expression value");
  437. ELSIF CheckIntegerValue(this.expression,value) THEN
  438. END;
  439. RETURN TRUE
  440. ELSE RETURN FALSE
  441. END;
  442. END HasValue;
  443. BEGIN
  444. IF x.externalName # NIL THEN RETURN END;
  445. (*
  446. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  447. *)
  448. (* code section for this procedure *)
  449. scope := x.procedureScope;
  450. prevScope := currentScope;
  451. currentScope := scope;
  452. procedureType := x.type(SyntaxTree.ProcedureType);
  453. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  454. implementationVisitor.temporaries.Init;
  455. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  456. IF (scope.body # NIL) & (x.isInline) THEN
  457. inline := TRUE;
  458. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  459. ir.SetExported(IsExported(x));
  460. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  461. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  462. IF backend.cellsAreObjects THEN
  463. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  464. ir.SetExported(IsExported(x));
  465. ELSE
  466. RETURN; (* cellnet cannot be compiled for final static hardware *)
  467. END;
  468. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  469. inline := FALSE;
  470. AddBodyCallStub(x);
  471. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  472. ir.SetExported(IsExported(x));
  473. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  474. inline := FALSE;
  475. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  476. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := ActiveCells.defaultDataMemorySize END;
  477. AddBodyCallStub(x);
  478. AddStackAllocation(x,stackSize);
  479. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  480. ir.SetExported(IsExported(x));
  481. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  482. inline := FALSE;
  483. Parameters(procedureType.firstParameter);
  484. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  485. ir.SetExported(IsExported(x));
  486. ELSE
  487. inline := FALSE;
  488. IF x.isEntry OR x.isExit THEN
  489. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,x,dump);
  490. ir.SetExported(TRUE);
  491. IF x.isEntry THEN ir.SetPriority(EntryPriority) ELSE ir.SetPriority(ExitPriority) END;
  492. ELSE
  493. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  494. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  495. END;
  496. END;
  497. cc := procedureType.callingConvention;
  498. IF scope.body # NIL THEN
  499. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  500. registerNumber := 0;
  501. IF ~inline THEN
  502. pc := ir.pc;
  503. IF scope.lastVariable = NIL THEN
  504. stackSize := 0
  505. ELSE
  506. stackSize := scope.lastVariable.offsetInBits;
  507. IF stackSize <0 THEN stackSize := -stackSize END;
  508. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  509. END;
  510. (*
  511. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  512. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  513. *)
  514. ir.Emit(Nop(-1)); (* placeholder for enter *)
  515. (*
  516. ir.Emit(Nop(position)); (* placeholder for fill *)
  517. *)
  518. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  519. formalParameter := procedureType.lastParameter;
  520. WHILE (formalParameter # NIL) & (registerNumber < system.registerParameters) DO
  521. IF ~PassInRegister(formalParameter) THEN
  522. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  523. ELSE
  524. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(registerNumber));
  525. type := GetType(system, formalParameter.type);
  526. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  527. IntermediateCode.InitMemory(dest,GetType(system,formalParameter.type),implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  528. ir.Emit(Mov(-1,dest, src));
  529. implementationVisitor.ReleaseIntermediateOperand(src);
  530. INC(registerNumber);
  531. formalParameter := formalParameter.prevParameter;
  532. END;
  533. END;
  534. END;
  535. ir.EnterValidPAF;
  536. END;
  537. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  538. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  539. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  540. IF scope.lastVariable # NIL THEN
  541. stackSize := scope.lastVariable.offsetInBits;
  542. IF stackSize <0 THEN stackSize := -stackSize END;
  543. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  544. END;
  545. END;
  546. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  547. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  548. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  549. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  550. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  551. ir.EmitAt(pc,Push(size));
  552. implementationVisitor.StaticCallOperand(result,procedure);
  553. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  554. END;
  555. *)
  556. END;
  557. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber)); (*!!*)
  558. IF stackSize > 0 THEN
  559. IF (stackSize MOD system.addressSize = 0) THEN
  560. null := IntermediateCode.Immediate(addressType,0);
  561. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  562. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  563. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  564. ELSE
  565. null := IntermediateCode.Immediate(int8,0);
  566. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  567. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  568. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  569. END;
  570. (*! should potentially be called by backend -- enter might initialize
  571. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  572. *)
  573. END;
  574. ir.ExitValidPAF;
  575. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  576. finalizer := FALSE;
  577. IF backend.cooperative & x.isFinalizer THEN
  578. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  579. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  580. GetRecordTypeName(recordType,name);
  581. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  582. END;
  583. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  584. IF backend.cooperative THEN
  585. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  586. IF implementationVisitor.profile & ~isModuleBody THEN
  587. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  588. END;
  589. END;
  590. ir.Emit(implementationVisitor.Leave(x.position,x,cc));
  591. IF finalizer THEN
  592. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  593. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  594. ir.Emit(Br(x.position,dest));
  595. ELSE
  596. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  597. END;
  598. ELSE
  599. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  600. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  601. END;
  602. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  603. IF backend.cooperative THEN
  604. IF HasPointers (scope) THEN
  605. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  606. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  607. ir.Emit(Result(x.position, res));
  608. ir.Emit(Push(x.position, res));
  609. implementationVisitor.ResetVariables(scope);
  610. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  611. ir.Emit(Pop(x.position, res));
  612. ir.Emit(Return(x.position, res));
  613. ELSE
  614. implementationVisitor.ResetVariables(scope);
  615. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  616. END;
  617. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  618. IF ~ReturnedAsParameter(procedureType.returnType) THEN
  619. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  620. ir.Emit(Result(x.position, res));
  621. ir.Emit(Push(x.position, res));
  622. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  623. ir.Emit(Pop(x.position, res));
  624. ir.Emit(Return(x.position, res));
  625. ELSE
  626. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  627. END;
  628. END;
  629. ir.Emit(implementationVisitor.Leave(x.position,x,cc));
  630. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  631. ELSE
  632. ir.Emit(Nop(x.position));
  633. END;
  634. END
  635. END;
  636. ELSE (* force body for procedures *)
  637. ir.Emit(implementationVisitor.Enter(x.position,x,cc,0,0));
  638. ir.EnterValidPAF;
  639. implementationVisitor.usedRegisters := NIL;
  640. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  641. IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;
  642. ir.ExitValidPAF;
  643. ir.Emit(implementationVisitor.Leave(x.position,x,cc));
  644. ir.Emit(Exit(x.position,procedureType.pcOffset,cc));
  645. END;
  646. Scope(scope);
  647. Signature;
  648. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  649. currentScope := prevScope;
  650. END Procedure;
  651. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  652. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  653. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  654. BEGIN
  655. ASSERT (bodyProcedure # NIL);
  656. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  657. procedure := SyntaxTree.NewProcedure(-1,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  658. procedure.SetScope(bodyProcedure.scope);
  659. procedure.SetType(SyntaxTree.NewProcedureType(-1,bodyProcedure.scope));
  660. procedure.SetAccess(SyntaxTree.Hidden);
  661. Global.GetSymbolSegmentedName (procedure,name);
  662. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  663. ir.SetExported(TRUE);
  664. ir.SetPriority(InitPriority);
  665. Global.GetSymbolSegmentedName (bodyProcedure,name);
  666. IF backend.newObjectFile OR backend.cooperative THEN
  667. implementationVisitor.currentScope := module.module.moduleScope;
  668. implementationVisitor.section := ir;
  669. implementationVisitor.PushSelfPointer();
  670. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  671. ELSIF backend.preregisterStatic THEN
  672. implementationVisitor.currentScope := module.module.moduleScope;
  673. implementationVisitor.section := ir;
  674. implementationVisitor.PushSelfPointer();
  675. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  676. ELSE
  677. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  678. ir.Emit(Call(bodyProcedure.position,op, 0));
  679. END;
  680. END AddBodyCallStub;
  681. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  682. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  683. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  684. BEGIN
  685. Global.GetSymbolSegmentedName (symbol,name);
  686. Basic.RemoveSuffix(name);
  687. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  688. ir := implementationVisitor.NewSection(module.allSections,Sections.InitCodeSection,name,NIL,dump);
  689. ir.SetExported(TRUE);
  690. ir.SetPriority(FirstPriority);
  691. IntermediateCode.InitImmediate(op,addressType,initStack);
  692. ir.Emit(Mov(-1,implementationVisitor.sp,op));
  693. END AddStackAllocation;
  694. (** entry function to visit a complete module *)
  695. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  696. VAR
  697. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  698. hasDynamicOperatorDeclarations: BOOLEAN;
  699. operator: SyntaxTree.Operator;
  700. import: SyntaxTree.Import;
  701. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  702. BEGIN
  703. type := type.resolved;
  704. IF type IS SyntaxTree.RecordType THEN
  705. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  706. ELSIF (type IS SyntaxTree.ArrayType) THEN
  707. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  708. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  709. END;
  710. ELSIF type IS SyntaxTree.MathArrayType THEN
  711. WITH type: SyntaxTree.MathArrayType DO
  712. IF type.form = SyntaxTree.Open THEN
  713. RETURN TRUE
  714. ELSIF type.form = SyntaxTree.Static THEN
  715. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  716. END;
  717. END;
  718. END;
  719. RETURN FALSE
  720. END TypeNeedsInitialization;
  721. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  722. VAR variable: SyntaxTree.Variable;
  723. BEGIN
  724. variable := scope.firstVariable;
  725. WHILE variable # NIL DO
  726. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  727. IF variable.initializer # NIL THEN RETURN TRUE END;
  728. variable := variable.nextVariable;
  729. END;
  730. RETURN FALSE
  731. END ScopeNeedsInitialization;
  732. BEGIN
  733. ASSERT(x # NIL); ASSERT(module # NIL);
  734. SELF.module := module;
  735. (* add import names to the generated Sections.Module *)
  736. import := x.moduleScope.firstImport;
  737. WHILE import # NIL DO
  738. import.module.GetName(idstr);
  739. module.imports.AddName(idstr);
  740. import := import.nextImport
  741. END;
  742. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  743. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  744. moduleSelf := SyntaxTree.NewVariable(0,SyntaxTree.NewIdentifier("@moduleSelf"));
  745. moduleSelf.SetType(system.anyType);
  746. moduleSelf.SetScope(x.moduleScope);
  747. moduleSelf.SetUntraced(TRUE);
  748. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  749. ir.SetExported(TRUE);
  750. IntermediateCode.InitImmediate(op,addressType,0);
  751. ir.Emit(Data(-1,op));
  752. END;
  753. implementationVisitor.module := module;
  754. implementationVisitor.moduleScope := x.moduleScope;
  755. implementationVisitor.moduleSelf := moduleSelf;
  756. implementationVisitor.canBeLoaded := TRUE;
  757. meta.SetModule(module);
  758. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  759. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  760. END;
  761. IF backend.profile THEN
  762. EnsureBodyProcedure(x.moduleScope);
  763. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  764. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  765. implementationVisitor.profileId.Emit(Reserve(-1,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  766. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  767. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  768. implementationVisitor.profileInit.Emit(implementationVisitor.Enter(-1,NIL,0,0,0));
  769. Global.GetModuleName(module.module,idstr);
  770. implementationVisitor.ProfilerAddModule(idstr);
  771. implementationVisitor.numberProcedures := 0;
  772. END;
  773. implementationVisitor.profile := backend.profile;
  774. (* check if there is at least one dynamic operator locally defined *)
  775. hasDynamicOperatorDeclarations := FALSE;
  776. operator := x.moduleScope.firstOperator;
  777. WHILE operator # NIL DO
  778. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  779. operator := operator.nextOperator
  780. END;
  781. (* add operator initialization code section *)
  782. IF hasDynamicOperatorDeclarations THEN
  783. EnsureBodyProcedure(x.moduleScope);
  784. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  785. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  786. implementationVisitor.operatorInitializationCodeSection.Emit(implementationVisitor.Enter(-1,NIL,0,0,0));
  787. END;
  788. Scope(x.moduleScope);
  789. IF hasDynamicOperatorDeclarations THEN
  790. implementationVisitor.operatorInitializationCodeSection.Emit(implementationVisitor.Leave(-1,NIL,0));
  791. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(-1,0,0));
  792. END;
  793. IF backend.profile THEN
  794. implementationVisitor.ProfilerPatchInit;
  795. END;
  796. END Module;
  797. END DeclarationVisitor;
  798. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  799. RegisterUsageCount*=OBJECT
  800. VAR used: UsedArray; count: LONGINT;
  801. PROCEDURE &Init;
  802. VAR i: LONGINT;
  803. BEGIN
  804. count := 0;
  805. IF used = NIL THEN NEW(used,64); END;
  806. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  807. END Init;
  808. PROCEDURE Grow;
  809. VAR new: UsedArray; size,i: LONGINT;
  810. BEGIN
  811. size := LEN(used)*2;
  812. NEW(new,size);
  813. FOR i := 0 TO LEN(used)-1 DO
  814. new[i].count := used[i].count;
  815. new[i].type := used[i].type;
  816. new[i].map := used[i].map
  817. END;
  818. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  819. used := new
  820. END Grow;
  821. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  822. BEGIN
  823. INC(count);
  824. IF count = LEN(used) THEN Grow END;
  825. used[count].type := type;
  826. used[count].class := class;
  827. used[count].map := count;
  828. RETURN count;
  829. END Next;
  830. PROCEDURE IncUse(register: LONGINT);
  831. BEGIN
  832. INC(used[register].count);
  833. (*
  834. IF (register = 1) & (count > 30) THEN
  835. D.TraceBack;
  836. END;
  837. *)
  838. END IncUse;
  839. PROCEDURE DecUse(register: LONGINT);
  840. BEGIN
  841. DEC(used[register].count);
  842. END DecUse;
  843. PROCEDURE Map(register: LONGINT): LONGINT;
  844. VAR map : LONGINT;
  845. BEGIN
  846. IF register > 0 THEN
  847. map := used[register].map;
  848. WHILE register # map DO register := map; map := used[register].map END;
  849. END;
  850. RETURN register
  851. END Map;
  852. PROCEDURE Remap(register: LONGINT; to: LONGINT);
  853. BEGIN
  854. used[register].map:= to;
  855. used[to].count := used[register].count;
  856. used[register].count := 0;
  857. END Remap;
  858. PROCEDURE Use(register: LONGINT): LONGINT;
  859. BEGIN
  860. IF register< LEN(used) THEN
  861. RETURN used[register].count
  862. ELSE
  863. RETURN 0
  864. END
  865. END Use;
  866. END RegisterUsageCount;
  867. RegisterEntry = POINTER TO RECORD
  868. prev,next: RegisterEntry;
  869. register: LONGINT;
  870. registerClass: IntermediateCode.RegisterClass;
  871. type: IntermediateCode.Type;
  872. END;
  873. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  874. Variables = OBJECT (Basic.List)
  875. VAR
  876. inUse: VariableUse;
  877. registerIndex: LONGINT;
  878. PROCEDURE & Init;
  879. VAR i: LONGINT;
  880. BEGIN
  881. InitList(16);
  882. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  883. registerIndex := 1024;
  884. END Init;
  885. PROCEDURE GetUsage(VAR use: VariableUse);
  886. BEGIN
  887. use := inUse;
  888. END GetUsage;
  889. PROCEDURE SetUsage(CONST use: VariableUse);
  890. BEGIN
  891. inUse := use;
  892. END SetUsage;
  893. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  894. VAR any: ANY;
  895. BEGIN
  896. any := Get(i);;
  897. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  898. END GetVariable;
  899. PROCEDURE Occupy(pos: LONGINT);
  900. BEGIN
  901. INCL(inUse[pos DIV 32], pos MOD 32);
  902. END Occupy;
  903. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  904. BEGIN
  905. Occupy(Length());
  906. Add(v);
  907. END AddVariable;
  908. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; VAR pos: LONGINT): SyntaxTree.Variable;
  909. VAR var : SyntaxTree.Variable;
  910. BEGIN
  911. FOR pos := 0 TO Length()-1 DO
  912. IF ~((pos MOD 32) IN inUse[pos DIV 32]) THEN
  913. var := GetVariable(pos);
  914. IF type.SameType(var.type) THEN
  915. Occupy(pos); RETURN var
  916. END;
  917. END;
  918. END;
  919. pos := Length();
  920. RETURN NIL
  921. END GetFreeVariable;
  922. END Variables;
  923. SymbolMap = POINTER TO RECORD this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap; END;
  924. SymbolMapper = OBJECT
  925. VAR
  926. first: SymbolMap;
  927. PROCEDURE & Init;
  928. BEGIN
  929. first := NIL;
  930. END Init;
  931. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression);
  932. VAR new: SymbolMap;
  933. BEGIN
  934. NEW(new); new.this := this; new.to := to; new.tag := tag;
  935. new.next := first; first := new;
  936. END Add;
  937. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  938. VAR s: SymbolMap;
  939. BEGIN
  940. s := first;
  941. WHILE (s # NIL) & (s.this # this) DO
  942. s := s.next
  943. END;
  944. RETURN s
  945. END Get;
  946. END SymbolMapper;
  947. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  948. VAR
  949. system: Global.System;
  950. section: IntermediateCode.Section;
  951. module: Sections.Module;
  952. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  953. awaitProcCounter, labelId, constId, caseId: LONGINT;
  954. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  955. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  956. checker: SemanticChecker.Checker;
  957. backend: IntermediateBackend;
  958. meta: MetaDataGenerator;
  959. position: LONGINT;
  960. moduleSelf: SyntaxTree.Variable;
  961. (* variables for hand over of variables / temporary state *)
  962. currentScope: SyntaxTree.Scope;
  963. constantDeclaration : SyntaxTree.Symbol;
  964. result: Operand; (* result of the most recent expression / statement *)
  965. destination: IntermediateCode.Operand;
  966. arrayDestinationTag: IntermediateCode.Operand;
  967. arrayDestinationDimension:LONGINT;
  968. currentLoop: Label; (* variable to hand over loop exit jump list *)
  969. conditional: BOOLEAN;
  970. trueLabel, falseLabel, exitLabel: Label;
  971. locked: BOOLEAN;
  972. (*
  973. usedRegisters: Registers;
  974. *)
  975. registerUsageCount: RegisterUsageCount;
  976. usedRegisters: RegisterEntry;
  977. (* useful operands and types *)
  978. nil,fp,sp,ap,true,false: IntermediateCode.Operand;
  979. bool,addressType,setType, sizeType, byteType: IntermediateCode.Type;
  980. commentPrintout: Printout.Printer;
  981. dump: Streams.Writer;
  982. tagsAvailable : BOOLEAN;
  983. supportedInstruction: SupportedInstructionProcedure;
  984. supportedImmediate: SupportedImmediateProcedure;
  985. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  986. emitLabels: BOOLEAN;
  987. runtimeModuleName : SyntaxTree.IdentifierString;
  988. newObjectFile: BOOLEAN;
  989. indexCounter: LONGINT;
  990. profile: BOOLEAN;
  991. profileId, profileInit: IntermediateCode.Section;
  992. profileInitPatchPosition: LONGINT;
  993. numberProcedures: LONGINT;
  994. procedureResultDesignator : SyntaxTree.Designator;
  995. operatorInitializationCodeSection: IntermediateCode.Section;
  996. fingerPrinter: FingerPrinter.FingerPrinter;
  997. temporaries: Variables;
  998. canBeLoaded : BOOLEAN;
  999. currentIsInline: BOOLEAN;
  1000. currentMapper: SymbolMapper;
  1001. currentInlineExit: Label;
  1002. moduleBodySection: IntermediateCode.Section;
  1003. NeedDescriptor : BOOLEAN;
  1004. cooperativeSwitches: BOOLEAN;
  1005. lastSwitchPC: LONGINT;
  1006. isUnchecked: BOOLEAN;
  1007. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1008. newObjectFile: BOOLEAN);
  1009. BEGIN
  1010. SELF.system := system;
  1011. SELF.runtimeModuleName := runtime;
  1012. currentScope := NIL;
  1013. hiddenPointerType := NIL;
  1014. delegatePointerType := NIL;
  1015. awaitProcCounter := 0;
  1016. labelId := 0; constId := 0; labelId := 0;
  1017. SELF.checker := checker;
  1018. SELF.backend := backend;
  1019. position := Diagnostics.Invalid;
  1020. conditional := FALSE;
  1021. locked := FALSE;
  1022. InitOperand(result,ModeUndefined);
  1023. addressType := IntermediateCode.GetType(system,system.addressType);
  1024. setType := IntermediateCode.GetType(system,system.setType);
  1025. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1026. byteType := IntermediateCode.GetType(system, system.byteType);
  1027. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1028. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1029. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1030. nil := IntermediateCode.Immediate(addressType,0);
  1031. IntermediateCode.InitOperand(destination);
  1032. tagsAvailable := TRUE;
  1033. supportedInstruction := supportedInstructionProcedure;
  1034. supportedImmediate := supportedImmediateProcedure;
  1035. inData := FALSE;
  1036. SELF.emitLabels := emitLabels;
  1037. IntermediateCode.InitOperand(arrayDestinationTag);
  1038. bool := IntermediateCode.GetType(system,system.booleanType);
  1039. IntermediateCode.InitImmediate(false,bool,0);
  1040. IntermediateCode.InitImmediate(true,bool,1);
  1041. SELF.newObjectFile := newObjectFile;
  1042. indexCounter := 0;
  1043. NEW(registerUsageCount);
  1044. usedRegisters := NIL;
  1045. procedureResultDesignator := NIL;
  1046. NEW(fingerPrinter, system);
  1047. NEW(temporaries);
  1048. currentIsInline := FALSE;
  1049. NeedDescriptor := FALSE;
  1050. isUnchecked := backend.noRuntimeChecks;
  1051. END Init;
  1052. TYPE Context = RECORD
  1053. section: IntermediateCode.Section;
  1054. registerUsageCount: RegisterUsageCount;
  1055. usedRegisters: RegisterEntry;
  1056. END;
  1057. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1058. VAR context: Context;
  1059. BEGIN
  1060. context.section := section;
  1061. context.registerUsageCount := registerUsageCount;
  1062. context.usedRegisters := usedRegisters;
  1063. section := new;
  1064. NEW(registerUsageCount);
  1065. usedRegisters := NIL;
  1066. RETURN context;
  1067. END SwitchContext;
  1068. PROCEDURE ReturnToContext(context: Context);
  1069. BEGIN
  1070. section := context.section;
  1071. registerUsageCount := context.registerUsageCount;
  1072. usedRegisters := context.usedRegisters;
  1073. END ReturnToContext;
  1074. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1075. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1076. BEGIN
  1077. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1078. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1079. END;
  1080. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1081. section.SetExported(IsExported(syntaxTreeSymbol));
  1082. RETURN section
  1083. END NewSection;
  1084. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1085. VAR new: LONGINT;
  1086. BEGIN
  1087. new := registerUsageCount.Next(type,class);
  1088. UseRegister(new);
  1089. RETURN new
  1090. END AcquireRegister;
  1091. PROCEDURE GetIndex(): LONGINT;
  1092. BEGIN
  1093. INC(indexCounter); RETURN indexCounter
  1094. END GetIndex;
  1095. (** get the name for the code section that represens a certain symbol
  1096. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1097. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1098. VAR
  1099. operatorFingerPrint: SyntaxTree.FingerPrint;
  1100. operatorFingerPrintString,string: ARRAY 32 OF CHAR;
  1101. BEGIN
  1102. Global.GetSymbolSegmentedName(symbol, name);
  1103. (* if the symbol is an operator, then append the fingerprint to the name *)
  1104. IF symbol IS SyntaxTree.Operator THEN
  1105. operatorFingerPrint := fingerPrinter.SymbolFP(symbol);
  1106. string := "[";
  1107. Strings.IntToHexStr(operatorFingerPrint.shallow, 8, operatorFingerPrintString);
  1108. Strings.Append(string, operatorFingerPrintString);
  1109. Strings.Append(string, "]");
  1110. Basic.AppendToSegmentedName(name,string);
  1111. END
  1112. END GetCodeSectionNameForSymbol;
  1113. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1114. BEGIN
  1115. IF dump # NIL THEN
  1116. dump.String("enter "); dump.String(s); dump.Ln;
  1117. END;
  1118. END TraceEnter;
  1119. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1120. BEGIN
  1121. IF dump # NIL THEN
  1122. dump.String("exit "); dump.String(s); dump.Ln;
  1123. END;
  1124. END TraceExit;
  1125. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1126. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1127. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1128. VAR i: LONGINT;
  1129. BEGIN
  1130. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1131. IF op.rule # NIL THEN
  1132. FOR i := 0 TO LEN(op.rule)-1 DO
  1133. CheckRegister(op.rule[i])
  1134. END;
  1135. END;
  1136. END CheckRegister;
  1137. BEGIN
  1138. CheckRegister(instruction.op1);
  1139. CheckRegister(instruction.op2);
  1140. CheckRegister(instruction.op3);
  1141. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1142. ELSE section.Emit(instruction);
  1143. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1144. END;
  1145. END Emit;
  1146. PROCEDURE EmitTrap (position, trapNo: LONGINT);
  1147. BEGIN
  1148. IF backend.cooperative THEN
  1149. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1150. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1151. ELSE
  1152. Emit(Trap(position,trapNo));
  1153. END;
  1154. END EmitTrap;
  1155. PROCEDURE Enter (position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT): IntermediateCode.Instruction;
  1156. VAR name: Basic.SegmentedName;
  1157. VAR op1,op2,op3: IntermediateCode.Operand;
  1158. VAR instruction: IntermediateCode.Instruction;
  1159. BEGIN
  1160. IF backend.cooperative & (callconv = SyntaxTree.OberonCallingConvention) THEN
  1161. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1162. GetCodeSectionNameForSymbol(procedure, name);
  1163. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  1164. ELSE
  1165. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1166. END;
  1167. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1168. ELSE
  1169. IntermediateCode.InitNumber(op1,callconv);
  1170. END;
  1171. IntermediateCode.InitNumber(op2,varSize);
  1172. IntermediateCode.InitNumber(op3, numRegs);
  1173. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,op3);
  1174. RETURN instruction;
  1175. END Enter;
  1176. PROCEDURE Leave(position: LONGINT; procedure: SyntaxTree.Procedure; callconv: LONGINT): IntermediateCode.Instruction;
  1177. VAR op1,op2: IntermediateCode.Operand;
  1178. VAR instruction: IntermediateCode.Instruction;
  1179. BEGIN
  1180. IntermediateCode.InitNumber(op1,callconv);
  1181. IF backend.cooperative THEN
  1182. IntermediateCode.InitNumber(op2,ToMemoryUnits(system, system.addressSize));
  1183. ELSE
  1184. IntermediateCode.InitNumber(op2,0);
  1185. END;
  1186. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,op2,emptyOperand);
  1187. RETURN instruction
  1188. END Leave;
  1189. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1190. VAR m: SymbolMap; e: SyntaxTree.Expression; o, t: IntermediateCode.Operand;
  1191. BEGIN
  1192. position := x.position;
  1193. IF currentIsInline THEN
  1194. m := currentMapper.Get(x);
  1195. IF m # NIL THEN
  1196. (*
  1197. Printout.Info("mapping from", x);
  1198. Printout.Info("mapping to ", m.to);
  1199. *)
  1200. m.to.Accept(SELF);
  1201. op := result;
  1202. IF m.tag # NIL THEN
  1203. ReleaseIntermediateOperand(result.tag);
  1204. m.tag.Accept(SELF);
  1205. op.tag := result.op;
  1206. ReleaseIntermediateOperand(result.tag);
  1207. END;
  1208. RETURN
  1209. END;
  1210. END;
  1211. x.Accept(SELF);
  1212. op := result;
  1213. END Symbol;
  1214. PROCEDURE Expression(x: SyntaxTree.Expression);
  1215. BEGIN
  1216. position := x.position;
  1217. constantDeclaration := NIL;
  1218. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1219. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1220. END;
  1221. IF x.resolved # NIL THEN
  1222. x.resolved.Accept(SELF)
  1223. ELSE
  1224. x.Accept(SELF)
  1225. END;
  1226. (* check this, was commented out in ActiveCells3 *)
  1227. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1228. Error(x.position, "unsupported modifier");
  1229. END;
  1230. END Expression;
  1231. (*
  1232. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1233. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1234. BEGIN
  1235. temporaries.GetUsage(current);
  1236. FOR i := 0 TO LEN(current)-1 DO
  1237. set := current[i] - previous[i];
  1238. IF set # {} THEN
  1239. FOR j := 0 TO MAX(SET)-1 DO
  1240. IF j IN set THEN
  1241. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1242. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1243. Symbol(variable, op);
  1244. MakeMemory(tmp,op.op,addressType,0);
  1245. ReleaseOperand(op);
  1246. Emit(Mov(position,tmp, nil ) );
  1247. ReleaseIntermediateOperand(tmp);
  1248. END;
  1249. END;
  1250. END;
  1251. END;
  1252. END;
  1253. END ResetUsedTemporaries;
  1254. *)
  1255. PROCEDURE Statement(x: SyntaxTree.Statement);
  1256. VAR use: VariableUse;
  1257. BEGIN
  1258. temporaries.GetUsage(use);
  1259. position := x.position;
  1260. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1261. IF commentPrintout # NIL THEN
  1262. commentPrintout.Statement(x);
  1263. dump.Ln;
  1264. (*dump.Update;*)
  1265. END;
  1266. x.Accept(SELF);
  1267. (*
  1268. CheckRegistersFree();
  1269. *)
  1270. (*ResetUsedTemporaries(use);*)
  1271. temporaries.SetUsage(use);
  1272. END Statement;
  1273. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1274. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1275. *)
  1276. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1277. BEGIN
  1278. IF op.mode = IntermediateCode.ModeMemory THEN
  1279. ReuseCopy(res,op);
  1280. ELSE
  1281. res := op;
  1282. UseIntermediateOperand(res);
  1283. END;
  1284. IntermediateCode.AddOffset(res,offset);
  1285. IntermediateCode.MakeMemory(res,type);
  1286. END MakeMemory;
  1287. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1288. VAR mem: IntermediateCode.Operand;
  1289. BEGIN
  1290. MakeMemory(mem,res,type,offset);
  1291. ReleaseIntermediateOperand(res);
  1292. res := mem;
  1293. END ToMemory;
  1294. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1295. VAR mem: IntermediateCode.Operand;
  1296. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1297. componentType: SyntaxTree.Type;
  1298. BEGIN
  1299. type := type.resolved;
  1300. IF operand.mode = ModeReference THEN
  1301. IF type IS SyntaxTree.RangeType THEN
  1302. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.longintType), 0);
  1303. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1304. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  1305. ReleaseOperand(operand);
  1306. operand.op := firstOp;
  1307. operand.tag := lastOp;
  1308. operand.extra := stepOp;
  1309. ELSIF type IS SyntaxTree.ComplexType THEN
  1310. componentType := type(SyntaxTree.ComplexType).componentType;
  1311. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1312. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1313. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1314. ReleaseOperand(operand);
  1315. operand.op := firstOp;
  1316. operand.tag := lastOp
  1317. ELSE
  1318. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1319. ReleaseIntermediateOperand(operand.op);
  1320. operand.op := mem;
  1321. END;
  1322. operand.mode := ModeValue;
  1323. END;
  1324. ASSERT(operand.mode = ModeValue);
  1325. END LoadValue;
  1326. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1327. VAR prevConditional: BOOLEAN;
  1328. BEGIN
  1329. prevConditional := conditional;
  1330. conditional := FALSE;
  1331. InitOperand(result, ModeUndefined);
  1332. Expression(x);
  1333. op := result;
  1334. LoadValue(op,x.type.resolved);
  1335. conditional := prevConditional;
  1336. END Evaluate;
  1337. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1338. VAR prevConditional: BOOLEAN;
  1339. BEGIN
  1340. prevConditional := conditional;
  1341. conditional := FALSE;
  1342. InitOperand(result,ModeUndefined);
  1343. Expression(x);
  1344. op := result;
  1345. (*
  1346. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1347. *)
  1348. conditional := prevConditional;
  1349. END Designate;
  1350. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1351. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1352. BEGIN
  1353. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1354. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1355. conditional := TRUE;
  1356. trueLabel := trueL; falseLabel := falseL;
  1357. Expression(x);
  1358. trueL := trueLabel; falseL := falseLabel;
  1359. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1360. END Condition;
  1361. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1362. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1363. BEGIN
  1364. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1365. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1366. RETURN op
  1367. END NewRegisterOperand;
  1368. PROCEDURE UnuseRegister(register: LONGINT);
  1369. BEGIN
  1370. IF (register > 0) THEN
  1371. register := registerUsageCount.Map(register);
  1372. registerUsageCount.DecUse(register);
  1373. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1374. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1375. END;
  1376. IF registerUsageCount.Use(register)=0 THEN
  1377. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1378. Warning(position, "register cannot be removed");
  1379. END;
  1380. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1381. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1382. END;
  1383. ELSIF registerUsageCount.Use(register)<0 THEN
  1384. Warning(position, "register removed too often");
  1385. D.TraceBack;
  1386. END;
  1387. END;
  1388. END UnuseRegister;
  1389. PROCEDURE UseRegister(register: LONGINT);
  1390. BEGIN
  1391. IF (register > 0) THEN
  1392. register := registerUsageCount.Map(register);
  1393. registerUsageCount.IncUse(register);
  1394. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1395. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1396. END;
  1397. IF registerUsageCount.Use(register)=1 THEN
  1398. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1399. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1400. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1401. END;
  1402. END;
  1403. END;
  1404. END UseRegister;
  1405. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1406. BEGIN
  1407. UnuseRegister(op.register)
  1408. END ReleaseIntermediateOperand;
  1409. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1410. BEGIN
  1411. UseRegister(op.register)
  1412. END UseIntermediateOperand;
  1413. PROCEDURE ReleaseOperand(CONST op: Operand);
  1414. BEGIN
  1415. UnuseRegister(op.op.register);
  1416. UnuseRegister(op.tag.register);
  1417. UnuseRegister(op.extra.register);
  1418. END ReleaseOperand;
  1419. (* save registers marked in array "markedRegisters" to the stack
  1420. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1421. *)
  1422. PROCEDURE SaveRegisters();
  1423. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1424. BEGIN
  1425. entry := usedRegisters;
  1426. WHILE entry # NIL DO
  1427. type := registerUsageCount.used[entry.register].type;
  1428. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1429. Emit(Push(position,op));
  1430. entry := entry.next;
  1431. END;
  1432. END SaveRegisters;
  1433. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1434. BEGIN
  1435. saved := usedRegisters;
  1436. usedRegisters := NIL;
  1437. END ReleaseUsedRegisters;
  1438. (** remove parameter registers from used queue *)
  1439. PROCEDURE ReleaseParameterRegisters;
  1440. VAR op: IntermediateCode.Operand; entry,prev,next: RegisterEntry;
  1441. BEGIN
  1442. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1443. WHILE entry # NIL DO
  1444. next := entry.next;
  1445. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1446. registerUsageCount.DecUse(entry.register);
  1447. ASSERT(registerUsageCount.Use(entry.register)=0);
  1448. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1449. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1450. END;
  1451. ELSIF prev = NIL THEN
  1452. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1453. ELSE
  1454. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1455. END;
  1456. entry := next;
  1457. END;
  1458. END ReleaseParameterRegisters;
  1459. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1460. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1461. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass; new: LONGINT;
  1462. BEGIN
  1463. entry := saved;
  1464. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1465. entry := prev;
  1466. WHILE entry # NIL DO
  1467. prev := entry.prev;
  1468. type := entry.type;
  1469. class := entry.registerClass;
  1470. IntermediateCode.InitRegister(op,type,class,entry.register);
  1471. (*
  1472. new := registerUsageCount.Next(type,class);
  1473. registerUsageCount.Remap(entry.register,new);
  1474. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1475. dump.String("remap register "); dump.Int(entry.register,1);
  1476. dump.String("to "); dump.Int(new,1);
  1477. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1478. END;
  1479. entry.register := new;
  1480. *)
  1481. Emit(Pop(position,op));
  1482. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1483. entry := prev;
  1484. END;
  1485. (*
  1486. usedRegisters := saved;
  1487. *)
  1488. END RestoreRegisters;
  1489. PROCEDURE CheckRegistersFree;
  1490. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1491. BEGIN
  1492. IF usedRegisters # NIL THEN
  1493. r := usedRegisters;
  1494. WHILE r # NIL DO
  1495. warning := "register ";
  1496. Strings.AppendInt(warning, r.register);
  1497. Strings.Append(warning, " not released.");
  1498. Warning(position,warning);
  1499. r := r .next;
  1500. END;
  1501. END;
  1502. FOR i := 0 TO registerUsageCount.count-1 DO
  1503. IF registerUsageCount.used[i].count < 0 THEN
  1504. warning := "register ";
  1505. Strings.AppendInt(warning, i);
  1506. Strings.Append(warning, " unused too often.");
  1507. Warning(position,warning);
  1508. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1509. warning := "register ";
  1510. Strings.AppendInt(warning, i);
  1511. Strings.Append(warning, " not unused often enough.");
  1512. Warning(position,warning);
  1513. END;
  1514. END;
  1515. END CheckRegistersFree;
  1516. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1517. Otherwise allocate a new register.
  1518. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1519. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1520. BEGIN
  1521. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1522. UseIntermediateOperand(result);
  1523. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1524. UseIntermediateOperand(result);
  1525. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1526. END;
  1527. END Reuse2;
  1528. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1529. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1530. If not then allocate a new register.
  1531. Does NOT necessarily keep the content of src1 or src2 in result!
  1532. *)
  1533. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1534. BEGIN
  1535. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1536. UseIntermediateOperand(result);
  1537. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1538. UseIntermediateOperand(result);
  1539. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1540. result := alternative; alternative := emptyOperand;
  1541. UseIntermediateOperand(result);
  1542. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1543. END;
  1544. END Reuse2a;
  1545. (* like reuse2 but only one source *)
  1546. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1547. BEGIN
  1548. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1549. UseIntermediateOperand(result);
  1550. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1551. END;
  1552. END Reuse1;
  1553. (* like reuse2a but only one source *)
  1554. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1555. BEGIN
  1556. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1557. UseIntermediateOperand(result);
  1558. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1559. UseIntermediateOperand(result);
  1560. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1561. END;
  1562. END Reuse1a;
  1563. (* like reuse1 but guarantees that content of src1 is in result *)
  1564. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1565. BEGIN
  1566. IF ReusableRegister(src1) THEN
  1567. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1568. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1569. UseIntermediateOperand(result);
  1570. ELSE
  1571. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1572. Emit(Mov(position,result,src1));
  1573. END
  1574. END ReuseCopy;
  1575. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1576. BEGIN
  1577. IF ReusableRegister(src) THEN
  1578. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1579. ELSE
  1580. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1581. Emit(Mov(position,result,src));
  1582. ReleaseIntermediateOperand(src);
  1583. END
  1584. END TransferToRegister;
  1585. (** labels and branches **)
  1586. PROCEDURE NewLabel(): Label;
  1587. VAR label: Label;
  1588. BEGIN
  1589. NEW(label,section); RETURN label;
  1590. END NewLabel;
  1591. PROCEDURE SetLabel(label: Label);
  1592. BEGIN label.Resolve(section.pc);
  1593. END SetLabel;
  1594. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1595. BEGIN
  1596. ASSERT(label # NIL);
  1597. IF label.pc < 0 THEN (* label not yet set *)
  1598. label.AddFixup(section.pc);
  1599. END;
  1600. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1601. END LabelOperand;
  1602. PROCEDURE BrL(label: Label);
  1603. BEGIN
  1604. Emit(Br(position,LabelOperand(label)));
  1605. END BrL;
  1606. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1607. BEGIN
  1608. Emit(Brge(position,LabelOperand(label),left,right));
  1609. END BrgeL;
  1610. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1611. BEGIN
  1612. Emit(Brlt(position,LabelOperand(label),left,right));
  1613. END BrltL;
  1614. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1615. BEGIN
  1616. Emit(Breq(position,LabelOperand(label),left,right));
  1617. END BreqL;
  1618. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1619. BEGIN
  1620. Emit(Brne(position,LabelOperand(label),left,right));
  1621. END BrneL;
  1622. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1623. VAR new: IntermediateCode.Operand;
  1624. BEGIN
  1625. IF Trace THEN TraceEnter("Convert") END;
  1626. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1627. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1628. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1629. & (operand.offset = 0)
  1630. THEN
  1631. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1632. Emit(Conv(position,new,operand));
  1633. ELSE
  1634. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1635. Emit(Conv(position,new,operand));
  1636. ReleaseIntermediateOperand(operand);
  1637. END;
  1638. operand := new;
  1639. 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
  1640. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1641. ELSE
  1642. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1643. Emit(Conv(position,new,operand));
  1644. ReleaseIntermediateOperand(operand);
  1645. operand := new;
  1646. END;
  1647. IF Trace THEN TraceExit("Convert") END;
  1648. END Convert;
  1649. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1650. VAR exit: Label;
  1651. BEGIN
  1652. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1653. exit := NewLabel();
  1654. br(exit,left,right);
  1655. EmitTrap(position,trapNo);
  1656. SetLabel(exit);
  1657. END TrapC;
  1658. (** expressions *)
  1659. (** emit necessary runtime check for set elements **)
  1660. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1661. VAR max: IntermediateCode.Operand;
  1662. BEGIN
  1663. IF isUnchecked THEN RETURN END;
  1664. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1665. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1666. TrapC(BrgeL, max, o, SetElementTrap);
  1667. END;
  1668. END CheckSetElement;
  1669. (** the set that a range represents **)
  1670. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1671. VAR
  1672. operand: Operand;
  1673. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1674. BEGIN
  1675. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1676. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1677. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1678. one := IntermediateCode.Immediate(setType, 1);
  1679. Evaluate(x, operand);
  1680. Convert(operand.op, setType);
  1681. Convert(operand.tag, setType);
  1682. CheckSetElement(operand.op);
  1683. CheckSetElement(operand.tag);
  1684. (* create mask for lower bound
  1685. i.e. shift 11111111 to the left by the value of the lower bound
  1686. *)
  1687. Reuse1(temp, operand.op);
  1688. Emit(Shl(position,temp, allBits, operand.op));
  1689. ReleaseIntermediateOperand(operand.op);
  1690. operand.op := temp;
  1691. (* create mask for upper bound
  1692. i.e. shift 11111111 to the right by the difference between the
  1693. upper bound and the maximum number of set elements
  1694. *)
  1695. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1696. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1697. Reuse1(temp, operand.tag);
  1698. ELSE
  1699. Reuse1(temp, operand.tag);
  1700. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1701. Emit(Sub(position,temp, size, operand.tag));
  1702. END;
  1703. Emit(Shr(position,temp, allBits, operand.tag));
  1704. ReleaseIntermediateOperand(operand.tag);
  1705. operand.tag := temp;
  1706. Reuse2(resultingSet, operand.op, operand.tag);
  1707. (* intersect the two masks *)
  1708. Emit(And(position,resultingSet, operand.op, operand.tag));
  1709. ReleaseOperand(operand);
  1710. RETURN resultingSet
  1711. END SetFromRange;
  1712. PROCEDURE VisitSet(x: SyntaxTree.Set);
  1713. VAR
  1714. res, operand: Operand;
  1715. temp, one, noBits, dest: IntermediateCode.Operand;
  1716. expression: SyntaxTree.Expression;
  1717. i: LONGINT;
  1718. BEGIN
  1719. IF Trace THEN TraceEnter("VisitSet") END;
  1720. dest := destination;
  1721. destination := emptyOperand;
  1722. noBits := IntermediateCode.Immediate(setType, 0);
  1723. one := IntermediateCode.Immediate(setType, 1);
  1724. (* start off with the empty set *)
  1725. InitOperand(res, ModeValue);
  1726. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  1727. Emit(Mov(position,res.op, noBits));
  1728. FOR i := 0 TO x.elements.Length() - 1 DO
  1729. expression := x.elements.GetExpression(i);
  1730. IF expression IS SyntaxTree.RangeExpression THEN
  1731. (* range of set elements *)
  1732. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  1733. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  1734. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1735. ReleaseIntermediateOperand(temp)
  1736. ELSE
  1737. (* singelton element *)
  1738. Evaluate(expression, operand);
  1739. Convert(operand.op, setType);
  1740. CheckSetElement(operand.op);
  1741. (* create subset containing single element *)
  1742. Reuse1(temp, operand.op);
  1743. Emit(Shl(position,temp, one, operand.op));
  1744. ReleaseOperand(operand);
  1745. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  1746. ReleaseIntermediateOperand(temp);
  1747. END
  1748. END;
  1749. result := res;
  1750. destination := dest;
  1751. IF Trace THEN TraceExit("VisitSet") END;
  1752. END VisitSet;
  1753. PROCEDURE VisitMathArrayExpression(x: SyntaxTree.MathArrayExpression);
  1754. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  1755. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  1756. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  1757. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  1758. element: SyntaxTree.IntegerValue;
  1759. BEGIN
  1760. numberElements := x.elements.Length();
  1761. expression := index.parameters.GetExpression(dim);
  1762. element := expression(SyntaxTree.IntegerValue);
  1763. FOR i := 0 TO numberElements-1 DO
  1764. expression := x.elements.GetExpression(i);
  1765. element.SetValue(i);
  1766. IF expression IS SyntaxTree.MathArrayExpression THEN
  1767. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  1768. ELSE
  1769. Assign(index,expression);
  1770. END;
  1771. END;
  1772. END RecursiveAssignment;
  1773. BEGIN
  1774. variable := GetTemporaryVariable(x.type, FALSE);
  1775. designator := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  1776. designator.SetType(variable.type);
  1777. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  1778. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  1779. FOR i := 0 TO dim-1 DO
  1780. element := SyntaxTree.NewIntegerValue(x.position,0);
  1781. element.SetType(system.longintType);
  1782. index.parameters.AddExpression(element);
  1783. END;
  1784. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  1785. RecursiveAssignment(x,0);
  1786. Expression(designator);
  1787. END VisitMathArrayExpression;
  1788. PROCEDURE VisitUnaryExpression(x: SyntaxTree.UnaryExpression);
  1789. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  1790. BEGIN
  1791. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  1792. dest := destination; destination := emptyOperand;
  1793. IF x.operator = Scanner.Not THEN
  1794. IF conditional THEN
  1795. Condition(x.left,falseLabel,trueLabel)
  1796. ELSE
  1797. Evaluate(x.left,operand);
  1798. InitOperand(result,ModeValue);
  1799. Reuse1a(result.op,operand.op,dest);
  1800. Emit(Xor(position,result.op,operand.op,true));
  1801. ReleaseOperand(operand);
  1802. END;
  1803. ELSIF x.operator = Scanner.Minus THEN
  1804. Evaluate(x.left,operand);
  1805. InitOperand(result,ModeValue);
  1806. Reuse1a(result.op,operand.op,dest);
  1807. type := x.left.type.resolved;
  1808. IF type IS SyntaxTree.SetType THEN
  1809. Emit(Not(position,result.op,operand.op));
  1810. ELSIF (type IS SyntaxTree.ComplexType) THEN
  1811. Reuse1(result.tag,operand.tag);
  1812. Emit(Neg(position,result.op,operand.op)); (* real part *)
  1813. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  1814. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  1815. Emit(Neg(position,result.op,operand.op));
  1816. ELSE HALT(200)
  1817. END;
  1818. ReleaseOperand(operand);
  1819. ELSIF x.operator = Scanner.Address THEN
  1820. Designate(x.left,operand);
  1821. operand.mode := ModeValue;
  1822. t0 := x.left.type.resolved;
  1823. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  1824. ReleaseIntermediateOperand(operand.op);
  1825. operand.op := operand.tag;
  1826. IntermediateCode.InitOperand(operand.tag);
  1827. END;
  1828. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  1829. result := operand;
  1830. ELSE HALT(100)
  1831. END;
  1832. destination := dest;
  1833. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  1834. END VisitUnaryExpression;
  1835. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  1836. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  1837. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  1838. BEGIN
  1839. type := type.resolved;
  1840. originalType := type;
  1841. IF type IS SyntaxTree.PointerType THEN
  1842. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  1843. END;
  1844. IF type IS SyntaxTree.ObjectType THEN
  1845. BrL(trueL);
  1846. ELSE
  1847. ASSERT(type IS SyntaxTree.RecordType);
  1848. (*
  1849. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  1850. *)
  1851. ReuseCopy(left,tag);
  1852. right := TypeDescriptorAdr(type);
  1853. IF ~newObjectFile THEN
  1854. IntermediateCode.MakeMemory(right,addressType);
  1855. END;
  1856. IF backend.cooperative THEN
  1857. repeatL := NewLabel();
  1858. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  1859. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  1860. END;
  1861. SetLabel(repeatL);
  1862. BreqL(trueL,left,right);
  1863. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  1864. BrneL(repeatL,left,nil);
  1865. ELSE
  1866. level := type(SyntaxTree.RecordType).Level();
  1867. (* get type desc tag of level relative to base tag *)
  1868. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  1869. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  1870. IntermediateCode.MakeMemory(left,addressType);
  1871. BreqL(trueL,left,right);
  1872. END;
  1873. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  1874. BrL(falseL);
  1875. END;
  1876. END TypeTest;
  1877. PROCEDURE Error(position: LONGINT; CONST s: ARRAY OF CHAR);
  1878. BEGIN
  1879. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  1880. IF dump # NIL THEN
  1881. dump.String(s); dump.Ln;
  1882. END;
  1883. END Error;
  1884. PROCEDURE Warning(position: LONGINT; CONST s: ARRAY OF CHAR);
  1885. BEGIN
  1886. backend.diagnostics.Warning(module.module.sourceName,position,Diagnostics.Invalid,s);
  1887. IF dump # NIL THEN
  1888. dump.String(s); dump.Ln; dump.Update;
  1889. END;
  1890. END Warning;
  1891. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  1892. VAR name: Basic.SectionName; pointer, pooledName: Basic.SegmentedName; previousSection,source: IntermediateCode.Section;
  1893. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  1894. operand:Operand; size: LONGINT; base: SyntaxTree.Type;
  1895. BEGIN
  1896. previousSection := section;
  1897. Global.GetModuleName(mod,name);
  1898. Strings.Append(name,".@Trace");
  1899. Basic.ToSegmentedName(name, pooledName);
  1900. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  1901. IF dump # NIL THEN dump := section.comments END;
  1902. variable := mod.moduleScope.firstVariable;
  1903. WHILE variable # NIL DO
  1904. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  1905. Symbol(variable, operand);
  1906. register := operand.op;
  1907. CallTraceMethod(register, variable.type);
  1908. ReleaseIntermediateOperand(register);
  1909. END;
  1910. variable := variable.nextVariable;
  1911. END;
  1912. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  1913. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  1914. Emit(Br(position,op));
  1915. INC(statCoopTraceModule, section.pc);
  1916. section := previousSection;
  1917. IF dump # NIL THEN dump := section.comments END;
  1918. END CreateTraceModuleMethod;
  1919. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  1920. BEGIN
  1921. Emit (Push(position, dst));
  1922. Emit (Push(position, src));
  1923. CallThis(position,"GarbageCollector","Assign", 2);
  1924. END CallAssignPointer;
  1925. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  1926. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  1927. BEGIN
  1928. IF SemanticChecker.IsPointerType (type) THEN
  1929. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  1930. ELSIF type.IsRecordType() THEN
  1931. Emit (Push(position,dst));
  1932. Emit (Push(position,src));
  1933. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  1934. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  1935. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  1936. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  1937. ELSIF IsStaticArray(type) THEN
  1938. size := StaticArrayNumElements(type);
  1939. base := StaticArrayBaseType(type);
  1940. IF base.IsRecordType() THEN
  1941. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  1942. Emit (Push(position, dst));
  1943. Emit (Push(position, src));
  1944. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  1945. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  1946. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  1947. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  1948. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  1949. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  1950. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  1951. Emit (Push(position, dst));
  1952. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  1953. Emit (Push(position, src));
  1954. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  1955. ELSE
  1956. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  1957. Emit (Push(position, dst));
  1958. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  1959. Emit (Push(position, src));
  1960. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  1961. ASSERT(StaticArrayBaseType(type).IsPointer());
  1962. END;
  1963. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  1964. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  1965. Emit (Push(position, dst));
  1966. Emit (Push(position, src));
  1967. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  1968. ELSE HALT(100); (* missing ? *)
  1969. END;
  1970. END CallAssignMethod;
  1971. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  1972. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  1973. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType; size: LONGINT;
  1974. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label; previousUsedRegisters: RegisterEntry;
  1975. previousRegisterUsageCount: RegisterUsageCount; context: Context;
  1976. BEGIN
  1977. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  1978. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  1979. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  1980. GetRecordTypeName (recordType,name);
  1981. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  1982. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  1983. IF dump # NIL THEN dump := section.comments END;
  1984. variable := recordType.recordScope.firstVariable;
  1985. WHILE variable # NIL DO
  1986. IF variable.NeedsTrace() THEN
  1987. dst := NewRegisterOperand (addressType);
  1988. src := NewRegisterOperand (addressType);
  1989. Emit (Mov(position, dst, parameter1));
  1990. Emit (Mov(position, src, parameter2));
  1991. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  1992. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  1993. CallAssignMethod(dst, src, variable.type);
  1994. ReleaseIntermediateOperand(src);
  1995. ReleaseIntermediateOperand(dst);
  1996. END;
  1997. variable := variable.nextVariable;
  1998. END;
  1999. recordBase := recordType.GetBaseRecord();
  2000. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2001. GetRecordTypeName (recordBase,name);
  2002. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2003. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2004. Emit(Br(position,op));
  2005. ELSE
  2006. Emit(Exit(position,0,0));
  2007. END;
  2008. IF ~recordType.isObject THEN
  2009. GetRecordTypeName (recordType,name);
  2010. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2011. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2012. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2013. NEW(registerUsageCount);
  2014. usedRegisters := NIL;
  2015. dst := NewRegisterOperand (addressType);
  2016. src := NewRegisterOperand (addressType);
  2017. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2018. Emit(Mov(position, dst, parameter1));
  2019. Emit(Mov(position, src, parameter2));
  2020. label := NewLabel();
  2021. SetLabel(label);
  2022. Emit(Push(position, dst));
  2023. Emit(Push(position, src));
  2024. GetRecordTypeName (recordType,name);
  2025. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2026. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2027. Emit(Call(position, op, 0));
  2028. Emit(Pop(position, src));
  2029. Emit(Pop(position, dst));
  2030. Emit(Add(position, dst, dst, ofs));
  2031. Emit(Add(position, src, src, ofs));
  2032. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2033. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2034. Emit(Exit(position,0,0));
  2035. END;
  2036. INC(statCoopAssignProcedure, section.pc);
  2037. ReturnToContext(context);
  2038. IF dump # NIL THEN dump := section.comments END;
  2039. END CreateAssignProcedure;
  2040. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2041. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2042. BEGIN
  2043. IF IsUnsafePointer (type) THEN
  2044. skip := NewLabel();
  2045. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2046. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2047. BreqL (skip, op, nil);
  2048. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2049. SetLabel (skip);
  2050. ELSIF SemanticChecker.IsPointerType (type) THEN
  2051. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2052. CallThis(position,"GarbageCollector","Mark", 1);
  2053. ELSIF type.IsRecordType() THEN
  2054. Emit (Push(position,register));
  2055. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2056. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2057. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2058. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2059. ELSIF IsStaticArray(type) THEN
  2060. size := StaticArrayNumElements(type);
  2061. base := StaticArrayBaseType(type);
  2062. IF base.IsRecordType() THEN
  2063. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2064. Emit (Push(position, register));
  2065. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2066. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2067. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2068. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2069. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2070. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2071. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2072. Emit (Push(position, register));
  2073. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2074. ELSE
  2075. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2076. Emit (Push(position, register));
  2077. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2078. ASSERT(base.IsPointer());
  2079. END;
  2080. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2081. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2082. CallThis(position,"GarbageCollector","Mark", 1);
  2083. ELSE HALT(100); (* missing ? *)
  2084. END;
  2085. END CallTraceMethod;
  2086. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2087. VAR name, pointer: Basic.SegmentedName; previousSection,source: IntermediateCode.Section;
  2088. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType; size: LONGINT; base: SyntaxTree.Type;
  2089. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2090. BEGIN
  2091. previousSection := section;
  2092. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2093. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2094. GetRecordTypeName (recordType,name);
  2095. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2096. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2097. IF dump # NIL THEN dump := section.comments END;
  2098. variable := recordType.recordScope.firstVariable;
  2099. WHILE variable # NIL DO
  2100. IF variable.NeedsTrace() THEN
  2101. register := NewRegisterOperand (addressType);
  2102. Emit (Mov(position,register,parameter1));
  2103. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2104. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2105. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2106. END;
  2107. CallTraceMethod(register, variable.type);
  2108. ReleaseIntermediateOperand(register);
  2109. END;
  2110. variable := variable.nextVariable;
  2111. END;
  2112. recordBase := recordType.GetBaseRecord();
  2113. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2114. recordBase := recordBase.GetBaseRecord();
  2115. END;
  2116. IF recordBase # NIL THEN
  2117. GetRecordTypeName (recordBase,name);
  2118. IF HasExplicitTraceMethod (recordBase) THEN
  2119. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2120. ELSE
  2121. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2122. END;
  2123. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2124. Emit(Br(position,op));
  2125. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2126. Emit(Exit(position,0,0));
  2127. ELSE
  2128. IF recordType.isObject THEN
  2129. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2130. ELSE
  2131. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2132. END;
  2133. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2134. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2135. Emit(Br(position,op));
  2136. END;
  2137. IF ~recordType.isObject THEN
  2138. GetRecordTypeName (recordType,name);
  2139. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2140. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2141. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2142. NEW(registerUsageCount);
  2143. usedRegisters := NIL;
  2144. IF dump # NIL THEN dump := section.comments END;
  2145. register := NewRegisterOperand (addressType);
  2146. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2147. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2148. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2149. END;
  2150. Emit (Push(position,register));
  2151. GetRecordTypeName (recordType,name);
  2152. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2153. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2154. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2155. ReleaseIntermediateOperand(register);
  2156. Emit(Exit(position,0,0));
  2157. GetRecordTypeName (recordType,name);
  2158. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2159. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2160. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2161. NEW(registerUsageCount);
  2162. usedRegisters := NIL;
  2163. register := NewRegisterOperand (addressType);
  2164. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2165. Emit(Mov(position, register, parameter1));
  2166. label := NewLabel();
  2167. SetLabel(label);
  2168. Emit(Push(position, register));
  2169. GetRecordTypeName (recordType,name);
  2170. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2171. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2172. Emit(Call(position, op, 0));
  2173. Emit(Pop(position, register));
  2174. Emit(Add(position, register, register, ofs));
  2175. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2176. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2177. Emit(Exit(position,0,0));
  2178. END;
  2179. INC(statCoopTraceMethod, section.pc);
  2180. ReturnToContext(context);
  2181. IF dump # NIL THEN dump := section.comments END;
  2182. END CreateTraceMethod;
  2183. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2184. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2185. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType; size: LONGINT;
  2186. parameter1, parameter0: IntermediateCode.Operand; label: Label; previousUsedRegisters: RegisterEntry;
  2187. previousRegisterUsageCount: RegisterUsageCount; context: Context;
  2188. BEGIN
  2189. IF recordType.isObject THEN RETURN END;
  2190. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2191. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2192. GetRecordTypeName (recordType,name);
  2193. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2194. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2195. IF dump # NIL THEN dump := section.comments END;
  2196. variable := recordType.recordScope.firstVariable;
  2197. WHILE variable # NIL DO
  2198. IF variable.NeedsTrace() THEN
  2199. dst := NewRegisterOperand (addressType);
  2200. Emit (Mov(position, dst, parameter1));
  2201. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2202. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2203. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2204. END;
  2205. CallResetProcedure(dst, nil, variable.type);
  2206. ReleaseIntermediateOperand(dst);
  2207. END;
  2208. variable := variable.nextVariable;
  2209. END;
  2210. recordBase := recordType.GetBaseRecord();
  2211. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2212. GetRecordTypeName (recordBase,name);
  2213. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2214. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2215. Emit(Br(position,op));
  2216. ELSE
  2217. Emit(Exit(position,0,0));
  2218. END;
  2219. GetRecordTypeName (recordType,name);
  2220. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2221. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2222. section := IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE);
  2223. NEW(registerUsageCount);
  2224. usedRegisters := NIL;
  2225. dst := NewRegisterOperand (addressType);
  2226. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2227. Emit(Mov(position, dst, parameter1));
  2228. label := NewLabel();
  2229. SetLabel(label);
  2230. Emit(Push(position, dst));
  2231. GetRecordTypeName (recordType,name);
  2232. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2233. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2234. Emit(Call(position, op, 0));
  2235. Emit(Pop(position, dst));
  2236. Emit(Add(position, dst, dst, ofs));
  2237. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2238. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2239. Emit(Exit(position,0,0));
  2240. INC(statCoopResetProcedure, section.pc);
  2241. ReturnToContext(context);
  2242. IF dump # NIL THEN dump := section.comments END;
  2243. END CreateResetProcedure;
  2244. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2245. VAR name: Basic.SegmentedName; context: Context;
  2246. BEGIN
  2247. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2248. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2249. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2250. IF dump # NIL THEN dump := section.comments END;
  2251. Emit(Push(position,fp));
  2252. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2253. ResetVariables(scope);
  2254. Emit(Pop(position,fp));
  2255. Emit(Exit(position,0,0));
  2256. ReturnToContext(context);
  2257. IF dump # NIL THEN dump := section.comments END;
  2258. END CreateResetMethod;
  2259. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2260. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2261. BEGIN
  2262. IF SemanticChecker.IsPointerType (type) THEN
  2263. Emit (Push(position, dest));
  2264. CallThis(position,"GarbageCollector","Reset", 1);
  2265. ELSIF type.IsRecordType() THEN
  2266. Emit (Push(position, dest));
  2267. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2268. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2269. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2270. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2271. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2272. size := GetArrayLength(type, tag);
  2273. base := ArrayBaseType(type);
  2274. IF base.IsRecordType() THEN
  2275. Emit (Push(position, size));
  2276. Emit (Push(position, dest));
  2277. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2278. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2279. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2280. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2281. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2282. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2283. Emit (Push(position, size));
  2284. Emit (Push(position, dest));
  2285. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2286. ELSE
  2287. Emit (Push(position, size));
  2288. Emit (Push(position, dest));
  2289. CallThis(position,"GarbageCollector","ResetArray", 2);
  2290. ASSERT(ArrayBaseType(type).IsPointer());
  2291. END;
  2292. ReleaseIntermediateOperand(size);
  2293. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2294. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2295. Emit (Push(position, dest));
  2296. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2297. ELSE HALT(100); (* missing ? *)
  2298. END;
  2299. END CallResetProcedure;
  2300. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2301. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2302. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2303. VAR operand: Operand;
  2304. BEGIN
  2305. Symbol (symbol, operand);
  2306. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2307. ReleaseOperand(operand);
  2308. END Reset;
  2309. BEGIN
  2310. previousScope := currentScope;
  2311. currentScope := scope;
  2312. pc := section.pc;
  2313. variable := scope.firstVariable;
  2314. WHILE variable # NIL DO
  2315. IF variable.NeedsTrace() THEN
  2316. Reset (variable);
  2317. END;
  2318. variable := variable.nextVariable;
  2319. END;
  2320. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2321. WHILE parameter # NIL DO
  2322. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2323. Reset (parameter);
  2324. END;
  2325. parameter := parameter.nextParameter;
  2326. END;
  2327. INC(statCoopResetVariables, section.pc - pc);
  2328. currentScope := previousScope;
  2329. END ResetVariables;
  2330. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2331. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2332. VAR op: IntermediateCode.Operand; context: Context;
  2333. BEGIN
  2334. previousSection := section;
  2335. GetCodeSectionNameForSymbol(procedure, name);
  2336. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  2337. context := SwitchContext(IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE));
  2338. IF dump # NIL THEN dump := section.comments END;
  2339. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2340. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2341. Emit(Data(position,op));
  2342. Emit(Data(position,nil));
  2343. IF HasPointers (procedure.procedureScope) THEN
  2344. GetCodeSectionNameForSymbol(procedure, name);
  2345. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2346. ELSE
  2347. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2348. END;
  2349. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2350. Emit(Data(position,op));
  2351. ReturnToContext(context);
  2352. IF dump # NIL THEN dump := section.comments END;
  2353. END CreateProcedureDescriptor;
  2354. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2355. VAR import: SyntaxTree.Import;
  2356. s: Basic.MessageString;
  2357. selfName: SyntaxTree.IdentifierString;
  2358. BEGIN
  2359. moduleScope.ownerModule.GetName(selfName);
  2360. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2361. module := moduleScope.ownerModule
  2362. ELSE
  2363. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2364. IF import = NIL THEN
  2365. import := SyntaxTree.NewImport(-1,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),TRUE);
  2366. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2367. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2368. s := "Module ";
  2369. Strings.Append(s,moduleName);
  2370. Strings.Append(s," cannot be imported.");
  2371. IF force THEN
  2372. Error(position,s);
  2373. ELSIF canBeLoaded THEN
  2374. Strings.Append(s, "=> no dynamic linking.");
  2375. Warning(position, s);
  2376. canBeLoaded := FALSE;
  2377. END;
  2378. RETURN FALSE
  2379. ELSE
  2380. SELF.module.imports.AddName(moduleName)
  2381. END;
  2382. ELSIF import.module = NIL THEN (* already tried *)
  2383. RETURN FALSE
  2384. END;
  2385. module := import.module;
  2386. END;
  2387. RETURN TRUE
  2388. END AddImport;
  2389. (* needed for old binary object file format*)
  2390. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2391. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2392. BEGIN
  2393. IF AddImport(moduleName,module,TRUE) THEN
  2394. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2395. IF procedure = NIL THEN
  2396. s := "Instruction not supported on target, emulation procedure ";
  2397. Strings.Append(s,moduleName);
  2398. Strings.Append(s,".");
  2399. Strings.Append(s,procedureName);
  2400. Strings.Append(s," not present");
  2401. Error(position,s);
  2402. ELSE
  2403. StaticCallOperand(r,procedure);
  2404. ReleaseOperand(r);
  2405. fp := GetFingerprint(procedure);
  2406. END;
  2407. END;
  2408. END EnsureSymbol;
  2409. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2410. VAR exit: Label; trueL,falseL: Label;
  2411. BEGIN
  2412. trueL := NewLabel();
  2413. falseL := NewLabel();
  2414. exit := NewLabel();
  2415. Condition(x,trueL,falseL);
  2416. InitOperand(result,ModeValue);
  2417. SetLabel(trueL);
  2418. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2419. Emit(Mov(position,result.op,true));
  2420. BrL(exit);
  2421. SetLabel(falseL);
  2422. Emit(MovReplace(position,result.op,false));
  2423. SetLabel(exit);
  2424. END ConditionToValue;
  2425. PROCEDURE ValueToCondition(VAR op: Operand);
  2426. BEGIN
  2427. LoadValue(op,system.booleanType);
  2428. BrneL(trueLabel,op.op, false);
  2429. ReleaseOperand(op);
  2430. BrL(falseLabel);
  2431. END ValueToCondition;
  2432. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2433. VAR size: LONGINT;
  2434. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2435. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2436. BEGIN
  2437. ASSERT(type.form = SyntaxTree.Open);
  2438. baseType := type.arrayBase.resolved;
  2439. IF IsOpenArray(baseType) THEN
  2440. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2441. ELSE
  2442. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2443. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2444. END;
  2445. len := tag;
  2446. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2447. IntermediateCode.MakeMemory(len,addressType);
  2448. UseIntermediateOperand(len);
  2449. Reuse2(res,sizeOperand,len);
  2450. Emit(Mul(position,res,sizeOperand,len));
  2451. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2452. RETURN res
  2453. END GetArraySize;
  2454. BEGIN
  2455. type := type.resolved;
  2456. IF IsOpenArray(type) THEN
  2457. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2458. RETURN tag
  2459. ELSE
  2460. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2461. END;
  2462. ELSE
  2463. size := ToMemoryUnits(system,system.SizeOf(type));
  2464. RETURN IntermediateCode.Immediate(addressType,size)
  2465. END;
  2466. END GetDynamicSize;
  2467. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2468. VAR size: LONGINT;
  2469. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2470. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2471. BEGIN
  2472. ASSERT(type.form = SyntaxTree.Open);
  2473. baseType := type.arrayBase.resolved;
  2474. IF IsOpenArray(baseType) THEN
  2475. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2476. ELSE
  2477. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2478. END;
  2479. len := tag;
  2480. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2481. IntermediateCode.MakeMemory(len,addressType);
  2482. UseIntermediateOperand(len);
  2483. Reuse2(res,sizeOperand,len);
  2484. Emit(Mul(position,res,sizeOperand,len));
  2485. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2486. RETURN res
  2487. END GetLength;
  2488. BEGIN
  2489. type := type.resolved;
  2490. IF IsOpenArray(type) THEN
  2491. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2492. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2493. ELSE
  2494. RETURN IntermediateCode.Immediate(addressType,1)
  2495. END;
  2496. END GetArrayLength;
  2497. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2498. VAR result: IntermediateCode.Operand;
  2499. BEGIN
  2500. IF backend.cooperative THEN
  2501. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2502. ELSE
  2503. MakeMemory(result, tag, addressType, 0);
  2504. END;
  2505. RETURN result
  2506. END GetSizeFromTag;
  2507. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2508. VAR parameter: SyntaxTree.Parameter;
  2509. BEGIN
  2510. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2511. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2512. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2513. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2514. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2515. END;
  2516. RETURN GetDynamicSize(e.type, tag);
  2517. END GetArrayOfBytesSize;
  2518. (*
  2519. to find imported symbol. not needed ?
  2520. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2521. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2522. BEGIN
  2523. IF AddImport(moduleName,importedModule,FALSE) THEN
  2524. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2525. RETURN symbol
  2526. ELSE
  2527. RETURN NIL
  2528. END
  2529. END SymbolByName;
  2530. *)
  2531. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2532. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2533. BEGIN
  2534. IF AddImport(moduleName,runtimeModule,force) THEN
  2535. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2536. IF procedure = NIL THEN
  2537. s := "Procedure ";
  2538. Strings.Append(s,moduleName);
  2539. Strings.Append(s,".");
  2540. Strings.Append(s,procedureName);
  2541. Strings.Append(s," not present");
  2542. Error(position,s);
  2543. RETURN FALSE
  2544. ELSE
  2545. RETURN TRUE
  2546. END;
  2547. ELSE RETURN FALSE
  2548. END;
  2549. END GetRuntimeProcedure;
  2550. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2551. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2552. s: Basic.MessageString;
  2553. BEGIN
  2554. Basic.InitSegmentedName(name);
  2555. name[0] := Basic.MakeString(moduleName);
  2556. name[1] := Basic.MakeString(typeName);
  2557. name[2] := -1;
  2558. IF AddImport(moduleName,importedModule, FALSE) THEN
  2559. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2560. IF symbol = NIL THEN
  2561. s := "type ";
  2562. Strings.Append(s,moduleName);
  2563. Strings.Append(s,".");
  2564. Strings.Append(s,typeName);
  2565. Strings.Append(s," not present");
  2566. Error(position,s);
  2567. END;
  2568. ELSE symbol := NIL;
  2569. END;
  2570. IF importedModule = moduleScope.ownerModule THEN
  2571. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2572. ELSE
  2573. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2574. END;
  2575. RETURN symbol
  2576. END GetTypeDescriptor;
  2577. (* 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. *)
  2578. PROCEDURE CallThis(position: LONGINT; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2579. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2580. pooledName: Basic.SegmentedName; size: LONGINT;
  2581. BEGIN
  2582. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2583. StaticCallOperand(result,procedure);
  2584. IF numberParameters < 0 THEN
  2585. size := ProcedureParametersSize(system,procedure);
  2586. ELSE
  2587. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2588. IF size # ProcedureParametersSize(system,procedure) THEN
  2589. Error(position,"runtime call parameter count mismatch");
  2590. END;
  2591. END;
  2592. Emit(Call(position, result.op, size));
  2593. ReleaseOperand(result);
  2594. ELSE (* only static linking possible *)
  2595. Basic.InitSegmentedName(pooledName);
  2596. pooledName[0] := Basic.MakeString(moduleName);
  2597. pooledName[1] := Basic.MakeString(procedureName);
  2598. pooledName[2] := -1;
  2599. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2600. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2601. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2602. END;
  2603. END CallThis;
  2604. (* call moduleName.procedureName if it can be imported, otherwise use altModuleName.altProcedureName *)
  2605. PROCEDURE CallThis2(CONST moduleName, procedureName,altModuleName, altProcedureName: ARRAY OF CHAR;numberParameters: LONGINT; return: IntermediateCode.Operand);
  2606. VAR procedure: SyntaxTree.Procedure; result: Operand; address: IntermediateCode.Operand; source: IntermediateCode.Section;
  2607. pooledName: Basic.SegmentedName;
  2608. BEGIN
  2609. ASSERT(numberParameters >= 0);
  2610. IF GetRuntimeProcedure(moduleName,procedureName,procedure,FALSE) THEN (* ready for dynamic linking *)
  2611. StaticCallOperand(result,procedure);
  2612. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  2613. Emit(Result(position,return));
  2614. ReleaseOperand(result);
  2615. ELSE (* only static linking possible *)
  2616. Basic.InitSegmentedName(pooledName);
  2617. pooledName[0] := Basic.MakeString(altModuleName);
  2618. pooledName[1] := Basic.MakeString(altProcedureName);
  2619. pooledName[2] := -1;
  2620. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2621. IntermediateCode.InitAddress(address, addressType, pooledName , 0, 0);
  2622. Emit(Call(position,address, ToMemoryUnits(system, numberParameters * system.addressSize)));
  2623. Emit(Result(position,return));
  2624. END;
  2625. END CallThis2;
  2626. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2627. VAR
  2628. left,right: Operand;
  2629. leftSize, rightSize: IntermediateCode.Operand;
  2630. procedure: SyntaxTree.Procedure;
  2631. saved: RegisterEntry;
  2632. reg: IntermediateCode.Operand;
  2633. procedureName: SyntaxTree.IdentifierString;
  2634. BEGIN
  2635. procedureName := "CompareString";
  2636. SaveRegisters();ReleaseUsedRegisters(saved);
  2637. Designate(leftExpression,left);
  2638. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2639. Emit(Push(position,leftSize));
  2640. ReleaseIntermediateOperand(leftSize);
  2641. Emit(Push(position,left.op));
  2642. ReleaseOperand(left);
  2643. Designate(rightExpression,right);
  2644. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2645. Emit(Push(position,rightSize));
  2646. ReleaseIntermediateOperand(rightSize);
  2647. Emit(Push(position,right.op));
  2648. ReleaseOperand(right);
  2649. IF backend.cooperative THEN
  2650. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2651. ELSE
  2652. CallThis(position,runtimeModuleName,procedureName, 4);
  2653. END;
  2654. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2655. Emit(Result(position,reg));
  2656. (*
  2657. AcquireThisRegister(int8,IntermediateCode.Result);
  2658. *)
  2659. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2660. (*
  2661. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2662. *)
  2663. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2664. ReleaseIntermediateOperand(reg);
  2665. BrL(falseLabel);
  2666. END CompareString;
  2667. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2668. VAR
  2669. left,right: Operand;
  2670. leftSize, rightSize: IntermediateCode.Operand;
  2671. procedure: SyntaxTree.Procedure;
  2672. saved: RegisterEntry;
  2673. procedureName: SyntaxTree.IdentifierString;
  2674. BEGIN
  2675. procedureName := "CopyString";
  2676. SaveRegisters();ReleaseUsedRegisters(saved);
  2677. Designate(leftExpression,left);
  2678. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2679. Emit(Push(position,leftSize));
  2680. ReleaseIntermediateOperand(leftSize);
  2681. Emit(Push(position,left.op));
  2682. ReleaseOperand(left);
  2683. Designate(rightExpression,right);
  2684. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2685. Emit(Push(position,rightSize));
  2686. ReleaseIntermediateOperand(rightSize);
  2687. Emit(Push(position,right.op));
  2688. ReleaseOperand(right);
  2689. IF backend.cooperative THEN
  2690. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2691. ELSE
  2692. CallThis(position,runtimeModuleName,procedureName,4);
  2693. END;
  2694. RestoreRegisters(saved);
  2695. END CopyString;
  2696. PROCEDURE VisitBinaryExpression(x: SyntaxTree.BinaryExpression);
  2697. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  2698. leftType,rightType: SyntaxTree.Type;
  2699. leftExpression,rightExpression : SyntaxTree.Expression;
  2700. componentType: IntermediateCode.Type;
  2701. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  2702. size: LONGINT;
  2703. BEGIN
  2704. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  2705. dest := destination; destination := emptyOperand;
  2706. leftType := x.left.type.resolved;
  2707. rightType := x.right.type.resolved;
  2708. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  2709. CASE x.operator OF
  2710. Scanner.Or:
  2711. (* shortcut evaluation of left OR right *)
  2712. IF ~conditional THEN ConditionToValue(x);
  2713. ELSE
  2714. next := NewLabel();
  2715. Condition(x.left,trueLabel,next);
  2716. SetLabel(next);
  2717. Condition(x.right,trueLabel,falseLabel);
  2718. END;
  2719. |Scanner.And:
  2720. (* shortcut evaluation of left & right *)
  2721. IF ~conditional THEN ConditionToValue(x);
  2722. ELSE
  2723. next := NewLabel();
  2724. Condition(x.left,next,falseLabel);
  2725. SetLabel(next);
  2726. Condition(x.right,trueLabel,falseLabel);
  2727. END;
  2728. |Scanner.Is:
  2729. IF ~conditional THEN ConditionToValue(x);
  2730. ELSE
  2731. (* get type desc tag *)
  2732. IF IsPointerToRecord(leftType,recordType) THEN
  2733. Evaluate(x.left,left);
  2734. Dereference(left,recordType,IsUnsafePointer(leftType))
  2735. ELSE
  2736. Designate(x.left,left);
  2737. END;
  2738. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  2739. ReleaseOperand(left);
  2740. END;
  2741. |Scanner.Plus:
  2742. Evaluate(x.left,left);
  2743. Evaluate(x.right,right);
  2744. IF leftType IS SyntaxTree.SetType THEN
  2745. InitOperand(result,ModeValue);
  2746. Reuse2a(result.op,left.op,right.op,dest);
  2747. Emit(Or(position,result.op,left.op,right.op));
  2748. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2749. InitOperand(result,ModeValue);
  2750. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2751. Reuse2(result.tag,left.tag,right.tag);
  2752. Emit(Add(position,result.op,left.op,right.op));
  2753. Emit(Add(position,result.tag,left.tag,right.tag))
  2754. ELSE
  2755. InitOperand(result,ModeValue);
  2756. Reuse2a(result.op,left.op,right.op,dest);
  2757. Emit(Add(position,result.op,left.op,right.op));
  2758. END;
  2759. ReleaseOperand(left); ReleaseOperand(right);
  2760. |Scanner.Minus:
  2761. Evaluate(x.left,left);
  2762. Evaluate(x.right,right);
  2763. IF leftType IS SyntaxTree.SetType THEN
  2764. InitOperand(result,ModeValue);
  2765. Reuse1(result.op,right.op);
  2766. Emit(Not(position,result.op,right.op));
  2767. ReleaseOperand(right);
  2768. Emit(And(position,result.op,result.op,left.op));
  2769. ReleaseOperand(left);
  2770. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2771. InitOperand(result,ModeValue);
  2772. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  2773. Reuse2(result.tag,left.tag,right.tag);
  2774. Emit(Sub(position,result.op,left.op,right.op));
  2775. Emit(Sub(position,result.tag,left.tag,right.tag));
  2776. ReleaseOperand(left); ReleaseOperand(right)
  2777. ELSE
  2778. InitOperand(result,ModeValue);
  2779. Reuse2a(result.op,left.op,right.op,dest);
  2780. Emit(Sub(position,result.op,left.op,right.op));
  2781. ReleaseOperand(left); ReleaseOperand(right);
  2782. END;
  2783. |Scanner.Times:
  2784. Evaluate(x.left,left);
  2785. Evaluate(x.right,right);
  2786. IF leftType IS SyntaxTree.SetType THEN
  2787. InitOperand(result,ModeValue);
  2788. Reuse2a(result.op,left.op,right.op,dest);
  2789. Emit(And(position,result.op,left.op,right.op));
  2790. ELSIF (x.type.resolved IS SyntaxTree.IntegerType) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2791. InitOperand(result,ModeValue);
  2792. Reuse1a(result.op,left.op,dest);
  2793. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2794. Emit(Shl(position,result.op,left.op,right.op));
  2795. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2796. InitOperand(result, ModeValue);
  2797. componentType := left.op.type;
  2798. (* TODO: review this *)
  2799. (*
  2800. result.op = left.op * right.op - left.tag * right.tag
  2801. result.tag = left.tag * right.op + left.op * right.tag
  2802. *)
  2803. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2804. Emit(Mul(position,result.op, left.op, right.op));
  2805. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2806. Emit(Mul(position,tempReg, left.tag, right.tag));
  2807. Emit(Sub(position,result.op, result.op, tempReg));
  2808. Reuse2(result.tag, left.tag, right.op);
  2809. Emit(Mul(position,result.tag, left.tag, right.op));
  2810. Emit(Mul(position,tempReg, left.op, right.tag));
  2811. Emit(Add(position,result.tag, result.tag, tempReg));
  2812. ReleaseIntermediateOperand(tempReg)
  2813. ELSE
  2814. InitOperand(result,ModeValue);
  2815. Reuse2a(result.op,left.op,right.op,dest);
  2816. Emit(Mul(position,result.op,left.op,right.op));
  2817. END;
  2818. ReleaseOperand(left); ReleaseOperand(right);
  2819. |Scanner.Div:
  2820. Evaluate(x.left,left);
  2821. Evaluate(x.right,right);
  2822. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2823. InitOperand(result,ModeValue);
  2824. Reuse1a(result.op,left.op,dest);
  2825. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system, system.longintType),exp);
  2826. Emit(Shr(position,result.op,left.op,right.op));
  2827. ELSE
  2828. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2829. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2830. IF ~isUnchecked THEN
  2831. exit := NewLabel();
  2832. BrltL(exit,zero,right.op);
  2833. EmitTrap(position,NegativeDivisorTrap);
  2834. SetLabel(exit);
  2835. END;
  2836. END;
  2837. InitOperand(result,ModeValue);
  2838. Reuse2a(result.op,left.op,right.op,dest);
  2839. Emit(Div(position,result.op,left.op,right.op));
  2840. END;
  2841. ReleaseOperand(left); ReleaseOperand(right);
  2842. |Scanner.Mod:
  2843. Evaluate(x.left,left);
  2844. Evaluate(x.right,right);
  2845. IF ((x.type.resolved IS SyntaxTree.IntegerType) OR (x.type.resolved IS SyntaxTree.AddressType)) & IsIntegerConstant(x.right,value) & PowerOf2(value,exp) THEN
  2846. IntermediateCode.InitImmediate(right.op,IntermediateCode.GetType(system,x.type),value-1);
  2847. InitOperand(result,ModeValue);
  2848. Reuse1a(result.op,left.op,dest);
  2849. Emit(And(position,result.op,left.op,right.op));
  2850. ELSE
  2851. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  2852. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  2853. IF ~isUnchecked THEN
  2854. exit := NewLabel();
  2855. BrltL(exit,zero,right.op);
  2856. EmitTrap(position,NegativeDivisorTrap);
  2857. SetLabel(exit);
  2858. END;
  2859. END;
  2860. InitOperand(result,ModeValue);
  2861. Reuse2a(result.op,left.op,right.op,dest);
  2862. Emit(Mod(position,result.op,left.op,right.op));
  2863. END;
  2864. ReleaseOperand(left); ReleaseOperand(right);
  2865. |Scanner.Slash:
  2866. Evaluate(x.left,left);
  2867. Evaluate(x.right,right);
  2868. IF leftType IS SyntaxTree.SetType THEN
  2869. InitOperand(result,ModeValue);
  2870. Reuse2a(result.op,left.op,right.op,dest);
  2871. Emit(Xor(position,result.op,left.op,right.op));
  2872. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2873. InitOperand(result,ModeValue);
  2874. componentType := left.op.type;
  2875. (* review this *)
  2876. (*
  2877. divisor = right.op * right.op + right.tag * right.tag
  2878. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  2879. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  2880. *)
  2881. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2882. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2883. Emit(Mul(position,tempReg, right.op, right.op));
  2884. Emit(Mul(position,tempReg2, right.tag, right.tag));
  2885. Emit(Add(position,tempReg, tempReg, tempReg2));
  2886. result.op := tempReg2;
  2887. Emit(Mul(position,result.op, left.op, right.op));
  2888. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  2889. Emit(Mul(position,tempReg2, left.tag, right.tag));
  2890. Emit(Add(position,result.op, result.op, tempReg2));
  2891. Emit(Div(position,result.op, result.op, tempReg));
  2892. Reuse2(result.tag, left.tag, right.op);
  2893. Emit(Mul(position,result.tag, left.tag, right.op));
  2894. Emit(Mul(position,tempReg2, left.op, right.tag));
  2895. Emit(Sub(position,result.tag, result.tag, tempReg2));
  2896. Emit(Div(position,result.tag, result.tag, tempReg));
  2897. ReleaseIntermediateOperand(tempReg);
  2898. ReleaseIntermediateOperand(tempReg2)
  2899. ELSE
  2900. InitOperand(result,ModeValue);
  2901. Reuse2a(result.op,left.op,right.op,dest);
  2902. Emit(Div(position,result.op,left.op,right.op));
  2903. END;
  2904. ReleaseOperand(left); ReleaseOperand(right);
  2905. |Scanner.Equal:
  2906. IF ~conditional THEN ConditionToValue(x);
  2907. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2908. CompareString(BreqL,x.left,x.right);
  2909. ELSE
  2910. Evaluate(x.left,left);
  2911. Evaluate(x.right,right);
  2912. IF leftType IS SyntaxTree.RangeType THEN
  2913. ASSERT(rightType IS SyntaxTree.RangeType);
  2914. BrneL(falseLabel, left.op, right.op); (* first *)
  2915. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2916. BrneL(falseLabel, left.extra, right.extra); (* step *)
  2917. ReleaseOperand(left); ReleaseOperand(right);
  2918. BrL(trueLabel)
  2919. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  2920. BrneL(falseLabel, left.op, right.op); (* first *)
  2921. BrneL(falseLabel, left.tag, right.tag); (* last *)
  2922. ReleaseOperand(left); ReleaseOperand(right);
  2923. BrL(trueLabel)
  2924. ELSIF leftType IS SyntaxTree.ComplexType THEN
  2925. (* TODO: review this *)
  2926. BrneL(falseLabel, left.op, right.op); (* real part *)
  2927. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  2928. ReleaseOperand(left); ReleaseOperand(right);
  2929. BrL(trueLabel)
  2930. ELSE
  2931. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  2932. ReleaseOperand(left); ReleaseOperand(right);
  2933. BrL(trueLabel);
  2934. END;
  2935. END;
  2936. |Scanner.LessEqual:
  2937. IF ~conditional THEN ConditionToValue(x);
  2938. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2939. CompareString(BrgeL,x.right,x.left);
  2940. ELSE
  2941. Evaluate(x.left,left);
  2942. Evaluate(x.right,right);
  2943. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  2944. Reuse1(temp.op,right.op);
  2945. Emit(And(position,temp.op,left.op,right.op));
  2946. ReleaseOperand(right);
  2947. BreqL(trueLabel,temp.op,left.op);
  2948. BrL(falseLabel);
  2949. ReleaseOperand(temp);ReleaseOperand(left);
  2950. ELSE
  2951. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  2952. ReleaseOperand(left); ReleaseOperand(right);
  2953. BrL(trueLabel);
  2954. END;
  2955. END;
  2956. |Scanner.Less:
  2957. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  2958. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.LessEqual);
  2959. leftExpression.SetType(system.booleanType);
  2960. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  2961. rightExpression.SetType(system.booleanType);
  2962. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  2963. leftExpression.SetType(system.booleanType);
  2964. Expression(leftExpression);
  2965. ELSIF ~conditional THEN ConditionToValue(x);
  2966. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2967. CompareString(BrltL,x.left,x.right);
  2968. ELSE
  2969. Evaluate(x.left,left);
  2970. Evaluate(x.right,right);
  2971. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  2972. ReleaseOperand(left); ReleaseOperand(right);
  2973. BrL(trueLabel);
  2974. END;
  2975. |Scanner.Greater:
  2976. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  2977. leftExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.GreaterEqual);
  2978. leftExpression.SetType(system.booleanType);
  2979. rightExpression := SyntaxTree.NewBinaryExpression(-1,x.left,x.right,Scanner.Unequal);
  2980. rightExpression.SetType(system.booleanType);
  2981. leftExpression := SyntaxTree.NewBinaryExpression(-1,leftExpression,rightExpression,Scanner.And);
  2982. leftExpression.SetType(system.booleanType);
  2983. Expression(leftExpression);
  2984. ELSIF ~conditional THEN ConditionToValue(x);
  2985. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2986. CompareString(BrltL,x.right,x.left);
  2987. ELSE
  2988. Evaluate(x.left,left);
  2989. Evaluate(x.right,right);
  2990. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  2991. ReleaseOperand(left); ReleaseOperand(right);
  2992. BrL(trueLabel);
  2993. END;
  2994. |Scanner.GreaterEqual:
  2995. IF ~conditional THEN ConditionToValue(x);
  2996. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  2997. CompareString(BrgeL,x.left,x.right);
  2998. ELSE
  2999. Evaluate(x.left,left);
  3000. Evaluate(x.right,right);
  3001. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3002. Reuse1(temp.op,left.op);
  3003. Emit(And(position,temp.op,left.op,right.op));
  3004. ReleaseOperand(left);
  3005. BreqL(trueLabel, temp.op,right.op);
  3006. ReleaseOperand(temp); ReleaseOperand(right);
  3007. BrL(falseLabel);
  3008. ELSE
  3009. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3010. ReleaseOperand(left); ReleaseOperand(right);
  3011. BrL(trueLabel);
  3012. END;
  3013. END;
  3014. |Scanner.Unequal:
  3015. IF ~conditional THEN ConditionToValue(x);
  3016. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3017. CompareString(BrneL,x.left,x.right);
  3018. ELSE
  3019. Evaluate(x.left,left);
  3020. Evaluate(x.right,right);
  3021. IF leftType IS SyntaxTree.RangeType THEN
  3022. ASSERT(rightType IS SyntaxTree.RangeType);
  3023. BrneL(trueLabel, left.op, right.op); (* first *)
  3024. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3025. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3026. ReleaseOperand(left); ReleaseOperand(right);
  3027. BrL(falseLabel)
  3028. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3029. BrneL(trueLabel, left.op, right.op); (* first *)
  3030. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3031. ReleaseOperand(left); ReleaseOperand(right);
  3032. BrL(falseLabel)
  3033. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3034. (* TODO: review this *)
  3035. BrneL(trueLabel, left.op, right.op); (* real part *)
  3036. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3037. ReleaseOperand(left); ReleaseOperand(right);
  3038. BrL(falseLabel)
  3039. ELSE
  3040. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3041. ReleaseOperand(left); ReleaseOperand(right);
  3042. BrL(trueLabel);
  3043. END;
  3044. END;
  3045. |Scanner.In:
  3046. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3047. Evaluate(x.left,left);
  3048. Evaluate(x.right,right);
  3049. Convert(left.op,setType);
  3050. ReuseCopy(temp.op,right.op);
  3051. Emit(Shr(position,temp.op,temp.op,left.op));
  3052. ReleaseOperand(right); ReleaseOperand(left);
  3053. IntermediateCode.InitImmediate(one,setType,1);
  3054. Emit(And(position,temp.op,temp.op,one));
  3055. IF conditional THEN
  3056. IntermediateCode.InitImmediate(zero,setType,0);
  3057. BrneL(trueLabel,temp.op,zero);
  3058. ReleaseOperand(temp);
  3059. BrL(falseLabel);
  3060. ELSE
  3061. Convert(temp.op,bool);
  3062. result.mode := ModeValue;
  3063. result.op := temp.op;
  3064. result.tag := nil; (* may be left over from calls to evaluate *)
  3065. END;
  3066. |Scanner.Questionmarks:
  3067. Evaluate(x.left, left);
  3068. Emit(Push(position,left.op));
  3069. ReleaseOperand(left);
  3070. Designate(x.right, right);
  3071. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3072. IF ~backend.cellsAreObjects THEN
  3073. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3074. END;
  3075. Emit(Push(position,right.op));
  3076. ReleaseOperand(right);
  3077. IF backend.cellsAreObjects THEN
  3078. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3079. ELSE
  3080. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3081. END;
  3082. InitOperand(result, ModeValue);
  3083. result.op := NewRegisterOperand(bool);
  3084. Emit(Result(position,result.op));
  3085. IF conditional THEN
  3086. IntermediateCode.InitImmediate(zero,setType,0);
  3087. BrneL(trueLabel,result.op,zero);
  3088. ReleaseOperand(result);
  3089. BrL(falseLabel);
  3090. END;
  3091. ELSE
  3092. HALT(100);
  3093. END;
  3094. destination := dest;
  3095. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3096. END VisitBinaryExpression;
  3097. PROCEDURE VisitRangeExpression(x: SyntaxTree.RangeExpression);
  3098. VAR localResult, operand: Operand;
  3099. BEGIN
  3100. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3101. InitOperand(localResult, ModeValue);
  3102. ASSERT(x.first # NIL);
  3103. Evaluate(x.first, operand);
  3104. localResult.op := operand.op;
  3105. ReleaseOperand(operand);
  3106. UseIntermediateOperand(localResult.op);
  3107. ASSERT(x.last # NIL);
  3108. Evaluate(x.last, operand);
  3109. localResult.tag := operand.op;
  3110. ReleaseOperand(operand);
  3111. UseIntermediateOperand(localResult.tag);
  3112. IF x.step # NIL THEN
  3113. Evaluate(x.step, operand);
  3114. localResult.extra := operand.op;
  3115. ReleaseOperand(operand);
  3116. UseIntermediateOperand(localResult.extra);
  3117. END;
  3118. result := localResult;
  3119. IF Trace THEN TraceExit("VisitRangeExpression") END
  3120. END VisitRangeExpression;
  3121. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3122. BEGIN
  3123. HALT(100); (* should never be evaluated *)
  3124. END VisitTensorRangeExpression;
  3125. PROCEDURE VisitConversion(x: SyntaxTree.Conversion);
  3126. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3127. BEGIN
  3128. IF Trace THEN TraceEnter("VisitConversion") END;
  3129. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3130. dest := destination; destination := emptyOperand;
  3131. Evaluate(x.expression,old);
  3132. InitOperand(result,ModeValue);
  3133. result.op := old.op;
  3134. ASSERT(result.op.mode # 0);
  3135. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3136. (* convert TO a complex number *)
  3137. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3138. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3139. ASSERT(result.op.mode # 0);
  3140. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3141. (* convert FROM a complex number TO a complex number*)
  3142. result.tag := old.tag;
  3143. ASSERT(result.tag.mode # 0);
  3144. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3145. ASSERT(result.tag.mode # 0)
  3146. ELSE
  3147. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3148. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3149. END
  3150. ELSE
  3151. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3152. ASSERT(result.op.mode # 0);
  3153. result.tag := old.tag; (*! probably never used *)
  3154. END;
  3155. destination := dest;
  3156. IF Trace THEN TraceExit("VisitConversion") END;
  3157. END VisitConversion;
  3158. PROCEDURE VisitTypeDeclaration(x: SyntaxTree.TypeDeclaration);
  3159. BEGIN
  3160. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3161. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3162. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3163. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3164. END VisitTypeDeclaration;
  3165. (** designators (expressions) *)
  3166. PROCEDURE VisitSymbolDesignator(x: SyntaxTree.SymbolDesignator);
  3167. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3168. BEGIN
  3169. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3170. IF x.left # NIL THEN Expression(x.left) END;
  3171. Symbol(x.symbol,result);
  3172. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3173. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3174. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3175. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3176. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3177. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3178. END;
  3179. END;
  3180. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3181. END VisitSymbolDesignator;
  3182. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3183. BEGIN
  3184. IF isUnchecked THEN RETURN END;
  3185. IF tagsAvailable THEN
  3186. TrapC(BrltL,index,length,IndexCheckTrap);
  3187. END;
  3188. END BoundCheck;
  3189. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3190. VAR d: IntermediateCode.Operand;
  3191. BEGIN
  3192. IF isUnchecked THEN RETURN END;
  3193. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3194. TrapC(op,dim,d,ArraySizeTrap);
  3195. ReleaseIntermediateOperand(d);
  3196. END DimensionCheck;
  3197. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3198. VAR
  3199. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3200. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3201. expression: SyntaxTree.Expression;
  3202. resultingType, leftType, baseType: SyntaxTree.Type;
  3203. skipLabel1, skipLabel2: Label;
  3204. i, indexListSize, indexDim, rangeCount, indexCount, tensorRangeCount, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3205. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3206. variableOp: Operand;
  3207. variable: SyntaxTree.Variable;
  3208. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList; VAR indexCount: LONGINT; VAR rangeCount: LONGINT; VAR tensorRangeCount: LONGINT);
  3209. VAR index: LONGINT; expression: SyntaxTree.Expression;
  3210. BEGIN
  3211. (* count the number of indices, ranges and tensorRanges in the index list *)
  3212. indexCount := 0; rangeCount := 0; tensorRangeCount := 0;
  3213. FOR i := 0 TO parameters.Length() - 1 DO
  3214. expression := parameters.GetExpression(i);
  3215. IF expression IS SyntaxTree.TensorRangeExpression THEN INC(tensorRangeCount)
  3216. ELSIF (expression.type # NIL) & (expression.type.resolved IS SyntaxTree.RangeType) THEN INC(indexCount)
  3217. ELSE INC(indexCount)
  3218. END
  3219. END;
  3220. END CountIndices;
  3221. BEGIN
  3222. ASSERT(tagsAvailable);
  3223. resultingType := x.type.resolved; (* resulting type *)
  3224. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3225. InitOperand(localResult, ModeReference);
  3226. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3227. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3228. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3229. (* a globally defined array destination tag is available -> use and invalidate it*)
  3230. localResult.tag := arrayDestinationTag;
  3231. IntermediateCode.InitOperand(arrayDestinationTag)
  3232. ELSE
  3233. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3234. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE);
  3235. Symbol(variable, variableOp);
  3236. ReuseCopy(localResult.tag, variableOp.op);
  3237. ReleaseOperand(variableOp);
  3238. END
  3239. END;
  3240. indexListSize := x.parameters.Length();
  3241. CountIndices(x.parameters, indexCount, rangeCount, tensorRangeCount);
  3242. ASSERT(tensorRangeCount <= 1);
  3243. (* designate the array to be indexed over, perform tensor range check if known *)
  3244. Designate(x.left, array);
  3245. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3246. Dereference(array, leftType,FALSE);
  3247. IF tensorRangeCount=0 THEN
  3248. DimensionCheck(array.tag, IntermediateCode.Immediate(int32, rangeCount+indexCount), BreqL)
  3249. END
  3250. END;
  3251. (* determine source and destination dimension offsets; this depends on if the list starts with a '?' *)
  3252. IF x.parameters.GetExpression(0) IS SyntaxTree.TensorRangeExpression THEN
  3253. srcDimOffset := -indexListSize;
  3254. destDimOffset := -rangeCount
  3255. ELSE
  3256. srcDimOffset := 0;
  3257. destDimOffset := 0
  3258. END;
  3259. indexDim := 0;
  3260. (* use address of source array as basis *)
  3261. (*
  3262. ReuseCopy(localResult.op, array.op);
  3263. *)
  3264. localResult.op := array.op;
  3265. UseIntermediateOperand(localResult.op);
  3266. (* go through the index list *)
  3267. FOR i := 0 TO indexListSize - 1 DO
  3268. expression := x.parameters.GetExpression(i);
  3269. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3270. (* nothing to do *)
  3271. ELSE
  3272. (* determine which dimension of source array is currently looked at *)
  3273. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3274. (* get the memory operand pointing to array descriptor dimension *)
  3275. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3276. (* make a reusable register from it *)
  3277. ReuseCopy(srcDim, tmp);
  3278. ReleaseIntermediateOperand(tmp);
  3279. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3280. ELSE
  3281. srcDim := IntermediateCode.Immediate(int32, i)
  3282. END;
  3283. (* get length and increment of source array for current dimension *)
  3284. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3285. Convert(sourceLength.op, sizeType);
  3286. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3287. Convert(sourceIncrement.op, sizeType);
  3288. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3289. ReleaseIntermediateOperand(srcDim);
  3290. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3291. (* SINGLE INDEX *)
  3292. Evaluate(expression, index);
  3293. ReleaseIntermediateOperand(index.tag);
  3294. index.tag := emptyOperand;
  3295. Convert(index.op, sizeType);
  3296. (* lower bound check *)
  3297. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3298. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3299. ELSIF isUnchecked THEN (* do nothing *)
  3300. ELSE
  3301. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3302. END;
  3303. (* upper bound check *)
  3304. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3305. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3306. ELSIF isUnchecked THEN (* do nothing *)
  3307. ELSE
  3308. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3309. END;
  3310. ReleaseOperand(sourceLength);
  3311. Convert(index.op, addressType);
  3312. summand := index.op;
  3313. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3314. (* RANGE OF INDICES *)
  3315. Evaluate(expression, range);
  3316. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3317. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3318. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3319. ReleaseOperand(range);
  3320. Convert(firstIndex, sizeType);
  3321. Convert(lastIndex, sizeType);
  3322. Convert(stepSize, sizeType);
  3323. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3324. if it is 'MAX(LONGINT)' *)
  3325. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3326. TransferToRegister(lastIndex, lastIndex);
  3327. skipLabel1 := NewLabel();
  3328. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3329. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3330. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3331. SetLabel(skipLabel1)
  3332. END;
  3333. (* check if step size is valid *)
  3334. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3335. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3336. ELSIF isUnchecked THEN (* do nothing *)
  3337. ELSE
  3338. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3339. END;
  3340. (* check lower bound check *)
  3341. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3342. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3343. ELSIF isUnchecked THEN (* do nothing *)
  3344. ELSE
  3345. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3346. END;
  3347. (* check upper bound check *)
  3348. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3349. (* statically open range: nothing to do *)
  3350. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3351. ASSERT(staticLastIndex < staticSourceLength)
  3352. ELSIF isUnchecked THEN (* do nothing *)
  3353. ELSE
  3354. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3355. END;
  3356. (* determine length of target array for current dimension *)
  3357. (* 1. incorporate last index: *)
  3358. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3359. (* last index is static *)
  3360. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3361. targetLength := sourceLength.op
  3362. ELSE
  3363. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3364. END;
  3365. UseIntermediateOperand(targetLength);
  3366. ELSE
  3367. (* targetLength := lastIndex + 1
  3368. Reuse1(targetLength, lastIndex);
  3369. *)
  3370. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3371. END;
  3372. ReleaseOperand(sourceLength);
  3373. ReleaseIntermediateOperand(lastIndex);
  3374. (* 2. incorporate first index: *)
  3375. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3376. (* first index and current target length are static *)
  3377. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3378. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3379. (* first index = 0: nothing to do *)
  3380. ELSE
  3381. (* targetLength := targetLength - firstIndex *)
  3382. TransferToRegister(targetLength, targetLength);
  3383. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3384. END;
  3385. (* clip negative lengths to 0 *)
  3386. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3387. IF staticTargetLength < 0 THEN
  3388. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3389. END
  3390. ELSE
  3391. skipLabel1 := NewLabel();
  3392. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3393. TransferToRegister(targetLength, targetLength);
  3394. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3395. SetLabel(skipLabel1)
  3396. END;
  3397. (* 3. incorporate index step size: *)
  3398. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3399. (*step size and current target length are static *)
  3400. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3401. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3402. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3403. (* step size = 1: nothing to do *)
  3404. ELSE
  3405. (* emit code for this:
  3406. targetLength := (targetLength-1) DIV stepSize +1;
  3407. *)
  3408. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3409. DivInt(targetLength, targetLength, stepSize);
  3410. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3411. END;
  3412. (* determine increment of target array for current dimension *)
  3413. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3414. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3415. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3416. (* step size = 1 *)
  3417. targetIncrement := sourceIncrement.op;
  3418. UseIntermediateOperand(targetIncrement)
  3419. ELSE
  3420. (* targetIncrement := sourceIncrement * stepSize *)
  3421. Reuse1(targetIncrement, stepSize);
  3422. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3423. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3424. END;
  3425. ReleaseIntermediateOperand(stepSize);
  3426. (* write length and increment of target array to descriptor *)
  3427. IF destDimOffset < 0 THEN
  3428. (* determine which dimension of target array is currently looked at *)
  3429. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3430. TransferToRegister(destDim, tmp);
  3431. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, indexDim + destDimOffset));
  3432. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3433. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3434. ReleaseIntermediateOperand(destDim)
  3435. ELSE
  3436. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3437. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim)
  3438. END;
  3439. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3440. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3441. INC(indexDim);
  3442. Convert(firstIndex, addressType);
  3443. TransferToRegister(summand, firstIndex);
  3444. ELSE HALT(100);
  3445. END;
  3446. (*
  3447. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3448. *)
  3449. Convert(sourceIncrement.op, addressType);
  3450. Convert(summand, addressType);
  3451. MulInt(summand, summand, sourceIncrement.op);
  3452. ReleaseIntermediateOperand(sourceIncrement.op);
  3453. AddInt(localResult.op, localResult.op, summand);
  3454. ReleaseIntermediateOperand(summand);
  3455. END
  3456. END;
  3457. result := localResult;
  3458. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3459. ReleaseIntermediateOperand(result.tag);
  3460. result.tag := TypeDescriptorAdr(resultingType);
  3461. IF ~newObjectFile THEN
  3462. IntermediateCode.MakeMemory(result.tag,addressType);
  3463. END;
  3464. ELSIF IsDelegate(resultingType) THEN
  3465. ReleaseIntermediateOperand(result.tag);
  3466. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3467. UseIntermediateOperand(result.tag);
  3468. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3469. ReleaseIntermediateOperand(result.tag);
  3470. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3471. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3472. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3473. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3474. (* finalize target array descriptor *)
  3475. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3476. (* write lengths and increments of target array for remaining dimensions *)
  3477. i := indexListSize;
  3478. WHILE indexDim < targetArrayDimensionality DO
  3479. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3480. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3481. ReleaseOperand(sourceLength);
  3482. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3483. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3484. ReleaseOperand(sourceIncrement);
  3485. INC(i); INC(indexDim);
  3486. END;
  3487. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3488. tmp := nil;
  3489. ELSE
  3490. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3491. END;
  3492. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3493. ReleaseIntermediateOperand(tmp);
  3494. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3495. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3496. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3497. ELSE
  3498. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3499. END;
  3500. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3501. ReleaseIntermediateOperand(tmp);
  3502. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3503. (* write dimensionality *)
  3504. IF targetArrayDimensionality # 0 THEN
  3505. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3506. END;
  3507. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3508. END;
  3509. ReleaseOperand(array);
  3510. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3511. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3512. END;
  3513. END MathIndexDesignator;
  3514. (* TENTATIVE *)
  3515. PROCEDURE DumpOperand(operand: Operand);
  3516. BEGIN
  3517. D.Log.String(" op = ");
  3518. IntermediateCode.DumpOperand(D.Log, operand.op );
  3519. D.Log.Ln;
  3520. D.Log.String(" tag = ");
  3521. IntermediateCode.DumpOperand(D.Log, operand.tag );
  3522. D.Log.Ln;
  3523. D.Log.String(" extra = ");
  3524. IntermediateCode.DumpOperand(D.Log, operand.extra );
  3525. D.Log.Ln;
  3526. D.Log.Update
  3527. END DumpOperand;
  3528. (* get the length of an array , trying to make use of static information *)
  3529. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3530. VAR res: IntermediateCode.Operand; size: LONGINT;
  3531. BEGIN
  3532. type := type.resolved;
  3533. IF type IS SyntaxTree.ArrayType THEN
  3534. WITH type: SyntaxTree.ArrayType DO
  3535. IF type.form = SyntaxTree.Static THEN
  3536. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3537. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3538. Evaluate(type.length, op);
  3539. ReleaseIntermediateOperand(op.tag);
  3540. RETURN op.op;*)
  3541. ELSE
  3542. res := tag;
  3543. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3544. IntermediateCode.MakeMemory(res,addressType);
  3545. UseIntermediateOperand(res);
  3546. RETURN res
  3547. END
  3548. END;
  3549. ELSE
  3550. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3551. RETURN IntermediateCode.Immediate(addressType,size);
  3552. END;
  3553. END ArrayLength;
  3554. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3555. VAR oldReg: LONGINT;
  3556. BEGIN
  3557. ReleaseIntermediateOperand(res);
  3558. IF IsImmediate(x) & IsImmediate(y) THEN
  3559. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3560. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3561. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3562. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3563. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3564. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3565. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3566. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3567. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3568. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3569. UseIntermediateOperand(res);
  3570. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3571. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3572. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3573. UseIntermediateOperand(res);
  3574. ELSE
  3575. IF ~ReusableRegister(res) THEN
  3576. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3577. ELSE
  3578. UseIntermediateOperand(res);
  3579. END;
  3580. IF IsImmediate(x) & (x.intValue = 0) THEN
  3581. Emit(Mov(position,res,y))
  3582. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3583. Emit(Mov(position,res,x))
  3584. ELSE
  3585. Emit(Add(position,res, x, y));
  3586. END;
  3587. END;
  3588. END AddInt;
  3589. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3590. BEGIN
  3591. ReleaseIntermediateOperand(res);
  3592. IF IsImmediate(x) & IsImmediate(y) THEN
  3593. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3594. ELSE
  3595. IF ~ReusableRegister(res) THEN
  3596. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3597. ELSE UseIntermediateOperand(res);
  3598. END;
  3599. IF IsImmediate(x) & (x.intValue = 1) THEN
  3600. Emit(Mov(position,res,y))
  3601. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3602. Emit(Mov(position,res,x))
  3603. ELSE
  3604. Emit(Mul(position,res, x, y));
  3605. END;
  3606. END;
  3607. END MulInt;
  3608. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3609. BEGIN
  3610. ReleaseIntermediateOperand(res);
  3611. IF IsImmediate(x) & IsImmediate(y) THEN
  3612. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3613. ELSE
  3614. IF ~ReusableRegister(res) THEN
  3615. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3616. ELSE UseIntermediateOperand(res);
  3617. END;
  3618. IF IsImmediate(x) & (x.intValue = 1) THEN
  3619. Emit(Mov(position,res,y))
  3620. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3621. Emit(Mov(position,res,x))
  3622. ELSE
  3623. Emit(Div(position,res, x, y));
  3624. END;
  3625. END;
  3626. END DivInt;
  3627. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3628. VAR length,res: IntermediateCode.Operand; type: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3629. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3630. BEGIN
  3631. type := x.left.type.resolved;
  3632. IF type IS SyntaxTree.StringType THEN
  3633. atype := SyntaxTree.NewArrayType(-1, NIL, SyntaxTree.Static);
  3634. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3635. atype.SetLength(Global.NewIntegerValue(system,-1, type(SyntaxTree.StringType).length));
  3636. type := atype;
  3637. x.left.SetType(type);
  3638. END;
  3639. IntermediateCode.InitImmediate(res,addressType,0);
  3640. maxDim := x.parameters.Length()-1;
  3641. FOR i := 0 TO maxDim DO
  3642. e := x.parameters.GetExpression(i);
  3643. Evaluate(e,index);
  3644. Convert(index.op,addressType);
  3645. AddInt(res, res, index.op);
  3646. IF i = 0 THEN
  3647. (*
  3648. ReuseCopy(res, index.op);
  3649. *)
  3650. Designate(x.left,array);
  3651. type := x.left.type.resolved;
  3652. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3653. Dereference(array, type, FALSE);
  3654. END;
  3655. (*
  3656. ELSE AddInt(res, res, index.op);
  3657. *)
  3658. END;
  3659. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  3660. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  3661. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  3662. BoundCheck(index.op, length);
  3663. END;
  3664. ReleaseIntermediateOperand(length);
  3665. END;
  3666. ReleaseOperand(index);
  3667. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  3668. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  3669. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  3670. MulInt(res,res,length);
  3671. END;
  3672. ReleaseIntermediateOperand(length);
  3673. END;
  3674. IF (type IS SyntaxTree.ArrayType) THEN
  3675. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  3676. size := StaticSize(system, type);
  3677. IF size # 1 THEN
  3678. length := IntermediateCode.Immediate(addressType,size);
  3679. MulInt(res,res,length);
  3680. END;
  3681. ELSE
  3682. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  3683. IF size # 1 THEN
  3684. length := IntermediateCode.Immediate(addressType,size);
  3685. MulInt(res,res,length);
  3686. END;
  3687. END;
  3688. END;
  3689. AddInt(res,res,array.op);
  3690. InitOperand(result,ModeReference);
  3691. result.op := res;
  3692. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  3693. ReleaseIntermediateOperand(result.tag);
  3694. result.tag := TypeDescriptorAdr(type);
  3695. IF ~newObjectFile THEN
  3696. IntermediateCode.MakeMemory(result.tag,addressType);
  3697. END
  3698. ELSIF IsDelegate(type) THEN
  3699. ReleaseIntermediateOperand(result.tag);
  3700. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3701. UseIntermediateOperand(result.tag);
  3702. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3703. ReleaseIntermediateOperand(result.tag);
  3704. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  3705. ELSIF (type IS SyntaxTree.ArrayType) THEN
  3706. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  3707. END;
  3708. ReleaseOperand(array);
  3709. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  3710. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3711. END;
  3712. END IndexDesignator;
  3713. PROCEDURE VisitIndexDesignator(x: SyntaxTree.IndexDesignator);
  3714. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  3715. BEGIN
  3716. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  3717. dest := destination; destination := emptyOperand;
  3718. type := x.left.type.resolved;
  3719. IF type IS SyntaxTree.MathArrayType THEN
  3720. MathIndexDesignator(x);
  3721. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  3722. IndexDesignator(x);
  3723. END;
  3724. destination := dest;
  3725. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  3726. END VisitIndexDesignator;
  3727. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  3728. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  3729. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  3730. procedure: SyntaxTree.Procedure;
  3731. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  3732. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  3733. BEGIN
  3734. variable := GetTemporaryVariable(expression.left.type, FALSE);
  3735. parameters := expression.parameters;
  3736. moduleName := "FoxArrayBase";
  3737. procedureName := "CopyDescriptor";
  3738. IF AddImport(moduleName,arrayBase,TRUE) THEN
  3739. SaveRegisters();ReleaseUsedRegisters(saved);
  3740. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3741. IF procedure = NIL THEN
  3742. s := "procedure ";
  3743. Strings.Append(s,moduleName);
  3744. Strings.Append(s,".");
  3745. Strings.Append(s,procedureName);
  3746. Strings.Append(s," not present");
  3747. Error(position,s);
  3748. ELSE
  3749. (* push address of temporary variable *)
  3750. Symbol(variable,destOperand);
  3751. Emit(Push(position,destOperand.op));
  3752. ReleaseOperand(destOperand);
  3753. (* push src *)
  3754. Evaluate(expression.left,srcOperand);
  3755. (*
  3756. Dereference(srcOperand,expression.type.resolved);
  3757. Emit(Push(position,srcOperand.tag));
  3758. *)
  3759. Emit(Push(position,srcOperand.op));
  3760. ReleaseOperand(srcOperand);
  3761. tensorFound := FALSE;
  3762. FOR i := 0 TO parameters.Length()-1 DO
  3763. e := parameters.GetExpression(i);
  3764. IF e IS SyntaxTree.TensorRangeExpression THEN
  3765. tensorFound := TRUE;
  3766. ELSIF e IS SyntaxTree.RangeExpression THEN
  3767. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3768. ELSE
  3769. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3770. END;
  3771. END;
  3772. Emit(Push(position,IntermediateCode.Immediate(int32,prefixIndices)));
  3773. Emit(Push(position,IntermediateCode.Immediate(int32,prefixRanges)));
  3774. Emit(Push(position,IntermediateCode.Immediate(int32,suffixIndices)));
  3775. Emit(Push(position,IntermediateCode.Immediate(int32,suffixRanges)));
  3776. StaticCallOperand(procOp,procedure);
  3777. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  3778. ReleaseOperand(procOp);
  3779. END;
  3780. RestoreRegisters(saved);
  3781. END;
  3782. RETURN variable
  3783. END PrepareTensorDescriptor;
  3784. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  3785. VAR
  3786. type, descriptorType, baseType: SyntaxTree.Type;
  3787. operand, tmpOperand, variableOp, variable2Op: Operand;
  3788. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  3789. variable, variable2: SyntaxTree.Variable;
  3790. dim, i, size: LONGINT;
  3791. (* TODO: needed? *)
  3792. oldArrayDestinationTag: IntermediateCode.Operand;
  3793. oldArrayDestinationDimension: LONGINT;
  3794. position: LONGINT;
  3795. saved: RegisterEntry;
  3796. PROCEDURE Pass(op: IntermediateCode.Operand);
  3797. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  3798. BEGIN
  3799. IF numberRegister >= 0 THEN
  3800. IntermediateCode.InitRegisterClass(registerClass, IntermediateCode.Parameter, SHORT(numberRegister));
  3801. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  3802. Emit(Mov(position,parameterRegister, op));
  3803. ELSE
  3804. Emit(Push(position,op))
  3805. END
  3806. END Pass;
  3807. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  3808. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  3809. BEGIN
  3810. formalType := formalType.resolved; actualType := actualType.resolved;
  3811. IF IsOpenArray(formalType)THEN
  3812. IF actualType IS SyntaxTree.StringType THEN
  3813. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  3814. RETURN;
  3815. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  3816. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  3817. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  3818. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  3819. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  3820. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3821. ELSE
  3822. tmp := baseReg;
  3823. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  3824. IntermediateCode.MakeMemory(tmp,addressType);
  3825. Pass((tmp));
  3826. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  3827. END;
  3828. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  3829. END;
  3830. END PushArrayLens;
  3831. BEGIN
  3832. IF Trace THEN TraceEnter("PushParameter") END;
  3833. position := expression.position;
  3834. IF expression.resolved # NIL THEN expression := expression.resolved END;
  3835. type := expression.type.resolved;
  3836. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  3837. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  3838. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  3839. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  3840. );
  3841. (* TODO: needed? *)
  3842. oldArrayDestinationTag := arrayDestinationTag;
  3843. oldArrayDestinationDimension := arrayDestinationDimension;
  3844. IF IsArrayOfSystemByte(parameter.type) THEN
  3845. Designate(expression,operand);
  3846. tmp := GetArrayOfBytesSize(expression,operand.tag);
  3847. ReleaseIntermediateOperand(operand.tag);
  3848. operand.tag := tmp;
  3849. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3850. Pass((operand.tag));
  3851. END;
  3852. Pass((operand.op));
  3853. ELSIF IsOpenArray(parameter.type) THEN
  3854. Designate(expression,operand);
  3855. baseReg := operand.tag;
  3856. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  3857. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  3858. END;
  3859. Pass((operand.op)); (* address of the array *)
  3860. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  3861. (* case 1 *)
  3862. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  3863. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  3864. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3865. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  3866. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  3867. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3868. arrayDestinationTag := sp;
  3869. (* case 1b *)
  3870. IF expression IS SyntaxTree.IndexDesignator THEN
  3871. (*
  3872. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3873. descriptorType := GetMathArrayDescriptorType(dim);
  3874. variable := GetTemporaryVariable(descriptorType,expression.position);
  3875. Symbol(variable,variableOp);
  3876. arrayDestinationTag := variableOp.op;
  3877. *)
  3878. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  3879. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3880. arrayDestinationDimension := dim;
  3881. Designate(expression,operand);
  3882. (* case 1a *)
  3883. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  3884. Designate(expression,operand);
  3885. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  3886. i := 0;
  3887. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  3888. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  3889. INC(i);
  3890. END;
  3891. type := expression.type.resolved;
  3892. WHILE (i<dim) DO (* remaining static dimensions *)
  3893. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3894. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  3895. ReleaseOperand(tmpOperand);
  3896. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3897. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  3898. ReleaseOperand(tmpOperand);
  3899. INC(i);
  3900. END;
  3901. dimOp := IntermediateCode.Immediate(addressType,dim);
  3902. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  3903. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  3904. (* case 1d *)
  3905. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3906. Designate(expression,operand);
  3907. Dereference(operand,type.resolved,FALSE);
  3908. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  3909. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  3910. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  3911. (* case 1f *)
  3912. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3913. Designate(expression,operand);
  3914. FOR i := 0 TO dim-1 DO
  3915. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3916. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  3917. ReleaseOperand(tmpOperand);
  3918. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3919. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  3920. ReleaseOperand(tmpOperand);
  3921. END;
  3922. dimOp := IntermediateCode.Immediate(addressType,dim);
  3923. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  3924. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  3925. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  3926. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  3927. baseType := SemanticChecker.ArrayBase(type,dim);
  3928. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3929. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  3930. ELSE HALT(100);
  3931. END;
  3932. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  3933. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  3934. (* case 2b *)
  3935. IF expression IS SyntaxTree.IndexDesignator THEN
  3936. descriptorType := GetMathArrayDescriptorType(dim);
  3937. variable := GetTemporaryVariable(descriptorType, FALSE);
  3938. Symbol(variable,variableOp);
  3939. arrayDestinationTag := variableOp.op;
  3940. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  3941. arrayDestinationDimension := dim;
  3942. NeedDescriptor := TRUE;
  3943. Designate(expression,operand);
  3944. Pass((operand.tag));
  3945. NeedDescriptor := FALSE;
  3946. (* case 2a *)
  3947. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  3948. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  3949. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  3950. INC(i);
  3951. END;
  3952. IF i = dim THEN
  3953. Designate(expression,operand);
  3954. Pass((operand.tag));
  3955. ELSE (* open-static *)
  3956. type := expression.type.resolved;
  3957. descriptorType := GetMathArrayDescriptorType(dim);
  3958. variable := GetTemporaryVariable(descriptorType, FALSE);
  3959. Symbol(variable,variableOp);
  3960. arrayDestinationTag := variableOp.op;
  3961. Designate(expression,operand);
  3962. FOR i := 0 TO dim-1 DO
  3963. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3964. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  3965. ReleaseOperand(tmpOperand);
  3966. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3967. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  3968. ReleaseOperand(tmpOperand);
  3969. END;
  3970. dimOp := IntermediateCode.Immediate(addressType,dim);
  3971. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  3972. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  3973. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  3974. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  3975. baseType := SemanticChecker.ArrayBase(type,dim);
  3976. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3977. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  3978. Pass((arrayDestinationTag));
  3979. END;
  3980. (* case 2d *)
  3981. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3982. Designate(expression,operand);
  3983. Dereference(operand,type.resolved,FALSE);
  3984. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  3985. Pass((operand.tag));
  3986. (* case 2f *)
  3987. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3988. descriptorType := GetMathArrayDescriptorType(dim);
  3989. variable := GetTemporaryVariable(descriptorType, FALSE);
  3990. Symbol(variable,variableOp);
  3991. arrayDestinationTag := variableOp.op;
  3992. Designate(expression,operand);
  3993. FOR i := 0 TO dim-1 DO
  3994. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3995. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  3996. ReleaseOperand(tmpOperand);
  3997. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  3998. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  3999. ReleaseOperand(tmpOperand);
  4000. END;
  4001. dimOp := IntermediateCode.Immediate(addressType,dim);
  4002. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4003. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4004. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4005. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4006. baseType := SemanticChecker.ArrayBase(type,dim);
  4007. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4008. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4009. Pass((arrayDestinationTag));
  4010. ELSE HALT(100);
  4011. END;
  4012. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4013. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4014. (* case 3b *)
  4015. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4016. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4017. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4018. Symbol(variable,variableOp);
  4019. LoadValue(variableOp,system.addressType);
  4020. ELSE
  4021. descriptorType := GetMathArrayDescriptorType(dim);
  4022. variable := GetTemporaryVariable(descriptorType, FALSE);
  4023. Symbol(variable,variableOp);
  4024. END;
  4025. arrayDestinationTag := variableOp.op;
  4026. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4027. arrayDestinationDimension := 0;
  4028. Designate(expression,operand);
  4029. Pass((operand.tag));
  4030. (* case 3a *)
  4031. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4032. i := 0;
  4033. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4034. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4035. INC(i);
  4036. END;
  4037. IF i = dim THEN
  4038. Designate(expression,operand);
  4039. Pass((operand.tag));
  4040. ELSE (* open-static *)
  4041. type := expression.type.resolved;
  4042. descriptorType := GetMathArrayDescriptorType(dim);
  4043. variable := GetTemporaryVariable(descriptorType, FALSE);
  4044. Symbol(variable,variableOp);
  4045. arrayDestinationTag := variableOp.op;
  4046. Designate(expression,operand);
  4047. FOR i := 0 TO dim-1 DO
  4048. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4049. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4050. ReleaseOperand(tmpOperand);
  4051. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4052. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4053. ReleaseOperand(tmpOperand);
  4054. END;
  4055. dimOp := IntermediateCode.Immediate(addressType,dim);
  4056. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4057. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4058. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4059. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4060. baseType := SemanticChecker.ArrayBase(type,dim);
  4061. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4062. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4063. Pass((arrayDestinationTag));
  4064. END;
  4065. (* case 3d *)
  4066. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4067. Designate(expression,operand);
  4068. Dereference(operand,type.resolved,FALSE);
  4069. (*
  4070. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4071. *)
  4072. Pass((operand.tag));
  4073. (* case 3f *)
  4074. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4075. descriptorType := GetMathArrayDescriptorType(dim);
  4076. variable := GetTemporaryVariable(descriptorType, FALSE);
  4077. Symbol(variable,variableOp);
  4078. arrayDestinationTag := variableOp.op;
  4079. Designate(expression,operand);
  4080. IF operand.op.type.length >1 THEN (* vector register *)
  4081. variable2 := GetTemporaryVariable(type, FALSE);
  4082. Symbol(variable2, variable2Op);
  4083. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4084. Emit(Mov(position,tmp, operand.op));
  4085. ReleaseOperand(operand);
  4086. Symbol(variable2, operand);
  4087. END;
  4088. FOR i := 0 TO dim-1 DO
  4089. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4090. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4091. ReleaseOperand(tmpOperand);
  4092. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4093. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4094. ReleaseOperand(tmpOperand);
  4095. END;
  4096. dimOp := IntermediateCode.Immediate(addressType,dim);
  4097. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4098. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4099. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4100. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4101. baseType := SemanticChecker.ArrayBase(type,dim);
  4102. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4103. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4104. Pass((arrayDestinationTag));
  4105. ELSE HALT(100);
  4106. END;
  4107. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4108. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4109. (* case 4b *)
  4110. IF (expression IS SyntaxTree.IndexDesignator) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4111. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4112. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4113. Symbol(variable,variableOp);
  4114. LoadValue(variableOp,system.addressType);
  4115. ELSE
  4116. descriptorType := GetMathArrayDescriptorType(dim);
  4117. variable := GetTemporaryVariable(descriptorType, FALSE);
  4118. Symbol(variable,variableOp);
  4119. END;
  4120. arrayDestinationTag := variableOp.op;
  4121. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4122. arrayDestinationDimension := 0;
  4123. Designate(expression,operand);
  4124. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4125. Symbol(variable,variableOp);
  4126. ELSE
  4127. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4128. Symbol(variable,variableOp);
  4129. MakeMemory(tmp,variableOp.op,addressType,0);
  4130. Emit(Mov(position,tmp,operand.tag));
  4131. ReleaseIntermediateOperand(tmp);
  4132. END;
  4133. Pass((variableOp.op));
  4134. ReleaseOperand(variableOp);
  4135. (* case 4a *)
  4136. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4137. i := 0;
  4138. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4139. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4140. INC(i);
  4141. END;
  4142. IF i = dim THEN
  4143. Designate(expression,operand);
  4144. arrayDestinationTag := operand.tag;
  4145. ELSE (* open-static *)
  4146. type := expression.type.resolved;
  4147. descriptorType := GetMathArrayDescriptorType(dim);
  4148. variable := GetTemporaryVariable(descriptorType, FALSE);
  4149. Symbol(variable,variableOp);
  4150. arrayDestinationTag := variableOp.op;
  4151. Designate(expression,operand);
  4152. FOR i := 0 TO dim-1 DO
  4153. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4154. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4155. ReleaseOperand(tmpOperand);
  4156. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4157. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4158. ReleaseOperand(tmpOperand);
  4159. END;
  4160. dimOp := IntermediateCode.Immediate(addressType,dim);
  4161. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4162. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4163. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4164. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4165. baseType := SemanticChecker.ArrayBase(type,dim);
  4166. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4167. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4168. END;
  4169. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4170. Symbol(variable,variableOp);
  4171. MakeMemory(tmp,variableOp.op,addressType,0);
  4172. Emit(Mov(position,tmp,arrayDestinationTag));
  4173. ReleaseIntermediateOperand(tmp);
  4174. Pass((variableOp.op));
  4175. ReleaseOperand(variableOp);
  4176. (* case 4d *)
  4177. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4178. Designate(expression,operand);
  4179. (*
  4180. Dereference(operand,type.resolved,FALSE);
  4181. *)
  4182. (*
  4183. DimensionCheck(operand.tag, IntermediateCode.Immediate(int32,dim),BreqL);
  4184. *)
  4185. Pass((operand.op));
  4186. (* case 4f *)
  4187. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4188. descriptorType := GetMathArrayDescriptorType(dim);
  4189. variable := GetTemporaryVariable(descriptorType, FALSE);
  4190. Symbol(variable,variableOp);
  4191. arrayDestinationTag := variableOp.op;
  4192. Designate(expression,operand);
  4193. FOR i := 0 TO dim-1 DO
  4194. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4195. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4196. ReleaseOperand(tmpOperand);
  4197. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4198. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4199. ReleaseOperand(tmpOperand);
  4200. END;
  4201. dimOp := IntermediateCode.Immediate(addressType,dim);
  4202. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4203. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4204. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4205. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4206. baseType := SemanticChecker.ArrayBase(type,dim);
  4207. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4208. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4209. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4210. Symbol(variable,variableOp);
  4211. MakeMemory(tmp,variableOp.op,addressType,0);
  4212. Emit(Mov(position,tmp,arrayDestinationTag));
  4213. ReleaseIntermediateOperand(tmp);
  4214. Pass((variableOp.op));
  4215. ReleaseOperand(variableOp);
  4216. ELSE HALT(100);
  4217. END;
  4218. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4219. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4220. Designate(expression,operand);
  4221. IF operand.op.type.length > 1 THEN
  4222. Emit(Push(position, operand.op));
  4223. ReleaseOperand(operand);
  4224. ELSE
  4225. size := system.SizeOf(type);
  4226. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4227. size := ToMemoryUnits(system,size);
  4228. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4229. arrayDestinationTag := sp;
  4230. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4231. END;
  4232. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4233. Designate(expression,operand);
  4234. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4235. variable := GetTemporaryVariable(parameter.type.resolved, FALSE);
  4236. Symbol(variable,variableOp);
  4237. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4238. Emit(Mov(position,tmp,operand.op));
  4239. Emit(Push(position,variableOp.op));
  4240. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4241. Pass((operand.op));
  4242. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4243. END;
  4244. ELSE HALT(200)
  4245. END;
  4246. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4247. IF parameter.kind = SyntaxTree.VarParameter THEN
  4248. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4249. Designate(expression, operand);
  4250. Pass((operand.op));
  4251. ELSE
  4252. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4253. Evaluate(expression, operand);
  4254. Pass((operand.extra)); (* step *)
  4255. Pass((operand.tag)); (* last *)
  4256. Pass((operand.op)) (* first *)
  4257. END
  4258. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4259. IF parameter.kind = SyntaxTree.VarParameter THEN
  4260. Designate(expression, operand);
  4261. Pass((operand.op));
  4262. ELSE
  4263. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4264. Evaluate(expression, operand);
  4265. Pass((operand.tag)); (* real part *)
  4266. Pass((operand.op)) (* imaginary part *)
  4267. END
  4268. ELSE
  4269. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4270. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4271. Designate(expression,operand);
  4272. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4273. (* stack allocation *)
  4274. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4275. (*! parameter alignment to be discussed ... *)
  4276. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4277. size := type(SyntaxTree.StringType).length;
  4278. END;
  4279. IF backend.cooperative & parameter.NeedsTrace() THEN
  4280. dst := NewRegisterOperand (addressType);
  4281. Emit(Mov(position,dst, sp));
  4282. IntermediateCode.InitImmediate(null, byteType, 0);
  4283. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4284. ReleaseIntermediateOperand(dst);
  4285. SaveRegisters();ReleaseUsedRegisters(saved);
  4286. (* register dst has been freed before SaveRegisters already *)
  4287. CallAssignMethod(dst, operand.op, parameter.type);
  4288. RestoreRegisters(saved);
  4289. END;
  4290. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4291. ELSIF IsOpenArray(parameter.type) THEN
  4292. Designate(expression,operand);
  4293. baseReg := operand.tag;
  4294. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4295. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4296. END;
  4297. Pass((operand.op)); (* address of the array *)
  4298. ELSIF IsDelegate(parameter.type) THEN
  4299. Evaluate(expression,operand);
  4300. IF backend.cooperative & parameter.NeedsTrace() THEN
  4301. Emit(Push(position, nil));
  4302. dst := NewRegisterOperand (addressType);
  4303. Emit(Mov(position,dst, sp));
  4304. ReleaseIntermediateOperand(dst);
  4305. SaveRegisters();ReleaseUsedRegisters(saved);
  4306. Emit(Push(position, dst));
  4307. (* register dst has been freed before SaveRegisters already *)
  4308. Emit(Push(position, operand.tag));
  4309. CallThis(position,"GarbageCollector","Assign",2);
  4310. RestoreRegisters(saved);
  4311. ELSE
  4312. Pass((operand.tag));
  4313. END;
  4314. Pass((operand.op));
  4315. ELSE
  4316. Evaluate(expression,operand);
  4317. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4318. Emit(Push(position, nil));
  4319. dst := NewRegisterOperand (addressType);
  4320. Emit(Mov(position,dst, sp));
  4321. ReleaseIntermediateOperand(dst);
  4322. SaveRegisters();ReleaseUsedRegisters(saved);
  4323. Emit(Push(position, dst));
  4324. (* register dst has been freed before SaveRegisters already *)
  4325. Emit(Push(position, operand.op));
  4326. CallThis(position,"GarbageCollector","Assign",2);
  4327. RestoreRegisters(saved);
  4328. ELSE
  4329. Pass((operand.op));
  4330. END;
  4331. END;
  4332. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4333. Evaluate(expression,operand);
  4334. Pass((operand.op));
  4335. ELSE (* var parameter *)
  4336. Designate(expression,operand);
  4337. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4338. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4339. Pass((operand.tag));
  4340. END;
  4341. END;
  4342. Pass((operand.op));
  4343. END;
  4344. END;
  4345. (* TODO: needed? *)
  4346. arrayDestinationTag := oldArrayDestinationTag;
  4347. arrayDestinationDimension := oldArrayDestinationDimension;
  4348. IF needsParameterBackup THEN
  4349. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4350. ReuseCopy(parameterBackup, operand.op)
  4351. END;
  4352. ReleaseOperand(operand);
  4353. IF Trace THEN TraceExit("PushParameter") END;
  4354. END PushParameter;
  4355. PROCEDURE VisitStatementDesignator(x: SyntaxTree.StatementDesignator);
  4356. VAR prevConditional: BOOLEAN;
  4357. BEGIN
  4358. prevConditional := conditional;
  4359. conditional := FALSE;
  4360. 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
  4361. Expression(x.result); (* use register *)
  4362. END;
  4363. Statement(x.statement);
  4364. conditional := prevConditional;
  4365. IF x.result # NIL THEN Expression(x.result) END;
  4366. 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
  4367. ReleaseIntermediateOperand(result.op);
  4368. END;
  4369. END VisitStatementDesignator;
  4370. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4371. VAR
  4372. procedure: SyntaxTree.Procedure;
  4373. procedureType: SyntaxTree.ProcedureType;
  4374. wasInline: BOOLEAN;
  4375. actualParameters: SyntaxTree.ExpressionList;
  4376. formalParameter: SyntaxTree.Parameter;
  4377. actualParameter: SyntaxTree.Expression;
  4378. i: LONGINT;
  4379. variable, localVariable: SyntaxTree.Variable;
  4380. variableDesignator, tagDesignator, returnDesignator: SyntaxTree.Expression;
  4381. src, dest: Operand;
  4382. prevInlineExit : Label;
  4383. prevMapper: SymbolMapper;
  4384. tooComplex: BOOLEAN;
  4385. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4386. BEGIN
  4387. IF e = NIL THEN RETURN TRUE
  4388. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4389. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4390. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4391. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4392. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4393. ELSE RETURN FALSE
  4394. END;
  4395. END SimpleExpression;
  4396. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4397. BEGIN
  4398. RETURN checker.CanPassInRegister(type)
  4399. END FitsInRegister;
  4400. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4401. VAR
  4402. variable: SyntaxTree.Variable;
  4403. variableDesignator: SyntaxTree.Designator;
  4404. BEGIN
  4405. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type));
  4406. variableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4407. variableDesignator.SetType(type);
  4408. RETURN variableDesignator
  4409. END GetTemp;
  4410. BEGIN
  4411. wasInline := currentIsInline;
  4412. prevInlineExit := currentInlineExit;
  4413. prevMapper := currentMapper;
  4414. currentInlineExit := NewLabel();
  4415. tooComplex := FALSE;
  4416. NEW(currentMapper);
  4417. currentIsInline := TRUE;
  4418. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4419. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4420. formalParameter := procedureType.firstParameter;
  4421. actualParameters := x.parameters;
  4422. i := 0;
  4423. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4424. actualParameter := actualParameters.GetExpression(i);
  4425. IF actualParameter.resolved # NIL THEN
  4426. actualParameter := actualParameter.resolved
  4427. END;
  4428. (*
  4429. if expression is simple and can be passed immediately
  4430. or if type fits in register then we can proceed
  4431. otherwise we escape to ordinary procedure call.
  4432. *)
  4433. (* cases where the expression can be mapped identically *)
  4434. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4435. currentMapper.Add(formalParameter, actualParameter, NIL);
  4436. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4437. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4438. (*
  4439. Assign(variableDesignator, actualParameter);
  4440. *)
  4441. Evaluate(actualParameter, src);
  4442. Designate(variableDesignator, dest);
  4443. Emit(Mov(x.position, dest.op, src.op));
  4444. ReleaseOperand(dest);
  4445. ReleaseOperand(src);
  4446. currentMapper.Add(formalParameter, variableDesignator, NIL);
  4447. ELSE tooComplex := TRUE
  4448. END;
  4449. (*
  4450. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4451. currentMapper.Add(formalParameter, actualParameter, NIL);
  4452. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4453. variableDesignator := GetTemp(system.addressType, FALSE);
  4454. Designate(actualParameter, src);
  4455. Designate(variableDesignator, dest);
  4456. IntermediateCode.MakeMemory(dest.op,addressType);
  4457. Emit(Mov(x.position, dest.op, src.op));
  4458. ReleaseOperand(dest);
  4459. IF src.tag.mode # IntermediateCode.Undefined THEN
  4460. tagDesignator := GetTemp(system.addressType, FALSE);
  4461. Designate(tagDesignator, dest);
  4462. IntermediateCode.MakeMemory(dest.op,addressType);
  4463. Emit(Mov(x.position, dest.op, src.op));
  4464. END;
  4465. ReleaseOperand(dest); ReleaseOperand(src);
  4466. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4467. END;
  4468. *)
  4469. formalParameter := formalParameter.nextParameter;
  4470. INC(i);
  4471. END;
  4472. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4473. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4474. currentMapper.Add(NIL, returnDesignator, NIL);
  4475. END;
  4476. localVariable := procedure.procedureScope.firstVariable;
  4477. WHILE ~tooComplex & (localVariable # NIL) DO
  4478. variableDesignator := GetTemp(localVariable.type, FALSE);
  4479. currentMapper.Add(localVariable, variableDesignator, NIL);
  4480. localVariable := localVariable.nextVariable;
  4481. END;
  4482. IF ~tooComplex THEN
  4483. VisitStatementBlock(procedure.procedureScope.body);
  4484. SetLabel(currentInlineExit);
  4485. IF procedureType.returnType # NIL THEN
  4486. Designate(returnDesignator, result);
  4487. IF conditional THEN
  4488. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4489. ValueToCondition(result)
  4490. END;
  4491. END;
  4492. END;
  4493. currentMapper := prevMapper;
  4494. currentInlineExit := prevInlineExit;
  4495. currentIsInline := wasInline;
  4496. RETURN ~tooComplex
  4497. END InlineProcedureCall;
  4498. PROCEDURE VisitProcedureCallDesignator(x: SyntaxTree.ProcedureCallDesignator);
  4499. VAR
  4500. parameters: SyntaxTree.ExpressionList;
  4501. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4502. designator: SyntaxTree.Designator;
  4503. procedureType: SyntaxTree.ProcedureType;
  4504. formalParameter: SyntaxTree.Parameter;
  4505. noPush, end: Label;
  4506. operand, returnValue: Operand;
  4507. reg, size, mem, mask, dest: IntermediateCode.Operand;
  4508. saved: RegisterEntry;
  4509. symbol: SyntaxTree.Symbol;
  4510. variable: SyntaxTree.Variable;
  4511. i, j, parametersSize, returnTypeSize, returnTypeOffset: LONGINT;
  4512. structuredReturnType: BOOLEAN;
  4513. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  4514. tempVariableDesignator: SyntaxTree.Designator;
  4515. gap, alignment: LONGINT; (*fld*)
  4516. (* TODO: remove unnecessary backup variables *)
  4517. oldResult: Operand;
  4518. oldCurrentScope: SyntaxTree.Scope;
  4519. oldArrayDestinationTag: IntermediateCode.Operand;
  4520. oldArrayDestinationDimension: LONGINT;
  4521. oldConstantDeclaration: SyntaxTree.Symbol;
  4522. oldDestination: IntermediateCode.Operand;
  4523. oldCurrentLoop: Label;
  4524. oldConditional: BOOLEAN;
  4525. oldTrueLabel, oldFalseLabel: Label;
  4526. oldLocked: BOOLEAN;
  4527. usedRegisters,oldUsedRegisters: RegisterEntry;
  4528. return: IntermediateCode.Operand;
  4529. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  4530. arg: IntermediateCode.Operand;
  4531. dummy: IntermediateCode.Operand;
  4532. recordType: SyntaxTree.RecordType;
  4533. operatorSelectionProcedureOperand: Operand;
  4534. operatorSelectionProcedure: SyntaxTree.Procedure;
  4535. fingerPrint: SyntaxTree.FingerPrint;
  4536. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  4537. identifierNumber: LONGINT;
  4538. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  4539. procedure: SyntaxTree.Procedure;
  4540. PROCEDURE BackupGlobalState;
  4541. BEGIN
  4542. oldResult := result;
  4543. oldCurrentScope := currentScope;
  4544. oldArrayDestinationTag := arrayDestinationTag;
  4545. oldArrayDestinationDimension := arrayDestinationDimension;
  4546. oldConstantDeclaration := constantDeclaration;
  4547. oldDestination := destination;
  4548. oldCurrentLoop := currentLoop;
  4549. oldConditional := conditional;
  4550. oldTrueLabel := trueLabel;
  4551. oldFalseLabel := falseLabel;
  4552. oldLocked := locked;
  4553. oldUsedRegisters := usedRegisters
  4554. END BackupGlobalState;
  4555. PROCEDURE RestoreGlobalState;
  4556. BEGIN
  4557. result := oldResult;
  4558. currentScope := oldCurrentScope;
  4559. arrayDestinationTag := oldArrayDestinationTag;
  4560. arrayDestinationDimension := oldArrayDestinationDimension;
  4561. constantDeclaration := oldConstantDeclaration;
  4562. destination := oldDestination;
  4563. currentLoop := oldCurrentLoop;
  4564. conditional := oldConditional;
  4565. trueLabel := oldTrueLabel;
  4566. falseLabel := oldFalseLabel;
  4567. locked := oldLocked;
  4568. usedRegisters := oldUsedRegisters
  4569. END RestoreGlobalState;
  4570. (** do preparations before parameter push for array-structured object types (ASOTs):
  4571. if ASOT is passed as VAR parameter:
  4572. - allocate temporary variable of math array type
  4573. - copy contents of ASOT to be passed to temporary variable
  4574. - use temporary variable as the actual parameter instead
  4575. - 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)
  4576. **)
  4577. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  4578. VAR
  4579. expression: SyntaxTree.Expression;
  4580. BEGIN
  4581. IF actualParameter IS SyntaxTree.Designator THEN
  4582. designator := actualParameter(SyntaxTree.Designator);
  4583. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  4584. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  4585. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  4586. ASSERT(checker # NIL);
  4587. checker.SetCurrentScope(currentScope);
  4588. (* allocate temporary variable *)
  4589. ASSERT(actualParameter.type # NIL);
  4590. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  4591. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4592. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4593. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4594. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  4595. ASSERT(tempVariableDesignator.type # NIL);
  4596. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  4597. (* copy math array stored in actual parameter to temporary variable *)
  4598. BackupGlobalState;
  4599. AssignMathArray(tempVariableDesignator, actualParameter);
  4600. RestoreGlobalState;
  4601. (* use temporary variable as actual parameter instead of the original one *)
  4602. actualParameter := tempVariableDesignator;
  4603. (* create write-back call and store it in linked list *)
  4604. (* create new list entry *)
  4605. IF firstWriteBackCall = NIL THEN
  4606. NEW(firstWriteBackCall);
  4607. currentWriteBackCall := firstWriteBackCall
  4608. ELSE
  4609. ASSERT(currentWriteBackCall # NIL);
  4610. NEW(currentWriteBackCall.next);
  4611. currentWriteBackCall := currentWriteBackCall.next
  4612. END;
  4613. expression := checker.NewIndexOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4614. ASSERT(expression.type = NIL);
  4615. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4616. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  4617. (* prepare writeback for any other "normal" indexer *)
  4618. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE);
  4619. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, variable);
  4620. tempVariableDesignator.SetType(actualParameter.type.resolved);
  4621. Assign(tempVariableDesignator, actualParameter);
  4622. actualParameter := tempVariableDesignator;
  4623. IF firstWriteBackCall = NIL THEN
  4624. NEW(firstWriteBackCall);
  4625. currentWriteBackCall := firstWriteBackCall
  4626. ELSE
  4627. ASSERT(currentWriteBackCall # NIL);
  4628. NEW(currentWriteBackCall.next);
  4629. currentWriteBackCall := currentWriteBackCall.next
  4630. END;
  4631. expression := checker.NewObjectOperatorCall(SemanticChecker.InvalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  4632. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  4633. END
  4634. END
  4635. END PrepareParameter;
  4636. BEGIN
  4637. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  4638. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  4639. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4640. IF procedure.isOberonInline & (procedure.scope.ownerModule = module.module) THEN
  4641. IF InlineProcedureCall(x) THEN
  4642. RETURN
  4643. ELSE
  4644. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  4645. END
  4646. END;
  4647. END;
  4648. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4649. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  4650. dest := destination; destination := emptyOperand;
  4651. SaveRegisters();ReleaseUsedRegisters(saved);
  4652. parameters := x.parameters;
  4653. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  4654. (* an operator is called *)
  4655. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4656. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  4657. (* check if a dynamic operator call should be performed *)
  4658. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic
  4659. ELSE
  4660. isCallOfDynamicOperator := FALSE
  4661. END;
  4662. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4663. Emit(Push(position, ap));
  4664. END;
  4665. alignment := procedureType.stackAlignment;
  4666. IF alignment > 1 THEN
  4667. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4668. Emit(Mov(position,reg, sp));
  4669. gap := ParametersSize(system, procedureType, FALSE) + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  4670. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  4671. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  4672. Emit(And(position,sp, sp, mask));
  4673. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  4674. Emit(Push(position,reg));
  4675. (*
  4676. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  4677. Emit(Mov(position,mem,reg));
  4678. *)
  4679. ReleaseIntermediateOperand(reg);
  4680. END;
  4681. IF procedureType.callingConvention = SyntaxTree.DarwinCCallingConvention THEN (*fld*)
  4682. IntermediateCode.InitImmediate(mask,addressType,-16);
  4683. Emit(And(position,sp, sp, mask));
  4684. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  4685. IF gap # 0 THEN
  4686. IntermediateCode.InitImmediate(size,addressType,gap);
  4687. Emit(Sub(position,sp,sp,size))
  4688. END;
  4689. END;
  4690. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4691. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4692. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  4693. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  4694. ELSE
  4695. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  4696. END;
  4697. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  4698. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  4699. (* push ID *)
  4700. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4701. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  4702. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  4703. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  4704. formalParameter := procedureType.firstParameter;
  4705. FOR i := 0 TO parameters.Length() - 1 DO
  4706. IF formalParameter.access # SyntaxTree.Hidden THEN
  4707. ASSERT(i < 2);
  4708. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  4709. (* push pointer *)
  4710. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4711. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  4712. (* add dereference *)
  4713. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4714. ReleaseIntermediateOperand(parameterBackups[i]);
  4715. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  4716. END;
  4717. Emit(Push(position,parameterBackups[i]));
  4718. ReleaseIntermediateOperand(parameterBackups[i]);
  4719. (* push typetag *)
  4720. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4721. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  4722. arg := TypeDescriptorAdr(recordType);
  4723. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  4724. Emit(Push(position,arg));
  4725. ELSE
  4726. (* push 'NonPointer' *)
  4727. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4728. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4729. (* push fingerprint *)
  4730. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4731. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  4732. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow))) (* TODO: push the type's fingerprint *)
  4733. END
  4734. END;
  4735. formalParameter := formalParameter.nextParameter
  4736. END;
  4737. (* for unary operators: complete the information for the second parameter *)
  4738. IF procedureType.numberParameters < 2 THEN
  4739. (* push 'NonPointer' *)
  4740. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4741. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  4742. (* push 'NoType' *)
  4743. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4744. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  4745. END;
  4746. (* call operator selection procedure *)
  4747. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  4748. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  4749. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  4750. ReleaseOperand(operatorSelectionProcedureOperand);
  4751. (* use the address that the operator selection procedure returned as the target address of the call *)
  4752. InitOperand(operand, ModeValue);
  4753. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  4754. Emit(Result(position,operand.op))
  4755. END
  4756. ELSE
  4757. Evaluate(x.left, operand)
  4758. END;
  4759. IF symbol IS SyntaxTree.Procedure THEN
  4760. IF x.left IS SyntaxTree.SupercallDesignator THEN
  4761. Emit(Push(position,operand.tag));
  4762. ELSIF (procedureType.isDelegate) THEN
  4763. Emit(Push(position,operand.tag));
  4764. END;
  4765. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  4766. IF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  4767. Emit(Push(position,operand.tag));
  4768. END;
  4769. ELSE HALT(200);
  4770. END;
  4771. ReleaseIntermediateOperand(operand.tag);
  4772. operand.tag := emptyOperand;
  4773. (* determine if a structured return type is needed *)
  4774. structuredReturnType := StructuredReturnType(procedureType);
  4775. IF structuredReturnType THEN
  4776. IF resultDesignator # NIL THEN
  4777. d := resultDesignator;
  4778. ELSE
  4779. variable := GetTemporaryVariable(procedureType.returnType, FALSE);
  4780. variable.SetUntraced(procedureType.hasUntracedReturn);
  4781. d := SyntaxTree.NewSymbolDesignator(-1,NIL,variable);
  4782. d.SetType(variable.type);
  4783. END;
  4784. IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  4785. Designate(d,returnValue);
  4786. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  4787. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  4788. Emit(Push(position,size));
  4789. Emit(Push(position,returnValue.op));
  4790. ReleaseOperand(returnValue);
  4791. ELSE
  4792. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  4793. END;
  4794. END;
  4795. firstWriteBackCall := NIL; (* reset write-back call list *)
  4796. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  4797. passByRegister := system.registerParameters > 0;
  4798. registerNumber := 0;
  4799. formalParameter := procedureType.lastParameter;
  4800. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  4801. actualParameter := parameters.GetExpression(i);
  4802. PrepareParameter(actualParameter, formalParameter);
  4803. IF passByRegister & (i < system.registerParameters) THEN
  4804. IF ~PassInRegister(formalParameter) THEN
  4805. Error(actualParameter.position,"cannot be passed by register")
  4806. ELSE
  4807. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  4808. END;
  4809. INC(registerNumber);
  4810. ELSE
  4811. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  4812. END;
  4813. formalParameter := formalParameter.prevParameter;
  4814. END;
  4815. IF passByRegister & (registerNumber > 0) THEN
  4816. stackSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  4817. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4818. END;
  4819. ELSE
  4820. hasDynamicOperands := FALSE;
  4821. formalParameter := procedureType.firstParameter;
  4822. FOR i := 0 TO parameters.Length() - 1 DO
  4823. actualParameter := parameters.GetExpression(i);
  4824. IF formalParameter # NIL THEN (* TENTATIVE *)
  4825. PrepareParameter(actualParameter, formalParameter);
  4826. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  4827. ASSERT(i < 2);
  4828. hasDynamicOperands := TRUE;
  4829. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  4830. ELSE
  4831. IF passByRegister & (registerNumber > 0) THEN
  4832. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  4833. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  4834. END;
  4835. passByRegister := FALSE;
  4836. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  4837. END;
  4838. formalParameter := formalParameter.nextParameter;
  4839. END;
  4840. END;
  4841. END;
  4842. IF symbol IS SyntaxTree.Procedure THEN
  4843. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  4844. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  4845. Emit(Push(position,reg));
  4846. ReleaseIntermediateOperand(reg);
  4847. END;
  4848. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  4849. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  4850. parametersSize := ParametersSize(system,procedureType,FALSE);
  4851. END;
  4852. ReleaseParameterRegisters();
  4853. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR (procedureType.callingConvention = SyntaxTree.CCallingConvention) THEN
  4854. Emit(Call(position,operand.op,0));
  4855. ELSE
  4856. Emit(Call(position,operand.op,parametersSize));
  4857. END;
  4858. ReleaseOperand(operand);
  4859. IF procedureType.noReturn THEN
  4860. EmitTrap(position,NoReturnTrap);
  4861. END;
  4862. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  4863. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  4864. Emit(Result(position,return));
  4865. END;
  4866. IF procedureType.callingConvention = SyntaxTree.CCallingConvention THEN
  4867. IF passByRegister & (registerNumber > 0) & (registerNumber < system.registerParameters) THEN (* allocated space for all registers *)
  4868. parametersSize := ToMemoryUnits(system,system.registerParameters*addressType.sizeInBits);
  4869. END;
  4870. size := IntermediateCode.Immediate(addressType,parametersSize);
  4871. Emit(Add(position,sp,sp,size));
  4872. END;
  4873. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  4874. IF structuredReturnType THEN
  4875. (* stack pointer rewinding done by callee
  4876. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  4877. Emit(Add(position,sp,sp,size));
  4878. *)
  4879. RestoreRegisters(saved);
  4880. InitOperand(result,ModeReference);
  4881. Symbol(variable,result);
  4882. ELSE
  4883. RestoreRegisters(saved);
  4884. InitOperand(result,ModeValue);
  4885. result.op := return;
  4886. END;
  4887. END;
  4888. IF alignment > 1 THEN
  4889. Emit(Pop(position,sp));
  4890. END;
  4891. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  4892. Emit(Pop(position, ap));
  4893. END;
  4894. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  4895. ValueToCondition(result);
  4896. END;
  4897. destination := dest;
  4898. (* perform all write-back calls in the list *)
  4899. BackupGlobalState;
  4900. currentWriteBackCall := firstWriteBackCall;
  4901. WHILE currentWriteBackCall # NIL DO
  4902. VisitProcedureCallDesignator(currentWriteBackCall.call);
  4903. currentWriteBackCall := currentWriteBackCall.next
  4904. END;
  4905. RestoreGlobalState;
  4906. (* TENATIVE *)
  4907. (*
  4908. IF isOperatorCall THEN
  4909. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  4910. END;
  4911. *)
  4912. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  4913. END VisitProcedureCallDesignator;
  4914. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  4915. VAR res: IntermediateCode.Operand; source: Sections.Section; offset: LONGINT; name: Basic.SegmentedName;
  4916. td: SyntaxTree.Symbol;
  4917. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  4918. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  4919. BEGIN
  4920. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  4921. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  4922. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  4923. variable.SetType(system.anyType);
  4924. scope.AddVariable(variable);
  4925. hiddenPointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  4926. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  4927. typeDeclaration.SetDeclaredType(hiddenPointerType);
  4928. typeDeclaration.SetScope(module.module.moduleScope);
  4929. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  4930. hiddenPointerType.SetState(SyntaxTree.Resolved);
  4931. END;
  4932. RETURN hiddenPointerType;
  4933. END GetHiddenPointerType;
  4934. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  4935. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  4936. BEGIN
  4937. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  4938. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  4939. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Procedure"));
  4940. variable.SetType(SyntaxTree.NewProcedureType(-1,NIL));
  4941. scope.AddVariable(variable);
  4942. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier("@Any"));
  4943. variable.SetType(system.anyType);
  4944. scope.AddVariable(variable);
  4945. delegatePointerType := SyntaxTree.NewRecordType(-1,NIL,scope);
  4946. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier("@Delegate"));
  4947. typeDeclaration.SetDeclaredType(delegatePointerType);
  4948. typeDeclaration.SetScope(module.module.moduleScope);
  4949. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  4950. delegatePointerType.SetState(SyntaxTree.Resolved);
  4951. END;
  4952. RETURN delegatePointerType
  4953. END GetDelegateType;
  4954. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  4955. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  4956. such as in VAR a: RECORD ... END;
  4957. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  4958. and variables, constants and procedures the same mechanism can be used for fixups etc.
  4959. *)
  4960. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  4961. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  4962. BEGIN (* no code emission *)
  4963. source := NIL;
  4964. x := x.resolved;
  4965. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  4966. x := GetHiddenPointerType();
  4967. ELSIF IsDelegate(x) THEN
  4968. x := GetDelegateType();
  4969. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  4970. ELSE HALT(200);
  4971. END;
  4972. td := x.typeDeclaration;
  4973. IF td = NIL THEN
  4974. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  4975. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  4976. ASSERT(td # NIL);
  4977. END;
  4978. IF newObjectFile THEN
  4979. GetCodeSectionNameForSymbol(td,name);
  4980. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  4981. meta.CheckTypeDeclaration(x);
  4982. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  4983. ELSE
  4984. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  4985. END;
  4986. IF backend.cooperative THEN
  4987. offset := 0;
  4988. ELSE
  4989. IF x IS SyntaxTree.CellType THEN
  4990. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  4991. IF baseRecord = NIL THEN
  4992. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  4993. ELSE
  4994. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  4995. END;
  4996. ELSE
  4997. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  4998. END;
  4999. END;
  5000. ELSE
  5001. offset := 0;
  5002. source := module.allSections.FindBySymbol(td); (*TODO*)
  5003. IF source = NIL THEN
  5004. null := 0;
  5005. GetCodeSectionNameForSymbol(td,name);
  5006. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5007. IntermediateCode.InitImmediate(op,addressType,0);
  5008. source(IntermediateCode.Section).Emit(Data(position,op));
  5009. source.SetReferenced(FALSE)
  5010. ELSE
  5011. name := source.name;
  5012. END;
  5013. END;
  5014. RETURN td
  5015. END GetBackendType;
  5016. BEGIN
  5017. (*td := t.typeDeclaration;*)
  5018. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5019. (*
  5020. IF t IS SyntaxTree.PointerType THEN
  5021. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5022. ELSE
  5023. source := GetBackendType(t);
  5024. END;
  5025. *)
  5026. IF newObjectFile THEN
  5027. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5028. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5029. IntermediateCode.SetOffset(res,offset);
  5030. ELSE
  5031. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5032. END;
  5033. (*
  5034. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5035. make memory should be used when tag is used, not earlier
  5036. *)
  5037. RETURN res
  5038. END TypeDescriptorAdr;
  5039. (*
  5040. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5041. VAR result: IntermediateCode.Operand;
  5042. BEGIN
  5043. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5044. operand.tag := TypeDescriptorAdr(operand.type);
  5045. IntermediateCode.MakeMemory(operand.tag,addressType);
  5046. UseIntermediateOperand(operand.tag);
  5047. END;
  5048. END MakeTypeTag;
  5049. *)
  5050. PROCEDURE ProfilerInit;
  5051. VAR reg: IntermediateCode.Operand;
  5052. BEGIN
  5053. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5054. Emit(Call(position,reg,0));
  5055. END ProfilerInit;
  5056. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5057. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5058. BEGIN
  5059. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5060. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5061. THEN
  5062. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5063. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5064. Emit(Push(position,reg));
  5065. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5066. Emit(Push(position,reg));
  5067. StaticCallOperand(result,procedure);
  5068. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5069. ReleaseOperand(result);
  5070. END;
  5071. END ProfilerEnterExit;
  5072. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5073. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5074. BEGIN
  5075. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5076. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5077. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5078. profileInit.Emit(Push(position,reg));
  5079. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5080. profileInit.Emit(Push(position,reg));
  5081. NEW(string, LEN(name)); COPY(name, string^);
  5082. sv := SyntaxTree.NewStringValue(-1,string);
  5083. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5084. sv.SetType(type);
  5085. Designate(sv,result);
  5086. profileInit.Emit(Push(position,result.tag));
  5087. profileInit.Emit(Push(position,result.op));
  5088. StaticCallOperand(result,procedure);
  5089. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5090. ReleaseOperand(result);
  5091. END;
  5092. END ProfilerAddProcedure;
  5093. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5094. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5095. BEGIN
  5096. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5097. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5098. profileInit.Emit(Push(position,reg));
  5099. profileInitPatchPosition := profileInit.pc;
  5100. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5101. NEW(string, LEN(name)); COPY(name, string^);
  5102. sv := SyntaxTree.NewStringValue(-1,string);
  5103. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(name));
  5104. sv.SetType(type);
  5105. Designate(sv,result);
  5106. profileInit.Emit(Push(position,result.tag));
  5107. profileInit.Emit(Push(position,result.op));
  5108. StaticCallOperand(result,procedure);
  5109. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5110. ReleaseOperand(result);
  5111. END;
  5112. END ProfilerAddModule;
  5113. PROCEDURE ProfilerPatchInit;
  5114. VAR reg: IntermediateCode.Operand;
  5115. BEGIN
  5116. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5117. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5118. profileInit.Emit(Leave(position,NIL,0));
  5119. profileInit.Emit(Exit(position,0,0));
  5120. END ProfilerPatchInit;
  5121. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5122. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5123. VAR
  5124. id: LONGINT;
  5125. leftType, rightType: SyntaxTree.Type;
  5126. procedureType: SyntaxTree.ProcedureType;
  5127. runtimeProcedure: SyntaxTree.Procedure;
  5128. runtimeProcedureOperand, operatorOperand: Operand;
  5129. kind: SET;
  5130. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5131. VAR
  5132. arg: IntermediateCode.Operand;
  5133. recordType: SyntaxTree.RecordType;
  5134. fingerPrint: SyntaxTree.FingerPrint;
  5135. BEGIN
  5136. IF type = NIL THEN
  5137. (* no type: push 'NoType' *)
  5138. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5139. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5140. ELSIF IsStrictlyPointerToRecord(type) THEN
  5141. (* pointer to record type: push typetag *)
  5142. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5143. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5144. arg := TypeDescriptorAdr(recordType);
  5145. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5146. ELSE
  5147. (* non-pointer to record type: push fingerprint *)
  5148. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5149. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5150. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.shallow)
  5151. END;
  5152. operatorInitializationCodeSection.Emit(Push(position,arg))
  5153. END PushTypeInfo;
  5154. BEGIN
  5155. ASSERT(operatorInitializationCodeSection # NIL);
  5156. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5157. procedureType := operator.type(SyntaxTree.ProcedureType);
  5158. (* determine types *)
  5159. leftType := procedureType.firstParameter.type;
  5160. IF procedureType.numberParameters = 2 THEN
  5161. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5162. rightType := procedureType.firstParameter.nextParameter.type;
  5163. ELSE
  5164. rightType := NIL
  5165. END;
  5166. (* determine operator kind *)
  5167. IF IsStrictlyPointerToRecord(leftType) THEN
  5168. kind := {LhsIsPointer}
  5169. ELSE
  5170. kind := {}
  5171. END;
  5172. IF IsStrictlyPointerToRecord(rightType) THEN
  5173. kind := kind + {RhsIsPointer}
  5174. END;
  5175. IF kind # {} THEN (* TODO: to be removed later on *)
  5176. (* at least one of the types is a pointer to record *)
  5177. (* emit a code that registers this specific operator in the runtime *)
  5178. dump := operatorInitializationCodeSection.comments;
  5179. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5180. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5181. (* push ID *)
  5182. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5183. id := Global.GetSymbol(module.module.case, operator.name);
  5184. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5185. (* push kind *)
  5186. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5187. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5188. (* push type infos *)
  5189. PushTypeInfo(leftType);
  5190. PushTypeInfo(rightType);
  5191. (* push operator address *)
  5192. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5193. StaticCallOperand(operatorOperand, operator);
  5194. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5195. ReleaseOperand(operatorOperand);
  5196. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5197. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5198. ReleaseOperand(runtimeProcedureOperand)
  5199. END
  5200. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5201. END
  5202. END RegisterDynamicOperator;
  5203. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: LONGINT);
  5204. VAR
  5205. traceModule: SyntaxTree.Module;
  5206. procedure: SyntaxTree.Procedure;
  5207. procedureVariable: SyntaxTree.Variable;
  5208. s,msg: Basic.MessageString;
  5209. res: Operand;
  5210. i: LONGINT;
  5211. sv: SyntaxTree.StringValue;
  5212. type: SyntaxTree.Type;
  5213. recordType: SyntaxTree.RecordType;
  5214. printout: Printout.Printer;
  5215. stringWriter: Streams.StringWriter;
  5216. expression: SyntaxTree.Expression;
  5217. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5218. BEGIN
  5219. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5220. IF procedure = NIL THEN
  5221. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5222. END;
  5223. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5224. s := "procedure ";
  5225. Strings.Append(s,backend.traceModuleName);
  5226. Strings.Append(s,".");
  5227. Strings.Append(s,procedureName);
  5228. Strings.Append(s," not present");
  5229. Error(position,s);
  5230. RETURN FALSE
  5231. ELSE
  5232. RETURN TRUE
  5233. END;
  5234. END GetProcedure;
  5235. PROCEDURE CallProcedure;
  5236. VAR size: LONGINT;
  5237. BEGIN
  5238. IF procedure # NIL THEN
  5239. StaticCallOperand(result,procedure);
  5240. size := ProcedureParametersSize(system,procedure);
  5241. ELSE
  5242. Symbol(procedureVariable, result);
  5243. LoadValue(result, procedureVariable.type.resolved);
  5244. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5245. END;
  5246. Emit(Call(position,result.op,size));
  5247. END CallProcedure;
  5248. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5249. VAR res: Operand; string: SyntaxTree.String;
  5250. BEGIN
  5251. IF GetProcedure("String") THEN
  5252. NEW(string, LEN(s)); COPY(s, string^);
  5253. sv := SyntaxTree.NewStringValue(-1,string);
  5254. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5255. sv.SetType(type);
  5256. Designate(sv,res);
  5257. Emit(Push(position,res.tag));
  5258. Emit(Push(position,res.op));
  5259. ReleaseOperand(res);
  5260. CallProcedure;
  5261. END;
  5262. END String;
  5263. PROCEDURE Integer(op: IntermediateCode.Operand);
  5264. BEGIN
  5265. IF GetProcedure("Int") THEN
  5266. Emit(Push(position,op));
  5267. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5268. CallProcedure;
  5269. END;
  5270. END Integer;
  5271. PROCEDURE Float(op: IntermediateCode.Operand);
  5272. BEGIN
  5273. IF GetProcedure("HIntHex") THEN
  5274. Emit(Push(position,op));
  5275. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5276. CallProcedure;
  5277. END;
  5278. END Float;
  5279. PROCEDURE Set(op: IntermediateCode.Operand);
  5280. BEGIN
  5281. IF GetProcedure("Set") THEN
  5282. Emit(Push(position,op));
  5283. (*
  5284. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5285. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5286. *)
  5287. CallProcedure;
  5288. END;
  5289. END Set;
  5290. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5291. BEGIN
  5292. IF GetProcedure("Boolean") THEN
  5293. Emit(Push(position,op));
  5294. CallProcedure;
  5295. END;
  5296. END Boolean;
  5297. PROCEDURE Char(op: IntermediateCode.Operand);
  5298. BEGIN
  5299. IF GetProcedure("Char") THEN
  5300. Emit(Push(position,op));
  5301. CallProcedure;
  5302. END;
  5303. END Char;
  5304. PROCEDURE Address(op: IntermediateCode.Operand);
  5305. BEGIN
  5306. IF GetProcedure("Address") THEN
  5307. Emit(Push(position,op));
  5308. CallProcedure;
  5309. END;
  5310. END Address;
  5311. PROCEDURE StringOperand(op,tag: IntermediateCode.Operand);
  5312. BEGIN
  5313. IF GetProcedure("String") THEN
  5314. Emit(Push(position,tag));
  5315. Emit(Push(position,op));
  5316. CallProcedure;
  5317. END;
  5318. END StringOperand;
  5319. PROCEDURE Ln;
  5320. BEGIN
  5321. IF GetProcedure("Ln") THEN
  5322. CallProcedure;
  5323. END;
  5324. END Ln;
  5325. BEGIN
  5326. IF backend.traceModuleName = "" THEN RETURN END;
  5327. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5328. IF GetProcedure("Enter") THEN
  5329. CallProcedure
  5330. END;
  5331. NEW(stringWriter,LEN(s));
  5332. FOR i := 0 TO x.Length()-1 DO
  5333. msg := "";
  5334. expression := x.GetExpression(i);
  5335. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5336. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5337. ELSE
  5338. Global.GetModuleName(module.module, s);
  5339. END;
  5340. IF i = 0 THEN
  5341. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos,1);
  5342. stringWriter.String(":");
  5343. END;
  5344. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5345. IF ~(expression IS SyntaxTree.StringValue) THEN
  5346. printout.Expression(expression);
  5347. stringWriter.Get(s);
  5348. Strings.Append(msg,s);
  5349. Strings.Append(msg,"= ");
  5350. ELSE stringWriter.Get(s); (* remove from string writer *)
  5351. Strings.Append(msg, s);
  5352. END;
  5353. String(msg);
  5354. IF SemanticChecker.IsStringType(expression.type) THEN
  5355. Designate(expression,res);
  5356. StringOperand(res.op,res.tag);
  5357. ELSE
  5358. Evaluate(expression,res);
  5359. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5360. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5361. Convert(res.op,int64);
  5362. END;
  5363. Integer(res.op);
  5364. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5365. Boolean(res.op);
  5366. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5367. Set(res.op);
  5368. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5369. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5370. Convert(res.op,float64);
  5371. END;
  5372. Float(res.op);
  5373. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5374. Char(res.op);
  5375. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5376. Address(res.op);String("H");
  5377. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5378. Address(res.op);String("H");
  5379. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5380. Address(res.op);String("H");
  5381. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5382. Address(res.op);String("H");
  5383. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5384. String("NIL");
  5385. ELSE HALT(200);
  5386. END;
  5387. END;
  5388. ReleaseOperand(res);
  5389. String("; ");
  5390. END;
  5391. IF GetProcedure("Exit") THEN
  5392. CallProcedure
  5393. ELSE
  5394. Ln;
  5395. END;
  5396. END;
  5397. END SystemTrace;
  5398. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5399. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5400. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5401. BEGIN
  5402. type := type.resolved;
  5403. IF type IS SyntaxTree.RecordType THEN
  5404. WITH type: SyntaxTree.RecordType DO
  5405. baseType := type.baseType;
  5406. IF baseType # NIL THEN
  5407. baseType := baseType.resolved;
  5408. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5409. InitFields(baseType,adr,offset);
  5410. END;
  5411. variable := type.recordScope.firstVariable;
  5412. WHILE variable # NIL DO
  5413. IF variable.initializer # NIL THEN
  5414. Evaluate(variable.initializer,initializerOp);
  5415. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5416. Emit(Mov(position,mem,initializerOp.op));
  5417. ReleaseOperand(initializerOp);
  5418. ReleaseIntermediateOperand(mem);
  5419. END;
  5420. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5421. variable := variable.nextVariable
  5422. END;
  5423. END;
  5424. ELSIF (type IS SyntaxTree.ArrayType) THEN
  5425. WITH type: SyntaxTree.ArrayType DO
  5426. IF type.form = SyntaxTree.Static THEN
  5427. baseType := type.arrayBase;
  5428. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5429. FOR i := 0 TO type.staticLength-1 DO
  5430. InitFields(baseType,adr,offset+i*size);
  5431. END;
  5432. END;
  5433. END;
  5434. ELSIF type IS SyntaxTree.MathArrayType THEN
  5435. WITH type: SyntaxTree.MathArrayType DO
  5436. IF type.form = SyntaxTree.Open THEN
  5437. dim := DynamicDim(type);
  5438. imm := IntermediateCode.Immediate(addressType,dim);
  5439. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  5440. baseType := SemanticChecker.ArrayBase(type,dim);
  5441. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  5442. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  5443. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  5444. ReleaseIntermediateOperand(imm);
  5445. (* flags remain empty (=0) for open array *)
  5446. ELSIF type.form = SyntaxTree.Static THEN
  5447. baseType := type.arrayBase;
  5448. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  5449. FOR i := 0 TO type.staticLength-1 DO
  5450. InitFields(baseType,adr,offset+i*size);
  5451. END;
  5452. END;
  5453. END;
  5454. END;
  5455. END InitFields;
  5456. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable);
  5457. VAR type: SyntaxTree.Type; operand: Operand; tmp: IntermediateCode.Operand; reference: SyntaxTree.Expression;
  5458. BEGIN
  5459. type := variable.type.resolved;
  5460. IF (type IS SyntaxTree.MathArrayType) THEN
  5461. WITH type: SyntaxTree.MathArrayType DO
  5462. IF type.form = SyntaxTree.Open THEN
  5463. Symbol(variable,operand);
  5464. InitFields(type, operand.tag,0);
  5465. ELSIF type.form = SyntaxTree.Tensor THEN
  5466. Symbol(variable, operand);
  5467. MakeMemory(tmp,operand.op,addressType,0);
  5468. ReleaseOperand(operand);
  5469. Emit(Mov(position,tmp, nil ) );
  5470. ReleaseIntermediateOperand(tmp);
  5471. END;
  5472. END;
  5473. ELSE
  5474. Symbol(variable,operand);
  5475. IF variable.initializer # NIL THEN
  5476. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  5477. reference.SetType(variable.type.resolved);
  5478. reference.SetAssignable(TRUE);
  5479. Assign(reference,variable.initializer);
  5480. END;
  5481. InitFields(type, operand.op,0);
  5482. ReleaseOperand(operand);
  5483. END;
  5484. END InitVariable;
  5485. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  5486. VAR end: Label;
  5487. BEGIN
  5488. IF type.form = SyntaxTree.Tensor THEN
  5489. InitOperand(result,ModeValue);
  5490. ReuseCopy(result.op,base);
  5491. end := NewLabel();
  5492. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  5493. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  5494. SetLabel(end);
  5495. Convert(result.op,int32);
  5496. ELSE
  5497. InitOperand(result,ModeValue);
  5498. IntermediateCode.InitImmediate(result.op, int32, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  5499. END
  5500. END MathArrayDim;
  5501. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  5502. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  5503. BEGIN
  5504. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5505. MakeMemory(mem,base,addressType,offset);
  5506. Emit(Mov(position,mem,value));
  5507. ReleaseIntermediateOperand(mem);
  5508. END PutMathArrayField;
  5509. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  5510. VAR mem: IntermediateCode.Operand;
  5511. BEGIN
  5512. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  5513. MakeMemory(mem,base,addressType,offset);
  5514. Emit(Mov(position,mem,value));
  5515. ReleaseIntermediateOperand(mem);
  5516. END PutMathArrayFieldOffset;
  5517. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  5518. BEGIN
  5519. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  5520. MakeMemory(value,base,addressType,offset);
  5521. END GetMathArrayField;
  5522. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  5523. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  5524. BEGIN
  5525. IF incr THEN
  5526. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  5527. ELSE
  5528. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  5529. END;
  5530. IF dim.mode=IntermediateCode.ModeImmediate THEN
  5531. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  5532. ELSE
  5533. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5534. Emit(Mov(position,reg,dim));
  5535. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  5536. Emit(Add(position,reg,reg,base));
  5537. MakeMemory(mem, reg, addressType, offset);
  5538. ReleaseIntermediateOperand(reg);
  5539. Emit(Mov(position,mem,value));
  5540. ReleaseIntermediateOperand(mem);
  5541. END;
  5542. END PutMathArrayLenOrIncr;
  5543. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  5544. BEGIN
  5545. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  5546. END PutMathArrayLength;
  5547. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  5548. BEGIN
  5549. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  5550. END PutMathArrayIncrement;
  5551. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5552. BEGIN
  5553. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  5554. END GetMathArrayIncrement;
  5555. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  5556. BEGIN
  5557. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  5558. END GetMathArrayLength;
  5559. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5560. VAR dimOp: IntermediateCode.Operand;
  5561. BEGIN
  5562. dimOp := IntermediateCode.Immediate(int32, dim);
  5563. GetMathArrayLength(type, operand, dimOp, check, result);
  5564. END GetMathArrayLengthAt;
  5565. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  5566. VAR dimOp: IntermediateCode.Operand;
  5567. BEGIN
  5568. dimOp := IntermediateCode.Immediate(int32, dim);
  5569. GetMathArrayIncrement(type, operand, dimOp, check, result);
  5570. END GetMathArrayIncrementAt;
  5571. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  5572. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5573. offset: LONGINT;
  5574. BEGIN
  5575. IF increment THEN
  5576. offset := MathIncrOffset;
  5577. ELSE
  5578. offset := MathLenOffset;
  5579. END;
  5580. INC(offset,operand.dimOffset*2);
  5581. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  5582. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  5583. END;
  5584. (* static dimension *)
  5585. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5586. IF check & (type.form = SyntaxTree.Tensor) THEN
  5587. DimensionCheck(operand.tag,dim,BrltL);
  5588. END;
  5589. val := SHORT(dim.intValue);
  5590. IF type.form # SyntaxTree.Tensor THEN
  5591. t := SemanticChecker.ArrayBase(type,val);
  5592. type := t.resolved(SyntaxTree.MathArrayType);
  5593. IF type.form = SyntaxTree.Static THEN
  5594. IF increment THEN
  5595. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  5596. ELSE
  5597. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5598. END;
  5599. InitOperand(result,ModeValue);
  5600. result.op := res;
  5601. RETURN;
  5602. END;
  5603. END;
  5604. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  5605. MakeMemory(res,operand.tag,addressType,offset);
  5606. (*
  5607. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5608. *)
  5609. InitOperand(result,ModeValue);
  5610. result.op := res;
  5611. ELSE
  5612. Convert(dim,addressType);
  5613. IF check THEN
  5614. IF type.form = SyntaxTree.Tensor THEN
  5615. DimensionCheck(operand.tag,dim,BrltL);
  5616. ELSIF isUnchecked THEN (* do nothing *)
  5617. ELSE
  5618. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5619. END;
  5620. END;
  5621. end := NewLabel(); next := NIL;
  5622. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5623. Emit(Mov(position,res,dim));
  5624. Convert(res,int32);
  5625. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5626. WHILE t IS SyntaxTree.MathArrayType DO
  5627. type := t(SyntaxTree.MathArrayType);
  5628. IF type.form = SyntaxTree.Static THEN
  5629. imm := IntermediateCode.Immediate(int32,val);
  5630. next := NewLabel();
  5631. BrneL(next,imm,res);
  5632. IF increment THEN
  5633. imm := IntermediateCode.Immediate(int32,ToMemoryUnits(system,type.staticIncrementInBits));
  5634. ELSE
  5635. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5636. END;
  5637. Emit(MovReplace(position,res,imm));
  5638. BrL(end);
  5639. ELSE hasDynamicPart := TRUE;
  5640. END;
  5641. t := type.arrayBase.resolved;
  5642. val := val + 1;
  5643. IF next # NIL THEN SetLabel(next) END;
  5644. END;
  5645. IF hasDynamicPart THEN
  5646. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5647. Emit(Mov(position,res2,dim));
  5648. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  5649. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5650. Emit(Add(position,res2,res2,imm));
  5651. Emit(Add(position,res2,res2,operand.tag));
  5652. IntermediateCode.MakeMemory(res2,int32);
  5653. Emit(MovReplace(position,res,res2));
  5654. ReleaseIntermediateOperand(res2);
  5655. END;
  5656. SetLabel(end);
  5657. Convert(res,int32);
  5658. InitOperand(result,ModeValue);
  5659. result.op := res;
  5660. END;
  5661. END MathArrayLenOrIncr;
  5662. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  5663. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  5664. offset: LONGINT;
  5665. BEGIN
  5666. offset := operand.dimOffset+DynamicDim(type)-1;
  5667. IF dim.mode = IntermediateCode.ModeImmediate THEN
  5668. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  5669. val := SHORT(dim.intValue);
  5670. t := SemanticChecker.ArrayBase(type,val);
  5671. type := t.resolved(SyntaxTree.ArrayType);
  5672. IF type.form = SyntaxTree.Static THEN
  5673. res := IntermediateCode.Immediate(addressType,type.staticLength);
  5674. ELSE
  5675. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  5676. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  5677. END;
  5678. UseIntermediateOperand(res);
  5679. InitOperand(result,ModeValue);
  5680. result.op := res;
  5681. ELSE
  5682. Convert(dim,addressType);
  5683. IF ~isUnchecked THEN
  5684. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  5685. END;
  5686. end := NewLabel(); next := NIL;
  5687. (* ReuseCopy(dim,res); *)
  5688. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  5689. Emit(Mov(position,res,dim));
  5690. Convert(res,int32);
  5691. Convert(res,int32);
  5692. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  5693. WHILE t IS SyntaxTree.ArrayType DO
  5694. type := t(SyntaxTree.ArrayType);
  5695. IF type.form = SyntaxTree.Static THEN
  5696. imm := IntermediateCode.Immediate(int32,val);
  5697. next := NewLabel();
  5698. BrneL(next,imm,res);
  5699. imm := IntermediateCode.Immediate(int32,type.staticLength);
  5700. Emit(MovReplace(position,res,imm));
  5701. BrL(end);
  5702. ELSE hasDynamicPart := TRUE;
  5703. END;
  5704. t := type.arrayBase.resolved;
  5705. val := val + 1;
  5706. IF next # NIL THEN SetLabel(next) END;
  5707. END;
  5708. IF hasDynamicPart THEN
  5709. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  5710. Convert(res2,addressType);
  5711. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  5712. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  5713. Emit(Sub(position,res2,imm,res2));
  5714. Emit(Add(position,res2,res2,operand.tag));
  5715. IntermediateCode.MakeMemory(res2,int32);
  5716. Emit(MovReplace(position,res,res2));
  5717. ReleaseIntermediateOperand(res2);
  5718. END;
  5719. SetLabel(end);
  5720. Convert(res,int32);
  5721. InitOperand(result,ModeValue);
  5722. result.op := res;
  5723. END;
  5724. END ArrayLen;
  5725. (**
  5726. create a temporary variable in current scope
  5727. **)
  5728. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN): SyntaxTree.Variable;
  5729. VAR name: SyntaxTree.Identifier; string: SyntaxTree.IdentifierString ; variable: SyntaxTree.Variable;
  5730. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  5731. BEGIN
  5732. IF ~register THEN
  5733. variable := temporaries.GetFreeVariable(type, index);
  5734. ELSE
  5735. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  5736. END;
  5737. scope := currentScope;
  5738. IF variable = NIL THEN
  5739. COPY("@hiddenIRVar",string);
  5740. Basic.AppendNumber(string,index);
  5741. name := SyntaxTree.NewIdentifier(string);
  5742. variable := SyntaxTree.NewVariable(Diagnostics.Invalid,name);
  5743. variable.SetType(type);
  5744. variable.SetAccess(SyntaxTree.Hidden);
  5745. IF ~register THEN
  5746. temporaries.AddVariable(variable);
  5747. IF scope.lastVariable # NIL THEN
  5748. offset := scope.lastVariable.offsetInBits;
  5749. ELSE
  5750. offset := 0;
  5751. END;
  5752. DEC(offset,system.SizeOf(variable.type));
  5753. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  5754. variable(SyntaxTree.Variable).SetOffset(offset);
  5755. scope.AddVariable(variable(SyntaxTree.Variable));
  5756. scope.EnterSymbol(variable, duplicate);
  5757. ASSERT(~duplicate);
  5758. InitVariable(variable(SyntaxTree.Variable));
  5759. ELSE
  5760. variable.SetUseRegister(TRUE);
  5761. variable(SyntaxTree.Variable).SetOffset(0);
  5762. END;
  5763. ELSE
  5764. InitVariable(variable(SyntaxTree.Variable));
  5765. (*
  5766. ASSERT(variable.type.resolved = type.resolved)
  5767. *)
  5768. END;
  5769. RETURN variable(SyntaxTree.Variable)
  5770. END GetTemporaryVariable;
  5771. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  5772. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  5773. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  5774. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  5775. i: LONGINT; duplicate: BOOLEAN;
  5776. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  5777. VAR variable: SyntaxTree.Variable;
  5778. BEGIN
  5779. variable := SyntaxTree.NewVariable(-1,SyntaxTree.NewIdentifier(name));
  5780. variable.SetType(type);
  5781. recordScope.AddVariable(variable);
  5782. END AddVariable;
  5783. BEGIN
  5784. name := "@ArrayDescriptor";
  5785. Basic.AppendNumber(name,dimensions);
  5786. identifier := SyntaxTree.NewIdentifier(name);
  5787. parentScope := module.module.moduleScope;
  5788. symbol := parentScope.FindSymbol(identifier);
  5789. IF symbol # NIL THEN
  5790. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  5791. type := typeDeclaration.declaredType;
  5792. ELSE
  5793. typeDeclaration := SyntaxTree.NewTypeDeclaration(-1,SyntaxTree.NewIdentifier(name));
  5794. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  5795. recordScope := SyntaxTree.NewRecordScope(parentScope);
  5796. recordType := SyntaxTree.NewRecordType( -1, parentScope, recordScope);
  5797. recordType.SetTypeDeclaration(typeDeclaration);
  5798. recordType.SetState(SyntaxTree.Resolved);
  5799. typeDeclaration.SetDeclaredType(recordType);
  5800. AddVariable("@ptr",system.anyType);
  5801. AddVariable("@adr",system.addressType);
  5802. AddVariable("@flags",system.addressType);
  5803. AddVariable("@dim",system.addressType);
  5804. AddVariable("@elementSize",system.addressType);
  5805. FOR i := 0 TO dimensions-1 DO
  5806. name := "@len";
  5807. Basic.AppendNumber(name,i);
  5808. AddVariable(name,system.addressType);
  5809. name := "@incr";
  5810. Basic.AppendNumber(name,i);
  5811. AddVariable(name,system.addressType);
  5812. END;
  5813. parentScope.AddTypeDeclaration(typeDeclaration);
  5814. parentScope.EnterSymbol(typeDeclaration,duplicate);
  5815. ASSERT(~duplicate);
  5816. type := recordType;
  5817. END;
  5818. RETURN type
  5819. END GetMathArrayDescriptorType;
  5820. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  5821. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  5822. BEGIN
  5823. type := GetMathArrayDescriptorType(dimensions);
  5824. Emit(Push(position,op.op));
  5825. (* push type descriptor *)
  5826. reg := TypeDescriptorAdr(type);
  5827. IF ~newObjectFile THEN
  5828. IntermediateCode.MakeMemory(reg,addressType);
  5829. END;
  5830. Emit(Push(position,reg));
  5831. ReleaseIntermediateOperand(reg);
  5832. (* push realtime flag: false by default *)
  5833. Emit(Push(position,false));
  5834. CallThis(position,"Heaps","NewRec",3);
  5835. END NewMathArrayDescriptor;
  5836. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  5837. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  5838. BEGIN
  5839. NEW(string, LEN(s)); COPY(s, string^);
  5840. sv := SyntaxTree.NewStringValue(-1,string);
  5841. type := SyntaxTree.NewStringType(-1,system.characterType,Strings.Length(s));
  5842. sv.SetType(type);
  5843. Designate(sv,res);
  5844. Emit(Push(position,res.tag));
  5845. Emit(Push(position,res.op));
  5846. ReleaseOperand(res);
  5847. END PushConstString;
  5848. PROCEDURE PushConstBoolean(b: BOOLEAN);
  5849. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  5850. BEGIN
  5851. IF b THEN
  5852. Emit(Push(-1, true));
  5853. ELSE
  5854. Emit(Push(-1, false));
  5855. END;
  5856. END PushConstBoolean;
  5857. PROCEDURE PushConstSet(v: SET);
  5858. VAR value: SyntaxTree.Value; op: Operand;
  5859. BEGIN
  5860. value := SyntaxTree.NewSetValue(-1, v);
  5861. value.SetType(system.setType);
  5862. Evaluate(value, op);
  5863. Emit(Push(-1, op.op));
  5864. ReleaseOperand(op);
  5865. END PushConstSet;
  5866. PROCEDURE PushConstInteger(v: LONGINT);
  5867. VAR value: SyntaxTree.Value; op: Operand;
  5868. BEGIN
  5869. value := SyntaxTree.NewIntegerValue(-1, v);
  5870. value.SetType(system.longintType);
  5871. Evaluate(value, op);
  5872. Emit(Push(-1, op.op));
  5873. ReleaseOperand(op);
  5874. END PushConstInteger;
  5875. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  5876. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  5877. section: IntermediateCode.Section;
  5878. BEGIN
  5879. procedureScope := SyntaxTree.NewProcedureScope(scope);
  5880. Global.GetSymbolSegmentedName(symbol, name);
  5881. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  5882. procedure := SyntaxTree.NewProcedure(-1, SyntaxTree.NewIdentifier(""), procedureScope);
  5883. procedure.SetScope(moduleScope);
  5884. procedure.SetType(SyntaxTree.NewProcedureType(-1,scope));
  5885. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  5886. procedure.SetAccess(SyntaxTree.Hidden);
  5887. currentScope := procedureScope;
  5888. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  5889. section.Emit(Enter(-1,NIL,0,0,0));
  5890. RETURN section;
  5891. END OpenInitializer;
  5892. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  5893. BEGIN
  5894. Emit(Leave(0,NIL,0));
  5895. Emit(Exit(-1,ToMemoryUnits(system,addressType.sizeInBits),0));
  5896. section := prev;
  5897. END CloseInitializer;
  5898. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  5899. VAR componentName, parameterName, name: SyntaxTree.IdentifierString; instanceType: ActiveCells.Type;
  5900. parameter: SyntaxTree.Parameter; parameterType: SyntaxTree.Type; portIndex,i,direction,len,value: LONGINT;
  5901. port: ActiveCells.Port;
  5902. prevActiveCellsScope : ActiveCells.Scope;
  5903. dataMemorySize, codeMemorySize: LONGINT;
  5904. variable: SyntaxTree.Variable;
  5905. designator: SyntaxTree.Designator;
  5906. type: SyntaxTree.Type;
  5907. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  5908. VAR left, d: SyntaxTree.Designator; basereg: IntermediateCode.Operand;
  5909. BEGIN
  5910. InitOperand(op,ModeReference);
  5911. op.op := fp;
  5912. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  5913. Dereference(op, x, FALSE);
  5914. result := op;
  5915. Symbol(symbol, op);
  5916. END Field;
  5917. PROCEDURE PushSelf;
  5918. VAR op: IntermediateCode.Operand;
  5919. BEGIN
  5920. IntermediateCode.InitMemory(op, addressType, fp, ToMemoryUnits(system, 2*addressType.sizeInBits));
  5921. Emit(Push(-1, op));
  5922. END PushSelf;
  5923. PROCEDURE Direction(direction: LONGINT): SET;
  5924. BEGIN
  5925. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  5926. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  5927. ELSE HALT(100);
  5928. END;
  5929. END Direction;
  5930. PROCEDURE Parameter(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  5931. VAR sname: SyntaxTree.IdentifierString; i: LONGINT; op: Operand;
  5932. BEGIN
  5933. IF SemanticChecker.IsStaticArray(type, type, len) THEN
  5934. FOR i := 0 TO len-1 DO
  5935. COPY(name, sname);
  5936. AppendIndex(sname, i);
  5937. Parameter(sname, type);
  5938. END;
  5939. ELSE
  5940. (*
  5941. direction := Direction(type(SyntaxTree.PortType).direction);
  5942. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  5943. port.SetWidth(type(SyntaxTree.PortType).sizeInBits);
  5944. *)
  5945. Symbol(cell, op);
  5946. ToMemory(op.op,addressType,0);
  5947. Emit(Push(-1, op.op));
  5948. ReleaseOperand(op);
  5949. PushConstString(name);
  5950. PushConstInteger(portIndex);
  5951. PushConstSet(Direction(type(SyntaxTree.PortType).direction));
  5952. PushConstInteger(type(SyntaxTree.PortType).sizeInBits);
  5953. CallThis(position, "ActiveCellsRuntime","AddPort",6);
  5954. INC(portIndex);
  5955. END;
  5956. END Parameter;
  5957. PROCEDURE Variable(name: ARRAY OF CHAR; variable: SyntaxTree.Variable);
  5958. VAR op : Operand; portType: SyntaxTree.PortType; d, left: SyntaxTree.Designator; baseType: SyntaxTree.Type; prevScope: SyntaxTree.Scope;
  5959. size, reg: IntermediateCode.Operand; dim: LONGINT;
  5960. PROCEDURE PushLens(type: SyntaxTree.Type);
  5961. BEGIN
  5962. IF type IS SyntaxTree.ArrayType THEN
  5963. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  5964. Evaluate(type(SyntaxTree.ArrayType).length, op);
  5965. Emit(Push(-1, op.op));
  5966. ReleaseOperand(op);
  5967. INC(dim);
  5968. ELSE
  5969. baseType := type;
  5970. END;
  5971. END PushLens;
  5972. BEGIN
  5973. (* cell *)
  5974. (*prevScope := currentScope;
  5975. currentScope := x.cellScope;
  5976. PushSelf();
  5977. *)
  5978. IF variable.type IS SyntaxTree.ArrayType THEN
  5979. type := variable.type;
  5980. dim := 0;
  5981. PushLens(type);
  5982. portType := baseType.resolved(SyntaxTree.PortType);
  5983. ELSE
  5984. portType := variable.type(SyntaxTree.PortType);
  5985. END;
  5986. PushSelfPointer();
  5987. (*Symbol(cell, op);
  5988. ToMemory(op.op,addressType,0);
  5989. Emit(Push(-1, op.op));
  5990. ReleaseOperand(op);
  5991. *)
  5992. (* port *)
  5993. Field(variable, op);
  5994. (*left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  5995. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(x);
  5996. d := SyntaxTree.NewSymbolDesignator(-1, left, variable); d.SetType(variable.type);
  5997. Designate(d, op);*)
  5998. Emit(Push(-1, op.op));
  5999. ReleaseOperand(op);
  6000. (* name *)
  6001. PushConstString(name);
  6002. (* inout *)
  6003. PushConstSet(Direction(portType.direction));
  6004. (* width *)
  6005. PushConstInteger(portType.sizeInBits);
  6006. IF variable.type IS SyntaxTree.PortType THEN
  6007. CallThis(variable.position,"ActiveCellsRuntime","AddPort",6);
  6008. ELSIF variable.type IS SyntaxTree.ArrayType THEN
  6009. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6010. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6011. Emit(Add(position,reg, sp, size));
  6012. (* dim *)
  6013. PushConstInteger(dim);
  6014. (* len array *)
  6015. Emit(Push(position, reg));
  6016. ReleaseIntermediateOperand(reg);
  6017. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6018. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6019. Emit(Add(position, sp,sp, size));
  6020. END;
  6021. (*currentScope := prevScope;*)
  6022. (*
  6023. PushConstString(name);
  6024. PushConstInteger(portIndex);
  6025. PushConstSet(Direction(type(SyntaxTree.PortType).direction));
  6026. PushConstInteger(type(SyntaxTree.PortType).sizeInBits);
  6027. CallThis(position,"ActiveCellsRuntime","AddPort",5);
  6028. INC(portIndex);
  6029. *)
  6030. END Variable;
  6031. BEGIN
  6032. IF backend.cellsAreObjects THEN
  6033. variable := x.cellScope.firstVariable;
  6034. WHILE (variable # NIL) DO
  6035. type := variable.type.resolved;
  6036. WHILE (type IS SyntaxTree.ArrayType) DO
  6037. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6038. END;
  6039. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6040. (*!!! check port arrays !! *)
  6041. Global.GetSymbolName(variable,name);
  6042. Variable(name,variable);
  6043. END;
  6044. variable := variable.nextVariable;
  6045. END;
  6046. ELSE HALT(200)
  6047. END;
  6048. (*prevActiveCellsScope := currentActiveCellsScope;*)
  6049. (*
  6050. x.typeDeclaration.GetName(componentName);
  6051. instanceType := currentActiveCellsScope.NewType(componentName); (*backend.cification.NewType(componentName);*)
  6052. IF HasValue(x.modifiers,Global.StringDataMemorySize,dataMemorySize) THEN
  6053. instanceType.SetDataMemorySize(dataMemorySize);
  6054. END;
  6055. IF HasValue(x.modifiers,Global.StringCodeMemorySize,codeMemorySize) THEN
  6056. instanceType.SetInstructionMemorySize(codeMemorySize)
  6057. END;
  6058. IF HasFlag(x.modifiers, Global.StringVector) THEN
  6059. instanceType.AddCapability(ActiveCells.VectorCapability)
  6060. END;
  6061. IF HasFlag(x.modifiers, Global.StringTRMS) THEN
  6062. instanceType.AddCapability(ActiveCells.TRMSCapability)
  6063. END;
  6064. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN
  6065. instanceType.AddCapability(ActiveCells.FloatingPointCapability)
  6066. END;
  6067. AddDevices(instanceType, x);
  6068. *)
  6069. (*
  6070. IF x.isCellNet THEN
  6071. IF HasValue(x.modifiers,Global.StringFrequencyDivider,value) THEN backend.activeCellsSpecification.SetFrequencyDivider(value) END;
  6072. END;
  6073. *)
  6074. (*currentActiveCellsScope := instanceType;*)
  6075. (*
  6076. parameter := x.firstParameter;
  6077. portIndex := 0;
  6078. WHILE parameter # NIL DO
  6079. parameter.GetName(parameterName);
  6080. parameterType := parameter.type.resolved;
  6081. Parameter(parameterName, parameterType);
  6082. (*
  6083. IF SemanticChecker.IsStaticArray(parameterType,parameterType,len) THEN
  6084. ParameterArray(parameterType);
  6085. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6086. FOR i := 0 TO len-1 DO
  6087. COPY(parameterName,name);
  6088. AppendIndex(name,i);
  6089. port := instanceType.NewPort(name,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6090. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6091. INC(portIndex);
  6092. END;
  6093. ELSE
  6094. direction := Direction(parameterType(SyntaxTree.PortType).direction);
  6095. port := instanceType.NewPort(parameterName,direction,backend.activeCellsSpecification.GetPortAddress(portIndex));
  6096. port.SetWidth(parameterType(SyntaxTree.PortType).sizeInBits);
  6097. INC(portIndex);
  6098. END;
  6099. *)
  6100. parameter := parameter.nextParameter;
  6101. END;
  6102. *)
  6103. (*
  6104. Scope(x.cellScope);
  6105. currentActiveCellsScope := prevActiveCellsScope;
  6106. AddModules(instanceType,x.cellScope);
  6107. *)
  6108. END AddPorts;
  6109. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6110. VAR par: ActiveCells.Parameter; name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6111. BEGIN
  6112. Symbol(cell,op);
  6113. ToMemory(op.op,addressType,0);
  6114. Emit(Push(position,op.op));
  6115. ReleaseOperand(op);
  6116. Basic.GetString(property.name, name);
  6117. PushConstString(name);
  6118. IF SemanticChecker.IsStringType(property.type) OR (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6119. left := SyntaxTree.NewSymbolDesignator(-1,left,cell); left.SetType(system.anyType);
  6120. left := SyntaxTree.NewDereferenceDesignator(-1, left); left.SetType(cellType);
  6121. d := SyntaxTree.NewSymbolDesignator(-1, left, property); d.SetType(property.type);
  6122. Designate(d, op);
  6123. IF SemanticChecker.IsStringType(property.type) THEN
  6124. Emit(Push(-1, op.tag))
  6125. END;
  6126. Emit(Push(-1, op.op));
  6127. ReleaseOperand(op);
  6128. END;
  6129. IF SemanticChecker.IsStringType(property.type) THEN
  6130. ASSERT(SemanticChecker.IsStringType(value.type));
  6131. Designate(value, op);
  6132. Emit(Push(property.position, op.tag));
  6133. Emit(Push(property.position, op.op));
  6134. ReleaseOperand(op);
  6135. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6136. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6137. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6138. Evaluate(value, op);
  6139. Emit(Push(property.position, op.op));
  6140. ReleaseOperand(op);
  6141. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6142. ELSE
  6143. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6144. END;
  6145. END AddProperty;
  6146. PROCEDURE AddProperties(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property);
  6147. BEGIN
  6148. WHILE property # NIL DO
  6149. AddProperty(cellType, cell, property, property.value);
  6150. property := property.nextProperty;
  6151. END;
  6152. END AddProperties;
  6153. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6154. VAR symbol: SyntaxTree.Symbol;
  6155. BEGIN
  6156. WHILE modifier # NIL DO
  6157. symbol := cellType.cellScope.FindSymbol(modifier.identifier);
  6158. IF (symbol # NIL) & (symbol IS SyntaxTree.Property) THEN
  6159. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6160. ELSE
  6161. (*! move this check to checker *)
  6162. Error(modifier.position, "undefined property");
  6163. END;
  6164. modifier := modifier.nextModifier;
  6165. END;
  6166. END AddModifiers;
  6167. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6168. VAR last: SyntaxTree.Modifier;
  6169. BEGIN
  6170. IF to = NIL THEN
  6171. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6172. ELSE
  6173. last := to;
  6174. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6175. last := last.nextModifier;
  6176. END;
  6177. IF last.identifier # this.identifier THEN
  6178. ASSERT(last.nextModifier = NIL);
  6179. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6180. END;
  6181. END;
  6182. END AppendModifier;
  6183. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6184. BEGIN
  6185. WHILE this # NIL DO
  6186. AppendModifier(to, this);
  6187. this := this.nextModifier;
  6188. END;
  6189. END AppendModifiers;
  6190. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6191. VAR op: Operand;
  6192. BEGIN
  6193. Evaluate(p, op);
  6194. Emit(Push(p.position, op.op));
  6195. ReleaseOperand(op);
  6196. (*
  6197. WHILE (p # NIL) & ~(p.type.resolved IS SyntaxTree.CellType) DO
  6198. p := p(SyntaxTree.Designator).left;
  6199. END;
  6200. IF p # NIL THEN
  6201. Evaluate(p, op);
  6202. Emit(Push(p.position, op.op));
  6203. ReleaseOperand(op);
  6204. ELSE
  6205. Emit(Push(-1, nil));
  6206. END;
  6207. *)
  6208. END PushPort;
  6209. PROCEDURE VisitBuiltinCallDesignator(x: SyntaxTree.BuiltinCallDesignator);
  6210. VAR
  6211. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6212. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6213. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6214. tmp:IntermediateCode.Operand;
  6215. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6216. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6217. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6218. dest: IntermediateCode.Operand;
  6219. staticLength: LONGINT; itype: IntermediateCode.Type;
  6220. convert,isTensor: BOOLEAN;
  6221. recordType: SyntaxTree.RecordType;
  6222. baseType: SyntaxTree.Type;
  6223. flags: SET;
  6224. left: SyntaxTree.Expression;
  6225. call: SyntaxTree.Designator;
  6226. procedure: SyntaxTree.Procedure;
  6227. temporaryVariable: SyntaxTree.Variable;
  6228. dummy: IntermediateCode.Operand;
  6229. customBuiltin: SyntaxTree.CustomBuiltin;
  6230. isVarPar: ARRAY 3 OF BOOLEAN;
  6231. callsection: Sections.Section;
  6232. segmentedName: Basic.SegmentedName;
  6233. needsTrace: BOOLEAN;
  6234. n: ARRAY 256 OF CHAR;
  6235. modifier: SyntaxTree.Modifier;
  6236. previous, init: IntermediateCode.Section;
  6237. prevScope: SyntaxTree.Scope;
  6238. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6239. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6240. priority: IntermediateCode.Operand;
  6241. op,callop: Operand;
  6242. BEGIN
  6243. IF type = NIL THEN RETURN END;
  6244. type := type.resolved;
  6245. IF type IS SyntaxTree.PointerType THEN
  6246. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6247. END;
  6248. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6249. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6250. recordScope := type(SyntaxTree.RecordType).recordScope;
  6251. IF recordScope.bodyProcedure # NIL THEN
  6252. procedure := recordScope.bodyProcedure;
  6253. body := procedure.procedureScope.body;
  6254. Emit(Push(position,self));
  6255. IF body.isActive THEN
  6256. StaticCallOperand(callop,procedure);
  6257. Emit(Push(position,callop.op));
  6258. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6259. Convert(priority,sizeType);
  6260. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6261. END;
  6262. Emit(Push(position,priority));
  6263. ReleaseIntermediateOperand(priority);
  6264. IF backend.cooperative THEN
  6265. Emit(Push(position,self));
  6266. CallThis(position,"Activities","Create",3)
  6267. ELSE
  6268. flags := 0;
  6269. IF body.isSafe THEN
  6270. flags := 1;
  6271. END;
  6272. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6273. Emit(Push(position,self));
  6274. CallThis(position,"Objects","CreateProcess",4)
  6275. END;
  6276. ELSE
  6277. Emit(Push(position,self));
  6278. StaticCallOperand(callop,procedure);
  6279. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6280. END;
  6281. Emit(Pop(position,self));
  6282. END;
  6283. END CallBodies;
  6284. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6285. BEGIN
  6286. actualType := actualType.resolved;
  6287. IF actualType IS SyntaxTree.StringType THEN
  6288. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6289. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6290. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6291. ELSE
  6292. tmp := op.tag;
  6293. IntermediateCode.MakeMemory(tmp,addressType);
  6294. Emit(Push(position,tmp));
  6295. END;
  6296. Emit(Push(position,op.op))
  6297. END PushString;
  6298. PROCEDURE PushTD(type: SyntaxTree.Type);
  6299. VAR op: IntermediateCode.Operand;
  6300. BEGIN
  6301. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6302. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6303. ELSE
  6304. IF type.resolved IS SyntaxTree.PointerType THEN
  6305. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6306. END;
  6307. op := TypeDescriptorAdr(type.resolved);
  6308. IF ~newObjectFile THEN
  6309. IntermediateCode.MakeMemory(op,addressType);
  6310. END;
  6311. Emit(Push(position,op));
  6312. END
  6313. END PushTD;
  6314. BEGIN
  6315. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6316. dest := destination; destination := emptyOperand;
  6317. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6318. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6319. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6320. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6321. CASE x.id OF
  6322. (* ---- COPY ----- *)
  6323. |Global.Copy:
  6324. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6325. (* ---- EXCL, INCL----- *)
  6326. |Global.Excl,Global.Incl:
  6327. Evaluate(p0,s0);
  6328. Evaluate(p1,s1);
  6329. Convert(s1.op,setType);
  6330. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6331. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6332. END;
  6333. ReuseCopy(res,s0.op);
  6334. ReleaseOperand(s0);
  6335. Reuse1(tmp,s1.op);
  6336. ReleaseOperand(s1);
  6337. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6338. IF x.id = Global.Excl THEN
  6339. Emit(Not(position,tmp,tmp));
  6340. Emit(And(position,res,res,tmp));
  6341. ELSE
  6342. Emit(Or(position,res,res,tmp));
  6343. END;
  6344. ReleaseIntermediateOperand(tmp);
  6345. Designate(p0,s0);
  6346. ToMemory(s0.op,setType,0);
  6347. Emit(Mov(position,s0.op,res));
  6348. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6349. (* ---- DISPOSE ----- *)
  6350. |Global.Dispose:
  6351. Designate(p0,s0);
  6352. Emit(Push(position,s0.op));
  6353. ReleaseOperand(s0);
  6354. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6355. (* ---- GETPROCEDURE ----- *)
  6356. |Global.GetProcedure:
  6357. Designate(p0,s0);
  6358. PushString(s0,p0.type);
  6359. Designate(p1,s1);
  6360. PushString(s1,p1.type);
  6361. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6362. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6363. ELSE PushTD(procedureType.firstParameter.type)
  6364. END;
  6365. PushTD(procedureType.returnType);
  6366. Designate(p2,s2);
  6367. Emit(Push(position,s2.op));
  6368. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6369. CallThis(position,"Modules","GetProcedure", 7);
  6370. (* ---- ASH, LSH, ROT ----- *)
  6371. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6372. Evaluate(p0,s0);
  6373. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6374. (* make unsigned arguments in order to produced a logical shift *)
  6375. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6376. convert:= TRUE;
  6377. itype := s0.op.type;
  6378. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6379. Convert(s0.op,itype);
  6380. ELSE
  6381. convert := FALSE;
  6382. END;
  6383. END;
  6384. Evaluate(p1,s1);
  6385. IF IsIntegerConstant(p1,hint) THEN
  6386. ReuseCopy(reg,s0.op);
  6387. IF hint > 0 THEN
  6388. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6389. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6390. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6391. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  6392. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  6393. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  6394. END;
  6395. ELSIF hint < 0 THEN
  6396. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  6397. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  6398. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  6399. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  6400. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  6401. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  6402. END;
  6403. END;
  6404. ReleaseOperand(s0); ReleaseOperand(s1);
  6405. ELSE
  6406. exit := NewLabel();
  6407. end := NewLabel();
  6408. ReuseCopy(reg,s0.op);
  6409. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  6410. Reuse1(tmp,s1.op);
  6411. Emit(Neg(position,tmp,s1.op));
  6412. Convert(tmp,s1.op.type);
  6413. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  6414. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  6415. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  6416. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  6417. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  6418. END;
  6419. ReleaseIntermediateOperand(tmp);
  6420. BrL(end);
  6421. SetLabel(exit);
  6422. ReuseCopy(tmp,s1.op);
  6423. Convert(tmp,s1.op.type);
  6424. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  6425. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  6426. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  6427. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  6428. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  6429. END;
  6430. ReleaseIntermediateOperand(tmp);
  6431. SetLabel(end);
  6432. ReleaseOperand(s0); ReleaseOperand(s1);
  6433. END;
  6434. InitOperand(result,ModeValue);
  6435. IF convert THEN
  6436. itype := reg.type;
  6437. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  6438. Convert(reg,itype);
  6439. END;
  6440. result.op := reg;
  6441. (* ---- CAP ----- *)
  6442. |Global.Cap:
  6443. Evaluate(p0,result);
  6444. ReuseCopy(reg,result.op);
  6445. ReleaseIntermediateOperand(result.op);
  6446. ignore := NewLabel();
  6447. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  6448. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  6449. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  6450. SetLabel(ignore);
  6451. result.op := reg;
  6452. (* ---- CHR ----- *)
  6453. |Global.Chr, Global.Chr32:
  6454. Evaluate(p0,result);
  6455. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6456. |Global.Entier, Global.EntierH:
  6457. Evaluate(p0,result);
  6458. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6459. (* ---- MIN and MAX ----- *)
  6460. |Global.Max,Global.Min:
  6461. Evaluate(p0,s0);
  6462. Evaluate(p1,s1);
  6463. Reuse2(res,s0.op,s1.op);
  6464. else := NewLabel();
  6465. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  6466. ELSE BrltL(else,s1.op,s0.op) END;
  6467. Emit(Mov(position,res,s0.op));
  6468. ReleaseOperand(s0);
  6469. end := NewLabel();
  6470. BrL(end);
  6471. SetLabel(else);
  6472. Emit(MovReplace(position,res,s1.op));
  6473. SetLabel(end);
  6474. ReleaseOperand(s1);
  6475. InitOperand(result,ModeValue);
  6476. result.op := res;
  6477. (* ---- ODD ----- *)
  6478. |Global.Odd:
  6479. IF ~conditional THEN
  6480. ConditionToValue(x)
  6481. ELSE
  6482. Evaluate(p0,result);
  6483. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6484. Reuse1(res,result.op);
  6485. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  6486. ReleaseIntermediateOperand(result.op);
  6487. result.op := res;
  6488. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  6489. ReleaseOperand(result);
  6490. BrL(falseLabel);
  6491. END;
  6492. (* ---- ORD ----- *)
  6493. |Global.Ord, Global.Ord32:
  6494. Evaluate(p0,result);
  6495. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6496. (* ---- SHORT, LONG ----- *)
  6497. |Global.Short, Global.Long:
  6498. Evaluate(p0,result);
  6499. IF x.type IS SyntaxTree.ComplexType THEN
  6500. componentType := x.type(SyntaxTree.ComplexType).componentType;
  6501. Convert(result.op, IntermediateCode.GetType(system, componentType));
  6502. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  6503. ELSE
  6504. Convert(result.op,IntermediateCode.GetType(system,x.type));
  6505. END
  6506. (* ---- HALT, SYSTEM.HALT----- *)
  6507. |Global.Halt, Global.systemHalt:
  6508. val := p0.resolved(SyntaxTree.IntegerValue).value;
  6509. EmitTrap (position, val);
  6510. (* ---- ASSERT ----- *)
  6511. |Global.Assert:
  6512. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  6513. trueL := NewLabel();
  6514. falseL := NewLabel();
  6515. Condition(p0,trueL,falseL);
  6516. IF p1 = NIL THEN val := AssertTrap
  6517. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  6518. END;
  6519. SetLabel(falseL);
  6520. EmitTrap(position,val);
  6521. SetLabel(trueL);
  6522. END;
  6523. (*
  6524. Emit(TrapC(result.op,val);
  6525. *)
  6526. (* ---- INC, DEC----- *)
  6527. |Global.Inc,Global.Dec:
  6528. Expression(p0); adr := result.op;
  6529. LoadValue(result,p0.type); l := result;
  6530. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  6531. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  6532. END;
  6533. IF x.id = Global.Inc THEN
  6534. Emit(Add(position,l.op,l.op,r.op));
  6535. ELSE
  6536. Emit(Sub(position,l.op,l.op,r.op));
  6537. END;
  6538. ReleaseOperand(l); ReleaseOperand(r);
  6539. (* ---- LEN ----- *)
  6540. |Global.Len: (* dynamic length, static length done by checker *)
  6541. Designate(p0,operand);
  6542. IF p1 = NIL THEN
  6543. InitOperand(l,ModeValue);
  6544. l.op := IntermediateCode.Immediate(int32,0);
  6545. ELSE
  6546. Evaluate(p1,l);
  6547. END;
  6548. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  6549. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  6550. Dereference(operand, p0.type.resolved, FALSE);
  6551. END;
  6552. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  6553. ReleaseOperand(operand); ReleaseOperand(l);
  6554. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  6555. ASSERT(p1 # NIL);
  6556. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  6557. Dereference(operand,p0.type.resolved,FALSE);
  6558. END;
  6559. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  6560. ReleaseOperand(operand); ReleaseOperand(l);
  6561. ELSE HALT(100);
  6562. END;
  6563. Convert(result.op,IntermediateCode.GetType(system, x.type));
  6564. (* ---- FIRST ---- *)
  6565. |Global.First:
  6566. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6567. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  6568. ELSE
  6569. Designate(p0, result)
  6570. END
  6571. (* ---- LAST ---- *)
  6572. |Global.Last:
  6573. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6574. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  6575. ELSE
  6576. Designate(p0, result);
  6577. (* make sure result.op is a register *)
  6578. tmp := result.op;
  6579. ReuseCopy(result.op, result.op);
  6580. ReleaseIntermediateOperand(tmp);
  6581. (* add offset to result.op *)
  6582. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6583. END
  6584. (* ---- STEP ---- *)
  6585. |Global.Step:
  6586. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  6587. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  6588. ELSE
  6589. Designate(p0, result);
  6590. (* make sure result.op is a register *)
  6591. tmp := result.op;
  6592. ReuseCopy(result.op, result.op);
  6593. ReleaseIntermediateOperand(tmp);
  6594. (* add offset to result.op *)
  6595. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  6596. END
  6597. (* ---- RE ---- *)
  6598. |Global.Re:
  6599. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  6600. Designate(p0, result)
  6601. ELSE
  6602. Evaluate(p0, result)
  6603. END
  6604. (* ---- IM ---- *)
  6605. |Global.Im:
  6606. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  6607. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  6608. Designate(p0, result);
  6609. (* make sure result.op is a register *)
  6610. tmp := result.op;
  6611. ReuseCopy(result.op, result.op);
  6612. ReleaseIntermediateOperand(tmp);
  6613. (* add offset to result.op *)
  6614. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  6615. (* ---- ABS ----- *)
  6616. |Global.Abs:
  6617. Evaluate(p0,operand);
  6618. type := p0.type.resolved;
  6619. InitOperand(result,ModeValue);
  6620. Reuse1a(result.op,operand.op,dest);
  6621. Emit(Abs(position,result.op,operand.op));
  6622. ReleaseOperand(operand);
  6623. (* ---- WAIT ----- *)
  6624. |Global.Wait:
  6625. Evaluate(p0,operand);
  6626. Emit(Push(position,operand.op));
  6627. ReleaseOperand(operand);
  6628. CallThis(position,"Activities","Wait", 1);
  6629. (* ---- NEW ----- *)
  6630. |Global.New:
  6631. (*! the following code is only correct for "standard" Oberon calling convention *)
  6632. type := p0.type.resolved;
  6633. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  6634. THEN
  6635. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  6636. IF backend.cooperative THEN
  6637. size := ToMemoryUnits(system,system.SizeOf(recordType));
  6638. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6639. IF recordType.isObject THEN
  6640. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6641. IF recordType.IsActive() THEN
  6642. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6643. END;
  6644. IF recordType.IsProtected() THEN
  6645. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  6646. END;
  6647. ELSE
  6648. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6649. END;
  6650. END;
  6651. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  6652. CallThis(position,"Runtime","New", 1);
  6653. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6654. Emit(Result(position, pointer));
  6655. exit := NewLabel();
  6656. BreqL(exit,pointer,nil);
  6657. IF ~type(SyntaxTree.PointerType).isPlain THEN
  6658. GetRecordTypeName (recordType,name);
  6659. IF ~recordType.isObject THEN
  6660. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  6661. END;
  6662. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  6663. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  6664. IF recordType.isObject THEN
  6665. IF recordType.IsProtected() THEN
  6666. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6667. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6668. END;
  6669. IF recordType.IsActive() THEN
  6670. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  6671. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  6672. END;
  6673. END;
  6674. END;
  6675. (* initialize fields *)
  6676. IF type(SyntaxTree.PointerType).isPlain THEN
  6677. size := 0;
  6678. ELSIF recordType.isObject THEN
  6679. size := BaseObjectTypeSize;
  6680. ELSE
  6681. size := BaseRecordTypeSize;
  6682. END;
  6683. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  6684. (* call initializer *)
  6685. constructor := GetConstructor(recordType);
  6686. IF constructor # NIL THEN
  6687. (*! should be unified with ProcedureCallDesignator *)
  6688. Emit(Push(position,pointer));
  6689. ReleaseIntermediateOperand(pointer);
  6690. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6691. FOR i := 1 TO x.parameters.Length()-1 DO
  6692. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6693. formalParameter := formalParameter.nextParameter;
  6694. END;
  6695. (* static call of the constructor *)
  6696. GetCodeSectionNameForSymbol(constructor,name);
  6697. ASSERT(~constructor.isInline);
  6698. IF constructor.scope.ownerModule # module.module THEN
  6699. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6700. ELSE
  6701. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6702. END;
  6703. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  6704. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6705. Emit(Pop(position,pointer));
  6706. END;
  6707. (* call bodies *)
  6708. CallBodies(pointer,p0.type);
  6709. SetLabel(exit);
  6710. needsTrace := p0.NeedsTrace();
  6711. IF needsTrace THEN ModifyAssignments(true) END;
  6712. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  6713. Emit(Push(position, pointer));
  6714. CallThis(position,"GarbageCollector","Watch",0);
  6715. Emit(Pop(position, pointer));
  6716. END;
  6717. Designate(p0,l);
  6718. IF needsTrace THEN
  6719. CallAssignPointer(l.op, pointer);
  6720. ELSE
  6721. ToMemory(l.op,addressType,0);
  6722. Emit(Mov(position,l.op,pointer));
  6723. END;
  6724. ReleaseIntermediateOperand(pointer);
  6725. ReleaseOperand(l);
  6726. IF needsTrace THEN ModifyAssignments(false) END;
  6727. ELSE
  6728. temporaryVariable := GetTemporaryVariable(type, FALSE);
  6729. IF temporaryVariable # NIL THEN
  6730. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  6731. ELSE
  6732. Designate(p0,l);
  6733. END;
  6734. (* l.op contains address of pointer to record *)
  6735. Emit(Push(position,l.op)); (* address for use after syscall *)
  6736. Emit(Push(position,l.op));
  6737. ReleaseOperand(l);
  6738. (* push type descriptor *)
  6739. reg := TypeDescriptorAdr(recordType);
  6740. IF ~newObjectFile THEN
  6741. IntermediateCode.MakeMemory(reg,addressType);
  6742. END;
  6743. Emit(Push(position,reg));
  6744. ReleaseIntermediateOperand(reg);
  6745. (* push realtime flag *)
  6746. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6747. ELSE Emit(Push(position,false));
  6748. END;
  6749. CallThis(position,"Heaps","NewRec", 3);
  6750. (* check allocation success, if not successful then do not call initializers and bodies *)
  6751. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6752. Emit(Pop(position,pointer));
  6753. MakeMemory(reg,pointer,addressType,0);
  6754. ReleaseIntermediateOperand(pointer);
  6755. pointer := reg;
  6756. exit := NewLabel();
  6757. BreqL(exit,pointer,nil);
  6758. Emit(Push(position,pointer));
  6759. (* initialize fields *)
  6760. InitFields(recordType, pointer,0);
  6761. (* call initializer *)
  6762. constructor := GetConstructor(recordType);
  6763. IF constructor # NIL THEN
  6764. (*! should be unified with ProcedureCallDesignator *)
  6765. Emit(Push(position,pointer));
  6766. ReleaseIntermediateOperand(pointer);
  6767. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  6768. FOR i := 1 TO x.parameters.Length()-1 DO
  6769. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  6770. formalParameter := formalParameter.nextParameter;
  6771. END;
  6772. (* static call of the constructor *)
  6773. GetCodeSectionNameForSymbol(constructor,name);
  6774. ASSERT(~constructor.isInline);
  6775. IF constructor.scope.ownerModule # module.module THEN
  6776. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6777. ELSE
  6778. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  6779. END;
  6780. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  6781. ELSE
  6782. ReleaseIntermediateOperand(pointer);
  6783. END;
  6784. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6785. Emit(Pop(position,pointer));
  6786. IF temporaryVariable # NIL THEN
  6787. Designate(p0,l);
  6788. ToMemory(l.op,addressType,0);
  6789. Emit(Mov(position,l.op,pointer));
  6790. ReleaseOperand(l);
  6791. result.tag := emptyOperand;
  6792. END;
  6793. (* call bodies *)
  6794. CallBodies(pointer,p0.type);
  6795. ReleaseIntermediateOperand(pointer);
  6796. IF temporaryVariable # NIL THEN
  6797. end := NewLabel();
  6798. BrL(end);
  6799. SetLabel(exit);
  6800. Designate(p0,l);
  6801. ToMemory(l.op,addressType,0);
  6802. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  6803. ReleaseOperand(l);
  6804. SetLabel(end);
  6805. ELSE
  6806. SetLabel(exit);
  6807. END;
  6808. END;
  6809. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  6810. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  6811. dim := 0;
  6812. IF p1 # NIL THEN
  6813. FOR i := 1 TO x.parameters.Length()-1 DO
  6814. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6815. parameter := x.parameters.GetExpression(i);
  6816. Evaluate(parameter,r);
  6817. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6818. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  6819. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  6820. END;
  6821. Emit(Push(position,r.op));
  6822. IF i=1 THEN
  6823. ReuseCopy(reg,r.op);
  6824. ELSE
  6825. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  6826. END;
  6827. ReleaseOperand(r);
  6828. INC(dim);
  6829. END;
  6830. Convert(reg,addressType);
  6831. ELSE
  6832. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6833. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  6834. END;
  6835. openDim := dim;
  6836. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  6837. IF backend.cooperative THEN
  6838. size := ToMemoryUnits(system,system.SizeOf(type));
  6839. WHILE type IS SyntaxTree.ArrayType DO
  6840. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6841. END;
  6842. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  6843. IF (size # 1) THEN
  6844. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6845. END;
  6846. Emit(Push(position,reg));
  6847. size := ToMemoryUnits(system,system.SizeOf(type));
  6848. IF (size # 1) THEN
  6849. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6850. END;
  6851. Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));
  6852. Emit(Push(position,reg));
  6853. ReleaseIntermediateOperand(reg);
  6854. CallThis(position,"Runtime","New", 1);
  6855. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  6856. Emit(Result(position, pointer));
  6857. exit := NewLabel();
  6858. else := NewLabel();
  6859. BreqL(else,pointer,nil);
  6860. IF ~type.hasPointers THEN
  6861. Basic.ToSegmentedName ("BaseTypes.Array",name);
  6862. ELSIF type IS SyntaxTree.RecordType THEN
  6863. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  6864. ELSIF type IS SyntaxTree.ProcedureType THEN
  6865. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  6866. ELSE
  6867. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  6868. END;
  6869. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  6870. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  6871. 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))));
  6872. IF type IS SyntaxTree.RecordType THEN
  6873. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  6874. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  6875. ELSE
  6876. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  6877. END;
  6878. i := openDim;
  6879. WHILE i > 0 DO
  6880. DEC (i);
  6881. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  6882. END;
  6883. needsTrace := p0.NeedsTrace();
  6884. IF needsTrace THEN ModifyAssignments(true) END;
  6885. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  6886. Emit(Push(position, pointer));
  6887. CallThis(position,"GarbageCollector","Watch",0);
  6888. Emit(Pop(position, pointer));
  6889. END;
  6890. Designate(p0,l);
  6891. IF needsTrace THEN
  6892. CallAssignPointer(l.op, pointer);
  6893. ModifyAssignments(false);
  6894. ELSE
  6895. ToMemory(l.op,addressType,0);
  6896. Emit(Mov(position,l.op,pointer));
  6897. END;
  6898. ReleaseIntermediateOperand(pointer);
  6899. ReleaseOperand(l);
  6900. BrL(exit);
  6901. SetLabel(else);
  6902. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  6903. Designate(p0,l);
  6904. IF needsTrace THEN
  6905. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  6906. ELSE
  6907. ToMemory(l.op,addressType,0);
  6908. Emit(Mov(position,l.op,pointer));
  6909. END;
  6910. ReleaseOperand(l);
  6911. SetLabel(exit);
  6912. ELSE
  6913. (*! the following code is only correct for "standard" Oberon calling convention *)
  6914. IF SemanticChecker.ContainsPointer(type) THEN
  6915. IF type IS SyntaxTree.ArrayType THEN
  6916. staticLength := 1;
  6917. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  6918. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  6919. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6920. END;
  6921. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  6922. Emit(Mul(position,reg,reg,tmp));
  6923. END;
  6924. Designate(p0,l);
  6925. IF openDim > 0 THEN
  6926. Emit(Push(position,l.op)); (* address for use after syscall *)
  6927. END;
  6928. Emit(Push(position,l.op)); (* address *)
  6929. ReleaseOperand(l);
  6930. tmp := TypeDescriptorAdr(type);
  6931. IF ~newObjectFile THEN
  6932. IntermediateCode.MakeMemory(tmp,addressType);
  6933. END;
  6934. Emit(Push(position,tmp)); (* type descriptor *)
  6935. ReleaseIntermediateOperand(tmp);
  6936. Emit(Push(position,reg)); (* number Elements *)
  6937. ReleaseIntermediateOperand(reg);
  6938. tmp := IntermediateCode.Immediate(addressType,dim);
  6939. Emit(Push(position,tmp)); (* dimensions *)
  6940. (* push realtime flag *)
  6941. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6942. ELSE Emit(Push(position,false));
  6943. END;
  6944. CallThis(position,"Heaps","NewArr",5)
  6945. ELSE
  6946. size := ToMemoryUnits(system,system.SizeOf(type));
  6947. IF (size # 1) THEN
  6948. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  6949. END;
  6950. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  6951. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  6952. Emit(Add(position,reg,reg,tmp));
  6953. Designate(p0,l);
  6954. IF openDim >0 THEN
  6955. Emit(Push(position,l.op)); (* address for use after syscall *)
  6956. END;
  6957. Emit(Push(position,l.op)); (* address for syscall *)
  6958. ReleaseOperand(l); (* pointer address *)
  6959. Emit(Push(position,reg)); (* size *)
  6960. ReleaseIntermediateOperand(reg);
  6961. (* push realtime flag *)
  6962. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  6963. ELSE Emit(Push(position,false));
  6964. END;
  6965. CallThis(position,"Heaps","NewSys", 3)
  6966. END;
  6967. IF openDim > 0 THEN
  6968. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6969. Emit(Pop(position,adr));
  6970. ToMemory(adr,addressType,0);
  6971. ReuseCopy(tmp,adr);
  6972. ReleaseIntermediateOperand(adr);
  6973. adr := tmp;
  6974. else := NewLabel();
  6975. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  6976. i := openDim-1;
  6977. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6978. WHILE (i >= 0) DO
  6979. Emit(Pop(position,reg));
  6980. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  6981. Emit(Mov(position,res,reg));
  6982. DEC(i);
  6983. END;
  6984. ReleaseIntermediateOperand(adr);
  6985. ReleaseIntermediateOperand(reg);
  6986. exit := NewLabel();
  6987. BrL(exit);
  6988. SetLabel(else);
  6989. (* else part: array could not be allocated *)
  6990. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  6991. Emit(Add(position,sp,sp,tmp));
  6992. SetLabel(exit);
  6993. END;
  6994. END;
  6995. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  6996. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  6997. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  6998. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  6999. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7000. left.SetType(procedure.type);
  7001. formalParameter := procedureType.firstParameter;
  7002. (* push array to allocate *)
  7003. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7004. formalParameter :=formalParameter.nextParameter;
  7005. (* push length array *)
  7006. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7007. (* push size *)
  7008. type := t0;
  7009. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7010. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7011. END;
  7012. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7013. Emit(Push(position,tmp));
  7014. (* *)
  7015. IF SemanticChecker.ContainsPointer(type) THEN
  7016. tmp := TypeDescriptorAdr(type);
  7017. IF ~newObjectFile THEN
  7018. IntermediateCode.MakeMemory(tmp,addressType);
  7019. END;
  7020. ELSE
  7021. tmp := IntermediateCode.Immediate(addressType, 0);
  7022. END;
  7023. Emit(Push(position,tmp)); (* type descriptor *)
  7024. StaticCallOperand(result,procedure);
  7025. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7026. ReleaseOperand(result);
  7027. END;
  7028. (*
  7029. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7030. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7031. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7032. *)
  7033. ELSE
  7034. dim := 0;
  7035. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7036. (* generate geometry descriptor *)
  7037. Designate(p0,l);
  7038. NewMathArrayDescriptor(l, x.parameters.Length()-1);
  7039. ReleaseOperand(l);
  7040. isTensor := TRUE;
  7041. ELSE
  7042. isTensor := FALSE;
  7043. END;
  7044. FOR i := 1 TO x.parameters.Length()-1 DO
  7045. IF ~isTensor THEN
  7046. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7047. END;
  7048. parameter := x.parameters.GetExpression(i);
  7049. Evaluate(parameter,r);
  7050. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7051. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7052. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7053. END;
  7054. Emit(Push(position,r.op));
  7055. IF i=1 THEN
  7056. ReuseCopy(reg,r.op);
  7057. ELSE
  7058. Emit(Mul(position,reg,reg,r.op)); (*! optimize the multiplication of immediate operands *)
  7059. END;
  7060. ReleaseOperand(r);
  7061. INC(dim);
  7062. END;
  7063. Convert(reg,addressType);
  7064. openDim := dim;
  7065. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7066. (*! the following code is only correct for "standard" Oberon calling convention *)
  7067. IF SemanticChecker.ContainsPointer(SemanticChecker.ArrayBase(type,MAX(LONGINT))) THEN
  7068. t := type;
  7069. IF ~isTensor & (t IS SyntaxTree.MathArrayType) THEN
  7070. staticLength := 1;
  7071. WHILE (t IS SyntaxTree.MathArrayType) DO (* static array *)
  7072. staticLength := staticLength * t(SyntaxTree.MathArrayType).staticLength;
  7073. t := t(SyntaxTree.MathArrayType).arrayBase.resolved;
  7074. END;
  7075. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7076. Emit(Mul(position,reg,reg,tmp));
  7077. END;
  7078. Designate(p0,l);
  7079. IF isTensor THEN
  7080. Dereference(l,type,FALSE);
  7081. t := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7082. END;
  7083. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7084. Emit(Push(position,l.tag)); (* address *)
  7085. ReleaseOperand(l);
  7086. tmp := TypeDescriptorAdr(t);
  7087. IF ~newObjectFile THEN
  7088. IntermediateCode.MakeMemory(tmp,addressType);
  7089. END;
  7090. Emit(Push(position,tmp)); (* type descriptor *)
  7091. ReleaseIntermediateOperand(tmp);
  7092. Emit(Push(position,reg)); (* number Elements *)
  7093. ReleaseIntermediateOperand(reg);
  7094. tmp := IntermediateCode.Immediate(addressType,0);
  7095. Emit(Push(position,tmp)); (* dimensions = 0, we control dimensions in the geometry descriptor *)
  7096. (* push realtime flag: false by default *)
  7097. Emit(Push(position,false));
  7098. CallThis(position,"Heaps","NewArr",5);
  7099. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7100. Emit(Pop(position,adr));
  7101. GetMathArrayField(tmp,adr,MathPtrOffset);
  7102. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7103. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrDataArrayOffset))));
  7104. PutMathArrayField(adr,reg,MathAdrOffset);
  7105. ReleaseIntermediateOperand(tmp);
  7106. ReleaseIntermediateOperand(reg);
  7107. ELSE
  7108. IF isTensor THEN
  7109. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT))));
  7110. ELSE
  7111. size := ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim)));
  7112. END;
  7113. IF (size # 1) THEN
  7114. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7115. END;
  7116. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset));
  7117. Emit(Add(position,reg,reg,tmp));
  7118. Designate(p0,l);
  7119. IF isTensor THEN
  7120. Dereference(l,type,FALSE);
  7121. END;
  7122. Emit(Push(position,l.tag)); (* address for use after syscall *)
  7123. Emit(Push(position,l.tag)); (* address for syscall *)
  7124. ReleaseOperand(l); (* pointer address *)
  7125. Emit(Push(position,reg)); (* size *)
  7126. ReleaseIntermediateOperand(reg);
  7127. (* push realtime flag: false by default *)
  7128. Emit(Push(position,false));
  7129. CallThis(position,"Heaps","NewSys",3);
  7130. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7131. Emit(Pop(position,adr));
  7132. GetMathArrayField(tmp,adr,MathPtrOffset);
  7133. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7134. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,SysDataArrayOffset))));
  7135. PutMathArrayField(adr,reg,MathAdrOffset);
  7136. ReleaseIntermediateOperand(tmp);
  7137. ReleaseIntermediateOperand(reg);
  7138. END;
  7139. flags := {};
  7140. IntermediateCode.InitImmediate(tmp,addressType,SYSTEM.VAL(LONGINT,flags));
  7141. PutMathArrayField(adr,tmp,MathFlagsOffset);
  7142. IntermediateCode.InitImmediate(tmp,addressType,openDim);
  7143. PutMathArrayField(adr,tmp,MathDimOffset);
  7144. else := NewLabel();
  7145. BreqL(else,IntermediateCode.Memory(addressType,adr,0),IntermediateCode.Immediate(addressType,0));
  7146. i := openDim-1;
  7147. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7148. IF isTensor THEN
  7149. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,MAX(LONGINT)))));
  7150. ELSE
  7151. IntermediateCode.InitImmediate(tmp,addressType,ToMemoryUnits(system,system.AlignedSizeOf(SemanticChecker.ArrayBase(type,openDim))));
  7152. END;
  7153. PutMathArrayField(adr,tmp,MathElementSizeOffset);
  7154. WHILE (i >= 0) DO
  7155. Emit(Pop(position,reg));
  7156. PutMathArrayLength(adr,reg,i);
  7157. PutMathArrayIncrement(adr,tmp,i);
  7158. IF i > 0 THEN
  7159. IF i=openDim-1 THEN
  7160. ReuseCopy(tmp,tmp);
  7161. END;
  7162. Emit(Mul(position,tmp,tmp,reg));
  7163. END;
  7164. DEC(i);
  7165. END;
  7166. ReleaseIntermediateOperand(adr);
  7167. ReleaseIntermediateOperand(reg);
  7168. ReleaseIntermediateOperand(tmp);
  7169. exit := NewLabel();
  7170. BrL(exit);
  7171. SetLabel(else);
  7172. (* else part: array could not be allocated *)
  7173. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7174. Emit(Add(position,sp,sp,tmp));
  7175. SetLabel(exit);
  7176. END;
  7177. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7178. THEN
  7179. IF ~backend.cellsAreObjects THEN RETURN END;
  7180. IF InCellScope(currentScope) THEN
  7181. PushSelfPointer()
  7182. ELSE
  7183. Emit(Push(position, nil));
  7184. END;
  7185. (* push temp address *)
  7186. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7187. temporaryVariable := GetTemporaryVariable(type, FALSE);
  7188. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7189. (* l.op contains address of pointer to record *)
  7190. Emit(Push(position,l.op)); (* address for use after syscall *)
  7191. ReleaseOperand(l);
  7192. (* push type descriptor *)
  7193. reg := TypeDescriptorAdr(baseType);
  7194. IF ~newObjectFile THEN
  7195. IntermediateCode.MakeMemory(reg,addressType);
  7196. END;
  7197. Emit(Push(position,reg));
  7198. ReleaseIntermediateOperand(reg);
  7199. (* push name *)
  7200. (*Global.GetSymbolName(p0, n);*)
  7201. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7202. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7203. ELSE
  7204. Global.GetModuleName(module.module, n);
  7205. END;
  7206. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position);
  7207. (*type.typeDeclaration.GetName(n);*)
  7208. PushConstString(n);
  7209. (* push cellnet boolean *)
  7210. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7211. (* push engine boolean *)
  7212. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7213. (* allocate *)
  7214. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7215. (* add capabilities *)
  7216. modifier := p0(SyntaxTree.Designator).modifiers;
  7217. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7218. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7219. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7220. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7221. END;
  7222. AppendModifiers(modifier, baseType(SyntaxTree.CellType).modifiers);
  7223. (*
  7224. modifier := baseType(SyntaxTree.CellType).modifiers;
  7225. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7226. modifier := p0(SyntaxTree.Designator).modifiers;
  7227. *)
  7228. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7229. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7230. (* l.op contains address of pointer to record *)
  7231. ToMemory(l.op,addressType,0);
  7232. (* l.op contains value of pointer to record *)
  7233. Emit(Push(position,l.op)); (* address for use after syscall *)
  7234. ReleaseOperand(l);
  7235. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7236. prevScope := currentScope;
  7237. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7238. previous := section;
  7239. section := init;
  7240. (* add ports *)
  7241. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7242. CloseInitializer(previous);
  7243. currentScope := prevScope;
  7244. Symbol(temporaryVariable,l);
  7245. ToMemory(l.op,addressType,0);
  7246. Emit(Push(position,l.op));
  7247. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7248. (*
  7249. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7250. IF constructor # NIL THEN
  7251. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7252. FOR i := 1 TO x.parameters.Length()-1 DO
  7253. p := x.parameters.GetExpression(i);
  7254. Global.GetSymbolName(parameter,name);
  7255. Evaluate(p, value);
  7256. ASSERT(value.type # NIL);
  7257. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7258. par := instance.AddParameter(name);
  7259. par.SetInteger(value.integer);
  7260. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7261. par := instance.AddParameter(name);
  7262. par.SetBoolean(value.boolean);
  7263. ELSE Error(x.position,NotYetImplemented)
  7264. END;
  7265. parameter := parameter.nextParameter
  7266. END;
  7267. END;
  7268. *)
  7269. (* call initializer *)
  7270. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7271. IF constructor # NIL THEN
  7272. (*! should be unified with ProcedureCallDesignator *)
  7273. IF backend.cellsAreObjects THEN
  7274. Symbol(temporaryVariable,l);
  7275. ToMemory(l.op,addressType,0);
  7276. Emit(Push(position,l.op));
  7277. ReleaseOperand(l);
  7278. END;
  7279. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7280. FOR i := 1 TO x.parameters.Length()-1 DO
  7281. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7282. formalParameter := formalParameter.nextParameter;
  7283. END;
  7284. (* static call of the constructor *)
  7285. Global.GetSymbolSegmentedName(constructor,name);
  7286. ASSERT(~constructor.isInline);
  7287. IF constructor.scope.ownerModule # module.module THEN
  7288. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7289. ELSE
  7290. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7291. END;
  7292. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7293. (*ELSE
  7294. ReleaseIntermediateOperand(pointer);*)
  7295. END;
  7296. (* start *)
  7297. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7298. ToMemory(l.op, addressType, 0);
  7299. Designate(p0,s0);
  7300. ToMemory(s0.op,addressType,0);
  7301. Emit(Mov(position,s0.op,l.op));
  7302. ReleaseOperand(l);
  7303. ReleaseOperand(s0);
  7304. result.tag := emptyOperand;
  7305. (* push cell *)
  7306. Symbol(temporaryVariable, l);
  7307. ToMemory(l.op,addressType,0);
  7308. Emit(Push(-1,l.op));
  7309. (* push delegate *)
  7310. Emit(Push(-1,l.op));
  7311. ReleaseOperand(l);
  7312. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7313. Emit(Push(position, s1.op));
  7314. ReleaseOperand(s1);
  7315. CallThis(position,"ActiveCellsRuntime","Start",3);
  7316. (*IF temporaryVariable # NIL THEN
  7317. end := NewLabel();
  7318. BrL(end);
  7319. SetLabel(exit);
  7320. Designate(p0,l);
  7321. ToMemory(l.op,addressType,0);
  7322. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7323. ReleaseOperand(l);
  7324. SetLabel(end);
  7325. ELSE
  7326. SetLabel(exit);
  7327. END;
  7328. *)
  7329. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7330. ELSE (* no pointer to record, no pointer to array *)
  7331. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7332. (* ignore new statement *)
  7333. Warning(p0.position, "cannot run on final hardware");
  7334. ELSE
  7335. HALT(200);
  7336. END;
  7337. END;
  7338. (* ---- ADDRESSOF----- *)
  7339. |Global.systemAdr:
  7340. Designate(p0,s0);
  7341. s0.mode := ModeValue;
  7342. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7343. ReleaseIntermediateOperand(s0.op);
  7344. s0.op := s0.tag;
  7345. IntermediateCode.InitOperand(s0.tag);
  7346. END;
  7347. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7348. result := s0;
  7349. (* ---- BIT ----- *)
  7350. |Global.systemBit:
  7351. Evaluate(p0,s0);
  7352. ToMemory(s0.op,addressType,0);
  7353. ReuseCopy(res,s0.op);
  7354. ReleaseOperand(s0);
  7355. Evaluate(p1,s1);
  7356. Emit(Ror(position,res,res,s1.op));
  7357. ReleaseOperand(s1);
  7358. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7359. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7360. IF ~conditional THEN
  7361. InitOperand(result,ModeValue); result.op := res;
  7362. ELSE
  7363. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7364. BrL(falseLabel);
  7365. ReleaseIntermediateOperand(res);
  7366. END;
  7367. (* --- MSK ----*)
  7368. |Global.systemMsk:
  7369. Evaluate(p0,s0);
  7370. Evaluate(p1,s1);
  7371. ReuseCopy(res,s0.op);
  7372. ReleaseOperand(s0);
  7373. Emit(And(position,res,res,s1.op));
  7374. ReleaseOperand(s1);
  7375. InitOperand(result,ModeValue);
  7376. result.op := res;
  7377. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  7378. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  7379. Evaluate(p0,s0);
  7380. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  7381. ReleaseOperand(s0);
  7382. InitOperand(result,ModeValue);
  7383. result.op := res;
  7384. (* ---- SYSTEM.GetStackPointer ----- *)
  7385. |Global.systemGetStackPointer:
  7386. InitOperand(result,ModeValue);
  7387. result.op := sp;
  7388. (* ---- SYSTEM.GetFramePointer ----- *)
  7389. |Global.systemGetFramePointer:
  7390. InitOperand(result,ModeValue);
  7391. result.op := fp;
  7392. (* ---- SYSTEM.GetActivity ----- *)
  7393. |Global.systemGetActivity:
  7394. ASSERT(backend.cooperative);
  7395. InitOperand(result,ModeValue);
  7396. result.op := ap;
  7397. (* ---- SYSTEM.SetStackPointer ----- *)
  7398. |Global.systemSetStackPointer:
  7399. Evaluate(p0,s0); (* *)
  7400. Emit(Mov(position,sp,s0.op));
  7401. ReleaseOperand(s0);
  7402. (* ---- SYSTEM.SetFramePointer ----- *)
  7403. |Global.systemSetFramePointer:
  7404. Evaluate(p0,s0); (* *)
  7405. Emit(Mov(position,fp,s0.op));
  7406. ReleaseOperand(s0);
  7407. (* ---- SYSTEM.Activity ----- *)
  7408. |Global.systemSetActivity:
  7409. ASSERT(backend.cooperative);
  7410. Evaluate(p0,s0); (* *)
  7411. Emit(Mov(position,ap,s0.op));
  7412. ReleaseOperand(s0);
  7413. (* ---- SYSTEM.VAL ----- *)
  7414. |Global.systemVal:
  7415. Expression(p1);
  7416. s1 := result;
  7417. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7418. IF s1.mode = ModeReference THEN
  7419. (* nothing to be done if not record type, just take over new type *)
  7420. IF (type IS SyntaxTree.RecordType) THEN
  7421. ReleaseIntermediateOperand(s1.tag);
  7422. s1.tag := TypeDescriptorAdr(type);
  7423. IF ~newObjectFile THEN
  7424. IntermediateCode.MakeMemory(s1.tag,addressType);
  7425. END;
  7426. UseIntermediateOperand(s1.tag);
  7427. END;
  7428. result := s1;
  7429. ELSE (* copy over result to different type, may not use convert *)
  7430. itype := IntermediateCode.GetType(system,type);
  7431. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  7432. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  7433. Emit(Mov(position,s0.op,s1.op));
  7434. ReleaseOperand(s1);
  7435. InitOperand(result,ModeValue);
  7436. result.op := s0.op;
  7437. ELSE (* different size, must convert *)
  7438. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  7439. Convert(s1.op, IntermediateCode.GetType(system,type));
  7440. result := s1;
  7441. END;
  7442. END;
  7443. (* ---- SYSTEM.GET ----- *)
  7444. |Global.systemGet:
  7445. Evaluate(p0,s0); (* adr *)
  7446. Designate(p1,s1); (* variable *)
  7447. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  7448. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  7449. Emit(Mov(position,s1.op,s0.op));
  7450. ReleaseOperand(s1);
  7451. ReleaseOperand(s0);
  7452. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  7453. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  7454. Evaluate(p0,s0); (* *)
  7455. Evaluate(p1,s1); (* variable *)
  7456. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  7457. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  7458. (* real part *)
  7459. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  7460. Emit(Mov(position,res, s1.op));
  7461. ReleaseIntermediateOperand(res);
  7462. (* imaginary part *)
  7463. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  7464. Emit(Mov(position,res, s1.tag));
  7465. ReleaseIntermediateOperand(res);
  7466. ReleaseOperand(s1);
  7467. ReleaseOperand(s0);
  7468. ELSE
  7469. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  7470. ReleaseOperand(s0);
  7471. Emit(Mov(position,res,s1.op));
  7472. ReleaseIntermediateOperand(res);
  7473. ReleaseOperand(s1);
  7474. END;
  7475. (* ---- SYSTEM.MOVE ----- *)
  7476. |Global.systemMove:
  7477. Evaluate(p0,s0);
  7478. Evaluate(p1,s1);
  7479. Evaluate(p2,s2);
  7480. Emit(Copy(position,s1.op,s0.op,s2.op));
  7481. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7482. (* ---- SYSTEM.NEW ----- *)
  7483. |Global.systemNew:
  7484. Designate(p0,s0);
  7485. Emit(Push(position,s0.op));
  7486. ReleaseOperand(s0);
  7487. Evaluate(p1,s1);
  7488. Emit(Push(position,s1.op));
  7489. ReleaseOperand(s1);
  7490. (* push realtime flag: false by default *)
  7491. Emit(Push(position,false));
  7492. CallThis(position,"Heaps","NewSys",3);
  7493. (* ---- SYSTEM.CALL ----- *)
  7494. |Global.systemRef:
  7495. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  7496. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  7497. s0.mode := ModeValue;
  7498. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  7499. result := s0
  7500. (* ---- INCR ----- *)
  7501. |Global.Incr:
  7502. Designate(p0,operand);
  7503. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7504. Dereference(operand,p0.type.resolved,FALSE);
  7505. END;
  7506. ASSERT(p1 # NIL);
  7507. Evaluate(p1,l);
  7508. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  7509. ReleaseOperand(operand); ReleaseOperand(l);
  7510. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7511. (* ---- SUM ----- *)
  7512. |Global.Sum: HALT(200);
  7513. (* ---- CAS ----- *)
  7514. |Global.Cas:
  7515. needsTrace := p0.NeedsTrace();
  7516. IF needsTrace THEN ModifyAssignments(true) END;
  7517. Designate(p0,s0);
  7518. Evaluate(p1,s1);
  7519. Evaluate(p2,s2);
  7520. IF needsTrace THEN
  7521. Emit(Push(position, s0.op));
  7522. Emit(Push(position, s1.op));
  7523. Emit(Push(position, s2.op));
  7524. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  7525. ELSE
  7526. Emit(Cas(position,s0.op,s1.op,s2.op));
  7527. END;
  7528. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7529. IF needsTrace THEN ModifyAssignments(false) END;
  7530. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7531. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  7532. IF conditional THEN
  7533. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7534. BrL(falseLabel);
  7535. ReleaseIntermediateOperand(res);
  7536. END;
  7537. (* ---- DIM ----- *)
  7538. |Global.Dim:
  7539. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  7540. Designate(p0,s0);
  7541. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7542. Dereference(s0,p0.type.resolved,FALSE);
  7543. END;
  7544. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  7545. ReleaseOperand(s0);
  7546. (* ---- RESHAPE ----- *)
  7547. |Global.Reshape:
  7548. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  7549. left := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid,NIL,procedure);
  7550. left.SetType(procedure.type);
  7551. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  7552. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  7553. END;
  7554. (* ---- SYSTEM.TYPECODE ----- *)
  7555. |Global.systemTypeCode:
  7556. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  7557. IF type.resolved IS SyntaxTree.PointerType THEN
  7558. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7559. END;
  7560. result.op := TypeDescriptorAdr(type);
  7561. IF ~newObjectFile THEN
  7562. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  7563. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  7564. END;
  7565. result.mode := ModeValue;
  7566. (* ---- SYSTEM.TRACE ----- *)
  7567. |Global.systemTrace:
  7568. SystemTrace(x.parameters, x.position);
  7569. (* ----- CONNECT ------*)
  7570. |Global.Connect:
  7571. IF backend.cellsAreObjects THEN
  7572. PushPort(p0);
  7573. PushPort(p1);
  7574. IF p2 # NIL THEN
  7575. Evaluate(p2, s2);
  7576. Emit(Push(p2.position, s2.op));
  7577. ReleaseOperand(s2);
  7578. ELSE
  7579. Emit(Push(-1, IntermediateCode.Immediate(int32, -1)));
  7580. END;
  7581. CallThis(position,"ActiveCellsRuntime","Connect",3);
  7582. ELSE
  7583. Warning(x.position, "cannot run on final hardware");
  7584. END;
  7585. (* ----- DELEGATE ------*)
  7586. |Global.Delegate:
  7587. IF backend.cellsAreObjects THEN
  7588. PushPort(p0);
  7589. PushPort(p1);
  7590. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  7591. ELSE
  7592. Warning(x.position, "cannot run on final hardware");
  7593. END;
  7594. (* ----- SEND ------*)
  7595. |Global.Send:
  7596. Evaluate(p0,s0);
  7597. Evaluate(p1,s1);
  7598. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7599. Emit(Push(position,s0.op));
  7600. Emit(Push(position,s1.op));
  7601. (*
  7602. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7603. *)
  7604. IF ~backend.cellsAreObjects THEN
  7605. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  7606. END;
  7607. ReleaseOperand(s0);
  7608. ReleaseOperand(s1);
  7609. IF backend.cellsAreObjects THEN
  7610. CallThis(position,"ActiveCellsRuntime","Send",2);
  7611. ELSE
  7612. CallThis(position,ChannelModuleName,"Send",2);
  7613. END;
  7614. (* ----- RECEIVE ------*)
  7615. |Global.Receive:
  7616. Evaluate(p0,s0);
  7617. Emit(Push(position,s0.op));
  7618. Designate(p1,s1);
  7619. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  7620. Emit(Push(position,s1.op));
  7621. IF p2 # NIL THEN
  7622. Designate(p2,s2);
  7623. Emit(Push(position,s2.op));
  7624. END;
  7625. (*
  7626. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  7627. *)
  7628. IF ~backend.cellsAreObjects THEN
  7629. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  7630. END;
  7631. ReleaseOperand(s0);
  7632. ReleaseOperand(s1);
  7633. ReleaseOperand(s2);
  7634. IF backend.cellsAreObjects THEN
  7635. IF p2 = NIL THEN
  7636. CallThis(position,"ActiveCellsRuntime","Receive",2)
  7637. ELSE
  7638. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  7639. END;
  7640. ELSE
  7641. IF p2 = NIL THEN
  7642. CallThis(position,ChannelModuleName,"Receive",2)
  7643. ELSE
  7644. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  7645. END;
  7646. END;
  7647. | Global.systemSpecial:
  7648. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  7649. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  7650. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  7651. (* determine if parameters are of the VAR kind *)
  7652. ASSERT(x.parameters.Length() <= 3);
  7653. formalParameter := procedureType.firstParameter;
  7654. FOR i := 0 TO x.parameters.Length() - 1 DO
  7655. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  7656. formalParameter := formalParameter.nextParameter
  7657. END;
  7658. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  7659. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  7660. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  7661. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  7662. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7663. IF procedureType.returnType # NIL THEN
  7664. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  7665. Emit(Result(position, res));
  7666. (*InitOperand(result,ModeValue);
  7667. result.op := res;
  7668. *)
  7669. IF ~conditional THEN
  7670. InitOperand(result,ModeValue); result.op := res;
  7671. ELSE
  7672. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7673. BrL(falseLabel);
  7674. ReleaseIntermediateOperand(res);
  7675. END;
  7676. END
  7677. ELSE (* function not yet implemented *)
  7678. Error(position,"not yet implemented");
  7679. END;
  7680. destination := dest;
  7681. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  7682. END VisitBuiltinCallDesignator;
  7683. PROCEDURE VisitTypeGuardDesignator(x: SyntaxTree.TypeGuardDesignator);
  7684. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  7685. BEGIN
  7686. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  7687. dest := destination; destination := emptyOperand;
  7688. Expression(x.left);
  7689. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  7690. ELSIF isUnchecked THEN (* no check *)
  7691. ELSE
  7692. trueL := NewLabel();
  7693. falseL := NewLabel();
  7694. IF IsPointerToRecord(x.left.type,recordType) THEN
  7695. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7696. Emit(Mov(position,tag, result.op));
  7697. IF result.mode # ModeValue THEN
  7698. ptr := tag;
  7699. IntermediateCode.MakeMemory(ptr,addressType);
  7700. Emit(Mov(position,tag, ptr));
  7701. END;
  7702. IF ~backend.cooperative THEN
  7703. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7704. END;
  7705. IntermediateCode.MakeMemory(tag,addressType);
  7706. ELSE
  7707. tag := result.tag;
  7708. END;
  7709. TypeTest(tag,x.type,trueL,falseL);
  7710. ReleaseIntermediateOperand(tag);
  7711. SetLabel(falseL);
  7712. EmitTrap(position,TypeCheckTrap);
  7713. SetLabel(trueL);
  7714. END;
  7715. destination := dest;
  7716. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  7717. END VisitTypeGuardDesignator;
  7718. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  7719. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  7720. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  7721. VAR label: Label; pc: LONGINT;
  7722. BEGIN
  7723. IF backend.cooperative & ~isUnchecked THEN
  7724. pc := section.pc;
  7725. label := NewLabel();
  7726. BrneL(label, operand.op, nil);
  7727. EmitTrap(position, NilPointerTrap);
  7728. SetLabel(label);
  7729. INC(statCoopNilCheck, section.pc - pc);
  7730. END;
  7731. END NilCheck;
  7732. BEGIN
  7733. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  7734. ReuseCopy(dereferenced,operand.op);
  7735. ReleaseOperand(operand);
  7736. operand.mode := ModeReference;
  7737. operand.op := dereferenced;
  7738. operand.tag := dereferenced;
  7739. UseIntermediateOperand(operand.tag);
  7740. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  7741. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  7742. ReleaseIntermediateOperand(operand.tag);
  7743. operand.tag := TypeDescriptorAdr(type);
  7744. IF ~newObjectFile THEN
  7745. IntermediateCode.MakeMemory(operand.tag,addressType);
  7746. END;
  7747. ELSE
  7748. IF ~backend.cooperative THEN
  7749. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  7750. END;
  7751. IntermediateCode.MakeMemory(operand.tag,addressType);
  7752. END;
  7753. NilCheck(operand.op);
  7754. ELSIF type IS SyntaxTree.ArrayType THEN
  7755. IF isUnsafe THEN
  7756. NilCheck(operand.op);
  7757. ReleaseIntermediateOperand(operand.tag);
  7758. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  7759. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  7760. ELSE
  7761. operand.tag := emptyOperand;
  7762. END;
  7763. ELSE
  7764. NilCheck(operand.op);
  7765. IF backend.cooperative THEN
  7766. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  7767. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7768. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  7769. ELSE
  7770. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  7771. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  7772. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  7773. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  7774. END;
  7775. END;
  7776. ELSIF type IS SyntaxTree.MathArrayType THEN
  7777. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  7778. IntermediateCode.MakeMemory(operand.op,addressType);
  7779. ELSE HALT(100);
  7780. END;
  7781. END Dereference;
  7782. PROCEDURE VisitDereferenceDesignator(x: SyntaxTree.DereferenceDesignator);
  7783. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  7784. BEGIN
  7785. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  7786. dest := destination; destination := emptyOperand;
  7787. Evaluate(x.left,d);
  7788. type := x.type.resolved;
  7789. prevIsUnchecked := isUnchecked;
  7790. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  7791. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  7792. END;
  7793. Dereference(d,type,IsUnsafePointer(x.left.type));
  7794. isUnchecked := prevIsUnchecked;
  7795. result := d;
  7796. 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
  7797. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  7798. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7799. END;
  7800. END;
  7801. destination := dest;
  7802. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  7803. END VisitDereferenceDesignator;
  7804. PROCEDURE VisitSupercallDesignator(x: SyntaxTree.SupercallDesignator);
  7805. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  7806. BEGIN
  7807. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  7808. dest := destination; destination := emptyOperand;
  7809. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  7810. tag := result.op;
  7811. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  7812. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  7813. StaticCallOperand(result,procedure.super);
  7814. ReleaseIntermediateOperand(result.tag);
  7815. UseIntermediateOperand(tag); (* necessary ? *)
  7816. result.tag := tag;
  7817. destination := dest;
  7818. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  7819. END VisitSupercallDesignator;
  7820. PROCEDURE VisitSelfDesignator(x: SyntaxTree.SelfDesignator);
  7821. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  7822. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  7823. name: Basic.SegmentedName;
  7824. BEGIN
  7825. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  7826. dest := destination; destination := emptyOperand;
  7827. scope := currentScope;
  7828. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  7829. scope := scope.outerScope;
  7830. END;
  7831. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  7832. IF newObjectFile THEN
  7833. moduleSection := meta.ModuleSection();
  7834. IF backend.cooperative THEN
  7835. moduleOffset := 0;
  7836. ELSE
  7837. moduleOffset := moduleSection.pc;
  7838. END;
  7839. result.mode := ModeValue;
  7840. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  7841. ELSE
  7842. Symbol(moduleSelf,result);
  7843. IntermediateCode.MakeMemory(result.op,addressType);
  7844. END
  7845. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  7846. result.mode := ModeValue;
  7847. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  7848. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  7849. ELSE
  7850. GetBaseRegister(basereg,currentScope,scope);
  7851. InitOperand(result,ModeReference);
  7852. result.op := basereg;
  7853. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  7854. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  7855. IF backend.cooperative THEN
  7856. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  7857. END;
  7858. (* tag must be loaded when dereferencing SELF pointer *)
  7859. END;
  7860. destination := dest;
  7861. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  7862. END VisitSelfDesignator;
  7863. PROCEDURE VisitResultDesignator(x: SyntaxTree.ResultDesignator);
  7864. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  7865. BEGIN
  7866. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  7867. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  7868. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7869. parameter := procedureType.returnParameter;
  7870. VisitParameter(parameter);
  7871. IF Trace THEN TraceExit("VisitResultDesignator") END;
  7872. END VisitResultDesignator;
  7873. (** values *)
  7874. PROCEDURE VisitBooleanValue(x: SyntaxTree.BooleanValue);
  7875. BEGIN
  7876. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  7877. IF conditional THEN
  7878. IF x.value THEN BrL(trueLabel)
  7879. ELSE BrL(falseLabel)
  7880. END;
  7881. ELSE
  7882. InitOperand(result,ModeValue);
  7883. IF x.value THEN result.op := true ELSE result.op := false END;
  7884. END;
  7885. END VisitBooleanValue;
  7886. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  7887. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  7888. BEGIN
  7889. Global.GetModuleSegmentedName(module.module, name);
  7890. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  7891. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,TRUE);
  7892. RETURN section
  7893. END GetDataSection;
  7894. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  7895. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  7896. BEGIN
  7897. type := vop.type;
  7898. data := GetDataSection();
  7899. pc := EnterImmediate(data,vop);
  7900. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  7901. IntermediateCode.MakeMemory(vop, type);
  7902. END GetImmediateMem;
  7903. PROCEDURE VisitIntegerValue(x: SyntaxTree.IntegerValue);
  7904. BEGIN
  7905. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  7906. InitOperand(result,ModeValue);
  7907. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  7908. IF ~supportedImmediate(result.op) &~inData THEN
  7909. GetImmediateMem(result.op)
  7910. END;
  7911. END VisitIntegerValue;
  7912. PROCEDURE VisitCharacterValue(x: SyntaxTree.CharacterValue);
  7913. BEGIN
  7914. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  7915. InitOperand(result,ModeValue);
  7916. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  7917. END VisitCharacterValue;
  7918. PROCEDURE VisitSetValue(x: SyntaxTree.SetValue);
  7919. BEGIN
  7920. IF Trace THEN TraceEnter("VisitSetValue") END;
  7921. InitOperand(result,ModeValue);
  7922. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  7923. END VisitSetValue;
  7924. PROCEDURE VisitMathArrayValue(x: SyntaxTree.MathArrayValue);
  7925. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  7926. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  7927. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  7928. BEGIN
  7929. numberElements := x.elements.Length();
  7930. FOR i := 0 TO numberElements-1 DO
  7931. expression := x.elements.GetExpression(i);
  7932. IF expression IS SyntaxTree.MathArrayExpression THEN
  7933. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  7934. ELSE
  7935. inData := TRUE;
  7936. Evaluate(expression,op);
  7937. irv.Emit(Data(position,op.op));
  7938. inData := FALSE;
  7939. ReleaseOperand(op);
  7940. END;
  7941. END;
  7942. END RecursiveData;
  7943. BEGIN
  7944. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  7945. IF ~TryConstantDeclaration() THEN
  7946. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  7947. GetCodeSectionNameForSymbol(constantDeclaration,name);
  7948. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  7949. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  7950. ELSE
  7951. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  7952. END;
  7953. RecursiveData(x.array);
  7954. InitOperand(result,ModeReference);
  7955. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  7956. END
  7957. END VisitMathArrayValue;
  7958. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  7959. VAR constant: Sections.Section;
  7960. BEGIN
  7961. IF constantDeclaration = NIL THEN
  7962. RETURN FALSE
  7963. ELSE
  7964. (* Is a constant in this module: did we generate it already? *)
  7965. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  7966. IF constant # NIL THEN
  7967. InitOperand(result,ModeReference);
  7968. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  7969. RETURN TRUE;
  7970. END;
  7971. END;
  7972. RETURN FALSE
  7973. END TryConstantDeclaration;
  7974. PROCEDURE VisitConstant(x: SyntaxTree.Constant);
  7975. BEGIN
  7976. constantDeclaration := x;
  7977. x.value.resolved.Accept(SELF);
  7978. END VisitConstant;
  7979. PROCEDURE VisitRealValue(x: SyntaxTree.RealValue);
  7980. BEGIN
  7981. IF Trace THEN TraceEnter("VisitRealValue") END;
  7982. InitOperand(result,ModeValue);
  7983. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  7984. END VisitRealValue;
  7985. PROCEDURE VisitComplexValue(x: SyntaxTree.ComplexValue);
  7986. VAR
  7987. componentType: SyntaxTree.Type;
  7988. BEGIN
  7989. IF Trace THEN TraceEnter("VisitComplexValue") END;
  7990. ASSERT(x.type IS SyntaxTree.ComplexType);
  7991. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7992. InitOperand(result,ModeValue);
  7993. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  7994. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  7995. END VisitComplexValue;
  7996. PROCEDURE VisitStringValue(x: SyntaxTree.StringValue);
  7997. VAR i: LONGINT; name: Basic.SegmentedName;
  7998. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  7999. BEGIN
  8000. IF Trace THEN TraceEnter("VisitStringValue") END;
  8001. IF ~TryConstantDeclaration() THEN
  8002. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8003. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8004. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8005. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8006. ELSE
  8007. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8008. END;
  8009. FOR i := 0 TO x.length-1 DO
  8010. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8011. irv.Emit(Data(position,op));
  8012. END;
  8013. InitOperand(result,ModeReference);
  8014. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8015. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8016. END
  8017. END VisitStringValue;
  8018. PROCEDURE VisitNilValue(x: SyntaxTree.NilValue);
  8019. BEGIN
  8020. IF Trace THEN TraceEnter("VisitNilValue") END;
  8021. InitOperand(result,ModeValue);
  8022. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8023. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8024. END VisitNilValue;
  8025. PROCEDURE VisitEnumerationValue(x: SyntaxTree.EnumerationValue);
  8026. BEGIN
  8027. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8028. InitOperand(result,ModeValue);
  8029. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8030. END VisitEnumerationValue;
  8031. (** symbols *)
  8032. PROCEDURE VisitImport(x: SyntaxTree.Import);
  8033. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8034. END VisitImport;
  8035. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8036. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8037. BEGIN
  8038. IF scope # baseScope THEN
  8039. (* left := [fp+8] *)
  8040. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8041. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8042. ReuseCopy(left,right);
  8043. ReleaseIntermediateOperand(right);
  8044. scope := scope.outerScope; DEC(level);
  8045. (* { left := [left+8] } *)
  8046. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8047. IF backend.cooperative THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8048. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8049. Emit(Mov(position,left,right));
  8050. scope := scope.outerScope; DEC(level);
  8051. END;
  8052. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8053. result := left;
  8054. ELSE
  8055. result := fp;
  8056. END;
  8057. END GetBaseRegister;
  8058. PROCEDURE VisitVariable(x: SyntaxTree.Variable);
  8059. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8060. BEGIN
  8061. IF Trace THEN TraceEnter("VisitVariable"); END;
  8062. type := x.type.resolved;
  8063. IF (x.useRegister) THEN
  8064. InitOperand(result, ModeValue);
  8065. IF x.registerNumber < 0 THEN
  8066. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8067. reg := x.registerNumber;
  8068. ELSE
  8069. reg := registerUsageCount.Map(x.registerNumber);
  8070. UseRegister(reg);
  8071. END;
  8072. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8073. ELSIF x.externalName # NIL THEN
  8074. InitOperand(result,ModeReference);
  8075. Basic.ToSegmentedName(x.externalName^, name);
  8076. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8077. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8078. InitOperand(result,ModeReference);
  8079. GetBaseRegister(result.op,currentScope,x.scope);
  8080. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8081. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8082. InitOperand(result,ModeReference);
  8083. GetCodeSectionNameForSymbol(x,name);
  8084. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8085. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8086. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8087. InitOperand(result,ModeReference);
  8088. GetCodeSectionNameForSymbol(x,name);
  8089. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8090. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8091. ELSE (* field, left designator must have been emitted *)
  8092. ASSERT(result.mode = ModeReference);
  8093. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8094. ReuseCopy(temp,result.op);
  8095. ReleaseIntermediateOperand(result.op);
  8096. result.op := temp;
  8097. END;
  8098. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8099. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8100. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8101. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8102. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8103. END;
  8104. END;
  8105. END;
  8106. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8107. ValueToCondition(result);
  8108. ELSIF type IS SyntaxTree.ProcedureType THEN
  8109. ReleaseIntermediateOperand(result.tag);
  8110. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8111. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8112. UseIntermediateOperand(result.tag);
  8113. ELSE
  8114. result.tag := nil; (* nil *)
  8115. END;
  8116. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8117. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8118. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8119. ReleaseIntermediateOperand(result.tag);
  8120. Global.GetSymbolSegmentedName(x,name);
  8121. Basic.AppendToSegmentedName(name,"@len");
  8122. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8123. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8124. ELSE
  8125. END;
  8126. ELSE
  8127. ReleaseIntermediateOperand(result.tag);
  8128. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8129. END;
  8130. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8131. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8132. ReleaseIntermediateOperand(result.tag);
  8133. result.tag := result.op;
  8134. UseIntermediateOperand(result.tag);
  8135. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8136. IntermediateCode.MakeMemory(result.op,addressType);
  8137. END;
  8138. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8139. ReleaseIntermediateOperand(result.tag);
  8140. result.tag := TypeDescriptorAdr(type);
  8141. IF ~newObjectFile THEN
  8142. IntermediateCode.MakeMemory(result.tag,addressType);
  8143. END;
  8144. UseIntermediateOperand(result.tag);
  8145. (* tag for pointer type computed not here but during dereferencing *)
  8146. END;
  8147. IF Trace THEN TraceExit("VisitVariable") END;
  8148. END VisitVariable;
  8149. PROCEDURE VisitProperty(property: SyntaxTree.Property);
  8150. VAR name: ARRAY 256 OF CHAR; res: IntermediateCode.Operand; saved: RegisterEntry;
  8151. BEGIN
  8152. VisitVariable(property);
  8153. (*
  8154. SaveRegisters();ReleaseUsedRegisters(saved);
  8155. PushSelfPointer();
  8156. property.GetName(name);
  8157. PushConstString(name);
  8158. CallThis(position,"ActiveCellsRuntime","GetIntegerProperty",4);
  8159. res := NewRegisterOperand(IntermediateCode.GetType(system,system.longintType));
  8160. Emit(Result(position,res));
  8161. InitOperand(result, ModeValue);
  8162. result.op := res;
  8163. RestoreRegisters(saved);
  8164. (*! emit read property via runtime module *)
  8165. *)
  8166. END VisitProperty;
  8167. PROCEDURE VisitParameter(x: SyntaxTree.Parameter);
  8168. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8169. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT;
  8170. BEGIN
  8171. type := x.type.resolved;
  8172. IF Trace THEN TraceEnter("VisitParameter") END;
  8173. IF x.ownerType IS SyntaxTree.CellType THEN
  8174. ptype := x.type.resolved;
  8175. IF ptype IS SyntaxTree.ArrayType THEN ptype := ptype(SyntaxTree.ArrayType).arrayBase.resolved END;
  8176. IF ~(ptype IS SyntaxTree.PortType) THEN
  8177. InitOperand(result,ModeReference);
  8178. GetCodeSectionNameForSymbol(x,name);
  8179. symbol := NewSection(module.allSections, Sections.ConstSection, name,x,commentPrintout # NIL);
  8180. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol),0);
  8181. RETURN
  8182. ELSE
  8183. InitOperand(result, ModeValue);
  8184. parameter := x.ownerType(SyntaxTree.CellType).firstParameter;
  8185. adr := 0;
  8186. WHILE parameter # x DO
  8187. parameterType := parameter.type;
  8188. inc := 1;
  8189. WHILE SemanticChecker.IsStaticArray(parameterType, parameterType, len) DO inc := inc * len END;
  8190. INC(adr, inc);
  8191. parameter := parameter.nextParameter
  8192. END;
  8193. adr := backend.activeCellsSpecification.GetPortAddress(adr);
  8194. IntermediateCode.InitImmediate(result.op,addressType,adr);
  8195. RETURN
  8196. END;
  8197. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8198. InitOperand(result,ModeReference);
  8199. GetCodeSectionNameForSymbol(x,name);
  8200. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8201. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8202. RETURN
  8203. ELSE
  8204. GetBaseRegister(basereg,currentScope,x.scope);
  8205. InitOperand(result,ModeReference);
  8206. result.op := basereg;
  8207. END;
  8208. IF IsOpenArray(type) THEN
  8209. result.tag := basereg;
  8210. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8211. IntermediateCode.MakeMemory(result.op,addressType);
  8212. IF Global.IsOberonProcedure(x.ownerType) THEN
  8213. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8214. UseIntermediateOperand(result.tag);
  8215. ELSE
  8216. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8217. END;
  8218. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8219. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8220. ELSIF IsStaticArray(type) THEN
  8221. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8222. IntermediateCode.MakeMemory(result.op,addressType);
  8223. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8224. ELSIF type IS SyntaxTree.MathArrayType THEN
  8225. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8226. WITH type: SyntaxTree.MathArrayType DO
  8227. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8228. IF type.form = SyntaxTree.Tensor THEN
  8229. ELSIF type.form = SyntaxTree.Open THEN
  8230. result.tag := result.op;
  8231. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8232. IntermediateCode.MakeMemory(result.op,addressType);
  8233. UseIntermediateOperand(result.tag);
  8234. ELSIF type.form = SyntaxTree.Static THEN
  8235. IF x.kind = SyntaxTree.ConstParameter THEN
  8236. IntermediateCode.MakeMemory(result.op,addressType);
  8237. END;
  8238. ELSE HALT(100)
  8239. END;
  8240. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8241. IF type.form = SyntaxTree.Tensor THEN
  8242. ToMemory(result.op,addressType,0);
  8243. ELSIF type.form = SyntaxTree.Open THEN
  8244. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8245. ReuseCopy(result.tag, mem);
  8246. ReleaseIntermediateOperand(mem);
  8247. ReleaseIntermediateOperand(result.op);
  8248. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8249. ELSIF type.form = SyntaxTree.Static THEN
  8250. IntermediateCode.MakeMemory(result.op,addressType);
  8251. ELSE HALT(100)
  8252. END;
  8253. ELSE HALT(100)
  8254. END;
  8255. END;
  8256. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8257. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8258. IntermediateCode.MakeMemory(result.op,addressType);
  8259. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8260. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8261. END;
  8262. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8263. ValueToCondition(result);
  8264. ELSIF type IS SyntaxTree.ProcedureType THEN
  8265. ReleaseIntermediateOperand(result.tag);
  8266. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8267. IF x.kind = SyntaxTree.VarParameter THEN
  8268. ReuseCopy(result.tag,result.op);
  8269. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8270. IntermediateCode.MakeMemory(result.tag,addressType);
  8271. ELSE
  8272. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8273. UseIntermediateOperand(result.tag);
  8274. END;
  8275. ELSE
  8276. result.tag := nil;
  8277. END;
  8278. (* tag for pointer type computed not here but during dereferencing *)
  8279. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) THEN
  8280. ReleaseIntermediateOperand(result.tag);
  8281. result.tag := basereg;
  8282. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8283. IntermediateCode.MakeMemory(result.tag,addressType);
  8284. UseIntermediateOperand(result.tag);
  8285. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind = SyntaxTree.ValueParameter) THEN
  8286. ReleaseIntermediateOperand(result.tag);
  8287. result.tag := TypeDescriptorAdr(type);
  8288. IF ~newObjectFile THEN
  8289. IntermediateCode.MakeMemory(result.tag,addressType);
  8290. END;
  8291. UseIntermediateOperand(result.tag);
  8292. END;
  8293. IF Trace THEN TraceExit("VisitParameter") END;
  8294. END VisitParameter;
  8295. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8296. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8297. BEGIN
  8298. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8299. (* left.p: left already emitted *)
  8300. tag := result.op; (* value of pointer to left *)
  8301. (* get type desc *)
  8302. tmp := result.tag;
  8303. IntermediateCode.MakeMemory(tmp,addressType);
  8304. (* get method adr *)
  8305. Reuse1(reg,tmp);
  8306. ReleaseIntermediateOperand(tmp);
  8307. IF backend.cooperative THEN
  8308. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8309. WHILE recordType.baseType # NIL DO
  8310. recordType := recordType.GetBaseRecord ();
  8311. END;
  8312. GetRecordTypeName (recordType,name);
  8313. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8314. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8315. offset := 0;
  8316. ELSE
  8317. offset := 2;
  8318. END;
  8319. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8320. ELSE
  8321. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8322. END;
  8323. InitOperand(operand,ModeReference);
  8324. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8325. operand.op := reg;
  8326. operand.tag := tag;
  8327. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8328. END DynamicCallOperand;
  8329. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8330. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8331. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8332. BEGIN
  8333. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8334. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8335. tag := operand.op;
  8336. ReleaseIntermediateOperand(operand.tag);
  8337. ELSE tag := nil
  8338. END;
  8339. IF x.isInline THEN
  8340. sectionType := Sections.InlineCodeSection;
  8341. ELSE
  8342. sectionType := Sections.CodeSection;
  8343. END;
  8344. IF x.externalName # NIL THEN
  8345. Basic.ToSegmentedName(x.externalName^, name);
  8346. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8347. ELSE
  8348. GetCodeSectionNameForSymbol(x, name);
  8349. IF (x.scope.ownerModule = module.module) THEN
  8350. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8351. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8352. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8353. IF source.pc = 0 THEN (* no code yet *)
  8354. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8355. END;
  8356. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8357. bits := x.procedureScope.body.code.inlineCode;
  8358. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8359. binary := BinaryCode.NewBinarySection(source.type, source.priority, system.codeUnit, name, FALSE, FALSE);
  8360. binary.CopyBits(bits, 0, bits.GetSize());
  8361. source.SetResolved(binary);
  8362. ELSE
  8363. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8364. END;
  8365. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8366. END;
  8367. InitOperand(operand,ModeValue);
  8368. operand.op := reg;
  8369. operand.tag := tag;
  8370. IF Trace THEN TraceExit("StaticCallOperand") END;
  8371. END StaticCallOperand;
  8372. PROCEDURE VisitProcedure(x: SyntaxTree.Procedure);
  8373. (* handle expressions of the form designator.procedure or procedure *)
  8374. BEGIN
  8375. IF Trace THEN TraceEnter("VisitProcedure") END;
  8376. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) THEN
  8377. DynamicCallOperand(result,x);
  8378. ELSIF x.isInline THEN
  8379. StaticCallOperand(result,x);
  8380. ELSE
  8381. StaticCallOperand(result,x);
  8382. END;
  8383. IF Trace THEN TraceExit("VisitProcedure") END;
  8384. END VisitProcedure;
  8385. PROCEDURE VisitOperator(x: SyntaxTree.Operator);
  8386. BEGIN
  8387. VisitProcedure(x);
  8388. END VisitOperator;
  8389. (** statements *)
  8390. PROCEDURE VisitProcedureCallStatement(x: SyntaxTree.ProcedureCallStatement);
  8391. BEGIN
  8392. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  8393. Expression(x.call);
  8394. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  8395. ReleaseOperand(result)
  8396. END;
  8397. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  8398. END VisitProcedureCallStatement;
  8399. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  8400. VAR leftType, rightType: SyntaxTree.MathArrayType;
  8401. leftBase, rightBase: SyntaxTree.Type;
  8402. procedureName,s: SyntaxTree.IdentifierString;
  8403. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  8404. size: LONGINT; rightKind: LONGINT;
  8405. dummy: IntermediateCode.Operand;
  8406. CONST moduleName = "FoxArrayBase";
  8407. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  8408. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  8409. BEGIN
  8410. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  8411. IF base IS SyntaxTree.MathArrayType THEN
  8412. base := OpenArray(base(SyntaxTree.MathArrayType));
  8413. END;
  8414. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  8415. result.SetArrayBase(base);
  8416. RETURN result
  8417. END OpenArray;
  8418. BEGIN
  8419. IF AddImport(moduleName,arrayBase,TRUE) THEN
  8420. SaveRegisters();ReleaseUsedRegisters(saved);
  8421. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  8422. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  8423. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  8424. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  8425. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  8426. IF leftType.form = SyntaxTree.Tensor THEN
  8427. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  8428. ELSIF leftType.form = SyntaxTree.Open THEN
  8429. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  8430. ELSIF leftType.form = SyntaxTree.Static THEN
  8431. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  8432. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  8433. END;
  8434. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  8435. IF procedure = NIL THEN
  8436. s := "Instruction not supported on target, emulation procedure ";
  8437. Strings.Append(s,moduleName);
  8438. Strings.Append(s,".");
  8439. Strings.Append(s,procedureName);
  8440. Strings.Append(s," not present");
  8441. Error(position,s);
  8442. ELSE
  8443. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  8444. parameter.SetType(leftType);
  8445. parameter.SetAccess(SyntaxTree.Internal);
  8446. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8447. parameter.SetKind(rightKind);
  8448. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8449. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  8450. Emit(Push(position,IntermediateCode.Immediate(int32,size)));
  8451. StaticCallOperand(result,procedure);
  8452. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  8453. ReleaseOperand(result);
  8454. END;
  8455. RestoreRegisters(saved);
  8456. END;
  8457. END AssignMathArray;
  8458. VAR modifyAssignmentCounter := 0: LONGINT;
  8459. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  8460. VAR processor,mem,dst,val: IntermediateCode.Operand;
  8461. BEGIN
  8462. IF value.intValue = true.intValue THEN
  8463. INC(modifyAssignmentCounter);
  8464. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  8465. modifyAssignmentsPC := section.pc;
  8466. ELSE
  8467. DEC(modifyAssignmentCounter);
  8468. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  8469. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  8470. END;
  8471. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  8472. dst := NewRegisterOperand (addressType);
  8473. Emit(Mov(position,dst, processor));
  8474. IntermediateCode.InitMemory(mem,bool, dst, 0);
  8475. Emit(Mov(position,mem, value));
  8476. ReleaseIntermediateOperand(dst);
  8477. END ModifyAssignments;
  8478. PROCEDURE CopySize(left: SyntaxTree.Expression): IntermediateCode.Operand;
  8479. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter;
  8480. BEGIN
  8481. type := left.type.resolved;
  8482. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  8483. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  8484. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  8485. IF procedureType.returnParameter = parameter THEN
  8486. RETURN IntermediateCode.Memory(addressType, fp, ToMemoryUnits(system, parameter.offsetInBits + system.addressSize));
  8487. END;
  8488. END;
  8489. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  8490. END CopySize;
  8491. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  8492. VAR
  8493. leftO, rightO: Operand;
  8494. mem, sizeOp: IntermediateCode.Operand;
  8495. leftType, rightType, componentType: SyntaxTree.Type;
  8496. size: LONGINT;
  8497. parameters: SyntaxTree.ExpressionList;
  8498. procedure: SyntaxTree.Procedure;
  8499. call: SyntaxTree.ProcedureCallDesignator;
  8500. designator: SyntaxTree.Designator;
  8501. isComposite: BOOLEAN;
  8502. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  8503. VAR procedureType: SyntaxTree.ProcedureType;
  8504. BEGIN
  8505. IF ReturnedAsParameter(right.type) THEN
  8506. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  8507. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  8508. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  8509. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  8510. WITH right: SyntaxTree.BuiltinCallDesignator DO
  8511. IF right.id = Global.Reshape THEN RETURN TRUE
  8512. END;
  8513. END;
  8514. END;
  8515. END;
  8516. RETURN FALSE
  8517. END CanPassAsResultParameter;
  8518. BEGIN
  8519. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  8520. leftType := left.type.resolved; rightType:= right.type.resolved;
  8521. IF backend.cooperative & left.NeedsTrace() THEN
  8522. ModifyAssignments(true);
  8523. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  8524. Designate(right, rightO);
  8525. Designate(left, leftO);
  8526. ASSERT(leftO.mode = ModeReference);
  8527. TransferToRegister(leftO.op, leftO.op);
  8528. TransferToRegister(rightO.op, rightO.op);
  8529. Emit(Push(position, leftO.op));
  8530. Emit(Push(position, rightO.op));
  8531. CallAssignMethod(leftO.op, rightO.op, left.type);
  8532. Emit(Pop(position, rightO.op));
  8533. Emit(Pop(position, leftO.op));
  8534. sizeOp := CopySize(left);
  8535. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8536. ReleaseOperand(leftO);
  8537. ReleaseOperand(rightO);
  8538. ELSE
  8539. Evaluate(right,rightO);
  8540. Designate(left,leftO);
  8541. ASSERT(leftO.mode = ModeReference);
  8542. IF (leftType IS SyntaxTree.ProcedureType) THEN
  8543. (* copy procedure address first *)
  8544. MakeMemory(mem,leftO.op,addressType,0);
  8545. Emit(Mov(position,mem,rightO.op));
  8546. ReleaseIntermediateOperand(mem);
  8547. (* copy pointer address *)
  8548. IntermediateCode.MakeAddress(leftO.tag, addressType);
  8549. CallAssignPointer(leftO.tag, rightO.tag);
  8550. ELSE
  8551. ASSERT(system.SizeOf(left.type) = system.addressSize);
  8552. CallAssignPointer(leftO.op, rightO.op);
  8553. END;
  8554. ReleaseOperand(leftO);
  8555. ReleaseOperand(rightO);
  8556. END;
  8557. ModifyAssignments(false);
  8558. RETURN;
  8559. END;
  8560. IF CanPassAsResultParameter(right) THEN
  8561. procedureResultDesignator := left(SyntaxTree.Designator);
  8562. Expression(right);
  8563. procedureResultDesignator := NIL;
  8564. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  8565. (* left <-- ALIAS OF right: zerocopy *)
  8566. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  8567. designator := SyntaxTree.NewSymbolDesignator(Diagnostics.Invalid, NIL, procedure);
  8568. designator.SetType(procedure.type);
  8569. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  8570. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  8571. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8572. END;
  8573. ELSIF leftType IS SyntaxTree.RangeType THEN
  8574. (* LHS is of array range type *)
  8575. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  8576. Evaluate(right, rightO);
  8577. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  8578. (* first *)
  8579. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 0);
  8580. Emit(Mov(position,mem, rightO.op));
  8581. ReleaseIntermediateOperand(mem);
  8582. (* last *)
  8583. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8584. Emit(Mov(position,mem, rightO.tag));
  8585. ReleaseIntermediateOperand(mem);
  8586. (* step *)
  8587. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  8588. Emit(Mov(position,mem, rightO.extra));
  8589. ReleaseIntermediateOperand(mem);
  8590. ReleaseOperand(rightO);
  8591. ReleaseOperand(leftO)
  8592. ELSIF leftType IS SyntaxTree.ComplexType THEN
  8593. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  8594. Evaluate(right, rightO);
  8595. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  8596. componentType := leftType(SyntaxTree.ComplexType).componentType;
  8597. (* real part *)
  8598. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  8599. Emit(Mov(position,mem, rightO.op));
  8600. ReleaseIntermediateOperand(mem);
  8601. (* imaginary part *)
  8602. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8603. Emit(Mov(position,mem, rightO.tag));
  8604. ReleaseIntermediateOperand(mem);
  8605. ReleaseOperand(rightO);
  8606. ReleaseOperand(leftO)
  8607. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  8608. OR (leftType IS SyntaxTree.PortType) THEN
  8609. (* rightO := leftO;*)
  8610. Evaluate(right,rightO);
  8611. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  8612. Designate(left,leftO);
  8613. IF leftO.mode = ModeReference THEN
  8614. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  8615. destination := mem;
  8616. ELSE
  8617. destination := leftO.op;
  8618. END;
  8619. ReleaseOperand(leftO);
  8620. IF destination.mode # IntermediateCode.Undefined THEN
  8621. Emit(Mov(position,destination,rightO.op));
  8622. END;
  8623. ReleaseOperand(rightO);
  8624. ReleaseIntermediateOperand(mem);
  8625. IntermediateCode.InitOperand(destination);
  8626. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  8627. Evaluate(right,rightO);
  8628. Designate(left,leftO);
  8629. MakeMemory(mem,leftO.op,addressType,0);
  8630. Emit(Mov(position,mem,rightO.op));
  8631. ReleaseIntermediateOperand(mem);
  8632. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  8633. (* delegate *)
  8634. (*
  8635. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  8636. *)
  8637. Emit(Mov(position,leftO.tag,rightO.tag));
  8638. END;
  8639. ReleaseOperand(leftO);
  8640. ReleaseOperand(rightO);
  8641. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  8642. Designate(right,rightO);
  8643. Designate(left,leftO);
  8644. sizeOp := CopySize(left);
  8645. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  8646. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8647. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  8648. IF (rightType IS SyntaxTree.StringType) THEN
  8649. CopyString(left,right);
  8650. 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
  8651. Designate(right,rightO);
  8652. Designate(left,leftO);
  8653. size := ToMemoryUnits(system,system.SizeOf(rightType));
  8654. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  8655. ReleaseOperand(leftO); ReleaseOperand(rightO);
  8656. ELSE
  8657. HALT(201)
  8658. END;
  8659. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  8660. AssignMathArray(left,right);
  8661. ELSE
  8662. HALT(200);
  8663. END;
  8664. END Assign;
  8665. PROCEDURE VisitAssignment(x: SyntaxTree.Assignment);
  8666. BEGIN
  8667. IF Trace THEN TraceEnter("VisitAssignment") END;
  8668. Assign(x.left,x.right);
  8669. IF Trace THEN TraceExit("VisitAssignment") END;
  8670. END VisitAssignment;
  8671. PROCEDURE EmitCooperativeSwitch;
  8672. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  8673. BEGIN
  8674. ASSERT (cooperativeSwitches);
  8675. pc := section.pc;
  8676. IF lastSwitchPC = section.pc THEN RETURN END;
  8677. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  8678. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  8679. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  8680. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  8681. INC(statCoopSwitch, section.pc - pc);
  8682. END EmitCooperativeSwitch;
  8683. PROCEDURE VisitCommunicationStatement(communication: SyntaxTree.CommunicationStatement);
  8684. VAR p0,p1: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  8685. constructor: SyntaxTree.Procedure; s0,s1: Operand; hint: HUGEINT; size: LONGINT;
  8686. BEGIN
  8687. p0 := communication.left; p1 := communication.right;
  8688. IF communication.send THEN
  8689. Evaluate(p0,s0);
  8690. Evaluate(p1,s1);
  8691. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8692. Emit(Push(position,s0.op));
  8693. Emit(Push(position,s1.op));
  8694. (*
  8695. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8696. *)
  8697. IF ~backend.cellsAreObjects THEN
  8698. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  8699. END;
  8700. ReleaseOperand(s0);
  8701. ReleaseOperand(s1);
  8702. IF backend.cellsAreObjects THEN
  8703. CallThis(position,"ActiveCellsRuntime","Send",2);
  8704. ELSE
  8705. CallThis(position,ChannelModuleName,"Send",2);
  8706. END;
  8707. (* ----- RECEIVE ------*)
  8708. ELSE
  8709. Evaluate(p0,s0);
  8710. Emit(Push(position,s0.op));
  8711. Designate(p1,s1);
  8712. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8713. Emit(Push(position,s1.op));
  8714. (*
  8715. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8716. *)
  8717. IF ~backend.cellsAreObjects THEN
  8718. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  8719. END;
  8720. ReleaseOperand(s0);
  8721. ReleaseOperand(s1);
  8722. IF backend.cellsAreObjects THEN
  8723. CallThis(position,"ActiveCellsRuntime","Receive",2);
  8724. ELSE
  8725. CallThis(position,ChannelModuleName,"Receive",2)
  8726. END;
  8727. END;
  8728. END VisitCommunicationStatement;
  8729. PROCEDURE VisitIfStatement(x: SyntaxTree.IfStatement);
  8730. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  8731. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  8732. VAR true, false: Label; condition, value: BOOLEAN;
  8733. BEGIN
  8734. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  8735. IF condition THEN
  8736. true := NewLabel();
  8737. false := NewLabel();
  8738. Condition(if.condition,true,false);
  8739. SetLabel(true);
  8740. StatementSequence(if.statements);
  8741. BrL(end);
  8742. SetLabel(false);
  8743. ELSE
  8744. IF value THEN (* always true *)
  8745. escape := TRUE;
  8746. StatementSequence(if.statements);
  8747. (* no branch necessary -- rest skipped *)
  8748. END;
  8749. END;
  8750. END IfPart;
  8751. BEGIN
  8752. IF Trace THEN TraceEnter("VisitIfStatement") END;
  8753. end := NewLabel();
  8754. elsifs := x.ElsifParts();
  8755. IfPart(x.ifPart);
  8756. FOR i := 0 TO elsifs-1 DO
  8757. IF ~escape THEN
  8758. elsif := x.GetElsifPart(i);
  8759. IfPart(elsif);
  8760. END;
  8761. END;
  8762. IF (x.elsePart # NIL) & ~escape THEN
  8763. StatementSequence(x.elsePart);
  8764. END;
  8765. SetLabel(end);
  8766. IF Trace THEN TraceExit("VisitIfStatement") END;
  8767. END VisitIfStatement;
  8768. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  8769. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  8770. BEGIN
  8771. (*IF x.variable.type.resolved = x.type.resolved THEN
  8772. (* always true, do nothing *)
  8773. ELSE*)
  8774. Designate(x.variable,res);
  8775. IF IsPointerToRecord(x.variable.type,recordType) THEN
  8776. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  8777. END;
  8778. trueL := NewLabel();
  8779. TypeTest(res.tag,x.type,trueL,falseL);
  8780. ReleaseOperand(res);
  8781. SetLabel(trueL);
  8782. StatementSequence(x.statements);
  8783. BrL(endL);
  8784. END WithPart;
  8785. PROCEDURE VisitWithStatement(x: SyntaxTree.WithStatement);
  8786. VAR endL,falseL: Label;i: LONGINT;
  8787. BEGIN
  8788. IF Trace THEN TraceEnter("VisitWithStatement") END;
  8789. endL := NewLabel();
  8790. FOR i := 0 TO x.WithParts()-1 DO
  8791. falseL := NewLabel();
  8792. WithPart(x.GetWithPart(i),falseL,endL);
  8793. SetLabel(falseL);
  8794. END;
  8795. IF x.elsePart = NIL THEN
  8796. IF ~isUnchecked THEN
  8797. EmitTrap(position,WithTrap);
  8798. END;
  8799. ELSE
  8800. StatementSequence(x.elsePart)
  8801. END;
  8802. SetLabel(endL);
  8803. IF Trace THEN TraceExit("VisitWithStatement") END;
  8804. END VisitWithStatement;
  8805. PROCEDURE VisitCaseStatement(x: SyntaxTree.CaseStatement);
  8806. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  8807. out,else: Label; label: Label;
  8808. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  8809. symbol: SyntaxTree.Symbol;
  8810. BEGIN
  8811. (*! split case statement into if-elsif statements for large case label lists *)
  8812. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  8813. size := x.max-x.min+1;
  8814. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  8815. END;
  8816. Evaluate(x.variable,var);
  8817. ReuseCopy(tmp,var.op);
  8818. ReleaseIntermediateOperand(var.op);
  8819. var.op := tmp;
  8820. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  8821. Convert(var.op,addressType);
  8822. size := x.max-x.min+1;
  8823. else := NewLabel();
  8824. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  8825. (*
  8826. UniqueId(name,module.module,"case",caseId);
  8827. *)
  8828. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  8829. Global.GetModuleSegmentedName(module.module, name);
  8830. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  8831. symbol := SyntaxTree.NewSymbol(name[1]);
  8832. symbol.SetScope(moduleScope);
  8833. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  8834. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  8835. section.isCaseTable := TRUE;
  8836. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  8837. ReuseCopy(res,var.op);
  8838. ReleaseOperand(var);
  8839. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  8840. Emit(Add(position,res,res,jmp));
  8841. IntermediateCode.MakeMemory(res,addressType);
  8842. Emit(Br(position,res));
  8843. ReleaseIntermediateOperand(res);
  8844. out := NewLabel();
  8845. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  8846. part := x.GetCasePart(i);
  8847. constant := part.firstConstant;
  8848. label := NewLabel();
  8849. SetLabel(label);
  8850. WHILE(constant # NIL) DO (* case labels for this case part *)
  8851. FOR j := constant.min TO constant.max DO
  8852. fixups[j-x.min] := label;
  8853. END;
  8854. constant := constant.next;
  8855. END;
  8856. StatementSequence(part.statements);
  8857. BrL(out);
  8858. END;
  8859. SetLabel(else);
  8860. FOR i := 0 TO size-1 DO
  8861. IF fixups[i] = NIL THEN
  8862. fixups[i] := else;
  8863. END;
  8864. END;
  8865. IF x.elsePart # NIL THEN
  8866. StatementSequence(x.elsePart);
  8867. ELSIF ~isUnchecked THEN
  8868. EmitTrap(position,CaseTrap);
  8869. END;
  8870. SetLabel(out);
  8871. FOR i := 0 TO size-1 DO
  8872. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  8873. section.Emit(Data(position,op));
  8874. END;
  8875. IF Trace THEN TraceExit("VisitCaseStatement") END;
  8876. END VisitCaseStatement;
  8877. PROCEDURE VisitWhileStatement(x: SyntaxTree.WhileStatement);
  8878. VAR start: Label; true,false: Label;
  8879. BEGIN
  8880. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  8881. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8882. start := NewLabel();
  8883. true := NewLabel();
  8884. false := NewLabel();
  8885. SetLabel(start);
  8886. Condition(x.condition,true,false);
  8887. SetLabel(true);
  8888. StatementSequence(x.statements);
  8889. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8890. BrL(start);
  8891. SetLabel(false);
  8892. IF Trace THEN TraceExit("VisitWhileStatement") END;
  8893. END VisitWhileStatement;
  8894. PROCEDURE VisitRepeatStatement(x: SyntaxTree.RepeatStatement);
  8895. VAR false,true: Label;
  8896. BEGIN
  8897. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  8898. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8899. true := NewLabel();
  8900. false := NewLabel();
  8901. SetLabel(false);
  8902. StatementSequence(x.statements);
  8903. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8904. Condition(x.condition,true,false);
  8905. SetLabel(true);
  8906. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  8907. END VisitRepeatStatement;
  8908. PROCEDURE VisitForStatement(x: SyntaxTree.ForStatement);
  8909. VAR
  8910. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  8911. temporaryVariable: SyntaxTree.Variable;
  8912. temporaryVariableDesignator : SyntaxTree.Designator;
  8913. BEGIN
  8914. IF Trace THEN TraceEnter("VisitForStatement") END;
  8915. true := NewLabel();
  8916. false := NewLabel();
  8917. start := NewLabel();
  8918. Assign(x.variable,x.from);
  8919. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE);
  8920. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(SemanticChecker.InvalidPosition, NIL, temporaryVariable);
  8921. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  8922. Assign(temporaryVariableDesignator,x.to);
  8923. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  8924. IF by > 0 THEN
  8925. cmp := Scanner.LessEqual
  8926. ELSE
  8927. cmp := Scanner.GreaterEqual
  8928. END;
  8929. binary := SyntaxTree.NewBinaryExpression(0,x.variable,temporaryVariableDesignator,cmp);
  8930. binary.SetType(system.booleanType);
  8931. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8932. SetLabel(start);
  8933. Condition(binary,true,false);
  8934. SetLabel(true);
  8935. StatementSequence(x.statements);
  8936. binary := SyntaxTree.NewBinaryExpression(0,x.variable,x.by,Scanner.Plus);
  8937. binary.SetType(x.variable.type);
  8938. Assign(x.variable,binary);
  8939. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8940. BrL(start);
  8941. SetLabel(false);
  8942. IF Trace THEN TraceExit("VisitForStatement") END;
  8943. END VisitForStatement;
  8944. PROCEDURE VisitExitableBlock(x: SyntaxTree.ExitableBlock);
  8945. VAR prevLoop: Label;
  8946. BEGIN
  8947. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  8948. prevLoop := currentLoop;
  8949. currentLoop := NewLabel();
  8950. StatementSequence(x.statements);
  8951. SetLabel(currentLoop);
  8952. currentLoop := prevLoop;
  8953. IF Trace THEN TraceExit("VisitExitableBlock") END;
  8954. END VisitExitableBlock;
  8955. PROCEDURE VisitLoopStatement(x: SyntaxTree.LoopStatement);
  8956. VAR prevLoop,start: Label;
  8957. BEGIN
  8958. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  8959. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8960. start := NewLabel();
  8961. prevLoop := currentLoop;
  8962. SetLabel(start);
  8963. currentLoop := NewLabel();
  8964. StatementSequence(x.statements);
  8965. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  8966. BrL(start);
  8967. SetLabel(currentLoop);
  8968. currentLoop := prevLoop;
  8969. IF Trace THEN TraceExit("VisitLoopStatement") END;
  8970. END VisitLoopStatement;
  8971. PROCEDURE VisitExitStatement(x: SyntaxTree.ExitStatement);
  8972. VAR outer: SyntaxTree.Statement;
  8973. BEGIN
  8974. IF Trace THEN TraceEnter("VisitExitStatement") END;
  8975. IF locked THEN (* r if we jump out of an exclusive block *)
  8976. outer := x.outer;
  8977. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  8978. outer := outer.outer;
  8979. END;
  8980. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  8981. Lock(FALSE);
  8982. END;
  8983. END;
  8984. BrL(currentLoop);
  8985. IF Trace THEN TraceExit("VisitExitStatement") END;
  8986. END VisitExitStatement;
  8987. PROCEDURE VisitReturnStatement(x: SyntaxTree.ReturnStatement);
  8988. VAR
  8989. expression, parameterDesignator: SyntaxTree.Expression;
  8990. type, componentType: SyntaxTree.Type;
  8991. res, right: Operand;
  8992. left, size, mem, reg: IntermediateCode.Operand;
  8993. parameter: SyntaxTree.Parameter;
  8994. procedure: SyntaxTree.Procedure;
  8995. procedureType: SyntaxTree.ProcedureType;
  8996. returnTypeOffset: LONGINT;
  8997. delegate: BOOLEAN;
  8998. map: SymbolMap;
  8999. BEGIN
  9000. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9001. expression := x.returnValue;
  9002. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9003. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9004. IF currentIsInline THEN
  9005. IF expression # NIL THEN
  9006. map := currentMapper.Get(NIL);
  9007. IF map # NIL THEN
  9008. Assign(map.to, expression);
  9009. END;
  9010. END;
  9011. BrL(currentInlineExit);
  9012. RETURN;
  9013. END;
  9014. IF expression # NIL THEN
  9015. type := expression.type.resolved;
  9016. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9017. IF locked THEN Lock(FALSE) END;
  9018. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9019. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9020. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9021. (* return without structured return parameter *)
  9022. Evaluate(expression,res);
  9023. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9024. IF locked OR profile THEN
  9025. Emit(Push(position,res.op));
  9026. IF delegate THEN HALT(200) END;
  9027. ReleaseOperand(res);
  9028. IF locked THEN Lock(FALSE) END;
  9029. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9030. reg := NewRegisterOperand(res.op.type);
  9031. Emit(Pop(position,reg));
  9032. Emit(Return(position,reg));
  9033. ReleaseIntermediateOperand(reg);
  9034. ELSE
  9035. Emit(Return(position,res.op));
  9036. ReleaseOperand(res);
  9037. END;
  9038. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9039. THEN
  9040. (* return using structured return parameter *)
  9041. 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)
  9042. OR SemanticChecker.IsPointerType(type));
  9043. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9044. parameter :=procedureType.returnParameter;
  9045. ASSERT(parameter # NIL);
  9046. returnTypeOffset := parameter.offsetInBits;
  9047. (*
  9048. IF parameter# NIL THEN
  9049. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9050. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9051. ELSE
  9052. returnTypeOffset := system.offsetFirstParameter
  9053. END;
  9054. *)
  9055. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9056. IF type IS SyntaxTree.RangeType THEN
  9057. (* array range type *)
  9058. Evaluate(expression, right);
  9059. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 0);
  9060. Emit(Mov(position,mem, right.op)); (* first *)
  9061. ReleaseIntermediateOperand(mem);
  9062. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9063. Emit(Mov(position,mem, right.tag)); (* last *)
  9064. ReleaseIntermediateOperand(mem);
  9065. MakeMemory(mem, left, IntermediateCode.GetType(system, system.longintType), 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)));
  9066. Emit(Mov(position,mem, right.extra)); (* step *)
  9067. ReleaseIntermediateOperand(mem);
  9068. ReleaseOperand(right);
  9069. ELSIF type IS SyntaxTree.ComplexType THEN
  9070. Evaluate(expression, right);
  9071. componentType := type(SyntaxTree.ComplexType).componentType;
  9072. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9073. Emit(Mov(position,mem, right.op)); (* real part *)
  9074. ReleaseIntermediateOperand(mem);
  9075. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9076. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9077. ReleaseIntermediateOperand(mem);
  9078. ReleaseOperand(right);
  9079. ELSE (* covers cases: pointer / record / array *)
  9080. parameter := procedureType.returnParameter;
  9081. checker.SetCurrentScope(currentScope);
  9082. ASSERT(parameter # NIL);
  9083. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9084. Assign(parameterDesignator,expression);
  9085. END;
  9086. ReleaseIntermediateOperand(left);
  9087. IF locked THEN Lock(FALSE) END;
  9088. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9089. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9090. parameter := procedureType.returnParameter;
  9091. checker.SetCurrentScope(currentScope);
  9092. IF parameter = NIL THEN
  9093. Error(procedure.position, "structured return of parameter of procedure not found");
  9094. ELSE
  9095. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9096. Assign(parameterDesignator,expression);
  9097. END;
  9098. IF locked THEN Lock(FALSE) END;
  9099. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9100. ELSE
  9101. HALT(200);
  9102. END;
  9103. ELSE
  9104. IF locked THEN Lock(FALSE) END;
  9105. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9106. END;
  9107. IF backend.cooperative THEN
  9108. BrL(exitLabel);
  9109. ELSE
  9110. Emit(Leave(position,procedure,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9111. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention));
  9112. END;
  9113. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9114. END VisitReturnStatement;
  9115. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9116. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9117. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9118. statements: SyntaxTree.StatementSequence;
  9119. name, suffix: SyntaxTree.IdentifierString;
  9120. BEGIN
  9121. Strings.IntToStr(awaitProcCounter,suffix);
  9122. Strings.Concat("@AwaitProcedure",suffix,name);
  9123. identifier := SyntaxTree.NewIdentifier(name);
  9124. INC(awaitProcCounter);
  9125. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9126. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9127. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9128. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9129. procedure.SetAccess(SyntaxTree.Hidden);
  9130. procedure.SetScope(currentScope);
  9131. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9132. procedureType.SetReturnType(system.booleanType);
  9133. procedure.SetType(procedureType);
  9134. body := SyntaxTree.NewBody(x.position,procedureScope);
  9135. procedureScope.SetBody(body);
  9136. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9137. returnStatement.SetReturnValue(x.condition);
  9138. statements := SyntaxTree.NewStatementSequence();
  9139. statements.AddStatement(returnStatement);
  9140. body.SetStatementSequence(statements);
  9141. currentScope.AddProcedure(procedure);
  9142. RETURN procedure
  9143. END MakeAwaitProcedure;
  9144. PROCEDURE VisitAwaitStatement(x: SyntaxTree.AwaitStatement);
  9145. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9146. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9147. BEGIN
  9148. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9149. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9150. IF backend.cooperative THEN
  9151. start := NewLabel();
  9152. true := NewLabel();
  9153. false := NewLabel();
  9154. SetLabel(start);
  9155. Condition(x.condition,true,false);
  9156. SetLabel(false);
  9157. PushSelfPointer();
  9158. CallThis(position,"ExclusiveBlocks","Await",1);
  9159. BrL(start);
  9160. SetLabel(true);
  9161. PushSelfPointer();
  9162. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9163. ELSE
  9164. proc := MakeAwaitProcedure(x);
  9165. Emit(Push(position,fp));
  9166. GetCodeSectionNameForSymbol(proc,name);
  9167. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9168. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9169. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9170. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9171. Emit(Result(position,res));
  9172. (*
  9173. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9174. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9175. *)
  9176. InitOperand(result,ModeValue);
  9177. result.op := res;
  9178. label := NewLabel();
  9179. BreqL(label, result.op, SELF.true);
  9180. ReleaseOperand(result);
  9181. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9182. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9183. Emit(Push(position,res));
  9184. Emit(Push(position,fp));
  9185. PushSelfPointer();
  9186. Emit(Push(position,nil));
  9187. CallThis(position,"Objects","Await",4);
  9188. SetLabel(label);
  9189. END;
  9190. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9191. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9192. END VisitAwaitStatement;
  9193. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9194. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9195. BEGIN
  9196. FOR i := 0 TO x.Length() - 1 DO
  9197. statement := x.GetStatement( i );
  9198. Statement(statement);
  9199. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9200. END;
  9201. END StatementSequence;
  9202. PROCEDURE PushSelfPointer;
  9203. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  9204. BEGIN
  9205. scope := currentScope;
  9206. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9207. scope := scope.outerScope;
  9208. END;
  9209. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9210. IF ~newObjectFile THEN
  9211. Symbol(moduleSelf,op);
  9212. IntermediateCode.MakeMemory(op.op,addressType);
  9213. ELSE
  9214. moduleSection := meta.ModuleSection();
  9215. IF backend.cooperative THEN
  9216. moduleOffset := 0;
  9217. ELSE
  9218. moduleOffset := moduleSection.pc;
  9219. END;
  9220. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9221. END;
  9222. ELSE
  9223. GetBaseRegister(op.op,currentScope,scope);
  9224. parametersSize := ProcedureParametersSize(system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  9225. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)+parametersSize);
  9226. IF backend.cooperative THEN
  9227. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9228. END;
  9229. IntermediateCode.MakeMemory(op.op,addressType);
  9230. END;
  9231. Emit(Push(position,op.op));
  9232. ReleaseOperand(op);
  9233. END PushSelfPointer;
  9234. PROCEDURE Lock(lock: BOOLEAN);
  9235. BEGIN
  9236. IF Trace THEN TraceEnter("Lock") END;
  9237. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9238. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9239. ASSERT(modifyAssignmentCounter = 0);
  9240. IF dump # NIL THEN
  9241. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9242. dump.Ln;dump.Update;
  9243. END;
  9244. PushSelfPointer;
  9245. IF backend.cooperative THEN
  9246. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9247. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9248. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9249. END;
  9250. ELSE
  9251. Emit(Push(position,true));
  9252. IF lock THEN CallThis(position,"Objects","Lock",2)
  9253. ELSE CallThis(position,"Objects","Unlock",2);
  9254. END;
  9255. END;
  9256. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9257. IF Trace THEN TraceExit("Lock") END;
  9258. END Lock;
  9259. PROCEDURE VisitStatementBlock(x: SyntaxTree.StatementBlock);
  9260. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9261. BEGIN
  9262. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9263. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9264. previouslyUnchecked := isUnchecked;
  9265. isUnchecked := isUnchecked OR x.isUnchecked;
  9266. previouslyCooperativeSwitches := cooperativeSwitches;
  9267. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9268. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9269. IF x.statements # NIL THEN
  9270. StatementSequence(x.statements);
  9271. END;
  9272. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  9273. isUnchecked := previouslyUnchecked;
  9274. cooperativeSwitches := previouslyCooperativeSwitches;
  9275. IF Trace THEN TraceExit("VisitStatementBlock") END;
  9276. END VisitStatementBlock;
  9277. PROCEDURE VisitCode(x: SyntaxTree.Code);
  9278. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  9279. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  9280. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  9281. procedure: SyntaxTree.Procedure;
  9282. map: SymbolMap;
  9283. BEGIN
  9284. scope := currentScope;
  9285. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  9286. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9287. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9288. return := emptyOperand;
  9289. IF Trace THEN TraceEnter("VisitCode") END;
  9290. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  9291. NEW(in, x.inRules.Length());
  9292. FOR i := 0 TO LEN(in)-1 DO
  9293. statement := x.inRules.GetStatement(i);
  9294. WITH statement: SyntaxTree.Assignment DO
  9295. Evaluate(statement.right, operand);
  9296. result := operand.op;
  9297. NEW(str, 64);
  9298. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  9299. in[i] := result; IntermediateCode.SetString(in[i], str);
  9300. ReleaseIntermediateOperand(operand.tag);
  9301. END;
  9302. END;
  9303. ELSE in := NIL
  9304. END;
  9305. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  9306. NEW(out, x.outRules.Length());
  9307. FOR i := 0 TO LEN(out)-1 DO
  9308. statement := x.outRules.GetStatement(i);
  9309. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  9310. WITH statement: SyntaxTree.Assignment DO
  9311. Evaluate(statement.left, operand); (*?? or designate *)
  9312. result := operand.op;
  9313. NEW(str, 64);
  9314. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  9315. out[i] := result; IntermediateCode.SetString(out[i], str);
  9316. ReleaseIntermediateOperand(operand.tag);
  9317. |statement: SyntaxTree.ReturnStatement DO
  9318. NEW(str, 64);
  9319. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  9320. IF currentIsInline THEN
  9321. map := currentMapper.Get(NIL);
  9322. Evaluate(map.to, operand);
  9323. out[i] := operand.op;
  9324. ELSE
  9325. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  9326. END;
  9327. IntermediateCode.SetString(out[i], str);
  9328. ReleaseIntermediateOperand(operand.tag);
  9329. return := out[i];
  9330. ELSE
  9331. END;
  9332. END;
  9333. ELSE out := NIL
  9334. END;
  9335. Emit(Asm(x.position,x.sourceCode, in, out));
  9336. IF in # NIL THEN
  9337. FOR i := 0 TO LEN(in)-1 DO
  9338. ReleaseIntermediateOperand(in[i]);
  9339. END;
  9340. END;
  9341. IF out # NIL THEN
  9342. FOR i := 0 TO LEN(out)-1 DO
  9343. WITH statement: SyntaxTree.Assignment DO
  9344. ReleaseIntermediateOperand(out[i]);
  9345. ELSE
  9346. IF currentIsInline THEN
  9347. ReleaseIntermediateOperand(out[i]);
  9348. END;
  9349. END;
  9350. statement := x.outRules.GetStatement(i);
  9351. END;
  9352. END;
  9353. IF return.mode # IntermediateCode.Undefined THEN
  9354. IF currentIsInline THEN
  9355. ELSIF ReturnedAsParameter(procedureType.returnType) THEN
  9356. Symbol(procedureType.returnParameter, par);
  9357. MakeMemory(mem, par.op, return.type, 0);
  9358. ReleaseOperand(par);
  9359. Emit(Mov(position, mem, return));
  9360. ReleaseIntermediateOperand(mem);
  9361. ELSE
  9362. Emit(Return(position,return));
  9363. END;
  9364. IF currentIsInline THEN RETURN END;
  9365. Emit(Leave(position,procedure,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9366. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,procedureType(SyntaxTree.ProcedureType).callingConvention));
  9367. ReleaseIntermediateOperand(return);
  9368. END;
  9369. IF Trace THEN TraceExit("VisitCode") END;
  9370. END VisitCode;
  9371. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  9372. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  9373. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  9374. const, call: IntermediateCode.Operand;
  9375. parameterDesignator: SyntaxTree.Expression;
  9376. saved: RegisterEntry;
  9377. name: Basic.SegmentedName;
  9378. BEGIN
  9379. IF Trace THEN TraceEnter("ParameterCopies") END;
  9380. parameter := x.firstParameter;
  9381. WHILE parameter # NIL DO
  9382. IF parameter.kind = SyntaxTree.ValueParameter THEN
  9383. type := parameter.type.resolved;
  9384. IF IsOpenArray(type) THEN
  9385. VisitParameter(parameter);
  9386. op := result;
  9387. IF backend.cooperative & parameter.NeedsTrace() THEN
  9388. length := GetArrayLength(type, op.tag);
  9389. size := NewRegisterOperand(addressType);
  9390. base := ArrayBaseType(type);
  9391. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  9392. Emit(Mul(position, size, length, const));
  9393. dst := NewRegisterOperand (addressType);
  9394. Emit(Mov(position, dst, size));
  9395. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9396. Emit(Sub(position,dst,sp,dst));
  9397. Emit(And(position,dst,dst,const));
  9398. Emit(Mov(position,sp,dst));
  9399. par := fp;
  9400. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9401. IntermediateCode.InitImmediate(null, byteType, 0);
  9402. Emit(Fill(position, dst, size, null));
  9403. ReleaseIntermediateOperand(dst);
  9404. ReleaseIntermediateOperand(length);
  9405. SaveRegisters();ReleaseUsedRegisters(saved);
  9406. (* register dst has been freed before SaveRegisters already *)
  9407. base := ArrayBaseType(type);
  9408. (* assign method of open array *)
  9409. IF base.IsRecordType() THEN
  9410. Emit (Push(position, length));
  9411. Emit (Push(position, dst));
  9412. Emit (Push(position, op.op));
  9413. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  9414. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  9415. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  9416. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  9417. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  9418. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  9419. Emit (Push(position,length));
  9420. Emit (Push(position, dst));
  9421. Emit (Push(position, length));
  9422. Emit (Push(position, op.op));
  9423. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  9424. ELSE
  9425. Emit (Push(position, length));
  9426. Emit (Push(position, dst));
  9427. Emit (Push(position, length));
  9428. Emit (Push(position, op.op));
  9429. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  9430. ASSERT(ArrayBaseType(type).IsPointer());
  9431. END;
  9432. RestoreRegisters(saved);
  9433. ELSE
  9434. temp := GetDynamicSize(type,op.tag);
  9435. ReuseCopy(size,temp);
  9436. ReleaseIntermediateOperand(temp);
  9437. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  9438. Emit(Sub(position,size,sp,size));
  9439. Emit(And(position,size,size,const));
  9440. Emit(Mov(position,sp,size));
  9441. par := fp;
  9442. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  9443. ReleaseIntermediateOperand(size);
  9444. size := GetDynamicSize(type,op.tag);
  9445. END;
  9446. Emit(Copy(position,sp,op.op,size));
  9447. ReleaseIntermediateOperand(size);
  9448. ReleaseOperand(op);
  9449. IntermediateCode.MakeMemory(par,addressType);
  9450. Emit(Mov(position,par,sp));
  9451. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  9452. checker.SetCurrentScope(currentScope);
  9453. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  9454. Assign(parameterDesignator,parameterDesignator);
  9455. END;
  9456. END;
  9457. parameter := parameter.nextParameter;
  9458. END;
  9459. IF Trace THEN TraceExit("ParameterCopies") END;
  9460. END ParameterCopies;
  9461. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  9462. VAR x: SyntaxTree.Variable;
  9463. BEGIN
  9464. x := scope.firstVariable;
  9465. WHILE x # NIL DO
  9466. InitVariable(x);
  9467. x := x.nextVariable;
  9468. END;
  9469. END InitVariables;
  9470. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  9471. BEGIN
  9472. IF (symbol # NIL) THEN
  9473. RETURN fingerPrinter.SymbolFP(symbol).shallow
  9474. ELSE
  9475. RETURN 0
  9476. END;
  9477. END GetFingerprint;
  9478. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  9479. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  9480. end: Label;res: IntermediateCode.Operand; cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  9481. saved: RegisterEntry;
  9482. BEGIN
  9483. IF Trace THEN TraceEnter("Body") END;
  9484. ReleaseUsedRegisters(saved); (* just in case ... *)
  9485. section := ir;
  9486. exitLabel := NewLabel ();
  9487. IF moduleBody THEN moduleBodySection := section END;
  9488. IF ir.comments # NIL THEN
  9489. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  9490. commentPrintout.SingleStatement(TRUE);
  9491. dump := ir.comments;
  9492. ELSE
  9493. commentPrintout := NIL;
  9494. dump := NIL;
  9495. END;
  9496. registerUsageCount.Init;
  9497. prevScope := currentScope;
  9498. currentScope := scope;
  9499. lastSwitchPC := 0;
  9500. cooperativeSwitches := backend.cooperative;
  9501. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9502. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9503. IF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple & ~backend.cooperative THEN
  9504. (*
  9505. PushSelfPointer();
  9506. (*
  9507. moduleSection := ModuleSection(module);
  9508. moduleOffset := moduleSection.pc;
  9509. op := IntermediateCode.Address(addressType, moduleSection, moduleOffset);
  9510. Emit(Push(position,op));
  9511. *)
  9512. res := NewRegisterOperand(bool);
  9513. CallThis2("Modules","PublishThis","Runtime","InsertModule",1,res);
  9514. end := NewLabel();
  9515. (*AcquireThisRegister(bool, IntermediateCode.Result);*)
  9516. BrneL(end, res,true);
  9517. ReleaseIntermediateOperand(res);
  9518. *)
  9519. END;
  9520. IF x # NIL THEN
  9521. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9522. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  9523. IF moduleBody THEN
  9524. ProfilerInit();
  9525. ELSE
  9526. Basic.SegmentedNameToString(ir.name, string);
  9527. ProfilerAddProcedure(numberProcedures,string);
  9528. ProfilerEnterExit(numberProcedures,TRUE);
  9529. END;
  9530. END;
  9531. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  9532. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  9533. END;
  9534. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  9535. IF moduleBody THEN
  9536. InitVariables(moduleScope)
  9537. END;
  9538. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  9539. cellScope := scope.outerScope(SyntaxTree.CellScope);
  9540. IF procedure = cellScope.bodyProcedure THEN
  9541. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  9542. StaticCallOperand(op, cellScope.constructor);
  9543. Emit(Call(position,op.op,0));
  9544. END;
  9545. END;
  9546. END;
  9547. ParameterCopies(procedureType);
  9548. InitVariables(scope);
  9549. IF x.code = NIL THEN
  9550. VisitStatementBlock(x);
  9551. ELSE
  9552. VisitCode(x.code)
  9553. END;
  9554. IF x.finally # NIL THEN (*! mark finally block for object file *)
  9555. ir.SetFinally(ir.pc);
  9556. StatementSequence(x.finally)
  9557. END;
  9558. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  9559. IF ~backend.cooperative THEN
  9560. ProfilerEnterExit(numberProcedures,FALSE);
  9561. END;
  9562. INC(numberProcedures);
  9563. END;
  9564. END;
  9565. IF backend.cooperative THEN
  9566. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  9567. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  9568. ELSIF newObjectFile & moduleBody & ~suppressModuleRegistration & ~meta.simple THEN
  9569. (*! not required any more? check and delete!
  9570. PushSelfPointer();
  9571. CallThis(position,"Modules","SetInitialized",1);
  9572. *)
  9573. (*
  9574. SetLabel(end);
  9575. *)
  9576. END;
  9577. IF x # NIL THEN
  9578. SELF.position := x.position;
  9579. END;
  9580. CheckRegistersFree();
  9581. ASSERT(modifyAssignmentCounter = 0);
  9582. currentScope := prevScope;
  9583. IF Trace THEN TraceExit("Body") END;
  9584. END Body;
  9585. END ImplementationVisitor;
  9586. MetaDataGenerator=OBJECT
  9587. VAR
  9588. implementationVisitor: ImplementationVisitor;
  9589. declarationVisitor: DeclarationVisitor;
  9590. module: Sections.Module;
  9591. moduleName: ARRAY 128 OF CHAR;
  9592. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  9593. MethodTableOffset: LONGINT; (* method table offset from zero *)
  9594. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  9595. TypeTags: LONGINT; (* type extension level support *)
  9596. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  9597. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  9598. BEGIN
  9599. IF implementationVisitor.backend.cooperative THEN
  9600. TypeTags := MAX(LONGINT); (* only 3 extensions allowed *)
  9601. BaseTypesTableOffset := 0;
  9602. MethodTableOffset := 2;
  9603. TypeRecordBaseOffset := 0;
  9604. ELSIF simple THEN
  9605. TypeTags := 3; (* only 3 extensions allowed *)
  9606. BaseTypesTableOffset := -1;
  9607. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9608. TypeRecordBaseOffset := TypeTags;
  9609. ELSE
  9610. TypeTags := 16;
  9611. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  9612. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  9613. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  9614. END;
  9615. SELF.simple := simple;
  9616. SELF.implementationVisitor := implementationVisitor;
  9617. SELF.declarationVisitor := declarationVisitor;
  9618. implementationVisitor.meta := SELF;
  9619. declarationVisitor.meta := SELF;
  9620. END InitMetaDataGenerator;
  9621. PROCEDURE SetModule(module: Sections.Module);
  9622. BEGIN
  9623. SELF.module := module
  9624. END SetModule;
  9625. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  9626. BEGIN
  9627. IF implementationVisitor.backend.cooperative THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  9628. END GetTypeRecordBaseOffset;
  9629. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9630. VAR moduleTD: IntermediateCode.Section; offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  9631. BEGIN
  9632. INC(dataAdrOffset,6);
  9633. Info(section,"headerAdr");
  9634. Address(section,0);
  9635. Info(section,"typeDesc");
  9636. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  9637. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  9638. NamedSymbol(section, name, symbol, 0, offset);
  9639. Info(section,"mark: LONGINT;");
  9640. Longint(section,-1);
  9641. Info(section,"dataAdr-: ADDRESS");
  9642. Symbol(section,section, dataAdrOffset,0);
  9643. Info(section,"size-: SIZE");
  9644. Address(section,0);
  9645. Info(section,"nextRealtime: HeapBlock;");
  9646. Address(section,0);
  9647. END HeapBlock;
  9648. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  9649. VAR i: LONGINT;
  9650. BEGIN
  9651. INC(dataAdrOffset,14);
  9652. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  9653. Info(section,"count*: LONGINT");
  9654. Longint(section,0);
  9655. Info(section,"locked*: BOOLEAN");
  9656. Longint(section,0);
  9657. Info(section,"awaitingLock*: ProcessQueue");
  9658. Address(section,0);
  9659. Address(section,0);
  9660. Info(section,"awaitingCond*: ProcessQueue");
  9661. Address(section,0);
  9662. Address(section,0);
  9663. Info(section,"lockedBy*: ANY");
  9664. Address(section,0);
  9665. Info(section,"lock*: ANY");
  9666. Address(section,0);
  9667. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  9668. Longint(section,1);
  9669. FOR i := 2 TO 6 DO
  9670. Longint(section,0);
  9671. END;
  9672. END ProtectedHeapBlock;
  9673. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  9674. BEGIN
  9675. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  9676. END Info;
  9677. PROCEDURE Address(section: IntermediateCode.Section; value: LONGINT);
  9678. VAR op: IntermediateCode.Operand;
  9679. BEGIN
  9680. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  9681. section.Emit(Data(-11,op));
  9682. END Address;
  9683. PROCEDURE Size(section: IntermediateCode.Section; value: LONGINT);
  9684. VAR op: IntermediateCode.Operand;
  9685. BEGIN
  9686. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  9687. section.Emit(Data(-12,op));
  9688. END Size;
  9689. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  9690. VAR op: IntermediateCode.Operand;
  9691. BEGIN
  9692. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  9693. section.Emit(Data(-1,op));
  9694. END Set;
  9695. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  9696. VAR op: IntermediateCode.Operand;
  9697. BEGIN
  9698. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9699. section.Emit(Data(-1,op));
  9700. END Longint;
  9701. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  9702. VAR op,noOperand: IntermediateCode.Operand;
  9703. BEGIN
  9704. IntermediateCode.InitOperand(noOperand);
  9705. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  9706. section.PatchOperands(pc,op,noOperand,noOperand);
  9707. END PatchLongint;
  9708. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9709. VAR op, noOperand: IntermediateCode.Operand;
  9710. BEGIN
  9711. IntermediateCode.InitOperand(noOperand);
  9712. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9713. section.PatchOperands(pc,op,noOperand,noOperand);
  9714. END PatchSymbol;
  9715. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  9716. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  9717. BEGIN
  9718. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  9719. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  9720. section.Emit(Data(-1,op));
  9721. END Boolean;
  9722. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  9723. VAR op: IntermediateCode.Operand;
  9724. BEGIN
  9725. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  9726. section.Emit(Data(-1,op));
  9727. END Char;
  9728. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  9729. VAR i: LONGINT;
  9730. BEGIN
  9731. Info(section,str);
  9732. i := 0;
  9733. WHILE(str[i] # 0X) DO
  9734. Char(section,str[i]);
  9735. INC(i);
  9736. END;
  9737. Char(section,0X);
  9738. END String;
  9739. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  9740. VAR op: IntermediateCode.Operand;
  9741. BEGIN
  9742. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  9743. IntermediateCode.SetOffset(op,realOffset);
  9744. section.Emit(Data(-1,op));
  9745. END NamedSymbol;
  9746. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  9747. BEGIN
  9748. IF symbol= NIL THEN
  9749. Address( section, realOffset);
  9750. ASSERT(virtualOffset = 0);
  9751. ELSE
  9752. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  9753. END;
  9754. END Symbol;
  9755. (* OutPointers delivers
  9756. {pointerOffset}
  9757. *)
  9758. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  9759. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type;
  9760. BEGIN
  9761. type := type.resolved;
  9762. IF type IS SyntaxTree.AnyType THEN
  9763. Symbol(section, symbol, 0, (offset ));
  9764. INC(numberPointers);
  9765. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9766. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  9767. Symbol(section, symbol, 0, offset); INC(numberPointers);
  9768. ELSIF type IS SyntaxTree.PointerType THEN
  9769. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  9770. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  9771. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  9772. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  9773. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  9774. ELSIF (type IS SyntaxTree.RecordType) THEN
  9775. (* never treat a record like a pointer, even if the pointer field is set! *)
  9776. WITH type: SyntaxTree.RecordType DO
  9777. base := type.GetBaseRecord();
  9778. IF base # NIL THEN
  9779. Pointers(offset,symbol,section, base,numberPointers);
  9780. END;
  9781. variable := type.recordScope.firstVariable;
  9782. WHILE(variable # NIL) DO
  9783. IF ~(variable.untraced) THEN
  9784. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9785. END;
  9786. variable := variable.nextVariable;
  9787. END;
  9788. END;
  9789. ELSIF (type IS SyntaxTree.CellType) THEN
  9790. WITH type: SyntaxTree.CellType DO
  9791. base := type.GetBaseRecord();
  9792. IF base # NIL THEN
  9793. Pointers(offset,symbol,section, base,numberPointers);
  9794. END;
  9795. variable := type.cellScope.firstVariable;
  9796. WHILE(variable # NIL) DO
  9797. IF ~(variable.untraced) THEN
  9798. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  9799. END;
  9800. variable := variable.nextVariable;
  9801. END;
  9802. END;
  9803. ELSIF (type IS SyntaxTree.ArrayType) THEN
  9804. WITH type: SyntaxTree.ArrayType DO
  9805. IF type.form= SyntaxTree.Static THEN
  9806. n := type.staticLength;
  9807. base := type.arrayBase.resolved;
  9808. WHILE(base IS SyntaxTree.ArrayType) DO
  9809. type := base(SyntaxTree.ArrayType);
  9810. n := n* type.staticLength;
  9811. base := type.arrayBase.resolved;
  9812. END;
  9813. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9814. IF SemanticChecker.ContainsPointer(base) THEN
  9815. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9816. FOR i := 0 TO n-1 DO
  9817. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9818. END;
  9819. END;
  9820. ELSE
  9821. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  9822. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9823. END;
  9824. END;
  9825. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  9826. WITH type: SyntaxTree.MathArrayType DO
  9827. IF type.form = SyntaxTree.Static THEN
  9828. n := type.staticLength;
  9829. base := type.arrayBase.resolved;
  9830. WHILE(base IS SyntaxTree.MathArrayType) DO
  9831. type := base(SyntaxTree.MathArrayType);
  9832. n := n* type.staticLength;
  9833. base := type.arrayBase.resolved;
  9834. END;
  9835. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  9836. IF SemanticChecker.ContainsPointer(base) THEN
  9837. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  9838. FOR i := 0 TO n-1 DO
  9839. Pointers(offset+i*size, symbol, section, base,numberPointers);
  9840. END;
  9841. END;
  9842. ELSE
  9843. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  9844. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  9845. END
  9846. END;
  9847. (* ELSE no pointers in type *)
  9848. END;
  9849. END Pointers;
  9850. PROCEDURE DynamicName(source: IntermediateCode.Section; name: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  9851. VAR s: Basic.SectionName; i: LONGINT; ch: CHAR; position: LONGINT;
  9852. BEGIN
  9853. IF pool.Has(name) THEN
  9854. RETURN pool.GetInt(name)
  9855. ELSE
  9856. position := source.pc;
  9857. pool.PutInt(name, position);
  9858. StringPool.GetString(name, s);
  9859. Info(source, s);
  9860. i := 0;
  9861. REPEAT
  9862. ch := s[i]; INC(i);
  9863. Char( source, ch);
  9864. UNTIL ch = 0X;
  9865. END;
  9866. RETURN position;
  9867. END DynamicName;
  9868. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  9869. VAR name: ARRAY 128 OF CHAR; section: IntermediateCode.Section; pooledName: Basic.SegmentedName;
  9870. BEGIN
  9871. COPY(moduleName,name);
  9872. Strings.Append(name,suffix);
  9873. Basic.ToSegmentedName(name, pooledName);
  9874. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName, NIL,TRUE);
  9875. IF implementationVisitor.backend.cooperative THEN
  9876. Info(section, "TypeDescriptor");
  9877. Basic.ToSegmentedName("BaseTypes.Array", pooledName);
  9878. NamedSymbol(section, pooledName,NIL, 0, 0);
  9879. BasePointer(section);
  9880. offset := 0;
  9881. ELSE
  9882. HeapBlock(mName,typeName,section,2);
  9883. Info(section, "HeapBlock");
  9884. (*
  9885. Symbol(section,section,2,0);
  9886. *)
  9887. Address(section,0); (* empty such that GC does not go on traversing *)
  9888. Info(section, "TypeDescriptor");
  9889. Address(section,0);
  9890. offset := section.pc;
  9891. END;
  9892. RETURN section
  9893. END Block;
  9894. PROCEDURE Array(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR);
  9895. VAR name: Basic.SegmentedName;
  9896. BEGIN
  9897. Info(source,"ArrayHeader");
  9898. IF implementationVisitor.backend.cooperative THEN
  9899. sizePC := source.pc;
  9900. Address(source,0);
  9901. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  9902. IF baseType # "" THEN
  9903. Basic.ToSegmentedName(baseType, name);
  9904. NamedSymbol(source, name,NIL, 0, 0);
  9905. ELSE
  9906. Address(source,0);
  9907. END;
  9908. Address(source,0);
  9909. ELSE
  9910. Address(source,0);
  9911. Address(source,0);
  9912. Address(source,0);
  9913. sizePC := source.pc;
  9914. Address(source,0);
  9915. Info(source,"array data");
  9916. END;
  9917. END Array;
  9918. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  9919. BEGIN
  9920. IF implementationVisitor.backend.cooperative THEN
  9921. PatchLongint(section, pc, size);
  9922. PatchLongint(section, pc + 3, size);
  9923. ELSE
  9924. PatchLongint(section, pc, size);
  9925. END;
  9926. END PatchArray;
  9927. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  9928. VAR
  9929. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  9930. sectionArray: POINTER TO ARRAY OF Sections.Section;
  9931. poolMap: Basic.HashTableInt;
  9932. namePool: IntermediateCode.Section;
  9933. namePoolOffset: LONGINT;
  9934. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  9935. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  9936. BEGIN
  9937. Basic.SegmentedNameToString(s1.name,n1);
  9938. Basic.SegmentedNameToString(s2.name,n2);
  9939. index := 0;
  9940. ch1 := n1[index];
  9941. ch2 := n2[index];
  9942. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  9943. INC(index);
  9944. ch1 := n1[index];
  9945. ch2 := n2[index];
  9946. END;
  9947. RETURN ch1 < ch2;
  9948. END Compare;
  9949. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  9950. VAR
  9951. i, j: LONGINT;
  9952. x, t: Sections.Section;
  9953. BEGIN
  9954. IF lo < hi THEN
  9955. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  9956. WHILE i <= j DO
  9957. WHILE Compare(list[i], x) DO INC(i) END;
  9958. WHILE Compare(x, list[j]) DO DEC(j) END;
  9959. IF i <= j THEN
  9960. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  9961. INC(i); DEC(j)
  9962. END
  9963. END;
  9964. IF lo < j THEN QuickSort(list, lo, j) END;
  9965. IF i < hi THEN QuickSort(list, i, hi) END
  9966. END;
  9967. END QuickSort;
  9968. (*
  9969. ExportDesc* = RECORD
  9970. fp*: ADDRESS;
  9971. name* {UNTRACED}: DynamicName;
  9972. adr*: ADDRESS;
  9973. exports*: LONGINT;
  9974. dsc* {UNTRACED}: ExportArray
  9975. END;
  9976. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  9977. *)
  9978. PROCEDURE ExportDesc2(
  9979. source: IntermediateCode.Section;
  9980. namePool: IntermediateCode.Section;
  9981. fingerPrinter: FingerPrinter.FingerPrinter;
  9982. symbol: Sections.Section;
  9983. name: StringPool.Index;
  9984. VAR patchAdr: LONGINT
  9985. ): BOOLEAN;
  9986. VAR fingerPrint: SyntaxTree.FingerPrint;
  9987. BEGIN
  9988. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  9989. & (symbol.type # Sections.InlineCodeSection)
  9990. THEN
  9991. *)
  9992. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  9993. & (symbol.type # Sections.InlineCodeSection))
  9994. THEN
  9995. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  9996. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  9997. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  9998. Longint(source,fingerPrint.shallow);
  9999. ELSE
  10000. Longint(source, 0);
  10001. END;
  10002. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10003. Symbol(source, symbol,0,0);
  10004. patchAdr := source.pc;
  10005. Address(source,0);
  10006. Address(source,0);
  10007. END;
  10008. RETURN TRUE
  10009. ELSE
  10010. RETURN FALSE
  10011. END;
  10012. END ExportDesc2;
  10013. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10014. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10015. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10016. sym: Sections.Section; ignore: LONGINT; symbol: Sections.Section;
  10017. TYPE
  10018. Scope = RECORD
  10019. elements: LONGINT;
  10020. gelements: LONGINT;
  10021. section: IntermediateCode.Section;
  10022. patchAdr: LONGINT;
  10023. arraySizePC: LONGINT;
  10024. beginPC: LONGINT; (* current scope start pc *)
  10025. END;
  10026. BEGIN
  10027. Basic.InitSegmentedName(prev);
  10028. olevel := -1;
  10029. scopes[0].section := source;
  10030. FOR s := 0 TO LEN(sections)-1 DO
  10031. symbol := sections[s];
  10032. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10033. this := sections[s].name;
  10034. level := 0;
  10035. WHILE (this[level] > 0) DO
  10036. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10037. INC(level);
  10038. END;
  10039. WHILE level < olevel DO
  10040. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10041. IF olevel > 0 THEN
  10042. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10043. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10044. END;
  10045. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10046. DEC(olevel);
  10047. END;
  10048. IF (this[level] > 0) THEN
  10049. IF level > olevel THEN
  10050. (*TRACE("opening",level); *)
  10051. IF scopes[level].section = NIL THEN
  10052. arrayName := ".@ExportArray";
  10053. Strings.AppendInt(arrayName, level);
  10054. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,ignore);
  10055. Array(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc");
  10056. END;
  10057. scopes[level].beginPC := scopes[level].section.pc;
  10058. olevel := level;
  10059. scopes[olevel].elements := 0;
  10060. END;
  10061. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10062. sym := sections[s];
  10063. ELSE
  10064. sym := NIL;
  10065. END;
  10066. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10067. THEN
  10068. INC(scopes[olevel].elements);
  10069. END;
  10070. (*StringPool.GetString(this[level], name);*)
  10071. (*TRACE(level, name);*)
  10072. (* enter string in scope *)
  10073. INC(level);
  10074. END;
  10075. END;
  10076. Basic.SegmentedNameToString(this, name);
  10077. (*TRACE(level, "enter", name);*)
  10078. prev := this;
  10079. END;
  10080. END;
  10081. WHILE 0 <= olevel DO
  10082. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10083. IF olevel > 0 THEN
  10084. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10085. PatchSymbol(scopes[olevel-1].section,scopes[olevel-1].patchAdr+1, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10086. END;
  10087. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10088. DEC(olevel);
  10089. END;
  10090. level := 0;
  10091. WHILE (level < LEN(scopes)) DO
  10092. IF scopes[level].section # NIL THEN
  10093. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10094. END;
  10095. INC(level);
  10096. END;
  10097. END Export;
  10098. BEGIN
  10099. NEW(fingerPrinter, module.system);
  10100. NEW(poolMap, 64);
  10101. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10102. NEW(sectionArray, module.allSections.Length());
  10103. FOR i := 0 TO module.allSections.Length() - 1 DO
  10104. section := module.allSections.GetSection(i);
  10105. sectionArray[i] := section;
  10106. END;
  10107. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10108. Export(sectionArray^);
  10109. END ExportDesc;
  10110. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10111. VAR
  10112. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10113. BEGIN
  10114. Info(source, "exception table offsets array descriptor");
  10115. size := 0;
  10116. Array(source,sizePC,"Modules.ExceptionTableEntry");
  10117. Info(source, "exception table content");
  10118. FOR i := 0 TO module.allSections.Length() - 1 DO
  10119. p := module.allSections.GetSection(i);
  10120. IF p.type = Sections.CodeSection THEN
  10121. finallyPC := p(IntermediateCode.Section).finally;
  10122. IF finallyPC>=0 THEN
  10123. Symbol( source, p, 0,0);
  10124. Symbol( source, p, finallyPC, 0);
  10125. Symbol( source, p, finallyPC,0);
  10126. INC(size);
  10127. END;
  10128. END
  10129. END;
  10130. PatchArray(source,sizePC,size);
  10131. END ExceptionArray;
  10132. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10133. VAR i: LONGINT; ch: CHAR;
  10134. BEGIN
  10135. i := 0;
  10136. REPEAT
  10137. ch := name[i]; INC(i);
  10138. Char( section, ch);
  10139. UNTIL ch = 0X;
  10140. WHILE i < 32 DO
  10141. Char( section, 0X); INC(i);
  10142. END;
  10143. END Name;
  10144. PROCEDURE LongName(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10145. VAR i: LONGINT; ch: CHAR;
  10146. BEGIN
  10147. i := 0;
  10148. REPEAT
  10149. ch := name[i]; INC(i);
  10150. Char( section, ch);
  10151. UNTIL ch = 0X;
  10152. WHILE i < 128 DO
  10153. Char( section, 0X); INC(i);
  10154. END;
  10155. END LongName;
  10156. PROCEDURE References(section: IntermediateCode.Section);
  10157. CONST
  10158. rfDirect = 1X; rfIndirect = 3X;
  10159. rfStaticArray= 12X; rfDynamicArray=14X; rfOpenArray=15X;
  10160. rfByte = 1X; rfBoolean = 2X; rfChar8=3X; rfShortint=04X; rfInteger = 05X; rfLongint = 06X;
  10161. rfReal = 07X; rfLongreal = 08X; rfSet = 09X; rfDelegate = 0EX; rfString = 0FH; rfPointer = 0DX; rfHugeint = 10X;
  10162. rfChar16=11X; rfChar32=12X; rfAll=13X; rfSame=14X; rfRange=15X; rfRecord=16X; rfRecordPointer=1DX;
  10163. rfArrayFlag = 80X;
  10164. VAR
  10165. size: LONGINT; s: Sections.Section; sizePC, i: LONGINT;
  10166. PROCEDURE BaseType(arrayOf: BOOLEAN; type: SyntaxTree.Type);
  10167. VAR char: CHAR;
  10168. BEGIN
  10169. IF type = NIL THEN char := rfLongint
  10170. ELSIF type IS SyntaxTree.ByteType THEN char := rfByte
  10171. ELSIF type IS SyntaxTree.BooleanType THEN char := rfBoolean
  10172. ELSIF type IS SyntaxTree.CharacterType THEN
  10173. IF type.sizeInBits = 8 THEN char := rfChar8
  10174. ELSIF type.sizeInBits = 16 THEN char := rfChar16
  10175. ELSIF type.sizeInBits = 32 THEN char := rfChar32
  10176. END;
  10177. ELSIF type IS SyntaxTree.IntegerType THEN
  10178. IF type.sizeInBits = 8 THEN char := rfShortint
  10179. ELSIF type.sizeInBits = 16 THEN char := rfInteger
  10180. ELSIF type.sizeInBits = 32 THEN char := rfLongint
  10181. ELSIF type.sizeInBits = 64 THEN char := rfHugeint
  10182. END;
  10183. ELSIF type IS SyntaxTree.SizeType THEN char := rfLongint
  10184. ELSIF type IS SyntaxTree.AddressType THEN char := rfLongint
  10185. ELSIF type IS SyntaxTree.FloatType THEN
  10186. IF type.sizeInBits = 32 THEN char := rfReal
  10187. ELSIF type.sizeInBits = 64 THEN char := rfLongreal
  10188. END;
  10189. ELSIF type IS SyntaxTree.SetType THEN char := rfSet
  10190. ELSIF type IS SyntaxTree.AnyType THEN char := rfPointer
  10191. ELSIF type IS SyntaxTree.ObjectType THEN char := rfPointer
  10192. ELSIF type IS SyntaxTree.PointerType THEN char := rfPointer
  10193. ELSIF type IS SyntaxTree.ProcedureType THEN char := rfDelegate
  10194. ELSE (*ASSERT(arrayOf);*) char := rfPointer; (*RETURN (* ARRAY OF unknown (record): do not write anything *)*)
  10195. END;
  10196. IF arrayOf THEN
  10197. Char(section,CHR(ORD(char)+ORD(rfArrayFlag)));
  10198. ELSE
  10199. Char(section,char)
  10200. END;
  10201. INC(size);
  10202. END BaseType;
  10203. PROCEDURE RecordType(type: SyntaxTree.RecordType);
  10204. VAR destination: Sections.Section; name: SyntaxTree.IdentifierString;
  10205. BEGIN
  10206. destination := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10207. IF destination = NIL THEN
  10208. (* imported unused record type *)
  10209. Char(section,0X); (* nil type *)
  10210. INC(size);
  10211. type.typeDeclaration.GetName(name);
  10212. (*
  10213. this happens when a symbol from a different module is used but the type desciptor is not necessary to be present in the current module
  10214. D.Str("Warning: Unreferenced record type encountered: "); D.String(name); D.String(" unused? "); D.Ln;
  10215. *)
  10216. ELSE
  10217. IF type.pointerType # NIL THEN
  10218. Char(section,rfRecordPointer)
  10219. ELSE
  10220. Char(section,rfRecord);
  10221. END;
  10222. INC(size);
  10223. Longint(section,(destination.offset ));
  10224. INC(size,4);
  10225. END;
  10226. END RecordType;
  10227. PROCEDURE ArrayType(type: SyntaxTree.ArrayType);
  10228. BEGIN
  10229. IF type.arrayBase.resolved IS SyntaxTree.ArrayType THEN
  10230. Char(section,CHR(ORD(rfPointer)+ORD(rfArrayFlag)));
  10231. INC(size);
  10232. ELSE BaseType(TRUE,type.arrayBase.resolved)
  10233. END;
  10234. IF type.form = SyntaxTree.Static THEN
  10235. Longint(section,type.staticLength)
  10236. ELSE
  10237. Longint(section,0)
  10238. END;
  10239. INC(size,4);
  10240. END ArrayType;
  10241. PROCEDURE MathArrayType(type: SyntaxTree.MathArrayType);
  10242. BEGIN
  10243. IF type.arrayBase = NIL THEN BaseType(TRUE,NIL)
  10244. ELSIF type.arrayBase.resolved IS SyntaxTree.MathArrayType THEN
  10245. Char(section,CHR(ORD(rfPointer)+ORD(rfArrayFlag)));
  10246. INC(size);
  10247. ELSE BaseType(TRUE,type.arrayBase.resolved)
  10248. END;
  10249. IF type.form = SyntaxTree.Static THEN
  10250. Longint(section,type.staticLength)
  10251. ELSE
  10252. Longint(section,0)
  10253. END;
  10254. INC(size,4);
  10255. END MathArrayType;
  10256. PROCEDURE Type(type: SyntaxTree.Type);
  10257. BEGIN
  10258. IF type = NIL THEN Char(section,0X); INC(size); RETURN ELSE type := type.resolved END;
  10259. IF type IS SyntaxTree.BasicType THEN
  10260. BaseType(FALSE,type)
  10261. ELSIF type IS SyntaxTree.RecordType THEN
  10262. RecordType(type(SyntaxTree.RecordType));
  10263. ELSIF type IS SyntaxTree.ArrayType THEN
  10264. ArrayType(type(SyntaxTree.ArrayType))
  10265. ELSIF type IS SyntaxTree.EnumerationType THEN
  10266. BaseType(FALSE,module.system.longintType)
  10267. ELSIF type IS SyntaxTree.PointerType THEN
  10268. IF type(SyntaxTree.PointerType).pointerBase IS SyntaxTree.RecordType THEN
  10269. RecordType(type(SyntaxTree.PointerType).pointerBase(SyntaxTree.RecordType));
  10270. ELSE
  10271. BaseType(FALSE,type)
  10272. END;
  10273. ELSIF type IS SyntaxTree.ProcedureType THEN
  10274. BaseType(FALSE,type);
  10275. ELSIF type IS SyntaxTree.MathArrayType THEN
  10276. MathArrayType(type(SyntaxTree.MathArrayType));
  10277. ELSIF type IS SyntaxTree.CellType THEN
  10278. BaseType(FALSE,module.system.anyType);
  10279. ELSE HALT(200)
  10280. END;
  10281. END Type;
  10282. PROCEDURE WriteVariable(variable: SyntaxTree.Variable; indirect: BOOLEAN);
  10283. VAR name: ARRAY 256 OF CHAR;
  10284. BEGIN
  10285. IF variable.externalName # NIL THEN RETURN END;
  10286. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10287. INC(size);
  10288. variable.GetName(name);
  10289. Type(variable.type);
  10290. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10291. INC(size,4);
  10292. String(section,name);
  10293. INC(size,Strings.Length(name)+1);
  10294. END WriteVariable;
  10295. PROCEDURE WriteParameter(variable: SyntaxTree.Parameter; indirect: BOOLEAN);
  10296. VAR name: ARRAY 256 OF CHAR;
  10297. BEGIN
  10298. IF indirect THEN Char(section,rfIndirect) ELSE Char(section,rfDirect) END;
  10299. INC(size);
  10300. variable.GetName(name);
  10301. Type(variable.type);
  10302. Longint(section,ToMemoryUnits(module.system,variable.offsetInBits));
  10303. INC(size,4);
  10304. variable.GetName(name);
  10305. String(section,name);
  10306. INC(size,Strings.Length(name)+1);
  10307. END WriteParameter;
  10308. PROCEDURE ReturnType(type: SyntaxTree.Type);
  10309. BEGIN
  10310. IF type = NIL THEN Char(section,0X); INC(size); RETURN ELSE type := type.resolved END;
  10311. IF type IS SyntaxTree.ArrayType THEN
  10312. WITH type: SyntaxTree.ArrayType DO
  10313. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10314. ELSE Char(section,rfOpenArray)
  10315. END;
  10316. INC(size);
  10317. END
  10318. ELSIF type IS SyntaxTree.MathArrayType THEN
  10319. WITH type: SyntaxTree.MathArrayType DO
  10320. IF type.form = SyntaxTree.Static THEN Char(section,rfStaticArray)
  10321. ELSE Char(section,rfOpenArray)
  10322. END;
  10323. INC(size);
  10324. END
  10325. ELSIF type IS SyntaxTree.RecordType THEN
  10326. Char(section,rfRecord);
  10327. INC(size);
  10328. ELSE
  10329. BaseType(FALSE,type);
  10330. END;
  10331. END ReturnType;
  10332. PROCEDURE DeclarationName(typeDeclaration: SyntaxTree.TypeDeclaration; VAR name: ARRAY OF CHAR);
  10333. BEGIN
  10334. IF typeDeclaration = NIL THEN COPY("@ANONYMOUS",name)
  10335. ELSE typeDeclaration.GetName(name)
  10336. END;
  10337. END DeclarationName;
  10338. PROCEDURE Procedure(s: Sections.Section);
  10339. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10340. parameter: SyntaxTree.Parameter; variable: SyntaxTree.Variable;
  10341. name,recordName: ARRAY 256 OF CHAR;
  10342. record: SyntaxTree.RecordType; i: LONGINT;
  10343. BEGIN
  10344. procedure := s.symbol(SyntaxTree.Procedure); (*! check for variable or type symbol for object body *)
  10345. procedure.GetName(name);
  10346. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10347. Char(section,0F9X);
  10348. INC(size);
  10349. Symbol(section,s,0,0);
  10350. INC(size,4);
  10351. Symbol(section,s,s(IntermediateCode.Section).pc,0);
  10352. INC(size,4);
  10353. Longint(section,procedureType.numberParameters);
  10354. INC(size,4);
  10355. ReturnType(procedureType.returnType);
  10356. Longint(section,0); (*! level *)
  10357. INC(size,4);
  10358. Longint(section,0);
  10359. INC(size,4);
  10360. Global.GetSymbolNameInScope(procedure, module.module.moduleScope, name);
  10361. (*
  10362. IF procedure.scope IS SyntaxTree.RecordScope THEN (* add object name *)
  10363. record := procedure.scope(SyntaxTree.RecordScope).ownerRecord;
  10364. recordName := "";
  10365. IF record.pointerType # NIL THEN
  10366. DeclarationName(record.pointerType.typeDeclaration,recordName);
  10367. ELSE
  10368. DeclarationName(record.typeDeclaration,recordName);
  10369. END;
  10370. i := 0;
  10371. Info(section,recordName);
  10372. WHILE recordName[i] # 0X DO
  10373. Char(section,recordName[i]); INC(i);
  10374. INC(size);
  10375. END;
  10376. Char(section,".");
  10377. INC(size);
  10378. END;
  10379. *)
  10380. String(section,name);
  10381. INC(size,Strings.Length(name)+1);
  10382. parameter := procedureType.firstParameter;
  10383. WHILE(parameter # NIL) DO
  10384. WriteParameter(parameter,parameter.kind # SyntaxTree.ValueParameter); (*!treat exceptions !*)
  10385. parameter := parameter.nextParameter;
  10386. END;
  10387. variable := procedure.procedureScope.firstVariable;
  10388. WHILE(variable # NIL) DO
  10389. WriteVariable(variable,FALSE);
  10390. variable := variable.nextVariable;
  10391. END;
  10392. END Procedure;
  10393. PROCEDURE Scope(s: Sections.Section);
  10394. VAR variable: SyntaxTree.Variable;
  10395. BEGIN
  10396. Char(section,0F8X);
  10397. INC(size);
  10398. Symbol(section,s,0,0); (* start *)
  10399. INC(size,4);
  10400. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  10401. INC(size,4);
  10402. String(section,"$$");
  10403. INC(size,3);
  10404. (* removed variables -- wrongly interpreted by Reflection
  10405. variable := module.module.moduleScope.firstVariable;
  10406. WHILE(variable # NIL) DO
  10407. WriteVariable(variable,FALSE);
  10408. variable := variable.nextVariable;
  10409. END;
  10410. *)
  10411. END Scope;
  10412. BEGIN
  10413. Array(section,sizePC,"");
  10414. size := 0;
  10415. Char(section,0FFX); (* sign for trap writer *)
  10416. INC(size);
  10417. FOR i := 0 TO module.allSections.Length() - 1 DO
  10418. s := module.allSections.GetSection(i);
  10419. IF (s.type # Sections.InitCodeSection) & (s.symbol = module.module.moduleScope.bodyProcedure) THEN
  10420. Scope(s) (*! must be first procedure in ref section *)
  10421. END
  10422. END;
  10423. FOR i := 0 TO module.allSections.Length() - 1 DO
  10424. s := module.allSections.GetSection(i);
  10425. IF (s.symbol = module.module.moduleScope.bodyProcedure) THEN (* already done, see above *)
  10426. ELSIF (s.type # Sections.InitCodeSection) & (s.symbol # NIL) & (s.symbol IS SyntaxTree.Procedure) & ~s.symbol(SyntaxTree.Procedure).isInline THEN
  10427. Procedure(s)
  10428. END
  10429. END;
  10430. PatchArray(section,sizePC,size);
  10431. END References;
  10432. (*
  10433. Command* = RECORD
  10434. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  10435. name*: Name; (* name of the procedure *)
  10436. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  10437. entryAdr* : ADDRESS; (* entry address of procedure *)
  10438. END;
  10439. *)
  10440. PROCEDURE CommandArray(source: IntermediateCode.Section);
  10441. VAR
  10442. p: Sections.Section; sizePC, numberCommands: LONGINT;
  10443. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10444. name: ARRAY 32 OF CHAR; numberParameters, i: LONGINT;
  10445. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  10446. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  10447. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  10448. BEGIN
  10449. RETURN
  10450. (type = NIL) OR
  10451. (type.resolved IS SyntaxTree.RecordType) OR
  10452. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  10453. (type.resolved IS SyntaxTree.AnyType);
  10454. END TypeAllowed;
  10455. BEGIN
  10456. numberParameters := procedureType.numberParameters;
  10457. RETURN
  10458. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  10459. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  10460. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  10461. END GetProcedureAllowed;
  10462. PROCEDURE WriteType(type : SyntaxTree.Type);
  10463. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  10464. name: Basic.SegmentedName; offset: LONGINT;
  10465. BEGIN
  10466. IF type = NIL THEN
  10467. Address(source,0);
  10468. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  10469. Address(source,1);
  10470. ELSE
  10471. type := type.resolved;
  10472. IF type IS SyntaxTree.PointerType THEN
  10473. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  10474. END;
  10475. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  10476. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  10477. name[0] := typeDeclaration.name; name[1] := -1;
  10478. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  10479. ASSERT(section # NIL);
  10480. ELSE
  10481. Global.GetSymbolSegmentedName(typeDeclaration,name);
  10482. (* TODO *)
  10483. section := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  10484. END;
  10485. IF implementationVisitor.backend.cooperative THEN
  10486. offset := 0;
  10487. ELSE
  10488. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  10489. END;
  10490. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  10491. END;
  10492. END WriteType;
  10493. BEGIN
  10494. Info(source, "command array descriptor");
  10495. Array(source,sizePC,"Modules.Command");
  10496. numberCommands := 0;
  10497. Info(source, "command array content");
  10498. FOR i := 0 TO module.allSections.Length() - 1 DO
  10499. p := module.allSections.GetSection(i);
  10500. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  10501. procedure := p.symbol(SyntaxTree.Procedure);
  10502. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10503. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  10504. procedure.GetName(name);
  10505. Name(source,name);
  10506. numberParameters := procedureType.numberParameters;
  10507. (* offset of type of first parameter *)
  10508. IF (numberParameters = 0 ) THEN WriteType(NIL)
  10509. ELSE WriteType(procedureType.firstParameter.type)
  10510. END;
  10511. (* offset of type of return parameter *)
  10512. WriteType(procedureType.returnType);
  10513. (* command name *)
  10514. (* command code offset *)
  10515. Symbol(source,p,0,0);
  10516. INC(numberCommands);
  10517. IF Trace THEN
  10518. D.Ln;
  10519. END;
  10520. END;
  10521. END
  10522. END;
  10523. PatchArray(source,sizePC,numberCommands);
  10524. END CommandArray;
  10525. (* to prevent from double import of different module aliases *)
  10526. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  10527. VAR i: SyntaxTree.Import;
  10528. BEGIN
  10529. i := module.module.moduleScope.firstImport;
  10530. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  10531. i := i.nextImport;
  10532. END;
  10533. RETURN i = import
  10534. END IsFirstDirectOccurence;
  10535. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  10536. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  10537. BEGIN
  10538. Array(source,pc,"");
  10539. Info(source, "import module array data");
  10540. IF implementationVisitor.backend.cooperative THEN
  10541. offset := 0;
  10542. ELSE
  10543. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  10544. END;
  10545. import := module.module.moduleScope.firstImport;
  10546. numberImports := 0;
  10547. WHILE import # NIL DO
  10548. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  10549. Global.GetModuleSegmentedName(import.module,name);
  10550. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  10551. NamedSymbol(source, name, NIL, 0, offset);
  10552. INC(numberImports);
  10553. END;
  10554. import := import.nextImport
  10555. END;
  10556. PatchArray(source,pc,numberImports);
  10557. END ImportsArray;
  10558. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  10559. VAR
  10560. p: Sections.Section; sizePC, size, i: LONGINT;
  10561. BEGIN
  10562. Info(source, "Type info section");
  10563. size := 0;
  10564. Array(source,sizePC,"Modules.TypeDesc");
  10565. FOR i := 0 TO module.allSections.Length() - 1 DO
  10566. p := module.allSections.GetSection(i);
  10567. WITH p: IntermediateCode.Section DO
  10568. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  10569. Symbol(source,p,0,0);
  10570. INC(size);
  10571. END;
  10572. END
  10573. END;
  10574. PatchArray(source,sizePC,size);
  10575. END TypeInfoSection;
  10576. (*
  10577. ProcTableEntry* = RECORD
  10578. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  10579. noPtr*: LONGINT;
  10580. END;
  10581. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  10582. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  10583. *)
  10584. PROCEDURE PointersInProcTables(procArray, pointerArray: IntermediateCode.Section; VAR procArraySize, maxPointers: LONGINT);
  10585. VAR
  10586. destination: Sections.Section;
  10587. pointerArraySizePC, procArraySizePC, pointerArraySize, i: LONGINT;
  10588. PROCEDURE PointerOffsets(destination : IntermediateCode.Section);
  10589. VAR numberPointers: LONGINT; procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  10590. variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; string: Basic.SectionName;
  10591. BEGIN
  10592. Info(procArray,"pcFrom");
  10593. Symbol(procArray,destination,0,0);
  10594. Info(procArray,"pcTo");
  10595. Symbol(procArray,destination,destination.pc,0);
  10596. Info(procArray,"pcStatementBegin");
  10597. Symbol(procArray,destination,destination.validPAFEnter,0);
  10598. Info(procArray,"pcStatementEnd");
  10599. Symbol(procArray,destination,destination.validPAFExit,0);
  10600. IF ~implementationVisitor.backend.cooperative THEN
  10601. Basic.SegmentedNameToString(destination.name, string);
  10602. Info(pointerArray,string);
  10603. procedure := destination.symbol(SyntaxTree.Procedure);
  10604. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10605. variable := procedure.procedureScope.firstVariable;
  10606. WHILE(variable # NIL) DO
  10607. IF ~(variable.untraced) THEN
  10608. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, pointerArray, variable.type, numberPointers);
  10609. END;
  10610. variable := variable.nextVariable
  10611. END;
  10612. parameter := procedureType.firstParameter;
  10613. WHILE(parameter # NIL) DO
  10614. IF ~(parameter.untraced) THEN
  10615. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, pointerArray, parameter.type, numberPointers);
  10616. END;
  10617. parameter := parameter.nextParameter;
  10618. END;
  10619. END;
  10620. Info(procArray,"numberPointers");
  10621. Longint(procArray,numberPointers);
  10622. IF numberPointers > maxPointers THEN maxPointers := numberPointers END;
  10623. INC(pointerArraySize, numberPointers);
  10624. END PointerOffsets;
  10625. BEGIN
  10626. maxPointers := 0;
  10627. Info(procArray, "proc array descriptor");
  10628. Address(procArray,0);
  10629. Address(procArray,0);
  10630. Address(procArray,0);
  10631. procArraySizePC := procArray.pc;
  10632. Address(procArray,0);
  10633. procArraySize := 0;
  10634. IF ~implementationVisitor.backend.cooperative THEN
  10635. Info(pointerArray, "pointer array descriptor");
  10636. Address(pointerArray,0);
  10637. Address(pointerArray,0);
  10638. Address(pointerArray,0);
  10639. pointerArraySizePC := pointerArray.pc;
  10640. Address(pointerArray,0);
  10641. pointerArraySize := 0;
  10642. END;
  10643. procArraySize := 0;
  10644. FOR i := 0 TO module.allSections.Length() - 1 DO
  10645. destination := module.allSections.GetSection(i);
  10646. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  10647. PointerOffsets(destination(IntermediateCode.Section));
  10648. INC(procArraySize);
  10649. END
  10650. END;
  10651. PatchLongint(procArray,procArraySizePC,procArraySize);
  10652. IF ~implementationVisitor.backend.cooperative THEN
  10653. PatchLongint(pointerArray,pointerArraySizePC,pointerArraySize);
  10654. END;
  10655. END PointersInProcTables;
  10656. (*
  10657. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  10658. VAR
  10659. next*: Module; (** once a module is published, all fields are read-only *)
  10660. name*: Name;
  10661. init, published: BOOLEAN;
  10662. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  10663. sb*: ADDRESS; <- set to beginning of data section by loader
  10664. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  10665. command*: POINTER TO ARRAY OF Command;
  10666. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  10667. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  10668. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  10669. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  10670. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  10671. data*, code*: Bytes;
  10672. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  10673. export*: ExportDesc;
  10674. term*: TerminationHandler;
  10675. exTable*: ExceptionTable;
  10676. noProcs*: LONGINT;
  10677. firstProc*: ADDRESS; <- done by loader
  10678. maxPtrs*: LONGINT;
  10679. crc*: LONGINT;
  10680. *)
  10681. PROCEDURE BasePointer (section: IntermediateCode.Section);
  10682. BEGIN
  10683. Info(section, "cycle");
  10684. Size(section,0);
  10685. Info(section, "references");
  10686. Size(section,0);
  10687. Info(section, "nextMarked");
  10688. Address(section,0);
  10689. Info(section, "nextWatched");
  10690. Address(section,0);
  10691. END BasePointer;
  10692. PROCEDURE BaseObject (section: IntermediateCode.Section);
  10693. BEGIN
  10694. BasePointer(section);
  10695. Info(section, "action");
  10696. Address(section,0);
  10697. Info(section, "monitor");
  10698. Address(section,0);
  10699. END BaseObject;
  10700. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  10701. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  10702. pooledName: Basic.SegmentedName;
  10703. symbol: SyntaxTree.Symbol;
  10704. BEGIN
  10705. Global.GetModuleName(module.module,name);
  10706. Strings.Append(name,".@Module.@Descriptor");
  10707. Basic.ToSegmentedName(name, pooledName);
  10708. descriptorSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10709. Symbol(section,descriptorSection,0,0);
  10710. Info(descriptorSection, "descriptor");
  10711. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10712. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  10713. Address(descriptorSection,0);
  10714. Global.GetModuleName(module.module,name);
  10715. Strings.Append(name,".@Trace");
  10716. Basic.ToSegmentedName(name, pooledName);
  10717. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10718. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  10719. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  10720. END ModuleDescriptor;
  10721. PROCEDURE ModuleSection(): IntermediateCode.Section;
  10722. VAR name: ARRAY 128 OF CHAR;
  10723. moduleSection,moduleTD: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  10724. symbol: SyntaxTree.Symbol;
  10725. BEGIN
  10726. Global.GetModuleName(module.module,name);
  10727. Strings.Append(name,".@Module");
  10728. Basic.ToSegmentedName(name, pooledName);
  10729. moduleSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,TRUE);
  10730. moduleSection.SetExported(TRUE);
  10731. IF moduleSection.pc = 0 THEN
  10732. IF implementationVisitor.backend.cooperative THEN
  10733. Info(moduleSection, "descriptor");
  10734. ModuleDescriptor(moduleSection);
  10735. BaseObject(moduleSection);
  10736. implementationVisitor.CreateTraceModuleMethod(module.module);
  10737. ELSE
  10738. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  10739. Info(moduleSection, "HeapBlock");
  10740. Symbol(moduleSection,moduleSection,2,0);
  10741. Info(moduleSection, "TypeDescriptor");
  10742. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  10743. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  10744. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  10745. END;
  10746. END;
  10747. RETURN moduleSection;
  10748. END ModuleSection;
  10749. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  10750. VAR
  10751. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  10752. typeInfoSection, procTableSection, ptrTableSection, referenceSection : IntermediateCode.Section;
  10753. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  10754. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, ptrTableSectionOffset, maxPointers, numberProcs,temp,
  10755. referenceSectionOffset : LONGINT;
  10756. BEGIN
  10757. Global.GetModuleName(module.module,moduleName);
  10758. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  10759. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  10760. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  10761. ImportsArray(importSection);
  10762. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  10763. CommandArray(commandsSection);
  10764. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  10765. ExceptionArray(exceptionSection);
  10766. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  10767. TypeInfoSection(typeInfoSection);
  10768. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  10769. References(referenceSection);
  10770. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  10771. IF ~implementationVisitor.backend.cooperative THEN
  10772. ptrTableSection := Block("Heaps","SystemBlockDesc",".@PtrTable",ptrTableSectionOffset);
  10773. ELSE
  10774. ptrTableSection := NIL;
  10775. END;
  10776. PointersInProcTables(procTableSection,ptrTableSection,numberProcs,maxPointers);
  10777. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  10778. Array(emptyArraySection,temp,"");
  10779. moduleSection := ModuleSection();
  10780. Info(moduleSection, "nextRoot*: RootObject");
  10781. Address(moduleSection,0);
  10782. Info(moduleSection, "next*: Module");
  10783. Address(moduleSection,0);
  10784. Info(moduleSection, "name*: Name");
  10785. Name(moduleSection,moduleName);
  10786. Info(moduleSection, "init, published: BOOLEAN");
  10787. Boolean(moduleSection,FALSE);
  10788. Boolean(moduleSection,FALSE);
  10789. Info(moduleSection,"filler"); (*! introduce alignment! *)
  10790. Boolean(moduleSection,FALSE);
  10791. Boolean(moduleSection,FALSE);
  10792. Info(moduleSection, "refcnt*: LONGINT");
  10793. Longint(moduleSection,0);
  10794. Info(moduleSection, "sb*: ADDRESS");
  10795. Address(moduleSection,0);
  10796. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  10797. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10798. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  10799. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  10800. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  10801. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  10802. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  10803. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  10804. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  10805. Symbol(moduleSection,importSection,emptyArraySectionOffset,0);
  10806. Info(moduleSection, "procTable*: ProcTable");
  10807. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  10808. Info(moduleSection, "ptrTable*: PtrTable");
  10809. IF ~implementationVisitor.backend.cooperative THEN
  10810. Symbol(moduleSection,ptrTableSection,ptrTableSectionOffset,0);
  10811. ELSE
  10812. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10813. END;
  10814. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  10815. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10816. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10817. Symbol(moduleSection,emptyArraySection,emptyArraySectionOffset,0);
  10818. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  10819. Info(moduleSection, "export*: ExportDesc");
  10820. ExportDesc(moduleSection);
  10821. Info(moduleSection, "term*: TerminationHandler");
  10822. Address(moduleSection,0);
  10823. Info(moduleSection, "exTable*: ExceptionTable");
  10824. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  10825. Info(moduleSection, "noProcs*: LONGINT");
  10826. Longint(moduleSection,numberProcs);
  10827. Info(moduleSection, "firstProc*: ADDRESS");
  10828. Address(moduleSection,0);
  10829. Info(moduleSection, "maxPtrs*: LONGINT");
  10830. Longint(moduleSection,maxPointers);
  10831. Info(moduleSection, "crc*: LONGINT");
  10832. Longint(moduleSection, 0); (*! must be implemented *)
  10833. Info(moduleSection, "body*: ADDRESS");
  10834. Symbol(moduleSection, bodyProc, 0,0);
  10835. IF implementationVisitor.backend.cooperative THEN
  10836. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  10837. Info(moduleSection, "monitor.owner");
  10838. Address(moduleSection,0);
  10839. Info(moduleSection, "monitor.nestingLevel");
  10840. Address(moduleSection,0);
  10841. Info(moduleSection, "monitor.blockedQueue");
  10842. Address(moduleSection,0); Address(moduleSection,0);
  10843. Info(moduleSection, "monitor.waitingQueue");
  10844. Address(moduleSection,0); Address(moduleSection,0);
  10845. Info(moduleSection, "monitor.waitingSentinel");
  10846. Address(moduleSection,0);
  10847. END;
  10848. END Module;
  10849. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  10850. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section;
  10851. BEGIN
  10852. Array(source,pc,"");
  10853. Info(source, "pointer offsets array data");
  10854. IF scope IS SyntaxTree.RecordScope THEN
  10855. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  10856. ELSIF scope IS SyntaxTree.CellScope THEN
  10857. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  10858. ELSIF scope IS SyntaxTree.ModuleScope THEN
  10859. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  10860. WHILE variable # NIL DO
  10861. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  10862. symbol := module.allSections.FindBySymbol(variable);
  10863. ASSERT(symbol # NIL);
  10864. Pointers(0,symbol, source,variable.type,numberPointers);
  10865. END;
  10866. variable := variable.nextVariable;
  10867. END;
  10868. END;
  10869. PatchArray(source,pc,numberPointers);
  10870. END PointerArray;
  10871. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  10872. VAR recordType: SyntaxTree.RecordType;
  10873. tir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  10874. section: Sections.Section; string: SyntaxTree.String; type: SyntaxTree.Type; cellType: SyntaxTree.CellType;
  10875. PROCEDURE FieldArray(source: IntermediateCode.Section);
  10876. VAR variable: SyntaxTree.Variable; pc, offset: LONGINT; symbol, tir: Sections.Section; size: LONGINT; name: ARRAY 128 OF CHAR;
  10877. segmentedName: Basic.SegmentedName;
  10878. td: SyntaxTree.TypeDeclaration;
  10879. BEGIN
  10880. Array(source,pc,"Modules.FieldEntry");
  10881. Info(source, "FieldArray");
  10882. IF x IS SyntaxTree.RecordType THEN
  10883. variable := x(SyntaxTree.RecordType).recordScope.firstVariable
  10884. ELSE
  10885. variable := NIL;
  10886. END;
  10887. size :=0;
  10888. WHILE variable # NIL DO
  10889. type := variable.type.resolved;
  10890. Info(source,"offset");
  10891. Size(source, ToMemoryUnits(module.system,variable.offsetInBits));
  10892. Info(source,"type class");
  10893. IF type IS SyntaxTree.PointerType THEN
  10894. Size(source, 1);
  10895. ELSIF type IS SyntaxTree.RecordType THEN
  10896. Size(source, 2);
  10897. ELSIF type IS SyntaxTree.NumberType THEN
  10898. Size(source, 3);
  10899. ELSE
  10900. Size(source, 0);
  10901. END;
  10902. Info(source, "type desc");
  10903. IF type IS SyntaxTree.RecordType THEN
  10904. td := type(SyntaxTree.RecordType).typeDeclaration;
  10905. Global.GetSymbolSegmentedName(td,segmentedName);
  10906. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  10907. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  10908. ELSE
  10909. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  10910. END;
  10911. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  10912. Symbol(source, tir, 0, offset);
  10913. ELSE
  10914. Address(source, 0);
  10915. END;
  10916. Info(source,"flags");
  10917. Set(source, {});
  10918. Info(source,"name");
  10919. variable.GetName(name);
  10920. LongName(source, name);
  10921. variable := variable.nextVariable;
  10922. INC(size);
  10923. END;
  10924. PatchArray(source,pc,size);
  10925. END FieldArray;
  10926. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): Sections.Section;
  10927. VAR name: Basic.SegmentedName;source, fieldSection: IntermediateCode.Section;
  10928. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  10929. sectionName: Basic.SectionName;
  10930. CONST MPO=-40000000H;
  10931. BEGIN
  10932. (*
  10933. TypeDesc* = POINTER TO RECORD
  10934. descSize: LONGINT;
  10935. sentinel: LONGINT; (* = MPO-4 *)
  10936. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  10937. flags*: SET;
  10938. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  10939. name*: Name;
  10940. END;
  10941. *)
  10942. (* source := module.sections.FindByName(...) *)
  10943. Global.GetSymbolSegmentedName(td,name);
  10944. Basic.AppendToSegmentedName(name,"@Info");
  10945. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  10946. Info(source, "type info size"); Address(source, 3*ToMemoryUnits(module.system,module.system.addressSize)+32);
  10947. Address(source,MPO-4);
  10948. Info(source, "type tag pointer");
  10949. Symbol( source, tag, offset, 0);
  10950. Info(source, "type flags");
  10951. flags := {};
  10952. IF isProtected THEN INCL(flags,31) END;
  10953. Set( source, flags);
  10954. Info(source, "pointer to module");
  10955. moduleSection := ModuleSection();
  10956. Symbol( source, moduleSection, moduleSection.pc,0);
  10957. Info(source, "type name");
  10958. i := 0;
  10959. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  10960. (*
  10961. Global.GetSymbolSegmentedName(td,name);
  10962. Basic.SegmentedNameToString(name, sectionName);
  10963. *)
  10964. Name(source,sectionName);
  10965. source.SetReferenced(FALSE);
  10966. Global.GetSymbolSegmentedName(td,name);
  10967. Basic.AppendToSegmentedName(name,"@Fields");
  10968. fieldSection := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL,TRUE);
  10969. HeapBlock("Heaps","SystemBlockDesc", fieldSection, 2);
  10970. Info(fieldSection, "HeapBlock");
  10971. Address(fieldSection,0); (* empty such that GC does not go on traversing *)
  10972. Info(fieldSection, "TypeDescriptor");
  10973. Address(fieldSection,0);
  10974. Info(source, "FieldArray ref");
  10975. Symbol(source, fieldSection, fieldSection.pc, 0);
  10976. FieldArray(fieldSection);
  10977. RETURN source;
  10978. END NewTypeDescriptorInfo;
  10979. PROCEDURE GetSection(x: SyntaxTree.Procedure): Sections.Section;
  10980. VAR source: IntermediateCode.Section; sectionType: SHORTINT; name: Basic.SegmentedName;
  10981. BEGIN
  10982. Global.GetSymbolSegmentedName(x,name);
  10983. IF x.isInline THEN
  10984. sectionType := Sections.InlineCodeSection;
  10985. ELSE
  10986. sectionType := Sections.CodeSection;
  10987. END;
  10988. IF (x.scope.ownerModule = module.module) THEN
  10989. source := IntermediateCode.NewSection(module.allSections, sectionType, name,x,declarationVisitor.dump);
  10990. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  10991. HALT(200);
  10992. ELSE
  10993. source := IntermediateCode.NewSection(module.importedSections, sectionType, name,x,declarationVisitor.dump);
  10994. END;
  10995. RETURN source
  10996. END GetSection;
  10997. PROCEDURE NewTypeDescriptor;
  10998. VAR name, stackFrame: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  10999. procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable;
  11000. baseRecord: SyntaxTree.RecordType; baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  11001. numberPointers: LONGINT; padding,offset, i: LONGINT;
  11002. CONST MPO=-40000000H;
  11003. PROCEDURE TdTable(size: LONGINT);
  11004. VAR i: LONGINT;
  11005. BEGIN
  11006. Info(source, "tag table");
  11007. baseRecord := recordType;
  11008. i := 0;
  11009. WHILE baseRecord # NIL DO
  11010. INC(i);
  11011. baseRecord := baseRecord.GetBaseRecord();
  11012. END;
  11013. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  11014. WHILE i < size DO
  11015. Address(source,0);
  11016. INC(i);
  11017. END;
  11018. baseRecord := recordType;
  11019. WHILE baseRecord # NIL DO
  11020. baseTD := baseRecord.typeDeclaration;
  11021. Global.GetSymbolSegmentedName(baseTD,name);
  11022. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11023. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11024. ELSE
  11025. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11026. END;
  11027. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*module.system.addressSize);
  11028. Symbol(source, tir, 0, offset);
  11029. baseRecord := baseRecord.GetBaseRecord();
  11030. END;
  11031. END TdTable;
  11032. PROCEDURE MethodTable;
  11033. VAR i,methods: LONGINT;
  11034. BEGIN
  11035. Info(source, "method table");
  11036. IF recordType # NIL THEN
  11037. methods := recordType.recordScope.numberMethods;
  11038. FOR i := methods-1 TO 0 BY -1 DO
  11039. procedure := recordType.recordScope.FindMethod(i);
  11040. Global.GetSymbolSegmentedName(procedure, name);
  11041. NamedSymbol(source, name,procedure, 0,0);
  11042. END;
  11043. END;
  11044. END MethodTable;
  11045. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  11046. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  11047. BEGIN
  11048. Info(source, "method table");
  11049. baseRecord := recordType;
  11050. WHILE baseRecord.baseType # NIL DO
  11051. baseRecord := baseRecord.GetBaseRecord ();
  11052. END;
  11053. GetRecordTypeName (baseRecord, name);
  11054. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  11055. IF name = stackFrame THEN
  11056. start := 0;
  11057. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  11058. baseRecord := recordType;
  11059. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  11060. baseRecord := baseRecord.GetBaseRecord ();
  11061. END;
  11062. IF baseRecord # NIL THEN
  11063. GetRecordTypeName (baseRecord, name);
  11064. IF pointer & ~baseRecord.isObject THEN
  11065. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11066. END;
  11067. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  11068. ELSIF recordType.isObject THEN
  11069. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  11070. ELSIF pointer THEN
  11071. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  11072. ELSE
  11073. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  11074. END;
  11075. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11076. Symbol(source, tir, 0, 0);
  11077. start := 0;
  11078. baseRecord := recordType;
  11079. WHILE (baseRecord # NIL) DO
  11080. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  11081. baseRecord := baseRecord.GetBaseRecord ();
  11082. END;
  11083. ELSE
  11084. (* explicit trace method: *)
  11085. procedure := recordType.recordScope.FindMethod(0);
  11086. IF ~procedure.isFinalizer THEN
  11087. Global.GetSymbolSegmentedName(procedure, name);
  11088. NamedSymbol(source, name,procedure, 0,0);
  11089. END;
  11090. start := 1;
  11091. END;
  11092. IF (name # stackFrame) & recordType.isObject THEN
  11093. baseRecord := recordType;
  11094. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  11095. baseRecord := baseRecord.GetBaseRecord ();
  11096. END;
  11097. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  11098. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  11099. ELSE
  11100. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  11101. END;
  11102. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11103. Symbol(source, tir, 0, 0);
  11104. END;
  11105. methods := recordType.recordScope.numberMethods;
  11106. FOR i := start TO methods-1 DO
  11107. procedure := recordType.recordScope.FindMethod(i);
  11108. IF ~procedure.isFinalizer THEN
  11109. Global.GetSymbolSegmentedName(procedure, name);
  11110. NamedSymbol(source, name,procedure, 0,0);
  11111. END;
  11112. END;
  11113. END CooperativeMethodTable;
  11114. BEGIN
  11115. Global.GetSymbolSegmentedName(td,name);
  11116. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  11117. source.SetExported(IsExported(td));
  11118. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  11119. IF implementationVisitor.backend.cooperative THEN
  11120. base := NIL;
  11121. baseRecord := recordType.GetBaseRecord();
  11122. IF baseRecord # NIL THEN
  11123. baseTD := baseRecord.typeDeclaration;
  11124. END;
  11125. IF ~recordType.isObject THEN
  11126. Info(source, "parent");
  11127. IF baseRecord # NIL THEN
  11128. Global.GetSymbolSegmentedName(baseTD,name);
  11129. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11130. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11131. ELSE
  11132. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  11133. END;
  11134. Symbol(source, tir, 0, 0);
  11135. ELSE
  11136. Address(source,0);
  11137. END;
  11138. Info(source, "record size");
  11139. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11140. source.SetReferenced(FALSE);
  11141. CooperativeMethodTable(FALSE);
  11142. base := source;
  11143. Global.GetSymbolSegmentedName(td,name);
  11144. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11145. source := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11146. source.SetExported(IsExported(td));
  11147. source.SetReferenced(FALSE);
  11148. END;
  11149. Info(source, "parent");
  11150. IF baseRecord # NIL THEN
  11151. Global.GetSymbolSegmentedName(baseTD,name);
  11152. sym := baseTD;
  11153. IF ~recordType.isObject THEN
  11154. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  11155. sym := NIL;
  11156. END;
  11157. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  11158. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11159. ELSE
  11160. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  11161. END;
  11162. Symbol(source, tir, 0, 0);
  11163. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  11164. Address(source,0);
  11165. ELSE
  11166. IF recordType.isObject THEN
  11167. Basic.ToSegmentedName ("BaseTypes.Object",name);
  11168. ELSE
  11169. Basic.ToSegmentedName ("BaseTypes.Record",name);
  11170. END;
  11171. tir := IntermediateCode.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11172. Symbol(source, tir, 0, 0);
  11173. END;
  11174. Info(source, "base record descriptor");
  11175. Symbol(source, base, 0, 0);
  11176. CooperativeMethodTable(TRUE);
  11177. source.SetReferenced(FALSE);
  11178. IF recordType.hasPointers THEN
  11179. IF ~HasExplicitTraceMethod (recordType) THEN
  11180. implementationVisitor.CreateTraceMethod(recordType);
  11181. END;
  11182. implementationVisitor.CreateResetProcedure(recordType);
  11183. implementationVisitor.CreateAssignProcedure(recordType);
  11184. END;
  11185. ELSIF ~simple THEN
  11186. (*
  11187. MethodEnd = MPO
  11188. ---
  11189. methods (# methods)
  11190. ---
  11191. tags (16)
  11192. ---
  11193. TypeDesc = TypeInfoAdr
  11194. ---
  11195. td adr ---> rec size
  11196. ----
  11197. pointer offsets
  11198. ----
  11199. (padding)
  11200. -----
  11201. empty [2 addresses aligned]
  11202. empty
  11203. empty
  11204. numPtrs
  11205. ---
  11206. pointer offsets
  11207. ---
  11208. *)
  11209. Info(source, "MethodEnd = MPO");
  11210. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  11211. source(IntermediateCode.Section).Emit(Data(-1,op));
  11212. MethodTable;
  11213. TdTable(TypeTags);
  11214. Info(source, "type descriptor info pointer");
  11215. Symbol(source, NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected()),0,0);
  11216. IF (cellType # NIL) THEN
  11217. IF cellType.sizeInBits < 0 THEN
  11218. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  11219. END;
  11220. Info(source, "cell size");
  11221. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  11222. ELSE
  11223. Info(source, "record size");
  11224. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11225. END;
  11226. Info(source, "pointer offsets pointer");
  11227. padding := 1- source.pc MOD 2;
  11228. Symbol(source, source, source.pc+1+padding,0);
  11229. IF padding >0 THEN
  11230. Info(source, "padding");
  11231. FOR i := 1 TO padding DO Address(source,0) END;
  11232. END;
  11233. IF cellType # NIL THEN
  11234. PointerArray(source, cellType.cellScope, numberPointers);
  11235. ELSE
  11236. PointerArray(source, recordType.recordScope, numberPointers);
  11237. END;
  11238. ELSE
  11239. (*
  11240. simple:
  11241. methods
  11242. tag(2)
  11243. tag(1)
  11244. td adr ---> tag(0)
  11245. td adr ---> size
  11246. *)
  11247. MethodTable;
  11248. TdTable(TypeTags);
  11249. Info(source, "record size");
  11250. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  11251. source.SetReferenced(FALSE);
  11252. END;
  11253. END NewTypeDescriptor;
  11254. BEGIN
  11255. x := x.resolved;
  11256. IF (x IS SyntaxTree.PointerType) THEN
  11257. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  11258. END;
  11259. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  11260. recordType := x(SyntaxTree.RecordType);
  11261. td := x.typeDeclaration;
  11262. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11263. ASSERT(td # NIL);
  11264. section := module.allSections.FindBySymbol(td); (* TODO *)
  11265. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11266. IF implementationVisitor.newObjectFile THEN
  11267. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11268. NewTypeDescriptor
  11269. END;
  11270. ELSE
  11271. (* data section in intermediate code *)
  11272. Global.GetSymbolSegmentedName(td,name);
  11273. tir := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  11274. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  11275. tir.Emit(Data(-1,op));
  11276. END;
  11277. END;
  11278. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  11279. cellType := x(SyntaxTree.CellType);
  11280. td := x.typeDeclaration;
  11281. section := module.allSections.FindBySymbol(td); (* TODO *)
  11282. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  11283. IF implementationVisitor.newObjectFile THEN
  11284. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11285. NewTypeDescriptor
  11286. END;
  11287. END;
  11288. END;
  11289. END
  11290. END CheckTypeDeclaration
  11291. END MetaDataGenerator;
  11292. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  11293. VAR
  11294. trace-: BOOLEAN;
  11295. traceString-: SyntaxTree.IdentifierString;
  11296. traceModuleName-: SyntaxTree.IdentifierString;
  11297. newObjectFile-: BOOLEAN;
  11298. profile-: BOOLEAN;
  11299. noRuntimeChecks: BOOLEAN;
  11300. simpleMetaData-: BOOLEAN;
  11301. noAsserts: BOOLEAN;
  11302. optimize-: BOOLEAN;
  11303. cooperative-: BOOLEAN;
  11304. preregisterStatic-: BOOLEAN;
  11305. dump-: Basic.Writer;
  11306. cellsAreObjects: BOOLEAN;
  11307. PROCEDURE &InitIntermediateBackend*;
  11308. BEGIN
  11309. simpleMetaData := FALSE;
  11310. newObjectFile := FALSE;
  11311. InitBackend;
  11312. SetRuntimeModuleName(DefaultRuntimeModuleName);
  11313. SetTraceModuleName(DefaultTraceModuleName);
  11314. END InitIntermediateBackend;
  11315. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  11316. VAR
  11317. declarationVisitor: DeclarationVisitor;
  11318. implementationVisitor: ImplementationVisitor;
  11319. module: Sections.Module;
  11320. name, instructionSet, platformName: SyntaxTree.IdentifierString;
  11321. meta: MetaDataGenerator; support: SET;
  11322. BEGIN
  11323. ResetError;
  11324. Global.GetSymbolName(x,name);
  11325. IF activeCellsSpecification # NIL THEN
  11326. GetDescription(instructionSet);
  11327. activeCellsSpecification.SetInstructionSet(instructionSet)
  11328. END;
  11329. NEW(module,x,system); (* backend structures *)
  11330. Global.GetModuleName(x, name);
  11331. module.SetModuleName(name);
  11332. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  11333. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  11334. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  11335. declarationVisitor.Module(x,module);
  11336. IF newObjectFile & ~meta.simple THEN
  11337. meta.Module(implementationVisitor.moduleBodySection);
  11338. END;
  11339. GetDescription(platformName);
  11340. module.SetPlatformName(platformName);
  11341. RETURN module
  11342. END GenerateIntermediate;
  11343. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  11344. BEGIN RETURN TRUE
  11345. END SupportedImmediate;
  11346. PROCEDURE ProcessSyntaxTreeModule(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  11347. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  11348. END ProcessSyntaxTreeModule;
  11349. PROCEDURE ProcessIntermediateCodeModule(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  11350. VAR
  11351. result: Sections.Module;
  11352. traceName: Basic.MessageString;
  11353. BEGIN
  11354. ASSERT(intermediateCodeModule IS Sections.Module);
  11355. result := intermediateCodeModule(Sections.Module);
  11356. IF trace THEN
  11357. traceName := "intermediate code trace: ";
  11358. Strings.Append(traceName,traceString);
  11359. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  11360. IF (traceString="") OR (traceString="*") THEN
  11361. result.Dump(dump);
  11362. dump.Update
  11363. ELSE
  11364. Sections.DumpFiltered(dump, result, traceString);
  11365. END
  11366. END;
  11367. RETURN result
  11368. END ProcessIntermediateCodeModule;
  11369. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  11370. BEGIN instructionSet := "Intermediate";
  11371. END GetDescription;
  11372. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  11373. BEGIN
  11374. SELF.newObjectFile := newObjectFile;
  11375. SELF.simpleMetaData := simpleMetaData;
  11376. END SetNewObjectFile;
  11377. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  11378. BEGIN COPY(name, traceModuleName)
  11379. END SetTraceModuleName;
  11380. PROCEDURE DefineOptions(options: Options.Options);
  11381. BEGIN
  11382. DefineOptions^(options);
  11383. options.Add(0X,"trace",Options.String);
  11384. options.Add(0X,"runtime",Options.String);
  11385. options.Add(0X,"newObjectFile",Options.Flag);
  11386. options.Add(0X,"traceModule",Options.String);
  11387. options.Add(0X,"profile",Options.Flag);
  11388. options.Add(0X,"noRuntimeChecks",Options.Flag);
  11389. options.Add(0X,"noAsserts",Options.Flag);
  11390. options.Add(0X,"metaData",Options.String);
  11391. options.Add('o',"optimize", Options.Flag);
  11392. options.Add(0X,"preregisterStatic", Options.Flag);
  11393. options.Add(0X,"cellsAreObjects", Options.Flag);
  11394. END DefineOptions;
  11395. PROCEDURE GetOptions(options: Options.Options);
  11396. VAR name,string: SyntaxTree.IdentifierString;
  11397. BEGIN
  11398. GetOptions^(options);
  11399. trace := options.GetString("trace",traceString);
  11400. profile := options.GetFlag("profile");
  11401. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  11402. noAsserts := options.GetFlag("noAsserts");
  11403. cooperative := options.GetFlag("cooperative");
  11404. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  11405. IF cooperative THEN
  11406. SetRuntimeModuleName("CPU") END
  11407. END;
  11408. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  11409. simpleMetaData := TRUE
  11410. END;
  11411. IF options.GetString("metaData",string) THEN
  11412. IF string = "simple" THEN simpleMetaData := TRUE
  11413. ELSIF string ="full" THEN simpleMetaData := FALSE
  11414. END;
  11415. END;
  11416. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  11417. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  11418. optimize := options.GetFlag("optimize");
  11419. preregisterStatic := options.GetFlag("preregisterStatic");
  11420. cellsAreObjects := options.GetFlag("cellsAreObjects");
  11421. END GetOptions;
  11422. PROCEDURE DefaultSymbolFileFormat(): Formats.SymbolFileFormat;
  11423. BEGIN RETURN SymbolFileFormat.Get()
  11424. END DefaultSymbolFileFormat;
  11425. END IntermediateBackend;
  11426. (* ----------------------------------- register allocation ------------------------------------- *)
  11427. (* register mapping scheme
  11428. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  11429. spill offset
  11430. part(n) --> ticket <--> physical register
  11431. spill offset
  11432. *)
  11433. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  11434. emptyOperand: IntermediateCode.Operand;
  11435. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  11436. statCoopResetVariables: LONGINT;
  11437. statCoopModifyAssignments: LONGINT;
  11438. modifyAssignmentsPC : LONGINT;
  11439. statCoopNilCheck: LONGINT;
  11440. statCoopSwitch: LONGINT;
  11441. statCoopAssignProcedure: LONGINT;
  11442. statCoopTraceMethod: LONGINT;
  11443. statCoopResetProcedure: LONGINT;
  11444. statCoopTraceModule: LONGINT;
  11445. PROCEDURE ResetStatistics*;
  11446. BEGIN
  11447. statCoopResetVariables := 0;
  11448. statCoopModifyAssignments := 0;
  11449. statCoopNilCheck:= 0;
  11450. statCoopSwitch:= 0;
  11451. statCoopAssignProcedure:= 0;
  11452. statCoopTraceMethod:= 0;
  11453. statCoopResetProcedure:= 0;
  11454. statCoopTraceModule:= 0;
  11455. END ResetStatistics;
  11456. PROCEDURE Statistics*;
  11457. BEGIN
  11458. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  11459. TRACE(statCoopNilCheck, statCoopSwitch);
  11460. TRACE(statCoopAssignProcedure,
  11461. statCoopTraceMethod,
  11462. statCoopResetProcedure,
  11463. statCoopTraceModule)
  11464. END Statistics;
  11465. PROCEDURE AppendIndex(VAR name: ARRAY OF CHAR; index: LONGINT);
  11466. BEGIN
  11467. Strings.Append(name,"["); Basic.AppendNumber(name,index); Strings.Append(name,"]");
  11468. END AppendIndex;
  11469. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  11470. BEGIN
  11471. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  11472. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11473. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11474. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  11475. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (parameter.ownerType(SyntaxTree.ProcedureType).callingConvention = SyntaxTree.CCallingConvention)
  11476. END
  11477. END PassBySingleReference;
  11478. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  11479. BEGIN
  11480. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  11481. END PassInRegister;
  11482. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  11483. VAR new: RegisterEntry;
  11484. BEGIN
  11485. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  11486. IF queue = NIL THEN
  11487. queue := new
  11488. ELSE
  11489. new.next := queue;
  11490. IF queue#NIL THEN queue.prev := new END;
  11491. queue := new
  11492. END;
  11493. END AddRegisterEntry;
  11494. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  11495. VAR this: RegisterEntry;
  11496. BEGIN
  11497. this := queue;
  11498. WHILE (this # NIL) & (this.register # register) DO
  11499. this := this.next;
  11500. END;
  11501. IF this = NIL THEN
  11502. RETURN FALSE
  11503. END;
  11504. ASSERT(this # NIL);
  11505. IF this = queue THEN queue := queue.next END;
  11506. IF this.prev # NIL THEN this.prev.next := this.next END;
  11507. IF this.next # NIL THEN this.next.prev := this.prev END;
  11508. RETURN TRUE
  11509. END RemoveRegisterEntry;
  11510. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  11511. BEGIN ASSERT(cond);
  11512. END Assert;
  11513. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  11514. BEGIN
  11515. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  11516. END ReusableRegister;
  11517. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  11518. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  11519. BEGIN
  11520. procedure := moduleScope.bodyProcedure;
  11521. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  11522. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  11523. procedure := SyntaxTree.NewProcedure(-1,Global.ModuleBodyName, procedureScope);
  11524. procedure.SetScope(moduleScope);
  11525. procedure.SetType(SyntaxTree.NewProcedureType(-1,moduleScope));
  11526. procedure.SetAccess(SyntaxTree.Hidden);
  11527. moduleScope.SetBodyProcedure(procedure);
  11528. moduleScope.AddProcedure(procedure);
  11529. procedureScope.SetBody(SyntaxTree.NewBody(-1,procedureScope)); (* empty body *)
  11530. END;
  11531. END EnsureBodyProcedure;
  11532. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  11533. VAR import: SyntaxTree.Import;
  11534. s: Basic.MessageString;
  11535. selfName: SyntaxTree.IdentifierString;
  11536. module: SyntaxTree.Module;
  11537. BEGIN
  11538. scope.ownerModule.GetName(selfName);
  11539. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  11540. module := scope.ownerModule
  11541. ELSE
  11542. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  11543. IF import = NIL THEN
  11544. RETURN NIL
  11545. ELSIF import.module = NIL THEN
  11546. RETURN NIL
  11547. ELSE module := import.module
  11548. END;
  11549. END;
  11550. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  11551. END GetSymbol;
  11552. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  11553. BEGIN
  11554. op.mode := mode;
  11555. IntermediateCode.InitOperand(op.op);
  11556. IntermediateCode.InitOperand(op.tag);
  11557. IntermediateCode.InitOperand(op.extra);
  11558. op.dimOffset := 0;
  11559. END InitOperand;
  11560. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  11561. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  11562. BEGIN RETURN IntermediateCode.GetType(system, type)
  11563. END GetType;
  11564. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  11565. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  11566. BEGIN
  11567. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  11568. (*
  11569. UniqueId(name,module,name,adr);
  11570. *)
  11571. constant := SyntaxTree.NewConstant(-1,SyntaxTree.NewIdentifier(name));
  11572. constant.SetValue(value);
  11573. module.moduleScope.AddConstant(constant);
  11574. constant.SetScope(module.moduleScope);
  11575. RETURN constant
  11576. END BuildConstant;
  11577. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11578. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  11579. BEGIN
  11580. variable := scope.firstVariable;
  11581. WHILE variable # NIL DO
  11582. IF variable.NeedsTrace() THEN
  11583. RETURN TRUE;
  11584. END;
  11585. variable := variable.nextVariable;
  11586. END;
  11587. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11588. WHILE parameter # NIL DO
  11589. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  11590. RETURN TRUE;
  11591. END;
  11592. parameter := parameter.nextParameter;
  11593. END;
  11594. RETURN FALSE;
  11595. END HasPointers;
  11596. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  11597. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType));
  11598. END IsVariableParameter;
  11599. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  11600. VAR parameter: SyntaxTree.Parameter;
  11601. BEGIN
  11602. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  11603. WHILE parameter # NIL DO
  11604. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  11605. IF parameter.movable THEN RETURN TRUE END;
  11606. parameter := parameter.nextParameter;
  11607. END;
  11608. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  11609. END HasVariableParameters;
  11610. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  11611. BEGIN
  11612. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  11613. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  11614. END HasExplicitTraceMethod;
  11615. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  11616. BEGIN
  11617. IF expression.resolved # NIL THEN expression := expression.resolved END;
  11618. IF (expression IS SyntaxTree.IntegerValue) THEN
  11619. val := expression(SyntaxTree.IntegerValue).value;
  11620. RETURN TRUE
  11621. ELSE
  11622. RETURN FALSE
  11623. END;
  11624. END IsIntegerConstant;
  11625. PROCEDURE PowerOf2(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  11626. BEGIN
  11627. IF val <= 0 THEN RETURN FALSE END;
  11628. exp := 0;
  11629. WHILE ~ODD(val) DO
  11630. val := val DIV 2;
  11631. INC(exp)
  11632. END;
  11633. RETURN val = 1
  11634. END PowerOf2;
  11635. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  11636. VAR procedure: SyntaxTree.Procedure;
  11637. BEGIN
  11638. procedure := record.recordScope.constructor;
  11639. IF procedure = NIL THEN
  11640. record := record.GetBaseRecord();
  11641. IF record # NIL THEN
  11642. procedure := GetConstructor(record)
  11643. END;
  11644. END;
  11645. RETURN procedure;
  11646. END GetConstructor;
  11647. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  11648. BEGIN
  11649. value := SHORT(op.intValue);
  11650. RETURN op.mode = IntermediateCode.ModeImmediate;
  11651. END IsIntegerImmediate;
  11652. (** whether a type strictily is a pointer to record or object type
  11653. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  11654. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  11655. BEGIN
  11656. IF type = NIL THEN
  11657. RETURN FALSE
  11658. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  11659. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  11660. ELSE
  11661. RETURN FALSE
  11662. END
  11663. END IsStrictlyPointerToRecord;
  11664. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  11665. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  11666. END IsUnsafePointer;
  11667. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  11668. BEGIN type := type.resolved;
  11669. IF type IS SyntaxTree.PointerType THEN
  11670. type := type(SyntaxTree.PointerType).pointerBase;
  11671. type := type.resolved;
  11672. IF type IS SyntaxTree.RecordType THEN
  11673. recordType := type(SyntaxTree.RecordType);
  11674. RETURN TRUE
  11675. ELSE
  11676. RETURN FALSE
  11677. END
  11678. ELSIF type IS SyntaxTree.RecordType THEN
  11679. recordType := type(SyntaxTree.RecordType);
  11680. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  11681. ELSIF type IS SyntaxTree.ObjectType THEN
  11682. RETURN TRUE
  11683. ELSIF type IS SyntaxTree.AnyType THEN
  11684. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  11685. ELSE
  11686. RETURN FALSE
  11687. END;
  11688. END IsPointerToRecord;
  11689. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  11690. BEGIN
  11691. type := type.resolved;
  11692. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  11693. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  11694. END IsArrayOfSystemByte;
  11695. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  11696. BEGIN
  11697. IF type = NIL THEN RETURN FALSE END;
  11698. type := type.resolved;
  11699. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  11700. END IsOpenArray;
  11701. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  11702. BEGIN
  11703. IF type = NIL THEN RETURN FALSE END;
  11704. type := type.resolved;
  11705. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  11706. END IsStaticArray;
  11707. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  11708. VAR size: LONGINT;
  11709. BEGIN
  11710. size := 1;
  11711. WHILE (IsStaticArray(type)) DO
  11712. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  11713. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11714. END;
  11715. RETURN size;
  11716. END StaticArrayNumElements;
  11717. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11718. BEGIN
  11719. WHILE (IsStaticArray(type)) DO
  11720. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11721. END;
  11722. RETURN type;
  11723. END StaticArrayBaseType;
  11724. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  11725. BEGIN
  11726. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  11727. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  11728. END;
  11729. RETURN type;
  11730. END ArrayBaseType;
  11731. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  11732. BEGIN
  11733. IF type = NIL THEN RETURN FALSE END;
  11734. type := type.resolved;
  11735. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  11736. END IsDelegate;
  11737. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  11738. VAR i: LONGINT;
  11739. BEGIN
  11740. i := 0; type := type.resolved;
  11741. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  11742. INC(i);
  11743. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  11744. END;
  11745. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  11746. INC(i);
  11747. type := type(SyntaxTree.MathArrayType).arrayBase;
  11748. IF type # NIL THEN type := type.resolved END;
  11749. END;
  11750. RETURN i
  11751. END DynamicDim;
  11752. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  11753. BEGIN
  11754. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  11755. type := type(SyntaxTree.ArrayType).arrayBase;
  11756. END;
  11757. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  11758. type := type(SyntaxTree.MathArrayType).arrayBase;
  11759. END;
  11760. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  11761. END StaticSize;
  11762. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  11763. BEGIN
  11764. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  11765. END IsImmediate;
  11766. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  11767. BEGIN
  11768. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  11769. END IsAddress;
  11770. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  11771. BEGIN
  11772. RETURN (x.mode = IntermediateCode.ModeRegister);
  11773. END IsRegister;
  11774. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  11775. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  11776. BEGIN
  11777. typeDeclaration := recordType.typeDeclaration;
  11778. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  11779. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11780. END GetRecordTypeName;
  11781. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  11782. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  11783. BEGIN
  11784. parSize := 0;
  11785. IF StructuredReturnType(procedureType) THEN
  11786. parameter := procedureType.returnParameter;
  11787. INC(parSize,system.SizeOfParameter(parameter));
  11788. parSize := parSize + (-parSize) MOD system.addressSize;
  11789. END;
  11790. parameter :=procedureType.lastParameter;
  11791. WHILE (parameter # NIL) DO
  11792. INC(parSize,system.SizeOfParameter(parameter));
  11793. parSize := parSize + (-parSize) MOD system.addressSize;
  11794. parameter := parameter.prevParameter;
  11795. END;
  11796. IF procedureType.isDelegate THEN INC(parSize,system.addressSize) END; (* method => self pointer *)
  11797. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  11798. RETURN ToMemoryUnits(system,parSize)
  11799. END ParametersSize;
  11800. PROCEDURE ReturnedAsParameter(type: SyntaxTree.Type): BOOLEAN;
  11801. BEGIN
  11802. IF type = NIL THEN RETURN FALSE
  11803. ELSE
  11804. type := type.resolved;
  11805. RETURN (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR (type IS SyntaxTree.ProcedureType) OR SemanticChecker.IsPointerType(type)
  11806. OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.MathArrayType);
  11807. END
  11808. END ReturnedAsParameter;
  11809. PROCEDURE StructuredReturnType(procedureType: SyntaxTree.ProcedureType): BOOLEAN;
  11810. BEGIN
  11811. RETURN (procedureType # NIL) & (procedureType.callingConvention=SyntaxTree.OberonCallingConvention) & ReturnedAsParameter(procedureType.returnType);
  11812. END StructuredReturnType;
  11813. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  11814. BEGIN
  11815. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  11816. END IsNested;
  11817. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  11818. BEGIN
  11819. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  11820. scope := scope.outerScope;
  11821. END;
  11822. RETURN scope # NIL;
  11823. END InCellScope;
  11824. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  11825. BEGIN
  11826. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  11827. RETURN 0
  11828. ELSE
  11829. *)
  11830. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  11831. (*END;*)
  11832. END ProcedureParametersSize;
  11833. PROCEDURE ToMemoryUnits*(system: Global.System; size: LONGINT): LONGINT;
  11834. VAR dataUnit: LONGINT;
  11835. BEGIN dataUnit := system.dataUnit;
  11836. ASSERT(size MOD system.dataUnit = 0);
  11837. RETURN size DIV system.dataUnit
  11838. END ToMemoryUnits;
  11839. PROCEDURE Get*(): Backend.Backend;
  11840. VAR backend: IntermediateBackend;
  11841. BEGIN NEW(backend); RETURN backend
  11842. END Get;
  11843. PROCEDURE Nop(position: LONGINT):IntermediateCode.Instruction;
  11844. VAR instruction: IntermediateCode.Instruction;
  11845. BEGIN
  11846. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  11847. RETURN instruction
  11848. END Nop;
  11849. PROCEDURE Mov(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11850. VAR instruction: IntermediateCode.Instruction;
  11851. BEGIN
  11852. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  11853. RETURN instruction
  11854. END Mov;
  11855. (* like Mov but ensures that no new register will be allocated for dest *)
  11856. PROCEDURE MovReplace(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11857. VAR instruction: IntermediateCode.Instruction;
  11858. BEGIN
  11859. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  11860. RETURN instruction
  11861. END MovReplace;
  11862. PROCEDURE Conv(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11863. VAR instruction: IntermediateCode.Instruction;
  11864. BEGIN
  11865. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  11866. RETURN instruction
  11867. END Conv;
  11868. PROCEDURE Call*(position: LONGINT;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  11869. VAR instruction: IntermediateCode.Instruction;
  11870. BEGIN
  11871. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  11872. RETURN instruction
  11873. END Call;
  11874. PROCEDURE Exit(position: LONGINT;pcOffset: LONGINT; callingConvention: LONGINT): IntermediateCode.Instruction;
  11875. VAR op1, op2: IntermediateCode.Operand;
  11876. VAR instruction: IntermediateCode.Instruction;
  11877. BEGIN
  11878. IntermediateCode.InitNumber(op1,pcOffset);
  11879. IntermediateCode.InitNumber(op2,callingConvention);
  11880. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,emptyOperand);
  11881. RETURN instruction
  11882. END Exit;
  11883. PROCEDURE Return(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  11884. VAR instruction: IntermediateCode.Instruction;
  11885. BEGIN
  11886. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  11887. RETURN instruction
  11888. END Return;
  11889. PROCEDURE Result*(position: LONGINT;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  11890. VAR instruction: IntermediateCode.Instruction;
  11891. BEGIN
  11892. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  11893. RETURN instruction
  11894. END Result;
  11895. PROCEDURE Trap(position: LONGINT;nr: LONGINT): IntermediateCode.Instruction;
  11896. VAR op1: IntermediateCode.Operand;
  11897. VAR instruction: IntermediateCode.Instruction;
  11898. BEGIN
  11899. IntermediateCode.InitNumber(op1,nr);
  11900. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  11901. RETURN instruction
  11902. END Trap;
  11903. PROCEDURE Br(position: LONGINT;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  11904. VAR instruction: IntermediateCode.Instruction;
  11905. BEGIN
  11906. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  11907. RETURN instruction
  11908. END Br;
  11909. PROCEDURE Breq(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11910. VAR instruction: IntermediateCode.Instruction;
  11911. BEGIN
  11912. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  11913. RETURN instruction
  11914. END Breq;
  11915. PROCEDURE Brne(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11916. VAR instruction: IntermediateCode.Instruction;
  11917. BEGIN
  11918. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  11919. RETURN instruction
  11920. END Brne;
  11921. PROCEDURE Brge(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11922. VAR instruction: IntermediateCode.Instruction;
  11923. BEGIN
  11924. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  11925. RETURN instruction
  11926. END Brge;
  11927. PROCEDURE Brlt(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11928. VAR instruction: IntermediateCode.Instruction;
  11929. BEGIN
  11930. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  11931. RETURN instruction
  11932. END Brlt;
  11933. PROCEDURE Pop*(position: LONGINT;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  11934. VAR instruction: IntermediateCode.Instruction;
  11935. BEGIN
  11936. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  11937. RETURN instruction
  11938. END Pop;
  11939. PROCEDURE Push*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  11940. VAR instruction: IntermediateCode.Instruction;
  11941. BEGIN
  11942. ASSERT(op.mode # IntermediateCode.Undefined);
  11943. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  11944. RETURN instruction
  11945. END Push;
  11946. PROCEDURE Neg(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11947. VAR instruction: IntermediateCode.Instruction;
  11948. BEGIN
  11949. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  11950. RETURN instruction
  11951. END Neg;
  11952. PROCEDURE Not(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11953. VAR instruction: IntermediateCode.Instruction;
  11954. BEGIN
  11955. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  11956. RETURN instruction
  11957. END Not;
  11958. PROCEDURE Abs(position: LONGINT;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  11959. VAR instruction: IntermediateCode.Instruction;
  11960. BEGIN
  11961. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  11962. RETURN instruction
  11963. END Abs;
  11964. PROCEDURE Mul(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11965. VAR instruction: IntermediateCode.Instruction;
  11966. BEGIN
  11967. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  11968. RETURN instruction
  11969. END Mul;
  11970. PROCEDURE Div(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11971. VAR instruction: IntermediateCode.Instruction;
  11972. BEGIN
  11973. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  11974. RETURN instruction
  11975. END Div;
  11976. PROCEDURE Mod(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11977. VAR instruction: IntermediateCode.Instruction;
  11978. BEGIN
  11979. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  11980. RETURN instruction
  11981. END Mod;
  11982. PROCEDURE Sub(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11983. VAR instruction: IntermediateCode.Instruction;
  11984. BEGIN
  11985. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  11986. RETURN instruction
  11987. END Sub;
  11988. PROCEDURE Add(position: LONGINT;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11989. VAR instruction: IntermediateCode.Instruction;
  11990. BEGIN
  11991. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  11992. RETURN instruction
  11993. END Add;
  11994. PROCEDURE And(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  11995. VAR instruction: IntermediateCode.Instruction;
  11996. BEGIN
  11997. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  11998. RETURN instruction
  11999. END And;
  12000. PROCEDURE Or(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12001. VAR instruction: IntermediateCode.Instruction;
  12002. BEGIN
  12003. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  12004. RETURN instruction
  12005. END Or;
  12006. PROCEDURE Xor(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12007. VAR instruction: IntermediateCode.Instruction;
  12008. BEGIN
  12009. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  12010. RETURN instruction
  12011. END Xor;
  12012. PROCEDURE Shl(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12013. VAR instruction: IntermediateCode.Instruction;
  12014. BEGIN
  12015. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  12016. RETURN instruction
  12017. END Shl;
  12018. PROCEDURE Shr(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12019. VAR instruction: IntermediateCode.Instruction;
  12020. BEGIN
  12021. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  12022. RETURN instruction
  12023. END Shr;
  12024. PROCEDURE Rol(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12025. VAR instruction: IntermediateCode.Instruction;
  12026. BEGIN
  12027. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  12028. RETURN instruction
  12029. END Rol;
  12030. PROCEDURE Ror(position: LONGINT;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  12031. VAR instruction: IntermediateCode.Instruction;
  12032. BEGIN
  12033. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  12034. RETURN instruction
  12035. END Ror;
  12036. PROCEDURE Cas(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12037. VAR instruction: IntermediateCode.Instruction;
  12038. BEGIN
  12039. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  12040. RETURN instruction
  12041. END Cas;
  12042. PROCEDURE Copy(position: LONGINT;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  12043. VAR instruction: IntermediateCode.Instruction;
  12044. BEGIN
  12045. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  12046. RETURN instruction
  12047. END Copy;
  12048. PROCEDURE Fill(position: LONGINT;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  12049. VAR instruction: IntermediateCode.Instruction;
  12050. BEGIN
  12051. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  12052. RETURN instruction
  12053. END Fill;
  12054. PROCEDURE Asm(position: LONGINT;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  12055. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  12056. BEGIN
  12057. string := IntermediateCode.String(s);
  12058. IntermediateCode.SetIntValue(string,position); (* for error reporting *)
  12059. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  12060. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  12061. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  12062. RETURN instruction
  12063. END Asm;
  12064. PROCEDURE Data*(position: LONGINT;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  12065. VAR instruction: IntermediateCode.Instruction;
  12066. BEGIN
  12067. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  12068. RETURN instruction
  12069. END Data;
  12070. PROCEDURE SpecialInstruction(position: LONGINT;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  12071. VAR instruction: IntermediateCode.Instruction;
  12072. BEGIN
  12073. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  12074. IntermediateCode.SetSubType(instruction, subtype);
  12075. RETURN instruction
  12076. END SpecialInstruction;
  12077. PROCEDURE Reserve(position: LONGINT;units: LONGINT): IntermediateCode.Instruction;
  12078. VAR op1: IntermediateCode.Operand;
  12079. VAR instruction: IntermediateCode.Instruction;
  12080. BEGIN
  12081. (*! generate a warning if size exceeds a certain limit *)
  12082. (*
  12083. ASSERT(bytes < 1000000); (* sanity check *)
  12084. *)
  12085. ASSERT(0 <= units); (* sanity check *)
  12086. IntermediateCode.InitNumber(op1,units);
  12087. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  12088. RETURN instruction
  12089. END Reserve;
  12090. PROCEDURE LabelInstruction(position: LONGINT): IntermediateCode.Instruction;
  12091. VAR op1: IntermediateCode.Operand;
  12092. VAR instruction: IntermediateCode.Instruction;
  12093. BEGIN
  12094. IntermediateCode.InitNumber(op1,position);
  12095. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  12096. RETURN instruction
  12097. END LabelInstruction;
  12098. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  12099. VAR pc: LONGINT;
  12100. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  12101. BEGIN
  12102. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  12103. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  12104. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  12105. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  12106. IF instr.op1.type.form = IntermediateCode.Float THEN
  12107. RETURN instr.op1.floatValue = op.floatValue
  12108. ELSE
  12109. RETURN instr.op1.intValue = op.intValue
  12110. END;
  12111. END ProvidesValue;
  12112. BEGIN
  12113. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  12114. pc := 0;
  12115. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  12116. INC(pc);
  12117. END;
  12118. IF pc = data.pc THEN
  12119. data.Emit(Data(-1,vop));
  12120. END;
  12121. RETURN pc
  12122. END EnterImmediate;
  12123. PROCEDURE Init;
  12124. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  12125. BEGIN
  12126. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  12127. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  12128. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  12129. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  12130. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  12131. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  12132. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  12133. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  12134. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  12135. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  12136. IntermediateCode.InitOperand(emptyOperand);
  12137. FOR i := 0 TO NumberSystemCalls-1 DO
  12138. name := "@SystemCall";
  12139. Basic.AppendNumber(name,i);
  12140. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  12141. END;
  12142. END Init;
  12143. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  12144. BEGIN
  12145. RETURN (symbol # NIL) & (symbol.access * SyntaxTree.Public # {})
  12146. END IsExported;
  12147. BEGIN
  12148. Init;
  12149. END FoxIntermediateBackend.
  12150. Compiler.Compile FoxIntermediateBackend.Mod ~