FoxIntermediateBackend.Mod 579 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772107731077410775107761077710778107791078010781107821078310784107851078610787107881078910790107911079210793107941079510796107971079810799108001080110802108031080410805108061080710808108091081010811108121081310814108151081610817108181081910820108211082210823108241082510826108271082810829108301083110832108331083410835108361083710838108391084010841108421084310844108451084610847108481084910850108511085210853108541085510856108571085810859108601086110862108631086410865108661086710868108691087010871108721087310874108751087610877108781087910880108811088210883108841088510886108871088810889108901089110892108931089410895108961089710898108991090010901109021090310904109051090610907109081090910910109111091210913109141091510916109171091810919109201092110922109231092410925109261092710928109291093010931109321093310934109351093610937109381093910940109411094210943109441094510946109471094810949109501095110952109531095410955109561095710958109591096010961109621096310964109651096610967109681096910970109711097210973109741097510976109771097810979109801098110982109831098410985109861098710988109891099010991109921099310994109951099610997109981099911000110011100211003110041100511006110071100811009110101101111012110131101411015110161101711018110191102011021110221102311024110251102611027110281102911030110311103211033110341103511036110371103811039110401104111042110431104411045110461104711048110491105011051110521105311054110551105611057110581105911060110611106211063110641106511066110671106811069110701107111072110731107411075110761107711078110791108011081110821108311084110851108611087110881108911090110911109211093110941109511096110971109811099111001110111102111031110411105111061110711108111091111011111111121111311114111151111611117111181111911120111211112211123111241112511126111271112811129111301113111132111331113411135111361113711138111391114011141111421114311144111451114611147111481114911150111511115211153111541115511156111571115811159111601116111162111631116411165111661116711168111691117011171111721117311174111751117611177111781117911180111811118211183111841118511186111871118811189111901119111192111931119411195111961119711198111991120011201112021120311204112051120611207112081120911210112111121211213112141121511216112171121811219112201122111222112231122411225112261122711228112291123011231112321123311234112351123611237112381123911240112411124211243112441124511246112471124811249112501125111252112531125411255112561125711258112591126011261112621126311264112651126611267112681126911270112711127211273112741127511276112771127811279112801128111282112831128411285112861128711288112891129011291112921129311294112951129611297112981129911300113011130211303113041130511306113071130811309113101131111312113131131411315113161131711318113191132011321113221132311324113251132611327113281132911330113311133211333113341133511336113371133811339113401134111342113431134411345113461134711348113491135011351113521135311354113551135611357113581135911360113611136211363113641136511366113671136811369113701137111372113731137411375113761137711378113791138011381113821138311384113851138611387113881138911390113911139211393113941139511396113971139811399114001140111402114031140411405114061140711408114091141011411114121141311414114151141611417114181141911420114211142211423114241142511426114271142811429114301143111432114331143411435114361143711438114391144011441114421144311444114451144611447114481144911450114511145211453114541145511456114571145811459114601146111462114631146411465114661146711468114691147011471114721147311474114751147611477114781147911480114811148211483114841148511486114871148811489114901149111492114931149411495114961149711498114991150011501115021150311504115051150611507115081150911510115111151211513115141151511516115171151811519115201152111522115231152411525115261152711528115291153011531115321153311534115351153611537115381153911540115411154211543115441154511546115471154811549115501155111552115531155411555115561155711558115591156011561115621156311564115651156611567115681156911570115711157211573115741157511576115771157811579115801158111582115831158411585115861158711588115891159011591115921159311594115951159611597115981159911600116011160211603116041160511606116071160811609116101161111612116131161411615116161161711618116191162011621116221162311624116251162611627116281162911630116311163211633116341163511636116371163811639116401164111642116431164411645116461164711648116491165011651116521165311654116551165611657116581165911660116611166211663116641166511666116671166811669116701167111672116731167411675116761167711678116791168011681116821168311684116851168611687116881168911690116911169211693116941169511696116971169811699117001170111702117031170411705117061170711708117091171011711117121171311714117151171611717117181171911720117211172211723117241172511726117271172811729117301173111732117331173411735117361173711738117391174011741117421174311744117451174611747117481174911750117511175211753117541175511756117571175811759117601176111762117631176411765117661176711768117691177011771117721177311774117751177611777117781177911780117811178211783117841178511786117871178811789117901179111792117931179411795117961179711798117991180011801118021180311804118051180611807118081180911810118111181211813118141181511816118171181811819118201182111822118231182411825118261182711828118291183011831118321183311834118351183611837118381183911840118411184211843118441184511846118471184811849118501185111852118531185411855118561185711858118591186011861118621186311864118651186611867118681186911870118711187211873118741187511876118771187811879118801188111882118831188411885118861188711888118891189011891118921189311894118951189611897118981189911900119011190211903119041190511906119071190811909119101191111912119131191411915119161191711918119191192011921119221192311924119251192611927119281192911930119311193211933119341193511936119371193811939119401194111942119431194411945119461194711948119491195011951119521195311954119551195611957119581195911960119611196211963119641196511966119671196811969119701197111972119731197411975119761197711978119791198011981119821198311984119851198611987119881198911990119911199211993119941199511996119971199811999120001200112002120031200412005120061200712008120091201012011120121201312014120151201612017120181201912020120211202212023120241202512026120271202812029120301203112032120331203412035120361203712038120391204012041120421204312044120451204612047120481204912050120511205212053120541205512056120571205812059120601206112062120631206412065120661206712068120691207012071120721207312074120751207612077120781207912080120811208212083120841208512086120871208812089120901209112092120931209412095120961209712098120991210012101121021210312104121051210612107121081210912110121111211212113121141211512116121171211812119121201212112122121231212412125121261212712128121291213012131121321213312134121351213612137121381213912140121411214212143121441214512146121471214812149121501215112152121531215412155121561215712158121591216012161121621216312164121651216612167121681216912170121711217212173121741217512176121771217812179121801218112182121831218412185121861218712188121891219012191121921219312194121951219612197121981219912200122011220212203122041220512206122071220812209122101221112212122131221412215122161221712218122191222012221122221222312224122251222612227122281222912230122311223212233122341223512236122371223812239122401224112242122431224412245122461224712248122491225012251122521225312254122551225612257122581225912260122611226212263122641226512266122671226812269122701227112272122731227412275122761227712278122791228012281122821228312284122851228612287122881228912290122911229212293122941229512296122971229812299123001230112302123031230412305123061230712308123091231012311123121231312314123151231612317123181231912320123211232212323123241232512326123271232812329123301233112332123331233412335123361233712338123391234012341123421234312344123451234612347123481234912350123511235212353123541235512356123571235812359123601236112362123631236412365123661236712368123691237012371123721237312374123751237612377123781237912380123811238212383123841238512386123871238812389123901239112392123931239412395123961239712398123991240012401124021240312404124051240612407124081240912410124111241212413124141241512416124171241812419124201242112422124231242412425124261242712428124291243012431124321243312434124351243612437124381243912440124411244212443124441244512446124471244812449124501245112452124531245412455124561245712458124591246012461124621246312464124651246612467124681246912470124711247212473124741247512476124771247812479124801248112482124831248412485124861248712488124891249012491124921249312494124951249612497124981249912500125011250212503125041250512506125071250812509125101251112512125131251412515125161251712518125191252012521125221252312524125251252612527125281252912530125311253212533125341253512536125371253812539125401254112542125431254412545125461254712548125491255012551125521255312554125551255612557125581255912560125611256212563125641256512566125671256812569125701257112572125731257412575125761257712578125791258012581125821258312584125851258612587125881258912590125911259212593125941259512596125971259812599126001260112602126031260412605126061260712608126091261012611126121261312614126151261612617126181261912620126211262212623126241262512626126271262812629126301263112632126331263412635126361263712638126391264012641126421264312644126451264612647126481264912650126511265212653126541265512656126571265812659126601266112662126631266412665126661266712668126691267012671126721267312674126751267612677126781267912680126811268212683126841268512686126871268812689126901269112692126931269412695126961269712698126991270012701127021270312704127051270612707127081270912710127111271212713127141271512716127171271812719127201272112722127231272412725127261272712728127291273012731127321273312734127351273612737127381273912740127411274212743127441274512746127471274812749127501275112752127531275412755127561275712758127591276012761127621276312764127651276612767127681276912770127711277212773127741277512776127771277812779127801278112782127831278412785127861278712788127891279012791127921279312794127951279612797127981279912800128011280212803128041280512806128071280812809128101281112812128131281412815128161281712818128191282012821128221282312824128251282612827128281282912830128311283212833128341283512836128371283812839128401284112842128431284412845128461284712848128491285012851128521285312854128551285612857128581285912860128611286212863128641286512866128671286812869128701287112872128731287412875128761287712878128791288012881128821288312884128851288612887128881288912890128911289212893128941289512896128971289812899129001290112902129031290412905129061290712908129091291012911129121291312914129151291612917129181291912920129211292212923129241292512926129271292812929129301293112932129331293412935129361293712938129391294012941129421294312944129451294612947129481294912950129511295212953129541295512956129571295812959129601296112962129631296412965129661296712968129691297012971129721297312974129751297612977129781297912980129811298212983129841298512986129871298812989129901299112992129931299412995129961299712998129991300013001130021300313004130051300613007130081300913010130111301213013130141301513016130171301813019130201302113022130231302413025130261302713028130291303013031130321303313034130351303613037130381303913040130411304213043130441304513046130471304813049130501305113052130531305413055130561305713058130591306013061130621306313064130651306613067130681306913070130711307213073130741307513076130771307813079130801308113082130831308413085130861308713088130891309013091130921309313094130951309613097130981309913100131011310213103131041310513106131071310813109131101311113112131131311413115131161311713118131191312013121131221312313124131251312613127131281312913130131311313213133131341313513136131371313813139131401314113142131431314413145131461314713148131491315013151131521315313154131551315613157131581315913160131611316213163131641316513166131671316813169131701317113172131731317413175131761317713178131791318013181131821318313184131851318613187131881318913190131911319213193131941319513196131971319813199132001320113202132031320413205132061320713208132091321013211132121321313214132151321613217132181321913220132211322213223132241322513226132271322813229132301323113232132331323413235132361323713238132391324013241132421324313244132451324613247132481324913250132511325213253132541325513256132571325813259132601326113262132631326413265132661326713268132691327013271132721327313274132751327613277132781327913280132811328213283132841328513286132871328813289132901329113292132931329413295132961329713298132991330013301133021330313304133051330613307133081330913310133111331213313133141331513316133171331813319133201332113322133231332413325133261332713328133291333013331133321333313334133351333613337133381333913340133411334213343133441334513346133471334813349133501335113352133531335413355133561335713358133591336013361133621336313364133651336613367133681336913370133711337213373133741337513376133771337813379133801338113382133831338413385133861338713388133891339013391133921339313394133951339613397133981339913400134011340213403134041340513406134071340813409134101341113412134131341413415134161341713418134191342013421134221342313424134251342613427134281342913430134311343213433134341343513436134371343813439134401344113442134431344413445134461344713448134491345013451134521345313454134551345613457134581345913460134611346213463134641346513466134671346813469134701347113472134731347413475134761347713478134791348013481134821348313484134851348613487134881348913490134911349213493134941349513496134971349813499135001350113502135031350413505135061350713508135091351013511135121351313514135151351613517135181351913520135211352213523135241352513526135271352813529135301353113532135331353413535135361353713538135391354013541135421354313544135451354613547135481354913550135511355213553135541355513556135571355813559135601356113562135631356413565135661356713568135691357013571135721357313574135751357613577135781357913580135811358213583135841358513586135871358813589135901359113592135931359413595135961359713598135991360013601136021360313604136051360613607136081360913610136111361213613136141361513616136171361813619136201362113622136231362413625136261362713628136291363013631136321363313634136351363613637136381363913640136411364213643136441364513646136471364813649136501365113652136531365413655136561365713658136591366013661136621366313664136651366613667136681366913670136711367213673136741367513676136771367813679136801368113682136831368413685136861368713688136891369013691136921369313694136951369613697136981369913700137011370213703137041370513706137071370813709137101371113712137131371413715137161371713718137191372013721137221372313724137251372613727137281372913730137311373213733137341373513736137371373813739137401374113742137431374413745137461374713748137491375013751137521375313754137551375613757137581375913760137611376213763137641376513766137671376813769137701377113772137731377413775137761377713778137791378013781137821378313784137851378613787137881378913790137911379213793137941379513796137971379813799138001380113802138031380413805138061380713808138091381013811138121381313814138151381613817138181381913820138211382213823138241382513826138271382813829138301383113832138331383413835138361383713838138391384013841138421384313844138451384613847138481384913850138511385213853138541385513856138571385813859138601386113862138631386413865138661386713868138691387013871138721387313874138751387613877138781387913880138811388213883138841388513886138871388813889138901389113892138931389413895138961389713898138991390013901139021390313904139051390613907139081390913910139111391213913139141391513916139171391813919139201392113922139231392413925139261392713928139291393013931139321393313934139351393613937139381393913940139411394213943139441394513946139471394813949139501395113952139531395413955139561395713958139591396013961139621396313964139651396613967139681396913970139711397213973139741397513976139771397813979139801398113982139831398413985139861398713988139891399013991139921399313994139951399613997139981399914000140011400214003140041400514006140071400814009140101401114012140131401414015140161401714018140191402014021140221402314024140251402614027140281402914030140311403214033140341403514036140371403814039140401404114042140431404414045140461404714048140491405014051140521405314054140551405614057140581405914060140611406214063140641406514066140671406814069140701407114072140731407414075140761407714078140791408014081140821408314084140851408614087140881408914090140911409214093140941409514096140971409814099141001410114102141031410414105141061410714108141091411014111141121411314114141151411614117141181411914120141211412214123141241412514126141271412814129141301413114132141331413414135141361413714138141391414014141141421414314144141451414614147141481414914150141511415214153141541415514156141571415814159141601416114162141631416414165141661416714168141691417014171141721417314174141751417614177141781417914180141811418214183141841418514186141871418814189141901419114192141931419414195141961419714198141991420014201142021420314204142051420614207142081420914210142111421214213142141421514216142171421814219142201422114222142231422414225142261422714228142291423014231142321423314234142351423614237142381423914240142411424214243142441424514246142471424814249142501425114252142531425414255142561425714258142591426014261142621426314264142651426614267142681426914270142711427214273142741427514276142771427814279142801428114282142831428414285142861428714288142891429014291142921429314294142951429614297142981429914300143011430214303143041430514306143071430814309143101431114312143131431414315143161431714318143191432014321143221432314324143251432614327143281432914330143311433214333143341433514336143371433814339143401434114342143431434414345143461434714348143491435014351143521435314354143551435614357143581435914360143611436214363143641436514366143671436814369143701437114372143731437414375143761437714378143791438014381143821438314384143851438614387143881438914390143911439214393143941439514396143971439814399144001440114402144031440414405144061440714408144091441014411144121441314414144151441614417144181441914420144211442214423144241442514426144271442814429144301443114432144331443414435144361443714438144391444014441144421444314444144451444614447144481444914450144511445214453144541445514456144571445814459144601446114462144631446414465144661446714468144691447014471144721447314474144751447614477144781447914480144811448214483144841448514486144871448814489144901449114492144931449414495144961449714498144991450014501145021450314504145051450614507145081450914510145111451214513145141451514516145171451814519145201452114522145231452414525145261452714528145291453014531145321453314534145351453614537145381453914540145411454214543145441454514546145471454814549145501455114552145531455414555145561455714558145591456014561145621456314564145651456614567145681456914570145711457214573145741457514576145771457814579145801458114582145831458414585145861458714588145891459014591145921459314594145951459614597145981459914600146011460214603146041460514606146071460814609146101461114612146131461414615146161461714618146191462014621146221462314624146251462614627146281462914630146311463214633146341463514636146371463814639146401464114642146431464414645146461464714648146491465014651146521465314654146551465614657146581465914660146611466214663146641466514666146671466814669146701467114672146731467414675146761467714678146791468014681146821468314684146851468614687146881468914690146911469214693146941469514696146971469814699147001470114702147031470414705147061470714708147091471014711147121471314714147151471614717147181471914720147211472214723147241472514726147271472814729147301473114732147331473414735147361473714738147391474014741147421474314744147451474614747147481474914750147511475214753147541475514756147571475814759147601476114762147631476414765147661476714768147691477014771147721477314774147751477614777147781477914780147811478214783147841478514786147871478814789147901479114792147931479414795147961479714798147991480014801148021480314804148051480614807
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Diagnostics, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool, CRC;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. RethrowTrap* = 18; (* rethrow exception after unlock *)
  42. Trace = FALSE;
  43. TraceRegisterUsageCount=TRUE;
  44. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  45. (** system call numbers *)
  46. NumberSystemCalls* = 12;
  47. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  48. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  49. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  50. DefaultRuntimeModuleName ="Runtime";
  51. DefaultTraceModuleName ="KernelLog";
  52. ChannelModuleName = "Channels";
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. EntryPriority=-4;
  59. FirstPriority=-3;
  60. InitPriority=-2;
  61. ExitPriority=-1;
  62. BasePointerTypeSize = 5;
  63. BaseArrayTypeSize = BasePointerTypeSize + 3;
  64. LengthOffset = BasePointerTypeSize + 0;
  65. DataOffset = BasePointerTypeSize + 1;
  66. DescriptorOffset = BasePointerTypeSize + 2;
  67. BaseRecordTypeSize = BasePointerTypeSize + 2;
  68. ActionOffset = BasePointerTypeSize + 0;
  69. MonitorOffset = BasePointerTypeSize + 1;
  70. BaseObjectTypeSize = BaseRecordTypeSize;
  71. ActionTypeSize = 3;
  72. MonitorTypeSize = 7;
  73. ProcessorOffset = BaseObjectTypeSize + 1;
  74. StackLimitOffset* = BaseObjectTypeSize + 3;
  75. QuantumOffset = BaseObjectTypeSize + 4;
  76. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  77. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  78. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  79. Size2Flag = 4; (* size = 2 *)
  80. Size3Flag = 5; (* size = 3 *)
  81. Size4Flag = 6; (* size = 4 *)
  82. Size5Flag = 7; (* size = 5 *)
  83. Size6Flag = 8; (* size = 6 *)
  84. Size7Flag = 9; (* size = 7 *)
  85. Size8Flag = 10; (* size = 8 *)
  86. ReflectionSupport = TRUE;
  87. (* Solution for identifying procedure descriptors on the stack and for being able to differentiate "old school" stack frames from the underlying operating system stack frames:
  88. push a procedure desriptor plus one to where the BP pointer would be located. The misalignment of the procedure descriptor makes it possible to identify that it is not
  89. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  90. *)
  91. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  92. ProtectModulesPointers = FALSE;
  93. CreateProcedureDescInfo = TRUE;
  94. WarningDynamicLoading = FALSE;
  95. TYPE
  96. Position=SyntaxTree.Position;
  97. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  98. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  99. Operand = RECORD
  100. mode: SHORTINT;
  101. op: IntermediateCode.Operand;
  102. tag: IntermediateCode.Operand;
  103. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  104. dimOffset: LONGINT;
  105. END;
  106. Fixup= POINTER TO RECORD
  107. pc: LONGINT;
  108. nextFixup: Fixup;
  109. END;
  110. WriteBackCall = POINTER TO RECORD
  111. call: SyntaxTree.ProcedureCallDesignator;
  112. next: WriteBackCall;
  113. END;
  114. Label= OBJECT
  115. VAR
  116. fixups: Fixup;
  117. section: IntermediateCode.Section;
  118. pc: LONGINT;
  119. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  120. BEGIN
  121. SELF.section := section; pc := -1;
  122. END InitLabel;
  123. PROCEDURE Resolve(pc: LONGINT);
  124. VAR at: LONGINT;
  125. BEGIN
  126. SELF.pc := pc;
  127. WHILE(fixups # NIL) DO
  128. at := fixups.pc;
  129. section.PatchAddress(at,pc);
  130. fixups := fixups.nextFixup;
  131. END;
  132. END Resolve;
  133. PROCEDURE AddFixup(at: LONGINT);
  134. VAR fixup: Fixup;
  135. BEGIN
  136. ASSERT(pc=-1);
  137. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  138. END AddFixup;
  139. END Label;
  140. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  141. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  142. VAR
  143. backend: IntermediateBackend;
  144. implementationVisitor: ImplementationVisitor;
  145. meta: MetaDataGenerator;
  146. system: Global.System;
  147. currentScope: SyntaxTree.Scope;
  148. module: Sections.Module;
  149. moduleSelf: SyntaxTree.Variable;
  150. dump: BOOLEAN;
  151. forceModuleBody: BOOLEAN;
  152. addressType: IntermediateCode.Type;
  153. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  154. BEGIN
  155. currentScope := NIL; module := NIL; moduleSelf := NIL;
  156. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  157. SELF.dump := dump;
  158. SELF.backend := backend;
  159. SELF.forceModuleBody := forceModuleBody;
  160. addressType := IntermediateCode.GetType(system,system.addressType)
  161. END Init;
  162. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  163. BEGIN
  164. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  165. END Error;
  166. PROCEDURE Type(x: SyntaxTree.Type);
  167. BEGIN
  168. x.Accept(SELF);
  169. END Type;
  170. (** types **)
  171. PROCEDURE VisitBasicType*(x: SyntaxTree.BasicType);
  172. BEGIN (* no code emission *) END VisitBasicType;
  173. PROCEDURE VisitCharacterType*(x: SyntaxTree.CharacterType);
  174. BEGIN (* no code emission *) END VisitCharacterType;
  175. PROCEDURE VisitIntegerType*(x: SyntaxTree.IntegerType);
  176. BEGIN (* no code emission *) END VisitIntegerType;
  177. PROCEDURE VisitFloatType*(x: SyntaxTree.FloatType);
  178. BEGIN (* no code emission *) END VisitFloatType;
  179. PROCEDURE VisitComplexType*(x: SyntaxTree.ComplexType);
  180. BEGIN (* no code emission *) END VisitComplexType;
  181. PROCEDURE VisitQualifiedType*(x: SyntaxTree.QualifiedType);
  182. VAR type: SyntaxTree.Type;
  183. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  184. type := x.resolved;
  185. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  186. meta.CheckTypeDeclaration(type);
  187. END;
  188. END VisitQualifiedType;
  189. PROCEDURE VisitStringType*(x: SyntaxTree.StringType);
  190. BEGIN (* no code emission *) END VisitStringType;
  191. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  192. BEGIN (* no code emission *)
  193. END VisitArrayRangeType;
  194. PROCEDURE VisitArrayType*(x: SyntaxTree.ArrayType);
  195. BEGIN (* no code emission *) END VisitArrayType;
  196. PROCEDURE VisitPortType*(x: SyntaxTree.PortType);
  197. BEGIN (* no code emission *) END VisitPortType;
  198. PROCEDURE VisitMathArrayType*(x: SyntaxTree.MathArrayType);
  199. BEGIN
  200. meta.CheckTypeDeclaration(x);
  201. END VisitMathArrayType;
  202. PROCEDURE VisitPointerType*(x: SyntaxTree.PointerType);
  203. BEGIN
  204. meta.CheckTypeDeclaration(x);
  205. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  206. END VisitPointerType;
  207. PROCEDURE VisitRecordType*(x: SyntaxTree.RecordType);
  208. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  209. BEGIN (* no code emission *)
  210. meta.CheckTypeDeclaration(x);
  211. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  212. IF x.pointerType.typeDeclaration # NIL THEN
  213. td := x.pointerType.typeDeclaration
  214. ELSE
  215. td := x.typeDeclaration
  216. END;
  217. Global.GetSymbolName(td,name);
  218. (* code section for object *)
  219. END;
  220. Scope(x.recordScope);
  221. END VisitRecordType;
  222. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  223. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  224. BEGIN
  225. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  226. WHILE (this # NIL) & (this.identifier# id) DO
  227. this := this.nextModifier;
  228. END;
  229. RETURN this # NIL
  230. END HasFlag;
  231. PROCEDURE VisitCellType*(x: SyntaxTree.CellType);
  232. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  233. BEGIN
  234. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  235. capabilities := {};
  236. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  237. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  238. backend.SetCapabilities(capabilities);
  239. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  240. Scope(x.cellScope);
  241. END;
  242. END VisitCellType;
  243. PROCEDURE VisitProcedureType*(x: SyntaxTree.ProcedureType);
  244. BEGIN (* no code emission *) END VisitProcedureType;
  245. PROCEDURE VisitEnumerationType*(x: SyntaxTree.EnumerationType);
  246. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  247. END VisitEnumerationType;
  248. (* symbols *)
  249. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  250. BEGIN
  251. Procedure(x);
  252. END VisitProcedure;
  253. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  254. BEGIN
  255. Procedure(x);
  256. END VisitOperator;
  257. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  258. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  259. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  260. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  261. BEGIN
  262. type := type.resolved;
  263. IF type IS SyntaxTree.RecordType THEN
  264. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  265. ELSIF (type IS SyntaxTree.ArrayType) THEN
  266. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  267. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  268. END;
  269. ELSIF type IS SyntaxTree.MathArrayType THEN
  270. WITH type: SyntaxTree.MathArrayType DO
  271. IF type.form = SyntaxTree.Open THEN
  272. RETURN TRUE
  273. ELSIF type.form = SyntaxTree.Static THEN
  274. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  275. END;
  276. END;
  277. END;
  278. RETURN FALSE
  279. END TypeNeedsInitialization;
  280. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  281. VAR variable: SyntaxTree.Variable;
  282. BEGIN
  283. variable := scope.firstVariable;
  284. WHILE variable # NIL DO
  285. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  286. IF variable.initializer # NIL THEN RETURN TRUE END;
  287. variable := variable.nextVariable;
  288. END;
  289. RETURN FALSE
  290. END ScopeNeedsInitialization;
  291. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  292. VAR size: LONGINT;
  293. BEGIN
  294. size := offset - lastUpdated;
  295. IF size > 0 THEN
  296. irv.Emit(Reserve(x.position,size));
  297. END;
  298. irv.Emit(Data(x.position, op));
  299. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  300. END SingleInitialize;
  301. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  302. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  303. BEGIN
  304. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  305. WITH type: SyntaxTree.RecordType DO
  306. baseType := type.baseType;
  307. IF baseType # NIL THEN
  308. baseType := baseType.resolved;
  309. IF baseType IS SyntaxTree.PointerType THEN
  310. baseType := baseType(SyntaxTree.PointerType).pointerBase
  311. END;
  312. Initialize(baseType,NIL, offset);
  313. END;
  314. variable := type.recordScope.firstVariable;
  315. WHILE variable # NIL DO
  316. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  317. variable := variable.nextVariable
  318. END;
  319. | type: SyntaxTree.ArrayType DO
  320. IF type.form = SyntaxTree.Static THEN
  321. baseType := type.arrayBase;
  322. IF TypeNeedsInitialization(baseType) THEN
  323. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  324. FOR i := 0 TO type.staticLength-1 DO
  325. Initialize(baseType,NIL,offset+i*size);
  326. END;
  327. END;
  328. END;
  329. | type: SyntaxTree.MathArrayType DO
  330. IF type.form = SyntaxTree.Open THEN
  331. dim := DynamicDim(type);
  332. baseType := SemanticChecker.ArrayBase(type,dim);
  333. imm := IntermediateCode.Immediate(addressType,dim);
  334. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  335. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  336. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  337. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  338. (* flags remain empty (=0) for open array *)
  339. ELSIF type.form = SyntaxTree.Static THEN
  340. baseType := type.arrayBase;
  341. IF TypeNeedsInitialization(baseType) THEN
  342. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  343. ASSERT(type.staticLength < 1024*1024*1024);
  344. FOR i := 0 TO type.staticLength-1 DO
  345. Initialize(baseType,NIL,offset+i*size);
  346. END;
  347. END;
  348. END;
  349. ELSE
  350. IF initializer # NIL THEN
  351. implementationVisitor.Evaluate(initializer, op);
  352. SingleInitialize(op.op, offset);
  353. END;
  354. END;
  355. END Initialize;
  356. BEGIN
  357. IF x.externalName # NIL THEN RETURN END;
  358. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  359. (* code section for variable *)
  360. Global.GetSymbolSegmentedName(x,name);
  361. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  362. irv.SetExported(IsExported(x));
  363. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  364. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  365. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  366. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  367. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  368. FOR i := 0 TO DynamicDim(x.type)-1 DO
  369. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  370. END;
  371. ELSE
  372. lastUpdated:= 0;
  373. IF implementationVisitor.newObjectFile & ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  374. Initialize(x.type, x.initializer, 0);
  375. END;
  376. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  377. IF size > 0 THEN
  378. irv.Emit(Reserve(x.position,size));
  379. END;
  380. IF ~x.fixed THEN
  381. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  382. ELSE
  383. align := x.alignment;
  384. END;
  385. irv.SetPositionOrAlignment(x.fixed, align);
  386. meta.CheckTypeDeclaration(x.type);
  387. END;
  388. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  389. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  390. END;
  391. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  392. END VisitVariable;
  393. PROCEDURE VisitProperty*(x: SyntaxTree.Property);
  394. BEGIN
  395. VisitVariable(x)
  396. END VisitProperty;
  397. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  398. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  399. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  400. BEGIN
  401. ASSERT(currentScope IS SyntaxTree.CellScope);
  402. Global.GetSymbolSegmentedName(x,name);
  403. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  404. irv.SetExported(IsExported(x));
  405. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  406. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  407. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  408. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  409. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  410. FOR i := 0 TO DynamicDim(x.type)-1 DO
  411. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  412. END;
  413. ELSE
  414. lastUpdated:= 0;
  415. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  416. IF size > 0 THEN
  417. irv.Emit(Reserve(x.position,size));
  418. END;
  419. IF ~x.fixed THEN
  420. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  421. ELSE
  422. align := x.alignment;
  423. END;
  424. irv.SetPositionOrAlignment(x.fixed, align);
  425. meta.CheckTypeDeclaration(x.type);
  426. END;
  427. END VisitParameter;
  428. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  429. BEGIN
  430. Type(x.declaredType); (* => code in objects *)
  431. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  432. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  433. END;
  434. END VisitTypeDeclaration;
  435. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  436. BEGIN
  437. IF (SyntaxTree.Public * x.access # {}) THEN
  438. implementationVisitor.VisitConstant(x);
  439. END;
  440. END VisitConstant;
  441. PROCEDURE Scope(x: SyntaxTree.Scope);
  442. VAR procedure: SyntaxTree.Procedure;
  443. constant: SyntaxTree.Constant;
  444. variable: SyntaxTree.Variable;
  445. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  446. cell: SyntaxTree.CellType;
  447. parameter: SyntaxTree.Parameter;
  448. property: SyntaxTree.Property;
  449. BEGIN
  450. prevScope := currentScope;
  451. currentScope := x;
  452. (* constants treated in implementation visitor *)
  453. WITH x: SyntaxTree.CellScope DO
  454. cell := x.ownerCell;
  455. parameter := cell.firstParameter;
  456. WHILE parameter # NIL DO
  457. VisitParameter(parameter);
  458. parameter := parameter.nextParameter;
  459. END;
  460. property := cell.firstProperty;
  461. WHILE property # NIL DO
  462. VisitProperty(property);
  463. property := property.nextProperty;
  464. END;
  465. ELSE
  466. END;
  467. typeDeclaration := x.firstTypeDeclaration;
  468. WHILE typeDeclaration # NIL DO
  469. VisitTypeDeclaration(typeDeclaration);
  470. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  471. END;
  472. variable := x.firstVariable;
  473. WHILE variable # NIL DO
  474. VisitVariable(variable);
  475. variable := variable.nextVariable;
  476. END;
  477. procedure := x.firstProcedure;
  478. WHILE procedure # NIL DO
  479. VisitProcedure(procedure);
  480. procedure := procedure.nextProcedure;
  481. END;
  482. constant := x.firstConstant;
  483. WHILE constant # NIL DO
  484. VisitConstant(constant);
  485. constant := constant.nextConstant;
  486. END;
  487. currentScope := prevScope;
  488. END Scope;
  489. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  490. VAR parameter: SyntaxTree.Parameter;
  491. BEGIN
  492. parameter := first;
  493. WHILE parameter # NIL DO
  494. VisitParameter(parameter);
  495. parameter := parameter.nextParameter;
  496. END;
  497. END Parameters;
  498. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  499. VAR scope: SyntaxTree.ProcedureScope;
  500. prevScope: SyntaxTree.Scope;
  501. inline, finalizer: BOOLEAN;
  502. procedureType: SyntaxTree.ProcedureType;
  503. pc: LONGINT;
  504. stackSize: LONGINT;
  505. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  506. null,size,src,dest,fp,res: IntermediateCode.Operand;
  507. cc: LONGINT;
  508. cellType: SyntaxTree.CellType;
  509. registerNumber: LONGINT;
  510. registerParameters: SIZE;
  511. registerClass: IntermediateCode.RegisterClass;
  512. type: IntermediateCode.Type;
  513. formalParameter: SyntaxTree.Parameter;
  514. recordType: SyntaxTree.RecordType;
  515. isModuleBody: BOOLEAN;
  516. parametersSize: LONGINT;
  517. position: LONGINT;
  518. variable: SyntaxTree.Variable;
  519. PROCEDURE Signature;
  520. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  521. BEGIN
  522. procedureType := x.type(SyntaxTree.ProcedureType);
  523. returnType := procedureType.returnType;
  524. IF returnType # NIL THEN
  525. meta.CheckTypeDeclaration(returnType)
  526. END;
  527. parameter := procedureType.firstParameter;
  528. WHILE parameter # NIL DO
  529. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  530. parameter := parameter.nextParameter;
  531. END;
  532. END Signature;
  533. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  534. VAR result: BOOLEAN;
  535. BEGIN
  536. result := FALSE;
  537. IF x = SyntaxTree.invalidExpression THEN
  538. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  539. result := TRUE;
  540. value := x.resolved(SyntaxTree.IntegerValue).value;
  541. ELSE
  542. Error(x.position,"expression is not an integer constant");
  543. END;
  544. RETURN result;
  545. END CheckIntegerValue;
  546. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  547. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  548. BEGIN
  549. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  550. WHILE (this # NIL) & (this.identifier # id) DO
  551. this := this.nextModifier;
  552. END;
  553. IF this # NIL THEN
  554. IF this.expression = NIL THEN
  555. Error(this.position,"expected expression value");
  556. ELSIF CheckIntegerValue(this.expression,value) THEN
  557. END;
  558. RETURN TRUE
  559. ELSE RETURN FALSE
  560. END;
  561. END HasValue;
  562. CONST DefaultDataMemorySize=512;
  563. BEGIN
  564. IF x.externalName # NIL THEN RETURN END;
  565. (*
  566. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  567. *)
  568. (* code section for this procedure *)
  569. position := x.position.start;
  570. scope := x.procedureScope;
  571. prevScope := currentScope;
  572. currentScope := scope;
  573. procedureType := x.type(SyntaxTree.ProcedureType);
  574. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  575. implementationVisitor.temporaries.Clear;
  576. implementationVisitor.usedRegisters := NIL;
  577. implementationVisitor.registerUsageCount.Init;
  578. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  579. IF (scope.body # NIL) & (x.isInline) THEN
  580. inline := TRUE;
  581. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  582. ir.SetExported(IsExported(x));
  583. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  584. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  585. IF backend.cellsAreObjects THEN
  586. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  587. ir.SetExported(IsExported(x));
  588. ELSE
  589. RETURN; (* cellnet cannot be compiled for final static hardware *)
  590. END;
  591. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  592. inline := FALSE;
  593. AddBodyCallStub(x);
  594. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  595. ir.SetExported(IsExported(x));
  596. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  597. inline := FALSE;
  598. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  599. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  600. AddBodyCallStub(x);
  601. AddStackAllocation(x,stackSize);
  602. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  603. ir.SetExported(IsExported(x));
  604. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  605. inline := FALSE;
  606. Parameters(procedureType.firstParameter);
  607. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  608. ir.SetExported(IsExported(x));
  609. ELSE
  610. inline := FALSE;
  611. IF x.isEntry OR x.isExit THEN
  612. IF x.isEntry THEN
  613. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  614. ELSE
  615. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  616. END;
  617. ir.SetExported(TRUE);
  618. ELSE
  619. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  620. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  621. END;
  622. END;
  623. cc := procedureType.callingConvention;
  624. IF cc = SyntaxTree.WinAPICallingConvention THEN
  625. parametersSize := ProcedureParametersSize(backend.system,x);
  626. ELSE
  627. parametersSize := 0;
  628. END;
  629. IF scope.body # NIL THEN
  630. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  631. registerNumber := 0;
  632. IF ~inline THEN
  633. IF scope.lastVariable = NIL THEN
  634. stackSize := 0
  635. ELSE
  636. stackSize := scope.lastVariable.offsetInBits;
  637. IF stackSize <0 THEN stackSize := -stackSize END;
  638. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  639. END;
  640. (*
  641. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  642. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  643. *)
  644. (*
  645. ir.Emit(Nop(position)); (* placeholder for fill *)
  646. *)
  647. IF (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) & (~SysvABI(procedureType.callingConvention) OR (system.addressSize # 64)) THEN
  648. registerParameters := backend.NumberParameterRegisters(procedureType.callingConvention);
  649. (* assumption: registers are passed left to right and left parameters are in registers *)
  650. formalParameter := procedureType.firstParameter;
  651. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  652. IF ~PassInRegister(formalParameter) THEN
  653. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  654. ELSE
  655. IF formalParameter.type.IsRecordType() THEN
  656. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  657. type := addressType;
  658. ELSE
  659. type := GetType(system, formalParameter.type);
  660. END;
  661. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(procedureType.callingConvention, type, registerNumber));
  662. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  663. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  664. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  665. implementationVisitor.ReleaseIntermediateOperand(src);
  666. INC(registerNumber);
  667. formalParameter := formalParameter.nextParameter;
  668. END;
  669. END;
  670. END;
  671. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  672. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  673. END;
  674. pc := ir.pc-1;
  675. IF SysvABI(procedureType.callingConvention) & (system.addressSize = 64) THEN
  676. registerParameters := backend.NumberParameterRegisters(procedureType.callingConvention);
  677. (* assumption: registers are passed left to right and left parameters are in registers *)
  678. formalParameter := procedureType.firstParameter;
  679. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  680. IF ~PassInRegister(formalParameter) THEN
  681. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  682. ELSE
  683. IF formalParameter.type.IsRecordType() THEN
  684. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  685. type := addressType;
  686. ELSE
  687. type := GetType(system, formalParameter.type);
  688. END;
  689. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(procedureType.callingConvention, type, registerNumber));
  690. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  691. implementationVisitor.currentScope := currentScope;
  692. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  693. formalParameter.SetOffset(variable.offsetInBits);
  694. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  695. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  696. implementationVisitor.ReleaseIntermediateOperand(src);
  697. INC(registerNumber);
  698. formalParameter := formalParameter.nextParameter;
  699. END;
  700. END;
  701. END;
  702. END;
  703. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  704. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  705. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  706. IF scope.lastVariable # NIL THEN
  707. stackSize := scope.lastVariable.offsetInBits;
  708. IF stackSize <0 THEN stackSize := -stackSize END;
  709. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  710. END;
  711. END;
  712. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  713. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  714. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  715. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  716. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  717. ir.EmitAt(pc,Push(size));
  718. implementationVisitor.StaticCallOperand(result,procedure);
  719. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  720. END;
  721. *)
  722. END;
  723. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  724. IF stackSize > 0 THEN
  725. IF (stackSize MOD system.addressSize = 0) THEN
  726. null := IntermediateCode.Immediate(addressType,0);
  727. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  728. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  729. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  730. ELSE
  731. null := IntermediateCode.Immediate(int8,0);
  732. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  733. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  734. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  735. END;
  736. (*! should potentially be called by backend -- enter might initialize
  737. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  738. *)
  739. END;
  740. IF procedureType.callingConvention = SyntaxTree.WinAPICallingConvention THEN
  741. parametersSize := ProcedureParametersSize(backend.system,x);
  742. ELSE
  743. parametersSize := 0;
  744. END;
  745. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  746. finalizer := FALSE;
  747. IF backend.cooperative & x.isFinalizer THEN
  748. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  749. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  750. GetRecordTypeName(recordType,name);
  751. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  752. END;
  753. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  754. IF backend.cooperative THEN
  755. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  756. IF implementationVisitor.profile & ~isModuleBody THEN
  757. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  758. END;
  759. END;
  760. implementationVisitor.EmitLeave(ir, x.position,x,cc);
  761. IF finalizer THEN
  762. IF backend.hasLinkRegister THEN
  763. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  764. END;
  765. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  766. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  767. ir.Emit(Br(x.position,dest));
  768. ELSE
  769. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  770. END;
  771. ELSE
  772. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  773. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  774. END;
  775. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  776. IF backend.cooperative THEN
  777. IF HasPointers (scope) THEN
  778. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  779. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  780. ir.Emit(Result(x.position, res));
  781. ir.Emit(Push(x.position, res));
  782. implementationVisitor.ResetVariables(scope);
  783. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  784. ir.Emit(Pop(x.position, res));
  785. ir.Emit(Return(x.position, res));
  786. ELSE
  787. implementationVisitor.ResetVariables(scope);
  788. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  789. END;
  790. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  791. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  792. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  793. ir.Emit(Result(x.position, res));
  794. ir.Emit(Push(x.position, res));
  795. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  796. ir.Emit(Pop(x.position, res));
  797. ir.Emit(Return(x.position, res));
  798. ELSE
  799. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  800. END;
  801. END;
  802. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  803. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  804. ELSE
  805. ir.Emit(Nop(x.position));
  806. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  807. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  808. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  809. END;
  810. END;
  811. END
  812. END;
  813. ELSE (* force body for procedures *)
  814. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  815. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  816. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  817. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  818. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  819. END;
  820. Scope(scope);
  821. Signature;
  822. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  823. currentScope := prevScope;
  824. END Procedure;
  825. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  826. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  827. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  828. BEGIN
  829. ASSERT (bodyProcedure # NIL);
  830. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  831. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  832. procedure.SetScope(bodyProcedure.scope);
  833. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  834. procedure.SetAccess(SyntaxTree.Hidden);
  835. Global.GetSymbolSegmentedName (procedure,name);
  836. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  837. ir.SetExported(TRUE);
  838. Global.GetSymbolSegmentedName (bodyProcedure,name);
  839. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  840. implementationVisitor.currentScope := module.module.moduleScope;
  841. implementationVisitor.section := ir;
  842. implementationVisitor.PushSelfPointer();
  843. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  844. ELSIF backend.preregisterStatic THEN
  845. implementationVisitor.currentScope := module.module.moduleScope;
  846. implementationVisitor.section := ir;
  847. implementationVisitor.PushSelfPointer();
  848. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  849. ELSE
  850. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  851. ir.Emit(Call(bodyProcedure.position,op, 0));
  852. END;
  853. END AddBodyCallStub;
  854. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  855. VAR name: Basic.SegmentedName;
  856. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  857. BEGIN
  858. Global.GetSymbolSegmentedName (symbol,name);
  859. Basic.RemoveSuffix(name);
  860. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  861. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  862. ir.SetExported(TRUE);
  863. IntermediateCode.InitImmediate(op,addressType,initStack);
  864. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  865. END AddStackAllocation;
  866. (** entry function to visit a complete module *)
  867. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  868. VAR
  869. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  870. hasDynamicOperatorDeclarations: BOOLEAN;
  871. operator: SyntaxTree.Operator;
  872. import: SyntaxTree.Import;
  873. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  874. BEGIN
  875. type := type.resolved;
  876. IF type IS SyntaxTree.RecordType THEN
  877. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  878. ELSIF (type IS SyntaxTree.ArrayType) THEN
  879. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  880. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  881. END;
  882. ELSIF type IS SyntaxTree.MathArrayType THEN
  883. WITH type: SyntaxTree.MathArrayType DO
  884. IF type.form = SyntaxTree.Open THEN
  885. RETURN TRUE
  886. ELSIF type.form = SyntaxTree.Static THEN
  887. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  888. END;
  889. END;
  890. END;
  891. RETURN FALSE
  892. END TypeNeedsInitialization;
  893. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  894. VAR variable: SyntaxTree.Variable;
  895. BEGIN
  896. variable := scope.firstVariable;
  897. WHILE variable # NIL DO
  898. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  899. IF variable.initializer # NIL THEN RETURN TRUE END;
  900. variable := variable.nextVariable;
  901. END;
  902. RETURN FALSE
  903. END ScopeNeedsInitialization;
  904. BEGIN
  905. ASSERT(x # NIL); ASSERT(module # NIL);
  906. SELF.module := module;
  907. (* add import names to the generated Sections.Module *)
  908. import := x.moduleScope.firstImport;
  909. WHILE import # NIL DO
  910. import.module.GetName(idstr);
  911. module.imports.AddName(idstr);
  912. import := import.nextImport
  913. END;
  914. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  915. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  916. moduleSelf := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@moduleSelf"));
  917. moduleSelf.SetType(system.anyType);
  918. moduleSelf.SetScope(x.moduleScope);
  919. moduleSelf.SetUntraced(TRUE);
  920. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  921. ir.SetExported(TRUE);
  922. IntermediateCode.InitImmediate(op,addressType,0);
  923. ir.Emit(Data(Basic.invalidPosition,op));
  924. END;
  925. implementationVisitor.module := module;
  926. implementationVisitor.moduleScope := x.moduleScope;
  927. implementationVisitor.moduleSelf := moduleSelf;
  928. implementationVisitor.canBeLoaded := TRUE;
  929. meta.SetModule(module);
  930. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  931. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  932. END;
  933. IF backend.profile THEN
  934. EnsureBodyProcedure(x.moduleScope);
  935. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  936. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  937. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  938. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  939. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  940. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  941. Global.GetModuleName(module.module,idstr);
  942. implementationVisitor.ProfilerAddModule(idstr);
  943. implementationVisitor.numberProcedures := 0;
  944. END;
  945. implementationVisitor.profile := backend.profile;
  946. (* check if there is at least one dynamic operator locally defined *)
  947. hasDynamicOperatorDeclarations := FALSE;
  948. operator := x.moduleScope.firstOperator;
  949. WHILE operator # NIL DO
  950. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  951. operator := operator.nextOperator
  952. END;
  953. (* add operator initialization code section *)
  954. IF hasDynamicOperatorDeclarations THEN
  955. EnsureBodyProcedure(x.moduleScope);
  956. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  957. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  958. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  959. END;
  960. Scope(x.moduleScope);
  961. IF hasDynamicOperatorDeclarations THEN
  962. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  963. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  964. END;
  965. IF backend.profile THEN
  966. implementationVisitor.ProfilerPatchInit;
  967. END;
  968. END Module;
  969. END DeclarationVisitor;
  970. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  971. RegisterUsageCount*=OBJECT
  972. VAR used: UsedArray; count: LONGINT;
  973. PROCEDURE &Init;
  974. VAR i: LONGINT;
  975. BEGIN
  976. count := 0;
  977. IF used = NIL THEN NEW(used,64); END;
  978. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  979. END Init;
  980. PROCEDURE Grow;
  981. VAR new: UsedArray; size,i: LONGINT;
  982. BEGIN
  983. size := LEN(used)*2;
  984. NEW(new,size);
  985. FOR i := 0 TO LEN(used)-1 DO
  986. new[i].count := used[i].count;
  987. new[i].type := used[i].type;
  988. new[i].map := used[i].map
  989. END;
  990. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  991. used := new
  992. END Grow;
  993. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  994. BEGIN
  995. INC(count);
  996. IF count = LEN(used) THEN Grow END;
  997. used[count].type := type;
  998. used[count].class := class;
  999. used[count].map := count;
  1000. RETURN count;
  1001. END Next;
  1002. PROCEDURE IncUse(register: LONGINT);
  1003. BEGIN
  1004. INC(used[register].count);
  1005. (*
  1006. IF (register = 1) & (count > 30) THEN
  1007. D.TraceBack;
  1008. END;
  1009. *)
  1010. END IncUse;
  1011. PROCEDURE DecUse(register: LONGINT);
  1012. BEGIN
  1013. DEC(used[register].count);
  1014. END DecUse;
  1015. PROCEDURE Map(register: LONGINT): LONGINT;
  1016. VAR map : LONGINT;
  1017. BEGIN
  1018. IF register > 0 THEN
  1019. map := used[register].map;
  1020. WHILE register # map DO register := map; map := used[register].map END;
  1021. END;
  1022. RETURN register
  1023. END Map;
  1024. PROCEDURE Use(register: LONGINT): LONGINT;
  1025. BEGIN
  1026. IF register< LEN(used) THEN
  1027. RETURN used[register].count
  1028. ELSE
  1029. RETURN 0
  1030. END
  1031. END Use;
  1032. END RegisterUsageCount;
  1033. RegisterEntry = POINTER TO RECORD
  1034. prev,next: RegisterEntry;
  1035. register: LONGINT;
  1036. registerClass: IntermediateCode.RegisterClass;
  1037. type: IntermediateCode.Type;
  1038. END;
  1039. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1040. Variables = OBJECT (Basic.List)
  1041. VAR
  1042. inUse: VariableUse;
  1043. registerIndex: LONGINT;
  1044. nameIndex: LONGINT;
  1045. PROCEDURE & Init;
  1046. VAR i: LONGINT;
  1047. BEGIN
  1048. InitList(16);
  1049. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1050. registerIndex := 1024;
  1051. nameIndex := 0;
  1052. END Init;
  1053. PROCEDURE Clear*;
  1054. VAR i: LONGINT;
  1055. BEGIN
  1056. Clear^;
  1057. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1058. registerIndex := 1024;
  1059. nameIndex := 0;
  1060. END Clear;
  1061. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1062. VAR string: SyntaxTree.IdentifierString ;
  1063. BEGIN
  1064. COPY("@hiddenIRVar",string);
  1065. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1066. RETURN SyntaxTree.NewIdentifier(string);
  1067. END GetUID;
  1068. PROCEDURE GetUsage(VAR use: VariableUse);
  1069. BEGIN
  1070. use := inUse;
  1071. END GetUsage;
  1072. PROCEDURE SetUsage(CONST use: VariableUse);
  1073. BEGIN
  1074. inUse := use;
  1075. END SetUsage;
  1076. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1077. VAR any: ANY;
  1078. BEGIN
  1079. any := Get(i);
  1080. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1081. END GetVariable;
  1082. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1083. BEGIN
  1084. Set(pos, v);
  1085. END SetVariable;
  1086. PROCEDURE Occupy(pos: LONGINT);
  1087. BEGIN
  1088. INCL(inUse[pos DIV 32], pos MOD 32);
  1089. END Occupy;
  1090. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1091. BEGIN
  1092. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1093. END Occupied;
  1094. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1095. BEGIN
  1096. Occupy(Length());
  1097. Add(v);
  1098. END AddVariable;
  1099. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1100. BEGIN
  1101. t1 := t1.resolved;
  1102. t2 := t2.resolved;
  1103. (*RETURN t1.SameType(t2); *)
  1104. RETURN
  1105. (t1.SameType(t2))
  1106. OR
  1107. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1108. OR
  1109. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits = t2.sizeInBits)
  1110. OR
  1111. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1112. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1113. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1114. OR
  1115. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1116. (DynamicDim(t1) = DynamicDim(t2))
  1117. );
  1118. END CompatibleType;
  1119. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1120. VAR var : SyntaxTree.Variable; i: LONGINT;
  1121. BEGIN
  1122. pos := Length();
  1123. FOR i := 0 TO pos-1 DO
  1124. IF ~(Occupied(i)) THEN
  1125. var := GetVariable(i);
  1126. IF CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1127. pos := i;
  1128. Occupy(i);
  1129. RETURN var;
  1130. END;
  1131. END;
  1132. END;
  1133. RETURN NIL
  1134. END GetFreeVariable;
  1135. END Variables;
  1136. SymbolMap = POINTER TO RECORD
  1137. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1138. isAddress: BOOLEAN;
  1139. END;
  1140. SymbolMapper = OBJECT
  1141. VAR
  1142. first: SymbolMap;
  1143. PROCEDURE & Init;
  1144. BEGIN
  1145. first := NIL;
  1146. END Init;
  1147. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1148. VAR new: SymbolMap;
  1149. BEGIN
  1150. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1151. new.next := first; first := new;
  1152. END Add;
  1153. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1154. VAR s: SymbolMap;
  1155. BEGIN
  1156. s := first;
  1157. WHILE (s # NIL) & (s.this # this) DO
  1158. s := s.next
  1159. END;
  1160. RETURN s
  1161. END Get;
  1162. END SymbolMapper;
  1163. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1164. VAR
  1165. system: Global.System;
  1166. section: IntermediateCode.Section;
  1167. module: Sections.Module;
  1168. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1169. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1170. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1171. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1172. checker: SemanticChecker.Checker;
  1173. backend: IntermediateBackend;
  1174. meta: MetaDataGenerator;
  1175. position: Position;
  1176. moduleSelf: SyntaxTree.Variable;
  1177. (* variables for hand over of variables / temporary state *)
  1178. currentScope: SyntaxTree.Scope;
  1179. constantDeclaration : SyntaxTree.Symbol;
  1180. result: Operand; (* result of the most recent expression / statement *)
  1181. destination: IntermediateCode.Operand;
  1182. arrayDestinationTag: IntermediateCode.Operand;
  1183. arrayDestinationDimension:LONGINT;
  1184. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1185. conditional: BOOLEAN;
  1186. trueLabel, falseLabel, exitLabel: Label;
  1187. locked: BOOLEAN;
  1188. (*
  1189. usedRegisters: Registers;
  1190. *)
  1191. registerUsageCount: RegisterUsageCount;
  1192. usedRegisters: RegisterEntry;
  1193. (* useful operands and types *)
  1194. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1195. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1196. commentPrintout: Printout.Printer;
  1197. dump: Streams.Writer;
  1198. tagsAvailable : BOOLEAN;
  1199. supportedInstruction: SupportedInstructionProcedure;
  1200. supportedImmediate: SupportedImmediateProcedure;
  1201. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1202. emitLabels: BOOLEAN;
  1203. runtimeModuleName : SyntaxTree.IdentifierString;
  1204. newObjectFile: BOOLEAN;
  1205. indexCounter: LONGINT;
  1206. profile: BOOLEAN;
  1207. profileId, profileInit: IntermediateCode.Section;
  1208. profileInitPatchPosition: LONGINT;
  1209. numberProcedures: LONGINT;
  1210. procedureResultDesignator : SyntaxTree.Designator;
  1211. operatorInitializationCodeSection: IntermediateCode.Section;
  1212. fingerPrinter: FingerPrinter.FingerPrinter;
  1213. temporaries: Variables;
  1214. canBeLoaded : BOOLEAN;
  1215. currentIsInline: BOOLEAN;
  1216. currentMapper: SymbolMapper;
  1217. currentInlineExit: Label;
  1218. moduleBodySection: IntermediateCode.Section;
  1219. NeedDescriptor : BOOLEAN;
  1220. cooperativeSwitches: BOOLEAN;
  1221. lastSwitchPC: LONGINT;
  1222. isUnchecked: BOOLEAN;
  1223. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1224. newObjectFile: BOOLEAN);
  1225. BEGIN
  1226. SELF.system := system;
  1227. SELF.runtimeModuleName := runtime;
  1228. currentScope := NIL;
  1229. hiddenPointerType := NIL;
  1230. delegatePointerType := NIL;
  1231. awaitProcCounter := 0;
  1232. labelId := 0; constId := 0; labelId := 0;
  1233. SELF.checker := checker;
  1234. SELF.backend := backend;
  1235. position := Basic.invalidPosition;
  1236. conditional := FALSE;
  1237. locked := FALSE;
  1238. InitOperand(result,ModeUndefined);
  1239. addressType := IntermediateCode.GetType(system,system.addressType);
  1240. setType := IntermediateCode.GetType(system,system.setType);
  1241. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1242. lenType := IntermediateCode.GetType(system, system.lenType);
  1243. byteType := IntermediateCode.GetType(system, system.byteType);
  1244. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1245. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1246. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1247. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1248. nil := IntermediateCode.Immediate(addressType,0);
  1249. one := IntermediateCode.Immediate(addressType,1);
  1250. IntermediateCode.InitOperand(destination);
  1251. tagsAvailable := TRUE;
  1252. supportedInstruction := supportedInstructionProcedure;
  1253. supportedImmediate := supportedImmediateProcedure;
  1254. inData := FALSE;
  1255. SELF.emitLabels := emitLabels;
  1256. IntermediateCode.InitOperand(arrayDestinationTag);
  1257. bool := IntermediateCode.GetType(system,system.booleanType);
  1258. IntermediateCode.InitImmediate(false,bool,0);
  1259. IntermediateCode.InitImmediate(true,bool,1);
  1260. SELF.newObjectFile := newObjectFile;
  1261. indexCounter := 0;
  1262. NEW(registerUsageCount);
  1263. usedRegisters := NIL;
  1264. procedureResultDesignator := NIL;
  1265. NEW(fingerPrinter);
  1266. NEW(temporaries);
  1267. currentIsInline := FALSE;
  1268. NeedDescriptor := FALSE;
  1269. isUnchecked := backend.noRuntimeChecks;
  1270. END Init;
  1271. TYPE Context = RECORD
  1272. section: IntermediateCode.Section;
  1273. registerUsageCount: RegisterUsageCount;
  1274. usedRegisters: RegisterEntry;
  1275. temporaries: Variables;
  1276. END;
  1277. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1278. VAR context: Context;
  1279. BEGIN
  1280. context.section := section;
  1281. context.registerUsageCount := registerUsageCount;
  1282. context.usedRegisters := usedRegisters;
  1283. context.temporaries := temporaries;
  1284. section := new;
  1285. NEW(registerUsageCount);
  1286. NEW(temporaries);
  1287. usedRegisters := NIL;
  1288. RETURN context;
  1289. END SwitchContext;
  1290. PROCEDURE ReturnToContext(context: Context);
  1291. BEGIN
  1292. section := context.section;
  1293. registerUsageCount := context.registerUsageCount;
  1294. usedRegisters := context.usedRegisters;
  1295. temporaries := context.temporaries;
  1296. END ReturnToContext;
  1297. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1298. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1299. BEGIN
  1300. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1301. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1302. END;
  1303. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1304. section.SetExported(IsExported(syntaxTreeSymbol));
  1305. RETURN section
  1306. END NewSection;
  1307. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1308. VAR new: LONGINT;
  1309. BEGIN
  1310. new := registerUsageCount.Next(type,class);
  1311. UseRegister(new);
  1312. RETURN new
  1313. END AcquireRegister;
  1314. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1315. VAR
  1316. fingerPrint: SyntaxTree.FingerPrint;
  1317. fingerPrintString: ARRAY 32 OF CHAR;
  1318. BEGIN
  1319. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1320. string := "[";
  1321. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1322. Strings.Append(string, fingerPrintString);
  1323. Strings.Append(string, "]");
  1324. END GetFingerprintString;
  1325. (** get the name for the code section that represens a certain symbol
  1326. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1327. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1328. VAR string: ARRAY 32 OF CHAR;
  1329. BEGIN
  1330. Global.GetSymbolSegmentedName(symbol, name);
  1331. (* if the symbol is an operator, then append the fingerprint to the name *)
  1332. IF symbol IS SyntaxTree.Operator THEN
  1333. GetFingerprintString(symbol, string);
  1334. Basic.AppendToSegmentedName(name,string);
  1335. END
  1336. END GetCodeSectionNameForSymbol;
  1337. (** get the name for the code section that represens a certain symbol
  1338. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1339. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1340. VAR string: ARRAY 32 OF CHAR;
  1341. BEGIN
  1342. Global.GetSymbolNameInScope(symbol, scope, name);
  1343. (* if the symbol is an operator, then append the fingerprint to the name *)
  1344. IF symbol IS SyntaxTree.Operator THEN
  1345. GetFingerprintString(symbol, string);
  1346. Strings.Append(name, string);
  1347. END
  1348. END GetCodeSectionNameForSymbolInScope;
  1349. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1350. BEGIN
  1351. IF dump # NIL THEN
  1352. dump.String("enter "); dump.String(s); dump.Ln;
  1353. END;
  1354. END TraceEnter;
  1355. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1356. BEGIN
  1357. IF dump # NIL THEN
  1358. dump.String("exit "); dump.String(s); dump.Ln;
  1359. END;
  1360. END TraceExit;
  1361. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1362. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1363. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1364. VAR i: LONGINT;
  1365. BEGIN
  1366. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1367. IF op.rule # NIL THEN
  1368. FOR i := 0 TO LEN(op.rule)-1 DO
  1369. CheckRegister(op.rule[i])
  1370. END;
  1371. END;
  1372. END CheckRegister;
  1373. BEGIN
  1374. CheckRegister(instruction.op1);
  1375. CheckRegister(instruction.op2);
  1376. CheckRegister(instruction.op3);
  1377. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1378. ELSE section.Emit(instruction);
  1379. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1380. END;
  1381. END Emit;
  1382. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1383. BEGIN
  1384. IF backend.cooperative THEN
  1385. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1386. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1387. ELSE
  1388. Emit(Trap(position,trapNo));
  1389. END;
  1390. END EmitTrap;
  1391. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1392. VAR name: Basic.SegmentedName;
  1393. VAR op1, op2, reg: IntermediateCode.Operand;
  1394. VAR call, nocall: Label;
  1395. VAR parametersSize: LONGINT;
  1396. VAR prevSection: IntermediateCode.Section;
  1397. VAR prevDump: Streams.Writer;
  1398. VAR body: SyntaxTree.Body;
  1399. VAR procedureType: SyntaxTree.ProcedureType;
  1400. BEGIN
  1401. IF procedure # NIL THEN
  1402. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1403. ELSE procedureType := NIL;
  1404. END;
  1405. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1406. prevSection := SELF.section;
  1407. SELF.section := section;
  1408. prevDump := dump;
  1409. dump := section.comments;
  1410. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1411. IF backend.hasLinkRegister THEN
  1412. Emit(Push(Basic.invalidPosition, lr));
  1413. END;
  1414. Emit(Push(Basic.invalidPosition,fp));
  1415. IF procedure # NIL THEN
  1416. body := procedure.procedureScope.body;
  1417. ELSE
  1418. body := NIL;
  1419. END;
  1420. IF backend.cooperative THEN
  1421. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1422. GetCodeSectionNameForSymbol(procedure, name);
  1423. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1424. ELSE
  1425. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1426. END;
  1427. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1428. IntermediateCode.AddOffset(op1, 1);
  1429. Emit(Push(Basic.invalidPosition,op1));
  1430. Emit(Mov(Basic.invalidPosition,fp, sp));
  1431. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1432. NEW(call, section);
  1433. NEW(nocall, section);
  1434. reg := NewRegisterOperand(addressType);
  1435. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1436. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1437. BrltL(call, sp, reg);
  1438. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1439. BrgeL(nocall, sp, op2);
  1440. call.Resolve(section.pc);
  1441. Emit(Push(Basic.invalidPosition, reg));
  1442. ReleaseIntermediateOperand(reg);
  1443. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1444. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1445. Emit(Push(Basic.invalidPosition, op2));
  1446. CallThis(position, "Activities","ExpandStack",2);
  1447. Emit(Result(Basic.invalidPosition, sp));
  1448. nocall.Resolve(section.pc);
  1449. END;
  1450. ELSE
  1451. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1452. Emit(Push(Basic.invalidPosition, one)) ;
  1453. procedureType.SetParametersOffset(1);
  1454. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1455. END;
  1456. Emit(Mov(Basic.invalidPosition, fp, sp));
  1457. END;
  1458. END;
  1459. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1460. SELF.section := prevSection;
  1461. dump := prevDump;
  1462. END EmitEnter;
  1463. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1464. VAR op1,op2: IntermediateCode.Operand;
  1465. VAR instruction: IntermediateCode.Instruction;
  1466. BEGIN
  1467. IntermediateCode.InitNumber(op1,callconv);
  1468. IntermediateCode.InitNumber(op2,varSize);
  1469. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1470. RETURN instruction
  1471. END Enter;
  1472. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1473. VAR op1: IntermediateCode.Operand;
  1474. VAR instruction: IntermediateCode.Instruction;
  1475. BEGIN
  1476. IntermediateCode.InitNumber(op1,callconv);
  1477. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1478. RETURN instruction
  1479. END Leave;
  1480. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1481. VAR prevSection: IntermediateCode.Section;
  1482. VAR op2, size: IntermediateCode.Operand;
  1483. VAR body: SyntaxTree.Body;
  1484. BEGIN
  1485. prevSection := SELF.section;
  1486. SELF.section := section;
  1487. Emit(Leave(position, callconv));
  1488. IF procedure # NIL THEN
  1489. body := procedure.procedureScope.body;
  1490. ELSE
  1491. body := NIL;
  1492. END;
  1493. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1494. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1495. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1496. Emit(Add(position, sp, fp, op2));
  1497. ELSE
  1498. Emit(Mov(position, sp, fp));
  1499. END;
  1500. Emit(Pop(position, fp));
  1501. END;
  1502. SELF.section := prevSection;
  1503. END EmitLeave;
  1504. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1505. VAR m: SymbolMap;
  1506. BEGIN
  1507. position := x.position;
  1508. IF currentIsInline THEN
  1509. m := currentMapper.Get(x);
  1510. IF m # NIL THEN
  1511. (*
  1512. Printout.Info("mapping from", x);
  1513. Printout.Info("mapping to ", m.to);
  1514. *)
  1515. m.to.Accept(SELF);
  1516. op := result;
  1517. IF m.tag # NIL THEN
  1518. ReleaseIntermediateOperand(result.tag);
  1519. m.tag.Accept(SELF);
  1520. op.tag := result.op;
  1521. ReleaseIntermediateOperand(result.tag);
  1522. END;
  1523. RETURN
  1524. END;
  1525. END;
  1526. x.Accept(SELF);
  1527. op := result;
  1528. END Symbol;
  1529. PROCEDURE Expression(x: SyntaxTree.Expression);
  1530. BEGIN
  1531. position := x.position;
  1532. constantDeclaration := NIL;
  1533. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1534. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1535. END;
  1536. IF x.resolved # NIL THEN
  1537. x.resolved.Accept(SELF)
  1538. ELSE
  1539. x.Accept(SELF)
  1540. END;
  1541. (* check this, was commented out in ActiveCells3 *)
  1542. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1543. Error(x.position, "unsupported modifier");
  1544. END;
  1545. END Expression;
  1546. (*
  1547. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1548. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1549. BEGIN
  1550. temporaries.GetUsage(current);
  1551. FOR i := 0 TO LEN(current)-1 DO
  1552. set := current[i] - previous[i];
  1553. IF set # {} THEN
  1554. FOR j := 0 TO MAX(SET)-1 DO
  1555. IF j IN set THEN
  1556. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1557. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1558. Symbol(variable, op);
  1559. MakeMemory(tmp,op.op,addressType,0);
  1560. ReleaseOperand(op);
  1561. Emit(Mov(position,tmp, nil ) );
  1562. ReleaseIntermediateOperand(tmp);
  1563. END;
  1564. END;
  1565. END;
  1566. END;
  1567. END;
  1568. END ResetUsedTemporaries;
  1569. *)
  1570. PROCEDURE Statement(x: SyntaxTree.Statement);
  1571. VAR use: VariableUse;
  1572. BEGIN
  1573. temporaries.GetUsage(use);
  1574. position := x.position;
  1575. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1576. IF commentPrintout # NIL THEN
  1577. commentPrintout.Statement(x);
  1578. dump.Ln;
  1579. (*dump.Update;*)
  1580. END;
  1581. x.Accept(SELF);
  1582. (*
  1583. CheckRegistersFree();
  1584. *)
  1585. (*ResetUsedTemporaries(use);*)
  1586. temporaries.SetUsage(use);
  1587. END Statement;
  1588. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1589. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1590. *)
  1591. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1592. BEGIN
  1593. ASSERT(op.mode # IntermediateCode.Undefined);
  1594. IF op.mode = IntermediateCode.ModeMemory THEN
  1595. ReuseCopy(res,op);
  1596. ELSE
  1597. res := op;
  1598. UseIntermediateOperand(res);
  1599. END;
  1600. IntermediateCode.AddOffset(res,offset);
  1601. IntermediateCode.MakeMemory(res,type);
  1602. END MakeMemory;
  1603. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1604. VAR mem: IntermediateCode.Operand;
  1605. BEGIN
  1606. MakeMemory(mem,res,type,offset);
  1607. ReleaseIntermediateOperand(res);
  1608. res := mem;
  1609. END ToMemory;
  1610. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1611. VAR mem: IntermediateCode.Operand;
  1612. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1613. componentType: SyntaxTree.Type;
  1614. BEGIN
  1615. type := type.resolved;
  1616. IF operand.mode = ModeReference THEN
  1617. IF type IS SyntaxTree.RangeType THEN
  1618. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1619. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1620. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1621. ReleaseOperand(operand);
  1622. operand.op := firstOp;
  1623. operand.tag := lastOp;
  1624. operand.extra := stepOp;
  1625. ELSIF type IS SyntaxTree.ComplexType THEN
  1626. componentType := type(SyntaxTree.ComplexType).componentType;
  1627. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1628. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1629. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1630. ReleaseOperand(operand);
  1631. operand.op := firstOp;
  1632. operand.tag := lastOp
  1633. ELSE
  1634. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1635. ReleaseIntermediateOperand(operand.op);
  1636. operand.op := mem;
  1637. END;
  1638. operand.mode := ModeValue;
  1639. END;
  1640. ASSERT(operand.mode = ModeValue);
  1641. END LoadValue;
  1642. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1643. VAR prevConditional: BOOLEAN;
  1644. BEGIN
  1645. prevConditional := conditional;
  1646. conditional := FALSE;
  1647. InitOperand(result, ModeUndefined);
  1648. Expression(x);
  1649. op := result;
  1650. LoadValue(op,x.type.resolved);
  1651. conditional := prevConditional;
  1652. END Evaluate;
  1653. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1654. VAR prevConditional: BOOLEAN;
  1655. BEGIN
  1656. prevConditional := conditional;
  1657. conditional := FALSE;
  1658. InitOperand(result,ModeUndefined);
  1659. Expression(x);
  1660. op := result;
  1661. (*
  1662. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1663. *)
  1664. conditional := prevConditional;
  1665. END Designate;
  1666. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1667. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1668. BEGIN
  1669. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1670. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1671. conditional := TRUE;
  1672. trueLabel := trueL; falseLabel := falseL;
  1673. Expression(x);
  1674. trueL := trueLabel; falseL := falseLabel;
  1675. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1676. END Condition;
  1677. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1678. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1679. BEGIN
  1680. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1681. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1682. RETURN op
  1683. END NewRegisterOperand;
  1684. PROCEDURE UnuseRegister(register: LONGINT);
  1685. BEGIN
  1686. IF (register > 0) THEN
  1687. register := registerUsageCount.Map(register);
  1688. registerUsageCount.DecUse(register);
  1689. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1690. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1691. END;
  1692. IF registerUsageCount.Use(register)=0 THEN
  1693. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1694. Warning(position, "register cannot be removed");
  1695. END;
  1696. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1697. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1698. END;
  1699. ELSIF registerUsageCount.Use(register)<0 THEN
  1700. Warning(position, "register removed too often");
  1701. IF dump # NIL THEN
  1702. dump.String("register removed too often"); dump.Ln; dump.Update;
  1703. END;
  1704. END;
  1705. END;
  1706. END UnuseRegister;
  1707. PROCEDURE UseRegister(register: LONGINT);
  1708. BEGIN
  1709. IF (register > 0) THEN
  1710. register := registerUsageCount.Map(register);
  1711. registerUsageCount.IncUse(register);
  1712. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1713. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1714. END;
  1715. IF registerUsageCount.Use(register)=1 THEN
  1716. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1717. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1718. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1719. END;
  1720. END;
  1721. END;
  1722. END UseRegister;
  1723. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1724. BEGIN
  1725. UnuseRegister(op.register)
  1726. END ReleaseIntermediateOperand;
  1727. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1728. BEGIN
  1729. UseRegister(op.register)
  1730. END UseIntermediateOperand;
  1731. PROCEDURE ReleaseOperand(CONST op: Operand);
  1732. BEGIN
  1733. UnuseRegister(op.op.register);
  1734. UnuseRegister(op.tag.register);
  1735. UnuseRegister(op.extra.register);
  1736. END ReleaseOperand;
  1737. (* save registers marked in array "markedRegisters" to the stack
  1738. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1739. *)
  1740. PROCEDURE SaveRegisters();
  1741. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1742. BEGIN
  1743. entry := usedRegisters;
  1744. WHILE entry # NIL DO
  1745. type := registerUsageCount.used[entry.register].type;
  1746. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1747. Emit(Push(position,op));
  1748. entry := entry.next;
  1749. END;
  1750. END SaveRegisters;
  1751. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1752. BEGIN
  1753. saved := usedRegisters;
  1754. usedRegisters := NIL;
  1755. END ReleaseUsedRegisters;
  1756. (** remove parameter registers from used queue *)
  1757. PROCEDURE ReleaseParameterRegisters;
  1758. VAR entry,prev,next: RegisterEntry;
  1759. BEGIN
  1760. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1761. WHILE entry # NIL DO
  1762. next := entry.next;
  1763. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1764. registerUsageCount.DecUse(entry.register);
  1765. ASSERT(registerUsageCount.Use(entry.register)=0);
  1766. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1767. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1768. END;
  1769. ELSIF prev = NIL THEN
  1770. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1771. ELSE
  1772. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1773. END;
  1774. entry := next;
  1775. END;
  1776. END ReleaseParameterRegisters;
  1777. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1778. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1779. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1780. BEGIN
  1781. entry := saved;
  1782. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1783. entry := prev;
  1784. WHILE entry # NIL DO
  1785. prev := entry.prev;
  1786. type := entry.type;
  1787. class := entry.registerClass;
  1788. IntermediateCode.InitRegister(op,type,class,entry.register);
  1789. (*
  1790. new := registerUsageCount.Next(type,class);
  1791. registerUsageCount.Remap(entry.register,new);
  1792. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1793. dump.String("remap register "); dump.Int(entry.register,1);
  1794. dump.String("to "); dump.Int(new,1);
  1795. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1796. END;
  1797. entry.register := new;
  1798. *)
  1799. Emit(Pop(position,op));
  1800. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1801. entry := prev;
  1802. END;
  1803. (*
  1804. usedRegisters := saved;
  1805. *)
  1806. END RestoreRegisters;
  1807. PROCEDURE CheckRegistersFree;
  1808. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1809. BEGIN
  1810. IF usedRegisters # NIL THEN
  1811. r := usedRegisters;
  1812. WHILE r # NIL DO
  1813. warning := "register ";
  1814. Strings.AppendInt(warning, r.register);
  1815. Strings.Append(warning, " not released.");
  1816. Warning(position,warning);
  1817. r := r .next;
  1818. END;
  1819. END;
  1820. FOR i := 0 TO registerUsageCount.count-1 DO
  1821. IF registerUsageCount.used[i].count < 0 THEN
  1822. warning := "register ";
  1823. Strings.AppendInt(warning, i);
  1824. Strings.Append(warning, " unused too often.");
  1825. Warning(position,warning);
  1826. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1827. warning := "register ";
  1828. Strings.AppendInt(warning, i);
  1829. Strings.Append(warning, " not unused often enough.");
  1830. Warning(position,warning);
  1831. END;
  1832. END;
  1833. END CheckRegistersFree;
  1834. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1835. Otherwise allocate a new register.
  1836. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1837. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1838. BEGIN
  1839. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1840. UseIntermediateOperand(result);
  1841. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1842. UseIntermediateOperand(result);
  1843. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1844. END;
  1845. END Reuse2;
  1846. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1847. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1848. If not then allocate a new register.
  1849. Does NOT necessarily keep the content of src1 or src2 in result!
  1850. *)
  1851. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1852. BEGIN
  1853. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1854. UseIntermediateOperand(result);
  1855. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1856. UseIntermediateOperand(result);
  1857. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1858. result := alternative; alternative := emptyOperand;
  1859. UseIntermediateOperand(result);
  1860. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1861. END;
  1862. END Reuse2a;
  1863. (* like reuse2 but only one source *)
  1864. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1865. BEGIN
  1866. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1867. UseIntermediateOperand(result);
  1868. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1869. END;
  1870. END Reuse1;
  1871. (* like reuse2a but only one source *)
  1872. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1873. BEGIN
  1874. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1875. UseIntermediateOperand(result);
  1876. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1877. UseIntermediateOperand(result);
  1878. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1879. END;
  1880. END Reuse1a;
  1881. (* like reuse1 but guarantees that content of src1 is in result *)
  1882. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1883. BEGIN
  1884. IF ReusableRegister(src1) THEN
  1885. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1886. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1887. UseIntermediateOperand(result);
  1888. ELSE
  1889. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1890. Emit(Mov(position,result,src1));
  1891. END
  1892. END ReuseCopy;
  1893. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1894. BEGIN
  1895. IF ReusableRegister(src) THEN
  1896. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1897. ELSE
  1898. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1899. Emit(Mov(position,result,src));
  1900. ReleaseIntermediateOperand(src);
  1901. END
  1902. END TransferToRegister;
  1903. (** labels and branches **)
  1904. PROCEDURE NewLabel(): Label;
  1905. VAR label: Label;
  1906. BEGIN
  1907. NEW(label,section); RETURN label;
  1908. END NewLabel;
  1909. PROCEDURE SetLabel(label: Label);
  1910. BEGIN label.Resolve(section.pc);
  1911. END SetLabel;
  1912. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1913. BEGIN
  1914. ASSERT(label # NIL);
  1915. IF label.pc < 0 THEN (* label not yet set *)
  1916. label.AddFixup(section.pc);
  1917. END;
  1918. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1919. END LabelOperand;
  1920. PROCEDURE BrL(label: Label);
  1921. BEGIN
  1922. Emit(Br(position,LabelOperand(label)));
  1923. END BrL;
  1924. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1925. BEGIN
  1926. Emit(Brge(position,LabelOperand(label),left,right));
  1927. END BrgeL;
  1928. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1929. BEGIN
  1930. Emit(Brlt(position,LabelOperand(label),left,right));
  1931. END BrltL;
  1932. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1933. BEGIN
  1934. Emit(Breq(position,LabelOperand(label),left,right));
  1935. END BreqL;
  1936. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1937. BEGIN
  1938. Emit(Brne(position,LabelOperand(label),left,right));
  1939. END BrneL;
  1940. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1941. VAR new: IntermediateCode.Operand;
  1942. BEGIN
  1943. IF Trace THEN TraceEnter("Convert") END;
  1944. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1945. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1946. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1947. & (operand.offset = 0)
  1948. THEN
  1949. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1950. Emit(Conv(position,new,operand));
  1951. ELSE
  1952. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1953. Emit(Conv(position,new,operand));
  1954. ReleaseIntermediateOperand(operand);
  1955. END;
  1956. operand := new;
  1957. 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
  1958. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1959. ELSE
  1960. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1961. Emit(Conv(position,new,operand));
  1962. ReleaseIntermediateOperand(operand);
  1963. operand := new;
  1964. END;
  1965. IF Trace THEN TraceExit("Convert") END;
  1966. END Convert;
  1967. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1968. VAR exit: Label;
  1969. BEGIN
  1970. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1971. exit := NewLabel();
  1972. br(exit,left,right);
  1973. EmitTrap(position,trapNo);
  1974. SetLabel(exit);
  1975. END TrapC;
  1976. (** expressions *)
  1977. (** emit necessary runtime check for set elements **)
  1978. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1979. VAR max: IntermediateCode.Operand;
  1980. BEGIN
  1981. IF isUnchecked THEN RETURN END;
  1982. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1983. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1984. TrapC(BrgeL, max, o, SetElementTrap);
  1985. END;
  1986. END CheckSetElement;
  1987. (** the set that a range represents **)
  1988. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1989. VAR
  1990. operand: Operand;
  1991. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1992. BEGIN
  1993. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1994. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1995. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1996. one := IntermediateCode.Immediate(setType, 1);
  1997. Evaluate(x, operand);
  1998. Convert(operand.op, setType);
  1999. Convert(operand.tag, setType);
  2000. CheckSetElement(operand.op);
  2001. CheckSetElement(operand.tag);
  2002. (* create mask for lower bound
  2003. i.e. shift 11111111 to the left by the value of the lower bound
  2004. *)
  2005. Reuse1(temp, operand.op);
  2006. Emit(Shl(position,temp, allBits, operand.op));
  2007. ReleaseIntermediateOperand(operand.op);
  2008. operand.op := temp;
  2009. (* create mask for upper bound
  2010. i.e. shift 11111111 to the right by the difference between the
  2011. upper bound and the maximum number of set elements
  2012. *)
  2013. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2014. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2015. Reuse1(temp, operand.tag);
  2016. ELSE
  2017. Reuse1(temp, operand.tag);
  2018. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2019. Emit(Sub(position,temp, size, operand.tag));
  2020. END;
  2021. Emit(Shr(position,temp, allBits, operand.tag));
  2022. ReleaseIntermediateOperand(operand.tag);
  2023. operand.tag := temp;
  2024. Reuse2(resultingSet, operand.op, operand.tag);
  2025. (* intersect the two masks *)
  2026. Emit(And(position,resultingSet, operand.op, operand.tag));
  2027. ReleaseOperand(operand);
  2028. RETURN resultingSet
  2029. END SetFromRange;
  2030. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2031. VAR
  2032. res, operand: Operand;
  2033. temp, one, noBits, dest: IntermediateCode.Operand;
  2034. expression: SyntaxTree.Expression;
  2035. i: LONGINT;
  2036. BEGIN
  2037. IF Trace THEN TraceEnter("VisitSet") END;
  2038. dest := destination;
  2039. destination := emptyOperand;
  2040. noBits := IntermediateCode.Immediate(setType, 0);
  2041. one := IntermediateCode.Immediate(setType, 1);
  2042. (* start off with the empty set *)
  2043. InitOperand(res, ModeValue);
  2044. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2045. Emit(Mov(position,res.op, noBits));
  2046. FOR i := 0 TO x.elements.Length() - 1 DO
  2047. expression := x.elements.GetExpression(i);
  2048. IF expression IS SyntaxTree.RangeExpression THEN
  2049. (* range of set elements *)
  2050. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2051. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2052. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2053. ReleaseIntermediateOperand(temp)
  2054. ELSE
  2055. (* singelton element *)
  2056. Evaluate(expression, operand);
  2057. Convert(operand.op, setType);
  2058. CheckSetElement(operand.op);
  2059. (* create subset containing single element *)
  2060. Reuse1(temp, operand.op);
  2061. Emit(Shl(position,temp, one, operand.op));
  2062. ReleaseOperand(operand);
  2063. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2064. ReleaseIntermediateOperand(temp);
  2065. END
  2066. END;
  2067. result := res;
  2068. destination := dest;
  2069. IF Trace THEN TraceExit("VisitSet") END;
  2070. END VisitSet;
  2071. (* math arrays of the form [a,b,c]
  2072. x is a static array and thus does not provide any pointers
  2073. *)
  2074. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2075. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2076. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2077. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2078. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2079. element: SyntaxTree.IntegerValue;
  2080. BEGIN
  2081. numberElements := x.elements.Length();
  2082. expression := index.parameters.GetExpression(dim);
  2083. element := expression(SyntaxTree.IntegerValue);
  2084. FOR i := 0 TO numberElements-1 DO
  2085. expression := x.elements.GetExpression(i);
  2086. element.SetValue(i);
  2087. IF expression IS SyntaxTree.MathArrayExpression THEN
  2088. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2089. ELSE
  2090. Assign(index,expression);
  2091. END;
  2092. END;
  2093. END RecursiveAssignment;
  2094. BEGIN
  2095. (*static math array not providing pointers anyway *)
  2096. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2097. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2098. designator.SetType(variable.type);
  2099. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  2100. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2101. FOR i := 0 TO dim-1 DO
  2102. element := SyntaxTree.NewIntegerValue(x.position,0);
  2103. element.SetType(system.longintType);
  2104. index.parameters.AddExpression(element);
  2105. END;
  2106. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2107. RecursiveAssignment(x,0);
  2108. Expression(designator);
  2109. END VisitMathArrayExpression;
  2110. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2111. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2112. BEGIN
  2113. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2114. dest := destination; destination := emptyOperand;
  2115. IF x.operator = Scanner.Not THEN
  2116. IF conditional THEN
  2117. Condition(x.left,falseLabel,trueLabel)
  2118. ELSE
  2119. Evaluate(x.left,operand);
  2120. InitOperand(result,ModeValue);
  2121. Reuse1a(result.op,operand.op,dest);
  2122. Emit(Xor(position,result.op,operand.op,true));
  2123. ReleaseOperand(operand);
  2124. END;
  2125. ELSIF x.operator = Scanner.Minus THEN
  2126. Evaluate(x.left,operand);
  2127. InitOperand(result,ModeValue);
  2128. Reuse1a(result.op,operand.op,dest);
  2129. type := x.left.type.resolved;
  2130. IF type IS SyntaxTree.SetType THEN
  2131. Emit(Not(position,result.op,operand.op));
  2132. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2133. Reuse1(result.tag,operand.tag);
  2134. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2135. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2136. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2137. Emit(Neg(position,result.op,operand.op));
  2138. ELSE HALT(200)
  2139. END;
  2140. ReleaseOperand(operand);
  2141. ELSIF x.operator = Scanner.Address THEN
  2142. Designate(x.left,operand);
  2143. operand.mode := ModeValue;
  2144. t0 := x.left.type.resolved;
  2145. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2146. ReleaseIntermediateOperand(operand.op);
  2147. operand.op := operand.tag;
  2148. IntermediateCode.InitOperand(operand.tag);
  2149. END;
  2150. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2151. result := operand;
  2152. ELSE HALT(100)
  2153. END;
  2154. destination := dest;
  2155. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2156. END VisitUnaryExpression;
  2157. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2158. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2159. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2160. BEGIN
  2161. type := type.resolved;
  2162. originalType := type;
  2163. IF type IS SyntaxTree.PointerType THEN
  2164. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2165. END;
  2166. IF type IS SyntaxTree.ObjectType THEN
  2167. BrL(trueL);
  2168. ELSE
  2169. ASSERT(type IS SyntaxTree.RecordType);
  2170. (*
  2171. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2172. *)
  2173. ReuseCopy(left,tag);
  2174. right := TypeDescriptorAdr(type);
  2175. IF ~newObjectFile THEN
  2176. IntermediateCode.MakeMemory(right,addressType);
  2177. END;
  2178. IF backend.cooperative THEN
  2179. repeatL := NewLabel();
  2180. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2181. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2182. END;
  2183. SetLabel(repeatL);
  2184. BreqL(trueL,left,right);
  2185. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2186. BrneL(repeatL,left,nil);
  2187. ELSIF meta.simple THEN
  2188. level := type(SyntaxTree.RecordType).Level();
  2189. (* get type desc tag of level relative to base tag *)
  2190. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2191. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2192. IntermediateCode.MakeMemory(left,addressType);
  2193. BreqL(trueL,left,right);
  2194. ELSE
  2195. level := type(SyntaxTree.RecordType).Level();
  2196. (* get type desc tag of level relative to base tag *)
  2197. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2198. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2199. IntermediateCode.MakeMemory(left,addressType);
  2200. BreqL(trueL,left,right);
  2201. END;
  2202. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2203. BrL(falseL);
  2204. END;
  2205. END TypeTest;
  2206. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2207. BEGIN
  2208. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2209. IF dump # NIL THEN
  2210. dump.String(s); dump.Ln;
  2211. END;
  2212. END Error;
  2213. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2214. BEGIN
  2215. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2216. IF dump # NIL THEN
  2217. dump.String(s); dump.Ln; dump.Update;
  2218. END;
  2219. END Warning;
  2220. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2221. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2222. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2223. operand:Operand;
  2224. BEGIN
  2225. previousSection := section;
  2226. Global.GetModuleName(mod,name);
  2227. Strings.Append(name,".@Trace");
  2228. Basic.ToSegmentedName(name, pooledName);
  2229. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2230. IF dump # NIL THEN dump := section.comments END;
  2231. IF backend.hasLinkRegister THEN
  2232. Emit(Push(Basic.invalidPosition, lr));
  2233. END;
  2234. variable := mod.moduleScope.firstVariable;
  2235. WHILE variable # NIL DO
  2236. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2237. Symbol(variable, operand);
  2238. register := operand.op;
  2239. CallTraceMethod(register, variable.type);
  2240. ReleaseIntermediateOperand(register);
  2241. END;
  2242. variable := variable.nextVariable;
  2243. END;
  2244. IF backend.hasLinkRegister THEN
  2245. Emit(Pop(Basic.invalidPosition, lr));
  2246. END;
  2247. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2248. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2249. Emit(Br(position,op));
  2250. INC(statCoopTraceModule, section.pc);
  2251. section := previousSection;
  2252. IF dump # NIL THEN dump := section.comments END;
  2253. END CreateTraceModuleMethod;
  2254. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2255. BEGIN
  2256. Emit (Push(position, dst));
  2257. Emit (Push(position, src));
  2258. CallThis(position,"GarbageCollector","Assign", 2);
  2259. END CallAssignPointer;
  2260. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2261. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2262. BEGIN
  2263. IF SemanticChecker.IsPointerType (type) THEN
  2264. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2265. ELSIF type.IsRecordType() THEN
  2266. Emit (Push(position,dst));
  2267. Emit (Push(position,src));
  2268. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2269. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2270. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2271. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2272. ELSIF IsStaticArray(type) THEN
  2273. size := StaticArrayNumElements(type);
  2274. base := StaticArrayBaseType(type);
  2275. IF base.IsRecordType() THEN
  2276. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2277. Emit (Push(position, dst));
  2278. Emit (Push(position, src));
  2279. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2280. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2281. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2282. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2283. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2284. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2285. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2286. Emit (Push(position, dst));
  2287. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2288. Emit (Push(position, src));
  2289. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2290. ELSE
  2291. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2292. Emit (Push(position, dst));
  2293. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2294. Emit (Push(position, src));
  2295. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2296. ASSERT(StaticArrayBaseType(type).IsPointer());
  2297. END;
  2298. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2299. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2300. Emit (Push(position, dst));
  2301. Emit (Push(position, src));
  2302. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2303. ELSE HALT(100); (* missing ? *)
  2304. END;
  2305. END CallAssignMethod;
  2306. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2307. VAR name: Basic.SegmentedName;
  2308. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2309. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2310. context: Context;
  2311. BEGIN
  2312. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2313. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2314. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2315. GetRecordTypeName (recordType,name);
  2316. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2317. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2318. IF dump # NIL THEN dump := section.comments END;
  2319. IF backend.hasLinkRegister THEN
  2320. Emit(Push(Basic.invalidPosition, lr));
  2321. END;
  2322. variable := recordType.recordScope.firstVariable;
  2323. WHILE variable # NIL DO
  2324. IF variable.NeedsTrace() THEN
  2325. dst := NewRegisterOperand (addressType);
  2326. src := NewRegisterOperand (addressType);
  2327. Emit (Mov(position, dst, parameter1));
  2328. Emit (Mov(position, src, parameter2));
  2329. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2330. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2331. CallAssignMethod(dst, src, variable.type);
  2332. ReleaseIntermediateOperand(src);
  2333. ReleaseIntermediateOperand(dst);
  2334. END;
  2335. variable := variable.nextVariable;
  2336. END;
  2337. recordBase := recordType.GetBaseRecord();
  2338. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2339. IF backend.hasLinkRegister THEN
  2340. Emit(Pop(Basic.invalidPosition, lr));
  2341. END;
  2342. GetRecordTypeName (recordBase,name);
  2343. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2344. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2345. Emit(Br(position,op));
  2346. ELSE
  2347. Emit(Exit(position,0,0, 0));
  2348. END;
  2349. IF ~recordType.isObject THEN
  2350. GetRecordTypeName (recordType,name);
  2351. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2352. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2353. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2354. NEW(registerUsageCount);
  2355. usedRegisters := NIL;
  2356. dst := NewRegisterOperand (addressType);
  2357. src := NewRegisterOperand (addressType);
  2358. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2359. Emit(Mov(position, dst, parameter1));
  2360. Emit(Mov(position, src, parameter2));
  2361. label := NewLabel();
  2362. SetLabel(label);
  2363. Emit(Push(position, dst));
  2364. Emit(Push(position, src));
  2365. GetRecordTypeName (recordType,name);
  2366. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2367. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2368. Emit(Call(position, op, 0));
  2369. Emit(Pop(position, src));
  2370. Emit(Pop(position, dst));
  2371. Emit(Add(position, dst, dst, ofs));
  2372. Emit(Add(position, src, src, ofs));
  2373. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2374. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2375. Emit(Exit(position,0,0, 0));
  2376. END;
  2377. INC(statCoopAssignProcedure, section.pc);
  2378. ReturnToContext(context);
  2379. IF dump # NIL THEN dump := section.comments END;
  2380. END CreateAssignProcedure;
  2381. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2382. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2383. BEGIN
  2384. IF IsUnsafePointer (type) THEN
  2385. skip := NewLabel();
  2386. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2387. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2388. BreqL (skip, op, nil);
  2389. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2390. SetLabel (skip);
  2391. ELSIF SemanticChecker.IsPointerType (type) THEN
  2392. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2393. CallThis(position,"GarbageCollector","Mark", 1);
  2394. ELSIF type.IsRecordType() THEN
  2395. Emit (Push(position,register));
  2396. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2397. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2398. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2399. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2400. ELSIF IsStaticArray(type) THEN
  2401. size := StaticArrayNumElements(type);
  2402. base := StaticArrayBaseType(type);
  2403. IF base.IsRecordType() THEN
  2404. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2405. Emit (Push(position, register));
  2406. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2407. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2408. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2409. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2410. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2411. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2412. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2413. Emit (Push(position, register));
  2414. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2415. ELSE
  2416. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2417. Emit (Push(position, register));
  2418. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2419. ASSERT(base.IsPointer());
  2420. END;
  2421. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2422. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2423. CallThis(position,"GarbageCollector","Mark", 1);
  2424. ELSE HALT(100); (* missing ? *)
  2425. END;
  2426. END CallTraceMethod;
  2427. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2428. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2429. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2430. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2431. BEGIN
  2432. previousSection := section;
  2433. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2434. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2435. GetRecordTypeName (recordType,name);
  2436. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2437. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2438. IF dump # NIL THEN dump := section.comments END;
  2439. IF backend.hasLinkRegister THEN
  2440. Emit(Push(Basic.invalidPosition, lr));
  2441. END;
  2442. variable := recordType.recordScope.firstVariable;
  2443. WHILE variable # NIL DO
  2444. IF variable.NeedsTrace() THEN
  2445. register := NewRegisterOperand (addressType);
  2446. Emit (Mov(position,register,parameter1));
  2447. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2448. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2449. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2450. END;
  2451. CallTraceMethod(register, variable.type);
  2452. ReleaseIntermediateOperand(register);
  2453. END;
  2454. variable := variable.nextVariable;
  2455. END;
  2456. recordBase := recordType.GetBaseRecord();
  2457. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2458. recordBase := recordBase.GetBaseRecord();
  2459. END;
  2460. IF recordBase # NIL THEN
  2461. IF backend.hasLinkRegister THEN
  2462. Emit(Pop(Basic.invalidPosition, lr));
  2463. END;
  2464. GetRecordTypeName (recordBase,name);
  2465. IF HasExplicitTraceMethod (recordBase) THEN
  2466. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2467. ELSE
  2468. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2469. END;
  2470. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2471. Emit(Br(position,op));
  2472. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2473. Emit(Exit(position,0,0,0));
  2474. ELSE
  2475. IF backend.hasLinkRegister THEN
  2476. Emit(Pop(Basic.invalidPosition, lr));
  2477. END;
  2478. IF recordType.isObject THEN
  2479. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2480. ELSE
  2481. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2482. END;
  2483. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2484. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2485. Emit(Br(position,op));
  2486. END;
  2487. IF ~recordType.isObject THEN
  2488. GetRecordTypeName (recordType,name);
  2489. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2490. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2491. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2492. NEW(registerUsageCount);
  2493. usedRegisters := NIL;
  2494. IF dump # NIL THEN dump := section.comments END;
  2495. register := NewRegisterOperand (addressType);
  2496. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2497. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2498. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2499. END;
  2500. Emit (Push(position,register));
  2501. GetRecordTypeName (recordType,name);
  2502. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2503. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2504. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2505. ReleaseIntermediateOperand(register);
  2506. Emit(Exit(position,0,0,0));
  2507. GetRecordTypeName (recordType,name);
  2508. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2509. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2510. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2511. NEW(registerUsageCount);
  2512. usedRegisters := NIL;
  2513. register := NewRegisterOperand (addressType);
  2514. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2515. Emit(Mov(position, register, parameter1));
  2516. label := NewLabel();
  2517. SetLabel(label);
  2518. Emit(Push(position, register));
  2519. GetRecordTypeName (recordType,name);
  2520. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2521. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2522. Emit(Call(position, op, 0));
  2523. Emit(Pop(position, register));
  2524. Emit(Add(position, register, register, ofs));
  2525. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2526. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2527. Emit(Exit(position,0,0,0));
  2528. END;
  2529. INC(statCoopTraceMethod, section.pc);
  2530. ReturnToContext(context);
  2531. IF dump # NIL THEN dump := section.comments END;
  2532. END CreateTraceMethod;
  2533. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2534. VAR name: Basic.SegmentedName;
  2535. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2536. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2537. context: Context;
  2538. BEGIN
  2539. IF recordType.isObject THEN RETURN END;
  2540. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2541. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2542. GetRecordTypeName (recordType,name);
  2543. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2544. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2545. IF dump # NIL THEN dump := section.comments END;
  2546. IF backend.hasLinkRegister THEN
  2547. Emit(Push(Basic.invalidPosition, lr));
  2548. END;
  2549. variable := recordType.recordScope.firstVariable;
  2550. WHILE variable # NIL DO
  2551. IF variable.NeedsTrace() THEN
  2552. dst := NewRegisterOperand (addressType);
  2553. Emit (Mov(position, dst, parameter1));
  2554. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2555. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2556. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2557. END;
  2558. CallResetProcedure(dst, nil, variable.type);
  2559. ReleaseIntermediateOperand(dst);
  2560. END;
  2561. variable := variable.nextVariable;
  2562. END;
  2563. recordBase := recordType.GetBaseRecord();
  2564. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2565. IF backend.hasLinkRegister THEN
  2566. Emit(Pop(Basic.invalidPosition, lr));
  2567. END;
  2568. GetRecordTypeName (recordBase,name);
  2569. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2570. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2571. Emit(Br(position,op));
  2572. ELSE
  2573. Emit(Exit(position,0,0, 0));
  2574. END;
  2575. GetRecordTypeName (recordType,name);
  2576. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2577. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2578. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2579. NEW(registerUsageCount);
  2580. usedRegisters := NIL;
  2581. dst := NewRegisterOperand (addressType);
  2582. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2583. Emit(Mov(position, dst, parameter1));
  2584. label := NewLabel();
  2585. SetLabel(label);
  2586. Emit(Push(position, dst));
  2587. GetRecordTypeName (recordType,name);
  2588. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2589. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2590. Emit(Call(position, op, 0));
  2591. Emit(Pop(position, dst));
  2592. Emit(Add(position, dst, dst, ofs));
  2593. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2594. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2595. Emit(Exit(position,0,0, 0));
  2596. INC(statCoopResetProcedure, section.pc);
  2597. ReturnToContext(context);
  2598. IF dump # NIL THEN dump := section.comments END;
  2599. END CreateResetProcedure;
  2600. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2601. VAR name: Basic.SegmentedName; context: Context;
  2602. BEGIN
  2603. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2604. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2605. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2606. IF dump # NIL THEN dump := section.comments END;
  2607. IF backend.hasLinkRegister THEN
  2608. Emit(Push(Basic.invalidPosition, lr));
  2609. END;
  2610. Emit(Push(position,fp));
  2611. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2612. ResetVariables(scope);
  2613. Emit(Pop(position,fp));
  2614. Emit(Exit(position,0,0, 0));
  2615. ReturnToContext(context);
  2616. IF dump # NIL THEN dump := section.comments END;
  2617. END CreateResetMethod;
  2618. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2619. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2620. BEGIN
  2621. IF SemanticChecker.IsPointerType (type) THEN
  2622. Emit (Push(position, dest));
  2623. CallThis(position,"GarbageCollector","Reset", 1);
  2624. ELSIF type.IsRecordType() THEN
  2625. Emit (Push(position, dest));
  2626. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2627. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2628. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2629. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2630. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2631. size := GetArrayLength(type, tag);
  2632. base := ArrayBaseType(type);
  2633. IF base.IsRecordType() THEN
  2634. Emit (Push(position, size));
  2635. Emit (Push(position, dest));
  2636. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2637. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2638. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2639. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2640. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2641. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2642. Emit (Push(position, size));
  2643. Emit (Push(position, dest));
  2644. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2645. ELSE
  2646. Emit (Push(position, size));
  2647. Emit (Push(position, dest));
  2648. CallThis(position,"GarbageCollector","ResetArray", 2);
  2649. ASSERT(ArrayBaseType(type).IsPointer());
  2650. END;
  2651. ReleaseIntermediateOperand(size);
  2652. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2653. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2654. Emit (Push(position, dest));
  2655. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2656. ELSE HALT(100); (* missing ? *)
  2657. END;
  2658. END CallResetProcedure;
  2659. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2660. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2661. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2662. VAR operand: Operand;
  2663. BEGIN
  2664. Symbol (symbol, operand);
  2665. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2666. ReleaseOperand(operand);
  2667. END Reset;
  2668. BEGIN
  2669. previousScope := currentScope;
  2670. currentScope := scope;
  2671. pc := section.pc;
  2672. variable := scope.firstVariable;
  2673. WHILE variable # NIL DO
  2674. IF variable.NeedsTrace() THEN
  2675. Reset (variable);
  2676. END;
  2677. variable := variable.nextVariable;
  2678. END;
  2679. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2680. WHILE parameter # NIL DO
  2681. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2682. Reset (parameter);
  2683. END;
  2684. parameter := parameter.nextParameter;
  2685. END;
  2686. INC(statCoopResetVariables, section.pc - pc);
  2687. currentScope := previousScope;
  2688. END ResetVariables;
  2689. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2690. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2691. VAR op: IntermediateCode.Operand; context: Context;
  2692. BEGIN
  2693. previousSection := section;
  2694. GetCodeSectionNameForSymbol(procedure, name);
  2695. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2696. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2697. IF dump # NIL THEN dump := section.comments END;
  2698. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2699. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2700. Emit(Data(position,op));
  2701. Emit(Data(position,nil));
  2702. IF HasPointers (procedure.procedureScope) THEN
  2703. GetCodeSectionNameForSymbol(procedure, name);
  2704. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2705. ELSE
  2706. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2707. END;
  2708. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2709. Emit(Data(position,op));
  2710. ReturnToContext(context);
  2711. IF dump # NIL THEN dump := section.comments END;
  2712. END CreateProcedureDescriptor;
  2713. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2714. VAR import: SyntaxTree.Import;
  2715. s: Basic.MessageString;
  2716. selfName: SyntaxTree.IdentifierString;
  2717. BEGIN
  2718. moduleScope.ownerModule.GetName(selfName);
  2719. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2720. module := moduleScope.ownerModule
  2721. ELSE
  2722. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2723. IF import = NIL THEN
  2724. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2725. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2726. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2727. s := "Module ";
  2728. Strings.Append(s,moduleName);
  2729. Strings.Append(s," cannot be imported.");
  2730. IF force THEN
  2731. Error(position,s);
  2732. ELSIF canBeLoaded THEN
  2733. IF WarningDynamicLoading THEN
  2734. Strings.Append(s, "=> no dynamic linking.");
  2735. Warning(position, s);
  2736. END;
  2737. canBeLoaded := FALSE;
  2738. END;
  2739. RETURN FALSE
  2740. ELSE
  2741. SELF.module.imports.AddName(moduleName)
  2742. END;
  2743. ELSIF import.module = NIL THEN (* already tried *)
  2744. RETURN FALSE
  2745. END;
  2746. module := import.module;
  2747. END;
  2748. RETURN TRUE
  2749. END AddImport;
  2750. (* needed for old binary object file format*)
  2751. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2752. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2753. BEGIN
  2754. IF AddImport(moduleName,module,TRUE) THEN
  2755. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2756. IF procedure = NIL THEN
  2757. s := "Instruction not supported on target, emulation procedure ";
  2758. Strings.Append(s,moduleName);
  2759. Strings.Append(s,".");
  2760. Strings.Append(s,procedureName);
  2761. Strings.Append(s," not present");
  2762. Error(position,s);
  2763. ELSE
  2764. StaticCallOperand(r,procedure);
  2765. ReleaseOperand(r);
  2766. fp := GetFingerprint(procedure);
  2767. END;
  2768. END;
  2769. END EnsureSymbol;
  2770. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2771. VAR exit: Label; trueL,falseL: Label;
  2772. BEGIN
  2773. trueL := NewLabel();
  2774. falseL := NewLabel();
  2775. exit := NewLabel();
  2776. Condition(x,trueL,falseL);
  2777. InitOperand(result,ModeValue);
  2778. SetLabel(trueL);
  2779. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2780. Emit(Mov(position,result.op,true));
  2781. BrL(exit);
  2782. SetLabel(falseL);
  2783. Emit(MovReplace(position,result.op,false));
  2784. SetLabel(exit);
  2785. END ConditionToValue;
  2786. PROCEDURE ValueToCondition(VAR op: Operand);
  2787. BEGIN
  2788. LoadValue(op,system.booleanType);
  2789. BrneL(trueLabel,op.op, false);
  2790. ReleaseOperand(op);
  2791. BrL(falseLabel);
  2792. END ValueToCondition;
  2793. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2794. VAR size: LONGINT;
  2795. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2796. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2797. BEGIN
  2798. ASSERT(type.form = SyntaxTree.Open);
  2799. baseType := type.arrayBase.resolved;
  2800. IF IsOpenArray(baseType) THEN
  2801. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2802. ELSE
  2803. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2804. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2805. END;
  2806. len := tag;
  2807. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2808. IntermediateCode.MakeMemory(len,addressType);
  2809. UseIntermediateOperand(len);
  2810. Reuse2(res,sizeOperand,len);
  2811. Emit(Mul(position,res,sizeOperand,len));
  2812. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2813. RETURN res
  2814. END GetArraySize;
  2815. BEGIN
  2816. type := type.resolved;
  2817. IF IsOpenArray(type) THEN
  2818. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2819. RETURN tag
  2820. ELSE
  2821. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2822. END;
  2823. ELSE
  2824. size := ToMemoryUnits(system,system.SizeOf(type));
  2825. RETURN IntermediateCode.Immediate(addressType,size)
  2826. END;
  2827. END GetDynamicSize;
  2828. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2829. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2830. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2831. BEGIN
  2832. ASSERT(type.form = SyntaxTree.Open);
  2833. baseType := type.arrayBase.resolved;
  2834. IF IsOpenArray(baseType) THEN
  2835. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2836. ELSE
  2837. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2838. END;
  2839. len := tag;
  2840. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2841. IntermediateCode.MakeMemory(len,addressType);
  2842. UseIntermediateOperand(len);
  2843. Reuse2(res,sizeOperand,len);
  2844. Emit(Mul(position,res,sizeOperand,len));
  2845. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2846. RETURN res
  2847. END GetLength;
  2848. BEGIN
  2849. type := type.resolved;
  2850. IF IsOpenArray(type) THEN
  2851. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2852. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2853. ELSIF type IS SyntaxTree.StringType THEN
  2854. RETURN tag;
  2855. ELSE
  2856. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2857. END;
  2858. END GetArrayLength;
  2859. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2860. VAR result: IntermediateCode.Operand;
  2861. BEGIN
  2862. IF backend.cooperative THEN
  2863. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2864. ELSE
  2865. MakeMemory(result, tag, addressType, 0);
  2866. END;
  2867. RETURN result
  2868. END GetSizeFromTag;
  2869. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2870. VAR parameter: SyntaxTree.Parameter;
  2871. BEGIN
  2872. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2873. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2874. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2875. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2876. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2877. END;
  2878. RETURN GetDynamicSize(e.type, tag);
  2879. END GetArrayOfBytesSize;
  2880. (*
  2881. to find imported symbol. not needed ?
  2882. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2883. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2884. BEGIN
  2885. IF AddImport(moduleName,importedModule,FALSE) THEN
  2886. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2887. RETURN symbol
  2888. ELSE
  2889. RETURN NIL
  2890. END
  2891. END SymbolByName;
  2892. *)
  2893. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2894. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2895. BEGIN
  2896. IF AddImport(moduleName,runtimeModule,force) THEN
  2897. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2898. IF procedure = NIL THEN
  2899. s := "Procedure ";
  2900. Strings.Append(s,moduleName);
  2901. Strings.Append(s,".");
  2902. Strings.Append(s,procedureName);
  2903. Strings.Append(s," not present");
  2904. Error(position,s);
  2905. RETURN FALSE
  2906. ELSE
  2907. RETURN TRUE
  2908. END;
  2909. ELSE RETURN FALSE
  2910. END;
  2911. END GetRuntimeProcedure;
  2912. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2913. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2914. s: Basic.MessageString;
  2915. BEGIN
  2916. Basic.InitSegmentedName(name);
  2917. name[0] := Basic.MakeString(moduleName);
  2918. name[1] := Basic.MakeString(typeName);
  2919. name[2] := -1;
  2920. IF AddImport(moduleName,importedModule, FALSE) THEN
  2921. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2922. IF symbol = NIL THEN
  2923. s := "type ";
  2924. Strings.Append(s,moduleName);
  2925. Strings.Append(s,".");
  2926. Strings.Append(s,typeName);
  2927. Strings.Append(s," not present");
  2928. Error(position,s);
  2929. END;
  2930. ELSE symbol := NIL;
  2931. END;
  2932. IF importedModule = moduleScope.ownerModule THEN
  2933. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2934. ELSE
  2935. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2936. END;
  2937. RETURN symbol
  2938. END GetTypeDescriptor;
  2939. (* 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. *)
  2940. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2941. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2942. pooledName: Basic.SegmentedName; size: LONGINT;
  2943. BEGIN
  2944. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2945. StaticCallOperand(result,procedure);
  2946. IF numberParameters < 0 THEN
  2947. size := ProcedureParametersSize(system,procedure);
  2948. ELSE
  2949. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2950. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2951. Error(position,"runtime call parameter count mismatch");
  2952. END;
  2953. END;
  2954. Emit(Call(position, result.op, size));
  2955. ReleaseOperand(result);
  2956. ELSE (* only static linking possible *)
  2957. ASSERT(numberParameters >= 0);
  2958. Basic.InitSegmentedName(pooledName);
  2959. pooledName[0] := Basic.MakeString(moduleName);
  2960. pooledName[1] := Basic.MakeString(procedureName);
  2961. pooledName[2] := -1;
  2962. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2963. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2964. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2965. END;
  2966. END CallThisChecked;
  2967. (* 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. *)
  2968. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2969. BEGIN
  2970. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2971. END CallThis;
  2972. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2973. VAR
  2974. left,right: Operand;
  2975. leftSize, rightSize: IntermediateCode.Operand;
  2976. saved: RegisterEntry;
  2977. reg: IntermediateCode.Operand;
  2978. procedureName: SyntaxTree.IdentifierString;
  2979. BEGIN
  2980. procedureName := "CompareString";
  2981. SaveRegisters();ReleaseUsedRegisters(saved);
  2982. Designate(leftExpression,left);
  2983. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2984. Emit(Push(position,leftSize));
  2985. ReleaseIntermediateOperand(leftSize);
  2986. Emit(Push(position,left.op));
  2987. ReleaseOperand(left);
  2988. Designate(rightExpression,right);
  2989. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2990. Emit(Push(position,rightSize));
  2991. ReleaseIntermediateOperand(rightSize);
  2992. Emit(Push(position,right.op));
  2993. ReleaseOperand(right);
  2994. IF backend.cooperative THEN
  2995. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2996. ELSE
  2997. CallThis(position,runtimeModuleName,procedureName, 4);
  2998. END;
  2999. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3000. Emit(Result(position,reg));
  3001. (*
  3002. AcquireThisRegister(int8,IntermediateCode.Result);
  3003. *)
  3004. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  3005. (*
  3006. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  3007. *)
  3008. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  3009. ReleaseIntermediateOperand(reg);
  3010. BrL(falseLabel);
  3011. END CompareString;
  3012. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3013. VAR
  3014. left,right: Operand;
  3015. leftSize, rightSize: IntermediateCode.Operand;
  3016. saved: RegisterEntry;
  3017. procedureName: SyntaxTree.IdentifierString;
  3018. BEGIN
  3019. procedureName := "CopyString";
  3020. SaveRegisters();ReleaseUsedRegisters(saved);
  3021. Designate(leftExpression,left);
  3022. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3023. Emit(Push(position,leftSize));
  3024. ReleaseIntermediateOperand(leftSize);
  3025. Emit(Push(position,left.op));
  3026. ReleaseOperand(left);
  3027. Designate(rightExpression,right);
  3028. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3029. Emit(Push(position,rightSize));
  3030. ReleaseIntermediateOperand(rightSize);
  3031. Emit(Push(position,right.op));
  3032. ReleaseOperand(right);
  3033. IF backend.cooperative THEN
  3034. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  3035. ELSE
  3036. CallThis(position,runtimeModuleName,procedureName,4);
  3037. END;
  3038. RestoreRegisters(saved);
  3039. END CopyString;
  3040. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3041. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3042. leftType,rightType: SyntaxTree.Type;
  3043. leftExpression,rightExpression : SyntaxTree.Expression;
  3044. componentType: IntermediateCode.Type;
  3045. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3046. size: LONGINT;
  3047. BEGIN
  3048. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3049. dest := destination; destination := emptyOperand;
  3050. leftType := x.left.type.resolved;
  3051. rightType := x.right.type.resolved;
  3052. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3053. CASE x.operator OF
  3054. Scanner.Or:
  3055. (* shortcut evaluation of left OR right *)
  3056. IF ~conditional THEN ConditionToValue(x);
  3057. ELSE
  3058. next := NewLabel();
  3059. Condition(x.left,trueLabel,next);
  3060. SetLabel(next);
  3061. Condition(x.right,trueLabel,falseLabel);
  3062. END;
  3063. |Scanner.And:
  3064. (* shortcut evaluation of left & right *)
  3065. IF ~conditional THEN ConditionToValue(x);
  3066. ELSE
  3067. next := NewLabel();
  3068. Condition(x.left,next,falseLabel);
  3069. SetLabel(next);
  3070. Condition(x.right,trueLabel,falseLabel);
  3071. END;
  3072. |Scanner.Is:
  3073. IF ~conditional THEN ConditionToValue(x);
  3074. ELSE
  3075. (* get type desc tag *)
  3076. IF IsPointerToRecord(leftType,recordType) THEN
  3077. Evaluate(x.left,left);
  3078. Dereference(left,recordType,IsUnsafePointer(leftType))
  3079. ELSE
  3080. Designate(x.left,left);
  3081. END;
  3082. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3083. ReleaseOperand(left);
  3084. END;
  3085. |Scanner.Plus:
  3086. Evaluate(x.left,left);
  3087. Evaluate(x.right,right);
  3088. IF leftType IS SyntaxTree.SetType THEN
  3089. InitOperand(result,ModeValue);
  3090. Reuse2a(result.op,left.op,right.op,dest);
  3091. Emit(Or(position,result.op,left.op,right.op));
  3092. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3093. InitOperand(result,ModeValue);
  3094. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3095. Reuse2(result.tag,left.tag,right.tag);
  3096. Emit(Add(position,result.op,left.op,right.op));
  3097. Emit(Add(position,result.tag,left.tag,right.tag))
  3098. ELSE
  3099. InitOperand(result,ModeValue);
  3100. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3101. AddInt(result.op, left.op, right.op) ;
  3102. ELSE
  3103. *)
  3104. Reuse2a(result.op,left.op,right.op,dest);
  3105. Emit(Add(position,result.op,left.op,right.op));
  3106. (*
  3107. END;
  3108. *)
  3109. END;
  3110. ReleaseOperand(left); ReleaseOperand(right);
  3111. |Scanner.Minus:
  3112. Evaluate(x.left,left);
  3113. Evaluate(x.right,right);
  3114. IF leftType IS SyntaxTree.SetType THEN
  3115. InitOperand(result,ModeValue);
  3116. Reuse1(result.op,right.op);
  3117. Emit(Not(position,result.op,right.op));
  3118. ReleaseOperand(right);
  3119. Emit(And(position,result.op,result.op,left.op));
  3120. ReleaseOperand(left);
  3121. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3122. InitOperand(result,ModeValue);
  3123. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3124. Reuse2(result.tag,left.tag,right.tag);
  3125. Emit(Sub(position,result.op,left.op,right.op));
  3126. Emit(Sub(position,result.tag,left.tag,right.tag));
  3127. ReleaseOperand(left); ReleaseOperand(right)
  3128. ELSE
  3129. InitOperand(result,ModeValue);
  3130. Reuse2a(result.op,left.op,right.op,dest);
  3131. Emit(Sub(position,result.op,left.op,right.op));
  3132. ReleaseOperand(left); ReleaseOperand(right);
  3133. END;
  3134. |Scanner.Times:
  3135. Evaluate(x.left,left);
  3136. Evaluate(x.right,right);
  3137. IF leftType IS SyntaxTree.SetType THEN
  3138. InitOperand(result,ModeValue);
  3139. Reuse2a(result.op,left.op,right.op,dest);
  3140. Emit(And(position,result.op,left.op,right.op));
  3141. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3142. InitOperand(result, ModeValue);
  3143. componentType := left.op.type;
  3144. (* TODO: review this *)
  3145. (*
  3146. result.op = left.op * right.op - left.tag * right.tag
  3147. result.tag = left.tag * right.op + left.op * right.tag
  3148. *)
  3149. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3150. Emit(Mul(position,result.op, left.op, right.op));
  3151. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3152. Emit(Mul(position,tempReg, left.tag, right.tag));
  3153. Emit(Sub(position,result.op, result.op, tempReg));
  3154. Reuse2(result.tag, left.tag, right.op);
  3155. Emit(Mul(position,result.tag, left.tag, right.op));
  3156. Emit(Mul(position,tempReg, left.op, right.tag));
  3157. Emit(Add(position,result.tag, result.tag, tempReg));
  3158. ReleaseIntermediateOperand(tempReg)
  3159. ELSE
  3160. InitOperand(result,ModeValue);
  3161. Reuse2a(result.op,left.op,right.op,dest);
  3162. Emit(Mul(position,result.op,left.op,right.op));
  3163. END;
  3164. ReleaseOperand(left); ReleaseOperand(right);
  3165. |Scanner.Div:
  3166. Evaluate(x.left,left);
  3167. Evaluate(x.right,right);
  3168. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3169. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3170. IF ~isUnchecked THEN
  3171. exit := NewLabel();
  3172. BrltL(exit,zero,right.op);
  3173. EmitTrap(position,NegativeDivisorTrap);
  3174. SetLabel(exit);
  3175. END;
  3176. END;
  3177. InitOperand(result,ModeValue);
  3178. Reuse2a(result.op,left.op,right.op,dest);
  3179. Emit(Div(position,result.op,left.op,right.op));
  3180. ReleaseOperand(left); ReleaseOperand(right);
  3181. |Scanner.Mod:
  3182. Evaluate(x.left,left);
  3183. Evaluate(x.right,right);
  3184. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3185. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3186. IF ~isUnchecked THEN
  3187. exit := NewLabel();
  3188. BrltL(exit,zero,right.op);
  3189. EmitTrap(position,NegativeDivisorTrap);
  3190. SetLabel(exit);
  3191. END;
  3192. END;
  3193. InitOperand(result,ModeValue);
  3194. Reuse2a(result.op,left.op,right.op,dest);
  3195. Emit(Mod(position,result.op,left.op,right.op));
  3196. ReleaseOperand(left); ReleaseOperand(right);
  3197. |Scanner.Slash:
  3198. Evaluate(x.left,left);
  3199. Evaluate(x.right,right);
  3200. IF leftType IS SyntaxTree.SetType THEN
  3201. InitOperand(result,ModeValue);
  3202. Reuse2a(result.op,left.op,right.op,dest);
  3203. Emit(Xor(position,result.op,left.op,right.op));
  3204. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3205. InitOperand(result,ModeValue);
  3206. componentType := left.op.type;
  3207. (* review this *)
  3208. (*
  3209. divisor = right.op * right.op + right.tag * right.tag
  3210. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3211. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3212. *)
  3213. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3214. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3215. Emit(Mul(position,tempReg, right.op, right.op));
  3216. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3217. Emit(Add(position,tempReg, tempReg, tempReg2));
  3218. result.op := tempReg2;
  3219. Emit(Mul(position,result.op, left.op, right.op));
  3220. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3221. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3222. Emit(Add(position,result.op, result.op, tempReg2));
  3223. Emit(Div(position,result.op, result.op, tempReg));
  3224. Reuse2(result.tag, left.tag, right.op);
  3225. Emit(Mul(position,result.tag, left.tag, right.op));
  3226. Emit(Mul(position,tempReg2, left.op, right.tag));
  3227. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3228. Emit(Div(position,result.tag, result.tag, tempReg));
  3229. ReleaseIntermediateOperand(tempReg);
  3230. ReleaseIntermediateOperand(tempReg2)
  3231. ELSE
  3232. InitOperand(result,ModeValue);
  3233. Reuse2a(result.op,left.op,right.op,dest);
  3234. Emit(Div(position,result.op,left.op,right.op));
  3235. END;
  3236. ReleaseOperand(left); ReleaseOperand(right);
  3237. |Scanner.Equal:
  3238. IF ~conditional THEN ConditionToValue(x);
  3239. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3240. CompareString(BreqL,x.left,x.right);
  3241. ELSE
  3242. Evaluate(x.left,left);
  3243. Evaluate(x.right,right);
  3244. IF leftType IS SyntaxTree.RangeType THEN
  3245. ASSERT(rightType IS SyntaxTree.RangeType);
  3246. BrneL(falseLabel, left.op, right.op); (* first *)
  3247. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3248. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3249. ReleaseOperand(left); ReleaseOperand(right);
  3250. BrL(trueLabel)
  3251. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3252. BrneL(falseLabel, left.op, right.op); (* first *)
  3253. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3254. ReleaseOperand(left); ReleaseOperand(right);
  3255. BrL(trueLabel)
  3256. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3257. (* TODO: review this *)
  3258. BrneL(falseLabel, left.op, right.op); (* real part *)
  3259. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3260. ReleaseOperand(left); ReleaseOperand(right);
  3261. BrL(trueLabel)
  3262. ELSE
  3263. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3264. ReleaseOperand(left); ReleaseOperand(right);
  3265. BrL(trueLabel);
  3266. END;
  3267. END;
  3268. |Scanner.LessEqual:
  3269. IF ~conditional THEN ConditionToValue(x);
  3270. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3271. CompareString(BrgeL,x.right,x.left);
  3272. ELSE
  3273. Evaluate(x.left,left);
  3274. Evaluate(x.right,right);
  3275. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3276. Reuse1(temp.op,right.op);
  3277. Emit(And(position,temp.op,left.op,right.op));
  3278. ReleaseOperand(right);
  3279. BreqL(trueLabel,temp.op,left.op);
  3280. BrL(falseLabel);
  3281. ReleaseOperand(temp);ReleaseOperand(left);
  3282. ELSE
  3283. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3284. ReleaseOperand(left); ReleaseOperand(right);
  3285. BrL(trueLabel);
  3286. END;
  3287. END;
  3288. |Scanner.Less:
  3289. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3290. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3291. leftExpression.SetType(system.booleanType);
  3292. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3293. rightExpression.SetType(system.booleanType);
  3294. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3295. leftExpression.SetType(system.booleanType);
  3296. Expression(leftExpression);
  3297. ELSIF ~conditional THEN ConditionToValue(x);
  3298. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3299. CompareString(BrltL,x.left,x.right);
  3300. ELSE
  3301. Evaluate(x.left,left);
  3302. Evaluate(x.right,right);
  3303. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3304. ReleaseOperand(left); ReleaseOperand(right);
  3305. BrL(trueLabel);
  3306. END;
  3307. |Scanner.Greater:
  3308. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3309. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3310. leftExpression.SetType(system.booleanType);
  3311. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3312. rightExpression.SetType(system.booleanType);
  3313. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3314. leftExpression.SetType(system.booleanType);
  3315. Expression(leftExpression);
  3316. ELSIF ~conditional THEN ConditionToValue(x);
  3317. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3318. CompareString(BrltL,x.right,x.left);
  3319. ELSE
  3320. Evaluate(x.left,left);
  3321. Evaluate(x.right,right);
  3322. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3323. ReleaseOperand(left); ReleaseOperand(right);
  3324. BrL(trueLabel);
  3325. END;
  3326. |Scanner.GreaterEqual:
  3327. IF ~conditional THEN ConditionToValue(x);
  3328. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3329. CompareString(BrgeL,x.left,x.right);
  3330. ELSE
  3331. Evaluate(x.left,left);
  3332. Evaluate(x.right,right);
  3333. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3334. Reuse1(temp.op,left.op);
  3335. Emit(And(position,temp.op,left.op,right.op));
  3336. ReleaseOperand(left);
  3337. BreqL(trueLabel, temp.op,right.op);
  3338. ReleaseOperand(temp); ReleaseOperand(right);
  3339. BrL(falseLabel);
  3340. ELSE
  3341. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3342. ReleaseOperand(left); ReleaseOperand(right);
  3343. BrL(trueLabel);
  3344. END;
  3345. END;
  3346. |Scanner.Unequal:
  3347. IF ~conditional THEN ConditionToValue(x);
  3348. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3349. CompareString(BrneL,x.left,x.right);
  3350. ELSE
  3351. Evaluate(x.left,left);
  3352. Evaluate(x.right,right);
  3353. IF leftType IS SyntaxTree.RangeType THEN
  3354. ASSERT(rightType IS SyntaxTree.RangeType);
  3355. BrneL(trueLabel, left.op, right.op); (* first *)
  3356. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3357. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3358. ReleaseOperand(left); ReleaseOperand(right);
  3359. BrL(falseLabel)
  3360. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3361. BrneL(trueLabel, left.op, right.op); (* first *)
  3362. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3363. ReleaseOperand(left); ReleaseOperand(right);
  3364. BrL(falseLabel)
  3365. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3366. (* TODO: review this *)
  3367. BrneL(trueLabel, left.op, right.op); (* real part *)
  3368. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3369. ReleaseOperand(left); ReleaseOperand(right);
  3370. BrL(falseLabel)
  3371. ELSE
  3372. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3373. ReleaseOperand(left); ReleaseOperand(right);
  3374. BrL(trueLabel);
  3375. END;
  3376. END;
  3377. |Scanner.In:
  3378. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3379. Evaluate(x.left,left);
  3380. Evaluate(x.right,right);
  3381. Convert(left.op,setType);
  3382. Convert(right.op,setType);
  3383. ReuseCopy(temp.op,right.op);
  3384. Emit(Shr(position,temp.op,temp.op,left.op));
  3385. ReleaseOperand(right); ReleaseOperand(left);
  3386. IntermediateCode.InitImmediate(one,setType,1);
  3387. Emit(And(position,temp.op,temp.op,one));
  3388. IF conditional THEN
  3389. IntermediateCode.InitImmediate(zero,setType,0);
  3390. BrneL(trueLabel,temp.op,zero);
  3391. ReleaseOperand(temp);
  3392. BrL(falseLabel);
  3393. ELSE
  3394. Convert(temp.op,bool);
  3395. result.mode := ModeValue;
  3396. result.op := temp.op;
  3397. result.tag := nil; (* may be left over from calls to evaluate *)
  3398. END;
  3399. ELSE
  3400. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3401. IF x.operator = Scanner.Questionmarks THEN
  3402. leftExpression := x.left;
  3403. rightExpression := x.right;
  3404. ELSE
  3405. leftExpression := x.right;
  3406. rightExpression := x.left;
  3407. END;
  3408. Evaluate(leftExpression, left);
  3409. Emit(Push(position,left.op));
  3410. ReleaseOperand(left);
  3411. Designate(rightExpression, right);
  3412. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3413. IF ~backend.cellsAreObjects THEN
  3414. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3415. END;
  3416. Emit(Push(position,right.op));
  3417. ReleaseOperand(right);
  3418. IF backend.cellsAreObjects THEN
  3419. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3420. ELSE
  3421. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3422. END;
  3423. InitOperand(result, ModeValue);
  3424. result.op := NewRegisterOperand(bool);
  3425. Emit(Result(position,result.op));
  3426. IF conditional THEN
  3427. IntermediateCode.InitImmediate(zero,setType,0);
  3428. BrneL(trueLabel,result.op,zero);
  3429. ReleaseOperand(result);
  3430. BrL(falseLabel);
  3431. END;
  3432. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3433. leftExpression := x.left;
  3434. rightExpression := x.right;
  3435. Evaluate(leftExpression, left);
  3436. Emit(Push(position,left.op));
  3437. ReleaseOperand(left);
  3438. Evaluate(rightExpression, right);
  3439. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3440. IF ~backend.cellsAreObjects THEN
  3441. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3442. END;
  3443. Emit(Push(position,right.op));
  3444. ReleaseOperand(right);
  3445. IF backend.cellsAreObjects THEN
  3446. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3447. ELSE
  3448. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3449. END;
  3450. InitOperand(result, ModeValue);
  3451. result.op := NewRegisterOperand(bool);
  3452. Emit(Result(position,result.op));
  3453. IF conditional THEN
  3454. IntermediateCode.InitImmediate(zero,setType,0);
  3455. BrneL(trueLabel,result.op,zero);
  3456. ReleaseOperand(result);
  3457. BrL(falseLabel);
  3458. END;
  3459. ELSE
  3460. HALT(100);
  3461. END;
  3462. END;
  3463. destination := dest;
  3464. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3465. END VisitBinaryExpression;
  3466. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3467. VAR localResult, operand: Operand;
  3468. BEGIN
  3469. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3470. InitOperand(localResult, ModeValue);
  3471. ASSERT(x.first # NIL);
  3472. Evaluate(x.first, operand);
  3473. localResult.op := operand.op;
  3474. ReleaseOperand(operand);
  3475. UseIntermediateOperand(localResult.op);
  3476. ASSERT(x.last # NIL);
  3477. Evaluate(x.last, operand);
  3478. localResult.tag := operand.op;
  3479. ReleaseOperand(operand);
  3480. UseIntermediateOperand(localResult.tag);
  3481. IF x.step # NIL THEN
  3482. Evaluate(x.step, operand);
  3483. localResult.extra := operand.op;
  3484. ReleaseOperand(operand);
  3485. UseIntermediateOperand(localResult.extra);
  3486. END;
  3487. result := localResult;
  3488. IF Trace THEN TraceExit("VisitRangeExpression") END
  3489. END VisitRangeExpression;
  3490. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3491. BEGIN
  3492. HALT(100); (* should never be evaluated *)
  3493. END VisitTensorRangeExpression;
  3494. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3495. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3496. BEGIN
  3497. IF Trace THEN TraceEnter("VisitConversion") END;
  3498. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3499. dest := destination; destination := emptyOperand;
  3500. Evaluate(x.expression,old);
  3501. InitOperand(result,ModeValue);
  3502. result.op := old.op;
  3503. ASSERT(result.op.mode # 0);
  3504. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3505. (* convert TO a complex number *)
  3506. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3507. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3508. ASSERT(result.op.mode # 0);
  3509. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3510. (* convert FROM a complex number TO a complex number*)
  3511. result.tag := old.tag;
  3512. ASSERT(result.tag.mode # 0);
  3513. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3514. ASSERT(result.tag.mode # 0)
  3515. ELSE
  3516. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3517. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3518. END
  3519. ELSE
  3520. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3521. ASSERT(result.op.mode # 0);
  3522. result.tag := old.tag; (*! probably never used *)
  3523. END;
  3524. destination := dest;
  3525. IF Trace THEN TraceExit("VisitConversion") END;
  3526. END VisitConversion;
  3527. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3528. BEGIN
  3529. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3530. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3531. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3532. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3533. END VisitTypeDeclaration;
  3534. (** designators (expressions) *)
  3535. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3536. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3537. BEGIN
  3538. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3539. IF x.left # NIL THEN Expression(x.left) END;
  3540. Symbol(x.symbol,result);
  3541. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3542. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3543. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3544. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3545. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3546. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3547. END;
  3548. END;
  3549. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3550. END VisitSymbolDesignator;
  3551. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3552. BEGIN
  3553. IF isUnchecked THEN RETURN END;
  3554. IF tagsAvailable THEN
  3555. TrapC(BrltL,index,length,IndexCheckTrap);
  3556. END;
  3557. END BoundCheck;
  3558. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3559. VAR d: IntermediateCode.Operand;
  3560. BEGIN
  3561. IF isUnchecked THEN RETURN END;
  3562. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3563. TrapC(op,dim,d,ArraySizeTrap);
  3564. ReleaseIntermediateOperand(d);
  3565. END DimensionCheck;
  3566. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3567. VAR
  3568. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3569. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3570. expression: SyntaxTree.Expression;
  3571. resultingType, leftType, baseType: SyntaxTree.Type;
  3572. skipLabel1: Label;
  3573. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3574. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3575. variableOp: Operand;
  3576. variable: SyntaxTree.Variable;
  3577. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3578. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3579. VAR e: SyntaxTree.Expression; i: LONGINT;
  3580. BEGIN
  3581. tensorFound := FALSE;
  3582. FOR i := 0 TO parameters.Length()-1 DO
  3583. e := parameters.GetExpression(i);
  3584. IF e IS SyntaxTree.TensorRangeExpression THEN
  3585. ASSERT(~tensorFound);
  3586. tensorFound := TRUE;
  3587. ELSIF e IS SyntaxTree.RangeExpression THEN
  3588. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3589. ELSE
  3590. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3591. END;
  3592. END;
  3593. END CountIndices;
  3594. BEGIN
  3595. ASSERT(tagsAvailable);
  3596. resultingType := x.type.resolved; (* resulting type *)
  3597. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3598. InitOperand(localResult, ModeReference);
  3599. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3600. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3601. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3602. (* a globally defined array destination tag is available -> use and invalidate it*)
  3603. localResult.tag := arrayDestinationTag;
  3604. IntermediateCode.InitOperand(arrayDestinationTag)
  3605. ELSE
  3606. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3607. (* the result is of array range type and thus does not provide any collectable pointers *)
  3608. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3609. Symbol(variable, variableOp);
  3610. ReuseCopy(localResult.tag, variableOp.op);
  3611. ReleaseOperand(variableOp);
  3612. END
  3613. END;
  3614. indexListSize := x.parameters.Length();
  3615. CountIndices(x.parameters);
  3616. (*ASSERT(tensorRangeCount <= 1);*)
  3617. (* designate the array to be indexed over, perform tensor range check if known *)
  3618. Designate(x.left, array);
  3619. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3620. Dereference(array, leftType,FALSE);
  3621. IF ~tensorFound THEN
  3622. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3623. END
  3624. END;
  3625. (* default base offset *)
  3626. srcDimOffset := 0;
  3627. destDimOffset := 0;
  3628. indexDim := 0;
  3629. (* use address of source array as basis *)
  3630. localResult.op := array.op;
  3631. UseIntermediateOperand(localResult.op);
  3632. (* go through the index list *)
  3633. FOR i := 0 TO indexListSize - 1 DO
  3634. expression := x.parameters.GetExpression(i);
  3635. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3636. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3637. srcDimOffset := -indexListSize;
  3638. destDimOffset := -suffixRanges;
  3639. ELSE
  3640. (* determine which dimension of source array is currently looked at *)
  3641. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3642. (* get the memory operand pointing to array descriptor dimension *)
  3643. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3644. (* make a reusable register from it *)
  3645. ReuseCopy(srcDim, tmp);
  3646. ReleaseIntermediateOperand(tmp);
  3647. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3648. ELSE
  3649. srcDim := IntermediateCode.Immediate(sizeType, i);
  3650. END;
  3651. (* get length and increment of source array for current dimension *)
  3652. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3653. Convert(sourceLength.op, sizeType);
  3654. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3655. Convert(sourceIncrement.op, sizeType);
  3656. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3657. ReleaseIntermediateOperand(srcDim);
  3658. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3659. (* SINGLE INDEX *)
  3660. Evaluate(expression, index);
  3661. ReleaseIntermediateOperand(index.tag);
  3662. index.tag := emptyOperand;
  3663. Convert(index.op, sizeType);
  3664. (* lower bound check *)
  3665. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3666. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3667. ELSIF isUnchecked THEN (* do nothing *)
  3668. ELSE
  3669. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3670. END;
  3671. (* upper bound check *)
  3672. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3673. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3674. ELSIF isUnchecked THEN (* do nothing *)
  3675. ELSE
  3676. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3677. END;
  3678. ReleaseOperand(sourceLength);
  3679. Convert(index.op, addressType);
  3680. summand := index.op;
  3681. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3682. (* RANGE OF INDICES *)
  3683. Evaluate(expression, range);
  3684. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3685. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3686. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3687. ReleaseOperand(range);
  3688. Convert(firstIndex, sizeType);
  3689. Convert(lastIndex, sizeType);
  3690. Convert(stepSize, sizeType);
  3691. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3692. if it is 'MAX(LONGINT)' *)
  3693. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3694. TransferToRegister(lastIndex, lastIndex);
  3695. skipLabel1 := NewLabel();
  3696. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3697. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3698. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3699. SetLabel(skipLabel1)
  3700. END;
  3701. (* check if step size is valid *)
  3702. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3703. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3704. ELSIF isUnchecked THEN (* do nothing *)
  3705. ELSE
  3706. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3707. END;
  3708. (* check lower bound check *)
  3709. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3710. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3711. ELSIF isUnchecked THEN (* do nothing *)
  3712. ELSE
  3713. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3714. END;
  3715. (* check upper bound check *)
  3716. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3717. (* statically open range: nothing to do *)
  3718. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3719. ASSERT(staticLastIndex < staticSourceLength)
  3720. ELSIF isUnchecked THEN (* do nothing *)
  3721. ELSE
  3722. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3723. END;
  3724. (* determine length of target array for current dimension *)
  3725. (* 1. incorporate last index: *)
  3726. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3727. (* last index is static *)
  3728. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3729. targetLength := sourceLength.op
  3730. ELSE
  3731. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3732. END;
  3733. UseIntermediateOperand(targetLength);
  3734. ELSE
  3735. (* targetLength := lastIndex + 1
  3736. Reuse1(targetLength, lastIndex);
  3737. *)
  3738. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3739. END;
  3740. ReleaseOperand(sourceLength);
  3741. ReleaseIntermediateOperand(lastIndex);
  3742. (* 2. incorporate first index: *)
  3743. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3744. (* first index and current target length are static *)
  3745. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3746. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3747. (* first index = 0: nothing to do *)
  3748. ELSE
  3749. (* targetLength := targetLength - firstIndex *)
  3750. TransferToRegister(targetLength, targetLength);
  3751. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3752. END;
  3753. (* clip negative lengths to 0 *)
  3754. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3755. IF staticTargetLength < 0 THEN
  3756. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3757. END
  3758. ELSE
  3759. skipLabel1 := NewLabel();
  3760. TransferToRegister(targetLength, targetLength);
  3761. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3762. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3763. SetLabel(skipLabel1)
  3764. END;
  3765. (* 3. incorporate index step size: *)
  3766. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3767. (*step size and current target length are static *)
  3768. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3769. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3770. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3771. (* step size = 1: nothing to do *)
  3772. ELSE
  3773. (* emit code for this:
  3774. targetLength := (targetLength-1) DIV stepSize +1;
  3775. *)
  3776. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3777. DivInt(targetLength, targetLength, stepSize);
  3778. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3779. END;
  3780. (* determine increment of target array for current dimension *)
  3781. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3782. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3783. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3784. (* step size = 1 *)
  3785. targetIncrement := sourceIncrement.op;
  3786. UseIntermediateOperand(targetIncrement)
  3787. ELSE
  3788. (* targetIncrement := sourceIncrement * stepSize *)
  3789. Reuse1(targetIncrement, stepSize);
  3790. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3791. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3792. END;
  3793. ReleaseIntermediateOperand(stepSize);
  3794. (* write length and increment of target array to descriptor *)
  3795. IF destDimOffset < 0 THEN
  3796. (* determine which dimension of target array is currently looked at *)
  3797. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3798. TransferToRegister(destDim, tmp);
  3799. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3800. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3801. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3802. ReleaseIntermediateOperand(destDim);
  3803. INC(destDimOffset);
  3804. ELSE
  3805. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3806. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3807. END;
  3808. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3809. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3810. INC(indexDim);
  3811. Convert(firstIndex, addressType);
  3812. TransferToRegister(summand, firstIndex);
  3813. ELSE HALT(100);
  3814. END;
  3815. (*
  3816. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3817. *)
  3818. Convert(sourceIncrement.op, addressType);
  3819. Convert(summand, addressType);
  3820. MulInt(summand, summand, sourceIncrement.op);
  3821. ReleaseIntermediateOperand(sourceIncrement.op);
  3822. AddInt(localResult.op, localResult.op, summand);
  3823. ReleaseIntermediateOperand(summand);
  3824. END
  3825. END;
  3826. result := localResult;
  3827. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3828. ReleaseIntermediateOperand(result.tag);
  3829. result.tag := TypeDescriptorAdr(resultingType);
  3830. IF ~newObjectFile THEN
  3831. IntermediateCode.MakeMemory(result.tag,addressType);
  3832. END;
  3833. ELSIF IsDelegate(resultingType) THEN
  3834. ReleaseIntermediateOperand(result.tag);
  3835. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3836. UseIntermediateOperand(result.tag);
  3837. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3838. ReleaseIntermediateOperand(result.tag);
  3839. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3840. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3841. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3842. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3843. (* finalize target array descriptor *)
  3844. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3845. (* write lengths and increments of target array for remaining dimensions *)
  3846. i := indexListSize;
  3847. WHILE indexDim < targetArrayDimensionality DO
  3848. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3849. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3850. ReleaseOperand(sourceLength);
  3851. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3852. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3853. ReleaseOperand(sourceIncrement);
  3854. INC(i); INC(indexDim);
  3855. END;
  3856. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3857. tmp := nil;
  3858. ELSE
  3859. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3860. END;
  3861. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3862. ReleaseIntermediateOperand(tmp);
  3863. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3864. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3865. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3866. ELSE
  3867. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3868. END;
  3869. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3870. ReleaseIntermediateOperand(tmp);
  3871. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3872. (* write dimensionality *)
  3873. IF targetArrayDimensionality # 0 THEN
  3874. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3875. END;
  3876. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3877. END;
  3878. ReleaseOperand(array);
  3879. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3880. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3881. END;
  3882. END MathIndexDesignator;
  3883. (* get the length of an array , trying to make use of static information *)
  3884. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3885. VAR res: IntermediateCode.Operand; size: LONGINT;
  3886. BEGIN
  3887. type := type.resolved;
  3888. IF type IS SyntaxTree.ArrayType THEN
  3889. WITH type: SyntaxTree.ArrayType DO
  3890. IF type.form = SyntaxTree.Static THEN
  3891. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3892. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3893. Evaluate(type.length, op);
  3894. ReleaseIntermediateOperand(op.tag);
  3895. RETURN op.op;*)
  3896. ELSE
  3897. res := tag;
  3898. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3899. IntermediateCode.MakeMemory(res,addressType);
  3900. UseIntermediateOperand(res);
  3901. RETURN res
  3902. END
  3903. END;
  3904. ELSE
  3905. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3906. RETURN IntermediateCode.Immediate(addressType,size);
  3907. END;
  3908. END ArrayLength;
  3909. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  3910. BEGIN
  3911. IF IsImmediate(x) THEN
  3912. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  3913. ELSE
  3914. IF ~ReusableRegister(res) THEN
  3915. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3916. ELSE
  3917. UseIntermediateOperand(res);
  3918. END;
  3919. Emit(Mov(position,res,x))
  3920. END;
  3921. END CopyInt;
  3922. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3923. BEGIN
  3924. ReleaseIntermediateOperand(res);
  3925. IF IsImmediate(x) & IsImmediate(y) THEN
  3926. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3927. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3928. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3929. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3930. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3931. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3932. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3933. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3934. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3935. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3936. UseIntermediateOperand(res);
  3937. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3938. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3939. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3940. UseIntermediateOperand(res);
  3941. ELSE
  3942. IF ~ReusableRegister(res) THEN
  3943. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3944. ELSE
  3945. UseIntermediateOperand(res);
  3946. END;
  3947. IF IsImmediate(x) & (x.intValue = 0) THEN
  3948. Emit(Mov(position,res,y))
  3949. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3950. Emit(Mov(position,res,x))
  3951. ELSE
  3952. Emit(Add(position,res, x, y));
  3953. END;
  3954. END;
  3955. END AddInt;
  3956. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3957. BEGIN
  3958. ReleaseIntermediateOperand(res);
  3959. IF IsImmediate(x) & IsImmediate(y) THEN
  3960. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3961. ELSE
  3962. IF ~ReusableRegister(res) THEN
  3963. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3964. ELSE UseIntermediateOperand(res);
  3965. END;
  3966. IF IsImmediate(x) & (x.intValue = 1) THEN
  3967. Emit(Mov(position,res,y))
  3968. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3969. Emit(Mov(position,res,x))
  3970. ELSE
  3971. Emit(Mul(position,res, x, y));
  3972. END;
  3973. END;
  3974. END MulInt;
  3975. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3976. BEGIN
  3977. ReleaseIntermediateOperand(res);
  3978. IF IsImmediate(x) & IsImmediate(y) THEN
  3979. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3980. ELSE
  3981. IF ~ReusableRegister(res) THEN
  3982. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3983. ELSE UseIntermediateOperand(res);
  3984. END;
  3985. IF IsImmediate(x) & (x.intValue = 1) THEN
  3986. Emit(Mov(position,res,y))
  3987. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3988. Emit(Mov(position,res,x))
  3989. ELSE
  3990. Emit(Div(position,res, x, y));
  3991. END;
  3992. END;
  3993. END DivInt;
  3994. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3995. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3996. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3997. BEGIN
  3998. type := x.left.type.resolved;
  3999. IF type IS SyntaxTree.StringType THEN
  4000. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4001. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4002. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4003. type := atype;
  4004. x.left.SetType(type);
  4005. END;
  4006. IntermediateCode.InitImmediate(res,addressType,0);
  4007. maxDim := x.parameters.Length()-1;
  4008. (*
  4009. computation rule:
  4010. a: ARRAY X,Y,Z OF Element with size S
  4011. a[i,j,k] -->
  4012. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4013. *)
  4014. FOR i := 0 TO maxDim DO
  4015. e := x.parameters.GetExpression(i);
  4016. Evaluate(e,index);
  4017. Convert(index.op,addressType);
  4018. AddInt(res, res, index.op);
  4019. IF i = 0 THEN
  4020. (*
  4021. ReuseCopy(res, index.op);
  4022. *)
  4023. Designate(x.left,array);
  4024. type := x.left.type.resolved;
  4025. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4026. Dereference(array, type, FALSE);
  4027. END;
  4028. (*
  4029. ELSE AddInt(res, res, index.op);
  4030. *)
  4031. END;
  4032. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4033. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4034. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4035. BoundCheck(index.op, length);
  4036. END;
  4037. ReleaseIntermediateOperand(length);
  4038. END;
  4039. ReleaseOperand(index);
  4040. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4041. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4042. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4043. MulInt(res,res,length);
  4044. END;
  4045. ReleaseIntermediateOperand(length);
  4046. END;
  4047. (* remaining open dimensions -- compute address *)
  4048. i := maxDim+1;
  4049. IF type IS SyntaxTree.ArrayType THEN
  4050. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4051. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4052. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4053. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4054. MulInt(res,res,length);
  4055. END;
  4056. ReleaseIntermediateOperand(length);
  4057. INC(i);
  4058. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4059. END;
  4060. END;
  4061. IF (type IS SyntaxTree.ArrayType) THEN
  4062. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4063. size := StaticSize(system, type);
  4064. IF size # 1 THEN
  4065. length := IntermediateCode.Immediate(addressType,size);
  4066. MulInt(res,res,length);
  4067. END;
  4068. ELSE
  4069. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4070. IF size # 1 THEN
  4071. length := IntermediateCode.Immediate(addressType,size);
  4072. MulInt(res,res,length);
  4073. END;
  4074. END;
  4075. END;
  4076. AddInt(res,res,array.op);
  4077. InitOperand(result,ModeReference);
  4078. result.op := res;
  4079. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4080. ReleaseIntermediateOperand(result.tag);
  4081. result.tag := TypeDescriptorAdr(type);
  4082. IF ~newObjectFile THEN
  4083. IntermediateCode.MakeMemory(result.tag,addressType);
  4084. END
  4085. ELSIF IsDelegate(type) THEN
  4086. ReleaseIntermediateOperand(result.tag);
  4087. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4088. UseIntermediateOperand(result.tag);
  4089. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4090. ReleaseIntermediateOperand(result.tag);
  4091. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4092. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4093. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4094. END;
  4095. ReleaseOperand(array);
  4096. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4097. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4098. END;
  4099. END IndexDesignator;
  4100. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4101. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4102. BEGIN
  4103. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4104. dest := destination; destination := emptyOperand;
  4105. type := x.left.type.resolved;
  4106. IF type IS SyntaxTree.MathArrayType THEN
  4107. MathIndexDesignator(x);
  4108. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4109. IndexDesignator(x);
  4110. END;
  4111. destination := dest;
  4112. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4113. END VisitIndexDesignator;
  4114. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4115. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4116. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4117. procedure: SyntaxTree.Procedure;
  4118. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4119. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4120. BEGIN
  4121. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4122. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4123. parameters := expression.parameters;
  4124. moduleName := "FoxArrayBase";
  4125. procedureName := "CopyDescriptor";
  4126. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4127. SaveRegisters();ReleaseUsedRegisters(saved);
  4128. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4129. IF procedure = NIL THEN
  4130. s := "procedure ";
  4131. Strings.Append(s,moduleName);
  4132. Strings.Append(s,".");
  4133. Strings.Append(s,procedureName);
  4134. Strings.Append(s," not present");
  4135. Error(position,s);
  4136. ELSE
  4137. (* push address of temporary variable *)
  4138. Symbol(variable,destOperand);
  4139. Emit(Push(position,destOperand.op));
  4140. ReleaseOperand(destOperand);
  4141. (* push src *)
  4142. Evaluate(expression.left,srcOperand);
  4143. (*
  4144. Dereference(srcOperand,expression.type.resolved);
  4145. Emit(Push(position,srcOperand.tag));
  4146. *)
  4147. Emit(Push(position,srcOperand.op));
  4148. ReleaseOperand(srcOperand);
  4149. tensorFound := FALSE;
  4150. FOR i := 0 TO parameters.Length()-1 DO
  4151. e := parameters.GetExpression(i);
  4152. IF e IS SyntaxTree.TensorRangeExpression THEN
  4153. tensorFound := TRUE;
  4154. ELSIF e IS SyntaxTree.RangeExpression THEN
  4155. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4156. ELSE
  4157. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4158. END;
  4159. END;
  4160. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4161. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4162. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4163. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4164. StaticCallOperand(procOp,procedure);
  4165. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4166. ReleaseOperand(procOp);
  4167. END;
  4168. RestoreRegisters(saved);
  4169. END;
  4170. RETURN variable
  4171. END PrepareTensorDescriptor;
  4172. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4173. VAR
  4174. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4175. operand, tmpOperand, variableOp, variable2Op: Operand;
  4176. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4177. variable, variable2: SyntaxTree.Variable;
  4178. dim, i, size: LONGINT;
  4179. (* TODO: needed? *)
  4180. oldArrayDestinationTag: IntermediateCode.Operand;
  4181. oldArrayDestinationDimension: LONGINT;
  4182. position: Position;
  4183. saved: RegisterEntry;
  4184. arrayFlags: SET;
  4185. m, n: LONGINT;
  4186. PROCEDURE Pass(op: IntermediateCode.Operand);
  4187. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4188. BEGIN
  4189. IF numberRegister >= 0 THEN
  4190. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention,op.type,numberRegister));
  4191. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4192. Emit(Mov(position,parameterRegister, op));
  4193. ELSE
  4194. Emit(Push(position,op))
  4195. END
  4196. END Pass;
  4197. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4198. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4199. BEGIN
  4200. formalType := formalType.resolved; actualType := actualType.resolved;
  4201. IF IsOpenArray(formalType)THEN
  4202. IF actualType IS SyntaxTree.StringType THEN
  4203. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4204. RETURN;
  4205. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4206. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4207. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4208. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4209. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4210. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4211. ELSE
  4212. tmp := baseReg;
  4213. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4214. IntermediateCode.MakeMemory(tmp,addressType);
  4215. Pass((tmp));
  4216. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4217. END;
  4218. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4219. END;
  4220. END PushArrayLens;
  4221. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4222. BEGIN
  4223. CASE size OF
  4224. |2: INCL(flags,Size2Flag);
  4225. |3: INCL(flags,Size3Flag);
  4226. |4: INCL(flags,Size4Flag);
  4227. |5: INCL(flags,Size5Flag);
  4228. |6: INCL(flags,Size6Flag);
  4229. |7: INCL(flags,Size7Flag);
  4230. |8: INCL(flags,Size8Flag);
  4231. END;
  4232. END SetSmallArraySizeFlag;
  4233. BEGIN
  4234. IF Trace THEN TraceEnter("PushParameter") END;
  4235. position := expression.position;
  4236. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4237. type := expression.type.resolved;
  4238. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4239. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4240. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4241. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4242. );
  4243. (* TODO: needed? *)
  4244. oldArrayDestinationTag := arrayDestinationTag;
  4245. oldArrayDestinationDimension := arrayDestinationDimension;
  4246. IF IsArrayOfSystemByte(parameter.type) THEN
  4247. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4248. Designate(expression,operand);
  4249. ELSE
  4250. Evaluate(expression, tmpOperand);
  4251. (* array of system byte does not provide any pointers *)
  4252. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4253. Symbol(variable, operand);
  4254. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4255. Emit(Mov(position,tmp, tmpOperand.op));
  4256. ReleaseOperand(tmpOperand);
  4257. END;
  4258. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4259. ReleaseIntermediateOperand(operand.tag);
  4260. operand.tag := tmp;
  4261. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4262. Pass((operand.tag));
  4263. END;
  4264. Pass((operand.op));
  4265. ELSIF IsOpenArray(parameter.type) THEN
  4266. Designate(expression,operand);
  4267. baseReg := operand.tag;
  4268. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4269. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4270. END;
  4271. Pass((operand.op)); (* address of the array *)
  4272. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4273. (* case 1
  4274. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4275. *)
  4276. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4277. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4278. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4279. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4280. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4281. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4282. arrayDestinationTag := sp;
  4283. (* case 1b
  4284. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4285. *)
  4286. IF expression IS SyntaxTree.IndexDesignator THEN
  4287. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4288. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4289. arrayDestinationDimension := dim;
  4290. Designate(expression,operand);
  4291. (* case 1a
  4292. P(...,A,...) push: push array descriptor to stack
  4293. *)
  4294. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4295. Designate(expression,operand);
  4296. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4297. i := 0;
  4298. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4299. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4300. INC(i);
  4301. END;
  4302. type := expression.type.resolved;
  4303. WHILE (i<dim) DO (* remaining static dimensions *)
  4304. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4305. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4306. ReleaseOperand(tmpOperand);
  4307. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4308. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4309. ReleaseOperand(tmpOperand);
  4310. INC(i);
  4311. END;
  4312. dimOp := IntermediateCode.Immediate(addressType,dim);
  4313. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4314. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4315. (* case 1d
  4316. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4317. + case 1e
  4318. P(.. PT() ... );
  4319. *)
  4320. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4321. Designate(expression,operand);
  4322. Dereference(operand,type.resolved,FALSE);
  4323. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4324. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4325. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4326. (* case 1f
  4327. P(...,S,...) push: create array descriptor to S on stack
  4328. case 1g
  4329. P(... PS()...)
  4330. *)
  4331. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4332. Designate(expression,operand);
  4333. FOR i := 0 TO dim-1 DO
  4334. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4335. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4336. ReleaseOperand(tmpOperand);
  4337. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4338. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4339. ReleaseOperand(tmpOperand);
  4340. END;
  4341. (*******
  4342. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4343. *)
  4344. arrayFlags := {StaticFlag};
  4345. IF dim = 1 THEN
  4346. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4347. ReleaseOperand(tmpOperand);
  4348. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4349. m := LONGINT(tmpOperand.op.intValue);
  4350. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4351. ELSIF dim = 2 THEN
  4352. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4353. ReleaseOperand(tmpOperand);
  4354. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4355. m := LONGINT(tmpOperand.op.intValue);
  4356. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4357. ReleaseOperand(tmpOperand);
  4358. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4359. n := LONGINT(tmpOperand.op.intValue);
  4360. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4361. INCL(arrayFlags,SmallMatrixFlag);
  4362. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4363. END;
  4364. END;
  4365. (*******)
  4366. dimOp := IntermediateCode.Immediate(addressType,dim);
  4367. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4368. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4369. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4370. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4371. baseType := SemanticChecker.ArrayBase(type,dim);
  4372. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4373. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4374. ELSE HALT(100);
  4375. END;
  4376. (* case 2
  4377. procedure P([left args], var A: array [*,*] of Type, [right args])
  4378. *)
  4379. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4380. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4381. (* case 2b
  4382. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4383. push: push reference to pushed array descriptor
  4384. post: remove array descriptor.
  4385. *)
  4386. IF expression IS SyntaxTree.IndexDesignator THEN
  4387. descriptorType := GetMathArrayDescriptorType(dim);
  4388. (* range type : no allocation possible, should be untraced *)
  4389. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4390. Symbol(variable,variableOp);
  4391. arrayDestinationTag := variableOp.op;
  4392. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4393. arrayDestinationDimension := dim;
  4394. NeedDescriptor := TRUE;
  4395. Designate(expression,operand);
  4396. Pass((operand.tag));
  4397. NeedDescriptor := FALSE;
  4398. (* case 2a
  4399. P(...,A,...)
  4400. push: push reference to array descriptor on stack
  4401. *)
  4402. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4403. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4404. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4405. INC(i);
  4406. END;
  4407. IF i = dim THEN
  4408. Designate(expression,operand);
  4409. Pass((operand.tag));
  4410. ELSE (* open-static *)
  4411. type := expression.type.resolved;
  4412. descriptorType := GetMathArrayDescriptorType(dim);
  4413. (* static array , cannot be reallocated, untraced !*)
  4414. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4415. Symbol(variable,variableOp);
  4416. arrayDestinationTag := variableOp.op;
  4417. Designate(expression,operand);
  4418. FOR i := 0 TO dim-1 DO
  4419. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4420. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4421. ReleaseOperand(tmpOperand);
  4422. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4423. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4424. ReleaseOperand(tmpOperand);
  4425. END;
  4426. dimOp := IntermediateCode.Immediate(addressType,dim);
  4427. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4428. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4429. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4430. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4431. baseType := SemanticChecker.ArrayBase(type,dim);
  4432. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4433. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4434. Pass((arrayDestinationTag));
  4435. END;
  4436. (* case 2d
  4437. P(...,T,...) push: emit dimension check, push T
  4438. *)
  4439. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4440. Designate(expression,operand);
  4441. Dereference(operand,type.resolved,FALSE);
  4442. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4443. Pass((operand.tag));
  4444. (* case 2f
  4445. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4446. push: push reference to pushed array descriptor
  4447. post: remove array descriptor
  4448. *)
  4449. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4450. descriptorType := GetMathArrayDescriptorType(dim);
  4451. (* static array -- cannot be reallocatated, untraced *)
  4452. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4453. Symbol(variable,variableOp);
  4454. arrayDestinationTag := variableOp.op;
  4455. Designate(expression,operand);
  4456. FOR i := 0 TO dim-1 DO
  4457. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4458. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4459. ReleaseOperand(tmpOperand);
  4460. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4461. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4462. ReleaseOperand(tmpOperand);
  4463. END;
  4464. (*
  4465. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4466. *)
  4467. arrayFlags := {StaticFlag};
  4468. IF dim = 1 THEN
  4469. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4470. ReleaseOperand(tmpOperand);
  4471. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4472. m := LONGINT(tmpOperand.op.intValue);
  4473. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4474. ELSIF dim = 2 THEN
  4475. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4476. ReleaseOperand(tmpOperand);
  4477. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4478. m := LONGINT(tmpOperand.op.intValue);
  4479. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4480. ReleaseOperand(tmpOperand);
  4481. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4482. n := LONGINT(tmpOperand.op.intValue);
  4483. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4484. INCL(arrayFlags,SmallMatrixFlag);
  4485. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4486. END;
  4487. END;
  4488. (*******)
  4489. dimOp := IntermediateCode.Immediate(addressType,dim);
  4490. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4491. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4492. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4493. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4494. baseType := SemanticChecker.ArrayBase(type,dim);
  4495. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4496. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4497. Pass((arrayDestinationTag));
  4498. ELSE HALT(100);
  4499. END;
  4500. (* case 3
  4501. procedure P([left args], [const] A: array [?] of Type, [right args])
  4502. *)
  4503. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4504. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4505. (* case 3b
  4506. P(...,A[a..b,c..d],...)
  4507. *)
  4508. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4509. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4510. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4511. Symbol(variable,variableOp);
  4512. LoadValue(variableOp,system.addressType);
  4513. ELSE
  4514. descriptorType := GetMathArrayDescriptorType(dim);
  4515. (* range -- cannot be reallocated *)
  4516. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4517. Symbol(variable,variableOp);
  4518. END;
  4519. arrayDestinationTag := variableOp.op;
  4520. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4521. arrayDestinationDimension := 0;
  4522. Designate(expression,operand);
  4523. Pass((operand.tag));
  4524. (* case 3a
  4525. P(...,A,...)
  4526. *)
  4527. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4528. i := 0;
  4529. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4530. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4531. INC(i);
  4532. END;
  4533. IF i = dim THEN
  4534. Designate(expression,operand);
  4535. Pass((operand.tag));
  4536. ELSE (* open-static *)
  4537. type := expression.type.resolved;
  4538. descriptorType := GetMathArrayDescriptorType(dim);
  4539. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4540. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4541. Symbol(variable,variableOp);
  4542. arrayDestinationTag := variableOp.op;
  4543. Designate(expression,operand);
  4544. FOR i := 0 TO dim-1 DO
  4545. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4546. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4547. ReleaseOperand(tmpOperand);
  4548. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4549. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4550. ReleaseOperand(tmpOperand);
  4551. END;
  4552. dimOp := IntermediateCode.Immediate(addressType,dim);
  4553. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4554. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4555. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4556. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4557. baseType := SemanticChecker.ArrayBase(type,dim);
  4558. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4559. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4560. Pass((arrayDestinationTag));
  4561. END;
  4562. (* case 3d
  4563. P(...,T,...)
  4564. case 3e
  4565. P(...,PT(...),...)
  4566. *)
  4567. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4568. Designate(expression,operand);
  4569. Dereference(operand,type.resolved,FALSE);
  4570. Pass((operand.tag));
  4571. (* case 3f
  4572. P(...,S,...)
  4573. case 3g
  4574. P(...,PS(...),...)
  4575. *)
  4576. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4577. descriptorType := GetMathArrayDescriptorType(dim);
  4578. (* static array does not need to be traced *)
  4579. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4580. Symbol(variable,variableOp);
  4581. arrayDestinationTag := variableOp.op;
  4582. Designate(expression,operand);
  4583. IF operand.op.type.length >1 THEN (* vector register *)
  4584. (* static array does not need to be traced *)
  4585. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4586. Symbol(variable2, variable2Op);
  4587. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4588. Emit(Mov(position,tmp, operand.op));
  4589. ReleaseOperand(operand);
  4590. Symbol(variable2, operand);
  4591. END;
  4592. FOR i := 0 TO dim-1 DO
  4593. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4594. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4595. ReleaseOperand(tmpOperand);
  4596. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4597. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4598. ReleaseOperand(tmpOperand);
  4599. END;
  4600. dimOp := IntermediateCode.Immediate(addressType,dim);
  4601. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4602. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4603. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4604. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4605. baseType := SemanticChecker.ArrayBase(type,dim);
  4606. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4607. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4608. Pass((arrayDestinationTag));
  4609. ELSE HALT(100);
  4610. END;
  4611. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4612. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4613. (* case 4b
  4614. P(...,A[a..b,c..d],...)
  4615. *)
  4616. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4617. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4618. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4619. Symbol(variable,variableOp);
  4620. LoadValue(variableOp,system.addressType);
  4621. ELSE
  4622. descriptorType := GetMathArrayDescriptorType(dim);
  4623. (* range array -- cannot be allocated *)
  4624. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4625. Symbol(variable,variableOp);
  4626. END;
  4627. arrayDestinationTag := variableOp.op;
  4628. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4629. arrayDestinationDimension := 0;
  4630. Designate(expression,operand);
  4631. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4632. Symbol(variable,variableOp);
  4633. ELSE
  4634. (* alias to range -- untraced *)
  4635. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4636. Symbol(variable,variableOp);
  4637. MakeMemory(tmp,variableOp.op,addressType,0);
  4638. Emit(Mov(position,tmp,operand.tag));
  4639. ReleaseIntermediateOperand(tmp);
  4640. END;
  4641. Pass((variableOp.op));
  4642. ReleaseOperand(variableOp);
  4643. (* case 4a
  4644. P(...,A,...)
  4645. *)
  4646. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4647. i := 0;
  4648. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4649. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4650. INC(i);
  4651. END;
  4652. IF i = dim THEN
  4653. Designate(expression,operand);
  4654. arrayDestinationTag := operand.tag;
  4655. ELSE (* open-static *)
  4656. type := expression.type.resolved;
  4657. descriptorType := GetMathArrayDescriptorType(dim);
  4658. (* static array -- untraced *)
  4659. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4660. Symbol(variable,variableOp);
  4661. arrayDestinationTag := variableOp.op;
  4662. Designate(expression,operand);
  4663. FOR i := 0 TO dim-1 DO
  4664. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4665. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4666. ReleaseOperand(tmpOperand);
  4667. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4668. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4669. ReleaseOperand(tmpOperand);
  4670. END;
  4671. dimOp := IntermediateCode.Immediate(addressType,dim);
  4672. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4673. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4674. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4675. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4676. baseType := SemanticChecker.ArrayBase(type,dim);
  4677. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4678. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4679. END;
  4680. (* tensor alias to open array -- untraced *)
  4681. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4682. Symbol(variable,variableOp);
  4683. MakeMemory(tmp,variableOp.op,addressType,0);
  4684. Emit(Mov(position,tmp,arrayDestinationTag));
  4685. ReleaseIntermediateOperand(tmp);
  4686. Pass((variableOp.op));
  4687. ReleaseOperand(variableOp);
  4688. (* case 4d
  4689. P(...,T,...)
  4690. *)
  4691. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4692. Designate(expression,operand);
  4693. Pass((operand.op));
  4694. (* case 4f
  4695. P(...,S,...)
  4696. *)
  4697. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4698. descriptorType := GetMathArrayDescriptorType(dim);
  4699. (* static array -- cannot be reallocated, untraced *)
  4700. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4701. Symbol(variable,variableOp);
  4702. arrayDestinationTag := variableOp.op;
  4703. Designate(expression,operand);
  4704. FOR i := 0 TO dim-1 DO
  4705. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4706. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4707. ReleaseOperand(tmpOperand);
  4708. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4709. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4710. ReleaseOperand(tmpOperand);
  4711. END;
  4712. dimOp := IntermediateCode.Immediate(addressType,dim);
  4713. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4714. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4715. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4716. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4717. baseType := SemanticChecker.ArrayBase(type,dim);
  4718. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4719. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4720. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4721. Symbol(variable,variableOp);
  4722. MakeMemory(tmp,variableOp.op,addressType,0);
  4723. Emit(Mov(position,tmp,arrayDestinationTag));
  4724. ReleaseIntermediateOperand(tmp);
  4725. Pass((variableOp.op));
  4726. ReleaseOperand(variableOp);
  4727. ELSE HALT(100);
  4728. END;
  4729. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4730. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4731. Designate(expression,operand);
  4732. IF operand.op.type.length > 1 THEN
  4733. Emit(Push(position, operand.op));
  4734. ELSE
  4735. size := system.SizeOf(type);
  4736. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4737. size := ToMemoryUnits(system,size);
  4738. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4739. arrayDestinationTag := sp;
  4740. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4741. END;
  4742. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4743. Designate(expression,operand);
  4744. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4745. (* static array no pointer *)
  4746. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4747. Symbol(variable,variableOp);
  4748. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4749. Emit(Mov(position,tmp,operand.op));
  4750. Emit(Push(position,variableOp.op));
  4751. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4752. Pass((operand.op));
  4753. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4754. END;
  4755. ELSE HALT(200)
  4756. END;
  4757. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4758. IF parameter.kind = SyntaxTree.VarParameter THEN
  4759. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4760. Designate(expression, operand);
  4761. Pass((operand.op));
  4762. ELSE
  4763. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4764. Evaluate(expression, operand);
  4765. Pass((operand.extra)); (* step *)
  4766. Pass((operand.tag)); (* last *)
  4767. Pass((operand.op)) (* first *)
  4768. END
  4769. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4770. IF parameter.kind = SyntaxTree.VarParameter THEN
  4771. Designate(expression, operand);
  4772. Pass((operand.op));
  4773. ELSE
  4774. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4775. Evaluate(expression, operand);
  4776. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  4777. IF (numberRegister > 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  4778. Pass((operand.tag)); (* imaginary part *)
  4779. Pass((operand.op)) (* real part *)
  4780. ELSE
  4781. (* pass complex as a whole in order to comply with the variable alignment of its components *)
  4782. size := ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,parameter.type));
  4783. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4784. tmp := sp;
  4785. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4786. Emit(Mov(position,tmp,operand.op)); (* real part *)
  4787. size := ToMemoryUnits(system,system.AlignmentOf(system.variableAlignment,componentType));
  4788. IntermediateCode.AddOffset(tmp,size);
  4789. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  4790. END
  4791. END
  4792. ELSE
  4793. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4794. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4795. Designate(expression,operand);
  4796. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4797. (* stack allocation *)
  4798. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4799. (*! parameter alignment to be discussed ... *)
  4800. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4801. size := type(SyntaxTree.StringType).length;
  4802. END;
  4803. IF backend.cooperative & parameter.NeedsTrace() THEN
  4804. dst := NewRegisterOperand (addressType);
  4805. Emit(Mov(position,dst, sp));
  4806. IntermediateCode.InitImmediate(null, byteType, 0);
  4807. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4808. ReleaseIntermediateOperand(dst);
  4809. SaveRegisters();ReleaseUsedRegisters(saved);
  4810. (* register dst has been freed before SaveRegisters already *)
  4811. CallAssignMethod(dst, operand.op, parameter.type);
  4812. RestoreRegisters(saved);
  4813. END;
  4814. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4815. ELSIF IsOpenArray(parameter.type) THEN
  4816. Designate(expression,operand);
  4817. baseReg := operand.tag;
  4818. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4819. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4820. END;
  4821. Pass((operand.op)); (* address of the array *)
  4822. ELSIF IsDelegate(parameter.type) THEN
  4823. Evaluate(expression,operand);
  4824. IF backend.cooperative & parameter.NeedsTrace() THEN
  4825. Emit(Push(position, nil));
  4826. dst := NewRegisterOperand (addressType);
  4827. Emit(Mov(position,dst, sp));
  4828. ReleaseIntermediateOperand(dst);
  4829. SaveRegisters();ReleaseUsedRegisters(saved);
  4830. Emit(Push(position, dst));
  4831. (* register dst has been freed before SaveRegisters already *)
  4832. Emit(Push(position, operand.tag));
  4833. CallThis(position,"GarbageCollector","Assign",2);
  4834. RestoreRegisters(saved);
  4835. ELSE
  4836. Pass((operand.tag));
  4837. END;
  4838. Pass((operand.op));
  4839. ELSE
  4840. Evaluate(expression,operand);
  4841. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4842. Emit(Push(position, nil));
  4843. dst := NewRegisterOperand (addressType);
  4844. Emit(Mov(position,dst, sp));
  4845. ReleaseIntermediateOperand(dst);
  4846. SaveRegisters();ReleaseUsedRegisters(saved);
  4847. Emit(Push(position, dst));
  4848. (* register dst has been freed before SaveRegisters already *)
  4849. Emit(Push(position, operand.op));
  4850. CallThis(position,"GarbageCollector","Assign",2);
  4851. RestoreRegisters(saved);
  4852. ELSE
  4853. Pass((operand.op));
  4854. END;
  4855. END;
  4856. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4857. Evaluate(expression,operand);
  4858. Pass((operand.op));
  4859. ELSE (* var parameter *)
  4860. Designate(expression,operand);
  4861. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4862. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4863. Pass((operand.tag));
  4864. END;
  4865. END;
  4866. Pass((operand.op));
  4867. END;
  4868. END;
  4869. (* TODO: needed? *)
  4870. arrayDestinationTag := oldArrayDestinationTag;
  4871. arrayDestinationDimension := oldArrayDestinationDimension;
  4872. IF needsParameterBackup THEN
  4873. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4874. ReuseCopy(parameterBackup, operand.op)
  4875. END;
  4876. ReleaseOperand(operand);
  4877. IF Trace THEN TraceExit("PushParameter") END;
  4878. END PushParameter;
  4879. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  4880. VAR prevConditional: BOOLEAN;
  4881. BEGIN
  4882. prevConditional := conditional;
  4883. conditional := FALSE;
  4884. 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
  4885. Expression(x.result); (* use register *)
  4886. END;
  4887. Statement(x.statement);
  4888. conditional := prevConditional;
  4889. IF x.result # NIL THEN Expression(x.result) END;
  4890. 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
  4891. ReleaseIntermediateOperand(result.op);
  4892. END;
  4893. END VisitStatementDesignator;
  4894. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4895. VAR
  4896. procedure: SyntaxTree.Procedure;
  4897. procedureType: SyntaxTree.ProcedureType;
  4898. wasInline: BOOLEAN;
  4899. actualParameters: SyntaxTree.ExpressionList;
  4900. formalParameter: SyntaxTree.Parameter;
  4901. actualParameter: SyntaxTree.Expression;
  4902. i: LONGINT;
  4903. localVariable: SyntaxTree.Variable;
  4904. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4905. src, dest: Operand;
  4906. prevInlineExit : Label;
  4907. prevMapper: SymbolMapper;
  4908. tooComplex: BOOLEAN;
  4909. resultDesignator: SyntaxTree.Expression;
  4910. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4911. BEGIN
  4912. IF e = NIL THEN RETURN TRUE
  4913. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4914. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4915. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4916. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4917. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4918. ELSE RETURN FALSE
  4919. END;
  4920. END SimpleExpression;
  4921. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4922. BEGIN
  4923. RETURN checker.CanPassInRegister(type)
  4924. END FitsInRegister;
  4925. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4926. VAR
  4927. variable: SyntaxTree.Variable;
  4928. variableDesignator: SyntaxTree.Designator;
  4929. BEGIN
  4930. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  4931. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  4932. variableDesignator.SetType(type);
  4933. RETURN variableDesignator
  4934. END GetTemp;
  4935. BEGIN
  4936. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4937. wasInline := currentIsInline;
  4938. prevInlineExit := currentInlineExit;
  4939. prevMapper := currentMapper;
  4940. currentInlineExit := NewLabel();
  4941. tooComplex := FALSE;
  4942. NEW(currentMapper);
  4943. currentIsInline := TRUE;
  4944. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4945. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4946. formalParameter := procedureType.firstParameter;
  4947. actualParameters := x.parameters;
  4948. i := 0;
  4949. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4950. actualParameter := actualParameters.GetExpression(i);
  4951. IF actualParameter.resolved # NIL THEN
  4952. actualParameter := actualParameter.resolved
  4953. END;
  4954. (*
  4955. if expression is simple and can be passed immediately
  4956. or if type fits in register then we can proceed
  4957. otherwise we escape to ordinary procedure call.
  4958. *)
  4959. (* cases where the expression can be mapped identically *)
  4960. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4961. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  4962. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4963. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4964. (*
  4965. Assign(variableDesignator, actualParameter);
  4966. *)
  4967. Evaluate(actualParameter, src);
  4968. Designate(variableDesignator, dest);
  4969. Emit(Mov(x.position, dest.op, src.op));
  4970. ReleaseOperand(dest);
  4971. ReleaseOperand(src);
  4972. (* the src operand should now have been completely released ! *)
  4973. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  4974. ELSE tooComplex := TRUE
  4975. END;
  4976. (*
  4977. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4978. currentMapper.Add(formalParameter, actualParameter, NIL);
  4979. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4980. variableDesignator := GetTemp(system.addressType, FALSE);
  4981. Designate(actualParameter, src);
  4982. Designate(variableDesignator, dest);
  4983. IntermediateCode.MakeMemory(dest.op,addressType);
  4984. Emit(Mov(x.position, dest.op, src.op));
  4985. ReleaseOperand(dest);
  4986. IF src.tag.mode # IntermediateCode.Undefined THEN
  4987. tagDesignator := GetTemp(system.addressType, FALSE);
  4988. Designate(tagDesignator, dest);
  4989. IntermediateCode.MakeMemory(dest.op,addressType);
  4990. Emit(Mov(x.position, dest.op, src.op));
  4991. END;
  4992. ReleaseOperand(dest); ReleaseOperand(src);
  4993. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4994. END;
  4995. *)
  4996. formalParameter := formalParameter.nextParameter;
  4997. INC(i);
  4998. END;
  4999. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5000. IF resultDesignator # NIL THEN
  5001. returnDesignator := resultDesignator
  5002. ELSE
  5003. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5004. END;
  5005. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5006. END;
  5007. localVariable := procedure.procedureScope.firstVariable;
  5008. WHILE ~tooComplex & (localVariable # NIL) DO
  5009. variableDesignator := GetTemp(localVariable.type, FALSE);
  5010. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5011. localVariable := localVariable.nextVariable;
  5012. END;
  5013. IF ~tooComplex THEN
  5014. VisitStatementBlock(procedure.procedureScope.body);
  5015. SetLabel(currentInlineExit);
  5016. IF procedureType.returnType # NIL THEN
  5017. Designate(returnDesignator, result);
  5018. IF conditional THEN
  5019. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  5020. ValueToCondition(result)
  5021. END;
  5022. END;
  5023. END;
  5024. currentMapper := prevMapper;
  5025. currentInlineExit := prevInlineExit;
  5026. currentIsInline := wasInline;
  5027. RETURN ~tooComplex
  5028. END InlineProcedureCall;
  5029. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5030. VAR
  5031. parameters: SyntaxTree.ExpressionList;
  5032. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5033. designator: SyntaxTree.Designator;
  5034. procedureType: SyntaxTree.ProcedureType;
  5035. formalParameter: SyntaxTree.Parameter;
  5036. operand, returnValue: Operand;
  5037. reg, size, mask, dest: IntermediateCode.Operand;
  5038. saved,saved2: RegisterEntry;
  5039. symbol: SyntaxTree.Symbol;
  5040. variable: SyntaxTree.Variable;
  5041. i, parametersSize, returnTypeSize : LONGINT;
  5042. structuredReturnType: BOOLEAN;
  5043. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5044. tempVariableDesignator: SyntaxTree.Designator;
  5045. gap, alignment: LONGINT; (*fld*)
  5046. (* TODO: remove unnecessary backup variables *)
  5047. oldResult: Operand;
  5048. oldCurrentScope: SyntaxTree.Scope;
  5049. oldArrayDestinationTag: IntermediateCode.Operand;
  5050. oldArrayDestinationDimension: LONGINT;
  5051. oldConstantDeclaration: SyntaxTree.Symbol;
  5052. oldDestination: IntermediateCode.Operand;
  5053. oldCurrentLoop: Label;
  5054. oldConditional: BOOLEAN;
  5055. oldTrueLabel, oldFalseLabel: Label;
  5056. oldLocked: BOOLEAN;
  5057. usedRegisters,oldUsedRegisters: RegisterEntry;
  5058. return: IntermediateCode.Operand;
  5059. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5060. arg: IntermediateCode.Operand;
  5061. dummy: IntermediateCode.Operand;
  5062. recordType: SyntaxTree.RecordType;
  5063. operatorSelectionProcedureOperand: Operand;
  5064. operatorSelectionProcedure: SyntaxTree.Procedure;
  5065. fingerPrint: SyntaxTree.FingerPrint;
  5066. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5067. identifierNumber: LONGINT;
  5068. parameterRegisters: SIZE;
  5069. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5070. procedure: SyntaxTree.Procedure;
  5071. PROCEDURE BackupGlobalState;
  5072. BEGIN
  5073. oldResult := result;
  5074. oldCurrentScope := currentScope;
  5075. oldArrayDestinationTag := arrayDestinationTag;
  5076. oldArrayDestinationDimension := arrayDestinationDimension;
  5077. oldConstantDeclaration := constantDeclaration;
  5078. oldDestination := destination;
  5079. oldCurrentLoop := currentLoop;
  5080. oldConditional := conditional;
  5081. oldTrueLabel := trueLabel;
  5082. oldFalseLabel := falseLabel;
  5083. oldLocked := locked;
  5084. oldUsedRegisters := usedRegisters
  5085. END BackupGlobalState;
  5086. PROCEDURE RestoreGlobalState;
  5087. BEGIN
  5088. result := oldResult;
  5089. currentScope := oldCurrentScope;
  5090. arrayDestinationTag := oldArrayDestinationTag;
  5091. arrayDestinationDimension := oldArrayDestinationDimension;
  5092. constantDeclaration := oldConstantDeclaration;
  5093. destination := oldDestination;
  5094. currentLoop := oldCurrentLoop;
  5095. conditional := oldConditional;
  5096. trueLabel := oldTrueLabel;
  5097. falseLabel := oldFalseLabel;
  5098. locked := oldLocked;
  5099. usedRegisters := oldUsedRegisters
  5100. END RestoreGlobalState;
  5101. (** do preparations before parameter push for array-structured object types (ASOTs):
  5102. if ASOT is passed as VAR parameter:
  5103. - allocate temporary variable of math array type
  5104. - copy contents of ASOT to be passed to temporary variable
  5105. - use temporary variable as the actual parameter instead
  5106. - 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)
  5107. **)
  5108. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5109. VAR
  5110. expression: SyntaxTree.Expression;
  5111. BEGIN
  5112. IF actualParameter IS SyntaxTree.Designator THEN
  5113. designator := actualParameter(SyntaxTree.Designator);
  5114. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5115. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5116. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5117. ASSERT(checker # NIL);
  5118. checker.SetCurrentScope(currentScope);
  5119. (* allocate temporary variable *)
  5120. ASSERT(actualParameter.type # NIL);
  5121. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5122. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5123. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5124. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5125. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5126. ASSERT(tempVariableDesignator.type # NIL);
  5127. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5128. (* copy math array stored in actual parameter to temporary variable *)
  5129. BackupGlobalState;
  5130. AssignMathArray(tempVariableDesignator, actualParameter);
  5131. RestoreGlobalState;
  5132. (* use temporary variable as actual parameter instead of the original one *)
  5133. actualParameter := tempVariableDesignator;
  5134. (* create write-back call and store it in linked list *)
  5135. (* create new list entry *)
  5136. IF firstWriteBackCall = NIL THEN
  5137. NEW(firstWriteBackCall);
  5138. currentWriteBackCall := firstWriteBackCall
  5139. ELSE
  5140. ASSERT(currentWriteBackCall # NIL);
  5141. NEW(currentWriteBackCall.next);
  5142. currentWriteBackCall := currentWriteBackCall.next
  5143. END;
  5144. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5145. ASSERT(expression.type = NIL);
  5146. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5147. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5148. (* prepare writeback for any other "normal" indexer *)
  5149. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5150. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5151. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5152. Assign(tempVariableDesignator, actualParameter);
  5153. actualParameter := tempVariableDesignator;
  5154. IF firstWriteBackCall = NIL THEN
  5155. NEW(firstWriteBackCall);
  5156. currentWriteBackCall := firstWriteBackCall
  5157. ELSE
  5158. ASSERT(currentWriteBackCall # NIL);
  5159. NEW(currentWriteBackCall.next);
  5160. currentWriteBackCall := currentWriteBackCall.next
  5161. END;
  5162. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5163. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5164. END
  5165. END
  5166. END PrepareParameter;
  5167. BEGIN
  5168. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5169. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5170. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5171. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5172. IF InlineProcedureCall(x) THEN
  5173. RETURN
  5174. ELSE
  5175. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5176. END
  5177. END;
  5178. END;
  5179. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5180. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5181. dest := destination; destination := emptyOperand;
  5182. SaveRegisters();ReleaseUsedRegisters(saved);
  5183. parameters := x.parameters;
  5184. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5185. (* an operator is called *)
  5186. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5187. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  5188. (* check if a dynamic operator call should be performed *)
  5189. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5190. ELSE
  5191. isCallOfDynamicOperator := FALSE
  5192. END;
  5193. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5194. Emit(Push(position, ap));
  5195. END;
  5196. alignment := procedureType.stackAlignment;
  5197. IF SysvABIorWINAPI(procedureType.callingConvention) & (system.addressSize = 64) THEN
  5198. alignment := 16 (* bytes *);
  5199. END;
  5200. IF alignment > 1 THEN
  5201. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5202. Emit(Mov(position,reg, sp));
  5203. gap := ParametersSize(system, procedureType, FALSE);
  5204. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5205. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN
  5206. gap := 4*ToMemoryUnits(system,system.addressSize); (* at least four registers get pushed*)
  5207. END;
  5208. ELSIF (SysvABI(procedureType.callingConvention) ) & (system.addressSize =64) THEN
  5209. gap := gap - 6*ToMemoryUnits(system,system.addressSize);
  5210. IF gap < 0 THEN
  5211. gap := 0
  5212. ELSE
  5213. END;
  5214. gap := gap - ToMemoryUnits(system,system.offsetFirstParameter); (* alignment before the call *)
  5215. END;
  5216. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  5217. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5218. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5219. Emit(And(position,sp, sp, mask));
  5220. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5221. Emit(Push(position,reg));
  5222. (*
  5223. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  5224. Emit(Mov(position,mem,reg));
  5225. *)
  5226. ReleaseIntermediateOperand(reg);
  5227. END;
  5228. IF SysvABI(procedureType.callingConvention) & (system.addressSize = 32) THEN
  5229. (* align stack to 16-byte boundary *)
  5230. IntermediateCode.InitImmediate(mask,addressType,-16);
  5231. Emit(And(position,sp, sp, mask));
  5232. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5233. IF gap # 0 THEN
  5234. IntermediateCode.InitImmediate(size,addressType,gap);
  5235. Emit(Sub(position,sp,sp,size))
  5236. END;
  5237. END;
  5238. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5239. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5240. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5241. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5242. ELSE
  5243. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5244. END;
  5245. Evaluate(x.left, operand);
  5246. IF symbol IS SyntaxTree.Procedure THEN
  5247. IF (procedureType.selfParameter # NIL) THEN
  5248. Emit(Push(position,operand.tag));
  5249. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5250. Emit(Push(position,operand.tag));
  5251. ELSIF (procedureType.isDelegate) THEN
  5252. Emit(Push(position,operand.tag));
  5253. END;
  5254. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5255. IF (procedureType.selfParameter # NIL) THEN
  5256. Emit(Push(position,operand.tag));
  5257. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5258. Emit(Push(position,operand.tag));
  5259. END;
  5260. ELSE HALT(200);
  5261. END;
  5262. ReleaseIntermediateOperand(operand.tag);
  5263. operand.tag := emptyOperand;
  5264. (* determine if a structured return type is needed *)
  5265. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5266. IF structuredReturnType THEN
  5267. IF resultDesignator # NIL THEN
  5268. d := resultDesignator;
  5269. ELSE
  5270. (* temporary result that might be allocated, must potentially be traced *)
  5271. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5272. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5273. d.SetType(variable.type);
  5274. END;
  5275. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5276. Designate(d,returnValue);
  5277. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5278. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5279. Emit(Push(position,size));
  5280. Emit(Push(position,returnValue.op));
  5281. ReleaseOperand(returnValue);
  5282. ELSE*)
  5283. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5284. (*
  5285. END;
  5286. *)
  5287. END;
  5288. firstWriteBackCall := NIL; (* reset write-back call list *)
  5289. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5290. parameterRegisters := backend.NumberParameterRegisters(procedureType.callingConvention);
  5291. passByRegister := parameterRegisters > 0;
  5292. registerNumber := 0;
  5293. formalParameter := procedureType.lastParameter;
  5294. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5295. actualParameter := parameters.GetExpression(i);
  5296. PrepareParameter(actualParameter, formalParameter);
  5297. IF passByRegister & (i < parameterRegisters) THEN
  5298. IF ~PassInRegister(formalParameter) THEN
  5299. Error(actualParameter.position,"cannot be passed by register")
  5300. ELSE
  5301. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  5302. END;
  5303. INC(registerNumber);
  5304. ELSE
  5305. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5306. END;
  5307. formalParameter := formalParameter.prevParameter;
  5308. END;
  5309. IF passByRegister (* & (registerNumber > 0)*) & ~SysvABI(procedureType.callingConvention) THEN
  5310. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5311. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5312. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5313. END;
  5314. ELSE
  5315. hasDynamicOperands := FALSE;
  5316. formalParameter := procedureType.firstParameter;
  5317. FOR i := 0 TO parameters.Length() - 1 DO
  5318. actualParameter := parameters.GetExpression(i);
  5319. IF formalParameter # NIL THEN (* TENTATIVE *)
  5320. PrepareParameter(actualParameter, formalParameter);
  5321. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5322. ASSERT(i < 2);
  5323. hasDynamicOperands := TRUE;
  5324. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5325. ELSE
  5326. IF passByRegister & (registerNumber > 0) THEN
  5327. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5328. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5329. END;
  5330. passByRegister := FALSE;
  5331. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5332. END;
  5333. formalParameter := formalParameter.nextParameter;
  5334. END;
  5335. END;
  5336. END;
  5337. IF symbol IS SyntaxTree.Procedure THEN
  5338. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5339. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5340. Emit(Push(position,reg));
  5341. ReleaseIntermediateOperand(reg);
  5342. END;
  5343. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5344. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5345. parametersSize := ParametersSize(system,procedureType,FALSE);
  5346. END;
  5347. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5348. (*
  5349. dynamic operator overloading:
  5350. first push parameters, regularly:
  5351. [self]
  5352. par1
  5353. par2
  5354. then push parameters for GetOperator
  5355. identifier
  5356. ptr1
  5357. tag
  5358. ptr2
  5359. tag
  5360. call GetOperatorRuntimeProc
  5361. call Operator
  5362. *)
  5363. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5364. (* push ID *)
  5365. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5366. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5367. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5368. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5369. formalParameter := procedureType.firstParameter;
  5370. FOR i := 0 TO parameters.Length() - 1 DO
  5371. IF formalParameter.access # SyntaxTree.Hidden THEN
  5372. ASSERT(i < 2);
  5373. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5374. (* push pointer *)
  5375. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5376. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5377. (* add dereference *)
  5378. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5379. (*! better: do refer to stack above than using parameter backups !!*)
  5380. ReleaseIntermediateOperand(parameterBackups[i]);
  5381. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5382. END;
  5383. Emit(Push(position,parameterBackups[i]));
  5384. ReleaseIntermediateOperand(parameterBackups[i]);
  5385. (* push typetag *)
  5386. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5387. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5388. arg := TypeDescriptorAdr(recordType);
  5389. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5390. Emit(Push(position,arg));
  5391. ELSE
  5392. (* push 'NonPointer' *)
  5393. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5394. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5395. (* push fingerprint *)
  5396. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5397. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5398. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5399. END
  5400. END;
  5401. formalParameter := formalParameter.nextParameter
  5402. END;
  5403. (* for unary operators: complete the information for the second parameter *)
  5404. IF procedureType.numberParameters < 2 THEN
  5405. (* push 'NonPointer' *)
  5406. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5407. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5408. (* push 'NoType' *)
  5409. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5410. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5411. END;
  5412. (* call operator selection procedure *)
  5413. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5414. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5415. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5416. ReleaseOperand(operatorSelectionProcedureOperand);
  5417. (* use the address that the operator selection procedure returned as the target address of the call *)
  5418. InitOperand(operand, ModeValue);
  5419. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5420. Emit(Result(position,operand.op))
  5421. END
  5422. END;
  5423. ReleaseParameterRegisters();
  5424. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5425. SaveRegisters();ReleaseUsedRegisters(saved2);
  5426. CallThis(position,"Objects","LeaveA2",0);
  5427. RestoreRegisters(saved2);
  5428. END;
  5429. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR SysvABI(procedureType.callingConvention) THEN
  5430. Emit(Call(position,operand.op,0));
  5431. ELSE
  5432. Emit(Call(position,operand.op,parametersSize));
  5433. END;
  5434. ReleaseOperand(operand);
  5435. IF procedureType.noReturn THEN
  5436. EmitTrap(position,NoReturnTrap);
  5437. END;
  5438. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5439. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5440. Emit(Result(position,return));
  5441. END;
  5442. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5443. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5444. Emit(Push(position, return));
  5445. CallThis(position,"Objects","ReenterA2",0);
  5446. Emit(Pop(position, return));
  5447. ELSE
  5448. CallThis(position,"Objects","ReenterA2",0);
  5449. END;
  5450. END;
  5451. (* === return parameter space === *)
  5452. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5453. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5454. (* cleanup all space for all parameters *)
  5455. IF parametersSize < 32 THEN
  5456. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5457. parametersSize := 32
  5458. END;
  5459. size := IntermediateCode.Immediate(addressType,parametersSize);
  5460. Emit(Add(position,sp,sp,size))
  5461. END;
  5462. IF SysvABI(procedureType.callingConvention) THEN
  5463. IF passByRegister THEN
  5464. IF parameters.Length() > parameterRegisters THEN
  5465. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5466. ELSE
  5467. parametersSize := 0
  5468. END;
  5469. ELSE
  5470. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5471. INC( parametersSize, (-parametersSize) MOD 16 )
  5472. END;
  5473. IF parametersSize > 0 THEN
  5474. size := IntermediateCode.Immediate(addressType,parametersSize);
  5475. Emit(Add(position,sp,sp,size))
  5476. END;
  5477. END;
  5478. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5479. IF structuredReturnType THEN
  5480. (* stack pointer rewinding done by callee
  5481. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5482. Emit(Add(position,sp,sp,size));
  5483. *)
  5484. RestoreRegisters(saved);
  5485. InitOperand(result,ModeReference);
  5486. Symbol(variable,result);
  5487. ELSE
  5488. RestoreRegisters(saved);
  5489. InitOperand(result,ModeValue);
  5490. result.op := return;
  5491. END;
  5492. END;
  5493. IF alignment > 1 THEN
  5494. Emit(Pop(position,sp));
  5495. END;
  5496. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5497. Emit(Pop(position, ap));
  5498. END;
  5499. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5500. ValueToCondition(result);
  5501. END;
  5502. destination := dest;
  5503. (* perform all write-back calls in the list *)
  5504. BackupGlobalState;
  5505. currentWriteBackCall := firstWriteBackCall;
  5506. WHILE currentWriteBackCall # NIL DO
  5507. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5508. currentWriteBackCall := currentWriteBackCall.next
  5509. END;
  5510. RestoreGlobalState;
  5511. (* TENATIVE *)
  5512. (*
  5513. IF isOperatorCall THEN
  5514. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5515. END;
  5516. *)
  5517. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5518. END VisitProcedureCallDesignator;
  5519. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5520. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5521. td: SyntaxTree.Symbol;
  5522. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5523. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5524. BEGIN
  5525. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5526. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5527. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5528. variable.SetType(system.anyType);
  5529. scope.AddVariable(variable);
  5530. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5531. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5532. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5533. typeDeclaration.SetScope(module.module.moduleScope);
  5534. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5535. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5536. END;
  5537. RETURN hiddenPointerType;
  5538. END GetHiddenPointerType;
  5539. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5540. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5541. BEGIN
  5542. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5543. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5544. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5545. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5546. scope.AddVariable(variable);
  5547. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5548. variable.SetType(system.anyType);
  5549. scope.AddVariable(variable);
  5550. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5551. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5552. typeDeclaration.SetDeclaredType(delegatePointerType);
  5553. typeDeclaration.SetScope(module.module.moduleScope);
  5554. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5555. delegatePointerType.SetState(SyntaxTree.Resolved);
  5556. END;
  5557. RETURN delegatePointerType
  5558. END GetDelegateType;
  5559. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5560. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5561. such as in VAR a: RECORD ... END;
  5562. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5563. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5564. *)
  5565. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5566. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5567. BEGIN (* no code emission *)
  5568. source := NIL;
  5569. x := x.resolved;
  5570. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5571. x := GetHiddenPointerType();
  5572. ELSIF IsDelegate(x) THEN
  5573. x := GetDelegateType();
  5574. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5575. ELSE HALT(200);
  5576. END;
  5577. td := x.typeDeclaration;
  5578. IF td = NIL THEN
  5579. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5580. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5581. ASSERT(td # NIL);
  5582. END;
  5583. IF newObjectFile THEN
  5584. GetCodeSectionNameForSymbol(td,name);
  5585. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5586. meta.CheckTypeDeclaration(x);
  5587. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5588. ELSE
  5589. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5590. END;
  5591. IF backend.cooperative OR meta.simple THEN
  5592. offset := 0;
  5593. ELSE
  5594. IF x IS SyntaxTree.CellType THEN
  5595. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5596. IF baseRecord = NIL THEN
  5597. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5598. ELSE
  5599. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5600. END;
  5601. ELSE
  5602. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5603. END;
  5604. END;
  5605. ELSE
  5606. offset := 0;
  5607. source := module.allSections.FindBySymbol(td); (*TODO*)
  5608. IF source = NIL THEN
  5609. null := 0;
  5610. GetCodeSectionNameForSymbol(td,name);
  5611. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5612. Basic.SuffixSegmentedName (name, module.module.name);
  5613. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5614. IntermediateCode.InitImmediate(op,addressType,0);
  5615. source(IntermediateCode.Section).Emit(Data(position,op));
  5616. source.SetReferenced(FALSE)
  5617. ELSE
  5618. name := source.name;
  5619. END;
  5620. END;
  5621. RETURN td
  5622. END GetBackendType;
  5623. BEGIN
  5624. (*td := t.typeDeclaration;*)
  5625. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5626. (*
  5627. IF t IS SyntaxTree.PointerType THEN
  5628. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5629. ELSE
  5630. source := GetBackendType(t);
  5631. END;
  5632. *)
  5633. IF newObjectFile THEN
  5634. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5635. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5636. IntermediateCode.SetOffset(res,offset);
  5637. ELSE
  5638. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5639. END;
  5640. (*
  5641. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5642. make memory should be used when tag is used, not earlier
  5643. *)
  5644. RETURN res
  5645. END TypeDescriptorAdr;
  5646. (*
  5647. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5648. VAR result: IntermediateCode.Operand;
  5649. BEGIN
  5650. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5651. operand.tag := TypeDescriptorAdr(operand.type);
  5652. IntermediateCode.MakeMemory(operand.tag,addressType);
  5653. UseIntermediateOperand(operand.tag);
  5654. END;
  5655. END MakeTypeTag;
  5656. *)
  5657. PROCEDURE ProfilerInit;
  5658. VAR reg: IntermediateCode.Operand;
  5659. BEGIN
  5660. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5661. Emit(Call(position,reg,0));
  5662. END ProfilerInit;
  5663. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5664. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5665. BEGIN
  5666. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5667. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5668. THEN
  5669. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5670. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5671. Emit(Push(position,reg));
  5672. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5673. Emit(Push(position,reg));
  5674. StaticCallOperand(result,procedure);
  5675. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5676. ReleaseOperand(result);
  5677. END;
  5678. END ProfilerEnterExit;
  5679. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5680. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5681. BEGIN
  5682. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5683. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5684. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5685. profileInit.Emit(Push(position,reg));
  5686. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5687. profileInit.Emit(Push(position,reg));
  5688. NEW(string, LEN(name)); COPY(name, string^);
  5689. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5690. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5691. sv.SetType(type);
  5692. Designate(sv,result);
  5693. profileInit.Emit(Push(position,result.tag));
  5694. profileInit.Emit(Push(position,result.op));
  5695. StaticCallOperand(result,procedure);
  5696. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5697. ReleaseOperand(result);
  5698. END;
  5699. END ProfilerAddProcedure;
  5700. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5701. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5702. BEGIN
  5703. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5704. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5705. profileInit.Emit(Push(position,reg));
  5706. profileInitPatchPosition := profileInit.pc;
  5707. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5708. NEW(string, LEN(name)); COPY(name, string^);
  5709. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5710. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5711. sv.SetType(type);
  5712. Designate(sv,result);
  5713. profileInit.Emit(Push(position,result.tag));
  5714. profileInit.Emit(Push(position,result.op));
  5715. StaticCallOperand(result,procedure);
  5716. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5717. ReleaseOperand(result);
  5718. END;
  5719. END ProfilerAddModule;
  5720. PROCEDURE ProfilerPatchInit;
  5721. VAR reg: IntermediateCode.Operand;
  5722. BEGIN
  5723. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5724. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5725. EmitLeave(profileInit,position,NIL,0);
  5726. profileInit.Emit(Exit(position,0,0,0));
  5727. END ProfilerPatchInit;
  5728. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5729. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5730. VAR
  5731. id: LONGINT;
  5732. leftType, rightType: SyntaxTree.Type;
  5733. procedureType: SyntaxTree.ProcedureType;
  5734. runtimeProcedure: SyntaxTree.Procedure;
  5735. runtimeProcedureOperand, operatorOperand: Operand;
  5736. kind: SET;
  5737. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5738. VAR
  5739. arg: IntermediateCode.Operand;
  5740. recordType: SyntaxTree.RecordType;
  5741. fingerPrint: SyntaxTree.FingerPrint;
  5742. BEGIN
  5743. IF type = NIL THEN
  5744. (* no type: push 'NoType' *)
  5745. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5746. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5747. ELSIF IsStrictlyPointerToRecord(type) THEN
  5748. (* pointer to record type: push typetag *)
  5749. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5750. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5751. arg := TypeDescriptorAdr(recordType);
  5752. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5753. ELSE
  5754. (* non-pointer to record type: push fingerprint *)
  5755. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5756. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5757. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5758. END;
  5759. operatorInitializationCodeSection.Emit(Push(position,arg))
  5760. END PushTypeInfo;
  5761. BEGIN
  5762. ASSERT(operatorInitializationCodeSection # NIL);
  5763. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5764. procedureType := operator.type(SyntaxTree.ProcedureType);
  5765. (* determine types *)
  5766. leftType := procedureType.firstParameter.type;
  5767. IF procedureType.numberParameters = 2 THEN
  5768. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5769. rightType := procedureType.firstParameter.nextParameter.type;
  5770. ELSE
  5771. rightType := NIL
  5772. END;
  5773. (* determine operator kind *)
  5774. IF IsStrictlyPointerToRecord(leftType) THEN
  5775. kind := {LhsIsPointer}
  5776. ELSE
  5777. kind := {}
  5778. END;
  5779. IF IsStrictlyPointerToRecord(rightType) THEN
  5780. kind := kind + {RhsIsPointer}
  5781. END;
  5782. IF kind # {} THEN (* TODO: to be removed later on *)
  5783. (* at least one of the types is a pointer to record *)
  5784. (* emit a code that registers this specific operator in the runtime *)
  5785. dump := operatorInitializationCodeSection.comments;
  5786. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5787. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5788. (* push ID *)
  5789. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5790. id := Global.GetSymbol(module.module.case, operator.name);
  5791. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5792. (* push kind *)
  5793. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5794. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5795. (* push type infos *)
  5796. PushTypeInfo(leftType);
  5797. PushTypeInfo(rightType);
  5798. (* push operator address *)
  5799. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5800. StaticCallOperand(operatorOperand, operator);
  5801. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5802. ReleaseOperand(operatorOperand);
  5803. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5804. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5805. ReleaseOperand(runtimeProcedureOperand)
  5806. END
  5807. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5808. END
  5809. END RegisterDynamicOperator;
  5810. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5811. VAR
  5812. traceModule: SyntaxTree.Module;
  5813. procedure: SyntaxTree.Procedure;
  5814. procedureVariable: SyntaxTree.Variable;
  5815. s,msg: Basic.MessageString;
  5816. res: Operand;
  5817. i: LONGINT;
  5818. sv: SyntaxTree.StringValue;
  5819. type: SyntaxTree.Type;
  5820. recordType: SyntaxTree.RecordType;
  5821. printout: Printout.Printer;
  5822. stringWriter: Streams.StringWriter;
  5823. expression: SyntaxTree.Expression;
  5824. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5825. BEGIN
  5826. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5827. IF procedure = NIL THEN
  5828. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5829. END;
  5830. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5831. s := "procedure ";
  5832. Strings.Append(s,backend.traceModuleName);
  5833. Strings.Append(s,".");
  5834. Strings.Append(s,procedureName);
  5835. Strings.Append(s," not present");
  5836. Error(position,s);
  5837. RETURN FALSE
  5838. ELSE
  5839. RETURN TRUE
  5840. END;
  5841. END GetProcedure;
  5842. PROCEDURE CallProcedure;
  5843. VAR size: LONGINT;
  5844. BEGIN
  5845. IF procedure # NIL THEN
  5846. StaticCallOperand(result,procedure);
  5847. size := ProcedureParametersSize(system,procedure);
  5848. ELSE
  5849. Symbol(procedureVariable, result);
  5850. LoadValue(result, procedureVariable.type.resolved);
  5851. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5852. END;
  5853. Emit(Call(position,result.op,size));
  5854. END CallProcedure;
  5855. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5856. VAR res: Operand; string: SyntaxTree.String;
  5857. BEGIN
  5858. IF GetProcedure("String") THEN
  5859. NEW(string, LEN(s)); COPY(s, string^);
  5860. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5861. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5862. sv.SetType(type);
  5863. Designate(sv,res);
  5864. Emit(Push(position,res.tag));
  5865. Emit(Push(position,res.op));
  5866. ReleaseOperand(res);
  5867. CallProcedure;
  5868. END;
  5869. END String;
  5870. PROCEDURE Integer(op: IntermediateCode.Operand);
  5871. BEGIN
  5872. IF GetProcedure("Int") THEN
  5873. Emit(Push(position,op));
  5874. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5875. CallProcedure;
  5876. END;
  5877. END Integer;
  5878. PROCEDURE Float(op: IntermediateCode.Operand);
  5879. BEGIN
  5880. IF GetProcedure("HIntHex") THEN
  5881. Emit(Push(position,op));
  5882. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5883. CallProcedure;
  5884. END;
  5885. END Float;
  5886. PROCEDURE Set(op: IntermediateCode.Operand);
  5887. BEGIN
  5888. IF GetProcedure("Set") THEN
  5889. Emit(Push(position,op));
  5890. (*
  5891. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5892. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5893. *)
  5894. CallProcedure;
  5895. END;
  5896. END Set;
  5897. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5898. BEGIN
  5899. IF GetProcedure("Boolean") THEN
  5900. Emit(Push(position,op));
  5901. CallProcedure;
  5902. END;
  5903. END Boolean;
  5904. PROCEDURE Char(op: IntermediateCode.Operand);
  5905. BEGIN
  5906. IF GetProcedure("Char") THEN
  5907. Emit(Push(position,op));
  5908. CallProcedure;
  5909. END;
  5910. END Char;
  5911. PROCEDURE Address(op: IntermediateCode.Operand);
  5912. BEGIN
  5913. IF GetProcedure("Address") THEN
  5914. Emit(Push(position,op));
  5915. CallProcedure;
  5916. END;
  5917. END Address;
  5918. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  5919. VAR len: IntermediateCode.Operand;
  5920. BEGIN
  5921. IF GetProcedure("String") THEN
  5922. len := GetArrayLength(type, op.tag);
  5923. Emit(Push(position,len));
  5924. ReleaseIntermediateOperand(len);
  5925. Emit(Push(position,op.op));
  5926. CallProcedure;
  5927. END;
  5928. END StringOperand;
  5929. PROCEDURE Ln;
  5930. BEGIN
  5931. IF GetProcedure("Ln") THEN
  5932. CallProcedure;
  5933. END;
  5934. END Ln;
  5935. BEGIN
  5936. IF backend.traceModuleName = "" THEN RETURN END;
  5937. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5938. IF GetProcedure("Enter") THEN
  5939. CallProcedure
  5940. END;
  5941. NEW(stringWriter,LEN(s));
  5942. FOR i := 0 TO x.Length()-1 DO
  5943. msg := "";
  5944. expression := x.GetExpression(i);
  5945. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5946. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5947. ELSE
  5948. Global.GetModuleName(module.module, s);
  5949. END;
  5950. IF i = 0 THEN
  5951. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  5952. stringWriter.String(":");
  5953. END;
  5954. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5955. IF ~(expression IS SyntaxTree.StringValue) THEN
  5956. printout.Expression(expression);
  5957. stringWriter.Get(s);
  5958. Strings.Append(msg,s);
  5959. Strings.Append(msg,"= ");
  5960. ELSE stringWriter.Get(s); (* remove from string writer *)
  5961. Strings.Append(msg, s);
  5962. END;
  5963. String(msg);
  5964. IF SemanticChecker.IsStringType(expression.type) THEN
  5965. Designate(expression,res);
  5966. StringOperand(res, expression.type);
  5967. ELSE
  5968. Evaluate(expression,res);
  5969. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5970. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5971. Convert(res.op,int64);
  5972. END;
  5973. Integer(res.op);
  5974. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5975. Boolean(res.op);
  5976. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5977. Set(res.op);
  5978. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5979. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5980. Convert(res.op,float64);
  5981. END;
  5982. Float(res.op);
  5983. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5984. Char(res.op);
  5985. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5986. Address(res.op);String("H");
  5987. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5988. Address(res.op);String("H");
  5989. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5990. Address(res.op);String("H");
  5991. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5992. Address(res.op);String("H");
  5993. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5994. String("NIL");
  5995. ELSE HALT(200);
  5996. END;
  5997. END;
  5998. ReleaseOperand(res);
  5999. String("; ");
  6000. END;
  6001. IF GetProcedure("Exit") THEN
  6002. CallProcedure
  6003. ELSE
  6004. Ln;
  6005. END;
  6006. END;
  6007. END SystemTrace;
  6008. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6009. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6010. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6011. BEGIN
  6012. type := type.resolved;
  6013. IF type IS SyntaxTree.RecordType THEN
  6014. WITH type: SyntaxTree.RecordType DO
  6015. baseType := type.baseType;
  6016. IF baseType # NIL THEN
  6017. baseType := baseType.resolved;
  6018. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6019. InitFields(baseType,adr,offset);
  6020. END;
  6021. variable := type.recordScope.firstVariable;
  6022. WHILE variable # NIL DO
  6023. IF variable.initializer # NIL THEN
  6024. Evaluate(variable.initializer,initializerOp);
  6025. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6026. Emit(Mov(position,mem,initializerOp.op));
  6027. ReleaseOperand(initializerOp);
  6028. ReleaseIntermediateOperand(mem);
  6029. END;
  6030. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6031. variable := variable.nextVariable
  6032. END;
  6033. END;
  6034. ELSIF type IS SyntaxTree.CellType THEN
  6035. WITH type: SyntaxTree.CellType DO
  6036. baseType := type.baseType;
  6037. IF baseType # NIL THEN
  6038. baseType := baseType.resolved;
  6039. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6040. InitFields(baseType,adr,offset);
  6041. END;
  6042. variable := type.cellScope.firstVariable;
  6043. WHILE variable # NIL DO
  6044. IF variable.initializer # NIL THEN
  6045. Evaluate(variable.initializer,initializerOp);
  6046. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6047. Emit(Mov(position,mem,initializerOp.op));
  6048. ReleaseOperand(initializerOp);
  6049. ReleaseIntermediateOperand(mem);
  6050. END;
  6051. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6052. variable := variable.nextVariable
  6053. END;
  6054. END;
  6055. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6056. WITH type: SyntaxTree.ArrayType DO
  6057. IF type.form = SyntaxTree.Static THEN
  6058. baseType := type.arrayBase;
  6059. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6060. FOR i := 0 TO type.staticLength-1 DO
  6061. InitFields(baseType,adr,offset+i*size);
  6062. END;
  6063. END;
  6064. END;
  6065. ELSIF type IS SyntaxTree.MathArrayType THEN
  6066. WITH type: SyntaxTree.MathArrayType DO
  6067. IF type.form = SyntaxTree.Open THEN
  6068. dim := DynamicDim(type);
  6069. imm := IntermediateCode.Immediate(addressType,dim);
  6070. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6071. baseType := SemanticChecker.ArrayBase(type,dim);
  6072. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6073. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6074. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6075. ReleaseIntermediateOperand(imm);
  6076. (* flags remain empty (=0) for open array *)
  6077. ELSIF type.form = SyntaxTree.Static THEN
  6078. baseType := type.arrayBase;
  6079. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6080. ASSERT(type.staticLength < 1024*1024*1024);
  6081. FOR i := 0 TO type.staticLength-1 DO
  6082. InitFields(baseType,adr,offset+i*size);
  6083. END;
  6084. END;
  6085. END;
  6086. END;
  6087. END InitFields;
  6088. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6089. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6090. BEGIN
  6091. type := variable.type.resolved;
  6092. IF (type IS SyntaxTree.MathArrayType) THEN
  6093. WITH type: SyntaxTree.MathArrayType DO
  6094. IF type.form = SyntaxTree.Open THEN
  6095. Symbol(variable,operand);
  6096. InitFields(type, operand.tag,0);
  6097. IF temporary THEN
  6098. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6099. END;
  6100. ELSIF type.form = SyntaxTree.Tensor THEN
  6101. Symbol(variable, operand);
  6102. MakeMemory(tmp,operand.op,addressType,0);
  6103. ReleaseOperand(operand);
  6104. IF temporary THEN
  6105. (* trick -- temporary object from array base *)
  6106. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6107. Symbol(symbol,operand);
  6108. MakeMemory(mem,operand.op,addressType,0);
  6109. ReleaseOperand(operand);
  6110. Emit(Mov(position,tmp, mem) );
  6111. ReleaseOperand(operand);
  6112. ELSE
  6113. Emit(Mov(position,tmp, nil ) );
  6114. END;
  6115. ReleaseIntermediateOperand(tmp);
  6116. END;
  6117. END;
  6118. ELSE
  6119. Symbol(variable,operand);
  6120. IF variable.initializer # NIL THEN
  6121. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6122. reference.SetType(variable.type.resolved);
  6123. reference.SetAssignable(TRUE);
  6124. Assign(reference,variable.initializer);
  6125. ELSIF temporary THEN
  6126. IF SemanticChecker.IsPointerType(variable.type) THEN
  6127. Symbol(variable, operand);
  6128. MakeMemory(tmp,operand.op,addressType,0);
  6129. ReleaseOperand(operand);
  6130. Emit(Mov(position,tmp, nil ) );
  6131. ReleaseIntermediateOperand(tmp);
  6132. END;
  6133. END;
  6134. InitFields(type, operand.op,0);
  6135. ReleaseOperand(operand);
  6136. END;
  6137. END InitVariable;
  6138. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6139. VAR end: Label;
  6140. BEGIN
  6141. IF type.form = SyntaxTree.Tensor THEN
  6142. InitOperand(result,ModeValue);
  6143. ReuseCopy(result.op,base);
  6144. end := NewLabel();
  6145. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6146. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6147. SetLabel(end);
  6148. Convert(result.op,lenType);
  6149. ELSE
  6150. InitOperand(result,ModeValue);
  6151. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6152. END
  6153. END MathArrayDim;
  6154. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6155. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6156. BEGIN
  6157. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6158. MakeMemory(mem,base,addressType,offset);
  6159. Emit(Mov(position,mem,value));
  6160. ReleaseIntermediateOperand(mem);
  6161. END PutMathArrayField;
  6162. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6163. VAR mem: IntermediateCode.Operand;
  6164. BEGIN
  6165. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6166. MakeMemory(mem,base,addressType,offset);
  6167. Emit(Mov(position,mem,value));
  6168. ReleaseIntermediateOperand(mem);
  6169. END PutMathArrayFieldOffset;
  6170. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6171. BEGIN
  6172. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6173. MakeMemory(value,base,addressType,offset);
  6174. END GetMathArrayField;
  6175. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6176. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6177. BEGIN
  6178. IF incr THEN
  6179. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6180. ELSE
  6181. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6182. END;
  6183. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6184. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6185. ELSE
  6186. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6187. Emit(Mov(position,reg,dim));
  6188. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6189. Emit(Add(position,reg,reg,base));
  6190. MakeMemory(mem, reg, addressType, offset);
  6191. ReleaseIntermediateOperand(reg);
  6192. Emit(Mov(position,mem,value));
  6193. ReleaseIntermediateOperand(mem);
  6194. END;
  6195. END PutMathArrayLenOrIncr;
  6196. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6197. BEGIN
  6198. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6199. END PutMathArrayLength;
  6200. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6201. BEGIN
  6202. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6203. END PutMathArrayIncrement;
  6204. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6205. BEGIN
  6206. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6207. END GetMathArrayIncrement;
  6208. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6209. BEGIN
  6210. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6211. END GetMathArrayLength;
  6212. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6213. VAR dimOp: IntermediateCode.Operand;
  6214. BEGIN
  6215. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6216. GetMathArrayLength(type, operand, dimOp, check, result);
  6217. END GetMathArrayLengthAt;
  6218. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6219. VAR dimOp: IntermediateCode.Operand;
  6220. BEGIN
  6221. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6222. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6223. END GetMathArrayIncrementAt;
  6224. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6225. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6226. offset: LONGINT;
  6227. BEGIN
  6228. IF increment THEN
  6229. offset := MathIncrOffset;
  6230. ELSE
  6231. offset := MathLenOffset;
  6232. END;
  6233. INC(offset,operand.dimOffset*2);
  6234. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6235. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6236. END;
  6237. (* static dimension *)
  6238. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6239. IF check & (type.form = SyntaxTree.Tensor) THEN
  6240. DimensionCheck(operand.tag,dim,BrltL);
  6241. END;
  6242. val := SHORT(dim.intValue);
  6243. IF type.form # SyntaxTree.Tensor THEN
  6244. t := SemanticChecker.ArrayBase(type,val);
  6245. type := t.resolved(SyntaxTree.MathArrayType);
  6246. IF type.form = SyntaxTree.Static THEN
  6247. IF increment THEN
  6248. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6249. ELSE
  6250. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6251. END;
  6252. InitOperand(result,ModeValue);
  6253. result.op := res;
  6254. RETURN;
  6255. END;
  6256. END;
  6257. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6258. MakeMemory(res,operand.tag,addressType,offset);
  6259. (*
  6260. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6261. *)
  6262. InitOperand(result,ModeValue);
  6263. result.op := res;
  6264. ELSE
  6265. Convert(dim,addressType);
  6266. IF check THEN
  6267. IF type.form = SyntaxTree.Tensor THEN
  6268. DimensionCheck(operand.tag,dim,BrltL);
  6269. ELSIF isUnchecked THEN (* do nothing *)
  6270. ELSE
  6271. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6272. END;
  6273. END;
  6274. end := NewLabel(); next := NIL;
  6275. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6276. Emit(Mov(position,res,dim));
  6277. Convert(res,sizeType);
  6278. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6279. WHILE t IS SyntaxTree.MathArrayType DO
  6280. type := t(SyntaxTree.MathArrayType);
  6281. IF type.form = SyntaxTree.Static THEN
  6282. imm := IntermediateCode.Immediate(sizeType,val);
  6283. next := NewLabel();
  6284. BrneL(next,imm,res);
  6285. IF increment THEN
  6286. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6287. ELSE
  6288. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6289. END;
  6290. Emit(MovReplace(position,res,imm));
  6291. BrL(end);
  6292. ELSE hasDynamicPart := TRUE;
  6293. END;
  6294. t := type.arrayBase.resolved;
  6295. val := val + 1;
  6296. IF next # NIL THEN SetLabel(next) END;
  6297. END;
  6298. IF hasDynamicPart THEN
  6299. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6300. Emit(Mov(position,res2,dim));
  6301. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6302. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6303. Emit(Add(position,res2,res2,imm));
  6304. Emit(Add(position,res2,res2,operand.tag));
  6305. IntermediateCode.MakeMemory(res2,sizeType);
  6306. Emit(MovReplace(position,res,res2));
  6307. ReleaseIntermediateOperand(res2);
  6308. END;
  6309. SetLabel(end);
  6310. Convert(res,sizeType);
  6311. InitOperand(result,ModeValue);
  6312. result.op := res;
  6313. END;
  6314. END MathArrayLenOrIncr;
  6315. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6316. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6317. offset: LONGINT;
  6318. BEGIN
  6319. offset := operand.dimOffset+DynamicDim(type)-1;
  6320. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6321. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6322. val := SHORT(dim.intValue);
  6323. t := SemanticChecker.ArrayBase(type,val);
  6324. type := t.resolved(SyntaxTree.ArrayType);
  6325. IF type.form = SyntaxTree.Static THEN
  6326. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6327. ELSE
  6328. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6329. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6330. END;
  6331. UseIntermediateOperand(res);
  6332. InitOperand(result,ModeValue);
  6333. result.op := res;
  6334. ELSE
  6335. Convert(dim,addressType);
  6336. IF ~isUnchecked THEN
  6337. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6338. END;
  6339. end := NewLabel(); next := NIL;
  6340. (* ReuseCopy(dim,res); *)
  6341. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6342. Emit(Mov(position,res,dim));
  6343. Convert(res,sizeType);
  6344. Convert(res,sizeType);
  6345. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6346. WHILE t IS SyntaxTree.ArrayType DO
  6347. type := t(SyntaxTree.ArrayType);
  6348. IF type.form = SyntaxTree.Static THEN
  6349. imm := IntermediateCode.Immediate(sizeType,val);
  6350. next := NewLabel();
  6351. BrneL(next,imm,res);
  6352. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6353. Emit(MovReplace(position,res,imm));
  6354. BrL(end);
  6355. ELSE hasDynamicPart := TRUE;
  6356. END;
  6357. t := type.arrayBase.resolved;
  6358. val := val + 1;
  6359. IF next # NIL THEN SetLabel(next) END;
  6360. END;
  6361. IF hasDynamicPart THEN
  6362. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6363. Convert(res2,addressType);
  6364. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6365. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6366. Emit(Sub(position,res2,imm,res2));
  6367. Emit(Add(position,res2,res2,operand.tag));
  6368. IntermediateCode.MakeMemory(res2,sizeType);
  6369. Emit(MovReplace(position,res,res2));
  6370. ReleaseIntermediateOperand(res2);
  6371. END;
  6372. SetLabel(end);
  6373. Convert(res,sizeType);
  6374. InitOperand(result,ModeValue);
  6375. result.op := res;
  6376. END;
  6377. END ArrayLen;
  6378. (**
  6379. create a temporary variable in current scope
  6380. **)
  6381. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6382. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6383. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6384. BEGIN
  6385. IF ~register THEN
  6386. v := temporaries.GetFreeVariable(type, untraced, index);
  6387. ELSE
  6388. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6389. END;
  6390. scope := currentScope;
  6391. (*
  6392. variable := NIL; (* disable free variable managemenet for the time being -- does not work *)
  6393. *)
  6394. name := temporaries.GetUID();
  6395. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6396. variable.SetType(type);
  6397. variable.SetAccess(SyntaxTree.Hidden);
  6398. variable.SetUntraced(untraced);
  6399. IF v = NIL THEN
  6400. temporaries.AddVariable(variable);
  6401. IF ~register THEN
  6402. IF scope.lastVariable # NIL THEN
  6403. offset := scope.lastVariable.offsetInBits;
  6404. ELSE
  6405. offset := 0;
  6406. END;
  6407. DEC(offset,system.SizeOf(variable.type));
  6408. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6409. variable(SyntaxTree.Variable).SetOffset(offset);
  6410. scope.AddVariable(variable(SyntaxTree.Variable));
  6411. scope.EnterSymbol(variable, duplicate);
  6412. ASSERT(~duplicate);
  6413. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6414. ELSE
  6415. variable.SetUseRegister(TRUE);
  6416. variable(SyntaxTree.Variable).SetOffset(0);
  6417. END;
  6418. ELSE (* v # NIL *)
  6419. (* reuse slot for new variable, do not create new slot ! *)
  6420. temporaries.SetVariable(index, variable);
  6421. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6422. ASSERT(~register);
  6423. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6424. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6425. scope.EnterSymbol(variable, duplicate);
  6426. ASSERT(~duplicate);
  6427. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6428. END;
  6429. RETURN variable(SyntaxTree.Variable)
  6430. END GetTemporaryVariable;
  6431. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6432. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6433. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6434. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6435. i: LONGINT; duplicate: BOOLEAN;
  6436. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6437. VAR variable: SyntaxTree.Variable;
  6438. BEGIN
  6439. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6440. variable.SetType(type);
  6441. recordScope.AddVariable(variable);
  6442. END AddVariable;
  6443. BEGIN
  6444. name := "@ArrayDescriptor";
  6445. Basic.AppendNumber(name,dimensions);
  6446. identifier := SyntaxTree.NewIdentifier(name);
  6447. parentScope := module.module.moduleScope;
  6448. symbol := parentScope.FindSymbol(identifier);
  6449. IF symbol # NIL THEN
  6450. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6451. type := typeDeclaration.declaredType;
  6452. ELSE
  6453. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6454. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6455. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6456. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6457. recordType.SetTypeDeclaration(typeDeclaration);
  6458. recordType.SetState(SyntaxTree.Resolved);
  6459. typeDeclaration.SetDeclaredType(recordType);
  6460. AddVariable("@ptr",system.anyType);
  6461. AddVariable("@adr",system.addressType);
  6462. AddVariable("@flags",system.addressType);
  6463. AddVariable("@dim",system.addressType);
  6464. AddVariable("@elementSize",system.addressType);
  6465. FOR i := 0 TO dimensions-1 DO
  6466. name := "@len";
  6467. Basic.AppendNumber(name,i);
  6468. AddVariable(name,system.addressType);
  6469. name := "@incr";
  6470. Basic.AppendNumber(name,i);
  6471. AddVariable(name,system.addressType);
  6472. END;
  6473. parentScope.AddTypeDeclaration(typeDeclaration);
  6474. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6475. ASSERT(~duplicate);
  6476. type := recordType;
  6477. END;
  6478. RETURN type
  6479. END GetMathArrayDescriptorType;
  6480. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6481. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6482. BEGIN
  6483. type := GetMathArrayDescriptorType(dimensions);
  6484. Emit(Push(position,op.op));
  6485. (* push type descriptor *)
  6486. reg := TypeDescriptorAdr(type);
  6487. IF ~newObjectFile THEN
  6488. IntermediateCode.MakeMemory(reg,addressType);
  6489. END;
  6490. Emit(Push(position,reg));
  6491. ReleaseIntermediateOperand(reg);
  6492. (* push realtime flag: false by default *)
  6493. Emit(Push(position,false));
  6494. CallThis(position,"Heaps","NewRec",3);
  6495. END NewMathArrayDescriptor;
  6496. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6497. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6498. BEGIN
  6499. NEW(string, LEN(s)); COPY(s, string^);
  6500. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6501. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6502. sv.SetType(type);
  6503. Designate(sv,res);
  6504. Emit(Push(position,res.tag));
  6505. Emit(Push(position,res.op));
  6506. ReleaseOperand(res);
  6507. END PushConstString;
  6508. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6509. BEGIN
  6510. IF b THEN
  6511. Emit(Push(Basic.invalidPosition, true));
  6512. ELSE
  6513. Emit(Push(Basic.invalidPosition, false));
  6514. END;
  6515. END PushConstBoolean;
  6516. PROCEDURE PushConstSet(v: SET);
  6517. VAR value: SyntaxTree.Value; op: Operand;
  6518. BEGIN
  6519. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6520. value.SetType(system.setType);
  6521. Evaluate(value, op);
  6522. Emit(Push(Basic.invalidPosition, op.op));
  6523. ReleaseOperand(op);
  6524. END PushConstSet;
  6525. PROCEDURE PushConstInteger(v: LONGINT);
  6526. VAR value: SyntaxTree.Value; op: Operand;
  6527. BEGIN
  6528. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6529. value.SetType(system.longintType);
  6530. Evaluate(value, op);
  6531. Emit(Push(Basic.invalidPosition, op.op));
  6532. ReleaseOperand(op);
  6533. END PushConstInteger;
  6534. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6535. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6536. section: IntermediateCode.Section;
  6537. BEGIN
  6538. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6539. Global.GetSymbolSegmentedName(symbol, name);
  6540. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6541. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6542. procedure.SetScope(moduleScope);
  6543. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6544. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6545. procedure.SetAccess(SyntaxTree.Hidden);
  6546. currentScope := procedureScope;
  6547. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6548. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6549. RETURN section;
  6550. END OpenInitializer;
  6551. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6552. BEGIN
  6553. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6554. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6555. section := prev;
  6556. END CloseInitializer;
  6557. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6558. VAR name: SyntaxTree.IdentifierString;
  6559. variable: SyntaxTree.Variable;
  6560. parameter: SyntaxTree.Parameter;
  6561. type: SyntaxTree.Type;
  6562. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6563. BEGIN
  6564. InitOperand(op,ModeReference);
  6565. op.op := fp;
  6566. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6567. Dereference(op, x, FALSE);
  6568. result := op;
  6569. Symbol(symbol, op);
  6570. END Field;
  6571. PROCEDURE Direction(direction: LONGINT): SET;
  6572. BEGIN
  6573. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6574. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6575. ELSE HALT(100);
  6576. END;
  6577. END Direction;
  6578. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6579. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6580. BEGIN
  6581. Field(port, op);
  6582. ToMemory(op.op,addressType,0);
  6583. Emit(Push(Basic.invalidPosition, op.op));
  6584. ReleaseOperand(op);
  6585. Basic.GetString(modifier.identifier, name);
  6586. PushConstString(name);
  6587. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6588. ASSERT(SemanticChecker.IsStringType(value.type));
  6589. Designate(value, op);
  6590. Emit(Push(modifier.position, op.tag));
  6591. Emit(Push(modifier.position, op.op));
  6592. ReleaseOperand(op);
  6593. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6594. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6595. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6596. Evaluate(value, op);
  6597. Emit(Push(modifier.position, op.op));
  6598. ReleaseOperand(op);
  6599. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6600. ELSE
  6601. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6602. END;
  6603. END AddPortProperty;
  6604. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6605. VAR modifier: SyntaxTree.Modifier;
  6606. BEGIN
  6607. modifier := parameter.modifiers;
  6608. WHILE modifier # NIL DO
  6609. AddPortProperty(parameter,modifier, modifier.expression);
  6610. modifier := modifier.nextModifier;
  6611. END;
  6612. END AddPortProperties;
  6613. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6614. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6615. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6616. PROCEDURE PushLens(type: SyntaxTree.Type);
  6617. BEGIN
  6618. IF IsSemiDynamicArray(type) THEN
  6619. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6620. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6621. Emit(Push(Basic.invalidPosition, op.op));
  6622. ReleaseOperand(op);
  6623. INC(dim);
  6624. ELSIF IsStaticArray(type) THEN
  6625. len := len * type(SyntaxTree.ArrayType).staticLength;
  6626. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6627. INC(dim);
  6628. ELSE
  6629. baseType := type;
  6630. END;
  6631. END PushLens;
  6632. BEGIN
  6633. (* cell *)
  6634. IF parameter.type IS SyntaxTree.ArrayType THEN
  6635. type := parameter.type;
  6636. dim := 0;
  6637. len := 1;
  6638. PushLens(type);
  6639. portType := baseType.resolved(SyntaxTree.PortType);
  6640. ELSE
  6641. portType := parameter.type(SyntaxTree.PortType);
  6642. END;
  6643. PushSelfPointer();
  6644. (* port / array of ports *)
  6645. IF IsStaticArray(type) THEN
  6646. PushConstInteger(len);
  6647. END;
  6648. Field(parameter, op);
  6649. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6650. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6651. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6652. Designate(d, op);*)
  6653. Emit(Push(Basic.invalidPosition, op.op));
  6654. ReleaseOperand(op);
  6655. (* name *)
  6656. PushConstString(name);
  6657. (* inout *)
  6658. PushConstSet(Direction(portType.direction));
  6659. (* width *)
  6660. PushConstInteger(portType.sizeInBits);
  6661. IF parameter.type IS SyntaxTree.PortType THEN
  6662. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6663. AddPortProperties(parameter);
  6664. ELSIF IsStaticArray(type)THEN
  6665. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6666. ELSIF IsSemiDynamicArray(type) THEN
  6667. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6668. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6669. Emit(Add(position,reg, sp, size));
  6670. (* dim *)
  6671. PushConstInteger(dim);
  6672. (* len array *)
  6673. Emit(Push(position, reg));
  6674. ReleaseIntermediateOperand(reg);
  6675. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6676. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6677. Emit(Add(position, sp,sp, size));
  6678. ELSE
  6679. HALT(100);
  6680. END;
  6681. END Parameter;
  6682. BEGIN
  6683. IF backend.cellsAreObjects THEN
  6684. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6685. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6686. END;
  6687. parameter := x.firstParameter;
  6688. WHILE (parameter # NIL) DO
  6689. type := parameter.type.resolved;
  6690. WHILE (type IS SyntaxTree.ArrayType) DO
  6691. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6692. END;
  6693. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6694. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6695. Parameter(name,parameter);
  6696. END;
  6697. parameter := parameter.nextParameter;
  6698. END;
  6699. ELSE HALT(200)
  6700. END;
  6701. END AddPorts;
  6702. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6703. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6704. BEGIN
  6705. Symbol(cell,op);
  6706. ToMemory(op.op,addressType,0);
  6707. Emit(Push(position,op.op));
  6708. ReleaseOperand(op);
  6709. property.GetName(name);
  6710. (* does not work when inheritance is used:
  6711. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6712. *)
  6713. PushConstString(name);
  6714. IF (value # NIL) THEN
  6715. ASSERT(
  6716. SemanticChecker.IsStringType(property.type)
  6717. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6718. OR (property.type.resolved IS SyntaxTree.FloatType)
  6719. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6720. OR (property.type.resolved IS SyntaxTree.SetType)
  6721. );
  6722. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6723. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6724. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6725. Designate(d, op);
  6726. IF SemanticChecker.IsStringType(property.type) THEN
  6727. Emit(Push(Basic.invalidPosition, op.tag))
  6728. END;
  6729. Emit(Push(Basic.invalidPosition, op.op));
  6730. ReleaseOperand(op);
  6731. END;
  6732. IF value = NIL THEN
  6733. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6734. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6735. ASSERT(SemanticChecker.IsStringType(value.type));
  6736. Designate(value, op);
  6737. PushString(op, value.type);
  6738. ReleaseOperand(op);
  6739. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6740. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6741. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6742. Evaluate(value, op);
  6743. Emit(Push(property.position, op.op));
  6744. ReleaseOperand(op);
  6745. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6746. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6747. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6748. Evaluate(value, op);
  6749. Emit(Push(property.position, op.op));
  6750. ReleaseOperand(op);
  6751. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6752. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6753. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6754. Evaluate(value, op);
  6755. Emit(Push(property.position, op.op));
  6756. ReleaseOperand(op);
  6757. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6758. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6759. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6760. Evaluate(value, op);
  6761. Emit(Push(property.position, op.op));
  6762. ReleaseOperand(op);
  6763. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6764. ELSE
  6765. HALT(200);
  6766. END;
  6767. END AddProperty;
  6768. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6769. VAR symbol: SyntaxTree.Symbol;
  6770. BEGIN
  6771. WHILE modifier # NIL DO
  6772. symbol := cellType.FindProperty(modifier.identifier);
  6773. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6774. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6775. modifier := modifier.nextModifier;
  6776. END;
  6777. END AddModifiers;
  6778. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6779. VAR last: SyntaxTree.Modifier;
  6780. BEGIN
  6781. IF to = NIL THEN
  6782. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6783. ELSE
  6784. last := to;
  6785. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6786. last := last.nextModifier;
  6787. END;
  6788. IF last.identifier # this.identifier THEN
  6789. ASSERT(last.nextModifier = NIL);
  6790. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6791. END;
  6792. END;
  6793. END AppendModifier;
  6794. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6795. BEGIN
  6796. WHILE this # NIL DO
  6797. AppendModifier(to, this);
  6798. this := this.nextModifier;
  6799. END;
  6800. END AppendModifiers;
  6801. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6802. VAR base: SyntaxTree.Type;
  6803. BEGIN
  6804. AppendModifiers(to, c.modifiers);
  6805. base := c.GetBaseValueType();
  6806. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6807. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6808. END;
  6809. END AppendCellTypeModifiers;
  6810. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6811. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6812. BEGIN
  6813. Basic.GetString(modifier.identifier, name);
  6814. PushConstString(name);
  6815. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6816. ASSERT(SemanticChecker.IsStringType(value.type));
  6817. Designate(value, op);
  6818. PushString(op, value.type);
  6819. ReleaseOperand(op);
  6820. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6821. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6822. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6823. Evaluate(value, op);
  6824. Emit(Push(modifier.position, op.op));
  6825. ReleaseOperand(op);
  6826. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6827. ELSE
  6828. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6829. END;
  6830. END AddPortProperty;
  6831. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6832. BEGIN
  6833. WHILE modifier # NIL DO
  6834. AddPortProperty(modifier, modifier.expression);
  6835. modifier := modifier.nextModifier;
  6836. END;
  6837. END AddPortProperties;
  6838. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6839. VAR op: Operand;
  6840. BEGIN
  6841. Evaluate(p, op);
  6842. Emit(Push(p.position, op.op));
  6843. ReleaseOperand(op);
  6844. IF p IS SyntaxTree.Designator THEN
  6845. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6846. END;
  6847. END PushPort;
  6848. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6849. VAR tmp: IntermediateCode.Operand;
  6850. BEGIN
  6851. actualType := actualType.resolved;
  6852. IF actualType IS SyntaxTree.StringType THEN
  6853. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6854. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6855. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6856. ELSE
  6857. tmp := op.tag;
  6858. IntermediateCode.MakeMemory(tmp,addressType);
  6859. Emit(Push(position,tmp));
  6860. END;
  6861. Emit(Push(position,op.op))
  6862. END PushString;
  6863. (* conservative check if x is potentially on the heap, excluding the module heap
  6864. required for generational garbage collector
  6865. *)
  6866. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6867. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6868. BEGIN
  6869. RETURN TRUE;
  6870. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6871. passed by reference.
  6872. pos := x.position.start;
  6873. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6874. x := x(SyntaxTree.Designator).left;
  6875. END;
  6876. RETURN x # NIL;
  6877. *)
  6878. END OnHeap;
  6879. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  6880. VAR
  6881. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6882. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6883. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6884. tmp:IntermediateCode.Operand;
  6885. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6886. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6887. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6888. dest: IntermediateCode.Operand;
  6889. staticLength: LONGINT; itype: IntermediateCode.Type;
  6890. convert,isTensor: BOOLEAN;
  6891. recordType: SyntaxTree.RecordType;
  6892. baseType: SyntaxTree.Type;
  6893. flags: SET;
  6894. left: SyntaxTree.Expression;
  6895. call: SyntaxTree.Designator;
  6896. procedure: SyntaxTree.Procedure;
  6897. temporaryVariable: SyntaxTree.Variable;
  6898. dummy: IntermediateCode.Operand;
  6899. customBuiltin: SyntaxTree.CustomBuiltin;
  6900. isVarPar: ARRAY 3 OF BOOLEAN;
  6901. callsection: Sections.Section;
  6902. segmentedName: Basic.SegmentedName;
  6903. needsTrace: BOOLEAN;
  6904. n: ARRAY 256 OF CHAR;
  6905. modifier: SyntaxTree.Modifier;
  6906. previous, init: IntermediateCode.Section;
  6907. prevScope: SyntaxTree.Scope;
  6908. firstPar: LONGINT;
  6909. saved: RegisterEntry;
  6910. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6911. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6912. priority: IntermediateCode.Operand;
  6913. op,callop: Operand;
  6914. BEGIN
  6915. IF type = NIL THEN RETURN END;
  6916. type := type.resolved;
  6917. IF type IS SyntaxTree.PointerType THEN
  6918. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6919. END;
  6920. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6921. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6922. recordScope := type(SyntaxTree.RecordType).recordScope;
  6923. IF recordScope.bodyProcedure # NIL THEN
  6924. procedure := recordScope.bodyProcedure;
  6925. body := procedure.procedureScope.body;
  6926. Emit(Push(position,self));
  6927. IF body.isActive THEN
  6928. StaticCallOperand(callop,procedure);
  6929. Emit(Push(position,callop.op));
  6930. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6931. Convert(priority,sizeType);
  6932. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6933. END;
  6934. Emit(Push(position,priority));
  6935. ReleaseIntermediateOperand(priority);
  6936. IF backend.cooperative THEN
  6937. Emit(Push(position,self));
  6938. CallThis(position,"Activities","Create",3)
  6939. ELSE
  6940. flags := 0;
  6941. IF body.isSafe THEN
  6942. flags := 1;
  6943. END;
  6944. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6945. Emit(Push(position,self));
  6946. CallThis(position,"Objects","CreateProcess",4)
  6947. END;
  6948. ELSE
  6949. Emit(Push(position,self));
  6950. StaticCallOperand(callop,procedure);
  6951. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6952. END;
  6953. Emit(Pop(position,self));
  6954. END;
  6955. END CallBodies;
  6956. PROCEDURE PushTD(type: SyntaxTree.Type);
  6957. VAR op: IntermediateCode.Operand;
  6958. BEGIN
  6959. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6960. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6961. ELSE
  6962. IF type.resolved IS SyntaxTree.PointerType THEN
  6963. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6964. END;
  6965. op := TypeDescriptorAdr(type.resolved);
  6966. IF ~newObjectFile THEN
  6967. IntermediateCode.MakeMemory(op,addressType);
  6968. END;
  6969. Emit(Push(position,op));
  6970. END
  6971. END PushTD;
  6972. BEGIN
  6973. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6974. dest := destination; destination := emptyOperand;
  6975. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6976. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6977. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6978. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6979. CASE x.id OF
  6980. (* ---- COPY ----- *)
  6981. |Global.Copy:
  6982. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6983. (* ---- EXCL, INCL----- *)
  6984. |Global.Excl,Global.Incl:
  6985. Evaluate(p0,s0);
  6986. Evaluate(p1,s1);
  6987. Convert(s1.op,IntermediateCode.GetType(system,t0));
  6988. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6989. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  6990. END;
  6991. ReuseCopy(res,s0.op);
  6992. ReleaseOperand(s0);
  6993. Reuse1(tmp,s1.op);
  6994. ReleaseOperand(s1);
  6995. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  6996. IF x.id = Global.Excl THEN
  6997. Emit(Not(position,tmp,tmp));
  6998. Emit(And(position,res,res,tmp));
  6999. ELSE
  7000. Emit(Or(position,res,res,tmp));
  7001. END;
  7002. ReleaseIntermediateOperand(tmp);
  7003. Designate(p0,s0);
  7004. ToMemory(s0.op,s1.op.type,0);
  7005. Emit(Mov(position,s0.op,res));
  7006. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7007. (* ---- DISPOSE ----- *)
  7008. |Global.Dispose:
  7009. Designate(p0,s0);
  7010. Emit(Push(position,s0.op));
  7011. ReleaseOperand(s0);
  7012. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  7013. (* ---- GETPROCEDURE ----- *)
  7014. |Global.GetProcedure:
  7015. Designate(p0,s0);
  7016. PushString(s0,p0.type);
  7017. Designate(p1,s1);
  7018. PushString(s1,p1.type);
  7019. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7020. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7021. ELSE PushTD(procedureType.firstParameter.type)
  7022. END;
  7023. PushTD(procedureType.returnType);
  7024. Designate(p2,s2);
  7025. Emit(Push(position,s2.op));
  7026. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7027. CallThis(position,"Modules","GetProcedure", 7);
  7028. (* ---- ASH, LSH, ROT ----- *)
  7029. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7030. Evaluate(p0,s0);
  7031. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7032. (* make unsigned arguments in order to produced a logical shift *)
  7033. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7034. convert:= TRUE;
  7035. itype := s0.op.type;
  7036. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7037. Convert(s0.op,itype);
  7038. ELSE
  7039. convert := FALSE;
  7040. END;
  7041. END;
  7042. Evaluate(p1,s1);
  7043. IF IsIntegerConstant(p1,hint) THEN
  7044. ReuseCopy(reg,s0.op);
  7045. IF hint > 0 THEN
  7046. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7047. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7048. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7049. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7050. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7051. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7052. END;
  7053. ELSIF hint < 0 THEN
  7054. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7055. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7056. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7057. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7058. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7059. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7060. END;
  7061. END;
  7062. ReleaseOperand(s0); ReleaseOperand(s1);
  7063. ELSE
  7064. exit := NewLabel();
  7065. end := NewLabel();
  7066. ReuseCopy(reg,s0.op);
  7067. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7068. Reuse1(tmp,s1.op);
  7069. Emit(Neg(position,tmp,s1.op));
  7070. Convert(tmp,s1.op.type);
  7071. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7072. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7073. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7074. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7075. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7076. END;
  7077. ReleaseIntermediateOperand(tmp);
  7078. BrL(end);
  7079. SetLabel(exit);
  7080. ReuseCopy(tmp,s1.op);
  7081. Convert(tmp,s1.op.type);
  7082. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7083. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7084. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7085. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7086. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7087. END;
  7088. ReleaseIntermediateOperand(tmp);
  7089. SetLabel(end);
  7090. ReleaseOperand(s0); ReleaseOperand(s1);
  7091. END;
  7092. InitOperand(result,ModeValue);
  7093. IF convert THEN
  7094. itype := reg.type;
  7095. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7096. Convert(reg,itype);
  7097. END;
  7098. result.op := reg;
  7099. (* ---- CAP ----- *)
  7100. |Global.Cap:
  7101. Evaluate(p0,result);
  7102. ReuseCopy(reg,result.op);
  7103. ReleaseIntermediateOperand(result.op);
  7104. ignore := NewLabel();
  7105. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7106. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7107. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7108. SetLabel(ignore);
  7109. result.op := reg;
  7110. (* ---- CHR ----- *)
  7111. |Global.Chr, Global.Chr32:
  7112. Evaluate(p0,result);
  7113. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7114. |Global.Entier, Global.EntierH:
  7115. Evaluate(p0,result);
  7116. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7117. (* ---- MIN and MAX ----- *)
  7118. |Global.Max,Global.Min:
  7119. Evaluate(p0,s0);
  7120. Evaluate(p1,s1);
  7121. Reuse2(res,s0.op,s1.op);
  7122. else := NewLabel();
  7123. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7124. ELSE BrltL(else,s1.op,s0.op) END;
  7125. Emit(Mov(position,res,s0.op));
  7126. ReleaseOperand(s0);
  7127. end := NewLabel();
  7128. BrL(end);
  7129. SetLabel(else);
  7130. Emit(MovReplace(position,res,s1.op));
  7131. SetLabel(end);
  7132. ReleaseOperand(s1);
  7133. InitOperand(result,ModeValue);
  7134. result.op := res;
  7135. (* ---- ODD ----- *)
  7136. |Global.Odd:
  7137. IF ~conditional THEN
  7138. ConditionToValue(x)
  7139. ELSE
  7140. Evaluate(p0,result);
  7141. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7142. Reuse1(res,result.op);
  7143. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7144. ReleaseIntermediateOperand(result.op);
  7145. result.op := res;
  7146. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7147. ReleaseOperand(result);
  7148. BrL(falseLabel);
  7149. END;
  7150. (* ---- ORD ----- *)
  7151. |Global.Ord, Global.Ord32:
  7152. Evaluate(p0,result);
  7153. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7154. (* ---- SHORT, LONG ----- *)
  7155. |Global.Short, Global.Long:
  7156. Evaluate(p0,result);
  7157. IF x.type IS SyntaxTree.ComplexType THEN
  7158. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7159. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7160. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7161. ELSE
  7162. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7163. END
  7164. (* ---- HALT, SYSTEM.HALT----- *)
  7165. |Global.Halt, Global.systemHalt:
  7166. val := p0.resolved(SyntaxTree.IntegerValue).value;
  7167. EmitTrap (position, val);
  7168. (* ---- ASSERT ----- *)
  7169. |Global.Assert:
  7170. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7171. trueL := NewLabel();
  7172. falseL := NewLabel();
  7173. Condition(p0,trueL,falseL);
  7174. IF p1 = NIL THEN val := AssertTrap
  7175. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  7176. END;
  7177. SetLabel(falseL);
  7178. EmitTrap(position,val);
  7179. SetLabel(trueL);
  7180. END;
  7181. (*
  7182. Emit(TrapC(result.op,val);
  7183. *)
  7184. (* ---- INC, DEC----- *)
  7185. |Global.Inc,Global.Dec:
  7186. Expression(p0); adr := result.op;
  7187. LoadValue(result,p0.type); l := result;
  7188. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7189. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7190. END;
  7191. IF x.id = Global.Inc THEN
  7192. Emit(Add(position,l.op,l.op,r.op));
  7193. ELSE
  7194. Emit(Sub(position,l.op,l.op,r.op));
  7195. END;
  7196. ReleaseOperand(l); ReleaseOperand(r);
  7197. (* ---- LEN ----- *)
  7198. |Global.Len: (* dynamic length, static length done by checker *)
  7199. Designate(p0,operand);
  7200. IF p1 = NIL THEN
  7201. InitOperand(l,ModeValue);
  7202. l.op := IntermediateCode.Immediate(sizeType,0);
  7203. ELSE
  7204. Evaluate(p1,l);
  7205. END;
  7206. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7207. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7208. Dereference(operand, p0.type.resolved, FALSE);
  7209. END;
  7210. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7211. ReleaseOperand(operand); ReleaseOperand(l);
  7212. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7213. ASSERT(p1 # NIL);
  7214. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7215. Dereference(operand,p0.type.resolved,FALSE);
  7216. END;
  7217. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7218. ReleaseOperand(operand); ReleaseOperand(l);
  7219. ELSE HALT(100);
  7220. END;
  7221. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7222. (* ---- FIRST ---- *)
  7223. |Global.First:
  7224. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7225. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7226. ELSE
  7227. Designate(p0, result)
  7228. END
  7229. (* ---- LAST ---- *)
  7230. |Global.Last:
  7231. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7232. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7233. ELSE
  7234. Designate(p0, result);
  7235. (* make sure result.op is a register *)
  7236. tmp := result.op;
  7237. ReuseCopy(result.op, result.op);
  7238. ReleaseIntermediateOperand(tmp);
  7239. (* add offset to result.op *)
  7240. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7241. END
  7242. (* ---- STEP ---- *)
  7243. |Global.Step:
  7244. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7245. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7246. ELSE
  7247. Designate(p0, result);
  7248. (* make sure result.op is a register *)
  7249. tmp := result.op;
  7250. ReuseCopy(result.op, result.op);
  7251. ReleaseIntermediateOperand(tmp);
  7252. (* add offset to result.op *)
  7253. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7254. END
  7255. (* ---- RE ---- *)
  7256. |Global.Re:
  7257. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7258. Designate(p0, result)
  7259. ELSE
  7260. Evaluate(p0, result)
  7261. END
  7262. (* ---- IM ---- *)
  7263. |Global.Im:
  7264. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7265. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7266. Designate(p0, result);
  7267. (* make sure result.op is a register *)
  7268. tmp := result.op;
  7269. ReuseCopy(result.op, result.op);
  7270. ReleaseIntermediateOperand(tmp);
  7271. (* add offset to result.op *)
  7272. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7273. (* ---- ABS ----- *)
  7274. |Global.Abs:
  7275. Evaluate(p0,operand);
  7276. type := p0.type.resolved;
  7277. InitOperand(result,ModeValue);
  7278. Reuse1a(result.op,operand.op,dest);
  7279. Emit(Abs(position,result.op,operand.op));
  7280. ReleaseOperand(operand);
  7281. (* ---- WAIT ----- *)
  7282. |Global.Wait:
  7283. Evaluate(p0,operand);
  7284. Emit(Push(position,operand.op));
  7285. ReleaseOperand(operand);
  7286. CallThis(position,"Activities","Wait", 1);
  7287. (* ---- NEW ----- *)
  7288. |Global.New:
  7289. (*! the following code is only correct for "standard" Oberon calling convention *)
  7290. IF x.type # NIL THEN
  7291. type := x.type.resolved;
  7292. firstPar := 0;
  7293. ELSE
  7294. type := p0.type.resolved;
  7295. firstPar := 1;
  7296. END;
  7297. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7298. THEN
  7299. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7300. IF backend.cooperative THEN
  7301. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7302. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7303. IF recordType.isObject THEN
  7304. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7305. IF recordType.IsActive() THEN
  7306. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7307. END;
  7308. IF recordType.IsProtected() THEN
  7309. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7310. END;
  7311. ELSE
  7312. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7313. END;
  7314. END;
  7315. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7316. CallThis(position,"Runtime","New", 1);
  7317. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7318. Emit(Result(position, pointer));
  7319. exit := NewLabel();
  7320. BreqL(exit,pointer,nil);
  7321. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7322. GetRecordTypeName (recordType,name);
  7323. IF ~recordType.isObject THEN
  7324. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7325. END;
  7326. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7327. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7328. IF recordType.isObject THEN
  7329. IF recordType.IsProtected() THEN
  7330. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7331. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7332. END;
  7333. IF recordType.IsActive() THEN
  7334. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7335. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7336. END;
  7337. END;
  7338. END;
  7339. (* initialize fields *)
  7340. IF type(SyntaxTree.PointerType).isPlain THEN
  7341. size := 0;
  7342. ELSIF recordType.isObject THEN
  7343. size := BaseObjectTypeSize;
  7344. ELSE
  7345. size := BaseRecordTypeSize;
  7346. END;
  7347. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7348. (* call initializer *)
  7349. constructor := GetConstructor(recordType);
  7350. IF constructor # NIL THEN
  7351. (*! should be unified with ProcedureCallDesignator *)
  7352. Emit(Push(position,pointer));
  7353. ReleaseIntermediateOperand(pointer);
  7354. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7355. FOR i := firstPar TO x.parameters.Length()-1 DO
  7356. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7357. formalParameter := formalParameter.nextParameter;
  7358. END;
  7359. (* static call of the constructor *)
  7360. GetCodeSectionNameForSymbol(constructor,name);
  7361. ASSERT(~constructor.isInline);
  7362. IF constructor.scope.ownerModule # module.module THEN
  7363. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7364. ELSE
  7365. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7366. END;
  7367. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7368. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7369. Emit(Pop(position,pointer));
  7370. END;
  7371. (* call bodies *)
  7372. CallBodies(pointer,type);
  7373. SetLabel(exit);
  7374. needsTrace := p0.NeedsTrace();
  7375. IF needsTrace THEN ModifyAssignments(true) END;
  7376. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7377. Emit(Push(position, pointer));
  7378. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7379. Emit(Pop(position, pointer));
  7380. END;
  7381. Designate(p0,l);
  7382. IF needsTrace THEN
  7383. CallAssignPointer(l.op, pointer);
  7384. ELSE
  7385. ToMemory(l.op,addressType,0);
  7386. Emit(Mov(position,l.op,pointer));
  7387. END;
  7388. ReleaseIntermediateOperand(pointer);
  7389. ReleaseOperand(l);
  7390. IF needsTrace THEN ModifyAssignments(false) END;
  7391. ELSE (* not cooperative backend *)
  7392. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7393. IF temporaryVariable # NIL THEN
  7394. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7395. ELSE
  7396. Designate(p0,l);
  7397. END;
  7398. (* l.op contains address of pointer to record *)
  7399. Emit(Push(position,l.op)); (* address for use after syscall *)
  7400. Emit(Push(position,l.op));
  7401. ReleaseOperand(l);
  7402. (* push type descriptor *)
  7403. reg := TypeDescriptorAdr(recordType);
  7404. IF ~newObjectFile THEN
  7405. IntermediateCode.MakeMemory(reg,addressType);
  7406. END;
  7407. Emit(Push(position,reg));
  7408. ReleaseIntermediateOperand(reg);
  7409. (* push realtime flag *)
  7410. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7411. ELSE Emit(Push(position,false));
  7412. END;
  7413. CallThis(position,"Heaps","NewRec", 3);
  7414. (* check allocation success, if not successful then do not call initializers and bodies *)
  7415. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7416. Emit(Pop(position,pointer));
  7417. MakeMemory(reg,pointer,addressType,0);
  7418. ReleaseIntermediateOperand(pointer);
  7419. pointer := reg;
  7420. exit := NewLabel();
  7421. BreqL(exit,pointer,nil);
  7422. Emit(Push(position,pointer));
  7423. (* initialize fields *)
  7424. InitFields(recordType, pointer,0);
  7425. (* call initializer *)
  7426. constructor := GetConstructor(recordType);
  7427. IF constructor # NIL THEN
  7428. (*! should be unified with ProcedureCallDesignator *)
  7429. Emit(Push(position,pointer));
  7430. ReleaseIntermediateOperand(pointer);
  7431. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7432. FOR i := firstPar TO x.parameters.Length()-1 DO
  7433. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7434. formalParameter := formalParameter.nextParameter;
  7435. END;
  7436. (* static call of the constructor *)
  7437. GetCodeSectionNameForSymbol(constructor,name);
  7438. ASSERT(~constructor.isInline);
  7439. IF constructor.scope.ownerModule # module.module THEN
  7440. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7441. ELSE
  7442. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7443. END;
  7444. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7445. ELSE
  7446. ReleaseIntermediateOperand(pointer);
  7447. END;
  7448. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7449. Emit(Pop(position,pointer));
  7450. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7451. Designate(p0,l);
  7452. IF backend.writeBarriers & OnHeap(p0) THEN
  7453. SaveRegisters();ReleaseUsedRegisters(saved);
  7454. Emit(Push(position,l.op));
  7455. Emit(Push(position,pointer));
  7456. CallThis(position,"Heaps","Assign",2);
  7457. RestoreRegisters(saved);
  7458. ELSE
  7459. ToMemory(l.op,addressType,0);
  7460. Emit(Mov(position,l.op,pointer));
  7461. END;
  7462. ReleaseOperand(l);
  7463. result.tag := emptyOperand;
  7464. ELSIF (x.type # NIL) THEN
  7465. result := l; (* temporary variable is the result of NEW Type() *)
  7466. END;
  7467. (* call bodies *)
  7468. CallBodies(pointer,type);
  7469. ReleaseIntermediateOperand(pointer);
  7470. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7471. end := NewLabel();
  7472. BrL(end);
  7473. SetLabel(exit);
  7474. Designate(p0,l);
  7475. ToMemory(l.op,addressType,0);
  7476. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7477. ReleaseOperand(l);
  7478. SetLabel(end);
  7479. ELSE
  7480. SetLabel(exit);
  7481. END;
  7482. END;
  7483. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7484. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7485. IF ~backend.cooperative THEN (* simpler version *)
  7486. (*
  7487. push len0
  7488. push len1
  7489. push len2
  7490. push len_size
  7491. push len_adr
  7492. push tag
  7493. push static elements
  7494. push element size
  7495. push adr
  7496. *)
  7497. dim := 0;
  7498. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7499. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7500. parameter := x.parameters.GetExpression(i);
  7501. Evaluate(parameter,r);
  7502. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7503. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7504. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7505. END;
  7506. Emit(Push(position,r.op));
  7507. ReleaseOperand(r);
  7508. INC(dim);
  7509. END;
  7510. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7511. Emit(Mov(position, adr, sp));
  7512. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7513. Emit(Push(position, adr));
  7514. ReleaseIntermediateOperand(adr);
  7515. openDim := dim;
  7516. staticLength := 1;
  7517. IF type IS SyntaxTree.ArrayType THEN
  7518. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7519. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7520. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7521. END;
  7522. END;
  7523. IF SemanticChecker.ContainsPointer(type) THEN
  7524. tmp := TypeDescriptorAdr(type);
  7525. IF ~newObjectFile THEN
  7526. IntermediateCode.MakeMemory(tmp,addressType);
  7527. END;
  7528. ELSE
  7529. tmp := nil;
  7530. END;
  7531. Emit(Push(position,tmp)); (* type descriptor *)
  7532. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7533. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7534. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7535. Designate(p0,l);
  7536. Emit(Push(position,l.op)); (* address *)
  7537. ReleaseOperand(l);
  7538. CallThis(position,"Heaps","NewArray", 6);
  7539. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7540. Emit(Add(position,sp,sp,tmp));
  7541. ELSE
  7542. dim := 0;
  7543. IntermediateCode.InitOperand(reg);
  7544. IF p1 # NIL THEN
  7545. FOR i := firstPar TO x.parameters.Length()-1 DO
  7546. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7547. parameter := x.parameters.GetExpression(i);
  7548. Evaluate(parameter,r);
  7549. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7550. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7551. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7552. END;
  7553. Emit(Push(position,r.op));
  7554. IF i=1 THEN
  7555. CopyInt(reg,r.op);
  7556. ELSE
  7557. MulInt(reg, reg, r.op);
  7558. END;
  7559. ReleaseOperand(r);
  7560. INC(dim);
  7561. END;
  7562. Convert(reg,addressType);
  7563. ELSE
  7564. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7565. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7566. END;
  7567. openDim := dim;
  7568. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7569. IF backend.cooperative THEN
  7570. size := ToMemoryUnits(system,system.SizeOf(type));
  7571. WHILE type IS SyntaxTree.ArrayType DO
  7572. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7573. END;
  7574. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7575. IF (size # 1) THEN
  7576. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7577. END;
  7578. Emit(Push(position,reg));
  7579. size := ToMemoryUnits(system,system.SizeOf(type));
  7580. IF (size # 1) THEN
  7581. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7582. END;
  7583. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7584. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7585. Emit(Push(position,reg));
  7586. ReleaseIntermediateOperand(reg);
  7587. CallThis(position,"Runtime","New", 1);
  7588. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7589. Emit(Result(position, pointer));
  7590. exit := NewLabel();
  7591. else := NewLabel();
  7592. BreqL(else,pointer,nil);
  7593. IF ~type.hasPointers THEN
  7594. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7595. ELSIF type IS SyntaxTree.RecordType THEN
  7596. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7597. ELSIF type IS SyntaxTree.ProcedureType THEN
  7598. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7599. ELSE
  7600. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7601. END;
  7602. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7603. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7604. 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))));
  7605. IF type IS SyntaxTree.RecordType THEN
  7606. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7607. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7608. ELSE
  7609. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7610. END;
  7611. i := openDim;
  7612. WHILE i > 0 DO
  7613. DEC (i);
  7614. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7615. END;
  7616. needsTrace := p0.NeedsTrace();
  7617. IF needsTrace THEN ModifyAssignments(true) END;
  7618. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7619. Emit(Push(position, pointer));
  7620. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7621. Emit(Pop(position, pointer));
  7622. END;
  7623. Designate(p0,l);
  7624. IF needsTrace THEN
  7625. CallAssignPointer(l.op, pointer);
  7626. ModifyAssignments(false);
  7627. ELSE
  7628. ToMemory(l.op,addressType,0);
  7629. Emit(Mov(position,l.op,pointer));
  7630. END;
  7631. ReleaseIntermediateOperand(pointer);
  7632. ReleaseOperand(l);
  7633. BrL(exit);
  7634. SetLabel(else);
  7635. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7636. Designate(p0,l);
  7637. IF needsTrace THEN
  7638. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7639. ELSE
  7640. ToMemory(l.op,addressType,0);
  7641. Emit(Mov(position,l.op,pointer));
  7642. END;
  7643. ReleaseOperand(l);
  7644. SetLabel(exit);
  7645. ELSE
  7646. (*! the following code is only correct for "standard" Oberon calling convention *)
  7647. IF SemanticChecker.ContainsPointer(type) THEN
  7648. IF type IS SyntaxTree.ArrayType THEN
  7649. staticLength := 1;
  7650. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7651. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7652. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7653. END;
  7654. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7655. MulInt(reg,reg,tmp);
  7656. END;
  7657. Designate(p0,l);
  7658. IF openDim > 0 THEN
  7659. Emit(Push(position,l.op)); (* address for use after syscall *)
  7660. END;
  7661. Emit(Push(position,l.op)); (* address *)
  7662. ReleaseOperand(l);
  7663. tmp := TypeDescriptorAdr(type);
  7664. IF ~newObjectFile THEN
  7665. IntermediateCode.MakeMemory(tmp,addressType);
  7666. END;
  7667. Emit(Push(position,tmp)); (* type descriptor *)
  7668. ReleaseIntermediateOperand(tmp);
  7669. Emit(Push(position,reg)); (* number Elements *)
  7670. ReleaseIntermediateOperand(reg);
  7671. tmp := IntermediateCode.Immediate(addressType,dim);
  7672. Emit(Push(position,tmp)); (* dimensions *)
  7673. (* push realtime flag *)
  7674. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7675. ELSE Emit(Push(position,false));
  7676. END;
  7677. CallThis(position,"Heaps","NewArr",5)
  7678. ELSE
  7679. size := ToMemoryUnits(system,system.SizeOf(type));
  7680. IF (size # 1) THEN
  7681. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7682. (*
  7683. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7684. *)
  7685. END;
  7686. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7687. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7688. AddInt(reg, reg, tmp);
  7689. (*
  7690. Emit(Add(position,reg,reg,tmp));
  7691. *)
  7692. Designate(p0,l);
  7693. IF openDim >0 THEN
  7694. Emit(Push(position,l.op)); (* address for use after syscall *)
  7695. END;
  7696. Emit(Push(position,l.op)); (* address for syscall *)
  7697. ReleaseOperand(l); (* pointer address *)
  7698. Emit(Push(position,reg)); (* size *)
  7699. ReleaseIntermediateOperand(reg);
  7700. (* push realtime flag *)
  7701. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7702. ELSE Emit(Push(position,false));
  7703. END;
  7704. CallThis(position,"Heaps","NewSys", 3)
  7705. END;
  7706. IF openDim > 0 THEN
  7707. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7708. Emit(Pop(position,adr));
  7709. ToMemory(adr,addressType,0);
  7710. ReuseCopy(tmp,adr);
  7711. ReleaseIntermediateOperand(adr);
  7712. adr := tmp;
  7713. else := NewLabel();
  7714. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7715. i := openDim-1;
  7716. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7717. WHILE (i >= 0) DO
  7718. Emit(Pop(position,reg));
  7719. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7720. Emit(Mov(position,res,reg));
  7721. DEC(i);
  7722. END;
  7723. ReleaseIntermediateOperand(adr);
  7724. ReleaseIntermediateOperand(reg);
  7725. exit := NewLabel();
  7726. BrL(exit);
  7727. SetLabel(else);
  7728. (* else part: array could not be allocated *)
  7729. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7730. Emit(Add(position,sp,sp,tmp));
  7731. SetLabel(exit);
  7732. END;
  7733. END;
  7734. END;
  7735. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7736. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7737. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7738. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7739. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7740. left.SetType(procedure.type);
  7741. formalParameter := procedureType.firstParameter;
  7742. (* push array to allocate *)
  7743. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7744. formalParameter :=formalParameter.nextParameter;
  7745. (* push length array *)
  7746. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7747. (* push size *)
  7748. type := t0;
  7749. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7750. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7751. END;
  7752. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7753. Emit(Push(position,tmp));
  7754. (* *)
  7755. IF SemanticChecker.ContainsPointer(type) THEN
  7756. tmp := TypeDescriptorAdr(type);
  7757. IF ~newObjectFile THEN
  7758. IntermediateCode.MakeMemory(tmp,addressType);
  7759. END;
  7760. ELSE
  7761. tmp := IntermediateCode.Immediate(addressType, 0);
  7762. END;
  7763. Emit(Push(position,tmp)); (* type descriptor *)
  7764. StaticCallOperand(result,procedure);
  7765. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7766. ReleaseOperand(result);
  7767. END;
  7768. (*
  7769. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7770. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7771. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7772. *)
  7773. ELSE
  7774. (*
  7775. push len0
  7776. push len1
  7777. push len2
  7778. push size
  7779. push len_adr
  7780. push element_size
  7781. push tag
  7782. push adr
  7783. *)
  7784. dim := 0;
  7785. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7786. isTensor := TRUE;
  7787. ELSE
  7788. isTensor := FALSE;
  7789. END;
  7790. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7791. IF ~isTensor THEN
  7792. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7793. END;
  7794. parameter := x.parameters.GetExpression(i);
  7795. Evaluate(parameter,r);
  7796. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7797. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7798. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7799. END;
  7800. Emit(Push(position,r.op));
  7801. ReleaseOperand(r);
  7802. INC(dim);
  7803. END;
  7804. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7805. Emit(Mov(position, adr, sp));
  7806. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7807. Emit(Push(position, adr));
  7808. ReleaseIntermediateOperand(adr);
  7809. openDim := dim;
  7810. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7811. IF isTensor THEN
  7812. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7813. ELSE
  7814. baseType := SemanticChecker.ArrayBase(type,openDim);
  7815. END;
  7816. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7817. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7818. IF SemanticChecker.ContainsPointer(baseType) THEN
  7819. tmp := TypeDescriptorAdr(baseType);
  7820. IF ~newObjectFile THEN
  7821. IntermediateCode.MakeMemory(tmp,addressType);
  7822. END;
  7823. ELSE
  7824. tmp := nil;
  7825. END;
  7826. Emit(Push(position,tmp)); (* type descriptor *)
  7827. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7828. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7829. ELSE (* error message has already been emited *)
  7830. RETURN;
  7831. END;
  7832. Designate(p0,l);
  7833. IF isTensor THEN
  7834. Emit(Push(position,l.op)); (* address *)
  7835. ELSE
  7836. Emit(Push(position,l.tag)); (* address *)
  7837. END;
  7838. ReleaseOperand(l);
  7839. StaticCallOperand(result,procedure);
  7840. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7841. ReleaseOperand(result);
  7842. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7843. Emit(Add(position,sp,sp,tmp));
  7844. END;
  7845. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7846. THEN
  7847. IF ~backend.cellsAreObjects THEN RETURN END;
  7848. IF InCellScope(currentScope) THEN
  7849. PushSelfPointer()
  7850. ELSE
  7851. Emit(Push(position, nil));
  7852. END;
  7853. (* push temp address *)
  7854. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7855. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7856. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7857. (* l.op contains address of pointer to record *)
  7858. Emit(Push(position,l.op)); (* address for use after syscall *)
  7859. ReleaseOperand(l);
  7860. (* push type descriptor *)
  7861. reg := TypeDescriptorAdr(baseType);
  7862. IF ~newObjectFile THEN
  7863. IntermediateCode.MakeMemory(reg,addressType);
  7864. END;
  7865. Emit(Push(position,reg));
  7866. ReleaseIntermediateOperand(reg);
  7867. (* push name *)
  7868. (*Global.GetSymbolName(p0, n);*)
  7869. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7870. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7871. ELSE
  7872. Global.GetModuleName(module.module, n);
  7873. END;
  7874. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7875. (*type.typeDeclaration.GetName(n);*)
  7876. PushConstString(n);
  7877. (* push cellnet boolean *)
  7878. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7879. (* push engine boolean *)
  7880. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7881. (* allocate *)
  7882. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7883. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7884. (* l.op contains address of pointer to record *)
  7885. ToMemory(l.op,addressType,0);
  7886. (* l.op contains value of pointer to record *)
  7887. InitFields(baseType, l.op,0);
  7888. (* add capabilities *)
  7889. modifier := p0(SyntaxTree.Designator).modifiers;
  7890. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7891. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7892. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7893. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7894. END;
  7895. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7896. (*
  7897. modifier := baseType(SyntaxTree.CellType).modifiers;
  7898. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7899. modifier := p0(SyntaxTree.Designator).modifiers;
  7900. *)
  7901. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7902. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7903. (* l.op contains address of pointer to record *)
  7904. ToMemory(l.op,addressType,0);
  7905. (* l.op contains value of pointer to record *)
  7906. Emit(Push(position,l.op)); (* address for use after syscall *)
  7907. ReleaseOperand(l);
  7908. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7909. prevScope := currentScope;
  7910. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7911. previous := section;
  7912. section := init;
  7913. (* add ports *)
  7914. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7915. CloseInitializer(previous);
  7916. currentScope := prevScope;
  7917. Symbol(temporaryVariable,l);
  7918. ToMemory(l.op,addressType,0);
  7919. Emit(Push(position,l.op));
  7920. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7921. (*
  7922. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7923. IF constructor # NIL THEN
  7924. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7925. FOR i := 1 TO x.parameters.Length()-1 DO
  7926. p := x.parameters.GetExpression(i);
  7927. Global.GetSymbolName(parameter,name);
  7928. Evaluate(p, value);
  7929. ASSERT(value.type # NIL);
  7930. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7931. par := instance.AddParameter(name);
  7932. par.SetInteger(value.integer);
  7933. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7934. par := instance.AddParameter(name);
  7935. par.SetBoolean(value.boolean);
  7936. ELSE Error(x.position,NotYetImplemented)
  7937. END;
  7938. parameter := parameter.nextParameter
  7939. END;
  7940. END;
  7941. *)
  7942. (* call initializer *)
  7943. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7944. IF constructor # NIL THEN
  7945. (*! should be unified with ProcedureCallDesignator *)
  7946. IF backend.cellsAreObjects THEN
  7947. Symbol(temporaryVariable,l);
  7948. ToMemory(l.op,addressType,0);
  7949. Emit(Push(position,l.op));
  7950. ReleaseOperand(l);
  7951. END;
  7952. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7953. FOR i := firstPar TO x.parameters.Length()-1 DO
  7954. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7955. formalParameter := formalParameter.nextParameter;
  7956. END;
  7957. (* static call of the constructor *)
  7958. Global.GetSymbolSegmentedName(constructor,name);
  7959. ASSERT(~constructor.isInline);
  7960. IF constructor.scope.ownerModule # module.module THEN
  7961. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7962. ELSE
  7963. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7964. END;
  7965. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7966. (*ELSE
  7967. ReleaseIntermediateOperand(pointer);*)
  7968. END;
  7969. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7970. ToMemory(l.op, addressType, 0);
  7971. Designate(p0,s0);
  7972. ToMemory(s0.op,addressType,0);
  7973. Emit(Mov(position,s0.op,l.op));
  7974. ReleaseOperand(l);
  7975. ReleaseOperand(s0);
  7976. result.tag := emptyOperand;
  7977. (* start *)
  7978. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7979. (* push cell *)
  7980. Symbol(temporaryVariable, l);
  7981. ToMemory(l.op,addressType,0);
  7982. Emit(Push(Basic.invalidPosition,l.op));
  7983. (* push delegate *)
  7984. Emit(Push(Basic.invalidPosition,l.op));
  7985. ReleaseOperand(l);
  7986. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7987. Emit(Push(position, s1.op));
  7988. ReleaseOperand(s1);
  7989. CallThis(position,"ActiveCellsRuntime","Start",3);
  7990. END;
  7991. (*IF temporaryVariable # NIL THEN
  7992. end := NewLabel();
  7993. BrL(end);
  7994. SetLabel(exit);
  7995. Designate(p0,l);
  7996. ToMemory(l.op,addressType,0);
  7997. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7998. ReleaseOperand(l);
  7999. SetLabel(end);
  8000. ELSE
  8001. SetLabel(exit);
  8002. END;
  8003. *)
  8004. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8005. ELSE (* no pointer to record, no pointer to array *)
  8006. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8007. (* ignore new statement *)
  8008. Warning(p0.position, "cannot run on final hardware");
  8009. ELSE
  8010. HALT(200);
  8011. END;
  8012. END;
  8013. (* ---- ADDRESSOF----- *)
  8014. |Global.systemAdr:
  8015. Designate(p0,s0);
  8016. s0.mode := ModeValue;
  8017. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8018. ReleaseIntermediateOperand(s0.op);
  8019. s0.op := s0.tag;
  8020. IntermediateCode.InitOperand(s0.tag);
  8021. END;
  8022. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8023. result := s0;
  8024. (* ---- BIT ----- *)
  8025. |Global.systemBit:
  8026. Evaluate(p0,s0);
  8027. ToMemory(s0.op,addressType,0);
  8028. ReuseCopy(res,s0.op);
  8029. ReleaseOperand(s0);
  8030. Evaluate(p1,s1);
  8031. Emit(Ror(position,res,res,s1.op));
  8032. ReleaseOperand(s1);
  8033. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8034. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8035. IF ~conditional THEN
  8036. InitOperand(result,ModeValue); result.op := res;
  8037. ELSE
  8038. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8039. BrL(falseLabel);
  8040. ReleaseIntermediateOperand(res);
  8041. END;
  8042. (* --- MSK ----*)
  8043. |Global.systemMsk:
  8044. Evaluate(p0,s0);
  8045. Evaluate(p1,s1);
  8046. ReuseCopy(res,s0.op);
  8047. ReleaseOperand(s0);
  8048. Emit(And(position,res,res,s1.op));
  8049. ReleaseOperand(s1);
  8050. InitOperand(result,ModeValue);
  8051. result.op := res;
  8052. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8053. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8054. Evaluate(p0,s0);
  8055. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8056. ReleaseOperand(s0);
  8057. InitOperand(result,ModeValue);
  8058. result.op := res;
  8059. (* ---- SYSTEM.GetStackPointer ----- *)
  8060. |Global.systemGetStackPointer:
  8061. InitOperand(result,ModeValue);
  8062. result.op := sp;
  8063. (* ---- SYSTEM.GetFramePointer ----- *)
  8064. |Global.systemGetFramePointer:
  8065. InitOperand(result,ModeValue);
  8066. result.op := fp;
  8067. (* ---- SYSTEM.GetActivity ----- *)
  8068. |Global.systemGetActivity:
  8069. ASSERT(backend.cooperative);
  8070. InitOperand(result,ModeValue);
  8071. result.op := ap;
  8072. (* ---- SYSTEM.SetStackPointer ----- *)
  8073. |Global.systemSetStackPointer:
  8074. Evaluate(p0,s0); (* *)
  8075. Emit(Mov(position,sp,s0.op));
  8076. ReleaseOperand(s0);
  8077. (* ---- SYSTEM.SetFramePointer ----- *)
  8078. |Global.systemSetFramePointer:
  8079. Evaluate(p0,s0); (* *)
  8080. Emit(Mov(position,fp,s0.op));
  8081. ReleaseOperand(s0);
  8082. (* ---- SYSTEM.Activity ----- *)
  8083. |Global.systemSetActivity:
  8084. ASSERT(backend.cooperative);
  8085. Evaluate(p0,s0); (* *)
  8086. Emit(Mov(position,ap,s0.op));
  8087. ReleaseOperand(s0);
  8088. (* ---- SYSTEM.VAL ----- *)
  8089. |Global.systemVal:
  8090. Expression(p1);
  8091. s1 := result;
  8092. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8093. IF s1.mode = ModeReference THEN
  8094. (* nothing to be done if not record type, just take over new type *)
  8095. IF (type IS SyntaxTree.RecordType) THEN
  8096. ReleaseIntermediateOperand(s1.tag);
  8097. s1.tag := TypeDescriptorAdr(type);
  8098. IF ~newObjectFile THEN
  8099. IntermediateCode.MakeMemory(s1.tag,addressType);
  8100. END;
  8101. UseIntermediateOperand(s1.tag);
  8102. END;
  8103. result := s1;
  8104. ELSE (* copy over result to different type, may not use convert *)
  8105. itype := IntermediateCode.GetType(system,type);
  8106. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8107. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8108. Emit(Mov(position,s0.op,s1.op));
  8109. ReleaseOperand(s1);
  8110. InitOperand(result,ModeValue);
  8111. result.op := s0.op;
  8112. ELSE (* different size, must convert *)
  8113. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8114. Convert(s1.op, IntermediateCode.GetType(system,type));
  8115. result := s1;
  8116. END;
  8117. END;
  8118. (* ---- SYSTEM.GET ----- *)
  8119. |Global.systemGet:
  8120. Evaluate(p0,s0); (* adr *)
  8121. Designate(p1,s1); (* variable *)
  8122. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8123. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8124. Emit(Mov(position,s1.op,s0.op));
  8125. ReleaseOperand(s1);
  8126. ReleaseOperand(s0);
  8127. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8128. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8129. Evaluate(p0,s0); (* *)
  8130. Evaluate(p1,s1); (* variable *)
  8131. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8132. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8133. (* real part *)
  8134. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8135. Emit(Mov(position,res, s1.op));
  8136. ReleaseIntermediateOperand(res);
  8137. (* imaginary part *)
  8138. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8139. Emit(Mov(position,res, s1.tag));
  8140. ReleaseIntermediateOperand(res);
  8141. ReleaseOperand(s1);
  8142. ReleaseOperand(s0);
  8143. ELSE
  8144. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8145. ReleaseOperand(s0);
  8146. Emit(Mov(position,res,s1.op));
  8147. ReleaseIntermediateOperand(res);
  8148. ReleaseOperand(s1);
  8149. END;
  8150. (* ---- SYSTEM.MOVE ----- *)
  8151. |Global.systemMove:
  8152. Evaluate(p0,s0);
  8153. Evaluate(p1,s1);
  8154. Evaluate(p2,s2);
  8155. Emit(Copy(position,s1.op,s0.op,s2.op));
  8156. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8157. (* ---- SYSTEM.NEW ----- *)
  8158. |Global.systemNew:
  8159. Designate(p0,s0);
  8160. Emit(Push(position,s0.op));
  8161. ReleaseOperand(s0);
  8162. Evaluate(p1,s1);
  8163. Emit(Push(position,s1.op));
  8164. ReleaseOperand(s1);
  8165. (* push realtime flag: false by default *)
  8166. Emit(Push(position,false));
  8167. CallThis(position,"Heaps","NewSys",3);
  8168. (* ---- SYSTEM.CALL ----- *)
  8169. |Global.systemRef:
  8170. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8171. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8172. s0.mode := ModeValue;
  8173. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8174. result := s0
  8175. (* ---- INCR ----- *)
  8176. |Global.Incr:
  8177. Designate(p0,operand);
  8178. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8179. Dereference(operand,p0.type.resolved,FALSE);
  8180. END;
  8181. ASSERT(p1 # NIL);
  8182. Evaluate(p1,l);
  8183. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8184. ReleaseOperand(operand); ReleaseOperand(l);
  8185. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8186. (* ---- SUM ----- *)
  8187. |Global.Sum: HALT(200);
  8188. (* ---- ALL ----- *)
  8189. |Global.All: HALT(200);
  8190. (* ---- CAS ----- *)
  8191. |Global.Cas:
  8192. needsTrace := p0.NeedsTrace();
  8193. IF needsTrace THEN ModifyAssignments(true) END;
  8194. Designate(p0,s0);
  8195. Evaluate(p1,s1);
  8196. Evaluate(p2,s2);
  8197. IF needsTrace THEN
  8198. Emit(Push(position, s0.op));
  8199. Emit(Push(position, s1.op));
  8200. Emit(Push(position, s2.op));
  8201. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8202. ELSE
  8203. Emit(Cas(position,s0.op,s1.op,s2.op));
  8204. END;
  8205. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8206. IF needsTrace THEN ModifyAssignments(false) END;
  8207. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8208. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8209. IF conditional THEN
  8210. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8211. BrL(falseLabel);
  8212. ReleaseIntermediateOperand(res);
  8213. END;
  8214. (* ---- DIM ----- *)
  8215. |Global.Dim:
  8216. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8217. Designate(p0,s0);
  8218. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8219. Dereference(s0,p0.type.resolved,FALSE);
  8220. END;
  8221. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8222. ReleaseOperand(s0);
  8223. (* ---- RESHAPE ----- *)
  8224. |Global.Reshape:
  8225. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8226. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8227. left.SetType(procedure.type);
  8228. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8229. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8230. END;
  8231. (* ---- SYSTEM.TYPECODE ----- *)
  8232. |Global.systemTypeCode:
  8233. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8234. IF type.resolved IS SyntaxTree.PointerType THEN
  8235. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8236. END;
  8237. result.op := TypeDescriptorAdr(type);
  8238. IF ~newObjectFile THEN
  8239. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  8240. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  8241. END;
  8242. result.mode := ModeValue;
  8243. (* ---- SYSTEM.TRACE ----- *)
  8244. |Global.systemTrace:
  8245. SystemTrace(x.parameters, x.position);
  8246. (* ----- CONNECT ------*)
  8247. |Global.Connect:
  8248. IF backend.cellsAreObjects THEN
  8249. PushPort(p0);
  8250. PushPort(p1);
  8251. IF p2 # NIL THEN
  8252. Evaluate(p2, s2);
  8253. Emit(Push(p2.position, s2.op));
  8254. ReleaseOperand(s2);
  8255. ELSE
  8256. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8257. END;
  8258. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8259. ELSE
  8260. Warning(x.position, "cannot run on final hardware");
  8261. END;
  8262. (* ----- DELEGATE ------*)
  8263. |Global.Delegate:
  8264. IF backend.cellsAreObjects THEN
  8265. PushPort(p0);
  8266. PushPort(p1);
  8267. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8268. ELSE
  8269. Warning(x.position, "cannot run on final hardware");
  8270. END;
  8271. (* ----- SEND ------*)
  8272. |Global.Send:
  8273. Evaluate(p0,s0);
  8274. Evaluate(p1,s1);
  8275. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8276. Emit(Push(position,s0.op));
  8277. Emit(Push(position,s1.op));
  8278. (*
  8279. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8280. *)
  8281. IF ~backend.cellsAreObjects THEN
  8282. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8283. END;
  8284. ReleaseOperand(s0);
  8285. ReleaseOperand(s1);
  8286. IF backend.cellsAreObjects THEN
  8287. CallThis(position,"ActiveCellsRuntime","Send",2);
  8288. ELSE
  8289. CallThis(position,ChannelModuleName,"Send",2);
  8290. END;
  8291. (* ----- RECEIVE ------*)
  8292. |Global.Receive:
  8293. Evaluate(p0,s0);
  8294. Emit(Push(position,s0.op));
  8295. Designate(p1,s1);
  8296. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8297. Emit(Push(position,s1.op));
  8298. IF p2 # NIL THEN
  8299. Designate(p2,s2);
  8300. Emit(Push(position,s2.op));
  8301. END;
  8302. (*
  8303. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8304. *)
  8305. IF ~backend.cellsAreObjects THEN
  8306. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8307. END;
  8308. ReleaseOperand(s0);
  8309. ReleaseOperand(s1);
  8310. ReleaseOperand(s2);
  8311. IF backend.cellsAreObjects THEN
  8312. IF p2 = NIL THEN
  8313. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8314. ELSE
  8315. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8316. END;
  8317. ELSE
  8318. IF p2 = NIL THEN
  8319. CallThis(position,ChannelModuleName,"Receive",2)
  8320. ELSE
  8321. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8322. END;
  8323. END;
  8324. | Global.systemSpecial:
  8325. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8326. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8327. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8328. (* determine if parameters are of the VAR kind *)
  8329. ASSERT(x.parameters.Length() <= 3);
  8330. formalParameter := procedureType.firstParameter;
  8331. FOR i := 0 TO x.parameters.Length() - 1 DO
  8332. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8333. formalParameter := formalParameter.nextParameter
  8334. END;
  8335. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8336. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8337. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8338. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8339. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8340. IF procedureType.returnType # NIL THEN
  8341. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8342. Emit(Result(position, res));
  8343. (*InitOperand(result,ModeValue);
  8344. result.op := res;
  8345. *)
  8346. IF ~conditional THEN
  8347. InitOperand(result,ModeValue); result.op := res;
  8348. ELSE
  8349. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8350. BrL(falseLabel);
  8351. ReleaseIntermediateOperand(res);
  8352. END;
  8353. END
  8354. ELSE (* function not yet implemented *)
  8355. Error(position,"not yet implemented");
  8356. END;
  8357. destination := dest;
  8358. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8359. END VisitBuiltinCallDesignator;
  8360. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8361. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8362. BEGIN
  8363. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8364. dest := destination; destination := emptyOperand;
  8365. Expression(x.left);
  8366. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8367. ELSIF isUnchecked THEN (* no check *)
  8368. ELSE
  8369. trueL := NewLabel();
  8370. falseL := NewLabel();
  8371. IF IsPointerToRecord(x.left.type,recordType) THEN
  8372. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8373. Emit(Mov(position,tag, result.op));
  8374. IF result.mode # ModeValue THEN
  8375. ptr := tag;
  8376. IntermediateCode.MakeMemory(ptr,addressType);
  8377. Emit(Mov(position,tag, ptr));
  8378. END;
  8379. IF ~backend.cooperative THEN
  8380. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8381. END;
  8382. IntermediateCode.MakeMemory(tag,addressType);
  8383. ELSE
  8384. tag := result.tag;
  8385. UseIntermediateOperand(tag);
  8386. END;
  8387. TypeTest(tag,x.type,trueL,falseL);
  8388. ReleaseIntermediateOperand(tag);
  8389. SetLabel(falseL);
  8390. EmitTrap(position,TypeCheckTrap);
  8391. SetLabel(trueL);
  8392. END;
  8393. destination := dest;
  8394. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8395. END VisitTypeGuardDesignator;
  8396. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8397. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8398. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8399. VAR label: Label; pc: LONGINT;
  8400. BEGIN
  8401. IF backend.cooperative & ~isUnchecked THEN
  8402. pc := section.pc;
  8403. label := NewLabel();
  8404. BrneL(label, operand.op, nil);
  8405. EmitTrap(position, NilPointerTrap);
  8406. SetLabel(label);
  8407. INC(statCoopNilCheck, section.pc - pc);
  8408. END;
  8409. END NilCheck;
  8410. BEGIN
  8411. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8412. ReuseCopy(dereferenced,operand.op);
  8413. ReleaseOperand(operand);
  8414. operand.mode := ModeReference;
  8415. operand.op := dereferenced;
  8416. operand.tag := dereferenced;
  8417. UseIntermediateOperand(operand.tag);
  8418. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8419. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8420. ReleaseIntermediateOperand(operand.tag);
  8421. operand.tag := TypeDescriptorAdr(type);
  8422. IF ~newObjectFile THEN
  8423. IntermediateCode.MakeMemory(operand.tag,addressType);
  8424. END;
  8425. ELSE
  8426. IF ~backend.cooperative THEN
  8427. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8428. END;
  8429. IntermediateCode.MakeMemory(operand.tag,addressType);
  8430. END;
  8431. NilCheck(operand.op);
  8432. ELSIF type IS SyntaxTree.ArrayType THEN
  8433. IF isUnsafe THEN
  8434. NilCheck(operand.op);
  8435. ReleaseIntermediateOperand(operand.tag);
  8436. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8437. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8438. ELSE
  8439. operand.tag := emptyOperand;
  8440. END;
  8441. ELSE
  8442. NilCheck(operand.op);
  8443. IF backend.cooperative THEN
  8444. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8445. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8446. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8447. ELSE
  8448. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8449. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8450. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8451. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8452. END;
  8453. END;
  8454. ELSIF type IS SyntaxTree.MathArrayType THEN
  8455. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8456. IntermediateCode.MakeMemory(operand.op,addressType);
  8457. ELSE HALT(100);
  8458. END;
  8459. END Dereference;
  8460. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8461. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8462. BEGIN
  8463. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8464. dest := destination; destination := emptyOperand;
  8465. Evaluate(x.left,d);
  8466. type := x.type.resolved;
  8467. prevIsUnchecked := isUnchecked;
  8468. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8469. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8470. END;
  8471. Dereference(d,type,IsUnsafePointer(x.left.type));
  8472. isUnchecked := prevIsUnchecked;
  8473. result := d;
  8474. 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
  8475. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8476. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8477. END;
  8478. END;
  8479. destination := dest;
  8480. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8481. END VisitDereferenceDesignator;
  8482. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8483. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8484. BEGIN
  8485. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8486. dest := destination; destination := emptyOperand;
  8487. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8488. tag := result.op;
  8489. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8490. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8491. StaticCallOperand(result,procedure.super);
  8492. ReleaseIntermediateOperand(result.tag);
  8493. UseIntermediateOperand(tag); (* necessary ? *)
  8494. result.tag := tag;
  8495. destination := dest;
  8496. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8497. END VisitSupercallDesignator;
  8498. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8499. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8500. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8501. name: Basic.SegmentedName;
  8502. procedure: SyntaxTree.Procedure;
  8503. procedureType: SyntaxTree.ProcedureType;
  8504. BEGIN
  8505. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8506. dest := destination; destination := emptyOperand;
  8507. scope := currentScope;
  8508. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8509. scope := scope.outerScope;
  8510. END;
  8511. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8512. IF newObjectFile THEN
  8513. moduleSection := meta.ModuleSection();
  8514. IF backend.cooperative THEN
  8515. moduleOffset := 0;
  8516. ELSE
  8517. moduleOffset := moduleSection.pc;
  8518. END;
  8519. result.mode := ModeValue;
  8520. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8521. ELSE
  8522. Symbol(moduleSelf,result);
  8523. IntermediateCode.MakeMemory(result.op,addressType);
  8524. END
  8525. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8526. result.mode := ModeValue;
  8527. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8528. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8529. ELSE
  8530. GetBaseRegister(basereg,currentScope,scope);
  8531. InitOperand(result,ModeReference);
  8532. result.op := basereg;
  8533. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8534. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8535. parametersSize := ProcedureParametersSize(system,procedure);
  8536. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8537. IF backend.cooperative THEN
  8538. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8539. END;
  8540. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8541. MakeMemory(result.op, result.op, addressType, 0);
  8542. END;
  8543. (* tag must be loaded when dereferencing SELF pointer *)
  8544. END;
  8545. destination := dest;
  8546. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8547. END VisitSelfDesignator;
  8548. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8549. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8550. BEGIN
  8551. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8552. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8553. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8554. parameter := procedureType.returnParameter;
  8555. IF currentIsInline THEN
  8556. map := currentMapper.Get(NIL);
  8557. IF map # NIL THEN
  8558. Designate(map.to, result);
  8559. ELSE
  8560. HALT(200);
  8561. END;
  8562. RETURN;
  8563. END;
  8564. VisitParameter(parameter);
  8565. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8566. END VisitResultDesignator;
  8567. (** values *)
  8568. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8569. BEGIN
  8570. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8571. IF conditional THEN
  8572. IF x.value THEN BrL(trueLabel)
  8573. ELSE BrL(falseLabel)
  8574. END;
  8575. ELSE
  8576. InitOperand(result,ModeValue);
  8577. IF x.value THEN result.op := true ELSE result.op := false END;
  8578. END;
  8579. END VisitBooleanValue;
  8580. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8581. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8582. BEGIN
  8583. Global.GetModuleSegmentedName(module.module, name);
  8584. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8585. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8586. RETURN section
  8587. END GetDataSection;
  8588. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8589. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8590. BEGIN
  8591. type := vop.type;
  8592. data := GetDataSection();
  8593. pc := EnterImmediate(data,vop);
  8594. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8595. IntermediateCode.MakeMemory(vop, type);
  8596. END GetImmediateMem;
  8597. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8598. BEGIN
  8599. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8600. InitOperand(result,ModeValue);
  8601. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8602. IF ~supportedImmediate(result.op) &~inData THEN
  8603. GetImmediateMem(result.op)
  8604. END;
  8605. END VisitIntegerValue;
  8606. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8607. BEGIN
  8608. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8609. InitOperand(result,ModeValue);
  8610. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8611. END VisitCharacterValue;
  8612. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8613. BEGIN
  8614. IF Trace THEN TraceEnter("VisitSetValue") END;
  8615. InitOperand(result,ModeValue);
  8616. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8617. END VisitSetValue;
  8618. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8619. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8620. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8621. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8622. BEGIN
  8623. numberElements := x.elements.Length();
  8624. FOR i := 0 TO numberElements-1 DO
  8625. expression := x.elements.GetExpression(i);
  8626. IF expression IS SyntaxTree.MathArrayExpression THEN
  8627. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8628. ELSE
  8629. inData := TRUE;
  8630. Evaluate(expression,op);
  8631. irv.Emit(Data(position,op.op));
  8632. inData := FALSE;
  8633. ReleaseOperand(op);
  8634. END;
  8635. END;
  8636. END RecursiveData;
  8637. BEGIN
  8638. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8639. IF ~TryConstantDeclaration() THEN
  8640. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8641. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8642. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8643. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8644. ELSE
  8645. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8646. END;
  8647. RecursiveData(x.array);
  8648. InitOperand(result,ModeReference);
  8649. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8650. END
  8651. END VisitMathArrayValue;
  8652. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8653. VAR constant: Sections.Section;
  8654. BEGIN
  8655. IF constantDeclaration = NIL THEN
  8656. RETURN FALSE
  8657. ELSE
  8658. (* Is a constant in this module: did we generate it already? *)
  8659. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8660. IF constant # NIL THEN
  8661. InitOperand(result,ModeReference);
  8662. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8663. RETURN TRUE;
  8664. END;
  8665. END;
  8666. RETURN FALSE
  8667. END TryConstantDeclaration;
  8668. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8669. BEGIN
  8670. constantDeclaration := x;
  8671. x.value.resolved.Accept(SELF);
  8672. END VisitConstant;
  8673. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8674. BEGIN
  8675. IF Trace THEN TraceEnter("VisitRealValue") END;
  8676. InitOperand(result,ModeValue);
  8677. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8678. END VisitRealValue;
  8679. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8680. VAR
  8681. componentType: SyntaxTree.Type;
  8682. BEGIN
  8683. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8684. ASSERT(x.type IS SyntaxTree.ComplexType);
  8685. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8686. InitOperand(result,ModeValue);
  8687. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8688. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8689. END VisitComplexValue;
  8690. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8691. VAR i: LONGINT; name: Basic.SegmentedName;
  8692. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8693. BEGIN
  8694. IF Trace THEN TraceEnter("VisitStringValue") END;
  8695. IF ~TryConstantDeclaration() THEN
  8696. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8697. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8698. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8699. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8700. ELSE
  8701. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8702. END;
  8703. FOR i := 0 TO x.length-1 DO
  8704. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8705. irv.Emit(Data(position,op));
  8706. END;
  8707. InitOperand(result,ModeReference);
  8708. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8709. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8710. END
  8711. END VisitStringValue;
  8712. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8713. BEGIN
  8714. IF Trace THEN TraceEnter("VisitNilValue") END;
  8715. InitOperand(result,ModeValue);
  8716. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8717. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8718. END VisitNilValue;
  8719. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8720. BEGIN
  8721. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8722. InitOperand(result,ModeValue);
  8723. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8724. END VisitEnumerationValue;
  8725. (** symbols *)
  8726. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8727. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8728. END VisitImport;
  8729. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8730. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8731. BEGIN
  8732. IF scope # baseScope THEN
  8733. (* left := [fp+8] *)
  8734. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8735. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8736. ReuseCopy(left,right);
  8737. ReleaseIntermediateOperand(right);
  8738. scope := scope.outerScope; DEC(level);
  8739. (* { left := [left+8] } *)
  8740. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8741. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8742. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8743. Emit(Mov(position,left,right));
  8744. scope := scope.outerScope; DEC(level);
  8745. END;
  8746. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8747. result := left;
  8748. ELSE
  8749. result := fp;
  8750. END;
  8751. END GetBaseRegister;
  8752. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8753. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8754. BEGIN
  8755. IF Trace THEN TraceEnter("VisitVariable"); END;
  8756. type := x.type.resolved;
  8757. IF (x.useRegister) THEN
  8758. InitOperand(result, ModeValue);
  8759. IF x.registerNumber < 0 THEN
  8760. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8761. reg := x.registerNumber;
  8762. ELSE
  8763. reg := registerUsageCount.Map(x.registerNumber);
  8764. UseRegister(reg);
  8765. END;
  8766. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8767. ELSIF x.externalName # NIL THEN
  8768. InitOperand(result,ModeReference);
  8769. Basic.ToSegmentedName(x.externalName^, name);
  8770. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8771. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8772. InitOperand(result,ModeReference);
  8773. GetBaseRegister(result.op,currentScope,x.scope);
  8774. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8775. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8776. InitOperand(result,ModeReference);
  8777. GetCodeSectionNameForSymbol(x,name);
  8778. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8779. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8780. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8781. InitOperand(result,ModeReference);
  8782. GetCodeSectionNameForSymbol(x,name);
  8783. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8784. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8785. ELSE (* field, left designator must have been emitted *)
  8786. ASSERT(result.mode = ModeReference);
  8787. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8788. ReuseCopy(temp,result.op);
  8789. ReleaseIntermediateOperand(result.op);
  8790. result.op := temp;
  8791. END;
  8792. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8793. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8794. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8795. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8796. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8797. END;
  8798. END;
  8799. END;
  8800. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8801. ValueToCondition(result);
  8802. ELSIF type IS SyntaxTree.ProcedureType THEN
  8803. ReleaseIntermediateOperand(result.tag);
  8804. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8805. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8806. UseIntermediateOperand(result.tag);
  8807. ELSE
  8808. result.tag := nil; (* nil *)
  8809. END;
  8810. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8811. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8812. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8813. ReleaseIntermediateOperand(result.tag);
  8814. Global.GetSymbolSegmentedName(x,name);
  8815. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8816. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8817. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8818. ELSE
  8819. END;
  8820. ELSE
  8821. ReleaseIntermediateOperand(result.tag);
  8822. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8823. END;
  8824. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8825. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8826. ReleaseIntermediateOperand(result.tag);
  8827. result.tag := result.op;
  8828. UseIntermediateOperand(result.tag);
  8829. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8830. IntermediateCode.MakeMemory(result.op,addressType);
  8831. END;
  8832. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8833. ReleaseIntermediateOperand(result.tag);
  8834. result.tag := TypeDescriptorAdr(type);
  8835. IF ~newObjectFile THEN
  8836. IntermediateCode.MakeMemory(result.tag,addressType);
  8837. END;
  8838. UseIntermediateOperand(result.tag);
  8839. (* tag for pointer type computed not here but during dereferencing *)
  8840. END;
  8841. IF Trace THEN TraceExit("VisitVariable") END;
  8842. END VisitVariable;
  8843. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8844. BEGIN
  8845. VisitVariable(property);
  8846. END VisitProperty;
  8847. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8848. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8849. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8850. BEGIN
  8851. type := x.type.resolved;
  8852. IF Trace THEN TraceEnter("VisitParameter") END;
  8853. IF x.ownerType IS SyntaxTree.CellType THEN
  8854. ptype := x.type.resolved;
  8855. IF backend.cellsAreObjects THEN
  8856. ASSERT(result.mode = ModeReference);
  8857. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8858. ReuseCopy(temp,result.op);
  8859. ReleaseIntermediateOperand(result.op);
  8860. result.op := temp;
  8861. END;
  8862. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8863. RETURN;
  8864. ELSE
  8865. InitOperand(result,ModeReference);
  8866. GetCodeSectionNameForSymbol(x,name);
  8867. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8868. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8869. RETURN;
  8870. END;
  8871. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8872. InitOperand(result,ModeReference);
  8873. GetCodeSectionNameForSymbol(x,name);
  8874. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8875. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8876. RETURN
  8877. ELSE
  8878. GetBaseRegister(basereg,currentScope,x.scope);
  8879. InitOperand(result,ModeReference);
  8880. result.op := basereg;
  8881. END;
  8882. IF IsOpenArray(type) THEN
  8883. result.tag := basereg;
  8884. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8885. IntermediateCode.MakeMemory(result.op,addressType);
  8886. IF Global.IsOberonProcedure(x.ownerType) THEN
  8887. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8888. UseIntermediateOperand(result.tag);
  8889. ELSE
  8890. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8891. END;
  8892. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8893. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8894. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8895. ELSIF IsStaticArray(type) THEN
  8896. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8897. IntermediateCode.MakeMemory(result.op,addressType);
  8898. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8899. ELSIF type IS SyntaxTree.MathArrayType THEN
  8900. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8901. WITH type: SyntaxTree.MathArrayType DO
  8902. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8903. IF type.form = SyntaxTree.Tensor THEN
  8904. ELSIF type.form = SyntaxTree.Open THEN
  8905. result.tag := result.op;
  8906. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8907. IntermediateCode.MakeMemory(result.op,addressType);
  8908. UseIntermediateOperand(result.tag);
  8909. ELSIF type.form = SyntaxTree.Static THEN
  8910. IF x.kind = SyntaxTree.ConstParameter THEN
  8911. IntermediateCode.MakeMemory(result.op,addressType);
  8912. END;
  8913. ELSE HALT(100)
  8914. END;
  8915. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8916. IF type.form = SyntaxTree.Tensor THEN
  8917. ToMemory(result.op,addressType,0);
  8918. ELSIF type.form = SyntaxTree.Open THEN
  8919. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8920. ReuseCopy(result.tag, mem);
  8921. ReleaseIntermediateOperand(mem);
  8922. ReleaseIntermediateOperand(result.op);
  8923. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8924. ELSIF type.form = SyntaxTree.Static THEN
  8925. IntermediateCode.MakeMemory(result.op,addressType);
  8926. ELSE HALT(100)
  8927. END;
  8928. ELSE HALT(100)
  8929. END;
  8930. END;
  8931. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8932. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8933. IntermediateCode.MakeMemory(result.op,addressType);
  8934. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8935. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8936. END;
  8937. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8938. ValueToCondition(result);
  8939. ELSIF type IS SyntaxTree.ProcedureType THEN
  8940. ReleaseIntermediateOperand(result.tag);
  8941. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8942. IF x.kind = SyntaxTree.VarParameter THEN
  8943. ReuseCopy(result.tag,result.op);
  8944. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8945. IntermediateCode.MakeMemory(result.tag,addressType);
  8946. ELSE
  8947. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8948. UseIntermediateOperand(result.tag);
  8949. END;
  8950. ELSE
  8951. result.tag := nil;
  8952. END;
  8953. (* tag for pointer type computed not here but during dereferencing *)
  8954. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  8955. ReleaseIntermediateOperand(result.tag);
  8956. result.tag := basereg;
  8957. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8958. IntermediateCode.MakeMemory(result.tag,addressType);
  8959. UseIntermediateOperand(result.tag);
  8960. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  8961. ReleaseIntermediateOperand(result.tag);
  8962. result.tag := TypeDescriptorAdr(type);
  8963. IF ~newObjectFile THEN
  8964. IntermediateCode.MakeMemory(result.tag,addressType);
  8965. END;
  8966. UseIntermediateOperand(result.tag);
  8967. END;
  8968. IF Trace THEN TraceExit("VisitParameter") END;
  8969. END VisitParameter;
  8970. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8971. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8972. BEGIN
  8973. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8974. (* left.p: left already emitted *)
  8975. tag := result.op; (* value of pointer to left *)
  8976. (* get type desc *)
  8977. tmp := result.tag;
  8978. IntermediateCode.MakeMemory(tmp,addressType);
  8979. (* get method adr *)
  8980. Reuse1(reg,tmp);
  8981. ReleaseIntermediateOperand(tmp);
  8982. IF backend.cooperative THEN
  8983. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8984. WHILE recordType.baseType # NIL DO
  8985. recordType := recordType.GetBaseRecord ();
  8986. END;
  8987. GetRecordTypeName (recordType,name);
  8988. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8989. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8990. offset := 0;
  8991. ELSE
  8992. offset := 2;
  8993. END;
  8994. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8995. ELSE
  8996. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8997. END;
  8998. InitOperand(operand,ModeReference);
  8999. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9000. operand.op := reg;
  9001. operand.tag := tag;
  9002. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9003. END DynamicCallOperand;
  9004. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9005. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9006. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9007. BEGIN
  9008. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9009. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9010. tag := operand.op;
  9011. ReleaseIntermediateOperand(operand.tag);
  9012. ELSE tag := nil
  9013. END;
  9014. IF x.isInline THEN
  9015. sectionType := Sections.InlineCodeSection;
  9016. ELSE
  9017. sectionType := Sections.CodeSection;
  9018. END;
  9019. IF x.externalName # NIL THEN
  9020. Basic.ToSegmentedName(x.externalName^, name);
  9021. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9022. ELSE
  9023. GetCodeSectionNameForSymbol(x, name);
  9024. IF (x.scope.ownerModule = module.module) THEN
  9025. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9026. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9027. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9028. IF source.pc = 0 THEN (* no code yet *)
  9029. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9030. END;
  9031. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9032. bits := x.procedureScope.body.code.inlineCode;
  9033. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9034. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9035. binary.CopyBits(bits, 0, bits.GetSize());
  9036. source.SetResolved(binary);
  9037. ELSE
  9038. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9039. END;
  9040. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9041. END;
  9042. InitOperand(operand,ModeValue);
  9043. operand.op := reg;
  9044. operand.tag := tag;
  9045. IF Trace THEN TraceExit("StaticCallOperand") END;
  9046. END StaticCallOperand;
  9047. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9048. (* handle expressions of the form designator.procedure or procedure *)
  9049. BEGIN
  9050. IF Trace THEN TraceEnter("VisitProcedure") END;
  9051. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9052. DynamicCallOperand(result,x);
  9053. ELSIF x.isInline THEN
  9054. StaticCallOperand(result,x);
  9055. ELSE
  9056. StaticCallOperand(result,x);
  9057. END;
  9058. IF Trace THEN TraceExit("VisitProcedure") END;
  9059. END VisitProcedure;
  9060. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9061. BEGIN
  9062. VisitProcedure(x);
  9063. END VisitOperator;
  9064. (** statements *)
  9065. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9066. BEGIN
  9067. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9068. Expression(x.call);
  9069. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9070. ReleaseOperand(result)
  9071. END;
  9072. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9073. END VisitProcedureCallStatement;
  9074. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9075. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9076. leftBase, rightBase: SyntaxTree.Type;
  9077. procedureName,s: SyntaxTree.IdentifierString;
  9078. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9079. size: LONGINT; rightKind: LONGINT;
  9080. dummy: IntermediateCode.Operand;
  9081. CONST moduleName = "FoxArrayBase";
  9082. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9083. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9084. BEGIN
  9085. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9086. IF base IS SyntaxTree.MathArrayType THEN
  9087. base := OpenArray(base(SyntaxTree.MathArrayType));
  9088. END;
  9089. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9090. result.SetArrayBase(base);
  9091. RETURN result
  9092. END OpenArray;
  9093. BEGIN
  9094. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9095. SaveRegisters();ReleaseUsedRegisters(saved);
  9096. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9097. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9098. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9099. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9100. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9101. IF leftType.form = SyntaxTree.Tensor THEN
  9102. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9103. ELSIF leftType.form = SyntaxTree.Open THEN
  9104. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9105. ELSIF leftType.form = SyntaxTree.Static THEN
  9106. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9107. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9108. END;
  9109. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9110. IF procedure = NIL THEN
  9111. s := "Instruction not supported on target, emulation procedure ";
  9112. Strings.Append(s,moduleName);
  9113. Strings.Append(s,".");
  9114. Strings.Append(s,procedureName);
  9115. Strings.Append(s," not present");
  9116. Error(position,s);
  9117. ELSE
  9118. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9119. parameter.SetType(leftType);
  9120. parameter.SetAccess(SyntaxTree.Internal);
  9121. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9122. parameter.SetKind(rightKind);
  9123. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9124. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9125. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9126. StaticCallOperand(result,procedure);
  9127. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  9128. ReleaseOperand(result);
  9129. END;
  9130. RestoreRegisters(saved);
  9131. END;
  9132. END AssignMathArray;
  9133. VAR modifyAssignmentCounter := 0: LONGINT;
  9134. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9135. VAR processor,mem,dst: IntermediateCode.Operand;
  9136. BEGIN
  9137. IF value.intValue = true.intValue THEN
  9138. INC(modifyAssignmentCounter);
  9139. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9140. modifyAssignmentsPC := section.pc;
  9141. ELSE
  9142. DEC(modifyAssignmentCounter);
  9143. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9144. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9145. END;
  9146. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9147. dst := NewRegisterOperand (addressType);
  9148. Emit(Mov(position,dst, processor));
  9149. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9150. Emit(Mov(position,mem, value));
  9151. ReleaseIntermediateOperand(dst);
  9152. END ModifyAssignments;
  9153. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9154. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9155. BEGIN
  9156. type := left.type.resolved;
  9157. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9158. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9159. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9160. IF procedureType.returnParameter = parameter THEN
  9161. (* this is the only case where the destination can be dynamically smaller than the source
  9162. in all other cases the dynamic size has to be taken
  9163. *)
  9164. IF backend.cooperative THEN
  9165. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9166. ELSE
  9167. MakeMemory(mem, tag, addressType, 0);
  9168. END;
  9169. RETURN mem;
  9170. END;
  9171. END;
  9172. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9173. END CopySize;
  9174. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9175. VAR
  9176. leftO, rightO: Operand;
  9177. arg,mem, sizeOp: IntermediateCode.Operand;
  9178. leftType, rightType, componentType, base: SyntaxTree.Type;
  9179. size: LONGINT;
  9180. parameters: SyntaxTree.ExpressionList;
  9181. procedure: SyntaxTree.Procedure;
  9182. call: SyntaxTree.ProcedureCallDesignator;
  9183. designator: SyntaxTree.Designator;
  9184. saved: RegisterEntry;
  9185. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9186. VAR procedureType: SyntaxTree.ProcedureType;
  9187. BEGIN
  9188. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9189. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9190. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9191. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9192. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9193. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9194. IF right.id = Global.Reshape THEN RETURN TRUE
  9195. END;
  9196. END;
  9197. END;
  9198. END;
  9199. RETURN FALSE
  9200. END CanPassAsResultParameter;
  9201. BEGIN
  9202. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9203. leftType := left.type.resolved; rightType:= right.type.resolved;
  9204. IF backend.cooperative & left.NeedsTrace() THEN
  9205. ModifyAssignments(true);
  9206. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9207. Designate(right, rightO);
  9208. Designate(left, leftO);
  9209. ASSERT(leftO.mode = ModeReference);
  9210. TransferToRegister(leftO.op, leftO.op);
  9211. TransferToRegister(rightO.op, rightO.op);
  9212. Emit(Push(position, leftO.op));
  9213. Emit(Push(position, rightO.op));
  9214. CallAssignMethod(leftO.op, rightO.op, left.type);
  9215. Emit(Pop(position, rightO.op));
  9216. Emit(Pop(position, leftO.op));
  9217. sizeOp := CopySize(left, leftO.tag);
  9218. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9219. ReleaseIntermediateOperand(sizeOp);
  9220. ReleaseOperand(leftO);
  9221. ReleaseOperand(rightO);
  9222. ELSE
  9223. Evaluate(right,rightO);
  9224. Designate(left,leftO);
  9225. ASSERT(leftO.mode = ModeReference);
  9226. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9227. (* copy procedure address first *)
  9228. MakeMemory(mem,leftO.op,addressType,0);
  9229. Emit(Mov(position,mem,rightO.op));
  9230. ReleaseIntermediateOperand(mem);
  9231. (* copy pointer address *)
  9232. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9233. CallAssignPointer(leftO.tag, rightO.tag);
  9234. ELSE
  9235. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9236. CallAssignPointer(leftO.op, rightO.op);
  9237. END;
  9238. ReleaseOperand(leftO);
  9239. ReleaseOperand(rightO);
  9240. END;
  9241. ModifyAssignments(false);
  9242. RETURN;
  9243. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9244. SaveRegisters();ReleaseUsedRegisters(saved);
  9245. IF SemanticChecker.IsPointerType(leftType) THEN
  9246. Evaluate(right,rightO);
  9247. Designate(left,leftO);
  9248. Emit(Push(position,leftO.op));
  9249. ReleaseOperand(leftO);
  9250. Emit(Push(position,rightO.op));
  9251. ReleaseOperand(rightO);
  9252. CallThis(position,"Heaps","Assign",2);
  9253. ELSIF leftType.IsRecordType() THEN
  9254. Designate(right,rightO);
  9255. Designate(left,leftO);
  9256. Emit(Push(position,leftO.op));
  9257. Emit(Push(position,leftO.tag)); (* type desc *)
  9258. ReleaseOperand(leftO);
  9259. Emit(Push(position,rightO.op));
  9260. ReleaseOperand(rightO);
  9261. CallThis(position,"Heaps","AssignRecord",3);
  9262. ELSIF IsStaticArray(leftType) THEN
  9263. size := StaticArrayNumElements(leftType);
  9264. base := StaticArrayBaseType(leftType);
  9265. Designate(right,rightO);
  9266. Designate(left,leftO);
  9267. Emit(Push(position,leftO.op));
  9268. ReleaseOperand(leftO);
  9269. arg := TypeDescriptorAdr(base);
  9270. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9271. Emit(Push(position,arg));
  9272. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9273. Emit(Push(position,rightO.op));
  9274. ReleaseOperand(rightO);
  9275. CallThis(position,"Heaps","AssignArray",4);
  9276. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9277. size := StaticMathArrayNumElements(leftType);
  9278. base := StaticMathArrayBaseType(leftType);
  9279. Designate(right,rightO);
  9280. Designate(left,leftO);
  9281. Emit(Push(position,leftO.op));
  9282. ReleaseOperand(leftO);
  9283. arg := TypeDescriptorAdr(base);
  9284. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9285. Emit(Push(position,arg));
  9286. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9287. Emit(Push(position,rightO.op));
  9288. ReleaseOperand(rightO);
  9289. CallThis(position,"Heaps","AssignArray",4);
  9290. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9291. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9292. Evaluate(right,rightO);
  9293. Designate(left,leftO);
  9294. MakeMemory(mem,leftO.op,addressType,0);
  9295. Emit(Mov(position,mem,rightO.op));
  9296. ReleaseIntermediateOperand(mem);
  9297. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9298. Emit (Push(position, leftO.tag));
  9299. ReleaseOperand(leftO);
  9300. Emit (Push(position, rightO.tag));
  9301. ReleaseOperand(rightO);
  9302. CallThis(position,"Heaps","Assign", 2);
  9303. ELSE HALT(100); (* missing ? *)
  9304. END;
  9305. RestoreRegisters(saved);
  9306. RETURN;
  9307. END;
  9308. IF CanPassAsResultParameter(right) THEN
  9309. procedureResultDesignator := left(SyntaxTree.Designator);
  9310. Expression(right);
  9311. procedureResultDesignator := NIL;
  9312. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9313. (* left <-- ALIAS OF right: zerocopy *)
  9314. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9315. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9316. designator.SetType(procedure.type);
  9317. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9318. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9319. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9320. END;
  9321. ELSIF leftType IS SyntaxTree.RangeType THEN
  9322. (* LHS is of array range type *)
  9323. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9324. Evaluate(right, rightO);
  9325. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9326. (* first *)
  9327. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9328. Emit(Mov(position,mem, rightO.op));
  9329. ReleaseIntermediateOperand(mem);
  9330. (* last *)
  9331. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9332. Emit(Mov(position,mem, rightO.tag));
  9333. ReleaseIntermediateOperand(mem);
  9334. (* step *)
  9335. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9336. Emit(Mov(position,mem, rightO.extra));
  9337. ReleaseIntermediateOperand(mem);
  9338. ReleaseOperand(rightO);
  9339. ReleaseOperand(leftO)
  9340. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9341. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9342. Evaluate(right, rightO);
  9343. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9344. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9345. (* real part *)
  9346. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9347. Emit(Mov(position,mem, rightO.op));
  9348. ReleaseIntermediateOperand(mem);
  9349. (* imaginary part *)
  9350. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9351. Emit(Mov(position,mem, rightO.tag));
  9352. ReleaseIntermediateOperand(mem);
  9353. ReleaseOperand(rightO);
  9354. ReleaseOperand(leftO)
  9355. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9356. OR (leftType IS SyntaxTree.PortType) THEN
  9357. (* rightO := leftO;*)
  9358. Evaluate(right,rightO);
  9359. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9360. Designate(left,leftO);
  9361. IF leftO.mode = ModeReference THEN
  9362. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9363. destination := mem;
  9364. ELSE
  9365. destination := leftO.op;
  9366. END;
  9367. ReleaseOperand(leftO);
  9368. IF destination.mode # IntermediateCode.Undefined THEN
  9369. Emit(Mov(position,destination,rightO.op));
  9370. END;
  9371. ReleaseOperand(rightO);
  9372. ReleaseIntermediateOperand(mem);
  9373. IntermediateCode.InitOperand(destination);
  9374. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9375. Evaluate(right,rightO);
  9376. Designate(left,leftO);
  9377. MakeMemory(mem,leftO.op,addressType,0);
  9378. Emit(Mov(position,mem,rightO.op));
  9379. ReleaseIntermediateOperand(mem);
  9380. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9381. (* delegate *)
  9382. (*
  9383. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9384. *)
  9385. Emit(Mov(position,leftO.tag,rightO.tag));
  9386. END;
  9387. ReleaseOperand(leftO);
  9388. ReleaseOperand(rightO);
  9389. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9390. Designate(right,rightO);
  9391. Designate(left,leftO);
  9392. sizeOp := CopySize(left, leftO.tag);
  9393. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9394. ReleaseIntermediateOperand(sizeOp);
  9395. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9396. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9397. IF (rightType IS SyntaxTree.StringType) THEN
  9398. CopyString(left,right);
  9399. 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
  9400. Designate(right,rightO);
  9401. Designate(left,leftO);
  9402. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9403. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9404. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9405. ELSE
  9406. HALT(201)
  9407. END;
  9408. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9409. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9410. Designate(right,rightO);
  9411. Designate(left,leftO);
  9412. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9413. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9414. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9415. ELSE
  9416. AssignMathArray(left,right);
  9417. END;
  9418. ELSE
  9419. HALT(200);
  9420. END;
  9421. END Assign;
  9422. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9423. BEGIN
  9424. IF Trace THEN TraceEnter("VisitAssignment") END;
  9425. Assign(x.left,x.right);
  9426. IF Trace THEN TraceExit("VisitAssignment") END;
  9427. END VisitAssignment;
  9428. PROCEDURE EmitCooperativeSwitch;
  9429. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9430. BEGIN
  9431. ASSERT (cooperativeSwitches);
  9432. pc := section.pc;
  9433. IF lastSwitchPC = section.pc THEN RETURN END;
  9434. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9435. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9436. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9437. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9438. INC(statCoopSwitch, section.pc - pc);
  9439. END EmitCooperativeSwitch;
  9440. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9441. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9442. BEGIN
  9443. p0 := communication.left; p1 := communication.right;
  9444. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9445. Evaluate(p0,s0);
  9446. Evaluate(p1,s1);
  9447. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9448. Emit(Push(position,s0.op));
  9449. Emit(Push(position,s1.op));
  9450. (*
  9451. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9452. *)
  9453. IF ~backend.cellsAreObjects THEN
  9454. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9455. END;
  9456. ReleaseOperand(s0);
  9457. ReleaseOperand(s1);
  9458. IF backend.cellsAreObjects THEN
  9459. CallThis(position,"ActiveCellsRuntime","Send",2);
  9460. ELSE
  9461. CallThis(position,ChannelModuleName,"Send",2);
  9462. END;
  9463. (* ----- RECEIVE ------*)
  9464. ELSE
  9465. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9466. tmp := p0; p0 := p1; p1 := tmp;
  9467. END;
  9468. Evaluate(p0,s0);
  9469. Emit(Push(position,s0.op));
  9470. Designate(p1,s1);
  9471. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9472. Emit(Push(position,s1.op));
  9473. (*
  9474. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9475. *)
  9476. IF ~backend.cellsAreObjects THEN
  9477. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9478. END;
  9479. ReleaseOperand(s0);
  9480. ReleaseOperand(s1);
  9481. IF backend.cellsAreObjects THEN
  9482. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9483. ELSE
  9484. CallThis(position,ChannelModuleName,"Receive",2)
  9485. END;
  9486. END;
  9487. END VisitCommunicationStatement;
  9488. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9489. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9490. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9491. VAR true, false: Label; condition, value: BOOLEAN;
  9492. BEGIN
  9493. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9494. IF condition THEN
  9495. true := NewLabel();
  9496. false := NewLabel();
  9497. Condition(if.condition,true,false);
  9498. SetLabel(true);
  9499. StatementSequence(if.statements);
  9500. BrL(end);
  9501. SetLabel(false);
  9502. ELSE
  9503. IF value THEN (* always true *)
  9504. escape := TRUE;
  9505. StatementSequence(if.statements);
  9506. (* no branch necessary -- rest skipped *)
  9507. END;
  9508. END;
  9509. END IfPart;
  9510. BEGIN
  9511. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9512. end := NewLabel();
  9513. elsifs := x.ElsifParts();
  9514. IfPart(x.ifPart);
  9515. FOR i := 0 TO elsifs-1 DO
  9516. IF ~escape THEN
  9517. elsif := x.GetElsifPart(i);
  9518. IfPart(elsif);
  9519. END;
  9520. END;
  9521. IF (x.elsePart # NIL) & ~escape THEN
  9522. StatementSequence(x.elsePart);
  9523. END;
  9524. SetLabel(end);
  9525. IF Trace THEN TraceExit("VisitIfStatement") END;
  9526. END VisitIfStatement;
  9527. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9528. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9529. BEGIN
  9530. (*IF x.variable.type.resolved = x.type.resolved THEN
  9531. (* always true, do nothing *)
  9532. ELSE*)
  9533. Designate(x.variable,res);
  9534. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9535. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9536. END;
  9537. trueL := NewLabel();
  9538. TypeTest(res.tag,x.type,trueL,falseL);
  9539. ReleaseOperand(res);
  9540. SetLabel(trueL);
  9541. StatementSequence(x.statements);
  9542. BrL(endL);
  9543. END WithPart;
  9544. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9545. VAR endL,falseL: Label;i: LONGINT;
  9546. BEGIN
  9547. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9548. endL := NewLabel();
  9549. FOR i := 0 TO x.WithParts()-1 DO
  9550. falseL := NewLabel();
  9551. WithPart(x.GetWithPart(i),falseL,endL);
  9552. SetLabel(falseL);
  9553. END;
  9554. IF x.elsePart = NIL THEN
  9555. IF ~isUnchecked THEN
  9556. EmitTrap(position,WithTrap);
  9557. END;
  9558. ELSE
  9559. StatementSequence(x.elsePart)
  9560. END;
  9561. SetLabel(endL);
  9562. IF Trace THEN TraceExit("VisitWithStatement") END;
  9563. END VisitWithStatement;
  9564. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9565. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9566. out,else: Label; label: Label;
  9567. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9568. symbol: SyntaxTree.Symbol;
  9569. BEGIN
  9570. (*! split case statement into if-elsif statements for large case label lists *)
  9571. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9572. size := x.max-x.min+1;
  9573. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9574. END;
  9575. Evaluate(x.variable,var);
  9576. ReuseCopy(tmp,var.op);
  9577. ReleaseIntermediateOperand(var.op);
  9578. var.op := tmp;
  9579. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9580. Convert(var.op,addressType);
  9581. size := x.max-x.min+1;
  9582. else := NewLabel();
  9583. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9584. (*
  9585. UniqueId(name,module.module,"case",caseId);
  9586. *)
  9587. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9588. Global.GetModuleSegmentedName(module.module, name);
  9589. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9590. symbol := SyntaxTree.NewSymbol(name[1]);
  9591. symbol.SetScope(moduleScope);
  9592. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9593. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9594. section.isCaseTable := TRUE;
  9595. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9596. ReuseCopy(res,var.op);
  9597. ReleaseOperand(var);
  9598. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9599. Emit(Add(position,res,res,jmp));
  9600. IntermediateCode.MakeMemory(res,addressType);
  9601. Emit(Br(position,res));
  9602. ReleaseIntermediateOperand(res);
  9603. out := NewLabel();
  9604. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9605. part := x.GetCasePart(i);
  9606. constant := part.firstConstant;
  9607. label := NewLabel();
  9608. SetLabel(label);
  9609. WHILE(constant # NIL) DO (* case labels for this case part *)
  9610. FOR j := constant.min TO constant.max DO
  9611. fixups[j-x.min] := label;
  9612. END;
  9613. constant := constant.next;
  9614. END;
  9615. StatementSequence(part.statements);
  9616. BrL(out);
  9617. END;
  9618. SetLabel(else);
  9619. FOR i := 0 TO size-1 DO
  9620. IF fixups[i] = NIL THEN
  9621. fixups[i] := else;
  9622. END;
  9623. END;
  9624. IF x.elsePart # NIL THEN
  9625. StatementSequence(x.elsePart);
  9626. ELSIF ~isUnchecked THEN
  9627. EmitTrap(position,CaseTrap);
  9628. END;
  9629. SetLabel(out);
  9630. FOR i := 0 TO size-1 DO
  9631. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9632. section.Emit(Data(position,op));
  9633. END;
  9634. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9635. END VisitCaseStatement;
  9636. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9637. VAR start: Label; true,false: Label;
  9638. BEGIN
  9639. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9640. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9641. start := NewLabel();
  9642. true := NewLabel();
  9643. false := NewLabel();
  9644. SetLabel(start);
  9645. Condition(x.condition,true,false);
  9646. SetLabel(true);
  9647. StatementSequence(x.statements);
  9648. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9649. BrL(start);
  9650. SetLabel(false);
  9651. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9652. END VisitWhileStatement;
  9653. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9654. VAR false,true: Label;
  9655. BEGIN
  9656. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9657. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9658. true := NewLabel();
  9659. false := NewLabel();
  9660. SetLabel(false);
  9661. StatementSequence(x.statements);
  9662. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9663. Condition(x.condition,true,false);
  9664. SetLabel(true);
  9665. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9666. END VisitRepeatStatement;
  9667. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9668. VAR
  9669. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9670. temporaryVariable: SyntaxTree.Variable;
  9671. temporaryVariableDesignator : SyntaxTree.Designator;
  9672. BEGIN
  9673. IF Trace THEN TraceEnter("VisitForStatement") END;
  9674. true := NewLabel();
  9675. false := NewLabel();
  9676. start := NewLabel();
  9677. Assign(x.variable,x.from);
  9678. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9679. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9680. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9681. Assign(temporaryVariableDesignator,x.to);
  9682. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9683. IF by > 0 THEN
  9684. cmp := Scanner.LessEqual
  9685. ELSE
  9686. cmp := Scanner.GreaterEqual
  9687. END;
  9688. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9689. binary.SetType(system.booleanType);
  9690. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9691. SetLabel(start);
  9692. Condition(binary,true,false);
  9693. SetLabel(true);
  9694. StatementSequence(x.statements);
  9695. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9696. binary.SetType(x.variable.type);
  9697. Assign(x.variable,binary);
  9698. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9699. BrL(start);
  9700. SetLabel(false);
  9701. IF Trace THEN TraceExit("VisitForStatement") END;
  9702. END VisitForStatement;
  9703. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9704. VAR prevLoop: Label;
  9705. BEGIN
  9706. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9707. prevLoop := currentLoop;
  9708. currentLoop := NewLabel();
  9709. StatementSequence(x.statements);
  9710. SetLabel(currentLoop);
  9711. currentLoop := prevLoop;
  9712. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9713. END VisitExitableBlock;
  9714. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9715. VAR prevLoop,start: Label;
  9716. BEGIN
  9717. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9718. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9719. start := NewLabel();
  9720. prevLoop := currentLoop;
  9721. SetLabel(start);
  9722. currentLoop := NewLabel();
  9723. StatementSequence(x.statements);
  9724. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9725. BrL(start);
  9726. SetLabel(currentLoop);
  9727. currentLoop := prevLoop;
  9728. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9729. END VisitLoopStatement;
  9730. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9731. VAR outer: SyntaxTree.Statement;
  9732. BEGIN
  9733. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9734. IF locked THEN (* r if we jump out of an exclusive block *)
  9735. outer := x.outer;
  9736. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9737. outer := outer.outer;
  9738. END;
  9739. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9740. Lock(FALSE);
  9741. END;
  9742. END;
  9743. BrL(currentLoop);
  9744. IF Trace THEN TraceExit("VisitExitStatement") END;
  9745. END VisitExitStatement;
  9746. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9747. VAR
  9748. expression, parameterDesignator: SyntaxTree.Expression;
  9749. type, componentType: SyntaxTree.Type;
  9750. res, right: Operand;
  9751. left, mem, reg: IntermediateCode.Operand;
  9752. parameter: SyntaxTree.Parameter;
  9753. procedure: SyntaxTree.Procedure;
  9754. procedureType: SyntaxTree.ProcedureType;
  9755. returnTypeOffset: LONGINT;
  9756. delegate: BOOLEAN;
  9757. map: SymbolMap;
  9758. cc, parametersSize: LONGINT;
  9759. BEGIN
  9760. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9761. expression := x.returnValue;
  9762. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9763. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9764. IF currentIsInline THEN
  9765. IF expression # NIL THEN
  9766. map := currentMapper.Get(NIL);
  9767. IF map # NIL THEN
  9768. Assign(map.to, expression);
  9769. ELSE
  9770. Evaluate(expression,res);
  9771. Emit(Return(position,res.op));
  9772. ReleaseOperand(res);
  9773. END;
  9774. END;
  9775. BrL(currentInlineExit);
  9776. RETURN;
  9777. END;
  9778. IF expression # NIL THEN
  9779. type := expression.type.resolved;
  9780. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9781. IF locked THEN Lock(FALSE) END;
  9782. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9783. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9784. ELSIF (type IS SyntaxTree.BasicType) & ~(type IS SyntaxTree.RangeType) & ~(type IS SyntaxTree.ComplexType) & ~type.IsPointer() OR (type IS SyntaxTree.EnumerationType) OR (procedureType.callingConvention # SyntaxTree.OberonCallingConvention) THEN
  9785. (* return without structured return parameter *)
  9786. Evaluate(expression,res);
  9787. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9788. IF locked OR profile THEN
  9789. Emit(Push(position,res.op));
  9790. IF delegate THEN HALT(200) END;
  9791. ReleaseOperand(res);
  9792. IF locked THEN Lock(FALSE) END;
  9793. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9794. reg := NewRegisterOperand(res.op.type);
  9795. Emit(Pop(position,reg));
  9796. Emit(Return(position,reg));
  9797. ReleaseIntermediateOperand(reg);
  9798. ELSE
  9799. Emit(Return(position,res.op));
  9800. ReleaseOperand(res);
  9801. END;
  9802. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9803. THEN
  9804. (* return using structured return parameter *)
  9805. 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)
  9806. OR SemanticChecker.IsPointerType(type));
  9807. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9808. parameter :=procedureType.returnParameter;
  9809. ASSERT(parameter # NIL);
  9810. returnTypeOffset := parameter.offsetInBits;
  9811. (*
  9812. IF parameter# NIL THEN
  9813. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9814. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9815. ELSE
  9816. returnTypeOffset := system.offsetFirstParameter
  9817. END;
  9818. *)
  9819. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9820. IF type IS SyntaxTree.RangeType THEN
  9821. (* array range type *)
  9822. Evaluate(expression, right);
  9823. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9824. Emit(Mov(position,mem, right.op)); (* first *)
  9825. ReleaseIntermediateOperand(mem);
  9826. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9827. Emit(Mov(position,mem, right.tag)); (* last *)
  9828. ReleaseIntermediateOperand(mem);
  9829. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9830. Emit(Mov(position,mem, right.extra)); (* step *)
  9831. ReleaseIntermediateOperand(mem);
  9832. ReleaseOperand(right);
  9833. ELSIF type IS SyntaxTree.ComplexType THEN
  9834. Evaluate(expression, right);
  9835. componentType := type(SyntaxTree.ComplexType).componentType;
  9836. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9837. Emit(Mov(position,mem, right.op)); (* real part *)
  9838. ReleaseIntermediateOperand(mem);
  9839. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9840. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9841. ReleaseIntermediateOperand(mem);
  9842. ReleaseOperand(right);
  9843. ELSE (* covers cases: pointer / record / array *)
  9844. parameter := procedureType.returnParameter;
  9845. checker.SetCurrentScope(currentScope);
  9846. ASSERT(parameter # NIL);
  9847. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9848. Assign(parameterDesignator,expression);
  9849. END;
  9850. ReleaseIntermediateOperand(left);
  9851. IF locked THEN Lock(FALSE) END;
  9852. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9853. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9854. parameter := procedureType.returnParameter;
  9855. checker.SetCurrentScope(currentScope);
  9856. IF parameter = NIL THEN
  9857. Error(procedure.position, "structured return of parameter of procedure not found");
  9858. ELSE
  9859. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9860. Assign(parameterDesignator,expression);
  9861. END;
  9862. IF locked THEN Lock(FALSE) END;
  9863. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9864. ELSE
  9865. HALT(200);
  9866. END;
  9867. ELSE
  9868. IF locked THEN Lock(FALSE) END;
  9869. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9870. END;
  9871. IF backend.cooperative THEN
  9872. BrL(exitLabel);
  9873. ELSE
  9874. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  9875. IF cc = SyntaxTree.WinAPICallingConvention THEN
  9876. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9877. ELSE
  9878. parametersSize := 0;
  9879. END;
  9880. EmitLeave(section, position,procedure, procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9881. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention, parametersSize));
  9882. END;
  9883. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9884. END VisitReturnStatement;
  9885. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9886. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9887. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9888. statements: SyntaxTree.StatementSequence;
  9889. name, suffix: SyntaxTree.IdentifierString;
  9890. BEGIN
  9891. Strings.IntToStr(awaitProcCounter,suffix);
  9892. Strings.Concat("@AwaitProcedure",suffix,name);
  9893. identifier := SyntaxTree.NewIdentifier(name);
  9894. INC(awaitProcCounter);
  9895. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9896. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9897. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9898. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9899. procedure.SetAccess(SyntaxTree.Hidden);
  9900. procedure.SetScope(currentScope);
  9901. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9902. procedureType.SetReturnType(system.booleanType);
  9903. procedure.SetType(procedureType);
  9904. body := SyntaxTree.NewBody(x.position,procedureScope);
  9905. procedureScope.SetBody(body);
  9906. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9907. returnStatement.SetReturnValue(x.condition);
  9908. statements := SyntaxTree.NewStatementSequence();
  9909. statements.AddStatement(returnStatement);
  9910. body.SetStatementSequence(statements);
  9911. currentScope.AddProcedure(procedure);
  9912. RETURN procedure
  9913. END MakeAwaitProcedure;
  9914. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  9915. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9916. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9917. BEGIN
  9918. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9919. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9920. IF backend.cooperative THEN
  9921. start := NewLabel();
  9922. true := NewLabel();
  9923. false := NewLabel();
  9924. SetLabel(start);
  9925. Condition(x.condition,true,false);
  9926. SetLabel(false);
  9927. PushSelfPointer();
  9928. CallThis(position,"ExclusiveBlocks","Await",1);
  9929. BrL(start);
  9930. SetLabel(true);
  9931. PushSelfPointer();
  9932. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9933. ELSE
  9934. proc := MakeAwaitProcedure(x);
  9935. Emit(Push(position,fp));
  9936. GetCodeSectionNameForSymbol(proc,name);
  9937. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9938. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9939. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9940. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9941. Emit(Result(position,res));
  9942. (*
  9943. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9944. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9945. *)
  9946. InitOperand(result,ModeValue);
  9947. result.op := res;
  9948. label := NewLabel();
  9949. BreqL(label, result.op, SELF.true);
  9950. ReleaseOperand(result);
  9951. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9952. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9953. Emit(Push(position,res));
  9954. Emit(Push(position,fp));
  9955. PushSelfPointer();
  9956. Emit(Push(position,nil));
  9957. CallThis(position,"Objects","Await",4);
  9958. SetLabel(label);
  9959. END;
  9960. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9961. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9962. END VisitAwaitStatement;
  9963. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9964. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9965. BEGIN
  9966. FOR i := 0 TO x.Length() - 1 DO
  9967. statement := x.GetStatement( i );
  9968. Statement(statement);
  9969. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9970. END;
  9971. END StatementSequence;
  9972. PROCEDURE PushSelfPointer;
  9973. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  9974. procedureType: SyntaxTree.ProcedureType;
  9975. BEGIN
  9976. scope := currentScope;
  9977. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9978. scope := scope.outerScope;
  9979. END;
  9980. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9981. IF ~newObjectFile THEN
  9982. Symbol(moduleSelf,op);
  9983. IntermediateCode.MakeMemory(op.op,addressType);
  9984. ELSE
  9985. moduleSection := meta.ModuleSection();
  9986. IF backend.cooperative THEN
  9987. moduleOffset := 0;
  9988. ELSE
  9989. moduleOffset := moduleSection.pc;
  9990. END;
  9991. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9992. END;
  9993. ELSE
  9994. GetBaseRegister(op.op,currentScope,scope);
  9995. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9996. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9997. parametersSize := ProcedureParametersSize(system,procedure);
  9998. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9999. IF backend.cooperative THEN
  10000. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  10001. END;
  10002. IntermediateCode.MakeMemory(op.op,addressType);
  10003. END;
  10004. Emit(Push(position,op.op));
  10005. ReleaseOperand(op);
  10006. END PushSelfPointer;
  10007. PROCEDURE Lock(lock: BOOLEAN);
  10008. BEGIN
  10009. IF Trace THEN TraceEnter("Lock") END;
  10010. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10011. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  10012. ASSERT(modifyAssignmentCounter = 0);
  10013. IF dump # NIL THEN
  10014. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  10015. dump.Ln;dump.Update;
  10016. END;
  10017. PushSelfPointer;
  10018. IF backend.cooperative THEN
  10019. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  10020. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  10021. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  10022. END;
  10023. ELSE
  10024. Emit(Push(position,true));
  10025. IF lock THEN CallThis(position,"Objects","Lock",2)
  10026. ELSE CallThis(position,"Objects","Unlock",2);
  10027. END;
  10028. END;
  10029. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10030. IF Trace THEN TraceExit("Lock") END;
  10031. END Lock;
  10032. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  10033. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  10034. BEGIN
  10035. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  10036. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10037. previouslyUnchecked := isUnchecked;
  10038. isUnchecked := isUnchecked OR x.isUnchecked;
  10039. previouslyCooperativeSwitches := cooperativeSwitches;
  10040. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  10041. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  10042. IF x.statements # NIL THEN
  10043. StatementSequence(x.statements);
  10044. END;
  10045. IF (x IS SyntaxTree.Body) THEN
  10046. IF (x(SyntaxTree.Body).finally # NIL) THEN
  10047. section.SetFinally(section.pc);
  10048. StatementSequence(x(SyntaxTree.Body).finally)
  10049. ELSIF x.isExclusive THEN
  10050. end := NewLabel();
  10051. BrL(end);
  10052. section.SetFinally(section.pc);
  10053. Lock(FALSE);
  10054. EmitTrap(position,RethrowTrap);
  10055. SetLabel(end);
  10056. END;
  10057. END;
  10058. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10059. isUnchecked := previouslyUnchecked;
  10060. cooperativeSwitches := previouslyCooperativeSwitches;
  10061. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10062. END VisitStatementBlock;
  10063. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10064. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10065. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10066. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10067. procedure: SyntaxTree.Procedure;
  10068. map: SymbolMap;
  10069. cc, parametersSize: LONGINT;
  10070. BEGIN
  10071. scope := currentScope;
  10072. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10073. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10074. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10075. return := emptyOperand;
  10076. IF Trace THEN TraceEnter("VisitCode") END;
  10077. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10078. NEW(in, x.inRules.Length());
  10079. FOR i := 0 TO LEN(in)-1 DO
  10080. statement := x.inRules.GetStatement(i);
  10081. WITH statement: SyntaxTree.Assignment DO
  10082. Evaluate(statement.right, operand);
  10083. result := operand.op;
  10084. NEW(str, 64);
  10085. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10086. in[i] := result; IntermediateCode.SetString(in[i], str);
  10087. ReleaseIntermediateOperand(operand.tag);
  10088. END;
  10089. END;
  10090. ELSE in := NIL
  10091. END;
  10092. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10093. NEW(out, x.outRules.Length());
  10094. FOR i := 0 TO LEN(out)-1 DO
  10095. statement := x.outRules.GetStatement(i);
  10096. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10097. WITH statement: SyntaxTree.Assignment DO
  10098. Designate(statement.left, operand);
  10099. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10100. NEW(str, 64);
  10101. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10102. out[i] := result; IntermediateCode.SetString(out[i], str);
  10103. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10104. |statement: SyntaxTree.ReturnStatement DO
  10105. NEW(str, 64);
  10106. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10107. IF currentIsInline THEN
  10108. map := currentMapper.Get(NIL);
  10109. Designate(map.to, operand);
  10110. IF map.isAddress THEN
  10111. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10112. ELSE
  10113. result := operand.op;
  10114. END;
  10115. (*! only if it does not fit into register
  10116. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10117. *)
  10118. (*Evaluate(map.to, operand);*)
  10119. out[i] := result;
  10120. ELSE
  10121. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10122. END;
  10123. IntermediateCode.SetString(out[i], str);
  10124. ReleaseIntermediateOperand(operand.tag);
  10125. return := out[i];
  10126. ELSE
  10127. END;
  10128. END;
  10129. ELSE out := NIL
  10130. END;
  10131. Emit(Asm(x.position,x.sourceCode, in, out));
  10132. IF in # NIL THEN
  10133. FOR i := 0 TO LEN(in)-1 DO
  10134. ReleaseIntermediateOperand(in[i]);
  10135. END;
  10136. END;
  10137. IF out # NIL THEN
  10138. FOR i := 0 TO LEN(out)-1 DO
  10139. WITH statement: SyntaxTree.Assignment DO
  10140. ReleaseIntermediateOperand(out[i]);
  10141. |statement: SyntaxTree.ReturnStatement DO
  10142. (* release happens below *)
  10143. ELSE
  10144. END;
  10145. statement := x.outRules.GetStatement(i);
  10146. END;
  10147. END;
  10148. IF return.mode # IntermediateCode.Undefined THEN
  10149. IF currentIsInline THEN
  10150. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10151. Symbol(procedureType.returnParameter, par);
  10152. MakeMemory(mem, par.op, return.type, 0);
  10153. ReleaseOperand(par);
  10154. Emit(Mov(position, mem, return));
  10155. ReleaseIntermediateOperand(mem);
  10156. ELSE
  10157. Emit(Return(position,return));
  10158. END;
  10159. ReleaseIntermediateOperand(return);
  10160. IF currentIsInline THEN RETURN END;
  10161. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10162. IF cc = SyntaxTree.WinAPICallingConvention THEN
  10163. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10164. ELSE
  10165. parametersSize := 0;
  10166. END;
  10167. EmitLeave(section, position,procedure, cc);
  10168. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,cc, parametersSize));
  10169. END;
  10170. IF Trace THEN TraceExit("VisitCode") END;
  10171. END VisitCode;
  10172. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10173. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10174. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10175. const, call: IntermediateCode.Operand;
  10176. parameterDesignator: SyntaxTree.Expression;
  10177. saved: RegisterEntry;
  10178. name: Basic.SegmentedName;
  10179. BEGIN
  10180. IF Trace THEN TraceEnter("ParameterCopies") END;
  10181. parameter := x.firstParameter;
  10182. WHILE parameter # NIL DO
  10183. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10184. type := parameter.type.resolved;
  10185. IF IsOpenArray(type) THEN
  10186. VisitParameter(parameter);
  10187. op := result;
  10188. IF backend.cooperative & parameter.NeedsTrace() THEN
  10189. length := GetArrayLength(type, op.tag);
  10190. size := NewRegisterOperand(addressType);
  10191. base := ArrayBaseType(type);
  10192. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10193. Emit(Mul(position, size, length, const));
  10194. dst := NewRegisterOperand (addressType);
  10195. Emit(Mov(position, dst, size));
  10196. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10197. Emit(Sub(position,dst,sp,dst));
  10198. Emit(And(position,dst,dst,const));
  10199. Emit(Mov(position,sp,dst));
  10200. par := fp;
  10201. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10202. IntermediateCode.InitImmediate(null, byteType, 0);
  10203. Emit(Fill(position, dst, size, null));
  10204. ReleaseIntermediateOperand(dst);
  10205. ReleaseIntermediateOperand(length);
  10206. SaveRegisters();ReleaseUsedRegisters(saved);
  10207. (* register dst has been freed before SaveRegisters already *)
  10208. base := ArrayBaseType(type);
  10209. (* assign method of open array *)
  10210. IF base.IsRecordType() THEN
  10211. Emit (Push(position, length));
  10212. Emit (Push(position, dst));
  10213. Emit (Push(position, op.op));
  10214. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10215. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10216. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10217. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10218. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10219. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10220. Emit (Push(position,length));
  10221. Emit (Push(position, dst));
  10222. Emit (Push(position, length));
  10223. Emit (Push(position, op.op));
  10224. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10225. ELSE
  10226. Emit (Push(position, length));
  10227. Emit (Push(position, dst));
  10228. Emit (Push(position, length));
  10229. Emit (Push(position, op.op));
  10230. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10231. ASSERT(ArrayBaseType(type).IsPointer());
  10232. END;
  10233. RestoreRegisters(saved);
  10234. ELSE
  10235. temp := GetDynamicSize(type,op.tag);
  10236. ReuseCopy(size,temp);
  10237. ReleaseIntermediateOperand(temp);
  10238. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10239. Emit(Sub(position,size,sp,size));
  10240. Emit(And(position,size,size,const));
  10241. Emit(Mov(position,sp,size));
  10242. par := fp;
  10243. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10244. ReleaseIntermediateOperand(size);
  10245. size := GetDynamicSize(type,op.tag);
  10246. END;
  10247. Emit(Copy(position,sp,op.op,size));
  10248. ReleaseIntermediateOperand(size);
  10249. ReleaseOperand(op);
  10250. IntermediateCode.MakeMemory(par,addressType);
  10251. Emit(Mov(position,par,sp));
  10252. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10253. checker.SetCurrentScope(currentScope);
  10254. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10255. Assign(parameterDesignator,parameterDesignator);
  10256. END;
  10257. END;
  10258. parameter := parameter.nextParameter;
  10259. END;
  10260. IF Trace THEN TraceExit("ParameterCopies") END;
  10261. END ParameterCopies;
  10262. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10263. VAR x: SyntaxTree.Variable;
  10264. BEGIN
  10265. x := scope.firstVariable;
  10266. WHILE x # NIL DO
  10267. InitVariable(x,FALSE);
  10268. x := x.nextVariable;
  10269. END;
  10270. END InitVariables;
  10271. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10272. BEGIN
  10273. IF (symbol # NIL) THEN
  10274. RETURN fingerPrinter.SymbolFP(symbol).public
  10275. ELSE
  10276. RETURN 0
  10277. END;
  10278. END GetFingerprint;
  10279. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10280. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10281. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10282. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10283. name: Basic.SegmentedName;
  10284. offset: LONGINT;
  10285. BEGIN
  10286. IF Trace THEN TraceEnter("Body") END;
  10287. ReleaseUsedRegisters(saved); (* just in case ... *)
  10288. section := ir;
  10289. exitLabel := NewLabel ();
  10290. IF moduleBody THEN moduleBodySection := section END;
  10291. IF ir.comments # NIL THEN
  10292. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10293. commentPrintout.SingleStatement(TRUE);
  10294. dump := ir.comments;
  10295. ELSE
  10296. commentPrintout := NIL;
  10297. dump := NIL;
  10298. END;
  10299. prevScope := currentScope;
  10300. currentScope := scope;
  10301. lastSwitchPC := 0;
  10302. cooperativeSwitches := backend.cooperative;
  10303. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10304. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10305. IF x # NIL THEN
  10306. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10307. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10308. IF moduleBody THEN
  10309. ProfilerInit();
  10310. ELSE
  10311. Basic.SegmentedNameToString(ir.name, string);
  10312. ProfilerAddProcedure(numberProcedures,string);
  10313. ProfilerEnterExit(numberProcedures,TRUE);
  10314. END;
  10315. END;
  10316. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10317. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10318. END;
  10319. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10320. IF moduleBody & ~newObjectFile THEN
  10321. InitVariables(moduleScope)
  10322. END;
  10323. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10324. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10325. IF procedure = cellScope.bodyProcedure THEN
  10326. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10327. StaticCallOperand(op, cellScope.constructor);
  10328. Emit(Call(position,op.op,0));
  10329. END;
  10330. END;
  10331. END;
  10332. InitVariables(scope);
  10333. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10334. GetCodeSectionNameForSymbol(procedure, name);
  10335. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10336. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10337. IF ProtectModulesPointers THEN
  10338. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10339. ELSE
  10340. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10341. END;
  10342. IntermediateCode.SetOffset(right,offset); (* tag *)
  10343. IntermediateCode.InitMemory(left,addressType,fp,0);
  10344. Emit(Mov(position, left, right));
  10345. END;
  10346. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10347. ParameterCopies(procedureType);
  10348. IF x.code = NIL THEN
  10349. VisitStatementBlock(x);
  10350. ELSE
  10351. VisitCode(x.code)
  10352. END;
  10353. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10354. IF ~backend.cooperative THEN
  10355. ProfilerEnterExit(numberProcedures,FALSE);
  10356. END;
  10357. INC(numberProcedures);
  10358. END;
  10359. END;
  10360. IF backend.cooperative THEN
  10361. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10362. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10363. END;
  10364. IF x # NIL THEN
  10365. SELF.position := x.position;
  10366. END;
  10367. CheckRegistersFree();
  10368. ASSERT(modifyAssignmentCounter = 0);
  10369. currentScope := prevScope;
  10370. IF Trace THEN TraceExit("Body") END;
  10371. END Body;
  10372. END ImplementationVisitor;
  10373. MetaDataGenerator=OBJECT
  10374. VAR
  10375. implementationVisitor: ImplementationVisitor;
  10376. declarationVisitor: DeclarationVisitor;
  10377. module: Sections.Module;
  10378. moduleName: ARRAY 128 OF CHAR;
  10379. moduleNamePool: Basic.HashTableInt;
  10380. moduleNamePoolSection: IntermediateCode.Section;
  10381. modulePointerSection: IntermediateCode.Section;
  10382. modulePointerSizePC: LONGINT;
  10383. modulePointerSectionOffset: LONGINT;
  10384. modulePointers: LONGINT;
  10385. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  10386. RecordBaseOffset: LONGINT;
  10387. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10388. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10389. TypeTags: LONGINT; (* type extension level support *)
  10390. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10391. patchInfoPC: LONGINT;
  10392. patchCRC: LONGINT;
  10393. CONST
  10394. EmptyBlockOffset = 2;
  10395. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10396. BEGIN
  10397. IF implementationVisitor.backend.cooperative THEN
  10398. TypeTags := MAX(LONGINT);
  10399. BaseTypesTableOffset := 0;
  10400. MethodTableOffset := 2;
  10401. TypeRecordBaseOffset := 0;
  10402. RecordBaseOffset := 0;
  10403. ELSIF simple THEN
  10404. TypeTags := 3; (* only 3 extensions allowed *)
  10405. BaseTypesTableOffset := 1;
  10406. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10407. TypeRecordBaseOffset := 0;
  10408. RecordBaseOffset := 1;
  10409. ELSE
  10410. TypeTags := 16;
  10411. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10412. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10413. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10414. (* change this when Heaps.HeapBlock is modified *)
  10415. RecordBaseOffset := 8;
  10416. END;
  10417. SELF.simple := simple;
  10418. SELF.implementationVisitor := implementationVisitor;
  10419. SELF.declarationVisitor := declarationVisitor;
  10420. implementationVisitor.meta := SELF;
  10421. declarationVisitor.meta := SELF;
  10422. END InitMetaDataGenerator;
  10423. PROCEDURE SetModule(module: Sections.Module);
  10424. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10425. BEGIN
  10426. SELF.module := module;
  10427. Global.GetModuleName(module.module,moduleName);
  10428. Global.GetSymbolSegmentedName(module.module, name);
  10429. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple & ~implementationVisitor.backend.cooperative THEN
  10430. NEW(moduleNamePool, 32);
  10431. (*! require GC protection *)
  10432. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10433. IF ProtectModulesPointers THEN
  10434. name := "Heaps.AnyPtr";
  10435. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10436. (* set base pointer *)
  10437. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10438. END;
  10439. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10440. modulePointers := 0;
  10441. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10442. AddPointer(moduleNamePoolSection, namePoolOffset);
  10443. END;
  10444. END SetModule;
  10445. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10446. BEGIN
  10447. IF ~implementationVisitor.backend.cooperative THEN
  10448. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10449. INC(modulePointers);
  10450. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10451. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10452. END;
  10453. END AddPointer;
  10454. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10455. BEGIN
  10456. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10457. END GetTypeRecordBaseOffset;
  10458. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10459. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10460. BEGIN
  10461. (* change this when Heaps.HeapBlock is modified *)
  10462. INC(dataAdrOffset,6);
  10463. Info(section,"headerAdr");
  10464. Address(section,0);
  10465. Info(section,"typeDesc");
  10466. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10467. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10468. NamedSymbol(section, name, symbol, 0, offset);
  10469. Info(section,"mark: LONGINT;");
  10470. Longint(section,-1);
  10471. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10472. Info(section,"dataAdr-: ADDRESS");
  10473. Symbol(section,section, dataAdrOffset,0);
  10474. Info(section,"size-: SIZE");
  10475. Address(section,0);
  10476. Info(section,"nextMark: HeapBlock;");
  10477. Address(section,0);
  10478. END HeapBlock;
  10479. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10480. VAR i: LONGINT;
  10481. BEGIN
  10482. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10483. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10484. Info(section,"count*: LONGINT");
  10485. Longint(section,0);
  10486. Info(section,"locked*: BOOLEAN");
  10487. Longint(section,0);
  10488. Info(section,"awaitingLock*: ProcessQueue");
  10489. Address(section,0);
  10490. Address(section,0);
  10491. Info(section,"awaitingCond*: ProcessQueue");
  10492. Address(section,0);
  10493. Address(section,0);
  10494. Info(section,"lockedBy*: ANY");
  10495. Address(section,0);
  10496. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10497. Longint(section,1);
  10498. FOR i := 2 TO 6 DO
  10499. Longint(section,0);
  10500. END;
  10501. Info(section,"lock*: ANY");
  10502. Address(section,0);
  10503. END ProtectedHeapBlock;
  10504. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10505. BEGIN
  10506. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10507. END Info;
  10508. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10509. VAR op: IntermediateCode.Operand;
  10510. BEGIN
  10511. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10512. section.Emit(Data(Basic.invalidPosition,op));
  10513. END Address;
  10514. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10515. VAR op: IntermediateCode.Operand;
  10516. BEGIN
  10517. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10518. section.Emit(Data(Basic.invalidPosition,op));
  10519. END Size;
  10520. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10521. VAR op: IntermediateCode.Operand;
  10522. BEGIN
  10523. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10524. section.Emit(Data(Basic.invalidPosition,op));
  10525. END Set;
  10526. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10527. VAR op: IntermediateCode.Operand;
  10528. BEGIN
  10529. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10530. section.Emit(Data(Basic.invalidPosition,op));
  10531. END Longint;
  10532. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10533. VAR op,noOperand: IntermediateCode.Operand;
  10534. BEGIN
  10535. IntermediateCode.InitOperand(noOperand);
  10536. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10537. section.PatchOperands(pc,op,noOperand,noOperand);
  10538. END PatchAddress;
  10539. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10540. VAR op,noOperand: IntermediateCode.Operand;
  10541. BEGIN
  10542. IntermediateCode.InitOperand(noOperand);
  10543. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10544. section.PatchOperands(pc,op,noOperand,noOperand);
  10545. END PatchSize;
  10546. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10547. VAR op,noOperand: IntermediateCode.Operand;
  10548. BEGIN
  10549. IntermediateCode.InitOperand(noOperand);
  10550. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10551. section.PatchOperands(pc,op,noOperand,noOperand);
  10552. END PatchLongint;
  10553. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10554. VAR op, noOperand: IntermediateCode.Operand;
  10555. BEGIN
  10556. IntermediateCode.InitOperand(noOperand);
  10557. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10558. section.PatchOperands(pc,op,noOperand,noOperand);
  10559. END PatchSymbol;
  10560. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10561. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10562. BEGIN
  10563. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10564. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10565. section.Emit(Data(Basic.invalidPosition,op));
  10566. END Boolean;
  10567. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10568. VAR op: IntermediateCode.Operand;
  10569. BEGIN
  10570. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10571. section.Emit(Data(Basic.invalidPosition,op));
  10572. END Char;
  10573. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10574. VAR op: IntermediateCode.Operand;
  10575. BEGIN
  10576. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10577. section.Emit(Data(Basic.invalidPosition,op));
  10578. END Integer;
  10579. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10580. VAR i: LONGINT;
  10581. BEGIN
  10582. Info(section,str);
  10583. i := 0;
  10584. WHILE(str[i] # 0X) DO
  10585. Char(section,str[i]);
  10586. INC(i);
  10587. END;
  10588. Char(section,0X);
  10589. END String;
  10590. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10591. VAR s: Basic.SectionName;
  10592. BEGIN
  10593. StringPool.GetString(str, s);
  10594. String(section, s);
  10595. END String0;
  10596. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10597. VAR op: IntermediateCode.Operand;
  10598. BEGIN
  10599. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10600. IntermediateCode.SetOffset(op,realOffset);
  10601. section.Emit(Data(Basic.invalidPosition,op));
  10602. END NamedSymbol;
  10603. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10604. VAR op: IntermediateCode.Operand;
  10605. BEGIN
  10606. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10607. IntermediateCode.SetOffset(op,realOffset);
  10608. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10609. END NamedSymbolAt;
  10610. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10611. BEGIN
  10612. IF symbol= NIL THEN
  10613. Address( section, realOffset);
  10614. ASSERT(virtualOffset = 0);
  10615. ELSE
  10616. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10617. END;
  10618. END Symbol;
  10619. (* OutPointers delivers
  10620. {pointerOffset}
  10621. *)
  10622. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10623. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10624. BEGIN
  10625. type := type.resolved;
  10626. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10627. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10628. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10629. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10630. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10631. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10632. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10633. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10634. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10635. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10636. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10637. ELSIF (type IS SyntaxTree.RecordType) THEN
  10638. (* never treat a record like a pointer, even if the pointer field is set! *)
  10639. WITH type: SyntaxTree.RecordType DO
  10640. base := type.GetBaseRecord();
  10641. IF base # NIL THEN
  10642. Pointers(offset,symbol,section, base,numberPointers);
  10643. END;
  10644. variable := type.recordScope.firstVariable;
  10645. WHILE(variable # NIL) DO
  10646. IF ~(variable.untraced) THEN
  10647. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10648. END;
  10649. variable := variable.nextVariable;
  10650. END;
  10651. END;
  10652. ELSIF (type IS SyntaxTree.CellType) THEN
  10653. WITH type: SyntaxTree.CellType DO
  10654. base := type.GetBaseRecord();
  10655. IF base # NIL THEN
  10656. Pointers(offset,symbol,section, base,numberPointers);
  10657. END;
  10658. variable := type.cellScope.firstVariable;
  10659. WHILE(variable # NIL) DO
  10660. IF ~(variable.untraced) THEN
  10661. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10662. END;
  10663. variable := variable.nextVariable;
  10664. END;
  10665. property := type.firstProperty;
  10666. WHILE(property # NIL) DO
  10667. IF ~(property.untraced) THEN
  10668. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10669. END;
  10670. property := property.nextProperty;
  10671. END;
  10672. parameter := type.firstParameter;
  10673. WHILE(parameter # NIL) DO
  10674. IF ~(parameter.untraced) THEN
  10675. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10676. END;
  10677. parameter := parameter.nextParameter;
  10678. END;
  10679. END;
  10680. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10681. WITH type: SyntaxTree.ArrayType DO
  10682. IF type.form= SyntaxTree.Static THEN
  10683. n := type.staticLength;
  10684. base := type.arrayBase.resolved;
  10685. WHILE(base IS SyntaxTree.ArrayType) DO
  10686. type := base(SyntaxTree.ArrayType);
  10687. n := n* type.staticLength;
  10688. base := type.arrayBase.resolved;
  10689. END;
  10690. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10691. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10692. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10693. FOR i := 0 TO n-1 DO
  10694. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10695. END;
  10696. END;
  10697. ELSE
  10698. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10699. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10700. END;
  10701. END;
  10702. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10703. WITH type: SyntaxTree.MathArrayType DO
  10704. IF type.form = SyntaxTree.Static THEN
  10705. n := type.staticLength;
  10706. base := type.arrayBase.resolved;
  10707. WHILE(base IS SyntaxTree.MathArrayType) DO
  10708. type := base(SyntaxTree.MathArrayType);
  10709. n := n* type.staticLength;
  10710. base := type.arrayBase.resolved;
  10711. END;
  10712. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10713. IF SemanticChecker.ContainsPointer(base) THEN
  10714. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10715. FOR i := 0 TO n-1 DO
  10716. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10717. END;
  10718. END;
  10719. ELSE
  10720. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10721. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10722. END
  10723. END;
  10724. (* ELSE no pointers in type *)
  10725. END;
  10726. END Pointers;
  10727. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10728. VAR position,i: LONGINT; ch: CHAR;
  10729. BEGIN
  10730. IF pool.Has(index) THEN
  10731. RETURN pool.GetInt(index)
  10732. ELSE
  10733. position := source.pc;
  10734. pool.PutInt(index, position);
  10735. Info(source, name);
  10736. i := 0;
  10737. REPEAT
  10738. ch := name[i]; INC(i);
  10739. Char( source, ch);
  10740. UNTIL ch = 0X;
  10741. END;
  10742. RETURN position;
  10743. END EnterDynamicName;
  10744. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10745. VAR name: Basic.SectionName; position: LONGINT;
  10746. BEGIN
  10747. IF pool.Has(index) THEN
  10748. RETURN pool.GetInt(index)
  10749. ELSE
  10750. StringPool.GetString(index, name);
  10751. position := EnterDynamicName(source,name,index, pool);
  10752. END;
  10753. RETURN position;
  10754. END DynamicName;
  10755. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10756. VAR section: IntermediateCode.Section;
  10757. BEGIN
  10758. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10759. IF implementationVisitor.backend.cooperative THEN
  10760. Info(section, "TypeDescriptor");
  10761. Basic.ToSegmentedName("BaseTypes.Array", name);
  10762. NamedSymbol(section, name,NIL, 0, 0);
  10763. BasePointer(section);
  10764. offset := 0;
  10765. ELSE
  10766. IF ProtectModulesPointers THEN
  10767. HeapBlock(mName,typeName,section,2);
  10768. END;
  10769. Info(section, "HeapBlock");
  10770. IF ProtectModulesPointers THEN
  10771. Symbol(section,section,2,0);
  10772. ELSE
  10773. Address(section,0);
  10774. END;
  10775. Info(section, "TypeDescriptor");
  10776. Address(section,0);
  10777. offset := section.pc;
  10778. END;
  10779. RETURN section
  10780. END NamedBlock;
  10781. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10782. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10783. BEGIN
  10784. COPY(moduleName,name);
  10785. Strings.Append(name,suffix);
  10786. Basic.ToSegmentedName(name, pooledName);
  10787. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10788. END Block;
  10789. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10790. VAR name: Basic.SegmentedName;
  10791. BEGIN
  10792. Info(source,"ArrayHeader");
  10793. IF implementationVisitor.backend.cooperative THEN
  10794. sizePC := source.pc;
  10795. Address(source,0);
  10796. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10797. IF baseType # "" THEN
  10798. Basic.ToSegmentedName(baseType, name);
  10799. NamedSymbol(source, name,NIL, 0, 0);
  10800. ELSE
  10801. Address(source,0);
  10802. END;
  10803. Address(source,0);
  10804. ELSE
  10805. Address(source,0);
  10806. Address(source,0);
  10807. (* first pointer for GC *)
  10808. IF hasPointer THEN
  10809. (* points to first element in the array, this is NOT the base type descriptor *)
  10810. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10811. ELSE
  10812. Address(source,0);
  10813. END;
  10814. sizePC := source.pc;
  10815. Address(source,0);
  10816. Info(source,"array data");
  10817. END;
  10818. END ArrayBlock;
  10819. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10820. BEGIN
  10821. IF implementationVisitor.backend.cooperative THEN
  10822. PatchSize(section, pc, size);
  10823. PatchSize(section, pc + 3, size);
  10824. ELSE
  10825. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10826. PatchSize(section, pc, size);
  10827. END;
  10828. END PatchArray;
  10829. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10830. VAR
  10831. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10832. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10833. poolMap: Basic.HashTableInt;
  10834. namePool: IntermediateCode.Section;
  10835. namePoolOffset: LONGINT;
  10836. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10837. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10838. BEGIN
  10839. Basic.SegmentedNameToString(s1.name,n1);
  10840. Basic.SegmentedNameToString(s2.name,n2);
  10841. index := 0;
  10842. ch1 := n1[index];
  10843. ch2 := n2[index];
  10844. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10845. INC(index);
  10846. ch1 := n1[index];
  10847. ch2 := n2[index];
  10848. END;
  10849. RETURN ch1 < ch2;
  10850. END Compare;
  10851. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10852. VAR
  10853. i, j: LONGINT;
  10854. x, t: Sections.Section;
  10855. BEGIN
  10856. IF lo < hi THEN
  10857. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10858. WHILE i <= j DO
  10859. WHILE Compare(list[i], x) DO INC(i) END;
  10860. WHILE Compare(x, list[j]) DO DEC(j) END;
  10861. IF i <= j THEN
  10862. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10863. INC(i); DEC(j)
  10864. END
  10865. END;
  10866. IF lo < j THEN QuickSort(list, lo, j) END;
  10867. IF i < hi THEN QuickSort(list, i, hi) END
  10868. END;
  10869. END QuickSort;
  10870. (*
  10871. ExportDesc* = RECORD
  10872. fp*: ADDRESS;
  10873. name* {UNTRACED}: DynamicName;
  10874. adr*: ADDRESS;
  10875. exports*: LONGINT;
  10876. dsc* {UNTRACED}: ExportArray
  10877. END;
  10878. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10879. *)
  10880. PROCEDURE ExportDesc2(
  10881. source: IntermediateCode.Section;
  10882. namePool: IntermediateCode.Section;
  10883. fingerPrinter: FingerPrinter.FingerPrinter;
  10884. symbol: Sections.Section;
  10885. name: StringPool.Index;
  10886. VAR patchAdr: LONGINT
  10887. ): BOOLEAN;
  10888. VAR fingerPrint: SyntaxTree.FingerPrint;
  10889. BEGIN
  10890. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10891. & (symbol.type # Sections.InlineCodeSection)
  10892. THEN
  10893. *)
  10894. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  10895. & (symbol.type # Sections.ExitCodeSection)
  10896. & (symbol.type # Sections.InlineCodeSection))
  10897. THEN
  10898. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10899. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10900. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10901. Longint(source,fingerPrint.public);
  10902. ELSE
  10903. Longint(source, 0);
  10904. END;
  10905. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10906. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10907. Symbol(source, symbol,0,0);
  10908. patchAdr := source.pc;
  10909. Longint(source, 0);
  10910. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10911. Address(source,0);
  10912. END;
  10913. RETURN TRUE
  10914. ELSE
  10915. RETURN FALSE
  10916. END;
  10917. END ExportDesc2;
  10918. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10919. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10920. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10921. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  10922. nextPatch: LONGINT;
  10923. TYPE
  10924. Scope = RECORD
  10925. elements: LONGINT;
  10926. gelements: LONGINT;
  10927. section: IntermediateCode.Section;
  10928. patchAdr: LONGINT;
  10929. arraySizePC: LONGINT;
  10930. beginPC: LONGINT; (* current scope start pc *)
  10931. END;
  10932. BEGIN
  10933. Basic.InitSegmentedName(prev);
  10934. olevel := -1;
  10935. scopes[0].section := source;
  10936. scopes[0].arraySizePC := MIN(LONGINT);
  10937. FOR s := 0 TO LEN(sections)-1 DO
  10938. symbol := sections[s];
  10939. IF (symbol # NIL) & (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection) & (symbol.type # Sections.ExitCodeSection) & (symbol.type # Sections.InlineCodeSection) THEN
  10940. this := sections[s].name;
  10941. level := 0;
  10942. WHILE (this[level] > 0) DO
  10943. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10944. INC(level);
  10945. END;
  10946. WHILE level < olevel DO
  10947. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10948. IF olevel > 0 THEN
  10949. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10950. nextPatch := scopes[olevel-1].patchAdr+1;
  10951. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10952. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10953. END;
  10954. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10955. DEC(olevel);
  10956. END;
  10957. IF (this[level] > 0) THEN
  10958. IF level > olevel THEN
  10959. (*TRACE("opening",level); *)
  10960. IF scopes[level].section = NIL THEN
  10961. arrayName := ".@ExportArray";
  10962. Strings.AppendInt(arrayName, level);
  10963. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  10964. AddPointer(scopes[level].section,offset);
  10965. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  10966. END;
  10967. scopes[level].beginPC := scopes[level].section.pc;
  10968. olevel := level;
  10969. scopes[olevel].elements := 0;
  10970. END;
  10971. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10972. sym := sections[s];
  10973. ELSE
  10974. sym := NIL;
  10975. END;
  10976. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10977. THEN
  10978. INC(scopes[olevel].elements);
  10979. END;
  10980. (* enter string in scope *)
  10981. INC(level);
  10982. END;
  10983. END;
  10984. Basic.SegmentedNameToString(this, name);
  10985. prev := this;
  10986. END;
  10987. END;
  10988. WHILE 0 <= olevel DO
  10989. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10990. IF olevel > 0 THEN
  10991. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10992. nextPatch := scopes[olevel-1].patchAdr+1;
  10993. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10994. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10995. END;
  10996. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10997. DEC(olevel);
  10998. END;
  10999. level := 0;
  11000. WHILE (level < LEN(scopes)) DO
  11001. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  11002. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  11003. END;
  11004. INC(level);
  11005. END;
  11006. END Export;
  11007. BEGIN
  11008. NEW(fingerPrinter);
  11009. NEW(poolMap, 64);
  11010. (* this is the name pool private to the export table -- it is sorted and should not be mixed / used for other names in a module *)
  11011. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  11012. NEW(sectionArray, module.allSections.Length());
  11013. FOR i := 0 TO module.allSections.Length() - 1 DO
  11014. section := module.allSections.GetSection(i);
  11015. sectionArray[i] := section;
  11016. END;
  11017. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  11018. Export(sectionArray^);
  11019. END ExportDesc;
  11020. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11021. VAR
  11022. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11023. BEGIN
  11024. Info(source, "exception table offsets array descriptor");
  11025. size := 0;
  11026. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11027. Info(source, "exception table content");
  11028. FOR i := 0 TO module.allSections.Length() - 1 DO
  11029. p := module.allSections.GetSection(i);
  11030. IF p.type = Sections.CodeSection THEN
  11031. finallyPC := p(IntermediateCode.Section).finally;
  11032. IF finallyPC>=0 THEN
  11033. Symbol( source, p, 0,0);
  11034. Symbol( source, p, finallyPC, 0);
  11035. Symbol( source, p, finallyPC,0);
  11036. INC(size);
  11037. END;
  11038. END
  11039. END;
  11040. PatchArray(source,sizePC,size);
  11041. END ExceptionArray;
  11042. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11043. VAR i: LONGINT; ch: CHAR;
  11044. BEGIN
  11045. i := 0;
  11046. REPEAT
  11047. ch := name[i]; INC(i);
  11048. Char( section, ch);
  11049. UNTIL ch = 0X;
  11050. WHILE i < 32 DO
  11051. Char( section, 0X); INC(i);
  11052. END;
  11053. END Name;
  11054. PROCEDURE References(section: IntermediateCode.Section);
  11055. CONST
  11056. sfTypeNone = 0X;
  11057. sfTypeCHAR = 01X;
  11058. sfTypeCHAR8 = 02X;
  11059. sfTypeCHAR16 = 03X;
  11060. sfTypeCHAR32 = 04X;
  11061. sfTypeRANGE = 05X;
  11062. sfTypeSHORTINT = 06X;
  11063. sfTypeINTEGER = 07X;
  11064. sfTypeLONGINT = 08X;
  11065. sfTypeHUGEINT = 09X;
  11066. sfTypeWORD = 0AX;
  11067. sfTypeLONGWORD = 0BX;
  11068. sfTypeSIGNED8 = 0CX;
  11069. sfTypeSIGNED16 = 0DX;
  11070. sfTypeSIGNED32 = 0EX;
  11071. sfTypeSIGNED64 = 0FX;
  11072. sfTypeUNSIGNED8 = 10X;
  11073. sfTypeUNSIGNED16 = 11X;
  11074. sfTypeUNSIGNED32 = 12X;
  11075. sfTypeUNSIGNED64 = 13X;
  11076. sfTypeREAL = 14X;
  11077. sfTypeLONGREAL = 15X;
  11078. sfTypeCOMPLEX = 16X;
  11079. sfTypeLONGCOMPLEX = 17X;
  11080. sfTypeBOOLEAN = 18X;
  11081. sfTypeSET = 19X;
  11082. sfTypeANY = 1AX;
  11083. sfTypeOBJECT = 1BX;
  11084. sfTypeBYTE = 1CX;
  11085. sfTypeADDRESS = 1DX;
  11086. sfTypeSIZE = 1EX;
  11087. sfTypeIndirect = 1FX;
  11088. sfTypeRecord = 20X;
  11089. sfTypePointerToRecord = 21X;
  11090. sfTypePointerToArray = 22X;
  11091. sfTypeOpenArray = 23X;
  11092. sfTypeStaticArray = 24X;
  11093. sfTypeDynamicArray = 25X;
  11094. sfTypeMathStaticArray = 26X;
  11095. sfTypeMathOpenArray = 27X;
  11096. sfTypeMathTensor = 28X;
  11097. sfTypeDelegate = 29X;
  11098. sfTypeENUM = 2AX;
  11099. sfTypeCELL = 2BX;
  11100. sfTypePORT = 2CX;
  11101. sfIN = 0X;
  11102. sfOUT = 1X;
  11103. flagDelegate = 0;
  11104. flagConstructor = 1;
  11105. (* variable / parameter addressing modes *)
  11106. sfAbsolute = 0X; (* global vars *)
  11107. sfRelative = 1X; (* variables, value parameters *)
  11108. sfIndirect = 2X; (* var parameters *)
  11109. sfScopeBegin = 0F0X;
  11110. sfScopeEnd = 0F1X;
  11111. sfProcedure = 0F2X;
  11112. sfVariable = 0F3X;
  11113. sfTypeDeclaration = 0F4X;
  11114. sfModule = 0FFX;
  11115. RefInfo = TRUE;
  11116. VAR
  11117. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11118. indirectTypes: Basic.HashTable;
  11119. PROCEDURE CurrentIndex(): LONGINT;
  11120. VAR i: LONGINT;
  11121. BEGIN
  11122. FOR i := startPC TO section.pc -1 DO
  11123. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11124. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11125. END;
  11126. startPC := section.pc;
  11127. RETURN lastOffset;
  11128. END CurrentIndex;
  11129. (*
  11130. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11131. Module = sfModule prevSymbol:SIZE name:String Scope.
  11132. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11133. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11134. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11135. Type =
  11136. sfTypePointerToRecord
  11137. | sfTypePointerToArray Type
  11138. | sfTypeOpenArray Type
  11139. | sfTypeDynamicArray Type
  11140. | sfTypeStaticArray length:SIZE Type
  11141. | sfTypeMathOpenArray Type
  11142. | sfTypeMathStaticArray length:SIZE Type
  11143. | sfTypeMathTensor Type
  11144. | sfTypeRecord tdAdr:ADDRESS
  11145. | sfTypeDelegate {Parameter} return:Type
  11146. | sfTypePort (sfIN | sfOUT)
  11147. | sfTypeBOOLEAN
  11148. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11149. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11150. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11151. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11152. | sfTypeWORD | sfTypeLONGWORD
  11153. | sfTypeREAL | sfTypeLONGREAL
  11154. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11155. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11156. | sfTypeIndirect offset:SIZE.
  11157. *)
  11158. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11159. VAR offset: SIZE;
  11160. BEGIN
  11161. IF indirectTypes.Has(type) THEN
  11162. offset := indirectTypes.GetInt(type);
  11163. Char(section, sfTypeIndirect);
  11164. Size(section, offset);
  11165. RETURN TRUE;
  11166. ELSE
  11167. indirectTypes.PutInt(type, CurrentIndex());
  11168. RETURN FALSE;
  11169. END;
  11170. END Indirect;
  11171. PROCEDURE NType(type: SyntaxTree.Type);
  11172. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11173. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11174. BEGIN
  11175. IF type = NIL THEN
  11176. Char(section, sfTypeNone)
  11177. ELSE
  11178. type := type.resolved;
  11179. size := type.sizeInBits;
  11180. WITH type:SyntaxTree.PointerType DO
  11181. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11182. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11183. Char(section, sfTypePointerToRecord);
  11184. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11185. ELSE
  11186. IF RefInfo THEN Info(section,"PointerToArray") END;
  11187. Char(section, sfTypePointerToArray);
  11188. NType(type.pointerBase);
  11189. END;
  11190. | type: SyntaxTree.ArrayType DO
  11191. IF ~Indirect(type) THEN
  11192. IF type.form = SyntaxTree.Open THEN
  11193. IF RefInfo THEN Info(section,"OpenArray") END;
  11194. Char(section, sfTypeOpenArray);
  11195. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11196. IF RefInfo THEN Info(section,"DynamicArray") END;
  11197. Char(section, sfTypeDynamicArray);
  11198. ELSIF type.form = SyntaxTree.Static THEN
  11199. IF RefInfo THEN Info(section,"StaticArray") END;
  11200. Char(section, sfTypeStaticArray);
  11201. Size(section, type.staticLength);
  11202. ELSE
  11203. HALT(100);
  11204. END;
  11205. NType(type.arrayBase);
  11206. END;
  11207. | type: SyntaxTree.MathArrayType DO
  11208. IF ~Indirect(type) THEN
  11209. IF type.form = SyntaxTree.Open THEN
  11210. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11211. Char(section, sfTypeMathOpenArray);
  11212. ELSIF type.form = SyntaxTree.Static THEN
  11213. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11214. Char(section, sfTypeMathStaticArray);
  11215. Size(section, type.staticLength);
  11216. ELSIF type.form = SyntaxTree.Tensor THEN
  11217. IF RefInfo THEN Info(section,"MathTensor") END;
  11218. Char(section, sfTypeMathTensor);
  11219. ELSE
  11220. HALT(100);
  11221. END;
  11222. NType(type.arrayBase);
  11223. END;
  11224. | type: SyntaxTree.RecordType DO
  11225. IF ~Indirect(type) THEN
  11226. IF type.pointerType # NIL (* OBJECT *) THEN
  11227. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11228. Char(section, sfTypePointerToRecord)
  11229. ELSE
  11230. IF RefInfo THEN Info(section,"Record") END;
  11231. Char(section, sfTypeRecord);
  11232. td := type.typeDeclaration;
  11233. IF RefInfo THEN Info(section,"TD") END;
  11234. IF (td # NIL) THEN
  11235. Global.GetSymbolSegmentedName(td,segmentedName);
  11236. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11237. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11238. ELSE
  11239. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11240. END;
  11241. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11242. Symbol(section, tir, 0, offset);
  11243. ELSE
  11244. Address(section, 0);
  11245. END;
  11246. END;
  11247. END;
  11248. | type: SyntaxTree.CellType DO
  11249. IF ~Indirect(type) THEN
  11250. IF RefInfo THEN Info(section,"Record") END;
  11251. Char(section, sfTypeRecord);
  11252. td := type.typeDeclaration;
  11253. IF RefInfo THEN Info(section,"TD") END;
  11254. IF (td # NIL) THEN
  11255. Global.GetSymbolSegmentedName(td,segmentedName);
  11256. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11257. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11258. ELSE
  11259. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11260. END;
  11261. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11262. Symbol(section, tir, 0, offset);
  11263. ELSE
  11264. Address(section, 0);
  11265. END;
  11266. END;
  11267. | type: SyntaxTree.PortType DO
  11268. Char(section, sfTypePORT);
  11269. IF type.direction = SyntaxTree.OutPort THEN
  11270. Char(section, sfOUT)
  11271. ELSE
  11272. Char(section, sfIN)
  11273. END;
  11274. | type: SyntaxTree.ProcedureType DO
  11275. IF ~Indirect(type) THEN
  11276. Char(section, sfTypeDelegate);
  11277. parameter := type.firstParameter;
  11278. WHILE(parameter # NIL) DO
  11279. NParameter(parameter, -1);
  11280. parameter := parameter.nextParameter;
  11281. END;
  11282. NType(type.returnType);
  11283. END;
  11284. | type:SyntaxTree.EnumerationType DO
  11285. Char(section, sfTypeENUM);
  11286. | type: SyntaxTree.BasicType DO
  11287. WITH type: SyntaxTree.BooleanType DO
  11288. IF RefInfo THEN Info(section,"Boolean") END;
  11289. Char(section, sfTypeBOOLEAN);
  11290. | type: SyntaxTree.CharacterType DO
  11291. IF type = module.system.characterType THEN
  11292. IF RefInfo THEN Info(section,"CHAR") END;
  11293. Char(section, sfTypeCHAR);
  11294. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11295. IF RefInfo THEN Info(section,"CHAR8") END;
  11296. Char(section, sfTypeCHAR8)
  11297. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11298. IF RefInfo THEN Info(section,"CHAR16") END;
  11299. Char(section, sfTypeCHAR16);
  11300. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11301. IF RefInfo THEN Info(section,"CHAR32") END;
  11302. Char(section, sfTypeCHAR32);
  11303. ELSE
  11304. HALT(100);
  11305. END;
  11306. |type: SyntaxTree.IntegerType DO
  11307. IF type(SyntaxTree.IntegerType).signed THEN
  11308. IF (type = module.system.shortintType) THEN
  11309. IF RefInfo THEN Info(section,"SHORTINT") END;
  11310. Char(section, sfTypeSHORTINT)
  11311. ELSIF (type = module.system.integerType) THEN
  11312. IF RefInfo THEN Info(section,"INTEGER") END;
  11313. Char(section, sfTypeINTEGER)
  11314. ELSIF (type = module.system.longintType) THEN
  11315. IF RefInfo THEN Info(section,"LONGINT") END;
  11316. Char(section, sfTypeLONGINT)
  11317. ELSIF (type = module.system.hugeintType) THEN
  11318. IF RefInfo THEN Info(section,"HUGEINT") END;
  11319. Char(section, sfTypeHUGEINT)
  11320. ELSIF (type = module.system.wordType) THEN
  11321. IF RefInfo THEN Info(section,"WORD") END;
  11322. Char(section, sfTypeWORD)
  11323. ELSIF (type = module.system.longWordType) THEN
  11324. IF RefInfo THEN Info(section,"LONGWORD") END;
  11325. Char(section, sfTypeLONGWORD);
  11326. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11327. IF RefInfo THEN Info(section,"SIGNED8") END;
  11328. Char(section, sfTypeSIGNED8)
  11329. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11330. IF RefInfo THEN Info(section,"SIGNED16") END;
  11331. Char(section, sfTypeSIGNED16)
  11332. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11333. IF RefInfo THEN Info(section,"SIGNED32") END;
  11334. Char(section, sfTypeSIGNED32)
  11335. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11336. IF RefInfo THEN Info(section,"SIGNED64") END;
  11337. Char(section, sfTypeSIGNED64)
  11338. ELSE
  11339. HALT(100);
  11340. END
  11341. ELSE (* unsigned *)
  11342. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11343. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11344. Char(section, sfTypeUNSIGNED8)
  11345. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11346. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11347. Char(section, sfTypeUNSIGNED16)
  11348. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11349. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11350. Char(section, sfTypeUNSIGNED32)
  11351. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11352. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11353. Char(section, sfTypeUNSIGNED64)
  11354. ELSE
  11355. HALT(100)
  11356. END
  11357. END;
  11358. | type: SyntaxTree.FloatType DO
  11359. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11360. IF RefInfo THEN Info(section,"REAL") END;
  11361. Char(section, sfTypeREAL);
  11362. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11363. IF RefInfo THEN Info(section,"LONGREAL") END;
  11364. Char(section, sfTypeLONGREAL);
  11365. ELSE
  11366. HALT(100);
  11367. END;
  11368. |type: SyntaxTree.ComplexType DO
  11369. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11370. IF RefInfo THEN Info(section,"COMPLEX") END;
  11371. Char(section, sfTypeCOMPLEX);
  11372. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11373. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11374. Char(section, sfTypeLONGCOMPLEX);
  11375. ELSE
  11376. HALT(100);
  11377. END;
  11378. |type:SyntaxTree.SetType DO
  11379. IF RefInfo THEN Info(section,"SET") END;
  11380. Char(section, sfTypeSET);
  11381. |type:SyntaxTree.AnyType DO
  11382. IF RefInfo THEN Info(section,"ANY") END;
  11383. Char(section, sfTypeANY);
  11384. |type:SyntaxTree.ObjectType DO
  11385. IF RefInfo THEN Info(section,"OBJECT") END;
  11386. Char(section, sfTypeOBJECT);
  11387. |type:SyntaxTree.ByteType DO
  11388. IF RefInfo THEN Info(section,"BYTE") END;
  11389. Char(section, sfTypeBYTE);
  11390. |type:SyntaxTree.RangeType DO
  11391. IF RefInfo THEN Info(section,"RANGE") END;
  11392. Char(section, sfTypeRANGE)
  11393. |type:SyntaxTree.AddressType DO
  11394. IF RefInfo THEN Info(section,"ADDRESS") END;
  11395. Char(section, sfTypeADDRESS)
  11396. |type:SyntaxTree.SizeType DO
  11397. IF RefInfo THEN Info(section,"SIZE") END;
  11398. Char(section, sfTypeSIZE)
  11399. ELSE
  11400. HALT(100)
  11401. END;
  11402. ELSE HALT(101);
  11403. END;
  11404. END;
  11405. END NType;
  11406. (*
  11407. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11408. *)
  11409. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11410. VAR pos: LONGINT; type: SyntaxTree.Type;
  11411. BEGIN
  11412. IF RefInfo THEN Info(section, "Parameter") END;
  11413. Char(section, sfVariable);
  11414. Size(section, procOffset);
  11415. String0(section, parameter.name);
  11416. type := parameter.type.resolved;
  11417. IF parameter.kind = SyntaxTree.VarParameter THEN
  11418. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11419. ELSE Char(section, sfIndirect)
  11420. END;
  11421. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11422. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11423. Char(section, sfIndirect);
  11424. ELSE
  11425. Char(section, sfRelative);
  11426. END;
  11427. ELSE
  11428. Char(section, sfRelative);
  11429. END;
  11430. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11431. NType(parameter.type);
  11432. END NParameter;
  11433. (*
  11434. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11435. *)
  11436. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11437. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11438. flags: SET;
  11439. BEGIN
  11440. IF procedure.externalName # NIL THEN RETURN END;
  11441. IF RefInfo THEN Info(section, "Procedure") END;
  11442. pos := CurrentIndex();
  11443. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11444. Char(section, sfProcedure);
  11445. Size(section, scopeOffset);
  11446. String0(section,procedure.name);
  11447. s := module.allSections.FindBySymbol(procedure);
  11448. Symbol(section,s,0,0); (* start *)
  11449. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11450. flags := {};
  11451. IF procedureType.isDelegate THEN
  11452. INCL(flags, flagDelegate);
  11453. END;
  11454. IF procedure.isConstructor THEN
  11455. INCL(flags, flagConstructor);
  11456. END;
  11457. Set(section, flags);
  11458. IF RefInfo THEN Info(section, "Parameters") END;
  11459. parameter := procedureType.firstParameter;
  11460. WHILE(parameter # NIL) DO
  11461. NParameter(parameter, pos);
  11462. parameter := parameter.nextParameter;
  11463. END;
  11464. IF procedureType.returnParameter # NIL THEN
  11465. NParameter(procedureType.returnParameter, pos);
  11466. END;
  11467. IF procedureType.selfParameter # NIL THEN
  11468. NParameter(procedureType.selfParameter, pos);
  11469. END;
  11470. IF RefInfo THEN Info(section, "ReturnType") END;
  11471. NType(procedureType.returnType);
  11472. NScope(procedure.procedureScope, pos);
  11473. END NProcedure;
  11474. (*
  11475. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11476. *)
  11477. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11478. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11479. BEGIN
  11480. IF RefInfo THEN Info(section, "Variable") END;
  11481. pos := CurrentIndex();
  11482. Char(section, sfVariable);
  11483. Size(section, scopeOffset);
  11484. String0(section, variable.name);
  11485. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11486. Char(section, sfAbsolute);
  11487. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11488. NamedSymbol(section, sn,variable, 0,0);
  11489. ELSE
  11490. Char(section, sfRelative);
  11491. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11492. END;
  11493. NType(variable.type);
  11494. s := module.allSections.FindBySymbol(variable);
  11495. END NVariable;
  11496. (*
  11497. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11498. *)
  11499. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11500. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11501. BEGIN
  11502. IF typeDeclaration = NIL THEN RETURN END;
  11503. pos := CurrentIndex();
  11504. s := module.allSections.FindBySymbol(typeDeclaration);
  11505. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11506. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11507. Char(section, sfTypeDeclaration);
  11508. Size(section, scopeOffset);
  11509. String0(section, typeDeclaration.name);
  11510. declared := typeDeclaration.declaredType.resolved;
  11511. IF (declared IS SyntaxTree.PointerType) THEN
  11512. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11513. END;
  11514. WITH declared: SyntaxTree.RecordType DO
  11515. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11516. Symbol(section, s, 0, offset);
  11517. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11518. Basic.AppendToSegmentedName(name,".@Info");
  11519. s := module.allSections.FindByName(name);
  11520. IF s # NIL THEN (* does not work for coop *)
  11521. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11522. END;
  11523. NScope(declared.recordScope, pos);
  11524. |declared: SyntaxTree.CellType DO
  11525. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11526. Symbol(section, s, 0, offset);
  11527. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11528. Basic.AppendToSegmentedName(name,".@Info");
  11529. s := module.allSections.FindByName(name);
  11530. IF s # NIL THEN
  11531. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11532. END;
  11533. NScope(declared.cellScope, pos);
  11534. ELSE
  11535. Address(section, 0);
  11536. END;
  11537. END NTypeDeclaration;
  11538. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11539. VAR pos: LONGINT;
  11540. BEGIN
  11541. pos := CurrentIndex();
  11542. Char(section,sfModule);
  11543. Size(section, prevSymbol);
  11544. String0(section, module.name);
  11545. NScope(module.moduleScope, pos);
  11546. END NModule;
  11547. (*
  11548. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11549. *)
  11550. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11551. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11552. BEGIN
  11553. IF scope = NIL THEN RETURN END;
  11554. IF RefInfo THEN Info(section, "Scope") END;
  11555. Char(section, sfScopeBegin);
  11556. variable := scope.firstVariable;
  11557. WHILE (variable # NIL) DO
  11558. NVariable(variable, prevSymbol);
  11559. variable := variable.nextVariable;
  11560. END;
  11561. WITH scope: SyntaxTree.ModuleScope DO
  11562. bodyProcedure := scope.bodyProcedure;
  11563. |scope: SyntaxTree.RecordScope DO
  11564. bodyProcedure := scope.bodyProcedure;
  11565. ELSE
  11566. bodyProcedure := NIL;
  11567. END;
  11568. IF bodyProcedure # NIL THEN
  11569. NProcedure(bodyProcedure, prevSymbol)
  11570. END;
  11571. procedure := scope.firstProcedure;
  11572. WHILE procedure # NIL DO
  11573. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11574. procedure := procedure.nextProcedure;
  11575. END;
  11576. typeDeclaration := scope.firstTypeDeclaration;
  11577. WHILE typeDeclaration # NIL DO
  11578. NTypeDeclaration(typeDeclaration, prevSymbol);
  11579. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11580. END;
  11581. Char(section, sfScopeEnd); (* scope ends *)
  11582. END NScope;
  11583. BEGIN
  11584. NEW(indirectTypes, 32);
  11585. ArrayBlock(section,sizePC,"", FALSE);
  11586. startPC := section.pc;
  11587. NModule(module.module, -1);
  11588. PatchArray(section,sizePC,CurrentIndex());
  11589. END References;
  11590. (*
  11591. Command* = RECORD
  11592. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11593. name*: Name; (* name of the procedure *)
  11594. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11595. entryAdr* : ADDRESS; (* entry address of procedure *)
  11596. END;
  11597. *)
  11598. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11599. VAR
  11600. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11601. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11602. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11603. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11604. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11605. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11606. BEGIN
  11607. RETURN
  11608. (type = NIL) OR
  11609. (type.resolved IS SyntaxTree.RecordType) OR
  11610. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11611. (type.resolved IS SyntaxTree.AnyType);
  11612. END TypeAllowed;
  11613. BEGIN
  11614. numberParameters := procedureType.numberParameters;
  11615. RETURN
  11616. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11617. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11618. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11619. END GetProcedureAllowed;
  11620. PROCEDURE WriteType(type : SyntaxTree.Type);
  11621. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11622. name: Basic.SegmentedName; offset: LONGINT;
  11623. BEGIN
  11624. IF type = NIL THEN
  11625. Address(source,0);
  11626. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11627. Address(source,1);
  11628. ELSE
  11629. type := type.resolved;
  11630. IF type IS SyntaxTree.PointerType THEN
  11631. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11632. END;
  11633. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11634. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11635. name[0] := typeDeclaration.name; name[1] := -1;
  11636. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11637. ASSERT(section # NIL);
  11638. ELSE
  11639. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11640. (* TODO *)
  11641. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11642. END;
  11643. IF implementationVisitor.backend.cooperative THEN
  11644. offset := 0;
  11645. ELSE
  11646. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11647. END;
  11648. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11649. END;
  11650. END WriteType;
  11651. BEGIN
  11652. Info(source, "command array descriptor");
  11653. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11654. numberCommands := 0;
  11655. Info(source, "command array content");
  11656. FOR i := 0 TO module.allSections.Length() - 1 DO
  11657. p := module.allSections.GetSection(i);
  11658. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11659. procedure := p.symbol(SyntaxTree.Procedure);
  11660. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11661. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11662. procedure.GetName(name);
  11663. Name(source,name);
  11664. numberParameters := procedureType.numberParameters;
  11665. (* offset of type of first parameter *)
  11666. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11667. ELSE WriteType(procedureType.firstParameter.type)
  11668. END;
  11669. (* offset of type of return parameter *)
  11670. WriteType(procedureType.returnType);
  11671. (* command name *)
  11672. (* command code offset *)
  11673. Symbol(source,p,0,0);
  11674. INC(numberCommands);
  11675. IF Trace THEN
  11676. D.Ln;
  11677. END;
  11678. END;
  11679. END
  11680. END;
  11681. PatchArray(source,sizePC,numberCommands);
  11682. END CommandArray;
  11683. (* to prevent from double import of different module aliases *)
  11684. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11685. VAR i: SyntaxTree.Import;
  11686. BEGIN
  11687. i := module.module.moduleScope.firstImport;
  11688. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11689. i := i.nextImport;
  11690. END;
  11691. RETURN i = import
  11692. END IsFirstDirectOccurence;
  11693. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11694. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11695. BEGIN
  11696. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11697. ArrayBlock(source,pc,"", FALSE);
  11698. Info(source, "import module array data");
  11699. IF implementationVisitor.backend.cooperative THEN
  11700. offset := 0;
  11701. ELSE
  11702. IF module.system.addressType.sizeInBits = 64 THEN
  11703. (* change this when Heaps.HeapBlock is modified *)
  11704. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11705. ELSE
  11706. (* change this when Heaps.HeapBlock is modified *)
  11707. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11708. END;
  11709. END;
  11710. import := module.module.moduleScope.firstImport;
  11711. numberImports := 0;
  11712. WHILE import # NIL DO
  11713. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11714. Global.GetModuleSegmentedName(import.module,name);
  11715. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11716. NamedSymbol(source, name, NIL, 0, offset);
  11717. INC(numberImports);
  11718. END;
  11719. import := import.nextImport
  11720. END;
  11721. PatchArray(source,pc,numberImports);
  11722. END ImportsArray;
  11723. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11724. VAR
  11725. p: Sections.Section; sizePC, size, i: LONGINT;
  11726. BEGIN
  11727. Info(source, "Type info section");
  11728. size := 0;
  11729. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11730. FOR i := 0 TO module.allSections.Length() - 1 DO
  11731. p := module.allSections.GetSection(i);
  11732. WITH p: IntermediateCode.Section DO
  11733. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11734. Symbol(source,p,EmptyBlockOffset,0);
  11735. INC(size);
  11736. END;
  11737. END
  11738. END;
  11739. PatchArray(source,sizePC,size);
  11740. END TypeInfoSection;
  11741. (*
  11742. ProcTableEntry* = RECORD
  11743. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11744. noPtr*: LONGINT;
  11745. END;
  11746. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11747. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11748. *)
  11749. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11750. VAR
  11751. numberPointers: LONGINT;
  11752. procedure: SyntaxTree.Procedure;
  11753. BEGIN
  11754. Info(section,"pcFrom");
  11755. Symbol(section,procedureSection,0,0);
  11756. Info(section,"pcTo");
  11757. Symbol(section, procedureSection, procedureSection.pc, 0);
  11758. Info(section,"pointer to offsets array");
  11759. Symbol(section, section,section.pc+1,0);
  11760. Info(section,"offsets array");
  11761. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11762. PointerArray(section, procedure.procedureScope, numberPointers);
  11763. END ProcedureDescriptor;
  11764. (* only for tracing, the descriptor is otherwise not complete ! *)
  11765. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11766. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11767. BEGIN
  11768. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11769. name := procedureSection.name;
  11770. Basic.AppendToSegmentedName(name,".@Info");
  11771. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11772. Address(section,0);
  11773. Symbol(section,section,2,0);
  11774. (*
  11775. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11776. descSize: SIZE;
  11777. sentinel: ADDRESS; (* = MPO-4 *)
  11778. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11779. flags*: SET;
  11780. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11781. name*: Name;
  11782. END;
  11783. *)
  11784. Size(section, 0);
  11785. Address(section,0);
  11786. Address(section,0);
  11787. Set(section,{});
  11788. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); END;
  11789. moduleSection := ModuleSection();
  11790. Symbol( section, moduleSection, moduleSection.pc,0);
  11791. IF procedureSection.symbol = NIL THEN
  11792. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11793. ELSE
  11794. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11795. END;
  11796. Name(section, infoName);
  11797. Size(section, 0);
  11798. RETURN section;
  11799. END MakeProcedureDescriptorTag;
  11800. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11801. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11802. BEGIN
  11803. name := procedureSection.name;
  11804. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11805. IF implementationVisitor.backend.cooperative THEN
  11806. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11807. Info(section, "TypeDescriptor");
  11808. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11809. NamedSymbol(dest, name,NIL, 0, 0);
  11810. BaseRecord(dest);
  11811. offset := 0;
  11812. ELSIF CreateProcedureDescInfo THEN
  11813. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11814. Address(dest,0);
  11815. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11816. offset := dest.pc;
  11817. ELSE
  11818. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11819. END;
  11820. ProcedureDescriptor(dest, procedureSection);
  11821. Symbol(section, dest, offset, 0);
  11822. END ProcedureDescriptorPointer;
  11823. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11824. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11825. BEGIN
  11826. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11827. numberProcs := 0;
  11828. FOR i := 0 TO module.allSections.Length() - 1 DO
  11829. destination := module.allSections.GetSection(i);
  11830. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11831. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11832. INC(numberProcs);
  11833. END
  11834. END;
  11835. PatchArray(section, sizePC, numberProcs);
  11836. END ProcedureDescriptorArray;
  11837. (*
  11838. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11839. VAR
  11840. next*: Module; (** once a module is published, all fields are read-only *)
  11841. name*: Name;
  11842. init, published: BOOLEAN;
  11843. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11844. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11845. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11846. command*: POINTER TO ARRAY OF Command;
  11847. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11848. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11849. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11850. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11851. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11852. data*, code*: Bytes;
  11853. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11854. export*: ExportDesc;
  11855. term*: TerminationHandler;
  11856. exTable*: ExceptionTable;
  11857. noProcs*: LONGINT;
  11858. firstProc*: ADDRESS; <- done by loader
  11859. maxPtrs*: LONGINT;
  11860. crc*: LONGINT;
  11861. *)
  11862. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11863. BEGIN
  11864. Info(section, "cycle");
  11865. Size(section,0);
  11866. Info(section, "references");
  11867. Size(section,0);
  11868. Info(section, "nextMarked");
  11869. Address(section,0);
  11870. Info(section, "nextWatched");
  11871. Address(section,0);
  11872. END BasePointer;
  11873. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11874. BEGIN
  11875. BasePointer(section);
  11876. Info(section, "action");
  11877. Address(section,0);
  11878. Info(section, "monitor");
  11879. Address(section,0);
  11880. END BaseObject;
  11881. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11882. BEGIN
  11883. BasePointer(section);
  11884. Info(section, "action");
  11885. Address(section,0);
  11886. Info(section, "monitor");
  11887. Address(section,0);
  11888. END BaseRecord;
  11889. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11890. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11891. pooledName: Basic.SegmentedName;
  11892. symbol: SyntaxTree.Symbol;
  11893. BEGIN
  11894. Global.GetModuleName(module.module,name);
  11895. Strings.Append(name,".@Module.@Descriptor");
  11896. Basic.ToSegmentedName(name, pooledName);
  11897. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11898. Symbol(section,descriptorSection,0,0);
  11899. Info(descriptorSection, "descriptor");
  11900. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11901. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11902. Address(descriptorSection,0);
  11903. Global.GetModuleName(module.module,name);
  11904. Strings.Append(name,".@Trace");
  11905. Basic.ToSegmentedName(name, pooledName);
  11906. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11907. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11908. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11909. END ModuleDescriptor;
  11910. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11911. VAR name: ARRAY 128 OF CHAR;
  11912. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11913. symbol: SyntaxTree.Symbol;
  11914. BEGIN
  11915. ASSERT(implementationVisitor.backend.newObjectFile);
  11916. Global.GetModuleName(module.module,name);
  11917. Strings.Append(name,".@Module");
  11918. Basic.ToSegmentedName(name, pooledName);
  11919. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11920. moduleSection.SetExported(TRUE);
  11921. IF moduleSection.pc = 0 THEN
  11922. IF implementationVisitor.backend.cooperative THEN
  11923. Info(moduleSection, "descriptor");
  11924. ModuleDescriptor(moduleSection);
  11925. BaseObject(moduleSection);
  11926. implementationVisitor.CreateTraceModuleMethod(module.module);
  11927. ELSE
  11928. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11929. Info(moduleSection, "HeapBlock");
  11930. Symbol(moduleSection,moduleSection,2,0);
  11931. Info(moduleSection, "TypeDescriptor");
  11932. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11933. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11934. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11935. END;
  11936. END;
  11937. RETURN moduleSection;
  11938. END ModuleSection;
  11939. PROCEDURE NewModuleInfo();
  11940. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11941. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11942. sectionName: Basic.SectionName;
  11943. CONST MPO=-40000000H;
  11944. BEGIN
  11945. (*
  11946. TypeDesc* = POINTER TO RECORD
  11947. descSize: SIZE;
  11948. sentinel: LONGINT; (* = MPO-4 *)
  11949. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11950. flags*: SET;
  11951. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11952. name*: Name;
  11953. refsOffset: SIZE;
  11954. END;
  11955. *)
  11956. (*name is missing prefixes sometimes*)
  11957. Global.GetModuleSegmentedName(module.module,name);
  11958. Basic.AppendToSegmentedName(name,".@Info");
  11959. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11960. IF ~implementationVisitor.backend.cooperative THEN
  11961. Info(source, "HeapBlock");
  11962. Address(source,0); (* an empty heap block prevents GC marking *)
  11963. Info(source, "TypeDescriptor");
  11964. Address(source,0);
  11965. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  11966. END;
  11967. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11968. Address(source,MPO-4);
  11969. Info(source, "type tag pointer");
  11970. Address( source,0);
  11971. Info(source, "type flags");
  11972. flags := {};
  11973. Set( source, flags);
  11974. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11975. Info(source, "pointer to module");
  11976. moduleSection := ModuleSection();
  11977. Symbol( source, moduleSection, moduleSection.pc,0);
  11978. Info(source, "type name");
  11979. i := 0;
  11980. sectionName := "@Self";
  11981. (*
  11982. Global.GetSymbolSegmentedName(td,name);
  11983. Basic.SegmentedNameToString(name, sectionName);
  11984. *)
  11985. Name(source,sectionName);
  11986. source.SetReferenced(FALSE);
  11987. patchInfoPC := source.pc;
  11988. Size(source, 0);
  11989. END NewModuleInfo;
  11990. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11991. VAR
  11992. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11993. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  11994. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11995. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  11996. referenceSectionOffset : LONGINT;
  11997. name: Basic.SegmentedName; offset: LONGINT;
  11998. flags: SET;
  11999. BEGIN
  12000. NewModuleInfo();
  12001. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  12002. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  12003. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  12004. ImportsArray(importSection);
  12005. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  12006. CommandArray(commandsSection);
  12007. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  12008. ExceptionArray(exceptionSection);
  12009. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  12010. AddPointer(typeInfoSection, typeInfoSectionOffset);
  12011. TypeInfoSection(typeInfoSection);
  12012. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  12013. referenceSection.SetExported(TRUE);
  12014. References(referenceSection);
  12015. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  12016. ProcedureDescriptorArray(procTableSection, numberProcs);
  12017. IF ProtectModulesPointers THEN
  12018. name := "Heaps.AnyPtr";
  12019. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12020. (* set base pointer *)
  12021. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12022. END;
  12023. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12024. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12025. moduleSection := ModuleSection();
  12026. Info(moduleSection, "nextRoot*: RootObject");
  12027. Address(moduleSection,0);
  12028. Info(moduleSection, "next*: Module");
  12029. Address(moduleSection,0);
  12030. Info(moduleSection, "name*: Name");
  12031. Name(moduleSection,moduleName);
  12032. Info(moduleSection, "init, published: BOOLEAN");
  12033. Boolean(moduleSection,FALSE);
  12034. Boolean(moduleSection,FALSE);
  12035. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12036. Boolean(moduleSection,FALSE);
  12037. Boolean(moduleSection,FALSE);
  12038. Info(moduleSection, "refcnt*: LONGINT");
  12039. Longint(moduleSection,0);
  12040. Info(moduleSection, "sb*: ADDRESS");
  12041. Address(moduleSection,0);
  12042. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12043. Address(moduleSection,0);
  12044. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12045. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12046. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12047. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12048. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12049. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12050. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12051. Symbol(moduleSection,importSection,importSectionOffset,0);
  12052. Info(moduleSection, "procTable*: ProcTable");
  12053. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12054. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12055. Address(moduleSection,0);
  12056. Address(moduleSection,0);
  12057. Address(moduleSection,0);
  12058. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12059. Info(moduleSection, "export*: ExportDesc");
  12060. ExportDesc(moduleSection);
  12061. Info(moduleSection, "term*: TerminationHandler");
  12062. Address(moduleSection,0);
  12063. Info(moduleSection, "exTable*: ExceptionTable");
  12064. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12065. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12066. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12067. Info(moduleSection, "crc*: LONGINT");
  12068. patchCRC:= moduleSection.pc;
  12069. Longint(moduleSection, 0); (*! must be implemented *)
  12070. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12071. Info(moduleSection, "body*: ADDRESS");
  12072. Symbol(moduleSection, bodyProc, 0,0);
  12073. Info(moduleSection, "module flags");
  12074. flags := {};
  12075. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12076. Set( moduleSection, flags);
  12077. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END;
  12078. IF implementationVisitor.backend.cooperative THEN
  12079. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12080. Info(moduleSection, "monitor.owner");
  12081. Address(moduleSection,0);
  12082. Info(moduleSection, "monitor.nestingLevel");
  12083. Address(moduleSection,0);
  12084. Info(moduleSection, "monitor.blockedQueue");
  12085. Address(moduleSection,0); Address(moduleSection,0);
  12086. Info(moduleSection, "monitor.waitingQueue");
  12087. Address(moduleSection,0); Address(moduleSection,0);
  12088. Info(moduleSection, "monitor.waitingSentinel");
  12089. Address(moduleSection,0);
  12090. END;
  12091. END Module;
  12092. PROCEDURE PatchCRC(crc: LONGINT);
  12093. BEGIN
  12094. IF implementationVisitor.newObjectFile & ~simple THEN
  12095. PatchLongint(ModuleSection(), patchCRC, crc);
  12096. END;
  12097. END PatchCRC;
  12098. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12099. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12100. BEGIN
  12101. ArrayBlock(source,pc,"",FALSE);
  12102. Info(source, "pointer offsets array data");
  12103. IF scope IS SyntaxTree.RecordScope THEN
  12104. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12105. ELSIF scope IS SyntaxTree.CellScope THEN
  12106. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12107. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12108. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12109. WHILE variable # NIL DO
  12110. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12111. symbol := module.allSections.FindBySymbol(variable);
  12112. ASSERT(symbol # NIL);
  12113. Pointers(0,symbol, source,variable.type,numberPointers);
  12114. END;
  12115. variable := variable.nextVariable;
  12116. END;
  12117. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12118. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12119. WHILE parameter # NIL DO
  12120. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12121. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12122. END;
  12123. parameter := parameter.nextParameter;
  12124. END;
  12125. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12126. parametersSize := ProcedureParametersSize(module.system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12127. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12128. IF implementationVisitor.backend.preciseGC THEN
  12129. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12130. END;
  12131. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12132. END;
  12133. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12134. WHILE(variable # NIL) DO
  12135. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12136. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12137. END;
  12138. variable := variable.nextVariable
  12139. END;
  12140. END;
  12141. PatchArray(source,pc,numberPointers);
  12142. END PointerArray;
  12143. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12144. VAR
  12145. name: Basic.SegmentedName;
  12146. section: IntermediateCode.Section;
  12147. BEGIN
  12148. ASSERT(implementationVisitor.newObjectFile);
  12149. Global.GetSymbolSegmentedName(symbol,name);
  12150. Basic.AppendToSegmentedName(name,suffix);
  12151. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12152. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12153. Info(section, "HeapBlock");
  12154. Address(section,0); (* empty such that GC does not go on traversing *)
  12155. Info(section, suffix);
  12156. Address(section,0);
  12157. pc := section.pc;
  12158. RETURN section;
  12159. END SymbolSection;
  12160. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12161. VAR recordType: SyntaxTree.RecordType;
  12162. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12163. section: Sections.Section; cellType: SyntaxTree.CellType;
  12164. tdInfoOffset: LONGINT;
  12165. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12166. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12167. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12168. sectionName: Basic.SectionName;
  12169. CONST MPO=-40000000H;
  12170. BEGIN
  12171. (*
  12172. TypeDesc* = POINTER TO RECORD
  12173. descSize: SIZE;
  12174. sentinel: LONGINT; (* = MPO-4 *)
  12175. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12176. flags*: SET;
  12177. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12178. name*: Name;
  12179. refsOffset: SIZE;
  12180. END;
  12181. *)
  12182. (* source := module.sections.FindByName(...) *)
  12183. Global.GetSymbolSegmentedName(td,name);
  12184. Basic.AppendToSegmentedName(name,".@Info");
  12185. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12186. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12187. Address(source,0);
  12188. Info(source, "TypeDescriptor");
  12189. Address(source,0);
  12190. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12191. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12192. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12193. Info(source, "type tag pointer");
  12194. Symbol( source, tag, offset, 0);
  12195. Info(source, "type flags");
  12196. flags := {};
  12197. IF isProtected THEN INCL(flags,31) END;
  12198. Set( source, flags);
  12199. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  12200. Info(source, "pointer to module");
  12201. moduleSection := ModuleSection();
  12202. Symbol( source, moduleSection, moduleSection.pc,0);
  12203. Info(source, "type name");
  12204. i := 0;
  12205. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12206. (*
  12207. Global.GetSymbolSegmentedName(td,name);
  12208. Basic.SegmentedNameToString(name, sectionName);
  12209. *)
  12210. Name(source,sectionName);
  12211. source.SetReferenced(FALSE);
  12212. Size(source, 0);
  12213. RETURN source;
  12214. END NewTypeDescriptorInfo;
  12215. PROCEDURE NewTypeDescriptor;
  12216. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12217. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12218. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12219. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12220. CONST MPO=-40000000H;
  12221. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12222. VAR i: LONGINT;
  12223. PROCEDURE Td(record: SyntaxTree.RecordType);
  12224. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12225. BEGIN
  12226. IF record # NIL THEN
  12227. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12228. baseTD := record.typeDeclaration;
  12229. Global.GetSymbolSegmentedName(baseTD,name);
  12230. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12231. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12232. ELSE
  12233. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12234. END;
  12235. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12236. Symbol(source, tir, 0, offset);
  12237. IF reverse THEN Td(record.GetBaseRecord()) END;
  12238. END;
  12239. END Td;
  12240. BEGIN
  12241. Info(source, "tag table");
  12242. baseRecord := recordType;
  12243. i := 0;
  12244. WHILE baseRecord # NIL DO
  12245. INC(i);
  12246. baseRecord := baseRecord.GetBaseRecord();
  12247. END;
  12248. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12249. IF ~reverse THEN Td(recordType) END;
  12250. WHILE i < size DO
  12251. Address(source,0);
  12252. INC(i);
  12253. END;
  12254. IF reverse THEN Td(recordType) END;
  12255. END TdTable;
  12256. PROCEDURE MethodTable(reverse: BOOLEAN);
  12257. VAR i,methods: LONGINT;
  12258. BEGIN
  12259. Info(source, "method table");
  12260. IF recordType # NIL THEN
  12261. methods := recordType.recordScope.numberMethods;
  12262. IF reverse THEN
  12263. FOR i := methods-1 TO 0 BY -1 DO
  12264. procedure := recordType.recordScope.FindMethod(i);
  12265. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12266. NamedSymbol(source, name,procedure, 0,0);
  12267. END;
  12268. ELSE
  12269. FOR i := 0 TO methods-1 DO
  12270. procedure := recordType.recordScope.FindMethod(i);
  12271. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12272. NamedSymbol(source, name,procedure, 0,0);
  12273. END;
  12274. END;
  12275. END;
  12276. END MethodTable;
  12277. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12278. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12279. BEGIN
  12280. Info(source, "method table");
  12281. baseRecord := recordType;
  12282. WHILE baseRecord.baseType # NIL DO
  12283. baseRecord := baseRecord.GetBaseRecord ();
  12284. END;
  12285. GetRecordTypeName (baseRecord, name);
  12286. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12287. IF name = stackFrame THEN
  12288. start := 0;
  12289. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12290. baseRecord := recordType;
  12291. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12292. baseRecord := baseRecord.GetBaseRecord ();
  12293. END;
  12294. IF baseRecord # NIL THEN
  12295. GetRecordTypeName (baseRecord, name);
  12296. IF pointer & ~baseRecord.isObject THEN
  12297. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12298. END;
  12299. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12300. ELSIF recordType.isObject THEN
  12301. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12302. ELSIF pointer THEN
  12303. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12304. ELSE
  12305. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12306. END;
  12307. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12308. Symbol(source, tir, 0, 0);
  12309. start := 0;
  12310. baseRecord := recordType;
  12311. WHILE (baseRecord # NIL) DO
  12312. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12313. baseRecord := baseRecord.GetBaseRecord ();
  12314. END;
  12315. ELSE
  12316. (* explicit trace method: *)
  12317. procedure := recordType.recordScope.FindMethod(0);
  12318. IF ~procedure.isFinalizer THEN
  12319. Global.GetSymbolSegmentedName(procedure, name);
  12320. NamedSymbol(source, name,procedure, 0,0);
  12321. END;
  12322. start := 1;
  12323. END;
  12324. IF (name # stackFrame) & recordType.isObject THEN
  12325. baseRecord := recordType;
  12326. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12327. baseRecord := baseRecord.GetBaseRecord ();
  12328. END;
  12329. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12330. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12331. ELSE
  12332. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12333. END;
  12334. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12335. Symbol(source, tir, 0, 0);
  12336. END;
  12337. methods := recordType.recordScope.numberMethods;
  12338. FOR i := start TO methods-1 DO
  12339. procedure := recordType.recordScope.FindMethod(i);
  12340. IF ~procedure.isFinalizer THEN
  12341. Global.GetSymbolSegmentedName(procedure, name);
  12342. NamedSymbol(source, name,procedure, 0,0);
  12343. END;
  12344. END;
  12345. END CooperativeMethodTable;
  12346. BEGIN
  12347. Global.GetSymbolSegmentedName(td,name);
  12348. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12349. source.SetExported(IsExported(td));
  12350. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12351. IF implementationVisitor.backend.cooperative THEN
  12352. base := NIL;
  12353. baseRecord := recordType.GetBaseRecord();
  12354. IF baseRecord # NIL THEN
  12355. baseTD := baseRecord.typeDeclaration;
  12356. END;
  12357. IF ~recordType.isObject THEN
  12358. Info(source, "parent");
  12359. IF baseRecord # NIL THEN
  12360. Global.GetSymbolSegmentedName(baseTD,name);
  12361. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12362. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12363. ELSE
  12364. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12365. END;
  12366. Symbol(source, tir, 0, 0);
  12367. ELSE
  12368. Address(source,0);
  12369. END;
  12370. Info(source, "record size");
  12371. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12372. source.SetReferenced(FALSE);
  12373. CooperativeMethodTable(FALSE);
  12374. base := source;
  12375. Global.GetSymbolSegmentedName(td,name);
  12376. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12377. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12378. source.SetExported(IsExported(td));
  12379. source.SetReferenced(FALSE);
  12380. END;
  12381. Info(source, "parent");
  12382. IF baseRecord # NIL THEN
  12383. Global.GetSymbolSegmentedName(baseTD,name);
  12384. sym := baseTD;
  12385. IF ~recordType.isObject THEN
  12386. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12387. sym := NIL;
  12388. END;
  12389. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12390. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12391. ELSE
  12392. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12393. END;
  12394. Symbol(source, tir, 0, 0);
  12395. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12396. Address(source,0);
  12397. ELSE
  12398. IF recordType.isObject THEN
  12399. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12400. ELSE
  12401. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12402. END;
  12403. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12404. Symbol(source, tir, 0, 0);
  12405. END;
  12406. Info(source, "base record descriptor");
  12407. Symbol(source, base, 0, 0);
  12408. CooperativeMethodTable(TRUE);
  12409. source.SetReferenced(FALSE);
  12410. IF recordType.hasPointers THEN
  12411. IF ~HasExplicitTraceMethod (recordType) THEN
  12412. implementationVisitor.CreateTraceMethod(recordType);
  12413. END;
  12414. implementationVisitor.CreateResetProcedure(recordType);
  12415. implementationVisitor.CreateAssignProcedure(recordType);
  12416. END;
  12417. ELSIF ~simple THEN
  12418. (*
  12419. MethodEnd = MPO
  12420. ---
  12421. methods (# methods)
  12422. ---
  12423. tags (16)
  12424. ---
  12425. TypeDesc = TypeInfoAdr
  12426. ---
  12427. td adr ---> rec size
  12428. ----
  12429. pointer offsets
  12430. ----
  12431. (padding)
  12432. -----
  12433. empty [2 addresses aligned]
  12434. empty
  12435. empty
  12436. numPtrs
  12437. ---
  12438. pointer offsets
  12439. ---
  12440. *)
  12441. Info(source, "MethodEnd = MPO");
  12442. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12443. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12444. MethodTable(TRUE);
  12445. TdTable(TypeTags, TRUE);
  12446. Info(source, "type descriptor info pointer");
  12447. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12448. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12449. IF (cellType # NIL) THEN
  12450. IF cellType.sizeInBits < 0 THEN
  12451. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12452. END;
  12453. Info(source, "cell size");
  12454. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12455. ELSE
  12456. Info(source, "record size");
  12457. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12458. END;
  12459. Info(source, "pointer offsets pointer");
  12460. padding := 1- source.pc MOD 2;
  12461. Symbol(source, source, source.pc+1+padding,0);
  12462. IF padding >0 THEN
  12463. Info(source, "padding");
  12464. FOR i := 1 TO padding DO Address(source,0) END;
  12465. END;
  12466. IF cellType # NIL THEN
  12467. PointerArray(source, cellType.cellScope, numberPointers);
  12468. ELSE
  12469. PointerArray(source, recordType.recordScope, numberPointers);
  12470. END;
  12471. ELSE
  12472. (*
  12473. simple:
  12474. td adr --> size
  12475. tag(1)
  12476. tag(2)
  12477. tag(3)
  12478. methods ->
  12479. *)
  12480. Info(source, "record size");
  12481. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12482. TdTable(TypeTags, FALSE);
  12483. MethodTable(FALSE);
  12484. source.SetReferenced(FALSE);
  12485. END;
  12486. END NewTypeDescriptor;
  12487. BEGIN
  12488. x := x.resolved;
  12489. IF (x IS SyntaxTree.PointerType) THEN
  12490. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12491. END;
  12492. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12493. recordType := x(SyntaxTree.RecordType);
  12494. td := x.typeDeclaration;
  12495. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12496. ASSERT(td # NIL);
  12497. section := module.allSections.FindBySymbol(td); (* TODO *)
  12498. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12499. IF implementationVisitor.newObjectFile THEN
  12500. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12501. NewTypeDescriptor
  12502. END;
  12503. ELSE
  12504. (* data section in intermediate code *)
  12505. Global.GetSymbolSegmentedName(td,name);
  12506. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  12507. Basic.SuffixSegmentedName (name, module.module.name);
  12508. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  12509. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  12510. tir.Emit(Data(Basic.invalidPosition,op));
  12511. END;
  12512. END;
  12513. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12514. cellType := x(SyntaxTree.CellType);
  12515. td := x.typeDeclaration;
  12516. section := module.allSections.FindBySymbol(td); (* TODO *)
  12517. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12518. IF implementationVisitor.newObjectFile THEN
  12519. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12520. NewTypeDescriptor
  12521. END;
  12522. END;
  12523. END;
  12524. END
  12525. END CheckTypeDeclaration
  12526. END MetaDataGenerator;
  12527. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12528. VAR
  12529. trace-: BOOLEAN;
  12530. traceString-: SyntaxTree.IdentifierString;
  12531. traceModuleName-: SyntaxTree.IdentifierString;
  12532. newObjectFile-: BOOLEAN;
  12533. profile-: BOOLEAN;
  12534. noRuntimeChecks: BOOLEAN;
  12535. simpleMetaData-: BOOLEAN;
  12536. noAsserts: BOOLEAN;
  12537. optimize-: BOOLEAN;
  12538. cooperative-: BOOLEAN;
  12539. preregisterStatic-: BOOLEAN;
  12540. dump-: Basic.Writer;
  12541. cellsAreObjects: BOOLEAN;
  12542. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12543. experiment: BOOLEAN;
  12544. PROCEDURE &InitIntermediateBackend*;
  12545. BEGIN
  12546. simpleMetaData := FALSE;
  12547. newObjectFile := FALSE;
  12548. InitBackend;
  12549. SetRuntimeModuleName(DefaultRuntimeModuleName);
  12550. SetTraceModuleName(DefaultTraceModuleName);
  12551. END InitIntermediateBackend;
  12552. (* must be overwritten by actual backend, if parameter registers should be used *)
  12553. PROCEDURE NumberParameterRegisters*(callingConvention: SyntaxTree.CallingConvention): SIZE;
  12554. BEGIN
  12555. RETURN 0; (* default case: no parameter registers *)
  12556. END NumberParameterRegisters;
  12557. (* must be overwritten by actual backend, if parameter registers should be used *)
  12558. PROCEDURE ParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; index: LONGINT): LONGINT;
  12559. BEGIN
  12560. HALT(100); (* abstract *)
  12561. END ParameterRegister;
  12562. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12563. VAR
  12564. declarationVisitor: DeclarationVisitor;
  12565. implementationVisitor: ImplementationVisitor;
  12566. module: Sections.Module;
  12567. name, platformName: SyntaxTree.IdentifierString;
  12568. meta: MetaDataGenerator;
  12569. crc: CRC.CRC32Stream;
  12570. BEGIN
  12571. ResetError;
  12572. Global.GetSymbolName(x,name);
  12573. NEW(module,x,system); (* backend structures *)
  12574. Global.GetModuleName(x, name);
  12575. module.SetModuleName(name);
  12576. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  12577. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12578. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12579. declarationVisitor.Module(x,module);
  12580. IF newObjectFile & ~meta.simple THEN
  12581. meta.Module(implementationVisitor.moduleBodySection);
  12582. END;
  12583. GetDescription(platformName);
  12584. module.SetPlatformName(platformName);
  12585. IF newObjectFile THEN
  12586. NEW(crc);
  12587. module.allSections.WriteRaw(crc);
  12588. crc.Update;
  12589. meta.PatchCRC(crc.GetCRC());
  12590. END;
  12591. RETURN module
  12592. END GenerateIntermediate;
  12593. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12594. BEGIN RETURN TRUE
  12595. END SupportedImmediate;
  12596. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12597. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12598. END ProcessSyntaxTreeModule;
  12599. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12600. VAR
  12601. result: Sections.Module;
  12602. traceName: Basic.MessageString;
  12603. BEGIN
  12604. ASSERT(intermediateCodeModule IS Sections.Module);
  12605. result := intermediateCodeModule(Sections.Module);
  12606. IF trace THEN
  12607. traceName := "intermediate code trace: ";
  12608. Strings.Append(traceName,traceString);
  12609. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12610. IF (traceString="") OR (traceString="*") THEN
  12611. result.Dump(dump);
  12612. dump.Update
  12613. ELSE
  12614. Sections.DumpFiltered(dump, result, traceString);
  12615. END
  12616. END;
  12617. RETURN result
  12618. END ProcessIntermediateCodeModule;
  12619. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12620. BEGIN instructionSet := "Intermediate";
  12621. END GetDescription;
  12622. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  12623. BEGIN
  12624. SELF.newObjectFile := newObjectFile;
  12625. SELF.simpleMetaData := simpleMetaData;
  12626. END SetNewObjectFile;
  12627. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12628. BEGIN COPY(name, traceModuleName)
  12629. END SetTraceModuleName;
  12630. PROCEDURE DefineOptions*(options: Options.Options);
  12631. BEGIN
  12632. DefineOptions^(options);
  12633. options.Add(0X,"trace",Options.String);
  12634. options.Add(0X,"runtime",Options.String);
  12635. options.Add(0X,"newObjectFile",Options.Flag);
  12636. options.Add(0X,"traceModule",Options.String);
  12637. options.Add(0X,"profile",Options.Flag);
  12638. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12639. options.Add(0X,"noAsserts",Options.Flag);
  12640. options.Add(0X,"metaData",Options.String);
  12641. options.Add('o',"optimize", Options.Flag);
  12642. options.Add(0X,"preregisterStatic", Options.Flag);
  12643. options.Add(0X,"cellsAreObjects", Options.Flag);
  12644. options.Add(0X,"preciseGC", Options.Flag);
  12645. options.Add(0X,"trackLeave", Options.Flag);
  12646. options.Add(0X,"writeBarriers", Options.Flag);
  12647. options.Add(0X,"experiment", Options.Flag);
  12648. END DefineOptions;
  12649. PROCEDURE GetOptions*(options: Options.Options);
  12650. VAR name,string: SyntaxTree.IdentifierString;
  12651. BEGIN
  12652. GetOptions^(options);
  12653. trace := options.GetString("trace",traceString);
  12654. profile := options.GetFlag("profile");
  12655. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12656. noAsserts := options.GetFlag("noAsserts");
  12657. cooperative := options.GetFlag("cooperative");
  12658. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  12659. IF cooperative THEN
  12660. SetRuntimeModuleName("CPU") END
  12661. END;
  12662. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12663. simpleMetaData := TRUE
  12664. END;
  12665. IF options.GetString("metaData",string) THEN
  12666. IF string = "simple" THEN simpleMetaData := TRUE
  12667. ELSIF string ="full" THEN simpleMetaData := FALSE
  12668. END;
  12669. END;
  12670. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  12671. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12672. optimize := options.GetFlag("optimize");
  12673. preregisterStatic := options.GetFlag("preregisterStatic");
  12674. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12675. preciseGC := options.GetFlag("preciseGC");
  12676. trackLeave := options.GetFlag("trackLeave");
  12677. writeBarriers := options.GetFlag("writeBarriers");
  12678. experiment := options.GetFlag("experiment");
  12679. END GetOptions;
  12680. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12681. BEGIN RETURN SymbolFileFormat.Get()
  12682. END DefaultSymbolFileFormat;
  12683. END IntermediateBackend;
  12684. (* ----------------------------------- register allocation ------------------------------------- *)
  12685. (* register mapping scheme
  12686. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12687. spill offset
  12688. part(n) --> ticket <--> physical register
  12689. spill offset
  12690. *)
  12691. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12692. emptyOperand: IntermediateCode.Operand;
  12693. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12694. statCoopResetVariables: LONGINT;
  12695. statCoopModifyAssignments: LONGINT;
  12696. modifyAssignmentsPC : LONGINT;
  12697. statCoopNilCheck: LONGINT;
  12698. statCoopSwitch: LONGINT;
  12699. statCoopAssignProcedure: LONGINT;
  12700. statCoopTraceMethod: LONGINT;
  12701. statCoopResetProcedure: LONGINT;
  12702. statCoopTraceModule: LONGINT;
  12703. PROCEDURE ResetStatistics*;
  12704. BEGIN
  12705. statCoopResetVariables := 0;
  12706. statCoopModifyAssignments := 0;
  12707. statCoopNilCheck:= 0;
  12708. statCoopSwitch:= 0;
  12709. statCoopAssignProcedure:= 0;
  12710. statCoopTraceMethod:= 0;
  12711. statCoopResetProcedure:= 0;
  12712. statCoopTraceModule:= 0;
  12713. END ResetStatistics;
  12714. PROCEDURE Statistics*;
  12715. BEGIN
  12716. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12717. TRACE(statCoopNilCheck, statCoopSwitch);
  12718. TRACE(statCoopAssignProcedure,
  12719. statCoopTraceMethod,
  12720. statCoopResetProcedure,
  12721. statCoopTraceModule)
  12722. END Statistics;
  12723. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12724. VAR h: LONGINT;
  12725. BEGIN
  12726. WHILE b # 0 DO
  12727. h := a MOD b;
  12728. a := b;
  12729. b := h;
  12730. END;
  12731. RETURN a
  12732. END GCD;
  12733. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12734. BEGIN
  12735. RETURN a*b DIV GCD(a,b)
  12736. END SCM;
  12737. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12738. BEGIN
  12739. (*TRACE(a,b);*)
  12740. IF a = 0 THEN RETURN b
  12741. ELSIF b = 0 THEN RETURN a
  12742. ELSE RETURN SCM(a,b)
  12743. END;
  12744. END CommonAlignment;
  12745. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  12746. BEGIN
  12747. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12748. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12749. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12750. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12751. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12752. END
  12753. END PassBySingleReference;
  12754. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  12755. BEGIN
  12756. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  12757. END PassInRegister;
  12758. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12759. VAR new: RegisterEntry;
  12760. BEGIN
  12761. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12762. IF queue = NIL THEN
  12763. queue := new
  12764. ELSE
  12765. new.next := queue;
  12766. IF queue#NIL THEN queue.prev := new END;
  12767. queue := new
  12768. END;
  12769. END AddRegisterEntry;
  12770. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12771. VAR this: RegisterEntry;
  12772. BEGIN
  12773. this := queue;
  12774. WHILE (this # NIL) & (this.register # register) DO
  12775. this := this.next;
  12776. END;
  12777. IF this = NIL THEN
  12778. RETURN FALSE
  12779. END;
  12780. ASSERT(this # NIL);
  12781. IF this = queue THEN queue := queue.next END;
  12782. IF this.prev # NIL THEN this.prev.next := this.next END;
  12783. IF this.next # NIL THEN this.next.prev := this.prev END;
  12784. RETURN TRUE
  12785. END RemoveRegisterEntry;
  12786. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12787. BEGIN ASSERT(cond);
  12788. END Assert;
  12789. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12790. BEGIN
  12791. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12792. END ReusableRegister;
  12793. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12794. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12795. BEGIN
  12796. procedure := moduleScope.bodyProcedure;
  12797. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12798. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12799. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12800. procedure.SetScope(moduleScope);
  12801. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12802. procedure.SetAccess(SyntaxTree.Hidden);
  12803. moduleScope.SetBodyProcedure(procedure);
  12804. moduleScope.AddProcedure(procedure);
  12805. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12806. END;
  12807. END EnsureBodyProcedure;
  12808. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12809. VAR import: SyntaxTree.Import;
  12810. selfName: SyntaxTree.IdentifierString;
  12811. module: SyntaxTree.Module;
  12812. BEGIN
  12813. scope.ownerModule.GetName(selfName);
  12814. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12815. module := scope.ownerModule
  12816. ELSE
  12817. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12818. IF import = NIL THEN
  12819. RETURN NIL
  12820. ELSIF import.module = NIL THEN
  12821. RETURN NIL
  12822. ELSE module := import.module
  12823. END;
  12824. END;
  12825. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12826. END GetSymbol;
  12827. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12828. BEGIN
  12829. op.mode := mode;
  12830. IntermediateCode.InitOperand(op.op);
  12831. IntermediateCode.InitOperand(op.tag);
  12832. IntermediateCode.InitOperand(op.extra);
  12833. op.dimOffset := 0;
  12834. END InitOperand;
  12835. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12836. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12837. BEGIN RETURN IntermediateCode.GetType(system, type)
  12838. END GetType;
  12839. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12840. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12841. BEGIN
  12842. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12843. (*
  12844. UniqueId(name,module,name,adr);
  12845. *)
  12846. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12847. constant.SetValue(value);
  12848. constant.SetAccess(SyntaxTree.Hidden);
  12849. module.moduleScope.AddConstant(constant);
  12850. constant.SetScope(module.moduleScope);
  12851. RETURN constant
  12852. END BuildConstant;
  12853. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12854. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12855. BEGIN
  12856. variable := scope.firstVariable;
  12857. WHILE variable # NIL DO
  12858. IF variable.NeedsTrace() THEN
  12859. RETURN TRUE;
  12860. END;
  12861. variable := variable.nextVariable;
  12862. END;
  12863. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12864. WHILE parameter # NIL DO
  12865. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12866. RETURN TRUE;
  12867. END;
  12868. parameter := parameter.nextParameter;
  12869. END;
  12870. RETURN FALSE;
  12871. END HasPointers;
  12872. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12873. BEGIN RETURN (parameter.kind = SyntaxTree.VarParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ((parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) OR (parameter.type.resolved IS SyntaxTree.MathArrayType));
  12874. END IsVariableParameter;
  12875. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12876. VAR parameter: SyntaxTree.Parameter;
  12877. BEGIN
  12878. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12879. WHILE parameter # NIL DO
  12880. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12881. IF parameter.movable THEN RETURN TRUE END;
  12882. parameter := parameter.nextParameter;
  12883. END;
  12884. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12885. END HasVariableParameters;
  12886. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12887. BEGIN
  12888. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12889. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12890. END HasExplicitTraceMethod;
  12891. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12892. BEGIN
  12893. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12894. IF (expression IS SyntaxTree.IntegerValue) THEN
  12895. val := expression(SyntaxTree.IntegerValue).value;
  12896. RETURN TRUE
  12897. ELSE
  12898. RETURN FALSE
  12899. END;
  12900. END IsIntegerConstant;
  12901. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12902. BEGIN
  12903. IF val <= 0 THEN RETURN FALSE END;
  12904. exp := 0;
  12905. WHILE ~ODD(val) DO
  12906. val := val DIV 2;
  12907. INC(exp)
  12908. END;
  12909. RETURN val = 1
  12910. END PowerOf2;
  12911. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12912. VAR procedure: SyntaxTree.Procedure;
  12913. BEGIN
  12914. procedure := record.recordScope.constructor;
  12915. IF procedure = NIL THEN
  12916. record := record.GetBaseRecord();
  12917. IF record # NIL THEN
  12918. procedure := GetConstructor(record)
  12919. END;
  12920. END;
  12921. RETURN procedure;
  12922. END GetConstructor;
  12923. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12924. BEGIN
  12925. value := SHORT(op.intValue);
  12926. RETURN op.mode = IntermediateCode.ModeImmediate;
  12927. END IsIntegerImmediate;
  12928. (** whether a type strictily is a pointer to record or object type
  12929. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12930. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12931. BEGIN
  12932. IF type = NIL THEN
  12933. RETURN FALSE
  12934. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12935. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12936. ELSE
  12937. RETURN FALSE
  12938. END
  12939. END IsStrictlyPointerToRecord;
  12940. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12941. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12942. END IsUnsafePointer;
  12943. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12944. BEGIN type := type.resolved;
  12945. IF type IS SyntaxTree.PointerType THEN
  12946. type := type(SyntaxTree.PointerType).pointerBase;
  12947. type := type.resolved;
  12948. IF type IS SyntaxTree.RecordType THEN
  12949. recordType := type(SyntaxTree.RecordType);
  12950. RETURN TRUE
  12951. ELSE
  12952. RETURN FALSE
  12953. END
  12954. ELSIF type IS SyntaxTree.RecordType THEN
  12955. recordType := type(SyntaxTree.RecordType);
  12956. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12957. ELSIF type IS SyntaxTree.ObjectType THEN
  12958. RETURN TRUE
  12959. ELSIF type IS SyntaxTree.AnyType THEN
  12960. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12961. ELSE
  12962. RETURN FALSE
  12963. END;
  12964. END IsPointerToRecord;
  12965. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12966. BEGIN
  12967. type := type.resolved;
  12968. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12969. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12970. END IsArrayOfSystemByte;
  12971. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12972. BEGIN
  12973. IF type = NIL THEN RETURN FALSE END;
  12974. type := type.resolved;
  12975. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12976. END IsOpenArray;
  12977. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12978. BEGIN
  12979. IF type = NIL THEN RETURN FALSE END;
  12980. type := type.resolved;
  12981. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12982. END IsSemiDynamicArray;
  12983. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12984. BEGIN
  12985. IF type = NIL THEN RETURN FALSE END;
  12986. type := type.resolved;
  12987. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12988. END IsStaticArray;
  12989. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  12990. BEGIN
  12991. IF type = NIL THEN RETURN FALSE END;
  12992. type := type.resolved;
  12993. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  12994. END IsStaticMathArray;
  12995. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12996. BEGIN
  12997. WHILE (IsStaticMathArray(type)) DO
  12998. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12999. END;
  13000. RETURN type;
  13001. END StaticMathArrayBaseType;
  13002. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13003. VAR size: LONGINT;
  13004. BEGIN
  13005. size := 1;
  13006. WHILE (IsStaticArray(type)) DO
  13007. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  13008. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13009. END;
  13010. RETURN size;
  13011. END StaticArrayNumElements;
  13012. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13013. VAR size: LONGINT;
  13014. BEGIN
  13015. size := 1;
  13016. WHILE (IsStaticMathArray(type)) DO
  13017. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  13018. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13019. END;
  13020. RETURN size;
  13021. END StaticMathArrayNumElements;
  13022. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13023. BEGIN
  13024. WHILE (IsStaticArray(type)) DO
  13025. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13026. END;
  13027. RETURN type;
  13028. END StaticArrayBaseType;
  13029. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13030. BEGIN
  13031. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  13032. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13033. END;
  13034. RETURN type;
  13035. END ArrayBaseType;
  13036. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  13037. BEGIN
  13038. IF type = NIL THEN RETURN FALSE END;
  13039. type := type.resolved;
  13040. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  13041. END IsDelegate;
  13042. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  13043. VAR i: LONGINT;
  13044. BEGIN
  13045. i := 0; type := type.resolved;
  13046. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13047. INC(i);
  13048. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  13049. END;
  13050. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13051. INC(i);
  13052. type := type(SyntaxTree.MathArrayType).arrayBase;
  13053. IF type # NIL THEN type := type.resolved END;
  13054. END;
  13055. RETURN i
  13056. END DynamicDim;
  13057. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13058. BEGIN
  13059. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13060. type := type(SyntaxTree.ArrayType).arrayBase;
  13061. END;
  13062. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13063. type := type(SyntaxTree.MathArrayType).arrayBase;
  13064. END;
  13065. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13066. END StaticSize;
  13067. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13068. BEGIN
  13069. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13070. END IsImmediate;
  13071. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13072. BEGIN
  13073. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13074. END IsAddress;
  13075. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13076. BEGIN
  13077. RETURN (x.mode = IntermediateCode.ModeRegister);
  13078. END IsRegister;
  13079. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13080. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13081. BEGIN
  13082. typeDeclaration := recordType.typeDeclaration;
  13083. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13084. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13085. END GetRecordTypeName;
  13086. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13087. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13088. BEGIN
  13089. parSize := 0;
  13090. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13091. parameter := procedureType.returnParameter;
  13092. INC(parSize,system.SizeOfParameter(parameter));
  13093. parSize := parSize + (-parSize) MOD system.addressSize;
  13094. END;
  13095. parameter :=procedureType.lastParameter;
  13096. WHILE (parameter # NIL) DO
  13097. IF SysvABIorWINAPI(procedureType.callingConvention) THEN
  13098. INC(parSize, system.addressSize);
  13099. ELSE
  13100. INC(parSize,system.SizeOfParameter(parameter));
  13101. parSize := parSize + (-parSize) MOD system.addressSize;
  13102. END;
  13103. parameter := parameter.prevParameter;
  13104. END;
  13105. IF procedureType.selfParameter # NIL THEN
  13106. parameter := procedureType.selfParameter;
  13107. INC(parSize,system.SizeOfParameter(parameter));
  13108. parSize := parSize + (-parSize) MOD system.addressSize;
  13109. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13110. END; (* method => self pointer *)
  13111. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13112. RETURN ToMemoryUnits(system,parSize)
  13113. END ParametersSize;
  13114. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13115. BEGIN
  13116. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13117. END IsNested;
  13118. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13119. BEGIN
  13120. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13121. scope := scope.outerScope;
  13122. END;
  13123. RETURN scope # NIL;
  13124. END InCellScope;
  13125. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13126. BEGIN
  13127. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  13128. RETURN 0
  13129. ELSE
  13130. *)
  13131. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  13132. (*END;*)
  13133. END ProcedureParametersSize;
  13134. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13135. VAR dataUnit: LONGINT;
  13136. BEGIN dataUnit := system.dataUnit;
  13137. ASSERT(size MOD system.dataUnit = 0);
  13138. RETURN LONGINT(size DIV system.dataUnit)
  13139. END ToMemoryUnits;
  13140. PROCEDURE Get*(): Backend.Backend;
  13141. VAR backend: IntermediateBackend;
  13142. BEGIN NEW(backend); RETURN backend
  13143. END Get;
  13144. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13145. VAR instruction: IntermediateCode.Instruction;
  13146. BEGIN
  13147. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13148. RETURN instruction
  13149. END Nop;
  13150. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13151. VAR instruction: IntermediateCode.Instruction;
  13152. BEGIN
  13153. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13154. RETURN instruction
  13155. END Mov;
  13156. (* like Mov but ensures that no new register will be allocated for dest *)
  13157. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13158. VAR instruction: IntermediateCode.Instruction;
  13159. BEGIN
  13160. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13161. RETURN instruction
  13162. END MovReplace;
  13163. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13164. VAR instruction: IntermediateCode.Instruction;
  13165. BEGIN
  13166. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13167. RETURN instruction
  13168. END Conv;
  13169. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  13170. BEGIN
  13171. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  13172. END SysvABI;
  13173. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  13174. BEGIN
  13175. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  13176. END SysvABIorWINAPI;
  13177. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13178. VAR instruction: IntermediateCode.Instruction;
  13179. BEGIN
  13180. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13181. RETURN instruction
  13182. END Call;
  13183. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13184. VAR op1, op2, op3: IntermediateCode.Operand;
  13185. VAR instruction: IntermediateCode.Instruction;
  13186. BEGIN
  13187. IntermediateCode.InitNumber(op1,pcOffset);
  13188. IntermediateCode.InitNumber(op2,callingConvention);
  13189. IntermediateCode.InitNumber(op3,unwind);
  13190. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13191. RETURN instruction
  13192. END Exit;
  13193. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13194. VAR instruction: IntermediateCode.Instruction;
  13195. BEGIN
  13196. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13197. RETURN instruction
  13198. END Return;
  13199. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13200. VAR instruction: IntermediateCode.Instruction;
  13201. BEGIN
  13202. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13203. RETURN instruction
  13204. END Result;
  13205. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13206. VAR op1: IntermediateCode.Operand;
  13207. VAR instruction: IntermediateCode.Instruction;
  13208. BEGIN
  13209. IntermediateCode.InitNumber(op1,nr);
  13210. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13211. RETURN instruction
  13212. END Trap;
  13213. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13214. VAR instruction: IntermediateCode.Instruction;
  13215. BEGIN
  13216. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13217. RETURN instruction
  13218. END Br;
  13219. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13220. VAR instruction: IntermediateCode.Instruction;
  13221. BEGIN
  13222. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13223. RETURN instruction
  13224. END Breq;
  13225. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13226. VAR instruction: IntermediateCode.Instruction;
  13227. BEGIN
  13228. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13229. RETURN instruction
  13230. END Brne;
  13231. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13232. VAR instruction: IntermediateCode.Instruction;
  13233. BEGIN
  13234. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13235. RETURN instruction
  13236. END Brge;
  13237. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13238. VAR instruction: IntermediateCode.Instruction;
  13239. BEGIN
  13240. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13241. RETURN instruction
  13242. END Brlt;
  13243. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13244. VAR instruction: IntermediateCode.Instruction;
  13245. BEGIN
  13246. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13247. RETURN instruction
  13248. END Pop;
  13249. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13250. VAR instruction: IntermediateCode.Instruction;
  13251. BEGIN
  13252. ASSERT(op.mode # IntermediateCode.Undefined);
  13253. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13254. RETURN instruction
  13255. END Push;
  13256. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13257. VAR instruction: IntermediateCode.Instruction;
  13258. BEGIN
  13259. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13260. RETURN instruction
  13261. END Neg;
  13262. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13263. VAR instruction: IntermediateCode.Instruction;
  13264. BEGIN
  13265. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13266. RETURN instruction
  13267. END Not;
  13268. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13269. VAR instruction: IntermediateCode.Instruction;
  13270. BEGIN
  13271. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13272. RETURN instruction
  13273. END Abs;
  13274. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13275. VAR instruction: IntermediateCode.Instruction;
  13276. BEGIN
  13277. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13278. ASSERT(~IsImmediate(instruction.op1));
  13279. RETURN instruction
  13280. END Mul;
  13281. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13282. VAR instruction: IntermediateCode.Instruction;
  13283. BEGIN
  13284. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13285. RETURN instruction
  13286. END Div;
  13287. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13288. VAR instruction: IntermediateCode.Instruction;
  13289. BEGIN
  13290. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13291. RETURN instruction
  13292. END Mod;
  13293. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13294. VAR instruction: IntermediateCode.Instruction;
  13295. BEGIN
  13296. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13297. RETURN instruction
  13298. END Sub;
  13299. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13300. VAR instruction: IntermediateCode.Instruction;
  13301. BEGIN
  13302. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13303. RETURN instruction
  13304. END Add;
  13305. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13306. VAR instruction: IntermediateCode.Instruction;
  13307. BEGIN
  13308. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13309. RETURN instruction
  13310. END And;
  13311. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13312. VAR instruction: IntermediateCode.Instruction;
  13313. BEGIN
  13314. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13315. RETURN instruction
  13316. END Or;
  13317. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13318. VAR instruction: IntermediateCode.Instruction;
  13319. BEGIN
  13320. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13321. RETURN instruction
  13322. END Xor;
  13323. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13324. VAR instruction: IntermediateCode.Instruction;
  13325. BEGIN
  13326. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13327. RETURN instruction
  13328. END Shl;
  13329. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13330. VAR instruction: IntermediateCode.Instruction;
  13331. BEGIN
  13332. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13333. RETURN instruction
  13334. END Shr;
  13335. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13336. VAR instruction: IntermediateCode.Instruction;
  13337. BEGIN
  13338. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13339. RETURN instruction
  13340. END Rol;
  13341. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13342. VAR instruction: IntermediateCode.Instruction;
  13343. BEGIN
  13344. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13345. RETURN instruction
  13346. END Ror;
  13347. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13348. VAR instruction: IntermediateCode.Instruction;
  13349. BEGIN
  13350. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13351. RETURN instruction
  13352. END Cas;
  13353. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13354. VAR instruction: IntermediateCode.Instruction;
  13355. BEGIN
  13356. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13357. RETURN instruction
  13358. END Copy;
  13359. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13360. VAR instruction: IntermediateCode.Instruction;
  13361. BEGIN
  13362. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13363. RETURN instruction
  13364. END Fill;
  13365. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13366. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13367. BEGIN
  13368. string := IntermediateCode.String(s);
  13369. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13370. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13371. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13372. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13373. RETURN instruction
  13374. END Asm;
  13375. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13376. VAR instruction: IntermediateCode.Instruction;
  13377. BEGIN
  13378. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13379. RETURN instruction
  13380. END Data;
  13381. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13382. VAR instruction: IntermediateCode.Instruction;
  13383. BEGIN
  13384. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13385. IntermediateCode.SetSubType(instruction, subtype);
  13386. RETURN instruction
  13387. END SpecialInstruction;
  13388. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13389. VAR op1: IntermediateCode.Operand;
  13390. VAR instruction: IntermediateCode.Instruction;
  13391. BEGIN
  13392. (*! generate a warning if size exceeds a certain limit *)
  13393. (*
  13394. ASSERT(bytes < 1000000); (* sanity check *)
  13395. *)
  13396. ASSERT(0 <= units); (* sanity check *)
  13397. IntermediateCode.InitNumber(op1,units);
  13398. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13399. RETURN instruction
  13400. END Reserve;
  13401. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13402. VAR op1: IntermediateCode.Operand;
  13403. VAR instruction: IntermediateCode.Instruction;
  13404. BEGIN
  13405. IntermediateCode.InitNumber(op1,position.start);
  13406. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13407. RETURN instruction
  13408. END LabelInstruction;
  13409. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13410. VAR pc: LONGINT;
  13411. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13412. BEGIN
  13413. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13414. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13415. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13416. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13417. IF instr.op1.type.form = IntermediateCode.Float THEN
  13418. RETURN instr.op1.floatValue = op.floatValue
  13419. ELSE
  13420. RETURN instr.op1.intValue = op.intValue
  13421. END;
  13422. END ProvidesValue;
  13423. BEGIN
  13424. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13425. pc := 0;
  13426. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13427. INC(pc);
  13428. END;
  13429. IF pc = data.pc THEN
  13430. data.Emit(Data(Basic.invalidPosition,vop));
  13431. END;
  13432. RETURN pc
  13433. END EnterImmediate;
  13434. PROCEDURE Init;
  13435. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13436. BEGIN
  13437. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13438. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13439. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13440. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13441. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13442. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13443. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13444. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13445. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13446. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13447. IntermediateCode.InitOperand(emptyOperand);
  13448. FOR i := 0 TO NumberSystemCalls-1 DO
  13449. name := "@SystemCall";
  13450. Basic.AppendNumber(name,i);
  13451. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13452. END;
  13453. END Init;
  13454. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13455. BEGIN
  13456. RETURN (symbol # NIL) & symbol.NeedsSection();
  13457. END IsExported;
  13458. BEGIN
  13459. Init;
  13460. END FoxIntermediateBackend.
  13461. Compiler.Compile -p=Win32G FoxIntermediateBackend.Mod ~
  13462. # Release.Build --path="/temp/obg/" Win32G ~
  13463. # StaticLinker.Link --fileFormat=PE32 --fileName=A2H.exe --extension=GofW --displacement=401000H Runtime Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection GenericLoader BootConsole ~
  13464. FStols.CloseFiles A2Z.exe ~
  13465. SystemTools.FreeDownTo FoxIntermediateBackend ~
  13466. Compiler.Compile -p=Win32G --destPath=/temp/obg/ --traceModule=Trace
  13467. Runtime.Mod Trace.Mod Generic.Win32.Kernel32.Mod Win32.Machine.Mod Heaps.Mod
  13468. Generic.Modules.Mod Win32.Objects.Mod Win32.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13469. Commands.Mod I386.Reals.Mod Generic.Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13470. Win32.Traps.Mod Locks.Mod Win32.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13471. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13472. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Win32.User32.Mod
  13473. Win32.WinTrace.Mod Win32.ODBC.Mod Win32.Shell32.Mod Win32.SQL.Mod Win32.WinFS.Mod
  13474. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13475. GenericLinker.Mod GenericLoader.Mod BootConsole.Mod