FoxIntermediateBackend.Mod 579 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772107731077410775107761077710778107791078010781107821078310784107851078610787107881078910790107911079210793107941079510796107971079810799108001080110802108031080410805108061080710808108091081010811108121081310814108151081610817108181081910820108211082210823108241082510826108271082810829108301083110832108331083410835108361083710838108391084010841108421084310844108451084610847108481084910850108511085210853108541085510856108571085810859108601086110862108631086410865108661086710868108691087010871108721087310874108751087610877108781087910880108811088210883108841088510886108871088810889108901089110892108931089410895108961089710898108991090010901109021090310904109051090610907109081090910910109111091210913109141091510916109171091810919109201092110922109231092410925109261092710928109291093010931109321093310934109351093610937109381093910940109411094210943109441094510946109471094810949109501095110952109531095410955109561095710958109591096010961109621096310964109651096610967109681096910970109711097210973109741097510976109771097810979109801098110982109831098410985109861098710988109891099010991109921099310994109951099610997109981099911000110011100211003110041100511006110071100811009110101101111012110131101411015110161101711018110191102011021110221102311024110251102611027110281102911030110311103211033110341103511036110371103811039110401104111042110431104411045110461104711048110491105011051110521105311054110551105611057110581105911060110611106211063110641106511066110671106811069110701107111072110731107411075110761107711078110791108011081110821108311084110851108611087110881108911090110911109211093110941109511096110971109811099111001110111102111031110411105111061110711108111091111011111111121111311114111151111611117111181111911120111211112211123111241112511126111271112811129111301113111132111331113411135111361113711138111391114011141111421114311144111451114611147111481114911150111511115211153111541115511156111571115811159111601116111162111631116411165111661116711168111691117011171111721117311174111751117611177111781117911180111811118211183111841118511186111871118811189111901119111192111931119411195111961119711198111991120011201112021120311204112051120611207112081120911210112111121211213112141121511216112171121811219112201122111222112231122411225112261122711228112291123011231112321123311234112351123611237112381123911240112411124211243112441124511246112471124811249112501125111252112531125411255112561125711258112591126011261112621126311264112651126611267112681126911270112711127211273112741127511276112771127811279112801128111282112831128411285112861128711288112891129011291112921129311294112951129611297112981129911300113011130211303113041130511306113071130811309113101131111312113131131411315113161131711318113191132011321113221132311324113251132611327113281132911330113311133211333113341133511336113371133811339113401134111342113431134411345113461134711348113491135011351113521135311354113551135611357113581135911360113611136211363113641136511366113671136811369113701137111372113731137411375113761137711378113791138011381113821138311384113851138611387113881138911390113911139211393113941139511396113971139811399114001140111402114031140411405114061140711408114091141011411114121141311414114151141611417114181141911420114211142211423114241142511426114271142811429114301143111432114331143411435114361143711438114391144011441114421144311444114451144611447114481144911450114511145211453114541145511456114571145811459114601146111462114631146411465114661146711468114691147011471114721147311474114751147611477114781147911480114811148211483114841148511486114871148811489114901149111492114931149411495114961149711498114991150011501115021150311504115051150611507115081150911510115111151211513115141151511516115171151811519115201152111522115231152411525115261152711528115291153011531115321153311534115351153611537115381153911540115411154211543115441154511546115471154811549115501155111552115531155411555115561155711558115591156011561115621156311564115651156611567115681156911570115711157211573115741157511576115771157811579115801158111582115831158411585115861158711588115891159011591115921159311594115951159611597115981159911600116011160211603116041160511606116071160811609116101161111612116131161411615116161161711618116191162011621116221162311624116251162611627116281162911630116311163211633116341163511636116371163811639116401164111642116431164411645116461164711648116491165011651116521165311654116551165611657116581165911660116611166211663116641166511666116671166811669116701167111672116731167411675116761167711678116791168011681116821168311684116851168611687116881168911690116911169211693116941169511696116971169811699117001170111702117031170411705117061170711708117091171011711117121171311714117151171611717117181171911720117211172211723117241172511726117271172811729117301173111732117331173411735117361173711738117391174011741117421174311744117451174611747117481174911750117511175211753117541175511756117571175811759117601176111762117631176411765117661176711768117691177011771117721177311774117751177611777117781177911780117811178211783117841178511786117871178811789117901179111792117931179411795117961179711798117991180011801118021180311804118051180611807118081180911810118111181211813118141181511816118171181811819118201182111822118231182411825118261182711828118291183011831118321183311834118351183611837118381183911840118411184211843118441184511846118471184811849118501185111852118531185411855118561185711858118591186011861118621186311864118651186611867118681186911870118711187211873118741187511876118771187811879118801188111882118831188411885118861188711888118891189011891118921189311894118951189611897118981189911900119011190211903119041190511906119071190811909119101191111912119131191411915119161191711918119191192011921119221192311924119251192611927119281192911930119311193211933119341193511936119371193811939119401194111942119431194411945119461194711948119491195011951119521195311954119551195611957119581195911960119611196211963119641196511966119671196811969119701197111972119731197411975119761197711978119791198011981119821198311984119851198611987119881198911990119911199211993119941199511996119971199811999120001200112002120031200412005120061200712008120091201012011120121201312014120151201612017120181201912020120211202212023120241202512026120271202812029120301203112032120331203412035120361203712038120391204012041120421204312044120451204612047120481204912050120511205212053120541205512056120571205812059120601206112062120631206412065120661206712068120691207012071120721207312074120751207612077120781207912080120811208212083120841208512086120871208812089120901209112092120931209412095120961209712098120991210012101121021210312104121051210612107121081210912110121111211212113121141211512116121171211812119121201212112122121231212412125121261212712128121291213012131121321213312134121351213612137121381213912140121411214212143121441214512146121471214812149121501215112152121531215412155121561215712158121591216012161121621216312164121651216612167121681216912170121711217212173121741217512176121771217812179121801218112182121831218412185121861218712188121891219012191121921219312194121951219612197121981219912200122011220212203122041220512206122071220812209122101221112212122131221412215122161221712218122191222012221122221222312224122251222612227122281222912230122311223212233122341223512236122371223812239122401224112242122431224412245122461224712248122491225012251122521225312254122551225612257122581225912260122611226212263122641226512266122671226812269122701227112272122731227412275122761227712278122791228012281122821228312284122851228612287122881228912290122911229212293122941229512296122971229812299123001230112302123031230412305123061230712308123091231012311123121231312314123151231612317123181231912320123211232212323123241232512326123271232812329123301233112332123331233412335123361233712338123391234012341123421234312344123451234612347123481234912350123511235212353123541235512356123571235812359123601236112362123631236412365123661236712368123691237012371123721237312374123751237612377123781237912380123811238212383123841238512386123871238812389123901239112392123931239412395123961239712398123991240012401124021240312404124051240612407124081240912410124111241212413124141241512416124171241812419124201242112422124231242412425124261242712428124291243012431124321243312434124351243612437124381243912440124411244212443124441244512446124471244812449124501245112452124531245412455124561245712458124591246012461124621246312464124651246612467124681246912470124711247212473124741247512476124771247812479124801248112482124831248412485124861248712488124891249012491124921249312494124951249612497124981249912500125011250212503125041250512506125071250812509125101251112512125131251412515125161251712518125191252012521125221252312524125251252612527125281252912530125311253212533125341253512536125371253812539125401254112542125431254412545125461254712548125491255012551125521255312554125551255612557125581255912560125611256212563125641256512566125671256812569125701257112572125731257412575125761257712578125791258012581125821258312584125851258612587125881258912590125911259212593125941259512596125971259812599126001260112602126031260412605126061260712608126091261012611126121261312614126151261612617126181261912620126211262212623126241262512626126271262812629126301263112632126331263412635126361263712638126391264012641126421264312644126451264612647126481264912650126511265212653126541265512656126571265812659126601266112662126631266412665126661266712668126691267012671126721267312674126751267612677126781267912680126811268212683126841268512686126871268812689126901269112692126931269412695126961269712698126991270012701127021270312704127051270612707127081270912710127111271212713127141271512716127171271812719127201272112722127231272412725127261272712728127291273012731127321273312734127351273612737127381273912740127411274212743127441274512746127471274812749127501275112752127531275412755127561275712758127591276012761127621276312764127651276612767127681276912770127711277212773127741277512776127771277812779127801278112782127831278412785127861278712788127891279012791127921279312794127951279612797127981279912800128011280212803128041280512806128071280812809128101281112812128131281412815128161281712818128191282012821128221282312824128251282612827128281282912830128311283212833128341283512836128371283812839128401284112842128431284412845128461284712848128491285012851128521285312854128551285612857128581285912860128611286212863128641286512866128671286812869128701287112872128731287412875128761287712878128791288012881128821288312884128851288612887128881288912890128911289212893128941289512896128971289812899129001290112902129031290412905129061290712908129091291012911129121291312914129151291612917129181291912920129211292212923129241292512926129271292812929129301293112932129331293412935129361293712938129391294012941129421294312944129451294612947129481294912950129511295212953129541295512956129571295812959129601296112962129631296412965129661296712968129691297012971129721297312974129751297612977129781297912980129811298212983129841298512986129871298812989129901299112992129931299412995129961299712998129991300013001130021300313004130051300613007130081300913010130111301213013130141301513016130171301813019130201302113022130231302413025130261302713028130291303013031130321303313034130351303613037130381303913040130411304213043130441304513046130471304813049130501305113052130531305413055130561305713058130591306013061130621306313064130651306613067130681306913070130711307213073130741307513076130771307813079130801308113082130831308413085130861308713088130891309013091130921309313094130951309613097130981309913100131011310213103131041310513106131071310813109131101311113112131131311413115131161311713118131191312013121131221312313124131251312613127131281312913130131311313213133131341313513136131371313813139131401314113142131431314413145131461314713148131491315013151131521315313154131551315613157131581315913160131611316213163131641316513166131671316813169131701317113172131731317413175131761317713178131791318013181131821318313184131851318613187131881318913190131911319213193131941319513196131971319813199132001320113202132031320413205132061320713208132091321013211132121321313214132151321613217132181321913220132211322213223132241322513226132271322813229132301323113232132331323413235132361323713238132391324013241132421324313244132451324613247132481324913250132511325213253132541325513256132571325813259132601326113262132631326413265132661326713268132691327013271132721327313274132751327613277132781327913280132811328213283132841328513286132871328813289132901329113292132931329413295132961329713298132991330013301133021330313304133051330613307133081330913310133111331213313133141331513316133171331813319133201332113322133231332413325133261332713328133291333013331133321333313334133351333613337133381333913340133411334213343133441334513346133471334813349133501335113352133531335413355133561335713358133591336013361133621336313364133651336613367133681336913370133711337213373133741337513376133771337813379133801338113382133831338413385133861338713388133891339013391133921339313394133951339613397133981339913400134011340213403134041340513406134071340813409134101341113412134131341413415134161341713418134191342013421134221342313424134251342613427134281342913430134311343213433134341343513436134371343813439134401344113442134431344413445134461344713448134491345013451134521345313454134551345613457134581345913460134611346213463134641346513466134671346813469134701347113472134731347413475134761347713478134791348013481134821348313484134851348613487134881348913490134911349213493134941349513496134971349813499135001350113502135031350413505135061350713508135091351013511135121351313514135151351613517135181351913520135211352213523135241352513526135271352813529135301353113532135331353413535135361353713538135391354013541135421354313544135451354613547135481354913550135511355213553135541355513556135571355813559135601356113562135631356413565135661356713568135691357013571135721357313574135751357613577135781357913580135811358213583135841358513586135871358813589135901359113592135931359413595135961359713598135991360013601136021360313604136051360613607136081360913610136111361213613136141361513616136171361813619136201362113622136231362413625136261362713628136291363013631136321363313634136351363613637136381363913640136411364213643136441364513646136471364813649136501365113652136531365413655136561365713658136591366013661136621366313664136651366613667136681366913670136711367213673136741367513676136771367813679136801368113682136831368413685136861368713688136891369013691136921369313694136951369613697136981369913700137011370213703137041370513706137071370813709137101371113712137131371413715137161371713718137191372013721137221372313724137251372613727137281372913730137311373213733137341373513736137371373813739137401374113742137431374413745137461374713748137491375013751137521375313754137551375613757137581375913760137611376213763137641376513766137671376813769137701377113772137731377413775137761377713778137791378013781137821378313784137851378613787137881378913790137911379213793137941379513796137971379813799138001380113802138031380413805138061380713808138091381013811138121381313814138151381613817138181381913820138211382213823138241382513826138271382813829138301383113832138331383413835138361383713838138391384013841138421384313844138451384613847138481384913850138511385213853138541385513856138571385813859138601386113862138631386413865138661386713868138691387013871138721387313874138751387613877138781387913880138811388213883138841388513886138871388813889138901389113892138931389413895138961389713898138991390013901139021390313904139051390613907139081390913910139111391213913139141391513916139171391813919139201392113922139231392413925139261392713928139291393013931139321393313934139351393613937139381393913940139411394213943139441394513946139471394813949139501395113952139531395413955139561395713958139591396013961139621396313964139651396613967139681396913970139711397213973139741397513976139771397813979139801398113982139831398413985139861398713988139891399013991139921399313994139951399613997139981399914000140011400214003140041400514006140071400814009140101401114012140131401414015140161401714018140191402014021140221402314024140251402614027140281402914030140311403214033140341403514036140371403814039140401404114042140431404414045140461404714048140491405014051140521405314054140551405614057140581405914060140611406214063140641406514066140671406814069140701407114072140731407414075140761407714078140791408014081140821408314084140851408614087140881408914090140911409214093140941409514096140971409814099141001410114102141031410414105141061410714108141091411014111141121411314114141151411614117141181411914120141211412214123141241412514126141271412814129141301413114132141331413414135141361413714138141391414014141141421414314144141451414614147141481414914150141511415214153141541415514156141571415814159141601416114162141631416414165141661416714168141691417014171141721417314174141751417614177141781417914180141811418214183141841418514186141871418814189141901419114192141931419414195141961419714198141991420014201142021420314204142051420614207142081420914210142111421214213142141421514216142171421814219142201422114222142231422414225142261422714228142291423014231142321423314234142351423614237142381423914240142411424214243142441424514246142471424814249142501425114252142531425414255142561425714258142591426014261142621426314264142651426614267142681426914270142711427214273142741427514276142771427814279142801428114282142831428414285142861428714288142891429014291142921429314294142951429614297142981429914300143011430214303143041430514306143071430814309143101431114312143131431414315143161431714318143191432014321143221432314324143251432614327143281432914330143311433214333143341433514336143371433814339143401434114342143431434414345143461434714348143491435014351143521435314354143551435614357143581435914360143611436214363143641436514366143671436814369143701437114372143731437414375143761437714378143791438014381143821438314384143851438614387143881438914390143911439214393143941439514396143971439814399144001440114402144031440414405144061440714408144091441014411144121441314414144151441614417144181441914420144211442214423144241442514426144271442814429144301443114432144331443414435144361443714438144391444014441144421444314444144451444614447144481444914450144511445214453144541445514456144571445814459144601446114462144631446414465144661446714468144691447014471144721447314474144751447614477144781447914480144811448214483144841448514486144871448814489144901449114492144931449414495144961449714498144991450014501145021450314504145051450614507145081450914510145111451214513145141451514516145171451814519145201452114522145231452414525145261452714528145291453014531145321453314534145351453614537145381453914540145411454214543145441454514546145471454814549145501455114552145531455414555145561455714558145591456014561145621456314564145651456614567145681456914570145711457214573145741457514576145771457814579145801458114582145831458414585145861458714588145891459014591145921459314594145951459614597145981459914600146011460214603146041460514606146071460814609146101461114612146131461414615146161461714618146191462014621146221462314624146251462614627146281462914630146311463214633146341463514636146371463814639146401464114642146431464414645146461464714648146491465014651146521465314654146551465614657146581465914660146611466214663146641466514666146671466814669146701467114672146731467414675146761467714678146791468014681146821468314684146851468614687146881468914690146911469214693146941469514696146971469814699147001470114702147031470414705147061470714708147091471014711147121471314714147151471614717147181471914720147211472214723147241472514726147271472814729147301473114732147331473414735147361473714738147391474014741147421474314744147451474614747147481474914750147511475214753147541475514756147571475814759147601476114762147631476414765147661476714768147691477014771147721477314774147751477614777147781477914780147811478214783147841478514786147871478814789147901479114792147931479414795147961479714798
  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. SysvABI = {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention};
  96. SysvABIorWINAPI = {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention};
  97. TYPE
  98. Position=SyntaxTree.Position;
  99. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  100. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  101. Operand = RECORD
  102. mode: SHORTINT;
  103. op: IntermediateCode.Operand;
  104. tag: IntermediateCode.Operand;
  105. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  106. dimOffset: LONGINT;
  107. END;
  108. Fixup= POINTER TO RECORD
  109. pc: LONGINT;
  110. nextFixup: Fixup;
  111. END;
  112. WriteBackCall = POINTER TO RECORD
  113. call: SyntaxTree.ProcedureCallDesignator;
  114. next: WriteBackCall;
  115. END;
  116. Label= OBJECT
  117. VAR
  118. fixups: Fixup;
  119. section: IntermediateCode.Section;
  120. pc: LONGINT;
  121. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  122. BEGIN
  123. SELF.section := section; pc := -1;
  124. END InitLabel;
  125. PROCEDURE Resolve(pc: LONGINT);
  126. VAR at: LONGINT;
  127. BEGIN
  128. SELF.pc := pc;
  129. WHILE(fixups # NIL) DO
  130. at := fixups.pc;
  131. section.PatchAddress(at,pc);
  132. fixups := fixups.nextFixup;
  133. END;
  134. END Resolve;
  135. PROCEDURE AddFixup(at: LONGINT);
  136. VAR fixup: Fixup;
  137. BEGIN
  138. ASSERT(pc=-1);
  139. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  140. END AddFixup;
  141. END Label;
  142. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  143. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  144. VAR
  145. backend: IntermediateBackend;
  146. implementationVisitor: ImplementationVisitor;
  147. meta: MetaDataGenerator;
  148. system: Global.System;
  149. currentScope: SyntaxTree.Scope;
  150. module: Sections.Module;
  151. moduleSelf: SyntaxTree.Variable;
  152. dump: BOOLEAN;
  153. forceModuleBody: BOOLEAN;
  154. addressType: IntermediateCode.Type;
  155. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  156. BEGIN
  157. currentScope := NIL; module := NIL; moduleSelf := NIL;
  158. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  159. SELF.dump := dump;
  160. SELF.backend := backend;
  161. SELF.forceModuleBody := forceModuleBody;
  162. addressType := IntermediateCode.GetType(system,system.addressType)
  163. END Init;
  164. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  165. BEGIN
  166. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  167. END Error;
  168. PROCEDURE Type(x: SyntaxTree.Type);
  169. BEGIN
  170. x.Accept(SELF);
  171. END Type;
  172. (** types **)
  173. PROCEDURE VisitBasicType*(x: SyntaxTree.BasicType);
  174. BEGIN (* no code emission *) END VisitBasicType;
  175. PROCEDURE VisitCharacterType*(x: SyntaxTree.CharacterType);
  176. BEGIN (* no code emission *) END VisitCharacterType;
  177. PROCEDURE VisitIntegerType*(x: SyntaxTree.IntegerType);
  178. BEGIN (* no code emission *) END VisitIntegerType;
  179. PROCEDURE VisitFloatType*(x: SyntaxTree.FloatType);
  180. BEGIN (* no code emission *) END VisitFloatType;
  181. PROCEDURE VisitComplexType*(x: SyntaxTree.ComplexType);
  182. BEGIN (* no code emission *) END VisitComplexType;
  183. PROCEDURE VisitQualifiedType*(x: SyntaxTree.QualifiedType);
  184. VAR type: SyntaxTree.Type;
  185. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  186. type := x.resolved;
  187. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  188. meta.CheckTypeDeclaration(type);
  189. END;
  190. END VisitQualifiedType;
  191. PROCEDURE VisitStringType*(x: SyntaxTree.StringType);
  192. BEGIN (* no code emission *) END VisitStringType;
  193. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  194. BEGIN (* no code emission *)
  195. END VisitArrayRangeType;
  196. PROCEDURE VisitArrayType*(x: SyntaxTree.ArrayType);
  197. BEGIN (* no code emission *) END VisitArrayType;
  198. PROCEDURE VisitPortType*(x: SyntaxTree.PortType);
  199. BEGIN (* no code emission *) END VisitPortType;
  200. PROCEDURE VisitMathArrayType*(x: SyntaxTree.MathArrayType);
  201. BEGIN
  202. meta.CheckTypeDeclaration(x);
  203. END VisitMathArrayType;
  204. PROCEDURE VisitPointerType*(x: SyntaxTree.PointerType);
  205. BEGIN
  206. meta.CheckTypeDeclaration(x);
  207. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  208. END VisitPointerType;
  209. PROCEDURE VisitRecordType*(x: SyntaxTree.RecordType);
  210. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  211. BEGIN (* no code emission *)
  212. meta.CheckTypeDeclaration(x);
  213. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  214. IF x.pointerType.typeDeclaration # NIL THEN
  215. td := x.pointerType.typeDeclaration
  216. ELSE
  217. td := x.typeDeclaration
  218. END;
  219. Global.GetSymbolName(td,name);
  220. (* code section for object *)
  221. END;
  222. Scope(x.recordScope);
  223. END VisitRecordType;
  224. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  225. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  226. BEGIN
  227. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  228. WHILE (this # NIL) & (this.identifier# id) DO
  229. this := this.nextModifier;
  230. END;
  231. RETURN this # NIL
  232. END HasFlag;
  233. PROCEDURE VisitCellType*(x: SyntaxTree.CellType);
  234. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  235. BEGIN
  236. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  237. capabilities := {};
  238. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  239. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  240. backend.SetCapabilities(capabilities);
  241. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  242. Scope(x.cellScope);
  243. END;
  244. END VisitCellType;
  245. PROCEDURE VisitProcedureType*(x: SyntaxTree.ProcedureType);
  246. BEGIN (* no code emission *) END VisitProcedureType;
  247. PROCEDURE VisitEnumerationType*(x: SyntaxTree.EnumerationType);
  248. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  249. END VisitEnumerationType;
  250. (* symbols *)
  251. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  252. BEGIN
  253. Procedure(x);
  254. END VisitProcedure;
  255. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  256. BEGIN
  257. Procedure(x);
  258. END VisitOperator;
  259. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  260. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  261. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  262. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  263. BEGIN
  264. type := type.resolved;
  265. IF type IS SyntaxTree.RecordType THEN
  266. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  267. ELSIF (type IS SyntaxTree.ArrayType) THEN
  268. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  269. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  270. END;
  271. ELSIF type IS SyntaxTree.MathArrayType THEN
  272. WITH type: SyntaxTree.MathArrayType DO
  273. IF type.form = SyntaxTree.Open THEN
  274. RETURN TRUE
  275. ELSIF type.form = SyntaxTree.Static THEN
  276. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  277. END;
  278. END;
  279. END;
  280. RETURN FALSE
  281. END TypeNeedsInitialization;
  282. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  283. VAR variable: SyntaxTree.Variable;
  284. BEGIN
  285. variable := scope.firstVariable;
  286. WHILE variable # NIL DO
  287. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  288. IF variable.initializer # NIL THEN RETURN TRUE END;
  289. variable := variable.nextVariable;
  290. END;
  291. RETURN FALSE
  292. END ScopeNeedsInitialization;
  293. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  294. VAR size: LONGINT;
  295. BEGIN
  296. size := offset - lastUpdated;
  297. IF size > 0 THEN
  298. irv.Emit(Reserve(x.position,size));
  299. END;
  300. irv.Emit(Data(x.position, op));
  301. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  302. END SingleInitialize;
  303. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  304. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  305. BEGIN
  306. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  307. WITH type: SyntaxTree.RecordType DO
  308. baseType := type.baseType;
  309. IF baseType # NIL THEN
  310. baseType := baseType.resolved;
  311. IF baseType IS SyntaxTree.PointerType THEN
  312. baseType := baseType(SyntaxTree.PointerType).pointerBase
  313. END;
  314. Initialize(baseType,NIL, offset);
  315. END;
  316. variable := type.recordScope.firstVariable;
  317. WHILE variable # NIL DO
  318. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  319. variable := variable.nextVariable
  320. END;
  321. | type: SyntaxTree.ArrayType DO
  322. IF type.form = SyntaxTree.Static THEN
  323. baseType := type.arrayBase;
  324. IF TypeNeedsInitialization(baseType) THEN
  325. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  326. FOR i := 0 TO type.staticLength-1 DO
  327. Initialize(baseType,NIL,offset+i*size);
  328. END;
  329. END;
  330. END;
  331. | type: SyntaxTree.MathArrayType DO
  332. IF type.form = SyntaxTree.Open THEN
  333. dim := DynamicDim(type);
  334. baseType := SemanticChecker.ArrayBase(type,dim);
  335. imm := IntermediateCode.Immediate(addressType,dim);
  336. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  337. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  338. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  339. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  340. (* flags remain empty (=0) for open array *)
  341. ELSIF type.form = SyntaxTree.Static THEN
  342. baseType := type.arrayBase;
  343. IF TypeNeedsInitialization(baseType) THEN
  344. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  345. ASSERT(type.staticLength < 1024*1024*1024);
  346. FOR i := 0 TO type.staticLength-1 DO
  347. Initialize(baseType,NIL,offset+i*size);
  348. END;
  349. END;
  350. END;
  351. ELSE
  352. IF initializer # NIL THEN
  353. implementationVisitor.Evaluate(initializer, op);
  354. SingleInitialize(op.op, offset);
  355. END;
  356. END;
  357. END Initialize;
  358. BEGIN
  359. IF x.externalName # NIL THEN RETURN END;
  360. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  361. (* code section for variable *)
  362. Global.GetSymbolSegmentedName(x,name);
  363. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  364. irv.SetExported(IsExported(x));
  365. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  366. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  367. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  368. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  369. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  370. FOR i := 0 TO DynamicDim(x.type)-1 DO
  371. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  372. END;
  373. ELSE
  374. lastUpdated:= 0;
  375. IF implementationVisitor.newObjectFile & ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  376. Initialize(x.type, x.initializer, 0);
  377. END;
  378. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  379. IF size > 0 THEN
  380. irv.Emit(Reserve(x.position,size));
  381. END;
  382. IF ~x.fixed THEN
  383. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  384. ELSE
  385. align := x.alignment;
  386. END;
  387. irv.SetPositionOrAlignment(x.fixed, align);
  388. meta.CheckTypeDeclaration(x.type);
  389. END;
  390. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  391. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  392. END;
  393. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  394. END VisitVariable;
  395. PROCEDURE VisitProperty*(x: SyntaxTree.Property);
  396. BEGIN
  397. VisitVariable(x)
  398. END VisitProperty;
  399. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  400. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  401. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  402. BEGIN
  403. ASSERT(currentScope IS SyntaxTree.CellScope);
  404. Global.GetSymbolSegmentedName(x,name);
  405. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  406. irv.SetExported(IsExported(x));
  407. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  408. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  409. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  410. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  411. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  412. FOR i := 0 TO DynamicDim(x.type)-1 DO
  413. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  414. END;
  415. ELSE
  416. lastUpdated:= 0;
  417. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  418. IF size > 0 THEN
  419. irv.Emit(Reserve(x.position,size));
  420. END;
  421. IF ~x.fixed THEN
  422. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  423. ELSE
  424. align := x.alignment;
  425. END;
  426. irv.SetPositionOrAlignment(x.fixed, align);
  427. meta.CheckTypeDeclaration(x.type);
  428. END;
  429. END VisitParameter;
  430. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  431. BEGIN
  432. Type(x.declaredType); (* => code in objects *)
  433. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  434. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  435. END;
  436. END VisitTypeDeclaration;
  437. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  438. BEGIN
  439. IF (SyntaxTree.Public * x.access # {}) THEN
  440. implementationVisitor.VisitConstant(x);
  441. END;
  442. END VisitConstant;
  443. PROCEDURE Scope(x: SyntaxTree.Scope);
  444. VAR procedure: SyntaxTree.Procedure;
  445. constant: SyntaxTree.Constant;
  446. variable: SyntaxTree.Variable;
  447. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  448. cell: SyntaxTree.CellType;
  449. parameter: SyntaxTree.Parameter;
  450. property: SyntaxTree.Property;
  451. BEGIN
  452. prevScope := currentScope;
  453. currentScope := x;
  454. (* constants treated in implementation visitor *)
  455. WITH x: SyntaxTree.CellScope DO
  456. cell := x.ownerCell;
  457. parameter := cell.firstParameter;
  458. WHILE parameter # NIL DO
  459. VisitParameter(parameter);
  460. parameter := parameter.nextParameter;
  461. END;
  462. property := cell.firstProperty;
  463. WHILE property # NIL DO
  464. VisitProperty(property);
  465. property := property.nextProperty;
  466. END;
  467. ELSE
  468. END;
  469. typeDeclaration := x.firstTypeDeclaration;
  470. WHILE typeDeclaration # NIL DO
  471. VisitTypeDeclaration(typeDeclaration);
  472. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  473. END;
  474. variable := x.firstVariable;
  475. WHILE variable # NIL DO
  476. VisitVariable(variable);
  477. variable := variable.nextVariable;
  478. END;
  479. procedure := x.firstProcedure;
  480. WHILE procedure # NIL DO
  481. VisitProcedure(procedure);
  482. procedure := procedure.nextProcedure;
  483. END;
  484. constant := x.firstConstant;
  485. WHILE constant # NIL DO
  486. VisitConstant(constant);
  487. constant := constant.nextConstant;
  488. END;
  489. currentScope := prevScope;
  490. END Scope;
  491. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  492. VAR parameter: SyntaxTree.Parameter;
  493. BEGIN
  494. parameter := first;
  495. WHILE parameter # NIL DO
  496. VisitParameter(parameter);
  497. parameter := parameter.nextParameter;
  498. END;
  499. END Parameters;
  500. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  501. VAR scope: SyntaxTree.ProcedureScope;
  502. prevScope: SyntaxTree.Scope;
  503. inline, finalizer: BOOLEAN;
  504. procedureType: SyntaxTree.ProcedureType;
  505. pc: LONGINT;
  506. memorySize: Basic.Integer; stackSize: LONGINT;
  507. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  508. null,size,src,dest,fp,res: IntermediateCode.Operand;
  509. callingConvention: LONGINT;
  510. cellType: SyntaxTree.CellType;
  511. registerNumber: LONGINT;
  512. registerParameters: SIZE;
  513. registerClass: IntermediateCode.RegisterClass;
  514. type: IntermediateCode.Type;
  515. formalParameter: SyntaxTree.Parameter;
  516. recordType: SyntaxTree.RecordType;
  517. isModuleBody: BOOLEAN;
  518. parametersSize: LONGINT;
  519. position: LONGINT;
  520. variable: SyntaxTree.Variable;
  521. PROCEDURE Signature;
  522. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  523. BEGIN
  524. procedureType := x.type(SyntaxTree.ProcedureType);
  525. returnType := procedureType.returnType;
  526. IF returnType # NIL THEN
  527. meta.CheckTypeDeclaration(returnType)
  528. END;
  529. parameter := procedureType.firstParameter;
  530. WHILE parameter # NIL DO
  531. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  532. parameter := parameter.nextParameter;
  533. END;
  534. END Signature;
  535. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: Basic.Integer): BOOLEAN;
  536. VAR result: BOOLEAN;
  537. BEGIN
  538. result := FALSE;
  539. IF x = SyntaxTree.invalidExpression THEN
  540. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  541. result := TRUE;
  542. value := x.resolved(SyntaxTree.IntegerValue).value;
  543. ELSE
  544. Error(x.position,"expression is not an integer constant");
  545. END;
  546. RETURN result;
  547. END CheckIntegerValue;
  548. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: Basic.Integer): BOOLEAN;
  549. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  550. BEGIN
  551. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  552. WHILE (this # NIL) & (this.identifier # id) DO
  553. this := this.nextModifier;
  554. END;
  555. IF this # NIL THEN
  556. IF this.expression = NIL THEN
  557. Error(this.position,"expected expression value");
  558. ELSIF CheckIntegerValue(this.expression,value) THEN
  559. END;
  560. RETURN TRUE
  561. ELSE RETURN FALSE
  562. END;
  563. END HasValue;
  564. CONST DefaultDataMemorySize=512;
  565. BEGIN
  566. IF x.externalName # NIL THEN RETURN END;
  567. (*
  568. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  569. *)
  570. (* code section for this procedure *)
  571. position := x.position.start;
  572. scope := x.procedureScope;
  573. prevScope := currentScope;
  574. currentScope := scope;
  575. procedureType := x.type(SyntaxTree.ProcedureType);
  576. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  577. implementationVisitor.temporaries.Clear;
  578. implementationVisitor.usedRegisters := NIL;
  579. implementationVisitor.registerUsageCount.Init;
  580. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  581. IF (scope.body # NIL) & (x.isInline) THEN
  582. inline := TRUE;
  583. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  584. ir.SetExported(IsExported(x));
  585. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  586. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  587. IF backend.cellsAreObjects THEN
  588. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  589. ir.SetExported(IsExported(x));
  590. ELSE
  591. RETURN; (* cellnet cannot be compiled for final static hardware *)
  592. END;
  593. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  594. inline := FALSE;
  595. AddBodyCallStub(x);
  596. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  597. ir.SetExported(IsExported(x));
  598. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  599. inline := FALSE;
  600. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  601. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,memorySize) THEN memorySize := DefaultDataMemorySize END;
  602. AddBodyCallStub(x);
  603. AddStackAllocation(x,memorySize);
  604. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  605. ir.SetExported(IsExported(x));
  606. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  607. inline := FALSE;
  608. Parameters(procedureType.firstParameter);
  609. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  610. ir.SetExported(IsExported(x));
  611. ELSE
  612. inline := FALSE;
  613. IF x.isEntry OR x.isExit THEN
  614. IF x.isEntry THEN
  615. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  616. ELSE
  617. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  618. END;
  619. ir.SetExported(TRUE);
  620. ELSE
  621. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  622. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  623. END;
  624. END;
  625. callingConvention := procedureType.callingConvention;
  626. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  627. parametersSize := ProcedureParametersSize(backend.system,x);
  628. ELSE
  629. parametersSize := 0;
  630. END;
  631. IF scope.body # NIL THEN
  632. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  633. registerNumber := 0;
  634. IF ~inline THEN
  635. IF scope.lastVariable = NIL THEN
  636. stackSize := 0
  637. ELSE
  638. stackSize := scope.lastVariable.offsetInBits;
  639. IF stackSize <0 THEN stackSize := -stackSize END;
  640. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  641. END;
  642. (*
  643. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  644. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  645. *)
  646. (*
  647. ir.Emit(Nop(position)); (* placeholder for fill *)
  648. *)
  649. IF (callingConvention # SyntaxTree.OberonCallingConvention) & (~(callingConvention IN SysvABI) OR (system.addressSize # 64)) THEN
  650. registerParameters := backend.NumberParameterRegisters(callingConvention);
  651. (* assumption: registers are passed left to right and left parameters are in registers *)
  652. formalParameter := procedureType.firstParameter;
  653. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  654. IF ~PassInRegister(formalParameter, callingConvention) THEN
  655. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  656. ELSE
  657. IF formalParameter.type.IsRecordType() THEN
  658. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  659. type := addressType;
  660. ELSE
  661. type := GetType(system, formalParameter.type);
  662. END;
  663. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention, type, registerNumber));
  664. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  665. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  666. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  667. implementationVisitor.ReleaseIntermediateOperand(src);
  668. INC(registerNumber);
  669. formalParameter := formalParameter.nextParameter;
  670. END;
  671. END;
  672. END;
  673. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  674. implementationVisitor.EmitEnter(ir,x.position,x,callingConvention,ToMemoryUnits(system,stackSize),registerNumber);
  675. END;
  676. pc := ir.pc-1;
  677. IF (callingConvention IN SysvABI) & (system.addressSize = 64) THEN
  678. registerParameters := backend.NumberParameterRegisters(callingConvention);
  679. (* assumption: registers are passed left to right and left parameters are in registers *)
  680. formalParameter := procedureType.firstParameter;
  681. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  682. IF ~PassInRegister(formalParameter, callingConvention) THEN
  683. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  684. ELSE
  685. IF formalParameter.type.IsRecordType() THEN
  686. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  687. type := addressType;
  688. ELSE
  689. type := GetType(system, formalParameter.type);
  690. END;
  691. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention, type, registerNumber));
  692. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  693. implementationVisitor.currentScope := currentScope;
  694. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  695. formalParameter.SetOffset(variable.offsetInBits);
  696. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  697. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  698. implementationVisitor.ReleaseIntermediateOperand(src);
  699. INC(registerNumber);
  700. formalParameter := formalParameter.nextParameter;
  701. END;
  702. END;
  703. END;
  704. END;
  705. implementationVisitor.tagsAvailable := callingConvention = SyntaxTree.OberonCallingConvention;
  706. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  707. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  708. IF scope.lastVariable # NIL THEN
  709. stackSize := scope.lastVariable.offsetInBits;
  710. IF stackSize <0 THEN stackSize := -stackSize END;
  711. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  712. END;
  713. END;
  714. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  715. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  716. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  717. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  718. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  719. ir.EmitAt(pc,Push(size));
  720. implementationVisitor.StaticCallOperand(result,procedure);
  721. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  722. END;
  723. *)
  724. END;
  725. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  726. IF stackSize > 0 THEN
  727. IF (stackSize MOD system.addressSize = 0) THEN
  728. null := IntermediateCode.Immediate(addressType,0);
  729. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  730. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  731. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  732. ELSE
  733. null := IntermediateCode.Immediate(int8,0);
  734. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  735. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  736. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  737. END;
  738. (*! should potentially be called by backend -- enter might initialize
  739. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  740. *)
  741. END;
  742. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  743. parametersSize := ProcedureParametersSize(backend.system,x);
  744. ELSE
  745. parametersSize := 0;
  746. END;
  747. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  748. finalizer := FALSE;
  749. IF backend.cooperative & x.isFinalizer THEN
  750. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  751. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  752. GetRecordTypeName(recordType,name);
  753. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  754. END;
  755. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  756. IF backend.cooperative THEN
  757. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  758. IF implementationVisitor.profile & ~isModuleBody THEN
  759. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  760. END;
  761. END;
  762. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  763. IF finalizer THEN
  764. IF backend.hasLinkRegister THEN
  765. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  766. END;
  767. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  768. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  769. ir.Emit(Br(x.position,dest));
  770. ELSE
  771. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  772. END;
  773. ELSE
  774. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  775. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  776. END;
  777. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  778. IF backend.cooperative THEN
  779. IF HasPointers (scope) THEN
  780. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  781. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  782. ir.Emit(Result(x.position, res));
  783. ir.Emit(Push(x.position, res));
  784. implementationVisitor.ResetVariables(scope);
  785. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  786. ir.Emit(Pop(x.position, res));
  787. ir.Emit(Return(x.position, res));
  788. ELSE
  789. implementationVisitor.ResetVariables(scope);
  790. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  791. END;
  792. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  793. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  794. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  795. ir.Emit(Result(x.position, res));
  796. ir.Emit(Push(x.position, res));
  797. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  798. ir.Emit(Pop(x.position, res));
  799. ir.Emit(Return(x.position, res));
  800. ELSE
  801. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  802. END;
  803. END;
  804. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  805. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  806. ELSE
  807. ir.Emit(Nop(x.position));
  808. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  809. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  810. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  811. END;
  812. END;
  813. END
  814. END;
  815. ELSE (* force body for procedures *)
  816. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0,0);
  817. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  818. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  819. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  820. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  821. END;
  822. Scope(scope);
  823. Signature;
  824. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  825. currentScope := prevScope;
  826. END Procedure;
  827. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  828. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  829. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  830. BEGIN
  831. ASSERT (bodyProcedure # NIL);
  832. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  833. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  834. procedure.SetScope(bodyProcedure.scope);
  835. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  836. procedure.SetAccess(SyntaxTree.Hidden);
  837. Global.GetSymbolSegmentedName (procedure,name);
  838. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  839. ir.SetExported(TRUE);
  840. Global.GetSymbolSegmentedName (bodyProcedure,name);
  841. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  842. implementationVisitor.currentScope := module.module.moduleScope;
  843. implementationVisitor.section := ir;
  844. implementationVisitor.PushSelfPointer();
  845. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  846. ELSIF backend.preregisterStatic THEN
  847. implementationVisitor.currentScope := module.module.moduleScope;
  848. implementationVisitor.section := ir;
  849. implementationVisitor.PushSelfPointer();
  850. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  851. ELSE
  852. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  853. ir.Emit(Call(bodyProcedure.position,op, 0));
  854. END;
  855. END AddBodyCallStub;
  856. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  857. VAR name: Basic.SegmentedName;
  858. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  859. BEGIN
  860. Global.GetSymbolSegmentedName (symbol,name);
  861. Basic.RemoveSuffix(name);
  862. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  863. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  864. ir.SetExported(TRUE);
  865. IntermediateCode.InitImmediate(op,addressType,initStack);
  866. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  867. END AddStackAllocation;
  868. (** entry function to visit a complete module *)
  869. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  870. VAR
  871. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  872. hasDynamicOperatorDeclarations: BOOLEAN;
  873. operator: SyntaxTree.Operator;
  874. import: SyntaxTree.Import;
  875. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  876. BEGIN
  877. type := type.resolved;
  878. IF type IS SyntaxTree.RecordType THEN
  879. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  880. ELSIF (type IS SyntaxTree.ArrayType) THEN
  881. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  882. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  883. END;
  884. ELSIF type IS SyntaxTree.MathArrayType THEN
  885. WITH type: SyntaxTree.MathArrayType DO
  886. IF type.form = SyntaxTree.Open THEN
  887. RETURN TRUE
  888. ELSIF type.form = SyntaxTree.Static THEN
  889. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  890. END;
  891. END;
  892. END;
  893. RETURN FALSE
  894. END TypeNeedsInitialization;
  895. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  896. VAR variable: SyntaxTree.Variable;
  897. BEGIN
  898. variable := scope.firstVariable;
  899. WHILE variable # NIL DO
  900. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  901. IF variable.initializer # NIL THEN RETURN TRUE END;
  902. variable := variable.nextVariable;
  903. END;
  904. RETURN FALSE
  905. END ScopeNeedsInitialization;
  906. BEGIN
  907. ASSERT(x # NIL); ASSERT(module # NIL);
  908. SELF.module := module;
  909. (* add import names to the generated Sections.Module *)
  910. import := x.moduleScope.firstImport;
  911. WHILE import # NIL DO
  912. import.module.GetName(idstr);
  913. module.imports.AddName(idstr);
  914. import := import.nextImport
  915. END;
  916. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  917. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  918. moduleSelf := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@moduleSelf"));
  919. moduleSelf.SetType(system.anyType);
  920. moduleSelf.SetScope(x.moduleScope);
  921. moduleSelf.SetUntraced(TRUE);
  922. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  923. ir.SetExported(TRUE);
  924. IntermediateCode.InitImmediate(op,addressType,0);
  925. ir.Emit(Data(Basic.invalidPosition,op));
  926. END;
  927. implementationVisitor.module := module;
  928. implementationVisitor.moduleScope := x.moduleScope;
  929. implementationVisitor.moduleSelf := moduleSelf;
  930. implementationVisitor.canBeLoaded := TRUE;
  931. meta.SetModule(module);
  932. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  933. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  934. END;
  935. IF backend.profile THEN
  936. EnsureBodyProcedure(x.moduleScope);
  937. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  938. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  939. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  940. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  941. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  942. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  943. Global.GetModuleName(module.module,idstr);
  944. implementationVisitor.ProfilerAddModule(idstr);
  945. implementationVisitor.numberProcedures := 0;
  946. END;
  947. implementationVisitor.profile := backend.profile;
  948. (* check if there is at least one dynamic operator locally defined *)
  949. hasDynamicOperatorDeclarations := FALSE;
  950. operator := x.moduleScope.firstOperator;
  951. WHILE operator # NIL DO
  952. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  953. operator := operator.nextOperator
  954. END;
  955. (* add operator initialization code section *)
  956. IF hasDynamicOperatorDeclarations THEN
  957. EnsureBodyProcedure(x.moduleScope);
  958. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  959. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  960. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  961. END;
  962. Scope(x.moduleScope);
  963. IF hasDynamicOperatorDeclarations THEN
  964. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  965. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  966. END;
  967. IF backend.profile THEN
  968. implementationVisitor.ProfilerPatchInit;
  969. END;
  970. END Module;
  971. END DeclarationVisitor;
  972. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  973. RegisterUsageCount*=OBJECT
  974. VAR used: UsedArray; count: LONGINT;
  975. PROCEDURE &Init;
  976. VAR i: LONGINT;
  977. BEGIN
  978. count := 0;
  979. IF used = NIL THEN NEW(used,64); END;
  980. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  981. END Init;
  982. PROCEDURE Grow;
  983. VAR new: UsedArray; size,i: LONGINT;
  984. BEGIN
  985. size := LEN(used)*2;
  986. NEW(new,size);
  987. FOR i := 0 TO LEN(used)-1 DO
  988. new[i].count := used[i].count;
  989. new[i].type := used[i].type;
  990. new[i].map := used[i].map
  991. END;
  992. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  993. used := new
  994. END Grow;
  995. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  996. BEGIN
  997. INC(count);
  998. IF count = LEN(used) THEN Grow END;
  999. used[count].type := type;
  1000. used[count].class := class;
  1001. used[count].map := count;
  1002. RETURN count;
  1003. END Next;
  1004. PROCEDURE IncUse(register: LONGINT);
  1005. BEGIN
  1006. INC(used[register].count);
  1007. (*
  1008. IF (register = 1) & (count > 30) THEN
  1009. D.TraceBack;
  1010. END;
  1011. *)
  1012. END IncUse;
  1013. PROCEDURE DecUse(register: LONGINT);
  1014. BEGIN
  1015. DEC(used[register].count);
  1016. END DecUse;
  1017. PROCEDURE Map(register: LONGINT): LONGINT;
  1018. VAR map : LONGINT;
  1019. BEGIN
  1020. IF register > 0 THEN
  1021. map := used[register].map;
  1022. WHILE register # map DO register := map; map := used[register].map END;
  1023. END;
  1024. RETURN register
  1025. END Map;
  1026. PROCEDURE Use(register: LONGINT): LONGINT;
  1027. BEGIN
  1028. IF register< LEN(used) THEN
  1029. RETURN used[register].count
  1030. ELSE
  1031. RETURN 0
  1032. END
  1033. END Use;
  1034. END RegisterUsageCount;
  1035. RegisterEntry = POINTER TO RECORD
  1036. prev,next: RegisterEntry;
  1037. register: LONGINT;
  1038. registerClass: IntermediateCode.RegisterClass;
  1039. type: IntermediateCode.Type;
  1040. END;
  1041. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1042. Variables = OBJECT (Basic.List)
  1043. VAR
  1044. inUse: VariableUse;
  1045. registerIndex: LONGINT;
  1046. nameIndex: LONGINT;
  1047. PROCEDURE & Init;
  1048. VAR i: LONGINT;
  1049. BEGIN
  1050. InitList(16);
  1051. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1052. registerIndex := 1024;
  1053. nameIndex := 0;
  1054. END Init;
  1055. PROCEDURE Clear*;
  1056. VAR i: LONGINT;
  1057. BEGIN
  1058. Clear^;
  1059. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1060. registerIndex := 1024;
  1061. nameIndex := 0;
  1062. END Clear;
  1063. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1064. VAR string: SyntaxTree.IdentifierString ;
  1065. BEGIN
  1066. COPY("@hiddenIRVar",string);
  1067. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1068. RETURN SyntaxTree.NewIdentifier(string);
  1069. END GetUID;
  1070. PROCEDURE GetUsage(VAR use: VariableUse);
  1071. BEGIN
  1072. use := inUse;
  1073. END GetUsage;
  1074. PROCEDURE SetUsage(CONST use: VariableUse);
  1075. BEGIN
  1076. inUse := use;
  1077. END SetUsage;
  1078. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1079. VAR any: ANY;
  1080. BEGIN
  1081. any := Get(i);
  1082. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1083. END GetVariable;
  1084. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1085. BEGIN
  1086. Set(pos, v);
  1087. END SetVariable;
  1088. PROCEDURE Occupy(pos: LONGINT);
  1089. BEGIN
  1090. INCL(inUse[pos DIV 32], pos MOD 32);
  1091. END Occupy;
  1092. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1093. BEGIN
  1094. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1095. END Occupied;
  1096. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1097. BEGIN
  1098. Occupy(Length());
  1099. Add(v);
  1100. END AddVariable;
  1101. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1102. BEGIN
  1103. t1 := t1.resolved;
  1104. t2 := t2.resolved;
  1105. (*RETURN t1.SameType(t2); *)
  1106. RETURN
  1107. (t1.SameType(t2))
  1108. OR
  1109. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1110. OR
  1111. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits = t2.sizeInBits)
  1112. OR
  1113. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1114. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1115. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1116. OR
  1117. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1118. (DynamicDim(t1) = DynamicDim(t2))
  1119. );
  1120. END CompatibleType;
  1121. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1122. VAR var : SyntaxTree.Variable; i: LONGINT;
  1123. BEGIN
  1124. pos := Length();
  1125. FOR i := 0 TO pos-1 DO
  1126. IF ~(Occupied(i)) THEN
  1127. var := GetVariable(i);
  1128. IF CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1129. pos := i;
  1130. Occupy(i);
  1131. RETURN var;
  1132. END;
  1133. END;
  1134. END;
  1135. RETURN NIL
  1136. END GetFreeVariable;
  1137. END Variables;
  1138. SymbolMap = POINTER TO RECORD
  1139. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1140. isAddress: BOOLEAN;
  1141. END;
  1142. SymbolMapper = OBJECT
  1143. VAR
  1144. first: SymbolMap;
  1145. PROCEDURE & Init;
  1146. BEGIN
  1147. first := NIL;
  1148. END Init;
  1149. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1150. VAR new: SymbolMap;
  1151. BEGIN
  1152. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1153. new.next := first; first := new;
  1154. END Add;
  1155. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1156. VAR s: SymbolMap;
  1157. BEGIN
  1158. s := first;
  1159. WHILE (s # NIL) & (s.this # this) DO
  1160. s := s.next
  1161. END;
  1162. RETURN s
  1163. END Get;
  1164. END SymbolMapper;
  1165. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1166. VAR
  1167. system: Global.System;
  1168. section: IntermediateCode.Section;
  1169. module: Sections.Module;
  1170. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1171. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1172. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1173. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1174. checker: SemanticChecker.Checker;
  1175. backend: IntermediateBackend;
  1176. meta: MetaDataGenerator;
  1177. position: Position;
  1178. moduleSelf: SyntaxTree.Variable;
  1179. (* variables for hand over of variables / temporary state *)
  1180. currentScope: SyntaxTree.Scope;
  1181. constantDeclaration : SyntaxTree.Symbol;
  1182. result: Operand; (* result of the most recent expression / statement *)
  1183. destination: IntermediateCode.Operand;
  1184. arrayDestinationTag: IntermediateCode.Operand;
  1185. arrayDestinationDimension:LONGINT;
  1186. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1187. conditional: BOOLEAN;
  1188. trueLabel, falseLabel, exitLabel: Label;
  1189. locked: BOOLEAN;
  1190. (*
  1191. usedRegisters: Registers;
  1192. *)
  1193. registerUsageCount: RegisterUsageCount;
  1194. usedRegisters: RegisterEntry;
  1195. (* useful operands and types *)
  1196. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1197. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1198. commentPrintout: Printout.Printer;
  1199. dump: Streams.Writer;
  1200. tagsAvailable : BOOLEAN;
  1201. supportedInstruction: SupportedInstructionProcedure;
  1202. supportedImmediate: SupportedImmediateProcedure;
  1203. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1204. emitLabels: BOOLEAN;
  1205. runtimeModuleName : SyntaxTree.IdentifierString;
  1206. newObjectFile: BOOLEAN;
  1207. indexCounter: LONGINT;
  1208. profile: BOOLEAN;
  1209. profileId, profileInit: IntermediateCode.Section;
  1210. profileInitPatchPosition: LONGINT;
  1211. numberProcedures: LONGINT;
  1212. procedureResultDesignator : SyntaxTree.Designator;
  1213. operatorInitializationCodeSection: IntermediateCode.Section;
  1214. fingerPrinter: FingerPrinter.FingerPrinter;
  1215. temporaries: Variables;
  1216. canBeLoaded : BOOLEAN;
  1217. currentIsInline: BOOLEAN;
  1218. currentMapper: SymbolMapper;
  1219. currentInlineExit: Label;
  1220. moduleBodySection: IntermediateCode.Section;
  1221. NeedDescriptor : BOOLEAN;
  1222. cooperativeSwitches: BOOLEAN;
  1223. lastSwitchPC: LONGINT;
  1224. isUnchecked: BOOLEAN;
  1225. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1226. newObjectFile: BOOLEAN);
  1227. BEGIN
  1228. SELF.system := system;
  1229. SELF.runtimeModuleName := runtime;
  1230. currentScope := NIL;
  1231. hiddenPointerType := NIL;
  1232. delegatePointerType := NIL;
  1233. awaitProcCounter := 0;
  1234. labelId := 0; constId := 0; labelId := 0;
  1235. SELF.checker := checker;
  1236. SELF.backend := backend;
  1237. position := Basic.invalidPosition;
  1238. conditional := FALSE;
  1239. locked := FALSE;
  1240. InitOperand(result,ModeUndefined);
  1241. addressType := IntermediateCode.GetType(system,system.addressType);
  1242. setType := IntermediateCode.GetType(system,system.setType);
  1243. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1244. lenType := IntermediateCode.GetType(system, system.lenType);
  1245. byteType := IntermediateCode.GetType(system, system.byteType);
  1246. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1247. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1248. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1249. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1250. nil := IntermediateCode.Immediate(addressType,0);
  1251. one := IntermediateCode.Immediate(addressType,1);
  1252. IntermediateCode.InitOperand(destination);
  1253. tagsAvailable := TRUE;
  1254. supportedInstruction := supportedInstructionProcedure;
  1255. supportedImmediate := supportedImmediateProcedure;
  1256. inData := FALSE;
  1257. SELF.emitLabels := emitLabels;
  1258. IntermediateCode.InitOperand(arrayDestinationTag);
  1259. bool := IntermediateCode.GetType(system,system.booleanType);
  1260. IntermediateCode.InitImmediate(false,bool,0);
  1261. IntermediateCode.InitImmediate(true,bool,1);
  1262. SELF.newObjectFile := newObjectFile;
  1263. indexCounter := 0;
  1264. NEW(registerUsageCount);
  1265. usedRegisters := NIL;
  1266. procedureResultDesignator := NIL;
  1267. NEW(fingerPrinter);
  1268. NEW(temporaries);
  1269. currentIsInline := FALSE;
  1270. NeedDescriptor := FALSE;
  1271. isUnchecked := backend.noRuntimeChecks;
  1272. END Init;
  1273. TYPE Context = RECORD
  1274. section: IntermediateCode.Section;
  1275. registerUsageCount: RegisterUsageCount;
  1276. usedRegisters: RegisterEntry;
  1277. temporaries: Variables;
  1278. END;
  1279. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1280. VAR context: Context;
  1281. BEGIN
  1282. context.section := section;
  1283. context.registerUsageCount := registerUsageCount;
  1284. context.usedRegisters := usedRegisters;
  1285. context.temporaries := temporaries;
  1286. section := new;
  1287. NEW(registerUsageCount);
  1288. NEW(temporaries);
  1289. usedRegisters := NIL;
  1290. RETURN context;
  1291. END SwitchContext;
  1292. PROCEDURE ReturnToContext(context: Context);
  1293. BEGIN
  1294. section := context.section;
  1295. registerUsageCount := context.registerUsageCount;
  1296. usedRegisters := context.usedRegisters;
  1297. temporaries := context.temporaries;
  1298. END ReturnToContext;
  1299. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1300. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1301. BEGIN
  1302. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1303. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1304. END;
  1305. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1306. section.SetExported(IsExported(syntaxTreeSymbol));
  1307. RETURN section
  1308. END NewSection;
  1309. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1310. VAR new: LONGINT;
  1311. BEGIN
  1312. new := registerUsageCount.Next(type,class);
  1313. UseRegister(new);
  1314. RETURN new
  1315. END AcquireRegister;
  1316. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1317. VAR
  1318. fingerPrint: SyntaxTree.FingerPrint;
  1319. fingerPrintString: ARRAY 32 OF CHAR;
  1320. BEGIN
  1321. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1322. string := "[";
  1323. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1324. Strings.Append(string, fingerPrintString);
  1325. Strings.Append(string, "]");
  1326. END GetFingerprintString;
  1327. (** get the name for the code section that represens a certain symbol
  1328. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1329. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1330. VAR string: ARRAY 32 OF CHAR;
  1331. BEGIN
  1332. Global.GetSymbolSegmentedName(symbol, name);
  1333. (* if the symbol is an operator, then append the fingerprint to the name *)
  1334. IF symbol IS SyntaxTree.Operator THEN
  1335. GetFingerprintString(symbol, string);
  1336. Basic.AppendToSegmentedName(name,string);
  1337. END
  1338. END GetCodeSectionNameForSymbol;
  1339. (** get the name for the code section that represens a certain symbol
  1340. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1341. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1342. VAR string: ARRAY 32 OF CHAR;
  1343. BEGIN
  1344. Global.GetSymbolNameInScope(symbol, scope, name);
  1345. (* if the symbol is an operator, then append the fingerprint to the name *)
  1346. IF symbol IS SyntaxTree.Operator THEN
  1347. GetFingerprintString(symbol, string);
  1348. Strings.Append(name, string);
  1349. END
  1350. END GetCodeSectionNameForSymbolInScope;
  1351. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1352. BEGIN
  1353. IF dump # NIL THEN
  1354. dump.String("enter "); dump.String(s); dump.Ln;
  1355. END;
  1356. END TraceEnter;
  1357. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1358. BEGIN
  1359. IF dump # NIL THEN
  1360. dump.String("exit "); dump.String(s); dump.Ln;
  1361. END;
  1362. END TraceExit;
  1363. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1364. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1365. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1366. VAR i: LONGINT;
  1367. BEGIN
  1368. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1369. IF op.rule # NIL THEN
  1370. FOR i := 0 TO LEN(op.rule)-1 DO
  1371. CheckRegister(op.rule[i])
  1372. END;
  1373. END;
  1374. END CheckRegister;
  1375. BEGIN
  1376. CheckRegister(instruction.op1);
  1377. CheckRegister(instruction.op2);
  1378. CheckRegister(instruction.op3);
  1379. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1380. ELSE section.Emit(instruction);
  1381. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1382. END;
  1383. END Emit;
  1384. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1385. BEGIN
  1386. IF backend.cooperative THEN
  1387. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1388. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1389. ELSE
  1390. Emit(Trap(position,trapNo));
  1391. END;
  1392. END EmitTrap;
  1393. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1394. VAR name: Basic.SegmentedName;
  1395. VAR op1, op2, reg: IntermediateCode.Operand;
  1396. VAR call, nocall: Label;
  1397. VAR parametersSize: LONGINT;
  1398. VAR prevSection: IntermediateCode.Section;
  1399. VAR prevDump: Streams.Writer;
  1400. VAR body: SyntaxTree.Body;
  1401. VAR procedureType: SyntaxTree.ProcedureType;
  1402. BEGIN
  1403. IF procedure # NIL THEN
  1404. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1405. ELSE procedureType := NIL;
  1406. END;
  1407. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1408. prevSection := SELF.section;
  1409. SELF.section := section;
  1410. prevDump := dump;
  1411. dump := section.comments;
  1412. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1413. IF backend.hasLinkRegister THEN
  1414. Emit(Push(Basic.invalidPosition, lr));
  1415. END;
  1416. Emit(Push(Basic.invalidPosition,fp));
  1417. IF procedure # NIL THEN
  1418. body := procedure.procedureScope.body;
  1419. ELSE
  1420. body := NIL;
  1421. END;
  1422. IF backend.cooperative THEN
  1423. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1424. GetCodeSectionNameForSymbol(procedure, name);
  1425. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1426. ELSE
  1427. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1428. END;
  1429. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1430. IntermediateCode.AddOffset(op1, 1);
  1431. Emit(Push(Basic.invalidPosition,op1));
  1432. Emit(Mov(Basic.invalidPosition,fp, sp));
  1433. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1434. NEW(call, section);
  1435. NEW(nocall, section);
  1436. reg := NewRegisterOperand(addressType);
  1437. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1438. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1439. BrltL(call, sp, reg);
  1440. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1441. BrgeL(nocall, sp, op2);
  1442. call.Resolve(section.pc);
  1443. Emit(Push(Basic.invalidPosition, reg));
  1444. ReleaseIntermediateOperand(reg);
  1445. parametersSize := ProcParametersSize(procedure);
  1446. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1447. Emit(Push(Basic.invalidPosition, op2));
  1448. CallThis(position, "Activities","ExpandStack",2);
  1449. Emit(Result(Basic.invalidPosition, sp));
  1450. nocall.Resolve(section.pc);
  1451. END;
  1452. ELSE
  1453. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1454. Emit(Push(Basic.invalidPosition, one)) ;
  1455. procedureType.SetParametersOffset(1);
  1456. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1457. END;
  1458. Emit(Mov(Basic.invalidPosition, fp, sp));
  1459. END;
  1460. END;
  1461. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1462. SELF.section := prevSection;
  1463. dump := prevDump;
  1464. END EmitEnter;
  1465. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1466. VAR op1,op2: IntermediateCode.Operand;
  1467. VAR instruction: IntermediateCode.Instruction;
  1468. BEGIN
  1469. IntermediateCode.InitNumber(op1,callconv);
  1470. IntermediateCode.InitNumber(op2,varSize);
  1471. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1472. RETURN instruction
  1473. END Enter;
  1474. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1475. VAR op1: IntermediateCode.Operand;
  1476. VAR instruction: IntermediateCode.Instruction;
  1477. BEGIN
  1478. IntermediateCode.InitNumber(op1,callconv);
  1479. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1480. RETURN instruction
  1481. END Leave;
  1482. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1483. VAR prevSection: IntermediateCode.Section;
  1484. VAR op2, size: IntermediateCode.Operand;
  1485. VAR body: SyntaxTree.Body;
  1486. BEGIN
  1487. prevSection := SELF.section;
  1488. SELF.section := section;
  1489. Emit(Leave(position, callconv));
  1490. IF procedure # NIL THEN
  1491. body := procedure.procedureScope.body;
  1492. ELSE
  1493. body := NIL;
  1494. END;
  1495. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1496. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1497. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1498. Emit(Add(position, sp, fp, op2));
  1499. ELSE
  1500. Emit(Mov(position, sp, fp));
  1501. END;
  1502. Emit(Pop(position, fp));
  1503. END;
  1504. SELF.section := prevSection;
  1505. END EmitLeave;
  1506. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1507. VAR m: SymbolMap;
  1508. BEGIN
  1509. position := x.position;
  1510. IF currentIsInline THEN
  1511. m := currentMapper.Get(x);
  1512. IF m # NIL THEN
  1513. (*
  1514. Printout.Info("mapping from", x);
  1515. Printout.Info("mapping to ", m.to);
  1516. *)
  1517. m.to.Accept(SELF);
  1518. op := result;
  1519. IF m.tag # NIL THEN
  1520. ReleaseIntermediateOperand(result.tag);
  1521. m.tag.Accept(SELF);
  1522. op.tag := result.op;
  1523. ReleaseIntermediateOperand(result.tag);
  1524. END;
  1525. RETURN
  1526. END;
  1527. END;
  1528. x.Accept(SELF);
  1529. op := result;
  1530. END Symbol;
  1531. PROCEDURE Expression(x: SyntaxTree.Expression);
  1532. BEGIN
  1533. position := x.position;
  1534. constantDeclaration := NIL;
  1535. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1536. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1537. END;
  1538. IF x.resolved # NIL THEN
  1539. x.resolved.Accept(SELF)
  1540. ELSE
  1541. x.Accept(SELF)
  1542. END;
  1543. (* check this, was commented out in ActiveCells3 *)
  1544. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1545. Error(x.position, "unsupported modifier");
  1546. END;
  1547. END Expression;
  1548. (*
  1549. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1550. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1551. BEGIN
  1552. temporaries.GetUsage(current);
  1553. FOR i := 0 TO LEN(current)-1 DO
  1554. set := current[i] - previous[i];
  1555. IF set # {} THEN
  1556. FOR j := 0 TO MAX(SET)-1 DO
  1557. IF j IN set THEN
  1558. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1559. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1560. Symbol(variable, op);
  1561. MakeMemory(tmp,op.op,addressType,0);
  1562. ReleaseOperand(op);
  1563. Emit(Mov(position,tmp, nil ) );
  1564. ReleaseIntermediateOperand(tmp);
  1565. END;
  1566. END;
  1567. END;
  1568. END;
  1569. END;
  1570. END ResetUsedTemporaries;
  1571. *)
  1572. PROCEDURE Statement(x: SyntaxTree.Statement);
  1573. VAR use: VariableUse;
  1574. BEGIN
  1575. temporaries.GetUsage(use);
  1576. position := x.position;
  1577. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1578. IF commentPrintout # NIL THEN
  1579. commentPrintout.Statement(x);
  1580. dump.Ln;
  1581. (*dump.Update;*)
  1582. END;
  1583. x.Accept(SELF);
  1584. (*
  1585. CheckRegistersFree();
  1586. *)
  1587. (*ResetUsedTemporaries(use);*)
  1588. temporaries.SetUsage(use);
  1589. END Statement;
  1590. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1591. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1592. *)
  1593. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1594. BEGIN
  1595. ASSERT(op.mode # IntermediateCode.Undefined);
  1596. IF op.mode = IntermediateCode.ModeMemory THEN
  1597. ReuseCopy(res,op);
  1598. ELSE
  1599. res := op;
  1600. UseIntermediateOperand(res);
  1601. END;
  1602. IntermediateCode.AddOffset(res,offset);
  1603. IntermediateCode.MakeMemory(res,type);
  1604. END MakeMemory;
  1605. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1606. VAR mem: IntermediateCode.Operand;
  1607. BEGIN
  1608. MakeMemory(mem,res,type,offset);
  1609. ReleaseIntermediateOperand(res);
  1610. res := mem;
  1611. END ToMemory;
  1612. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1613. VAR mem: IntermediateCode.Operand;
  1614. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1615. componentType: SyntaxTree.Type;
  1616. BEGIN
  1617. type := type.resolved;
  1618. IF operand.mode = ModeReference THEN
  1619. IF type IS SyntaxTree.RangeType THEN
  1620. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1621. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1622. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1623. ReleaseOperand(operand);
  1624. operand.op := firstOp;
  1625. operand.tag := lastOp;
  1626. operand.extra := stepOp;
  1627. ELSIF type IS SyntaxTree.ComplexType THEN
  1628. componentType := type(SyntaxTree.ComplexType).componentType;
  1629. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1630. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1631. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1632. ReleaseOperand(operand);
  1633. operand.op := firstOp;
  1634. operand.tag := lastOp
  1635. ELSE
  1636. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1637. ReleaseIntermediateOperand(operand.op);
  1638. operand.op := mem;
  1639. END;
  1640. operand.mode := ModeValue;
  1641. END;
  1642. ASSERT(operand.mode = ModeValue);
  1643. END LoadValue;
  1644. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1645. VAR prevConditional: BOOLEAN;
  1646. BEGIN
  1647. prevConditional := conditional;
  1648. conditional := FALSE;
  1649. InitOperand(result, ModeUndefined);
  1650. Expression(x);
  1651. op := result;
  1652. LoadValue(op,x.type.resolved);
  1653. conditional := prevConditional;
  1654. END Evaluate;
  1655. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1656. VAR prevConditional: BOOLEAN;
  1657. BEGIN
  1658. prevConditional := conditional;
  1659. conditional := FALSE;
  1660. InitOperand(result,ModeUndefined);
  1661. Expression(x);
  1662. op := result;
  1663. (*
  1664. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1665. *)
  1666. conditional := prevConditional;
  1667. END Designate;
  1668. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1669. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1670. BEGIN
  1671. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1672. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1673. conditional := TRUE;
  1674. trueLabel := trueL; falseLabel := falseL;
  1675. Expression(x);
  1676. trueL := trueLabel; falseL := falseLabel;
  1677. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1678. END Condition;
  1679. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1680. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1681. BEGIN
  1682. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1683. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1684. RETURN op
  1685. END NewRegisterOperand;
  1686. PROCEDURE UnuseRegister(register: LONGINT);
  1687. BEGIN
  1688. IF (register > 0) THEN
  1689. register := registerUsageCount.Map(register);
  1690. registerUsageCount.DecUse(register);
  1691. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1692. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1693. END;
  1694. IF registerUsageCount.Use(register)=0 THEN
  1695. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1696. Warning(position, "register cannot be removed");
  1697. END;
  1698. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1699. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1700. END;
  1701. ELSIF registerUsageCount.Use(register)<0 THEN
  1702. Warning(position, "register removed too often");
  1703. IF dump # NIL THEN
  1704. dump.String("register removed too often"); dump.Ln; dump.Update;
  1705. END;
  1706. END;
  1707. END;
  1708. END UnuseRegister;
  1709. PROCEDURE UseRegister(register: LONGINT);
  1710. BEGIN
  1711. IF (register > 0) THEN
  1712. register := registerUsageCount.Map(register);
  1713. registerUsageCount.IncUse(register);
  1714. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1715. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1716. END;
  1717. IF registerUsageCount.Use(register)=1 THEN
  1718. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1719. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1720. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1721. END;
  1722. END;
  1723. END;
  1724. END UseRegister;
  1725. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1726. BEGIN
  1727. UnuseRegister(op.register)
  1728. END ReleaseIntermediateOperand;
  1729. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1730. BEGIN
  1731. UseRegister(op.register)
  1732. END UseIntermediateOperand;
  1733. PROCEDURE ReleaseOperand(CONST op: Operand);
  1734. BEGIN
  1735. UnuseRegister(op.op.register);
  1736. UnuseRegister(op.tag.register);
  1737. UnuseRegister(op.extra.register);
  1738. END ReleaseOperand;
  1739. (* save registers marked in array "markedRegisters" to the stack
  1740. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1741. *)
  1742. PROCEDURE SaveRegisters();
  1743. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1744. BEGIN
  1745. entry := usedRegisters;
  1746. WHILE entry # NIL DO
  1747. type := registerUsageCount.used[entry.register].type;
  1748. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1749. Emit(Push(position,op));
  1750. entry := entry.next;
  1751. END;
  1752. END SaveRegisters;
  1753. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1754. BEGIN
  1755. saved := usedRegisters;
  1756. usedRegisters := NIL;
  1757. END ReleaseUsedRegisters;
  1758. (** remove parameter registers from used queue *)
  1759. PROCEDURE ReleaseParameterRegisters;
  1760. VAR entry,prev,next: RegisterEntry;
  1761. BEGIN
  1762. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1763. WHILE entry # NIL DO
  1764. next := entry.next;
  1765. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1766. registerUsageCount.DecUse(entry.register);
  1767. ASSERT(registerUsageCount.Use(entry.register)=0);
  1768. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1769. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1770. END;
  1771. ELSIF prev = NIL THEN
  1772. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1773. ELSE
  1774. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1775. END;
  1776. entry := next;
  1777. END;
  1778. END ReleaseParameterRegisters;
  1779. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1780. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1781. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1782. BEGIN
  1783. entry := saved;
  1784. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1785. entry := prev;
  1786. WHILE entry # NIL DO
  1787. prev := entry.prev;
  1788. type := entry.type;
  1789. class := entry.registerClass;
  1790. IntermediateCode.InitRegister(op,type,class,entry.register);
  1791. (*
  1792. new := registerUsageCount.Next(type,class);
  1793. registerUsageCount.Remap(entry.register,new);
  1794. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1795. dump.String("remap register "); dump.Int(entry.register,1);
  1796. dump.String("to "); dump.Int(new,1);
  1797. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1798. END;
  1799. entry.register := new;
  1800. *)
  1801. Emit(Pop(position,op));
  1802. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1803. entry := prev;
  1804. END;
  1805. (*
  1806. usedRegisters := saved;
  1807. *)
  1808. END RestoreRegisters;
  1809. PROCEDURE CheckRegistersFree;
  1810. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1811. BEGIN
  1812. IF usedRegisters # NIL THEN
  1813. r := usedRegisters;
  1814. WHILE r # NIL DO
  1815. warning := "register ";
  1816. Strings.AppendInt(warning, r.register);
  1817. Strings.Append(warning, " not released.");
  1818. Warning(position,warning);
  1819. r := r .next;
  1820. END;
  1821. END;
  1822. FOR i := 0 TO registerUsageCount.count-1 DO
  1823. IF registerUsageCount.used[i].count < 0 THEN
  1824. warning := "register ";
  1825. Strings.AppendInt(warning, i);
  1826. Strings.Append(warning, " unused too often.");
  1827. Warning(position,warning);
  1828. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1829. warning := "register ";
  1830. Strings.AppendInt(warning, i);
  1831. Strings.Append(warning, " not unused often enough.");
  1832. Warning(position,warning);
  1833. END;
  1834. END;
  1835. END CheckRegistersFree;
  1836. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1837. Otherwise allocate a new register.
  1838. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1839. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1840. BEGIN
  1841. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1842. UseIntermediateOperand(result);
  1843. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1844. UseIntermediateOperand(result);
  1845. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1846. END;
  1847. END Reuse2;
  1848. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1849. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1850. If not then allocate a new register.
  1851. Does NOT necessarily keep the content of src1 or src2 in result!
  1852. *)
  1853. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1854. BEGIN
  1855. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1856. UseIntermediateOperand(result);
  1857. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1858. UseIntermediateOperand(result);
  1859. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1860. result := alternative; alternative := emptyOperand;
  1861. UseIntermediateOperand(result);
  1862. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1863. END;
  1864. END Reuse2a;
  1865. (* like reuse2 but only one source *)
  1866. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1867. BEGIN
  1868. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1869. UseIntermediateOperand(result);
  1870. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1871. END;
  1872. END Reuse1;
  1873. (* like reuse2a but only one source *)
  1874. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1875. BEGIN
  1876. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1877. UseIntermediateOperand(result);
  1878. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1879. UseIntermediateOperand(result);
  1880. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1881. END;
  1882. END Reuse1a;
  1883. (* like reuse1 but guarantees that content of src1 is in result *)
  1884. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1885. BEGIN
  1886. IF ReusableRegister(src1) THEN
  1887. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1888. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1889. UseIntermediateOperand(result);
  1890. ELSE
  1891. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1892. Emit(Mov(position,result,src1));
  1893. END
  1894. END ReuseCopy;
  1895. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1896. BEGIN
  1897. IF ReusableRegister(src) THEN
  1898. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1899. ELSE
  1900. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1901. Emit(Mov(position,result,src));
  1902. ReleaseIntermediateOperand(src);
  1903. END
  1904. END TransferToRegister;
  1905. (** labels and branches **)
  1906. PROCEDURE NewLabel(): Label;
  1907. VAR label: Label;
  1908. BEGIN
  1909. NEW(label,section); RETURN label;
  1910. END NewLabel;
  1911. PROCEDURE SetLabel(label: Label);
  1912. BEGIN label.Resolve(section.pc);
  1913. END SetLabel;
  1914. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1915. BEGIN
  1916. ASSERT(label # NIL);
  1917. IF label.pc < 0 THEN (* label not yet set *)
  1918. label.AddFixup(section.pc);
  1919. END;
  1920. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1921. END LabelOperand;
  1922. PROCEDURE BrL(label: Label);
  1923. BEGIN
  1924. Emit(Br(position,LabelOperand(label)));
  1925. END BrL;
  1926. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1927. BEGIN
  1928. Emit(Brge(position,LabelOperand(label),left,right));
  1929. END BrgeL;
  1930. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1931. BEGIN
  1932. Emit(Brlt(position,LabelOperand(label),left,right));
  1933. END BrltL;
  1934. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1935. BEGIN
  1936. Emit(Breq(position,LabelOperand(label),left,right));
  1937. END BreqL;
  1938. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1939. BEGIN
  1940. Emit(Brne(position,LabelOperand(label),left,right));
  1941. END BrneL;
  1942. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1943. VAR new: IntermediateCode.Operand;
  1944. BEGIN
  1945. IF Trace THEN TraceEnter("Convert") END;
  1946. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1947. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1948. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1949. & (operand.offset = 0)
  1950. THEN
  1951. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1952. Emit(Conv(position,new,operand));
  1953. ELSE
  1954. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1955. Emit(Conv(position,new,operand));
  1956. ReleaseIntermediateOperand(operand);
  1957. END;
  1958. operand := new;
  1959. 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
  1960. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1961. ELSE
  1962. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1963. Emit(Conv(position,new,operand));
  1964. ReleaseIntermediateOperand(operand);
  1965. operand := new;
  1966. END;
  1967. IF Trace THEN TraceExit("Convert") END;
  1968. END Convert;
  1969. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1970. VAR exit: Label;
  1971. BEGIN
  1972. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1973. exit := NewLabel();
  1974. br(exit,left,right);
  1975. EmitTrap(position,trapNo);
  1976. SetLabel(exit);
  1977. END TrapC;
  1978. (** expressions *)
  1979. (** emit necessary runtime check for set elements **)
  1980. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1981. VAR max: IntermediateCode.Operand;
  1982. BEGIN
  1983. IF isUnchecked THEN RETURN END;
  1984. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1985. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1986. TrapC(BrgeL, max, o, SetElementTrap);
  1987. END;
  1988. END CheckSetElement;
  1989. (** the set that a range represents **)
  1990. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1991. VAR
  1992. operand: Operand;
  1993. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1994. BEGIN
  1995. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1996. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1997. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1998. one := IntermediateCode.Immediate(setType, 1);
  1999. Evaluate(x, operand);
  2000. Convert(operand.op, setType);
  2001. Convert(operand.tag, setType);
  2002. CheckSetElement(operand.op);
  2003. CheckSetElement(operand.tag);
  2004. (* create mask for lower bound
  2005. i.e. shift 11111111 to the left by the value of the lower bound
  2006. *)
  2007. Reuse1(temp, operand.op);
  2008. Emit(Shl(position,temp, allBits, operand.op));
  2009. ReleaseIntermediateOperand(operand.op);
  2010. operand.op := temp;
  2011. (* create mask for upper bound
  2012. i.e. shift 11111111 to the right by the difference between the
  2013. upper bound and the maximum number of set elements
  2014. *)
  2015. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2016. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2017. Reuse1(temp, operand.tag);
  2018. ELSE
  2019. Reuse1(temp, operand.tag);
  2020. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2021. Emit(Sub(position,temp, size, operand.tag));
  2022. END;
  2023. Emit(Shr(position,temp, allBits, operand.tag));
  2024. ReleaseIntermediateOperand(operand.tag);
  2025. operand.tag := temp;
  2026. Reuse2(resultingSet, operand.op, operand.tag);
  2027. (* intersect the two masks *)
  2028. Emit(And(position,resultingSet, operand.op, operand.tag));
  2029. ReleaseOperand(operand);
  2030. RETURN resultingSet
  2031. END SetFromRange;
  2032. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2033. VAR
  2034. res, operand: Operand;
  2035. temp, one, noBits, dest: IntermediateCode.Operand;
  2036. expression: SyntaxTree.Expression;
  2037. i: LONGINT;
  2038. BEGIN
  2039. IF Trace THEN TraceEnter("VisitSet") END;
  2040. dest := destination;
  2041. destination := emptyOperand;
  2042. noBits := IntermediateCode.Immediate(setType, 0);
  2043. one := IntermediateCode.Immediate(setType, 1);
  2044. (* start off with the empty set *)
  2045. InitOperand(res, ModeValue);
  2046. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2047. Emit(Mov(position,res.op, noBits));
  2048. FOR i := 0 TO x.elements.Length() - 1 DO
  2049. expression := x.elements.GetExpression(i);
  2050. IF expression IS SyntaxTree.RangeExpression THEN
  2051. (* range of set elements *)
  2052. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2053. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2054. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2055. ReleaseIntermediateOperand(temp)
  2056. ELSE
  2057. (* singelton element *)
  2058. Evaluate(expression, operand);
  2059. Convert(operand.op, setType);
  2060. CheckSetElement(operand.op);
  2061. (* create subset containing single element *)
  2062. Reuse1(temp, operand.op);
  2063. Emit(Shl(position,temp, one, operand.op));
  2064. ReleaseOperand(operand);
  2065. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2066. ReleaseIntermediateOperand(temp);
  2067. END
  2068. END;
  2069. result := res;
  2070. destination := dest;
  2071. IF Trace THEN TraceExit("VisitSet") END;
  2072. END VisitSet;
  2073. (* math arrays of the form [a,b,c]
  2074. x is a static array and thus does not provide any pointers
  2075. *)
  2076. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2077. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2078. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2079. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2080. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2081. element: SyntaxTree.IntegerValue;
  2082. BEGIN
  2083. numberElements := x.elements.Length();
  2084. expression := index.parameters.GetExpression(dim);
  2085. element := expression(SyntaxTree.IntegerValue);
  2086. FOR i := 0 TO numberElements-1 DO
  2087. expression := x.elements.GetExpression(i);
  2088. element.SetValue(i);
  2089. IF expression IS SyntaxTree.MathArrayExpression THEN
  2090. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2091. ELSE
  2092. Assign(index,expression);
  2093. END;
  2094. END;
  2095. END RecursiveAssignment;
  2096. BEGIN
  2097. (*static math array not providing pointers anyway *)
  2098. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2099. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2100. designator.SetType(variable.type);
  2101. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  2102. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2103. FOR i := 0 TO dim-1 DO
  2104. element := SyntaxTree.NewIntegerValue(x.position,0);
  2105. element.SetType(system.longintType);
  2106. index.parameters.AddExpression(element);
  2107. END;
  2108. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2109. RecursiveAssignment(x,0);
  2110. Expression(designator);
  2111. END VisitMathArrayExpression;
  2112. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2113. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2114. BEGIN
  2115. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2116. dest := destination; destination := emptyOperand;
  2117. IF x.operator = Scanner.Not THEN
  2118. IF conditional THEN
  2119. Condition(x.left,falseLabel,trueLabel)
  2120. ELSE
  2121. Evaluate(x.left,operand);
  2122. InitOperand(result,ModeValue);
  2123. Reuse1a(result.op,operand.op,dest);
  2124. Emit(Xor(position,result.op,operand.op,true));
  2125. ReleaseOperand(operand);
  2126. END;
  2127. ELSIF x.operator = Scanner.Minus THEN
  2128. Evaluate(x.left,operand);
  2129. InitOperand(result,ModeValue);
  2130. Reuse1a(result.op,operand.op,dest);
  2131. type := x.left.type.resolved;
  2132. IF type IS SyntaxTree.SetType THEN
  2133. Emit(Not(position,result.op,operand.op));
  2134. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2135. Reuse1(result.tag,operand.tag);
  2136. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2137. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2138. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2139. Emit(Neg(position,result.op,operand.op));
  2140. ELSE HALT(200)
  2141. END;
  2142. ReleaseOperand(operand);
  2143. ELSIF x.operator = Scanner.Address THEN
  2144. Designate(x.left,operand);
  2145. operand.mode := ModeValue;
  2146. t0 := x.left.type.resolved;
  2147. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2148. ReleaseIntermediateOperand(operand.op);
  2149. operand.op := operand.tag;
  2150. IntermediateCode.InitOperand(operand.tag);
  2151. END;
  2152. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2153. result := operand;
  2154. ELSE HALT(100)
  2155. END;
  2156. destination := dest;
  2157. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2158. END VisitUnaryExpression;
  2159. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2160. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2161. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2162. BEGIN
  2163. type := type.resolved;
  2164. originalType := type;
  2165. IF type IS SyntaxTree.PointerType THEN
  2166. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2167. END;
  2168. IF type IS SyntaxTree.ObjectType THEN
  2169. BrL(trueL);
  2170. ELSE
  2171. ASSERT(type IS SyntaxTree.RecordType);
  2172. (*
  2173. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2174. *)
  2175. ReuseCopy(left,tag);
  2176. right := TypeDescriptorAdr(type);
  2177. IF ~newObjectFile THEN
  2178. IntermediateCode.MakeMemory(right,addressType);
  2179. END;
  2180. IF backend.cooperative THEN
  2181. repeatL := NewLabel();
  2182. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2183. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2184. END;
  2185. SetLabel(repeatL);
  2186. BreqL(trueL,left,right);
  2187. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2188. BrneL(repeatL,left,nil);
  2189. ELSIF meta.simple THEN
  2190. level := type(SyntaxTree.RecordType).Level();
  2191. (* get type desc tag of level relative to base tag *)
  2192. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2193. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2194. IntermediateCode.MakeMemory(left,addressType);
  2195. BreqL(trueL,left,right);
  2196. ELSE
  2197. level := type(SyntaxTree.RecordType).Level();
  2198. (* get type desc tag of level relative to base tag *)
  2199. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2200. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2201. IntermediateCode.MakeMemory(left,addressType);
  2202. BreqL(trueL,left,right);
  2203. END;
  2204. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2205. BrL(falseL);
  2206. END;
  2207. END TypeTest;
  2208. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2209. BEGIN
  2210. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2211. IF dump # NIL THEN
  2212. dump.String(s); dump.Ln;
  2213. END;
  2214. END Error;
  2215. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2216. BEGIN
  2217. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2218. IF dump # NIL THEN
  2219. dump.String(s); dump.Ln; dump.Update;
  2220. END;
  2221. END Warning;
  2222. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2223. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2224. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2225. operand:Operand;
  2226. BEGIN
  2227. previousSection := section;
  2228. Global.GetModuleName(mod,name);
  2229. Strings.Append(name,".@Trace");
  2230. Basic.ToSegmentedName(name, pooledName);
  2231. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2232. IF dump # NIL THEN dump := section.comments END;
  2233. IF backend.hasLinkRegister THEN
  2234. Emit(Push(Basic.invalidPosition, lr));
  2235. END;
  2236. variable := mod.moduleScope.firstVariable;
  2237. WHILE variable # NIL DO
  2238. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2239. Symbol(variable, operand);
  2240. register := operand.op;
  2241. CallTraceMethod(register, variable.type);
  2242. ReleaseIntermediateOperand(register);
  2243. END;
  2244. variable := variable.nextVariable;
  2245. END;
  2246. IF backend.hasLinkRegister THEN
  2247. Emit(Pop(Basic.invalidPosition, lr));
  2248. END;
  2249. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2250. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2251. Emit(Br(position,op));
  2252. INC(statCoopTraceModule, section.pc);
  2253. section := previousSection;
  2254. IF dump # NIL THEN dump := section.comments END;
  2255. END CreateTraceModuleMethod;
  2256. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2257. BEGIN
  2258. Emit (Push(position, dst));
  2259. Emit (Push(position, src));
  2260. CallThis(position,"GarbageCollector","Assign", 2);
  2261. END CallAssignPointer;
  2262. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2263. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2264. BEGIN
  2265. IF SemanticChecker.IsPointerType (type) THEN
  2266. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2267. ELSIF type.IsRecordType() THEN
  2268. Emit (Push(position,dst));
  2269. Emit (Push(position,src));
  2270. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2271. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2272. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2273. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2274. ELSIF IsStaticArray(type) THEN
  2275. size := StaticArrayNumElements(type);
  2276. base := StaticArrayBaseType(type);
  2277. IF base.IsRecordType() THEN
  2278. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2279. Emit (Push(position, dst));
  2280. Emit (Push(position, src));
  2281. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2282. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2283. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2284. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2285. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2286. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2287. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2288. Emit (Push(position, dst));
  2289. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2290. Emit (Push(position, src));
  2291. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2292. ELSE
  2293. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2294. Emit (Push(position, dst));
  2295. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2296. Emit (Push(position, src));
  2297. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2298. ASSERT(StaticArrayBaseType(type).IsPointer());
  2299. END;
  2300. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2301. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2302. Emit (Push(position, dst));
  2303. Emit (Push(position, src));
  2304. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2305. ELSE HALT(100); (* missing ? *)
  2306. END;
  2307. END CallAssignMethod;
  2308. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2309. VAR name: Basic.SegmentedName;
  2310. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2311. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2312. context: Context;
  2313. BEGIN
  2314. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2315. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2316. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2317. GetRecordTypeName (recordType,name);
  2318. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2319. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2320. IF dump # NIL THEN dump := section.comments END;
  2321. IF backend.hasLinkRegister THEN
  2322. Emit(Push(Basic.invalidPosition, lr));
  2323. END;
  2324. variable := recordType.recordScope.firstVariable;
  2325. WHILE variable # NIL DO
  2326. IF variable.NeedsTrace() THEN
  2327. dst := NewRegisterOperand (addressType);
  2328. src := NewRegisterOperand (addressType);
  2329. Emit (Mov(position, dst, parameter1));
  2330. Emit (Mov(position, src, parameter2));
  2331. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2332. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2333. CallAssignMethod(dst, src, variable.type);
  2334. ReleaseIntermediateOperand(src);
  2335. ReleaseIntermediateOperand(dst);
  2336. END;
  2337. variable := variable.nextVariable;
  2338. END;
  2339. recordBase := recordType.GetBaseRecord();
  2340. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2341. IF backend.hasLinkRegister THEN
  2342. Emit(Pop(Basic.invalidPosition, lr));
  2343. END;
  2344. GetRecordTypeName (recordBase,name);
  2345. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2346. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2347. Emit(Br(position,op));
  2348. ELSE
  2349. Emit(Exit(position,0,0, 0));
  2350. END;
  2351. IF ~recordType.isObject THEN
  2352. GetRecordTypeName (recordType,name);
  2353. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2354. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2355. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2356. NEW(registerUsageCount);
  2357. usedRegisters := NIL;
  2358. dst := NewRegisterOperand (addressType);
  2359. src := NewRegisterOperand (addressType);
  2360. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2361. Emit(Mov(position, dst, parameter1));
  2362. Emit(Mov(position, src, parameter2));
  2363. label := NewLabel();
  2364. SetLabel(label);
  2365. Emit(Push(position, dst));
  2366. Emit(Push(position, src));
  2367. GetRecordTypeName (recordType,name);
  2368. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2369. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2370. Emit(Call(position, op, 0));
  2371. Emit(Pop(position, src));
  2372. Emit(Pop(position, dst));
  2373. Emit(Add(position, dst, dst, ofs));
  2374. Emit(Add(position, src, src, ofs));
  2375. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2376. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2377. Emit(Exit(position,0,0, 0));
  2378. END;
  2379. INC(statCoopAssignProcedure, section.pc);
  2380. ReturnToContext(context);
  2381. IF dump # NIL THEN dump := section.comments END;
  2382. END CreateAssignProcedure;
  2383. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2384. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2385. BEGIN
  2386. IF IsUnsafePointer (type) THEN
  2387. skip := NewLabel();
  2388. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2389. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2390. BreqL (skip, op, nil);
  2391. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2392. SetLabel (skip);
  2393. ELSIF SemanticChecker.IsPointerType (type) THEN
  2394. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2395. CallThis(position,"GarbageCollector","Mark", 1);
  2396. ELSIF type.IsRecordType() THEN
  2397. Emit (Push(position,register));
  2398. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2399. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2400. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2401. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2402. ELSIF IsStaticArray(type) THEN
  2403. size := StaticArrayNumElements(type);
  2404. base := StaticArrayBaseType(type);
  2405. IF base.IsRecordType() THEN
  2406. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2407. Emit (Push(position, register));
  2408. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2409. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2410. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2411. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2412. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2413. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2414. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2415. Emit (Push(position, register));
  2416. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2417. ELSE
  2418. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2419. Emit (Push(position, register));
  2420. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2421. ASSERT(base.IsPointer());
  2422. END;
  2423. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2424. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2425. CallThis(position,"GarbageCollector","Mark", 1);
  2426. ELSE HALT(100); (* missing ? *)
  2427. END;
  2428. END CallTraceMethod;
  2429. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2430. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2431. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2432. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2433. BEGIN
  2434. previousSection := section;
  2435. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2436. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2437. GetRecordTypeName (recordType,name);
  2438. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2439. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2440. IF dump # NIL THEN dump := section.comments END;
  2441. IF backend.hasLinkRegister THEN
  2442. Emit(Push(Basic.invalidPosition, lr));
  2443. END;
  2444. variable := recordType.recordScope.firstVariable;
  2445. WHILE variable # NIL DO
  2446. IF variable.NeedsTrace() THEN
  2447. register := NewRegisterOperand (addressType);
  2448. Emit (Mov(position,register,parameter1));
  2449. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2450. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2451. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2452. END;
  2453. CallTraceMethod(register, variable.type);
  2454. ReleaseIntermediateOperand(register);
  2455. END;
  2456. variable := variable.nextVariable;
  2457. END;
  2458. recordBase := recordType.GetBaseRecord();
  2459. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2460. recordBase := recordBase.GetBaseRecord();
  2461. END;
  2462. IF recordBase # NIL THEN
  2463. IF backend.hasLinkRegister THEN
  2464. Emit(Pop(Basic.invalidPosition, lr));
  2465. END;
  2466. GetRecordTypeName (recordBase,name);
  2467. IF HasExplicitTraceMethod (recordBase) THEN
  2468. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2469. ELSE
  2470. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2471. END;
  2472. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2473. Emit(Br(position,op));
  2474. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2475. Emit(Exit(position,0,0,0));
  2476. ELSE
  2477. IF backend.hasLinkRegister THEN
  2478. Emit(Pop(Basic.invalidPosition, lr));
  2479. END;
  2480. IF recordType.isObject THEN
  2481. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2482. ELSE
  2483. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2484. END;
  2485. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2486. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2487. Emit(Br(position,op));
  2488. END;
  2489. IF ~recordType.isObject THEN
  2490. GetRecordTypeName (recordType,name);
  2491. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2492. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2493. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2494. NEW(registerUsageCount);
  2495. usedRegisters := NIL;
  2496. IF dump # NIL THEN dump := section.comments END;
  2497. register := NewRegisterOperand (addressType);
  2498. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2499. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2500. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2501. END;
  2502. Emit (Push(position,register));
  2503. GetRecordTypeName (recordType,name);
  2504. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2505. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2506. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2507. ReleaseIntermediateOperand(register);
  2508. Emit(Exit(position,0,0,0));
  2509. GetRecordTypeName (recordType,name);
  2510. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2511. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2512. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2513. NEW(registerUsageCount);
  2514. usedRegisters := NIL;
  2515. register := NewRegisterOperand (addressType);
  2516. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2517. Emit(Mov(position, register, parameter1));
  2518. label := NewLabel();
  2519. SetLabel(label);
  2520. Emit(Push(position, register));
  2521. GetRecordTypeName (recordType,name);
  2522. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2523. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2524. Emit(Call(position, op, 0));
  2525. Emit(Pop(position, register));
  2526. Emit(Add(position, register, register, ofs));
  2527. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2528. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2529. Emit(Exit(position,0,0,0));
  2530. END;
  2531. INC(statCoopTraceMethod, section.pc);
  2532. ReturnToContext(context);
  2533. IF dump # NIL THEN dump := section.comments END;
  2534. END CreateTraceMethod;
  2535. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2536. VAR name: Basic.SegmentedName;
  2537. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2538. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2539. context: Context;
  2540. BEGIN
  2541. IF recordType.isObject THEN RETURN END;
  2542. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2543. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2544. GetRecordTypeName (recordType,name);
  2545. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2546. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2547. IF dump # NIL THEN dump := section.comments END;
  2548. IF backend.hasLinkRegister THEN
  2549. Emit(Push(Basic.invalidPosition, lr));
  2550. END;
  2551. variable := recordType.recordScope.firstVariable;
  2552. WHILE variable # NIL DO
  2553. IF variable.NeedsTrace() THEN
  2554. dst := NewRegisterOperand (addressType);
  2555. Emit (Mov(position, dst, parameter1));
  2556. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2557. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2558. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2559. END;
  2560. CallResetProcedure(dst, nil, variable.type);
  2561. ReleaseIntermediateOperand(dst);
  2562. END;
  2563. variable := variable.nextVariable;
  2564. END;
  2565. recordBase := recordType.GetBaseRecord();
  2566. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2567. IF backend.hasLinkRegister THEN
  2568. Emit(Pop(Basic.invalidPosition, lr));
  2569. END;
  2570. GetRecordTypeName (recordBase,name);
  2571. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2572. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2573. Emit(Br(position,op));
  2574. ELSE
  2575. Emit(Exit(position,0,0, 0));
  2576. END;
  2577. GetRecordTypeName (recordType,name);
  2578. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2579. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2580. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2581. NEW(registerUsageCount);
  2582. usedRegisters := NIL;
  2583. dst := NewRegisterOperand (addressType);
  2584. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2585. Emit(Mov(position, dst, parameter1));
  2586. label := NewLabel();
  2587. SetLabel(label);
  2588. Emit(Push(position, dst));
  2589. GetRecordTypeName (recordType,name);
  2590. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2591. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2592. Emit(Call(position, op, 0));
  2593. Emit(Pop(position, dst));
  2594. Emit(Add(position, dst, dst, ofs));
  2595. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2596. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2597. Emit(Exit(position,0,0, 0));
  2598. INC(statCoopResetProcedure, section.pc);
  2599. ReturnToContext(context);
  2600. IF dump # NIL THEN dump := section.comments END;
  2601. END CreateResetProcedure;
  2602. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2603. VAR name: Basic.SegmentedName; context: Context;
  2604. BEGIN
  2605. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2606. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2607. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2608. IF dump # NIL THEN dump := section.comments END;
  2609. IF backend.hasLinkRegister THEN
  2610. Emit(Push(Basic.invalidPosition, lr));
  2611. END;
  2612. Emit(Push(position,fp));
  2613. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2614. ResetVariables(scope);
  2615. Emit(Pop(position,fp));
  2616. Emit(Exit(position,0,0, 0));
  2617. ReturnToContext(context);
  2618. IF dump # NIL THEN dump := section.comments END;
  2619. END CreateResetMethod;
  2620. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2621. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2622. BEGIN
  2623. IF SemanticChecker.IsPointerType (type) THEN
  2624. Emit (Push(position, dest));
  2625. CallThis(position,"GarbageCollector","Reset", 1);
  2626. ELSIF type.IsRecordType() THEN
  2627. Emit (Push(position, dest));
  2628. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2629. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2630. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2631. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2632. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2633. size := GetArrayLength(type, tag);
  2634. base := ArrayBaseType(type);
  2635. IF base.IsRecordType() THEN
  2636. Emit (Push(position, size));
  2637. Emit (Push(position, dest));
  2638. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2639. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2640. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2641. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2642. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2643. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2644. Emit (Push(position, size));
  2645. Emit (Push(position, dest));
  2646. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2647. ELSE
  2648. Emit (Push(position, size));
  2649. Emit (Push(position, dest));
  2650. CallThis(position,"GarbageCollector","ResetArray", 2);
  2651. ASSERT(ArrayBaseType(type).IsPointer());
  2652. END;
  2653. ReleaseIntermediateOperand(size);
  2654. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2655. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2656. Emit (Push(position, dest));
  2657. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2658. ELSE HALT(100); (* missing ? *)
  2659. END;
  2660. END CallResetProcedure;
  2661. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2662. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2663. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2664. VAR operand: Operand;
  2665. BEGIN
  2666. Symbol (symbol, operand);
  2667. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2668. ReleaseOperand(operand);
  2669. END Reset;
  2670. BEGIN
  2671. previousScope := currentScope;
  2672. currentScope := scope;
  2673. pc := section.pc;
  2674. variable := scope.firstVariable;
  2675. WHILE variable # NIL DO
  2676. IF variable.NeedsTrace() THEN
  2677. Reset (variable);
  2678. END;
  2679. variable := variable.nextVariable;
  2680. END;
  2681. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2682. WHILE parameter # NIL DO
  2683. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2684. Reset (parameter);
  2685. END;
  2686. parameter := parameter.nextParameter;
  2687. END;
  2688. INC(statCoopResetVariables, section.pc - pc);
  2689. currentScope := previousScope;
  2690. END ResetVariables;
  2691. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2692. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2693. VAR op: IntermediateCode.Operand; context: Context;
  2694. BEGIN
  2695. previousSection := section;
  2696. GetCodeSectionNameForSymbol(procedure, name);
  2697. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2698. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2699. IF dump # NIL THEN dump := section.comments END;
  2700. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2701. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2702. Emit(Data(position,op));
  2703. Emit(Data(position,nil));
  2704. IF HasPointers (procedure.procedureScope) THEN
  2705. GetCodeSectionNameForSymbol(procedure, name);
  2706. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2707. ELSE
  2708. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2709. END;
  2710. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2711. Emit(Data(position,op));
  2712. ReturnToContext(context);
  2713. IF dump # NIL THEN dump := section.comments END;
  2714. END CreateProcedureDescriptor;
  2715. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2716. VAR import: SyntaxTree.Import;
  2717. s: Basic.MessageString;
  2718. selfName: SyntaxTree.IdentifierString;
  2719. BEGIN
  2720. moduleScope.ownerModule.GetName(selfName);
  2721. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2722. module := moduleScope.ownerModule
  2723. ELSE
  2724. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2725. IF import = NIL THEN
  2726. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2727. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2728. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2729. s := "Module ";
  2730. Strings.Append(s,moduleName);
  2731. Strings.Append(s," cannot be imported.");
  2732. IF force THEN
  2733. Error(position,s);
  2734. ELSIF canBeLoaded THEN
  2735. IF WarningDynamicLoading THEN
  2736. Strings.Append(s, "=> no dynamic linking.");
  2737. Warning(position, s);
  2738. END;
  2739. canBeLoaded := FALSE;
  2740. END;
  2741. RETURN FALSE
  2742. ELSE
  2743. SELF.module.imports.AddName(moduleName)
  2744. END;
  2745. ELSIF import.module = NIL THEN (* already tried *)
  2746. RETURN FALSE
  2747. END;
  2748. module := import.module;
  2749. END;
  2750. RETURN TRUE
  2751. END AddImport;
  2752. (* needed for old binary object file format*)
  2753. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2754. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2755. BEGIN
  2756. IF AddImport(moduleName,module,TRUE) THEN
  2757. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2758. IF procedure = NIL THEN
  2759. s := "Instruction not supported on target, emulation procedure ";
  2760. Strings.Append(s,moduleName);
  2761. Strings.Append(s,".");
  2762. Strings.Append(s,procedureName);
  2763. Strings.Append(s," not present");
  2764. Error(position,s);
  2765. ELSE
  2766. StaticCallOperand(r,procedure);
  2767. ReleaseOperand(r);
  2768. fp := GetFingerprint(procedure);
  2769. END;
  2770. END;
  2771. END EnsureSymbol;
  2772. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2773. VAR exit: Label; trueL,falseL: Label;
  2774. BEGIN
  2775. trueL := NewLabel();
  2776. falseL := NewLabel();
  2777. exit := NewLabel();
  2778. Condition(x,trueL,falseL);
  2779. InitOperand(result,ModeValue);
  2780. SetLabel(trueL);
  2781. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2782. Emit(Mov(position,result.op,true));
  2783. BrL(exit);
  2784. SetLabel(falseL);
  2785. Emit(MovReplace(position,result.op,false));
  2786. SetLabel(exit);
  2787. END ConditionToValue;
  2788. PROCEDURE ValueToCondition(VAR op: Operand);
  2789. BEGIN
  2790. LoadValue(op,system.booleanType);
  2791. BrneL(trueLabel,op.op, false);
  2792. ReleaseOperand(op);
  2793. BrL(falseLabel);
  2794. END ValueToCondition;
  2795. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2796. VAR size: LONGINT;
  2797. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2798. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2799. BEGIN
  2800. ASSERT(type.form = SyntaxTree.Open);
  2801. baseType := type.arrayBase.resolved;
  2802. IF IsOpenArray(baseType) THEN
  2803. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2804. ELSE
  2805. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2806. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2807. END;
  2808. len := tag;
  2809. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2810. IntermediateCode.MakeMemory(len,addressType);
  2811. UseIntermediateOperand(len);
  2812. Reuse2(res,sizeOperand,len);
  2813. Emit(Mul(position,res,sizeOperand,len));
  2814. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2815. RETURN res
  2816. END GetArraySize;
  2817. BEGIN
  2818. type := type.resolved;
  2819. IF IsOpenArray(type) THEN
  2820. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2821. RETURN tag
  2822. ELSE
  2823. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2824. END;
  2825. ELSE
  2826. size := ToMemoryUnits(system,system.SizeOf(type));
  2827. RETURN IntermediateCode.Immediate(addressType,size)
  2828. END;
  2829. END GetDynamicSize;
  2830. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2831. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2832. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2833. BEGIN
  2834. ASSERT(type.form = SyntaxTree.Open);
  2835. baseType := type.arrayBase.resolved;
  2836. IF IsOpenArray(baseType) THEN
  2837. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2838. ELSE
  2839. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2840. END;
  2841. len := tag;
  2842. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2843. IntermediateCode.MakeMemory(len,addressType);
  2844. UseIntermediateOperand(len);
  2845. Reuse2(res,sizeOperand,len);
  2846. Emit(Mul(position,res,sizeOperand,len));
  2847. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2848. RETURN res
  2849. END GetLength;
  2850. BEGIN
  2851. type := type.resolved;
  2852. IF IsOpenArray(type) THEN
  2853. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2854. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2855. ELSIF type IS SyntaxTree.StringType THEN
  2856. RETURN tag;
  2857. ELSE
  2858. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2859. END;
  2860. END GetArrayLength;
  2861. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2862. VAR result: IntermediateCode.Operand;
  2863. BEGIN
  2864. IF backend.cooperative THEN
  2865. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2866. ELSE
  2867. MakeMemory(result, tag, addressType, 0);
  2868. END;
  2869. RETURN result
  2870. END GetSizeFromTag;
  2871. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2872. VAR parameter: SyntaxTree.Parameter;
  2873. BEGIN
  2874. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2875. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2876. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2877. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2878. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2879. END;
  2880. RETURN GetDynamicSize(e.type, tag);
  2881. END GetArrayOfBytesSize;
  2882. (*
  2883. to find imported symbol. not needed ?
  2884. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2885. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2886. BEGIN
  2887. IF AddImport(moduleName,importedModule,FALSE) THEN
  2888. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2889. RETURN symbol
  2890. ELSE
  2891. RETURN NIL
  2892. END
  2893. END SymbolByName;
  2894. *)
  2895. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2896. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2897. BEGIN
  2898. IF AddImport(moduleName,runtimeModule,force) THEN
  2899. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2900. IF procedure = NIL THEN
  2901. s := "Procedure ";
  2902. Strings.Append(s,moduleName);
  2903. Strings.Append(s,".");
  2904. Strings.Append(s,procedureName);
  2905. Strings.Append(s," not present");
  2906. Error(position,s);
  2907. RETURN FALSE
  2908. ELSE
  2909. RETURN TRUE
  2910. END;
  2911. ELSE RETURN FALSE
  2912. END;
  2913. END GetRuntimeProcedure;
  2914. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2915. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2916. s: Basic.MessageString;
  2917. BEGIN
  2918. Basic.InitSegmentedName(name);
  2919. name[0] := Basic.MakeString(moduleName);
  2920. name[1] := Basic.MakeString(typeName);
  2921. name[2] := -1;
  2922. IF AddImport(moduleName,importedModule, FALSE) THEN
  2923. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2924. IF symbol = NIL THEN
  2925. s := "type ";
  2926. Strings.Append(s,moduleName);
  2927. Strings.Append(s,".");
  2928. Strings.Append(s,typeName);
  2929. Strings.Append(s," not present");
  2930. Error(position,s);
  2931. END;
  2932. ELSE symbol := NIL;
  2933. END;
  2934. IF importedModule = moduleScope.ownerModule THEN
  2935. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2936. ELSE
  2937. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2938. END;
  2939. RETURN symbol
  2940. END GetTypeDescriptor;
  2941. (* 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. *)
  2942. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2943. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2944. pooledName: Basic.SegmentedName; size: LONGINT;
  2945. BEGIN
  2946. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2947. StaticCallOperand(result,procedure);
  2948. IF numberParameters < 0 THEN
  2949. size := ProcParametersSize(procedure);
  2950. ELSE
  2951. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2952. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  2953. Error(position,"runtime call parameter count mismatch");
  2954. END;
  2955. END;
  2956. Emit(Call(position, result.op, size));
  2957. ReleaseOperand(result);
  2958. ELSE (* only static linking possible *)
  2959. ASSERT(numberParameters >= 0);
  2960. Basic.InitSegmentedName(pooledName);
  2961. pooledName[0] := Basic.MakeString(moduleName);
  2962. pooledName[1] := Basic.MakeString(procedureName);
  2963. pooledName[2] := -1;
  2964. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2965. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2966. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2967. END;
  2968. END CallThisChecked;
  2969. (* 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. *)
  2970. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2971. BEGIN
  2972. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2973. END CallThis;
  2974. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2975. VAR
  2976. left,right: Operand;
  2977. leftSize, rightSize: IntermediateCode.Operand;
  2978. saved: RegisterEntry;
  2979. reg: IntermediateCode.Operand;
  2980. procedureName: SyntaxTree.IdentifierString;
  2981. BEGIN
  2982. procedureName := "CompareString";
  2983. SaveRegisters();ReleaseUsedRegisters(saved);
  2984. Designate(leftExpression,left);
  2985. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2986. Emit(Push(position,leftSize));
  2987. ReleaseIntermediateOperand(leftSize);
  2988. Emit(Push(position,left.op));
  2989. ReleaseOperand(left);
  2990. Designate(rightExpression,right);
  2991. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2992. Emit(Push(position,rightSize));
  2993. ReleaseIntermediateOperand(rightSize);
  2994. Emit(Push(position,right.op));
  2995. ReleaseOperand(right);
  2996. IF backend.cooperative THEN
  2997. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2998. ELSE
  2999. CallThis(position,runtimeModuleName,procedureName, 4);
  3000. END;
  3001. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3002. Emit(Result(position,reg));
  3003. (*
  3004. AcquireThisRegister(int8,IntermediateCode.Result);
  3005. *)
  3006. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  3007. (*
  3008. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  3009. *)
  3010. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  3011. ReleaseIntermediateOperand(reg);
  3012. BrL(falseLabel);
  3013. END CompareString;
  3014. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3015. VAR
  3016. left,right: Operand;
  3017. leftSize, rightSize: IntermediateCode.Operand;
  3018. saved: RegisterEntry;
  3019. procedureName: SyntaxTree.IdentifierString;
  3020. BEGIN
  3021. procedureName := "CopyString";
  3022. SaveRegisters();ReleaseUsedRegisters(saved);
  3023. Designate(leftExpression,left);
  3024. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3025. Emit(Push(position,leftSize));
  3026. ReleaseIntermediateOperand(leftSize);
  3027. Emit(Push(position,left.op));
  3028. ReleaseOperand(left);
  3029. Designate(rightExpression,right);
  3030. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3031. Emit(Push(position,rightSize));
  3032. ReleaseIntermediateOperand(rightSize);
  3033. Emit(Push(position,right.op));
  3034. ReleaseOperand(right);
  3035. IF backend.cooperative THEN
  3036. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  3037. ELSE
  3038. CallThis(position,runtimeModuleName,procedureName,4);
  3039. END;
  3040. RestoreRegisters(saved);
  3041. END CopyString;
  3042. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3043. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3044. leftType,rightType: SyntaxTree.Type;
  3045. leftExpression,rightExpression : SyntaxTree.Expression;
  3046. componentType: IntermediateCode.Type;
  3047. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3048. size: LONGINT;
  3049. BEGIN
  3050. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3051. dest := destination; destination := emptyOperand;
  3052. leftType := x.left.type.resolved;
  3053. rightType := x.right.type.resolved;
  3054. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3055. CASE x.operator OF
  3056. Scanner.Or:
  3057. (* shortcut evaluation of left OR right *)
  3058. IF ~conditional THEN ConditionToValue(x);
  3059. ELSE
  3060. next := NewLabel();
  3061. Condition(x.left,trueLabel,next);
  3062. SetLabel(next);
  3063. Condition(x.right,trueLabel,falseLabel);
  3064. END;
  3065. |Scanner.And:
  3066. (* shortcut evaluation of left & right *)
  3067. IF ~conditional THEN ConditionToValue(x);
  3068. ELSE
  3069. next := NewLabel();
  3070. Condition(x.left,next,falseLabel);
  3071. SetLabel(next);
  3072. Condition(x.right,trueLabel,falseLabel);
  3073. END;
  3074. |Scanner.Is:
  3075. IF ~conditional THEN ConditionToValue(x);
  3076. ELSE
  3077. (* get type desc tag *)
  3078. IF IsPointerToRecord(leftType,recordType) THEN
  3079. Evaluate(x.left,left);
  3080. Dereference(left,recordType,IsUnsafePointer(leftType))
  3081. ELSE
  3082. Designate(x.left,left);
  3083. END;
  3084. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3085. ReleaseOperand(left);
  3086. END;
  3087. |Scanner.Plus:
  3088. Evaluate(x.left,left);
  3089. Evaluate(x.right,right);
  3090. IF leftType IS SyntaxTree.SetType THEN
  3091. InitOperand(result,ModeValue);
  3092. Reuse2a(result.op,left.op,right.op,dest);
  3093. Emit(Or(position,result.op,left.op,right.op));
  3094. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3095. InitOperand(result,ModeValue);
  3096. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3097. Reuse2(result.tag,left.tag,right.tag);
  3098. Emit(Add(position,result.op,left.op,right.op));
  3099. Emit(Add(position,result.tag,left.tag,right.tag))
  3100. ELSE
  3101. InitOperand(result,ModeValue);
  3102. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3103. AddInt(result.op, left.op, right.op) ;
  3104. ELSE
  3105. *)
  3106. Reuse2a(result.op,left.op,right.op,dest);
  3107. Emit(Add(position,result.op,left.op,right.op));
  3108. (*
  3109. END;
  3110. *)
  3111. END;
  3112. ReleaseOperand(left); ReleaseOperand(right);
  3113. |Scanner.Minus:
  3114. Evaluate(x.left,left);
  3115. Evaluate(x.right,right);
  3116. IF leftType IS SyntaxTree.SetType THEN
  3117. InitOperand(result,ModeValue);
  3118. Reuse1(result.op,right.op);
  3119. Emit(Not(position,result.op,right.op));
  3120. ReleaseOperand(right);
  3121. Emit(And(position,result.op,result.op,left.op));
  3122. ReleaseOperand(left);
  3123. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3124. InitOperand(result,ModeValue);
  3125. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3126. Reuse2(result.tag,left.tag,right.tag);
  3127. Emit(Sub(position,result.op,left.op,right.op));
  3128. Emit(Sub(position,result.tag,left.tag,right.tag));
  3129. ReleaseOperand(left); ReleaseOperand(right)
  3130. ELSE
  3131. InitOperand(result,ModeValue);
  3132. Reuse2a(result.op,left.op,right.op,dest);
  3133. Emit(Sub(position,result.op,left.op,right.op));
  3134. ReleaseOperand(left); ReleaseOperand(right);
  3135. END;
  3136. |Scanner.Times:
  3137. Evaluate(x.left,left);
  3138. Evaluate(x.right,right);
  3139. IF leftType IS SyntaxTree.SetType THEN
  3140. InitOperand(result,ModeValue);
  3141. Reuse2a(result.op,left.op,right.op,dest);
  3142. Emit(And(position,result.op,left.op,right.op));
  3143. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3144. InitOperand(result, ModeValue);
  3145. componentType := left.op.type;
  3146. (* TODO: review this *)
  3147. (*
  3148. result.op = left.op * right.op - left.tag * right.tag
  3149. result.tag = left.tag * right.op + left.op * right.tag
  3150. *)
  3151. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3152. Emit(Mul(position,result.op, left.op, right.op));
  3153. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3154. Emit(Mul(position,tempReg, left.tag, right.tag));
  3155. Emit(Sub(position,result.op, result.op, tempReg));
  3156. Reuse2(result.tag, left.tag, right.op);
  3157. Emit(Mul(position,result.tag, left.tag, right.op));
  3158. Emit(Mul(position,tempReg, left.op, right.tag));
  3159. Emit(Add(position,result.tag, result.tag, tempReg));
  3160. ReleaseIntermediateOperand(tempReg)
  3161. ELSE
  3162. InitOperand(result,ModeValue);
  3163. Reuse2a(result.op,left.op,right.op,dest);
  3164. Emit(Mul(position,result.op,left.op,right.op));
  3165. END;
  3166. ReleaseOperand(left); ReleaseOperand(right);
  3167. |Scanner.Div:
  3168. Evaluate(x.left,left);
  3169. Evaluate(x.right,right);
  3170. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3171. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3172. IF ~isUnchecked THEN
  3173. exit := NewLabel();
  3174. BrltL(exit,zero,right.op);
  3175. EmitTrap(position,NegativeDivisorTrap);
  3176. SetLabel(exit);
  3177. END;
  3178. END;
  3179. InitOperand(result,ModeValue);
  3180. Reuse2a(result.op,left.op,right.op,dest);
  3181. Emit(Div(position,result.op,left.op,right.op));
  3182. ReleaseOperand(left); ReleaseOperand(right);
  3183. |Scanner.Mod:
  3184. Evaluate(x.left,left);
  3185. Evaluate(x.right,right);
  3186. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3187. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3188. IF ~isUnchecked THEN
  3189. exit := NewLabel();
  3190. BrltL(exit,zero,right.op);
  3191. EmitTrap(position,NegativeDivisorTrap);
  3192. SetLabel(exit);
  3193. END;
  3194. END;
  3195. InitOperand(result,ModeValue);
  3196. Reuse2a(result.op,left.op,right.op,dest);
  3197. Emit(Mod(position,result.op,left.op,right.op));
  3198. ReleaseOperand(left); ReleaseOperand(right);
  3199. |Scanner.Slash:
  3200. Evaluate(x.left,left);
  3201. Evaluate(x.right,right);
  3202. IF leftType IS SyntaxTree.SetType THEN
  3203. InitOperand(result,ModeValue);
  3204. Reuse2a(result.op,left.op,right.op,dest);
  3205. Emit(Xor(position,result.op,left.op,right.op));
  3206. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3207. InitOperand(result,ModeValue);
  3208. componentType := left.op.type;
  3209. (* review this *)
  3210. (*
  3211. divisor = right.op * right.op + right.tag * right.tag
  3212. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3213. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3214. *)
  3215. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3216. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3217. Emit(Mul(position,tempReg, right.op, right.op));
  3218. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3219. Emit(Add(position,tempReg, tempReg, tempReg2));
  3220. result.op := tempReg2;
  3221. Emit(Mul(position,result.op, left.op, right.op));
  3222. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3223. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3224. Emit(Add(position,result.op, result.op, tempReg2));
  3225. Emit(Div(position,result.op, result.op, tempReg));
  3226. Reuse2(result.tag, left.tag, right.op);
  3227. Emit(Mul(position,result.tag, left.tag, right.op));
  3228. Emit(Mul(position,tempReg2, left.op, right.tag));
  3229. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3230. Emit(Div(position,result.tag, result.tag, tempReg));
  3231. ReleaseIntermediateOperand(tempReg);
  3232. ReleaseIntermediateOperand(tempReg2)
  3233. ELSE
  3234. InitOperand(result,ModeValue);
  3235. Reuse2a(result.op,left.op,right.op,dest);
  3236. Emit(Div(position,result.op,left.op,right.op));
  3237. END;
  3238. ReleaseOperand(left); ReleaseOperand(right);
  3239. |Scanner.Equal:
  3240. IF ~conditional THEN ConditionToValue(x);
  3241. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3242. CompareString(BreqL,x.left,x.right);
  3243. ELSE
  3244. Evaluate(x.left,left);
  3245. Evaluate(x.right,right);
  3246. IF leftType IS SyntaxTree.RangeType THEN
  3247. ASSERT(rightType IS SyntaxTree.RangeType);
  3248. BrneL(falseLabel, left.op, right.op); (* first *)
  3249. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3250. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3251. ReleaseOperand(left); ReleaseOperand(right);
  3252. BrL(trueLabel)
  3253. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3254. BrneL(falseLabel, left.op, right.op); (* first *)
  3255. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3256. ReleaseOperand(left); ReleaseOperand(right);
  3257. BrL(trueLabel)
  3258. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3259. (* TODO: review this *)
  3260. BrneL(falseLabel, left.op, right.op); (* real part *)
  3261. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3262. ReleaseOperand(left); ReleaseOperand(right);
  3263. BrL(trueLabel)
  3264. ELSE
  3265. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3266. ReleaseOperand(left); ReleaseOperand(right);
  3267. BrL(trueLabel);
  3268. END;
  3269. END;
  3270. |Scanner.LessEqual:
  3271. IF ~conditional THEN ConditionToValue(x);
  3272. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3273. CompareString(BrgeL,x.right,x.left);
  3274. ELSE
  3275. Evaluate(x.left,left);
  3276. Evaluate(x.right,right);
  3277. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3278. Reuse1(temp.op,right.op);
  3279. Emit(And(position,temp.op,left.op,right.op));
  3280. ReleaseOperand(right);
  3281. BreqL(trueLabel,temp.op,left.op);
  3282. BrL(falseLabel);
  3283. ReleaseOperand(temp);ReleaseOperand(left);
  3284. ELSE
  3285. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3286. ReleaseOperand(left); ReleaseOperand(right);
  3287. BrL(trueLabel);
  3288. END;
  3289. END;
  3290. |Scanner.Less:
  3291. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3292. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3293. leftExpression.SetType(system.booleanType);
  3294. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3295. rightExpression.SetType(system.booleanType);
  3296. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3297. leftExpression.SetType(system.booleanType);
  3298. Expression(leftExpression);
  3299. ELSIF ~conditional THEN ConditionToValue(x);
  3300. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3301. CompareString(BrltL,x.left,x.right);
  3302. ELSE
  3303. Evaluate(x.left,left);
  3304. Evaluate(x.right,right);
  3305. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3306. ReleaseOperand(left); ReleaseOperand(right);
  3307. BrL(trueLabel);
  3308. END;
  3309. |Scanner.Greater:
  3310. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3311. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3312. leftExpression.SetType(system.booleanType);
  3313. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3314. rightExpression.SetType(system.booleanType);
  3315. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3316. leftExpression.SetType(system.booleanType);
  3317. Expression(leftExpression);
  3318. ELSIF ~conditional THEN ConditionToValue(x);
  3319. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3320. CompareString(BrltL,x.right,x.left);
  3321. ELSE
  3322. Evaluate(x.left,left);
  3323. Evaluate(x.right,right);
  3324. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3325. ReleaseOperand(left); ReleaseOperand(right);
  3326. BrL(trueLabel);
  3327. END;
  3328. |Scanner.GreaterEqual:
  3329. IF ~conditional THEN ConditionToValue(x);
  3330. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3331. CompareString(BrgeL,x.left,x.right);
  3332. ELSE
  3333. Evaluate(x.left,left);
  3334. Evaluate(x.right,right);
  3335. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3336. Reuse1(temp.op,left.op);
  3337. Emit(And(position,temp.op,left.op,right.op));
  3338. ReleaseOperand(left);
  3339. BreqL(trueLabel, temp.op,right.op);
  3340. ReleaseOperand(temp); ReleaseOperand(right);
  3341. BrL(falseLabel);
  3342. ELSE
  3343. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3344. ReleaseOperand(left); ReleaseOperand(right);
  3345. BrL(trueLabel);
  3346. END;
  3347. END;
  3348. |Scanner.Unequal:
  3349. IF ~conditional THEN ConditionToValue(x);
  3350. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3351. CompareString(BrneL,x.left,x.right);
  3352. ELSE
  3353. Evaluate(x.left,left);
  3354. Evaluate(x.right,right);
  3355. IF leftType IS SyntaxTree.RangeType THEN
  3356. ASSERT(rightType IS SyntaxTree.RangeType);
  3357. BrneL(trueLabel, left.op, right.op); (* first *)
  3358. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3359. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3360. ReleaseOperand(left); ReleaseOperand(right);
  3361. BrL(falseLabel)
  3362. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3363. BrneL(trueLabel, left.op, right.op); (* first *)
  3364. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3365. ReleaseOperand(left); ReleaseOperand(right);
  3366. BrL(falseLabel)
  3367. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3368. (* TODO: review this *)
  3369. BrneL(trueLabel, left.op, right.op); (* real part *)
  3370. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3371. ReleaseOperand(left); ReleaseOperand(right);
  3372. BrL(falseLabel)
  3373. ELSE
  3374. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3375. ReleaseOperand(left); ReleaseOperand(right);
  3376. BrL(trueLabel);
  3377. END;
  3378. END;
  3379. |Scanner.In:
  3380. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3381. Evaluate(x.left,left);
  3382. Evaluate(x.right,right);
  3383. Convert(left.op,setType);
  3384. Convert(right.op,setType);
  3385. ReuseCopy(temp.op,right.op);
  3386. Emit(Shr(position,temp.op,temp.op,left.op));
  3387. ReleaseOperand(right); ReleaseOperand(left);
  3388. IntermediateCode.InitImmediate(one,setType,1);
  3389. Emit(And(position,temp.op,temp.op,one));
  3390. IF conditional THEN
  3391. IntermediateCode.InitImmediate(zero,setType,0);
  3392. BrneL(trueLabel,temp.op,zero);
  3393. ReleaseOperand(temp);
  3394. BrL(falseLabel);
  3395. ELSE
  3396. Convert(temp.op,bool);
  3397. result.mode := ModeValue;
  3398. result.op := temp.op;
  3399. result.tag := nil; (* may be left over from calls to evaluate *)
  3400. END;
  3401. ELSE
  3402. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3403. IF x.operator = Scanner.Questionmarks THEN
  3404. leftExpression := x.left;
  3405. rightExpression := x.right;
  3406. ELSE
  3407. leftExpression := x.right;
  3408. rightExpression := x.left;
  3409. END;
  3410. Evaluate(leftExpression, left);
  3411. Emit(Push(position,left.op));
  3412. ReleaseOperand(left);
  3413. Designate(rightExpression, right);
  3414. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3415. IF ~backend.cellsAreObjects THEN
  3416. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3417. END;
  3418. Emit(Push(position,right.op));
  3419. ReleaseOperand(right);
  3420. IF backend.cellsAreObjects THEN
  3421. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3422. ELSE
  3423. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3424. END;
  3425. InitOperand(result, ModeValue);
  3426. result.op := NewRegisterOperand(bool);
  3427. Emit(Result(position,result.op));
  3428. IF conditional THEN
  3429. IntermediateCode.InitImmediate(zero,setType,0);
  3430. BrneL(trueLabel,result.op,zero);
  3431. ReleaseOperand(result);
  3432. BrL(falseLabel);
  3433. END;
  3434. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3435. leftExpression := x.left;
  3436. rightExpression := x.right;
  3437. Evaluate(leftExpression, left);
  3438. Emit(Push(position,left.op));
  3439. ReleaseOperand(left);
  3440. Evaluate(rightExpression, right);
  3441. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3442. IF ~backend.cellsAreObjects THEN
  3443. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3444. END;
  3445. Emit(Push(position,right.op));
  3446. ReleaseOperand(right);
  3447. IF backend.cellsAreObjects THEN
  3448. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3449. ELSE
  3450. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3451. END;
  3452. InitOperand(result, ModeValue);
  3453. result.op := NewRegisterOperand(bool);
  3454. Emit(Result(position,result.op));
  3455. IF conditional THEN
  3456. IntermediateCode.InitImmediate(zero,setType,0);
  3457. BrneL(trueLabel,result.op,zero);
  3458. ReleaseOperand(result);
  3459. BrL(falseLabel);
  3460. END;
  3461. ELSE
  3462. HALT(100);
  3463. END;
  3464. END;
  3465. destination := dest;
  3466. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3467. END VisitBinaryExpression;
  3468. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3469. VAR localResult, operand: Operand;
  3470. BEGIN
  3471. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3472. InitOperand(localResult, ModeValue);
  3473. ASSERT(x.first # NIL);
  3474. Evaluate(x.first, operand);
  3475. localResult.op := operand.op;
  3476. ReleaseOperand(operand);
  3477. UseIntermediateOperand(localResult.op);
  3478. ASSERT(x.last # NIL);
  3479. Evaluate(x.last, operand);
  3480. localResult.tag := operand.op;
  3481. ReleaseOperand(operand);
  3482. UseIntermediateOperand(localResult.tag);
  3483. IF x.step # NIL THEN
  3484. Evaluate(x.step, operand);
  3485. localResult.extra := operand.op;
  3486. ReleaseOperand(operand);
  3487. UseIntermediateOperand(localResult.extra);
  3488. END;
  3489. result := localResult;
  3490. IF Trace THEN TraceExit("VisitRangeExpression") END
  3491. END VisitRangeExpression;
  3492. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3493. BEGIN
  3494. HALT(100); (* should never be evaluated *)
  3495. END VisitTensorRangeExpression;
  3496. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3497. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3498. BEGIN
  3499. IF Trace THEN TraceEnter("VisitConversion") END;
  3500. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3501. dest := destination; destination := emptyOperand;
  3502. Evaluate(x.expression,old);
  3503. InitOperand(result,ModeValue);
  3504. result.op := old.op;
  3505. ASSERT(result.op.mode # 0);
  3506. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3507. (* convert TO a complex number *)
  3508. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3509. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3510. ASSERT(result.op.mode # 0);
  3511. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3512. (* convert FROM a complex number TO a complex number*)
  3513. result.tag := old.tag;
  3514. ASSERT(result.tag.mode # 0);
  3515. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3516. ASSERT(result.tag.mode # 0)
  3517. ELSE
  3518. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3519. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3520. END
  3521. ELSE
  3522. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3523. ASSERT(result.op.mode # 0);
  3524. result.tag := old.tag; (*! probably never used *)
  3525. END;
  3526. destination := dest;
  3527. IF Trace THEN TraceExit("VisitConversion") END;
  3528. END VisitConversion;
  3529. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3530. BEGIN
  3531. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3532. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3533. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3534. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3535. END VisitTypeDeclaration;
  3536. (** designators (expressions) *)
  3537. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3538. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3539. BEGIN
  3540. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3541. IF x.left # NIL THEN Expression(x.left) END;
  3542. Symbol(x.symbol,result);
  3543. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3544. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3545. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3546. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3547. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3548. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3549. END;
  3550. END;
  3551. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3552. END VisitSymbolDesignator;
  3553. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3554. BEGIN
  3555. IF isUnchecked THEN RETURN END;
  3556. IF tagsAvailable THEN
  3557. TrapC(BrltL,index,length,IndexCheckTrap);
  3558. END;
  3559. END BoundCheck;
  3560. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3561. VAR d: IntermediateCode.Operand;
  3562. BEGIN
  3563. IF isUnchecked THEN RETURN END;
  3564. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3565. TrapC(op,dim,d,ArraySizeTrap);
  3566. ReleaseIntermediateOperand(d);
  3567. END DimensionCheck;
  3568. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3569. VAR
  3570. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3571. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3572. expression: SyntaxTree.Expression;
  3573. resultingType, leftType, baseType: SyntaxTree.Type;
  3574. skipLabel1: Label;
  3575. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3576. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3577. variableOp: Operand;
  3578. variable: SyntaxTree.Variable;
  3579. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3580. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3581. VAR e: SyntaxTree.Expression; i: LONGINT;
  3582. BEGIN
  3583. tensorFound := FALSE;
  3584. FOR i := 0 TO parameters.Length()-1 DO
  3585. e := parameters.GetExpression(i);
  3586. IF e IS SyntaxTree.TensorRangeExpression THEN
  3587. ASSERT(~tensorFound);
  3588. tensorFound := TRUE;
  3589. ELSIF e IS SyntaxTree.RangeExpression THEN
  3590. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3591. ELSE
  3592. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3593. END;
  3594. END;
  3595. END CountIndices;
  3596. BEGIN
  3597. ASSERT(tagsAvailable);
  3598. resultingType := x.type.resolved; (* resulting type *)
  3599. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3600. InitOperand(localResult, ModeReference);
  3601. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3602. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3603. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3604. (* a globally defined array destination tag is available -> use and invalidate it*)
  3605. localResult.tag := arrayDestinationTag;
  3606. IntermediateCode.InitOperand(arrayDestinationTag)
  3607. ELSE
  3608. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3609. (* the result is of array range type and thus does not provide any collectable pointers *)
  3610. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3611. Symbol(variable, variableOp);
  3612. ReuseCopy(localResult.tag, variableOp.op);
  3613. ReleaseOperand(variableOp);
  3614. END
  3615. END;
  3616. indexListSize := x.parameters.Length();
  3617. CountIndices(x.parameters);
  3618. (*ASSERT(tensorRangeCount <= 1);*)
  3619. (* designate the array to be indexed over, perform tensor range check if known *)
  3620. Designate(x.left, array);
  3621. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3622. Dereference(array, leftType,FALSE);
  3623. IF ~tensorFound THEN
  3624. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3625. END
  3626. END;
  3627. (* default base offset *)
  3628. srcDimOffset := 0;
  3629. destDimOffset := 0;
  3630. indexDim := 0;
  3631. (* use address of source array as basis *)
  3632. localResult.op := array.op;
  3633. UseIntermediateOperand(localResult.op);
  3634. (* go through the index list *)
  3635. FOR i := 0 TO indexListSize - 1 DO
  3636. expression := x.parameters.GetExpression(i);
  3637. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3638. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3639. srcDimOffset := -indexListSize;
  3640. destDimOffset := -suffixRanges;
  3641. ELSE
  3642. (* determine which dimension of source array is currently looked at *)
  3643. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3644. (* get the memory operand pointing to array descriptor dimension *)
  3645. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3646. (* make a reusable register from it *)
  3647. ReuseCopy(srcDim, tmp);
  3648. ReleaseIntermediateOperand(tmp);
  3649. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3650. ELSE
  3651. srcDim := IntermediateCode.Immediate(sizeType, i);
  3652. END;
  3653. (* get length and increment of source array for current dimension *)
  3654. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3655. Convert(sourceLength.op, sizeType);
  3656. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3657. Convert(sourceIncrement.op, sizeType);
  3658. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3659. ReleaseIntermediateOperand(srcDim);
  3660. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3661. (* SINGLE INDEX *)
  3662. Evaluate(expression, index);
  3663. ReleaseIntermediateOperand(index.tag);
  3664. index.tag := emptyOperand;
  3665. Convert(index.op, sizeType);
  3666. (* lower bound check *)
  3667. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3668. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3669. ELSIF isUnchecked THEN (* do nothing *)
  3670. ELSE
  3671. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3672. END;
  3673. (* upper bound check *)
  3674. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3675. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3676. ELSIF isUnchecked THEN (* do nothing *)
  3677. ELSE
  3678. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3679. END;
  3680. ReleaseOperand(sourceLength);
  3681. Convert(index.op, addressType);
  3682. summand := index.op;
  3683. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3684. (* RANGE OF INDICES *)
  3685. Evaluate(expression, range);
  3686. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3687. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3688. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3689. ReleaseOperand(range);
  3690. Convert(firstIndex, sizeType);
  3691. Convert(lastIndex, sizeType);
  3692. Convert(stepSize, sizeType);
  3693. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3694. if it is 'MAX(LONGINT)' *)
  3695. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3696. TransferToRegister(lastIndex, lastIndex);
  3697. skipLabel1 := NewLabel();
  3698. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3699. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3700. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3701. SetLabel(skipLabel1)
  3702. END;
  3703. (* check if step size is valid *)
  3704. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3705. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3706. ELSIF isUnchecked THEN (* do nothing *)
  3707. ELSE
  3708. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3709. END;
  3710. (* check lower bound check *)
  3711. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3712. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3713. ELSIF isUnchecked THEN (* do nothing *)
  3714. ELSE
  3715. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3716. END;
  3717. (* check upper bound check *)
  3718. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3719. (* statically open range: nothing to do *)
  3720. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3721. ASSERT(staticLastIndex < staticSourceLength)
  3722. ELSIF isUnchecked THEN (* do nothing *)
  3723. ELSE
  3724. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3725. END;
  3726. (* determine length of target array for current dimension *)
  3727. (* 1. incorporate last index: *)
  3728. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3729. (* last index is static *)
  3730. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3731. targetLength := sourceLength.op
  3732. ELSE
  3733. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3734. END;
  3735. UseIntermediateOperand(targetLength);
  3736. ELSE
  3737. (* targetLength := lastIndex + 1
  3738. Reuse1(targetLength, lastIndex);
  3739. *)
  3740. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3741. END;
  3742. ReleaseOperand(sourceLength);
  3743. ReleaseIntermediateOperand(lastIndex);
  3744. (* 2. incorporate first index: *)
  3745. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3746. (* first index and current target length are static *)
  3747. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3748. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3749. (* first index = 0: nothing to do *)
  3750. ELSE
  3751. (* targetLength := targetLength - firstIndex *)
  3752. TransferToRegister(targetLength, targetLength);
  3753. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3754. END;
  3755. (* clip negative lengths to 0 *)
  3756. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3757. IF staticTargetLength < 0 THEN
  3758. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3759. END
  3760. ELSE
  3761. skipLabel1 := NewLabel();
  3762. TransferToRegister(targetLength, targetLength);
  3763. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3764. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3765. SetLabel(skipLabel1)
  3766. END;
  3767. (* 3. incorporate index step size: *)
  3768. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3769. (*step size and current target length are static *)
  3770. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3771. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3772. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3773. (* step size = 1: nothing to do *)
  3774. ELSE
  3775. (* emit code for this:
  3776. targetLength := (targetLength-1) DIV stepSize +1;
  3777. *)
  3778. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3779. DivInt(targetLength, targetLength, stepSize);
  3780. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3781. END;
  3782. (* determine increment of target array for current dimension *)
  3783. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3784. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3785. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3786. (* step size = 1 *)
  3787. targetIncrement := sourceIncrement.op;
  3788. UseIntermediateOperand(targetIncrement)
  3789. ELSE
  3790. (* targetIncrement := sourceIncrement * stepSize *)
  3791. Reuse1(targetIncrement, stepSize);
  3792. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3793. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3794. END;
  3795. ReleaseIntermediateOperand(stepSize);
  3796. (* write length and increment of target array to descriptor *)
  3797. IF destDimOffset < 0 THEN
  3798. (* determine which dimension of target array is currently looked at *)
  3799. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3800. TransferToRegister(destDim, tmp);
  3801. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3802. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3803. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3804. ReleaseIntermediateOperand(destDim);
  3805. INC(destDimOffset);
  3806. ELSE
  3807. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3808. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3809. END;
  3810. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3811. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3812. INC(indexDim);
  3813. Convert(firstIndex, addressType);
  3814. TransferToRegister(summand, firstIndex);
  3815. ELSE HALT(100);
  3816. END;
  3817. (*
  3818. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3819. *)
  3820. Convert(sourceIncrement.op, addressType);
  3821. Convert(summand, addressType);
  3822. MulInt(summand, summand, sourceIncrement.op);
  3823. ReleaseIntermediateOperand(sourceIncrement.op);
  3824. AddInt(localResult.op, localResult.op, summand);
  3825. ReleaseIntermediateOperand(summand);
  3826. END
  3827. END;
  3828. result := localResult;
  3829. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3830. ReleaseIntermediateOperand(result.tag);
  3831. result.tag := TypeDescriptorAdr(resultingType);
  3832. IF ~newObjectFile THEN
  3833. IntermediateCode.MakeMemory(result.tag,addressType);
  3834. END;
  3835. ELSIF IsDelegate(resultingType) THEN
  3836. ReleaseIntermediateOperand(result.tag);
  3837. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3838. UseIntermediateOperand(result.tag);
  3839. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3840. ReleaseIntermediateOperand(result.tag);
  3841. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3842. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3843. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3844. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3845. (* finalize target array descriptor *)
  3846. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3847. (* write lengths and increments of target array for remaining dimensions *)
  3848. i := indexListSize;
  3849. WHILE indexDim < targetArrayDimensionality DO
  3850. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3851. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3852. ReleaseOperand(sourceLength);
  3853. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3854. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3855. ReleaseOperand(sourceIncrement);
  3856. INC(i); INC(indexDim);
  3857. END;
  3858. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3859. tmp := nil;
  3860. ELSE
  3861. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3862. END;
  3863. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3864. ReleaseIntermediateOperand(tmp);
  3865. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3866. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3867. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3868. ELSE
  3869. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3870. END;
  3871. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3872. ReleaseIntermediateOperand(tmp);
  3873. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3874. (* write dimensionality *)
  3875. IF targetArrayDimensionality # 0 THEN
  3876. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3877. END;
  3878. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3879. END;
  3880. ReleaseOperand(array);
  3881. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3882. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3883. END;
  3884. END MathIndexDesignator;
  3885. (* get the length of an array , trying to make use of static information *)
  3886. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3887. VAR res: IntermediateCode.Operand; size: LONGINT;
  3888. BEGIN
  3889. type := type.resolved;
  3890. IF type IS SyntaxTree.ArrayType THEN
  3891. WITH type: SyntaxTree.ArrayType DO
  3892. IF type.form = SyntaxTree.Static THEN
  3893. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3894. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3895. Evaluate(type.length, op);
  3896. ReleaseIntermediateOperand(op.tag);
  3897. RETURN op.op;*)
  3898. ELSE
  3899. res := tag;
  3900. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3901. IntermediateCode.MakeMemory(res,addressType);
  3902. UseIntermediateOperand(res);
  3903. RETURN res
  3904. END
  3905. END;
  3906. ELSE
  3907. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3908. RETURN IntermediateCode.Immediate(addressType,size);
  3909. END;
  3910. END ArrayLength;
  3911. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  3912. BEGIN
  3913. IF IsImmediate(x) THEN
  3914. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  3915. ELSE
  3916. IF ~ReusableRegister(res) THEN
  3917. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3918. ELSE
  3919. UseIntermediateOperand(res);
  3920. END;
  3921. Emit(Mov(position,res,x))
  3922. END;
  3923. END CopyInt;
  3924. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3925. BEGIN
  3926. ReleaseIntermediateOperand(res);
  3927. IF IsImmediate(x) & IsImmediate(y) THEN
  3928. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3929. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3930. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3931. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3932. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3933. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3934. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3935. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3936. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3937. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3938. UseIntermediateOperand(res);
  3939. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3940. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3941. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3942. UseIntermediateOperand(res);
  3943. ELSE
  3944. IF ~ReusableRegister(res) THEN
  3945. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3946. ELSE
  3947. UseIntermediateOperand(res);
  3948. END;
  3949. IF IsImmediate(x) & (x.intValue = 0) THEN
  3950. Emit(Mov(position,res,y))
  3951. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3952. Emit(Mov(position,res,x))
  3953. ELSE
  3954. Emit(Add(position,res, x, y));
  3955. END;
  3956. END;
  3957. END AddInt;
  3958. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3959. BEGIN
  3960. ReleaseIntermediateOperand(res);
  3961. IF IsImmediate(x) & IsImmediate(y) THEN
  3962. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3963. ELSE
  3964. IF ~ReusableRegister(res) THEN
  3965. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3966. ELSE UseIntermediateOperand(res);
  3967. END;
  3968. IF IsImmediate(x) & (x.intValue = 1) THEN
  3969. Emit(Mov(position,res,y))
  3970. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3971. Emit(Mov(position,res,x))
  3972. ELSE
  3973. Emit(Mul(position,res, x, y));
  3974. END;
  3975. END;
  3976. END MulInt;
  3977. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3978. BEGIN
  3979. ReleaseIntermediateOperand(res);
  3980. IF IsImmediate(x) & IsImmediate(y) THEN
  3981. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3982. ELSE
  3983. IF ~ReusableRegister(res) THEN
  3984. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3985. ELSE UseIntermediateOperand(res);
  3986. END;
  3987. IF IsImmediate(x) & (x.intValue = 1) THEN
  3988. Emit(Mov(position,res,y))
  3989. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3990. Emit(Mov(position,res,x))
  3991. ELSE
  3992. Emit(Div(position,res, x, y));
  3993. END;
  3994. END;
  3995. END DivInt;
  3996. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3997. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3998. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3999. BEGIN
  4000. type := x.left.type.resolved;
  4001. IF type IS SyntaxTree.StringType THEN
  4002. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4003. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4004. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4005. type := atype;
  4006. x.left.SetType(type);
  4007. END;
  4008. IntermediateCode.InitImmediate(res,addressType,0);
  4009. maxDim := x.parameters.Length()-1;
  4010. (*
  4011. computation rule:
  4012. a: ARRAY X,Y,Z OF Element with size S
  4013. a[i,j,k] -->
  4014. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4015. *)
  4016. FOR i := 0 TO maxDim DO
  4017. e := x.parameters.GetExpression(i);
  4018. Evaluate(e,index);
  4019. Convert(index.op,addressType);
  4020. AddInt(res, res, index.op);
  4021. IF i = 0 THEN
  4022. (*
  4023. ReuseCopy(res, index.op);
  4024. *)
  4025. Designate(x.left,array);
  4026. type := x.left.type.resolved;
  4027. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4028. Dereference(array, type, FALSE);
  4029. END;
  4030. (*
  4031. ELSE AddInt(res, res, index.op);
  4032. *)
  4033. END;
  4034. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4035. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4036. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4037. BoundCheck(index.op, length);
  4038. END;
  4039. ReleaseIntermediateOperand(length);
  4040. END;
  4041. ReleaseOperand(index);
  4042. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4043. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4044. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4045. MulInt(res,res,length);
  4046. END;
  4047. ReleaseIntermediateOperand(length);
  4048. END;
  4049. (* remaining open dimensions -- compute address *)
  4050. i := maxDim+1;
  4051. IF type IS SyntaxTree.ArrayType THEN
  4052. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4053. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4054. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4055. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4056. MulInt(res,res,length);
  4057. END;
  4058. ReleaseIntermediateOperand(length);
  4059. INC(i);
  4060. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4061. END;
  4062. END;
  4063. IF (type IS SyntaxTree.ArrayType) THEN
  4064. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4065. size := StaticSize(system, type);
  4066. IF size # 1 THEN
  4067. length := IntermediateCode.Immediate(addressType,size);
  4068. MulInt(res,res,length);
  4069. END;
  4070. ELSE
  4071. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4072. IF size # 1 THEN
  4073. length := IntermediateCode.Immediate(addressType,size);
  4074. MulInt(res,res,length);
  4075. END;
  4076. END;
  4077. END;
  4078. AddInt(res,res,array.op);
  4079. InitOperand(result,ModeReference);
  4080. result.op := res;
  4081. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4082. ReleaseIntermediateOperand(result.tag);
  4083. result.tag := TypeDescriptorAdr(type);
  4084. IF ~newObjectFile THEN
  4085. IntermediateCode.MakeMemory(result.tag,addressType);
  4086. END
  4087. ELSIF IsDelegate(type) THEN
  4088. ReleaseIntermediateOperand(result.tag);
  4089. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4090. UseIntermediateOperand(result.tag);
  4091. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4092. ReleaseIntermediateOperand(result.tag);
  4093. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4094. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4095. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4096. END;
  4097. ReleaseOperand(array);
  4098. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4099. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4100. END;
  4101. END IndexDesignator;
  4102. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4103. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4104. BEGIN
  4105. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4106. dest := destination; destination := emptyOperand;
  4107. type := x.left.type.resolved;
  4108. IF type IS SyntaxTree.MathArrayType THEN
  4109. MathIndexDesignator(x);
  4110. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4111. IndexDesignator(x);
  4112. END;
  4113. destination := dest;
  4114. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4115. END VisitIndexDesignator;
  4116. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4117. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4118. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4119. procedure: SyntaxTree.Procedure;
  4120. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4121. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4122. BEGIN
  4123. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4124. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4125. parameters := expression.parameters;
  4126. moduleName := "FoxArrayBase";
  4127. procedureName := "CopyDescriptor";
  4128. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4129. SaveRegisters();ReleaseUsedRegisters(saved);
  4130. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4131. IF procedure = NIL THEN
  4132. s := "procedure ";
  4133. Strings.Append(s,moduleName);
  4134. Strings.Append(s,".");
  4135. Strings.Append(s,procedureName);
  4136. Strings.Append(s," not present");
  4137. Error(position,s);
  4138. ELSE
  4139. (* push address of temporary variable *)
  4140. Symbol(variable,destOperand);
  4141. Emit(Push(position,destOperand.op));
  4142. ReleaseOperand(destOperand);
  4143. (* push src *)
  4144. Evaluate(expression.left,srcOperand);
  4145. (*
  4146. Dereference(srcOperand,expression.type.resolved);
  4147. Emit(Push(position,srcOperand.tag));
  4148. *)
  4149. Emit(Push(position,srcOperand.op));
  4150. ReleaseOperand(srcOperand);
  4151. tensorFound := FALSE;
  4152. FOR i := 0 TO parameters.Length()-1 DO
  4153. e := parameters.GetExpression(i);
  4154. IF e IS SyntaxTree.TensorRangeExpression THEN
  4155. tensorFound := TRUE;
  4156. ELSIF e IS SyntaxTree.RangeExpression THEN
  4157. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4158. ELSE
  4159. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4160. END;
  4161. END;
  4162. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4163. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4164. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4165. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4166. StaticCallOperand(procOp,procedure);
  4167. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4168. ReleaseOperand(procOp);
  4169. END;
  4170. RestoreRegisters(saved);
  4171. END;
  4172. RETURN variable
  4173. END PrepareTensorDescriptor;
  4174. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4175. VAR
  4176. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4177. operand, tmpOperand, variableOp, variable2Op: Operand;
  4178. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4179. variable, variable2: SyntaxTree.Variable;
  4180. dim, i, size: LONGINT;
  4181. (* TODO: needed? *)
  4182. oldArrayDestinationTag: IntermediateCode.Operand;
  4183. oldArrayDestinationDimension: LONGINT;
  4184. position: Position;
  4185. saved: RegisterEntry;
  4186. arrayFlags: SET;
  4187. m, n: LONGINT;
  4188. PROCEDURE Pass(op: IntermediateCode.Operand);
  4189. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4190. BEGIN
  4191. IF numberRegister >= 0 THEN
  4192. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention,op.type,numberRegister));
  4193. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4194. Emit(Mov(position,parameterRegister, op));
  4195. ELSE
  4196. Emit(Push(position,op))
  4197. END
  4198. END Pass;
  4199. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4200. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4201. BEGIN
  4202. formalType := formalType.resolved; actualType := actualType.resolved;
  4203. IF IsOpenArray(formalType)THEN
  4204. IF actualType IS SyntaxTree.StringType THEN
  4205. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4206. RETURN;
  4207. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4208. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4209. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4210. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4211. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4212. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4213. ELSE
  4214. tmp := baseReg;
  4215. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4216. IntermediateCode.MakeMemory(tmp,addressType);
  4217. Pass((tmp));
  4218. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4219. END;
  4220. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4221. END;
  4222. END PushArrayLens;
  4223. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4224. BEGIN
  4225. CASE size OF
  4226. |2: INCL(flags,Size2Flag);
  4227. |3: INCL(flags,Size3Flag);
  4228. |4: INCL(flags,Size4Flag);
  4229. |5: INCL(flags,Size5Flag);
  4230. |6: INCL(flags,Size6Flag);
  4231. |7: INCL(flags,Size7Flag);
  4232. |8: INCL(flags,Size8Flag);
  4233. END;
  4234. END SetSmallArraySizeFlag;
  4235. BEGIN
  4236. IF Trace THEN TraceEnter("PushParameter") END;
  4237. position := expression.position;
  4238. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4239. type := expression.type.resolved;
  4240. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4241. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4242. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4243. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4244. );
  4245. (* TODO: needed? *)
  4246. oldArrayDestinationTag := arrayDestinationTag;
  4247. oldArrayDestinationDimension := arrayDestinationDimension;
  4248. IF IsArrayOfSystemByte(parameter.type) THEN
  4249. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4250. Designate(expression,operand);
  4251. ELSE
  4252. Evaluate(expression, tmpOperand);
  4253. (* array of system byte does not provide any pointers *)
  4254. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4255. Symbol(variable, operand);
  4256. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4257. Emit(Mov(position,tmp, tmpOperand.op));
  4258. ReleaseOperand(tmpOperand);
  4259. END;
  4260. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4261. ReleaseIntermediateOperand(operand.tag);
  4262. operand.tag := tmp;
  4263. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4264. Pass((operand.tag));
  4265. END;
  4266. Pass((operand.op));
  4267. ELSIF IsOpenArray(parameter.type) THEN
  4268. Designate(expression,operand);
  4269. baseReg := operand.tag;
  4270. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4271. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4272. END;
  4273. Pass((operand.op)); (* address of the array *)
  4274. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4275. (* case 1
  4276. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4277. *)
  4278. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4279. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4280. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4281. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4282. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4283. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4284. arrayDestinationTag := sp;
  4285. (* case 1b
  4286. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4287. *)
  4288. IF expression IS SyntaxTree.IndexDesignator THEN
  4289. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4290. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4291. arrayDestinationDimension := dim;
  4292. Designate(expression,operand);
  4293. (* case 1a
  4294. P(...,A,...) push: push array descriptor to stack
  4295. *)
  4296. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4297. Designate(expression,operand);
  4298. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4299. i := 0;
  4300. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4301. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4302. INC(i);
  4303. END;
  4304. type := expression.type.resolved;
  4305. WHILE (i<dim) DO (* remaining static dimensions *)
  4306. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4307. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4308. ReleaseOperand(tmpOperand);
  4309. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4310. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4311. ReleaseOperand(tmpOperand);
  4312. INC(i);
  4313. END;
  4314. dimOp := IntermediateCode.Immediate(addressType,dim);
  4315. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4316. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4317. (* case 1d
  4318. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4319. + case 1e
  4320. P(.. PT() ... );
  4321. *)
  4322. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4323. Designate(expression,operand);
  4324. Dereference(operand,type.resolved,FALSE);
  4325. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4326. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4327. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4328. (* case 1f
  4329. P(...,S,...) push: create array descriptor to S on stack
  4330. case 1g
  4331. P(... PS()...)
  4332. *)
  4333. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4334. Designate(expression,operand);
  4335. FOR i := 0 TO dim-1 DO
  4336. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4337. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4338. ReleaseOperand(tmpOperand);
  4339. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4340. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4341. ReleaseOperand(tmpOperand);
  4342. END;
  4343. (*******
  4344. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4345. *)
  4346. arrayFlags := {StaticFlag};
  4347. IF dim = 1 THEN
  4348. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4349. ReleaseOperand(tmpOperand);
  4350. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4351. m := LONGINT(tmpOperand.op.intValue);
  4352. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4353. ELSIF dim = 2 THEN
  4354. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4355. ReleaseOperand(tmpOperand);
  4356. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4357. m := LONGINT(tmpOperand.op.intValue);
  4358. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4359. ReleaseOperand(tmpOperand);
  4360. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4361. n := LONGINT(tmpOperand.op.intValue);
  4362. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4363. INCL(arrayFlags,SmallMatrixFlag);
  4364. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4365. END;
  4366. END;
  4367. (*******)
  4368. dimOp := IntermediateCode.Immediate(addressType,dim);
  4369. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4370. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4371. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4372. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4373. baseType := SemanticChecker.ArrayBase(type,dim);
  4374. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4375. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4376. ELSE HALT(100);
  4377. END;
  4378. (* case 2
  4379. procedure P([left args], var A: array [*,*] of Type, [right args])
  4380. *)
  4381. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4382. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4383. (* case 2b
  4384. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4385. push: push reference to pushed array descriptor
  4386. post: remove array descriptor.
  4387. *)
  4388. IF expression IS SyntaxTree.IndexDesignator THEN
  4389. descriptorType := GetMathArrayDescriptorType(dim);
  4390. (* range type : no allocation possible, should be untraced *)
  4391. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4392. Symbol(variable,variableOp);
  4393. arrayDestinationTag := variableOp.op;
  4394. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4395. arrayDestinationDimension := dim;
  4396. NeedDescriptor := TRUE;
  4397. Designate(expression,operand);
  4398. Pass((operand.tag));
  4399. NeedDescriptor := FALSE;
  4400. (* case 2a
  4401. P(...,A,...)
  4402. push: push reference to array descriptor on stack
  4403. *)
  4404. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4405. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4406. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4407. INC(i);
  4408. END;
  4409. IF i = dim THEN
  4410. Designate(expression,operand);
  4411. Pass((operand.tag));
  4412. ELSE (* open-static *)
  4413. type := expression.type.resolved;
  4414. descriptorType := GetMathArrayDescriptorType(dim);
  4415. (* static array , cannot be reallocated, untraced !*)
  4416. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4417. Symbol(variable,variableOp);
  4418. arrayDestinationTag := variableOp.op;
  4419. Designate(expression,operand);
  4420. FOR i := 0 TO dim-1 DO
  4421. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4422. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4423. ReleaseOperand(tmpOperand);
  4424. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4425. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4426. ReleaseOperand(tmpOperand);
  4427. END;
  4428. dimOp := IntermediateCode.Immediate(addressType,dim);
  4429. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4430. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4431. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4432. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4433. baseType := SemanticChecker.ArrayBase(type,dim);
  4434. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4435. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4436. Pass((arrayDestinationTag));
  4437. END;
  4438. (* case 2d
  4439. P(...,T,...) push: emit dimension check, push T
  4440. *)
  4441. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4442. Designate(expression,operand);
  4443. Dereference(operand,type.resolved,FALSE);
  4444. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4445. Pass((operand.tag));
  4446. (* case 2f
  4447. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4448. push: push reference to pushed array descriptor
  4449. post: remove array descriptor
  4450. *)
  4451. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4452. descriptorType := GetMathArrayDescriptorType(dim);
  4453. (* static array -- cannot be reallocatated, untraced *)
  4454. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4455. Symbol(variable,variableOp);
  4456. arrayDestinationTag := variableOp.op;
  4457. Designate(expression,operand);
  4458. FOR i := 0 TO dim-1 DO
  4459. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4460. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4461. ReleaseOperand(tmpOperand);
  4462. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4463. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4464. ReleaseOperand(tmpOperand);
  4465. END;
  4466. (*
  4467. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4468. *)
  4469. arrayFlags := {StaticFlag};
  4470. IF dim = 1 THEN
  4471. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4472. ReleaseOperand(tmpOperand);
  4473. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4474. m := LONGINT(tmpOperand.op.intValue);
  4475. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4476. ELSIF dim = 2 THEN
  4477. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4478. ReleaseOperand(tmpOperand);
  4479. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4480. m := LONGINT(tmpOperand.op.intValue);
  4481. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4482. ReleaseOperand(tmpOperand);
  4483. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4484. n := LONGINT(tmpOperand.op.intValue);
  4485. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4486. INCL(arrayFlags,SmallMatrixFlag);
  4487. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4488. END;
  4489. END;
  4490. (*******)
  4491. dimOp := IntermediateCode.Immediate(addressType,dim);
  4492. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4493. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4494. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4495. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4496. baseType := SemanticChecker.ArrayBase(type,dim);
  4497. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4498. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4499. Pass((arrayDestinationTag));
  4500. ELSE HALT(100);
  4501. END;
  4502. (* case 3
  4503. procedure P([left args], [const] A: array [?] of Type, [right args])
  4504. *)
  4505. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4506. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4507. (* case 3b
  4508. P(...,A[a..b,c..d],...)
  4509. *)
  4510. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4511. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4512. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4513. Symbol(variable,variableOp);
  4514. LoadValue(variableOp,system.addressType);
  4515. ELSE
  4516. descriptorType := GetMathArrayDescriptorType(dim);
  4517. (* range -- cannot be reallocated *)
  4518. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4519. Symbol(variable,variableOp);
  4520. END;
  4521. arrayDestinationTag := variableOp.op;
  4522. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4523. arrayDestinationDimension := 0;
  4524. Designate(expression,operand);
  4525. Pass((operand.tag));
  4526. (* case 3a
  4527. P(...,A,...)
  4528. *)
  4529. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4530. i := 0;
  4531. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4532. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4533. INC(i);
  4534. END;
  4535. IF i = dim THEN
  4536. Designate(expression,operand);
  4537. Pass((operand.tag));
  4538. ELSE (* open-static *)
  4539. type := expression.type.resolved;
  4540. descriptorType := GetMathArrayDescriptorType(dim);
  4541. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4542. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4543. Symbol(variable,variableOp);
  4544. arrayDestinationTag := variableOp.op;
  4545. Designate(expression,operand);
  4546. FOR i := 0 TO dim-1 DO
  4547. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4548. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4549. ReleaseOperand(tmpOperand);
  4550. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4551. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4552. ReleaseOperand(tmpOperand);
  4553. END;
  4554. dimOp := IntermediateCode.Immediate(addressType,dim);
  4555. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4556. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4557. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4558. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4559. baseType := SemanticChecker.ArrayBase(type,dim);
  4560. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4561. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4562. Pass((arrayDestinationTag));
  4563. END;
  4564. (* case 3d
  4565. P(...,T,...)
  4566. case 3e
  4567. P(...,PT(...),...)
  4568. *)
  4569. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4570. Designate(expression,operand);
  4571. Dereference(operand,type.resolved,FALSE);
  4572. Pass((operand.tag));
  4573. (* case 3f
  4574. P(...,S,...)
  4575. case 3g
  4576. P(...,PS(...),...)
  4577. *)
  4578. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4579. descriptorType := GetMathArrayDescriptorType(dim);
  4580. (* static array does not need to be traced *)
  4581. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4582. Symbol(variable,variableOp);
  4583. arrayDestinationTag := variableOp.op;
  4584. Designate(expression,operand);
  4585. IF operand.op.type.length >1 THEN (* vector register *)
  4586. (* static array does not need to be traced *)
  4587. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4588. Symbol(variable2, variable2Op);
  4589. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4590. Emit(Mov(position,tmp, operand.op));
  4591. ReleaseOperand(operand);
  4592. Symbol(variable2, operand);
  4593. END;
  4594. FOR i := 0 TO dim-1 DO
  4595. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4596. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4597. ReleaseOperand(tmpOperand);
  4598. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4599. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4600. ReleaseOperand(tmpOperand);
  4601. END;
  4602. dimOp := IntermediateCode.Immediate(addressType,dim);
  4603. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4604. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4605. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4606. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4607. baseType := SemanticChecker.ArrayBase(type,dim);
  4608. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4609. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4610. Pass((arrayDestinationTag));
  4611. ELSE HALT(100);
  4612. END;
  4613. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4614. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4615. (* case 4b
  4616. P(...,A[a..b,c..d],...)
  4617. *)
  4618. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4619. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4620. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4621. Symbol(variable,variableOp);
  4622. LoadValue(variableOp,system.addressType);
  4623. ELSE
  4624. descriptorType := GetMathArrayDescriptorType(dim);
  4625. (* range array -- cannot be allocated *)
  4626. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4627. Symbol(variable,variableOp);
  4628. END;
  4629. arrayDestinationTag := variableOp.op;
  4630. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4631. arrayDestinationDimension := 0;
  4632. Designate(expression,operand);
  4633. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4634. Symbol(variable,variableOp);
  4635. ELSE
  4636. (* alias to range -- untraced *)
  4637. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4638. Symbol(variable,variableOp);
  4639. MakeMemory(tmp,variableOp.op,addressType,0);
  4640. Emit(Mov(position,tmp,operand.tag));
  4641. ReleaseIntermediateOperand(tmp);
  4642. END;
  4643. Pass((variableOp.op));
  4644. ReleaseOperand(variableOp);
  4645. (* case 4a
  4646. P(...,A,...)
  4647. *)
  4648. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4649. i := 0;
  4650. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4651. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4652. INC(i);
  4653. END;
  4654. IF i = dim THEN
  4655. Designate(expression,operand);
  4656. arrayDestinationTag := operand.tag;
  4657. ELSE (* open-static *)
  4658. type := expression.type.resolved;
  4659. descriptorType := GetMathArrayDescriptorType(dim);
  4660. (* static array -- untraced *)
  4661. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4662. Symbol(variable,variableOp);
  4663. arrayDestinationTag := variableOp.op;
  4664. Designate(expression,operand);
  4665. FOR i := 0 TO dim-1 DO
  4666. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4667. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4668. ReleaseOperand(tmpOperand);
  4669. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4670. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4671. ReleaseOperand(tmpOperand);
  4672. END;
  4673. dimOp := IntermediateCode.Immediate(addressType,dim);
  4674. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4675. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4676. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4677. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4678. baseType := SemanticChecker.ArrayBase(type,dim);
  4679. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4680. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4681. END;
  4682. (* tensor alias to open array -- untraced *)
  4683. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4684. Symbol(variable,variableOp);
  4685. MakeMemory(tmp,variableOp.op,addressType,0);
  4686. Emit(Mov(position,tmp,arrayDestinationTag));
  4687. ReleaseIntermediateOperand(tmp);
  4688. Pass((variableOp.op));
  4689. ReleaseOperand(variableOp);
  4690. (* case 4d
  4691. P(...,T,...)
  4692. *)
  4693. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4694. Designate(expression,operand);
  4695. Pass((operand.op));
  4696. (* case 4f
  4697. P(...,S,...)
  4698. *)
  4699. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4700. descriptorType := GetMathArrayDescriptorType(dim);
  4701. (* static array -- cannot be reallocated, untraced *)
  4702. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4703. Symbol(variable,variableOp);
  4704. arrayDestinationTag := variableOp.op;
  4705. Designate(expression,operand);
  4706. FOR i := 0 TO dim-1 DO
  4707. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4708. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4709. ReleaseOperand(tmpOperand);
  4710. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4711. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4712. ReleaseOperand(tmpOperand);
  4713. END;
  4714. dimOp := IntermediateCode.Immediate(addressType,dim);
  4715. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4716. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4717. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4718. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4719. baseType := SemanticChecker.ArrayBase(type,dim);
  4720. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4721. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4722. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4723. Symbol(variable,variableOp);
  4724. MakeMemory(tmp,variableOp.op,addressType,0);
  4725. Emit(Mov(position,tmp,arrayDestinationTag));
  4726. ReleaseIntermediateOperand(tmp);
  4727. Pass((variableOp.op));
  4728. ReleaseOperand(variableOp);
  4729. ELSE HALT(100);
  4730. END;
  4731. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4732. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4733. Designate(expression,operand);
  4734. IF operand.op.type.length > 1 THEN
  4735. Emit(Push(position, operand.op));
  4736. ELSE
  4737. size := system.SizeOf(type);
  4738. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4739. size := ToMemoryUnits(system,size);
  4740. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4741. arrayDestinationTag := sp;
  4742. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4743. END;
  4744. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4745. Designate(expression,operand);
  4746. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4747. (* static array no pointer *)
  4748. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4749. Symbol(variable,variableOp);
  4750. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4751. Emit(Mov(position,tmp,operand.op));
  4752. Emit(Push(position,variableOp.op));
  4753. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4754. Pass((operand.op));
  4755. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4756. END;
  4757. ELSE HALT(200)
  4758. END;
  4759. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4760. IF parameter.kind = SyntaxTree.VarParameter THEN
  4761. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4762. Designate(expression, operand);
  4763. Pass((operand.op));
  4764. ELSE
  4765. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4766. Evaluate(expression, operand);
  4767. Pass((operand.extra)); (* step *)
  4768. Pass((operand.tag)); (* last *)
  4769. Pass((operand.op)) (* first *)
  4770. END
  4771. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4772. IF parameter.kind = SyntaxTree.VarParameter THEN
  4773. Designate(expression, operand);
  4774. Pass((operand.op));
  4775. ELSE
  4776. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4777. Evaluate(expression, operand);
  4778. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  4779. IF (numberRegister > 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  4780. Pass((operand.tag)); (* imaginary part *)
  4781. Pass((operand.op)) (* real part *)
  4782. ELSE
  4783. (* pass complex as a whole in order to comply with the variable alignment of its components *)
  4784. size := ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,parameter.type));
  4785. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4786. tmp := sp;
  4787. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4788. Emit(Mov(position,tmp,operand.op)); (* real part *)
  4789. size := ToMemoryUnits(system,system.AlignmentOf(system.variableAlignment,componentType));
  4790. IntermediateCode.AddOffset(tmp,size);
  4791. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  4792. END
  4793. END
  4794. ELSE
  4795. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4796. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4797. Designate(expression,operand);
  4798. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4799. (* stack allocation *)
  4800. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4801. (*! parameter alignment to be discussed ... *)
  4802. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4803. size := type(SyntaxTree.StringType).length;
  4804. END;
  4805. IF backend.cooperative & parameter.NeedsTrace() THEN
  4806. dst := NewRegisterOperand (addressType);
  4807. Emit(Mov(position,dst, sp));
  4808. IntermediateCode.InitImmediate(null, byteType, 0);
  4809. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4810. ReleaseIntermediateOperand(dst);
  4811. SaveRegisters();ReleaseUsedRegisters(saved);
  4812. (* register dst has been freed before SaveRegisters already *)
  4813. CallAssignMethod(dst, operand.op, parameter.type);
  4814. RestoreRegisters(saved);
  4815. END;
  4816. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4817. ELSIF IsOpenArray(parameter.type) THEN
  4818. Designate(expression,operand);
  4819. baseReg := operand.tag;
  4820. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4821. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4822. END;
  4823. Pass((operand.op)); (* address of the array *)
  4824. ELSIF IsDelegate(parameter.type) THEN
  4825. Evaluate(expression,operand);
  4826. IF backend.cooperative & parameter.NeedsTrace() THEN
  4827. Emit(Push(position, nil));
  4828. dst := NewRegisterOperand (addressType);
  4829. Emit(Mov(position,dst, sp));
  4830. ReleaseIntermediateOperand(dst);
  4831. SaveRegisters();ReleaseUsedRegisters(saved);
  4832. Emit(Push(position, dst));
  4833. (* register dst has been freed before SaveRegisters already *)
  4834. Emit(Push(position, operand.tag));
  4835. CallThis(position,"GarbageCollector","Assign",2);
  4836. RestoreRegisters(saved);
  4837. ELSE
  4838. Pass((operand.tag));
  4839. END;
  4840. Pass((operand.op));
  4841. ELSE
  4842. Evaluate(expression,operand);
  4843. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4844. Emit(Push(position, nil));
  4845. dst := NewRegisterOperand (addressType);
  4846. Emit(Mov(position,dst, sp));
  4847. ReleaseIntermediateOperand(dst);
  4848. SaveRegisters();ReleaseUsedRegisters(saved);
  4849. Emit(Push(position, dst));
  4850. (* register dst has been freed before SaveRegisters already *)
  4851. Emit(Push(position, operand.op));
  4852. CallThis(position,"GarbageCollector","Assign",2);
  4853. RestoreRegisters(saved);
  4854. ELSE
  4855. Pass((operand.op));
  4856. END;
  4857. END;
  4858. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4859. Evaluate(expression,operand);
  4860. Pass((operand.op));
  4861. ELSE (* var parameter *)
  4862. Designate(expression,operand);
  4863. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4864. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4865. Pass((operand.tag));
  4866. END;
  4867. END;
  4868. Pass((operand.op));
  4869. END;
  4870. END;
  4871. (* TODO: needed? *)
  4872. arrayDestinationTag := oldArrayDestinationTag;
  4873. arrayDestinationDimension := oldArrayDestinationDimension;
  4874. IF needsParameterBackup THEN
  4875. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4876. ReuseCopy(parameterBackup, operand.op)
  4877. END;
  4878. ReleaseOperand(operand);
  4879. IF Trace THEN TraceExit("PushParameter") END;
  4880. END PushParameter;
  4881. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  4882. VAR prevConditional: BOOLEAN;
  4883. BEGIN
  4884. prevConditional := conditional;
  4885. conditional := FALSE;
  4886. 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
  4887. Expression(x.result); (* use register *)
  4888. END;
  4889. Statement(x.statement);
  4890. conditional := prevConditional;
  4891. IF x.result # NIL THEN Expression(x.result) END;
  4892. 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
  4893. ReleaseIntermediateOperand(result.op);
  4894. END;
  4895. END VisitStatementDesignator;
  4896. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4897. VAR
  4898. procedure: SyntaxTree.Procedure;
  4899. procedureType: SyntaxTree.ProcedureType;
  4900. wasInline: BOOLEAN;
  4901. actualParameters: SyntaxTree.ExpressionList;
  4902. formalParameter: SyntaxTree.Parameter;
  4903. actualParameter: SyntaxTree.Expression;
  4904. i: LONGINT;
  4905. localVariable: SyntaxTree.Variable;
  4906. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4907. src, dest: Operand;
  4908. prevInlineExit : Label;
  4909. prevMapper: SymbolMapper;
  4910. tooComplex: BOOLEAN;
  4911. resultDesignator: SyntaxTree.Expression;
  4912. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4913. BEGIN
  4914. IF e = NIL THEN RETURN TRUE
  4915. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4916. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4917. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4918. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4919. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4920. ELSE RETURN FALSE
  4921. END;
  4922. END SimpleExpression;
  4923. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4924. BEGIN
  4925. RETURN checker.CanPassInRegister(type)
  4926. END FitsInRegister;
  4927. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4928. VAR
  4929. variable: SyntaxTree.Variable;
  4930. variableDesignator: SyntaxTree.Designator;
  4931. BEGIN
  4932. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  4933. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  4934. variableDesignator.SetType(type);
  4935. RETURN variableDesignator
  4936. END GetTemp;
  4937. BEGIN
  4938. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4939. wasInline := currentIsInline;
  4940. prevInlineExit := currentInlineExit;
  4941. prevMapper := currentMapper;
  4942. currentInlineExit := NewLabel();
  4943. tooComplex := FALSE;
  4944. NEW(currentMapper);
  4945. currentIsInline := TRUE;
  4946. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4947. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4948. formalParameter := procedureType.firstParameter;
  4949. actualParameters := x.parameters;
  4950. i := 0;
  4951. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4952. actualParameter := actualParameters.GetExpression(i);
  4953. IF actualParameter.resolved # NIL THEN
  4954. actualParameter := actualParameter.resolved
  4955. END;
  4956. (*
  4957. if expression is simple and can be passed immediately
  4958. or if type fits in register then we can proceed
  4959. otherwise we escape to ordinary procedure call.
  4960. *)
  4961. (* cases where the expression can be mapped identically *)
  4962. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4963. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  4964. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4965. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4966. (*
  4967. Assign(variableDesignator, actualParameter);
  4968. *)
  4969. Evaluate(actualParameter, src);
  4970. Designate(variableDesignator, dest);
  4971. Emit(Mov(x.position, dest.op, src.op));
  4972. ReleaseOperand(dest);
  4973. ReleaseOperand(src);
  4974. (* the src operand should now have been completely released ! *)
  4975. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  4976. ELSE tooComplex := TRUE
  4977. END;
  4978. (*
  4979. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4980. currentMapper.Add(formalParameter, actualParameter, NIL);
  4981. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4982. variableDesignator := GetTemp(system.addressType, FALSE);
  4983. Designate(actualParameter, src);
  4984. Designate(variableDesignator, dest);
  4985. IntermediateCode.MakeMemory(dest.op,addressType);
  4986. Emit(Mov(x.position, dest.op, src.op));
  4987. ReleaseOperand(dest);
  4988. IF src.tag.mode # IntermediateCode.Undefined THEN
  4989. tagDesignator := GetTemp(system.addressType, FALSE);
  4990. Designate(tagDesignator, dest);
  4991. IntermediateCode.MakeMemory(dest.op,addressType);
  4992. Emit(Mov(x.position, dest.op, src.op));
  4993. END;
  4994. ReleaseOperand(dest); ReleaseOperand(src);
  4995. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4996. END;
  4997. *)
  4998. formalParameter := formalParameter.nextParameter;
  4999. INC(i);
  5000. END;
  5001. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5002. IF resultDesignator # NIL THEN
  5003. returnDesignator := resultDesignator
  5004. ELSE
  5005. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5006. END;
  5007. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5008. END;
  5009. localVariable := procedure.procedureScope.firstVariable;
  5010. WHILE ~tooComplex & (localVariable # NIL) DO
  5011. variableDesignator := GetTemp(localVariable.type, FALSE);
  5012. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5013. localVariable := localVariable.nextVariable;
  5014. END;
  5015. IF ~tooComplex THEN
  5016. VisitStatementBlock(procedure.procedureScope.body);
  5017. SetLabel(currentInlineExit);
  5018. IF procedureType.returnType # NIL THEN
  5019. Designate(returnDesignator, result);
  5020. IF conditional THEN
  5021. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  5022. ValueToCondition(result)
  5023. END;
  5024. END;
  5025. END;
  5026. currentMapper := prevMapper;
  5027. currentInlineExit := prevInlineExit;
  5028. currentIsInline := wasInline;
  5029. RETURN ~tooComplex
  5030. END InlineProcedureCall;
  5031. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5032. VAR
  5033. parameters: SyntaxTree.ExpressionList;
  5034. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5035. designator: SyntaxTree.Designator;
  5036. procedureType: SyntaxTree.ProcedureType;
  5037. formalParameter: SyntaxTree.Parameter;
  5038. operand, returnValue: Operand;
  5039. reg, size, mask, dest: IntermediateCode.Operand;
  5040. saved,saved2: RegisterEntry;
  5041. symbol: SyntaxTree.Symbol;
  5042. variable: SyntaxTree.Variable;
  5043. i, parametersSize, returnTypeSize : LONGINT;
  5044. structuredReturnType: BOOLEAN;
  5045. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5046. tempVariableDesignator: SyntaxTree.Designator;
  5047. gap, alignment: LONGINT; (*fld*)
  5048. (* TODO: remove unnecessary backup variables *)
  5049. oldResult: Operand;
  5050. oldCurrentScope: SyntaxTree.Scope;
  5051. oldArrayDestinationTag: IntermediateCode.Operand;
  5052. oldArrayDestinationDimension: LONGINT;
  5053. oldConstantDeclaration: SyntaxTree.Symbol;
  5054. oldDestination: IntermediateCode.Operand;
  5055. oldCurrentLoop: Label;
  5056. oldConditional: BOOLEAN;
  5057. oldTrueLabel, oldFalseLabel: Label;
  5058. oldLocked: BOOLEAN;
  5059. usedRegisters,oldUsedRegisters: RegisterEntry;
  5060. return: IntermediateCode.Operand;
  5061. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5062. arg: IntermediateCode.Operand;
  5063. dummy: IntermediateCode.Operand;
  5064. recordType: SyntaxTree.RecordType;
  5065. operatorSelectionProcedureOperand: Operand;
  5066. operatorSelectionProcedure: SyntaxTree.Procedure;
  5067. fingerPrint: SyntaxTree.FingerPrint;
  5068. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5069. identifierNumber: LONGINT;
  5070. parameterRegisters: SIZE;
  5071. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5072. procedure: SyntaxTree.Procedure;
  5073. callingConvention: SyntaxTree.CallingConvention;
  5074. PROCEDURE BackupGlobalState;
  5075. BEGIN
  5076. oldResult := result;
  5077. oldCurrentScope := currentScope;
  5078. oldArrayDestinationTag := arrayDestinationTag;
  5079. oldArrayDestinationDimension := arrayDestinationDimension;
  5080. oldConstantDeclaration := constantDeclaration;
  5081. oldDestination := destination;
  5082. oldCurrentLoop := currentLoop;
  5083. oldConditional := conditional;
  5084. oldTrueLabel := trueLabel;
  5085. oldFalseLabel := falseLabel;
  5086. oldLocked := locked;
  5087. oldUsedRegisters := usedRegisters
  5088. END BackupGlobalState;
  5089. PROCEDURE RestoreGlobalState;
  5090. BEGIN
  5091. result := oldResult;
  5092. currentScope := oldCurrentScope;
  5093. arrayDestinationTag := oldArrayDestinationTag;
  5094. arrayDestinationDimension := oldArrayDestinationDimension;
  5095. constantDeclaration := oldConstantDeclaration;
  5096. destination := oldDestination;
  5097. currentLoop := oldCurrentLoop;
  5098. conditional := oldConditional;
  5099. trueLabel := oldTrueLabel;
  5100. falseLabel := oldFalseLabel;
  5101. locked := oldLocked;
  5102. usedRegisters := oldUsedRegisters
  5103. END RestoreGlobalState;
  5104. (** do preparations before parameter push for array-structured object types (ASOTs):
  5105. if ASOT is passed as VAR parameter:
  5106. - allocate temporary variable of math array type
  5107. - copy contents of ASOT to be passed to temporary variable
  5108. - use temporary variable as the actual parameter instead
  5109. - 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)
  5110. **)
  5111. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5112. VAR
  5113. expression: SyntaxTree.Expression;
  5114. BEGIN
  5115. IF actualParameter IS SyntaxTree.Designator THEN
  5116. designator := actualParameter(SyntaxTree.Designator);
  5117. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5118. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5119. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5120. ASSERT(checker # NIL);
  5121. checker.SetCurrentScope(currentScope);
  5122. (* allocate temporary variable *)
  5123. ASSERT(actualParameter.type # NIL);
  5124. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5125. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5126. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5127. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5128. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5129. ASSERT(tempVariableDesignator.type # NIL);
  5130. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5131. (* copy math array stored in actual parameter to temporary variable *)
  5132. BackupGlobalState;
  5133. AssignMathArray(tempVariableDesignator, actualParameter);
  5134. RestoreGlobalState;
  5135. (* use temporary variable as actual parameter instead of the original one *)
  5136. actualParameter := tempVariableDesignator;
  5137. (* create write-back call and store it in linked list *)
  5138. (* create new list entry *)
  5139. IF firstWriteBackCall = NIL THEN
  5140. NEW(firstWriteBackCall);
  5141. currentWriteBackCall := firstWriteBackCall
  5142. ELSE
  5143. ASSERT(currentWriteBackCall # NIL);
  5144. NEW(currentWriteBackCall.next);
  5145. currentWriteBackCall := currentWriteBackCall.next
  5146. END;
  5147. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5148. ASSERT(expression.type = NIL);
  5149. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5150. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5151. (* prepare writeback for any other "normal" indexer *)
  5152. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5153. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5154. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5155. Assign(tempVariableDesignator, actualParameter);
  5156. actualParameter := tempVariableDesignator;
  5157. IF firstWriteBackCall = NIL THEN
  5158. NEW(firstWriteBackCall);
  5159. currentWriteBackCall := firstWriteBackCall
  5160. ELSE
  5161. ASSERT(currentWriteBackCall # NIL);
  5162. NEW(currentWriteBackCall.next);
  5163. currentWriteBackCall := currentWriteBackCall.next
  5164. END;
  5165. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5166. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5167. END
  5168. END
  5169. END PrepareParameter;
  5170. BEGIN
  5171. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5172. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5173. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5174. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5175. IF InlineProcedureCall(x) THEN
  5176. RETURN
  5177. ELSE
  5178. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5179. END
  5180. END;
  5181. END;
  5182. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5183. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5184. callingConvention := procedureType.callingConvention;
  5185. dest := destination; destination := emptyOperand;
  5186. SaveRegisters();ReleaseUsedRegisters(saved);
  5187. parameters := x.parameters;
  5188. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5189. (* an operator is called *)
  5190. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5191. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5192. (* check if a dynamic operator call should be performed *)
  5193. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5194. ELSE
  5195. isCallOfDynamicOperator := FALSE
  5196. END;
  5197. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5198. Emit(Push(position, ap));
  5199. END;
  5200. alignment := procedureType.stackAlignment;
  5201. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5202. alignment := 16 (* bytes *);
  5203. END;
  5204. IF alignment > 1 THEN
  5205. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5206. Emit(Mov(position,reg, sp));
  5207. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5208. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5209. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5210. gap := 4*ToMemoryUnits(system,system.addressSize);
  5211. END;
  5212. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5213. gap := gap - 6*ToMemoryUnits(system,system.addressSize); (* the first 6 parameters are passed via registers in SysVABI *)
  5214. IF gap < 0 THEN
  5215. gap := 0
  5216. END;
  5217. ELSE
  5218. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5219. END;
  5220. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5221. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5222. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5223. Emit(And(position,sp, sp, mask));
  5224. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5225. Emit(Push(position,reg));
  5226. ReleaseIntermediateOperand(reg);
  5227. END;
  5228. IF (callingConvention IN SysvABI) & (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,callingConvention, FALSE, dummy,-1)
  5284. (*
  5285. END;
  5286. *)
  5287. END;
  5288. firstWriteBackCall := NIL; (* reset write-back call list *)
  5289. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5290. parameterRegisters := backend.NumberParameterRegisters(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,callingConvention) THEN
  5299. Error(actualParameter.position,"cannot be passed by register")
  5300. ELSE
  5301. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,i);
  5302. END;
  5303. INC(registerNumber);
  5304. ELSE
  5305. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5306. END;
  5307. formalParameter := formalParameter.prevParameter;
  5308. END;
  5309. IF passByRegister (* & (registerNumber > 0)*) & ~(callingConvention IN SysvABI) 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, 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, 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 := ProcParametersSize(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, ProcParametersSize( 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 & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5425. SaveRegisters();ReleaseUsedRegisters(saved2);
  5426. CallThis(position,"Objects","LeaveA2",0);
  5427. RestoreRegisters(saved2);
  5428. END;
  5429. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) 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 & (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 (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 (callingConvention IN SysvABI) 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 & (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. ELSE
  5617. name := source.name;
  5618. END;
  5619. END;
  5620. RETURN td
  5621. END GetBackendType;
  5622. BEGIN
  5623. (*td := t.typeDeclaration;*)
  5624. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5625. (*
  5626. IF t IS SyntaxTree.PointerType THEN
  5627. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5628. ELSE
  5629. source := GetBackendType(t);
  5630. END;
  5631. *)
  5632. IF newObjectFile THEN
  5633. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5634. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5635. IntermediateCode.SetOffset(res,offset);
  5636. ELSE
  5637. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5638. END;
  5639. (*
  5640. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5641. make memory should be used when tag is used, not earlier
  5642. *)
  5643. RETURN res
  5644. END TypeDescriptorAdr;
  5645. (*
  5646. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5647. VAR result: IntermediateCode.Operand;
  5648. BEGIN
  5649. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5650. operand.tag := TypeDescriptorAdr(operand.type);
  5651. IntermediateCode.MakeMemory(operand.tag,addressType);
  5652. UseIntermediateOperand(operand.tag);
  5653. END;
  5654. END MakeTypeTag;
  5655. *)
  5656. PROCEDURE ProfilerInit;
  5657. VAR reg: IntermediateCode.Operand;
  5658. BEGIN
  5659. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5660. Emit(Call(position,reg,0));
  5661. END ProfilerInit;
  5662. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5663. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5664. BEGIN
  5665. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5666. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5667. THEN
  5668. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5669. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5670. Emit(Push(position,reg));
  5671. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5672. Emit(Push(position,reg));
  5673. StaticCallOperand(result,procedure);
  5674. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5675. ReleaseOperand(result);
  5676. END;
  5677. END ProfilerEnterExit;
  5678. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5679. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5680. BEGIN
  5681. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5682. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5683. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5684. profileInit.Emit(Push(position,reg));
  5685. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5686. profileInit.Emit(Push(position,reg));
  5687. NEW(string, LEN(name)); COPY(name, string^);
  5688. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5689. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5690. sv.SetType(type);
  5691. Designate(sv,result);
  5692. profileInit.Emit(Push(position,result.tag));
  5693. profileInit.Emit(Push(position,result.op));
  5694. StaticCallOperand(result,procedure);
  5695. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5696. ReleaseOperand(result);
  5697. END;
  5698. END ProfilerAddProcedure;
  5699. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5700. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5701. BEGIN
  5702. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5703. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5704. profileInit.Emit(Push(position,reg));
  5705. profileInitPatchPosition := profileInit.pc;
  5706. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5707. NEW(string, LEN(name)); COPY(name, string^);
  5708. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5709. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5710. sv.SetType(type);
  5711. Designate(sv,result);
  5712. profileInit.Emit(Push(position,result.tag));
  5713. profileInit.Emit(Push(position,result.op));
  5714. StaticCallOperand(result,procedure);
  5715. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5716. ReleaseOperand(result);
  5717. END;
  5718. END ProfilerAddModule;
  5719. PROCEDURE ProfilerPatchInit;
  5720. VAR reg: IntermediateCode.Operand;
  5721. BEGIN
  5722. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5723. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5724. EmitLeave(profileInit,position,NIL,0);
  5725. profileInit.Emit(Exit(position,0,0,0));
  5726. END ProfilerPatchInit;
  5727. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5728. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5729. VAR
  5730. id: LONGINT;
  5731. leftType, rightType: SyntaxTree.Type;
  5732. procedureType: SyntaxTree.ProcedureType;
  5733. runtimeProcedure: SyntaxTree.Procedure;
  5734. runtimeProcedureOperand, operatorOperand: Operand;
  5735. kind: SET;
  5736. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5737. VAR
  5738. arg: IntermediateCode.Operand;
  5739. recordType: SyntaxTree.RecordType;
  5740. fingerPrint: SyntaxTree.FingerPrint;
  5741. BEGIN
  5742. IF type = NIL THEN
  5743. (* no type: push 'NoType' *)
  5744. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5745. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5746. ELSIF IsStrictlyPointerToRecord(type) THEN
  5747. (* pointer to record type: push typetag *)
  5748. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5749. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5750. arg := TypeDescriptorAdr(recordType);
  5751. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5752. ELSE
  5753. (* non-pointer to record type: push fingerprint *)
  5754. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5755. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5756. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5757. END;
  5758. operatorInitializationCodeSection.Emit(Push(position,arg))
  5759. END PushTypeInfo;
  5760. BEGIN
  5761. ASSERT(operatorInitializationCodeSection # NIL);
  5762. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5763. procedureType := operator.type(SyntaxTree.ProcedureType);
  5764. (* determine types *)
  5765. leftType := procedureType.firstParameter.type;
  5766. IF procedureType.numberParameters = 2 THEN
  5767. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5768. rightType := procedureType.firstParameter.nextParameter.type;
  5769. ELSE
  5770. rightType := NIL
  5771. END;
  5772. (* determine operator kind *)
  5773. IF IsStrictlyPointerToRecord(leftType) THEN
  5774. kind := {LhsIsPointer}
  5775. ELSE
  5776. kind := {}
  5777. END;
  5778. IF IsStrictlyPointerToRecord(rightType) THEN
  5779. kind := kind + {RhsIsPointer}
  5780. END;
  5781. IF kind # {} THEN (* TODO: to be removed later on *)
  5782. (* at least one of the types is a pointer to record *)
  5783. (* emit a code that registers this specific operator in the runtime *)
  5784. dump := operatorInitializationCodeSection.comments;
  5785. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5786. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5787. (* push ID *)
  5788. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5789. id := Global.GetSymbol(module.module.case, operator.name);
  5790. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5791. (* push kind *)
  5792. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5793. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5794. (* push type infos *)
  5795. PushTypeInfo(leftType);
  5796. PushTypeInfo(rightType);
  5797. (* push operator address *)
  5798. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5799. StaticCallOperand(operatorOperand, operator);
  5800. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5801. ReleaseOperand(operatorOperand);
  5802. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5803. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  5804. ReleaseOperand(runtimeProcedureOperand)
  5805. END
  5806. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5807. END
  5808. END RegisterDynamicOperator;
  5809. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5810. VAR
  5811. traceModule: SyntaxTree.Module;
  5812. procedure: SyntaxTree.Procedure;
  5813. procedureVariable: SyntaxTree.Variable;
  5814. s,msg: Basic.MessageString;
  5815. res: Operand;
  5816. i: LONGINT;
  5817. sv: SyntaxTree.StringValue;
  5818. type: SyntaxTree.Type;
  5819. recordType: SyntaxTree.RecordType;
  5820. printout: Printout.Printer;
  5821. stringWriter: Streams.StringWriter;
  5822. expression: SyntaxTree.Expression;
  5823. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5824. BEGIN
  5825. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5826. IF procedure = NIL THEN
  5827. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5828. END;
  5829. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5830. s := "procedure ";
  5831. Strings.Append(s,backend.traceModuleName);
  5832. Strings.Append(s,".");
  5833. Strings.Append(s,procedureName);
  5834. Strings.Append(s," not present");
  5835. Error(position,s);
  5836. RETURN FALSE
  5837. ELSE
  5838. RETURN TRUE
  5839. END;
  5840. END GetProcedure;
  5841. PROCEDURE CallProcedure;
  5842. VAR size: LONGINT;
  5843. BEGIN
  5844. IF procedure # NIL THEN
  5845. StaticCallOperand(result,procedure);
  5846. size := ProcParametersSize(procedure);
  5847. ELSE
  5848. Symbol(procedureVariable, result);
  5849. LoadValue(result, procedureVariable.type.resolved);
  5850. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5851. END;
  5852. Emit(Call(position,result.op,size));
  5853. END CallProcedure;
  5854. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5855. VAR res: Operand; string: SyntaxTree.String;
  5856. BEGIN
  5857. IF GetProcedure("String") THEN
  5858. NEW(string, LEN(s)); COPY(s, string^);
  5859. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5860. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5861. sv.SetType(type);
  5862. Designate(sv,res);
  5863. Emit(Push(position,res.tag));
  5864. Emit(Push(position,res.op));
  5865. ReleaseOperand(res);
  5866. CallProcedure;
  5867. END;
  5868. END String;
  5869. PROCEDURE Integer(op: IntermediateCode.Operand);
  5870. BEGIN
  5871. IF GetProcedure("Int") THEN
  5872. Emit(Push(position,op));
  5873. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5874. CallProcedure;
  5875. END;
  5876. END Integer;
  5877. PROCEDURE Float(op: IntermediateCode.Operand);
  5878. BEGIN
  5879. IF GetProcedure("HIntHex") THEN
  5880. Emit(Push(position,op));
  5881. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5882. CallProcedure;
  5883. END;
  5884. END Float;
  5885. PROCEDURE Set(op: IntermediateCode.Operand);
  5886. BEGIN
  5887. IF GetProcedure("Set") THEN
  5888. Emit(Push(position,op));
  5889. (*
  5890. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5891. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5892. *)
  5893. CallProcedure;
  5894. END;
  5895. END Set;
  5896. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5897. BEGIN
  5898. IF GetProcedure("Boolean") THEN
  5899. Emit(Push(position,op));
  5900. CallProcedure;
  5901. END;
  5902. END Boolean;
  5903. PROCEDURE Char(op: IntermediateCode.Operand);
  5904. BEGIN
  5905. IF GetProcedure("Char") THEN
  5906. Emit(Push(position,op));
  5907. CallProcedure;
  5908. END;
  5909. END Char;
  5910. PROCEDURE Address(op: IntermediateCode.Operand);
  5911. BEGIN
  5912. IF GetProcedure("Address") THEN
  5913. Emit(Push(position,op));
  5914. CallProcedure;
  5915. END;
  5916. END Address;
  5917. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  5918. VAR len: IntermediateCode.Operand;
  5919. BEGIN
  5920. IF GetProcedure("String") THEN
  5921. len := GetArrayLength(type, op.tag);
  5922. Emit(Push(position,len));
  5923. ReleaseIntermediateOperand(len);
  5924. Emit(Push(position,op.op));
  5925. CallProcedure;
  5926. END;
  5927. END StringOperand;
  5928. PROCEDURE Ln;
  5929. BEGIN
  5930. IF GetProcedure("Ln") THEN
  5931. CallProcedure;
  5932. END;
  5933. END Ln;
  5934. BEGIN
  5935. IF backend.traceModuleName = "" THEN RETURN END;
  5936. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5937. IF GetProcedure("Enter") THEN
  5938. CallProcedure
  5939. END;
  5940. NEW(stringWriter,LEN(s));
  5941. FOR i := 0 TO x.Length()-1 DO
  5942. msg := "";
  5943. expression := x.GetExpression(i);
  5944. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5945. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5946. ELSE
  5947. Global.GetModuleName(module.module, s);
  5948. END;
  5949. IF i = 0 THEN
  5950. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  5951. stringWriter.String(":");
  5952. END;
  5953. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5954. IF ~(expression IS SyntaxTree.StringValue) THEN
  5955. printout.Expression(expression);
  5956. stringWriter.Get(s);
  5957. Strings.Append(msg,s);
  5958. Strings.Append(msg,"= ");
  5959. ELSE stringWriter.Get(s); (* remove from string writer *)
  5960. Strings.Append(msg, s);
  5961. END;
  5962. String(msg);
  5963. IF SemanticChecker.IsStringType(expression.type) THEN
  5964. Designate(expression,res);
  5965. StringOperand(res, expression.type);
  5966. ELSE
  5967. Evaluate(expression,res);
  5968. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5969. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5970. Convert(res.op,int64);
  5971. END;
  5972. Integer(res.op);
  5973. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5974. Boolean(res.op);
  5975. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5976. Set(res.op);
  5977. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5978. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5979. Convert(res.op,float64);
  5980. END;
  5981. Float(res.op);
  5982. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5983. Char(res.op);
  5984. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5985. Address(res.op);String("H");
  5986. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5987. Address(res.op);String("H");
  5988. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5989. Address(res.op);String("H");
  5990. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5991. Address(res.op);String("H");
  5992. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5993. String("NIL");
  5994. ELSE HALT(200);
  5995. END;
  5996. END;
  5997. ReleaseOperand(res);
  5998. String("; ");
  5999. END;
  6000. IF GetProcedure("Exit") THEN
  6001. CallProcedure
  6002. ELSE
  6003. Ln;
  6004. END;
  6005. END;
  6006. END SystemTrace;
  6007. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6008. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6009. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6010. BEGIN
  6011. type := type.resolved;
  6012. IF type IS SyntaxTree.RecordType THEN
  6013. WITH type: SyntaxTree.RecordType DO
  6014. baseType := type.baseType;
  6015. IF baseType # NIL THEN
  6016. baseType := baseType.resolved;
  6017. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6018. InitFields(baseType,adr,offset);
  6019. END;
  6020. variable := type.recordScope.firstVariable;
  6021. WHILE variable # NIL DO
  6022. IF variable.initializer # NIL THEN
  6023. Evaluate(variable.initializer,initializerOp);
  6024. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6025. Emit(Mov(position,mem,initializerOp.op));
  6026. ReleaseOperand(initializerOp);
  6027. ReleaseIntermediateOperand(mem);
  6028. END;
  6029. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6030. variable := variable.nextVariable
  6031. END;
  6032. END;
  6033. ELSIF type IS SyntaxTree.CellType THEN
  6034. WITH type: SyntaxTree.CellType DO
  6035. baseType := type.baseType;
  6036. IF baseType # NIL THEN
  6037. baseType := baseType.resolved;
  6038. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6039. InitFields(baseType,adr,offset);
  6040. END;
  6041. variable := type.cellScope.firstVariable;
  6042. WHILE variable # NIL DO
  6043. IF variable.initializer # NIL THEN
  6044. Evaluate(variable.initializer,initializerOp);
  6045. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6046. Emit(Mov(position,mem,initializerOp.op));
  6047. ReleaseOperand(initializerOp);
  6048. ReleaseIntermediateOperand(mem);
  6049. END;
  6050. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6051. variable := variable.nextVariable
  6052. END;
  6053. END;
  6054. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6055. WITH type: SyntaxTree.ArrayType DO
  6056. IF type.form = SyntaxTree.Static THEN
  6057. baseType := type.arrayBase;
  6058. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6059. FOR i := 0 TO type.staticLength-1 DO
  6060. InitFields(baseType,adr,offset+i*size);
  6061. END;
  6062. END;
  6063. END;
  6064. ELSIF type IS SyntaxTree.MathArrayType THEN
  6065. WITH type: SyntaxTree.MathArrayType DO
  6066. IF type.form = SyntaxTree.Open THEN
  6067. dim := DynamicDim(type);
  6068. imm := IntermediateCode.Immediate(addressType,dim);
  6069. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6070. baseType := SemanticChecker.ArrayBase(type,dim);
  6071. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6072. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6073. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6074. ReleaseIntermediateOperand(imm);
  6075. (* flags remain empty (=0) for open array *)
  6076. ELSIF type.form = SyntaxTree.Static THEN
  6077. baseType := type.arrayBase;
  6078. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6079. ASSERT(type.staticLength < 1024*1024*1024);
  6080. FOR i := 0 TO type.staticLength-1 DO
  6081. InitFields(baseType,adr,offset+i*size);
  6082. END;
  6083. END;
  6084. END;
  6085. END;
  6086. END InitFields;
  6087. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6088. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6089. BEGIN
  6090. type := variable.type.resolved;
  6091. IF (type IS SyntaxTree.MathArrayType) THEN
  6092. WITH type: SyntaxTree.MathArrayType DO
  6093. IF type.form = SyntaxTree.Open THEN
  6094. Symbol(variable,operand);
  6095. InitFields(type, operand.tag,0);
  6096. IF temporary THEN
  6097. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6098. END;
  6099. ELSIF type.form = SyntaxTree.Tensor THEN
  6100. Symbol(variable, operand);
  6101. MakeMemory(tmp,operand.op,addressType,0);
  6102. ReleaseOperand(operand);
  6103. IF temporary THEN
  6104. (* trick -- temporary object from array base *)
  6105. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6106. Symbol(symbol,operand);
  6107. MakeMemory(mem,operand.op,addressType,0);
  6108. ReleaseOperand(operand);
  6109. Emit(Mov(position,tmp, mem) );
  6110. ReleaseOperand(operand);
  6111. ELSE
  6112. Emit(Mov(position,tmp, nil ) );
  6113. END;
  6114. ReleaseIntermediateOperand(tmp);
  6115. END;
  6116. END;
  6117. ELSE
  6118. Symbol(variable,operand);
  6119. IF variable.initializer # NIL THEN
  6120. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6121. reference.SetType(variable.type.resolved);
  6122. reference.SetAssignable(TRUE);
  6123. Assign(reference,variable.initializer);
  6124. ELSIF temporary THEN
  6125. IF SemanticChecker.IsPointerType(variable.type) THEN
  6126. Symbol(variable, operand);
  6127. MakeMemory(tmp,operand.op,addressType,0);
  6128. ReleaseOperand(operand);
  6129. Emit(Mov(position,tmp, nil ) );
  6130. ReleaseIntermediateOperand(tmp);
  6131. END;
  6132. END;
  6133. InitFields(type, operand.op,0);
  6134. ReleaseOperand(operand);
  6135. END;
  6136. END InitVariable;
  6137. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6138. VAR end: Label;
  6139. BEGIN
  6140. IF type.form = SyntaxTree.Tensor THEN
  6141. InitOperand(result,ModeValue);
  6142. ReuseCopy(result.op,base);
  6143. end := NewLabel();
  6144. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6145. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6146. SetLabel(end);
  6147. Convert(result.op,lenType);
  6148. ELSE
  6149. InitOperand(result,ModeValue);
  6150. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6151. END
  6152. END MathArrayDim;
  6153. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6154. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6155. BEGIN
  6156. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6157. MakeMemory(mem,base,addressType,offset);
  6158. Emit(Mov(position,mem,value));
  6159. ReleaseIntermediateOperand(mem);
  6160. END PutMathArrayField;
  6161. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6162. VAR mem: IntermediateCode.Operand;
  6163. BEGIN
  6164. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6165. MakeMemory(mem,base,addressType,offset);
  6166. Emit(Mov(position,mem,value));
  6167. ReleaseIntermediateOperand(mem);
  6168. END PutMathArrayFieldOffset;
  6169. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6170. BEGIN
  6171. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6172. MakeMemory(value,base,addressType,offset);
  6173. END GetMathArrayField;
  6174. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6175. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6176. BEGIN
  6177. IF incr THEN
  6178. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6179. ELSE
  6180. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6181. END;
  6182. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6183. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6184. ELSE
  6185. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6186. Emit(Mov(position,reg,dim));
  6187. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6188. Emit(Add(position,reg,reg,base));
  6189. MakeMemory(mem, reg, addressType, offset);
  6190. ReleaseIntermediateOperand(reg);
  6191. Emit(Mov(position,mem,value));
  6192. ReleaseIntermediateOperand(mem);
  6193. END;
  6194. END PutMathArrayLenOrIncr;
  6195. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6196. BEGIN
  6197. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6198. END PutMathArrayLength;
  6199. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6200. BEGIN
  6201. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6202. END PutMathArrayIncrement;
  6203. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6204. BEGIN
  6205. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6206. END GetMathArrayIncrement;
  6207. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6208. BEGIN
  6209. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6210. END GetMathArrayLength;
  6211. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6212. VAR dimOp: IntermediateCode.Operand;
  6213. BEGIN
  6214. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6215. GetMathArrayLength(type, operand, dimOp, check, result);
  6216. END GetMathArrayLengthAt;
  6217. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6218. VAR dimOp: IntermediateCode.Operand;
  6219. BEGIN
  6220. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6221. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6222. END GetMathArrayIncrementAt;
  6223. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6224. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6225. offset: LONGINT;
  6226. BEGIN
  6227. IF increment THEN
  6228. offset := MathIncrOffset;
  6229. ELSE
  6230. offset := MathLenOffset;
  6231. END;
  6232. INC(offset,operand.dimOffset*2);
  6233. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6234. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6235. END;
  6236. (* static dimension *)
  6237. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6238. IF check & (type.form = SyntaxTree.Tensor) THEN
  6239. DimensionCheck(operand.tag,dim,BrltL);
  6240. END;
  6241. val := SHORT(dim.intValue);
  6242. IF type.form # SyntaxTree.Tensor THEN
  6243. t := SemanticChecker.ArrayBase(type,val);
  6244. type := t.resolved(SyntaxTree.MathArrayType);
  6245. IF type.form = SyntaxTree.Static THEN
  6246. IF increment THEN
  6247. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6248. ELSE
  6249. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6250. END;
  6251. InitOperand(result,ModeValue);
  6252. result.op := res;
  6253. RETURN;
  6254. END;
  6255. END;
  6256. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6257. MakeMemory(res,operand.tag,addressType,offset);
  6258. (*
  6259. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6260. *)
  6261. InitOperand(result,ModeValue);
  6262. result.op := res;
  6263. ELSE
  6264. Convert(dim,addressType);
  6265. IF check THEN
  6266. IF type.form = SyntaxTree.Tensor THEN
  6267. DimensionCheck(operand.tag,dim,BrltL);
  6268. ELSIF isUnchecked THEN (* do nothing *)
  6269. ELSE
  6270. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6271. END;
  6272. END;
  6273. end := NewLabel(); next := NIL;
  6274. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6275. Emit(Mov(position,res,dim));
  6276. Convert(res,sizeType);
  6277. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6278. WHILE t IS SyntaxTree.MathArrayType DO
  6279. type := t(SyntaxTree.MathArrayType);
  6280. IF type.form = SyntaxTree.Static THEN
  6281. imm := IntermediateCode.Immediate(sizeType,val);
  6282. next := NewLabel();
  6283. BrneL(next,imm,res);
  6284. IF increment THEN
  6285. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6286. ELSE
  6287. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6288. END;
  6289. Emit(MovReplace(position,res,imm));
  6290. BrL(end);
  6291. ELSE hasDynamicPart := TRUE;
  6292. END;
  6293. t := type.arrayBase.resolved;
  6294. val := val + 1;
  6295. IF next # NIL THEN SetLabel(next) END;
  6296. END;
  6297. IF hasDynamicPart THEN
  6298. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6299. Emit(Mov(position,res2,dim));
  6300. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6301. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6302. Emit(Add(position,res2,res2,imm));
  6303. Emit(Add(position,res2,res2,operand.tag));
  6304. IntermediateCode.MakeMemory(res2,sizeType);
  6305. Emit(MovReplace(position,res,res2));
  6306. ReleaseIntermediateOperand(res2);
  6307. END;
  6308. SetLabel(end);
  6309. Convert(res,sizeType);
  6310. InitOperand(result,ModeValue);
  6311. result.op := res;
  6312. END;
  6313. END MathArrayLenOrIncr;
  6314. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6315. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6316. offset: LONGINT;
  6317. BEGIN
  6318. offset := operand.dimOffset+DynamicDim(type)-1;
  6319. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6320. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6321. val := SHORT(dim.intValue);
  6322. t := SemanticChecker.ArrayBase(type,val);
  6323. type := t.resolved(SyntaxTree.ArrayType);
  6324. IF type.form = SyntaxTree.Static THEN
  6325. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6326. ELSE
  6327. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6328. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6329. END;
  6330. UseIntermediateOperand(res);
  6331. InitOperand(result,ModeValue);
  6332. result.op := res;
  6333. ELSE
  6334. Convert(dim,addressType);
  6335. IF ~isUnchecked THEN
  6336. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6337. END;
  6338. end := NewLabel(); next := NIL;
  6339. (* ReuseCopy(dim,res); *)
  6340. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6341. Emit(Mov(position,res,dim));
  6342. Convert(res,sizeType);
  6343. Convert(res,sizeType);
  6344. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6345. WHILE t IS SyntaxTree.ArrayType DO
  6346. type := t(SyntaxTree.ArrayType);
  6347. IF type.form = SyntaxTree.Static THEN
  6348. imm := IntermediateCode.Immediate(sizeType,val);
  6349. next := NewLabel();
  6350. BrneL(next,imm,res);
  6351. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6352. Emit(MovReplace(position,res,imm));
  6353. BrL(end);
  6354. ELSE hasDynamicPart := TRUE;
  6355. END;
  6356. t := type.arrayBase.resolved;
  6357. val := val + 1;
  6358. IF next # NIL THEN SetLabel(next) END;
  6359. END;
  6360. IF hasDynamicPart THEN
  6361. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6362. Convert(res2,addressType);
  6363. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6364. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6365. Emit(Sub(position,res2,imm,res2));
  6366. Emit(Add(position,res2,res2,operand.tag));
  6367. IntermediateCode.MakeMemory(res2,sizeType);
  6368. Emit(MovReplace(position,res,res2));
  6369. ReleaseIntermediateOperand(res2);
  6370. END;
  6371. SetLabel(end);
  6372. Convert(res,sizeType);
  6373. InitOperand(result,ModeValue);
  6374. result.op := res;
  6375. END;
  6376. END ArrayLen;
  6377. (**
  6378. create a temporary variable in current scope
  6379. **)
  6380. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6381. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6382. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6383. BEGIN
  6384. IF ~register THEN
  6385. v := temporaries.GetFreeVariable(type, untraced, index);
  6386. ELSE
  6387. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6388. END;
  6389. scope := currentScope;
  6390. (*
  6391. variable := NIL; (* disable free variable managemenet for the time being -- does not work *)
  6392. *)
  6393. name := temporaries.GetUID();
  6394. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6395. variable.SetType(type);
  6396. variable.SetAccess(SyntaxTree.Hidden);
  6397. variable.SetUntraced(untraced);
  6398. IF v = NIL THEN
  6399. temporaries.AddVariable(variable);
  6400. IF ~register THEN
  6401. IF scope.lastVariable # NIL THEN
  6402. offset := scope.lastVariable.offsetInBits;
  6403. ELSE
  6404. offset := 0;
  6405. END;
  6406. DEC(offset,system.SizeOf(variable.type));
  6407. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6408. variable(SyntaxTree.Variable).SetOffset(offset);
  6409. scope.AddVariable(variable(SyntaxTree.Variable));
  6410. scope.EnterSymbol(variable, duplicate);
  6411. ASSERT(~duplicate);
  6412. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6413. ELSE
  6414. variable.SetUseRegister(TRUE);
  6415. variable(SyntaxTree.Variable).SetOffset(0);
  6416. END;
  6417. ELSE (* v # NIL *)
  6418. (* reuse slot for new variable, do not create new slot ! *)
  6419. temporaries.SetVariable(index, variable);
  6420. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6421. ASSERT(~register);
  6422. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6423. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6424. scope.EnterSymbol(variable, duplicate);
  6425. ASSERT(~duplicate);
  6426. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6427. END;
  6428. RETURN variable(SyntaxTree.Variable)
  6429. END GetTemporaryVariable;
  6430. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6431. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6432. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6433. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6434. i: LONGINT; duplicate: BOOLEAN;
  6435. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6436. VAR variable: SyntaxTree.Variable;
  6437. BEGIN
  6438. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6439. variable.SetType(type);
  6440. recordScope.AddVariable(variable);
  6441. END AddVariable;
  6442. BEGIN
  6443. name := "@ArrayDescriptor";
  6444. Basic.AppendNumber(name,dimensions);
  6445. identifier := SyntaxTree.NewIdentifier(name);
  6446. parentScope := module.module.moduleScope;
  6447. symbol := parentScope.FindSymbol(identifier);
  6448. IF symbol # NIL THEN
  6449. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6450. type := typeDeclaration.declaredType;
  6451. ELSE
  6452. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6453. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6454. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6455. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6456. recordType.SetTypeDeclaration(typeDeclaration);
  6457. recordType.SetState(SyntaxTree.Resolved);
  6458. typeDeclaration.SetDeclaredType(recordType);
  6459. AddVariable("@ptr",system.anyType);
  6460. AddVariable("@adr",system.addressType);
  6461. AddVariable("@flags",system.addressType);
  6462. AddVariable("@dim",system.addressType);
  6463. AddVariable("@elementSize",system.addressType);
  6464. FOR i := 0 TO dimensions-1 DO
  6465. name := "@len";
  6466. Basic.AppendNumber(name,i);
  6467. AddVariable(name,system.addressType);
  6468. name := "@incr";
  6469. Basic.AppendNumber(name,i);
  6470. AddVariable(name,system.addressType);
  6471. END;
  6472. parentScope.AddTypeDeclaration(typeDeclaration);
  6473. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6474. ASSERT(~duplicate);
  6475. type := recordType;
  6476. END;
  6477. RETURN type
  6478. END GetMathArrayDescriptorType;
  6479. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6480. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6481. BEGIN
  6482. type := GetMathArrayDescriptorType(dimensions);
  6483. Emit(Push(position,op.op));
  6484. (* push type descriptor *)
  6485. reg := TypeDescriptorAdr(type);
  6486. IF ~newObjectFile THEN
  6487. IntermediateCode.MakeMemory(reg,addressType);
  6488. END;
  6489. Emit(Push(position,reg));
  6490. ReleaseIntermediateOperand(reg);
  6491. (* push realtime flag: false by default *)
  6492. Emit(Push(position,false));
  6493. CallThis(position,"Heaps","NewRec",3);
  6494. END NewMathArrayDescriptor;
  6495. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6496. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6497. BEGIN
  6498. NEW(string, LEN(s)); COPY(s, string^);
  6499. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6500. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6501. sv.SetType(type);
  6502. Designate(sv,res);
  6503. Emit(Push(position,res.tag));
  6504. Emit(Push(position,res.op));
  6505. ReleaseOperand(res);
  6506. END PushConstString;
  6507. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6508. BEGIN
  6509. IF b THEN
  6510. Emit(Push(Basic.invalidPosition, true));
  6511. ELSE
  6512. Emit(Push(Basic.invalidPosition, false));
  6513. END;
  6514. END PushConstBoolean;
  6515. PROCEDURE PushConstSet(v: SET);
  6516. VAR value: SyntaxTree.Value; op: Operand;
  6517. BEGIN
  6518. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6519. value.SetType(system.setType);
  6520. Evaluate(value, op);
  6521. Emit(Push(Basic.invalidPosition, op.op));
  6522. ReleaseOperand(op);
  6523. END PushConstSet;
  6524. PROCEDURE PushConstInteger(v: LONGINT);
  6525. VAR value: SyntaxTree.Value; op: Operand;
  6526. BEGIN
  6527. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6528. value.SetType(system.longintType);
  6529. Evaluate(value, op);
  6530. Emit(Push(Basic.invalidPosition, op.op));
  6531. ReleaseOperand(op);
  6532. END PushConstInteger;
  6533. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6534. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6535. section: IntermediateCode.Section;
  6536. BEGIN
  6537. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6538. Global.GetSymbolSegmentedName(symbol, name);
  6539. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6540. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6541. procedure.SetScope(moduleScope);
  6542. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6543. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6544. procedure.SetAccess(SyntaxTree.Hidden);
  6545. currentScope := procedureScope;
  6546. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6547. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6548. RETURN section;
  6549. END OpenInitializer;
  6550. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6551. BEGIN
  6552. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6553. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6554. section := prev;
  6555. END CloseInitializer;
  6556. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6557. VAR name: SyntaxTree.IdentifierString;
  6558. variable: SyntaxTree.Variable;
  6559. parameter: SyntaxTree.Parameter;
  6560. type: SyntaxTree.Type;
  6561. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6562. BEGIN
  6563. InitOperand(op,ModeReference);
  6564. op.op := fp;
  6565. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6566. Dereference(op, x, FALSE);
  6567. result := op;
  6568. Symbol(symbol, op);
  6569. END Field;
  6570. PROCEDURE Direction(direction: LONGINT): SET;
  6571. BEGIN
  6572. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6573. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6574. ELSE HALT(100);
  6575. END;
  6576. END Direction;
  6577. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6578. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6579. BEGIN
  6580. Field(port, op);
  6581. ToMemory(op.op,addressType,0);
  6582. Emit(Push(Basic.invalidPosition, op.op));
  6583. ReleaseOperand(op);
  6584. Basic.GetString(modifier.identifier, name);
  6585. PushConstString(name);
  6586. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6587. ASSERT(SemanticChecker.IsStringType(value.type));
  6588. Designate(value, op);
  6589. Emit(Push(modifier.position, op.tag));
  6590. Emit(Push(modifier.position, op.op));
  6591. ReleaseOperand(op);
  6592. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6593. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6594. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6595. Evaluate(value, op);
  6596. Emit(Push(modifier.position, op.op));
  6597. ReleaseOperand(op);
  6598. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6599. ELSE
  6600. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6601. END;
  6602. END AddPortProperty;
  6603. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6604. VAR modifier: SyntaxTree.Modifier;
  6605. BEGIN
  6606. modifier := parameter.modifiers;
  6607. WHILE modifier # NIL DO
  6608. AddPortProperty(parameter,modifier, modifier.expression);
  6609. modifier := modifier.nextModifier;
  6610. END;
  6611. END AddPortProperties;
  6612. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6613. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6614. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6615. PROCEDURE PushLens(type: SyntaxTree.Type);
  6616. BEGIN
  6617. IF IsSemiDynamicArray(type) THEN
  6618. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6619. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6620. Emit(Push(Basic.invalidPosition, op.op));
  6621. ReleaseOperand(op);
  6622. INC(dim);
  6623. ELSIF IsStaticArray(type) THEN
  6624. len := len * type(SyntaxTree.ArrayType).staticLength;
  6625. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6626. INC(dim);
  6627. ELSE
  6628. baseType := type;
  6629. END;
  6630. END PushLens;
  6631. BEGIN
  6632. (* cell *)
  6633. IF parameter.type IS SyntaxTree.ArrayType THEN
  6634. type := parameter.type;
  6635. dim := 0;
  6636. len := 1;
  6637. PushLens(type);
  6638. portType := baseType.resolved(SyntaxTree.PortType);
  6639. ELSE
  6640. portType := parameter.type(SyntaxTree.PortType);
  6641. END;
  6642. PushSelfPointer();
  6643. (* port / array of ports *)
  6644. IF IsStaticArray(type) THEN
  6645. PushConstInteger(len);
  6646. END;
  6647. Field(parameter, op);
  6648. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6649. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6650. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6651. Designate(d, op);*)
  6652. Emit(Push(Basic.invalidPosition, op.op));
  6653. ReleaseOperand(op);
  6654. (* name *)
  6655. PushConstString(name);
  6656. (* inout *)
  6657. PushConstSet(Direction(portType.direction));
  6658. (* width *)
  6659. PushConstInteger(portType.sizeInBits);
  6660. IF parameter.type IS SyntaxTree.PortType THEN
  6661. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6662. AddPortProperties(parameter);
  6663. ELSIF IsStaticArray(type)THEN
  6664. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6665. ELSIF IsSemiDynamicArray(type) THEN
  6666. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6667. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6668. Emit(Add(position,reg, sp, size));
  6669. (* dim *)
  6670. PushConstInteger(dim);
  6671. (* len array *)
  6672. Emit(Push(position, reg));
  6673. ReleaseIntermediateOperand(reg);
  6674. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6675. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6676. Emit(Add(position, sp,sp, size));
  6677. ELSE
  6678. HALT(100);
  6679. END;
  6680. END Parameter;
  6681. BEGIN
  6682. IF backend.cellsAreObjects THEN
  6683. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6684. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6685. END;
  6686. parameter := x.firstParameter;
  6687. WHILE (parameter # NIL) DO
  6688. type := parameter.type.resolved;
  6689. WHILE (type IS SyntaxTree.ArrayType) DO
  6690. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6691. END;
  6692. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6693. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6694. Parameter(name,parameter);
  6695. END;
  6696. parameter := parameter.nextParameter;
  6697. END;
  6698. ELSE HALT(200)
  6699. END;
  6700. END AddPorts;
  6701. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6702. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6703. BEGIN
  6704. Symbol(cell,op);
  6705. ToMemory(op.op,addressType,0);
  6706. Emit(Push(position,op.op));
  6707. ReleaseOperand(op);
  6708. property.GetName(name);
  6709. (* does not work when inheritance is used:
  6710. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6711. *)
  6712. PushConstString(name);
  6713. IF (value # NIL) THEN
  6714. ASSERT(
  6715. SemanticChecker.IsStringType(property.type)
  6716. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6717. OR (property.type.resolved IS SyntaxTree.FloatType)
  6718. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6719. OR (property.type.resolved IS SyntaxTree.SetType)
  6720. );
  6721. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6722. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6723. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6724. Designate(d, op);
  6725. IF SemanticChecker.IsStringType(property.type) THEN
  6726. Emit(Push(Basic.invalidPosition, op.tag))
  6727. END;
  6728. Emit(Push(Basic.invalidPosition, op.op));
  6729. ReleaseOperand(op);
  6730. END;
  6731. IF value = NIL THEN
  6732. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6733. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6734. ASSERT(SemanticChecker.IsStringType(value.type));
  6735. Designate(value, op);
  6736. PushString(op, value.type);
  6737. ReleaseOperand(op);
  6738. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6739. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6740. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6741. Evaluate(value, op);
  6742. Emit(Push(property.position, op.op));
  6743. ReleaseOperand(op);
  6744. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6745. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6746. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6747. Evaluate(value, op);
  6748. Emit(Push(property.position, op.op));
  6749. ReleaseOperand(op);
  6750. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6751. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6752. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6753. Evaluate(value, op);
  6754. Emit(Push(property.position, op.op));
  6755. ReleaseOperand(op);
  6756. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6757. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6758. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6759. Evaluate(value, op);
  6760. Emit(Push(property.position, op.op));
  6761. ReleaseOperand(op);
  6762. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6763. ELSE
  6764. HALT(200);
  6765. END;
  6766. END AddProperty;
  6767. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6768. VAR symbol: SyntaxTree.Symbol;
  6769. BEGIN
  6770. WHILE modifier # NIL DO
  6771. symbol := cellType.FindProperty(modifier.identifier);
  6772. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6773. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6774. modifier := modifier.nextModifier;
  6775. END;
  6776. END AddModifiers;
  6777. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6778. VAR last: SyntaxTree.Modifier;
  6779. BEGIN
  6780. IF to = NIL THEN
  6781. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6782. ELSE
  6783. last := to;
  6784. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6785. last := last.nextModifier;
  6786. END;
  6787. IF last.identifier # this.identifier THEN
  6788. ASSERT(last.nextModifier = NIL);
  6789. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6790. END;
  6791. END;
  6792. END AppendModifier;
  6793. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6794. BEGIN
  6795. WHILE this # NIL DO
  6796. AppendModifier(to, this);
  6797. this := this.nextModifier;
  6798. END;
  6799. END AppendModifiers;
  6800. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6801. VAR base: SyntaxTree.Type;
  6802. BEGIN
  6803. AppendModifiers(to, c.modifiers);
  6804. base := c.GetBaseValueType();
  6805. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6806. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6807. END;
  6808. END AppendCellTypeModifiers;
  6809. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6810. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6811. BEGIN
  6812. Basic.GetString(modifier.identifier, name);
  6813. PushConstString(name);
  6814. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6815. ASSERT(SemanticChecker.IsStringType(value.type));
  6816. Designate(value, op);
  6817. PushString(op, value.type);
  6818. ReleaseOperand(op);
  6819. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6820. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6821. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6822. Evaluate(value, op);
  6823. Emit(Push(modifier.position, op.op));
  6824. ReleaseOperand(op);
  6825. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6826. ELSE
  6827. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6828. END;
  6829. END AddPortProperty;
  6830. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6831. BEGIN
  6832. WHILE modifier # NIL DO
  6833. AddPortProperty(modifier, modifier.expression);
  6834. modifier := modifier.nextModifier;
  6835. END;
  6836. END AddPortProperties;
  6837. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6838. VAR op: Operand;
  6839. BEGIN
  6840. Evaluate(p, op);
  6841. Emit(Push(p.position, op.op));
  6842. ReleaseOperand(op);
  6843. IF p IS SyntaxTree.Designator THEN
  6844. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6845. END;
  6846. END PushPort;
  6847. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6848. VAR tmp: IntermediateCode.Operand;
  6849. BEGIN
  6850. actualType := actualType.resolved;
  6851. IF actualType IS SyntaxTree.StringType THEN
  6852. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6853. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6854. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6855. ELSE
  6856. tmp := op.tag;
  6857. IntermediateCode.MakeMemory(tmp,addressType);
  6858. Emit(Push(position,tmp));
  6859. END;
  6860. Emit(Push(position,op.op))
  6861. END PushString;
  6862. (* conservative check if x is potentially on the heap, excluding the module heap
  6863. required for generational garbage collector
  6864. *)
  6865. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6866. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6867. BEGIN
  6868. RETURN TRUE;
  6869. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6870. passed by reference.
  6871. pos := x.position.start;
  6872. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6873. x := x(SyntaxTree.Designator).left;
  6874. END;
  6875. RETURN x # NIL;
  6876. *)
  6877. END OnHeap;
  6878. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  6879. VAR
  6880. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6881. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6882. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6883. tmp:IntermediateCode.Operand;
  6884. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6885. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6886. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6887. dest: IntermediateCode.Operand;
  6888. staticLength: LONGINT; itype: IntermediateCode.Type;
  6889. convert,isTensor: BOOLEAN;
  6890. recordType: SyntaxTree.RecordType;
  6891. baseType: SyntaxTree.Type;
  6892. flags: SET;
  6893. left: SyntaxTree.Expression;
  6894. call: SyntaxTree.Designator;
  6895. procedure: SyntaxTree.Procedure;
  6896. temporaryVariable: SyntaxTree.Variable;
  6897. dummy: IntermediateCode.Operand;
  6898. customBuiltin: SyntaxTree.CustomBuiltin;
  6899. isVarPar: ARRAY 3 OF BOOLEAN;
  6900. callsection: Sections.Section;
  6901. segmentedName: Basic.SegmentedName;
  6902. needsTrace: BOOLEAN;
  6903. n: ARRAY 256 OF CHAR;
  6904. modifier: SyntaxTree.Modifier;
  6905. previous, init: IntermediateCode.Section;
  6906. prevScope: SyntaxTree.Scope;
  6907. firstPar: LONGINT;
  6908. saved: RegisterEntry;
  6909. callingConvention: SyntaxTree.CallingConvention;
  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,ProcParametersSize(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 := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  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 := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  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),ProcParametersSize(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),ProcParametersSize(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. callingConvention := procedureType.callingConvention;
  7741. left.SetType(procedure.type);
  7742. formalParameter := procedureType.firstParameter;
  7743. (* push array to allocate *)
  7744. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  7745. formalParameter :=formalParameter.nextParameter;
  7746. (* push length array *)
  7747. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  7748. (* push size *)
  7749. type := t0;
  7750. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7751. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7752. END;
  7753. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7754. Emit(Push(position,tmp));
  7755. (* *)
  7756. IF SemanticChecker.ContainsPointer(type) THEN
  7757. tmp := TypeDescriptorAdr(type);
  7758. IF ~newObjectFile THEN
  7759. IntermediateCode.MakeMemory(tmp,addressType);
  7760. END;
  7761. ELSE
  7762. tmp := IntermediateCode.Immediate(addressType, 0);
  7763. END;
  7764. Emit(Push(position,tmp)); (* type descriptor *)
  7765. StaticCallOperand(result,procedure);
  7766. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7767. ReleaseOperand(result);
  7768. END;
  7769. (*
  7770. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7771. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7772. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7773. *)
  7774. ELSE
  7775. (*
  7776. push len0
  7777. push len1
  7778. push len2
  7779. push size
  7780. push len_adr
  7781. push element_size
  7782. push tag
  7783. push adr
  7784. *)
  7785. dim := 0;
  7786. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7787. isTensor := TRUE;
  7788. ELSE
  7789. isTensor := FALSE;
  7790. END;
  7791. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7792. IF ~isTensor THEN
  7793. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7794. END;
  7795. parameter := x.parameters.GetExpression(i);
  7796. Evaluate(parameter,r);
  7797. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7798. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7799. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7800. END;
  7801. Emit(Push(position,r.op));
  7802. ReleaseOperand(r);
  7803. INC(dim);
  7804. END;
  7805. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7806. Emit(Mov(position, adr, sp));
  7807. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7808. Emit(Push(position, adr));
  7809. ReleaseIntermediateOperand(adr);
  7810. openDim := dim;
  7811. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7812. IF isTensor THEN
  7813. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7814. ELSE
  7815. baseType := SemanticChecker.ArrayBase(type,openDim);
  7816. END;
  7817. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7818. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7819. IF SemanticChecker.ContainsPointer(baseType) THEN
  7820. tmp := TypeDescriptorAdr(baseType);
  7821. IF ~newObjectFile THEN
  7822. IntermediateCode.MakeMemory(tmp,addressType);
  7823. END;
  7824. ELSE
  7825. tmp := nil;
  7826. END;
  7827. Emit(Push(position,tmp)); (* type descriptor *)
  7828. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7829. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7830. ELSE (* error message has already been emited *)
  7831. RETURN;
  7832. END;
  7833. Designate(p0,l);
  7834. IF isTensor THEN
  7835. Emit(Push(position,l.op)); (* address *)
  7836. ELSE
  7837. Emit(Push(position,l.tag)); (* address *)
  7838. END;
  7839. ReleaseOperand(l);
  7840. StaticCallOperand(result,procedure);
  7841. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7842. ReleaseOperand(result);
  7843. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7844. Emit(Add(position,sp,sp,tmp));
  7845. END;
  7846. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7847. THEN
  7848. IF ~backend.cellsAreObjects THEN RETURN END;
  7849. IF InCellScope(currentScope) THEN
  7850. PushSelfPointer()
  7851. ELSE
  7852. Emit(Push(position, nil));
  7853. END;
  7854. (* push temp address *)
  7855. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7856. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7857. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7858. (* l.op contains address of pointer to record *)
  7859. Emit(Push(position,l.op)); (* address for use after syscall *)
  7860. ReleaseOperand(l);
  7861. (* push type descriptor *)
  7862. reg := TypeDescriptorAdr(baseType);
  7863. IF ~newObjectFile THEN
  7864. IntermediateCode.MakeMemory(reg,addressType);
  7865. END;
  7866. Emit(Push(position,reg));
  7867. ReleaseIntermediateOperand(reg);
  7868. (* push name *)
  7869. (*Global.GetSymbolName(p0, n);*)
  7870. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7871. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7872. ELSE
  7873. Global.GetModuleName(module.module, n);
  7874. END;
  7875. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7876. (*type.typeDeclaration.GetName(n);*)
  7877. PushConstString(n);
  7878. (* push cellnet boolean *)
  7879. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7880. (* push engine boolean *)
  7881. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7882. (* allocate *)
  7883. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7884. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7885. (* l.op contains address of pointer to record *)
  7886. ToMemory(l.op,addressType,0);
  7887. (* l.op contains value of pointer to record *)
  7888. InitFields(baseType, l.op,0);
  7889. (* add capabilities *)
  7890. modifier := p0(SyntaxTree.Designator).modifiers;
  7891. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7892. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7893. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7894. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7895. END;
  7896. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7897. (*
  7898. modifier := baseType(SyntaxTree.CellType).modifiers;
  7899. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7900. modifier := p0(SyntaxTree.Designator).modifiers;
  7901. *)
  7902. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7903. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7904. (* l.op contains address of pointer to record *)
  7905. ToMemory(l.op,addressType,0);
  7906. (* l.op contains value of pointer to record *)
  7907. Emit(Push(position,l.op)); (* address for use after syscall *)
  7908. ReleaseOperand(l);
  7909. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7910. prevScope := currentScope;
  7911. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7912. previous := section;
  7913. section := init;
  7914. (* add ports *)
  7915. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7916. CloseInitializer(previous);
  7917. currentScope := prevScope;
  7918. Symbol(temporaryVariable,l);
  7919. ToMemory(l.op,addressType,0);
  7920. Emit(Push(position,l.op));
  7921. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7922. (*
  7923. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7924. IF constructor # NIL THEN
  7925. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7926. FOR i := 1 TO x.parameters.Length()-1 DO
  7927. p := x.parameters.GetExpression(i);
  7928. Global.GetSymbolName(parameter,name);
  7929. Evaluate(p, value);
  7930. ASSERT(value.type # NIL);
  7931. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7932. par := instance.AddParameter(name);
  7933. par.SetInteger(value.integer);
  7934. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7935. par := instance.AddParameter(name);
  7936. par.SetBoolean(value.boolean);
  7937. ELSE Error(x.position,NotYetImplemented)
  7938. END;
  7939. parameter := parameter.nextParameter
  7940. END;
  7941. END;
  7942. *)
  7943. (* call initializer *)
  7944. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7945. IF constructor # NIL THEN
  7946. (*! should be unified with ProcedureCallDesignator *)
  7947. IF backend.cellsAreObjects THEN
  7948. Symbol(temporaryVariable,l);
  7949. ToMemory(l.op,addressType,0);
  7950. Emit(Push(position,l.op));
  7951. ReleaseOperand(l);
  7952. END;
  7953. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7954. FOR i := firstPar TO x.parameters.Length()-1 DO
  7955. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7956. formalParameter := formalParameter.nextParameter;
  7957. END;
  7958. (* static call of the constructor *)
  7959. Global.GetSymbolSegmentedName(constructor,name);
  7960. ASSERT(~constructor.isInline);
  7961. IF constructor.scope.ownerModule # module.module THEN
  7962. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7963. ELSE
  7964. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7965. END;
  7966. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7967. (*ELSE
  7968. ReleaseIntermediateOperand(pointer);*)
  7969. END;
  7970. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7971. ToMemory(l.op, addressType, 0);
  7972. Designate(p0,s0);
  7973. ToMemory(s0.op,addressType,0);
  7974. Emit(Mov(position,s0.op,l.op));
  7975. ReleaseOperand(l);
  7976. ReleaseOperand(s0);
  7977. result.tag := emptyOperand;
  7978. (* start *)
  7979. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7980. (* push cell *)
  7981. Symbol(temporaryVariable, l);
  7982. ToMemory(l.op,addressType,0);
  7983. Emit(Push(Basic.invalidPosition,l.op));
  7984. (* push delegate *)
  7985. Emit(Push(Basic.invalidPosition,l.op));
  7986. ReleaseOperand(l);
  7987. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7988. Emit(Push(position, s1.op));
  7989. ReleaseOperand(s1);
  7990. CallThis(position,"ActiveCellsRuntime","Start",3);
  7991. END;
  7992. (*IF temporaryVariable # NIL THEN
  7993. end := NewLabel();
  7994. BrL(end);
  7995. SetLabel(exit);
  7996. Designate(p0,l);
  7997. ToMemory(l.op,addressType,0);
  7998. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7999. ReleaseOperand(l);
  8000. SetLabel(end);
  8001. ELSE
  8002. SetLabel(exit);
  8003. END;
  8004. *)
  8005. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8006. ELSE (* no pointer to record, no pointer to array *)
  8007. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8008. (* ignore new statement *)
  8009. Warning(p0.position, "cannot run on final hardware");
  8010. ELSE
  8011. HALT(200);
  8012. END;
  8013. END;
  8014. (* ---- ADDRESSOF----- *)
  8015. |Global.systemAdr:
  8016. Designate(p0,s0);
  8017. s0.mode := ModeValue;
  8018. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8019. ReleaseIntermediateOperand(s0.op);
  8020. s0.op := s0.tag;
  8021. IntermediateCode.InitOperand(s0.tag);
  8022. END;
  8023. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8024. result := s0;
  8025. (* ---- BIT ----- *)
  8026. |Global.systemBit:
  8027. Evaluate(p0,s0);
  8028. ToMemory(s0.op,addressType,0);
  8029. ReuseCopy(res,s0.op);
  8030. ReleaseOperand(s0);
  8031. Evaluate(p1,s1);
  8032. Emit(Ror(position,res,res,s1.op));
  8033. ReleaseOperand(s1);
  8034. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8035. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8036. IF ~conditional THEN
  8037. InitOperand(result,ModeValue); result.op := res;
  8038. ELSE
  8039. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8040. BrL(falseLabel);
  8041. ReleaseIntermediateOperand(res);
  8042. END;
  8043. (* --- MSK ----*)
  8044. |Global.systemMsk:
  8045. Evaluate(p0,s0);
  8046. Evaluate(p1,s1);
  8047. ReuseCopy(res,s0.op);
  8048. ReleaseOperand(s0);
  8049. Emit(And(position,res,res,s1.op));
  8050. ReleaseOperand(s1);
  8051. InitOperand(result,ModeValue);
  8052. result.op := res;
  8053. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8054. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8055. Evaluate(p0,s0);
  8056. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8057. ReleaseOperand(s0);
  8058. InitOperand(result,ModeValue);
  8059. result.op := res;
  8060. (* ---- SYSTEM.GetStackPointer ----- *)
  8061. |Global.systemGetStackPointer:
  8062. InitOperand(result,ModeValue);
  8063. result.op := sp;
  8064. (* ---- SYSTEM.GetFramePointer ----- *)
  8065. |Global.systemGetFramePointer:
  8066. InitOperand(result,ModeValue);
  8067. result.op := fp;
  8068. (* ---- SYSTEM.GetActivity ----- *)
  8069. |Global.systemGetActivity:
  8070. ASSERT(backend.cooperative);
  8071. InitOperand(result,ModeValue);
  8072. result.op := ap;
  8073. (* ---- SYSTEM.SetStackPointer ----- *)
  8074. |Global.systemSetStackPointer:
  8075. Evaluate(p0,s0); (* *)
  8076. Emit(Mov(position,sp,s0.op));
  8077. ReleaseOperand(s0);
  8078. (* ---- SYSTEM.SetFramePointer ----- *)
  8079. |Global.systemSetFramePointer:
  8080. Evaluate(p0,s0); (* *)
  8081. Emit(Mov(position,fp,s0.op));
  8082. ReleaseOperand(s0);
  8083. (* ---- SYSTEM.Activity ----- *)
  8084. |Global.systemSetActivity:
  8085. ASSERT(backend.cooperative);
  8086. Evaluate(p0,s0); (* *)
  8087. Emit(Mov(position,ap,s0.op));
  8088. ReleaseOperand(s0);
  8089. (* ---- SYSTEM.VAL ----- *)
  8090. |Global.systemVal:
  8091. Expression(p1);
  8092. s1 := result;
  8093. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8094. IF s1.mode = ModeReference THEN
  8095. (* nothing to be done if not record type, just take over new type *)
  8096. IF (type IS SyntaxTree.RecordType) THEN
  8097. ReleaseIntermediateOperand(s1.tag);
  8098. s1.tag := TypeDescriptorAdr(type);
  8099. IF ~newObjectFile THEN
  8100. IntermediateCode.MakeMemory(s1.tag,addressType);
  8101. END;
  8102. UseIntermediateOperand(s1.tag);
  8103. END;
  8104. result := s1;
  8105. ELSE (* copy over result to different type, may not use convert *)
  8106. itype := IntermediateCode.GetType(system,type);
  8107. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8108. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8109. Emit(Mov(position,s0.op,s1.op));
  8110. ReleaseOperand(s1);
  8111. InitOperand(result,ModeValue);
  8112. result.op := s0.op;
  8113. ELSE (* different size, must convert *)
  8114. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8115. Convert(s1.op, IntermediateCode.GetType(system,type));
  8116. result := s1;
  8117. END;
  8118. END;
  8119. (* ---- SYSTEM.GET ----- *)
  8120. |Global.systemGet:
  8121. Evaluate(p0,s0); (* adr *)
  8122. Designate(p1,s1); (* variable *)
  8123. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8124. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8125. Emit(Mov(position,s1.op,s0.op));
  8126. ReleaseOperand(s1);
  8127. ReleaseOperand(s0);
  8128. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8129. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8130. Evaluate(p0,s0); (* *)
  8131. Evaluate(p1,s1); (* variable *)
  8132. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8133. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8134. (* real part *)
  8135. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8136. Emit(Mov(position,res, s1.op));
  8137. ReleaseIntermediateOperand(res);
  8138. (* imaginary part *)
  8139. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8140. Emit(Mov(position,res, s1.tag));
  8141. ReleaseIntermediateOperand(res);
  8142. ReleaseOperand(s1);
  8143. ReleaseOperand(s0);
  8144. ELSE
  8145. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8146. ReleaseOperand(s0);
  8147. Emit(Mov(position,res,s1.op));
  8148. ReleaseIntermediateOperand(res);
  8149. ReleaseOperand(s1);
  8150. END;
  8151. (* ---- SYSTEM.MOVE ----- *)
  8152. |Global.systemMove:
  8153. Evaluate(p0,s0);
  8154. Evaluate(p1,s1);
  8155. Evaluate(p2,s2);
  8156. Emit(Copy(position,s1.op,s0.op,s2.op));
  8157. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8158. (* ---- SYSTEM.NEW ----- *)
  8159. |Global.systemNew:
  8160. Designate(p0,s0);
  8161. Emit(Push(position,s0.op));
  8162. ReleaseOperand(s0);
  8163. Evaluate(p1,s1);
  8164. Emit(Push(position,s1.op));
  8165. ReleaseOperand(s1);
  8166. (* push realtime flag: false by default *)
  8167. Emit(Push(position,false));
  8168. CallThis(position,"Heaps","NewSys",3);
  8169. (* ---- SYSTEM.CALL ----- *)
  8170. |Global.systemRef:
  8171. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8172. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8173. s0.mode := ModeValue;
  8174. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8175. result := s0
  8176. (* ---- INCR ----- *)
  8177. |Global.Incr:
  8178. Designate(p0,operand);
  8179. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8180. Dereference(operand,p0.type.resolved,FALSE);
  8181. END;
  8182. ASSERT(p1 # NIL);
  8183. Evaluate(p1,l);
  8184. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8185. ReleaseOperand(operand); ReleaseOperand(l);
  8186. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8187. (* ---- SUM ----- *)
  8188. |Global.Sum: HALT(200);
  8189. (* ---- ALL ----- *)
  8190. |Global.All: HALT(200);
  8191. (* ---- CAS ----- *)
  8192. |Global.Cas:
  8193. needsTrace := p0.NeedsTrace();
  8194. IF needsTrace THEN ModifyAssignments(true) END;
  8195. Designate(p0,s0);
  8196. Evaluate(p1,s1);
  8197. Evaluate(p2,s2);
  8198. IF needsTrace THEN
  8199. Emit(Push(position, s0.op));
  8200. Emit(Push(position, s1.op));
  8201. Emit(Push(position, s2.op));
  8202. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8203. ELSE
  8204. Emit(Cas(position,s0.op,s1.op,s2.op));
  8205. END;
  8206. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8207. IF needsTrace THEN ModifyAssignments(false) END;
  8208. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8209. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8210. IF conditional THEN
  8211. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8212. BrL(falseLabel);
  8213. ReleaseIntermediateOperand(res);
  8214. END;
  8215. (* ---- DIM ----- *)
  8216. |Global.Dim:
  8217. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8218. Designate(p0,s0);
  8219. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8220. Dereference(s0,p0.type.resolved,FALSE);
  8221. END;
  8222. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8223. ReleaseOperand(s0);
  8224. (* ---- RESHAPE ----- *)
  8225. |Global.Reshape:
  8226. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8227. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8228. left.SetType(procedure.type);
  8229. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8230. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8231. END;
  8232. (* ---- SYSTEM.TYPECODE ----- *)
  8233. |Global.systemTypeCode:
  8234. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8235. IF type.resolved IS SyntaxTree.PointerType THEN
  8236. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8237. END;
  8238. result.op := TypeDescriptorAdr(type);
  8239. IF ~newObjectFile THEN
  8240. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  8241. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  8242. END;
  8243. result.mode := ModeValue;
  8244. (* ---- SYSTEM.TRACE ----- *)
  8245. |Global.systemTrace:
  8246. SystemTrace(x.parameters, x.position);
  8247. (* ----- CONNECT ------*)
  8248. |Global.Connect:
  8249. IF backend.cellsAreObjects THEN
  8250. PushPort(p0);
  8251. PushPort(p1);
  8252. IF p2 # NIL THEN
  8253. Evaluate(p2, s2);
  8254. Emit(Push(p2.position, s2.op));
  8255. ReleaseOperand(s2);
  8256. ELSE
  8257. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8258. END;
  8259. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8260. ELSE
  8261. Warning(x.position, "cannot run on final hardware");
  8262. END;
  8263. (* ----- DELEGATE ------*)
  8264. |Global.Delegate:
  8265. IF backend.cellsAreObjects THEN
  8266. PushPort(p0);
  8267. PushPort(p1);
  8268. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8269. ELSE
  8270. Warning(x.position, "cannot run on final hardware");
  8271. END;
  8272. (* ----- SEND ------*)
  8273. |Global.Send:
  8274. Evaluate(p0,s0);
  8275. Evaluate(p1,s1);
  8276. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8277. Emit(Push(position,s0.op));
  8278. Emit(Push(position,s1.op));
  8279. (*
  8280. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8281. *)
  8282. IF ~backend.cellsAreObjects THEN
  8283. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8284. END;
  8285. ReleaseOperand(s0);
  8286. ReleaseOperand(s1);
  8287. IF backend.cellsAreObjects THEN
  8288. CallThis(position,"ActiveCellsRuntime","Send",2);
  8289. ELSE
  8290. CallThis(position,ChannelModuleName,"Send",2);
  8291. END;
  8292. (* ----- RECEIVE ------*)
  8293. |Global.Receive:
  8294. Evaluate(p0,s0);
  8295. Emit(Push(position,s0.op));
  8296. Designate(p1,s1);
  8297. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8298. Emit(Push(position,s1.op));
  8299. IF p2 # NIL THEN
  8300. Designate(p2,s2);
  8301. Emit(Push(position,s2.op));
  8302. END;
  8303. (*
  8304. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8305. *)
  8306. IF ~backend.cellsAreObjects THEN
  8307. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8308. END;
  8309. ReleaseOperand(s0);
  8310. ReleaseOperand(s1);
  8311. ReleaseOperand(s2);
  8312. IF backend.cellsAreObjects THEN
  8313. IF p2 = NIL THEN
  8314. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8315. ELSE
  8316. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8317. END;
  8318. ELSE
  8319. IF p2 = NIL THEN
  8320. CallThis(position,ChannelModuleName,"Receive",2)
  8321. ELSE
  8322. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8323. END;
  8324. END;
  8325. | Global.systemSpecial:
  8326. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8327. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8328. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8329. (* determine if parameters are of the VAR kind *)
  8330. ASSERT(x.parameters.Length() <= 3);
  8331. formalParameter := procedureType.firstParameter;
  8332. FOR i := 0 TO x.parameters.Length() - 1 DO
  8333. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8334. formalParameter := formalParameter.nextParameter
  8335. END;
  8336. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8337. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8338. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8339. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8340. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8341. IF procedureType.returnType # NIL THEN
  8342. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8343. Emit(Result(position, res));
  8344. (*InitOperand(result,ModeValue);
  8345. result.op := res;
  8346. *)
  8347. IF ~conditional THEN
  8348. InitOperand(result,ModeValue); result.op := res;
  8349. ELSE
  8350. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8351. BrL(falseLabel);
  8352. ReleaseIntermediateOperand(res);
  8353. END;
  8354. END
  8355. ELSE (* function not yet implemented *)
  8356. Error(position,"not yet implemented");
  8357. END;
  8358. destination := dest;
  8359. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8360. END VisitBuiltinCallDesignator;
  8361. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8362. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8363. BEGIN
  8364. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8365. dest := destination; destination := emptyOperand;
  8366. Expression(x.left);
  8367. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8368. ELSIF isUnchecked THEN (* no check *)
  8369. ELSE
  8370. trueL := NewLabel();
  8371. falseL := NewLabel();
  8372. IF IsPointerToRecord(x.left.type,recordType) THEN
  8373. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8374. Emit(Mov(position,tag, result.op));
  8375. IF result.mode # ModeValue THEN
  8376. ptr := tag;
  8377. IntermediateCode.MakeMemory(ptr,addressType);
  8378. Emit(Mov(position,tag, ptr));
  8379. END;
  8380. IF ~backend.cooperative THEN
  8381. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8382. END;
  8383. IntermediateCode.MakeMemory(tag,addressType);
  8384. ELSE
  8385. tag := result.tag;
  8386. UseIntermediateOperand(tag);
  8387. END;
  8388. TypeTest(tag,x.type,trueL,falseL);
  8389. ReleaseIntermediateOperand(tag);
  8390. SetLabel(falseL);
  8391. EmitTrap(position,TypeCheckTrap);
  8392. SetLabel(trueL);
  8393. END;
  8394. destination := dest;
  8395. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8396. END VisitTypeGuardDesignator;
  8397. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8398. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8399. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8400. VAR label: Label; pc: LONGINT;
  8401. BEGIN
  8402. IF backend.cooperative & ~isUnchecked THEN
  8403. pc := section.pc;
  8404. label := NewLabel();
  8405. BrneL(label, operand.op, nil);
  8406. EmitTrap(position, NilPointerTrap);
  8407. SetLabel(label);
  8408. INC(statCoopNilCheck, section.pc - pc);
  8409. END;
  8410. END NilCheck;
  8411. BEGIN
  8412. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8413. ReuseCopy(dereferenced,operand.op);
  8414. ReleaseOperand(operand);
  8415. operand.mode := ModeReference;
  8416. operand.op := dereferenced;
  8417. operand.tag := dereferenced;
  8418. UseIntermediateOperand(operand.tag);
  8419. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8420. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8421. ReleaseIntermediateOperand(operand.tag);
  8422. operand.tag := TypeDescriptorAdr(type);
  8423. IF ~newObjectFile THEN
  8424. IntermediateCode.MakeMemory(operand.tag,addressType);
  8425. END;
  8426. ELSE
  8427. IF ~backend.cooperative THEN
  8428. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8429. END;
  8430. IntermediateCode.MakeMemory(operand.tag,addressType);
  8431. END;
  8432. NilCheck(operand.op);
  8433. ELSIF type IS SyntaxTree.ArrayType THEN
  8434. IF isUnsafe THEN
  8435. NilCheck(operand.op);
  8436. ReleaseIntermediateOperand(operand.tag);
  8437. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8438. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8439. ELSE
  8440. operand.tag := emptyOperand;
  8441. END;
  8442. ELSE
  8443. NilCheck(operand.op);
  8444. IF backend.cooperative THEN
  8445. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8446. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8447. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8448. ELSE
  8449. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8450. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8451. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8452. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8453. END;
  8454. END;
  8455. ELSIF type IS SyntaxTree.MathArrayType THEN
  8456. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8457. IntermediateCode.MakeMemory(operand.op,addressType);
  8458. ELSE HALT(100);
  8459. END;
  8460. END Dereference;
  8461. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8462. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8463. BEGIN
  8464. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8465. dest := destination; destination := emptyOperand;
  8466. Evaluate(x.left,d);
  8467. type := x.type.resolved;
  8468. prevIsUnchecked := isUnchecked;
  8469. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8470. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8471. END;
  8472. Dereference(d,type,IsUnsafePointer(x.left.type));
  8473. isUnchecked := prevIsUnchecked;
  8474. result := d;
  8475. 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
  8476. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8477. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8478. END;
  8479. END;
  8480. destination := dest;
  8481. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8482. END VisitDereferenceDesignator;
  8483. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8484. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8485. BEGIN
  8486. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8487. dest := destination; destination := emptyOperand;
  8488. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8489. tag := result.op;
  8490. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8491. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8492. StaticCallOperand(result,procedure.super);
  8493. ReleaseIntermediateOperand(result.tag);
  8494. UseIntermediateOperand(tag); (* necessary ? *)
  8495. result.tag := tag;
  8496. destination := dest;
  8497. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8498. END VisitSupercallDesignator;
  8499. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8500. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8501. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8502. name: Basic.SegmentedName;
  8503. procedure: SyntaxTree.Procedure;
  8504. procedureType: SyntaxTree.ProcedureType;
  8505. BEGIN
  8506. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8507. dest := destination; destination := emptyOperand;
  8508. scope := currentScope;
  8509. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8510. scope := scope.outerScope;
  8511. END;
  8512. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8513. IF newObjectFile THEN
  8514. moduleSection := meta.ModuleSection();
  8515. IF backend.cooperative THEN
  8516. moduleOffset := 0;
  8517. ELSE
  8518. moduleOffset := moduleSection.pc;
  8519. END;
  8520. result.mode := ModeValue;
  8521. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8522. ELSE
  8523. Symbol(moduleSelf,result);
  8524. IntermediateCode.MakeMemory(result.op,addressType);
  8525. END
  8526. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8527. result.mode := ModeValue;
  8528. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8529. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8530. ELSE
  8531. GetBaseRegister(basereg,currentScope,scope);
  8532. InitOperand(result,ModeReference);
  8533. result.op := basereg;
  8534. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8535. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8536. parametersSize := ProcParametersSize(procedure);
  8537. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8538. IF backend.cooperative THEN
  8539. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8540. END;
  8541. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8542. MakeMemory(result.op, result.op, addressType, 0);
  8543. END;
  8544. (* tag must be loaded when dereferencing SELF pointer *)
  8545. END;
  8546. destination := dest;
  8547. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8548. END VisitSelfDesignator;
  8549. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8550. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8551. BEGIN
  8552. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8553. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8554. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8555. parameter := procedureType.returnParameter;
  8556. IF currentIsInline THEN
  8557. map := currentMapper.Get(NIL);
  8558. IF map # NIL THEN
  8559. Designate(map.to, result);
  8560. ELSE
  8561. HALT(200);
  8562. END;
  8563. RETURN;
  8564. END;
  8565. VisitParameter(parameter);
  8566. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8567. END VisitResultDesignator;
  8568. (** values *)
  8569. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8570. BEGIN
  8571. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8572. IF conditional THEN
  8573. IF x.value THEN BrL(trueLabel)
  8574. ELSE BrL(falseLabel)
  8575. END;
  8576. ELSE
  8577. InitOperand(result,ModeValue);
  8578. IF x.value THEN result.op := true ELSE result.op := false END;
  8579. END;
  8580. END VisitBooleanValue;
  8581. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8582. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8583. BEGIN
  8584. Global.GetModuleSegmentedName(module.module, name);
  8585. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8586. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8587. RETURN section
  8588. END GetDataSection;
  8589. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8590. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8591. BEGIN
  8592. type := vop.type;
  8593. data := GetDataSection();
  8594. pc := EnterImmediate(data,vop);
  8595. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8596. IntermediateCode.MakeMemory(vop, type);
  8597. END GetImmediateMem;
  8598. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8599. BEGIN
  8600. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8601. InitOperand(result,ModeValue);
  8602. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8603. IF ~supportedImmediate(result.op) &~inData THEN
  8604. GetImmediateMem(result.op)
  8605. END;
  8606. END VisitIntegerValue;
  8607. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8608. BEGIN
  8609. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8610. InitOperand(result,ModeValue);
  8611. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8612. END VisitCharacterValue;
  8613. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8614. BEGIN
  8615. IF Trace THEN TraceEnter("VisitSetValue") END;
  8616. InitOperand(result,ModeValue);
  8617. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  8618. END VisitSetValue;
  8619. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8620. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8621. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8622. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8623. BEGIN
  8624. numberElements := x.elements.Length();
  8625. FOR i := 0 TO numberElements-1 DO
  8626. expression := x.elements.GetExpression(i);
  8627. IF expression IS SyntaxTree.MathArrayExpression THEN
  8628. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8629. ELSE
  8630. inData := TRUE;
  8631. Evaluate(expression,op);
  8632. irv.Emit(Data(position,op.op));
  8633. inData := FALSE;
  8634. ReleaseOperand(op);
  8635. END;
  8636. END;
  8637. END RecursiveData;
  8638. BEGIN
  8639. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8640. IF ~TryConstantDeclaration() THEN
  8641. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8642. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8643. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8644. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8645. ELSE
  8646. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8647. END;
  8648. RecursiveData(x.array);
  8649. InitOperand(result,ModeReference);
  8650. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8651. END
  8652. END VisitMathArrayValue;
  8653. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8654. VAR constant: Sections.Section;
  8655. BEGIN
  8656. IF constantDeclaration = NIL THEN
  8657. RETURN FALSE
  8658. ELSE
  8659. (* Is a constant in this module: did we generate it already? *)
  8660. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8661. IF constant # NIL THEN
  8662. InitOperand(result,ModeReference);
  8663. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8664. RETURN TRUE;
  8665. END;
  8666. END;
  8667. RETURN FALSE
  8668. END TryConstantDeclaration;
  8669. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8670. BEGIN
  8671. constantDeclaration := x;
  8672. x.value.resolved.Accept(SELF);
  8673. END VisitConstant;
  8674. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8675. BEGIN
  8676. IF Trace THEN TraceEnter("VisitRealValue") END;
  8677. InitOperand(result,ModeValue);
  8678. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8679. END VisitRealValue;
  8680. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8681. VAR
  8682. componentType: SyntaxTree.Type;
  8683. BEGIN
  8684. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8685. ASSERT(x.type IS SyntaxTree.ComplexType);
  8686. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8687. InitOperand(result,ModeValue);
  8688. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8689. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8690. END VisitComplexValue;
  8691. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8692. VAR i: LONGINT; name: Basic.SegmentedName;
  8693. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8694. BEGIN
  8695. IF Trace THEN TraceEnter("VisitStringValue") END;
  8696. IF ~TryConstantDeclaration() THEN
  8697. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8698. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8699. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8700. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8701. ELSE
  8702. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8703. END;
  8704. FOR i := 0 TO x.length-1 DO
  8705. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8706. irv.Emit(Data(position,op));
  8707. END;
  8708. InitOperand(result,ModeReference);
  8709. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8710. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8711. END
  8712. END VisitStringValue;
  8713. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8714. BEGIN
  8715. IF Trace THEN TraceEnter("VisitNilValue") END;
  8716. InitOperand(result,ModeValue);
  8717. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8718. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8719. END VisitNilValue;
  8720. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8721. BEGIN
  8722. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8723. InitOperand(result,ModeValue);
  8724. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8725. END VisitEnumerationValue;
  8726. (** symbols *)
  8727. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8728. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8729. END VisitImport;
  8730. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8731. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8732. BEGIN
  8733. IF scope # baseScope THEN
  8734. (* left := [fp+8] *)
  8735. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8736. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8737. ReuseCopy(left,right);
  8738. ReleaseIntermediateOperand(right);
  8739. scope := scope.outerScope; DEC(level);
  8740. (* { left := [left+8] } *)
  8741. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8742. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8743. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8744. Emit(Mov(position,left,right));
  8745. scope := scope.outerScope; DEC(level);
  8746. END;
  8747. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8748. result := left;
  8749. ELSE
  8750. result := fp;
  8751. END;
  8752. END GetBaseRegister;
  8753. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8754. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8755. BEGIN
  8756. IF Trace THEN TraceEnter("VisitVariable"); END;
  8757. type := x.type.resolved;
  8758. IF (x.useRegister) THEN
  8759. InitOperand(result, ModeValue);
  8760. IF x.registerNumber < 0 THEN
  8761. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8762. reg := x.registerNumber;
  8763. ELSE
  8764. reg := registerUsageCount.Map(x.registerNumber);
  8765. UseRegister(reg);
  8766. END;
  8767. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8768. ELSIF x.externalName # NIL THEN
  8769. InitOperand(result,ModeReference);
  8770. Basic.ToSegmentedName(x.externalName^, name);
  8771. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8772. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8773. InitOperand(result,ModeReference);
  8774. GetBaseRegister(result.op,currentScope,x.scope);
  8775. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8776. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8777. InitOperand(result,ModeReference);
  8778. GetCodeSectionNameForSymbol(x,name);
  8779. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8780. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8781. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8782. InitOperand(result,ModeReference);
  8783. GetCodeSectionNameForSymbol(x,name);
  8784. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8785. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8786. ELSE (* field, left designator must have been emitted *)
  8787. ASSERT(result.mode = ModeReference);
  8788. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8789. ReuseCopy(temp,result.op);
  8790. ReleaseIntermediateOperand(result.op);
  8791. result.op := temp;
  8792. END;
  8793. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8794. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8795. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8796. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8797. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8798. END;
  8799. END;
  8800. END;
  8801. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8802. ValueToCondition(result);
  8803. ELSIF type IS SyntaxTree.ProcedureType THEN
  8804. ReleaseIntermediateOperand(result.tag);
  8805. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8806. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8807. UseIntermediateOperand(result.tag);
  8808. ELSE
  8809. result.tag := nil; (* nil *)
  8810. END;
  8811. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8812. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8813. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8814. ReleaseIntermediateOperand(result.tag);
  8815. Global.GetSymbolSegmentedName(x,name);
  8816. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8817. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8818. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8819. ELSE
  8820. END;
  8821. ELSE
  8822. ReleaseIntermediateOperand(result.tag);
  8823. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8824. END;
  8825. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8826. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8827. ReleaseIntermediateOperand(result.tag);
  8828. result.tag := result.op;
  8829. UseIntermediateOperand(result.tag);
  8830. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8831. IntermediateCode.MakeMemory(result.op,addressType);
  8832. END;
  8833. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8834. ReleaseIntermediateOperand(result.tag);
  8835. result.tag := TypeDescriptorAdr(type);
  8836. IF ~newObjectFile THEN
  8837. IntermediateCode.MakeMemory(result.tag,addressType);
  8838. END;
  8839. UseIntermediateOperand(result.tag);
  8840. (* tag for pointer type computed not here but during dereferencing *)
  8841. END;
  8842. IF Trace THEN TraceExit("VisitVariable") END;
  8843. END VisitVariable;
  8844. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8845. BEGIN
  8846. VisitVariable(property);
  8847. END VisitProperty;
  8848. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8849. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8850. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8851. BEGIN
  8852. type := x.type.resolved;
  8853. IF Trace THEN TraceEnter("VisitParameter") END;
  8854. IF x.ownerType IS SyntaxTree.CellType THEN
  8855. ptype := x.type.resolved;
  8856. IF backend.cellsAreObjects THEN
  8857. ASSERT(result.mode = ModeReference);
  8858. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8859. ReuseCopy(temp,result.op);
  8860. ReleaseIntermediateOperand(result.op);
  8861. result.op := temp;
  8862. END;
  8863. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8864. RETURN;
  8865. ELSE
  8866. InitOperand(result,ModeReference);
  8867. GetCodeSectionNameForSymbol(x,name);
  8868. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8869. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8870. RETURN;
  8871. END;
  8872. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8873. InitOperand(result,ModeReference);
  8874. GetCodeSectionNameForSymbol(x,name);
  8875. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8876. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8877. RETURN
  8878. ELSE
  8879. GetBaseRegister(basereg,currentScope,x.scope);
  8880. InitOperand(result,ModeReference);
  8881. result.op := basereg;
  8882. END;
  8883. IF IsOpenArray(type) THEN
  8884. result.tag := basereg;
  8885. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8886. IntermediateCode.MakeMemory(result.op,addressType);
  8887. IF Global.IsOberonProcedure(x.ownerType) THEN
  8888. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8889. UseIntermediateOperand(result.tag);
  8890. ELSE
  8891. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8892. END;
  8893. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8894. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8895. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8896. ELSIF IsStaticArray(type) THEN
  8897. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8898. IntermediateCode.MakeMemory(result.op,addressType);
  8899. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8900. ELSIF type IS SyntaxTree.MathArrayType THEN
  8901. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8902. WITH type: SyntaxTree.MathArrayType DO
  8903. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8904. IF type.form = SyntaxTree.Tensor THEN
  8905. ELSIF type.form = SyntaxTree.Open THEN
  8906. result.tag := result.op;
  8907. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8908. IntermediateCode.MakeMemory(result.op,addressType);
  8909. UseIntermediateOperand(result.tag);
  8910. ELSIF type.form = SyntaxTree.Static THEN
  8911. IF x.kind = SyntaxTree.ConstParameter THEN
  8912. IntermediateCode.MakeMemory(result.op,addressType);
  8913. END;
  8914. ELSE HALT(100)
  8915. END;
  8916. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8917. IF type.form = SyntaxTree.Tensor THEN
  8918. ToMemory(result.op,addressType,0);
  8919. ELSIF type.form = SyntaxTree.Open THEN
  8920. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8921. ReuseCopy(result.tag, mem);
  8922. ReleaseIntermediateOperand(mem);
  8923. ReleaseIntermediateOperand(result.op);
  8924. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8925. ELSIF type.form = SyntaxTree.Static THEN
  8926. IntermediateCode.MakeMemory(result.op,addressType);
  8927. ELSE HALT(100)
  8928. END;
  8929. ELSE HALT(100)
  8930. END;
  8931. END;
  8932. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8933. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8934. IntermediateCode.MakeMemory(result.op,addressType);
  8935. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8936. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8937. END;
  8938. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8939. ValueToCondition(result);
  8940. ELSIF type IS SyntaxTree.ProcedureType THEN
  8941. ReleaseIntermediateOperand(result.tag);
  8942. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8943. IF x.kind = SyntaxTree.VarParameter THEN
  8944. ReuseCopy(result.tag,result.op);
  8945. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8946. IntermediateCode.MakeMemory(result.tag,addressType);
  8947. ELSE
  8948. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8949. UseIntermediateOperand(result.tag);
  8950. END;
  8951. ELSE
  8952. result.tag := nil;
  8953. END;
  8954. (* tag for pointer type computed not here but during dereferencing *)
  8955. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  8956. ReleaseIntermediateOperand(result.tag);
  8957. result.tag := basereg;
  8958. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8959. IntermediateCode.MakeMemory(result.tag,addressType);
  8960. UseIntermediateOperand(result.tag);
  8961. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  8962. ReleaseIntermediateOperand(result.tag);
  8963. result.tag := TypeDescriptorAdr(type);
  8964. IF ~newObjectFile THEN
  8965. IntermediateCode.MakeMemory(result.tag,addressType);
  8966. END;
  8967. UseIntermediateOperand(result.tag);
  8968. END;
  8969. IF Trace THEN TraceExit("VisitParameter") END;
  8970. END VisitParameter;
  8971. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8972. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8973. BEGIN
  8974. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8975. (* left.p: left already emitted *)
  8976. tag := result.op; (* value of pointer to left *)
  8977. (* get type desc *)
  8978. tmp := result.tag;
  8979. IntermediateCode.MakeMemory(tmp,addressType);
  8980. (* get method adr *)
  8981. Reuse1(reg,tmp);
  8982. ReleaseIntermediateOperand(tmp);
  8983. IF backend.cooperative THEN
  8984. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8985. WHILE recordType.baseType # NIL DO
  8986. recordType := recordType.GetBaseRecord ();
  8987. END;
  8988. GetRecordTypeName (recordType,name);
  8989. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8990. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8991. offset := 0;
  8992. ELSE
  8993. offset := 2;
  8994. END;
  8995. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8996. ELSE
  8997. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8998. END;
  8999. InitOperand(operand,ModeReference);
  9000. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9001. operand.op := reg;
  9002. operand.tag := tag;
  9003. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9004. END DynamicCallOperand;
  9005. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9006. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9007. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9008. BEGIN
  9009. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9010. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9011. tag := operand.op;
  9012. ReleaseIntermediateOperand(operand.tag);
  9013. ELSE tag := nil
  9014. END;
  9015. IF x.isInline THEN
  9016. sectionType := Sections.InlineCodeSection;
  9017. ELSE
  9018. sectionType := Sections.CodeSection;
  9019. END;
  9020. IF x.externalName # NIL THEN
  9021. Basic.ToSegmentedName(x.externalName^, name);
  9022. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9023. ELSE
  9024. GetCodeSectionNameForSymbol(x, name);
  9025. IF (x.scope.ownerModule = module.module) THEN
  9026. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9027. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9028. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9029. IF source.pc = 0 THEN (* no code yet *)
  9030. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9031. END;
  9032. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9033. bits := x.procedureScope.body.code.inlineCode;
  9034. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9035. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9036. binary.CopyBits(bits, 0, bits.GetSize());
  9037. source.SetResolved(binary);
  9038. ELSE
  9039. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9040. END;
  9041. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9042. END;
  9043. InitOperand(operand,ModeValue);
  9044. operand.op := reg;
  9045. operand.tag := tag;
  9046. IF Trace THEN TraceExit("StaticCallOperand") END;
  9047. END StaticCallOperand;
  9048. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9049. (* handle expressions of the form designator.procedure or procedure *)
  9050. BEGIN
  9051. IF Trace THEN TraceEnter("VisitProcedure") END;
  9052. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9053. DynamicCallOperand(result,x);
  9054. ELSIF x.isInline THEN
  9055. StaticCallOperand(result,x);
  9056. ELSE
  9057. StaticCallOperand(result,x);
  9058. END;
  9059. IF Trace THEN TraceExit("VisitProcedure") END;
  9060. END VisitProcedure;
  9061. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9062. BEGIN
  9063. VisitProcedure(x);
  9064. END VisitOperator;
  9065. (** statements *)
  9066. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9067. BEGIN
  9068. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9069. Expression(x.call);
  9070. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9071. ReleaseOperand(result)
  9072. END;
  9073. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9074. END VisitProcedureCallStatement;
  9075. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9076. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9077. leftBase, rightBase: SyntaxTree.Type;
  9078. procedureName,s: SyntaxTree.IdentifierString;
  9079. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9080. size: LONGINT; rightKind: LONGINT;
  9081. dummy: IntermediateCode.Operand;
  9082. CONST moduleName = "FoxArrayBase";
  9083. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9084. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9085. BEGIN
  9086. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9087. IF base IS SyntaxTree.MathArrayType THEN
  9088. base := OpenArray(base(SyntaxTree.MathArrayType));
  9089. END;
  9090. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9091. result.SetArrayBase(base);
  9092. RETURN result
  9093. END OpenArray;
  9094. BEGIN
  9095. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9096. SaveRegisters();ReleaseUsedRegisters(saved);
  9097. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9098. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9099. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9100. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9101. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9102. IF leftType.form = SyntaxTree.Tensor THEN
  9103. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9104. ELSIF leftType.form = SyntaxTree.Open THEN
  9105. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9106. ELSIF leftType.form = SyntaxTree.Static THEN
  9107. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9108. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9109. END;
  9110. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9111. IF procedure = NIL THEN
  9112. s := "Instruction not supported on target, emulation procedure ";
  9113. Strings.Append(s,moduleName);
  9114. Strings.Append(s,".");
  9115. Strings.Append(s,procedureName);
  9116. Strings.Append(s," not present");
  9117. Error(position,s);
  9118. ELSE
  9119. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9120. parameter.SetType(leftType);
  9121. parameter.SetAccess(SyntaxTree.Internal);
  9122. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9123. parameter.SetKind(rightKind);
  9124. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9125. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9126. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9127. StaticCallOperand(result,procedure);
  9128. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  9129. ReleaseOperand(result);
  9130. END;
  9131. RestoreRegisters(saved);
  9132. END;
  9133. END AssignMathArray;
  9134. VAR modifyAssignmentCounter := 0: LONGINT;
  9135. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9136. VAR processor,mem,dst: IntermediateCode.Operand;
  9137. BEGIN
  9138. IF value.intValue = true.intValue THEN
  9139. INC(modifyAssignmentCounter);
  9140. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9141. modifyAssignmentsPC := section.pc;
  9142. ELSE
  9143. DEC(modifyAssignmentCounter);
  9144. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9145. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9146. END;
  9147. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9148. dst := NewRegisterOperand (addressType);
  9149. Emit(Mov(position,dst, processor));
  9150. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9151. Emit(Mov(position,mem, value));
  9152. ReleaseIntermediateOperand(dst);
  9153. END ModifyAssignments;
  9154. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9155. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9156. BEGIN
  9157. type := left.type.resolved;
  9158. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9159. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9160. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9161. IF procedureType.returnParameter = parameter THEN
  9162. (* this is the only case where the destination can be dynamically smaller than the source
  9163. in all other cases the dynamic size has to be taken
  9164. *)
  9165. IF backend.cooperative THEN
  9166. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9167. ELSE
  9168. MakeMemory(mem, tag, addressType, 0);
  9169. END;
  9170. RETURN mem;
  9171. END;
  9172. END;
  9173. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9174. END CopySize;
  9175. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9176. VAR
  9177. leftO, rightO: Operand;
  9178. arg,mem, sizeOp: IntermediateCode.Operand;
  9179. leftType, rightType, componentType, base: SyntaxTree.Type;
  9180. size: LONGINT;
  9181. parameters: SyntaxTree.ExpressionList;
  9182. procedure: SyntaxTree.Procedure;
  9183. call: SyntaxTree.ProcedureCallDesignator;
  9184. designator: SyntaxTree.Designator;
  9185. saved: RegisterEntry;
  9186. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9187. VAR procedureType: SyntaxTree.ProcedureType;
  9188. BEGIN
  9189. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9190. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9191. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9192. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9193. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9194. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9195. IF right.id = Global.Reshape THEN RETURN TRUE
  9196. END;
  9197. END;
  9198. END;
  9199. END;
  9200. RETURN FALSE
  9201. END CanPassAsResultParameter;
  9202. BEGIN
  9203. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9204. leftType := left.type.resolved; rightType:= right.type.resolved;
  9205. IF backend.cooperative & left.NeedsTrace() THEN
  9206. ModifyAssignments(true);
  9207. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9208. Designate(right, rightO);
  9209. Designate(left, leftO);
  9210. ASSERT(leftO.mode = ModeReference);
  9211. TransferToRegister(leftO.op, leftO.op);
  9212. TransferToRegister(rightO.op, rightO.op);
  9213. Emit(Push(position, leftO.op));
  9214. Emit(Push(position, rightO.op));
  9215. CallAssignMethod(leftO.op, rightO.op, left.type);
  9216. Emit(Pop(position, rightO.op));
  9217. Emit(Pop(position, leftO.op));
  9218. sizeOp := CopySize(left, leftO.tag);
  9219. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9220. ReleaseIntermediateOperand(sizeOp);
  9221. ReleaseOperand(leftO);
  9222. ReleaseOperand(rightO);
  9223. ELSE
  9224. Evaluate(right,rightO);
  9225. Designate(left,leftO);
  9226. ASSERT(leftO.mode = ModeReference);
  9227. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9228. (* copy procedure address first *)
  9229. MakeMemory(mem,leftO.op,addressType,0);
  9230. Emit(Mov(position,mem,rightO.op));
  9231. ReleaseIntermediateOperand(mem);
  9232. (* copy pointer address *)
  9233. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9234. CallAssignPointer(leftO.tag, rightO.tag);
  9235. ELSE
  9236. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9237. CallAssignPointer(leftO.op, rightO.op);
  9238. END;
  9239. ReleaseOperand(leftO);
  9240. ReleaseOperand(rightO);
  9241. END;
  9242. ModifyAssignments(false);
  9243. RETURN;
  9244. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9245. SaveRegisters();ReleaseUsedRegisters(saved);
  9246. IF SemanticChecker.IsPointerType(leftType) THEN
  9247. Evaluate(right,rightO);
  9248. Designate(left,leftO);
  9249. Emit(Push(position,leftO.op));
  9250. ReleaseOperand(leftO);
  9251. Emit(Push(position,rightO.op));
  9252. ReleaseOperand(rightO);
  9253. CallThis(position,"Heaps","Assign",2);
  9254. ELSIF leftType.IsRecordType() THEN
  9255. Designate(right,rightO);
  9256. Designate(left,leftO);
  9257. Emit(Push(position,leftO.op));
  9258. Emit(Push(position,leftO.tag)); (* type desc *)
  9259. ReleaseOperand(leftO);
  9260. Emit(Push(position,rightO.op));
  9261. ReleaseOperand(rightO);
  9262. CallThis(position,"Heaps","AssignRecord",3);
  9263. ELSIF IsStaticArray(leftType) THEN
  9264. size := StaticArrayNumElements(leftType);
  9265. base := StaticArrayBaseType(leftType);
  9266. Designate(right,rightO);
  9267. Designate(left,leftO);
  9268. Emit(Push(position,leftO.op));
  9269. ReleaseOperand(leftO);
  9270. arg := TypeDescriptorAdr(base);
  9271. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9272. Emit(Push(position,arg));
  9273. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9274. Emit(Push(position,rightO.op));
  9275. ReleaseOperand(rightO);
  9276. CallThis(position,"Heaps","AssignArray",4);
  9277. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9278. size := StaticMathArrayNumElements(leftType);
  9279. base := StaticMathArrayBaseType(leftType);
  9280. Designate(right,rightO);
  9281. Designate(left,leftO);
  9282. Emit(Push(position,leftO.op));
  9283. ReleaseOperand(leftO);
  9284. arg := TypeDescriptorAdr(base);
  9285. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9286. Emit(Push(position,arg));
  9287. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9288. Emit(Push(position,rightO.op));
  9289. ReleaseOperand(rightO);
  9290. CallThis(position,"Heaps","AssignArray",4);
  9291. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9292. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9293. Evaluate(right,rightO);
  9294. Designate(left,leftO);
  9295. MakeMemory(mem,leftO.op,addressType,0);
  9296. Emit(Mov(position,mem,rightO.op));
  9297. ReleaseIntermediateOperand(mem);
  9298. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9299. Emit (Push(position, leftO.tag));
  9300. ReleaseOperand(leftO);
  9301. Emit (Push(position, rightO.tag));
  9302. ReleaseOperand(rightO);
  9303. CallThis(position,"Heaps","Assign", 2);
  9304. ELSE HALT(100); (* missing ? *)
  9305. END;
  9306. RestoreRegisters(saved);
  9307. RETURN;
  9308. END;
  9309. IF CanPassAsResultParameter(right) THEN
  9310. procedureResultDesignator := left(SyntaxTree.Designator);
  9311. Expression(right);
  9312. procedureResultDesignator := NIL;
  9313. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9314. (* left <-- ALIAS OF right: zerocopy *)
  9315. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9316. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9317. designator.SetType(procedure.type);
  9318. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9319. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9320. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9321. END;
  9322. ELSIF leftType IS SyntaxTree.RangeType THEN
  9323. (* LHS is of array range type *)
  9324. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9325. Evaluate(right, rightO);
  9326. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9327. (* first *)
  9328. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9329. Emit(Mov(position,mem, rightO.op));
  9330. ReleaseIntermediateOperand(mem);
  9331. (* last *)
  9332. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9333. Emit(Mov(position,mem, rightO.tag));
  9334. ReleaseIntermediateOperand(mem);
  9335. (* step *)
  9336. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9337. Emit(Mov(position,mem, rightO.extra));
  9338. ReleaseIntermediateOperand(mem);
  9339. ReleaseOperand(rightO);
  9340. ReleaseOperand(leftO)
  9341. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9342. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9343. Evaluate(right, rightO);
  9344. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9345. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9346. (* real part *)
  9347. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9348. Emit(Mov(position,mem, rightO.op));
  9349. ReleaseIntermediateOperand(mem);
  9350. (* imaginary part *)
  9351. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9352. Emit(Mov(position,mem, rightO.tag));
  9353. ReleaseIntermediateOperand(mem);
  9354. ReleaseOperand(rightO);
  9355. ReleaseOperand(leftO)
  9356. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9357. OR (leftType IS SyntaxTree.PortType) THEN
  9358. (* rightO := leftO;*)
  9359. Evaluate(right,rightO);
  9360. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9361. Designate(left,leftO);
  9362. IF leftO.mode = ModeReference THEN
  9363. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9364. destination := mem;
  9365. ELSE
  9366. destination := leftO.op;
  9367. END;
  9368. ReleaseOperand(leftO);
  9369. IF destination.mode # IntermediateCode.Undefined THEN
  9370. Emit(Mov(position,destination,rightO.op));
  9371. END;
  9372. ReleaseOperand(rightO);
  9373. ReleaseIntermediateOperand(mem);
  9374. IntermediateCode.InitOperand(destination);
  9375. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9376. Evaluate(right,rightO);
  9377. Designate(left,leftO);
  9378. MakeMemory(mem,leftO.op,addressType,0);
  9379. Emit(Mov(position,mem,rightO.op));
  9380. ReleaseIntermediateOperand(mem);
  9381. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9382. (* delegate *)
  9383. (*
  9384. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9385. *)
  9386. Emit(Mov(position,leftO.tag,rightO.tag));
  9387. END;
  9388. ReleaseOperand(leftO);
  9389. ReleaseOperand(rightO);
  9390. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9391. Designate(right,rightO);
  9392. Designate(left,leftO);
  9393. sizeOp := CopySize(left, leftO.tag);
  9394. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9395. ReleaseIntermediateOperand(sizeOp);
  9396. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9397. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9398. IF (rightType IS SyntaxTree.StringType) THEN
  9399. CopyString(left,right);
  9400. 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
  9401. Designate(right,rightO);
  9402. Designate(left,leftO);
  9403. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9404. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9405. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9406. ELSE
  9407. HALT(201)
  9408. END;
  9409. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9410. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9411. Designate(right,rightO);
  9412. Designate(left,leftO);
  9413. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9414. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9415. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9416. ELSE
  9417. AssignMathArray(left,right);
  9418. END;
  9419. ELSE
  9420. HALT(200);
  9421. END;
  9422. END Assign;
  9423. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9424. BEGIN
  9425. IF Trace THEN TraceEnter("VisitAssignment") END;
  9426. Assign(x.left,x.right);
  9427. IF Trace THEN TraceExit("VisitAssignment") END;
  9428. END VisitAssignment;
  9429. PROCEDURE EmitCooperativeSwitch;
  9430. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9431. BEGIN
  9432. ASSERT (cooperativeSwitches);
  9433. pc := section.pc;
  9434. IF lastSwitchPC = section.pc THEN RETURN END;
  9435. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9436. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9437. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9438. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9439. INC(statCoopSwitch, section.pc - pc);
  9440. END EmitCooperativeSwitch;
  9441. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9442. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9443. BEGIN
  9444. p0 := communication.left; p1 := communication.right;
  9445. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9446. Evaluate(p0,s0);
  9447. Evaluate(p1,s1);
  9448. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9449. Emit(Push(position,s0.op));
  9450. Emit(Push(position,s1.op));
  9451. (*
  9452. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9453. *)
  9454. IF ~backend.cellsAreObjects THEN
  9455. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9456. END;
  9457. ReleaseOperand(s0);
  9458. ReleaseOperand(s1);
  9459. IF backend.cellsAreObjects THEN
  9460. CallThis(position,"ActiveCellsRuntime","Send",2);
  9461. ELSE
  9462. CallThis(position,ChannelModuleName,"Send",2);
  9463. END;
  9464. (* ----- RECEIVE ------*)
  9465. ELSE
  9466. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9467. tmp := p0; p0 := p1; p1 := tmp;
  9468. END;
  9469. Evaluate(p0,s0);
  9470. Emit(Push(position,s0.op));
  9471. Designate(p1,s1);
  9472. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9473. Emit(Push(position,s1.op));
  9474. (*
  9475. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9476. *)
  9477. IF ~backend.cellsAreObjects THEN
  9478. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9479. END;
  9480. ReleaseOperand(s0);
  9481. ReleaseOperand(s1);
  9482. IF backend.cellsAreObjects THEN
  9483. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9484. ELSE
  9485. CallThis(position,ChannelModuleName,"Receive",2)
  9486. END;
  9487. END;
  9488. END VisitCommunicationStatement;
  9489. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9490. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9491. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9492. VAR true, false: Label; condition, value: BOOLEAN;
  9493. BEGIN
  9494. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9495. IF condition THEN
  9496. true := NewLabel();
  9497. false := NewLabel();
  9498. Condition(if.condition,true,false);
  9499. SetLabel(true);
  9500. StatementSequence(if.statements);
  9501. BrL(end);
  9502. SetLabel(false);
  9503. ELSE
  9504. IF value THEN (* always true *)
  9505. escape := TRUE;
  9506. StatementSequence(if.statements);
  9507. (* no branch necessary -- rest skipped *)
  9508. END;
  9509. END;
  9510. END IfPart;
  9511. BEGIN
  9512. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9513. end := NewLabel();
  9514. elsifs := x.ElsifParts();
  9515. IfPart(x.ifPart);
  9516. FOR i := 0 TO elsifs-1 DO
  9517. IF ~escape THEN
  9518. elsif := x.GetElsifPart(i);
  9519. IfPart(elsif);
  9520. END;
  9521. END;
  9522. IF (x.elsePart # NIL) & ~escape THEN
  9523. StatementSequence(x.elsePart);
  9524. END;
  9525. SetLabel(end);
  9526. IF Trace THEN TraceExit("VisitIfStatement") END;
  9527. END VisitIfStatement;
  9528. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9529. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9530. BEGIN
  9531. (*IF x.variable.type.resolved = x.type.resolved THEN
  9532. (* always true, do nothing *)
  9533. ELSE*)
  9534. Designate(x.variable,res);
  9535. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9536. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9537. END;
  9538. trueL := NewLabel();
  9539. TypeTest(res.tag,x.type,trueL,falseL);
  9540. ReleaseOperand(res);
  9541. SetLabel(trueL);
  9542. StatementSequence(x.statements);
  9543. BrL(endL);
  9544. END WithPart;
  9545. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9546. VAR endL,falseL: Label;i: LONGINT;
  9547. BEGIN
  9548. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9549. endL := NewLabel();
  9550. FOR i := 0 TO x.WithParts()-1 DO
  9551. falseL := NewLabel();
  9552. WithPart(x.GetWithPart(i),falseL,endL);
  9553. SetLabel(falseL);
  9554. END;
  9555. IF x.elsePart = NIL THEN
  9556. IF ~isUnchecked THEN
  9557. EmitTrap(position,WithTrap);
  9558. END;
  9559. ELSE
  9560. StatementSequence(x.elsePart)
  9561. END;
  9562. SetLabel(endL);
  9563. IF Trace THEN TraceExit("VisitWithStatement") END;
  9564. END VisitWithStatement;
  9565. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9566. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9567. out,else: Label; label: Label;
  9568. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9569. symbol: SyntaxTree.Symbol;
  9570. BEGIN
  9571. (*! split case statement into if-elsif statements for large case label lists *)
  9572. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9573. range := x.max-x.min+1;
  9574. IF (range<0) OR (range > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9575. END;
  9576. size := LONGINT(range);
  9577. Evaluate(x.variable,var);
  9578. ReuseCopy(tmp,var.op);
  9579. ReleaseIntermediateOperand(var.op);
  9580. var.op := tmp;
  9581. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9582. Convert(var.op,addressType);
  9583. else := NewLabel();
  9584. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9585. (*
  9586. UniqueId(name,module.module,"case",caseId);
  9587. *)
  9588. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9589. Global.GetModuleSegmentedName(module.module, name);
  9590. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9591. symbol := SyntaxTree.NewSymbol(name[1]);
  9592. symbol.SetScope(moduleScope);
  9593. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9594. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  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).value 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. callingConvention, 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. callingConvention := procedureType.callingConvention;
  9875. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  9876. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9877. ELSE
  9878. parametersSize := 0;
  9879. END;
  9880. EmitLeave(section, position,procedure, callingConvention);
  9881. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,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,ProcParametersSize(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 := ProcParametersSize(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. callingConvention, 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. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10162. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10163. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10164. ELSE
  10165. parametersSize := 0;
  10166. END;
  10167. EmitLeave(section, position,procedure, callingConvention);
  10168. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10169. END;
  10170. IF Trace THEN TraceExit("VisitCode") END;
  10171. END VisitCode;
  10172. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  10173. BEGIN
  10174. RETURN ProcedureParametersSize(system, procedure);
  10175. END ProcParametersSize;
  10176. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10177. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10178. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10179. const, call: IntermediateCode.Operand;
  10180. parameterDesignator: SyntaxTree.Expression;
  10181. saved: RegisterEntry;
  10182. name: Basic.SegmentedName;
  10183. BEGIN
  10184. IF Trace THEN TraceEnter("ParameterCopies") END;
  10185. parameter := x.firstParameter;
  10186. WHILE parameter # NIL DO
  10187. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10188. type := parameter.type.resolved;
  10189. IF IsOpenArray(type) THEN
  10190. VisitParameter(parameter);
  10191. op := result;
  10192. IF backend.cooperative & parameter.NeedsTrace() THEN
  10193. length := GetArrayLength(type, op.tag);
  10194. size := NewRegisterOperand(addressType);
  10195. base := ArrayBaseType(type);
  10196. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10197. Emit(Mul(position, size, length, const));
  10198. dst := NewRegisterOperand (addressType);
  10199. Emit(Mov(position, dst, size));
  10200. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10201. Emit(Sub(position,dst,sp,dst));
  10202. Emit(And(position,dst,dst,const));
  10203. Emit(Mov(position,sp,dst));
  10204. par := fp;
  10205. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10206. IntermediateCode.InitImmediate(null, byteType, 0);
  10207. Emit(Fill(position, dst, size, null));
  10208. ReleaseIntermediateOperand(dst);
  10209. ReleaseIntermediateOperand(length);
  10210. SaveRegisters();ReleaseUsedRegisters(saved);
  10211. (* register dst has been freed before SaveRegisters already *)
  10212. base := ArrayBaseType(type);
  10213. (* assign method of open array *)
  10214. IF base.IsRecordType() THEN
  10215. Emit (Push(position, length));
  10216. Emit (Push(position, dst));
  10217. Emit (Push(position, op.op));
  10218. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10219. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10220. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10221. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10222. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10223. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10224. Emit (Push(position,length));
  10225. Emit (Push(position, dst));
  10226. Emit (Push(position, length));
  10227. Emit (Push(position, op.op));
  10228. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10229. ELSE
  10230. Emit (Push(position, length));
  10231. Emit (Push(position, dst));
  10232. Emit (Push(position, length));
  10233. Emit (Push(position, op.op));
  10234. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10235. ASSERT(ArrayBaseType(type).IsPointer());
  10236. END;
  10237. RestoreRegisters(saved);
  10238. ELSE
  10239. temp := GetDynamicSize(type,op.tag);
  10240. ReuseCopy(size,temp);
  10241. ReleaseIntermediateOperand(temp);
  10242. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10243. Emit(Sub(position,size,sp,size));
  10244. Emit(And(position,size,size,const));
  10245. Emit(Mov(position,sp,size));
  10246. par := fp;
  10247. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10248. ReleaseIntermediateOperand(size);
  10249. size := GetDynamicSize(type,op.tag);
  10250. END;
  10251. Emit(Copy(position,sp,op.op,size));
  10252. ReleaseIntermediateOperand(size);
  10253. ReleaseOperand(op);
  10254. IntermediateCode.MakeMemory(par,addressType);
  10255. Emit(Mov(position,par,sp));
  10256. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10257. checker.SetCurrentScope(currentScope);
  10258. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10259. Assign(parameterDesignator,parameterDesignator);
  10260. END;
  10261. END;
  10262. parameter := parameter.nextParameter;
  10263. END;
  10264. IF Trace THEN TraceExit("ParameterCopies") END;
  10265. END ParameterCopies;
  10266. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10267. VAR x: SyntaxTree.Variable;
  10268. BEGIN
  10269. x := scope.firstVariable;
  10270. WHILE x # NIL DO
  10271. InitVariable(x,FALSE);
  10272. x := x.nextVariable;
  10273. END;
  10274. END InitVariables;
  10275. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10276. BEGIN
  10277. IF (symbol # NIL) THEN
  10278. RETURN fingerPrinter.SymbolFP(symbol).public
  10279. ELSE
  10280. RETURN 0
  10281. END;
  10282. END GetFingerprint;
  10283. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10284. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10285. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10286. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10287. name: Basic.SegmentedName;
  10288. offset: LONGINT;
  10289. BEGIN
  10290. IF Trace THEN TraceEnter("Body") END;
  10291. ReleaseUsedRegisters(saved); (* just in case ... *)
  10292. section := ir;
  10293. exitLabel := NewLabel ();
  10294. IF moduleBody THEN moduleBodySection := section END;
  10295. IF ir.comments # NIL THEN
  10296. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10297. commentPrintout.SingleStatement(TRUE);
  10298. dump := ir.comments;
  10299. ELSE
  10300. commentPrintout := NIL;
  10301. dump := NIL;
  10302. END;
  10303. prevScope := currentScope;
  10304. currentScope := scope;
  10305. lastSwitchPC := 0;
  10306. cooperativeSwitches := backend.cooperative;
  10307. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10308. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10309. IF x # NIL THEN
  10310. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10311. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10312. IF moduleBody THEN
  10313. ProfilerInit();
  10314. ELSE
  10315. Basic.SegmentedNameToString(ir.name, string);
  10316. ProfilerAddProcedure(numberProcedures,string);
  10317. ProfilerEnterExit(numberProcedures,TRUE);
  10318. END;
  10319. END;
  10320. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10321. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10322. END;
  10323. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10324. IF moduleBody & ~newObjectFile THEN
  10325. InitVariables(moduleScope)
  10326. END;
  10327. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10328. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10329. IF procedure = cellScope.bodyProcedure THEN
  10330. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10331. StaticCallOperand(op, cellScope.constructor);
  10332. Emit(Call(position,op.op,0));
  10333. END;
  10334. END;
  10335. END;
  10336. InitVariables(scope);
  10337. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10338. GetCodeSectionNameForSymbol(procedure, name);
  10339. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10340. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10341. IF ProtectModulesPointers THEN
  10342. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10343. ELSE
  10344. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10345. END;
  10346. IntermediateCode.SetOffset(right,offset); (* tag *)
  10347. IntermediateCode.InitMemory(left,addressType,fp,0);
  10348. Emit(Mov(position, left, right));
  10349. END;
  10350. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10351. ParameterCopies(procedureType);
  10352. IF x.code = NIL THEN
  10353. VisitStatementBlock(x);
  10354. ELSE
  10355. VisitCode(x.code)
  10356. END;
  10357. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10358. IF ~backend.cooperative THEN
  10359. ProfilerEnterExit(numberProcedures,FALSE);
  10360. END;
  10361. INC(numberProcedures);
  10362. END;
  10363. END;
  10364. IF backend.cooperative THEN
  10365. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10366. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10367. END;
  10368. IF x # NIL THEN
  10369. SELF.position := x.position;
  10370. END;
  10371. CheckRegistersFree();
  10372. ASSERT(modifyAssignmentCounter = 0);
  10373. currentScope := prevScope;
  10374. IF Trace THEN TraceExit("Body") END;
  10375. END Body;
  10376. END ImplementationVisitor;
  10377. MetaDataGenerator=OBJECT
  10378. VAR
  10379. implementationVisitor: ImplementationVisitor;
  10380. declarationVisitor: DeclarationVisitor;
  10381. module: Sections.Module;
  10382. moduleName: ARRAY 128 OF CHAR;
  10383. moduleNamePool: Basic.HashTableInt;
  10384. moduleNamePoolSection: IntermediateCode.Section;
  10385. modulePointerSection: IntermediateCode.Section;
  10386. modulePointerSizePC: LONGINT;
  10387. modulePointerSectionOffset: LONGINT;
  10388. modulePointers: LONGINT;
  10389. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  10390. RecordBaseOffset: LONGINT;
  10391. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10392. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10393. TypeTags: LONGINT; (* type extension level support *)
  10394. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10395. patchInfoPC: LONGINT;
  10396. patchCRC: LONGINT;
  10397. CONST
  10398. EmptyBlockOffset = 2;
  10399. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10400. BEGIN
  10401. IF implementationVisitor.backend.cooperative THEN
  10402. TypeTags := MAX(LONGINT);
  10403. BaseTypesTableOffset := 0;
  10404. MethodTableOffset := 2;
  10405. TypeRecordBaseOffset := 0;
  10406. RecordBaseOffset := 0;
  10407. ELSIF simple THEN
  10408. TypeTags := 3; (* only 3 extensions allowed *)
  10409. BaseTypesTableOffset := 1;
  10410. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10411. TypeRecordBaseOffset := 0;
  10412. RecordBaseOffset := 1;
  10413. ELSE
  10414. TypeTags := 16;
  10415. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10416. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10417. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10418. (* change this when Heaps.HeapBlock is modified *)
  10419. RecordBaseOffset := 8;
  10420. END;
  10421. SELF.simple := simple;
  10422. SELF.implementationVisitor := implementationVisitor;
  10423. SELF.declarationVisitor := declarationVisitor;
  10424. implementationVisitor.meta := SELF;
  10425. declarationVisitor.meta := SELF;
  10426. END InitMetaDataGenerator;
  10427. PROCEDURE SetModule(module: Sections.Module);
  10428. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10429. BEGIN
  10430. SELF.module := module;
  10431. Global.GetModuleName(module.module,moduleName);
  10432. Global.GetSymbolSegmentedName(module.module, name);
  10433. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple & ~implementationVisitor.backend.cooperative THEN
  10434. NEW(moduleNamePool, 32);
  10435. (*! require GC protection *)
  10436. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10437. IF ProtectModulesPointers THEN
  10438. name := "Heaps.AnyPtr";
  10439. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10440. (* set base pointer *)
  10441. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10442. END;
  10443. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10444. modulePointers := 0;
  10445. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10446. AddPointer(moduleNamePoolSection, namePoolOffset);
  10447. END;
  10448. END SetModule;
  10449. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10450. BEGIN
  10451. IF ~implementationVisitor.backend.cooperative THEN
  10452. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10453. INC(modulePointers);
  10454. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10455. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10456. END;
  10457. END AddPointer;
  10458. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10459. BEGIN
  10460. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10461. END GetTypeRecordBaseOffset;
  10462. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10463. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10464. BEGIN
  10465. (* change this when Heaps.HeapBlock is modified *)
  10466. INC(dataAdrOffset,6);
  10467. Info(section,"headerAdr");
  10468. Address(section,0);
  10469. Info(section,"typeDesc");
  10470. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10471. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10472. NamedSymbol(section, name, symbol, 0, offset);
  10473. Info(section,"mark: LONGINT;");
  10474. Longint(section,-1);
  10475. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10476. Info(section,"dataAdr-: ADDRESS");
  10477. Symbol(section,section, dataAdrOffset,0);
  10478. Info(section,"size-: SIZE");
  10479. Address(section,0);
  10480. Info(section,"nextMark: HeapBlock;");
  10481. Address(section,0);
  10482. END HeapBlock;
  10483. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10484. VAR i: LONGINT;
  10485. BEGIN
  10486. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10487. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10488. Info(section,"count*: LONGINT");
  10489. Longint(section,0);
  10490. Info(section,"locked*: BOOLEAN");
  10491. Longint(section,0);
  10492. Info(section,"awaitingLock*: ProcessQueue");
  10493. Address(section,0);
  10494. Address(section,0);
  10495. Info(section,"awaitingCond*: ProcessQueue");
  10496. Address(section,0);
  10497. Address(section,0);
  10498. Info(section,"lockedBy*: ANY");
  10499. Address(section,0);
  10500. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10501. Longint(section,1);
  10502. FOR i := 2 TO 6 DO
  10503. Longint(section,0);
  10504. END;
  10505. Info(section,"lock*: ANY");
  10506. Address(section,0);
  10507. END ProtectedHeapBlock;
  10508. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10509. BEGIN
  10510. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10511. END Info;
  10512. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10513. VAR op: IntermediateCode.Operand;
  10514. BEGIN
  10515. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10516. section.Emit(Data(Basic.invalidPosition,op));
  10517. END Address;
  10518. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10519. VAR op: IntermediateCode.Operand;
  10520. BEGIN
  10521. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10522. section.Emit(Data(Basic.invalidPosition,op));
  10523. END Size;
  10524. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  10525. VAR op: IntermediateCode.Operand;
  10526. BEGIN
  10527. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  10528. section.Emit(Data(Basic.invalidPosition,op));
  10529. END Set;
  10530. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10531. VAR op: IntermediateCode.Operand;
  10532. BEGIN
  10533. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10534. section.Emit(Data(Basic.invalidPosition,op));
  10535. END Longint;
  10536. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10537. VAR op,noOperand: IntermediateCode.Operand;
  10538. BEGIN
  10539. IntermediateCode.InitOperand(noOperand);
  10540. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10541. section.PatchOperands(pc,op,noOperand,noOperand);
  10542. END PatchAddress;
  10543. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10544. VAR op,noOperand: IntermediateCode.Operand;
  10545. BEGIN
  10546. IntermediateCode.InitOperand(noOperand);
  10547. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10548. section.PatchOperands(pc,op,noOperand,noOperand);
  10549. END PatchSize;
  10550. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10551. VAR op,noOperand: IntermediateCode.Operand;
  10552. BEGIN
  10553. IntermediateCode.InitOperand(noOperand);
  10554. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10555. section.PatchOperands(pc,op,noOperand,noOperand);
  10556. END PatchLongint;
  10557. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10558. VAR op, noOperand: IntermediateCode.Operand;
  10559. BEGIN
  10560. IntermediateCode.InitOperand(noOperand);
  10561. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10562. section.PatchOperands(pc,op,noOperand,noOperand);
  10563. END PatchSymbol;
  10564. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10565. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10566. BEGIN
  10567. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10568. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10569. section.Emit(Data(Basic.invalidPosition,op));
  10570. END Boolean;
  10571. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10572. VAR op: IntermediateCode.Operand;
  10573. BEGIN
  10574. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10575. section.Emit(Data(Basic.invalidPosition,op));
  10576. END Char;
  10577. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10578. VAR op: IntermediateCode.Operand;
  10579. BEGIN
  10580. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10581. section.Emit(Data(Basic.invalidPosition,op));
  10582. END Integer;
  10583. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10584. VAR i: LONGINT;
  10585. BEGIN
  10586. Info(section,str);
  10587. i := 0;
  10588. WHILE(str[i] # 0X) DO
  10589. Char(section,str[i]);
  10590. INC(i);
  10591. END;
  10592. Char(section,0X);
  10593. END String;
  10594. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10595. VAR s: Basic.SectionName;
  10596. BEGIN
  10597. StringPool.GetString(str, s);
  10598. String(section, s);
  10599. END String0;
  10600. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10601. VAR op: IntermediateCode.Operand;
  10602. BEGIN
  10603. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10604. IntermediateCode.SetOffset(op,realOffset);
  10605. section.Emit(Data(Basic.invalidPosition,op));
  10606. END NamedSymbol;
  10607. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10608. VAR op: IntermediateCode.Operand;
  10609. BEGIN
  10610. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10611. IntermediateCode.SetOffset(op,realOffset);
  10612. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10613. END NamedSymbolAt;
  10614. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10615. BEGIN
  10616. IF symbol= NIL THEN
  10617. Address( section, realOffset);
  10618. ASSERT(virtualOffset = 0);
  10619. ELSE
  10620. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10621. END;
  10622. END Symbol;
  10623. (* OutPointers delivers
  10624. {pointerOffset}
  10625. *)
  10626. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10627. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10628. BEGIN
  10629. type := type.resolved;
  10630. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10631. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10632. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10633. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10634. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10635. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10636. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10637. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10638. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10639. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10640. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10641. ELSIF (type IS SyntaxTree.RecordType) THEN
  10642. (* never treat a record like a pointer, even if the pointer field is set! *)
  10643. WITH type: SyntaxTree.RecordType DO
  10644. base := type.GetBaseRecord();
  10645. IF base # NIL THEN
  10646. Pointers(offset,symbol,section, base,numberPointers);
  10647. END;
  10648. variable := type.recordScope.firstVariable;
  10649. WHILE(variable # NIL) DO
  10650. IF ~(variable.untraced) THEN
  10651. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10652. END;
  10653. variable := variable.nextVariable;
  10654. END;
  10655. END;
  10656. ELSIF (type IS SyntaxTree.CellType) THEN
  10657. WITH type: SyntaxTree.CellType DO
  10658. base := type.GetBaseRecord();
  10659. IF base # NIL THEN
  10660. Pointers(offset,symbol,section, base,numberPointers);
  10661. END;
  10662. variable := type.cellScope.firstVariable;
  10663. WHILE(variable # NIL) DO
  10664. IF ~(variable.untraced) THEN
  10665. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10666. END;
  10667. variable := variable.nextVariable;
  10668. END;
  10669. property := type.firstProperty;
  10670. WHILE(property # NIL) DO
  10671. IF ~(property.untraced) THEN
  10672. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10673. END;
  10674. property := property.nextProperty;
  10675. END;
  10676. parameter := type.firstParameter;
  10677. WHILE(parameter # NIL) DO
  10678. IF ~(parameter.untraced) THEN
  10679. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10680. END;
  10681. parameter := parameter.nextParameter;
  10682. END;
  10683. END;
  10684. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10685. WITH type: SyntaxTree.ArrayType DO
  10686. IF type.form= SyntaxTree.Static THEN
  10687. n := type.staticLength;
  10688. base := type.arrayBase.resolved;
  10689. WHILE(base IS SyntaxTree.ArrayType) DO
  10690. type := base(SyntaxTree.ArrayType);
  10691. n := n* type.staticLength;
  10692. base := type.arrayBase.resolved;
  10693. END;
  10694. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10695. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10696. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10697. FOR i := 0 TO n-1 DO
  10698. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10699. END;
  10700. END;
  10701. ELSE
  10702. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10703. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10704. END;
  10705. END;
  10706. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10707. WITH type: SyntaxTree.MathArrayType DO
  10708. IF type.form = SyntaxTree.Static THEN
  10709. n := type.staticLength;
  10710. base := type.arrayBase.resolved;
  10711. WHILE(base IS SyntaxTree.MathArrayType) DO
  10712. type := base(SyntaxTree.MathArrayType);
  10713. n := n* type.staticLength;
  10714. base := type.arrayBase.resolved;
  10715. END;
  10716. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10717. IF SemanticChecker.ContainsPointer(base) THEN
  10718. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10719. FOR i := 0 TO n-1 DO
  10720. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10721. END;
  10722. END;
  10723. ELSE
  10724. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10725. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10726. END
  10727. END;
  10728. (* ELSE no pointers in type *)
  10729. END;
  10730. END Pointers;
  10731. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10732. VAR position,i: LONGINT; ch: CHAR;
  10733. BEGIN
  10734. IF pool.Has(index) THEN
  10735. RETURN pool.GetInt(index)
  10736. ELSE
  10737. position := source.pc;
  10738. pool.PutInt(index, position);
  10739. Info(source, name);
  10740. i := 0;
  10741. REPEAT
  10742. ch := name[i]; INC(i);
  10743. Char( source, ch);
  10744. UNTIL ch = 0X;
  10745. END;
  10746. RETURN position;
  10747. END EnterDynamicName;
  10748. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10749. VAR name: Basic.SectionName; position: LONGINT;
  10750. BEGIN
  10751. IF pool.Has(index) THEN
  10752. RETURN pool.GetInt(index)
  10753. ELSE
  10754. StringPool.GetString(index, name);
  10755. position := EnterDynamicName(source,name,index, pool);
  10756. END;
  10757. RETURN position;
  10758. END DynamicName;
  10759. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10760. VAR section: IntermediateCode.Section;
  10761. BEGIN
  10762. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10763. IF implementationVisitor.backend.cooperative THEN
  10764. Info(section, "TypeDescriptor");
  10765. Basic.ToSegmentedName("BaseTypes.Array", name);
  10766. NamedSymbol(section, name,NIL, 0, 0);
  10767. BasePointer(section);
  10768. offset := 0;
  10769. ELSE
  10770. IF ProtectModulesPointers THEN
  10771. HeapBlock(mName,typeName,section,2);
  10772. END;
  10773. Info(section, "HeapBlock");
  10774. IF ProtectModulesPointers THEN
  10775. Symbol(section,section,2,0);
  10776. ELSE
  10777. Address(section,0);
  10778. END;
  10779. Info(section, "TypeDescriptor");
  10780. Address(section,0);
  10781. offset := section.pc;
  10782. END;
  10783. RETURN section
  10784. END NamedBlock;
  10785. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10786. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10787. BEGIN
  10788. COPY(moduleName,name);
  10789. Strings.Append(name,suffix);
  10790. Basic.ToSegmentedName(name, pooledName);
  10791. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10792. END Block;
  10793. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10794. VAR name: Basic.SegmentedName;
  10795. BEGIN
  10796. Info(source,"ArrayHeader");
  10797. IF implementationVisitor.backend.cooperative THEN
  10798. sizePC := source.pc;
  10799. Address(source,0);
  10800. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10801. IF baseType # "" THEN
  10802. Basic.ToSegmentedName(baseType, name);
  10803. NamedSymbol(source, name,NIL, 0, 0);
  10804. ELSE
  10805. Address(source,0);
  10806. END;
  10807. Address(source,0);
  10808. ELSE
  10809. Address(source,0);
  10810. Address(source,0);
  10811. (* first pointer for GC *)
  10812. IF hasPointer THEN
  10813. (* points to first element in the array, this is NOT the base type descriptor *)
  10814. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10815. ELSE
  10816. Address(source,0);
  10817. END;
  10818. sizePC := source.pc;
  10819. Address(source,0);
  10820. Info(source,"array data");
  10821. END;
  10822. END ArrayBlock;
  10823. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10824. BEGIN
  10825. IF implementationVisitor.backend.cooperative THEN
  10826. PatchSize(section, pc, size);
  10827. PatchSize(section, pc + 3, size);
  10828. ELSE
  10829. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10830. PatchSize(section, pc, size);
  10831. END;
  10832. END PatchArray;
  10833. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10834. VAR
  10835. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10836. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10837. poolMap: Basic.HashTableInt;
  10838. namePool: IntermediateCode.Section;
  10839. namePoolOffset: LONGINT;
  10840. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10841. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10842. BEGIN
  10843. Basic.SegmentedNameToString(s1.name,n1);
  10844. Basic.SegmentedNameToString(s2.name,n2);
  10845. index := 0;
  10846. ch1 := n1[index];
  10847. ch2 := n2[index];
  10848. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10849. INC(index);
  10850. ch1 := n1[index];
  10851. ch2 := n2[index];
  10852. END;
  10853. RETURN ch1 < ch2;
  10854. END Compare;
  10855. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10856. VAR
  10857. i, j: LONGINT;
  10858. x, t: Sections.Section;
  10859. BEGIN
  10860. IF lo < hi THEN
  10861. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10862. WHILE i <= j DO
  10863. WHILE Compare(list[i], x) DO INC(i) END;
  10864. WHILE Compare(x, list[j]) DO DEC(j) END;
  10865. IF i <= j THEN
  10866. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10867. INC(i); DEC(j)
  10868. END
  10869. END;
  10870. IF lo < j THEN QuickSort(list, lo, j) END;
  10871. IF i < hi THEN QuickSort(list, i, hi) END
  10872. END;
  10873. END QuickSort;
  10874. (*
  10875. ExportDesc* = RECORD
  10876. fp*: ADDRESS;
  10877. name* {UNTRACED}: DynamicName;
  10878. adr*: ADDRESS;
  10879. exports*: LONGINT;
  10880. dsc* {UNTRACED}: ExportArray
  10881. END;
  10882. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10883. *)
  10884. PROCEDURE ExportDesc2(
  10885. source: IntermediateCode.Section;
  10886. namePool: IntermediateCode.Section;
  10887. fingerPrinter: FingerPrinter.FingerPrinter;
  10888. symbol: Sections.Section;
  10889. name: StringPool.Index;
  10890. VAR patchAdr: LONGINT
  10891. ): BOOLEAN;
  10892. VAR fingerPrint: SyntaxTree.FingerPrint;
  10893. BEGIN
  10894. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10895. & (symbol.type # Sections.InlineCodeSection)
  10896. THEN
  10897. *)
  10898. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  10899. & (symbol.type # Sections.ExitCodeSection)
  10900. & (symbol.type # Sections.InlineCodeSection))
  10901. THEN
  10902. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10903. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10904. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10905. Longint(source,fingerPrint.public);
  10906. ELSE
  10907. Longint(source, 0);
  10908. END;
  10909. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10910. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10911. Symbol(source, symbol,0,0);
  10912. patchAdr := source.pc;
  10913. Longint(source, 0);
  10914. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10915. Address(source,0);
  10916. END;
  10917. RETURN TRUE
  10918. ELSE
  10919. RETURN FALSE
  10920. END;
  10921. END ExportDesc2;
  10922. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10923. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10924. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10925. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  10926. nextPatch: LONGINT;
  10927. TYPE
  10928. Scope = RECORD
  10929. elements: LONGINT;
  10930. gelements: LONGINT;
  10931. section: IntermediateCode.Section;
  10932. patchAdr: LONGINT;
  10933. arraySizePC: LONGINT;
  10934. beginPC: LONGINT; (* current scope start pc *)
  10935. END;
  10936. BEGIN
  10937. Basic.InitSegmentedName(prev);
  10938. olevel := -1;
  10939. scopes[0].section := source;
  10940. scopes[0].arraySizePC := MIN(LONGINT);
  10941. FOR s := 0 TO LEN(sections)-1 DO
  10942. symbol := sections[s];
  10943. 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
  10944. this := sections[s].name;
  10945. level := 0;
  10946. WHILE (level < LEN(this)) & (this[level] > 0) DO
  10947. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  10948. INC(level);
  10949. END;
  10950. WHILE level < olevel DO
  10951. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10952. IF olevel > 0 THEN
  10953. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10954. nextPatch := scopes[olevel-1].patchAdr+1;
  10955. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10956. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10957. END;
  10958. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10959. DEC(olevel);
  10960. END;
  10961. IF (level < LEN(this)) & (this[level] > 0) THEN
  10962. IF level > olevel THEN
  10963. (*TRACE("opening",level); *)
  10964. IF scopes[level].section = NIL THEN
  10965. arrayName := ".@ExportArray";
  10966. Strings.AppendInt(arrayName, level);
  10967. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  10968. AddPointer(scopes[level].section,offset);
  10969. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  10970. END;
  10971. scopes[level].beginPC := scopes[level].section.pc;
  10972. olevel := level;
  10973. scopes[olevel].elements := 0;
  10974. END;
  10975. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10976. sym := sections[s];
  10977. ELSE
  10978. sym := NIL;
  10979. END;
  10980. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10981. THEN
  10982. INC(scopes[olevel].elements);
  10983. END;
  10984. (* enter string in scope *)
  10985. INC(level);
  10986. END;
  10987. END;
  10988. Basic.SegmentedNameToString(this, name);
  10989. prev := this;
  10990. END;
  10991. END;
  10992. WHILE 0 <= olevel DO
  10993. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10994. IF olevel > 0 THEN
  10995. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10996. nextPatch := scopes[olevel-1].patchAdr+1;
  10997. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10998. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10999. END;
  11000. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11001. DEC(olevel);
  11002. END;
  11003. level := 0;
  11004. WHILE (level < LEN(scopes)) DO
  11005. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  11006. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  11007. END;
  11008. INC(level);
  11009. END;
  11010. END Export;
  11011. BEGIN
  11012. NEW(fingerPrinter);
  11013. NEW(poolMap, 64);
  11014. (* 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 *)
  11015. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  11016. NEW(sectionArray, module.allSections.Length());
  11017. FOR i := 0 TO module.allSections.Length() - 1 DO
  11018. section := module.allSections.GetSection(i);
  11019. sectionArray[i] := section;
  11020. END;
  11021. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  11022. Export(sectionArray^);
  11023. END ExportDesc;
  11024. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11025. VAR
  11026. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11027. BEGIN
  11028. Info(source, "exception table offsets array descriptor");
  11029. size := 0;
  11030. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11031. Info(source, "exception table content");
  11032. FOR i := 0 TO module.allSections.Length() - 1 DO
  11033. p := module.allSections.GetSection(i);
  11034. IF p.type = Sections.CodeSection THEN
  11035. finallyPC := p(IntermediateCode.Section).finally;
  11036. IF finallyPC>=0 THEN
  11037. Symbol( source, p, 0,0);
  11038. Symbol( source, p, finallyPC, 0);
  11039. Symbol( source, p, finallyPC,0);
  11040. INC(size);
  11041. END;
  11042. END
  11043. END;
  11044. PatchArray(source,sizePC,size);
  11045. END ExceptionArray;
  11046. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11047. VAR i: LONGINT; ch: CHAR;
  11048. BEGIN
  11049. i := 0;
  11050. REPEAT
  11051. ch := name[i]; INC(i);
  11052. Char( section, ch);
  11053. UNTIL ch = 0X;
  11054. WHILE i < 32 DO
  11055. Char( section, 0X); INC(i);
  11056. END;
  11057. END Name;
  11058. PROCEDURE References(section: IntermediateCode.Section);
  11059. CONST
  11060. sfTypeNone = 0X;
  11061. sfTypeCHAR = 01X;
  11062. sfTypeCHAR8 = 02X;
  11063. sfTypeCHAR16 = 03X;
  11064. sfTypeCHAR32 = 04X;
  11065. sfTypeRANGE = 05X;
  11066. sfTypeSHORTINT = 06X;
  11067. sfTypeINTEGER = 07X;
  11068. sfTypeLONGINT = 08X;
  11069. sfTypeHUGEINT = 09X;
  11070. sfTypeWORD = 0AX;
  11071. sfTypeLONGWORD = 0BX;
  11072. sfTypeSIGNED8 = 0CX;
  11073. sfTypeSIGNED16 = 0DX;
  11074. sfTypeSIGNED32 = 0EX;
  11075. sfTypeSIGNED64 = 0FX;
  11076. sfTypeUNSIGNED8 = 10X;
  11077. sfTypeUNSIGNED16 = 11X;
  11078. sfTypeUNSIGNED32 = 12X;
  11079. sfTypeUNSIGNED64 = 13X;
  11080. sfTypeREAL = 14X;
  11081. sfTypeLONGREAL = 15X;
  11082. sfTypeCOMPLEX = 16X;
  11083. sfTypeLONGCOMPLEX = 17X;
  11084. sfTypeBOOLEAN = 18X;
  11085. sfTypeSET = 19X;
  11086. sfTypeANY = 1AX;
  11087. sfTypeOBJECT = 1BX;
  11088. sfTypeBYTE = 1CX;
  11089. sfTypeADDRESS = 1DX;
  11090. sfTypeSIZE = 1EX;
  11091. sfTypeIndirect = 1FX;
  11092. sfTypeRecord = 20X;
  11093. sfTypePointerToRecord = 21X;
  11094. sfTypePointerToArray = 22X;
  11095. sfTypeOpenArray = 23X;
  11096. sfTypeStaticArray = 24X;
  11097. sfTypeDynamicArray = 25X;
  11098. sfTypeMathStaticArray = 26X;
  11099. sfTypeMathOpenArray = 27X;
  11100. sfTypeMathTensor = 28X;
  11101. sfTypeProcedure = 29X;
  11102. sfTypeDelegate = 2AX;
  11103. sfTypeENUM = 2BX;
  11104. sfTypeCELL = 2CX;
  11105. sfTypePORT = 2DX;
  11106. sfIN = 0X;
  11107. sfOUT = 1X;
  11108. flagDelegate = 0;
  11109. flagConstructor = 1;
  11110. (* variable / parameter addressing modes *)
  11111. sfAbsolute = 0X; (* global vars *)
  11112. sfRelative = 1X; (* variables, value parameters *)
  11113. sfIndirect = 2X; (* var parameters *)
  11114. sfScopeBegin = 0F0X;
  11115. sfScopeEnd = 0F1X;
  11116. sfProcedure = 0F2X;
  11117. sfVariable = 0F3X;
  11118. sfTypeDeclaration = 0F4X;
  11119. sfModule = 0FFX;
  11120. RefInfo = TRUE;
  11121. VAR
  11122. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11123. indirectTypes: Basic.HashTable;
  11124. PROCEDURE CurrentIndex(): LONGINT;
  11125. VAR i: LONGINT;
  11126. BEGIN
  11127. FOR i := startPC TO section.pc -1 DO
  11128. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11129. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11130. END;
  11131. startPC := section.pc;
  11132. RETURN lastOffset;
  11133. END CurrentIndex;
  11134. (*
  11135. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11136. Module = sfModule prevSymbol:SIZE name:String Scope.
  11137. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11138. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11139. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11140. Type =
  11141. sfTypePointerToRecord
  11142. | sfTypePointerToArray Type
  11143. | sfTypeOpenArray Type
  11144. | sfTypeDynamicArray Type
  11145. | sfTypeStaticArray length:SIZE Type
  11146. | sfTypeMathOpenArray Type
  11147. | sfTypeMathStaticArray length:SIZE Type
  11148. | sfTypeMathTensor Type
  11149. | sfTypeRecord tdAdr:ADDRESS
  11150. | sfTypeProcedure {Parameter} return:Type
  11151. | sfTypeDelegate {Parameter} return:Type
  11152. | sfTypePort (sfIN | sfOUT)
  11153. | sfTypeBOOLEAN
  11154. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11155. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11156. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11157. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11158. | sfTypeWORD | sfTypeLONGWORD
  11159. | sfTypeREAL | sfTypeLONGREAL
  11160. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11161. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11162. | sfTypeIndirect offset:SIZE.
  11163. *)
  11164. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11165. VAR offset: SIZE;
  11166. BEGIN
  11167. IF indirectTypes.Has(type) THEN
  11168. offset := indirectTypes.GetInt(type);
  11169. Char(section, sfTypeIndirect);
  11170. Size(section, offset);
  11171. RETURN TRUE;
  11172. ELSE
  11173. indirectTypes.PutInt(type, CurrentIndex());
  11174. RETURN FALSE;
  11175. END;
  11176. END Indirect;
  11177. PROCEDURE NType(type: SyntaxTree.Type);
  11178. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11179. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11180. BEGIN
  11181. IF type = NIL THEN
  11182. Char(section, sfTypeNone)
  11183. ELSE
  11184. type := type.resolved;
  11185. size := type.sizeInBits;
  11186. WITH type:SyntaxTree.PointerType DO
  11187. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11188. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11189. Char(section, sfTypePointerToRecord);
  11190. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11191. ELSE
  11192. IF RefInfo THEN Info(section,"PointerToArray") END;
  11193. Char(section, sfTypePointerToArray);
  11194. NType(type.pointerBase);
  11195. END;
  11196. | type: SyntaxTree.ArrayType DO
  11197. IF ~Indirect(type) THEN
  11198. IF type.form = SyntaxTree.Open THEN
  11199. IF RefInfo THEN Info(section,"OpenArray") END;
  11200. Char(section, sfTypeOpenArray);
  11201. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11202. IF RefInfo THEN Info(section,"DynamicArray") END;
  11203. Char(section, sfTypeDynamicArray);
  11204. ELSIF type.form = SyntaxTree.Static THEN
  11205. IF RefInfo THEN Info(section,"StaticArray") END;
  11206. Char(section, sfTypeStaticArray);
  11207. Size(section, type.staticLength);
  11208. ELSE
  11209. HALT(100);
  11210. END;
  11211. NType(type.arrayBase);
  11212. END;
  11213. | type: SyntaxTree.MathArrayType DO
  11214. IF ~Indirect(type) THEN
  11215. IF type.form = SyntaxTree.Open THEN
  11216. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11217. Char(section, sfTypeMathOpenArray);
  11218. ELSIF type.form = SyntaxTree.Static THEN
  11219. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11220. Char(section, sfTypeMathStaticArray);
  11221. Size(section, type.staticLength);
  11222. ELSIF type.form = SyntaxTree.Tensor THEN
  11223. IF RefInfo THEN Info(section,"MathTensor") END;
  11224. Char(section, sfTypeMathTensor);
  11225. ELSE
  11226. HALT(100);
  11227. END;
  11228. NType(type.arrayBase);
  11229. END;
  11230. | type: SyntaxTree.RecordType DO
  11231. IF ~Indirect(type) THEN
  11232. IF type.pointerType # NIL (* OBJECT *) THEN
  11233. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11234. Char(section, sfTypePointerToRecord)
  11235. ELSE
  11236. IF RefInfo THEN Info(section,"Record") END;
  11237. Char(section, sfTypeRecord);
  11238. td := type.typeDeclaration;
  11239. IF RefInfo THEN Info(section,"TD") END;
  11240. IF (td # NIL) THEN
  11241. Global.GetSymbolSegmentedName(td,segmentedName);
  11242. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11243. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11244. ELSE
  11245. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11246. END;
  11247. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11248. Symbol(section, tir, 0, offset);
  11249. ELSE
  11250. Address(section, 0);
  11251. END;
  11252. END;
  11253. END;
  11254. | type: SyntaxTree.CellType DO
  11255. IF ~Indirect(type) THEN
  11256. IF RefInfo THEN Info(section,"Record") END;
  11257. Char(section, sfTypeRecord);
  11258. td := type.typeDeclaration;
  11259. IF RefInfo THEN Info(section,"TD") END;
  11260. IF (td # NIL) THEN
  11261. Global.GetSymbolSegmentedName(td,segmentedName);
  11262. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11263. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11264. ELSE
  11265. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11266. END;
  11267. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11268. Symbol(section, tir, 0, offset);
  11269. ELSE
  11270. Address(section, 0);
  11271. END;
  11272. END;
  11273. | type: SyntaxTree.PortType DO
  11274. Char(section, sfTypePORT);
  11275. IF type.direction = SyntaxTree.OutPort THEN
  11276. Char(section, sfOUT)
  11277. ELSE
  11278. Char(section, sfIN)
  11279. END;
  11280. | type: SyntaxTree.ProcedureType DO
  11281. IF ~Indirect(type) THEN
  11282. IF type.isDelegate THEN
  11283. Char(section, sfTypeDelegate);
  11284. ELSE
  11285. Char(section, sfTypeProcedure);
  11286. END;
  11287. parameter := type.firstParameter;
  11288. WHILE(parameter # NIL) DO
  11289. NParameter(parameter, -1);
  11290. parameter := parameter.nextParameter;
  11291. END;
  11292. NType(type.returnType);
  11293. END;
  11294. | type:SyntaxTree.EnumerationType DO
  11295. Char(section, sfTypeENUM);
  11296. | type: SyntaxTree.BasicType DO
  11297. WITH type: SyntaxTree.BooleanType DO
  11298. IF RefInfo THEN Info(section,"Boolean") END;
  11299. Char(section, sfTypeBOOLEAN);
  11300. | type: SyntaxTree.CharacterType DO
  11301. IF type = module.system.characterType THEN
  11302. IF RefInfo THEN Info(section,"CHAR") END;
  11303. Char(section, sfTypeCHAR);
  11304. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11305. IF RefInfo THEN Info(section,"CHAR8") END;
  11306. Char(section, sfTypeCHAR8)
  11307. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11308. IF RefInfo THEN Info(section,"CHAR16") END;
  11309. Char(section, sfTypeCHAR16);
  11310. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11311. IF RefInfo THEN Info(section,"CHAR32") END;
  11312. Char(section, sfTypeCHAR32);
  11313. ELSE
  11314. HALT(100);
  11315. END;
  11316. |type: SyntaxTree.IntegerType DO
  11317. IF type(SyntaxTree.IntegerType).signed THEN
  11318. IF (type = module.system.shortintType) THEN
  11319. IF RefInfo THEN Info(section,"SHORTINT") END;
  11320. Char(section, sfTypeSHORTINT)
  11321. ELSIF (type = module.system.integerType) THEN
  11322. IF RefInfo THEN Info(section,"INTEGER") END;
  11323. Char(section, sfTypeINTEGER)
  11324. ELSIF (type = module.system.longintType) THEN
  11325. IF RefInfo THEN Info(section,"LONGINT") END;
  11326. Char(section, sfTypeLONGINT)
  11327. ELSIF (type = module.system.hugeintType) THEN
  11328. IF RefInfo THEN Info(section,"HUGEINT") END;
  11329. Char(section, sfTypeHUGEINT)
  11330. ELSIF (type = module.system.wordType) THEN
  11331. IF RefInfo THEN Info(section,"WORD") END;
  11332. Char(section, sfTypeWORD)
  11333. ELSIF (type = module.system.longWordType) THEN
  11334. IF RefInfo THEN Info(section,"LONGWORD") END;
  11335. Char(section, sfTypeLONGWORD);
  11336. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11337. IF RefInfo THEN Info(section,"SIGNED8") END;
  11338. Char(section, sfTypeSIGNED8)
  11339. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11340. IF RefInfo THEN Info(section,"SIGNED16") END;
  11341. Char(section, sfTypeSIGNED16)
  11342. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11343. IF RefInfo THEN Info(section,"SIGNED32") END;
  11344. Char(section, sfTypeSIGNED32)
  11345. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11346. IF RefInfo THEN Info(section,"SIGNED64") END;
  11347. Char(section, sfTypeSIGNED64)
  11348. ELSE
  11349. HALT(100);
  11350. END
  11351. ELSE (* unsigned *)
  11352. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11353. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11354. Char(section, sfTypeUNSIGNED8)
  11355. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11356. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11357. Char(section, sfTypeUNSIGNED16)
  11358. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11359. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11360. Char(section, sfTypeUNSIGNED32)
  11361. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11362. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11363. Char(section, sfTypeUNSIGNED64)
  11364. ELSE
  11365. HALT(100)
  11366. END
  11367. END;
  11368. | type: SyntaxTree.FloatType DO
  11369. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11370. IF RefInfo THEN Info(section,"REAL") END;
  11371. Char(section, sfTypeREAL);
  11372. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11373. IF RefInfo THEN Info(section,"LONGREAL") END;
  11374. Char(section, sfTypeLONGREAL);
  11375. ELSE
  11376. HALT(100);
  11377. END;
  11378. |type: SyntaxTree.ComplexType DO
  11379. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11380. IF RefInfo THEN Info(section,"COMPLEX") END;
  11381. Char(section, sfTypeCOMPLEX);
  11382. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11383. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11384. Char(section, sfTypeLONGCOMPLEX);
  11385. ELSE
  11386. HALT(100);
  11387. END;
  11388. |type:SyntaxTree.SetType DO
  11389. IF RefInfo THEN Info(section,"SET") END;
  11390. Char(section, sfTypeSET);
  11391. |type:SyntaxTree.AnyType DO
  11392. IF RefInfo THEN Info(section,"ANY") END;
  11393. Char(section, sfTypeANY);
  11394. |type:SyntaxTree.ObjectType DO
  11395. IF RefInfo THEN Info(section,"OBJECT") END;
  11396. Char(section, sfTypeOBJECT);
  11397. |type:SyntaxTree.ByteType DO
  11398. IF RefInfo THEN Info(section,"BYTE") END;
  11399. Char(section, sfTypeBYTE);
  11400. |type:SyntaxTree.RangeType DO
  11401. IF RefInfo THEN Info(section,"RANGE") END;
  11402. Char(section, sfTypeRANGE)
  11403. |type:SyntaxTree.AddressType DO
  11404. IF RefInfo THEN Info(section,"ADDRESS") END;
  11405. Char(section, sfTypeADDRESS)
  11406. |type:SyntaxTree.SizeType DO
  11407. IF RefInfo THEN Info(section,"SIZE") END;
  11408. Char(section, sfTypeSIZE)
  11409. ELSE
  11410. HALT(100)
  11411. END;
  11412. ELSE HALT(101);
  11413. END;
  11414. END;
  11415. END NType;
  11416. (*
  11417. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11418. *)
  11419. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11420. VAR pos: LONGINT; type: SyntaxTree.Type;
  11421. BEGIN
  11422. IF RefInfo THEN Info(section, "Parameter") END;
  11423. Char(section, sfVariable);
  11424. Size(section, procOffset);
  11425. String0(section, parameter.name);
  11426. type := parameter.type.resolved;
  11427. IF parameter.kind = SyntaxTree.VarParameter THEN
  11428. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11429. ELSE Char(section, sfIndirect)
  11430. END;
  11431. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11432. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11433. Char(section, sfIndirect);
  11434. ELSE
  11435. Char(section, sfRelative);
  11436. END;
  11437. ELSE
  11438. Char(section, sfRelative);
  11439. END;
  11440. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11441. NType(parameter.type);
  11442. END NParameter;
  11443. (*
  11444. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11445. *)
  11446. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11447. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11448. flags: SET;
  11449. BEGIN
  11450. IF procedure.externalName # NIL THEN RETURN END;
  11451. IF RefInfo THEN Info(section, "Procedure") END;
  11452. pos := CurrentIndex();
  11453. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11454. Char(section, sfProcedure);
  11455. Size(section, scopeOffset);
  11456. String0(section,procedure.name);
  11457. s := module.allSections.FindBySymbol(procedure);
  11458. Symbol(section,s,0,0); (* start *)
  11459. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11460. flags := {};
  11461. IF procedureType.isDelegate THEN
  11462. INCL(flags, flagDelegate);
  11463. END;
  11464. IF procedure.isConstructor THEN
  11465. INCL(flags, flagConstructor);
  11466. END;
  11467. Set(section, flags);
  11468. IF RefInfo THEN Info(section, "Parameters") END;
  11469. parameter := procedureType.firstParameter;
  11470. WHILE(parameter # NIL) DO
  11471. NParameter(parameter, pos);
  11472. parameter := parameter.nextParameter;
  11473. END;
  11474. IF procedureType.returnParameter # NIL THEN
  11475. NParameter(procedureType.returnParameter, pos);
  11476. END;
  11477. IF procedureType.selfParameter # NIL THEN
  11478. NParameter(procedureType.selfParameter, pos);
  11479. END;
  11480. IF RefInfo THEN Info(section, "ReturnType") END;
  11481. NType(procedureType.returnType);
  11482. NScope(procedure.procedureScope, pos);
  11483. END NProcedure;
  11484. (*
  11485. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11486. *)
  11487. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11488. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11489. BEGIN
  11490. IF RefInfo THEN Info(section, "Variable") END;
  11491. pos := CurrentIndex();
  11492. Char(section, sfVariable);
  11493. Size(section, scopeOffset);
  11494. String0(section, variable.name);
  11495. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11496. Char(section, sfAbsolute);
  11497. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11498. NamedSymbol(section, sn,variable, 0,0);
  11499. ELSE
  11500. Char(section, sfRelative);
  11501. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11502. END;
  11503. NType(variable.type);
  11504. s := module.allSections.FindBySymbol(variable);
  11505. END NVariable;
  11506. (*
  11507. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11508. *)
  11509. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11510. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11511. BEGIN
  11512. IF typeDeclaration = NIL THEN RETURN END;
  11513. pos := CurrentIndex();
  11514. s := module.allSections.FindBySymbol(typeDeclaration);
  11515. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11516. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11517. Char(section, sfTypeDeclaration);
  11518. Size(section, scopeOffset);
  11519. String0(section, typeDeclaration.name);
  11520. declared := typeDeclaration.declaredType.resolved;
  11521. IF (declared IS SyntaxTree.PointerType) THEN
  11522. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11523. END;
  11524. WITH declared: SyntaxTree.RecordType DO
  11525. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*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 (* does not work for coop *)
  11531. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11532. END;
  11533. NScope(declared.recordScope, pos);
  11534. |declared: SyntaxTree.CellType DO
  11535. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11536. Symbol(section, s, 0, offset);
  11537. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11538. Basic.AppendToSegmentedName(name,".@Info");
  11539. s := module.allSections.FindByName(name);
  11540. IF s # NIL THEN
  11541. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11542. END;
  11543. NScope(declared.cellScope, pos);
  11544. ELSE
  11545. Address(section, 0);
  11546. END;
  11547. END NTypeDeclaration;
  11548. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11549. VAR pos: LONGINT;
  11550. BEGIN
  11551. pos := CurrentIndex();
  11552. Char(section,sfModule);
  11553. Size(section, prevSymbol);
  11554. String0(section, module.name);
  11555. NScope(module.moduleScope, pos);
  11556. END NModule;
  11557. (*
  11558. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11559. *)
  11560. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11561. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11562. BEGIN
  11563. IF scope = NIL THEN RETURN END;
  11564. IF RefInfo THEN Info(section, "Scope") END;
  11565. Char(section, sfScopeBegin);
  11566. variable := scope.firstVariable;
  11567. WHILE (variable # NIL) DO
  11568. NVariable(variable, prevSymbol);
  11569. variable := variable.nextVariable;
  11570. END;
  11571. WITH scope: SyntaxTree.ModuleScope DO
  11572. bodyProcedure := scope.bodyProcedure;
  11573. |scope: SyntaxTree.RecordScope DO
  11574. bodyProcedure := scope.bodyProcedure;
  11575. ELSE
  11576. bodyProcedure := NIL;
  11577. END;
  11578. IF bodyProcedure # NIL THEN
  11579. NProcedure(bodyProcedure, prevSymbol)
  11580. END;
  11581. procedure := scope.firstProcedure;
  11582. WHILE procedure # NIL DO
  11583. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11584. procedure := procedure.nextProcedure;
  11585. END;
  11586. typeDeclaration := scope.firstTypeDeclaration;
  11587. WHILE typeDeclaration # NIL DO
  11588. NTypeDeclaration(typeDeclaration, prevSymbol);
  11589. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11590. END;
  11591. Char(section, sfScopeEnd); (* scope ends *)
  11592. END NScope;
  11593. BEGIN
  11594. NEW(indirectTypes, 32);
  11595. ArrayBlock(section,sizePC,"", FALSE);
  11596. startPC := section.pc;
  11597. NModule(module.module, -1);
  11598. PatchArray(section,sizePC,CurrentIndex());
  11599. END References;
  11600. (*
  11601. Command* = RECORD
  11602. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11603. name*: Name; (* name of the procedure *)
  11604. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11605. entryAdr* : ADDRESS; (* entry address of procedure *)
  11606. END;
  11607. *)
  11608. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11609. VAR
  11610. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11611. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11612. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11613. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11614. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11615. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11616. BEGIN
  11617. RETURN
  11618. (type = NIL) OR
  11619. (type.resolved IS SyntaxTree.RecordType) OR
  11620. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11621. (type.resolved IS SyntaxTree.AnyType);
  11622. END TypeAllowed;
  11623. BEGIN
  11624. numberParameters := procedureType.numberParameters;
  11625. RETURN
  11626. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11627. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11628. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11629. END GetProcedureAllowed;
  11630. PROCEDURE WriteType(type : SyntaxTree.Type);
  11631. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11632. name: Basic.SegmentedName; offset: LONGINT;
  11633. BEGIN
  11634. IF type = NIL THEN
  11635. Address(source,0);
  11636. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11637. Address(source,1);
  11638. ELSE
  11639. type := type.resolved;
  11640. IF type IS SyntaxTree.PointerType THEN
  11641. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11642. END;
  11643. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11644. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11645. name[0] := typeDeclaration.name; name[1] := -1;
  11646. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11647. ASSERT(section # NIL);
  11648. ELSE
  11649. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11650. (* TODO *)
  11651. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11652. END;
  11653. IF implementationVisitor.backend.cooperative THEN
  11654. offset := 0;
  11655. ELSE
  11656. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11657. END;
  11658. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11659. END;
  11660. END WriteType;
  11661. BEGIN
  11662. Info(source, "command array descriptor");
  11663. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11664. numberCommands := 0;
  11665. Info(source, "command array content");
  11666. FOR i := 0 TO module.allSections.Length() - 1 DO
  11667. p := module.allSections.GetSection(i);
  11668. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11669. procedure := p.symbol(SyntaxTree.Procedure);
  11670. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11671. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11672. procedure.GetName(name);
  11673. Name(source,name);
  11674. numberParameters := procedureType.numberParameters;
  11675. (* offset of type of first parameter *)
  11676. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11677. ELSE WriteType(procedureType.firstParameter.type)
  11678. END;
  11679. (* offset of type of return parameter *)
  11680. WriteType(procedureType.returnType);
  11681. (* command name *)
  11682. (* command code offset *)
  11683. Symbol(source,p,0,0);
  11684. INC(numberCommands);
  11685. IF Trace THEN
  11686. D.Ln;
  11687. END;
  11688. END;
  11689. END
  11690. END;
  11691. PatchArray(source,sizePC,numberCommands);
  11692. END CommandArray;
  11693. (* to prevent from double import of different module aliases *)
  11694. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11695. VAR i: SyntaxTree.Import;
  11696. BEGIN
  11697. i := module.module.moduleScope.firstImport;
  11698. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11699. i := i.nextImport;
  11700. END;
  11701. RETURN i = import
  11702. END IsFirstDirectOccurence;
  11703. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11704. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11705. BEGIN
  11706. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11707. ArrayBlock(source,pc,"", FALSE);
  11708. Info(source, "import module array data");
  11709. IF implementationVisitor.backend.cooperative THEN
  11710. offset := 0;
  11711. ELSE
  11712. IF module.system.addressType.sizeInBits = 64 THEN
  11713. (* change this when Heaps.HeapBlock is modified *)
  11714. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11715. ELSE
  11716. (* change this when Heaps.HeapBlock is modified *)
  11717. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11718. END;
  11719. END;
  11720. import := module.module.moduleScope.firstImport;
  11721. numberImports := 0;
  11722. WHILE import # NIL DO
  11723. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11724. Global.GetModuleSegmentedName(import.module,name);
  11725. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11726. NamedSymbol(source, name, NIL, 0, offset);
  11727. INC(numberImports);
  11728. END;
  11729. import := import.nextImport
  11730. END;
  11731. PatchArray(source,pc,numberImports);
  11732. END ImportsArray;
  11733. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11734. VAR
  11735. p: Sections.Section; sizePC, size, i: LONGINT;
  11736. BEGIN
  11737. Info(source, "Type info section");
  11738. size := 0;
  11739. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11740. FOR i := 0 TO module.allSections.Length() - 1 DO
  11741. p := module.allSections.GetSection(i);
  11742. WITH p: IntermediateCode.Section DO
  11743. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11744. Symbol(source,p,EmptyBlockOffset,0);
  11745. INC(size);
  11746. END;
  11747. END
  11748. END;
  11749. PatchArray(source,sizePC,size);
  11750. END TypeInfoSection;
  11751. (*
  11752. ProcTableEntry* = RECORD
  11753. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11754. noPtr*: LONGINT;
  11755. END;
  11756. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11757. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11758. *)
  11759. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11760. VAR
  11761. numberPointers: LONGINT;
  11762. procedure: SyntaxTree.Procedure;
  11763. BEGIN
  11764. Info(section,"pcFrom");
  11765. Symbol(section,procedureSection,0,0);
  11766. Info(section,"pcTo");
  11767. Symbol(section, procedureSection, procedureSection.pc, 0);
  11768. Info(section,"pointer to offsets array");
  11769. Symbol(section, section,section.pc+1,0);
  11770. Info(section,"offsets array");
  11771. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11772. PointerArray(section, procedure.procedureScope, numberPointers);
  11773. END ProcedureDescriptor;
  11774. (* only for tracing, the descriptor is otherwise not complete ! *)
  11775. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11776. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11777. BEGIN
  11778. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11779. name := procedureSection.name;
  11780. Basic.AppendToSegmentedName(name,".@Info");
  11781. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11782. Address(section,0);
  11783. Symbol(section,section,2,0);
  11784. (*
  11785. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11786. descSize: SIZE;
  11787. sentinel: ADDRESS; (* = MPO-4 *)
  11788. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11789. flags*: SET;
  11790. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11791. name*: Name;
  11792. END;
  11793. *)
  11794. Size(section, 0);
  11795. Address(section,0);
  11796. Address(section,0);
  11797. Set(section,{});
  11798. moduleSection := ModuleSection();
  11799. Symbol( section, moduleSection, moduleSection.pc,0);
  11800. IF procedureSection.symbol = NIL THEN
  11801. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11802. ELSE
  11803. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11804. END;
  11805. Name(section, infoName);
  11806. Size(section, 0);
  11807. RETURN section;
  11808. END MakeProcedureDescriptorTag;
  11809. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11810. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11811. BEGIN
  11812. name := procedureSection.name;
  11813. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11814. IF implementationVisitor.backend.cooperative THEN
  11815. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11816. Info(section, "TypeDescriptor");
  11817. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11818. NamedSymbol(dest, name,NIL, 0, 0);
  11819. BaseRecord(dest);
  11820. offset := 0;
  11821. ELSIF CreateProcedureDescInfo THEN
  11822. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11823. Address(dest,0);
  11824. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11825. offset := dest.pc;
  11826. ELSE
  11827. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11828. END;
  11829. ProcedureDescriptor(dest, procedureSection);
  11830. Symbol(section, dest, offset, 0);
  11831. END ProcedureDescriptorPointer;
  11832. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11833. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11834. BEGIN
  11835. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11836. numberProcs := 0;
  11837. FOR i := 0 TO module.allSections.Length() - 1 DO
  11838. destination := module.allSections.GetSection(i);
  11839. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11840. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11841. INC(numberProcs);
  11842. END
  11843. END;
  11844. PatchArray(section, sizePC, numberProcs);
  11845. END ProcedureDescriptorArray;
  11846. (*
  11847. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11848. VAR
  11849. next*: Module; (** once a module is published, all fields are read-only *)
  11850. name*: Name;
  11851. init, published: BOOLEAN;
  11852. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11853. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11854. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11855. command*: POINTER TO ARRAY OF Command;
  11856. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11857. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11858. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11859. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11860. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11861. data*, code*: Bytes;
  11862. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11863. export*: ExportDesc;
  11864. term*: TerminationHandler;
  11865. exTable*: ExceptionTable;
  11866. noProcs*: LONGINT;
  11867. firstProc*: ADDRESS; <- done by loader
  11868. maxPtrs*: LONGINT;
  11869. crc*: LONGINT;
  11870. *)
  11871. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11872. BEGIN
  11873. Info(section, "cycle");
  11874. Size(section,0);
  11875. Info(section, "references");
  11876. Size(section,0);
  11877. Info(section, "nextMarked");
  11878. Address(section,0);
  11879. Info(section, "nextWatched");
  11880. Address(section,0);
  11881. END BasePointer;
  11882. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11883. BEGIN
  11884. BasePointer(section);
  11885. Info(section, "action");
  11886. Address(section,0);
  11887. Info(section, "monitor");
  11888. Address(section,0);
  11889. END BaseObject;
  11890. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11891. BEGIN
  11892. BasePointer(section);
  11893. Info(section, "action");
  11894. Address(section,0);
  11895. Info(section, "monitor");
  11896. Address(section,0);
  11897. END BaseRecord;
  11898. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11899. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11900. pooledName: Basic.SegmentedName;
  11901. symbol: SyntaxTree.Symbol;
  11902. BEGIN
  11903. Global.GetModuleName(module.module,name);
  11904. Strings.Append(name,".@Module.@Descriptor");
  11905. Basic.ToSegmentedName(name, pooledName);
  11906. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11907. Symbol(section,descriptorSection,0,0);
  11908. Info(descriptorSection, "descriptor");
  11909. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11910. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11911. Address(descriptorSection,0);
  11912. Global.GetModuleName(module.module,name);
  11913. Strings.Append(name,".@Trace");
  11914. Basic.ToSegmentedName(name, pooledName);
  11915. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11916. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11917. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11918. END ModuleDescriptor;
  11919. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11920. VAR name: ARRAY 128 OF CHAR;
  11921. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11922. symbol: SyntaxTree.Symbol;
  11923. BEGIN
  11924. ASSERT(implementationVisitor.backend.newObjectFile);
  11925. Global.GetModuleName(module.module,name);
  11926. Strings.Append(name,".@Module");
  11927. Basic.ToSegmentedName(name, pooledName);
  11928. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11929. moduleSection.SetExported(TRUE);
  11930. IF moduleSection.pc = 0 THEN
  11931. IF implementationVisitor.backend.cooperative THEN
  11932. Info(moduleSection, "descriptor");
  11933. ModuleDescriptor(moduleSection);
  11934. BaseObject(moduleSection);
  11935. implementationVisitor.CreateTraceModuleMethod(module.module);
  11936. ELSE
  11937. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11938. Info(moduleSection, "HeapBlock");
  11939. Symbol(moduleSection,moduleSection,2,0);
  11940. Info(moduleSection, "TypeDescriptor");
  11941. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11942. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11943. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11944. END;
  11945. END;
  11946. RETURN moduleSection;
  11947. END ModuleSection;
  11948. PROCEDURE NewModuleInfo();
  11949. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11950. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11951. sectionName: Basic.SectionName;
  11952. CONST MPO=-40000000H;
  11953. BEGIN
  11954. (*
  11955. TypeDesc* = POINTER TO RECORD
  11956. descSize: SIZE;
  11957. sentinel: LONGINT; (* = MPO-4 *)
  11958. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11959. flags*: SET;
  11960. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11961. name*: Name;
  11962. refsOffset: SIZE;
  11963. END;
  11964. *)
  11965. (*name is missing prefixes sometimes*)
  11966. Global.GetModuleSegmentedName(module.module,name);
  11967. Basic.AppendToSegmentedName(name,".@Info");
  11968. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11969. IF ~implementationVisitor.backend.cooperative THEN
  11970. Info(source, "HeapBlock");
  11971. Address(source,0); (* an empty heap block prevents GC marking *)
  11972. Info(source, "TypeDescriptor");
  11973. Address(source,0);
  11974. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  11975. END;
  11976. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11977. Address(source,MPO-4);
  11978. Info(source, "type tag pointer");
  11979. Address( source,0);
  11980. Info(source, "type flags");
  11981. flags := {};
  11982. Set( source, flags);
  11983. Info(source, "pointer to module");
  11984. moduleSection := ModuleSection();
  11985. Symbol( source, moduleSection, moduleSection.pc,0);
  11986. Info(source, "type name");
  11987. i := 0;
  11988. sectionName := "@Self";
  11989. (*
  11990. Global.GetSymbolSegmentedName(td,name);
  11991. Basic.SegmentedNameToString(name, sectionName);
  11992. *)
  11993. Name(source,sectionName);
  11994. patchInfoPC := source.pc;
  11995. Size(source, 0);
  11996. END NewModuleInfo;
  11997. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11998. VAR
  11999. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  12000. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  12001. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  12002. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  12003. referenceSectionOffset : LONGINT;
  12004. name: Basic.SegmentedName; offset: LONGINT;
  12005. flags: SET;
  12006. BEGIN
  12007. NewModuleInfo();
  12008. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  12009. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  12010. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  12011. ImportsArray(importSection);
  12012. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  12013. CommandArray(commandsSection);
  12014. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  12015. ExceptionArray(exceptionSection);
  12016. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  12017. AddPointer(typeInfoSection, typeInfoSectionOffset);
  12018. TypeInfoSection(typeInfoSection);
  12019. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  12020. referenceSection.SetExported(TRUE);
  12021. References(referenceSection);
  12022. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  12023. ProcedureDescriptorArray(procTableSection, numberProcs);
  12024. IF ProtectModulesPointers THEN
  12025. name := "Heaps.AnyPtr";
  12026. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12027. (* set base pointer *)
  12028. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12029. END;
  12030. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12031. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12032. moduleSection := ModuleSection();
  12033. Info(moduleSection, "nextRoot*: RootObject");
  12034. Address(moduleSection,0);
  12035. Info(moduleSection, "next*: Module");
  12036. Address(moduleSection,0);
  12037. Info(moduleSection, "name*: Name");
  12038. Name(moduleSection,moduleName);
  12039. Info(moduleSection, "init, published: BOOLEAN");
  12040. Boolean(moduleSection,FALSE);
  12041. Boolean(moduleSection,FALSE);
  12042. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12043. Boolean(moduleSection,FALSE);
  12044. Boolean(moduleSection,FALSE);
  12045. Info(moduleSection, "refcnt*: LONGINT");
  12046. Longint(moduleSection,0);
  12047. Info(moduleSection, "sb*: ADDRESS");
  12048. Address(moduleSection,0);
  12049. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12050. Address(moduleSection,0);
  12051. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12052. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12053. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12054. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12055. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12056. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12057. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12058. Symbol(moduleSection,importSection,importSectionOffset,0);
  12059. Info(moduleSection, "procTable*: ProcTable");
  12060. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12061. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12062. Address(moduleSection,0);
  12063. Address(moduleSection,0);
  12064. Address(moduleSection,0);
  12065. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12066. Info(moduleSection, "export*: ExportDesc");
  12067. ExportDesc(moduleSection);
  12068. Info(moduleSection, "term*: TerminationHandler");
  12069. Address(moduleSection,0);
  12070. Info(moduleSection, "exTable*: ExceptionTable");
  12071. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12072. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12073. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12074. Info(moduleSection, "crc*: LONGINT");
  12075. patchCRC:= moduleSection.pc;
  12076. Longint(moduleSection, 0); (*! must be implemented *)
  12077. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12078. Info(moduleSection, "body*: ADDRESS");
  12079. Symbol(moduleSection, bodyProc, 0,0);
  12080. Info(moduleSection, "module flags");
  12081. flags := {};
  12082. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12083. Set( moduleSection, flags);
  12084. IF implementationVisitor.backend.cooperative THEN
  12085. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12086. Info(moduleSection, "monitor.owner");
  12087. Address(moduleSection,0);
  12088. Info(moduleSection, "monitor.nestingLevel");
  12089. Address(moduleSection,0);
  12090. Info(moduleSection, "monitor.blockedQueue");
  12091. Address(moduleSection,0); Address(moduleSection,0);
  12092. Info(moduleSection, "monitor.waitingQueue");
  12093. Address(moduleSection,0); Address(moduleSection,0);
  12094. Info(moduleSection, "monitor.waitingSentinel");
  12095. Address(moduleSection,0);
  12096. END;
  12097. END Module;
  12098. PROCEDURE PatchCRC(crc: LONGINT);
  12099. BEGIN
  12100. IF implementationVisitor.newObjectFile & ~simple THEN
  12101. PatchLongint(ModuleSection(), patchCRC, crc);
  12102. END;
  12103. END PatchCRC;
  12104. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12105. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12106. BEGIN
  12107. ArrayBlock(source,pc,"",FALSE);
  12108. Info(source, "pointer offsets array data");
  12109. IF scope IS SyntaxTree.RecordScope THEN
  12110. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12111. ELSIF scope IS SyntaxTree.CellScope THEN
  12112. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12113. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12114. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12115. WHILE variable # NIL DO
  12116. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12117. symbol := module.allSections.FindBySymbol(variable);
  12118. ASSERT(symbol # NIL);
  12119. Pointers(0,symbol, source,variable.type,numberPointers);
  12120. END;
  12121. variable := variable.nextVariable;
  12122. END;
  12123. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12124. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12125. WHILE parameter # NIL DO
  12126. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12127. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12128. END;
  12129. parameter := parameter.nextParameter;
  12130. END;
  12131. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12132. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12133. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12134. IF implementationVisitor.backend.preciseGC THEN
  12135. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12136. END;
  12137. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12138. END;
  12139. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12140. WHILE(variable # NIL) DO
  12141. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12142. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12143. END;
  12144. variable := variable.nextVariable
  12145. END;
  12146. END;
  12147. PatchArray(source,pc,numberPointers);
  12148. END PointerArray;
  12149. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12150. VAR
  12151. name: Basic.SegmentedName;
  12152. section: IntermediateCode.Section;
  12153. BEGIN
  12154. ASSERT(implementationVisitor.newObjectFile);
  12155. Global.GetSymbolSegmentedName(symbol,name);
  12156. Basic.AppendToSegmentedName(name,suffix);
  12157. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12158. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12159. Info(section, "HeapBlock");
  12160. Address(section,0); (* empty such that GC does not go on traversing *)
  12161. Info(section, suffix);
  12162. Address(section,0);
  12163. pc := section.pc;
  12164. RETURN section;
  12165. END SymbolSection;
  12166. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12167. VAR recordType: SyntaxTree.RecordType;
  12168. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12169. section: Sections.Section; cellType: SyntaxTree.CellType;
  12170. tdInfoOffset: LONGINT;
  12171. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12172. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12173. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12174. sectionName: Basic.SectionName;
  12175. CONST MPO=-40000000H;
  12176. BEGIN
  12177. (*
  12178. TypeDesc* = POINTER TO RECORD
  12179. descSize: SIZE;
  12180. sentinel: LONGINT; (* = MPO-4 *)
  12181. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12182. flags*: SET;
  12183. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12184. name*: Name;
  12185. refsOffset: SIZE;
  12186. END;
  12187. *)
  12188. (* source := module.sections.FindByName(...) *)
  12189. Global.GetSymbolSegmentedName(td,name);
  12190. Basic.AppendToSegmentedName(name,".@Info");
  12191. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12192. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12193. Address(source,0);
  12194. Info(source, "TypeDescriptor");
  12195. Address(source,0);
  12196. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12197. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12198. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12199. Info(source, "type tag pointer");
  12200. Symbol( source, tag, offset, 0);
  12201. Info(source, "type flags");
  12202. flags := {};
  12203. IF isProtected THEN INCL(flags,31) END;
  12204. Set( source, flags);
  12205. Info(source, "pointer to module");
  12206. moduleSection := ModuleSection();
  12207. Symbol( source, moduleSection, moduleSection.pc,0);
  12208. Info(source, "type name");
  12209. i := 0;
  12210. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12211. (*
  12212. Global.GetSymbolSegmentedName(td,name);
  12213. Basic.SegmentedNameToString(name, sectionName);
  12214. *)
  12215. Name(source,sectionName);
  12216. Size(source, 0);
  12217. RETURN source;
  12218. END NewTypeDescriptorInfo;
  12219. PROCEDURE NewTypeDescriptor;
  12220. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12221. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12222. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12223. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12224. CONST MPO=-40000000H;
  12225. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12226. VAR i: LONGINT;
  12227. PROCEDURE Td(record: SyntaxTree.RecordType);
  12228. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12229. BEGIN
  12230. IF record # NIL THEN
  12231. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12232. baseTD := record.typeDeclaration;
  12233. Global.GetSymbolSegmentedName(baseTD,name);
  12234. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12235. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12236. ELSE
  12237. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12238. END;
  12239. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12240. Symbol(source, tir, 0, offset);
  12241. IF reverse THEN Td(record.GetBaseRecord()) END;
  12242. END;
  12243. END Td;
  12244. BEGIN
  12245. Info(source, "tag table");
  12246. baseRecord := recordType;
  12247. i := 0;
  12248. WHILE baseRecord # NIL DO
  12249. INC(i);
  12250. baseRecord := baseRecord.GetBaseRecord();
  12251. END;
  12252. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12253. IF ~reverse THEN Td(recordType) END;
  12254. WHILE i < size DO
  12255. Address(source,0);
  12256. INC(i);
  12257. END;
  12258. IF reverse THEN Td(recordType) END;
  12259. END TdTable;
  12260. PROCEDURE MethodTable(reverse: BOOLEAN);
  12261. VAR i,methods: LONGINT;
  12262. BEGIN
  12263. Info(source, "method table");
  12264. IF recordType # NIL THEN
  12265. methods := recordType.recordScope.numberMethods;
  12266. IF reverse THEN
  12267. FOR i := methods-1 TO 0 BY -1 DO
  12268. procedure := recordType.recordScope.FindMethod(i);
  12269. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12270. NamedSymbol(source, name,procedure, 0,0);
  12271. END;
  12272. ELSE
  12273. FOR i := 0 TO methods-1 DO
  12274. procedure := recordType.recordScope.FindMethod(i);
  12275. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12276. NamedSymbol(source, name,procedure, 0,0);
  12277. END;
  12278. END;
  12279. END;
  12280. END MethodTable;
  12281. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12282. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12283. BEGIN
  12284. Info(source, "method table");
  12285. baseRecord := recordType;
  12286. WHILE baseRecord.baseType # NIL DO
  12287. baseRecord := baseRecord.GetBaseRecord ();
  12288. END;
  12289. GetRecordTypeName (baseRecord, name);
  12290. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12291. IF name = stackFrame THEN
  12292. start := 0;
  12293. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12294. baseRecord := recordType;
  12295. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12296. baseRecord := baseRecord.GetBaseRecord ();
  12297. END;
  12298. IF baseRecord # NIL THEN
  12299. GetRecordTypeName (baseRecord, name);
  12300. IF pointer & ~baseRecord.isObject THEN
  12301. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12302. END;
  12303. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12304. ELSIF recordType.isObject THEN
  12305. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12306. ELSIF pointer THEN
  12307. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12308. ELSE
  12309. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12310. END;
  12311. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12312. Symbol(source, tir, 0, 0);
  12313. start := 0;
  12314. baseRecord := recordType;
  12315. WHILE (baseRecord # NIL) DO
  12316. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12317. baseRecord := baseRecord.GetBaseRecord ();
  12318. END;
  12319. ELSE
  12320. (* explicit trace method: *)
  12321. procedure := recordType.recordScope.FindMethod(0);
  12322. IF ~procedure.isFinalizer THEN
  12323. Global.GetSymbolSegmentedName(procedure, name);
  12324. NamedSymbol(source, name,procedure, 0,0);
  12325. END;
  12326. start := 1;
  12327. END;
  12328. IF (name # stackFrame) & recordType.isObject THEN
  12329. baseRecord := recordType;
  12330. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12331. baseRecord := baseRecord.GetBaseRecord ();
  12332. END;
  12333. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12334. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12335. ELSE
  12336. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12337. END;
  12338. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12339. Symbol(source, tir, 0, 0);
  12340. END;
  12341. methods := recordType.recordScope.numberMethods;
  12342. FOR i := start TO methods-1 DO
  12343. procedure := recordType.recordScope.FindMethod(i);
  12344. IF ~procedure.isFinalizer THEN
  12345. Global.GetSymbolSegmentedName(procedure, name);
  12346. NamedSymbol(source, name,procedure, 0,0);
  12347. END;
  12348. END;
  12349. END CooperativeMethodTable;
  12350. BEGIN
  12351. Global.GetSymbolSegmentedName(td,name);
  12352. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12353. source.SetExported(IsExported(td));
  12354. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12355. IF implementationVisitor.backend.cooperative THEN
  12356. base := NIL;
  12357. baseRecord := recordType.GetBaseRecord();
  12358. IF baseRecord # NIL THEN
  12359. baseTD := baseRecord.typeDeclaration;
  12360. END;
  12361. IF ~recordType.isObject THEN
  12362. Info(source, "parent");
  12363. IF baseRecord # NIL THEN
  12364. Global.GetSymbolSegmentedName(baseTD,name);
  12365. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12366. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12367. ELSE
  12368. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12369. END;
  12370. Symbol(source, tir, 0, 0);
  12371. ELSE
  12372. Address(source,0);
  12373. END;
  12374. Info(source, "record size");
  12375. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12376. CooperativeMethodTable(FALSE);
  12377. base := source;
  12378. Global.GetSymbolSegmentedName(td,name);
  12379. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12380. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12381. source.SetExported(IsExported(td));
  12382. END;
  12383. Info(source, "parent");
  12384. IF baseRecord # NIL THEN
  12385. Global.GetSymbolSegmentedName(baseTD,name);
  12386. sym := baseTD;
  12387. IF ~recordType.isObject THEN
  12388. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12389. sym := NIL;
  12390. END;
  12391. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12392. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12393. ELSE
  12394. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12395. END;
  12396. Symbol(source, tir, 0, 0);
  12397. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12398. Address(source,0);
  12399. ELSE
  12400. IF recordType.isObject THEN
  12401. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12402. ELSE
  12403. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12404. END;
  12405. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12406. Symbol(source, tir, 0, 0);
  12407. END;
  12408. Info(source, "base record descriptor");
  12409. Symbol(source, base, 0, 0);
  12410. CooperativeMethodTable(TRUE);
  12411. IF recordType.hasPointers THEN
  12412. IF ~HasExplicitTraceMethod (recordType) THEN
  12413. implementationVisitor.CreateTraceMethod(recordType);
  12414. END;
  12415. implementationVisitor.CreateResetProcedure(recordType);
  12416. implementationVisitor.CreateAssignProcedure(recordType);
  12417. END;
  12418. ELSIF ~simple THEN
  12419. (*
  12420. MethodEnd = MPO
  12421. ---
  12422. methods (# methods)
  12423. ---
  12424. tags (16)
  12425. ---
  12426. TypeDesc = TypeInfoAdr
  12427. ---
  12428. td adr ---> rec size
  12429. ----
  12430. pointer offsets
  12431. ----
  12432. (padding)
  12433. -----
  12434. empty [2 addresses aligned]
  12435. empty
  12436. empty
  12437. numPtrs
  12438. ---
  12439. pointer offsets
  12440. ---
  12441. *)
  12442. Info(source, "MethodEnd = MPO");
  12443. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12444. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12445. MethodTable(TRUE);
  12446. TdTable(TypeTags, TRUE);
  12447. Info(source, "type descriptor info pointer");
  12448. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12449. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12450. IF (cellType # NIL) THEN
  12451. IF cellType.sizeInBits < 0 THEN
  12452. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12453. END;
  12454. Info(source, "cell size");
  12455. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12456. ELSE
  12457. Info(source, "record size");
  12458. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12459. END;
  12460. Info(source, "pointer offsets pointer");
  12461. padding := 1- source.pc MOD 2;
  12462. Symbol(source, source, source.pc+1+padding,0);
  12463. IF padding >0 THEN
  12464. Info(source, "padding");
  12465. FOR i := 1 TO padding DO Address(source,0) END;
  12466. END;
  12467. IF cellType # NIL THEN
  12468. PointerArray(source, cellType.cellScope, numberPointers);
  12469. ELSE
  12470. PointerArray(source, recordType.recordScope, numberPointers);
  12471. END;
  12472. ELSE
  12473. (*
  12474. simple:
  12475. td adr --> size
  12476. tag(1)
  12477. tag(2)
  12478. tag(3)
  12479. methods ->
  12480. *)
  12481. Info(source, "record size");
  12482. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12483. TdTable(TypeTags, FALSE);
  12484. MethodTable(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; callingConvention: SyntaxTree.CallingConvention): 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) & (callingConvention IN SysvABIorWINAPI)
  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) & (callingConvention IN SysvABIorWINAPI)
  12752. END
  12753. END PassBySingleReference;
  12754. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12755. BEGIN
  12756. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  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 procedureType.callingConvention IN SysvABIorWINAPI 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. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  13128. END ProcedureParametersSize;
  13129. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13130. VAR dataUnit: LONGINT;
  13131. BEGIN dataUnit := system.dataUnit;
  13132. ASSERT(size MOD system.dataUnit = 0);
  13133. RETURN LONGINT(size DIV system.dataUnit)
  13134. END ToMemoryUnits;
  13135. PROCEDURE Get*(): Backend.Backend;
  13136. VAR backend: IntermediateBackend;
  13137. BEGIN NEW(backend); RETURN backend
  13138. END Get;
  13139. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13140. VAR instruction: IntermediateCode.Instruction;
  13141. BEGIN
  13142. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13143. RETURN instruction
  13144. END Nop;
  13145. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13146. VAR instruction: IntermediateCode.Instruction;
  13147. BEGIN
  13148. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13149. RETURN instruction
  13150. END Mov;
  13151. (* like Mov but ensures that no new register will be allocated for dest *)
  13152. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13153. VAR instruction: IntermediateCode.Instruction;
  13154. BEGIN
  13155. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13156. RETURN instruction
  13157. END MovReplace;
  13158. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13159. VAR instruction: IntermediateCode.Instruction;
  13160. BEGIN
  13161. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13162. RETURN instruction
  13163. END Conv;
  13164. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13165. VAR instruction: IntermediateCode.Instruction;
  13166. BEGIN
  13167. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13168. RETURN instruction
  13169. END Call;
  13170. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13171. VAR op1, op2, op3: IntermediateCode.Operand;
  13172. VAR instruction: IntermediateCode.Instruction;
  13173. BEGIN
  13174. IntermediateCode.InitNumber(op1,pcOffset);
  13175. IntermediateCode.InitNumber(op2,callingConvention);
  13176. IntermediateCode.InitNumber(op3,unwind);
  13177. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13178. RETURN instruction
  13179. END Exit;
  13180. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13181. VAR instruction: IntermediateCode.Instruction;
  13182. BEGIN
  13183. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13184. RETURN instruction
  13185. END Return;
  13186. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13187. VAR instruction: IntermediateCode.Instruction;
  13188. BEGIN
  13189. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13190. RETURN instruction
  13191. END Result;
  13192. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13193. VAR op1: IntermediateCode.Operand;
  13194. VAR instruction: IntermediateCode.Instruction;
  13195. BEGIN
  13196. IntermediateCode.InitNumber(op1,nr);
  13197. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13198. RETURN instruction
  13199. END Trap;
  13200. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13201. VAR instruction: IntermediateCode.Instruction;
  13202. BEGIN
  13203. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13204. RETURN instruction
  13205. END Br;
  13206. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13207. VAR instruction: IntermediateCode.Instruction;
  13208. BEGIN
  13209. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13210. RETURN instruction
  13211. END Breq;
  13212. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13213. VAR instruction: IntermediateCode.Instruction;
  13214. BEGIN
  13215. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13216. RETURN instruction
  13217. END Brne;
  13218. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13219. VAR instruction: IntermediateCode.Instruction;
  13220. BEGIN
  13221. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13222. RETURN instruction
  13223. END Brge;
  13224. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13225. VAR instruction: IntermediateCode.Instruction;
  13226. BEGIN
  13227. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13228. RETURN instruction
  13229. END Brlt;
  13230. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13231. VAR instruction: IntermediateCode.Instruction;
  13232. BEGIN
  13233. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13234. RETURN instruction
  13235. END Pop;
  13236. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13237. VAR instruction: IntermediateCode.Instruction;
  13238. BEGIN
  13239. ASSERT(op.mode # IntermediateCode.Undefined);
  13240. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13241. RETURN instruction
  13242. END Push;
  13243. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13244. VAR instruction: IntermediateCode.Instruction;
  13245. BEGIN
  13246. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13247. RETURN instruction
  13248. END Neg;
  13249. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13250. VAR instruction: IntermediateCode.Instruction;
  13251. BEGIN
  13252. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13253. RETURN instruction
  13254. END Not;
  13255. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13256. VAR instruction: IntermediateCode.Instruction;
  13257. BEGIN
  13258. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13259. RETURN instruction
  13260. END Abs;
  13261. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13262. VAR instruction: IntermediateCode.Instruction;
  13263. BEGIN
  13264. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13265. ASSERT(~IsImmediate(instruction.op1));
  13266. RETURN instruction
  13267. END Mul;
  13268. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13269. VAR instruction: IntermediateCode.Instruction;
  13270. BEGIN
  13271. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13272. RETURN instruction
  13273. END Div;
  13274. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13275. VAR instruction: IntermediateCode.Instruction;
  13276. BEGIN
  13277. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13278. RETURN instruction
  13279. END Mod;
  13280. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13281. VAR instruction: IntermediateCode.Instruction;
  13282. BEGIN
  13283. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13284. RETURN instruction
  13285. END Sub;
  13286. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13287. VAR instruction: IntermediateCode.Instruction;
  13288. BEGIN
  13289. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13290. RETURN instruction
  13291. END Add;
  13292. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13293. VAR instruction: IntermediateCode.Instruction;
  13294. BEGIN
  13295. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13296. RETURN instruction
  13297. END And;
  13298. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13299. VAR instruction: IntermediateCode.Instruction;
  13300. BEGIN
  13301. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13302. RETURN instruction
  13303. END Or;
  13304. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13305. VAR instruction: IntermediateCode.Instruction;
  13306. BEGIN
  13307. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13308. RETURN instruction
  13309. END Xor;
  13310. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13311. VAR instruction: IntermediateCode.Instruction;
  13312. BEGIN
  13313. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13314. RETURN instruction
  13315. END Shl;
  13316. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13317. VAR instruction: IntermediateCode.Instruction;
  13318. BEGIN
  13319. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13320. RETURN instruction
  13321. END Shr;
  13322. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13323. VAR instruction: IntermediateCode.Instruction;
  13324. BEGIN
  13325. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13326. RETURN instruction
  13327. END Rol;
  13328. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13329. VAR instruction: IntermediateCode.Instruction;
  13330. BEGIN
  13331. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13332. RETURN instruction
  13333. END Ror;
  13334. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13335. VAR instruction: IntermediateCode.Instruction;
  13336. BEGIN
  13337. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13338. RETURN instruction
  13339. END Cas;
  13340. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13341. VAR instruction: IntermediateCode.Instruction;
  13342. BEGIN
  13343. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13344. RETURN instruction
  13345. END Copy;
  13346. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13347. VAR instruction: IntermediateCode.Instruction;
  13348. BEGIN
  13349. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13350. RETURN instruction
  13351. END Fill;
  13352. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13353. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13354. BEGIN
  13355. string := IntermediateCode.String(s);
  13356. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13357. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13358. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13359. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13360. RETURN instruction
  13361. END Asm;
  13362. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13363. VAR instruction: IntermediateCode.Instruction;
  13364. BEGIN
  13365. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13366. RETURN instruction
  13367. END Data;
  13368. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13369. VAR instruction: IntermediateCode.Instruction;
  13370. BEGIN
  13371. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13372. IntermediateCode.SetSubType(instruction, subtype);
  13373. RETURN instruction
  13374. END SpecialInstruction;
  13375. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13376. VAR op1: IntermediateCode.Operand;
  13377. VAR instruction: IntermediateCode.Instruction;
  13378. BEGIN
  13379. (*! generate a warning if size exceeds a certain limit *)
  13380. (*
  13381. ASSERT(bytes < 1000000); (* sanity check *)
  13382. *)
  13383. ASSERT(0 <= units); (* sanity check *)
  13384. IntermediateCode.InitNumber(op1,units);
  13385. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13386. RETURN instruction
  13387. END Reserve;
  13388. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13389. VAR op1: IntermediateCode.Operand;
  13390. VAR instruction: IntermediateCode.Instruction;
  13391. BEGIN
  13392. IntermediateCode.InitNumber(op1,position.start);
  13393. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13394. RETURN instruction
  13395. END LabelInstruction;
  13396. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13397. VAR pc: LONGINT;
  13398. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13399. BEGIN
  13400. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13401. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13402. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13403. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13404. IF instr.op1.type.form = IntermediateCode.Float THEN
  13405. RETURN instr.op1.floatValue = op.floatValue
  13406. ELSE
  13407. RETURN instr.op1.intValue = op.intValue
  13408. END;
  13409. END ProvidesValue;
  13410. BEGIN
  13411. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13412. pc := 0;
  13413. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13414. INC(pc);
  13415. END;
  13416. IF pc = data.pc THEN
  13417. data.Emit(Data(Basic.invalidPosition,vop));
  13418. END;
  13419. RETURN pc
  13420. END EnterImmediate;
  13421. PROCEDURE Init;
  13422. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13423. BEGIN
  13424. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13425. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13426. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13427. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13428. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13429. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13430. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13431. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13432. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13433. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13434. IntermediateCode.InitOperand(emptyOperand);
  13435. FOR i := 0 TO NumberSystemCalls-1 DO
  13436. name := "@SystemCall";
  13437. Basic.AppendNumber(name,i);
  13438. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13439. END;
  13440. END Init;
  13441. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13442. BEGIN
  13443. RETURN (symbol # NIL) & symbol.NeedsSection();
  13444. END IsExported;
  13445. BEGIN
  13446. Init;
  13447. END FoxIntermediateBackend.
  13448. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  13449. # Release.Build --path="/temp/obg/" Win32 ~
  13450. # Linker.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 Loader BootConsole ~
  13451. FStols.CloseFiles A2Z.exe ~
  13452. SystemTools.FreeDownTo FoxIntermediateBackend ~
  13453. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  13454. Runtime.Mod Trace.Mod Win32.Kernel32.Mod Win32.Machine.Mod Heaps.Mod
  13455. Modules.Mod Win32.Objects.Mod Win32.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13456. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13457. Win32.Traps.Mod Locks.Mod Win32.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13458. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13459. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Win32.User32.Mod
  13460. Win32.WinTrace.Mod Win32.ODBC.Mod Win32.Shell32.Mod Win32.SQL.Mod Win32.WinFS.Mod
  13461. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13462. GenericLinker.Mod Loader.Mod BootConsole.Mod