FoxIntermediateBackend.Mod 576 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772107731077410775107761077710778107791078010781107821078310784107851078610787107881078910790107911079210793107941079510796107971079810799108001080110802108031080410805108061080710808108091081010811108121081310814108151081610817108181081910820108211082210823108241082510826108271082810829108301083110832108331083410835108361083710838108391084010841108421084310844108451084610847108481084910850108511085210853108541085510856108571085810859108601086110862108631086410865108661086710868108691087010871108721087310874108751087610877108781087910880108811088210883108841088510886108871088810889108901089110892108931089410895108961089710898108991090010901109021090310904109051090610907109081090910910109111091210913109141091510916109171091810919109201092110922109231092410925109261092710928109291093010931109321093310934109351093610937109381093910940109411094210943109441094510946109471094810949109501095110952109531095410955109561095710958109591096010961109621096310964109651096610967109681096910970109711097210973109741097510976109771097810979109801098110982109831098410985109861098710988109891099010991109921099310994109951099610997109981099911000110011100211003110041100511006110071100811009110101101111012110131101411015110161101711018110191102011021110221102311024110251102611027110281102911030110311103211033110341103511036110371103811039110401104111042110431104411045110461104711048110491105011051110521105311054110551105611057110581105911060110611106211063110641106511066110671106811069110701107111072110731107411075110761107711078110791108011081110821108311084110851108611087110881108911090110911109211093110941109511096110971109811099111001110111102111031110411105111061110711108111091111011111111121111311114111151111611117111181111911120111211112211123111241112511126111271112811129111301113111132111331113411135111361113711138111391114011141111421114311144111451114611147111481114911150111511115211153111541115511156111571115811159111601116111162111631116411165111661116711168111691117011171111721117311174111751117611177111781117911180111811118211183111841118511186111871118811189111901119111192111931119411195111961119711198111991120011201112021120311204112051120611207112081120911210112111121211213112141121511216112171121811219112201122111222112231122411225112261122711228112291123011231112321123311234112351123611237112381123911240112411124211243112441124511246112471124811249112501125111252112531125411255112561125711258112591126011261112621126311264112651126611267112681126911270112711127211273112741127511276112771127811279112801128111282112831128411285112861128711288112891129011291112921129311294112951129611297112981129911300113011130211303113041130511306113071130811309113101131111312113131131411315113161131711318113191132011321113221132311324113251132611327113281132911330113311133211333113341133511336113371133811339113401134111342113431134411345113461134711348113491135011351113521135311354113551135611357113581135911360113611136211363113641136511366113671136811369113701137111372113731137411375113761137711378113791138011381113821138311384113851138611387113881138911390113911139211393113941139511396113971139811399114001140111402114031140411405114061140711408114091141011411114121141311414114151141611417114181141911420114211142211423114241142511426114271142811429114301143111432114331143411435114361143711438114391144011441114421144311444114451144611447114481144911450114511145211453114541145511456114571145811459114601146111462114631146411465114661146711468114691147011471114721147311474114751147611477114781147911480114811148211483114841148511486114871148811489114901149111492114931149411495114961149711498114991150011501115021150311504115051150611507115081150911510115111151211513115141151511516115171151811519115201152111522115231152411525115261152711528115291153011531115321153311534115351153611537115381153911540115411154211543115441154511546115471154811549115501155111552115531155411555115561155711558115591156011561115621156311564115651156611567115681156911570115711157211573115741157511576115771157811579115801158111582115831158411585115861158711588115891159011591115921159311594115951159611597115981159911600116011160211603116041160511606116071160811609116101161111612116131161411615116161161711618116191162011621116221162311624116251162611627116281162911630116311163211633116341163511636116371163811639116401164111642116431164411645116461164711648116491165011651116521165311654116551165611657116581165911660116611166211663116641166511666116671166811669116701167111672116731167411675116761167711678116791168011681116821168311684116851168611687116881168911690116911169211693116941169511696116971169811699117001170111702117031170411705117061170711708117091171011711117121171311714117151171611717117181171911720117211172211723117241172511726117271172811729117301173111732117331173411735117361173711738117391174011741117421174311744117451174611747117481174911750117511175211753117541175511756117571175811759117601176111762117631176411765117661176711768117691177011771117721177311774117751177611777117781177911780117811178211783117841178511786117871178811789117901179111792117931179411795117961179711798117991180011801118021180311804118051180611807118081180911810118111181211813118141181511816118171181811819118201182111822118231182411825118261182711828118291183011831118321183311834118351183611837118381183911840118411184211843118441184511846118471184811849118501185111852118531185411855118561185711858118591186011861118621186311864118651186611867118681186911870118711187211873118741187511876118771187811879118801188111882118831188411885118861188711888118891189011891118921189311894118951189611897118981189911900119011190211903119041190511906119071190811909119101191111912119131191411915119161191711918119191192011921119221192311924119251192611927119281192911930119311193211933119341193511936119371193811939119401194111942119431194411945119461194711948119491195011951119521195311954119551195611957119581195911960119611196211963119641196511966119671196811969119701197111972119731197411975119761197711978119791198011981119821198311984119851198611987119881198911990119911199211993119941199511996119971199811999120001200112002120031200412005120061200712008120091201012011120121201312014120151201612017120181201912020120211202212023120241202512026120271202812029120301203112032120331203412035120361203712038120391204012041120421204312044120451204612047120481204912050120511205212053120541205512056120571205812059120601206112062120631206412065120661206712068120691207012071120721207312074120751207612077120781207912080120811208212083120841208512086120871208812089120901209112092120931209412095120961209712098120991210012101121021210312104121051210612107121081210912110121111211212113121141211512116121171211812119121201212112122121231212412125121261212712128121291213012131121321213312134121351213612137121381213912140121411214212143121441214512146121471214812149121501215112152121531215412155121561215712158121591216012161121621216312164121651216612167121681216912170121711217212173121741217512176121771217812179121801218112182121831218412185121861218712188121891219012191121921219312194121951219612197121981219912200122011220212203122041220512206122071220812209122101221112212122131221412215122161221712218122191222012221122221222312224122251222612227122281222912230122311223212233122341223512236122371223812239122401224112242122431224412245122461224712248122491225012251122521225312254122551225612257122581225912260122611226212263122641226512266122671226812269122701227112272122731227412275122761227712278122791228012281122821228312284122851228612287122881228912290122911229212293122941229512296122971229812299123001230112302123031230412305123061230712308123091231012311123121231312314123151231612317123181231912320123211232212323123241232512326123271232812329123301233112332123331233412335123361233712338123391234012341123421234312344123451234612347123481234912350123511235212353123541235512356123571235812359123601236112362123631236412365123661236712368123691237012371123721237312374123751237612377123781237912380123811238212383123841238512386123871238812389123901239112392123931239412395123961239712398123991240012401124021240312404124051240612407124081240912410124111241212413124141241512416124171241812419124201242112422124231242412425124261242712428124291243012431124321243312434124351243612437124381243912440124411244212443124441244512446124471244812449124501245112452124531245412455124561245712458124591246012461124621246312464124651246612467124681246912470124711247212473124741247512476124771247812479124801248112482124831248412485124861248712488124891249012491124921249312494124951249612497124981249912500125011250212503125041250512506125071250812509125101251112512125131251412515125161251712518125191252012521125221252312524125251252612527125281252912530125311253212533125341253512536125371253812539125401254112542125431254412545125461254712548125491255012551125521255312554125551255612557125581255912560125611256212563125641256512566125671256812569125701257112572125731257412575125761257712578125791258012581125821258312584125851258612587125881258912590125911259212593125941259512596125971259812599126001260112602126031260412605126061260712608126091261012611126121261312614126151261612617126181261912620126211262212623126241262512626126271262812629126301263112632126331263412635126361263712638126391264012641126421264312644126451264612647126481264912650126511265212653126541265512656126571265812659126601266112662126631266412665126661266712668126691267012671126721267312674126751267612677126781267912680126811268212683126841268512686126871268812689126901269112692126931269412695126961269712698126991270012701127021270312704127051270612707127081270912710127111271212713127141271512716127171271812719127201272112722127231272412725127261272712728127291273012731127321273312734127351273612737127381273912740127411274212743127441274512746127471274812749127501275112752127531275412755127561275712758127591276012761127621276312764127651276612767127681276912770127711277212773127741277512776127771277812779127801278112782127831278412785127861278712788127891279012791127921279312794127951279612797127981279912800128011280212803128041280512806128071280812809128101281112812128131281412815128161281712818128191282012821128221282312824128251282612827128281282912830128311283212833128341283512836128371283812839128401284112842128431284412845128461284712848128491285012851128521285312854128551285612857128581285912860128611286212863128641286512866128671286812869128701287112872128731287412875128761287712878128791288012881128821288312884128851288612887128881288912890128911289212893128941289512896128971289812899129001290112902129031290412905129061290712908129091291012911129121291312914129151291612917129181291912920129211292212923129241292512926129271292812929129301293112932129331293412935129361293712938129391294012941129421294312944129451294612947129481294912950129511295212953129541295512956129571295812959129601296112962129631296412965129661296712968129691297012971129721297312974129751297612977129781297912980129811298212983129841298512986129871298812989129901299112992129931299412995129961299712998129991300013001130021300313004130051300613007130081300913010130111301213013130141301513016130171301813019130201302113022130231302413025130261302713028130291303013031130321303313034130351303613037130381303913040130411304213043130441304513046130471304813049130501305113052130531305413055130561305713058130591306013061130621306313064130651306613067130681306913070130711307213073130741307513076130771307813079130801308113082130831308413085130861308713088130891309013091130921309313094130951309613097130981309913100131011310213103131041310513106131071310813109131101311113112131131311413115131161311713118131191312013121131221312313124131251312613127131281312913130131311313213133131341313513136131371313813139131401314113142131431314413145131461314713148131491315013151131521315313154131551315613157131581315913160131611316213163131641316513166131671316813169131701317113172131731317413175131761317713178131791318013181131821318313184131851318613187131881318913190131911319213193131941319513196131971319813199132001320113202132031320413205132061320713208132091321013211132121321313214132151321613217132181321913220132211322213223132241322513226132271322813229132301323113232132331323413235132361323713238132391324013241132421324313244132451324613247132481324913250132511325213253132541325513256132571325813259132601326113262132631326413265132661326713268132691327013271132721327313274132751327613277132781327913280132811328213283132841328513286132871328813289132901329113292132931329413295132961329713298132991330013301133021330313304133051330613307133081330913310133111331213313133141331513316133171331813319133201332113322133231332413325133261332713328133291333013331133321333313334133351333613337133381333913340133411334213343133441334513346133471334813349133501335113352133531335413355133561335713358133591336013361133621336313364133651336613367133681336913370133711337213373133741337513376133771337813379133801338113382133831338413385133861338713388133891339013391133921339313394133951339613397133981339913400134011340213403134041340513406134071340813409134101341113412134131341413415134161341713418134191342013421134221342313424134251342613427134281342913430134311343213433134341343513436134371343813439134401344113442134431344413445134461344713448134491345013451134521345313454134551345613457134581345913460134611346213463134641346513466134671346813469134701347113472134731347413475134761347713478134791348013481134821348313484134851348613487134881348913490134911349213493134941349513496134971349813499135001350113502135031350413505135061350713508135091351013511135121351313514135151351613517135181351913520135211352213523135241352513526135271352813529135301353113532135331353413535135361353713538135391354013541135421354313544135451354613547135481354913550135511355213553135541355513556135571355813559135601356113562135631356413565135661356713568135691357013571135721357313574135751357613577135781357913580135811358213583135841358513586135871358813589135901359113592135931359413595135961359713598135991360013601136021360313604136051360613607136081360913610136111361213613136141361513616136171361813619136201362113622136231362413625136261362713628136291363013631136321363313634136351363613637136381363913640136411364213643136441364513646136471364813649136501365113652136531365413655136561365713658136591366013661136621366313664136651366613667136681366913670136711367213673136741367513676136771367813679136801368113682136831368413685136861368713688136891369013691136921369313694136951369613697136981369913700137011370213703137041370513706137071370813709137101371113712137131371413715137161371713718137191372013721137221372313724137251372613727137281372913730137311373213733137341373513736137371373813739137401374113742137431374413745137461374713748137491375013751137521375313754137551375613757137581375913760137611376213763137641376513766137671376813769137701377113772137731377413775137761377713778137791378013781137821378313784137851378613787137881378913790137911379213793137941379513796137971379813799138001380113802138031380413805138061380713808138091381013811138121381313814138151381613817138181381913820138211382213823138241382513826138271382813829138301383113832138331383413835138361383713838138391384013841138421384313844138451384613847138481384913850138511385213853138541385513856138571385813859138601386113862138631386413865138661386713868138691387013871138721387313874138751387613877138781387913880138811388213883138841388513886138871388813889138901389113892138931389413895138961389713898138991390013901139021390313904139051390613907139081390913910139111391213913139141391513916139171391813919139201392113922139231392413925139261392713928139291393013931139321393313934139351393613937139381393913940139411394213943139441394513946139471394813949139501395113952139531395413955139561395713958139591396013961139621396313964139651396613967139681396913970139711397213973139741397513976139771397813979139801398113982139831398413985139861398713988139891399013991139921399313994139951399613997139981399914000140011400214003140041400514006140071400814009140101401114012140131401414015140161401714018140191402014021140221402314024140251402614027140281402914030140311403214033140341403514036140371403814039140401404114042140431404414045140461404714048140491405014051140521405314054140551405614057140581405914060140611406214063140641406514066140671406814069140701407114072140731407414075140761407714078140791408014081140821408314084140851408614087140881408914090140911409214093140941409514096140971409814099141001410114102141031410414105141061410714108141091411014111141121411314114141151411614117141181411914120141211412214123141241412514126141271412814129141301413114132141331413414135141361413714138141391414014141141421414314144141451414614147141481414914150141511415214153141541415514156141571415814159141601416114162141631416414165141661416714168141691417014171141721417314174141751417614177141781417914180141811418214183141841418514186141871418814189141901419114192141931419414195141961419714198141991420014201142021420314204142051420614207142081420914210142111421214213142141421514216142171421814219142201422114222142231422414225142261422714228142291423014231142321423314234142351423614237142381423914240142411424214243142441424514246142471424814249142501425114252142531425414255142561425714258142591426014261142621426314264142651426614267142681426914270142711427214273142741427514276142771427814279142801428114282142831428414285142861428714288142891429014291142921429314294142951429614297142981429914300143011430214303143041430514306143071430814309143101431114312143131431414315143161431714318143191432014321143221432314324143251432614327143281432914330143311433214333143341433514336143371433814339143401434114342143431434414345143461434714348143491435014351143521435314354143551435614357143581435914360143611436214363143641436514366143671436814369143701437114372143731437414375143761437714378143791438014381143821438314384143851438614387143881438914390143911439214393143941439514396143971439814399144001440114402144031440414405144061440714408144091441014411144121441314414144151441614417144181441914420144211442214423144241442514426144271442814429144301443114432144331443414435144361443714438144391444014441144421444314444144451444614447144481444914450144511445214453144541445514456144571445814459144601446114462144631446414465144661446714468144691447014471144721447314474144751447614477144781447914480144811448214483144841448514486144871448814489144901449114492144931449414495144961449714498144991450014501145021450314504145051450614507145081450914510145111451214513145141451514516145171451814519145201452114522145231452414525145261452714528145291453014531145321453314534145351453614537145381453914540145411454214543145441454514546145471454814549145501455114552145531455414555145561455714558145591456014561145621456314564145651456614567145681456914570145711457214573145741457514576145771457814579145801458114582145831458414585145861458714588145891459014591145921459314594145951459614597145981459914600146011460214603146041460514606146071460814609146101461114612146131461414615146161461714618146191462014621146221462314624146251462614627146281462914630146311463214633146341463514636146371463814639146401464114642146431464414645146461464714648146491465014651146521465314654146551465614657146581465914660146611466214663146641466514666146671466814669146701467114672146731467414675146761467714678146791468014681146821468314684146851468614687146881468914690146911469214693146941469514696146971469814699147001470114702147031470414705147061470714708147091471014711147121471314714147151471614717147181471914720147211472214723147241472514726147271472814729147301473114732147331473414735147361473714738147391474014741147421474314744147451474614747147481474914750
  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. Trace = FALSE;
  42. TraceRegisterUsageCount=TRUE;
  43. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  44. (** system call numbers *)
  45. NumberSystemCalls* = 12;
  46. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  47. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  48. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  49. DefaultRuntimeModuleName ="Runtime";
  50. DefaultTraceModuleName ="KernelLog";
  51. ChannelModuleName = "Channels";
  52. NonPointer = -1; (* special pointer values *)
  53. NoType = 0; (* special type info values *)
  54. LhsIsPointer = 0; (* for the operator kind *)
  55. RhsIsPointer = 1;
  56. (* priority values, lower means higher priority *)
  57. EntryPriority=-4;
  58. FirstPriority=-3;
  59. InitPriority=-2;
  60. ExitPriority=-1;
  61. BasePointerTypeSize = 5;
  62. BaseArrayTypeSize = BasePointerTypeSize + 3;
  63. LengthOffset = BasePointerTypeSize + 0;
  64. DataOffset = BasePointerTypeSize + 1;
  65. DescriptorOffset = BasePointerTypeSize + 2;
  66. BaseRecordTypeSize = BasePointerTypeSize + 2;
  67. ActionOffset = BasePointerTypeSize + 0;
  68. MonitorOffset = BasePointerTypeSize + 1;
  69. BaseObjectTypeSize = BaseRecordTypeSize;
  70. ActionTypeSize = 3;
  71. MonitorTypeSize = 7;
  72. ProcessorOffset = BaseObjectTypeSize + 1;
  73. StackLimitOffset* = BaseObjectTypeSize + 3;
  74. QuantumOffset = BaseObjectTypeSize + 4;
  75. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  76. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  77. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  78. Size2Flag = 4; (* size = 2 *)
  79. Size3Flag = 5; (* size = 3 *)
  80. Size4Flag = 6; (* size = 4 *)
  81. Size5Flag = 7; (* size = 5 *)
  82. Size6Flag = 8; (* size = 6 *)
  83. Size7Flag = 9; (* size = 7 *)
  84. Size8Flag = 10; (* size = 8 *)
  85. ReflectionSupport = TRUE;
  86. (* 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:
  87. 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
  88. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  89. *)
  90. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  91. ProtectModulesPointers = FALSE;
  92. CreateProcedureDescInfo = TRUE;
  93. WarningDynamicLoading = FALSE;
  94. TYPE
  95. Position=SyntaxTree.Position;
  96. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  97. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  98. Operand = RECORD
  99. mode: SHORTINT;
  100. op: IntermediateCode.Operand;
  101. tag: IntermediateCode.Operand;
  102. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  103. dimOffset: LONGINT;
  104. END;
  105. Fixup= POINTER TO RECORD
  106. pc: LONGINT;
  107. nextFixup: Fixup;
  108. END;
  109. WriteBackCall = POINTER TO RECORD
  110. call: SyntaxTree.ProcedureCallDesignator;
  111. next: WriteBackCall;
  112. END;
  113. Label= OBJECT
  114. VAR
  115. fixups: Fixup;
  116. section: IntermediateCode.Section;
  117. pc: LONGINT;
  118. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  119. BEGIN
  120. SELF.section := section; pc := -1;
  121. END InitLabel;
  122. PROCEDURE Resolve(pc: LONGINT);
  123. VAR at: LONGINT;
  124. BEGIN
  125. SELF.pc := pc;
  126. WHILE(fixups # NIL) DO
  127. at := fixups.pc;
  128. section.PatchAddress(at,pc);
  129. fixups := fixups.nextFixup;
  130. END;
  131. END Resolve;
  132. PROCEDURE AddFixup(at: LONGINT);
  133. VAR fixup: Fixup;
  134. BEGIN
  135. ASSERT(pc=-1);
  136. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  137. END AddFixup;
  138. END Label;
  139. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  140. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  141. VAR
  142. backend: IntermediateBackend;
  143. implementationVisitor: ImplementationVisitor;
  144. meta: MetaDataGenerator;
  145. system: Global.System;
  146. currentScope: SyntaxTree.Scope;
  147. module: Sections.Module;
  148. moduleSelf: SyntaxTree.Variable;
  149. dump: BOOLEAN;
  150. forceModuleBody: BOOLEAN;
  151. addressType: IntermediateCode.Type;
  152. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  153. BEGIN
  154. currentScope := NIL; module := NIL; moduleSelf := NIL;
  155. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  156. SELF.dump := dump;
  157. SELF.backend := backend;
  158. SELF.forceModuleBody := forceModuleBody;
  159. addressType := IntermediateCode.GetType(system,system.addressType)
  160. END Init;
  161. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  162. BEGIN
  163. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  164. END Error;
  165. PROCEDURE Type(x: SyntaxTree.Type);
  166. BEGIN
  167. x.Accept(SELF);
  168. END Type;
  169. (** types **)
  170. PROCEDURE VisitBasicType*(x: SyntaxTree.BasicType);
  171. BEGIN (* no code emission *) END VisitBasicType;
  172. PROCEDURE VisitCharacterType*(x: SyntaxTree.CharacterType);
  173. BEGIN (* no code emission *) END VisitCharacterType;
  174. PROCEDURE VisitIntegerType*(x: SyntaxTree.IntegerType);
  175. BEGIN (* no code emission *) END VisitIntegerType;
  176. PROCEDURE VisitFloatType*(x: SyntaxTree.FloatType);
  177. BEGIN (* no code emission *) END VisitFloatType;
  178. PROCEDURE VisitComplexType*(x: SyntaxTree.ComplexType);
  179. BEGIN (* no code emission *) END VisitComplexType;
  180. PROCEDURE VisitQualifiedType*(x: SyntaxTree.QualifiedType);
  181. VAR type: SyntaxTree.Type;
  182. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  183. type := x.resolved;
  184. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  185. meta.CheckTypeDeclaration(type);
  186. END;
  187. END VisitQualifiedType;
  188. PROCEDURE VisitStringType*(x: SyntaxTree.StringType);
  189. BEGIN (* no code emission *) END VisitStringType;
  190. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  191. BEGIN (* no code emission *)
  192. END VisitArrayRangeType;
  193. PROCEDURE VisitArrayType*(x: SyntaxTree.ArrayType);
  194. BEGIN (* no code emission *) END VisitArrayType;
  195. PROCEDURE VisitPortType*(x: SyntaxTree.PortType);
  196. BEGIN (* no code emission *) END VisitPortType;
  197. PROCEDURE VisitMathArrayType*(x: SyntaxTree.MathArrayType);
  198. BEGIN
  199. meta.CheckTypeDeclaration(x);
  200. END VisitMathArrayType;
  201. PROCEDURE VisitPointerType*(x: SyntaxTree.PointerType);
  202. BEGIN
  203. meta.CheckTypeDeclaration(x);
  204. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  205. END VisitPointerType;
  206. PROCEDURE VisitRecordType*(x: SyntaxTree.RecordType);
  207. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  208. BEGIN (* no code emission *)
  209. meta.CheckTypeDeclaration(x);
  210. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  211. IF x.pointerType.typeDeclaration # NIL THEN
  212. td := x.pointerType.typeDeclaration
  213. ELSE
  214. td := x.typeDeclaration
  215. END;
  216. Global.GetSymbolName(td,name);
  217. (* code section for object *)
  218. END;
  219. Scope(x.recordScope);
  220. END VisitRecordType;
  221. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  222. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  223. BEGIN
  224. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  225. WHILE (this # NIL) & (this.identifier# id) DO
  226. this := this.nextModifier;
  227. END;
  228. RETURN this # NIL
  229. END HasFlag;
  230. PROCEDURE VisitCellType*(x: SyntaxTree.CellType);
  231. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  232. BEGIN
  233. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  234. capabilities := {};
  235. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  236. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  237. backend.SetCapabilities(capabilities);
  238. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  239. Scope(x.cellScope);
  240. END;
  241. END VisitCellType;
  242. PROCEDURE VisitProcedureType*(x: SyntaxTree.ProcedureType);
  243. BEGIN (* no code emission *) END VisitProcedureType;
  244. PROCEDURE VisitEnumerationType*(x: SyntaxTree.EnumerationType);
  245. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  246. END VisitEnumerationType;
  247. (* symbols *)
  248. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  249. BEGIN
  250. Procedure(x);
  251. END VisitProcedure;
  252. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  253. BEGIN
  254. Procedure(x);
  255. END VisitOperator;
  256. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  257. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  258. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  259. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  260. BEGIN
  261. type := type.resolved;
  262. IF type IS SyntaxTree.RecordType THEN
  263. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  264. ELSIF (type IS SyntaxTree.ArrayType) THEN
  265. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  266. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  267. END;
  268. ELSIF type IS SyntaxTree.MathArrayType THEN
  269. WITH type: SyntaxTree.MathArrayType DO
  270. IF type.form = SyntaxTree.Open THEN
  271. RETURN TRUE
  272. ELSIF type.form = SyntaxTree.Static THEN
  273. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  274. END;
  275. END;
  276. END;
  277. RETURN FALSE
  278. END TypeNeedsInitialization;
  279. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  280. VAR variable: SyntaxTree.Variable;
  281. BEGIN
  282. variable := scope.firstVariable;
  283. WHILE variable # NIL DO
  284. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  285. IF variable.initializer # NIL THEN RETURN TRUE END;
  286. variable := variable.nextVariable;
  287. END;
  288. RETURN FALSE
  289. END ScopeNeedsInitialization;
  290. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  291. VAR size: LONGINT;
  292. BEGIN
  293. size := offset - lastUpdated;
  294. IF size > 0 THEN
  295. irv.Emit(Reserve(x.position,size));
  296. END;
  297. irv.Emit(Data(x.position, op));
  298. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  299. END SingleInitialize;
  300. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  301. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  302. BEGIN
  303. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  304. WITH type: SyntaxTree.RecordType DO
  305. baseType := type.baseType;
  306. IF baseType # NIL THEN
  307. baseType := baseType.resolved;
  308. IF baseType IS SyntaxTree.PointerType THEN
  309. baseType := baseType(SyntaxTree.PointerType).pointerBase
  310. END;
  311. Initialize(baseType,NIL, offset);
  312. END;
  313. variable := type.recordScope.firstVariable;
  314. WHILE variable # NIL DO
  315. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  316. variable := variable.nextVariable
  317. END;
  318. | type: SyntaxTree.ArrayType DO
  319. IF type.form = SyntaxTree.Static THEN
  320. baseType := type.arrayBase;
  321. IF TypeNeedsInitialization(baseType) THEN
  322. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  323. FOR i := 0 TO type.staticLength-1 DO
  324. Initialize(baseType,NIL,offset+i*size);
  325. END;
  326. END;
  327. END;
  328. | type: SyntaxTree.MathArrayType DO
  329. IF type.form = SyntaxTree.Open THEN
  330. dim := DynamicDim(type);
  331. baseType := SemanticChecker.ArrayBase(type,dim);
  332. imm := IntermediateCode.Immediate(addressType,dim);
  333. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  334. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  335. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  336. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  337. (* flags remain empty (=0) for open array *)
  338. ELSIF type.form = SyntaxTree.Static THEN
  339. baseType := type.arrayBase;
  340. IF TypeNeedsInitialization(baseType) THEN
  341. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  342. ASSERT(type.staticLength < 1024*1024*1024);
  343. FOR i := 0 TO type.staticLength-1 DO
  344. Initialize(baseType,NIL,offset+i*size);
  345. END;
  346. END;
  347. END;
  348. ELSE
  349. IF initializer # NIL THEN
  350. implementationVisitor.Evaluate(initializer, op);
  351. SingleInitialize(op.op, offset);
  352. END;
  353. END;
  354. END Initialize;
  355. BEGIN
  356. IF x.externalName # NIL THEN RETURN END;
  357. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  358. (* code section for variable *)
  359. Global.GetSymbolSegmentedName(x,name);
  360. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  361. irv.SetExported(IsExported(x));
  362. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  363. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  364. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  365. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  366. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  367. FOR i := 0 TO DynamicDim(x.type)-1 DO
  368. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  369. END;
  370. ELSE
  371. lastUpdated:= 0;
  372. IF implementationVisitor.newObjectFile & ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  373. Initialize(x.type, x.initializer, 0);
  374. END;
  375. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  376. IF size > 0 THEN
  377. irv.Emit(Reserve(x.position,size));
  378. END;
  379. IF ~x.fixed THEN
  380. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  381. ELSE
  382. align := x.alignment;
  383. END;
  384. irv.SetPositionOrAlignment(x.fixed, align);
  385. meta.CheckTypeDeclaration(x.type);
  386. END;
  387. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  388. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  389. END;
  390. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  391. END VisitVariable;
  392. PROCEDURE VisitProperty*(x: SyntaxTree.Property);
  393. BEGIN
  394. VisitVariable(x)
  395. END VisitProperty;
  396. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  397. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  398. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  399. BEGIN
  400. ASSERT(currentScope IS SyntaxTree.CellScope);
  401. Global.GetSymbolSegmentedName(x,name);
  402. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  403. irv.SetExported(IsExported(x));
  404. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  405. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  406. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  407. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  408. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  409. FOR i := 0 TO DynamicDim(x.type)-1 DO
  410. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  411. END;
  412. ELSE
  413. lastUpdated:= 0;
  414. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  415. IF size > 0 THEN
  416. irv.Emit(Reserve(x.position,size));
  417. END;
  418. IF ~x.fixed THEN
  419. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  420. ELSE
  421. align := x.alignment;
  422. END;
  423. irv.SetPositionOrAlignment(x.fixed, align);
  424. meta.CheckTypeDeclaration(x.type);
  425. END;
  426. END VisitParameter;
  427. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  428. BEGIN
  429. Type(x.declaredType); (* => code in objects *)
  430. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  431. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  432. END;
  433. END VisitTypeDeclaration;
  434. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  435. BEGIN
  436. IF (SyntaxTree.Public * x.access # {}) THEN
  437. implementationVisitor.VisitConstant(x);
  438. END;
  439. END VisitConstant;
  440. PROCEDURE Scope(x: SyntaxTree.Scope);
  441. VAR procedure: SyntaxTree.Procedure;
  442. constant: SyntaxTree.Constant;
  443. variable: SyntaxTree.Variable;
  444. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  445. cell: SyntaxTree.CellType;
  446. parameter: SyntaxTree.Parameter;
  447. property: SyntaxTree.Property;
  448. BEGIN
  449. prevScope := currentScope;
  450. currentScope := x;
  451. (* constants treated in implementation visitor *)
  452. WITH x: SyntaxTree.CellScope DO
  453. cell := x.ownerCell;
  454. parameter := cell.firstParameter;
  455. WHILE parameter # NIL DO
  456. VisitParameter(parameter);
  457. parameter := parameter.nextParameter;
  458. END;
  459. property := cell.firstProperty;
  460. WHILE property # NIL DO
  461. VisitProperty(property);
  462. property := property.nextProperty;
  463. END;
  464. ELSE
  465. END;
  466. typeDeclaration := x.firstTypeDeclaration;
  467. WHILE typeDeclaration # NIL DO
  468. VisitTypeDeclaration(typeDeclaration);
  469. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  470. END;
  471. variable := x.firstVariable;
  472. WHILE variable # NIL DO
  473. VisitVariable(variable);
  474. variable := variable.nextVariable;
  475. END;
  476. procedure := x.firstProcedure;
  477. WHILE procedure # NIL DO
  478. VisitProcedure(procedure);
  479. procedure := procedure.nextProcedure;
  480. END;
  481. constant := x.firstConstant;
  482. WHILE constant # NIL DO
  483. VisitConstant(constant);
  484. constant := constant.nextConstant;
  485. END;
  486. currentScope := prevScope;
  487. END Scope;
  488. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  489. VAR parameter: SyntaxTree.Parameter;
  490. BEGIN
  491. parameter := first;
  492. WHILE parameter # NIL DO
  493. VisitParameter(parameter);
  494. parameter := parameter.nextParameter;
  495. END;
  496. END Parameters;
  497. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  498. VAR scope: SyntaxTree.ProcedureScope;
  499. prevScope: SyntaxTree.Scope;
  500. inline, finalizer: BOOLEAN;
  501. procedureType: SyntaxTree.ProcedureType;
  502. pc: LONGINT;
  503. stackSize: LONGINT;
  504. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  505. null,size,src,dest,fp,res: IntermediateCode.Operand;
  506. cc: LONGINT;
  507. cellType: SyntaxTree.CellType;
  508. registerNumber: LONGINT;
  509. registerParameters: SIZE;
  510. registerClass: IntermediateCode.RegisterClass;
  511. type: IntermediateCode.Type;
  512. formalParameter: SyntaxTree.Parameter;
  513. recordType: SyntaxTree.RecordType;
  514. isModuleBody: BOOLEAN;
  515. parametersSize: LONGINT;
  516. position: LONGINT;
  517. PROCEDURE Signature;
  518. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  519. BEGIN
  520. procedureType := x.type(SyntaxTree.ProcedureType);
  521. returnType := procedureType.returnType;
  522. IF returnType # NIL THEN
  523. meta.CheckTypeDeclaration(returnType)
  524. END;
  525. parameter := procedureType.firstParameter;
  526. WHILE parameter # NIL DO
  527. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  528. parameter := parameter.nextParameter;
  529. END;
  530. END Signature;
  531. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: LONGINT): BOOLEAN;
  532. VAR result: BOOLEAN;
  533. BEGIN
  534. result := FALSE;
  535. IF x = SyntaxTree.invalidExpression THEN
  536. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  537. result := TRUE;
  538. value := x.resolved(SyntaxTree.IntegerValue).value;
  539. ELSE
  540. Error(x.position,"expression is not an integer constant");
  541. END;
  542. RETURN result;
  543. END CheckIntegerValue;
  544. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: LONGINT): BOOLEAN;
  545. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  546. BEGIN
  547. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  548. WHILE (this # NIL) & (this.identifier # id) DO
  549. this := this.nextModifier;
  550. END;
  551. IF this # NIL THEN
  552. IF this.expression = NIL THEN
  553. Error(this.position,"expected expression value");
  554. ELSIF CheckIntegerValue(this.expression,value) THEN
  555. END;
  556. RETURN TRUE
  557. ELSE RETURN FALSE
  558. END;
  559. END HasValue;
  560. CONST DefaultDataMemorySize=512;
  561. BEGIN
  562. IF x.externalName # NIL THEN RETURN END;
  563. (*
  564. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  565. *)
  566. (* code section for this procedure *)
  567. position := x.position.start;
  568. scope := x.procedureScope;
  569. prevScope := currentScope;
  570. currentScope := scope;
  571. procedureType := x.type(SyntaxTree.ProcedureType);
  572. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  573. implementationVisitor.temporaries.Clear;
  574. implementationVisitor.usedRegisters := NIL;
  575. implementationVisitor.registerUsageCount.Init;
  576. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  577. IF (scope.body # NIL) & (x.isInline) THEN
  578. inline := TRUE;
  579. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  580. ir.SetExported(IsExported(x));
  581. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  582. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  583. IF backend.cellsAreObjects THEN
  584. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  585. ir.SetExported(IsExported(x));
  586. ELSE
  587. RETURN; (* cellnet cannot be compiled for final static hardware *)
  588. END;
  589. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  590. inline := FALSE;
  591. AddBodyCallStub(x);
  592. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  593. ir.SetExported(IsExported(x));
  594. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  595. inline := FALSE;
  596. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  597. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,stackSize) THEN stackSize := DefaultDataMemorySize END;
  598. AddBodyCallStub(x);
  599. AddStackAllocation(x,stackSize);
  600. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  601. ir.SetExported(IsExported(x));
  602. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  603. inline := FALSE;
  604. Parameters(procedureType.firstParameter);
  605. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  606. ir.SetExported(IsExported(x));
  607. ELSE
  608. inline := FALSE;
  609. IF x.isEntry OR x.isExit THEN
  610. IF x.isEntry THEN
  611. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  612. ELSE
  613. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  614. END;
  615. ir.SetExported(TRUE);
  616. ELSE
  617. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  618. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  619. END;
  620. END;
  621. cc := procedureType.callingConvention;
  622. IF cc = SyntaxTree.WinAPICallingConvention THEN
  623. parametersSize := ProcedureParametersSize(backend.system,x);
  624. ELSE
  625. parametersSize := 0;
  626. END;
  627. IF scope.body # NIL THEN
  628. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  629. registerNumber := 0;
  630. IF ~inline THEN
  631. IF scope.lastVariable = NIL THEN
  632. stackSize := 0
  633. ELSE
  634. stackSize := scope.lastVariable.offsetInBits;
  635. IF stackSize <0 THEN stackSize := -stackSize END;
  636. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  637. END;
  638. (*
  639. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  640. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  641. *)
  642. (*
  643. ir.Emit(Nop(position)); (* placeholder for fill *)
  644. *)
  645. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  646. registerParameters := backend.NumberParameterRegisters(procedureType.callingConvention);
  647. (* assumption: registers are passed left to right and left parameters are in registers *)
  648. formalParameter := procedureType.firstParameter;
  649. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  650. IF ~PassInRegister(formalParameter) THEN
  651. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  652. ELSE
  653. IF formalParameter.type.IsRecordType() THEN
  654. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  655. type := addressType;
  656. ELSE
  657. type := GetType(system, formalParameter.type);
  658. END;
  659. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(procedureType.callingConvention, type, registerNumber));
  660. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  661. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  662. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  663. implementationVisitor.ReleaseIntermediateOperand(src);
  664. INC(registerNumber);
  665. formalParameter := formalParameter.nextParameter;
  666. END;
  667. END;
  668. END;
  669. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  670. implementationVisitor.EmitEnter(ir,x.position,x,cc,ToMemoryUnits(system,stackSize),registerNumber);
  671. END;
  672. pc := ir.pc-1;
  673. END;
  674. implementationVisitor.tagsAvailable := procedureType.callingConvention = SyntaxTree.OberonCallingConvention;
  675. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  676. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  677. IF scope.lastVariable # NIL THEN
  678. stackSize := scope.lastVariable.offsetInBits;
  679. IF stackSize <0 THEN stackSize := -stackSize END;
  680. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  681. END;
  682. END;
  683. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  684. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  685. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  686. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.runtimeModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  687. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  688. ir.EmitAt(pc,Push(size));
  689. implementationVisitor.StaticCallOperand(result,procedure);
  690. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  691. END;
  692. *)
  693. END;
  694. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,cc,ToMemoryUnits(system,stackSize))); (*!!*)
  695. IF stackSize > 0 THEN
  696. IF (stackSize MOD system.addressSize = 0) THEN
  697. null := IntermediateCode.Immediate(addressType,0);
  698. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  699. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  700. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  701. ELSE
  702. null := IntermediateCode.Immediate(int8,0);
  703. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  704. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  705. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  706. END;
  707. (*! should potentially be called by backend -- enter might initialize
  708. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  709. *)
  710. END;
  711. IF procedureType.callingConvention = SyntaxTree.WinAPICallingConvention THEN
  712. parametersSize := ProcedureParametersSize(backend.system,x);
  713. ELSE
  714. parametersSize := 0;
  715. END;
  716. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  717. finalizer := FALSE;
  718. IF backend.cooperative & x.isFinalizer THEN
  719. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  720. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  721. GetRecordTypeName(recordType,name);
  722. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  723. END;
  724. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  725. IF backend.cooperative THEN
  726. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  727. IF implementationVisitor.profile & ~isModuleBody THEN
  728. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  729. END;
  730. END;
  731. implementationVisitor.EmitLeave(ir, x.position,x,cc);
  732. IF finalizer THEN
  733. IF backend.hasLinkRegister THEN
  734. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  735. END;
  736. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  737. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  738. ir.Emit(Br(x.position,dest));
  739. ELSE
  740. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  741. END;
  742. ELSE
  743. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  744. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  745. END;
  746. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  747. IF backend.cooperative THEN
  748. IF HasPointers (scope) THEN
  749. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  750. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  751. ir.Emit(Result(x.position, res));
  752. ir.Emit(Push(x.position, res));
  753. implementationVisitor.ResetVariables(scope);
  754. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  755. ir.Emit(Pop(x.position, res));
  756. ir.Emit(Return(x.position, res));
  757. ELSE
  758. implementationVisitor.ResetVariables(scope);
  759. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  760. END;
  761. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  762. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  763. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  764. ir.Emit(Result(x.position, res));
  765. ir.Emit(Push(x.position, res));
  766. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  767. ir.Emit(Pop(x.position, res));
  768. ir.Emit(Return(x.position, res));
  769. ELSE
  770. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  771. END;
  772. END;
  773. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  774. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  775. ELSE
  776. ir.Emit(Nop(x.position));
  777. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  778. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  779. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  780. END;
  781. END;
  782. END
  783. END;
  784. ELSE (* force body for procedures *)
  785. implementationVisitor.EmitEnter(ir, x.position,x,cc,0,0);
  786. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  787. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  788. implementationVisitor.EmitLeave(ir,x.position,x,cc);
  789. ir.Emit(Exit(x.position,procedureType.pcOffset,cc, parametersSize));
  790. END;
  791. Scope(scope);
  792. Signature;
  793. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  794. currentScope := prevScope;
  795. END Procedure;
  796. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  797. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  798. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  799. BEGIN
  800. ASSERT (bodyProcedure # NIL);
  801. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  802. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  803. procedure.SetScope(bodyProcedure.scope);
  804. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  805. procedure.SetAccess(SyntaxTree.Hidden);
  806. Global.GetSymbolSegmentedName (procedure,name);
  807. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  808. ir.SetExported(TRUE);
  809. Global.GetSymbolSegmentedName (bodyProcedure,name);
  810. IF (backend.newObjectFile OR backend.cooperative) & ~meta.simple THEN
  811. implementationVisitor.currentScope := module.module.moduleScope;
  812. implementationVisitor.section := ir;
  813. implementationVisitor.PushSelfPointer();
  814. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  815. ELSIF backend.preregisterStatic THEN
  816. implementationVisitor.currentScope := module.module.moduleScope;
  817. implementationVisitor.section := ir;
  818. implementationVisitor.PushSelfPointer();
  819. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  820. ELSE
  821. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  822. ir.Emit(Call(bodyProcedure.position,op, 0));
  823. END;
  824. END AddBodyCallStub;
  825. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: LONGINT); (* code that is only necessary for static linkers *)
  826. VAR name: Basic.SegmentedName;
  827. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  828. BEGIN
  829. Global.GetSymbolSegmentedName (symbol,name);
  830. Basic.RemoveSuffix(name);
  831. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  832. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  833. ir.SetExported(TRUE);
  834. IntermediateCode.InitImmediate(op,addressType,initStack);
  835. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  836. END AddStackAllocation;
  837. (** entry function to visit a complete module *)
  838. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  839. VAR
  840. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  841. hasDynamicOperatorDeclarations: BOOLEAN;
  842. operator: SyntaxTree.Operator;
  843. import: SyntaxTree.Import;
  844. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  845. BEGIN
  846. type := type.resolved;
  847. IF type IS SyntaxTree.RecordType THEN
  848. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  849. ELSIF (type IS SyntaxTree.ArrayType) THEN
  850. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  851. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  852. END;
  853. ELSIF type IS SyntaxTree.MathArrayType THEN
  854. WITH type: SyntaxTree.MathArrayType DO
  855. IF type.form = SyntaxTree.Open THEN
  856. RETURN TRUE
  857. ELSIF type.form = SyntaxTree.Static THEN
  858. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  859. END;
  860. END;
  861. END;
  862. RETURN FALSE
  863. END TypeNeedsInitialization;
  864. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  865. VAR variable: SyntaxTree.Variable;
  866. BEGIN
  867. variable := scope.firstVariable;
  868. WHILE variable # NIL DO
  869. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  870. IF variable.initializer # NIL THEN RETURN TRUE END;
  871. variable := variable.nextVariable;
  872. END;
  873. RETURN FALSE
  874. END ScopeNeedsInitialization;
  875. BEGIN
  876. ASSERT(x # NIL); ASSERT(module # NIL);
  877. SELF.module := module;
  878. (* add import names to the generated Sections.Module *)
  879. import := x.moduleScope.firstImport;
  880. WHILE import # NIL DO
  881. import.module.GetName(idstr);
  882. module.imports.AddName(idstr);
  883. import := import.nextImport
  884. END;
  885. IF ~implementationVisitor.newObjectFile & ~meta.simple THEN
  886. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@moduleSelf"));
  887. moduleSelf := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@moduleSelf"));
  888. moduleSelf.SetType(system.anyType);
  889. moduleSelf.SetScope(x.moduleScope);
  890. moduleSelf.SetUntraced(TRUE);
  891. ir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,moduleSelf,dump); ir.SetOffset(0);
  892. ir.SetExported(TRUE);
  893. IntermediateCode.InitImmediate(op,addressType,0);
  894. ir.Emit(Data(Basic.invalidPosition,op));
  895. END;
  896. implementationVisitor.module := module;
  897. implementationVisitor.moduleScope := x.moduleScope;
  898. implementationVisitor.moduleSelf := moduleSelf;
  899. implementationVisitor.canBeLoaded := TRUE;
  900. meta.SetModule(module);
  901. IF (forceModuleBody OR implementationVisitor.newObjectFile & ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  902. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  903. END;
  904. IF backend.profile THEN
  905. EnsureBodyProcedure(x.moduleScope);
  906. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  907. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  908. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  909. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  910. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  911. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  912. Global.GetModuleName(module.module,idstr);
  913. implementationVisitor.ProfilerAddModule(idstr);
  914. implementationVisitor.numberProcedures := 0;
  915. END;
  916. implementationVisitor.profile := backend.profile;
  917. (* check if there is at least one dynamic operator locally defined *)
  918. hasDynamicOperatorDeclarations := FALSE;
  919. operator := x.moduleScope.firstOperator;
  920. WHILE operator # NIL DO
  921. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  922. operator := operator.nextOperator
  923. END;
  924. (* add operator initialization code section *)
  925. IF hasDynamicOperatorDeclarations THEN
  926. EnsureBodyProcedure(x.moduleScope);
  927. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  928. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  929. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  930. END;
  931. Scope(x.moduleScope);
  932. IF hasDynamicOperatorDeclarations THEN
  933. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  934. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  935. END;
  936. IF backend.profile THEN
  937. implementationVisitor.ProfilerPatchInit;
  938. END;
  939. END Module;
  940. END DeclarationVisitor;
  941. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  942. RegisterUsageCount*=OBJECT
  943. VAR used: UsedArray; count: LONGINT;
  944. PROCEDURE &Init;
  945. VAR i: LONGINT;
  946. BEGIN
  947. count := 0;
  948. IF used = NIL THEN NEW(used,64); END;
  949. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  950. END Init;
  951. PROCEDURE Grow;
  952. VAR new: UsedArray; size,i: LONGINT;
  953. BEGIN
  954. size := LEN(used)*2;
  955. NEW(new,size);
  956. FOR i := 0 TO LEN(used)-1 DO
  957. new[i].count := used[i].count;
  958. new[i].type := used[i].type;
  959. new[i].map := used[i].map
  960. END;
  961. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  962. used := new
  963. END Grow;
  964. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  965. BEGIN
  966. INC(count);
  967. IF count = LEN(used) THEN Grow END;
  968. used[count].type := type;
  969. used[count].class := class;
  970. used[count].map := count;
  971. RETURN count;
  972. END Next;
  973. PROCEDURE IncUse(register: LONGINT);
  974. BEGIN
  975. INC(used[register].count);
  976. (*
  977. IF (register = 1) & (count > 30) THEN
  978. D.TraceBack;
  979. END;
  980. *)
  981. END IncUse;
  982. PROCEDURE DecUse(register: LONGINT);
  983. BEGIN
  984. DEC(used[register].count);
  985. END DecUse;
  986. PROCEDURE Map(register: LONGINT): LONGINT;
  987. VAR map : LONGINT;
  988. BEGIN
  989. IF register > 0 THEN
  990. map := used[register].map;
  991. WHILE register # map DO register := map; map := used[register].map END;
  992. END;
  993. RETURN register
  994. END Map;
  995. PROCEDURE Use(register: LONGINT): LONGINT;
  996. BEGIN
  997. IF register< LEN(used) THEN
  998. RETURN used[register].count
  999. ELSE
  1000. RETURN 0
  1001. END
  1002. END Use;
  1003. END RegisterUsageCount;
  1004. RegisterEntry = POINTER TO RECORD
  1005. prev,next: RegisterEntry;
  1006. register: LONGINT;
  1007. registerClass: IntermediateCode.RegisterClass;
  1008. type: IntermediateCode.Type;
  1009. END;
  1010. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1011. Variables = OBJECT (Basic.List)
  1012. VAR
  1013. inUse: VariableUse;
  1014. registerIndex: LONGINT;
  1015. nameIndex: LONGINT;
  1016. PROCEDURE & Init;
  1017. VAR i: LONGINT;
  1018. BEGIN
  1019. InitList(16);
  1020. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1021. registerIndex := 1024;
  1022. nameIndex := 0;
  1023. END Init;
  1024. PROCEDURE Clear*;
  1025. VAR i: LONGINT;
  1026. BEGIN
  1027. Clear^;
  1028. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1029. registerIndex := 1024;
  1030. nameIndex := 0;
  1031. END Clear;
  1032. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1033. VAR string: SyntaxTree.IdentifierString ;
  1034. BEGIN
  1035. COPY("@hiddenIRVar",string);
  1036. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1037. RETURN SyntaxTree.NewIdentifier(string);
  1038. END GetUID;
  1039. PROCEDURE GetUsage(VAR use: VariableUse);
  1040. BEGIN
  1041. use := inUse;
  1042. END GetUsage;
  1043. PROCEDURE SetUsage(CONST use: VariableUse);
  1044. BEGIN
  1045. inUse := use;
  1046. END SetUsage;
  1047. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1048. VAR any: ANY;
  1049. BEGIN
  1050. any := Get(i);
  1051. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1052. END GetVariable;
  1053. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1054. BEGIN
  1055. Set(pos, v);
  1056. END SetVariable;
  1057. PROCEDURE Occupy(pos: LONGINT);
  1058. BEGIN
  1059. INCL(inUse[pos DIV 32], pos MOD 32);
  1060. END Occupy;
  1061. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1062. BEGIN
  1063. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1064. END Occupied;
  1065. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1066. BEGIN
  1067. Occupy(Length());
  1068. Add(v);
  1069. END AddVariable;
  1070. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1071. BEGIN
  1072. t1 := t1.resolved;
  1073. t2 := t2.resolved;
  1074. (*RETURN t1.SameType(t2); *)
  1075. RETURN
  1076. (t1.SameType(t2))
  1077. OR
  1078. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1079. OR
  1080. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits = t2.sizeInBits)
  1081. OR
  1082. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1083. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1084. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1085. OR
  1086. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1087. (DynamicDim(t1) = DynamicDim(t2))
  1088. );
  1089. END CompatibleType;
  1090. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1091. VAR var : SyntaxTree.Variable; i: LONGINT;
  1092. BEGIN
  1093. pos := Length();
  1094. FOR i := 0 TO pos-1 DO
  1095. IF ~(Occupied(i)) THEN
  1096. var := GetVariable(i);
  1097. IF CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1098. pos := i;
  1099. Occupy(i);
  1100. RETURN var;
  1101. END;
  1102. END;
  1103. END;
  1104. RETURN NIL
  1105. END GetFreeVariable;
  1106. END Variables;
  1107. SymbolMap = POINTER TO RECORD
  1108. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1109. isAddress: BOOLEAN;
  1110. END;
  1111. SymbolMapper = OBJECT
  1112. VAR
  1113. first: SymbolMap;
  1114. PROCEDURE & Init;
  1115. BEGIN
  1116. first := NIL;
  1117. END Init;
  1118. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1119. VAR new: SymbolMap;
  1120. BEGIN
  1121. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1122. new.next := first; first := new;
  1123. END Add;
  1124. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1125. VAR s: SymbolMap;
  1126. BEGIN
  1127. s := first;
  1128. WHILE (s # NIL) & (s.this # this) DO
  1129. s := s.next
  1130. END;
  1131. RETURN s
  1132. END Get;
  1133. END SymbolMapper;
  1134. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1135. VAR
  1136. system: Global.System;
  1137. section: IntermediateCode.Section;
  1138. module: Sections.Module;
  1139. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1140. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1141. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1142. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1143. checker: SemanticChecker.Checker;
  1144. backend: IntermediateBackend;
  1145. meta: MetaDataGenerator;
  1146. position: Position;
  1147. moduleSelf: SyntaxTree.Variable;
  1148. (* variables for hand over of variables / temporary state *)
  1149. currentScope: SyntaxTree.Scope;
  1150. constantDeclaration : SyntaxTree.Symbol;
  1151. result: Operand; (* result of the most recent expression / statement *)
  1152. destination: IntermediateCode.Operand;
  1153. arrayDestinationTag: IntermediateCode.Operand;
  1154. arrayDestinationDimension:LONGINT;
  1155. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1156. conditional: BOOLEAN;
  1157. trueLabel, falseLabel, exitLabel: Label;
  1158. locked: BOOLEAN;
  1159. (*
  1160. usedRegisters: Registers;
  1161. *)
  1162. registerUsageCount: RegisterUsageCount;
  1163. usedRegisters: RegisterEntry;
  1164. (* useful operands and types *)
  1165. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1166. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1167. commentPrintout: Printout.Printer;
  1168. dump: Streams.Writer;
  1169. tagsAvailable : BOOLEAN;
  1170. supportedInstruction: SupportedInstructionProcedure;
  1171. supportedImmediate: SupportedImmediateProcedure;
  1172. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1173. emitLabels: BOOLEAN;
  1174. runtimeModuleName : SyntaxTree.IdentifierString;
  1175. newObjectFile: BOOLEAN;
  1176. indexCounter: LONGINT;
  1177. profile: BOOLEAN;
  1178. profileId, profileInit: IntermediateCode.Section;
  1179. profileInitPatchPosition: LONGINT;
  1180. numberProcedures: LONGINT;
  1181. procedureResultDesignator : SyntaxTree.Designator;
  1182. operatorInitializationCodeSection: IntermediateCode.Section;
  1183. fingerPrinter: FingerPrinter.FingerPrinter;
  1184. temporaries: Variables;
  1185. canBeLoaded : BOOLEAN;
  1186. currentIsInline: BOOLEAN;
  1187. currentMapper: SymbolMapper;
  1188. currentInlineExit: Label;
  1189. moduleBodySection: IntermediateCode.Section;
  1190. NeedDescriptor : BOOLEAN;
  1191. cooperativeSwitches: BOOLEAN;
  1192. lastSwitchPC: LONGINT;
  1193. isUnchecked: BOOLEAN;
  1194. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend;
  1195. newObjectFile: BOOLEAN);
  1196. BEGIN
  1197. SELF.system := system;
  1198. SELF.runtimeModuleName := runtime;
  1199. currentScope := NIL;
  1200. hiddenPointerType := NIL;
  1201. delegatePointerType := NIL;
  1202. awaitProcCounter := 0;
  1203. labelId := 0; constId := 0; labelId := 0;
  1204. SELF.checker := checker;
  1205. SELF.backend := backend;
  1206. position := Basic.invalidPosition;
  1207. conditional := FALSE;
  1208. locked := FALSE;
  1209. InitOperand(result,ModeUndefined);
  1210. addressType := IntermediateCode.GetType(system,system.addressType);
  1211. setType := IntermediateCode.GetType(system,system.setType);
  1212. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1213. lenType := IntermediateCode.GetType(system, system.lenType);
  1214. byteType := IntermediateCode.GetType(system, system.byteType);
  1215. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1216. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1217. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1218. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1219. nil := IntermediateCode.Immediate(addressType,0);
  1220. one := IntermediateCode.Immediate(addressType,1);
  1221. IntermediateCode.InitOperand(destination);
  1222. tagsAvailable := TRUE;
  1223. supportedInstruction := supportedInstructionProcedure;
  1224. supportedImmediate := supportedImmediateProcedure;
  1225. inData := FALSE;
  1226. SELF.emitLabels := emitLabels;
  1227. IntermediateCode.InitOperand(arrayDestinationTag);
  1228. bool := IntermediateCode.GetType(system,system.booleanType);
  1229. IntermediateCode.InitImmediate(false,bool,0);
  1230. IntermediateCode.InitImmediate(true,bool,1);
  1231. SELF.newObjectFile := newObjectFile;
  1232. indexCounter := 0;
  1233. NEW(registerUsageCount);
  1234. usedRegisters := NIL;
  1235. procedureResultDesignator := NIL;
  1236. NEW(fingerPrinter);
  1237. NEW(temporaries);
  1238. currentIsInline := FALSE;
  1239. NeedDescriptor := FALSE;
  1240. isUnchecked := backend.noRuntimeChecks;
  1241. END Init;
  1242. TYPE Context = RECORD
  1243. section: IntermediateCode.Section;
  1244. registerUsageCount: RegisterUsageCount;
  1245. usedRegisters: RegisterEntry;
  1246. temporaries: Variables;
  1247. END;
  1248. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1249. VAR context: Context;
  1250. BEGIN
  1251. context.section := section;
  1252. context.registerUsageCount := registerUsageCount;
  1253. context.usedRegisters := usedRegisters;
  1254. context.temporaries := temporaries;
  1255. section := new;
  1256. NEW(registerUsageCount);
  1257. NEW(temporaries);
  1258. usedRegisters := NIL;
  1259. RETURN context;
  1260. END SwitchContext;
  1261. PROCEDURE ReturnToContext(context: Context);
  1262. BEGIN
  1263. section := context.section;
  1264. registerUsageCount := context.registerUsageCount;
  1265. usedRegisters := context.usedRegisters;
  1266. temporaries := context.temporaries;
  1267. END ReturnToContext;
  1268. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1269. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1270. BEGIN
  1271. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1272. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1273. END;
  1274. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1275. section.SetExported(IsExported(syntaxTreeSymbol));
  1276. RETURN section
  1277. END NewSection;
  1278. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1279. VAR new: LONGINT;
  1280. BEGIN
  1281. new := registerUsageCount.Next(type,class);
  1282. UseRegister(new);
  1283. RETURN new
  1284. END AcquireRegister;
  1285. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1286. VAR
  1287. fingerPrint: SyntaxTree.FingerPrint;
  1288. fingerPrintString: ARRAY 32 OF CHAR;
  1289. BEGIN
  1290. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1291. string := "[";
  1292. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1293. Strings.Append(string, fingerPrintString);
  1294. Strings.Append(string, "]");
  1295. END GetFingerprintString;
  1296. (** get the name for the code section that represens a certain symbol
  1297. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1298. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1299. VAR string: ARRAY 32 OF CHAR;
  1300. BEGIN
  1301. Global.GetSymbolSegmentedName(symbol, name);
  1302. (* if the symbol is an operator, then append the fingerprint to the name *)
  1303. IF symbol IS SyntaxTree.Operator THEN
  1304. GetFingerprintString(symbol, string);
  1305. Basic.AppendToSegmentedName(name,string);
  1306. END
  1307. END GetCodeSectionNameForSymbol;
  1308. (** get the name for the code section that represens a certain symbol
  1309. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1310. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1311. VAR string: ARRAY 32 OF CHAR;
  1312. BEGIN
  1313. Global.GetSymbolNameInScope(symbol, scope, name);
  1314. (* if the symbol is an operator, then append the fingerprint to the name *)
  1315. IF symbol IS SyntaxTree.Operator THEN
  1316. GetFingerprintString(symbol, string);
  1317. Strings.Append(name, string);
  1318. END
  1319. END GetCodeSectionNameForSymbolInScope;
  1320. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1321. BEGIN
  1322. IF dump # NIL THEN
  1323. dump.String("enter "); dump.String(s); dump.Ln;
  1324. END;
  1325. END TraceEnter;
  1326. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1327. BEGIN
  1328. IF dump # NIL THEN
  1329. dump.String("exit "); dump.String(s); dump.Ln;
  1330. END;
  1331. END TraceExit;
  1332. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1333. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1334. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1335. VAR i: LONGINT;
  1336. BEGIN
  1337. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1338. IF op.rule # NIL THEN
  1339. FOR i := 0 TO LEN(op.rule)-1 DO
  1340. CheckRegister(op.rule[i])
  1341. END;
  1342. END;
  1343. END CheckRegister;
  1344. BEGIN
  1345. CheckRegister(instruction.op1);
  1346. CheckRegister(instruction.op2);
  1347. CheckRegister(instruction.op3);
  1348. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1349. ELSE section.Emit(instruction);
  1350. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1351. END;
  1352. END Emit;
  1353. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1354. BEGIN
  1355. IF backend.cooperative THEN
  1356. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1357. CallThis(position,DefaultRuntimeModuleName,"Trap",1);
  1358. ELSE
  1359. Emit(Trap(position,trapNo));
  1360. END;
  1361. END EmitTrap;
  1362. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1363. VAR name: Basic.SegmentedName;
  1364. VAR op1, op2, reg: IntermediateCode.Operand;
  1365. VAR call, nocall: Label;
  1366. VAR parametersSize: LONGINT;
  1367. VAR prevSection: IntermediateCode.Section;
  1368. VAR prevDump: Streams.Writer;
  1369. VAR body: SyntaxTree.Body;
  1370. VAR procedureType: SyntaxTree.ProcedureType;
  1371. BEGIN
  1372. IF procedure # NIL THEN
  1373. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1374. ELSE procedureType := NIL;
  1375. END;
  1376. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1377. prevSection := SELF.section;
  1378. SELF.section := section;
  1379. prevDump := dump;
  1380. dump := section.comments;
  1381. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1382. IF backend.hasLinkRegister THEN
  1383. Emit(Push(Basic.invalidPosition, lr));
  1384. END;
  1385. Emit(Push(Basic.invalidPosition,fp));
  1386. IF procedure # NIL THEN
  1387. body := procedure.procedureScope.body;
  1388. ELSE
  1389. body := NIL;
  1390. END;
  1391. IF backend.cooperative THEN
  1392. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1393. GetCodeSectionNameForSymbol(procedure, name);
  1394. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1395. ELSE
  1396. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1397. END;
  1398. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1399. IntermediateCode.AddOffset(op1, 1);
  1400. Emit(Push(Basic.invalidPosition,op1));
  1401. Emit(Mov(Basic.invalidPosition,fp, sp));
  1402. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1403. NEW(call, section);
  1404. NEW(nocall, section);
  1405. reg := NewRegisterOperand(addressType);
  1406. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1407. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1408. BrltL(call, sp, reg);
  1409. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1410. BrgeL(nocall, sp, op2);
  1411. call.Resolve(section.pc);
  1412. Emit(Push(Basic.invalidPosition, reg));
  1413. ReleaseIntermediateOperand(reg);
  1414. parametersSize := ProcedureParametersSize(backend.system,procedure);
  1415. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1416. Emit(Push(Basic.invalidPosition, op2));
  1417. CallThis(position, "Activities","ExpandStack",2);
  1418. Emit(Result(Basic.invalidPosition, sp));
  1419. nocall.Resolve(section.pc);
  1420. END;
  1421. ELSE
  1422. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1423. Emit(Push(Basic.invalidPosition, one)) ;
  1424. procedureType.SetParametersOffset(1);
  1425. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1426. END;
  1427. Emit(Mov(Basic.invalidPosition, fp, sp));
  1428. END;
  1429. END;
  1430. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1431. SELF.section := prevSection;
  1432. dump := prevDump;
  1433. END EmitEnter;
  1434. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1435. VAR op1,op2: IntermediateCode.Operand;
  1436. VAR instruction: IntermediateCode.Instruction;
  1437. BEGIN
  1438. IntermediateCode.InitNumber(op1,callconv);
  1439. IntermediateCode.InitNumber(op2,varSize);
  1440. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1441. RETURN instruction
  1442. END Enter;
  1443. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1444. VAR op1: IntermediateCode.Operand;
  1445. VAR instruction: IntermediateCode.Instruction;
  1446. BEGIN
  1447. IntermediateCode.InitNumber(op1,callconv);
  1448. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1449. RETURN instruction
  1450. END Leave;
  1451. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1452. VAR prevSection: IntermediateCode.Section;
  1453. VAR op2, size: IntermediateCode.Operand;
  1454. VAR body: SyntaxTree.Body;
  1455. BEGIN
  1456. prevSection := SELF.section;
  1457. SELF.section := section;
  1458. Emit(Leave(position, callconv));
  1459. IF procedure # NIL THEN
  1460. body := procedure.procedureScope.body;
  1461. ELSE
  1462. body := NIL;
  1463. END;
  1464. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1465. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1466. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1467. Emit(Add(position, sp, fp, op2));
  1468. ELSE
  1469. Emit(Mov(position, sp, fp));
  1470. END;
  1471. Emit(Pop(position, fp));
  1472. END;
  1473. SELF.section := prevSection;
  1474. END EmitLeave;
  1475. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1476. VAR m: SymbolMap;
  1477. BEGIN
  1478. position := x.position;
  1479. IF currentIsInline THEN
  1480. m := currentMapper.Get(x);
  1481. IF m # NIL THEN
  1482. (*
  1483. Printout.Info("mapping from", x);
  1484. Printout.Info("mapping to ", m.to);
  1485. *)
  1486. m.to.Accept(SELF);
  1487. op := result;
  1488. IF m.tag # NIL THEN
  1489. ReleaseIntermediateOperand(result.tag);
  1490. m.tag.Accept(SELF);
  1491. op.tag := result.op;
  1492. ReleaseIntermediateOperand(result.tag);
  1493. END;
  1494. RETURN
  1495. END;
  1496. END;
  1497. x.Accept(SELF);
  1498. op := result;
  1499. END Symbol;
  1500. PROCEDURE Expression(x: SyntaxTree.Expression);
  1501. BEGIN
  1502. position := x.position;
  1503. constantDeclaration := NIL;
  1504. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1505. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1506. END;
  1507. IF x.resolved # NIL THEN
  1508. x.resolved.Accept(SELF)
  1509. ELSE
  1510. x.Accept(SELF)
  1511. END;
  1512. (* check this, was commented out in ActiveCells3 *)
  1513. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1514. Error(x.position, "unsupported modifier");
  1515. END;
  1516. END Expression;
  1517. (*
  1518. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1519. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1520. BEGIN
  1521. temporaries.GetUsage(current);
  1522. FOR i := 0 TO LEN(current)-1 DO
  1523. set := current[i] - previous[i];
  1524. IF set # {} THEN
  1525. FOR j := 0 TO MAX(SET)-1 DO
  1526. IF j IN set THEN
  1527. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1528. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1529. Symbol(variable, op);
  1530. MakeMemory(tmp,op.op,addressType,0);
  1531. ReleaseOperand(op);
  1532. Emit(Mov(position,tmp, nil ) );
  1533. ReleaseIntermediateOperand(tmp);
  1534. END;
  1535. END;
  1536. END;
  1537. END;
  1538. END;
  1539. END ResetUsedTemporaries;
  1540. *)
  1541. PROCEDURE Statement(x: SyntaxTree.Statement);
  1542. VAR use: VariableUse;
  1543. BEGIN
  1544. temporaries.GetUsage(use);
  1545. position := x.position;
  1546. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1547. IF commentPrintout # NIL THEN
  1548. commentPrintout.Statement(x);
  1549. dump.Ln;
  1550. (*dump.Update;*)
  1551. END;
  1552. x.Accept(SELF);
  1553. (*
  1554. CheckRegistersFree();
  1555. *)
  1556. (*ResetUsedTemporaries(use);*)
  1557. temporaries.SetUsage(use);
  1558. END Statement;
  1559. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1560. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1561. *)
  1562. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1563. BEGIN
  1564. ASSERT(op.mode # IntermediateCode.Undefined);
  1565. IF op.mode = IntermediateCode.ModeMemory THEN
  1566. ReuseCopy(res,op);
  1567. ELSE
  1568. res := op;
  1569. UseIntermediateOperand(res);
  1570. END;
  1571. IntermediateCode.AddOffset(res,offset);
  1572. IntermediateCode.MakeMemory(res,type);
  1573. END MakeMemory;
  1574. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1575. VAR mem: IntermediateCode.Operand;
  1576. BEGIN
  1577. MakeMemory(mem,res,type,offset);
  1578. ReleaseIntermediateOperand(res);
  1579. res := mem;
  1580. END ToMemory;
  1581. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1582. VAR mem: IntermediateCode.Operand;
  1583. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1584. componentType: SyntaxTree.Type;
  1585. BEGIN
  1586. type := type.resolved;
  1587. IF operand.mode = ModeReference THEN
  1588. IF type IS SyntaxTree.RangeType THEN
  1589. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1590. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1591. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1592. ReleaseOperand(operand);
  1593. operand.op := firstOp;
  1594. operand.tag := lastOp;
  1595. operand.extra := stepOp;
  1596. ELSIF type IS SyntaxTree.ComplexType THEN
  1597. componentType := type(SyntaxTree.ComplexType).componentType;
  1598. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1599. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1600. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1601. ReleaseOperand(operand);
  1602. operand.op := firstOp;
  1603. operand.tag := lastOp
  1604. ELSE
  1605. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1606. ReleaseIntermediateOperand(operand.op);
  1607. operand.op := mem;
  1608. END;
  1609. operand.mode := ModeValue;
  1610. END;
  1611. ASSERT(operand.mode = ModeValue);
  1612. END LoadValue;
  1613. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1614. VAR prevConditional: BOOLEAN;
  1615. BEGIN
  1616. prevConditional := conditional;
  1617. conditional := FALSE;
  1618. InitOperand(result, ModeUndefined);
  1619. Expression(x);
  1620. op := result;
  1621. LoadValue(op,x.type.resolved);
  1622. conditional := prevConditional;
  1623. END Evaluate;
  1624. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1625. VAR prevConditional: BOOLEAN;
  1626. BEGIN
  1627. prevConditional := conditional;
  1628. conditional := FALSE;
  1629. InitOperand(result,ModeUndefined);
  1630. Expression(x);
  1631. op := result;
  1632. (*
  1633. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1634. *)
  1635. conditional := prevConditional;
  1636. END Designate;
  1637. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1638. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1639. BEGIN
  1640. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1641. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1642. conditional := TRUE;
  1643. trueLabel := trueL; falseLabel := falseL;
  1644. Expression(x);
  1645. trueL := trueLabel; falseL := falseLabel;
  1646. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1647. END Condition;
  1648. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1649. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1650. BEGIN
  1651. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1652. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1653. RETURN op
  1654. END NewRegisterOperand;
  1655. PROCEDURE UnuseRegister(register: LONGINT);
  1656. BEGIN
  1657. IF (register > 0) THEN
  1658. register := registerUsageCount.Map(register);
  1659. registerUsageCount.DecUse(register);
  1660. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1661. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1662. END;
  1663. IF registerUsageCount.Use(register)=0 THEN
  1664. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1665. Warning(position, "register cannot be removed");
  1666. END;
  1667. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1668. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1669. END;
  1670. ELSIF registerUsageCount.Use(register)<0 THEN
  1671. Warning(position, "register removed too often");
  1672. IF dump # NIL THEN
  1673. dump.String("register removed too often"); dump.Ln; dump.Update;
  1674. END;
  1675. END;
  1676. END;
  1677. END UnuseRegister;
  1678. PROCEDURE UseRegister(register: LONGINT);
  1679. BEGIN
  1680. IF (register > 0) THEN
  1681. register := registerUsageCount.Map(register);
  1682. registerUsageCount.IncUse(register);
  1683. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1684. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1685. END;
  1686. IF registerUsageCount.Use(register)=1 THEN
  1687. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1688. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1689. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1690. END;
  1691. END;
  1692. END;
  1693. END UseRegister;
  1694. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1695. BEGIN
  1696. UnuseRegister(op.register)
  1697. END ReleaseIntermediateOperand;
  1698. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1699. BEGIN
  1700. UseRegister(op.register)
  1701. END UseIntermediateOperand;
  1702. PROCEDURE ReleaseOperand(CONST op: Operand);
  1703. BEGIN
  1704. UnuseRegister(op.op.register);
  1705. UnuseRegister(op.tag.register);
  1706. UnuseRegister(op.extra.register);
  1707. END ReleaseOperand;
  1708. (* save registers marked in array "markedRegisters" to the stack
  1709. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1710. *)
  1711. PROCEDURE SaveRegisters();
  1712. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1713. BEGIN
  1714. entry := usedRegisters;
  1715. WHILE entry # NIL DO
  1716. type := registerUsageCount.used[entry.register].type;
  1717. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1718. Emit(Push(position,op));
  1719. entry := entry.next;
  1720. END;
  1721. END SaveRegisters;
  1722. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1723. BEGIN
  1724. saved := usedRegisters;
  1725. usedRegisters := NIL;
  1726. END ReleaseUsedRegisters;
  1727. (** remove parameter registers from used queue *)
  1728. PROCEDURE ReleaseParameterRegisters;
  1729. VAR entry,prev,next: RegisterEntry;
  1730. BEGIN
  1731. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1732. WHILE entry # NIL DO
  1733. next := entry.next;
  1734. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1735. registerUsageCount.DecUse(entry.register);
  1736. ASSERT(registerUsageCount.Use(entry.register)=0);
  1737. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1738. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1739. END;
  1740. ELSIF prev = NIL THEN
  1741. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1742. ELSE
  1743. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1744. END;
  1745. entry := next;
  1746. END;
  1747. END ReleaseParameterRegisters;
  1748. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1749. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1750. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1751. BEGIN
  1752. entry := saved;
  1753. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1754. entry := prev;
  1755. WHILE entry # NIL DO
  1756. prev := entry.prev;
  1757. type := entry.type;
  1758. class := entry.registerClass;
  1759. IntermediateCode.InitRegister(op,type,class,entry.register);
  1760. (*
  1761. new := registerUsageCount.Next(type,class);
  1762. registerUsageCount.Remap(entry.register,new);
  1763. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1764. dump.String("remap register "); dump.Int(entry.register,1);
  1765. dump.String("to "); dump.Int(new,1);
  1766. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1767. END;
  1768. entry.register := new;
  1769. *)
  1770. Emit(Pop(position,op));
  1771. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1772. entry := prev;
  1773. END;
  1774. (*
  1775. usedRegisters := saved;
  1776. *)
  1777. END RestoreRegisters;
  1778. PROCEDURE CheckRegistersFree;
  1779. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1780. BEGIN
  1781. IF usedRegisters # NIL THEN
  1782. r := usedRegisters;
  1783. WHILE r # NIL DO
  1784. warning := "register ";
  1785. Strings.AppendInt(warning, r.register);
  1786. Strings.Append(warning, " not released.");
  1787. Warning(position,warning);
  1788. r := r .next;
  1789. END;
  1790. END;
  1791. FOR i := 0 TO registerUsageCount.count-1 DO
  1792. IF registerUsageCount.used[i].count < 0 THEN
  1793. warning := "register ";
  1794. Strings.AppendInt(warning, i);
  1795. Strings.Append(warning, " unused too often.");
  1796. Warning(position,warning);
  1797. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1798. warning := "register ";
  1799. Strings.AppendInt(warning, i);
  1800. Strings.Append(warning, " not unused often enough.");
  1801. Warning(position,warning);
  1802. END;
  1803. END;
  1804. END CheckRegistersFree;
  1805. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1806. Otherwise allocate a new register.
  1807. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1808. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1809. BEGIN
  1810. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1811. UseIntermediateOperand(result);
  1812. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1813. UseIntermediateOperand(result);
  1814. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1815. END;
  1816. END Reuse2;
  1817. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1818. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1819. If not then allocate a new register.
  1820. Does NOT necessarily keep the content of src1 or src2 in result!
  1821. *)
  1822. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1823. BEGIN
  1824. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1825. UseIntermediateOperand(result);
  1826. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1827. UseIntermediateOperand(result);
  1828. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1829. result := alternative; alternative := emptyOperand;
  1830. UseIntermediateOperand(result);
  1831. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1832. END;
  1833. END Reuse2a;
  1834. (* like reuse2 but only one source *)
  1835. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1836. BEGIN
  1837. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1838. UseIntermediateOperand(result);
  1839. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1840. END;
  1841. END Reuse1;
  1842. (* like reuse2a but only one source *)
  1843. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1844. BEGIN
  1845. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1846. UseIntermediateOperand(result);
  1847. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1848. UseIntermediateOperand(result);
  1849. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1850. END;
  1851. END Reuse1a;
  1852. (* like reuse1 but guarantees that content of src1 is in result *)
  1853. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1854. BEGIN
  1855. IF ReusableRegister(src1) THEN
  1856. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1857. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1858. UseIntermediateOperand(result);
  1859. ELSE
  1860. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1861. Emit(Mov(position,result,src1));
  1862. END
  1863. END ReuseCopy;
  1864. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1865. BEGIN
  1866. IF ReusableRegister(src) THEN
  1867. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1868. ELSE
  1869. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1870. Emit(Mov(position,result,src));
  1871. ReleaseIntermediateOperand(src);
  1872. END
  1873. END TransferToRegister;
  1874. (** labels and branches **)
  1875. PROCEDURE NewLabel(): Label;
  1876. VAR label: Label;
  1877. BEGIN
  1878. NEW(label,section); RETURN label;
  1879. END NewLabel;
  1880. PROCEDURE SetLabel(label: Label);
  1881. BEGIN label.Resolve(section.pc);
  1882. END SetLabel;
  1883. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1884. BEGIN
  1885. ASSERT(label # NIL);
  1886. IF label.pc < 0 THEN (* label not yet set *)
  1887. label.AddFixup(section.pc);
  1888. END;
  1889. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1890. END LabelOperand;
  1891. PROCEDURE BrL(label: Label);
  1892. BEGIN
  1893. Emit(Br(position,LabelOperand(label)));
  1894. END BrL;
  1895. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1896. BEGIN
  1897. Emit(Brge(position,LabelOperand(label),left,right));
  1898. END BrgeL;
  1899. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1900. BEGIN
  1901. Emit(Brlt(position,LabelOperand(label),left,right));
  1902. END BrltL;
  1903. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1904. BEGIN
  1905. Emit(Breq(position,LabelOperand(label),left,right));
  1906. END BreqL;
  1907. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1908. BEGIN
  1909. Emit(Brne(position,LabelOperand(label),left,right));
  1910. END BrneL;
  1911. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1912. VAR new: IntermediateCode.Operand;
  1913. BEGIN
  1914. IF Trace THEN TraceEnter("Convert") END;
  1915. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1916. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1917. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1918. & (operand.offset = 0)
  1919. THEN
  1920. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1921. Emit(Conv(position,new,operand));
  1922. ELSE
  1923. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1924. Emit(Conv(position,new,operand));
  1925. ReleaseIntermediateOperand(operand);
  1926. END;
  1927. operand := new;
  1928. 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
  1929. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1930. ELSE
  1931. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1932. Emit(Conv(position,new,operand));
  1933. ReleaseIntermediateOperand(operand);
  1934. operand := new;
  1935. END;
  1936. IF Trace THEN TraceExit("Convert") END;
  1937. END Convert;
  1938. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1939. VAR exit: Label;
  1940. BEGIN
  1941. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1942. exit := NewLabel();
  1943. br(exit,left,right);
  1944. EmitTrap(position,trapNo);
  1945. SetLabel(exit);
  1946. END TrapC;
  1947. (** expressions *)
  1948. (** emit necessary runtime check for set elements **)
  1949. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1950. VAR max: IntermediateCode.Operand;
  1951. BEGIN
  1952. IF isUnchecked THEN RETURN END;
  1953. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1954. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1955. TrapC(BrgeL, max, o, SetElementTrap);
  1956. END;
  1957. END CheckSetElement;
  1958. (** the set that a range represents **)
  1959. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1960. VAR
  1961. operand: Operand;
  1962. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1963. BEGIN
  1964. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1965. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1966. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1967. one := IntermediateCode.Immediate(setType, 1);
  1968. Evaluate(x, operand);
  1969. Convert(operand.op, setType);
  1970. Convert(operand.tag, setType);
  1971. CheckSetElement(operand.op);
  1972. CheckSetElement(operand.tag);
  1973. (* create mask for lower bound
  1974. i.e. shift 11111111 to the left by the value of the lower bound
  1975. *)
  1976. Reuse1(temp, operand.op);
  1977. Emit(Shl(position,temp, allBits, operand.op));
  1978. ReleaseIntermediateOperand(operand.op);
  1979. operand.op := temp;
  1980. (* create mask for upper bound
  1981. i.e. shift 11111111 to the right by the difference between the
  1982. upper bound and the maximum number of set elements
  1983. *)
  1984. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  1985. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  1986. Reuse1(temp, operand.tag);
  1987. ELSE
  1988. Reuse1(temp, operand.tag);
  1989. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  1990. Emit(Sub(position,temp, size, operand.tag));
  1991. END;
  1992. Emit(Shr(position,temp, allBits, operand.tag));
  1993. ReleaseIntermediateOperand(operand.tag);
  1994. operand.tag := temp;
  1995. Reuse2(resultingSet, operand.op, operand.tag);
  1996. (* intersect the two masks *)
  1997. Emit(And(position,resultingSet, operand.op, operand.tag));
  1998. ReleaseOperand(operand);
  1999. RETURN resultingSet
  2000. END SetFromRange;
  2001. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2002. VAR
  2003. res, operand: Operand;
  2004. temp, one, noBits, dest: IntermediateCode.Operand;
  2005. expression: SyntaxTree.Expression;
  2006. i: LONGINT;
  2007. BEGIN
  2008. IF Trace THEN TraceEnter("VisitSet") END;
  2009. dest := destination;
  2010. destination := emptyOperand;
  2011. noBits := IntermediateCode.Immediate(setType, 0);
  2012. one := IntermediateCode.Immediate(setType, 1);
  2013. (* start off with the empty set *)
  2014. InitOperand(res, ModeValue);
  2015. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2016. Emit(Mov(position,res.op, noBits));
  2017. FOR i := 0 TO x.elements.Length() - 1 DO
  2018. expression := x.elements.GetExpression(i);
  2019. IF expression IS SyntaxTree.RangeExpression THEN
  2020. (* range of set elements *)
  2021. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2022. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2023. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2024. ReleaseIntermediateOperand(temp)
  2025. ELSE
  2026. (* singelton element *)
  2027. Evaluate(expression, operand);
  2028. Convert(operand.op, setType);
  2029. CheckSetElement(operand.op);
  2030. (* create subset containing single element *)
  2031. Reuse1(temp, operand.op);
  2032. Emit(Shl(position,temp, one, operand.op));
  2033. ReleaseOperand(operand);
  2034. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2035. ReleaseIntermediateOperand(temp);
  2036. END
  2037. END;
  2038. result := res;
  2039. destination := dest;
  2040. IF Trace THEN TraceExit("VisitSet") END;
  2041. END VisitSet;
  2042. (* math arrays of the form [a,b,c]
  2043. x is a static array and thus does not provide any pointers
  2044. *)
  2045. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2046. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2047. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2048. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2049. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2050. element: SyntaxTree.IntegerValue;
  2051. BEGIN
  2052. numberElements := x.elements.Length();
  2053. expression := index.parameters.GetExpression(dim);
  2054. element := expression(SyntaxTree.IntegerValue);
  2055. FOR i := 0 TO numberElements-1 DO
  2056. expression := x.elements.GetExpression(i);
  2057. element.SetValue(i);
  2058. IF expression IS SyntaxTree.MathArrayExpression THEN
  2059. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2060. ELSE
  2061. Assign(index,expression);
  2062. END;
  2063. END;
  2064. END RecursiveAssignment;
  2065. BEGIN
  2066. (*static math array not providing pointers anyway *)
  2067. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2068. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2069. designator.SetType(variable.type);
  2070. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  2071. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2072. FOR i := 0 TO dim-1 DO
  2073. element := SyntaxTree.NewIntegerValue(x.position,0);
  2074. element.SetType(system.longintType);
  2075. index.parameters.AddExpression(element);
  2076. END;
  2077. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2078. RecursiveAssignment(x,0);
  2079. Expression(designator);
  2080. END VisitMathArrayExpression;
  2081. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2082. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2083. BEGIN
  2084. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2085. dest := destination; destination := emptyOperand;
  2086. IF x.operator = Scanner.Not THEN
  2087. IF conditional THEN
  2088. Condition(x.left,falseLabel,trueLabel)
  2089. ELSE
  2090. Evaluate(x.left,operand);
  2091. InitOperand(result,ModeValue);
  2092. Reuse1a(result.op,operand.op,dest);
  2093. Emit(Xor(position,result.op,operand.op,true));
  2094. ReleaseOperand(operand);
  2095. END;
  2096. ELSIF x.operator = Scanner.Minus THEN
  2097. Evaluate(x.left,operand);
  2098. InitOperand(result,ModeValue);
  2099. Reuse1a(result.op,operand.op,dest);
  2100. type := x.left.type.resolved;
  2101. IF type IS SyntaxTree.SetType THEN
  2102. Emit(Not(position,result.op,operand.op));
  2103. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2104. Reuse1(result.tag,operand.tag);
  2105. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2106. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2107. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2108. Emit(Neg(position,result.op,operand.op));
  2109. ELSE HALT(200)
  2110. END;
  2111. ReleaseOperand(operand);
  2112. ELSIF x.operator = Scanner.Address THEN
  2113. Designate(x.left,operand);
  2114. operand.mode := ModeValue;
  2115. t0 := x.left.type.resolved;
  2116. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2117. ReleaseIntermediateOperand(operand.op);
  2118. operand.op := operand.tag;
  2119. IntermediateCode.InitOperand(operand.tag);
  2120. END;
  2121. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2122. result := operand;
  2123. ELSE HALT(100)
  2124. END;
  2125. destination := dest;
  2126. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2127. END VisitUnaryExpression;
  2128. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2129. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2130. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2131. BEGIN
  2132. type := type.resolved;
  2133. originalType := type;
  2134. IF type IS SyntaxTree.PointerType THEN
  2135. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2136. END;
  2137. IF type IS SyntaxTree.ObjectType THEN
  2138. BrL(trueL);
  2139. ELSE
  2140. ASSERT(type IS SyntaxTree.RecordType);
  2141. (*
  2142. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2143. *)
  2144. ReuseCopy(left,tag);
  2145. right := TypeDescriptorAdr(type);
  2146. IF ~newObjectFile THEN
  2147. IntermediateCode.MakeMemory(right,addressType);
  2148. END;
  2149. IF backend.cooperative THEN
  2150. repeatL := NewLabel();
  2151. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2152. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2153. END;
  2154. SetLabel(repeatL);
  2155. BreqL(trueL,left,right);
  2156. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2157. BrneL(repeatL,left,nil);
  2158. ELSIF meta.simple THEN
  2159. level := type(SyntaxTree.RecordType).Level();
  2160. (* get type desc tag of level relative to base tag *)
  2161. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2162. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2163. IntermediateCode.MakeMemory(left,addressType);
  2164. BreqL(trueL,left,right);
  2165. ELSE
  2166. level := type(SyntaxTree.RecordType).Level();
  2167. (* get type desc tag of level relative to base tag *)
  2168. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2169. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2170. IntermediateCode.MakeMemory(left,addressType);
  2171. BreqL(trueL,left,right);
  2172. END;
  2173. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2174. BrL(falseL);
  2175. END;
  2176. END TypeTest;
  2177. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2178. BEGIN
  2179. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2180. IF dump # NIL THEN
  2181. dump.String(s); dump.Ln;
  2182. END;
  2183. END Error;
  2184. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2185. BEGIN
  2186. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2187. IF dump # NIL THEN
  2188. dump.String(s); dump.Ln; dump.Update;
  2189. END;
  2190. END Warning;
  2191. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2192. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2193. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2194. operand:Operand;
  2195. BEGIN
  2196. previousSection := section;
  2197. Global.GetModuleName(mod,name);
  2198. Strings.Append(name,".@Trace");
  2199. Basic.ToSegmentedName(name, pooledName);
  2200. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2201. IF dump # NIL THEN dump := section.comments END;
  2202. IF backend.hasLinkRegister THEN
  2203. Emit(Push(Basic.invalidPosition, lr));
  2204. END;
  2205. variable := mod.moduleScope.firstVariable;
  2206. WHILE variable # NIL DO
  2207. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2208. Symbol(variable, operand);
  2209. register := operand.op;
  2210. CallTraceMethod(register, variable.type);
  2211. ReleaseIntermediateOperand(register);
  2212. END;
  2213. variable := variable.nextVariable;
  2214. END;
  2215. IF backend.hasLinkRegister THEN
  2216. Emit(Pop(Basic.invalidPosition, lr));
  2217. END;
  2218. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2219. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2220. Emit(Br(position,op));
  2221. INC(statCoopTraceModule, section.pc);
  2222. section := previousSection;
  2223. IF dump # NIL THEN dump := section.comments END;
  2224. END CreateTraceModuleMethod;
  2225. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2226. BEGIN
  2227. Emit (Push(position, dst));
  2228. Emit (Push(position, src));
  2229. CallThis(position,"GarbageCollector","Assign", 2);
  2230. END CallAssignPointer;
  2231. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2232. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2233. BEGIN
  2234. IF SemanticChecker.IsPointerType (type) THEN
  2235. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2236. ELSIF type.IsRecordType() THEN
  2237. Emit (Push(position,dst));
  2238. Emit (Push(position,src));
  2239. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2240. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2241. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2242. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2243. ELSIF IsStaticArray(type) THEN
  2244. size := StaticArrayNumElements(type);
  2245. base := StaticArrayBaseType(type);
  2246. IF base.IsRecordType() THEN
  2247. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2248. Emit (Push(position, dst));
  2249. Emit (Push(position, src));
  2250. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2251. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2252. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2253. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2254. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2255. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2256. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2257. Emit (Push(position, dst));
  2258. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2259. Emit (Push(position, src));
  2260. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2261. ELSE
  2262. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2263. Emit (Push(position, dst));
  2264. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2265. Emit (Push(position, src));
  2266. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2267. ASSERT(StaticArrayBaseType(type).IsPointer());
  2268. END;
  2269. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2270. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2271. Emit (Push(position, dst));
  2272. Emit (Push(position, src));
  2273. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2274. ELSE HALT(100); (* missing ? *)
  2275. END;
  2276. END CallAssignMethod;
  2277. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2278. VAR name: Basic.SegmentedName;
  2279. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2280. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2281. context: Context;
  2282. BEGIN
  2283. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2284. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2285. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2286. GetRecordTypeName (recordType,name);
  2287. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2288. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2289. IF dump # NIL THEN dump := section.comments END;
  2290. IF backend.hasLinkRegister THEN
  2291. Emit(Push(Basic.invalidPosition, lr));
  2292. END;
  2293. variable := recordType.recordScope.firstVariable;
  2294. WHILE variable # NIL DO
  2295. IF variable.NeedsTrace() THEN
  2296. dst := NewRegisterOperand (addressType);
  2297. src := NewRegisterOperand (addressType);
  2298. Emit (Mov(position, dst, parameter1));
  2299. Emit (Mov(position, src, parameter2));
  2300. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2301. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2302. CallAssignMethod(dst, src, variable.type);
  2303. ReleaseIntermediateOperand(src);
  2304. ReleaseIntermediateOperand(dst);
  2305. END;
  2306. variable := variable.nextVariable;
  2307. END;
  2308. recordBase := recordType.GetBaseRecord();
  2309. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2310. IF backend.hasLinkRegister THEN
  2311. Emit(Pop(Basic.invalidPosition, lr));
  2312. END;
  2313. GetRecordTypeName (recordBase,name);
  2314. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2315. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2316. Emit(Br(position,op));
  2317. ELSE
  2318. Emit(Exit(position,0,0, 0));
  2319. END;
  2320. IF ~recordType.isObject THEN
  2321. GetRecordTypeName (recordType,name);
  2322. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2323. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2324. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2325. NEW(registerUsageCount);
  2326. usedRegisters := NIL;
  2327. dst := NewRegisterOperand (addressType);
  2328. src := NewRegisterOperand (addressType);
  2329. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2330. Emit(Mov(position, dst, parameter1));
  2331. Emit(Mov(position, src, parameter2));
  2332. label := NewLabel();
  2333. SetLabel(label);
  2334. Emit(Push(position, dst));
  2335. Emit(Push(position, src));
  2336. GetRecordTypeName (recordType,name);
  2337. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2338. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2339. Emit(Call(position, op, 0));
  2340. Emit(Pop(position, src));
  2341. Emit(Pop(position, dst));
  2342. Emit(Add(position, dst, dst, ofs));
  2343. Emit(Add(position, src, src, ofs));
  2344. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2345. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2346. Emit(Exit(position,0,0, 0));
  2347. END;
  2348. INC(statCoopAssignProcedure, section.pc);
  2349. ReturnToContext(context);
  2350. IF dump # NIL THEN dump := section.comments END;
  2351. END CreateAssignProcedure;
  2352. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2353. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2354. BEGIN
  2355. IF IsUnsafePointer (type) THEN
  2356. skip := NewLabel();
  2357. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2358. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2359. BreqL (skip, op, nil);
  2360. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2361. SetLabel (skip);
  2362. ELSIF SemanticChecker.IsPointerType (type) THEN
  2363. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2364. CallThis(position,"GarbageCollector","Mark", 1);
  2365. ELSIF type.IsRecordType() THEN
  2366. Emit (Push(position,register));
  2367. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2368. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2369. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2370. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2371. ELSIF IsStaticArray(type) THEN
  2372. size := StaticArrayNumElements(type);
  2373. base := StaticArrayBaseType(type);
  2374. IF base.IsRecordType() THEN
  2375. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2376. Emit (Push(position, register));
  2377. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2378. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2379. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2380. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2381. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2382. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2383. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2384. Emit (Push(position, register));
  2385. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2386. ELSE
  2387. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2388. Emit (Push(position, register));
  2389. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2390. ASSERT(base.IsPointer());
  2391. END;
  2392. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2393. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2394. CallThis(position,"GarbageCollector","Mark", 1);
  2395. ELSE HALT(100); (* missing ? *)
  2396. END;
  2397. END CallTraceMethod;
  2398. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2399. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2400. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2401. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2402. BEGIN
  2403. previousSection := section;
  2404. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2405. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2406. GetRecordTypeName (recordType,name);
  2407. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2408. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2409. IF dump # NIL THEN dump := section.comments END;
  2410. IF backend.hasLinkRegister THEN
  2411. Emit(Push(Basic.invalidPosition, lr));
  2412. END;
  2413. variable := recordType.recordScope.firstVariable;
  2414. WHILE variable # NIL DO
  2415. IF variable.NeedsTrace() THEN
  2416. register := NewRegisterOperand (addressType);
  2417. Emit (Mov(position,register,parameter1));
  2418. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2419. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2420. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2421. END;
  2422. CallTraceMethod(register, variable.type);
  2423. ReleaseIntermediateOperand(register);
  2424. END;
  2425. variable := variable.nextVariable;
  2426. END;
  2427. recordBase := recordType.GetBaseRecord();
  2428. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2429. recordBase := recordBase.GetBaseRecord();
  2430. END;
  2431. IF recordBase # NIL THEN
  2432. IF backend.hasLinkRegister THEN
  2433. Emit(Pop(Basic.invalidPosition, lr));
  2434. END;
  2435. GetRecordTypeName (recordBase,name);
  2436. IF HasExplicitTraceMethod (recordBase) THEN
  2437. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2438. ELSE
  2439. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2440. END;
  2441. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2442. Emit(Br(position,op));
  2443. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2444. Emit(Exit(position,0,0,0));
  2445. ELSE
  2446. IF backend.hasLinkRegister THEN
  2447. Emit(Pop(Basic.invalidPosition, lr));
  2448. END;
  2449. IF recordType.isObject THEN
  2450. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2451. ELSE
  2452. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2453. END;
  2454. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2455. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2456. Emit(Br(position,op));
  2457. END;
  2458. IF ~recordType.isObject THEN
  2459. GetRecordTypeName (recordType,name);
  2460. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2461. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2462. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2463. NEW(registerUsageCount);
  2464. usedRegisters := NIL;
  2465. IF dump # NIL THEN dump := section.comments END;
  2466. register := NewRegisterOperand (addressType);
  2467. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2468. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2469. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2470. END;
  2471. Emit (Push(position,register));
  2472. GetRecordTypeName (recordType,name);
  2473. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2474. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2475. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2476. ReleaseIntermediateOperand(register);
  2477. Emit(Exit(position,0,0,0));
  2478. GetRecordTypeName (recordType,name);
  2479. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2480. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2481. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2482. NEW(registerUsageCount);
  2483. usedRegisters := NIL;
  2484. register := NewRegisterOperand (addressType);
  2485. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2486. Emit(Mov(position, register, parameter1));
  2487. label := NewLabel();
  2488. SetLabel(label);
  2489. Emit(Push(position, register));
  2490. GetRecordTypeName (recordType,name);
  2491. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2492. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2493. Emit(Call(position, op, 0));
  2494. Emit(Pop(position, register));
  2495. Emit(Add(position, register, register, ofs));
  2496. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2497. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2498. Emit(Exit(position,0,0,0));
  2499. END;
  2500. INC(statCoopTraceMethod, section.pc);
  2501. ReturnToContext(context);
  2502. IF dump # NIL THEN dump := section.comments END;
  2503. END CreateTraceMethod;
  2504. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2505. VAR name: Basic.SegmentedName;
  2506. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2507. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2508. context: Context;
  2509. BEGIN
  2510. IF recordType.isObject THEN RETURN END;
  2511. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2512. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2513. GetRecordTypeName (recordType,name);
  2514. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2515. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2516. IF dump # NIL THEN dump := section.comments END;
  2517. IF backend.hasLinkRegister THEN
  2518. Emit(Push(Basic.invalidPosition, lr));
  2519. END;
  2520. variable := recordType.recordScope.firstVariable;
  2521. WHILE variable # NIL DO
  2522. IF variable.NeedsTrace() THEN
  2523. dst := NewRegisterOperand (addressType);
  2524. Emit (Mov(position, dst, parameter1));
  2525. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2526. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2527. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2528. END;
  2529. CallResetProcedure(dst, nil, variable.type);
  2530. ReleaseIntermediateOperand(dst);
  2531. END;
  2532. variable := variable.nextVariable;
  2533. END;
  2534. recordBase := recordType.GetBaseRecord();
  2535. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2536. IF backend.hasLinkRegister THEN
  2537. Emit(Pop(Basic.invalidPosition, lr));
  2538. END;
  2539. GetRecordTypeName (recordBase,name);
  2540. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2541. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2542. Emit(Br(position,op));
  2543. ELSE
  2544. Emit(Exit(position,0,0, 0));
  2545. END;
  2546. GetRecordTypeName (recordType,name);
  2547. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2548. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2549. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2550. NEW(registerUsageCount);
  2551. usedRegisters := NIL;
  2552. dst := NewRegisterOperand (addressType);
  2553. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2554. Emit(Mov(position, dst, parameter1));
  2555. label := NewLabel();
  2556. SetLabel(label);
  2557. Emit(Push(position, dst));
  2558. GetRecordTypeName (recordType,name);
  2559. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2560. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2561. Emit(Call(position, op, 0));
  2562. Emit(Pop(position, dst));
  2563. Emit(Add(position, dst, dst, ofs));
  2564. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2565. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2566. Emit(Exit(position,0,0, 0));
  2567. INC(statCoopResetProcedure, section.pc);
  2568. ReturnToContext(context);
  2569. IF dump # NIL THEN dump := section.comments END;
  2570. END CreateResetProcedure;
  2571. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2572. VAR name: Basic.SegmentedName; context: Context;
  2573. BEGIN
  2574. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2575. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2576. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2577. IF dump # NIL THEN dump := section.comments END;
  2578. IF backend.hasLinkRegister THEN
  2579. Emit(Push(Basic.invalidPosition, lr));
  2580. END;
  2581. Emit(Push(position,fp));
  2582. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2583. ResetVariables(scope);
  2584. Emit(Pop(position,fp));
  2585. Emit(Exit(position,0,0, 0));
  2586. ReturnToContext(context);
  2587. IF dump # NIL THEN dump := section.comments END;
  2588. END CreateResetMethod;
  2589. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2590. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2591. BEGIN
  2592. IF SemanticChecker.IsPointerType (type) THEN
  2593. Emit (Push(position, dest));
  2594. CallThis(position,"GarbageCollector","Reset", 1);
  2595. ELSIF type.IsRecordType() THEN
  2596. Emit (Push(position, dest));
  2597. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2598. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2599. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2600. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2601. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2602. size := GetArrayLength(type, tag);
  2603. base := ArrayBaseType(type);
  2604. IF base.IsRecordType() THEN
  2605. Emit (Push(position, size));
  2606. Emit (Push(position, dest));
  2607. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2608. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2609. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2610. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2611. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2612. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2613. Emit (Push(position, size));
  2614. Emit (Push(position, dest));
  2615. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2616. ELSE
  2617. Emit (Push(position, size));
  2618. Emit (Push(position, dest));
  2619. CallThis(position,"GarbageCollector","ResetArray", 2);
  2620. ASSERT(ArrayBaseType(type).IsPointer());
  2621. END;
  2622. ReleaseIntermediateOperand(size);
  2623. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2624. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2625. Emit (Push(position, dest));
  2626. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2627. ELSE HALT(100); (* missing ? *)
  2628. END;
  2629. END CallResetProcedure;
  2630. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2631. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2632. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2633. VAR operand: Operand;
  2634. BEGIN
  2635. Symbol (symbol, operand);
  2636. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2637. ReleaseOperand(operand);
  2638. END Reset;
  2639. BEGIN
  2640. previousScope := currentScope;
  2641. currentScope := scope;
  2642. pc := section.pc;
  2643. variable := scope.firstVariable;
  2644. WHILE variable # NIL DO
  2645. IF variable.NeedsTrace() THEN
  2646. Reset (variable);
  2647. END;
  2648. variable := variable.nextVariable;
  2649. END;
  2650. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2651. WHILE parameter # NIL DO
  2652. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  2653. Reset (parameter);
  2654. END;
  2655. parameter := parameter.nextParameter;
  2656. END;
  2657. INC(statCoopResetVariables, section.pc - pc);
  2658. currentScope := previousScope;
  2659. END ResetVariables;
  2660. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2661. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2662. VAR op: IntermediateCode.Operand; context: Context;
  2663. BEGIN
  2664. previousSection := section;
  2665. GetCodeSectionNameForSymbol(procedure, name);
  2666. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2667. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2668. IF dump # NIL THEN dump := section.comments END;
  2669. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2670. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2671. Emit(Data(position,op));
  2672. Emit(Data(position,nil));
  2673. IF HasPointers (procedure.procedureScope) THEN
  2674. GetCodeSectionNameForSymbol(procedure, name);
  2675. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2676. ELSE
  2677. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2678. END;
  2679. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2680. Emit(Data(position,op));
  2681. ReturnToContext(context);
  2682. IF dump # NIL THEN dump := section.comments END;
  2683. END CreateProcedureDescriptor;
  2684. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2685. VAR import: SyntaxTree.Import;
  2686. s: Basic.MessageString;
  2687. selfName: SyntaxTree.IdentifierString;
  2688. BEGIN
  2689. moduleScope.ownerModule.GetName(selfName);
  2690. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2691. module := moduleScope.ownerModule
  2692. ELSE
  2693. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2694. IF import = NIL THEN
  2695. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2696. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2697. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2698. s := "Module ";
  2699. Strings.Append(s,moduleName);
  2700. Strings.Append(s," cannot be imported.");
  2701. IF force THEN
  2702. Error(position,s);
  2703. ELSIF canBeLoaded THEN
  2704. IF WarningDynamicLoading THEN
  2705. Strings.Append(s, "=> no dynamic linking.");
  2706. Warning(position, s);
  2707. END;
  2708. canBeLoaded := FALSE;
  2709. END;
  2710. RETURN FALSE
  2711. ELSE
  2712. SELF.module.imports.AddName(moduleName)
  2713. END;
  2714. ELSIF import.module = NIL THEN (* already tried *)
  2715. RETURN FALSE
  2716. END;
  2717. module := import.module;
  2718. END;
  2719. RETURN TRUE
  2720. END AddImport;
  2721. (* needed for old binary object file format*)
  2722. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2723. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2724. BEGIN
  2725. IF AddImport(moduleName,module,TRUE) THEN
  2726. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2727. IF procedure = NIL THEN
  2728. s := "Instruction not supported on target, emulation procedure ";
  2729. Strings.Append(s,moduleName);
  2730. Strings.Append(s,".");
  2731. Strings.Append(s,procedureName);
  2732. Strings.Append(s," not present");
  2733. Error(position,s);
  2734. ELSE
  2735. StaticCallOperand(r,procedure);
  2736. ReleaseOperand(r);
  2737. fp := GetFingerprint(procedure);
  2738. END;
  2739. END;
  2740. END EnsureSymbol;
  2741. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2742. VAR exit: Label; trueL,falseL: Label;
  2743. BEGIN
  2744. trueL := NewLabel();
  2745. falseL := NewLabel();
  2746. exit := NewLabel();
  2747. Condition(x,trueL,falseL);
  2748. InitOperand(result,ModeValue);
  2749. SetLabel(trueL);
  2750. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2751. Emit(Mov(position,result.op,true));
  2752. BrL(exit);
  2753. SetLabel(falseL);
  2754. Emit(MovReplace(position,result.op,false));
  2755. SetLabel(exit);
  2756. END ConditionToValue;
  2757. PROCEDURE ValueToCondition(VAR op: Operand);
  2758. BEGIN
  2759. LoadValue(op,system.booleanType);
  2760. BrneL(trueLabel,op.op, false);
  2761. ReleaseOperand(op);
  2762. BrL(falseLabel);
  2763. END ValueToCondition;
  2764. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2765. VAR size: LONGINT;
  2766. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2767. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2768. BEGIN
  2769. ASSERT(type.form = SyntaxTree.Open);
  2770. baseType := type.arrayBase.resolved;
  2771. IF IsOpenArray(baseType) THEN
  2772. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2773. ELSE
  2774. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2775. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2776. END;
  2777. len := tag;
  2778. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2779. IntermediateCode.MakeMemory(len,addressType);
  2780. UseIntermediateOperand(len);
  2781. Reuse2(res,sizeOperand,len);
  2782. Emit(Mul(position,res,sizeOperand,len));
  2783. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2784. RETURN res
  2785. END GetArraySize;
  2786. BEGIN
  2787. type := type.resolved;
  2788. IF IsOpenArray(type) THEN
  2789. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2790. RETURN tag
  2791. ELSE
  2792. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2793. END;
  2794. ELSE
  2795. size := ToMemoryUnits(system,system.SizeOf(type));
  2796. RETURN IntermediateCode.Immediate(addressType,size)
  2797. END;
  2798. END GetDynamicSize;
  2799. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2800. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2801. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2802. BEGIN
  2803. ASSERT(type.form = SyntaxTree.Open);
  2804. baseType := type.arrayBase.resolved;
  2805. IF IsOpenArray(baseType) THEN
  2806. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2807. ELSE
  2808. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2809. END;
  2810. len := tag;
  2811. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2812. IntermediateCode.MakeMemory(len,addressType);
  2813. UseIntermediateOperand(len);
  2814. Reuse2(res,sizeOperand,len);
  2815. Emit(Mul(position,res,sizeOperand,len));
  2816. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2817. RETURN res
  2818. END GetLength;
  2819. BEGIN
  2820. type := type.resolved;
  2821. IF IsOpenArray(type) THEN
  2822. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2823. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2824. ELSIF type IS SyntaxTree.StringType THEN
  2825. RETURN tag;
  2826. ELSE
  2827. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2828. END;
  2829. END GetArrayLength;
  2830. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2831. VAR result: IntermediateCode.Operand;
  2832. BEGIN
  2833. IF backend.cooperative THEN
  2834. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2835. ELSE
  2836. MakeMemory(result, tag, addressType, 0);
  2837. END;
  2838. RETURN result
  2839. END GetSizeFromTag;
  2840. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2841. VAR parameter: SyntaxTree.Parameter;
  2842. BEGIN
  2843. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2844. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2845. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2846. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2847. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2848. END;
  2849. RETURN GetDynamicSize(e.type, tag);
  2850. END GetArrayOfBytesSize;
  2851. (*
  2852. to find imported symbol. not needed ?
  2853. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2854. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2855. BEGIN
  2856. IF AddImport(moduleName,importedModule,FALSE) THEN
  2857. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2858. RETURN symbol
  2859. ELSE
  2860. RETURN NIL
  2861. END
  2862. END SymbolByName;
  2863. *)
  2864. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2865. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2866. BEGIN
  2867. IF AddImport(moduleName,runtimeModule,force) THEN
  2868. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2869. IF procedure = NIL THEN
  2870. s := "Procedure ";
  2871. Strings.Append(s,moduleName);
  2872. Strings.Append(s,".");
  2873. Strings.Append(s,procedureName);
  2874. Strings.Append(s," not present");
  2875. Error(position,s);
  2876. RETURN FALSE
  2877. ELSE
  2878. RETURN TRUE
  2879. END;
  2880. ELSE RETURN FALSE
  2881. END;
  2882. END GetRuntimeProcedure;
  2883. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  2884. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  2885. s: Basic.MessageString;
  2886. BEGIN
  2887. Basic.InitSegmentedName(name);
  2888. name[0] := Basic.MakeString(moduleName);
  2889. name[1] := Basic.MakeString(typeName);
  2890. name[2] := -1;
  2891. IF AddImport(moduleName,importedModule, FALSE) THEN
  2892. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  2893. IF symbol = NIL THEN
  2894. s := "type ";
  2895. Strings.Append(s,moduleName);
  2896. Strings.Append(s,".");
  2897. Strings.Append(s,typeName);
  2898. Strings.Append(s," not present");
  2899. Error(position,s);
  2900. END;
  2901. ELSE symbol := NIL;
  2902. END;
  2903. IF importedModule = moduleScope.ownerModule THEN
  2904. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2905. ELSE
  2906. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  2907. END;
  2908. RETURN symbol
  2909. END GetTypeDescriptor;
  2910. (* 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. *)
  2911. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  2912. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  2913. pooledName: Basic.SegmentedName; size: LONGINT;
  2914. BEGIN
  2915. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  2916. StaticCallOperand(result,procedure);
  2917. IF numberParameters < 0 THEN
  2918. size := ProcedureParametersSize(system,procedure);
  2919. ELSE
  2920. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  2921. IF checkNumParameters & (size # ProcedureParametersSize(system,procedure)) THEN
  2922. Error(position,"runtime call parameter count mismatch");
  2923. END;
  2924. END;
  2925. Emit(Call(position, result.op, size));
  2926. ReleaseOperand(result);
  2927. ELSE (* only static linking possible *)
  2928. ASSERT(numberParameters >= 0);
  2929. Basic.InitSegmentedName(pooledName);
  2930. pooledName[0] := Basic.MakeString(moduleName);
  2931. pooledName[1] := Basic.MakeString(procedureName);
  2932. pooledName[2] := -1;
  2933. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  2934. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  2935. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  2936. END;
  2937. END CallThisChecked;
  2938. (* 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. *)
  2939. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  2940. BEGIN
  2941. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  2942. END CallThis;
  2943. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  2944. VAR
  2945. left,right: Operand;
  2946. leftSize, rightSize: IntermediateCode.Operand;
  2947. saved: RegisterEntry;
  2948. reg: IntermediateCode.Operand;
  2949. procedureName: SyntaxTree.IdentifierString;
  2950. BEGIN
  2951. procedureName := "CompareString";
  2952. SaveRegisters();ReleaseUsedRegisters(saved);
  2953. Designate(leftExpression,left);
  2954. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2955. Emit(Push(position,leftSize));
  2956. ReleaseIntermediateOperand(leftSize);
  2957. Emit(Push(position,left.op));
  2958. ReleaseOperand(left);
  2959. Designate(rightExpression,right);
  2960. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  2961. Emit(Push(position,rightSize));
  2962. ReleaseIntermediateOperand(rightSize);
  2963. Emit(Push(position,right.op));
  2964. ReleaseOperand(right);
  2965. IF backend.cooperative THEN
  2966. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  2967. ELSE
  2968. CallThis(position,runtimeModuleName,procedureName, 4);
  2969. END;
  2970. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  2971. Emit(Result(position,reg));
  2972. (*
  2973. AcquireThisRegister(int8,IntermediateCode.Result);
  2974. *)
  2975. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  2976. (*
  2977. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  2978. *)
  2979. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  2980. ReleaseIntermediateOperand(reg);
  2981. BrL(falseLabel);
  2982. END CompareString;
  2983. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  2984. VAR
  2985. left,right: Operand;
  2986. leftSize, rightSize: IntermediateCode.Operand;
  2987. saved: RegisterEntry;
  2988. procedureName: SyntaxTree.IdentifierString;
  2989. BEGIN
  2990. procedureName := "CopyString";
  2991. SaveRegisters();ReleaseUsedRegisters(saved);
  2992. Designate(leftExpression,left);
  2993. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  2994. Emit(Push(position,leftSize));
  2995. ReleaseIntermediateOperand(leftSize);
  2996. Emit(Push(position,left.op));
  2997. ReleaseOperand(left);
  2998. Designate(rightExpression,right);
  2999. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3000. Emit(Push(position,rightSize));
  3001. ReleaseIntermediateOperand(rightSize);
  3002. Emit(Push(position,right.op));
  3003. ReleaseOperand(right);
  3004. IF backend.cooperative THEN
  3005. CallThis(position,DefaultRuntimeModuleName,procedureName, 4);
  3006. ELSE
  3007. CallThis(position,runtimeModuleName,procedureName,4);
  3008. END;
  3009. RestoreRegisters(saved);
  3010. END CopyString;
  3011. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3012. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3013. leftType,rightType: SyntaxTree.Type;
  3014. leftExpression,rightExpression : SyntaxTree.Expression;
  3015. componentType: IntermediateCode.Type;
  3016. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3017. size: LONGINT;
  3018. BEGIN
  3019. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3020. dest := destination; destination := emptyOperand;
  3021. leftType := x.left.type.resolved;
  3022. rightType := x.right.type.resolved;
  3023. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3024. CASE x.operator OF
  3025. Scanner.Or:
  3026. (* shortcut evaluation of left OR right *)
  3027. IF ~conditional THEN ConditionToValue(x);
  3028. ELSE
  3029. next := NewLabel();
  3030. Condition(x.left,trueLabel,next);
  3031. SetLabel(next);
  3032. Condition(x.right,trueLabel,falseLabel);
  3033. END;
  3034. |Scanner.And:
  3035. (* shortcut evaluation of left & right *)
  3036. IF ~conditional THEN ConditionToValue(x);
  3037. ELSE
  3038. next := NewLabel();
  3039. Condition(x.left,next,falseLabel);
  3040. SetLabel(next);
  3041. Condition(x.right,trueLabel,falseLabel);
  3042. END;
  3043. |Scanner.Is:
  3044. IF ~conditional THEN ConditionToValue(x);
  3045. ELSE
  3046. (* get type desc tag *)
  3047. IF IsPointerToRecord(leftType,recordType) THEN
  3048. Evaluate(x.left,left);
  3049. Dereference(left,recordType,IsUnsafePointer(leftType))
  3050. ELSE
  3051. Designate(x.left,left);
  3052. END;
  3053. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3054. ReleaseOperand(left);
  3055. END;
  3056. |Scanner.Plus:
  3057. Evaluate(x.left,left);
  3058. Evaluate(x.right,right);
  3059. IF leftType IS SyntaxTree.SetType THEN
  3060. InitOperand(result,ModeValue);
  3061. Reuse2a(result.op,left.op,right.op,dest);
  3062. Emit(Or(position,result.op,left.op,right.op));
  3063. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3064. InitOperand(result,ModeValue);
  3065. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3066. Reuse2(result.tag,left.tag,right.tag);
  3067. Emit(Add(position,result.op,left.op,right.op));
  3068. Emit(Add(position,result.tag,left.tag,right.tag))
  3069. ELSE
  3070. InitOperand(result,ModeValue);
  3071. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3072. AddInt(result.op, left.op, right.op) ;
  3073. ELSE
  3074. *)
  3075. Reuse2a(result.op,left.op,right.op,dest);
  3076. Emit(Add(position,result.op,left.op,right.op));
  3077. (*
  3078. END;
  3079. *)
  3080. END;
  3081. ReleaseOperand(left); ReleaseOperand(right);
  3082. |Scanner.Minus:
  3083. Evaluate(x.left,left);
  3084. Evaluate(x.right,right);
  3085. IF leftType IS SyntaxTree.SetType THEN
  3086. InitOperand(result,ModeValue);
  3087. Reuse1(result.op,right.op);
  3088. Emit(Not(position,result.op,right.op));
  3089. ReleaseOperand(right);
  3090. Emit(And(position,result.op,result.op,left.op));
  3091. ReleaseOperand(left);
  3092. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3093. InitOperand(result,ModeValue);
  3094. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3095. Reuse2(result.tag,left.tag,right.tag);
  3096. Emit(Sub(position,result.op,left.op,right.op));
  3097. Emit(Sub(position,result.tag,left.tag,right.tag));
  3098. ReleaseOperand(left); ReleaseOperand(right)
  3099. ELSE
  3100. InitOperand(result,ModeValue);
  3101. Reuse2a(result.op,left.op,right.op,dest);
  3102. Emit(Sub(position,result.op,left.op,right.op));
  3103. ReleaseOperand(left); ReleaseOperand(right);
  3104. END;
  3105. |Scanner.Times:
  3106. Evaluate(x.left,left);
  3107. Evaluate(x.right,right);
  3108. IF leftType IS SyntaxTree.SetType THEN
  3109. InitOperand(result,ModeValue);
  3110. Reuse2a(result.op,left.op,right.op,dest);
  3111. Emit(And(position,result.op,left.op,right.op));
  3112. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3113. InitOperand(result, ModeValue);
  3114. componentType := left.op.type;
  3115. (* TODO: review this *)
  3116. (*
  3117. result.op = left.op * right.op - left.tag * right.tag
  3118. result.tag = left.tag * right.op + left.op * right.tag
  3119. *)
  3120. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3121. Emit(Mul(position,result.op, left.op, right.op));
  3122. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3123. Emit(Mul(position,tempReg, left.tag, right.tag));
  3124. Emit(Sub(position,result.op, result.op, tempReg));
  3125. Reuse2(result.tag, left.tag, right.op);
  3126. Emit(Mul(position,result.tag, left.tag, right.op));
  3127. Emit(Mul(position,tempReg, left.op, right.tag));
  3128. Emit(Add(position,result.tag, result.tag, tempReg));
  3129. ReleaseIntermediateOperand(tempReg)
  3130. ELSE
  3131. InitOperand(result,ModeValue);
  3132. Reuse2a(result.op,left.op,right.op,dest);
  3133. Emit(Mul(position,result.op,left.op,right.op));
  3134. END;
  3135. ReleaseOperand(left); ReleaseOperand(right);
  3136. |Scanner.Div:
  3137. Evaluate(x.left,left);
  3138. Evaluate(x.right,right);
  3139. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3140. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3141. IF ~isUnchecked THEN
  3142. exit := NewLabel();
  3143. BrltL(exit,zero,right.op);
  3144. EmitTrap(position,NegativeDivisorTrap);
  3145. SetLabel(exit);
  3146. END;
  3147. END;
  3148. InitOperand(result,ModeValue);
  3149. Reuse2a(result.op,left.op,right.op,dest);
  3150. Emit(Div(position,result.op,left.op,right.op));
  3151. ReleaseOperand(left); ReleaseOperand(right);
  3152. |Scanner.Mod:
  3153. Evaluate(x.left,left);
  3154. Evaluate(x.right,right);
  3155. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3156. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3157. IF ~isUnchecked THEN
  3158. exit := NewLabel();
  3159. BrltL(exit,zero,right.op);
  3160. EmitTrap(position,NegativeDivisorTrap);
  3161. SetLabel(exit);
  3162. END;
  3163. END;
  3164. InitOperand(result,ModeValue);
  3165. Reuse2a(result.op,left.op,right.op,dest);
  3166. Emit(Mod(position,result.op,left.op,right.op));
  3167. ReleaseOperand(left); ReleaseOperand(right);
  3168. |Scanner.Slash:
  3169. Evaluate(x.left,left);
  3170. Evaluate(x.right,right);
  3171. IF leftType IS SyntaxTree.SetType THEN
  3172. InitOperand(result,ModeValue);
  3173. Reuse2a(result.op,left.op,right.op,dest);
  3174. Emit(Xor(position,result.op,left.op,right.op));
  3175. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3176. InitOperand(result,ModeValue);
  3177. componentType := left.op.type;
  3178. (* review this *)
  3179. (*
  3180. divisor = right.op * right.op + right.tag * right.tag
  3181. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3182. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3183. *)
  3184. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3185. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3186. Emit(Mul(position,tempReg, right.op, right.op));
  3187. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3188. Emit(Add(position,tempReg, tempReg, tempReg2));
  3189. result.op := tempReg2;
  3190. Emit(Mul(position,result.op, left.op, right.op));
  3191. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3192. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3193. Emit(Add(position,result.op, result.op, tempReg2));
  3194. Emit(Div(position,result.op, result.op, tempReg));
  3195. Reuse2(result.tag, left.tag, right.op);
  3196. Emit(Mul(position,result.tag, left.tag, right.op));
  3197. Emit(Mul(position,tempReg2, left.op, right.tag));
  3198. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3199. Emit(Div(position,result.tag, result.tag, tempReg));
  3200. ReleaseIntermediateOperand(tempReg);
  3201. ReleaseIntermediateOperand(tempReg2)
  3202. ELSE
  3203. InitOperand(result,ModeValue);
  3204. Reuse2a(result.op,left.op,right.op,dest);
  3205. Emit(Div(position,result.op,left.op,right.op));
  3206. END;
  3207. ReleaseOperand(left); ReleaseOperand(right);
  3208. |Scanner.Equal:
  3209. IF ~conditional THEN ConditionToValue(x);
  3210. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3211. CompareString(BreqL,x.left,x.right);
  3212. ELSE
  3213. Evaluate(x.left,left);
  3214. Evaluate(x.right,right);
  3215. IF leftType IS SyntaxTree.RangeType THEN
  3216. ASSERT(rightType IS SyntaxTree.RangeType);
  3217. BrneL(falseLabel, left.op, right.op); (* first *)
  3218. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3219. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3220. ReleaseOperand(left); ReleaseOperand(right);
  3221. BrL(trueLabel)
  3222. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3223. BrneL(falseLabel, left.op, right.op); (* first *)
  3224. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3225. ReleaseOperand(left); ReleaseOperand(right);
  3226. BrL(trueLabel)
  3227. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3228. (* TODO: review this *)
  3229. BrneL(falseLabel, left.op, right.op); (* real part *)
  3230. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3231. ReleaseOperand(left); ReleaseOperand(right);
  3232. BrL(trueLabel)
  3233. ELSE
  3234. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3235. ReleaseOperand(left); ReleaseOperand(right);
  3236. BrL(trueLabel);
  3237. END;
  3238. END;
  3239. |Scanner.LessEqual:
  3240. IF ~conditional THEN ConditionToValue(x);
  3241. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3242. CompareString(BrgeL,x.right,x.left);
  3243. ELSE
  3244. Evaluate(x.left,left);
  3245. Evaluate(x.right,right);
  3246. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3247. Reuse1(temp.op,right.op);
  3248. Emit(And(position,temp.op,left.op,right.op));
  3249. ReleaseOperand(right);
  3250. BreqL(trueLabel,temp.op,left.op);
  3251. BrL(falseLabel);
  3252. ReleaseOperand(temp);ReleaseOperand(left);
  3253. ELSE
  3254. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3255. ReleaseOperand(left); ReleaseOperand(right);
  3256. BrL(trueLabel);
  3257. END;
  3258. END;
  3259. |Scanner.Less:
  3260. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3261. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3262. leftExpression.SetType(system.booleanType);
  3263. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3264. rightExpression.SetType(system.booleanType);
  3265. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3266. leftExpression.SetType(system.booleanType);
  3267. Expression(leftExpression);
  3268. ELSIF ~conditional THEN ConditionToValue(x);
  3269. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3270. CompareString(BrltL,x.left,x.right);
  3271. ELSE
  3272. Evaluate(x.left,left);
  3273. Evaluate(x.right,right);
  3274. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3275. ReleaseOperand(left); ReleaseOperand(right);
  3276. BrL(trueLabel);
  3277. END;
  3278. |Scanner.Greater:
  3279. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3280. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3281. leftExpression.SetType(system.booleanType);
  3282. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3283. rightExpression.SetType(system.booleanType);
  3284. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3285. leftExpression.SetType(system.booleanType);
  3286. Expression(leftExpression);
  3287. ELSIF ~conditional THEN ConditionToValue(x);
  3288. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3289. CompareString(BrltL,x.right,x.left);
  3290. ELSE
  3291. Evaluate(x.left,left);
  3292. Evaluate(x.right,right);
  3293. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3294. ReleaseOperand(left); ReleaseOperand(right);
  3295. BrL(trueLabel);
  3296. END;
  3297. |Scanner.GreaterEqual:
  3298. IF ~conditional THEN ConditionToValue(x);
  3299. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3300. CompareString(BrgeL,x.left,x.right);
  3301. ELSE
  3302. Evaluate(x.left,left);
  3303. Evaluate(x.right,right);
  3304. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3305. Reuse1(temp.op,left.op);
  3306. Emit(And(position,temp.op,left.op,right.op));
  3307. ReleaseOperand(left);
  3308. BreqL(trueLabel, temp.op,right.op);
  3309. ReleaseOperand(temp); ReleaseOperand(right);
  3310. BrL(falseLabel);
  3311. ELSE
  3312. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3313. ReleaseOperand(left); ReleaseOperand(right);
  3314. BrL(trueLabel);
  3315. END;
  3316. END;
  3317. |Scanner.Unequal:
  3318. IF ~conditional THEN ConditionToValue(x);
  3319. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3320. CompareString(BrneL,x.left,x.right);
  3321. ELSE
  3322. Evaluate(x.left,left);
  3323. Evaluate(x.right,right);
  3324. IF leftType IS SyntaxTree.RangeType THEN
  3325. ASSERT(rightType IS SyntaxTree.RangeType);
  3326. BrneL(trueLabel, left.op, right.op); (* first *)
  3327. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3328. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3329. ReleaseOperand(left); ReleaseOperand(right);
  3330. BrL(falseLabel)
  3331. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3332. BrneL(trueLabel, left.op, right.op); (* first *)
  3333. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3334. ReleaseOperand(left); ReleaseOperand(right);
  3335. BrL(falseLabel)
  3336. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3337. (* TODO: review this *)
  3338. BrneL(trueLabel, left.op, right.op); (* real part *)
  3339. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3340. ReleaseOperand(left); ReleaseOperand(right);
  3341. BrL(falseLabel)
  3342. ELSE
  3343. BreqL(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.In:
  3349. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3350. Evaluate(x.left,left);
  3351. Evaluate(x.right,right);
  3352. Convert(left.op,setType);
  3353. ReuseCopy(temp.op,right.op);
  3354. Emit(Shr(position,temp.op,temp.op,left.op));
  3355. ReleaseOperand(right); ReleaseOperand(left);
  3356. IntermediateCode.InitImmediate(one,setType,1);
  3357. Emit(And(position,temp.op,temp.op,one));
  3358. IF conditional THEN
  3359. IntermediateCode.InitImmediate(zero,setType,0);
  3360. BrneL(trueLabel,temp.op,zero);
  3361. ReleaseOperand(temp);
  3362. BrL(falseLabel);
  3363. ELSE
  3364. Convert(temp.op,bool);
  3365. result.mode := ModeValue;
  3366. result.op := temp.op;
  3367. result.tag := nil; (* may be left over from calls to evaluate *)
  3368. END;
  3369. ELSE
  3370. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3371. IF x.operator = Scanner.Questionmarks THEN
  3372. leftExpression := x.left;
  3373. rightExpression := x.right;
  3374. ELSE
  3375. leftExpression := x.right;
  3376. rightExpression := x.left;
  3377. END;
  3378. Evaluate(leftExpression, left);
  3379. Emit(Push(position,left.op));
  3380. ReleaseOperand(left);
  3381. Designate(rightExpression, right);
  3382. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3383. IF ~backend.cellsAreObjects THEN
  3384. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3385. END;
  3386. Emit(Push(position,right.op));
  3387. ReleaseOperand(right);
  3388. IF backend.cellsAreObjects THEN
  3389. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3390. ELSE
  3391. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3392. END;
  3393. InitOperand(result, ModeValue);
  3394. result.op := NewRegisterOperand(bool);
  3395. Emit(Result(position,result.op));
  3396. IF conditional THEN
  3397. IntermediateCode.InitImmediate(zero,setType,0);
  3398. BrneL(trueLabel,result.op,zero);
  3399. ReleaseOperand(result);
  3400. BrL(falseLabel);
  3401. END;
  3402. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3403. leftExpression := x.left;
  3404. rightExpression := x.right;
  3405. Evaluate(leftExpression, left);
  3406. Emit(Push(position,left.op));
  3407. ReleaseOperand(left);
  3408. Evaluate(rightExpression, right);
  3409. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3410. IF ~backend.cellsAreObjects THEN
  3411. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3412. END;
  3413. Emit(Push(position,right.op));
  3414. ReleaseOperand(right);
  3415. IF backend.cellsAreObjects THEN
  3416. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3417. ELSE
  3418. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3419. END;
  3420. InitOperand(result, ModeValue);
  3421. result.op := NewRegisterOperand(bool);
  3422. Emit(Result(position,result.op));
  3423. IF conditional THEN
  3424. IntermediateCode.InitImmediate(zero,setType,0);
  3425. BrneL(trueLabel,result.op,zero);
  3426. ReleaseOperand(result);
  3427. BrL(falseLabel);
  3428. END;
  3429. ELSE
  3430. HALT(100);
  3431. END;
  3432. END;
  3433. destination := dest;
  3434. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3435. END VisitBinaryExpression;
  3436. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3437. VAR localResult, operand: Operand;
  3438. BEGIN
  3439. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3440. InitOperand(localResult, ModeValue);
  3441. ASSERT(x.first # NIL);
  3442. Evaluate(x.first, operand);
  3443. localResult.op := operand.op;
  3444. ReleaseOperand(operand);
  3445. UseIntermediateOperand(localResult.op);
  3446. ASSERT(x.last # NIL);
  3447. Evaluate(x.last, operand);
  3448. localResult.tag := operand.op;
  3449. ReleaseOperand(operand);
  3450. UseIntermediateOperand(localResult.tag);
  3451. IF x.step # NIL THEN
  3452. Evaluate(x.step, operand);
  3453. localResult.extra := operand.op;
  3454. ReleaseOperand(operand);
  3455. UseIntermediateOperand(localResult.extra);
  3456. END;
  3457. result := localResult;
  3458. IF Trace THEN TraceExit("VisitRangeExpression") END
  3459. END VisitRangeExpression;
  3460. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3461. BEGIN
  3462. HALT(100); (* should never be evaluated *)
  3463. END VisitTensorRangeExpression;
  3464. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3465. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3466. BEGIN
  3467. IF Trace THEN TraceEnter("VisitConversion") END;
  3468. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3469. dest := destination; destination := emptyOperand;
  3470. Evaluate(x.expression,old);
  3471. InitOperand(result,ModeValue);
  3472. result.op := old.op;
  3473. ASSERT(result.op.mode # 0);
  3474. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3475. (* convert TO a complex number *)
  3476. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3477. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3478. ASSERT(result.op.mode # 0);
  3479. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3480. (* convert FROM a complex number TO a complex number*)
  3481. result.tag := old.tag;
  3482. ASSERT(result.tag.mode # 0);
  3483. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3484. ASSERT(result.tag.mode # 0)
  3485. ELSE
  3486. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3487. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3488. END
  3489. ELSE
  3490. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3491. ASSERT(result.op.mode # 0);
  3492. result.tag := old.tag; (*! probably never used *)
  3493. END;
  3494. destination := dest;
  3495. IF Trace THEN TraceExit("VisitConversion") END;
  3496. END VisitConversion;
  3497. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3498. BEGIN
  3499. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3500. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3501. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3502. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3503. END VisitTypeDeclaration;
  3504. (** designators (expressions) *)
  3505. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3506. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3507. BEGIN
  3508. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3509. IF x.left # NIL THEN Expression(x.left) END;
  3510. Symbol(x.symbol,result);
  3511. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3512. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3513. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3514. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3515. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3516. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3517. END;
  3518. END;
  3519. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3520. END VisitSymbolDesignator;
  3521. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3522. BEGIN
  3523. IF isUnchecked THEN RETURN END;
  3524. IF tagsAvailable THEN
  3525. TrapC(BrltL,index,length,IndexCheckTrap);
  3526. END;
  3527. END BoundCheck;
  3528. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3529. VAR d: IntermediateCode.Operand;
  3530. BEGIN
  3531. IF isUnchecked THEN RETURN END;
  3532. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3533. TrapC(op,dim,d,ArraySizeTrap);
  3534. ReleaseIntermediateOperand(d);
  3535. END DimensionCheck;
  3536. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3537. VAR
  3538. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3539. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3540. expression: SyntaxTree.Expression;
  3541. resultingType, leftType, baseType: SyntaxTree.Type;
  3542. skipLabel1: Label;
  3543. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3544. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3545. variableOp: Operand;
  3546. variable: SyntaxTree.Variable;
  3547. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3548. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3549. VAR e: SyntaxTree.Expression; i: LONGINT;
  3550. BEGIN
  3551. tensorFound := FALSE;
  3552. FOR i := 0 TO parameters.Length()-1 DO
  3553. e := parameters.GetExpression(i);
  3554. IF e IS SyntaxTree.TensorRangeExpression THEN
  3555. ASSERT(~tensorFound);
  3556. tensorFound := TRUE;
  3557. ELSIF e IS SyntaxTree.RangeExpression THEN
  3558. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3559. ELSE
  3560. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3561. END;
  3562. END;
  3563. END CountIndices;
  3564. BEGIN
  3565. ASSERT(tagsAvailable);
  3566. resultingType := x.type.resolved; (* resulting type *)
  3567. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3568. InitOperand(localResult, ModeReference);
  3569. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3570. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3571. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3572. (* a globally defined array destination tag is available -> use and invalidate it*)
  3573. localResult.tag := arrayDestinationTag;
  3574. IntermediateCode.InitOperand(arrayDestinationTag)
  3575. ELSE
  3576. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3577. (* the result is of array range type and thus does not provide any collectable pointers *)
  3578. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3579. Symbol(variable, variableOp);
  3580. ReuseCopy(localResult.tag, variableOp.op);
  3581. ReleaseOperand(variableOp);
  3582. END
  3583. END;
  3584. indexListSize := x.parameters.Length();
  3585. CountIndices(x.parameters);
  3586. (*ASSERT(tensorRangeCount <= 1);*)
  3587. (* designate the array to be indexed over, perform tensor range check if known *)
  3588. Designate(x.left, array);
  3589. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3590. Dereference(array, leftType,FALSE);
  3591. IF ~tensorFound THEN
  3592. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3593. END
  3594. END;
  3595. (* default base offset *)
  3596. srcDimOffset := 0;
  3597. destDimOffset := 0;
  3598. indexDim := 0;
  3599. (* use address of source array as basis *)
  3600. localResult.op := array.op;
  3601. UseIntermediateOperand(localResult.op);
  3602. (* go through the index list *)
  3603. FOR i := 0 TO indexListSize - 1 DO
  3604. expression := x.parameters.GetExpression(i);
  3605. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3606. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3607. srcDimOffset := -indexListSize;
  3608. destDimOffset := -suffixRanges;
  3609. ELSE
  3610. (* determine which dimension of source array is currently looked at *)
  3611. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3612. (* get the memory operand pointing to array descriptor dimension *)
  3613. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3614. (* make a reusable register from it *)
  3615. ReuseCopy(srcDim, tmp);
  3616. ReleaseIntermediateOperand(tmp);
  3617. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3618. ELSE
  3619. srcDim := IntermediateCode.Immediate(sizeType, i);
  3620. END;
  3621. (* get length and increment of source array for current dimension *)
  3622. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3623. Convert(sourceLength.op, sizeType);
  3624. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3625. Convert(sourceIncrement.op, sizeType);
  3626. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3627. ReleaseIntermediateOperand(srcDim);
  3628. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3629. (* SINGLE INDEX *)
  3630. Evaluate(expression, index);
  3631. ReleaseIntermediateOperand(index.tag);
  3632. index.tag := emptyOperand;
  3633. Convert(index.op, sizeType);
  3634. (* lower bound check *)
  3635. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3636. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3637. ELSIF isUnchecked THEN (* do nothing *)
  3638. ELSE
  3639. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3640. END;
  3641. (* upper bound check *)
  3642. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3643. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3644. ELSIF isUnchecked THEN (* do nothing *)
  3645. ELSE
  3646. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3647. END;
  3648. ReleaseOperand(sourceLength);
  3649. Convert(index.op, addressType);
  3650. summand := index.op;
  3651. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3652. (* RANGE OF INDICES *)
  3653. Evaluate(expression, range);
  3654. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3655. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3656. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3657. ReleaseOperand(range);
  3658. Convert(firstIndex, sizeType);
  3659. Convert(lastIndex, sizeType);
  3660. Convert(stepSize, sizeType);
  3661. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3662. if it is 'MAX(LONGINT)' *)
  3663. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3664. TransferToRegister(lastIndex, lastIndex);
  3665. skipLabel1 := NewLabel();
  3666. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3667. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3668. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3669. SetLabel(skipLabel1)
  3670. END;
  3671. (* check if step size is valid *)
  3672. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3673. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3674. ELSIF isUnchecked THEN (* do nothing *)
  3675. ELSE
  3676. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3677. END;
  3678. (* check lower bound check *)
  3679. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3680. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3681. ELSIF isUnchecked THEN (* do nothing *)
  3682. ELSE
  3683. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3684. END;
  3685. (* check upper bound check *)
  3686. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3687. (* statically open range: nothing to do *)
  3688. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3689. ASSERT(staticLastIndex < staticSourceLength)
  3690. ELSIF isUnchecked THEN (* do nothing *)
  3691. ELSE
  3692. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3693. END;
  3694. (* determine length of target array for current dimension *)
  3695. (* 1. incorporate last index: *)
  3696. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3697. (* last index is static *)
  3698. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3699. targetLength := sourceLength.op
  3700. ELSE
  3701. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3702. END;
  3703. UseIntermediateOperand(targetLength);
  3704. ELSE
  3705. (* targetLength := lastIndex + 1
  3706. Reuse1(targetLength, lastIndex);
  3707. *)
  3708. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3709. END;
  3710. ReleaseOperand(sourceLength);
  3711. ReleaseIntermediateOperand(lastIndex);
  3712. (* 2. incorporate first index: *)
  3713. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3714. (* first index and current target length are static *)
  3715. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3716. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3717. (* first index = 0: nothing to do *)
  3718. ELSE
  3719. (* targetLength := targetLength - firstIndex *)
  3720. TransferToRegister(targetLength, targetLength);
  3721. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3722. END;
  3723. (* clip negative lengths to 0 *)
  3724. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3725. IF staticTargetLength < 0 THEN
  3726. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3727. END
  3728. ELSE
  3729. skipLabel1 := NewLabel();
  3730. TransferToRegister(targetLength, targetLength);
  3731. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3732. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3733. SetLabel(skipLabel1)
  3734. END;
  3735. (* 3. incorporate index step size: *)
  3736. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3737. (*step size and current target length are static *)
  3738. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3739. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3740. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3741. (* step size = 1: nothing to do *)
  3742. ELSE
  3743. (* emit code for this:
  3744. targetLength := (targetLength-1) DIV stepSize +1;
  3745. *)
  3746. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3747. DivInt(targetLength, targetLength, stepSize);
  3748. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3749. END;
  3750. (* determine increment of target array for current dimension *)
  3751. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3752. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3753. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3754. (* step size = 1 *)
  3755. targetIncrement := sourceIncrement.op;
  3756. UseIntermediateOperand(targetIncrement)
  3757. ELSE
  3758. (* targetIncrement := sourceIncrement * stepSize *)
  3759. Reuse1(targetIncrement, stepSize);
  3760. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3761. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3762. END;
  3763. ReleaseIntermediateOperand(stepSize);
  3764. (* write length and increment of target array to descriptor *)
  3765. IF destDimOffset < 0 THEN
  3766. (* determine which dimension of target array is currently looked at *)
  3767. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3768. TransferToRegister(destDim, tmp);
  3769. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3770. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3771. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3772. ReleaseIntermediateOperand(destDim);
  3773. INC(destDimOffset);
  3774. ELSE
  3775. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3776. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3777. END;
  3778. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3779. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3780. INC(indexDim);
  3781. Convert(firstIndex, addressType);
  3782. TransferToRegister(summand, firstIndex);
  3783. ELSE HALT(100);
  3784. END;
  3785. (*
  3786. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3787. *)
  3788. Convert(sourceIncrement.op, addressType);
  3789. Convert(summand, addressType);
  3790. MulInt(summand, summand, sourceIncrement.op);
  3791. ReleaseIntermediateOperand(sourceIncrement.op);
  3792. AddInt(localResult.op, localResult.op, summand);
  3793. ReleaseIntermediateOperand(summand);
  3794. END
  3795. END;
  3796. result := localResult;
  3797. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3798. ReleaseIntermediateOperand(result.tag);
  3799. result.tag := TypeDescriptorAdr(resultingType);
  3800. IF ~newObjectFile THEN
  3801. IntermediateCode.MakeMemory(result.tag,addressType);
  3802. END;
  3803. ELSIF IsDelegate(resultingType) THEN
  3804. ReleaseIntermediateOperand(result.tag);
  3805. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3806. UseIntermediateOperand(result.tag);
  3807. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3808. ReleaseIntermediateOperand(result.tag);
  3809. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3810. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3811. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3812. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3813. (* finalize target array descriptor *)
  3814. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3815. (* write lengths and increments of target array for remaining dimensions *)
  3816. i := indexListSize;
  3817. WHILE indexDim < targetArrayDimensionality DO
  3818. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3819. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3820. ReleaseOperand(sourceLength);
  3821. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3822. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3823. ReleaseOperand(sourceIncrement);
  3824. INC(i); INC(indexDim);
  3825. END;
  3826. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3827. tmp := nil;
  3828. ELSE
  3829. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3830. END;
  3831. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3832. ReleaseIntermediateOperand(tmp);
  3833. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3834. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3835. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3836. ELSE
  3837. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3838. END;
  3839. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3840. ReleaseIntermediateOperand(tmp);
  3841. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3842. (* write dimensionality *)
  3843. IF targetArrayDimensionality # 0 THEN
  3844. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3845. END;
  3846. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3847. END;
  3848. ReleaseOperand(array);
  3849. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3850. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3851. END;
  3852. END MathIndexDesignator;
  3853. (* get the length of an array , trying to make use of static information *)
  3854. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3855. VAR res: IntermediateCode.Operand; size: LONGINT;
  3856. BEGIN
  3857. type := type.resolved;
  3858. IF type IS SyntaxTree.ArrayType THEN
  3859. WITH type: SyntaxTree.ArrayType DO
  3860. IF type.form = SyntaxTree.Static THEN
  3861. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3862. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3863. Evaluate(type.length, op);
  3864. ReleaseIntermediateOperand(op.tag);
  3865. RETURN op.op;*)
  3866. ELSE
  3867. res := tag;
  3868. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3869. IntermediateCode.MakeMemory(res,addressType);
  3870. UseIntermediateOperand(res);
  3871. RETURN res
  3872. END
  3873. END;
  3874. ELSE
  3875. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3876. RETURN IntermediateCode.Immediate(addressType,size);
  3877. END;
  3878. END ArrayLength;
  3879. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  3880. BEGIN
  3881. IF IsImmediate(x) THEN
  3882. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  3883. ELSE
  3884. IF ~ReusableRegister(res) THEN
  3885. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3886. ELSE
  3887. UseIntermediateOperand(res);
  3888. END;
  3889. Emit(Mov(position,res,x))
  3890. END;
  3891. END CopyInt;
  3892. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3893. BEGIN
  3894. ReleaseIntermediateOperand(res);
  3895. IF IsImmediate(x) & IsImmediate(y) THEN
  3896. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  3897. ELSIF IsAddress(x) & IsImmediate(y) THEN
  3898. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  3899. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  3900. ELSIF IsAddress(y) & IsImmediate(x) THEN
  3901. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  3902. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  3903. ELSIF IsRegister(x) & IsImmediate(y) THEN
  3904. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  3905. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  3906. UseIntermediateOperand(res);
  3907. ELSIF IsRegister(y) & IsImmediate(x) THEN
  3908. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  3909. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  3910. UseIntermediateOperand(res);
  3911. ELSE
  3912. IF ~ReusableRegister(res) THEN
  3913. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3914. ELSE
  3915. UseIntermediateOperand(res);
  3916. END;
  3917. IF IsImmediate(x) & (x.intValue = 0) THEN
  3918. Emit(Mov(position,res,y))
  3919. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  3920. Emit(Mov(position,res,x))
  3921. ELSE
  3922. Emit(Add(position,res, x, y));
  3923. END;
  3924. END;
  3925. END AddInt;
  3926. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3927. BEGIN
  3928. ReleaseIntermediateOperand(res);
  3929. IF IsImmediate(x) & IsImmediate(y) THEN
  3930. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  3931. ELSE
  3932. IF ~ReusableRegister(res) THEN
  3933. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3934. ELSE UseIntermediateOperand(res);
  3935. END;
  3936. IF IsImmediate(x) & (x.intValue = 1) THEN
  3937. Emit(Mov(position,res,y))
  3938. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3939. Emit(Mov(position,res,x))
  3940. ELSE
  3941. Emit(Mul(position,res, x, y));
  3942. END;
  3943. END;
  3944. END MulInt;
  3945. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  3946. BEGIN
  3947. ReleaseIntermediateOperand(res);
  3948. IF IsImmediate(x) & IsImmediate(y) THEN
  3949. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  3950. ELSE
  3951. IF ~ReusableRegister(res) THEN
  3952. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3953. ELSE UseIntermediateOperand(res);
  3954. END;
  3955. IF IsImmediate(x) & (x.intValue = 1) THEN
  3956. Emit(Mov(position,res,y))
  3957. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  3958. Emit(Mov(position,res,x))
  3959. ELSE
  3960. Emit(Div(position,res, x, y));
  3961. END;
  3962. END;
  3963. END DivInt;
  3964. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  3965. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  3966. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  3967. BEGIN
  3968. type := x.left.type.resolved;
  3969. IF type IS SyntaxTree.StringType THEN
  3970. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  3971. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  3972. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  3973. type := atype;
  3974. x.left.SetType(type);
  3975. END;
  3976. IntermediateCode.InitImmediate(res,addressType,0);
  3977. maxDim := x.parameters.Length()-1;
  3978. (*
  3979. computation rule:
  3980. a: ARRAY X,Y,Z OF Element with size S
  3981. a[i,j,k] -->
  3982. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  3983. *)
  3984. FOR i := 0 TO maxDim DO
  3985. e := x.parameters.GetExpression(i);
  3986. Evaluate(e,index);
  3987. Convert(index.op,addressType);
  3988. AddInt(res, res, index.op);
  3989. IF i = 0 THEN
  3990. (*
  3991. ReuseCopy(res, index.op);
  3992. *)
  3993. Designate(x.left,array);
  3994. type := x.left.type.resolved;
  3995. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3996. Dereference(array, type, FALSE);
  3997. END;
  3998. (*
  3999. ELSE AddInt(res, res, index.op);
  4000. *)
  4001. END;
  4002. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4003. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4004. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4005. BoundCheck(index.op, length);
  4006. END;
  4007. ReleaseIntermediateOperand(length);
  4008. END;
  4009. ReleaseOperand(index);
  4010. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4011. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4012. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4013. MulInt(res,res,length);
  4014. END;
  4015. ReleaseIntermediateOperand(length);
  4016. END;
  4017. (* remaining open dimensions -- compute address *)
  4018. i := maxDim+1;
  4019. IF type IS SyntaxTree.ArrayType THEN
  4020. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4021. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4022. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4023. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4024. MulInt(res,res,length);
  4025. END;
  4026. ReleaseIntermediateOperand(length);
  4027. INC(i);
  4028. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4029. END;
  4030. END;
  4031. IF (type IS SyntaxTree.ArrayType) THEN
  4032. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4033. size := StaticSize(system, type);
  4034. IF size # 1 THEN
  4035. length := IntermediateCode.Immediate(addressType,size);
  4036. MulInt(res,res,length);
  4037. END;
  4038. ELSE
  4039. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4040. IF size # 1 THEN
  4041. length := IntermediateCode.Immediate(addressType,size);
  4042. MulInt(res,res,length);
  4043. END;
  4044. END;
  4045. END;
  4046. AddInt(res,res,array.op);
  4047. InitOperand(result,ModeReference);
  4048. result.op := res;
  4049. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4050. ReleaseIntermediateOperand(result.tag);
  4051. result.tag := TypeDescriptorAdr(type);
  4052. IF ~newObjectFile THEN
  4053. IntermediateCode.MakeMemory(result.tag,addressType);
  4054. END
  4055. ELSIF IsDelegate(type) THEN
  4056. ReleaseIntermediateOperand(result.tag);
  4057. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4058. UseIntermediateOperand(result.tag);
  4059. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4060. ReleaseIntermediateOperand(result.tag);
  4061. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4062. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4063. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4064. END;
  4065. ReleaseOperand(array);
  4066. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4067. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4068. END;
  4069. END IndexDesignator;
  4070. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4071. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4072. BEGIN
  4073. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4074. dest := destination; destination := emptyOperand;
  4075. type := x.left.type.resolved;
  4076. IF type IS SyntaxTree.MathArrayType THEN
  4077. MathIndexDesignator(x);
  4078. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4079. IndexDesignator(x);
  4080. END;
  4081. destination := dest;
  4082. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4083. END VisitIndexDesignator;
  4084. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4085. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4086. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4087. procedure: SyntaxTree.Procedure;
  4088. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4089. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4090. BEGIN
  4091. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4092. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4093. parameters := expression.parameters;
  4094. moduleName := "FoxArrayBase";
  4095. procedureName := "CopyDescriptor";
  4096. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4097. SaveRegisters();ReleaseUsedRegisters(saved);
  4098. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4099. IF procedure = NIL THEN
  4100. s := "procedure ";
  4101. Strings.Append(s,moduleName);
  4102. Strings.Append(s,".");
  4103. Strings.Append(s,procedureName);
  4104. Strings.Append(s," not present");
  4105. Error(position,s);
  4106. ELSE
  4107. (* push address of temporary variable *)
  4108. Symbol(variable,destOperand);
  4109. Emit(Push(position,destOperand.op));
  4110. ReleaseOperand(destOperand);
  4111. (* push src *)
  4112. Evaluate(expression.left,srcOperand);
  4113. (*
  4114. Dereference(srcOperand,expression.type.resolved);
  4115. Emit(Push(position,srcOperand.tag));
  4116. *)
  4117. Emit(Push(position,srcOperand.op));
  4118. ReleaseOperand(srcOperand);
  4119. tensorFound := FALSE;
  4120. FOR i := 0 TO parameters.Length()-1 DO
  4121. e := parameters.GetExpression(i);
  4122. IF e IS SyntaxTree.TensorRangeExpression THEN
  4123. tensorFound := TRUE;
  4124. ELSIF e IS SyntaxTree.RangeExpression THEN
  4125. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4126. ELSE
  4127. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4128. END;
  4129. END;
  4130. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4131. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4132. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4133. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4134. StaticCallOperand(procOp,procedure);
  4135. Emit(Call(position,procOp.op,ProcedureParametersSize(system,procedure)));
  4136. ReleaseOperand(procOp);
  4137. END;
  4138. RestoreRegisters(saved);
  4139. END;
  4140. RETURN variable
  4141. END PrepareTensorDescriptor;
  4142. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4143. VAR
  4144. type, descriptorType, baseType: SyntaxTree.Type;
  4145. operand, tmpOperand, variableOp, variable2Op: Operand;
  4146. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4147. variable, variable2: SyntaxTree.Variable;
  4148. dim, i, size: LONGINT;
  4149. (* TODO: needed? *)
  4150. oldArrayDestinationTag: IntermediateCode.Operand;
  4151. oldArrayDestinationDimension: LONGINT;
  4152. position: Position;
  4153. saved: RegisterEntry;
  4154. arrayFlags: SET;
  4155. m, n: LONGINT;
  4156. PROCEDURE Pass(op: IntermediateCode.Operand);
  4157. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4158. BEGIN
  4159. IF numberRegister >= 0 THEN
  4160. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention,op.type,numberRegister));
  4161. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4162. Emit(Mov(position,parameterRegister, op));
  4163. ELSE
  4164. Emit(Push(position,op))
  4165. END
  4166. END Pass;
  4167. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4168. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4169. BEGIN
  4170. formalType := formalType.resolved; actualType := actualType.resolved;
  4171. IF IsOpenArray(formalType)THEN
  4172. IF actualType IS SyntaxTree.StringType THEN
  4173. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4174. RETURN;
  4175. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4176. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4177. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4178. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4179. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4180. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4181. ELSE
  4182. tmp := baseReg;
  4183. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4184. IntermediateCode.MakeMemory(tmp,addressType);
  4185. Pass((tmp));
  4186. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4187. END;
  4188. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4189. END;
  4190. END PushArrayLens;
  4191. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4192. BEGIN
  4193. CASE size OF
  4194. |2: INCL(flags,Size2Flag);
  4195. |3: INCL(flags,Size3Flag);
  4196. |4: INCL(flags,Size4Flag);
  4197. |5: INCL(flags,Size5Flag);
  4198. |6: INCL(flags,Size6Flag);
  4199. |7: INCL(flags,Size7Flag);
  4200. |8: INCL(flags,Size8Flag);
  4201. END;
  4202. END SetSmallArraySizeFlag;
  4203. BEGIN
  4204. IF Trace THEN TraceEnter("PushParameter") END;
  4205. position := expression.position;
  4206. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4207. type := expression.type.resolved;
  4208. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4209. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4210. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4211. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4212. );
  4213. (* TODO: needed? *)
  4214. oldArrayDestinationTag := arrayDestinationTag;
  4215. oldArrayDestinationDimension := arrayDestinationDimension;
  4216. IF IsArrayOfSystemByte(parameter.type) THEN
  4217. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4218. Designate(expression,operand);
  4219. ELSE
  4220. Evaluate(expression, tmpOperand);
  4221. (* array of system byte does not provide any pointers *)
  4222. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4223. Symbol(variable, operand);
  4224. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4225. Emit(Mov(position,tmp, tmpOperand.op));
  4226. ReleaseOperand(tmpOperand);
  4227. END;
  4228. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4229. ReleaseIntermediateOperand(operand.tag);
  4230. operand.tag := tmp;
  4231. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4232. Pass((operand.tag));
  4233. END;
  4234. Pass((operand.op));
  4235. ELSIF IsOpenArray(parameter.type) THEN
  4236. Designate(expression,operand);
  4237. baseReg := operand.tag;
  4238. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4239. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4240. END;
  4241. Pass((operand.op)); (* address of the array *)
  4242. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4243. (* case 1
  4244. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4245. *)
  4246. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4247. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4248. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4249. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4250. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4251. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4252. arrayDestinationTag := sp;
  4253. (* case 1b
  4254. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4255. *)
  4256. IF expression IS SyntaxTree.IndexDesignator THEN
  4257. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4258. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4259. arrayDestinationDimension := dim;
  4260. Designate(expression,operand);
  4261. (* case 1a
  4262. P(...,A,...) push: push array descriptor to stack
  4263. *)
  4264. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4265. Designate(expression,operand);
  4266. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4267. i := 0;
  4268. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4269. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4270. INC(i);
  4271. END;
  4272. type := expression.type.resolved;
  4273. WHILE (i<dim) DO (* remaining static dimensions *)
  4274. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4275. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4276. ReleaseOperand(tmpOperand);
  4277. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4278. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4279. ReleaseOperand(tmpOperand);
  4280. INC(i);
  4281. END;
  4282. dimOp := IntermediateCode.Immediate(addressType,dim);
  4283. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4284. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4285. (* case 1d
  4286. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4287. + case 1e
  4288. P(.. PT() ... );
  4289. *)
  4290. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4291. Designate(expression,operand);
  4292. Dereference(operand,type.resolved,FALSE);
  4293. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4294. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4295. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4296. (* case 1f
  4297. P(...,S,...) push: create array descriptor to S on stack
  4298. case 1g
  4299. P(... PS()...)
  4300. *)
  4301. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4302. Designate(expression,operand);
  4303. FOR i := 0 TO dim-1 DO
  4304. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4305. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4306. ReleaseOperand(tmpOperand);
  4307. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4308. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4309. ReleaseOperand(tmpOperand);
  4310. END;
  4311. (*******
  4312. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4313. *)
  4314. arrayFlags := {StaticFlag};
  4315. IF dim = 1 THEN
  4316. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4317. ReleaseOperand(tmpOperand);
  4318. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4319. m := LONGINT(tmpOperand.op.intValue);
  4320. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4321. ELSIF dim = 2 THEN
  4322. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4323. ReleaseOperand(tmpOperand);
  4324. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4325. m := LONGINT(tmpOperand.op.intValue);
  4326. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4327. ReleaseOperand(tmpOperand);
  4328. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4329. n := LONGINT(tmpOperand.op.intValue);
  4330. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4331. INCL(arrayFlags,SmallMatrixFlag);
  4332. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4333. END;
  4334. END;
  4335. (*******)
  4336. dimOp := IntermediateCode.Immediate(addressType,dim);
  4337. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4338. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4339. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4340. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4341. baseType := SemanticChecker.ArrayBase(type,dim);
  4342. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4343. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4344. ELSE HALT(100);
  4345. END;
  4346. (* case 2
  4347. procedure P([left args], var A: array [*,*] of Type, [right args])
  4348. *)
  4349. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4350. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4351. (* case 2b
  4352. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4353. push: push reference to pushed array descriptor
  4354. post: remove array descriptor.
  4355. *)
  4356. IF expression IS SyntaxTree.IndexDesignator THEN
  4357. descriptorType := GetMathArrayDescriptorType(dim);
  4358. (* range type : no allocation possible, should be untraced *)
  4359. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4360. Symbol(variable,variableOp);
  4361. arrayDestinationTag := variableOp.op;
  4362. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4363. arrayDestinationDimension := dim;
  4364. NeedDescriptor := TRUE;
  4365. Designate(expression,operand);
  4366. Pass((operand.tag));
  4367. NeedDescriptor := FALSE;
  4368. (* case 2a
  4369. P(...,A,...)
  4370. push: push reference to array descriptor on stack
  4371. *)
  4372. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4373. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4374. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4375. INC(i);
  4376. END;
  4377. IF i = dim THEN
  4378. Designate(expression,operand);
  4379. Pass((operand.tag));
  4380. ELSE (* open-static *)
  4381. type := expression.type.resolved;
  4382. descriptorType := GetMathArrayDescriptorType(dim);
  4383. (* static array , cannot be reallocated, untraced !*)
  4384. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4385. Symbol(variable,variableOp);
  4386. arrayDestinationTag := variableOp.op;
  4387. Designate(expression,operand);
  4388. FOR i := 0 TO dim-1 DO
  4389. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4390. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4391. ReleaseOperand(tmpOperand);
  4392. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4393. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4394. ReleaseOperand(tmpOperand);
  4395. END;
  4396. dimOp := IntermediateCode.Immediate(addressType,dim);
  4397. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4398. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4399. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4400. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4401. baseType := SemanticChecker.ArrayBase(type,dim);
  4402. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4403. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4404. Pass((arrayDestinationTag));
  4405. END;
  4406. (* case 2d
  4407. P(...,T,...) push: emit dimension check, push T
  4408. *)
  4409. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4410. Designate(expression,operand);
  4411. Dereference(operand,type.resolved,FALSE);
  4412. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4413. Pass((operand.tag));
  4414. (* case 2f
  4415. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4416. push: push reference to pushed array descriptor
  4417. post: remove array descriptor
  4418. *)
  4419. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4420. descriptorType := GetMathArrayDescriptorType(dim);
  4421. (* static array -- cannot be reallocatated, untraced *)
  4422. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4423. Symbol(variable,variableOp);
  4424. arrayDestinationTag := variableOp.op;
  4425. Designate(expression,operand);
  4426. FOR i := 0 TO dim-1 DO
  4427. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4428. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4429. ReleaseOperand(tmpOperand);
  4430. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4431. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4432. ReleaseOperand(tmpOperand);
  4433. END;
  4434. (*
  4435. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4436. *)
  4437. arrayFlags := {StaticFlag};
  4438. IF dim = 1 THEN
  4439. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4440. ReleaseOperand(tmpOperand);
  4441. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4442. m := LONGINT(tmpOperand.op.intValue);
  4443. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4444. ELSIF dim = 2 THEN
  4445. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4446. ReleaseOperand(tmpOperand);
  4447. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4448. m := LONGINT(tmpOperand.op.intValue);
  4449. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4450. ReleaseOperand(tmpOperand);
  4451. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4452. n := LONGINT(tmpOperand.op.intValue);
  4453. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4454. INCL(arrayFlags,SmallMatrixFlag);
  4455. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4456. END;
  4457. END;
  4458. (*******)
  4459. dimOp := IntermediateCode.Immediate(addressType,dim);
  4460. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4461. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4462. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4463. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4464. baseType := SemanticChecker.ArrayBase(type,dim);
  4465. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4466. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4467. Pass((arrayDestinationTag));
  4468. ELSE HALT(100);
  4469. END;
  4470. (* case 3
  4471. procedure P([left args], [const] A: array [?] of Type, [right args])
  4472. *)
  4473. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4474. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4475. (* case 3b
  4476. P(...,A[a..b,c..d],...)
  4477. *)
  4478. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4479. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4480. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4481. Symbol(variable,variableOp);
  4482. LoadValue(variableOp,system.addressType);
  4483. ELSE
  4484. descriptorType := GetMathArrayDescriptorType(dim);
  4485. (* range -- cannot be reallocated *)
  4486. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4487. Symbol(variable,variableOp);
  4488. END;
  4489. arrayDestinationTag := variableOp.op;
  4490. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4491. arrayDestinationDimension := 0;
  4492. Designate(expression,operand);
  4493. Pass((operand.tag));
  4494. (* case 3a
  4495. P(...,A,...)
  4496. *)
  4497. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4498. i := 0;
  4499. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4500. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4501. INC(i);
  4502. END;
  4503. IF i = dim THEN
  4504. Designate(expression,operand);
  4505. Pass((operand.tag));
  4506. ELSE (* open-static *)
  4507. type := expression.type.resolved;
  4508. descriptorType := GetMathArrayDescriptorType(dim);
  4509. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4510. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4511. Symbol(variable,variableOp);
  4512. arrayDestinationTag := variableOp.op;
  4513. Designate(expression,operand);
  4514. FOR i := 0 TO dim-1 DO
  4515. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4516. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4517. ReleaseOperand(tmpOperand);
  4518. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4519. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4520. ReleaseOperand(tmpOperand);
  4521. END;
  4522. dimOp := IntermediateCode.Immediate(addressType,dim);
  4523. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4524. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4525. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4526. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4527. baseType := SemanticChecker.ArrayBase(type,dim);
  4528. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4529. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4530. Pass((arrayDestinationTag));
  4531. END;
  4532. (* case 3d
  4533. P(...,T,...)
  4534. case 3e
  4535. P(...,PT(...),...)
  4536. *)
  4537. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4538. Designate(expression,operand);
  4539. Dereference(operand,type.resolved,FALSE);
  4540. Pass((operand.tag));
  4541. (* case 3f
  4542. P(...,S,...)
  4543. case 3g
  4544. P(...,PS(...),...)
  4545. *)
  4546. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4547. descriptorType := GetMathArrayDescriptorType(dim);
  4548. (* static array does not need to be traced *)
  4549. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4550. Symbol(variable,variableOp);
  4551. arrayDestinationTag := variableOp.op;
  4552. Designate(expression,operand);
  4553. IF operand.op.type.length >1 THEN (* vector register *)
  4554. (* static array does not need to be traced *)
  4555. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4556. Symbol(variable2, variable2Op);
  4557. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4558. Emit(Mov(position,tmp, operand.op));
  4559. ReleaseOperand(operand);
  4560. Symbol(variable2, operand);
  4561. END;
  4562. FOR i := 0 TO dim-1 DO
  4563. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4564. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4565. ReleaseOperand(tmpOperand);
  4566. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4567. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4568. ReleaseOperand(tmpOperand);
  4569. END;
  4570. dimOp := IntermediateCode.Immediate(addressType,dim);
  4571. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4572. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4573. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4574. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4575. baseType := SemanticChecker.ArrayBase(type,dim);
  4576. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4577. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4578. Pass((arrayDestinationTag));
  4579. ELSE HALT(100);
  4580. END;
  4581. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4582. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4583. (* case 4b
  4584. P(...,A[a..b,c..d],...)
  4585. *)
  4586. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4587. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4588. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4589. Symbol(variable,variableOp);
  4590. LoadValue(variableOp,system.addressType);
  4591. ELSE
  4592. descriptorType := GetMathArrayDescriptorType(dim);
  4593. (* range array -- cannot be allocated *)
  4594. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4595. Symbol(variable,variableOp);
  4596. END;
  4597. arrayDestinationTag := variableOp.op;
  4598. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4599. arrayDestinationDimension := 0;
  4600. Designate(expression,operand);
  4601. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4602. Symbol(variable,variableOp);
  4603. ELSE
  4604. (* alias to range -- untraced *)
  4605. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4606. Symbol(variable,variableOp);
  4607. MakeMemory(tmp,variableOp.op,addressType,0);
  4608. Emit(Mov(position,tmp,operand.tag));
  4609. ReleaseIntermediateOperand(tmp);
  4610. END;
  4611. Pass((variableOp.op));
  4612. ReleaseOperand(variableOp);
  4613. (* case 4a
  4614. P(...,A,...)
  4615. *)
  4616. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4617. i := 0;
  4618. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4619. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4620. INC(i);
  4621. END;
  4622. IF i = dim THEN
  4623. Designate(expression,operand);
  4624. arrayDestinationTag := operand.tag;
  4625. ELSE (* open-static *)
  4626. type := expression.type.resolved;
  4627. descriptorType := GetMathArrayDescriptorType(dim);
  4628. (* static array -- untraced *)
  4629. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4630. Symbol(variable,variableOp);
  4631. arrayDestinationTag := variableOp.op;
  4632. Designate(expression,operand);
  4633. FOR i := 0 TO dim-1 DO
  4634. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4635. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4636. ReleaseOperand(tmpOperand);
  4637. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4638. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4639. ReleaseOperand(tmpOperand);
  4640. END;
  4641. dimOp := IntermediateCode.Immediate(addressType,dim);
  4642. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4643. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4644. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4645. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4646. baseType := SemanticChecker.ArrayBase(type,dim);
  4647. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4648. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4649. END;
  4650. (* tensor alias to open array -- untraced *)
  4651. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4652. Symbol(variable,variableOp);
  4653. MakeMemory(tmp,variableOp.op,addressType,0);
  4654. Emit(Mov(position,tmp,arrayDestinationTag));
  4655. ReleaseIntermediateOperand(tmp);
  4656. Pass((variableOp.op));
  4657. ReleaseOperand(variableOp);
  4658. (* case 4d
  4659. P(...,T,...)
  4660. *)
  4661. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4662. Designate(expression,operand);
  4663. Pass((operand.op));
  4664. (* case 4f
  4665. P(...,S,...)
  4666. *)
  4667. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4668. descriptorType := GetMathArrayDescriptorType(dim);
  4669. (* static array -- cannot be reallocated, untraced *)
  4670. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4671. Symbol(variable,variableOp);
  4672. arrayDestinationTag := variableOp.op;
  4673. Designate(expression,operand);
  4674. FOR i := 0 TO dim-1 DO
  4675. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4676. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4677. ReleaseOperand(tmpOperand);
  4678. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4679. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4680. ReleaseOperand(tmpOperand);
  4681. END;
  4682. dimOp := IntermediateCode.Immediate(addressType,dim);
  4683. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4684. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4685. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4686. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4687. baseType := SemanticChecker.ArrayBase(type,dim);
  4688. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4689. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4690. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4691. Symbol(variable,variableOp);
  4692. MakeMemory(tmp,variableOp.op,addressType,0);
  4693. Emit(Mov(position,tmp,arrayDestinationTag));
  4694. ReleaseIntermediateOperand(tmp);
  4695. Pass((variableOp.op));
  4696. ReleaseOperand(variableOp);
  4697. ELSE HALT(100);
  4698. END;
  4699. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4700. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4701. Designate(expression,operand);
  4702. IF operand.op.type.length > 1 THEN
  4703. Emit(Push(position, operand.op));
  4704. ELSE
  4705. size := system.SizeOf(type);
  4706. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4707. size := ToMemoryUnits(system,size);
  4708. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4709. arrayDestinationTag := sp;
  4710. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4711. END;
  4712. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4713. Designate(expression,operand);
  4714. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4715. (* static array no pointer *)
  4716. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4717. Symbol(variable,variableOp);
  4718. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4719. Emit(Mov(position,tmp,operand.op));
  4720. Emit(Push(position,variableOp.op));
  4721. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4722. Pass((operand.op));
  4723. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4724. END;
  4725. ELSE HALT(200)
  4726. END;
  4727. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4728. IF parameter.kind = SyntaxTree.VarParameter THEN
  4729. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4730. Designate(expression, operand);
  4731. Pass((operand.op));
  4732. ELSE
  4733. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4734. Evaluate(expression, operand);
  4735. Pass((operand.extra)); (* step *)
  4736. Pass((operand.tag)); (* last *)
  4737. Pass((operand.op)) (* first *)
  4738. END
  4739. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4740. IF parameter.kind = SyntaxTree.VarParameter THEN
  4741. Designate(expression, operand);
  4742. Pass((operand.op));
  4743. ELSE
  4744. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4745. Evaluate(expression, operand);
  4746. Pass((operand.tag)); (* real part *)
  4747. Pass((operand.op)) (* imaginary part *)
  4748. END
  4749. ELSE
  4750. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4751. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4752. Designate(expression,operand);
  4753. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4754. (* stack allocation *)
  4755. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4756. (*! parameter alignment to be discussed ... *)
  4757. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4758. size := type(SyntaxTree.StringType).length;
  4759. END;
  4760. IF backend.cooperative & parameter.NeedsTrace() THEN
  4761. dst := NewRegisterOperand (addressType);
  4762. Emit(Mov(position,dst, sp));
  4763. IntermediateCode.InitImmediate(null, byteType, 0);
  4764. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4765. ReleaseIntermediateOperand(dst);
  4766. SaveRegisters();ReleaseUsedRegisters(saved);
  4767. (* register dst has been freed before SaveRegisters already *)
  4768. CallAssignMethod(dst, operand.op, parameter.type);
  4769. RestoreRegisters(saved);
  4770. END;
  4771. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4772. ELSIF IsOpenArray(parameter.type) THEN
  4773. Designate(expression,operand);
  4774. baseReg := operand.tag;
  4775. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4776. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4777. END;
  4778. Pass((operand.op)); (* address of the array *)
  4779. ELSIF IsDelegate(parameter.type) THEN
  4780. Evaluate(expression,operand);
  4781. IF backend.cooperative & parameter.NeedsTrace() THEN
  4782. Emit(Push(position, nil));
  4783. dst := NewRegisterOperand (addressType);
  4784. Emit(Mov(position,dst, sp));
  4785. ReleaseIntermediateOperand(dst);
  4786. SaveRegisters();ReleaseUsedRegisters(saved);
  4787. Emit(Push(position, dst));
  4788. (* register dst has been freed before SaveRegisters already *)
  4789. Emit(Push(position, operand.tag));
  4790. CallThis(position,"GarbageCollector","Assign",2);
  4791. RestoreRegisters(saved);
  4792. ELSE
  4793. Pass((operand.tag));
  4794. END;
  4795. Pass((operand.op));
  4796. ELSE
  4797. Evaluate(expression,operand);
  4798. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4799. Emit(Push(position, nil));
  4800. dst := NewRegisterOperand (addressType);
  4801. Emit(Mov(position,dst, sp));
  4802. ReleaseIntermediateOperand(dst);
  4803. SaveRegisters();ReleaseUsedRegisters(saved);
  4804. Emit(Push(position, dst));
  4805. (* register dst has been freed before SaveRegisters already *)
  4806. Emit(Push(position, operand.op));
  4807. CallThis(position,"GarbageCollector","Assign",2);
  4808. RestoreRegisters(saved);
  4809. ELSE
  4810. Pass((operand.op));
  4811. END;
  4812. END;
  4813. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4814. Evaluate(expression,operand);
  4815. Pass((operand.op));
  4816. ELSE (* var parameter *)
  4817. Designate(expression,operand);
  4818. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4819. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4820. Pass((operand.tag));
  4821. END;
  4822. END;
  4823. Pass((operand.op));
  4824. END;
  4825. END;
  4826. (* TODO: needed? *)
  4827. arrayDestinationTag := oldArrayDestinationTag;
  4828. arrayDestinationDimension := oldArrayDestinationDimension;
  4829. IF needsParameterBackup THEN
  4830. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4831. ReuseCopy(parameterBackup, operand.op)
  4832. END;
  4833. ReleaseOperand(operand);
  4834. IF Trace THEN TraceExit("PushParameter") END;
  4835. END PushParameter;
  4836. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  4837. VAR prevConditional: BOOLEAN;
  4838. BEGIN
  4839. prevConditional := conditional;
  4840. conditional := FALSE;
  4841. 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
  4842. Expression(x.result); (* use register *)
  4843. END;
  4844. Statement(x.statement);
  4845. conditional := prevConditional;
  4846. IF x.result # NIL THEN Expression(x.result) END;
  4847. 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
  4848. ReleaseIntermediateOperand(result.op);
  4849. END;
  4850. END VisitStatementDesignator;
  4851. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4852. VAR
  4853. procedure: SyntaxTree.Procedure;
  4854. procedureType: SyntaxTree.ProcedureType;
  4855. wasInline: BOOLEAN;
  4856. actualParameters: SyntaxTree.ExpressionList;
  4857. formalParameter: SyntaxTree.Parameter;
  4858. actualParameter: SyntaxTree.Expression;
  4859. i: LONGINT;
  4860. localVariable: SyntaxTree.Variable;
  4861. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4862. src, dest: Operand;
  4863. prevInlineExit : Label;
  4864. prevMapper: SymbolMapper;
  4865. tooComplex: BOOLEAN;
  4866. resultDesignator: SyntaxTree.Expression;
  4867. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4868. BEGIN
  4869. IF e = NIL THEN RETURN TRUE
  4870. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4871. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4872. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4873. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4874. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4875. ELSE RETURN FALSE
  4876. END;
  4877. END SimpleExpression;
  4878. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  4879. BEGIN
  4880. RETURN checker.CanPassInRegister(type)
  4881. END FitsInRegister;
  4882. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  4883. VAR
  4884. variable: SyntaxTree.Variable;
  4885. variableDesignator: SyntaxTree.Designator;
  4886. BEGIN
  4887. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  4888. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  4889. variableDesignator.SetType(type);
  4890. RETURN variableDesignator
  4891. END GetTemp;
  4892. BEGIN
  4893. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  4894. wasInline := currentIsInline;
  4895. prevInlineExit := currentInlineExit;
  4896. prevMapper := currentMapper;
  4897. currentInlineExit := NewLabel();
  4898. tooComplex := FALSE;
  4899. NEW(currentMapper);
  4900. currentIsInline := TRUE;
  4901. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  4902. procedureType := procedure.type(SyntaxTree.ProcedureType);
  4903. formalParameter := procedureType.firstParameter;
  4904. actualParameters := x.parameters;
  4905. i := 0;
  4906. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  4907. actualParameter := actualParameters.GetExpression(i);
  4908. IF actualParameter.resolved # NIL THEN
  4909. actualParameter := actualParameter.resolved
  4910. END;
  4911. (*
  4912. if expression is simple and can be passed immediately
  4913. or if type fits in register then we can proceed
  4914. otherwise we escape to ordinary procedure call.
  4915. *)
  4916. (* cases where the expression can be mapped identically *)
  4917. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4918. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  4919. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  4920. variableDesignator := GetTemp(formalParameter.type, TRUE);
  4921. (*
  4922. Assign(variableDesignator, actualParameter);
  4923. *)
  4924. Evaluate(actualParameter, src);
  4925. Designate(variableDesignator, dest);
  4926. Emit(Mov(x.position, dest.op, src.op));
  4927. ReleaseOperand(dest);
  4928. ReleaseOperand(src);
  4929. (* the src operand should now have been completely released ! *)
  4930. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  4931. ELSE tooComplex := TRUE
  4932. END;
  4933. (*
  4934. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  4935. currentMapper.Add(formalParameter, actualParameter, NIL);
  4936. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  4937. variableDesignator := GetTemp(system.addressType, FALSE);
  4938. Designate(actualParameter, src);
  4939. Designate(variableDesignator, dest);
  4940. IntermediateCode.MakeMemory(dest.op,addressType);
  4941. Emit(Mov(x.position, dest.op, src.op));
  4942. ReleaseOperand(dest);
  4943. IF src.tag.mode # IntermediateCode.Undefined THEN
  4944. tagDesignator := GetTemp(system.addressType, FALSE);
  4945. Designate(tagDesignator, dest);
  4946. IntermediateCode.MakeMemory(dest.op,addressType);
  4947. Emit(Mov(x.position, dest.op, src.op));
  4948. END;
  4949. ReleaseOperand(dest); ReleaseOperand(src);
  4950. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  4951. END;
  4952. *)
  4953. formalParameter := formalParameter.nextParameter;
  4954. INC(i);
  4955. END;
  4956. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  4957. IF resultDesignator # NIL THEN
  4958. returnDesignator := resultDesignator
  4959. ELSE
  4960. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  4961. END;
  4962. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  4963. END;
  4964. localVariable := procedure.procedureScope.firstVariable;
  4965. WHILE ~tooComplex & (localVariable # NIL) DO
  4966. variableDesignator := GetTemp(localVariable.type, FALSE);
  4967. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  4968. localVariable := localVariable.nextVariable;
  4969. END;
  4970. IF ~tooComplex THEN
  4971. VisitStatementBlock(procedure.procedureScope.body);
  4972. SetLabel(currentInlineExit);
  4973. IF procedureType.returnType # NIL THEN
  4974. Designate(returnDesignator, result);
  4975. IF conditional THEN
  4976. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  4977. ValueToCondition(result)
  4978. END;
  4979. END;
  4980. END;
  4981. currentMapper := prevMapper;
  4982. currentInlineExit := prevInlineExit;
  4983. currentIsInline := wasInline;
  4984. RETURN ~tooComplex
  4985. END InlineProcedureCall;
  4986. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  4987. VAR
  4988. parameters: SyntaxTree.ExpressionList;
  4989. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  4990. designator: SyntaxTree.Designator;
  4991. procedureType: SyntaxTree.ProcedureType;
  4992. formalParameter: SyntaxTree.Parameter;
  4993. operand, returnValue: Operand;
  4994. reg, size, mask, dest: IntermediateCode.Operand;
  4995. saved,saved2: RegisterEntry;
  4996. symbol: SyntaxTree.Symbol;
  4997. variable: SyntaxTree.Variable;
  4998. i, parametersSize, returnTypeSize : LONGINT;
  4999. structuredReturnType: BOOLEAN;
  5000. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5001. tempVariableDesignator: SyntaxTree.Designator;
  5002. gap, alignment: LONGINT; (*fld*)
  5003. (* TODO: remove unnecessary backup variables *)
  5004. oldResult: Operand;
  5005. oldCurrentScope: SyntaxTree.Scope;
  5006. oldArrayDestinationTag: IntermediateCode.Operand;
  5007. oldArrayDestinationDimension: LONGINT;
  5008. oldConstantDeclaration: SyntaxTree.Symbol;
  5009. oldDestination: IntermediateCode.Operand;
  5010. oldCurrentLoop: Label;
  5011. oldConditional: BOOLEAN;
  5012. oldTrueLabel, oldFalseLabel: Label;
  5013. oldLocked: BOOLEAN;
  5014. usedRegisters,oldUsedRegisters: RegisterEntry;
  5015. return: IntermediateCode.Operand;
  5016. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5017. arg: IntermediateCode.Operand;
  5018. dummy: IntermediateCode.Operand;
  5019. recordType: SyntaxTree.RecordType;
  5020. operatorSelectionProcedureOperand: Operand;
  5021. operatorSelectionProcedure: SyntaxTree.Procedure;
  5022. fingerPrint: SyntaxTree.FingerPrint;
  5023. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5024. identifierNumber: LONGINT;
  5025. parameterRegisters: SIZE;
  5026. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5027. procedure: SyntaxTree.Procedure;
  5028. PROCEDURE BackupGlobalState;
  5029. BEGIN
  5030. oldResult := result;
  5031. oldCurrentScope := currentScope;
  5032. oldArrayDestinationTag := arrayDestinationTag;
  5033. oldArrayDestinationDimension := arrayDestinationDimension;
  5034. oldConstantDeclaration := constantDeclaration;
  5035. oldDestination := destination;
  5036. oldCurrentLoop := currentLoop;
  5037. oldConditional := conditional;
  5038. oldTrueLabel := trueLabel;
  5039. oldFalseLabel := falseLabel;
  5040. oldLocked := locked;
  5041. oldUsedRegisters := usedRegisters
  5042. END BackupGlobalState;
  5043. PROCEDURE RestoreGlobalState;
  5044. BEGIN
  5045. result := oldResult;
  5046. currentScope := oldCurrentScope;
  5047. arrayDestinationTag := oldArrayDestinationTag;
  5048. arrayDestinationDimension := oldArrayDestinationDimension;
  5049. constantDeclaration := oldConstantDeclaration;
  5050. destination := oldDestination;
  5051. currentLoop := oldCurrentLoop;
  5052. conditional := oldConditional;
  5053. trueLabel := oldTrueLabel;
  5054. falseLabel := oldFalseLabel;
  5055. locked := oldLocked;
  5056. usedRegisters := oldUsedRegisters
  5057. END RestoreGlobalState;
  5058. (** do preparations before parameter push for array-structured object types (ASOTs):
  5059. if ASOT is passed as VAR parameter:
  5060. - allocate temporary variable of math array type
  5061. - copy contents of ASOT to be passed to temporary variable
  5062. - use temporary variable as the actual parameter instead
  5063. - 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)
  5064. **)
  5065. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5066. VAR
  5067. expression: SyntaxTree.Expression;
  5068. BEGIN
  5069. IF actualParameter IS SyntaxTree.Designator THEN
  5070. designator := actualParameter(SyntaxTree.Designator);
  5071. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5072. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5073. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5074. ASSERT(checker # NIL);
  5075. checker.SetCurrentScope(currentScope);
  5076. (* allocate temporary variable *)
  5077. ASSERT(actualParameter.type # NIL);
  5078. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5079. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5080. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5081. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5082. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5083. ASSERT(tempVariableDesignator.type # NIL);
  5084. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5085. (* copy math array stored in actual parameter to temporary variable *)
  5086. BackupGlobalState;
  5087. AssignMathArray(tempVariableDesignator, actualParameter);
  5088. RestoreGlobalState;
  5089. (* use temporary variable as actual parameter instead of the original one *)
  5090. actualParameter := tempVariableDesignator;
  5091. (* create write-back call and store it in linked list *)
  5092. (* create new list entry *)
  5093. IF firstWriteBackCall = NIL THEN
  5094. NEW(firstWriteBackCall);
  5095. currentWriteBackCall := firstWriteBackCall
  5096. ELSE
  5097. ASSERT(currentWriteBackCall # NIL);
  5098. NEW(currentWriteBackCall.next);
  5099. currentWriteBackCall := currentWriteBackCall.next
  5100. END;
  5101. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5102. ASSERT(expression.type = NIL);
  5103. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5104. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5105. (* prepare writeback for any other "normal" indexer *)
  5106. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5107. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5108. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5109. Assign(tempVariableDesignator, actualParameter);
  5110. actualParameter := tempVariableDesignator;
  5111. IF firstWriteBackCall = NIL THEN
  5112. NEW(firstWriteBackCall);
  5113. currentWriteBackCall := firstWriteBackCall
  5114. ELSE
  5115. ASSERT(currentWriteBackCall # NIL);
  5116. NEW(currentWriteBackCall.next);
  5117. currentWriteBackCall := currentWriteBackCall.next
  5118. END;
  5119. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5120. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5121. END
  5122. END
  5123. END PrepareParameter;
  5124. BEGIN
  5125. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5126. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5127. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5128. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5129. IF InlineProcedureCall(x) THEN
  5130. RETURN
  5131. ELSE
  5132. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5133. END
  5134. END;
  5135. END;
  5136. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5137. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5138. dest := destination; destination := emptyOperand;
  5139. SaveRegisters();ReleaseUsedRegisters(saved);
  5140. parameters := x.parameters;
  5141. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5142. (* an operator is called *)
  5143. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5144. ASSERT(procedureType.callingConvention = SyntaxTree.OberonCallingConvention);
  5145. (* check if a dynamic operator call should be performed *)
  5146. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5147. ELSE
  5148. isCallOfDynamicOperator := FALSE
  5149. END;
  5150. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5151. Emit(Push(position, ap));
  5152. END;
  5153. alignment := procedureType.stackAlignment;
  5154. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize = 64) THEN
  5155. alignment := 16 (* bytes *);
  5156. END;
  5157. IF alignment > 1 THEN
  5158. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5159. Emit(Mov(position,reg, sp));
  5160. gap := ParametersSize(system, procedureType, FALSE);
  5161. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5162. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN
  5163. gap := 4*ToMemoryUnits(system,system.addressSize); (* at least four registers get pushed*)
  5164. END;
  5165. END;
  5166. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) + ToMemoryUnits(system,system.addressSize);
  5167. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5168. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5169. Emit(And(position,sp, sp, mask));
  5170. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5171. Emit(Push(position,reg));
  5172. (*
  5173. IntermediateCode.InitMemory(mem, addressType, sp, 0);
  5174. Emit(Mov(position,mem,reg));
  5175. *)
  5176. ReleaseIntermediateOperand(reg);
  5177. END;
  5178. IF SysvABI(procedureType.callingConvention) & (system.addressSize = 32) THEN
  5179. (* align stack to 16-byte boundary *)
  5180. IntermediateCode.InitImmediate(mask,addressType,-16);
  5181. Emit(And(position,sp, sp, mask));
  5182. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5183. IF gap # 0 THEN
  5184. IntermediateCode.InitImmediate(size,addressType,gap);
  5185. Emit(Sub(position,sp,sp,size))
  5186. END;
  5187. END;
  5188. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5189. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5190. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5191. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5192. ELSE
  5193. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5194. END;
  5195. Evaluate(x.left, operand);
  5196. IF symbol IS SyntaxTree.Procedure THEN
  5197. IF (procedureType.selfParameter # NIL) THEN
  5198. Emit(Push(position,operand.tag));
  5199. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5200. Emit(Push(position,operand.tag));
  5201. ELSIF (procedureType.isDelegate) THEN
  5202. Emit(Push(position,operand.tag));
  5203. END;
  5204. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5205. IF (procedureType.selfParameter # NIL) THEN
  5206. Emit(Push(position,operand.tag));
  5207. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5208. Emit(Push(position,operand.tag));
  5209. END;
  5210. ELSE HALT(200);
  5211. END;
  5212. ReleaseIntermediateOperand(operand.tag);
  5213. operand.tag := emptyOperand;
  5214. (* determine if a structured return type is needed *)
  5215. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5216. IF structuredReturnType THEN
  5217. IF resultDesignator # NIL THEN
  5218. d := resultDesignator;
  5219. ELSE
  5220. (* temporary result that might be allocated, must potentially be traced *)
  5221. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5222. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5223. d.SetType(variable.type);
  5224. END;
  5225. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5226. Designate(d,returnValue);
  5227. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5228. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5229. Emit(Push(position,size));
  5230. Emit(Push(position,returnValue.op));
  5231. ReleaseOperand(returnValue);
  5232. ELSE*)
  5233. PushParameter(d,procedureType.returnParameter,procedureType.callingConvention, FALSE, dummy,-1)
  5234. (*
  5235. END;
  5236. *)
  5237. END;
  5238. firstWriteBackCall := NIL; (* reset write-back call list *)
  5239. IF procedureType.callingConvention # SyntaxTree.OberonCallingConvention THEN
  5240. parameterRegisters := backend.NumberParameterRegisters(procedureType.callingConvention);
  5241. passByRegister := parameterRegisters > 0;
  5242. registerNumber := 0;
  5243. formalParameter := procedureType.lastParameter;
  5244. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5245. actualParameter := parameters.GetExpression(i);
  5246. PrepareParameter(actualParameter, formalParameter);
  5247. IF passByRegister & (i < parameterRegisters) THEN
  5248. IF ~PassInRegister(formalParameter) THEN
  5249. Error(actualParameter.position,"cannot be passed by register")
  5250. ELSE
  5251. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,i);
  5252. END;
  5253. INC(registerNumber);
  5254. ELSE
  5255. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5256. END;
  5257. formalParameter := formalParameter.prevParameter;
  5258. END;
  5259. IF passByRegister (* & (registerNumber > 0)*) & ~SysvABI(procedureType.callingConvention) THEN
  5260. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5261. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5262. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5263. END;
  5264. ELSE
  5265. hasDynamicOperands := FALSE;
  5266. formalParameter := procedureType.firstParameter;
  5267. FOR i := 0 TO parameters.Length() - 1 DO
  5268. actualParameter := parameters.GetExpression(i);
  5269. IF formalParameter # NIL THEN (* TENTATIVE *)
  5270. PrepareParameter(actualParameter, formalParameter);
  5271. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5272. ASSERT(i < 2);
  5273. hasDynamicOperands := TRUE;
  5274. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, TRUE, parameterBackups[i],-1)
  5275. ELSE
  5276. IF passByRegister & (registerNumber > 0) THEN
  5277. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5278. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5279. END;
  5280. passByRegister := FALSE;
  5281. PushParameter(actualParameter, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  5282. END;
  5283. formalParameter := formalParameter.nextParameter;
  5284. END;
  5285. END;
  5286. END;
  5287. IF symbol IS SyntaxTree.Procedure THEN
  5288. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5289. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5290. Emit(Push(position,reg));
  5291. ReleaseIntermediateOperand(reg);
  5292. END;
  5293. parametersSize := ProcedureParametersSize(system,symbol(SyntaxTree.Procedure));
  5294. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5295. parametersSize := ParametersSize(system,procedureType,FALSE);
  5296. END;
  5297. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5298. (*
  5299. dynamic operator overloading:
  5300. first push parameters, regularly:
  5301. [self]
  5302. par1
  5303. par2
  5304. then push parameters for GetOperator
  5305. identifier
  5306. ptr1
  5307. tag
  5308. ptr2
  5309. tag
  5310. call GetOperatorRuntimeProc
  5311. call Operator
  5312. *)
  5313. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5314. (* push ID *)
  5315. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5316. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5317. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5318. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5319. formalParameter := procedureType.firstParameter;
  5320. FOR i := 0 TO parameters.Length() - 1 DO
  5321. IF formalParameter.access # SyntaxTree.Hidden THEN
  5322. ASSERT(i < 2);
  5323. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5324. (* push pointer *)
  5325. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5326. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5327. (* add dereference *)
  5328. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5329. (*! better: do refer to stack above than using parameter backups !!*)
  5330. ReleaseIntermediateOperand(parameterBackups[i]);
  5331. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5332. END;
  5333. Emit(Push(position,parameterBackups[i]));
  5334. ReleaseIntermediateOperand(parameterBackups[i]);
  5335. (* push typetag *)
  5336. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5337. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5338. arg := TypeDescriptorAdr(recordType);
  5339. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5340. Emit(Push(position,arg));
  5341. ELSE
  5342. (* push 'NonPointer' *)
  5343. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5344. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5345. (* push fingerprint *)
  5346. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5347. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5348. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5349. END
  5350. END;
  5351. formalParameter := formalParameter.nextParameter
  5352. END;
  5353. (* for unary operators: complete the information for the second parameter *)
  5354. IF procedureType.numberParameters < 2 THEN
  5355. (* push 'NonPointer' *)
  5356. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5357. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5358. (* push 'NoType' *)
  5359. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5360. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5361. END;
  5362. (* call operator selection procedure *)
  5363. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5364. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5365. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcedureParametersSize(system, operatorSelectionProcedure)));
  5366. ReleaseOperand(operatorSelectionProcedureOperand);
  5367. (* use the address that the operator selection procedure returned as the target address of the call *)
  5368. InitOperand(operand, ModeValue);
  5369. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5370. Emit(Result(position,operand.op))
  5371. END
  5372. END;
  5373. ReleaseParameterRegisters();
  5374. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5375. SaveRegisters();ReleaseUsedRegisters(saved2);
  5376. CallThis(position,"Objects","LeaveA2",0);
  5377. RestoreRegisters(saved2);
  5378. END;
  5379. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) OR SysvABI(procedureType.callingConvention) THEN
  5380. Emit(Call(position,operand.op,0));
  5381. ELSE
  5382. Emit(Call(position,operand.op,parametersSize));
  5383. END;
  5384. ReleaseOperand(operand);
  5385. IF procedureType.noReturn THEN
  5386. EmitTrap(position,NoReturnTrap);
  5387. END;
  5388. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5389. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5390. Emit(Result(position,return));
  5391. END;
  5392. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (procedureType.callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5393. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5394. Emit(Push(position, return));
  5395. CallThis(position,"Objects","ReenterA2",0);
  5396. Emit(Pop(position, return));
  5397. ELSE
  5398. CallThis(position,"Objects","ReenterA2",0);
  5399. END;
  5400. END;
  5401. (* === return parameter space === *)
  5402. IF (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5403. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5404. (* cleanup all space for all parameters *)
  5405. IF parametersSize < 32 THEN
  5406. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5407. parametersSize := 32
  5408. END;
  5409. size := IntermediateCode.Immediate(addressType,parametersSize);
  5410. Emit(Add(position,sp,sp,size))
  5411. END;
  5412. IF SysvABI(procedureType.callingConvention) THEN
  5413. IF passByRegister THEN
  5414. IF parameters.Length() > parameterRegisters THEN
  5415. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5416. ELSE
  5417. parametersSize := 0
  5418. END;
  5419. ELSE
  5420. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5421. INC( parametersSize, (-parametersSize) MOD 16 )
  5422. END;
  5423. IF parametersSize > 0 THEN
  5424. size := IntermediateCode.Immediate(addressType,parametersSize);
  5425. Emit(Add(position,sp,sp,size))
  5426. END;
  5427. END;
  5428. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5429. IF structuredReturnType THEN
  5430. (* stack pointer rewinding done by callee
  5431. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5432. Emit(Add(position,sp,sp,size));
  5433. *)
  5434. RestoreRegisters(saved);
  5435. InitOperand(result,ModeReference);
  5436. Symbol(variable,result);
  5437. ELSE
  5438. RestoreRegisters(saved);
  5439. InitOperand(result,ModeValue);
  5440. result.op := return;
  5441. END;
  5442. END;
  5443. IF alignment > 1 THEN
  5444. Emit(Pop(position,sp));
  5445. END;
  5446. IF backend.cooperative & (procedureType.callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5447. Emit(Pop(position, ap));
  5448. END;
  5449. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5450. ValueToCondition(result);
  5451. END;
  5452. destination := dest;
  5453. (* perform all write-back calls in the list *)
  5454. BackupGlobalState;
  5455. currentWriteBackCall := firstWriteBackCall;
  5456. WHILE currentWriteBackCall # NIL DO
  5457. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5458. currentWriteBackCall := currentWriteBackCall.next
  5459. END;
  5460. RestoreGlobalState;
  5461. (* TENATIVE *)
  5462. (*
  5463. IF isOperatorCall THEN
  5464. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5465. END;
  5466. *)
  5467. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5468. END VisitProcedureCallDesignator;
  5469. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5470. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5471. td: SyntaxTree.Symbol;
  5472. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5473. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5474. BEGIN
  5475. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5476. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5477. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5478. variable.SetType(system.anyType);
  5479. scope.AddVariable(variable);
  5480. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5481. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5482. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5483. typeDeclaration.SetScope(module.module.moduleScope);
  5484. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5485. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5486. END;
  5487. RETURN hiddenPointerType;
  5488. END GetHiddenPointerType;
  5489. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5490. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5491. BEGIN
  5492. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5493. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5494. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5495. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5496. scope.AddVariable(variable);
  5497. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5498. variable.SetType(system.anyType);
  5499. scope.AddVariable(variable);
  5500. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5501. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5502. typeDeclaration.SetDeclaredType(delegatePointerType);
  5503. typeDeclaration.SetScope(module.module.moduleScope);
  5504. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5505. delegatePointerType.SetState(SyntaxTree.Resolved);
  5506. END;
  5507. RETURN delegatePointerType
  5508. END GetDelegateType;
  5509. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5510. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5511. such as in VAR a: RECORD ... END;
  5512. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5513. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5514. *)
  5515. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5516. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5517. BEGIN (* no code emission *)
  5518. source := NIL;
  5519. x := x.resolved;
  5520. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5521. x := GetHiddenPointerType();
  5522. ELSIF IsDelegate(x) THEN
  5523. x := GetDelegateType();
  5524. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5525. ELSE HALT(200);
  5526. END;
  5527. td := x.typeDeclaration;
  5528. IF td = NIL THEN
  5529. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5530. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5531. ASSERT(td # NIL);
  5532. END;
  5533. IF newObjectFile THEN
  5534. GetCodeSectionNameForSymbol(td,name);
  5535. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5536. meta.CheckTypeDeclaration(x);
  5537. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5538. ELSE
  5539. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5540. END;
  5541. IF backend.cooperative OR meta.simple THEN
  5542. offset := 0;
  5543. ELSE
  5544. IF x IS SyntaxTree.CellType THEN
  5545. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5546. IF baseRecord = NIL THEN
  5547. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5548. ELSE
  5549. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5550. END;
  5551. ELSE
  5552. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5553. END;
  5554. END;
  5555. ELSE
  5556. offset := 0;
  5557. source := module.allSections.FindBySymbol(td); (*TODO*)
  5558. IF source = NIL THEN
  5559. null := 0;
  5560. GetCodeSectionNameForSymbol(td,name);
  5561. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  5562. Basic.SuffixSegmentedName (name, module.module.name);
  5563. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5564. IntermediateCode.InitImmediate(op,addressType,0);
  5565. source(IntermediateCode.Section).Emit(Data(position,op));
  5566. source.SetReferenced(FALSE)
  5567. ELSE
  5568. name := source.name;
  5569. END;
  5570. END;
  5571. RETURN td
  5572. END GetBackendType;
  5573. BEGIN
  5574. (*td := t.typeDeclaration;*)
  5575. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5576. (*
  5577. IF t IS SyntaxTree.PointerType THEN
  5578. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5579. ELSE
  5580. source := GetBackendType(t);
  5581. END;
  5582. *)
  5583. IF newObjectFile THEN
  5584. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5585. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5586. IntermediateCode.SetOffset(res,offset);
  5587. ELSE
  5588. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0);
  5589. END;
  5590. (*
  5591. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5592. make memory should be used when tag is used, not earlier
  5593. *)
  5594. RETURN res
  5595. END TypeDescriptorAdr;
  5596. (*
  5597. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5598. VAR result: IntermediateCode.Operand;
  5599. BEGIN
  5600. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5601. operand.tag := TypeDescriptorAdr(operand.type);
  5602. IntermediateCode.MakeMemory(operand.tag,addressType);
  5603. UseIntermediateOperand(operand.tag);
  5604. END;
  5605. END MakeTypeTag;
  5606. *)
  5607. PROCEDURE ProfilerInit;
  5608. VAR reg: IntermediateCode.Operand;
  5609. BEGIN
  5610. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5611. Emit(Call(position,reg,0));
  5612. END ProfilerInit;
  5613. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5614. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5615. BEGIN
  5616. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5617. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5618. THEN
  5619. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5620. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5621. Emit(Push(position,reg));
  5622. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5623. Emit(Push(position,reg));
  5624. StaticCallOperand(result,procedure);
  5625. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5626. ReleaseOperand(result);
  5627. END;
  5628. END ProfilerEnterExit;
  5629. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5630. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5631. BEGIN
  5632. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5633. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5634. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5635. profileInit.Emit(Push(position,reg));
  5636. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5637. profileInit.Emit(Push(position,reg));
  5638. NEW(string, LEN(name)); COPY(name, string^);
  5639. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5640. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5641. sv.SetType(type);
  5642. Designate(sv,result);
  5643. profileInit.Emit(Push(position,result.tag));
  5644. profileInit.Emit(Push(position,result.op));
  5645. StaticCallOperand(result,procedure);
  5646. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5647. ReleaseOperand(result);
  5648. END;
  5649. END ProfilerAddProcedure;
  5650. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5651. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5652. BEGIN
  5653. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5654. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5655. profileInit.Emit(Push(position,reg));
  5656. profileInitPatchPosition := profileInit.pc;
  5657. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5658. NEW(string, LEN(name)); COPY(name, string^);
  5659. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5660. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5661. sv.SetType(type);
  5662. Designate(sv,result);
  5663. profileInit.Emit(Push(position,result.tag));
  5664. profileInit.Emit(Push(position,result.op));
  5665. StaticCallOperand(result,procedure);
  5666. profileInit.Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  5667. ReleaseOperand(result);
  5668. END;
  5669. END ProfilerAddModule;
  5670. PROCEDURE ProfilerPatchInit;
  5671. VAR reg: IntermediateCode.Operand;
  5672. BEGIN
  5673. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5674. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5675. EmitLeave(profileInit,position,NIL,0);
  5676. profileInit.Emit(Exit(position,0,0,0));
  5677. END ProfilerPatchInit;
  5678. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5679. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5680. VAR
  5681. id: LONGINT;
  5682. leftType, rightType: SyntaxTree.Type;
  5683. procedureType: SyntaxTree.ProcedureType;
  5684. runtimeProcedure: SyntaxTree.Procedure;
  5685. runtimeProcedureOperand, operatorOperand: Operand;
  5686. kind: SET;
  5687. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5688. VAR
  5689. arg: IntermediateCode.Operand;
  5690. recordType: SyntaxTree.RecordType;
  5691. fingerPrint: SyntaxTree.FingerPrint;
  5692. BEGIN
  5693. IF type = NIL THEN
  5694. (* no type: push 'NoType' *)
  5695. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5696. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5697. ELSIF IsStrictlyPointerToRecord(type) THEN
  5698. (* pointer to record type: push typetag *)
  5699. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5700. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5701. arg := TypeDescriptorAdr(recordType);
  5702. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  5703. ELSE
  5704. (* non-pointer to record type: push fingerprint *)
  5705. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5706. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5707. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5708. END;
  5709. operatorInitializationCodeSection.Emit(Push(position,arg))
  5710. END PushTypeInfo;
  5711. BEGIN
  5712. ASSERT(operatorInitializationCodeSection # NIL);
  5713. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5714. procedureType := operator.type(SyntaxTree.ProcedureType);
  5715. (* determine types *)
  5716. leftType := procedureType.firstParameter.type;
  5717. IF procedureType.numberParameters = 2 THEN
  5718. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5719. rightType := procedureType.firstParameter.nextParameter.type;
  5720. ELSE
  5721. rightType := NIL
  5722. END;
  5723. (* determine operator kind *)
  5724. IF IsStrictlyPointerToRecord(leftType) THEN
  5725. kind := {LhsIsPointer}
  5726. ELSE
  5727. kind := {}
  5728. END;
  5729. IF IsStrictlyPointerToRecord(rightType) THEN
  5730. kind := kind + {RhsIsPointer}
  5731. END;
  5732. IF kind # {} THEN (* TODO: to be removed later on *)
  5733. (* at least one of the types is a pointer to record *)
  5734. (* emit a code that registers this specific operator in the runtime *)
  5735. dump := operatorInitializationCodeSection.comments;
  5736. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5737. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5738. (* push ID *)
  5739. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5740. id := Global.GetSymbol(module.module.case, operator.name);
  5741. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5742. (* push kind *)
  5743. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5744. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5745. (* push type infos *)
  5746. PushTypeInfo(leftType);
  5747. PushTypeInfo(rightType);
  5748. (* push operator address *)
  5749. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5750. StaticCallOperand(operatorOperand, operator);
  5751. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5752. ReleaseOperand(operatorOperand);
  5753. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5754. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcedureParametersSize(system, runtimeProcedure)));
  5755. ReleaseOperand(runtimeProcedureOperand)
  5756. END
  5757. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5758. END
  5759. END RegisterDynamicOperator;
  5760. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5761. VAR
  5762. traceModule: SyntaxTree.Module;
  5763. procedure: SyntaxTree.Procedure;
  5764. procedureVariable: SyntaxTree.Variable;
  5765. s,msg: Basic.MessageString;
  5766. res: Operand;
  5767. i: LONGINT;
  5768. sv: SyntaxTree.StringValue;
  5769. type: SyntaxTree.Type;
  5770. recordType: SyntaxTree.RecordType;
  5771. printout: Printout.Printer;
  5772. stringWriter: Streams.StringWriter;
  5773. expression: SyntaxTree.Expression;
  5774. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5775. BEGIN
  5776. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5777. IF procedure = NIL THEN
  5778. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5779. END;
  5780. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5781. s := "procedure ";
  5782. Strings.Append(s,backend.traceModuleName);
  5783. Strings.Append(s,".");
  5784. Strings.Append(s,procedureName);
  5785. Strings.Append(s," not present");
  5786. Error(position,s);
  5787. RETURN FALSE
  5788. ELSE
  5789. RETURN TRUE
  5790. END;
  5791. END GetProcedure;
  5792. PROCEDURE CallProcedure;
  5793. VAR size: LONGINT;
  5794. BEGIN
  5795. IF procedure # NIL THEN
  5796. StaticCallOperand(result,procedure);
  5797. size := ProcedureParametersSize(system,procedure);
  5798. ELSE
  5799. Symbol(procedureVariable, result);
  5800. LoadValue(result, procedureVariable.type.resolved);
  5801. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5802. END;
  5803. Emit(Call(position,result.op,size));
  5804. END CallProcedure;
  5805. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5806. VAR res: Operand; string: SyntaxTree.String;
  5807. BEGIN
  5808. IF GetProcedure("String") THEN
  5809. NEW(string, LEN(s)); COPY(s, string^);
  5810. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5811. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5812. sv.SetType(type);
  5813. Designate(sv,res);
  5814. Emit(Push(position,res.tag));
  5815. Emit(Push(position,res.op));
  5816. ReleaseOperand(res);
  5817. CallProcedure;
  5818. END;
  5819. END String;
  5820. PROCEDURE Integer(op: IntermediateCode.Operand);
  5821. BEGIN
  5822. IF GetProcedure("Int") THEN
  5823. Emit(Push(position,op));
  5824. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5825. CallProcedure;
  5826. END;
  5827. END Integer;
  5828. PROCEDURE Float(op: IntermediateCode.Operand);
  5829. BEGIN
  5830. IF GetProcedure("HIntHex") THEN
  5831. Emit(Push(position,op));
  5832. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5833. CallProcedure;
  5834. END;
  5835. END Float;
  5836. PROCEDURE Set(op: IntermediateCode.Operand);
  5837. BEGIN
  5838. IF GetProcedure("Set") THEN
  5839. Emit(Push(position,op));
  5840. (*
  5841. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5842. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5843. *)
  5844. CallProcedure;
  5845. END;
  5846. END Set;
  5847. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5848. BEGIN
  5849. IF GetProcedure("Boolean") THEN
  5850. Emit(Push(position,op));
  5851. CallProcedure;
  5852. END;
  5853. END Boolean;
  5854. PROCEDURE Char(op: IntermediateCode.Operand);
  5855. BEGIN
  5856. IF GetProcedure("Char") THEN
  5857. Emit(Push(position,op));
  5858. CallProcedure;
  5859. END;
  5860. END Char;
  5861. PROCEDURE Address(op: IntermediateCode.Operand);
  5862. BEGIN
  5863. IF GetProcedure("Address") THEN
  5864. Emit(Push(position,op));
  5865. CallProcedure;
  5866. END;
  5867. END Address;
  5868. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  5869. VAR len: IntermediateCode.Operand;
  5870. BEGIN
  5871. IF GetProcedure("String") THEN
  5872. len := GetArrayLength(type, op.tag);
  5873. Emit(Push(position,len));
  5874. ReleaseIntermediateOperand(len);
  5875. Emit(Push(position,op.op));
  5876. CallProcedure;
  5877. END;
  5878. END StringOperand;
  5879. PROCEDURE Ln;
  5880. BEGIN
  5881. IF GetProcedure("Ln") THEN
  5882. CallProcedure;
  5883. END;
  5884. END Ln;
  5885. BEGIN
  5886. IF backend.traceModuleName = "" THEN RETURN END;
  5887. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5888. IF GetProcedure("Enter") THEN
  5889. CallProcedure
  5890. END;
  5891. NEW(stringWriter,LEN(s));
  5892. FOR i := 0 TO x.Length()-1 DO
  5893. msg := "";
  5894. expression := x.GetExpression(i);
  5895. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5896. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  5897. ELSE
  5898. Global.GetModuleName(module.module, s);
  5899. END;
  5900. IF i = 0 THEN
  5901. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  5902. stringWriter.String(":");
  5903. END;
  5904. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  5905. IF ~(expression IS SyntaxTree.StringValue) THEN
  5906. printout.Expression(expression);
  5907. stringWriter.Get(s);
  5908. Strings.Append(msg,s);
  5909. Strings.Append(msg,"= ");
  5910. ELSE stringWriter.Get(s); (* remove from string writer *)
  5911. Strings.Append(msg, s);
  5912. END;
  5913. String(msg);
  5914. IF SemanticChecker.IsStringType(expression.type) THEN
  5915. Designate(expression,res);
  5916. StringOperand(res, expression.type);
  5917. ELSE
  5918. Evaluate(expression,res);
  5919. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  5920. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  5921. Convert(res.op,int64);
  5922. END;
  5923. Integer(res.op);
  5924. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  5925. Boolean(res.op);
  5926. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  5927. Set(res.op);
  5928. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  5929. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  5930. Convert(res.op,float64);
  5931. END;
  5932. Float(res.op);
  5933. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  5934. Char(res.op);
  5935. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  5936. Address(res.op);String("H");
  5937. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  5938. Address(res.op);String("H");
  5939. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  5940. Address(res.op);String("H");
  5941. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  5942. Address(res.op);String("H");
  5943. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  5944. String("NIL");
  5945. ELSE HALT(200);
  5946. END;
  5947. END;
  5948. ReleaseOperand(res);
  5949. String("; ");
  5950. END;
  5951. IF GetProcedure("Exit") THEN
  5952. CallProcedure
  5953. ELSE
  5954. Ln;
  5955. END;
  5956. END;
  5957. END SystemTrace;
  5958. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  5959. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  5960. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  5961. BEGIN
  5962. type := type.resolved;
  5963. IF type IS SyntaxTree.RecordType THEN
  5964. WITH type: SyntaxTree.RecordType DO
  5965. baseType := type.baseType;
  5966. IF baseType # NIL THEN
  5967. baseType := baseType.resolved;
  5968. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5969. InitFields(baseType,adr,offset);
  5970. END;
  5971. variable := type.recordScope.firstVariable;
  5972. WHILE variable # NIL DO
  5973. IF variable.initializer # NIL THEN
  5974. Evaluate(variable.initializer,initializerOp);
  5975. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5976. Emit(Mov(position,mem,initializerOp.op));
  5977. ReleaseOperand(initializerOp);
  5978. ReleaseIntermediateOperand(mem);
  5979. END;
  5980. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  5981. variable := variable.nextVariable
  5982. END;
  5983. END;
  5984. ELSIF type IS SyntaxTree.CellType THEN
  5985. WITH type: SyntaxTree.CellType DO
  5986. baseType := type.baseType;
  5987. IF baseType # NIL THEN
  5988. baseType := baseType.resolved;
  5989. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  5990. InitFields(baseType,adr,offset);
  5991. END;
  5992. variable := type.cellScope.firstVariable;
  5993. WHILE variable # NIL DO
  5994. IF variable.initializer # NIL THEN
  5995. Evaluate(variable.initializer,initializerOp);
  5996. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  5997. Emit(Mov(position,mem,initializerOp.op));
  5998. ReleaseOperand(initializerOp);
  5999. ReleaseIntermediateOperand(mem);
  6000. END;
  6001. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6002. variable := variable.nextVariable
  6003. END;
  6004. END;
  6005. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6006. WITH type: SyntaxTree.ArrayType DO
  6007. IF type.form = SyntaxTree.Static THEN
  6008. baseType := type.arrayBase;
  6009. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6010. FOR i := 0 TO type.staticLength-1 DO
  6011. InitFields(baseType,adr,offset+i*size);
  6012. END;
  6013. END;
  6014. END;
  6015. ELSIF type IS SyntaxTree.MathArrayType THEN
  6016. WITH type: SyntaxTree.MathArrayType DO
  6017. IF type.form = SyntaxTree.Open THEN
  6018. dim := DynamicDim(type);
  6019. imm := IntermediateCode.Immediate(addressType,dim);
  6020. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6021. baseType := SemanticChecker.ArrayBase(type,dim);
  6022. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6023. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6024. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6025. ReleaseIntermediateOperand(imm);
  6026. (* flags remain empty (=0) for open array *)
  6027. ELSIF type.form = SyntaxTree.Static THEN
  6028. baseType := type.arrayBase;
  6029. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6030. ASSERT(type.staticLength < 1024*1024*1024);
  6031. FOR i := 0 TO type.staticLength-1 DO
  6032. InitFields(baseType,adr,offset+i*size);
  6033. END;
  6034. END;
  6035. END;
  6036. END;
  6037. END InitFields;
  6038. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6039. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6040. BEGIN
  6041. type := variable.type.resolved;
  6042. IF (type IS SyntaxTree.MathArrayType) THEN
  6043. WITH type: SyntaxTree.MathArrayType DO
  6044. IF type.form = SyntaxTree.Open THEN
  6045. Symbol(variable,operand);
  6046. InitFields(type, operand.tag,0);
  6047. IF temporary THEN
  6048. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6049. END;
  6050. ELSIF type.form = SyntaxTree.Tensor THEN
  6051. Symbol(variable, operand);
  6052. MakeMemory(tmp,operand.op,addressType,0);
  6053. ReleaseOperand(operand);
  6054. IF temporary THEN
  6055. (* trick -- temporary object from array base *)
  6056. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6057. Symbol(symbol,operand);
  6058. MakeMemory(mem,operand.op,addressType,0);
  6059. ReleaseOperand(operand);
  6060. Emit(Mov(position,tmp, mem) );
  6061. ReleaseOperand(operand);
  6062. ELSE
  6063. Emit(Mov(position,tmp, nil ) );
  6064. END;
  6065. ReleaseIntermediateOperand(tmp);
  6066. END;
  6067. END;
  6068. ELSE
  6069. Symbol(variable,operand);
  6070. IF variable.initializer # NIL THEN
  6071. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6072. reference.SetType(variable.type.resolved);
  6073. reference.SetAssignable(TRUE);
  6074. Assign(reference,variable.initializer);
  6075. ELSIF temporary THEN
  6076. IF SemanticChecker.IsPointerType(variable.type) THEN
  6077. Symbol(variable, operand);
  6078. MakeMemory(tmp,operand.op,addressType,0);
  6079. ReleaseOperand(operand);
  6080. Emit(Mov(position,tmp, nil ) );
  6081. ReleaseIntermediateOperand(tmp);
  6082. END;
  6083. END;
  6084. InitFields(type, operand.op,0);
  6085. ReleaseOperand(operand);
  6086. END;
  6087. END InitVariable;
  6088. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6089. VAR end: Label;
  6090. BEGIN
  6091. IF type.form = SyntaxTree.Tensor THEN
  6092. InitOperand(result,ModeValue);
  6093. ReuseCopy(result.op,base);
  6094. end := NewLabel();
  6095. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6096. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6097. SetLabel(end);
  6098. Convert(result.op,lenType);
  6099. ELSE
  6100. InitOperand(result,ModeValue);
  6101. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6102. END
  6103. END MathArrayDim;
  6104. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6105. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6106. BEGIN
  6107. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6108. MakeMemory(mem,base,addressType,offset);
  6109. Emit(Mov(position,mem,value));
  6110. ReleaseIntermediateOperand(mem);
  6111. END PutMathArrayField;
  6112. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6113. VAR mem: IntermediateCode.Operand;
  6114. BEGIN
  6115. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6116. MakeMemory(mem,base,addressType,offset);
  6117. Emit(Mov(position,mem,value));
  6118. ReleaseIntermediateOperand(mem);
  6119. END PutMathArrayFieldOffset;
  6120. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6121. BEGIN
  6122. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6123. MakeMemory(value,base,addressType,offset);
  6124. END GetMathArrayField;
  6125. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6126. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6127. BEGIN
  6128. IF incr THEN
  6129. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6130. ELSE
  6131. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6132. END;
  6133. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6134. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6135. ELSE
  6136. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6137. Emit(Mov(position,reg,dim));
  6138. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6139. Emit(Add(position,reg,reg,base));
  6140. MakeMemory(mem, reg, addressType, offset);
  6141. ReleaseIntermediateOperand(reg);
  6142. Emit(Mov(position,mem,value));
  6143. ReleaseIntermediateOperand(mem);
  6144. END;
  6145. END PutMathArrayLenOrIncr;
  6146. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6147. BEGIN
  6148. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6149. END PutMathArrayLength;
  6150. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6151. BEGIN
  6152. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6153. END PutMathArrayIncrement;
  6154. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6155. BEGIN
  6156. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6157. END GetMathArrayIncrement;
  6158. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6159. BEGIN
  6160. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6161. END GetMathArrayLength;
  6162. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6163. VAR dimOp: IntermediateCode.Operand;
  6164. BEGIN
  6165. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6166. GetMathArrayLength(type, operand, dimOp, check, result);
  6167. END GetMathArrayLengthAt;
  6168. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6169. VAR dimOp: IntermediateCode.Operand;
  6170. BEGIN
  6171. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6172. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6173. END GetMathArrayIncrementAt;
  6174. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6175. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6176. offset: LONGINT;
  6177. BEGIN
  6178. IF increment THEN
  6179. offset := MathIncrOffset;
  6180. ELSE
  6181. offset := MathLenOffset;
  6182. END;
  6183. INC(offset,operand.dimOffset*2);
  6184. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6185. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6186. END;
  6187. (* static dimension *)
  6188. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6189. IF check & (type.form = SyntaxTree.Tensor) THEN
  6190. DimensionCheck(operand.tag,dim,BrltL);
  6191. END;
  6192. val := SHORT(dim.intValue);
  6193. IF type.form # SyntaxTree.Tensor THEN
  6194. t := SemanticChecker.ArrayBase(type,val);
  6195. type := t.resolved(SyntaxTree.MathArrayType);
  6196. IF type.form = SyntaxTree.Static THEN
  6197. IF increment THEN
  6198. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6199. ELSE
  6200. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6201. END;
  6202. InitOperand(result,ModeValue);
  6203. result.op := res;
  6204. RETURN;
  6205. END;
  6206. END;
  6207. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6208. MakeMemory(res,operand.tag,addressType,offset);
  6209. (*
  6210. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6211. *)
  6212. InitOperand(result,ModeValue);
  6213. result.op := res;
  6214. ELSE
  6215. Convert(dim,addressType);
  6216. IF check THEN
  6217. IF type.form = SyntaxTree.Tensor THEN
  6218. DimensionCheck(operand.tag,dim,BrltL);
  6219. ELSIF isUnchecked THEN (* do nothing *)
  6220. ELSE
  6221. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6222. END;
  6223. END;
  6224. end := NewLabel(); next := NIL;
  6225. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6226. Emit(Mov(position,res,dim));
  6227. Convert(res,sizeType);
  6228. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6229. WHILE t IS SyntaxTree.MathArrayType DO
  6230. type := t(SyntaxTree.MathArrayType);
  6231. IF type.form = SyntaxTree.Static THEN
  6232. imm := IntermediateCode.Immediate(sizeType,val);
  6233. next := NewLabel();
  6234. BrneL(next,imm,res);
  6235. IF increment THEN
  6236. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6237. ELSE
  6238. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6239. END;
  6240. Emit(MovReplace(position,res,imm));
  6241. BrL(end);
  6242. ELSE hasDynamicPart := TRUE;
  6243. END;
  6244. t := type.arrayBase.resolved;
  6245. val := val + 1;
  6246. IF next # NIL THEN SetLabel(next) END;
  6247. END;
  6248. IF hasDynamicPart THEN
  6249. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6250. Emit(Mov(position,res2,dim));
  6251. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6252. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6253. Emit(Add(position,res2,res2,imm));
  6254. Emit(Add(position,res2,res2,operand.tag));
  6255. IntermediateCode.MakeMemory(res2,sizeType);
  6256. Emit(MovReplace(position,res,res2));
  6257. ReleaseIntermediateOperand(res2);
  6258. END;
  6259. SetLabel(end);
  6260. Convert(res,sizeType);
  6261. InitOperand(result,ModeValue);
  6262. result.op := res;
  6263. END;
  6264. END MathArrayLenOrIncr;
  6265. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6266. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6267. offset: LONGINT;
  6268. BEGIN
  6269. offset := operand.dimOffset+DynamicDim(type)-1;
  6270. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6271. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6272. val := SHORT(dim.intValue);
  6273. t := SemanticChecker.ArrayBase(type,val);
  6274. type := t.resolved(SyntaxTree.ArrayType);
  6275. IF type.form = SyntaxTree.Static THEN
  6276. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6277. ELSE
  6278. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6279. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6280. END;
  6281. UseIntermediateOperand(res);
  6282. InitOperand(result,ModeValue);
  6283. result.op := res;
  6284. ELSE
  6285. Convert(dim,addressType);
  6286. IF ~isUnchecked THEN
  6287. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6288. END;
  6289. end := NewLabel(); next := NIL;
  6290. (* ReuseCopy(dim,res); *)
  6291. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6292. Emit(Mov(position,res,dim));
  6293. Convert(res,sizeType);
  6294. Convert(res,sizeType);
  6295. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6296. WHILE t IS SyntaxTree.ArrayType DO
  6297. type := t(SyntaxTree.ArrayType);
  6298. IF type.form = SyntaxTree.Static THEN
  6299. imm := IntermediateCode.Immediate(sizeType,val);
  6300. next := NewLabel();
  6301. BrneL(next,imm,res);
  6302. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6303. Emit(MovReplace(position,res,imm));
  6304. BrL(end);
  6305. ELSE hasDynamicPart := TRUE;
  6306. END;
  6307. t := type.arrayBase.resolved;
  6308. val := val + 1;
  6309. IF next # NIL THEN SetLabel(next) END;
  6310. END;
  6311. IF hasDynamicPart THEN
  6312. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6313. Convert(res2,addressType);
  6314. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6315. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6316. Emit(Sub(position,res2,imm,res2));
  6317. Emit(Add(position,res2,res2,operand.tag));
  6318. IntermediateCode.MakeMemory(res2,sizeType);
  6319. Emit(MovReplace(position,res,res2));
  6320. ReleaseIntermediateOperand(res2);
  6321. END;
  6322. SetLabel(end);
  6323. Convert(res,sizeType);
  6324. InitOperand(result,ModeValue);
  6325. result.op := res;
  6326. END;
  6327. END ArrayLen;
  6328. (**
  6329. create a temporary variable in current scope
  6330. **)
  6331. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6332. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6333. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6334. BEGIN
  6335. IF ~register THEN
  6336. v := temporaries.GetFreeVariable(type, untraced, index);
  6337. ELSE
  6338. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6339. END;
  6340. scope := currentScope;
  6341. (*
  6342. variable := NIL; (* disable free variable managemenet for the time being -- does not work *)
  6343. *)
  6344. name := temporaries.GetUID();
  6345. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6346. variable.SetType(type);
  6347. variable.SetAccess(SyntaxTree.Hidden);
  6348. variable.SetUntraced(untraced);
  6349. IF v = NIL THEN
  6350. temporaries.AddVariable(variable);
  6351. IF ~register THEN
  6352. IF scope.lastVariable # NIL THEN
  6353. offset := scope.lastVariable.offsetInBits;
  6354. ELSE
  6355. offset := 0;
  6356. END;
  6357. DEC(offset,system.SizeOf(variable.type));
  6358. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6359. variable(SyntaxTree.Variable).SetOffset(offset);
  6360. scope.AddVariable(variable(SyntaxTree.Variable));
  6361. scope.EnterSymbol(variable, duplicate);
  6362. ASSERT(~duplicate);
  6363. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6364. ELSE
  6365. variable.SetUseRegister(TRUE);
  6366. variable(SyntaxTree.Variable).SetOffset(0);
  6367. END;
  6368. ELSE (* v # NIL *)
  6369. (* reuse slot for new variable, do not create new slot ! *)
  6370. temporaries.SetVariable(index, variable);
  6371. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6372. ASSERT(~register);
  6373. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6374. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6375. scope.EnterSymbol(variable, duplicate);
  6376. ASSERT(~duplicate);
  6377. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6378. END;
  6379. RETURN variable(SyntaxTree.Variable)
  6380. END GetTemporaryVariable;
  6381. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6382. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6383. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6384. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6385. i: LONGINT; duplicate: BOOLEAN;
  6386. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6387. VAR variable: SyntaxTree.Variable;
  6388. BEGIN
  6389. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6390. variable.SetType(type);
  6391. recordScope.AddVariable(variable);
  6392. END AddVariable;
  6393. BEGIN
  6394. name := "@ArrayDescriptor";
  6395. Basic.AppendNumber(name,dimensions);
  6396. identifier := SyntaxTree.NewIdentifier(name);
  6397. parentScope := module.module.moduleScope;
  6398. symbol := parentScope.FindSymbol(identifier);
  6399. IF symbol # NIL THEN
  6400. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6401. type := typeDeclaration.declaredType;
  6402. ELSE
  6403. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6404. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6405. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6406. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6407. recordType.SetTypeDeclaration(typeDeclaration);
  6408. recordType.SetState(SyntaxTree.Resolved);
  6409. typeDeclaration.SetDeclaredType(recordType);
  6410. AddVariable("@ptr",system.anyType);
  6411. AddVariable("@adr",system.addressType);
  6412. AddVariable("@flags",system.addressType);
  6413. AddVariable("@dim",system.addressType);
  6414. AddVariable("@elementSize",system.addressType);
  6415. FOR i := 0 TO dimensions-1 DO
  6416. name := "@len";
  6417. Basic.AppendNumber(name,i);
  6418. AddVariable(name,system.addressType);
  6419. name := "@incr";
  6420. Basic.AppendNumber(name,i);
  6421. AddVariable(name,system.addressType);
  6422. END;
  6423. parentScope.AddTypeDeclaration(typeDeclaration);
  6424. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6425. ASSERT(~duplicate);
  6426. type := recordType;
  6427. END;
  6428. RETURN type
  6429. END GetMathArrayDescriptorType;
  6430. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6431. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6432. BEGIN
  6433. type := GetMathArrayDescriptorType(dimensions);
  6434. Emit(Push(position,op.op));
  6435. (* push type descriptor *)
  6436. reg := TypeDescriptorAdr(type);
  6437. IF ~newObjectFile THEN
  6438. IntermediateCode.MakeMemory(reg,addressType);
  6439. END;
  6440. Emit(Push(position,reg));
  6441. ReleaseIntermediateOperand(reg);
  6442. (* push realtime flag: false by default *)
  6443. Emit(Push(position,false));
  6444. CallThis(position,"Heaps","NewRec",3);
  6445. END NewMathArrayDescriptor;
  6446. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6447. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6448. BEGIN
  6449. NEW(string, LEN(s)); COPY(s, string^);
  6450. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6451. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6452. sv.SetType(type);
  6453. Designate(sv,res);
  6454. Emit(Push(position,res.tag));
  6455. Emit(Push(position,res.op));
  6456. ReleaseOperand(res);
  6457. END PushConstString;
  6458. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6459. BEGIN
  6460. IF b THEN
  6461. Emit(Push(Basic.invalidPosition, true));
  6462. ELSE
  6463. Emit(Push(Basic.invalidPosition, false));
  6464. END;
  6465. END PushConstBoolean;
  6466. PROCEDURE PushConstSet(v: SET);
  6467. VAR value: SyntaxTree.Value; op: Operand;
  6468. BEGIN
  6469. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6470. value.SetType(system.setType);
  6471. Evaluate(value, op);
  6472. Emit(Push(Basic.invalidPosition, op.op));
  6473. ReleaseOperand(op);
  6474. END PushConstSet;
  6475. PROCEDURE PushConstInteger(v: LONGINT);
  6476. VAR value: SyntaxTree.Value; op: Operand;
  6477. BEGIN
  6478. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6479. value.SetType(system.longintType);
  6480. Evaluate(value, op);
  6481. Emit(Push(Basic.invalidPosition, op.op));
  6482. ReleaseOperand(op);
  6483. END PushConstInteger;
  6484. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6485. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6486. section: IntermediateCode.Section;
  6487. BEGIN
  6488. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6489. Global.GetSymbolSegmentedName(symbol, name);
  6490. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6491. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6492. procedure.SetScope(moduleScope);
  6493. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6494. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6495. procedure.SetAccess(SyntaxTree.Hidden);
  6496. currentScope := procedureScope;
  6497. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6498. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6499. RETURN section;
  6500. END OpenInitializer;
  6501. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6502. BEGIN
  6503. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6504. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6505. section := prev;
  6506. END CloseInitializer;
  6507. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6508. VAR name: SyntaxTree.IdentifierString;
  6509. variable: SyntaxTree.Variable;
  6510. parameter: SyntaxTree.Parameter;
  6511. type: SyntaxTree.Type;
  6512. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6513. BEGIN
  6514. InitOperand(op,ModeReference);
  6515. op.op := fp;
  6516. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6517. Dereference(op, x, FALSE);
  6518. result := op;
  6519. Symbol(symbol, op);
  6520. END Field;
  6521. PROCEDURE Direction(direction: LONGINT): SET;
  6522. BEGIN
  6523. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6524. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6525. ELSE HALT(100);
  6526. END;
  6527. END Direction;
  6528. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6529. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6530. BEGIN
  6531. Field(port, op);
  6532. ToMemory(op.op,addressType,0);
  6533. Emit(Push(Basic.invalidPosition, op.op));
  6534. ReleaseOperand(op);
  6535. Basic.GetString(modifier.identifier, name);
  6536. PushConstString(name);
  6537. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6538. ASSERT(SemanticChecker.IsStringType(value.type));
  6539. Designate(value, op);
  6540. Emit(Push(modifier.position, op.tag));
  6541. Emit(Push(modifier.position, op.op));
  6542. ReleaseOperand(op);
  6543. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6544. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6545. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6546. Evaluate(value, op);
  6547. Emit(Push(modifier.position, op.op));
  6548. ReleaseOperand(op);
  6549. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6550. ELSE
  6551. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6552. END;
  6553. END AddPortProperty;
  6554. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6555. VAR modifier: SyntaxTree.Modifier;
  6556. BEGIN
  6557. modifier := parameter.modifiers;
  6558. WHILE modifier # NIL DO
  6559. AddPortProperty(parameter,modifier, modifier.expression);
  6560. modifier := modifier.nextModifier;
  6561. END;
  6562. END AddPortProperties;
  6563. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6564. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6565. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6566. PROCEDURE PushLens(type: SyntaxTree.Type);
  6567. BEGIN
  6568. IF IsSemiDynamicArray(type) THEN
  6569. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6570. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6571. Emit(Push(Basic.invalidPosition, op.op));
  6572. ReleaseOperand(op);
  6573. INC(dim);
  6574. ELSIF IsStaticArray(type) THEN
  6575. len := len * type(SyntaxTree.ArrayType).staticLength;
  6576. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6577. INC(dim);
  6578. ELSE
  6579. baseType := type;
  6580. END;
  6581. END PushLens;
  6582. BEGIN
  6583. (* cell *)
  6584. IF parameter.type IS SyntaxTree.ArrayType THEN
  6585. type := parameter.type;
  6586. dim := 0;
  6587. len := 1;
  6588. PushLens(type);
  6589. portType := baseType.resolved(SyntaxTree.PortType);
  6590. ELSE
  6591. portType := parameter.type(SyntaxTree.PortType);
  6592. END;
  6593. PushSelfPointer();
  6594. (* port / array of ports *)
  6595. IF IsStaticArray(type) THEN
  6596. PushConstInteger(len);
  6597. END;
  6598. Field(parameter, op);
  6599. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6600. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6601. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6602. Designate(d, op);*)
  6603. Emit(Push(Basic.invalidPosition, op.op));
  6604. ReleaseOperand(op);
  6605. (* name *)
  6606. PushConstString(name);
  6607. (* inout *)
  6608. PushConstSet(Direction(portType.direction));
  6609. (* width *)
  6610. PushConstInteger(portType.sizeInBits);
  6611. IF parameter.type IS SyntaxTree.PortType THEN
  6612. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6613. AddPortProperties(parameter);
  6614. ELSIF IsStaticArray(type)THEN
  6615. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6616. ELSIF IsSemiDynamicArray(type) THEN
  6617. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6618. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6619. Emit(Add(position,reg, sp, size));
  6620. (* dim *)
  6621. PushConstInteger(dim);
  6622. (* len array *)
  6623. Emit(Push(position, reg));
  6624. ReleaseIntermediateOperand(reg);
  6625. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6626. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6627. Emit(Add(position, sp,sp, size));
  6628. ELSE
  6629. HALT(100);
  6630. END;
  6631. END Parameter;
  6632. BEGIN
  6633. IF backend.cellsAreObjects THEN
  6634. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6635. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6636. END;
  6637. parameter := x.firstParameter;
  6638. WHILE (parameter # NIL) DO
  6639. type := parameter.type.resolved;
  6640. WHILE (type IS SyntaxTree.ArrayType) DO
  6641. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6642. END;
  6643. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6644. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6645. Parameter(name,parameter);
  6646. END;
  6647. parameter := parameter.nextParameter;
  6648. END;
  6649. ELSE HALT(200)
  6650. END;
  6651. END AddPorts;
  6652. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6653. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6654. BEGIN
  6655. Symbol(cell,op);
  6656. ToMemory(op.op,addressType,0);
  6657. Emit(Push(position,op.op));
  6658. ReleaseOperand(op);
  6659. property.GetName(name);
  6660. (* does not work when inheritance is used:
  6661. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6662. *)
  6663. PushConstString(name);
  6664. IF (value # NIL) THEN
  6665. ASSERT(
  6666. SemanticChecker.IsStringType(property.type)
  6667. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6668. OR (property.type.resolved IS SyntaxTree.FloatType)
  6669. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6670. OR (property.type.resolved IS SyntaxTree.SetType)
  6671. );
  6672. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6673. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6674. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6675. Designate(d, op);
  6676. IF SemanticChecker.IsStringType(property.type) THEN
  6677. Emit(Push(Basic.invalidPosition, op.tag))
  6678. END;
  6679. Emit(Push(Basic.invalidPosition, op.op));
  6680. ReleaseOperand(op);
  6681. END;
  6682. IF value = NIL THEN
  6683. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6684. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6685. ASSERT(SemanticChecker.IsStringType(value.type));
  6686. Designate(value, op);
  6687. PushString(op, value.type);
  6688. ReleaseOperand(op);
  6689. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6690. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6691. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6692. Evaluate(value, op);
  6693. Emit(Push(property.position, op.op));
  6694. ReleaseOperand(op);
  6695. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6696. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6697. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6698. Evaluate(value, op);
  6699. Emit(Push(property.position, op.op));
  6700. ReleaseOperand(op);
  6701. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6702. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6703. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6704. Evaluate(value, op);
  6705. Emit(Push(property.position, op.op));
  6706. ReleaseOperand(op);
  6707. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6708. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6709. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6710. Evaluate(value, op);
  6711. Emit(Push(property.position, op.op));
  6712. ReleaseOperand(op);
  6713. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6714. ELSE
  6715. HALT(200);
  6716. END;
  6717. END AddProperty;
  6718. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6719. VAR symbol: SyntaxTree.Symbol;
  6720. BEGIN
  6721. WHILE modifier # NIL DO
  6722. symbol := cellType.FindProperty(modifier.identifier);
  6723. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6724. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6725. modifier := modifier.nextModifier;
  6726. END;
  6727. END AddModifiers;
  6728. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6729. VAR last: SyntaxTree.Modifier;
  6730. BEGIN
  6731. IF to = NIL THEN
  6732. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6733. ELSE
  6734. last := to;
  6735. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6736. last := last.nextModifier;
  6737. END;
  6738. IF last.identifier # this.identifier THEN
  6739. ASSERT(last.nextModifier = NIL);
  6740. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6741. END;
  6742. END;
  6743. END AppendModifier;
  6744. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6745. BEGIN
  6746. WHILE this # NIL DO
  6747. AppendModifier(to, this);
  6748. this := this.nextModifier;
  6749. END;
  6750. END AppendModifiers;
  6751. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6752. VAR base: SyntaxTree.Type;
  6753. BEGIN
  6754. AppendModifiers(to, c.modifiers);
  6755. base := c.GetBaseValueType();
  6756. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6757. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6758. END;
  6759. END AppendCellTypeModifiers;
  6760. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6761. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6762. BEGIN
  6763. Basic.GetString(modifier.identifier, name);
  6764. PushConstString(name);
  6765. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6766. ASSERT(SemanticChecker.IsStringType(value.type));
  6767. Designate(value, op);
  6768. PushString(op, value.type);
  6769. ReleaseOperand(op);
  6770. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6771. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6772. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6773. Evaluate(value, op);
  6774. Emit(Push(modifier.position, op.op));
  6775. ReleaseOperand(op);
  6776. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6777. ELSE
  6778. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6779. END;
  6780. END AddPortProperty;
  6781. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6782. BEGIN
  6783. WHILE modifier # NIL DO
  6784. AddPortProperty(modifier, modifier.expression);
  6785. modifier := modifier.nextModifier;
  6786. END;
  6787. END AddPortProperties;
  6788. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6789. VAR op: Operand;
  6790. BEGIN
  6791. Evaluate(p, op);
  6792. Emit(Push(p.position, op.op));
  6793. ReleaseOperand(op);
  6794. IF p IS SyntaxTree.Designator THEN
  6795. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6796. END;
  6797. END PushPort;
  6798. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6799. VAR tmp: IntermediateCode.Operand;
  6800. BEGIN
  6801. actualType := actualType.resolved;
  6802. IF actualType IS SyntaxTree.StringType THEN
  6803. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6804. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6805. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6806. ELSE
  6807. tmp := op.tag;
  6808. IntermediateCode.MakeMemory(tmp,addressType);
  6809. Emit(Push(position,tmp));
  6810. END;
  6811. Emit(Push(position,op.op))
  6812. END PushString;
  6813. (* conservative check if x is potentially on the heap, excluding the module heap
  6814. required for generational garbage collector
  6815. *)
  6816. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6817. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6818. BEGIN
  6819. RETURN TRUE;
  6820. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6821. passed by reference.
  6822. pos := x.position.start;
  6823. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6824. x := x(SyntaxTree.Designator).left;
  6825. END;
  6826. RETURN x # NIL;
  6827. *)
  6828. END OnHeap;
  6829. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  6830. VAR
  6831. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6832. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6833. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6834. tmp:IntermediateCode.Operand;
  6835. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6836. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6837. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6838. dest: IntermediateCode.Operand;
  6839. staticLength: LONGINT; itype: IntermediateCode.Type;
  6840. convert,isTensor: BOOLEAN;
  6841. recordType: SyntaxTree.RecordType;
  6842. baseType: SyntaxTree.Type;
  6843. flags: SET;
  6844. left: SyntaxTree.Expression;
  6845. call: SyntaxTree.Designator;
  6846. procedure: SyntaxTree.Procedure;
  6847. temporaryVariable: SyntaxTree.Variable;
  6848. dummy: IntermediateCode.Operand;
  6849. customBuiltin: SyntaxTree.CustomBuiltin;
  6850. isVarPar: ARRAY 3 OF BOOLEAN;
  6851. callsection: Sections.Section;
  6852. segmentedName: Basic.SegmentedName;
  6853. needsTrace: BOOLEAN;
  6854. n: ARRAY 256 OF CHAR;
  6855. modifier: SyntaxTree.Modifier;
  6856. previous, init: IntermediateCode.Section;
  6857. prevScope: SyntaxTree.Scope;
  6858. firstPar: LONGINT;
  6859. saved: RegisterEntry;
  6860. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6861. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6862. priority: IntermediateCode.Operand;
  6863. op,callop: Operand;
  6864. BEGIN
  6865. IF type = NIL THEN RETURN END;
  6866. type := type.resolved;
  6867. IF type IS SyntaxTree.PointerType THEN
  6868. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6869. END;
  6870. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6871. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6872. recordScope := type(SyntaxTree.RecordType).recordScope;
  6873. IF recordScope.bodyProcedure # NIL THEN
  6874. procedure := recordScope.bodyProcedure;
  6875. body := procedure.procedureScope.body;
  6876. Emit(Push(position,self));
  6877. IF body.isActive THEN
  6878. StaticCallOperand(callop,procedure);
  6879. Emit(Push(position,callop.op));
  6880. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  6881. Convert(priority,sizeType);
  6882. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  6883. END;
  6884. Emit(Push(position,priority));
  6885. ReleaseIntermediateOperand(priority);
  6886. IF backend.cooperative THEN
  6887. Emit(Push(position,self));
  6888. CallThis(position,"Activities","Create",3)
  6889. ELSE
  6890. flags := 0;
  6891. IF body.isSafe THEN
  6892. flags := 1;
  6893. END;
  6894. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  6895. Emit(Push(position,self));
  6896. CallThis(position,"Objects","CreateProcess",4)
  6897. END;
  6898. ELSE
  6899. Emit(Push(position,self));
  6900. StaticCallOperand(callop,procedure);
  6901. Emit(Call(position,callop.op,ProcedureParametersSize(system,procedure)));
  6902. END;
  6903. Emit(Pop(position,self));
  6904. END;
  6905. END CallBodies;
  6906. PROCEDURE PushTD(type: SyntaxTree.Type);
  6907. VAR op: IntermediateCode.Operand;
  6908. BEGIN
  6909. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  6910. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  6911. ELSE
  6912. IF type.resolved IS SyntaxTree.PointerType THEN
  6913. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  6914. END;
  6915. op := TypeDescriptorAdr(type.resolved);
  6916. IF ~newObjectFile THEN
  6917. IntermediateCode.MakeMemory(op,addressType);
  6918. END;
  6919. Emit(Push(position,op));
  6920. END
  6921. END PushTD;
  6922. BEGIN
  6923. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  6924. dest := destination; destination := emptyOperand;
  6925. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  6926. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  6927. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  6928. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  6929. CASE x.id OF
  6930. (* ---- COPY ----- *)
  6931. |Global.Copy:
  6932. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  6933. (* ---- EXCL, INCL----- *)
  6934. |Global.Excl,Global.Incl:
  6935. Evaluate(p0,s0);
  6936. Evaluate(p1,s1);
  6937. Convert(s1.op,setType);
  6938. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  6939. TrapC(BrltL,s1.op,IntermediateCode.Immediate(setType,setType.sizeInBits),IndexCheckTrap);
  6940. END;
  6941. ReuseCopy(res,s0.op);
  6942. ReleaseOperand(s0);
  6943. Reuse1(tmp,s1.op);
  6944. ReleaseOperand(s1);
  6945. Emit(Shl(position,tmp,IntermediateCode.Immediate(setType,1),s1.op));
  6946. IF x.id = Global.Excl THEN
  6947. Emit(Not(position,tmp,tmp));
  6948. Emit(And(position,res,res,tmp));
  6949. ELSE
  6950. Emit(Or(position,res,res,tmp));
  6951. END;
  6952. ReleaseIntermediateOperand(tmp);
  6953. Designate(p0,s0);
  6954. ToMemory(s0.op,setType,0);
  6955. Emit(Mov(position,s0.op,res));
  6956. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  6957. (* ---- DISPOSE ----- *)
  6958. |Global.Dispose:
  6959. Designate(p0,s0);
  6960. Emit(Push(position,s0.op));
  6961. ReleaseOperand(s0);
  6962. CallThis(position,DefaultRuntimeModuleName,"Dispose", 1);
  6963. (* ---- GETPROCEDURE ----- *)
  6964. |Global.GetProcedure:
  6965. Designate(p0,s0);
  6966. PushString(s0,p0.type);
  6967. Designate(p1,s1);
  6968. PushString(s1,p1.type);
  6969. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  6970. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  6971. ELSE PushTD(procedureType.firstParameter.type)
  6972. END;
  6973. PushTD(procedureType.returnType);
  6974. Designate(p2,s2);
  6975. Emit(Push(position,s2.op));
  6976. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  6977. CallThis(position,"Modules","GetProcedure", 7);
  6978. (* ---- ASH, LSH, ROT ----- *)
  6979. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  6980. Evaluate(p0,s0);
  6981. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  6982. (* make unsigned arguments in order to produced a logical shift *)
  6983. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  6984. convert:= TRUE;
  6985. itype := s0.op.type;
  6986. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  6987. Convert(s0.op,itype);
  6988. ELSE
  6989. convert := FALSE;
  6990. END;
  6991. END;
  6992. Evaluate(p1,s1);
  6993. IF IsIntegerConstant(p1,hint) THEN
  6994. ReuseCopy(reg,s0.op);
  6995. IF hint > 0 THEN
  6996. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  6997. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  6998. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  6999. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7000. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7001. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7002. END;
  7003. ELSIF hint < 0 THEN
  7004. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7005. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7006. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7007. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7008. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7009. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7010. END;
  7011. END;
  7012. ReleaseOperand(s0); ReleaseOperand(s1);
  7013. ELSE
  7014. exit := NewLabel();
  7015. end := NewLabel();
  7016. ReuseCopy(reg,s0.op);
  7017. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7018. Reuse1(tmp,s1.op);
  7019. Emit(Neg(position,tmp,s1.op));
  7020. Convert(tmp,s1.op.type);
  7021. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7022. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7023. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7024. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7025. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7026. END;
  7027. ReleaseIntermediateOperand(tmp);
  7028. BrL(end);
  7029. SetLabel(exit);
  7030. ReuseCopy(tmp,s1.op);
  7031. Convert(tmp,s1.op.type);
  7032. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7033. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7034. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7035. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7036. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7037. END;
  7038. ReleaseIntermediateOperand(tmp);
  7039. SetLabel(end);
  7040. ReleaseOperand(s0); ReleaseOperand(s1);
  7041. END;
  7042. InitOperand(result,ModeValue);
  7043. IF convert THEN
  7044. itype := reg.type;
  7045. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7046. Convert(reg,itype);
  7047. END;
  7048. result.op := reg;
  7049. (* ---- CAP ----- *)
  7050. |Global.Cap:
  7051. Evaluate(p0,result);
  7052. ReuseCopy(reg,result.op);
  7053. ReleaseIntermediateOperand(result.op);
  7054. ignore := NewLabel();
  7055. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7056. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7057. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7058. SetLabel(ignore);
  7059. result.op := reg;
  7060. (* ---- CHR ----- *)
  7061. |Global.Chr, Global.Chr32:
  7062. Evaluate(p0,result);
  7063. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7064. |Global.Entier, Global.EntierH:
  7065. Evaluate(p0,result);
  7066. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7067. (* ---- MIN and MAX ----- *)
  7068. |Global.Max,Global.Min:
  7069. Evaluate(p0,s0);
  7070. Evaluate(p1,s1);
  7071. Reuse2(res,s0.op,s1.op);
  7072. else := NewLabel();
  7073. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7074. ELSE BrltL(else,s1.op,s0.op) END;
  7075. Emit(Mov(position,res,s0.op));
  7076. ReleaseOperand(s0);
  7077. end := NewLabel();
  7078. BrL(end);
  7079. SetLabel(else);
  7080. Emit(MovReplace(position,res,s1.op));
  7081. SetLabel(end);
  7082. ReleaseOperand(s1);
  7083. InitOperand(result,ModeValue);
  7084. result.op := res;
  7085. (* ---- ODD ----- *)
  7086. |Global.Odd:
  7087. IF ~conditional THEN
  7088. ConditionToValue(x)
  7089. ELSE
  7090. Evaluate(p0,result);
  7091. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7092. Reuse1(res,result.op);
  7093. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7094. ReleaseIntermediateOperand(result.op);
  7095. result.op := res;
  7096. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7097. ReleaseOperand(result);
  7098. BrL(falseLabel);
  7099. END;
  7100. (* ---- ORD ----- *)
  7101. |Global.Ord, Global.Ord32:
  7102. Evaluate(p0,result);
  7103. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7104. (* ---- SHORT, LONG ----- *)
  7105. |Global.Short, Global.Long:
  7106. Evaluate(p0,result);
  7107. IF x.type IS SyntaxTree.ComplexType THEN
  7108. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7109. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7110. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7111. ELSE
  7112. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7113. END
  7114. (* ---- HALT, SYSTEM.HALT----- *)
  7115. |Global.Halt, Global.systemHalt:
  7116. val := p0.resolved(SyntaxTree.IntegerValue).value;
  7117. EmitTrap (position, val);
  7118. (* ---- ASSERT ----- *)
  7119. |Global.Assert:
  7120. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7121. trueL := NewLabel();
  7122. falseL := NewLabel();
  7123. Condition(p0,trueL,falseL);
  7124. IF p1 = NIL THEN val := AssertTrap
  7125. ELSE val := p1.resolved(SyntaxTree.IntegerValue).value;
  7126. END;
  7127. SetLabel(falseL);
  7128. EmitTrap(position,val);
  7129. SetLabel(trueL);
  7130. END;
  7131. (*
  7132. Emit(TrapC(result.op,val);
  7133. *)
  7134. (* ---- INC, DEC----- *)
  7135. |Global.Inc,Global.Dec:
  7136. Expression(p0); adr := result.op;
  7137. LoadValue(result,p0.type); l := result;
  7138. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7139. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7140. END;
  7141. IF x.id = Global.Inc THEN
  7142. Emit(Add(position,l.op,l.op,r.op));
  7143. ELSE
  7144. Emit(Sub(position,l.op,l.op,r.op));
  7145. END;
  7146. ReleaseOperand(l); ReleaseOperand(r);
  7147. (* ---- LEN ----- *)
  7148. |Global.Len: (* dynamic length, static length done by checker *)
  7149. Designate(p0,operand);
  7150. IF p1 = NIL THEN
  7151. InitOperand(l,ModeValue);
  7152. l.op := IntermediateCode.Immediate(sizeType,0);
  7153. ELSE
  7154. Evaluate(p1,l);
  7155. END;
  7156. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7157. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7158. Dereference(operand, p0.type.resolved, FALSE);
  7159. END;
  7160. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7161. ReleaseOperand(operand); ReleaseOperand(l);
  7162. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7163. ASSERT(p1 # NIL);
  7164. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7165. Dereference(operand,p0.type.resolved,FALSE);
  7166. END;
  7167. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7168. ReleaseOperand(operand); ReleaseOperand(l);
  7169. ELSE HALT(100);
  7170. END;
  7171. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7172. (* ---- FIRST ---- *)
  7173. |Global.First:
  7174. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7175. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7176. ELSE
  7177. Designate(p0, result)
  7178. END
  7179. (* ---- LAST ---- *)
  7180. |Global.Last:
  7181. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7182. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7183. ELSE
  7184. Designate(p0, result);
  7185. (* make sure result.op is a register *)
  7186. tmp := result.op;
  7187. ReuseCopy(result.op, result.op);
  7188. ReleaseIntermediateOperand(tmp);
  7189. (* add offset to result.op *)
  7190. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7191. END
  7192. (* ---- STEP ---- *)
  7193. |Global.Step:
  7194. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7195. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7196. ELSE
  7197. Designate(p0, result);
  7198. (* make sure result.op is a register *)
  7199. tmp := result.op;
  7200. ReuseCopy(result.op, result.op);
  7201. ReleaseIntermediateOperand(tmp);
  7202. (* add offset to result.op *)
  7203. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7204. END
  7205. (* ---- RE ---- *)
  7206. |Global.Re:
  7207. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7208. Designate(p0, result)
  7209. ELSE
  7210. Evaluate(p0, result)
  7211. END
  7212. (* ---- IM ---- *)
  7213. |Global.Im:
  7214. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7215. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7216. Designate(p0, result);
  7217. (* make sure result.op is a register *)
  7218. tmp := result.op;
  7219. ReuseCopy(result.op, result.op);
  7220. ReleaseIntermediateOperand(tmp);
  7221. (* add offset to result.op *)
  7222. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7223. (* ---- ABS ----- *)
  7224. |Global.Abs:
  7225. Evaluate(p0,operand);
  7226. type := p0.type.resolved;
  7227. InitOperand(result,ModeValue);
  7228. Reuse1a(result.op,operand.op,dest);
  7229. Emit(Abs(position,result.op,operand.op));
  7230. ReleaseOperand(operand);
  7231. (* ---- WAIT ----- *)
  7232. |Global.Wait:
  7233. Evaluate(p0,operand);
  7234. Emit(Push(position,operand.op));
  7235. ReleaseOperand(operand);
  7236. CallThis(position,"Activities","Wait", 1);
  7237. (* ---- NEW ----- *)
  7238. |Global.New:
  7239. (*! the following code is only correct for "standard" Oberon calling convention *)
  7240. IF x.type # NIL THEN
  7241. type := x.type.resolved;
  7242. firstPar := 0;
  7243. ELSE
  7244. type := p0.type.resolved;
  7245. firstPar := 1;
  7246. END;
  7247. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7248. THEN
  7249. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7250. IF backend.cooperative THEN
  7251. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7252. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7253. IF recordType.isObject THEN
  7254. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7255. IF recordType.IsActive() THEN
  7256. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7257. END;
  7258. IF recordType.IsProtected() THEN
  7259. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7260. END;
  7261. ELSE
  7262. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7263. END;
  7264. END;
  7265. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7266. CallThis(position,"Runtime","New", 1);
  7267. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7268. Emit(Result(position, pointer));
  7269. exit := NewLabel();
  7270. BreqL(exit,pointer,nil);
  7271. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7272. GetRecordTypeName (recordType,name);
  7273. IF ~recordType.isObject THEN
  7274. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7275. END;
  7276. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7277. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7278. IF recordType.isObject THEN
  7279. IF recordType.IsProtected() THEN
  7280. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7281. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7282. END;
  7283. IF recordType.IsActive() THEN
  7284. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7285. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7286. END;
  7287. END;
  7288. END;
  7289. (* initialize fields *)
  7290. IF type(SyntaxTree.PointerType).isPlain THEN
  7291. size := 0;
  7292. ELSIF recordType.isObject THEN
  7293. size := BaseObjectTypeSize;
  7294. ELSE
  7295. size := BaseRecordTypeSize;
  7296. END;
  7297. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7298. (* call initializer *)
  7299. constructor := GetConstructor(recordType);
  7300. IF constructor # NIL THEN
  7301. (*! should be unified with ProcedureCallDesignator *)
  7302. Emit(Push(position,pointer));
  7303. ReleaseIntermediateOperand(pointer);
  7304. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7305. FOR i := firstPar TO x.parameters.Length()-1 DO
  7306. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7307. formalParameter := formalParameter.nextParameter;
  7308. END;
  7309. (* static call of the constructor *)
  7310. GetCodeSectionNameForSymbol(constructor,name);
  7311. ASSERT(~constructor.isInline);
  7312. IF constructor.scope.ownerModule # module.module THEN
  7313. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7314. ELSE
  7315. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7316. END;
  7317. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7318. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7319. Emit(Pop(position,pointer));
  7320. END;
  7321. (* call bodies *)
  7322. CallBodies(pointer,type);
  7323. SetLabel(exit);
  7324. needsTrace := p0.NeedsTrace();
  7325. IF needsTrace THEN ModifyAssignments(true) END;
  7326. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7327. Emit(Push(position, pointer));
  7328. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7329. Emit(Pop(position, pointer));
  7330. END;
  7331. Designate(p0,l);
  7332. IF needsTrace THEN
  7333. CallAssignPointer(l.op, pointer);
  7334. ELSE
  7335. ToMemory(l.op,addressType,0);
  7336. Emit(Mov(position,l.op,pointer));
  7337. END;
  7338. ReleaseIntermediateOperand(pointer);
  7339. ReleaseOperand(l);
  7340. IF needsTrace THEN ModifyAssignments(false) END;
  7341. ELSE (* not cooperative backend *)
  7342. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7343. IF temporaryVariable # NIL THEN
  7344. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7345. ELSE
  7346. Designate(p0,l);
  7347. END;
  7348. (* l.op contains address of pointer to record *)
  7349. Emit(Push(position,l.op)); (* address for use after syscall *)
  7350. Emit(Push(position,l.op));
  7351. ReleaseOperand(l);
  7352. (* push type descriptor *)
  7353. reg := TypeDescriptorAdr(recordType);
  7354. IF ~newObjectFile THEN
  7355. IntermediateCode.MakeMemory(reg,addressType);
  7356. END;
  7357. Emit(Push(position,reg));
  7358. ReleaseIntermediateOperand(reg);
  7359. (* push realtime flag *)
  7360. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7361. ELSE Emit(Push(position,false));
  7362. END;
  7363. CallThis(position,"Heaps","NewRec", 3);
  7364. (* check allocation success, if not successful then do not call initializers and bodies *)
  7365. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7366. Emit(Pop(position,pointer));
  7367. MakeMemory(reg,pointer,addressType,0);
  7368. ReleaseIntermediateOperand(pointer);
  7369. pointer := reg;
  7370. exit := NewLabel();
  7371. BreqL(exit,pointer,nil);
  7372. Emit(Push(position,pointer));
  7373. (* initialize fields *)
  7374. InitFields(recordType, pointer,0);
  7375. (* call initializer *)
  7376. constructor := GetConstructor(recordType);
  7377. IF constructor # NIL THEN
  7378. (*! should be unified with ProcedureCallDesignator *)
  7379. Emit(Push(position,pointer));
  7380. ReleaseIntermediateOperand(pointer);
  7381. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7382. FOR i := firstPar TO x.parameters.Length()-1 DO
  7383. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7384. formalParameter := formalParameter.nextParameter;
  7385. END;
  7386. (* static call of the constructor *)
  7387. GetCodeSectionNameForSymbol(constructor,name);
  7388. ASSERT(~constructor.isInline);
  7389. IF constructor.scope.ownerModule # module.module THEN
  7390. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7391. ELSE
  7392. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7393. END;
  7394. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7395. ELSE
  7396. ReleaseIntermediateOperand(pointer);
  7397. END;
  7398. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7399. Emit(Pop(position,pointer));
  7400. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7401. Designate(p0,l);
  7402. IF backend.writeBarriers & OnHeap(p0) THEN
  7403. SaveRegisters();ReleaseUsedRegisters(saved);
  7404. Emit(Push(position,l.op));
  7405. Emit(Push(position,pointer));
  7406. CallThis(position,"Heaps","Assign",2);
  7407. RestoreRegisters(saved);
  7408. ELSE
  7409. ToMemory(l.op,addressType,0);
  7410. Emit(Mov(position,l.op,pointer));
  7411. END;
  7412. ReleaseOperand(l);
  7413. result.tag := emptyOperand;
  7414. ELSIF (x.type # NIL) THEN
  7415. result := l; (* temporary variable is the result of NEW Type() *)
  7416. END;
  7417. (* call bodies *)
  7418. CallBodies(pointer,type);
  7419. ReleaseIntermediateOperand(pointer);
  7420. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7421. end := NewLabel();
  7422. BrL(end);
  7423. SetLabel(exit);
  7424. Designate(p0,l);
  7425. ToMemory(l.op,addressType,0);
  7426. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7427. ReleaseOperand(l);
  7428. SetLabel(end);
  7429. ELSE
  7430. SetLabel(exit);
  7431. END;
  7432. END;
  7433. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7434. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7435. IF ~backend.cooperative THEN (* simpler version *)
  7436. (*
  7437. push len0
  7438. push len1
  7439. push len2
  7440. push len_size
  7441. push len_adr
  7442. push tag
  7443. push static elements
  7444. push element size
  7445. push adr
  7446. *)
  7447. dim := 0;
  7448. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7449. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7450. parameter := x.parameters.GetExpression(i);
  7451. Evaluate(parameter,r);
  7452. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7453. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7454. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7455. END;
  7456. Emit(Push(position,r.op));
  7457. ReleaseOperand(r);
  7458. INC(dim);
  7459. END;
  7460. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7461. Emit(Mov(position, adr, sp));
  7462. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7463. Emit(Push(position, adr));
  7464. ReleaseIntermediateOperand(adr);
  7465. openDim := dim;
  7466. staticLength := 1;
  7467. IF type IS SyntaxTree.ArrayType THEN
  7468. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7469. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7470. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7471. END;
  7472. END;
  7473. IF SemanticChecker.ContainsPointer(type) THEN
  7474. tmp := TypeDescriptorAdr(type);
  7475. IF ~newObjectFile THEN
  7476. IntermediateCode.MakeMemory(tmp,addressType);
  7477. END;
  7478. ELSE
  7479. tmp := nil;
  7480. END;
  7481. Emit(Push(position,tmp)); (* type descriptor *)
  7482. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7483. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7484. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7485. Designate(p0,l);
  7486. Emit(Push(position,l.op)); (* address *)
  7487. ReleaseOperand(l);
  7488. CallThis(position,"Heaps","NewArray", 6);
  7489. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7490. Emit(Add(position,sp,sp,tmp));
  7491. ELSE
  7492. dim := 0;
  7493. IntermediateCode.InitOperand(reg);
  7494. IF p1 # NIL THEN
  7495. FOR i := firstPar TO x.parameters.Length()-1 DO
  7496. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7497. parameter := x.parameters.GetExpression(i);
  7498. Evaluate(parameter,r);
  7499. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7500. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7501. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7502. END;
  7503. Emit(Push(position,r.op));
  7504. IF i=1 THEN
  7505. CopyInt(reg,r.op);
  7506. ELSE
  7507. MulInt(reg, reg, r.op);
  7508. END;
  7509. ReleaseOperand(r);
  7510. INC(dim);
  7511. END;
  7512. Convert(reg,addressType);
  7513. ELSE
  7514. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7515. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7516. END;
  7517. openDim := dim;
  7518. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7519. IF backend.cooperative THEN
  7520. size := ToMemoryUnits(system,system.SizeOf(type));
  7521. WHILE type IS SyntaxTree.ArrayType DO
  7522. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7523. END;
  7524. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7525. IF (size # 1) THEN
  7526. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7527. END;
  7528. Emit(Push(position,reg));
  7529. size := ToMemoryUnits(system,system.SizeOf(type));
  7530. IF (size # 1) THEN
  7531. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7532. END;
  7533. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7534. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7535. Emit(Push(position,reg));
  7536. ReleaseIntermediateOperand(reg);
  7537. CallThis(position,"Runtime","New", 1);
  7538. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7539. Emit(Result(position, pointer));
  7540. exit := NewLabel();
  7541. else := NewLabel();
  7542. BreqL(else,pointer,nil);
  7543. IF ~type.hasPointers THEN
  7544. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7545. ELSIF type IS SyntaxTree.RecordType THEN
  7546. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7547. ELSIF type IS SyntaxTree.ProcedureType THEN
  7548. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7549. ELSE
  7550. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7551. END;
  7552. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7553. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7554. 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))));
  7555. IF type IS SyntaxTree.RecordType THEN
  7556. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7557. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7558. ELSE
  7559. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7560. END;
  7561. i := openDim;
  7562. WHILE i > 0 DO
  7563. DEC (i);
  7564. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7565. END;
  7566. needsTrace := p0.NeedsTrace();
  7567. IF needsTrace THEN ModifyAssignments(true) END;
  7568. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7569. Emit(Push(position, pointer));
  7570. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7571. Emit(Pop(position, pointer));
  7572. END;
  7573. Designate(p0,l);
  7574. IF needsTrace THEN
  7575. CallAssignPointer(l.op, pointer);
  7576. ModifyAssignments(false);
  7577. ELSE
  7578. ToMemory(l.op,addressType,0);
  7579. Emit(Mov(position,l.op,pointer));
  7580. END;
  7581. ReleaseIntermediateOperand(pointer);
  7582. ReleaseOperand(l);
  7583. BrL(exit);
  7584. SetLabel(else);
  7585. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7586. Designate(p0,l);
  7587. IF needsTrace THEN
  7588. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7589. ELSE
  7590. ToMemory(l.op,addressType,0);
  7591. Emit(Mov(position,l.op,pointer));
  7592. END;
  7593. ReleaseOperand(l);
  7594. SetLabel(exit);
  7595. ELSE
  7596. (*! the following code is only correct for "standard" Oberon calling convention *)
  7597. IF SemanticChecker.ContainsPointer(type) THEN
  7598. IF type IS SyntaxTree.ArrayType THEN
  7599. staticLength := 1;
  7600. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7601. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7602. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7603. END;
  7604. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7605. MulInt(reg,reg,tmp);
  7606. END;
  7607. Designate(p0,l);
  7608. IF openDim > 0 THEN
  7609. Emit(Push(position,l.op)); (* address for use after syscall *)
  7610. END;
  7611. Emit(Push(position,l.op)); (* address *)
  7612. ReleaseOperand(l);
  7613. tmp := TypeDescriptorAdr(type);
  7614. IF ~newObjectFile THEN
  7615. IntermediateCode.MakeMemory(tmp,addressType);
  7616. END;
  7617. Emit(Push(position,tmp)); (* type descriptor *)
  7618. ReleaseIntermediateOperand(tmp);
  7619. Emit(Push(position,reg)); (* number Elements *)
  7620. ReleaseIntermediateOperand(reg);
  7621. tmp := IntermediateCode.Immediate(addressType,dim);
  7622. Emit(Push(position,tmp)); (* dimensions *)
  7623. (* push realtime flag *)
  7624. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7625. ELSE Emit(Push(position,false));
  7626. END;
  7627. CallThis(position,"Heaps","NewArr",5)
  7628. ELSE
  7629. size := ToMemoryUnits(system,system.SizeOf(type));
  7630. IF (size # 1) THEN
  7631. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7632. (*
  7633. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7634. *)
  7635. END;
  7636. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7637. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7638. AddInt(reg, reg, tmp);
  7639. (*
  7640. Emit(Add(position,reg,reg,tmp));
  7641. *)
  7642. Designate(p0,l);
  7643. IF openDim >0 THEN
  7644. Emit(Push(position,l.op)); (* address for use after syscall *)
  7645. END;
  7646. Emit(Push(position,l.op)); (* address for syscall *)
  7647. ReleaseOperand(l); (* pointer address *)
  7648. Emit(Push(position,reg)); (* size *)
  7649. ReleaseIntermediateOperand(reg);
  7650. (* push realtime flag *)
  7651. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7652. ELSE Emit(Push(position,false));
  7653. END;
  7654. CallThis(position,"Heaps","NewSys", 3)
  7655. END;
  7656. IF openDim > 0 THEN
  7657. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7658. Emit(Pop(position,adr));
  7659. ToMemory(adr,addressType,0);
  7660. ReuseCopy(tmp,adr);
  7661. ReleaseIntermediateOperand(adr);
  7662. adr := tmp;
  7663. else := NewLabel();
  7664. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7665. i := openDim-1;
  7666. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7667. WHILE (i >= 0) DO
  7668. Emit(Pop(position,reg));
  7669. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7670. Emit(Mov(position,res,reg));
  7671. DEC(i);
  7672. END;
  7673. ReleaseIntermediateOperand(adr);
  7674. ReleaseIntermediateOperand(reg);
  7675. exit := NewLabel();
  7676. BrL(exit);
  7677. SetLabel(else);
  7678. (* else part: array could not be allocated *)
  7679. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7680. Emit(Add(position,sp,sp,tmp));
  7681. SetLabel(exit);
  7682. END;
  7683. END;
  7684. END;
  7685. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7686. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7687. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7688. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7689. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7690. left.SetType(procedure.type);
  7691. formalParameter := procedureType.firstParameter;
  7692. (* push array to allocate *)
  7693. PushParameter(p0, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7694. formalParameter :=formalParameter.nextParameter;
  7695. (* push length array *)
  7696. PushParameter(p1, formalParameter, procedureType.callingConvention, FALSE, dummy,-1);
  7697. (* push size *)
  7698. type := t0;
  7699. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7700. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7701. END;
  7702. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7703. Emit(Push(position,tmp));
  7704. (* *)
  7705. IF SemanticChecker.ContainsPointer(type) THEN
  7706. tmp := TypeDescriptorAdr(type);
  7707. IF ~newObjectFile THEN
  7708. IntermediateCode.MakeMemory(tmp,addressType);
  7709. END;
  7710. ELSE
  7711. tmp := IntermediateCode.Immediate(addressType, 0);
  7712. END;
  7713. Emit(Push(position,tmp)); (* type descriptor *)
  7714. StaticCallOperand(result,procedure);
  7715. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7716. ReleaseOperand(result);
  7717. END;
  7718. (*
  7719. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7720. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7721. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7722. *)
  7723. ELSE
  7724. (*
  7725. push len0
  7726. push len1
  7727. push len2
  7728. push size
  7729. push len_adr
  7730. push element_size
  7731. push tag
  7732. push adr
  7733. *)
  7734. dim := 0;
  7735. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7736. isTensor := TRUE;
  7737. ELSE
  7738. isTensor := FALSE;
  7739. END;
  7740. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7741. IF ~isTensor THEN
  7742. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7743. END;
  7744. parameter := x.parameters.GetExpression(i);
  7745. Evaluate(parameter,r);
  7746. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7747. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7748. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7749. END;
  7750. Emit(Push(position,r.op));
  7751. ReleaseOperand(r);
  7752. INC(dim);
  7753. END;
  7754. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7755. Emit(Mov(position, adr, sp));
  7756. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7757. Emit(Push(position, adr));
  7758. ReleaseIntermediateOperand(adr);
  7759. openDim := dim;
  7760. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7761. IF isTensor THEN
  7762. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7763. ELSE
  7764. baseType := SemanticChecker.ArrayBase(type,openDim);
  7765. END;
  7766. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7767. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7768. IF SemanticChecker.ContainsPointer(baseType) THEN
  7769. tmp := TypeDescriptorAdr(baseType);
  7770. IF ~newObjectFile THEN
  7771. IntermediateCode.MakeMemory(tmp,addressType);
  7772. END;
  7773. ELSE
  7774. tmp := nil;
  7775. END;
  7776. Emit(Push(position,tmp)); (* type descriptor *)
  7777. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7778. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7779. ELSE (* error message has already been emited *)
  7780. RETURN;
  7781. END;
  7782. Designate(p0,l);
  7783. IF isTensor THEN
  7784. Emit(Push(position,l.op)); (* address *)
  7785. ELSE
  7786. Emit(Push(position,l.tag)); (* address *)
  7787. END;
  7788. ReleaseOperand(l);
  7789. StaticCallOperand(result,procedure);
  7790. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  7791. ReleaseOperand(result);
  7792. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7793. Emit(Add(position,sp,sp,tmp));
  7794. END;
  7795. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7796. THEN
  7797. IF ~backend.cellsAreObjects THEN RETURN END;
  7798. IF InCellScope(currentScope) THEN
  7799. PushSelfPointer()
  7800. ELSE
  7801. Emit(Push(position, nil));
  7802. END;
  7803. (* push temp address *)
  7804. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7805. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7806. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7807. (* l.op contains address of pointer to record *)
  7808. Emit(Push(position,l.op)); (* address for use after syscall *)
  7809. ReleaseOperand(l);
  7810. (* push type descriptor *)
  7811. reg := TypeDescriptorAdr(baseType);
  7812. IF ~newObjectFile THEN
  7813. IntermediateCode.MakeMemory(reg,addressType);
  7814. END;
  7815. Emit(Push(position,reg));
  7816. ReleaseIntermediateOperand(reg);
  7817. (* push name *)
  7818. (*Global.GetSymbolName(p0, n);*)
  7819. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7820. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7821. ELSE
  7822. Global.GetModuleName(module.module, n);
  7823. END;
  7824. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7825. (*type.typeDeclaration.GetName(n);*)
  7826. PushConstString(n);
  7827. (* push cellnet boolean *)
  7828. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7829. (* push engine boolean *)
  7830. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7831. (* allocate *)
  7832. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7833. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7834. (* l.op contains address of pointer to record *)
  7835. ToMemory(l.op,addressType,0);
  7836. (* l.op contains value of pointer to record *)
  7837. InitFields(baseType, l.op,0);
  7838. (* add capabilities *)
  7839. modifier := p0(SyntaxTree.Designator).modifiers;
  7840. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7841. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7842. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7843. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7844. END;
  7845. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7846. (*
  7847. modifier := baseType(SyntaxTree.CellType).modifiers;
  7848. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7849. modifier := p0(SyntaxTree.Designator).modifiers;
  7850. *)
  7851. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7852. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7853. (* l.op contains address of pointer to record *)
  7854. ToMemory(l.op,addressType,0);
  7855. (* l.op contains value of pointer to record *)
  7856. Emit(Push(position,l.op)); (* address for use after syscall *)
  7857. ReleaseOperand(l);
  7858. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7859. prevScope := currentScope;
  7860. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7861. previous := section;
  7862. section := init;
  7863. (* add ports *)
  7864. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7865. CloseInitializer(previous);
  7866. currentScope := prevScope;
  7867. Symbol(temporaryVariable,l);
  7868. ToMemory(l.op,addressType,0);
  7869. Emit(Push(position,l.op));
  7870. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7871. (*
  7872. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7873. IF constructor # NIL THEN
  7874. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7875. FOR i := 1 TO x.parameters.Length()-1 DO
  7876. p := x.parameters.GetExpression(i);
  7877. Global.GetSymbolName(parameter,name);
  7878. Evaluate(p, value);
  7879. ASSERT(value.type # NIL);
  7880. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7881. par := instance.AddParameter(name);
  7882. par.SetInteger(value.integer);
  7883. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7884. par := instance.AddParameter(name);
  7885. par.SetBoolean(value.boolean);
  7886. ELSE Error(x.position,NotYetImplemented)
  7887. END;
  7888. parameter := parameter.nextParameter
  7889. END;
  7890. END;
  7891. *)
  7892. (* call initializer *)
  7893. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7894. IF constructor # NIL THEN
  7895. (*! should be unified with ProcedureCallDesignator *)
  7896. IF backend.cellsAreObjects THEN
  7897. Symbol(temporaryVariable,l);
  7898. ToMemory(l.op,addressType,0);
  7899. Emit(Push(position,l.op));
  7900. ReleaseOperand(l);
  7901. END;
  7902. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7903. FOR i := firstPar TO x.parameters.Length()-1 DO
  7904. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7905. formalParameter := formalParameter.nextParameter;
  7906. END;
  7907. (* static call of the constructor *)
  7908. Global.GetSymbolSegmentedName(constructor,name);
  7909. ASSERT(~constructor.isInline);
  7910. IF constructor.scope.ownerModule # module.module THEN
  7911. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7912. ELSE
  7913. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  7914. END;
  7915. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcedureParametersSize(system,constructor)));
  7916. (*ELSE
  7917. ReleaseIntermediateOperand(pointer);*)
  7918. END;
  7919. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7920. ToMemory(l.op, addressType, 0);
  7921. Designate(p0,s0);
  7922. ToMemory(s0.op,addressType,0);
  7923. Emit(Mov(position,s0.op,l.op));
  7924. ReleaseOperand(l);
  7925. ReleaseOperand(s0);
  7926. result.tag := emptyOperand;
  7927. (* start *)
  7928. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  7929. (* push cell *)
  7930. Symbol(temporaryVariable, l);
  7931. ToMemory(l.op,addressType,0);
  7932. Emit(Push(Basic.invalidPosition,l.op));
  7933. (* push delegate *)
  7934. Emit(Push(Basic.invalidPosition,l.op));
  7935. ReleaseOperand(l);
  7936. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  7937. Emit(Push(position, s1.op));
  7938. ReleaseOperand(s1);
  7939. CallThis(position,"ActiveCellsRuntime","Start",3);
  7940. END;
  7941. (*IF temporaryVariable # NIL THEN
  7942. end := NewLabel();
  7943. BrL(end);
  7944. SetLabel(exit);
  7945. Designate(p0,l);
  7946. ToMemory(l.op,addressType,0);
  7947. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7948. ReleaseOperand(l);
  7949. SetLabel(end);
  7950. ELSE
  7951. SetLabel(exit);
  7952. END;
  7953. *)
  7954. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  7955. ELSE (* no pointer to record, no pointer to array *)
  7956. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  7957. (* ignore new statement *)
  7958. Warning(p0.position, "cannot run on final hardware");
  7959. ELSE
  7960. HALT(200);
  7961. END;
  7962. END;
  7963. (* ---- ADDRESSOF----- *)
  7964. |Global.systemAdr:
  7965. Designate(p0,s0);
  7966. s0.mode := ModeValue;
  7967. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  7968. ReleaseIntermediateOperand(s0.op);
  7969. s0.op := s0.tag;
  7970. IntermediateCode.InitOperand(s0.tag);
  7971. END;
  7972. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  7973. result := s0;
  7974. (* ---- BIT ----- *)
  7975. |Global.systemBit:
  7976. Evaluate(p0,s0);
  7977. ToMemory(s0.op,addressType,0);
  7978. ReuseCopy(res,s0.op);
  7979. ReleaseOperand(s0);
  7980. Evaluate(p1,s1);
  7981. Emit(Ror(position,res,res,s1.op));
  7982. ReleaseOperand(s1);
  7983. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7984. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  7985. IF ~conditional THEN
  7986. InitOperand(result,ModeValue); result.op := res;
  7987. ELSE
  7988. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  7989. BrL(falseLabel);
  7990. ReleaseIntermediateOperand(res);
  7991. END;
  7992. (* --- MSK ----*)
  7993. |Global.systemMsk:
  7994. Evaluate(p0,s0);
  7995. Evaluate(p1,s1);
  7996. ReuseCopy(res,s0.op);
  7997. ReleaseOperand(s0);
  7998. Emit(And(position,res,res,s1.op));
  7999. ReleaseOperand(s1);
  8000. InitOperand(result,ModeValue);
  8001. result.op := res;
  8002. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8003. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8004. Evaluate(p0,s0);
  8005. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8006. ReleaseOperand(s0);
  8007. InitOperand(result,ModeValue);
  8008. result.op := res;
  8009. (* ---- SYSTEM.GetStackPointer ----- *)
  8010. |Global.systemGetStackPointer:
  8011. InitOperand(result,ModeValue);
  8012. result.op := sp;
  8013. (* ---- SYSTEM.GetFramePointer ----- *)
  8014. |Global.systemGetFramePointer:
  8015. InitOperand(result,ModeValue);
  8016. result.op := fp;
  8017. (* ---- SYSTEM.GetActivity ----- *)
  8018. |Global.systemGetActivity:
  8019. ASSERT(backend.cooperative);
  8020. InitOperand(result,ModeValue);
  8021. result.op := ap;
  8022. (* ---- SYSTEM.SetStackPointer ----- *)
  8023. |Global.systemSetStackPointer:
  8024. Evaluate(p0,s0); (* *)
  8025. Emit(Mov(position,sp,s0.op));
  8026. ReleaseOperand(s0);
  8027. (* ---- SYSTEM.SetFramePointer ----- *)
  8028. |Global.systemSetFramePointer:
  8029. Evaluate(p0,s0); (* *)
  8030. Emit(Mov(position,fp,s0.op));
  8031. ReleaseOperand(s0);
  8032. (* ---- SYSTEM.Activity ----- *)
  8033. |Global.systemSetActivity:
  8034. ASSERT(backend.cooperative);
  8035. Evaluate(p0,s0); (* *)
  8036. Emit(Mov(position,ap,s0.op));
  8037. ReleaseOperand(s0);
  8038. (* ---- SYSTEM.VAL ----- *)
  8039. |Global.systemVal:
  8040. Expression(p1);
  8041. s1 := result;
  8042. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8043. IF s1.mode = ModeReference THEN
  8044. (* nothing to be done if not record type, just take over new type *)
  8045. IF (type IS SyntaxTree.RecordType) THEN
  8046. ReleaseIntermediateOperand(s1.tag);
  8047. s1.tag := TypeDescriptorAdr(type);
  8048. IF ~newObjectFile THEN
  8049. IntermediateCode.MakeMemory(s1.tag,addressType);
  8050. END;
  8051. UseIntermediateOperand(s1.tag);
  8052. END;
  8053. result := s1;
  8054. ELSE (* copy over result to different type, may not use convert *)
  8055. itype := IntermediateCode.GetType(system,type);
  8056. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8057. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8058. Emit(Mov(position,s0.op,s1.op));
  8059. ReleaseOperand(s1);
  8060. InitOperand(result,ModeValue);
  8061. result.op := s0.op;
  8062. ELSE (* different size, must convert *)
  8063. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8064. Convert(s1.op, IntermediateCode.GetType(system,type));
  8065. result := s1;
  8066. END;
  8067. END;
  8068. (* ---- SYSTEM.GET ----- *)
  8069. |Global.systemGet:
  8070. Evaluate(p0,s0); (* adr *)
  8071. Designate(p1,s1); (* variable *)
  8072. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8073. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8074. Emit(Mov(position,s1.op,s0.op));
  8075. ReleaseOperand(s1);
  8076. ReleaseOperand(s0);
  8077. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8078. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8079. Evaluate(p0,s0); (* *)
  8080. Evaluate(p1,s1); (* variable *)
  8081. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8082. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8083. (* real part *)
  8084. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8085. Emit(Mov(position,res, s1.op));
  8086. ReleaseIntermediateOperand(res);
  8087. (* imaginary part *)
  8088. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8089. Emit(Mov(position,res, s1.tag));
  8090. ReleaseIntermediateOperand(res);
  8091. ReleaseOperand(s1);
  8092. ReleaseOperand(s0);
  8093. ELSE
  8094. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8095. ReleaseOperand(s0);
  8096. Emit(Mov(position,res,s1.op));
  8097. ReleaseIntermediateOperand(res);
  8098. ReleaseOperand(s1);
  8099. END;
  8100. (* ---- SYSTEM.MOVE ----- *)
  8101. |Global.systemMove:
  8102. Evaluate(p0,s0);
  8103. Evaluate(p1,s1);
  8104. Evaluate(p2,s2);
  8105. Emit(Copy(position,s1.op,s0.op,s2.op));
  8106. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8107. (* ---- SYSTEM.NEW ----- *)
  8108. |Global.systemNew:
  8109. Designate(p0,s0);
  8110. Emit(Push(position,s0.op));
  8111. ReleaseOperand(s0);
  8112. Evaluate(p1,s1);
  8113. Emit(Push(position,s1.op));
  8114. ReleaseOperand(s1);
  8115. (* push realtime flag: false by default *)
  8116. Emit(Push(position,false));
  8117. CallThis(position,"Heaps","NewSys",3);
  8118. (* ---- SYSTEM.CALL ----- *)
  8119. |Global.systemRef:
  8120. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8121. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8122. s0.mode := ModeValue;
  8123. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8124. result := s0
  8125. (* ---- INCR ----- *)
  8126. |Global.Incr:
  8127. Designate(p0,operand);
  8128. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8129. Dereference(operand,p0.type.resolved,FALSE);
  8130. END;
  8131. ASSERT(p1 # NIL);
  8132. Evaluate(p1,l);
  8133. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8134. ReleaseOperand(operand); ReleaseOperand(l);
  8135. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8136. (* ---- SUM ----- *)
  8137. |Global.Sum: HALT(200);
  8138. (* ---- ALL ----- *)
  8139. |Global.All: HALT(200);
  8140. (* ---- CAS ----- *)
  8141. |Global.Cas:
  8142. needsTrace := p0.NeedsTrace();
  8143. IF needsTrace THEN ModifyAssignments(true) END;
  8144. Designate(p0,s0);
  8145. Evaluate(p1,s1);
  8146. Evaluate(p2,s2);
  8147. IF needsTrace THEN
  8148. Emit(Push(position, s0.op));
  8149. Emit(Push(position, s1.op));
  8150. Emit(Push(position, s2.op));
  8151. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8152. ELSE
  8153. Emit(Cas(position,s0.op,s1.op,s2.op));
  8154. END;
  8155. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8156. IF needsTrace THEN ModifyAssignments(false) END;
  8157. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8158. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8159. IF conditional THEN
  8160. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8161. BrL(falseLabel);
  8162. ReleaseIntermediateOperand(res);
  8163. END;
  8164. (* ---- DIM ----- *)
  8165. |Global.Dim:
  8166. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8167. Designate(p0,s0);
  8168. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8169. Dereference(s0,p0.type.resolved,FALSE);
  8170. END;
  8171. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8172. ReleaseOperand(s0);
  8173. (* ---- RESHAPE ----- *)
  8174. |Global.Reshape:
  8175. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8176. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8177. left.SetType(procedure.type);
  8178. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8179. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8180. END;
  8181. (* ---- SYSTEM.TYPECODE ----- *)
  8182. |Global.systemTypeCode:
  8183. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8184. IF type.resolved IS SyntaxTree.PointerType THEN
  8185. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8186. END;
  8187. result.op := TypeDescriptorAdr(type);
  8188. IF ~newObjectFile THEN
  8189. ToMemory(result.op,IntermediateCode.GetType(system,x.type),0);
  8190. ELSE Convert(result.op, IntermediateCode.GetType(system,x.type));
  8191. END;
  8192. result.mode := ModeValue;
  8193. (* ---- SYSTEM.TRACE ----- *)
  8194. |Global.systemTrace:
  8195. SystemTrace(x.parameters, x.position);
  8196. (* ----- CONNECT ------*)
  8197. |Global.Connect:
  8198. IF backend.cellsAreObjects THEN
  8199. PushPort(p0);
  8200. PushPort(p1);
  8201. IF p2 # NIL THEN
  8202. Evaluate(p2, s2);
  8203. Emit(Push(p2.position, s2.op));
  8204. ReleaseOperand(s2);
  8205. ELSE
  8206. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8207. END;
  8208. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8209. ELSE
  8210. Warning(x.position, "cannot run on final hardware");
  8211. END;
  8212. (* ----- DELEGATE ------*)
  8213. |Global.Delegate:
  8214. IF backend.cellsAreObjects THEN
  8215. PushPort(p0);
  8216. PushPort(p1);
  8217. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8218. ELSE
  8219. Warning(x.position, "cannot run on final hardware");
  8220. END;
  8221. (* ----- SEND ------*)
  8222. |Global.Send:
  8223. Evaluate(p0,s0);
  8224. Evaluate(p1,s1);
  8225. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8226. Emit(Push(position,s0.op));
  8227. Emit(Push(position,s1.op));
  8228. (*
  8229. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8230. *)
  8231. IF ~backend.cellsAreObjects THEN
  8232. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8233. END;
  8234. ReleaseOperand(s0);
  8235. ReleaseOperand(s1);
  8236. IF backend.cellsAreObjects THEN
  8237. CallThis(position,"ActiveCellsRuntime","Send",2);
  8238. ELSE
  8239. CallThis(position,ChannelModuleName,"Send",2);
  8240. END;
  8241. (* ----- RECEIVE ------*)
  8242. |Global.Receive:
  8243. Evaluate(p0,s0);
  8244. Emit(Push(position,s0.op));
  8245. Designate(p1,s1);
  8246. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8247. Emit(Push(position,s1.op));
  8248. IF p2 # NIL THEN
  8249. Designate(p2,s2);
  8250. Emit(Push(position,s2.op));
  8251. END;
  8252. (*
  8253. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8254. *)
  8255. IF ~backend.cellsAreObjects THEN
  8256. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8257. END;
  8258. ReleaseOperand(s0);
  8259. ReleaseOperand(s1);
  8260. ReleaseOperand(s2);
  8261. IF backend.cellsAreObjects THEN
  8262. IF p2 = NIL THEN
  8263. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8264. ELSE
  8265. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8266. END;
  8267. ELSE
  8268. IF p2 = NIL THEN
  8269. CallThis(position,ChannelModuleName,"Receive",2)
  8270. ELSE
  8271. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8272. END;
  8273. END;
  8274. | Global.systemSpecial:
  8275. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8276. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8277. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8278. (* determine if parameters are of the VAR kind *)
  8279. ASSERT(x.parameters.Length() <= 3);
  8280. formalParameter := procedureType.firstParameter;
  8281. FOR i := 0 TO x.parameters.Length() - 1 DO
  8282. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8283. formalParameter := formalParameter.nextParameter
  8284. END;
  8285. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8286. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8287. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8288. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8289. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8290. IF procedureType.returnType # NIL THEN
  8291. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8292. Emit(Result(position, res));
  8293. (*InitOperand(result,ModeValue);
  8294. result.op := res;
  8295. *)
  8296. IF ~conditional THEN
  8297. InitOperand(result,ModeValue); result.op := res;
  8298. ELSE
  8299. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8300. BrL(falseLabel);
  8301. ReleaseIntermediateOperand(res);
  8302. END;
  8303. END
  8304. ELSE (* function not yet implemented *)
  8305. Error(position,"not yet implemented");
  8306. END;
  8307. destination := dest;
  8308. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8309. END VisitBuiltinCallDesignator;
  8310. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8311. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8312. BEGIN
  8313. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8314. dest := destination; destination := emptyOperand;
  8315. Expression(x.left);
  8316. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8317. ELSIF isUnchecked THEN (* no check *)
  8318. ELSE
  8319. trueL := NewLabel();
  8320. falseL := NewLabel();
  8321. IF IsPointerToRecord(x.left.type,recordType) THEN
  8322. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8323. Emit(Mov(position,tag, result.op));
  8324. IF result.mode # ModeValue THEN
  8325. ptr := tag;
  8326. IntermediateCode.MakeMemory(ptr,addressType);
  8327. Emit(Mov(position,tag, ptr));
  8328. END;
  8329. IF ~backend.cooperative THEN
  8330. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8331. END;
  8332. IntermediateCode.MakeMemory(tag,addressType);
  8333. ELSE
  8334. tag := result.tag;
  8335. UseIntermediateOperand(tag);
  8336. END;
  8337. TypeTest(tag,x.type,trueL,falseL);
  8338. ReleaseIntermediateOperand(tag);
  8339. SetLabel(falseL);
  8340. EmitTrap(position,TypeCheckTrap);
  8341. SetLabel(trueL);
  8342. END;
  8343. destination := dest;
  8344. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8345. END VisitTypeGuardDesignator;
  8346. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8347. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8348. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8349. VAR label: Label; pc: LONGINT;
  8350. BEGIN
  8351. IF backend.cooperative & ~isUnchecked THEN
  8352. pc := section.pc;
  8353. label := NewLabel();
  8354. BrneL(label, operand.op, nil);
  8355. EmitTrap(position, NilPointerTrap);
  8356. SetLabel(label);
  8357. INC(statCoopNilCheck, section.pc - pc);
  8358. END;
  8359. END NilCheck;
  8360. BEGIN
  8361. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8362. ReuseCopy(dereferenced,operand.op);
  8363. ReleaseOperand(operand);
  8364. operand.mode := ModeReference;
  8365. operand.op := dereferenced;
  8366. operand.tag := dereferenced;
  8367. UseIntermediateOperand(operand.tag);
  8368. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8369. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8370. ReleaseIntermediateOperand(operand.tag);
  8371. operand.tag := TypeDescriptorAdr(type);
  8372. IF ~newObjectFile THEN
  8373. IntermediateCode.MakeMemory(operand.tag,addressType);
  8374. END;
  8375. ELSE
  8376. IF ~backend.cooperative THEN
  8377. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8378. END;
  8379. IntermediateCode.MakeMemory(operand.tag,addressType);
  8380. END;
  8381. NilCheck(operand.op);
  8382. ELSIF type IS SyntaxTree.ArrayType THEN
  8383. IF isUnsafe THEN
  8384. NilCheck(operand.op);
  8385. ReleaseIntermediateOperand(operand.tag);
  8386. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8387. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8388. ELSE
  8389. operand.tag := emptyOperand;
  8390. END;
  8391. ELSE
  8392. NilCheck(operand.op);
  8393. IF backend.cooperative THEN
  8394. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8395. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8396. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8397. ELSE
  8398. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8399. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8400. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8401. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8402. END;
  8403. END;
  8404. ELSIF type IS SyntaxTree.MathArrayType THEN
  8405. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8406. IntermediateCode.MakeMemory(operand.op,addressType);
  8407. ELSE HALT(100);
  8408. END;
  8409. END Dereference;
  8410. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8411. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8412. BEGIN
  8413. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8414. dest := destination; destination := emptyOperand;
  8415. Evaluate(x.left,d);
  8416. type := x.type.resolved;
  8417. prevIsUnchecked := isUnchecked;
  8418. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8419. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8420. END;
  8421. Dereference(d,type,IsUnsafePointer(x.left.type));
  8422. isUnchecked := prevIsUnchecked;
  8423. result := d;
  8424. 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
  8425. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8426. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8427. END;
  8428. END;
  8429. destination := dest;
  8430. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8431. END VisitDereferenceDesignator;
  8432. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8433. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8434. BEGIN
  8435. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8436. dest := destination; destination := emptyOperand;
  8437. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8438. tag := result.op;
  8439. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8440. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8441. StaticCallOperand(result,procedure.super);
  8442. ReleaseIntermediateOperand(result.tag);
  8443. UseIntermediateOperand(tag); (* necessary ? *)
  8444. result.tag := tag;
  8445. destination := dest;
  8446. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8447. END VisitSupercallDesignator;
  8448. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8449. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8450. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8451. name: Basic.SegmentedName;
  8452. procedure: SyntaxTree.Procedure;
  8453. procedureType: SyntaxTree.ProcedureType;
  8454. BEGIN
  8455. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8456. dest := destination; destination := emptyOperand;
  8457. scope := currentScope;
  8458. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8459. scope := scope.outerScope;
  8460. END;
  8461. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8462. IF newObjectFile THEN
  8463. moduleSection := meta.ModuleSection();
  8464. IF backend.cooperative THEN
  8465. moduleOffset := 0;
  8466. ELSE
  8467. moduleOffset := moduleSection.pc;
  8468. END;
  8469. result.mode := ModeValue;
  8470. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8471. ELSE
  8472. Symbol(moduleSelf,result);
  8473. IntermediateCode.MakeMemory(result.op,addressType);
  8474. END
  8475. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8476. result.mode := ModeValue;
  8477. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8478. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8479. ELSE
  8480. GetBaseRegister(basereg,currentScope,scope);
  8481. InitOperand(result,ModeReference);
  8482. result.op := basereg;
  8483. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8484. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8485. parametersSize := ProcedureParametersSize(system,procedure);
  8486. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8487. IF backend.cooperative THEN
  8488. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8489. END;
  8490. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8491. MakeMemory(result.op, result.op, addressType, 0);
  8492. END;
  8493. (* tag must be loaded when dereferencing SELF pointer *)
  8494. END;
  8495. destination := dest;
  8496. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8497. END VisitSelfDesignator;
  8498. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8499. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8500. BEGIN
  8501. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8502. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8503. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8504. parameter := procedureType.returnParameter;
  8505. IF currentIsInline THEN
  8506. map := currentMapper.Get(NIL);
  8507. IF map # NIL THEN
  8508. Designate(map.to, result);
  8509. ELSE
  8510. HALT(200);
  8511. END;
  8512. RETURN;
  8513. END;
  8514. VisitParameter(parameter);
  8515. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8516. END VisitResultDesignator;
  8517. (** values *)
  8518. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8519. BEGIN
  8520. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8521. IF conditional THEN
  8522. IF x.value THEN BrL(trueLabel)
  8523. ELSE BrL(falseLabel)
  8524. END;
  8525. ELSE
  8526. InitOperand(result,ModeValue);
  8527. IF x.value THEN result.op := true ELSE result.op := false END;
  8528. END;
  8529. END VisitBooleanValue;
  8530. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8531. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8532. BEGIN
  8533. Global.GetModuleSegmentedName(module.module, name);
  8534. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8535. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8536. RETURN section
  8537. END GetDataSection;
  8538. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8539. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8540. BEGIN
  8541. type := vop.type;
  8542. data := GetDataSection();
  8543. pc := EnterImmediate(data,vop);
  8544. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8545. IntermediateCode.MakeMemory(vop, type);
  8546. END GetImmediateMem;
  8547. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8548. BEGIN
  8549. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8550. InitOperand(result,ModeValue);
  8551. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.hvalue);
  8552. IF ~supportedImmediate(result.op) &~inData THEN
  8553. GetImmediateMem(result.op)
  8554. END;
  8555. END VisitIntegerValue;
  8556. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8557. BEGIN
  8558. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8559. InitOperand(result,ModeValue);
  8560. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8561. END VisitCharacterValue;
  8562. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8563. BEGIN
  8564. IF Trace THEN TraceEnter("VisitSetValue") END;
  8565. InitOperand(result,ModeValue);
  8566. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(LONGINT,x.value));
  8567. END VisitSetValue;
  8568. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8569. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8570. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8571. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8572. BEGIN
  8573. numberElements := x.elements.Length();
  8574. FOR i := 0 TO numberElements-1 DO
  8575. expression := x.elements.GetExpression(i);
  8576. IF expression IS SyntaxTree.MathArrayExpression THEN
  8577. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8578. ELSE
  8579. inData := TRUE;
  8580. Evaluate(expression,op);
  8581. irv.Emit(Data(position,op.op));
  8582. inData := FALSE;
  8583. ReleaseOperand(op);
  8584. END;
  8585. END;
  8586. END RecursiveData;
  8587. BEGIN
  8588. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8589. IF ~TryConstantDeclaration() THEN
  8590. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8591. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8592. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8593. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8594. ELSE
  8595. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8596. END;
  8597. RecursiveData(x.array);
  8598. InitOperand(result,ModeReference);
  8599. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8600. END
  8601. END VisitMathArrayValue;
  8602. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8603. VAR constant: Sections.Section;
  8604. BEGIN
  8605. IF constantDeclaration = NIL THEN
  8606. RETURN FALSE
  8607. ELSE
  8608. (* Is a constant in this module: did we generate it already? *)
  8609. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8610. IF constant # NIL THEN
  8611. InitOperand(result,ModeReference);
  8612. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8613. RETURN TRUE;
  8614. END;
  8615. END;
  8616. RETURN FALSE
  8617. END TryConstantDeclaration;
  8618. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8619. BEGIN
  8620. constantDeclaration := x;
  8621. x.value.resolved.Accept(SELF);
  8622. END VisitConstant;
  8623. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8624. BEGIN
  8625. IF Trace THEN TraceEnter("VisitRealValue") END;
  8626. InitOperand(result,ModeValue);
  8627. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8628. END VisitRealValue;
  8629. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8630. VAR
  8631. componentType: SyntaxTree.Type;
  8632. BEGIN
  8633. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8634. ASSERT(x.type IS SyntaxTree.ComplexType);
  8635. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8636. InitOperand(result,ModeValue);
  8637. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8638. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8639. END VisitComplexValue;
  8640. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8641. VAR i: LONGINT; name: Basic.SegmentedName;
  8642. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8643. BEGIN
  8644. IF Trace THEN TraceEnter("VisitStringValue") END;
  8645. IF ~TryConstantDeclaration() THEN
  8646. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8647. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8648. IF ~newObjectFile OR (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8649. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8650. ELSE
  8651. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8652. END;
  8653. FOR i := 0 TO x.length-1 DO
  8654. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8655. irv.Emit(Data(position,op));
  8656. END;
  8657. InitOperand(result,ModeReference);
  8658. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8659. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8660. END
  8661. END VisitStringValue;
  8662. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8663. BEGIN
  8664. IF Trace THEN TraceEnter("VisitNilValue") END;
  8665. InitOperand(result,ModeValue);
  8666. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8667. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8668. END VisitNilValue;
  8669. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8670. BEGIN
  8671. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8672. InitOperand(result,ModeValue);
  8673. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8674. END VisitEnumerationValue;
  8675. (** symbols *)
  8676. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8677. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8678. END VisitImport;
  8679. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8680. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8681. BEGIN
  8682. IF scope # baseScope THEN
  8683. (* left := [fp+8] *)
  8684. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8685. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8686. ReuseCopy(left,right);
  8687. ReleaseIntermediateOperand(right);
  8688. scope := scope.outerScope; DEC(level);
  8689. (* { left := [left+8] } *)
  8690. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8691. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8692. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8693. Emit(Mov(position,left,right));
  8694. scope := scope.outerScope; DEC(level);
  8695. END;
  8696. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8697. result := left;
  8698. ELSE
  8699. result := fp;
  8700. END;
  8701. END GetBaseRegister;
  8702. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8703. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8704. BEGIN
  8705. IF Trace THEN TraceEnter("VisitVariable"); END;
  8706. type := x.type.resolved;
  8707. IF (x.useRegister) THEN
  8708. InitOperand(result, ModeValue);
  8709. IF x.registerNumber < 0 THEN
  8710. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8711. reg := x.registerNumber;
  8712. ELSE
  8713. reg := registerUsageCount.Map(x.registerNumber);
  8714. UseRegister(reg);
  8715. END;
  8716. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8717. ELSIF x.externalName # NIL THEN
  8718. InitOperand(result,ModeReference);
  8719. Basic.ToSegmentedName(x.externalName^, name);
  8720. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8721. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8722. InitOperand(result,ModeReference);
  8723. GetBaseRegister(result.op,currentScope,x.scope);
  8724. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8725. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8726. InitOperand(result,ModeReference);
  8727. GetCodeSectionNameForSymbol(x,name);
  8728. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8729. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8730. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8731. InitOperand(result,ModeReference);
  8732. GetCodeSectionNameForSymbol(x,name);
  8733. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8734. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8735. ELSE (* field, left designator must have been emitted *)
  8736. ASSERT(result.mode = ModeReference);
  8737. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8738. ReuseCopy(temp,result.op);
  8739. ReleaseIntermediateOperand(result.op);
  8740. result.op := temp;
  8741. END;
  8742. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8743. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8744. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8745. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8746. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8747. END;
  8748. END;
  8749. END;
  8750. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8751. ValueToCondition(result);
  8752. ELSIF type IS SyntaxTree.ProcedureType THEN
  8753. ReleaseIntermediateOperand(result.tag);
  8754. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8755. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8756. UseIntermediateOperand(result.tag);
  8757. ELSE
  8758. result.tag := nil; (* nil *)
  8759. END;
  8760. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8761. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8762. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8763. ReleaseIntermediateOperand(result.tag);
  8764. Global.GetSymbolSegmentedName(x,name);
  8765. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8766. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8767. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8768. ELSE
  8769. END;
  8770. ELSE
  8771. ReleaseIntermediateOperand(result.tag);
  8772. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8773. END;
  8774. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8775. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8776. ReleaseIntermediateOperand(result.tag);
  8777. result.tag := result.op;
  8778. UseIntermediateOperand(result.tag);
  8779. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8780. IntermediateCode.MakeMemory(result.op,addressType);
  8781. END;
  8782. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8783. ReleaseIntermediateOperand(result.tag);
  8784. result.tag := TypeDescriptorAdr(type);
  8785. IF ~newObjectFile THEN
  8786. IntermediateCode.MakeMemory(result.tag,addressType);
  8787. END;
  8788. UseIntermediateOperand(result.tag);
  8789. (* tag for pointer type computed not here but during dereferencing *)
  8790. END;
  8791. IF Trace THEN TraceExit("VisitVariable") END;
  8792. END VisitVariable;
  8793. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8794. BEGIN
  8795. VisitVariable(property);
  8796. END VisitProperty;
  8797. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8798. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8799. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8800. BEGIN
  8801. type := x.type.resolved;
  8802. IF Trace THEN TraceEnter("VisitParameter") END;
  8803. IF x.ownerType IS SyntaxTree.CellType THEN
  8804. ptype := x.type.resolved;
  8805. IF backend.cellsAreObjects THEN
  8806. ASSERT(result.mode = ModeReference);
  8807. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8808. ReuseCopy(temp,result.op);
  8809. ReleaseIntermediateOperand(result.op);
  8810. result.op := temp;
  8811. END;
  8812. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8813. RETURN;
  8814. ELSE
  8815. InitOperand(result,ModeReference);
  8816. GetCodeSectionNameForSymbol(x,name);
  8817. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8818. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8819. RETURN;
  8820. END;
  8821. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8822. InitOperand(result,ModeReference);
  8823. GetCodeSectionNameForSymbol(x,name);
  8824. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8825. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8826. RETURN
  8827. ELSE
  8828. GetBaseRegister(basereg,currentScope,x.scope);
  8829. InitOperand(result,ModeReference);
  8830. result.op := basereg;
  8831. END;
  8832. IF IsOpenArray(type) THEN
  8833. result.tag := basereg;
  8834. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8835. IntermediateCode.MakeMemory(result.op,addressType);
  8836. IF Global.IsOberonProcedure(x.ownerType) THEN
  8837. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8838. UseIntermediateOperand(result.tag);
  8839. ELSE
  8840. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8841. END;
  8842. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8843. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8844. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8845. ELSIF IsStaticArray(type) THEN
  8846. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8847. IntermediateCode.MakeMemory(result.op,addressType);
  8848. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8849. ELSIF type IS SyntaxTree.MathArrayType THEN
  8850. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8851. WITH type: SyntaxTree.MathArrayType DO
  8852. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8853. IF type.form = SyntaxTree.Tensor THEN
  8854. ELSIF type.form = SyntaxTree.Open THEN
  8855. result.tag := result.op;
  8856. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8857. IntermediateCode.MakeMemory(result.op,addressType);
  8858. UseIntermediateOperand(result.tag);
  8859. ELSIF type.form = SyntaxTree.Static THEN
  8860. IF x.kind = SyntaxTree.ConstParameter THEN
  8861. IntermediateCode.MakeMemory(result.op,addressType);
  8862. END;
  8863. ELSE HALT(100)
  8864. END;
  8865. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8866. IF type.form = SyntaxTree.Tensor THEN
  8867. ToMemory(result.op,addressType,0);
  8868. ELSIF type.form = SyntaxTree.Open THEN
  8869. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8870. ReuseCopy(result.tag, mem);
  8871. ReleaseIntermediateOperand(mem);
  8872. ReleaseIntermediateOperand(result.op);
  8873. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8874. ELSIF type.form = SyntaxTree.Static THEN
  8875. IntermediateCode.MakeMemory(result.op,addressType);
  8876. ELSE HALT(100)
  8877. END;
  8878. ELSE HALT(100)
  8879. END;
  8880. END;
  8881. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8882. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8883. IntermediateCode.MakeMemory(result.op,addressType);
  8884. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8885. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8886. END;
  8887. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8888. ValueToCondition(result);
  8889. ELSIF type IS SyntaxTree.ProcedureType THEN
  8890. ReleaseIntermediateOperand(result.tag);
  8891. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8892. IF x.kind = SyntaxTree.VarParameter THEN
  8893. ReuseCopy(result.tag,result.op);
  8894. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8895. IntermediateCode.MakeMemory(result.tag,addressType);
  8896. ELSE
  8897. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8898. UseIntermediateOperand(result.tag);
  8899. END;
  8900. ELSE
  8901. result.tag := nil;
  8902. END;
  8903. (* tag for pointer type computed not here but during dereferencing *)
  8904. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  8905. ReleaseIntermediateOperand(result.tag);
  8906. result.tag := basereg;
  8907. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8908. IntermediateCode.MakeMemory(result.tag,addressType);
  8909. UseIntermediateOperand(result.tag);
  8910. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  8911. ReleaseIntermediateOperand(result.tag);
  8912. result.tag := TypeDescriptorAdr(type);
  8913. IF ~newObjectFile THEN
  8914. IntermediateCode.MakeMemory(result.tag,addressType);
  8915. END;
  8916. UseIntermediateOperand(result.tag);
  8917. END;
  8918. IF Trace THEN TraceExit("VisitParameter") END;
  8919. END VisitParameter;
  8920. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8921. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  8922. BEGIN
  8923. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  8924. (* left.p: left already emitted *)
  8925. tag := result.op; (* value of pointer to left *)
  8926. (* get type desc *)
  8927. tmp := result.tag;
  8928. IntermediateCode.MakeMemory(tmp,addressType);
  8929. (* get method adr *)
  8930. Reuse1(reg,tmp);
  8931. ReleaseIntermediateOperand(tmp);
  8932. IF backend.cooperative THEN
  8933. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8934. WHILE recordType.baseType # NIL DO
  8935. recordType := recordType.GetBaseRecord ();
  8936. END;
  8937. GetRecordTypeName (recordType,name);
  8938. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  8939. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  8940. offset := 0;
  8941. ELSE
  8942. offset := 2;
  8943. END;
  8944. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  8945. ELSE
  8946. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  8947. END;
  8948. InitOperand(operand,ModeReference);
  8949. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  8950. operand.op := reg;
  8951. operand.tag := tag;
  8952. IF Trace THEN TraceExit("DynamicCallOperand") END;
  8953. END DynamicCallOperand;
  8954. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  8955. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  8956. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  8957. BEGIN
  8958. IF Trace THEN TraceEnter("StaticCallOperand") END;
  8959. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  8960. tag := operand.op;
  8961. ReleaseIntermediateOperand(operand.tag);
  8962. ELSE tag := nil
  8963. END;
  8964. IF x.isInline THEN
  8965. sectionType := Sections.InlineCodeSection;
  8966. ELSE
  8967. sectionType := Sections.CodeSection;
  8968. END;
  8969. IF x.externalName # NIL THEN
  8970. Basic.ToSegmentedName(x.externalName^, name);
  8971. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  8972. ELSE
  8973. GetCodeSectionNameForSymbol(x, name);
  8974. IF (x.scope.ownerModule = module.module) THEN
  8975. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8976. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  8977. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  8978. IF source.pc = 0 THEN (* no code yet *)
  8979. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  8980. END;
  8981. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  8982. bits := x.procedureScope.body.code.inlineCode;
  8983. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  8984. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  8985. binary.CopyBits(bits, 0, bits.GetSize());
  8986. source.SetResolved(binary);
  8987. ELSE
  8988. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  8989. END;
  8990. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  8991. END;
  8992. InitOperand(operand,ModeValue);
  8993. operand.op := reg;
  8994. operand.tag := tag;
  8995. IF Trace THEN TraceExit("StaticCallOperand") END;
  8996. END StaticCallOperand;
  8997. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  8998. (* handle expressions of the form designator.procedure or procedure *)
  8999. BEGIN
  9000. IF Trace THEN TraceEnter("VisitProcedure") END;
  9001. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9002. DynamicCallOperand(result,x);
  9003. ELSIF x.isInline THEN
  9004. StaticCallOperand(result,x);
  9005. ELSE
  9006. StaticCallOperand(result,x);
  9007. END;
  9008. IF Trace THEN TraceExit("VisitProcedure") END;
  9009. END VisitProcedure;
  9010. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9011. BEGIN
  9012. VisitProcedure(x);
  9013. END VisitOperator;
  9014. (** statements *)
  9015. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9016. BEGIN
  9017. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9018. Expression(x.call);
  9019. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9020. ReleaseOperand(result)
  9021. END;
  9022. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9023. END VisitProcedureCallStatement;
  9024. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9025. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9026. leftBase, rightBase: SyntaxTree.Type;
  9027. procedureName,s: SyntaxTree.IdentifierString;
  9028. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9029. size: LONGINT; rightKind: LONGINT;
  9030. dummy: IntermediateCode.Operand;
  9031. CONST moduleName = "FoxArrayBase";
  9032. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9033. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9034. BEGIN
  9035. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9036. IF base IS SyntaxTree.MathArrayType THEN
  9037. base := OpenArray(base(SyntaxTree.MathArrayType));
  9038. END;
  9039. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9040. result.SetArrayBase(base);
  9041. RETURN result
  9042. END OpenArray;
  9043. BEGIN
  9044. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9045. SaveRegisters();ReleaseUsedRegisters(saved);
  9046. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9047. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9048. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9049. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9050. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9051. IF leftType.form = SyntaxTree.Tensor THEN
  9052. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9053. ELSIF leftType.form = SyntaxTree.Open THEN
  9054. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9055. ELSIF leftType.form = SyntaxTree.Static THEN
  9056. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9057. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9058. END;
  9059. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9060. IF procedure = NIL THEN
  9061. s := "Instruction not supported on target, emulation procedure ";
  9062. Strings.Append(s,moduleName);
  9063. Strings.Append(s,".");
  9064. Strings.Append(s,procedureName);
  9065. Strings.Append(s," not present");
  9066. Error(position,s);
  9067. ELSE
  9068. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9069. parameter.SetType(leftType);
  9070. parameter.SetAccess(SyntaxTree.Internal);
  9071. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9072. parameter.SetKind(rightKind);
  9073. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9074. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9075. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9076. StaticCallOperand(result,procedure);
  9077. Emit(Call(position,result.op,ProcedureParametersSize(system,procedure)));
  9078. ReleaseOperand(result);
  9079. END;
  9080. RestoreRegisters(saved);
  9081. END;
  9082. END AssignMathArray;
  9083. VAR modifyAssignmentCounter := 0: LONGINT;
  9084. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9085. VAR processor,mem,dst: IntermediateCode.Operand;
  9086. BEGIN
  9087. IF value.intValue = true.intValue THEN
  9088. INC(modifyAssignmentCounter);
  9089. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9090. modifyAssignmentsPC := section.pc;
  9091. ELSE
  9092. DEC(modifyAssignmentCounter);
  9093. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9094. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9095. END;
  9096. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9097. dst := NewRegisterOperand (addressType);
  9098. Emit(Mov(position,dst, processor));
  9099. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9100. Emit(Mov(position,mem, value));
  9101. ReleaseIntermediateOperand(dst);
  9102. END ModifyAssignments;
  9103. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9104. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9105. BEGIN
  9106. type := left.type.resolved;
  9107. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9108. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9109. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9110. IF procedureType.returnParameter = parameter THEN
  9111. (* this is the only case where the destination can be dynamically smaller than the source
  9112. in all other cases the dynamic size has to be taken
  9113. *)
  9114. IF backend.cooperative THEN
  9115. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9116. ELSE
  9117. MakeMemory(mem, tag, addressType, 0);
  9118. END;
  9119. RETURN mem;
  9120. END;
  9121. END;
  9122. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9123. END CopySize;
  9124. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9125. VAR
  9126. leftO, rightO: Operand;
  9127. arg,mem, sizeOp: IntermediateCode.Operand;
  9128. leftType, rightType, componentType, base: SyntaxTree.Type;
  9129. size: LONGINT;
  9130. parameters: SyntaxTree.ExpressionList;
  9131. procedure: SyntaxTree.Procedure;
  9132. call: SyntaxTree.ProcedureCallDesignator;
  9133. designator: SyntaxTree.Designator;
  9134. saved: RegisterEntry;
  9135. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9136. VAR procedureType: SyntaxTree.ProcedureType;
  9137. BEGIN
  9138. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9139. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9140. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9141. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9142. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9143. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9144. IF right.id = Global.Reshape THEN RETURN TRUE
  9145. END;
  9146. END;
  9147. END;
  9148. END;
  9149. RETURN FALSE
  9150. END CanPassAsResultParameter;
  9151. BEGIN
  9152. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9153. leftType := left.type.resolved; rightType:= right.type.resolved;
  9154. IF backend.cooperative & left.NeedsTrace() THEN
  9155. ModifyAssignments(true);
  9156. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9157. Designate(right, rightO);
  9158. Designate(left, leftO);
  9159. ASSERT(leftO.mode = ModeReference);
  9160. TransferToRegister(leftO.op, leftO.op);
  9161. TransferToRegister(rightO.op, rightO.op);
  9162. Emit(Push(position, leftO.op));
  9163. Emit(Push(position, rightO.op));
  9164. CallAssignMethod(leftO.op, rightO.op, left.type);
  9165. Emit(Pop(position, rightO.op));
  9166. Emit(Pop(position, leftO.op));
  9167. sizeOp := CopySize(left, leftO.tag);
  9168. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9169. ReleaseIntermediateOperand(sizeOp);
  9170. ReleaseOperand(leftO);
  9171. ReleaseOperand(rightO);
  9172. ELSE
  9173. Evaluate(right,rightO);
  9174. Designate(left,leftO);
  9175. ASSERT(leftO.mode = ModeReference);
  9176. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9177. (* copy procedure address first *)
  9178. MakeMemory(mem,leftO.op,addressType,0);
  9179. Emit(Mov(position,mem,rightO.op));
  9180. ReleaseIntermediateOperand(mem);
  9181. (* copy pointer address *)
  9182. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9183. CallAssignPointer(leftO.tag, rightO.tag);
  9184. ELSE
  9185. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9186. CallAssignPointer(leftO.op, rightO.op);
  9187. END;
  9188. ReleaseOperand(leftO);
  9189. ReleaseOperand(rightO);
  9190. END;
  9191. ModifyAssignments(false);
  9192. RETURN;
  9193. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9194. SaveRegisters();ReleaseUsedRegisters(saved);
  9195. IF SemanticChecker.IsPointerType(leftType) THEN
  9196. Evaluate(right,rightO);
  9197. Designate(left,leftO);
  9198. Emit(Push(position,leftO.op));
  9199. ReleaseOperand(leftO);
  9200. Emit(Push(position,rightO.op));
  9201. ReleaseOperand(rightO);
  9202. CallThis(position,"Heaps","Assign",2);
  9203. ELSIF leftType.IsRecordType() THEN
  9204. Designate(right,rightO);
  9205. Designate(left,leftO);
  9206. Emit(Push(position,leftO.op));
  9207. Emit(Push(position,leftO.tag)); (* type desc *)
  9208. ReleaseOperand(leftO);
  9209. Emit(Push(position,rightO.op));
  9210. ReleaseOperand(rightO);
  9211. CallThis(position,"Heaps","AssignRecord",3);
  9212. ELSIF IsStaticArray(leftType) THEN
  9213. size := StaticArrayNumElements(leftType);
  9214. base := StaticArrayBaseType(leftType);
  9215. Designate(right,rightO);
  9216. Designate(left,leftO);
  9217. Emit(Push(position,leftO.op));
  9218. ReleaseOperand(leftO);
  9219. arg := TypeDescriptorAdr(base);
  9220. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9221. Emit(Push(position,arg));
  9222. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9223. Emit(Push(position,rightO.op));
  9224. ReleaseOperand(rightO);
  9225. CallThis(position,"Heaps","AssignArray",4);
  9226. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9227. size := StaticMathArrayNumElements(leftType);
  9228. base := StaticMathArrayBaseType(leftType);
  9229. Designate(right,rightO);
  9230. Designate(left,leftO);
  9231. Emit(Push(position,leftO.op));
  9232. ReleaseOperand(leftO);
  9233. arg := TypeDescriptorAdr(base);
  9234. IF ~newObjectFile THEN IntermediateCode.MakeMemory(arg, addressType) END;
  9235. Emit(Push(position,arg));
  9236. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9237. Emit(Push(position,rightO.op));
  9238. ReleaseOperand(rightO);
  9239. CallThis(position,"Heaps","AssignArray",4);
  9240. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9241. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9242. Evaluate(right,rightO);
  9243. Designate(left,leftO);
  9244. MakeMemory(mem,leftO.op,addressType,0);
  9245. Emit(Mov(position,mem,rightO.op));
  9246. ReleaseIntermediateOperand(mem);
  9247. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9248. Emit (Push(position, leftO.tag));
  9249. ReleaseOperand(leftO);
  9250. Emit (Push(position, rightO.tag));
  9251. ReleaseOperand(rightO);
  9252. CallThis(position,"Heaps","Assign", 2);
  9253. ELSE HALT(100); (* missing ? *)
  9254. END;
  9255. RestoreRegisters(saved);
  9256. RETURN;
  9257. END;
  9258. IF CanPassAsResultParameter(right) THEN
  9259. procedureResultDesignator := left(SyntaxTree.Designator);
  9260. Expression(right);
  9261. procedureResultDesignator := NIL;
  9262. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9263. (* left <-- ALIAS OF right: zerocopy *)
  9264. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9265. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9266. designator.SetType(procedure.type);
  9267. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9268. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9269. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9270. END;
  9271. ELSIF leftType IS SyntaxTree.RangeType THEN
  9272. (* LHS is of array range type *)
  9273. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9274. Evaluate(right, rightO);
  9275. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9276. (* first *)
  9277. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9278. Emit(Mov(position,mem, rightO.op));
  9279. ReleaseIntermediateOperand(mem);
  9280. (* last *)
  9281. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9282. Emit(Mov(position,mem, rightO.tag));
  9283. ReleaseIntermediateOperand(mem);
  9284. (* step *)
  9285. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9286. Emit(Mov(position,mem, rightO.extra));
  9287. ReleaseIntermediateOperand(mem);
  9288. ReleaseOperand(rightO);
  9289. ReleaseOperand(leftO)
  9290. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9291. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9292. Evaluate(right, rightO);
  9293. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9294. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9295. (* real part *)
  9296. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9297. Emit(Mov(position,mem, rightO.op));
  9298. ReleaseIntermediateOperand(mem);
  9299. (* imaginary part *)
  9300. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9301. Emit(Mov(position,mem, rightO.tag));
  9302. ReleaseIntermediateOperand(mem);
  9303. ReleaseOperand(rightO);
  9304. ReleaseOperand(leftO)
  9305. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9306. OR (leftType IS SyntaxTree.PortType) THEN
  9307. (* rightO := leftO;*)
  9308. Evaluate(right,rightO);
  9309. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9310. Designate(left,leftO);
  9311. IF leftO.mode = ModeReference THEN
  9312. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9313. destination := mem;
  9314. ELSE
  9315. destination := leftO.op;
  9316. END;
  9317. ReleaseOperand(leftO);
  9318. IF destination.mode # IntermediateCode.Undefined THEN
  9319. Emit(Mov(position,destination,rightO.op));
  9320. END;
  9321. ReleaseOperand(rightO);
  9322. ReleaseIntermediateOperand(mem);
  9323. IntermediateCode.InitOperand(destination);
  9324. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9325. Evaluate(right,rightO);
  9326. Designate(left,leftO);
  9327. MakeMemory(mem,leftO.op,addressType,0);
  9328. Emit(Mov(position,mem,rightO.op));
  9329. ReleaseIntermediateOperand(mem);
  9330. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9331. (* delegate *)
  9332. (*
  9333. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9334. *)
  9335. Emit(Mov(position,leftO.tag,rightO.tag));
  9336. END;
  9337. ReleaseOperand(leftO);
  9338. ReleaseOperand(rightO);
  9339. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9340. Designate(right,rightO);
  9341. Designate(left,leftO);
  9342. sizeOp := CopySize(left, leftO.tag);
  9343. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9344. ReleaseIntermediateOperand(sizeOp);
  9345. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9346. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9347. IF (rightType IS SyntaxTree.StringType) THEN
  9348. CopyString(left,right);
  9349. 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
  9350. Designate(right,rightO);
  9351. Designate(left,leftO);
  9352. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9353. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9354. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9355. ELSE
  9356. HALT(201)
  9357. END;
  9358. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9359. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9360. Designate(right,rightO);
  9361. Designate(left,leftO);
  9362. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9363. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9364. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9365. ELSE
  9366. AssignMathArray(left,right);
  9367. END;
  9368. ELSE
  9369. HALT(200);
  9370. END;
  9371. END Assign;
  9372. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9373. BEGIN
  9374. IF Trace THEN TraceEnter("VisitAssignment") END;
  9375. Assign(x.left,x.right);
  9376. IF Trace THEN TraceExit("VisitAssignment") END;
  9377. END VisitAssignment;
  9378. PROCEDURE EmitCooperativeSwitch;
  9379. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9380. BEGIN
  9381. ASSERT (cooperativeSwitches);
  9382. pc := section.pc;
  9383. IF lastSwitchPC = section.pc THEN RETURN END;
  9384. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9385. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9386. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9387. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9388. INC(statCoopSwitch, section.pc - pc);
  9389. END EmitCooperativeSwitch;
  9390. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9391. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9392. BEGIN
  9393. p0 := communication.left; p1 := communication.right;
  9394. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9395. Evaluate(p0,s0);
  9396. Evaluate(p1,s1);
  9397. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9398. Emit(Push(position,s0.op));
  9399. Emit(Push(position,s1.op));
  9400. (*
  9401. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9402. *)
  9403. IF ~backend.cellsAreObjects THEN
  9404. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9405. END;
  9406. ReleaseOperand(s0);
  9407. ReleaseOperand(s1);
  9408. IF backend.cellsAreObjects THEN
  9409. CallThis(position,"ActiveCellsRuntime","Send",2);
  9410. ELSE
  9411. CallThis(position,ChannelModuleName,"Send",2);
  9412. END;
  9413. (* ----- RECEIVE ------*)
  9414. ELSE
  9415. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9416. tmp := p0; p0 := p1; p1 := tmp;
  9417. END;
  9418. Evaluate(p0,s0);
  9419. Emit(Push(position,s0.op));
  9420. Designate(p1,s1);
  9421. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9422. Emit(Push(position,s1.op));
  9423. (*
  9424. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9425. *)
  9426. IF ~backend.cellsAreObjects THEN
  9427. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9428. END;
  9429. ReleaseOperand(s0);
  9430. ReleaseOperand(s1);
  9431. IF backend.cellsAreObjects THEN
  9432. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9433. ELSE
  9434. CallThis(position,ChannelModuleName,"Receive",2)
  9435. END;
  9436. END;
  9437. END VisitCommunicationStatement;
  9438. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9439. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9440. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9441. VAR true, false: Label; condition, value: BOOLEAN;
  9442. BEGIN
  9443. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9444. IF condition THEN
  9445. true := NewLabel();
  9446. false := NewLabel();
  9447. Condition(if.condition,true,false);
  9448. SetLabel(true);
  9449. StatementSequence(if.statements);
  9450. BrL(end);
  9451. SetLabel(false);
  9452. ELSE
  9453. IF value THEN (* always true *)
  9454. escape := TRUE;
  9455. StatementSequence(if.statements);
  9456. (* no branch necessary -- rest skipped *)
  9457. END;
  9458. END;
  9459. END IfPart;
  9460. BEGIN
  9461. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9462. end := NewLabel();
  9463. elsifs := x.ElsifParts();
  9464. IfPart(x.ifPart);
  9465. FOR i := 0 TO elsifs-1 DO
  9466. IF ~escape THEN
  9467. elsif := x.GetElsifPart(i);
  9468. IfPart(elsif);
  9469. END;
  9470. END;
  9471. IF (x.elsePart # NIL) & ~escape THEN
  9472. StatementSequence(x.elsePart);
  9473. END;
  9474. SetLabel(end);
  9475. IF Trace THEN TraceExit("VisitIfStatement") END;
  9476. END VisitIfStatement;
  9477. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9478. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9479. BEGIN
  9480. (*IF x.variable.type.resolved = x.type.resolved THEN
  9481. (* always true, do nothing *)
  9482. ELSE*)
  9483. Designate(x.variable,res);
  9484. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9485. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9486. END;
  9487. trueL := NewLabel();
  9488. TypeTest(res.tag,x.type,trueL,falseL);
  9489. ReleaseOperand(res);
  9490. SetLabel(trueL);
  9491. StatementSequence(x.statements);
  9492. BrL(endL);
  9493. END WithPart;
  9494. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9495. VAR endL,falseL: Label;i: LONGINT;
  9496. BEGIN
  9497. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9498. endL := NewLabel();
  9499. FOR i := 0 TO x.WithParts()-1 DO
  9500. falseL := NewLabel();
  9501. WithPart(x.GetWithPart(i),falseL,endL);
  9502. SetLabel(falseL);
  9503. END;
  9504. IF x.elsePart = NIL THEN
  9505. IF ~isUnchecked THEN
  9506. EmitTrap(position,WithTrap);
  9507. END;
  9508. ELSE
  9509. StatementSequence(x.elsePart)
  9510. END;
  9511. SetLabel(endL);
  9512. IF Trace THEN TraceExit("VisitWithStatement") END;
  9513. END VisitWithStatement;
  9514. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9515. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; j,i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9516. out,else: Label; label: Label;
  9517. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9518. symbol: SyntaxTree.Symbol;
  9519. BEGIN
  9520. (*! split case statement into if-elsif statements for large case label lists *)
  9521. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9522. size := x.max-x.min+1;
  9523. IF (size<0) OR (size > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9524. END;
  9525. Evaluate(x.variable,var);
  9526. ReuseCopy(tmp,var.op);
  9527. ReleaseIntermediateOperand(var.op);
  9528. var.op := tmp;
  9529. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9530. Convert(var.op,addressType);
  9531. size := x.max-x.min+1;
  9532. else := NewLabel();
  9533. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9534. (*
  9535. UniqueId(name,module.module,"case",caseId);
  9536. *)
  9537. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9538. Global.GetModuleSegmentedName(module.module, name);
  9539. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9540. symbol := SyntaxTree.NewSymbol(name[1]);
  9541. symbol.SetScope(moduleScope);
  9542. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9543. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9544. section.isCaseTable := TRUE;
  9545. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9546. ReuseCopy(res,var.op);
  9547. ReleaseOperand(var);
  9548. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9549. Emit(Add(position,res,res,jmp));
  9550. IntermediateCode.MakeMemory(res,addressType);
  9551. Emit(Br(position,res));
  9552. ReleaseIntermediateOperand(res);
  9553. out := NewLabel();
  9554. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9555. part := x.GetCasePart(i);
  9556. constant := part.firstConstant;
  9557. label := NewLabel();
  9558. SetLabel(label);
  9559. WHILE(constant # NIL) DO (* case labels for this case part *)
  9560. FOR j := constant.min TO constant.max DO
  9561. fixups[j-x.min] := label;
  9562. END;
  9563. constant := constant.next;
  9564. END;
  9565. StatementSequence(part.statements);
  9566. BrL(out);
  9567. END;
  9568. SetLabel(else);
  9569. FOR i := 0 TO size-1 DO
  9570. IF fixups[i] = NIL THEN
  9571. fixups[i] := else;
  9572. END;
  9573. END;
  9574. IF x.elsePart # NIL THEN
  9575. StatementSequence(x.elsePart);
  9576. ELSIF ~isUnchecked THEN
  9577. EmitTrap(position,CaseTrap);
  9578. END;
  9579. SetLabel(out);
  9580. FOR i := 0 TO size-1 DO
  9581. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9582. section.Emit(Data(position,op));
  9583. END;
  9584. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9585. END VisitCaseStatement;
  9586. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9587. VAR start: Label; true,false: Label;
  9588. BEGIN
  9589. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9590. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9591. start := NewLabel();
  9592. true := NewLabel();
  9593. false := NewLabel();
  9594. SetLabel(start);
  9595. Condition(x.condition,true,false);
  9596. SetLabel(true);
  9597. StatementSequence(x.statements);
  9598. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9599. BrL(start);
  9600. SetLabel(false);
  9601. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9602. END VisitWhileStatement;
  9603. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9604. VAR false,true: Label;
  9605. BEGIN
  9606. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9607. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9608. true := NewLabel();
  9609. false := NewLabel();
  9610. SetLabel(false);
  9611. StatementSequence(x.statements);
  9612. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9613. Condition(x.condition,true,false);
  9614. SetLabel(true);
  9615. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9616. END VisitRepeatStatement;
  9617. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9618. VAR
  9619. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9620. temporaryVariable: SyntaxTree.Variable;
  9621. temporaryVariableDesignator : SyntaxTree.Designator;
  9622. BEGIN
  9623. IF Trace THEN TraceEnter("VisitForStatement") END;
  9624. true := NewLabel();
  9625. false := NewLabel();
  9626. start := NewLabel();
  9627. Assign(x.variable,x.from);
  9628. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9629. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9630. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9631. Assign(temporaryVariableDesignator,x.to);
  9632. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).hvalue END;
  9633. IF by > 0 THEN
  9634. cmp := Scanner.LessEqual
  9635. ELSE
  9636. cmp := Scanner.GreaterEqual
  9637. END;
  9638. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9639. binary.SetType(system.booleanType);
  9640. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9641. SetLabel(start);
  9642. Condition(binary,true,false);
  9643. SetLabel(true);
  9644. StatementSequence(x.statements);
  9645. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9646. binary.SetType(x.variable.type);
  9647. Assign(x.variable,binary);
  9648. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9649. BrL(start);
  9650. SetLabel(false);
  9651. IF Trace THEN TraceExit("VisitForStatement") END;
  9652. END VisitForStatement;
  9653. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9654. VAR prevLoop: Label;
  9655. BEGIN
  9656. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9657. prevLoop := currentLoop;
  9658. currentLoop := NewLabel();
  9659. StatementSequence(x.statements);
  9660. SetLabel(currentLoop);
  9661. currentLoop := prevLoop;
  9662. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9663. END VisitExitableBlock;
  9664. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9665. VAR prevLoop,start: Label;
  9666. BEGIN
  9667. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9668. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9669. start := NewLabel();
  9670. prevLoop := currentLoop;
  9671. SetLabel(start);
  9672. currentLoop := NewLabel();
  9673. StatementSequence(x.statements);
  9674. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9675. BrL(start);
  9676. SetLabel(currentLoop);
  9677. currentLoop := prevLoop;
  9678. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9679. END VisitLoopStatement;
  9680. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9681. VAR outer: SyntaxTree.Statement;
  9682. BEGIN
  9683. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9684. IF locked THEN (* r if we jump out of an exclusive block *)
  9685. outer := x.outer;
  9686. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9687. outer := outer.outer;
  9688. END;
  9689. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9690. Lock(FALSE);
  9691. END;
  9692. END;
  9693. BrL(currentLoop);
  9694. IF Trace THEN TraceExit("VisitExitStatement") END;
  9695. END VisitExitStatement;
  9696. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9697. VAR
  9698. expression, parameterDesignator: SyntaxTree.Expression;
  9699. type, componentType: SyntaxTree.Type;
  9700. res, right: Operand;
  9701. left, mem, reg: IntermediateCode.Operand;
  9702. parameter: SyntaxTree.Parameter;
  9703. procedure: SyntaxTree.Procedure;
  9704. procedureType: SyntaxTree.ProcedureType;
  9705. returnTypeOffset: LONGINT;
  9706. delegate: BOOLEAN;
  9707. map: SymbolMap;
  9708. cc, parametersSize: LONGINT;
  9709. BEGIN
  9710. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9711. expression := x.returnValue;
  9712. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9713. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9714. IF currentIsInline THEN
  9715. IF expression # NIL THEN
  9716. map := currentMapper.Get(NIL);
  9717. IF map # NIL THEN
  9718. Assign(map.to, expression);
  9719. ELSE
  9720. Evaluate(expression,res);
  9721. Emit(Return(position,res.op));
  9722. ReleaseOperand(res);
  9723. END;
  9724. END;
  9725. BrL(currentInlineExit);
  9726. RETURN;
  9727. END;
  9728. IF expression # NIL THEN
  9729. type := expression.type.resolved;
  9730. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9731. IF locked THEN Lock(FALSE) END;
  9732. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9733. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9734. 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
  9735. (* return without structured return parameter *)
  9736. Evaluate(expression,res);
  9737. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9738. IF locked OR profile THEN
  9739. Emit(Push(position,res.op));
  9740. IF delegate THEN HALT(200) END;
  9741. ReleaseOperand(res);
  9742. IF locked THEN Lock(FALSE) END;
  9743. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9744. reg := NewRegisterOperand(res.op.type);
  9745. Emit(Pop(position,reg));
  9746. Emit(Return(position,reg));
  9747. ReleaseIntermediateOperand(reg);
  9748. ELSE
  9749. Emit(Return(position,res.op));
  9750. ReleaseOperand(res);
  9751. END;
  9752. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9753. THEN
  9754. (* return using structured return parameter *)
  9755. 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)
  9756. OR SemanticChecker.IsPointerType(type));
  9757. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9758. parameter :=procedureType.returnParameter;
  9759. ASSERT(parameter # NIL);
  9760. returnTypeOffset := parameter.offsetInBits;
  9761. (*
  9762. IF parameter# NIL THEN
  9763. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9764. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9765. ELSE
  9766. returnTypeOffset := system.offsetFirstParameter
  9767. END;
  9768. *)
  9769. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9770. IF type IS SyntaxTree.RangeType THEN
  9771. (* array range type *)
  9772. Evaluate(expression, right);
  9773. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9774. Emit(Mov(position,mem, right.op)); (* first *)
  9775. ReleaseIntermediateOperand(mem);
  9776. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9777. Emit(Mov(position,mem, right.tag)); (* last *)
  9778. ReleaseIntermediateOperand(mem);
  9779. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9780. Emit(Mov(position,mem, right.extra)); (* step *)
  9781. ReleaseIntermediateOperand(mem);
  9782. ReleaseOperand(right);
  9783. ELSIF type IS SyntaxTree.ComplexType THEN
  9784. Evaluate(expression, right);
  9785. componentType := type(SyntaxTree.ComplexType).componentType;
  9786. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9787. Emit(Mov(position,mem, right.op)); (* real part *)
  9788. ReleaseIntermediateOperand(mem);
  9789. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9790. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9791. ReleaseIntermediateOperand(mem);
  9792. ReleaseOperand(right);
  9793. ELSE (* covers cases: pointer / record / array *)
  9794. parameter := procedureType.returnParameter;
  9795. checker.SetCurrentScope(currentScope);
  9796. ASSERT(parameter # NIL);
  9797. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9798. Assign(parameterDesignator,expression);
  9799. END;
  9800. ReleaseIntermediateOperand(left);
  9801. IF locked THEN Lock(FALSE) END;
  9802. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9803. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9804. parameter := procedureType.returnParameter;
  9805. checker.SetCurrentScope(currentScope);
  9806. IF parameter = NIL THEN
  9807. Error(procedure.position, "structured return of parameter of procedure not found");
  9808. ELSE
  9809. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9810. Assign(parameterDesignator,expression);
  9811. END;
  9812. IF locked THEN Lock(FALSE) END;
  9813. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9814. ELSE
  9815. HALT(200);
  9816. END;
  9817. ELSE
  9818. IF locked THEN Lock(FALSE) END;
  9819. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9820. END;
  9821. IF backend.cooperative THEN
  9822. BrL(exitLabel);
  9823. ELSE
  9824. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  9825. IF cc = SyntaxTree.WinAPICallingConvention THEN
  9826. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9827. ELSE
  9828. parametersSize := 0;
  9829. END;
  9830. EmitLeave(section, position,procedure, procedure.type(SyntaxTree.ProcedureType).callingConvention);
  9831. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,procedure.type(SyntaxTree.ProcedureType).callingConvention, parametersSize));
  9832. END;
  9833. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9834. END VisitReturnStatement;
  9835. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9836. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9837. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9838. statements: SyntaxTree.StatementSequence;
  9839. name, suffix: SyntaxTree.IdentifierString;
  9840. BEGIN
  9841. Strings.IntToStr(awaitProcCounter,suffix);
  9842. Strings.Concat("@AwaitProcedure",suffix,name);
  9843. identifier := SyntaxTree.NewIdentifier(name);
  9844. INC(awaitProcCounter);
  9845. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9846. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9847. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9848. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9849. procedure.SetAccess(SyntaxTree.Hidden);
  9850. procedure.SetScope(currentScope);
  9851. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9852. procedureType.SetReturnType(system.booleanType);
  9853. procedure.SetType(procedureType);
  9854. body := SyntaxTree.NewBody(x.position,procedureScope);
  9855. procedureScope.SetBody(body);
  9856. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9857. returnStatement.SetReturnValue(x.condition);
  9858. statements := SyntaxTree.NewStatementSequence();
  9859. statements.AddStatement(returnStatement);
  9860. body.SetStatementSequence(statements);
  9861. currentScope.AddProcedure(procedure);
  9862. RETURN procedure
  9863. END MakeAwaitProcedure;
  9864. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  9865. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9866. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9867. BEGIN
  9868. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9869. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9870. IF backend.cooperative THEN
  9871. start := NewLabel();
  9872. true := NewLabel();
  9873. false := NewLabel();
  9874. SetLabel(start);
  9875. Condition(x.condition,true,false);
  9876. SetLabel(false);
  9877. PushSelfPointer();
  9878. CallThis(position,"ExclusiveBlocks","Await",1);
  9879. BrL(start);
  9880. SetLabel(true);
  9881. PushSelfPointer();
  9882. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9883. ELSE
  9884. proc := MakeAwaitProcedure(x);
  9885. Emit(Push(position,fp));
  9886. GetCodeSectionNameForSymbol(proc,name);
  9887. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9888. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9889. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9890. Emit(Call(position,call,ProcedureParametersSize(system,proc)));
  9891. Emit(Result(position,res));
  9892. (*
  9893. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9894. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9895. *)
  9896. InitOperand(result,ModeValue);
  9897. result.op := res;
  9898. label := NewLabel();
  9899. BreqL(label, result.op, SELF.true);
  9900. ReleaseOperand(result);
  9901. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9902. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9903. Emit(Push(position,res));
  9904. Emit(Push(position,fp));
  9905. PushSelfPointer();
  9906. Emit(Push(position,nil));
  9907. CallThis(position,"Objects","Await",4);
  9908. SetLabel(label);
  9909. END;
  9910. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9911. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9912. END VisitAwaitStatement;
  9913. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  9914. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  9915. BEGIN
  9916. FOR i := 0 TO x.Length() - 1 DO
  9917. statement := x.GetStatement( i );
  9918. Statement(statement);
  9919. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  9920. END;
  9921. END StatementSequence;
  9922. PROCEDURE PushSelfPointer;
  9923. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  9924. procedureType: SyntaxTree.ProcedureType;
  9925. BEGIN
  9926. scope := currentScope;
  9927. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  9928. scope := scope.outerScope;
  9929. END;
  9930. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  9931. IF ~newObjectFile THEN
  9932. Symbol(moduleSelf,op);
  9933. IntermediateCode.MakeMemory(op.op,addressType);
  9934. ELSE
  9935. moduleSection := meta.ModuleSection();
  9936. IF backend.cooperative THEN
  9937. moduleOffset := 0;
  9938. ELSE
  9939. moduleOffset := moduleSection.pc;
  9940. END;
  9941. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  9942. END;
  9943. ELSE
  9944. GetBaseRegister(op.op,currentScope,scope);
  9945. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  9946. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9947. parametersSize := ProcedureParametersSize(system,procedure);
  9948. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  9949. IF backend.cooperative THEN
  9950. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  9951. END;
  9952. IntermediateCode.MakeMemory(op.op,addressType);
  9953. END;
  9954. Emit(Push(position,op.op));
  9955. ReleaseOperand(op);
  9956. END PushSelfPointer;
  9957. PROCEDURE Lock(lock: BOOLEAN);
  9958. BEGIN
  9959. IF Trace THEN TraceEnter("Lock") END;
  9960. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9961. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  9962. ASSERT(modifyAssignmentCounter = 0);
  9963. IF dump # NIL THEN
  9964. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  9965. dump.Ln;dump.Update;
  9966. END;
  9967. PushSelfPointer;
  9968. IF backend.cooperative THEN
  9969. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  9970. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  9971. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  9972. END;
  9973. ELSE
  9974. Emit(Push(position,true));
  9975. IF lock THEN CallThis(position,"Objects","Lock",2)
  9976. ELSE CallThis(position,"Objects","Unlock",2);
  9977. END;
  9978. END;
  9979. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9980. IF Trace THEN TraceExit("Lock") END;
  9981. END Lock;
  9982. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  9983. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN;
  9984. BEGIN
  9985. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  9986. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  9987. previouslyUnchecked := isUnchecked;
  9988. isUnchecked := isUnchecked OR x.isUnchecked;
  9989. previouslyCooperativeSwitches := cooperativeSwitches;
  9990. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  9991. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  9992. IF x.statements # NIL THEN
  9993. StatementSequence(x.statements);
  9994. END;
  9995. IF (x IS SyntaxTree.Body) THEN
  9996. IF (x(SyntaxTree.Body).finally # NIL) THEN
  9997. section.SetFinally(section.pc);
  9998. StatementSequence(x(SyntaxTree.Body).finally)
  9999. END;
  10000. END;
  10001. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10002. isUnchecked := previouslyUnchecked;
  10003. cooperativeSwitches := previouslyCooperativeSwitches;
  10004. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10005. END VisitStatementBlock;
  10006. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10007. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10008. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10009. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10010. procedure: SyntaxTree.Procedure;
  10011. map: SymbolMap;
  10012. cc, parametersSize: LONGINT;
  10013. BEGIN
  10014. scope := currentScope;
  10015. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10016. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10017. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10018. return := emptyOperand;
  10019. IF Trace THEN TraceEnter("VisitCode") END;
  10020. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10021. NEW(in, x.inRules.Length());
  10022. FOR i := 0 TO LEN(in)-1 DO
  10023. statement := x.inRules.GetStatement(i);
  10024. WITH statement: SyntaxTree.Assignment DO
  10025. Evaluate(statement.right, operand);
  10026. result := operand.op;
  10027. NEW(str, 64);
  10028. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10029. in[i] := result; IntermediateCode.SetString(in[i], str);
  10030. ReleaseIntermediateOperand(operand.tag);
  10031. END;
  10032. END;
  10033. ELSE in := NIL
  10034. END;
  10035. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10036. NEW(out, x.outRules.Length());
  10037. FOR i := 0 TO LEN(out)-1 DO
  10038. statement := x.outRules.GetStatement(i);
  10039. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10040. WITH statement: SyntaxTree.Assignment DO
  10041. Designate(statement.left, operand);
  10042. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10043. NEW(str, 64);
  10044. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10045. out[i] := result; IntermediateCode.SetString(out[i], str);
  10046. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10047. |statement: SyntaxTree.ReturnStatement DO
  10048. NEW(str, 64);
  10049. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10050. IF currentIsInline THEN
  10051. map := currentMapper.Get(NIL);
  10052. Designate(map.to, operand);
  10053. IF map.isAddress THEN
  10054. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10055. ELSE
  10056. result := operand.op;
  10057. END;
  10058. (*! only if it does not fit into register
  10059. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10060. *)
  10061. (*Evaluate(map.to, operand);*)
  10062. out[i] := result;
  10063. ELSE
  10064. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10065. END;
  10066. IntermediateCode.SetString(out[i], str);
  10067. ReleaseIntermediateOperand(operand.tag);
  10068. return := out[i];
  10069. ELSE
  10070. END;
  10071. END;
  10072. ELSE out := NIL
  10073. END;
  10074. Emit(Asm(x.position,x.sourceCode, in, out));
  10075. IF in # NIL THEN
  10076. FOR i := 0 TO LEN(in)-1 DO
  10077. ReleaseIntermediateOperand(in[i]);
  10078. END;
  10079. END;
  10080. IF out # NIL THEN
  10081. FOR i := 0 TO LEN(out)-1 DO
  10082. WITH statement: SyntaxTree.Assignment DO
  10083. ReleaseIntermediateOperand(out[i]);
  10084. |statement: SyntaxTree.ReturnStatement DO
  10085. (* release happens below *)
  10086. ELSE
  10087. END;
  10088. statement := x.outRules.GetStatement(i);
  10089. END;
  10090. END;
  10091. IF return.mode # IntermediateCode.Undefined THEN
  10092. IF currentIsInline THEN
  10093. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10094. Symbol(procedureType.returnParameter, par);
  10095. MakeMemory(mem, par.op, return.type, 0);
  10096. ReleaseOperand(par);
  10097. Emit(Mov(position, mem, return));
  10098. ReleaseIntermediateOperand(mem);
  10099. ELSE
  10100. Emit(Return(position,return));
  10101. END;
  10102. ReleaseIntermediateOperand(return);
  10103. IF currentIsInline THEN RETURN END;
  10104. cc := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10105. IF cc = SyntaxTree.WinAPICallingConvention THEN
  10106. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10107. ELSE
  10108. parametersSize := 0;
  10109. END;
  10110. EmitLeave(section, position,procedure, cc);
  10111. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,cc, parametersSize));
  10112. END;
  10113. IF Trace THEN TraceExit("VisitCode") END;
  10114. END VisitCode;
  10115. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10116. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10117. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10118. const, call: IntermediateCode.Operand;
  10119. parameterDesignator: SyntaxTree.Expression;
  10120. saved: RegisterEntry;
  10121. name: Basic.SegmentedName;
  10122. BEGIN
  10123. IF Trace THEN TraceEnter("ParameterCopies") END;
  10124. parameter := x.firstParameter;
  10125. WHILE parameter # NIL DO
  10126. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10127. type := parameter.type.resolved;
  10128. IF IsOpenArray(type) THEN
  10129. VisitParameter(parameter);
  10130. op := result;
  10131. IF backend.cooperative & parameter.NeedsTrace() THEN
  10132. length := GetArrayLength(type, op.tag);
  10133. size := NewRegisterOperand(addressType);
  10134. base := ArrayBaseType(type);
  10135. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10136. Emit(Mul(position, size, length, const));
  10137. dst := NewRegisterOperand (addressType);
  10138. Emit(Mov(position, dst, size));
  10139. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10140. Emit(Sub(position,dst,sp,dst));
  10141. Emit(And(position,dst,dst,const));
  10142. Emit(Mov(position,sp,dst));
  10143. par := fp;
  10144. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10145. IntermediateCode.InitImmediate(null, byteType, 0);
  10146. Emit(Fill(position, dst, size, null));
  10147. ReleaseIntermediateOperand(dst);
  10148. ReleaseIntermediateOperand(length);
  10149. SaveRegisters();ReleaseUsedRegisters(saved);
  10150. (* register dst has been freed before SaveRegisters already *)
  10151. base := ArrayBaseType(type);
  10152. (* assign method of open array *)
  10153. IF base.IsRecordType() THEN
  10154. Emit (Push(position, length));
  10155. Emit (Push(position, dst));
  10156. Emit (Push(position, op.op));
  10157. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10158. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10159. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10160. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10161. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10162. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10163. Emit (Push(position,length));
  10164. Emit (Push(position, dst));
  10165. Emit (Push(position, length));
  10166. Emit (Push(position, op.op));
  10167. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10168. ELSE
  10169. Emit (Push(position, length));
  10170. Emit (Push(position, dst));
  10171. Emit (Push(position, length));
  10172. Emit (Push(position, op.op));
  10173. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10174. ASSERT(ArrayBaseType(type).IsPointer());
  10175. END;
  10176. RestoreRegisters(saved);
  10177. ELSE
  10178. temp := GetDynamicSize(type,op.tag);
  10179. ReuseCopy(size,temp);
  10180. ReleaseIntermediateOperand(temp);
  10181. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10182. Emit(Sub(position,size,sp,size));
  10183. Emit(And(position,size,size,const));
  10184. Emit(Mov(position,sp,size));
  10185. par := fp;
  10186. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10187. ReleaseIntermediateOperand(size);
  10188. size := GetDynamicSize(type,op.tag);
  10189. END;
  10190. Emit(Copy(position,sp,op.op,size));
  10191. ReleaseIntermediateOperand(size);
  10192. ReleaseOperand(op);
  10193. IntermediateCode.MakeMemory(par,addressType);
  10194. Emit(Mov(position,par,sp));
  10195. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10196. checker.SetCurrentScope(currentScope);
  10197. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10198. Assign(parameterDesignator,parameterDesignator);
  10199. END;
  10200. END;
  10201. parameter := parameter.nextParameter;
  10202. END;
  10203. IF Trace THEN TraceExit("ParameterCopies") END;
  10204. END ParameterCopies;
  10205. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10206. VAR x: SyntaxTree.Variable;
  10207. BEGIN
  10208. x := scope.firstVariable;
  10209. WHILE x # NIL DO
  10210. InitVariable(x,FALSE);
  10211. x := x.nextVariable;
  10212. END;
  10213. END InitVariables;
  10214. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10215. BEGIN
  10216. IF (symbol # NIL) THEN
  10217. RETURN fingerPrinter.SymbolFP(symbol).public
  10218. ELSE
  10219. RETURN 0
  10220. END;
  10221. END GetFingerprint;
  10222. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10223. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10224. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10225. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10226. name: Basic.SegmentedName;
  10227. offset: LONGINT;
  10228. BEGIN
  10229. IF Trace THEN TraceEnter("Body") END;
  10230. ReleaseUsedRegisters(saved); (* just in case ... *)
  10231. section := ir;
  10232. exitLabel := NewLabel ();
  10233. IF moduleBody THEN moduleBodySection := section END;
  10234. IF ir.comments # NIL THEN
  10235. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10236. commentPrintout.SingleStatement(TRUE);
  10237. dump := ir.comments;
  10238. ELSE
  10239. commentPrintout := NIL;
  10240. dump := NIL;
  10241. END;
  10242. prevScope := currentScope;
  10243. currentScope := scope;
  10244. lastSwitchPC := 0;
  10245. cooperativeSwitches := backend.cooperative;
  10246. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10247. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10248. IF x # NIL THEN
  10249. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10250. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10251. IF moduleBody THEN
  10252. ProfilerInit();
  10253. ELSE
  10254. Basic.SegmentedNameToString(ir.name, string);
  10255. ProfilerAddProcedure(numberProcedures,string);
  10256. ProfilerEnterExit(numberProcedures,TRUE);
  10257. END;
  10258. END;
  10259. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10260. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10261. END;
  10262. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10263. IF moduleBody & ~newObjectFile THEN
  10264. InitVariables(moduleScope)
  10265. END;
  10266. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10267. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10268. IF procedure = cellScope.bodyProcedure THEN
  10269. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10270. StaticCallOperand(op, cellScope.constructor);
  10271. Emit(Call(position,op.op,0));
  10272. END;
  10273. END;
  10274. END;
  10275. InitVariables(scope);
  10276. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10277. GetCodeSectionNameForSymbol(procedure, name);
  10278. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10279. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10280. IF ProtectModulesPointers THEN
  10281. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10282. ELSE
  10283. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10284. END;
  10285. IntermediateCode.SetOffset(right,offset); (* tag *)
  10286. IntermediateCode.InitMemory(left,addressType,fp,0);
  10287. Emit(Mov(position, left, right));
  10288. END;
  10289. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10290. ParameterCopies(procedureType);
  10291. IF x.code = NIL THEN
  10292. VisitStatementBlock(x);
  10293. ELSE
  10294. VisitCode(x.code)
  10295. END;
  10296. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10297. IF ~backend.cooperative THEN
  10298. ProfilerEnterExit(numberProcedures,FALSE);
  10299. END;
  10300. INC(numberProcedures);
  10301. END;
  10302. END;
  10303. IF backend.cooperative THEN
  10304. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10305. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10306. END;
  10307. IF x # NIL THEN
  10308. SELF.position := x.position;
  10309. END;
  10310. CheckRegistersFree();
  10311. ASSERT(modifyAssignmentCounter = 0);
  10312. currentScope := prevScope;
  10313. IF Trace THEN TraceExit("Body") END;
  10314. END Body;
  10315. END ImplementationVisitor;
  10316. MetaDataGenerator=OBJECT
  10317. VAR
  10318. implementationVisitor: ImplementationVisitor;
  10319. declarationVisitor: DeclarationVisitor;
  10320. module: Sections.Module;
  10321. moduleName: ARRAY 128 OF CHAR;
  10322. moduleNamePool: Basic.HashTableInt;
  10323. moduleNamePoolSection: IntermediateCode.Section;
  10324. modulePointerSection: IntermediateCode.Section;
  10325. modulePointerSizePC: LONGINT;
  10326. modulePointerSectionOffset: LONGINT;
  10327. modulePointers: LONGINT;
  10328. simple: BOOLEAN; (* simple = no methods, no module loading, no reflection *)
  10329. RecordBaseOffset: LONGINT;
  10330. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10331. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10332. TypeTags: LONGINT; (* type extension level support *)
  10333. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10334. patchInfoPC: LONGINT;
  10335. patchCRC: LONGINT;
  10336. CONST
  10337. EmptyBlockOffset = 2;
  10338. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10339. BEGIN
  10340. IF implementationVisitor.backend.cooperative THEN
  10341. TypeTags := MAX(LONGINT);
  10342. BaseTypesTableOffset := 0;
  10343. MethodTableOffset := 2;
  10344. TypeRecordBaseOffset := 0;
  10345. RecordBaseOffset := 0;
  10346. ELSIF simple THEN
  10347. TypeTags := 3; (* only 3 extensions allowed *)
  10348. BaseTypesTableOffset := 1;
  10349. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10350. TypeRecordBaseOffset := 0;
  10351. RecordBaseOffset := 1;
  10352. ELSE
  10353. TypeTags := 16;
  10354. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10355. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10356. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10357. (* change this when Heaps.HeapBlock is modified *)
  10358. RecordBaseOffset := 8;
  10359. END;
  10360. SELF.simple := simple;
  10361. SELF.implementationVisitor := implementationVisitor;
  10362. SELF.declarationVisitor := declarationVisitor;
  10363. implementationVisitor.meta := SELF;
  10364. declarationVisitor.meta := SELF;
  10365. END InitMetaDataGenerator;
  10366. PROCEDURE SetModule(module: Sections.Module);
  10367. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10368. BEGIN
  10369. SELF.module := module;
  10370. Global.GetModuleName(module.module,moduleName);
  10371. Global.GetSymbolSegmentedName(module.module, name);
  10372. IF ReflectionSupport & implementationVisitor.newObjectFile & ~simple & ~implementationVisitor.backend.cooperative THEN
  10373. NEW(moduleNamePool, 32);
  10374. (*! require GC protection *)
  10375. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10376. IF ProtectModulesPointers THEN
  10377. name := "Heaps.AnyPtr";
  10378. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10379. (* set base pointer *)
  10380. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10381. END;
  10382. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10383. modulePointers := 0;
  10384. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10385. AddPointer(moduleNamePoolSection, namePoolOffset);
  10386. END;
  10387. END SetModule;
  10388. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10389. BEGIN
  10390. IF ~implementationVisitor.backend.cooperative THEN
  10391. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10392. INC(modulePointers);
  10393. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10394. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10395. END;
  10396. END AddPointer;
  10397. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10398. BEGIN
  10399. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10400. END GetTypeRecordBaseOffset;
  10401. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10402. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10403. BEGIN
  10404. (* change this when Heaps.HeapBlock is modified *)
  10405. INC(dataAdrOffset,6);
  10406. Info(section,"headerAdr");
  10407. Address(section,0);
  10408. Info(section,"typeDesc");
  10409. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10410. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10411. NamedSymbol(section, name, symbol, 0, offset);
  10412. Info(section,"mark: LONGINT;");
  10413. Longint(section,-1);
  10414. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10415. Info(section,"dataAdr-: ADDRESS");
  10416. Symbol(section,section, dataAdrOffset,0);
  10417. Info(section,"size-: SIZE");
  10418. Address(section,0);
  10419. Info(section,"nextMark: HeapBlock;");
  10420. Address(section,0);
  10421. END HeapBlock;
  10422. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10423. VAR i: LONGINT;
  10424. BEGIN
  10425. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10426. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10427. Info(section,"count*: LONGINT");
  10428. Longint(section,0);
  10429. Info(section,"locked*: BOOLEAN");
  10430. Longint(section,0);
  10431. Info(section,"awaitingLock*: ProcessQueue");
  10432. Address(section,0);
  10433. Address(section,0);
  10434. Info(section,"awaitingCond*: ProcessQueue");
  10435. Address(section,0);
  10436. Address(section,0);
  10437. Info(section,"lockedBy*: ANY");
  10438. Address(section,0);
  10439. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10440. Longint(section,1);
  10441. FOR i := 2 TO 6 DO
  10442. Longint(section,0);
  10443. END;
  10444. Info(section,"lock*: ANY");
  10445. Address(section,0);
  10446. END ProtectedHeapBlock;
  10447. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10448. BEGIN
  10449. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10450. END Info;
  10451. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10452. VAR op: IntermediateCode.Operand;
  10453. BEGIN
  10454. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10455. section.Emit(Data(Basic.invalidPosition,op));
  10456. END Address;
  10457. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10458. VAR op: IntermediateCode.Operand;
  10459. BEGIN
  10460. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10461. section.Emit(Data(Basic.invalidPosition,op));
  10462. END Size;
  10463. PROCEDURE Set(section: IntermediateCode.Section; value: SET);
  10464. VAR op: IntermediateCode.Operand;
  10465. BEGIN
  10466. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),SYSTEM.VAL(LONGINT,value));
  10467. section.Emit(Data(Basic.invalidPosition,op));
  10468. END Set;
  10469. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10470. VAR op: IntermediateCode.Operand;
  10471. BEGIN
  10472. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10473. section.Emit(Data(Basic.invalidPosition,op));
  10474. END Longint;
  10475. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10476. VAR op,noOperand: IntermediateCode.Operand;
  10477. BEGIN
  10478. IntermediateCode.InitOperand(noOperand);
  10479. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10480. section.PatchOperands(pc,op,noOperand,noOperand);
  10481. END PatchAddress;
  10482. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10483. VAR op,noOperand: IntermediateCode.Operand;
  10484. BEGIN
  10485. IntermediateCode.InitOperand(noOperand);
  10486. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10487. section.PatchOperands(pc,op,noOperand,noOperand);
  10488. END PatchSize;
  10489. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10490. VAR op,noOperand: IntermediateCode.Operand;
  10491. BEGIN
  10492. IntermediateCode.InitOperand(noOperand);
  10493. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10494. section.PatchOperands(pc,op,noOperand,noOperand);
  10495. END PatchLongint;
  10496. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10497. VAR op, noOperand: IntermediateCode.Operand;
  10498. BEGIN
  10499. IntermediateCode.InitOperand(noOperand);
  10500. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10501. section.PatchOperands(pc,op,noOperand,noOperand);
  10502. END PatchSymbol;
  10503. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10504. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10505. BEGIN
  10506. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10507. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10508. section.Emit(Data(Basic.invalidPosition,op));
  10509. END Boolean;
  10510. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10511. VAR op: IntermediateCode.Operand;
  10512. BEGIN
  10513. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10514. section.Emit(Data(Basic.invalidPosition,op));
  10515. END Char;
  10516. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10517. VAR op: IntermediateCode.Operand;
  10518. BEGIN
  10519. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10520. section.Emit(Data(Basic.invalidPosition,op));
  10521. END Integer;
  10522. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10523. VAR i: LONGINT;
  10524. BEGIN
  10525. Info(section,str);
  10526. i := 0;
  10527. WHILE(str[i] # 0X) DO
  10528. Char(section,str[i]);
  10529. INC(i);
  10530. END;
  10531. Char(section,0X);
  10532. END String;
  10533. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10534. VAR s: Basic.SectionName;
  10535. BEGIN
  10536. StringPool.GetString(str, s);
  10537. String(section, s);
  10538. END String0;
  10539. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10540. VAR op: IntermediateCode.Operand;
  10541. BEGIN
  10542. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10543. IntermediateCode.SetOffset(op,realOffset);
  10544. section.Emit(Data(Basic.invalidPosition,op));
  10545. END NamedSymbol;
  10546. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10547. VAR op: IntermediateCode.Operand;
  10548. BEGIN
  10549. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10550. IntermediateCode.SetOffset(op,realOffset);
  10551. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10552. END NamedSymbolAt;
  10553. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10554. BEGIN
  10555. IF symbol= NIL THEN
  10556. Address( section, realOffset);
  10557. ASSERT(virtualOffset = 0);
  10558. ELSE
  10559. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10560. END;
  10561. END Symbol;
  10562. (* OutPointers delivers
  10563. {pointerOffset}
  10564. *)
  10565. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10566. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10567. BEGIN
  10568. type := type.resolved;
  10569. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10570. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10571. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10572. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10573. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10574. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10575. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10576. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10577. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10578. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10579. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10580. ELSIF (type IS SyntaxTree.RecordType) THEN
  10581. (* never treat a record like a pointer, even if the pointer field is set! *)
  10582. WITH type: SyntaxTree.RecordType DO
  10583. base := type.GetBaseRecord();
  10584. IF base # NIL THEN
  10585. Pointers(offset,symbol,section, base,numberPointers);
  10586. END;
  10587. variable := type.recordScope.firstVariable;
  10588. WHILE(variable # NIL) DO
  10589. IF ~(variable.untraced) THEN
  10590. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10591. END;
  10592. variable := variable.nextVariable;
  10593. END;
  10594. END;
  10595. ELSIF (type IS SyntaxTree.CellType) THEN
  10596. WITH type: SyntaxTree.CellType DO
  10597. base := type.GetBaseRecord();
  10598. IF base # NIL THEN
  10599. Pointers(offset,symbol,section, base,numberPointers);
  10600. END;
  10601. variable := type.cellScope.firstVariable;
  10602. WHILE(variable # NIL) DO
  10603. IF ~(variable.untraced) THEN
  10604. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10605. END;
  10606. variable := variable.nextVariable;
  10607. END;
  10608. property := type.firstProperty;
  10609. WHILE(property # NIL) DO
  10610. IF ~(property.untraced) THEN
  10611. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10612. END;
  10613. property := property.nextProperty;
  10614. END;
  10615. parameter := type.firstParameter;
  10616. WHILE(parameter # NIL) DO
  10617. IF ~(parameter.untraced) THEN
  10618. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10619. END;
  10620. parameter := parameter.nextParameter;
  10621. END;
  10622. END;
  10623. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10624. WITH type: SyntaxTree.ArrayType DO
  10625. IF type.form= SyntaxTree.Static THEN
  10626. n := type.staticLength;
  10627. base := type.arrayBase.resolved;
  10628. WHILE(base IS SyntaxTree.ArrayType) DO
  10629. type := base(SyntaxTree.ArrayType);
  10630. n := n* type.staticLength;
  10631. base := type.arrayBase.resolved;
  10632. END;
  10633. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10634. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10635. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10636. FOR i := 0 TO n-1 DO
  10637. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10638. END;
  10639. END;
  10640. ELSE
  10641. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10642. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10643. END;
  10644. END;
  10645. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10646. WITH type: SyntaxTree.MathArrayType DO
  10647. IF type.form = SyntaxTree.Static THEN
  10648. n := type.staticLength;
  10649. base := type.arrayBase.resolved;
  10650. WHILE(base IS SyntaxTree.MathArrayType) DO
  10651. type := base(SyntaxTree.MathArrayType);
  10652. n := n* type.staticLength;
  10653. base := type.arrayBase.resolved;
  10654. END;
  10655. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10656. IF SemanticChecker.ContainsPointer(base) THEN
  10657. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10658. FOR i := 0 TO n-1 DO
  10659. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10660. END;
  10661. END;
  10662. ELSE
  10663. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10664. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10665. END
  10666. END;
  10667. (* ELSE no pointers in type *)
  10668. END;
  10669. END Pointers;
  10670. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10671. VAR position,i: LONGINT; ch: CHAR;
  10672. BEGIN
  10673. IF pool.Has(index) THEN
  10674. RETURN pool.GetInt(index)
  10675. ELSE
  10676. position := source.pc;
  10677. pool.PutInt(index, position);
  10678. Info(source, name);
  10679. i := 0;
  10680. REPEAT
  10681. ch := name[i]; INC(i);
  10682. Char( source, ch);
  10683. UNTIL ch = 0X;
  10684. END;
  10685. RETURN position;
  10686. END EnterDynamicName;
  10687. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10688. VAR name: Basic.SectionName; position: LONGINT;
  10689. BEGIN
  10690. IF pool.Has(index) THEN
  10691. RETURN pool.GetInt(index)
  10692. ELSE
  10693. StringPool.GetString(index, name);
  10694. position := EnterDynamicName(source,name,index, pool);
  10695. END;
  10696. RETURN position;
  10697. END DynamicName;
  10698. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10699. VAR section: IntermediateCode.Section;
  10700. BEGIN
  10701. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10702. IF implementationVisitor.backend.cooperative THEN
  10703. Info(section, "TypeDescriptor");
  10704. Basic.ToSegmentedName("BaseTypes.Array", name);
  10705. NamedSymbol(section, name,NIL, 0, 0);
  10706. BasePointer(section);
  10707. offset := 0;
  10708. ELSE
  10709. IF ProtectModulesPointers THEN
  10710. HeapBlock(mName,typeName,section,2);
  10711. END;
  10712. Info(section, "HeapBlock");
  10713. IF ProtectModulesPointers THEN
  10714. Symbol(section,section,2,0);
  10715. ELSE
  10716. Address(section,0);
  10717. END;
  10718. Info(section, "TypeDescriptor");
  10719. Address(section,0);
  10720. offset := section.pc;
  10721. END;
  10722. RETURN section
  10723. END NamedBlock;
  10724. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10725. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10726. BEGIN
  10727. COPY(moduleName,name);
  10728. Strings.Append(name,suffix);
  10729. Basic.ToSegmentedName(name, pooledName);
  10730. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10731. END Block;
  10732. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10733. VAR name: Basic.SegmentedName;
  10734. BEGIN
  10735. Info(source,"ArrayHeader");
  10736. IF implementationVisitor.backend.cooperative THEN
  10737. sizePC := source.pc;
  10738. Address(source,0);
  10739. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10740. IF baseType # "" THEN
  10741. Basic.ToSegmentedName(baseType, name);
  10742. NamedSymbol(source, name,NIL, 0, 0);
  10743. ELSE
  10744. Address(source,0);
  10745. END;
  10746. Address(source,0);
  10747. ELSE
  10748. Address(source,0);
  10749. Address(source,0);
  10750. (* first pointer for GC *)
  10751. IF hasPointer THEN
  10752. (* points to first element in the array, this is NOT the base type descriptor *)
  10753. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10754. ELSE
  10755. Address(source,0);
  10756. END;
  10757. sizePC := source.pc;
  10758. Address(source,0);
  10759. Info(source,"array data");
  10760. END;
  10761. END ArrayBlock;
  10762. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10763. BEGIN
  10764. IF implementationVisitor.backend.cooperative THEN
  10765. PatchSize(section, pc, size);
  10766. PatchSize(section, pc + 3, size);
  10767. ELSE
  10768. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10769. PatchSize(section, pc, size);
  10770. END;
  10771. END PatchArray;
  10772. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10773. VAR
  10774. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10775. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10776. poolMap: Basic.HashTableInt;
  10777. namePool: IntermediateCode.Section;
  10778. namePoolOffset: LONGINT;
  10779. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10780. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10781. BEGIN
  10782. Basic.SegmentedNameToString(s1.name,n1);
  10783. Basic.SegmentedNameToString(s2.name,n2);
  10784. index := 0;
  10785. ch1 := n1[index];
  10786. ch2 := n2[index];
  10787. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10788. INC(index);
  10789. ch1 := n1[index];
  10790. ch2 := n2[index];
  10791. END;
  10792. RETURN ch1 < ch2;
  10793. END Compare;
  10794. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10795. VAR
  10796. i, j: LONGINT;
  10797. x, t: Sections.Section;
  10798. BEGIN
  10799. IF lo < hi THEN
  10800. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10801. WHILE i <= j DO
  10802. WHILE Compare(list[i], x) DO INC(i) END;
  10803. WHILE Compare(x, list[j]) DO DEC(j) END;
  10804. IF i <= j THEN
  10805. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10806. INC(i); DEC(j)
  10807. END
  10808. END;
  10809. IF lo < j THEN QuickSort(list, lo, j) END;
  10810. IF i < hi THEN QuickSort(list, i, hi) END
  10811. END;
  10812. END QuickSort;
  10813. (*
  10814. ExportDesc* = RECORD
  10815. fp*: ADDRESS;
  10816. name* {UNTRACED}: DynamicName;
  10817. adr*: ADDRESS;
  10818. exports*: LONGINT;
  10819. dsc* {UNTRACED}: ExportArray
  10820. END;
  10821. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10822. *)
  10823. PROCEDURE ExportDesc2(
  10824. source: IntermediateCode.Section;
  10825. namePool: IntermediateCode.Section;
  10826. fingerPrinter: FingerPrinter.FingerPrinter;
  10827. symbol: Sections.Section;
  10828. name: StringPool.Index;
  10829. VAR patchAdr: LONGINT
  10830. ): BOOLEAN;
  10831. VAR fingerPrint: SyntaxTree.FingerPrint;
  10832. BEGIN
  10833. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10834. & (symbol.type # Sections.InlineCodeSection)
  10835. THEN
  10836. *)
  10837. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  10838. & (symbol.type # Sections.ExitCodeSection)
  10839. & (symbol.type # Sections.InlineCodeSection))
  10840. THEN
  10841. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10842. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10843. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10844. Longint(source,fingerPrint.public);
  10845. ELSE
  10846. Longint(source, 0);
  10847. END;
  10848. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10849. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10850. Symbol(source, symbol,0,0);
  10851. patchAdr := source.pc;
  10852. Longint(source, 0);
  10853. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10854. Address(source,0);
  10855. END;
  10856. RETURN TRUE
  10857. ELSE
  10858. RETURN FALSE
  10859. END;
  10860. END ExportDesc2;
  10861. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10862. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10863. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10864. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  10865. nextPatch: LONGINT;
  10866. TYPE
  10867. Scope = RECORD
  10868. elements: LONGINT;
  10869. gelements: LONGINT;
  10870. section: IntermediateCode.Section;
  10871. patchAdr: LONGINT;
  10872. arraySizePC: LONGINT;
  10873. beginPC: LONGINT; (* current scope start pc *)
  10874. END;
  10875. BEGIN
  10876. Basic.InitSegmentedName(prev);
  10877. olevel := -1;
  10878. scopes[0].section := source;
  10879. scopes[0].arraySizePC := MIN(LONGINT);
  10880. FOR s := 0 TO LEN(sections)-1 DO
  10881. symbol := sections[s];
  10882. 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
  10883. this := sections[s].name;
  10884. level := 0;
  10885. WHILE (this[level] > 0) DO
  10886. WHILE (this[level] > 0) & (prev[level] = this[level]) DO
  10887. INC(level);
  10888. END;
  10889. WHILE level < olevel DO
  10890. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10891. IF olevel > 0 THEN
  10892. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10893. nextPatch := scopes[olevel-1].patchAdr+1;
  10894. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10895. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10896. END;
  10897. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10898. DEC(olevel);
  10899. END;
  10900. IF (this[level] > 0) THEN
  10901. IF level > olevel THEN
  10902. (*TRACE("opening",level); *)
  10903. IF scopes[level].section = NIL THEN
  10904. arrayName := ".@ExportArray";
  10905. Strings.AppendInt(arrayName, level);
  10906. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  10907. AddPointer(scopes[level].section,offset);
  10908. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  10909. END;
  10910. scopes[level].beginPC := scopes[level].section.pc;
  10911. olevel := level;
  10912. scopes[olevel].elements := 0;
  10913. END;
  10914. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  10915. sym := sections[s];
  10916. ELSE
  10917. sym := NIL;
  10918. END;
  10919. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  10920. THEN
  10921. INC(scopes[olevel].elements);
  10922. END;
  10923. (* enter string in scope *)
  10924. INC(level);
  10925. END;
  10926. END;
  10927. Basic.SegmentedNameToString(this, name);
  10928. prev := this;
  10929. END;
  10930. END;
  10931. WHILE 0 <= olevel DO
  10932. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10933. IF olevel > 0 THEN
  10934. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10935. nextPatch := scopes[olevel-1].patchAdr+1;
  10936. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10937. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10938. END;
  10939. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10940. DEC(olevel);
  10941. END;
  10942. level := 0;
  10943. WHILE (level < LEN(scopes)) DO
  10944. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  10945. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  10946. END;
  10947. INC(level);
  10948. END;
  10949. END Export;
  10950. BEGIN
  10951. NEW(fingerPrinter);
  10952. NEW(poolMap, 64);
  10953. (* 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 *)
  10954. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  10955. NEW(sectionArray, module.allSections.Length());
  10956. FOR i := 0 TO module.allSections.Length() - 1 DO
  10957. section := module.allSections.GetSection(i);
  10958. sectionArray[i] := section;
  10959. END;
  10960. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  10961. Export(sectionArray^);
  10962. END ExportDesc;
  10963. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  10964. VAR
  10965. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  10966. BEGIN
  10967. Info(source, "exception table offsets array descriptor");
  10968. size := 0;
  10969. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  10970. Info(source, "exception table content");
  10971. FOR i := 0 TO module.allSections.Length() - 1 DO
  10972. p := module.allSections.GetSection(i);
  10973. IF p.type = Sections.CodeSection THEN
  10974. finallyPC := p(IntermediateCode.Section).finally;
  10975. IF finallyPC>=0 THEN
  10976. Symbol( source, p, 0,0);
  10977. Symbol( source, p, finallyPC, 0);
  10978. Symbol( source, p, finallyPC,0);
  10979. INC(size);
  10980. END;
  10981. END
  10982. END;
  10983. PatchArray(source,sizePC,size);
  10984. END ExceptionArray;
  10985. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  10986. VAR i: LONGINT; ch: CHAR;
  10987. BEGIN
  10988. i := 0;
  10989. REPEAT
  10990. ch := name[i]; INC(i);
  10991. Char( section, ch);
  10992. UNTIL ch = 0X;
  10993. WHILE i < 32 DO
  10994. Char( section, 0X); INC(i);
  10995. END;
  10996. END Name;
  10997. PROCEDURE References(section: IntermediateCode.Section);
  10998. CONST
  10999. sfTypeNone = 0X;
  11000. sfTypeCHAR = 01X;
  11001. sfTypeCHAR8 = 02X;
  11002. sfTypeCHAR16 = 03X;
  11003. sfTypeCHAR32 = 04X;
  11004. sfTypeRANGE = 05X;
  11005. sfTypeSHORTINT = 06X;
  11006. sfTypeINTEGER = 07X;
  11007. sfTypeLONGINT = 08X;
  11008. sfTypeHUGEINT = 09X;
  11009. sfTypeWORD = 0AX;
  11010. sfTypeLONGWORD = 0BX;
  11011. sfTypeSIGNED8 = 0CX;
  11012. sfTypeSIGNED16 = 0DX;
  11013. sfTypeSIGNED32 = 0EX;
  11014. sfTypeSIGNED64 = 0FX;
  11015. sfTypeUNSIGNED8 = 10X;
  11016. sfTypeUNSIGNED16 = 11X;
  11017. sfTypeUNSIGNED32 = 12X;
  11018. sfTypeUNSIGNED64 = 13X;
  11019. sfTypeREAL = 14X;
  11020. sfTypeLONGREAL = 15X;
  11021. sfTypeCOMPLEX = 16X;
  11022. sfTypeLONGCOMPLEX = 17X;
  11023. sfTypeBOOLEAN = 18X;
  11024. sfTypeSET = 19X;
  11025. sfTypeANY = 1AX;
  11026. sfTypeOBJECT = 1BX;
  11027. sfTypeBYTE = 1CX;
  11028. sfTypeADDRESS = 1DX;
  11029. sfTypeSIZE = 1EX;
  11030. sfTypeIndirect = 1FX;
  11031. sfTypeRecord = 20X;
  11032. sfTypePointerToRecord = 21X;
  11033. sfTypePointerToArray = 22X;
  11034. sfTypeOpenArray = 23X;
  11035. sfTypeStaticArray = 24X;
  11036. sfTypeDynamicArray = 25X;
  11037. sfTypeMathStaticArray = 26X;
  11038. sfTypeMathOpenArray = 27X;
  11039. sfTypeMathTensor = 28X;
  11040. sfTypeDelegate = 29X;
  11041. sfTypeENUM = 2AX;
  11042. sfTypeCELL = 2BX;
  11043. sfTypePORT = 2CX;
  11044. sfIN = 0X;
  11045. sfOUT = 1X;
  11046. flagDelegate = 0;
  11047. flagConstructor = 1;
  11048. (* variable / parameter addressing modes *)
  11049. sfAbsolute = 0X; (* global vars *)
  11050. sfRelative = 1X; (* variables, value parameters *)
  11051. sfIndirect = 2X; (* var parameters *)
  11052. sfScopeBegin = 0F0X;
  11053. sfScopeEnd = 0F1X;
  11054. sfProcedure = 0F2X;
  11055. sfVariable = 0F3X;
  11056. sfTypeDeclaration = 0F4X;
  11057. sfModule = 0FFX;
  11058. RefInfo = TRUE;
  11059. VAR
  11060. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11061. indirectTypes: Basic.HashTable;
  11062. PROCEDURE CurrentIndex(): LONGINT;
  11063. VAR i: LONGINT;
  11064. BEGIN
  11065. FOR i := startPC TO section.pc -1 DO
  11066. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11067. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11068. END;
  11069. startPC := section.pc;
  11070. RETURN lastOffset;
  11071. END CurrentIndex;
  11072. (*
  11073. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11074. Module = sfModule prevSymbol:SIZE name:String Scope.
  11075. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11076. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11077. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11078. Type =
  11079. sfTypePointerToRecord
  11080. | sfTypePointerToArray Type
  11081. | sfTypeOpenArray Type
  11082. | sfTypeDynamicArray Type
  11083. | sfTypeStaticArray length:SIZE Type
  11084. | sfTypeMathOpenArray Type
  11085. | sfTypeMathStaticArray length:SIZE Type
  11086. | sfTypeMathTensor Type
  11087. | sfTypeRecord tdAdr:ADDRESS
  11088. | sfTypeDelegate {Parameter} return:Type
  11089. | sfTypePort (sfIN | sfOUT)
  11090. | sfTypeBOOLEAN
  11091. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11092. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11093. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11094. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11095. | sfTypeWORD | sfTypeLONGWORD
  11096. | sfTypeREAL | sfTypeLONGREAL
  11097. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11098. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11099. | sfTypeIndirect offset:SIZE.
  11100. *)
  11101. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11102. VAR offset: SIZE;
  11103. BEGIN
  11104. IF indirectTypes.Has(type) THEN
  11105. offset := indirectTypes.GetInt(type);
  11106. Char(section, sfTypeIndirect);
  11107. Size(section, offset);
  11108. RETURN TRUE;
  11109. ELSE
  11110. indirectTypes.PutInt(type, CurrentIndex());
  11111. RETURN FALSE;
  11112. END;
  11113. END Indirect;
  11114. PROCEDURE NType(type: SyntaxTree.Type);
  11115. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11116. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11117. BEGIN
  11118. IF type = NIL THEN
  11119. Char(section, sfTypeNone)
  11120. ELSE
  11121. type := type.resolved;
  11122. size := type.sizeInBits;
  11123. WITH type:SyntaxTree.PointerType DO
  11124. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11125. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11126. Char(section, sfTypePointerToRecord);
  11127. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11128. ELSE
  11129. IF RefInfo THEN Info(section,"PointerToArray") END;
  11130. Char(section, sfTypePointerToArray);
  11131. NType(type.pointerBase);
  11132. END;
  11133. | type: SyntaxTree.ArrayType DO
  11134. IF ~Indirect(type) THEN
  11135. IF type.form = SyntaxTree.Open THEN
  11136. IF RefInfo THEN Info(section,"OpenArray") END;
  11137. Char(section, sfTypeOpenArray);
  11138. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11139. IF RefInfo THEN Info(section,"DynamicArray") END;
  11140. Char(section, sfTypeDynamicArray);
  11141. ELSIF type.form = SyntaxTree.Static THEN
  11142. IF RefInfo THEN Info(section,"StaticArray") END;
  11143. Char(section, sfTypeStaticArray);
  11144. Size(section, type.staticLength);
  11145. ELSE
  11146. HALT(100);
  11147. END;
  11148. NType(type.arrayBase);
  11149. END;
  11150. | type: SyntaxTree.MathArrayType DO
  11151. IF ~Indirect(type) THEN
  11152. IF type.form = SyntaxTree.Open THEN
  11153. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11154. Char(section, sfTypeMathOpenArray);
  11155. ELSIF type.form = SyntaxTree.Static THEN
  11156. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11157. Char(section, sfTypeMathStaticArray);
  11158. Size(section, type.staticLength);
  11159. ELSIF type.form = SyntaxTree.Tensor THEN
  11160. IF RefInfo THEN Info(section,"MathTensor") END;
  11161. Char(section, sfTypeMathTensor);
  11162. ELSE
  11163. HALT(100);
  11164. END;
  11165. NType(type.arrayBase);
  11166. END;
  11167. | type: SyntaxTree.RecordType DO
  11168. IF ~Indirect(type) THEN
  11169. IF type.pointerType # NIL (* OBJECT *) THEN
  11170. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11171. Char(section, sfTypePointerToRecord)
  11172. ELSE
  11173. IF RefInfo THEN Info(section,"Record") END;
  11174. Char(section, sfTypeRecord);
  11175. td := type.typeDeclaration;
  11176. IF RefInfo THEN Info(section,"TD") END;
  11177. IF (td # NIL) THEN
  11178. Global.GetSymbolSegmentedName(td,segmentedName);
  11179. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11180. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11181. ELSE
  11182. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11183. END;
  11184. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11185. Symbol(section, tir, 0, offset);
  11186. ELSE
  11187. Address(section, 0);
  11188. END;
  11189. END;
  11190. END;
  11191. | type: SyntaxTree.CellType DO
  11192. IF ~Indirect(type) THEN
  11193. IF RefInfo THEN Info(section,"Record") END;
  11194. Char(section, sfTypeRecord);
  11195. td := type.typeDeclaration;
  11196. IF RefInfo THEN Info(section,"TD") END;
  11197. IF (td # NIL) THEN
  11198. Global.GetSymbolSegmentedName(td,segmentedName);
  11199. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11200. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11201. ELSE
  11202. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11203. END;
  11204. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11205. Symbol(section, tir, 0, offset);
  11206. ELSE
  11207. Address(section, 0);
  11208. END;
  11209. END;
  11210. | type: SyntaxTree.PortType DO
  11211. Char(section, sfTypePORT);
  11212. IF type.direction = SyntaxTree.OutPort THEN
  11213. Char(section, sfOUT)
  11214. ELSE
  11215. Char(section, sfIN)
  11216. END;
  11217. | type: SyntaxTree.ProcedureType DO
  11218. IF ~Indirect(type) THEN
  11219. Char(section, sfTypeDelegate);
  11220. parameter := type.firstParameter;
  11221. WHILE(parameter # NIL) DO
  11222. NParameter(parameter, -1);
  11223. parameter := parameter.nextParameter;
  11224. END;
  11225. NType(type.returnType);
  11226. END;
  11227. | type:SyntaxTree.EnumerationType DO
  11228. Char(section, sfTypeENUM);
  11229. | type: SyntaxTree.BasicType DO
  11230. WITH type: SyntaxTree.BooleanType DO
  11231. IF RefInfo THEN Info(section,"Boolean") END;
  11232. Char(section, sfTypeBOOLEAN);
  11233. | type: SyntaxTree.CharacterType DO
  11234. IF type = module.system.characterType THEN
  11235. IF RefInfo THEN Info(section,"CHAR") END;
  11236. Char(section, sfTypeCHAR);
  11237. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11238. IF RefInfo THEN Info(section,"CHAR8") END;
  11239. Char(section, sfTypeCHAR8)
  11240. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11241. IF RefInfo THEN Info(section,"CHAR16") END;
  11242. Char(section, sfTypeCHAR16);
  11243. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11244. IF RefInfo THEN Info(section,"CHAR32") END;
  11245. Char(section, sfTypeCHAR32);
  11246. ELSE
  11247. HALT(100);
  11248. END;
  11249. |type: SyntaxTree.IntegerType DO
  11250. IF type(SyntaxTree.IntegerType).signed THEN
  11251. IF (type = module.system.shortintType) THEN
  11252. IF RefInfo THEN Info(section,"SHORTINT") END;
  11253. Char(section, sfTypeSHORTINT)
  11254. ELSIF (type = module.system.integerType) THEN
  11255. IF RefInfo THEN Info(section,"INTEGER") END;
  11256. Char(section, sfTypeINTEGER)
  11257. ELSIF (type = module.system.longintType) THEN
  11258. IF RefInfo THEN Info(section,"LONGINT") END;
  11259. Char(section, sfTypeLONGINT)
  11260. ELSIF (type = module.system.hugeintType) THEN
  11261. IF RefInfo THEN Info(section,"HUGEINT") END;
  11262. Char(section, sfTypeHUGEINT)
  11263. ELSIF (type = module.system.wordType) THEN
  11264. IF RefInfo THEN Info(section,"WORD") END;
  11265. Char(section, sfTypeWORD)
  11266. ELSIF (type = module.system.longWordType) THEN
  11267. IF RefInfo THEN Info(section,"LONGWORD") END;
  11268. Char(section, sfTypeLONGWORD);
  11269. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11270. IF RefInfo THEN Info(section,"SIGNED8") END;
  11271. Char(section, sfTypeSIGNED8)
  11272. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11273. IF RefInfo THEN Info(section,"SIGNED16") END;
  11274. Char(section, sfTypeSIGNED16)
  11275. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11276. IF RefInfo THEN Info(section,"SIGNED32") END;
  11277. Char(section, sfTypeSIGNED32)
  11278. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11279. IF RefInfo THEN Info(section,"SIGNED64") END;
  11280. Char(section, sfTypeSIGNED64)
  11281. ELSE
  11282. HALT(100);
  11283. END
  11284. ELSE (* unsigned *)
  11285. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11286. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11287. Char(section, sfTypeUNSIGNED8)
  11288. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11289. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11290. Char(section, sfTypeUNSIGNED16)
  11291. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11292. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11293. Char(section, sfTypeUNSIGNED32)
  11294. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11295. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11296. Char(section, sfTypeUNSIGNED64)
  11297. ELSE
  11298. HALT(100)
  11299. END
  11300. END;
  11301. | type: SyntaxTree.FloatType DO
  11302. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11303. IF RefInfo THEN Info(section,"REAL") END;
  11304. Char(section, sfTypeREAL);
  11305. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11306. IF RefInfo THEN Info(section,"LONGREAL") END;
  11307. Char(section, sfTypeLONGREAL);
  11308. ELSE
  11309. HALT(100);
  11310. END;
  11311. |type: SyntaxTree.ComplexType DO
  11312. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11313. IF RefInfo THEN Info(section,"COMPLEX") END;
  11314. Char(section, sfTypeCOMPLEX);
  11315. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11316. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11317. Char(section, sfTypeLONGCOMPLEX);
  11318. ELSE
  11319. HALT(100);
  11320. END;
  11321. |type:SyntaxTree.SetType DO
  11322. IF RefInfo THEN Info(section,"SET") END;
  11323. Char(section, sfTypeSET);
  11324. |type:SyntaxTree.AnyType DO
  11325. IF RefInfo THEN Info(section,"ANY") END;
  11326. Char(section, sfTypeANY);
  11327. |type:SyntaxTree.ObjectType DO
  11328. IF RefInfo THEN Info(section,"OBJECT") END;
  11329. Char(section, sfTypeOBJECT);
  11330. |type:SyntaxTree.ByteType DO
  11331. IF RefInfo THEN Info(section,"BYTE") END;
  11332. Char(section, sfTypeBYTE);
  11333. |type:SyntaxTree.RangeType DO
  11334. IF RefInfo THEN Info(section,"RANGE") END;
  11335. Char(section, sfTypeRANGE)
  11336. |type:SyntaxTree.AddressType DO
  11337. IF RefInfo THEN Info(section,"ADDRESS") END;
  11338. Char(section, sfTypeADDRESS)
  11339. |type:SyntaxTree.SizeType DO
  11340. IF RefInfo THEN Info(section,"SIZE") END;
  11341. Char(section, sfTypeSIZE)
  11342. ELSE
  11343. HALT(100)
  11344. END;
  11345. ELSE HALT(101);
  11346. END;
  11347. END;
  11348. END NType;
  11349. (*
  11350. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11351. *)
  11352. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11353. VAR pos: LONGINT; type: SyntaxTree.Type;
  11354. BEGIN
  11355. IF RefInfo THEN Info(section, "Parameter") END;
  11356. Char(section, sfVariable);
  11357. Size(section, procOffset);
  11358. String0(section, parameter.name);
  11359. type := parameter.type.resolved;
  11360. IF parameter.kind = SyntaxTree.VarParameter THEN
  11361. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11362. ELSE Char(section, sfIndirect)
  11363. END;
  11364. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11365. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11366. Char(section, sfIndirect);
  11367. ELSE
  11368. Char(section, sfRelative);
  11369. END;
  11370. ELSE
  11371. Char(section, sfRelative);
  11372. END;
  11373. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11374. NType(parameter.type);
  11375. END NParameter;
  11376. (*
  11377. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11378. *)
  11379. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11380. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11381. flags: SET;
  11382. BEGIN
  11383. IF procedure.externalName # NIL THEN RETURN END;
  11384. IF RefInfo THEN Info(section, "Procedure") END;
  11385. pos := CurrentIndex();
  11386. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11387. Char(section, sfProcedure);
  11388. Size(section, scopeOffset);
  11389. String0(section,procedure.name);
  11390. s := module.allSections.FindBySymbol(procedure);
  11391. Symbol(section,s,0,0); (* start *)
  11392. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11393. flags := {};
  11394. IF procedureType.isDelegate THEN
  11395. INCL(flags, flagDelegate);
  11396. END;
  11397. IF procedure.isConstructor THEN
  11398. INCL(flags, flagConstructor);
  11399. END;
  11400. Set(section, flags);
  11401. IF RefInfo THEN Info(section, "Parameters") END;
  11402. parameter := procedureType.firstParameter;
  11403. WHILE(parameter # NIL) DO
  11404. NParameter(parameter, pos);
  11405. parameter := parameter.nextParameter;
  11406. END;
  11407. IF procedureType.returnParameter # NIL THEN
  11408. NParameter(procedureType.returnParameter, pos);
  11409. END;
  11410. IF procedureType.selfParameter # NIL THEN
  11411. NParameter(procedureType.selfParameter, pos);
  11412. END;
  11413. IF RefInfo THEN Info(section, "ReturnType") END;
  11414. NType(procedureType.returnType);
  11415. NScope(procedure.procedureScope, pos);
  11416. END NProcedure;
  11417. (*
  11418. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11419. *)
  11420. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11421. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11422. BEGIN
  11423. IF RefInfo THEN Info(section, "Variable") END;
  11424. pos := CurrentIndex();
  11425. Char(section, sfVariable);
  11426. Size(section, scopeOffset);
  11427. String0(section, variable.name);
  11428. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11429. Char(section, sfAbsolute);
  11430. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11431. NamedSymbol(section, sn,variable, 0,0);
  11432. ELSE
  11433. Char(section, sfRelative);
  11434. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11435. END;
  11436. NType(variable.type);
  11437. s := module.allSections.FindBySymbol(variable);
  11438. END NVariable;
  11439. (*
  11440. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11441. *)
  11442. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11443. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11444. BEGIN
  11445. IF typeDeclaration = NIL THEN RETURN END;
  11446. pos := CurrentIndex();
  11447. s := module.allSections.FindBySymbol(typeDeclaration);
  11448. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11449. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11450. Char(section, sfTypeDeclaration);
  11451. Size(section, scopeOffset);
  11452. String0(section, typeDeclaration.name);
  11453. declared := typeDeclaration.declaredType.resolved;
  11454. IF (declared IS SyntaxTree.PointerType) THEN
  11455. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11456. END;
  11457. WITH declared: SyntaxTree.RecordType DO
  11458. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11459. Symbol(section, s, 0, offset);
  11460. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11461. Basic.AppendToSegmentedName(name,".@Info");
  11462. s := module.allSections.FindByName(name);
  11463. IF s # NIL THEN (* does not work for coop *)
  11464. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11465. END;
  11466. NScope(declared.recordScope, pos);
  11467. |declared: SyntaxTree.CellType DO
  11468. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11469. Symbol(section, s, 0, offset);
  11470. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11471. Basic.AppendToSegmentedName(name,".@Info");
  11472. s := module.allSections.FindByName(name);
  11473. IF s # NIL THEN
  11474. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11475. END;
  11476. NScope(declared.cellScope, pos);
  11477. ELSE
  11478. Address(section, 0);
  11479. END;
  11480. END NTypeDeclaration;
  11481. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11482. VAR pos: LONGINT;
  11483. BEGIN
  11484. pos := CurrentIndex();
  11485. Char(section,sfModule);
  11486. Size(section, prevSymbol);
  11487. String0(section, module.name);
  11488. NScope(module.moduleScope, pos);
  11489. END NModule;
  11490. (*
  11491. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11492. *)
  11493. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11494. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11495. BEGIN
  11496. IF scope = NIL THEN RETURN END;
  11497. IF RefInfo THEN Info(section, "Scope") END;
  11498. Char(section, sfScopeBegin);
  11499. variable := scope.firstVariable;
  11500. WHILE (variable # NIL) DO
  11501. NVariable(variable, prevSymbol);
  11502. variable := variable.nextVariable;
  11503. END;
  11504. WITH scope: SyntaxTree.ModuleScope DO
  11505. bodyProcedure := scope.bodyProcedure;
  11506. |scope: SyntaxTree.RecordScope DO
  11507. bodyProcedure := scope.bodyProcedure;
  11508. ELSE
  11509. bodyProcedure := NIL;
  11510. END;
  11511. IF bodyProcedure # NIL THEN
  11512. NProcedure(bodyProcedure, prevSymbol)
  11513. END;
  11514. procedure := scope.firstProcedure;
  11515. WHILE procedure # NIL DO
  11516. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11517. procedure := procedure.nextProcedure;
  11518. END;
  11519. typeDeclaration := scope.firstTypeDeclaration;
  11520. WHILE typeDeclaration # NIL DO
  11521. NTypeDeclaration(typeDeclaration, prevSymbol);
  11522. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11523. END;
  11524. Char(section, sfScopeEnd); (* scope ends *)
  11525. END NScope;
  11526. BEGIN
  11527. NEW(indirectTypes, 32);
  11528. ArrayBlock(section,sizePC,"", FALSE);
  11529. startPC := section.pc;
  11530. NModule(module.module, -1);
  11531. PatchArray(section,sizePC,CurrentIndex());
  11532. END References;
  11533. (*
  11534. Command* = RECORD
  11535. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11536. name*: Name; (* name of the procedure *)
  11537. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11538. entryAdr* : ADDRESS; (* entry address of procedure *)
  11539. END;
  11540. *)
  11541. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11542. VAR
  11543. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11544. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11545. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11546. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11547. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11548. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11549. BEGIN
  11550. RETURN
  11551. (type = NIL) OR
  11552. (type.resolved IS SyntaxTree.RecordType) OR
  11553. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11554. (type.resolved IS SyntaxTree.AnyType);
  11555. END TypeAllowed;
  11556. BEGIN
  11557. numberParameters := procedureType.numberParameters;
  11558. RETURN
  11559. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11560. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11561. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11562. END GetProcedureAllowed;
  11563. PROCEDURE WriteType(type : SyntaxTree.Type);
  11564. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11565. name: Basic.SegmentedName; offset: LONGINT;
  11566. BEGIN
  11567. IF type = NIL THEN
  11568. Address(source,0);
  11569. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11570. Address(source,1);
  11571. ELSE
  11572. type := type.resolved;
  11573. IF type IS SyntaxTree.PointerType THEN
  11574. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11575. END;
  11576. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11577. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11578. name[0] := typeDeclaration.name; name[1] := -1;
  11579. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11580. ASSERT(section # NIL);
  11581. ELSE
  11582. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11583. (* TODO *)
  11584. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11585. END;
  11586. IF implementationVisitor.backend.cooperative THEN
  11587. offset := 0;
  11588. ELSE
  11589. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11590. END;
  11591. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11592. END;
  11593. END WriteType;
  11594. BEGIN
  11595. Info(source, "command array descriptor");
  11596. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11597. numberCommands := 0;
  11598. Info(source, "command array content");
  11599. FOR i := 0 TO module.allSections.Length() - 1 DO
  11600. p := module.allSections.GetSection(i);
  11601. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11602. procedure := p.symbol(SyntaxTree.Procedure);
  11603. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11604. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11605. procedure.GetName(name);
  11606. Name(source,name);
  11607. numberParameters := procedureType.numberParameters;
  11608. (* offset of type of first parameter *)
  11609. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11610. ELSE WriteType(procedureType.firstParameter.type)
  11611. END;
  11612. (* offset of type of return parameter *)
  11613. WriteType(procedureType.returnType);
  11614. (* command name *)
  11615. (* command code offset *)
  11616. Symbol(source,p,0,0);
  11617. INC(numberCommands);
  11618. IF Trace THEN
  11619. D.Ln;
  11620. END;
  11621. END;
  11622. END
  11623. END;
  11624. PatchArray(source,sizePC,numberCommands);
  11625. END CommandArray;
  11626. (* to prevent from double import of different module aliases *)
  11627. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11628. VAR i: SyntaxTree.Import;
  11629. BEGIN
  11630. i := module.module.moduleScope.firstImport;
  11631. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11632. i := i.nextImport;
  11633. END;
  11634. RETURN i = import
  11635. END IsFirstDirectOccurence;
  11636. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11637. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11638. BEGIN
  11639. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11640. ArrayBlock(source,pc,"", FALSE);
  11641. Info(source, "import module array data");
  11642. IF implementationVisitor.backend.cooperative THEN
  11643. offset := 0;
  11644. ELSE
  11645. IF module.system.addressType.sizeInBits = 64 THEN
  11646. (* change this when Heaps.HeapBlock is modified *)
  11647. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11648. ELSE
  11649. (* change this when Heaps.HeapBlock is modified *)
  11650. offset := ToMemoryUnits(module.system, 22* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11651. END;
  11652. END;
  11653. import := module.module.moduleScope.firstImport;
  11654. numberImports := 0;
  11655. WHILE import # NIL DO
  11656. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11657. Global.GetModuleSegmentedName(import.module,name);
  11658. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11659. NamedSymbol(source, name, NIL, 0, offset);
  11660. INC(numberImports);
  11661. END;
  11662. import := import.nextImport
  11663. END;
  11664. PatchArray(source,pc,numberImports);
  11665. END ImportsArray;
  11666. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11667. VAR
  11668. p: Sections.Section; sizePC, size, i: LONGINT;
  11669. BEGIN
  11670. Info(source, "Type info section");
  11671. size := 0;
  11672. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11673. FOR i := 0 TO module.allSections.Length() - 1 DO
  11674. p := module.allSections.GetSection(i);
  11675. WITH p: IntermediateCode.Section DO
  11676. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11677. Symbol(source,p,EmptyBlockOffset,0);
  11678. INC(size);
  11679. END;
  11680. END
  11681. END;
  11682. PatchArray(source,sizePC,size);
  11683. END TypeInfoSection;
  11684. (*
  11685. ProcTableEntry* = RECORD
  11686. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11687. noPtr*: LONGINT;
  11688. END;
  11689. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11690. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11691. *)
  11692. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11693. VAR
  11694. numberPointers: LONGINT;
  11695. procedure: SyntaxTree.Procedure;
  11696. BEGIN
  11697. Info(section,"pcFrom");
  11698. Symbol(section,procedureSection,0,0);
  11699. Info(section,"pcTo");
  11700. Symbol(section, procedureSection, procedureSection.pc, 0);
  11701. Info(section,"pointer to offsets array");
  11702. Symbol(section, section,section.pc+1,0);
  11703. Info(section,"offsets array");
  11704. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11705. PointerArray(section, procedure.procedureScope, numberPointers);
  11706. END ProcedureDescriptor;
  11707. (* only for tracing, the descriptor is otherwise not complete ! *)
  11708. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11709. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11710. BEGIN
  11711. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11712. name := procedureSection.name;
  11713. Basic.AppendToSegmentedName(name,".@Info");
  11714. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11715. Address(section,0);
  11716. Symbol(section,section,2,0);
  11717. (*
  11718. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11719. descSize: SIZE;
  11720. sentinel: ADDRESS; (* = MPO-4 *)
  11721. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11722. flags*: SET;
  11723. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11724. name*: Name;
  11725. END;
  11726. *)
  11727. Size(section, 0);
  11728. Address(section,0);
  11729. Address(section,0);
  11730. Set(section,{});
  11731. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); END;
  11732. moduleSection := ModuleSection();
  11733. Symbol( section, moduleSection, moduleSection.pc,0);
  11734. IF procedureSection.symbol = NIL THEN
  11735. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11736. ELSE
  11737. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11738. END;
  11739. Name(section, infoName);
  11740. Size(section, 0);
  11741. RETURN section;
  11742. END MakeProcedureDescriptorTag;
  11743. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11744. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11745. BEGIN
  11746. name := procedureSection.name;
  11747. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11748. IF implementationVisitor.backend.cooperative THEN
  11749. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11750. Info(section, "TypeDescriptor");
  11751. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11752. NamedSymbol(dest, name,NIL, 0, 0);
  11753. BaseRecord(dest);
  11754. offset := 0;
  11755. ELSIF CreateProcedureDescInfo THEN
  11756. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11757. Address(dest,0);
  11758. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11759. offset := dest.pc;
  11760. ELSE
  11761. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11762. END;
  11763. ProcedureDescriptor(dest, procedureSection);
  11764. Symbol(section, dest, offset, 0);
  11765. END ProcedureDescriptorPointer;
  11766. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11767. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11768. BEGIN
  11769. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11770. numberProcs := 0;
  11771. FOR i := 0 TO module.allSections.Length() - 1 DO
  11772. destination := module.allSections.GetSection(i);
  11773. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11774. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11775. INC(numberProcs);
  11776. END
  11777. END;
  11778. PatchArray(section, sizePC, numberProcs);
  11779. END ProcedureDescriptorArray;
  11780. (*
  11781. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11782. VAR
  11783. next*: Module; (** once a module is published, all fields are read-only *)
  11784. name*: Name;
  11785. init, published: BOOLEAN;
  11786. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11787. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11788. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11789. command*: POINTER TO ARRAY OF Command;
  11790. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11791. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11792. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11793. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11794. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11795. data*, code*: Bytes;
  11796. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11797. export*: ExportDesc;
  11798. term*: TerminationHandler;
  11799. exTable*: ExceptionTable;
  11800. noProcs*: LONGINT;
  11801. firstProc*: ADDRESS; <- done by loader
  11802. maxPtrs*: LONGINT;
  11803. crc*: LONGINT;
  11804. *)
  11805. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11806. BEGIN
  11807. Info(section, "cycle");
  11808. Size(section,0);
  11809. Info(section, "references");
  11810. Size(section,0);
  11811. Info(section, "nextMarked");
  11812. Address(section,0);
  11813. Info(section, "nextWatched");
  11814. Address(section,0);
  11815. END BasePointer;
  11816. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11817. BEGIN
  11818. BasePointer(section);
  11819. Info(section, "action");
  11820. Address(section,0);
  11821. Info(section, "monitor");
  11822. Address(section,0);
  11823. END BaseObject;
  11824. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11825. BEGIN
  11826. BasePointer(section);
  11827. Info(section, "action");
  11828. Address(section,0);
  11829. Info(section, "monitor");
  11830. Address(section,0);
  11831. END BaseRecord;
  11832. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11833. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11834. pooledName: Basic.SegmentedName;
  11835. symbol: SyntaxTree.Symbol;
  11836. BEGIN
  11837. Global.GetModuleName(module.module,name);
  11838. Strings.Append(name,".@Module.@Descriptor");
  11839. Basic.ToSegmentedName(name, pooledName);
  11840. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11841. Symbol(section,descriptorSection,0,0);
  11842. Info(descriptorSection, "descriptor");
  11843. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11844. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11845. Address(descriptorSection,0);
  11846. Global.GetModuleName(module.module,name);
  11847. Strings.Append(name,".@Trace");
  11848. Basic.ToSegmentedName(name, pooledName);
  11849. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11850. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11851. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11852. END ModuleDescriptor;
  11853. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11854. VAR name: ARRAY 128 OF CHAR;
  11855. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11856. symbol: SyntaxTree.Symbol;
  11857. BEGIN
  11858. ASSERT(implementationVisitor.backend.newObjectFile);
  11859. Global.GetModuleName(module.module,name);
  11860. Strings.Append(name,".@Module");
  11861. Basic.ToSegmentedName(name, pooledName);
  11862. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11863. moduleSection.SetExported(TRUE);
  11864. IF moduleSection.pc = 0 THEN
  11865. IF implementationVisitor.backend.cooperative THEN
  11866. Info(moduleSection, "descriptor");
  11867. ModuleDescriptor(moduleSection);
  11868. BaseObject(moduleSection);
  11869. implementationVisitor.CreateTraceModuleMethod(module.module);
  11870. ELSE
  11871. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11872. Info(moduleSection, "HeapBlock");
  11873. Symbol(moduleSection,moduleSection,2,0);
  11874. Info(moduleSection, "TypeDescriptor");
  11875. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11876. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11877. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11878. END;
  11879. END;
  11880. RETURN moduleSection;
  11881. END ModuleSection;
  11882. PROCEDURE NewModuleInfo();
  11883. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11884. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11885. sectionName: Basic.SectionName;
  11886. CONST MPO=-40000000H;
  11887. BEGIN
  11888. (*
  11889. TypeDesc* = POINTER TO RECORD
  11890. descSize: SIZE;
  11891. sentinel: LONGINT; (* = MPO-4 *)
  11892. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11893. flags*: SET;
  11894. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11895. name*: Name;
  11896. refsOffset: SIZE;
  11897. END;
  11898. *)
  11899. (*name is missing prefixes sometimes*)
  11900. Global.GetModuleSegmentedName(module.module,name);
  11901. Basic.AppendToSegmentedName(name,".@Info");
  11902. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  11903. IF ~implementationVisitor.backend.cooperative THEN
  11904. Info(source, "HeapBlock");
  11905. Address(source,0); (* an empty heap block prevents GC marking *)
  11906. Info(source, "TypeDescriptor");
  11907. Address(source,0);
  11908. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  11909. END;
  11910. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  11911. Address(source,MPO-4);
  11912. Info(source, "type tag pointer");
  11913. Address( source,0);
  11914. Info(source, "type flags");
  11915. flags := {};
  11916. Set( source, flags);
  11917. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  11918. Info(source, "pointer to module");
  11919. moduleSection := ModuleSection();
  11920. Symbol( source, moduleSection, moduleSection.pc,0);
  11921. Info(source, "type name");
  11922. i := 0;
  11923. sectionName := "@Self";
  11924. (*
  11925. Global.GetSymbolSegmentedName(td,name);
  11926. Basic.SegmentedNameToString(name, sectionName);
  11927. *)
  11928. Name(source,sectionName);
  11929. source.SetReferenced(FALSE);
  11930. patchInfoPC := source.pc;
  11931. Size(source, 0);
  11932. END NewModuleInfo;
  11933. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  11934. VAR
  11935. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  11936. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  11937. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  11938. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  11939. referenceSectionOffset : LONGINT;
  11940. name: Basic.SegmentedName; offset: LONGINT;
  11941. flags: SET;
  11942. BEGIN
  11943. NewModuleInfo();
  11944. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  11945. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  11946. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  11947. ImportsArray(importSection);
  11948. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  11949. CommandArray(commandsSection);
  11950. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  11951. ExceptionArray(exceptionSection);
  11952. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  11953. AddPointer(typeInfoSection, typeInfoSectionOffset);
  11954. TypeInfoSection(typeInfoSection);
  11955. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  11956. referenceSection.SetExported(TRUE);
  11957. References(referenceSection);
  11958. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  11959. ProcedureDescriptorArray(procTableSection, numberProcs);
  11960. IF ProtectModulesPointers THEN
  11961. name := "Heaps.AnyPtr";
  11962. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  11963. (* set base pointer *)
  11964. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  11965. END;
  11966. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  11967. ArrayBlock(emptyArraySection,temp,"", FALSE);
  11968. moduleSection := ModuleSection();
  11969. Info(moduleSection, "nextRoot*: RootObject");
  11970. Address(moduleSection,0);
  11971. Info(moduleSection, "next*: Module");
  11972. Address(moduleSection,0);
  11973. Info(moduleSection, "name*: Name");
  11974. Name(moduleSection,moduleName);
  11975. Info(moduleSection, "init, published: BOOLEAN");
  11976. Boolean(moduleSection,FALSE);
  11977. Boolean(moduleSection,FALSE);
  11978. Info(moduleSection,"filler"); (*! introduce alignment! *)
  11979. Boolean(moduleSection,FALSE);
  11980. Boolean(moduleSection,FALSE);
  11981. Info(moduleSection, "refcnt*: LONGINT");
  11982. Longint(moduleSection,0);
  11983. Info(moduleSection, "sb*: ADDRESS");
  11984. Address(moduleSection,0);
  11985. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  11986. Address(moduleSection,0);
  11987. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  11988. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  11989. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  11990. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  11991. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  11992. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  11993. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  11994. Symbol(moduleSection,importSection,importSectionOffset,0);
  11995. Info(moduleSection, "procTable*: ProcTable");
  11996. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  11997. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  11998. Address(moduleSection,0);
  11999. Address(moduleSection,0);
  12000. Address(moduleSection,0);
  12001. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12002. Info(moduleSection, "export*: ExportDesc");
  12003. ExportDesc(moduleSection);
  12004. Info(moduleSection, "term*: TerminationHandler");
  12005. Address(moduleSection,0);
  12006. Info(moduleSection, "exTable*: ExceptionTable");
  12007. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12008. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12009. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12010. Info(moduleSection, "crc*: LONGINT");
  12011. patchCRC:= moduleSection.pc;
  12012. Longint(moduleSection, 0); (*! must be implemented *)
  12013. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12014. Info(moduleSection, "body*: ADDRESS");
  12015. Symbol(moduleSection, bodyProc, 0,0);
  12016. Info(moduleSection, "module flags");
  12017. flags := {};
  12018. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12019. Set( moduleSection, flags);
  12020. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END;
  12021. IF implementationVisitor.backend.cooperative THEN
  12022. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12023. Info(moduleSection, "monitor.owner");
  12024. Address(moduleSection,0);
  12025. Info(moduleSection, "monitor.nestingLevel");
  12026. Address(moduleSection,0);
  12027. Info(moduleSection, "monitor.blockedQueue");
  12028. Address(moduleSection,0); Address(moduleSection,0);
  12029. Info(moduleSection, "monitor.waitingQueue");
  12030. Address(moduleSection,0); Address(moduleSection,0);
  12031. Info(moduleSection, "monitor.waitingSentinel");
  12032. Address(moduleSection,0);
  12033. END;
  12034. END Module;
  12035. PROCEDURE PatchCRC(crc: LONGINT);
  12036. BEGIN
  12037. IF implementationVisitor.newObjectFile & ~simple THEN
  12038. PatchLongint(ModuleSection(), patchCRC, crc);
  12039. END;
  12040. END PatchCRC;
  12041. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12042. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12043. BEGIN
  12044. ArrayBlock(source,pc,"",FALSE);
  12045. Info(source, "pointer offsets array data");
  12046. IF scope IS SyntaxTree.RecordScope THEN
  12047. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12048. ELSIF scope IS SyntaxTree.CellScope THEN
  12049. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12050. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12051. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12052. WHILE variable # NIL DO
  12053. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12054. symbol := module.allSections.FindBySymbol(variable);
  12055. ASSERT(symbol # NIL);
  12056. Pointers(0,symbol, source,variable.type,numberPointers);
  12057. END;
  12058. variable := variable.nextVariable;
  12059. END;
  12060. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12061. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12062. WHILE parameter # NIL DO
  12063. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12064. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12065. END;
  12066. parameter := parameter.nextParameter;
  12067. END;
  12068. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12069. parametersSize := ProcedureParametersSize(module.system,scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12070. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12071. IF implementationVisitor.backend.preciseGC THEN
  12072. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12073. END;
  12074. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12075. END;
  12076. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12077. WHILE(variable # NIL) DO
  12078. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12079. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12080. END;
  12081. variable := variable.nextVariable
  12082. END;
  12083. END;
  12084. PatchArray(source,pc,numberPointers);
  12085. END PointerArray;
  12086. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12087. VAR
  12088. name: Basic.SegmentedName;
  12089. section: IntermediateCode.Section;
  12090. BEGIN
  12091. ASSERT(implementationVisitor.newObjectFile);
  12092. Global.GetSymbolSegmentedName(symbol,name);
  12093. Basic.AppendToSegmentedName(name,suffix);
  12094. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12095. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12096. Info(section, "HeapBlock");
  12097. Address(section,0); (* empty such that GC does not go on traversing *)
  12098. Info(section, suffix);
  12099. Address(section,0);
  12100. pc := section.pc;
  12101. RETURN section;
  12102. END SymbolSection;
  12103. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12104. VAR recordType: SyntaxTree.RecordType;
  12105. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12106. section: Sections.Section; cellType: SyntaxTree.CellType;
  12107. tdInfoOffset: LONGINT;
  12108. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12109. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12110. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12111. sectionName: Basic.SectionName;
  12112. CONST MPO=-40000000H;
  12113. BEGIN
  12114. (*
  12115. TypeDesc* = POINTER TO RECORD
  12116. descSize: SIZE;
  12117. sentinel: LONGINT; (* = MPO-4 *)
  12118. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12119. flags*: SET;
  12120. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12121. name*: Name;
  12122. refsOffset: SIZE;
  12123. END;
  12124. *)
  12125. (* source := module.sections.FindByName(...) *)
  12126. Global.GetSymbolSegmentedName(td,name);
  12127. Basic.AppendToSegmentedName(name,".@Info");
  12128. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12129. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12130. Address(source,0);
  12131. Info(source, "TypeDescriptor");
  12132. Address(source,0);
  12133. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12134. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12135. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12136. Info(source, "type tag pointer");
  12137. Symbol( source, tag, offset, 0);
  12138. Info(source, "type flags");
  12139. flags := {};
  12140. IF isProtected THEN INCL(flags,31) END;
  12141. Set( source, flags);
  12142. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  12143. Info(source, "pointer to module");
  12144. moduleSection := ModuleSection();
  12145. Symbol( source, moduleSection, moduleSection.pc,0);
  12146. Info(source, "type name");
  12147. i := 0;
  12148. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12149. (*
  12150. Global.GetSymbolSegmentedName(td,name);
  12151. Basic.SegmentedNameToString(name, sectionName);
  12152. *)
  12153. Name(source,sectionName);
  12154. source.SetReferenced(FALSE);
  12155. Size(source, 0);
  12156. RETURN source;
  12157. END NewTypeDescriptorInfo;
  12158. PROCEDURE NewTypeDescriptor;
  12159. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12160. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12161. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12162. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12163. CONST MPO=-40000000H;
  12164. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12165. VAR i: LONGINT;
  12166. PROCEDURE Td(record: SyntaxTree.RecordType);
  12167. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12168. BEGIN
  12169. IF record # NIL THEN
  12170. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12171. baseTD := record.typeDeclaration;
  12172. Global.GetSymbolSegmentedName(baseTD,name);
  12173. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12174. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12175. ELSE
  12176. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12177. END;
  12178. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12179. Symbol(source, tir, 0, offset);
  12180. IF reverse THEN Td(record.GetBaseRecord()) END;
  12181. END;
  12182. END Td;
  12183. BEGIN
  12184. Info(source, "tag table");
  12185. baseRecord := recordType;
  12186. i := 0;
  12187. WHILE baseRecord # NIL DO
  12188. INC(i);
  12189. baseRecord := baseRecord.GetBaseRecord();
  12190. END;
  12191. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12192. IF ~reverse THEN Td(recordType) END;
  12193. WHILE i < size DO
  12194. Address(source,0);
  12195. INC(i);
  12196. END;
  12197. IF reverse THEN Td(recordType) END;
  12198. END TdTable;
  12199. PROCEDURE MethodTable(reverse: BOOLEAN);
  12200. VAR i,methods: LONGINT;
  12201. BEGIN
  12202. Info(source, "method table");
  12203. IF recordType # NIL THEN
  12204. methods := recordType.recordScope.numberMethods;
  12205. IF reverse THEN
  12206. FOR i := methods-1 TO 0 BY -1 DO
  12207. procedure := recordType.recordScope.FindMethod(i);
  12208. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12209. NamedSymbol(source, name,procedure, 0,0);
  12210. END;
  12211. ELSE
  12212. FOR i := 0 TO methods-1 DO
  12213. procedure := recordType.recordScope.FindMethod(i);
  12214. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12215. NamedSymbol(source, name,procedure, 0,0);
  12216. END;
  12217. END;
  12218. END;
  12219. END MethodTable;
  12220. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12221. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12222. BEGIN
  12223. Info(source, "method table");
  12224. baseRecord := recordType;
  12225. WHILE baseRecord.baseType # NIL DO
  12226. baseRecord := baseRecord.GetBaseRecord ();
  12227. END;
  12228. GetRecordTypeName (baseRecord, name);
  12229. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12230. IF name = stackFrame THEN
  12231. start := 0;
  12232. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12233. baseRecord := recordType;
  12234. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12235. baseRecord := baseRecord.GetBaseRecord ();
  12236. END;
  12237. IF baseRecord # NIL THEN
  12238. GetRecordTypeName (baseRecord, name);
  12239. IF pointer & ~baseRecord.isObject THEN
  12240. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12241. END;
  12242. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12243. ELSIF recordType.isObject THEN
  12244. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12245. ELSIF pointer THEN
  12246. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12247. ELSE
  12248. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12249. END;
  12250. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12251. Symbol(source, tir, 0, 0);
  12252. start := 0;
  12253. baseRecord := recordType;
  12254. WHILE (baseRecord # NIL) DO
  12255. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12256. baseRecord := baseRecord.GetBaseRecord ();
  12257. END;
  12258. ELSE
  12259. (* explicit trace method: *)
  12260. procedure := recordType.recordScope.FindMethod(0);
  12261. IF ~procedure.isFinalizer THEN
  12262. Global.GetSymbolSegmentedName(procedure, name);
  12263. NamedSymbol(source, name,procedure, 0,0);
  12264. END;
  12265. start := 1;
  12266. END;
  12267. IF (name # stackFrame) & recordType.isObject THEN
  12268. baseRecord := recordType;
  12269. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12270. baseRecord := baseRecord.GetBaseRecord ();
  12271. END;
  12272. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12273. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12274. ELSE
  12275. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12276. END;
  12277. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12278. Symbol(source, tir, 0, 0);
  12279. END;
  12280. methods := recordType.recordScope.numberMethods;
  12281. FOR i := start TO methods-1 DO
  12282. procedure := recordType.recordScope.FindMethod(i);
  12283. IF ~procedure.isFinalizer THEN
  12284. Global.GetSymbolSegmentedName(procedure, name);
  12285. NamedSymbol(source, name,procedure, 0,0);
  12286. END;
  12287. END;
  12288. END CooperativeMethodTable;
  12289. BEGIN
  12290. Global.GetSymbolSegmentedName(td,name);
  12291. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12292. source.SetExported(IsExported(td));
  12293. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12294. IF implementationVisitor.backend.cooperative THEN
  12295. base := NIL;
  12296. baseRecord := recordType.GetBaseRecord();
  12297. IF baseRecord # NIL THEN
  12298. baseTD := baseRecord.typeDeclaration;
  12299. END;
  12300. IF ~recordType.isObject THEN
  12301. Info(source, "parent");
  12302. IF baseRecord # NIL THEN
  12303. Global.GetSymbolSegmentedName(baseTD,name);
  12304. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12305. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12306. ELSE
  12307. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12308. END;
  12309. Symbol(source, tir, 0, 0);
  12310. ELSE
  12311. Address(source,0);
  12312. END;
  12313. Info(source, "record size");
  12314. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12315. source.SetReferenced(FALSE);
  12316. CooperativeMethodTable(FALSE);
  12317. base := source;
  12318. Global.GetSymbolSegmentedName(td,name);
  12319. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12320. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12321. source.SetExported(IsExported(td));
  12322. source.SetReferenced(FALSE);
  12323. END;
  12324. Info(source, "parent");
  12325. IF baseRecord # NIL THEN
  12326. Global.GetSymbolSegmentedName(baseTD,name);
  12327. sym := baseTD;
  12328. IF ~recordType.isObject THEN
  12329. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12330. sym := NIL;
  12331. END;
  12332. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12333. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12334. ELSE
  12335. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12336. END;
  12337. Symbol(source, tir, 0, 0);
  12338. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12339. Address(source,0);
  12340. ELSE
  12341. IF recordType.isObject THEN
  12342. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12343. ELSE
  12344. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12345. END;
  12346. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12347. Symbol(source, tir, 0, 0);
  12348. END;
  12349. Info(source, "base record descriptor");
  12350. Symbol(source, base, 0, 0);
  12351. CooperativeMethodTable(TRUE);
  12352. source.SetReferenced(FALSE);
  12353. IF recordType.hasPointers THEN
  12354. IF ~HasExplicitTraceMethod (recordType) THEN
  12355. implementationVisitor.CreateTraceMethod(recordType);
  12356. END;
  12357. implementationVisitor.CreateResetProcedure(recordType);
  12358. implementationVisitor.CreateAssignProcedure(recordType);
  12359. END;
  12360. ELSIF ~simple THEN
  12361. (*
  12362. MethodEnd = MPO
  12363. ---
  12364. methods (# methods)
  12365. ---
  12366. tags (16)
  12367. ---
  12368. TypeDesc = TypeInfoAdr
  12369. ---
  12370. td adr ---> rec size
  12371. ----
  12372. pointer offsets
  12373. ----
  12374. (padding)
  12375. -----
  12376. empty [2 addresses aligned]
  12377. empty
  12378. empty
  12379. numPtrs
  12380. ---
  12381. pointer offsets
  12382. ---
  12383. *)
  12384. Info(source, "MethodEnd = MPO");
  12385. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12386. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12387. MethodTable(TRUE);
  12388. TdTable(TypeTags, TRUE);
  12389. Info(source, "type descriptor info pointer");
  12390. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12391. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12392. IF (cellType # NIL) THEN
  12393. IF cellType.sizeInBits < 0 THEN
  12394. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12395. END;
  12396. Info(source, "cell size");
  12397. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12398. ELSE
  12399. Info(source, "record size");
  12400. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12401. END;
  12402. Info(source, "pointer offsets pointer");
  12403. padding := 1- source.pc MOD 2;
  12404. Symbol(source, source, source.pc+1+padding,0);
  12405. IF padding >0 THEN
  12406. Info(source, "padding");
  12407. FOR i := 1 TO padding DO Address(source,0) END;
  12408. END;
  12409. IF cellType # NIL THEN
  12410. PointerArray(source, cellType.cellScope, numberPointers);
  12411. ELSE
  12412. PointerArray(source, recordType.recordScope, numberPointers);
  12413. END;
  12414. ELSE
  12415. (*
  12416. simple:
  12417. td adr --> size
  12418. tag(1)
  12419. tag(2)
  12420. tag(3)
  12421. methods ->
  12422. *)
  12423. Info(source, "record size");
  12424. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12425. TdTable(TypeTags, FALSE);
  12426. MethodTable(FALSE);
  12427. source.SetReferenced(FALSE);
  12428. END;
  12429. END NewTypeDescriptor;
  12430. BEGIN
  12431. x := x.resolved;
  12432. IF (x IS SyntaxTree.PointerType) THEN
  12433. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12434. END;
  12435. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12436. recordType := x(SyntaxTree.RecordType);
  12437. td := x.typeDeclaration;
  12438. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12439. ASSERT(td # NIL);
  12440. section := module.allSections.FindBySymbol(td); (* TODO *)
  12441. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12442. IF implementationVisitor.newObjectFile THEN
  12443. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12444. NewTypeDescriptor
  12445. END;
  12446. ELSE
  12447. (* data section in intermediate code *)
  12448. Global.GetSymbolSegmentedName(td,name);
  12449. Basic.SuffixSegmentedName (name, Basic.MakeString("@"));
  12450. Basic.SuffixSegmentedName (name, module.module.name);
  12451. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,implementationVisitor.dump # NIL);
  12452. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),0);
  12453. tir.Emit(Data(Basic.invalidPosition,op));
  12454. END;
  12455. END;
  12456. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12457. cellType := x(SyntaxTree.CellType);
  12458. td := x.typeDeclaration;
  12459. section := module.allSections.FindBySymbol(td); (* TODO *)
  12460. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12461. IF implementationVisitor.newObjectFile THEN
  12462. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12463. NewTypeDescriptor
  12464. END;
  12465. END;
  12466. END;
  12467. END
  12468. END CheckTypeDeclaration
  12469. END MetaDataGenerator;
  12470. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12471. VAR
  12472. trace-: BOOLEAN;
  12473. traceString-: SyntaxTree.IdentifierString;
  12474. traceModuleName-: SyntaxTree.IdentifierString;
  12475. newObjectFile-: BOOLEAN;
  12476. profile-: BOOLEAN;
  12477. noRuntimeChecks: BOOLEAN;
  12478. simpleMetaData-: BOOLEAN;
  12479. noAsserts: BOOLEAN;
  12480. optimize-: BOOLEAN;
  12481. cooperative-: BOOLEAN;
  12482. preregisterStatic-: BOOLEAN;
  12483. dump-: Basic.Writer;
  12484. cellsAreObjects: BOOLEAN;
  12485. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12486. experiment: BOOLEAN;
  12487. PROCEDURE &InitIntermediateBackend*;
  12488. BEGIN
  12489. simpleMetaData := FALSE;
  12490. newObjectFile := FALSE;
  12491. InitBackend;
  12492. SetRuntimeModuleName(DefaultRuntimeModuleName);
  12493. SetTraceModuleName(DefaultTraceModuleName);
  12494. END InitIntermediateBackend;
  12495. (* must be overwritten by actual backend, if parameter registers should be used *)
  12496. PROCEDURE NumberParameterRegisters*(callingConvention: SyntaxTree.CallingConvention): SIZE;
  12497. BEGIN
  12498. RETURN 0; (* default case: no parameter registers *)
  12499. END NumberParameterRegisters;
  12500. (* must be overwritten by actual backend, if parameter registers should be used *)
  12501. PROCEDURE ParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; index: LONGINT): LONGINT;
  12502. BEGIN
  12503. HALT(100); (* abstract *)
  12504. END ParameterRegister;
  12505. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12506. VAR
  12507. declarationVisitor: DeclarationVisitor;
  12508. implementationVisitor: ImplementationVisitor;
  12509. module: Sections.Module;
  12510. name, platformName: SyntaxTree.IdentifierString;
  12511. meta: MetaDataGenerator;
  12512. crc: CRC.CRC32Stream;
  12513. BEGIN
  12514. ResetError;
  12515. Global.GetSymbolName(x,name);
  12516. NEW(module,x,system); (* backend structures *)
  12517. Global.GetModuleName(x, name);
  12518. module.SetModuleName(name);
  12519. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, runtimeModuleName, SELF, newObjectFile);
  12520. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12521. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12522. declarationVisitor.Module(x,module);
  12523. IF newObjectFile & ~meta.simple THEN
  12524. meta.Module(implementationVisitor.moduleBodySection);
  12525. END;
  12526. GetDescription(platformName);
  12527. module.SetPlatformName(platformName);
  12528. IF newObjectFile THEN
  12529. NEW(crc);
  12530. module.allSections.WriteRaw(crc);
  12531. crc.Update;
  12532. meta.PatchCRC(crc.GetCRC());
  12533. END;
  12534. RETURN module
  12535. END GenerateIntermediate;
  12536. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12537. BEGIN RETURN TRUE
  12538. END SupportedImmediate;
  12539. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12540. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12541. END ProcessSyntaxTreeModule;
  12542. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12543. VAR
  12544. result: Sections.Module;
  12545. traceName: Basic.MessageString;
  12546. BEGIN
  12547. ASSERT(intermediateCodeModule IS Sections.Module);
  12548. result := intermediateCodeModule(Sections.Module);
  12549. IF trace THEN
  12550. traceName := "intermediate code trace: ";
  12551. Strings.Append(traceName,traceString);
  12552. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12553. IF (traceString="") OR (traceString="*") THEN
  12554. result.Dump(dump);
  12555. dump.Update
  12556. ELSE
  12557. Sections.DumpFiltered(dump, result, traceString);
  12558. END
  12559. END;
  12560. RETURN result
  12561. END ProcessIntermediateCodeModule;
  12562. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12563. BEGIN instructionSet := "Intermediate";
  12564. END GetDescription;
  12565. PROCEDURE SetNewObjectFile*(newObjectFile: BOOLEAN; simpleMetaData: BOOLEAN);
  12566. BEGIN
  12567. SELF.newObjectFile := newObjectFile;
  12568. SELF.simpleMetaData := simpleMetaData;
  12569. END SetNewObjectFile;
  12570. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12571. BEGIN COPY(name, traceModuleName)
  12572. END SetTraceModuleName;
  12573. PROCEDURE DefineOptions*(options: Options.Options);
  12574. BEGIN
  12575. DefineOptions^(options);
  12576. options.Add(0X,"trace",Options.String);
  12577. options.Add(0X,"runtime",Options.String);
  12578. options.Add(0X,"newObjectFile",Options.Flag);
  12579. options.Add(0X,"traceModule",Options.String);
  12580. options.Add(0X,"profile",Options.Flag);
  12581. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12582. options.Add(0X,"noAsserts",Options.Flag);
  12583. options.Add(0X,"metaData",Options.String);
  12584. options.Add('o',"optimize", Options.Flag);
  12585. options.Add(0X,"preregisterStatic", Options.Flag);
  12586. options.Add(0X,"cellsAreObjects", Options.Flag);
  12587. options.Add(0X,"preciseGC", Options.Flag);
  12588. options.Add(0X,"trackLeave", Options.Flag);
  12589. options.Add(0X,"writeBarriers", Options.Flag);
  12590. options.Add(0X,"experiment", Options.Flag);
  12591. END DefineOptions;
  12592. PROCEDURE GetOptions*(options: Options.Options);
  12593. VAR name,string: SyntaxTree.IdentifierString;
  12594. BEGIN
  12595. GetOptions^(options);
  12596. trace := options.GetString("trace",traceString);
  12597. profile := options.GetFlag("profile");
  12598. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12599. noAsserts := options.GetFlag("noAsserts");
  12600. cooperative := options.GetFlag("cooperative");
  12601. IF options.GetFlag("newObjectFile") THEN newObjectFile := TRUE;
  12602. IF cooperative THEN
  12603. SetRuntimeModuleName("CPU") END
  12604. END;
  12605. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12606. simpleMetaData := TRUE
  12607. END;
  12608. IF options.GetString("metaData",string) THEN
  12609. IF string = "simple" THEN simpleMetaData := TRUE
  12610. ELSIF string ="full" THEN simpleMetaData := FALSE
  12611. END;
  12612. END;
  12613. IF options.GetString("runtime",name) THEN SetRuntimeModuleName(name) END;
  12614. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12615. optimize := options.GetFlag("optimize");
  12616. preregisterStatic := options.GetFlag("preregisterStatic");
  12617. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12618. preciseGC := options.GetFlag("preciseGC");
  12619. trackLeave := options.GetFlag("trackLeave");
  12620. writeBarriers := options.GetFlag("writeBarriers");
  12621. experiment := options.GetFlag("experiment");
  12622. END GetOptions;
  12623. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12624. BEGIN RETURN SymbolFileFormat.Get()
  12625. END DefaultSymbolFileFormat;
  12626. END IntermediateBackend;
  12627. (* ----------------------------------- register allocation ------------------------------------- *)
  12628. (* register mapping scheme
  12629. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12630. spill offset
  12631. part(n) --> ticket <--> physical register
  12632. spill offset
  12633. *)
  12634. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12635. emptyOperand: IntermediateCode.Operand;
  12636. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12637. statCoopResetVariables: LONGINT;
  12638. statCoopModifyAssignments: LONGINT;
  12639. modifyAssignmentsPC : LONGINT;
  12640. statCoopNilCheck: LONGINT;
  12641. statCoopSwitch: LONGINT;
  12642. statCoopAssignProcedure: LONGINT;
  12643. statCoopTraceMethod: LONGINT;
  12644. statCoopResetProcedure: LONGINT;
  12645. statCoopTraceModule: LONGINT;
  12646. PROCEDURE ResetStatistics*;
  12647. BEGIN
  12648. statCoopResetVariables := 0;
  12649. statCoopModifyAssignments := 0;
  12650. statCoopNilCheck:= 0;
  12651. statCoopSwitch:= 0;
  12652. statCoopAssignProcedure:= 0;
  12653. statCoopTraceMethod:= 0;
  12654. statCoopResetProcedure:= 0;
  12655. statCoopTraceModule:= 0;
  12656. END ResetStatistics;
  12657. PROCEDURE Statistics*;
  12658. BEGIN
  12659. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12660. TRACE(statCoopNilCheck, statCoopSwitch);
  12661. TRACE(statCoopAssignProcedure,
  12662. statCoopTraceMethod,
  12663. statCoopResetProcedure,
  12664. statCoopTraceModule)
  12665. END Statistics;
  12666. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12667. VAR h: LONGINT;
  12668. BEGIN
  12669. WHILE b # 0 DO
  12670. h := a MOD b;
  12671. a := b;
  12672. b := h;
  12673. END;
  12674. RETURN a
  12675. END GCD;
  12676. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12677. BEGIN
  12678. RETURN a*b DIV GCD(a,b)
  12679. END SCM;
  12680. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12681. BEGIN
  12682. (*TRACE(a,b);*)
  12683. IF a = 0 THEN RETURN b
  12684. ELSIF b = 0 THEN RETURN a
  12685. ELSE RETURN SCM(a,b)
  12686. END;
  12687. END CommonAlignment;
  12688. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter): BOOLEAN;
  12689. BEGIN
  12690. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12691. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12692. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12693. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12694. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & SysvABIorWINAPI(parameter.ownerType(SyntaxTree.ProcedureType).callingConvention)
  12695. END
  12696. END PassBySingleReference;
  12697. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter): BOOLEAN;
  12698. BEGIN
  12699. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter)
  12700. END PassInRegister;
  12701. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12702. VAR new: RegisterEntry;
  12703. BEGIN
  12704. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12705. IF queue = NIL THEN
  12706. queue := new
  12707. ELSE
  12708. new.next := queue;
  12709. IF queue#NIL THEN queue.prev := new END;
  12710. queue := new
  12711. END;
  12712. END AddRegisterEntry;
  12713. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12714. VAR this: RegisterEntry;
  12715. BEGIN
  12716. this := queue;
  12717. WHILE (this # NIL) & (this.register # register) DO
  12718. this := this.next;
  12719. END;
  12720. IF this = NIL THEN
  12721. RETURN FALSE
  12722. END;
  12723. ASSERT(this # NIL);
  12724. IF this = queue THEN queue := queue.next END;
  12725. IF this.prev # NIL THEN this.prev.next := this.next END;
  12726. IF this.next # NIL THEN this.next.prev := this.prev END;
  12727. RETURN TRUE
  12728. END RemoveRegisterEntry;
  12729. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12730. BEGIN ASSERT(cond);
  12731. END Assert;
  12732. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12733. BEGIN
  12734. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12735. END ReusableRegister;
  12736. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12737. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12738. BEGIN
  12739. procedure := moduleScope.bodyProcedure;
  12740. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12741. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12742. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12743. procedure.SetScope(moduleScope);
  12744. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12745. procedure.SetAccess(SyntaxTree.Hidden);
  12746. moduleScope.SetBodyProcedure(procedure);
  12747. moduleScope.AddProcedure(procedure);
  12748. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12749. END;
  12750. END EnsureBodyProcedure;
  12751. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12752. VAR import: SyntaxTree.Import;
  12753. selfName: SyntaxTree.IdentifierString;
  12754. module: SyntaxTree.Module;
  12755. BEGIN
  12756. scope.ownerModule.GetName(selfName);
  12757. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12758. module := scope.ownerModule
  12759. ELSE
  12760. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12761. IF import = NIL THEN
  12762. RETURN NIL
  12763. ELSIF import.module = NIL THEN
  12764. RETURN NIL
  12765. ELSE module := import.module
  12766. END;
  12767. END;
  12768. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12769. END GetSymbol;
  12770. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12771. BEGIN
  12772. op.mode := mode;
  12773. IntermediateCode.InitOperand(op.op);
  12774. IntermediateCode.InitOperand(op.tag);
  12775. IntermediateCode.InitOperand(op.extra);
  12776. op.dimOffset := 0;
  12777. END InitOperand;
  12778. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12779. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12780. BEGIN RETURN IntermediateCode.GetType(system, type)
  12781. END GetType;
  12782. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12783. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12784. BEGIN
  12785. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12786. (*
  12787. UniqueId(name,module,name,adr);
  12788. *)
  12789. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12790. constant.SetValue(value);
  12791. constant.SetAccess(SyntaxTree.Hidden);
  12792. module.moduleScope.AddConstant(constant);
  12793. constant.SetScope(module.moduleScope);
  12794. RETURN constant
  12795. END BuildConstant;
  12796. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12797. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12798. BEGIN
  12799. variable := scope.firstVariable;
  12800. WHILE variable # NIL DO
  12801. IF variable.NeedsTrace() THEN
  12802. RETURN TRUE;
  12803. END;
  12804. variable := variable.nextVariable;
  12805. END;
  12806. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12807. WHILE parameter # NIL DO
  12808. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) THEN
  12809. RETURN TRUE;
  12810. END;
  12811. parameter := parameter.nextParameter;
  12812. END;
  12813. RETURN FALSE;
  12814. END HasPointers;
  12815. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12816. 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));
  12817. END IsVariableParameter;
  12818. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12819. VAR parameter: SyntaxTree.Parameter;
  12820. BEGIN
  12821. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12822. WHILE parameter # NIL DO
  12823. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12824. IF parameter.movable THEN RETURN TRUE END;
  12825. parameter := parameter.nextParameter;
  12826. END;
  12827. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12828. END HasVariableParameters;
  12829. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12830. BEGIN
  12831. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12832. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12833. END HasExplicitTraceMethod;
  12834. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12835. BEGIN
  12836. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12837. IF (expression IS SyntaxTree.IntegerValue) THEN
  12838. val := expression(SyntaxTree.IntegerValue).value;
  12839. RETURN TRUE
  12840. ELSE
  12841. RETURN FALSE
  12842. END;
  12843. END IsIntegerConstant;
  12844. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12845. BEGIN
  12846. IF val <= 0 THEN RETURN FALSE END;
  12847. exp := 0;
  12848. WHILE ~ODD(val) DO
  12849. val := val DIV 2;
  12850. INC(exp)
  12851. END;
  12852. RETURN val = 1
  12853. END PowerOf2;
  12854. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12855. VAR procedure: SyntaxTree.Procedure;
  12856. BEGIN
  12857. procedure := record.recordScope.constructor;
  12858. IF procedure = NIL THEN
  12859. record := record.GetBaseRecord();
  12860. IF record # NIL THEN
  12861. procedure := GetConstructor(record)
  12862. END;
  12863. END;
  12864. RETURN procedure;
  12865. END GetConstructor;
  12866. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12867. BEGIN
  12868. value := SHORT(op.intValue);
  12869. RETURN op.mode = IntermediateCode.ModeImmediate;
  12870. END IsIntegerImmediate;
  12871. (** whether a type strictily is a pointer to record or object type
  12872. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12873. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12874. BEGIN
  12875. IF type = NIL THEN
  12876. RETURN FALSE
  12877. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12878. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12879. ELSE
  12880. RETURN FALSE
  12881. END
  12882. END IsStrictlyPointerToRecord;
  12883. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12884. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12885. END IsUnsafePointer;
  12886. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12887. BEGIN type := type.resolved;
  12888. IF type IS SyntaxTree.PointerType THEN
  12889. type := type(SyntaxTree.PointerType).pointerBase;
  12890. type := type.resolved;
  12891. IF type IS SyntaxTree.RecordType THEN
  12892. recordType := type(SyntaxTree.RecordType);
  12893. RETURN TRUE
  12894. ELSE
  12895. RETURN FALSE
  12896. END
  12897. ELSIF type IS SyntaxTree.RecordType THEN
  12898. recordType := type(SyntaxTree.RecordType);
  12899. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12900. ELSIF type IS SyntaxTree.ObjectType THEN
  12901. RETURN TRUE
  12902. ELSIF type IS SyntaxTree.AnyType THEN
  12903. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12904. ELSE
  12905. RETURN FALSE
  12906. END;
  12907. END IsPointerToRecord;
  12908. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12909. BEGIN
  12910. type := type.resolved;
  12911. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12912. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12913. END IsArrayOfSystemByte;
  12914. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12915. BEGIN
  12916. IF type = NIL THEN RETURN FALSE END;
  12917. type := type.resolved;
  12918. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12919. END IsOpenArray;
  12920. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12921. BEGIN
  12922. IF type = NIL THEN RETURN FALSE END;
  12923. type := type.resolved;
  12924. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12925. END IsSemiDynamicArray;
  12926. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12927. BEGIN
  12928. IF type = NIL THEN RETURN FALSE END;
  12929. type := type.resolved;
  12930. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  12931. END IsStaticArray;
  12932. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  12933. BEGIN
  12934. IF type = NIL THEN RETURN FALSE END;
  12935. type := type.resolved;
  12936. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  12937. END IsStaticMathArray;
  12938. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12939. BEGIN
  12940. WHILE (IsStaticMathArray(type)) DO
  12941. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12942. END;
  12943. RETURN type;
  12944. END StaticMathArrayBaseType;
  12945. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12946. VAR size: LONGINT;
  12947. BEGIN
  12948. size := 1;
  12949. WHILE (IsStaticArray(type)) DO
  12950. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  12951. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12952. END;
  12953. RETURN size;
  12954. END StaticArrayNumElements;
  12955. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  12956. VAR size: LONGINT;
  12957. BEGIN
  12958. size := 1;
  12959. WHILE (IsStaticMathArray(type)) DO
  12960. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  12961. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  12962. END;
  12963. RETURN size;
  12964. END StaticMathArrayNumElements;
  12965. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12966. BEGIN
  12967. WHILE (IsStaticArray(type)) DO
  12968. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12969. END;
  12970. RETURN type;
  12971. END StaticArrayBaseType;
  12972. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  12973. BEGIN
  12974. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  12975. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  12976. END;
  12977. RETURN type;
  12978. END ArrayBaseType;
  12979. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  12980. BEGIN
  12981. IF type = NIL THEN RETURN FALSE END;
  12982. type := type.resolved;
  12983. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  12984. END IsDelegate;
  12985. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  12986. VAR i: LONGINT;
  12987. BEGIN
  12988. i := 0; type := type.resolved;
  12989. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  12990. INC(i);
  12991. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  12992. END;
  12993. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  12994. INC(i);
  12995. type := type(SyntaxTree.MathArrayType).arrayBase;
  12996. IF type # NIL THEN type := type.resolved END;
  12997. END;
  12998. RETURN i
  12999. END DynamicDim;
  13000. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13001. BEGIN
  13002. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13003. type := type(SyntaxTree.ArrayType).arrayBase;
  13004. END;
  13005. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13006. type := type(SyntaxTree.MathArrayType).arrayBase;
  13007. END;
  13008. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13009. END StaticSize;
  13010. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13011. BEGIN
  13012. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13013. END IsImmediate;
  13014. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13015. BEGIN
  13016. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13017. END IsAddress;
  13018. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13019. BEGIN
  13020. RETURN (x.mode = IntermediateCode.ModeRegister);
  13021. END IsRegister;
  13022. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13023. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13024. BEGIN
  13025. typeDeclaration := recordType.typeDeclaration;
  13026. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13027. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13028. END GetRecordTypeName;
  13029. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13030. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13031. BEGIN
  13032. parSize := 0;
  13033. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13034. parameter := procedureType.returnParameter;
  13035. INC(parSize,system.SizeOfParameter(parameter));
  13036. parSize := parSize + (-parSize) MOD system.addressSize;
  13037. END;
  13038. parameter :=procedureType.lastParameter;
  13039. WHILE (parameter # NIL) DO
  13040. IF SysvABIorWINAPI(procedureType.callingConvention) THEN
  13041. INC(parSize, system.addressSize);
  13042. ELSE
  13043. INC(parSize,system.SizeOfParameter(parameter));
  13044. parSize := parSize + (-parSize) MOD system.addressSize;
  13045. END;
  13046. parameter := parameter.prevParameter;
  13047. END;
  13048. IF procedureType.selfParameter # NIL THEN
  13049. parameter := procedureType.selfParameter;
  13050. INC(parSize,system.SizeOfParameter(parameter));
  13051. parSize := parSize + (-parSize) MOD system.addressSize;
  13052. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13053. END; (* method => self pointer *)
  13054. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13055. RETURN ToMemoryUnits(system,parSize)
  13056. END ParametersSize;
  13057. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13058. BEGIN
  13059. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13060. END IsNested;
  13061. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13062. BEGIN
  13063. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13064. scope := scope.outerScope;
  13065. END;
  13066. RETURN scope # NIL;
  13067. END InCellScope;
  13068. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13069. BEGIN
  13070. (*IF (procedure.scope IS SyntaxTree.CellScope) & (procedure = procedure.scope(SyntaxTree.CellScope).constructor) & ~backend.cellsAreObjects THEN
  13071. RETURN 0
  13072. ELSE
  13073. *)
  13074. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType),IsNested(procedure));
  13075. (*END;*)
  13076. END ProcedureParametersSize;
  13077. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13078. VAR dataUnit: LONGINT;
  13079. BEGIN dataUnit := system.dataUnit;
  13080. ASSERT(size MOD system.dataUnit = 0);
  13081. RETURN LONGINT(size DIV system.dataUnit)
  13082. END ToMemoryUnits;
  13083. PROCEDURE Get*(): Backend.Backend;
  13084. VAR backend: IntermediateBackend;
  13085. BEGIN NEW(backend); RETURN backend
  13086. END Get;
  13087. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13088. VAR instruction: IntermediateCode.Instruction;
  13089. BEGIN
  13090. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13091. RETURN instruction
  13092. END Nop;
  13093. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13094. VAR instruction: IntermediateCode.Instruction;
  13095. BEGIN
  13096. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13097. RETURN instruction
  13098. END Mov;
  13099. (* like Mov but ensures that no new register will be allocated for dest *)
  13100. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13101. VAR instruction: IntermediateCode.Instruction;
  13102. BEGIN
  13103. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13104. RETURN instruction
  13105. END MovReplace;
  13106. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13107. VAR instruction: IntermediateCode.Instruction;
  13108. BEGIN
  13109. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13110. RETURN instruction
  13111. END Conv;
  13112. PROCEDURE SysvABI( cc: LONGINT ): BOOLEAN;
  13113. BEGIN
  13114. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention})
  13115. END SysvABI;
  13116. PROCEDURE SysvABIorWINAPI( cc: LONGINT ): BOOLEAN;
  13117. BEGIN
  13118. RETURN (cc IN {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention})
  13119. END SysvABIorWINAPI;
  13120. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13121. VAR instruction: IntermediateCode.Instruction;
  13122. BEGIN
  13123. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13124. RETURN instruction
  13125. END Call;
  13126. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13127. VAR op1, op2, op3: IntermediateCode.Operand;
  13128. VAR instruction: IntermediateCode.Instruction;
  13129. BEGIN
  13130. IntermediateCode.InitNumber(op1,pcOffset);
  13131. IntermediateCode.InitNumber(op2,callingConvention);
  13132. IntermediateCode.InitNumber(op3,unwind);
  13133. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13134. RETURN instruction
  13135. END Exit;
  13136. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13137. VAR instruction: IntermediateCode.Instruction;
  13138. BEGIN
  13139. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13140. RETURN instruction
  13141. END Return;
  13142. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13143. VAR instruction: IntermediateCode.Instruction;
  13144. BEGIN
  13145. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13146. RETURN instruction
  13147. END Result;
  13148. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13149. VAR op1: IntermediateCode.Operand;
  13150. VAR instruction: IntermediateCode.Instruction;
  13151. BEGIN
  13152. IntermediateCode.InitNumber(op1,nr);
  13153. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13154. RETURN instruction
  13155. END Trap;
  13156. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13157. VAR instruction: IntermediateCode.Instruction;
  13158. BEGIN
  13159. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13160. RETURN instruction
  13161. END Br;
  13162. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13163. VAR instruction: IntermediateCode.Instruction;
  13164. BEGIN
  13165. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13166. RETURN instruction
  13167. END Breq;
  13168. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13169. VAR instruction: IntermediateCode.Instruction;
  13170. BEGIN
  13171. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13172. RETURN instruction
  13173. END Brne;
  13174. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13175. VAR instruction: IntermediateCode.Instruction;
  13176. BEGIN
  13177. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13178. RETURN instruction
  13179. END Brge;
  13180. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13181. VAR instruction: IntermediateCode.Instruction;
  13182. BEGIN
  13183. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13184. RETURN instruction
  13185. END Brlt;
  13186. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13187. VAR instruction: IntermediateCode.Instruction;
  13188. BEGIN
  13189. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13190. RETURN instruction
  13191. END Pop;
  13192. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13193. VAR instruction: IntermediateCode.Instruction;
  13194. BEGIN
  13195. ASSERT(op.mode # IntermediateCode.Undefined);
  13196. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13197. RETURN instruction
  13198. END Push;
  13199. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13200. VAR instruction: IntermediateCode.Instruction;
  13201. BEGIN
  13202. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13203. RETURN instruction
  13204. END Neg;
  13205. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13206. VAR instruction: IntermediateCode.Instruction;
  13207. BEGIN
  13208. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13209. RETURN instruction
  13210. END Not;
  13211. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13212. VAR instruction: IntermediateCode.Instruction;
  13213. BEGIN
  13214. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13215. RETURN instruction
  13216. END Abs;
  13217. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13218. VAR instruction: IntermediateCode.Instruction;
  13219. BEGIN
  13220. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13221. ASSERT(~IsImmediate(instruction.op1));
  13222. RETURN instruction
  13223. END Mul;
  13224. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13225. VAR instruction: IntermediateCode.Instruction;
  13226. BEGIN
  13227. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13228. RETURN instruction
  13229. END Div;
  13230. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13231. VAR instruction: IntermediateCode.Instruction;
  13232. BEGIN
  13233. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13234. RETURN instruction
  13235. END Mod;
  13236. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13237. VAR instruction: IntermediateCode.Instruction;
  13238. BEGIN
  13239. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13240. RETURN instruction
  13241. END Sub;
  13242. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13243. VAR instruction: IntermediateCode.Instruction;
  13244. BEGIN
  13245. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13246. RETURN instruction
  13247. END Add;
  13248. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13249. VAR instruction: IntermediateCode.Instruction;
  13250. BEGIN
  13251. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13252. RETURN instruction
  13253. END And;
  13254. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13255. VAR instruction: IntermediateCode.Instruction;
  13256. BEGIN
  13257. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13258. RETURN instruction
  13259. END Or;
  13260. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13261. VAR instruction: IntermediateCode.Instruction;
  13262. BEGIN
  13263. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13264. RETURN instruction
  13265. END Xor;
  13266. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13267. VAR instruction: IntermediateCode.Instruction;
  13268. BEGIN
  13269. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13270. RETURN instruction
  13271. END Shl;
  13272. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13273. VAR instruction: IntermediateCode.Instruction;
  13274. BEGIN
  13275. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13276. RETURN instruction
  13277. END Shr;
  13278. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13279. VAR instruction: IntermediateCode.Instruction;
  13280. BEGIN
  13281. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13282. RETURN instruction
  13283. END Rol;
  13284. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13285. VAR instruction: IntermediateCode.Instruction;
  13286. BEGIN
  13287. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13288. RETURN instruction
  13289. END Ror;
  13290. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13291. VAR instruction: IntermediateCode.Instruction;
  13292. BEGIN
  13293. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13294. RETURN instruction
  13295. END Cas;
  13296. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13297. VAR instruction: IntermediateCode.Instruction;
  13298. BEGIN
  13299. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13300. RETURN instruction
  13301. END Copy;
  13302. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13303. VAR instruction: IntermediateCode.Instruction;
  13304. BEGIN
  13305. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13306. RETURN instruction
  13307. END Fill;
  13308. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13309. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13310. BEGIN
  13311. string := IntermediateCode.String(s);
  13312. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13313. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13314. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13315. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13316. RETURN instruction
  13317. END Asm;
  13318. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13319. VAR instruction: IntermediateCode.Instruction;
  13320. BEGIN
  13321. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13322. RETURN instruction
  13323. END Data;
  13324. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13325. VAR instruction: IntermediateCode.Instruction;
  13326. BEGIN
  13327. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13328. IntermediateCode.SetSubType(instruction, subtype);
  13329. RETURN instruction
  13330. END SpecialInstruction;
  13331. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13332. VAR op1: IntermediateCode.Operand;
  13333. VAR instruction: IntermediateCode.Instruction;
  13334. BEGIN
  13335. (*! generate a warning if size exceeds a certain limit *)
  13336. (*
  13337. ASSERT(bytes < 1000000); (* sanity check *)
  13338. *)
  13339. ASSERT(0 <= units); (* sanity check *)
  13340. IntermediateCode.InitNumber(op1,units);
  13341. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13342. RETURN instruction
  13343. END Reserve;
  13344. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13345. VAR op1: IntermediateCode.Operand;
  13346. VAR instruction: IntermediateCode.Instruction;
  13347. BEGIN
  13348. IntermediateCode.InitNumber(op1,position.start);
  13349. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13350. RETURN instruction
  13351. END LabelInstruction;
  13352. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13353. VAR pc: LONGINT;
  13354. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13355. BEGIN
  13356. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13357. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13358. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13359. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13360. IF instr.op1.type.form = IntermediateCode.Float THEN
  13361. RETURN instr.op1.floatValue = op.floatValue
  13362. ELSE
  13363. RETURN instr.op1.intValue = op.intValue
  13364. END;
  13365. END ProvidesValue;
  13366. BEGIN
  13367. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13368. pc := 0;
  13369. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13370. INC(pc);
  13371. END;
  13372. IF pc = data.pc THEN
  13373. data.Emit(Data(Basic.invalidPosition,vop));
  13374. END;
  13375. RETURN pc
  13376. END EnterImmediate;
  13377. PROCEDURE Init;
  13378. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13379. BEGIN
  13380. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13381. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13382. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13383. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13384. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13385. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13386. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13387. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13388. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13389. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13390. IntermediateCode.InitOperand(emptyOperand);
  13391. FOR i := 0 TO NumberSystemCalls-1 DO
  13392. name := "@SystemCall";
  13393. Basic.AppendNumber(name,i);
  13394. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13395. END;
  13396. END Init;
  13397. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13398. BEGIN
  13399. RETURN (symbol # NIL) & symbol.NeedsSection();
  13400. END IsExported;
  13401. BEGIN
  13402. Init;
  13403. END FoxIntermediateBackend.
  13404. Compiler.Compile -p=Win32G FoxIntermediateBackend.Mod ~
  13405. # Release.Build --path="/temp/obg/" Win32G ~
  13406. # StaticLinker.Link --fileFormat=PE32 --fileName=A2H.exe --extension=GofW --displacement=401000H Runtime Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection GenericLoader BootConsole ~
  13407. FStols.CloseFiles A2Z.exe ~
  13408. SystemTools.FreeDownTo FoxIntermediateBackend ~
  13409. Compiler.Compile -p=Win32G --destPath=/temp/obg/ --traceModule=Trace
  13410. Runtime.Mod Trace.Mod Generic.Win32.Kernel32.Mod Win32.Machine.Mod Heaps.Mod
  13411. Generic.Modules.Mod Win32.Objects.Mod Win32.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13412. Commands.Mod I386.Reals.Mod Generic.Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13413. Win32.Traps.Mod Locks.Mod Win32.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13414. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13415. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Win32.User32.Mod
  13416. Win32.WinTrace.Mod Win32.ODBC.Mod Win32.Shell32.Mod Win32.SQL.Mod Win32.WinFS.Mod
  13417. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13418. GenericLinker.Mod GenericLoader.Mod BootConsole.Mod