FoxIntermediateBackend.Mod 580 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772107731077410775107761077710778107791078010781107821078310784107851078610787107881078910790107911079210793107941079510796107971079810799108001080110802108031080410805108061080710808108091081010811108121081310814108151081610817108181081910820108211082210823108241082510826108271082810829108301083110832108331083410835108361083710838108391084010841108421084310844108451084610847108481084910850108511085210853108541085510856108571085810859108601086110862108631086410865108661086710868108691087010871108721087310874108751087610877108781087910880108811088210883108841088510886108871088810889108901089110892108931089410895108961089710898108991090010901109021090310904109051090610907109081090910910109111091210913109141091510916109171091810919109201092110922109231092410925109261092710928109291093010931109321093310934109351093610937109381093910940109411094210943109441094510946109471094810949109501095110952109531095410955109561095710958109591096010961109621096310964109651096610967109681096910970109711097210973109741097510976109771097810979109801098110982109831098410985109861098710988109891099010991109921099310994109951099610997109981099911000110011100211003110041100511006110071100811009110101101111012110131101411015110161101711018110191102011021110221102311024110251102611027110281102911030110311103211033110341103511036110371103811039110401104111042110431104411045110461104711048110491105011051110521105311054110551105611057110581105911060110611106211063110641106511066110671106811069110701107111072110731107411075110761107711078110791108011081110821108311084110851108611087110881108911090110911109211093110941109511096110971109811099111001110111102111031110411105111061110711108111091111011111111121111311114111151111611117111181111911120111211112211123111241112511126111271112811129111301113111132111331113411135111361113711138111391114011141111421114311144111451114611147111481114911150111511115211153111541115511156111571115811159111601116111162111631116411165111661116711168111691117011171111721117311174111751117611177111781117911180111811118211183111841118511186111871118811189111901119111192111931119411195111961119711198111991120011201112021120311204112051120611207112081120911210112111121211213112141121511216112171121811219112201122111222112231122411225112261122711228112291123011231112321123311234112351123611237112381123911240112411124211243112441124511246112471124811249112501125111252112531125411255112561125711258112591126011261112621126311264112651126611267112681126911270112711127211273112741127511276112771127811279112801128111282112831128411285112861128711288112891129011291112921129311294112951129611297112981129911300113011130211303113041130511306113071130811309113101131111312113131131411315113161131711318113191132011321113221132311324113251132611327113281132911330113311133211333113341133511336113371133811339113401134111342113431134411345113461134711348113491135011351113521135311354113551135611357113581135911360113611136211363113641136511366113671136811369113701137111372113731137411375113761137711378113791138011381113821138311384113851138611387113881138911390113911139211393113941139511396113971139811399114001140111402114031140411405114061140711408114091141011411114121141311414114151141611417114181141911420114211142211423114241142511426114271142811429114301143111432114331143411435114361143711438114391144011441114421144311444114451144611447114481144911450114511145211453114541145511456114571145811459114601146111462114631146411465114661146711468114691147011471114721147311474114751147611477114781147911480114811148211483114841148511486114871148811489114901149111492114931149411495114961149711498114991150011501115021150311504115051150611507115081150911510115111151211513115141151511516115171151811519115201152111522115231152411525115261152711528115291153011531115321153311534115351153611537115381153911540115411154211543115441154511546115471154811549115501155111552115531155411555115561155711558115591156011561115621156311564115651156611567115681156911570115711157211573115741157511576115771157811579115801158111582115831158411585115861158711588115891159011591115921159311594115951159611597115981159911600116011160211603116041160511606116071160811609116101161111612116131161411615116161161711618116191162011621116221162311624116251162611627116281162911630116311163211633116341163511636116371163811639116401164111642116431164411645116461164711648116491165011651116521165311654116551165611657116581165911660116611166211663116641166511666116671166811669116701167111672116731167411675116761167711678116791168011681116821168311684116851168611687116881168911690116911169211693116941169511696116971169811699117001170111702117031170411705117061170711708117091171011711117121171311714117151171611717117181171911720117211172211723117241172511726117271172811729117301173111732117331173411735117361173711738117391174011741117421174311744117451174611747117481174911750117511175211753117541175511756117571175811759117601176111762117631176411765117661176711768117691177011771117721177311774117751177611777117781177911780117811178211783117841178511786117871178811789117901179111792117931179411795117961179711798117991180011801118021180311804118051180611807118081180911810118111181211813118141181511816118171181811819118201182111822118231182411825118261182711828118291183011831118321183311834118351183611837118381183911840118411184211843118441184511846118471184811849118501185111852118531185411855118561185711858118591186011861118621186311864118651186611867118681186911870118711187211873118741187511876118771187811879118801188111882118831188411885118861188711888118891189011891118921189311894118951189611897118981189911900119011190211903119041190511906119071190811909119101191111912119131191411915119161191711918119191192011921119221192311924119251192611927119281192911930119311193211933119341193511936119371193811939119401194111942119431194411945119461194711948119491195011951119521195311954119551195611957119581195911960119611196211963119641196511966119671196811969119701197111972119731197411975119761197711978119791198011981119821198311984119851198611987119881198911990119911199211993119941199511996119971199811999120001200112002120031200412005120061200712008120091201012011120121201312014120151201612017120181201912020120211202212023120241202512026120271202812029120301203112032120331203412035120361203712038120391204012041120421204312044120451204612047120481204912050120511205212053120541205512056120571205812059120601206112062120631206412065120661206712068120691207012071120721207312074120751207612077120781207912080120811208212083120841208512086120871208812089120901209112092120931209412095120961209712098120991210012101121021210312104121051210612107121081210912110121111211212113121141211512116121171211812119121201212112122121231212412125121261212712128121291213012131121321213312134121351213612137121381213912140121411214212143121441214512146121471214812149121501215112152121531215412155121561215712158121591216012161121621216312164121651216612167121681216912170121711217212173121741217512176121771217812179121801218112182121831218412185121861218712188121891219012191121921219312194121951219612197121981219912200122011220212203122041220512206122071220812209122101221112212122131221412215122161221712218122191222012221122221222312224122251222612227122281222912230122311223212233122341223512236122371223812239122401224112242122431224412245122461224712248122491225012251122521225312254122551225612257122581225912260122611226212263122641226512266122671226812269122701227112272122731227412275122761227712278122791228012281122821228312284122851228612287122881228912290122911229212293122941229512296122971229812299123001230112302123031230412305123061230712308123091231012311123121231312314123151231612317123181231912320123211232212323123241232512326123271232812329123301233112332123331233412335123361233712338123391234012341123421234312344123451234612347123481234912350123511235212353123541235512356123571235812359123601236112362123631236412365123661236712368123691237012371123721237312374123751237612377123781237912380123811238212383123841238512386123871238812389123901239112392123931239412395123961239712398123991240012401124021240312404124051240612407124081240912410124111241212413124141241512416124171241812419124201242112422124231242412425124261242712428124291243012431124321243312434124351243612437124381243912440124411244212443124441244512446124471244812449124501245112452124531245412455124561245712458124591246012461124621246312464124651246612467124681246912470124711247212473124741247512476124771247812479124801248112482124831248412485124861248712488124891249012491124921249312494124951249612497124981249912500125011250212503125041250512506125071250812509125101251112512125131251412515125161251712518125191252012521125221252312524125251252612527125281252912530125311253212533125341253512536125371253812539125401254112542125431254412545125461254712548125491255012551125521255312554125551255612557125581255912560125611256212563125641256512566125671256812569125701257112572125731257412575125761257712578125791258012581125821258312584125851258612587125881258912590125911259212593125941259512596125971259812599126001260112602126031260412605126061260712608126091261012611126121261312614126151261612617126181261912620126211262212623126241262512626126271262812629126301263112632126331263412635126361263712638126391264012641126421264312644126451264612647126481264912650126511265212653126541265512656126571265812659126601266112662126631266412665126661266712668126691267012671126721267312674126751267612677126781267912680126811268212683126841268512686126871268812689126901269112692126931269412695126961269712698126991270012701127021270312704127051270612707127081270912710127111271212713127141271512716127171271812719127201272112722127231272412725127261272712728127291273012731127321273312734127351273612737127381273912740127411274212743127441274512746127471274812749127501275112752127531275412755127561275712758127591276012761127621276312764127651276612767127681276912770127711277212773127741277512776127771277812779127801278112782127831278412785127861278712788127891279012791127921279312794127951279612797127981279912800128011280212803128041280512806128071280812809128101281112812128131281412815128161281712818128191282012821128221282312824128251282612827128281282912830128311283212833128341283512836128371283812839128401284112842128431284412845128461284712848128491285012851128521285312854128551285612857128581285912860128611286212863128641286512866128671286812869128701287112872128731287412875128761287712878128791288012881128821288312884128851288612887128881288912890128911289212893128941289512896128971289812899129001290112902129031290412905129061290712908129091291012911129121291312914129151291612917129181291912920129211292212923129241292512926129271292812929129301293112932129331293412935129361293712938129391294012941129421294312944129451294612947129481294912950129511295212953129541295512956129571295812959129601296112962129631296412965129661296712968129691297012971129721297312974129751297612977129781297912980129811298212983129841298512986129871298812989129901299112992129931299412995129961299712998129991300013001130021300313004130051300613007130081300913010130111301213013130141301513016130171301813019130201302113022130231302413025130261302713028130291303013031130321303313034130351303613037130381303913040130411304213043130441304513046130471304813049130501305113052130531305413055130561305713058130591306013061130621306313064130651306613067130681306913070130711307213073130741307513076130771307813079130801308113082130831308413085130861308713088130891309013091130921309313094130951309613097130981309913100131011310213103131041310513106131071310813109131101311113112131131311413115131161311713118131191312013121131221312313124131251312613127131281312913130131311313213133131341313513136131371313813139131401314113142131431314413145131461314713148131491315013151131521315313154131551315613157131581315913160131611316213163131641316513166131671316813169131701317113172131731317413175131761317713178131791318013181131821318313184131851318613187131881318913190131911319213193131941319513196131971319813199132001320113202132031320413205132061320713208132091321013211132121321313214132151321613217132181321913220132211322213223132241322513226132271322813229132301323113232132331323413235132361323713238132391324013241132421324313244132451324613247132481324913250132511325213253132541325513256132571325813259132601326113262132631326413265132661326713268132691327013271132721327313274132751327613277132781327913280132811328213283132841328513286132871328813289132901329113292132931329413295132961329713298132991330013301133021330313304133051330613307133081330913310133111331213313133141331513316133171331813319133201332113322133231332413325133261332713328133291333013331133321333313334133351333613337133381333913340133411334213343133441334513346133471334813349133501335113352133531335413355133561335713358133591336013361133621336313364133651336613367133681336913370133711337213373133741337513376133771337813379133801338113382133831338413385133861338713388133891339013391133921339313394133951339613397133981339913400134011340213403134041340513406134071340813409134101341113412134131341413415134161341713418134191342013421134221342313424134251342613427134281342913430134311343213433134341343513436134371343813439134401344113442134431344413445134461344713448134491345013451134521345313454134551345613457134581345913460134611346213463134641346513466134671346813469134701347113472134731347413475134761347713478134791348013481134821348313484134851348613487134881348913490134911349213493134941349513496134971349813499135001350113502135031350413505135061350713508135091351013511135121351313514135151351613517135181351913520135211352213523135241352513526135271352813529135301353113532135331353413535135361353713538135391354013541135421354313544135451354613547135481354913550135511355213553135541355513556135571355813559135601356113562135631356413565135661356713568135691357013571135721357313574135751357613577135781357913580135811358213583135841358513586135871358813589135901359113592135931359413595135961359713598135991360013601136021360313604136051360613607136081360913610136111361213613136141361513616136171361813619136201362113622136231362413625136261362713628136291363013631136321363313634136351363613637136381363913640136411364213643136441364513646136471364813649136501365113652136531365413655136561365713658136591366013661136621366313664136651366613667136681366913670136711367213673136741367513676136771367813679136801368113682136831368413685136861368713688136891369013691136921369313694136951369613697136981369913700137011370213703137041370513706137071370813709137101371113712137131371413715137161371713718137191372013721137221372313724137251372613727137281372913730137311373213733137341373513736137371373813739137401374113742137431374413745137461374713748137491375013751137521375313754137551375613757137581375913760137611376213763137641376513766137671376813769137701377113772137731377413775137761377713778137791378013781137821378313784137851378613787137881378913790137911379213793137941379513796137971379813799138001380113802138031380413805138061380713808138091381013811138121381313814138151381613817138181381913820138211382213823138241382513826138271382813829138301383113832138331383413835138361383713838138391384013841138421384313844138451384613847138481384913850138511385213853138541385513856138571385813859138601386113862138631386413865138661386713868138691387013871138721387313874138751387613877138781387913880138811388213883138841388513886138871388813889138901389113892138931389413895138961389713898138991390013901139021390313904139051390613907139081390913910139111391213913139141391513916139171391813919139201392113922139231392413925139261392713928139291393013931139321393313934139351393613937139381393913940139411394213943139441394513946139471394813949139501395113952139531395413955139561395713958139591396013961139621396313964139651396613967139681396913970139711397213973139741397513976139771397813979139801398113982139831398413985139861398713988139891399013991139921399313994139951399613997139981399914000140011400214003140041400514006140071400814009140101401114012140131401414015140161401714018140191402014021140221402314024140251402614027140281402914030140311403214033140341403514036140371403814039140401404114042140431404414045140461404714048140491405014051140521405314054140551405614057140581405914060140611406214063140641406514066140671406814069140701407114072140731407414075140761407714078140791408014081140821408314084140851408614087140881408914090140911409214093140941409514096140971409814099141001410114102141031410414105141061410714108141091411014111141121411314114141151411614117141181411914120141211412214123141241412514126141271412814129141301413114132141331413414135141361413714138141391414014141141421414314144141451414614147141481414914150141511415214153141541415514156141571415814159141601416114162141631416414165141661416714168141691417014171141721417314174141751417614177141781417914180141811418214183141841418514186141871418814189141901419114192141931419414195141961419714198141991420014201142021420314204142051420614207142081420914210142111421214213142141421514216142171421814219142201422114222142231422414225142261422714228142291423014231142321423314234142351423614237142381423914240142411424214243142441424514246142471424814249142501425114252142531425414255142561425714258142591426014261142621426314264142651426614267142681426914270142711427214273142741427514276142771427814279142801428114282142831428414285142861428714288142891429014291142921429314294142951429614297142981429914300143011430214303143041430514306143071430814309143101431114312143131431414315143161431714318143191432014321143221432314324143251432614327143281432914330143311433214333143341433514336143371433814339143401434114342143431434414345143461434714348143491435014351143521435314354143551435614357143581435914360143611436214363143641436514366143671436814369143701437114372143731437414375143761437714378143791438014381143821438314384143851438614387143881438914390143911439214393143941439514396143971439814399144001440114402144031440414405144061440714408144091441014411144121441314414144151441614417144181441914420144211442214423144241442514426144271442814429144301443114432144331443414435144361443714438144391444014441144421444314444144451444614447144481444914450144511445214453144541445514456144571445814459144601446114462144631446414465144661446714468144691447014471144721447314474144751447614477144781447914480144811448214483144841448514486144871448814489144901449114492144931449414495144961449714498144991450014501145021450314504145051450614507145081450914510145111451214513145141451514516145171451814519145201452114522145231452414525145261452714528145291453014531145321453314534145351453614537145381453914540145411454214543145441454514546145471454814549145501455114552145531455414555145561455714558145591456014561145621456314564145651456614567145681456914570145711457214573145741457514576145771457814579145801458114582145831458414585145861458714588145891459014591145921459314594145951459614597145981459914600146011460214603146041460514606146071460814609146101461114612146131461414615146161461714618146191462014621146221462314624146251462614627146281462914630146311463214633146341463514636146371463814639146401464114642146431464414645146461464714648146491465014651146521465314654146551465614657146581465914660146611466214663146641466514666146671466814669146701467114672146731467414675146761467714678146791468014681146821468314684146851468614687146881468914690146911469214693146941469514696146971469814699147001470114702147031470414705147061470714708147091471014711147121471314714147151471614717147181471914720147211472214723147241472514726147271472814729147301473114732147331473414735147361473714738147391474014741147421474314744147451474614747147481474914750147511475214753147541475514756147571475814759147601476114762147631476414765147661476714768147691477014771147721477314774147751477614777147781477914780147811478214783147841478514786147871478814789147901479114792147931479414795147961479714798147991480014801148021480314804148051480614807148081480914810148111481214813148141481514816148171481814819148201482114822148231482414825
  1. MODULE FoxIntermediateBackend; (** AUTHOR ""; PURPOSE ""; *)
  2. IMPORT Basic := FoxBasic, SyntaxTree := FoxSyntaxTree, SemanticChecker := FoxSemanticChecker, Backend := FoxBackend, Global := FoxGlobal,
  3. Scanner := FoxScanner, IntermediateCode := FoxIntermediateCode, Sections := FoxSections, BinaryCode := FoxBinaryCode, Printout := FoxPrintout,
  4. SYSTEM, Diagnostics, Strings, Options, Streams, Compiler, Formats := FoxFormats, SymbolFileFormat := FoxTextualSymbolFile, D := Debugging,
  5. FingerPrinter := FoxFingerPrinter, StringPool, CRC;
  6. CONST
  7. (* operand modes *)
  8. ModeUndefined = 0;
  9. ModeReference = 1;
  10. ModeValue = 2;
  11. (* heap data offsets *)
  12. ArrayDimTable = 3; (* dimension table in dyn arrays *)
  13. (* math array offsets *)
  14. MathPtrOffset=0;
  15. MathAdrOffset=1;
  16. MathFlagsOffset=2;
  17. MathDimOffset=3;
  18. MathElementSizeOffset=4;
  19. MathLenOffset=5;
  20. MathIncrOffset=6;
  21. SysDataArrayOffset* = 0; (* array offset in system bl ock, for 32 byte alignment *)
  22. ArrDataArrayOffset*= 16*8; (* 16 bytes array offset in array block, to be compatible with the GC scheme of POINTER TO ARRAY OF ... *)
  23. TensorFlag* = 0; (* flag indicating a tensor array *)
  24. RangeFlag* = 1; (* flag indicating a range, e.g. an array derived from A[..,..] *)
  25. StackFlag* = 2; (* flag indicates temporary result *)
  26. StaticFlag* = 1; (* flag indicating a static array, may not be reallocated *)
  27. (** compiler generated traps *)
  28. WithTrap* = 1; (* generated when a WITH statement fails *)
  29. CaseTrap* = 2; (* generated when a case statement without else block fails *)
  30. ReturnTrap* = 3;
  31. TypeEqualTrap* = 5;
  32. TypeCheckTrap* = 6;
  33. IndexCheckTrap* = 7; (* generated when index is out of bounds or range is invalid *)
  34. AssertTrap* = 8; (* generated when an assert fails *)
  35. ArraySizeTrap* = 9;
  36. ArrayFormTrap*=10; (* indicates that array cannot be (re-)allocated since shape, type or size does not match *)
  37. SetElementTrap*=11; (* indicates that a set element is out of MIN(SET)...MAX(SET) *)
  38. NegativeDivisorTrap*=12;
  39. NoReturnTrap*=16; (* indicates that a procedure marked no return did return *)
  40. NilPointerTrap*=17; (* indicates that a nil pointer was being dereferenced *)
  41. RethrowTrap* = 18; (* rethrow exception after unlock *)
  42. Trace = FALSE;
  43. TraceRegisterUsageCount=TRUE;
  44. ArrayAlignment = 8*8; (* first array element of ArrayBlock and first data element of SystemBlock must be aligned to 0 MOD ArrayAlignment *)
  45. (** system call numbers *)
  46. NumberSystemCalls* = 12;
  47. SysNewRec* = 0; SysNewArr* = 1; SysNewSys* = 2; SysCaseTable* = 3; SysProcAddr* = 4;
  48. SysLock* = 5; SysUnlock* = 6; SysStart* = 7; SysAwait* = 8; SysInterfaceLookup* = 9;
  49. SysRegisterInterface* = 10; SysGetProcedure* = 11;
  50. DefaultBuiltinsModuleName ="Builtins";
  51. DefaultTraceModuleName ="KernelLog";
  52. ChannelModuleName = "Channels";
  53. NonPointer = -1; (* special pointer values *)
  54. NoType = 0; (* special type info values *)
  55. LhsIsPointer = 0; (* for the operator kind *)
  56. RhsIsPointer = 1;
  57. (* priority values, lower means higher priority *)
  58. EntryPriority=-4;
  59. FirstPriority=-3;
  60. InitPriority=-2;
  61. ExitPriority=-1;
  62. BasePointerTypeSize = 5;
  63. BaseArrayTypeSize = BasePointerTypeSize + 3;
  64. LengthOffset = BasePointerTypeSize + 0;
  65. DataOffset = BasePointerTypeSize + 1;
  66. DescriptorOffset = BasePointerTypeSize + 2;
  67. BaseRecordTypeSize = BasePointerTypeSize + 2;
  68. ActionOffset = BasePointerTypeSize + 0;
  69. MonitorOffset = BasePointerTypeSize + 1;
  70. BaseObjectTypeSize = BaseRecordTypeSize;
  71. ActionTypeSize = 3;
  72. MonitorTypeSize = 7;
  73. ProcessorOffset = BaseObjectTypeSize + 1;
  74. StackLimitOffset* = BaseObjectTypeSize + 3;
  75. QuantumOffset = BaseObjectTypeSize + 4;
  76. (* flags for optimizations with small matricies and vectors (Alexey Morozov) *)
  77. SmallMatrixFlag = 3; (* flag for identification of a small matrix *)
  78. SmallVectorFlag = 3; (* flag for identification of a small vector *)
  79. Size2Flag = 4; (* size = 2 *)
  80. Size3Flag = 5; (* size = 3 *)
  81. Size4Flag = 6; (* size = 4 *)
  82. Size5Flag = 7; (* size = 5 *)
  83. Size6Flag = 8; (* size = 6 *)
  84. Size7Flag = 9; (* size = 7 *)
  85. Size8Flag = 10; (* size = 8 *)
  86. ReflectionSupport = TRUE;
  87. (* Solution for identifying procedure descriptors on the stack and for being able to differentiate "old school" stack frames from the underlying operating system stack frames:
  88. push a procedure desriptor plus one to where the BP pointer would be located. The misalignment of the procedure descriptor makes it possible to identify that it is not
  89. a base pointer but a procedure descriptor. The base pointer itself is in such cases located at BP + address size.
  90. *)
  91. (* I am not 100% sure if it is necessary or not -- so I keep a flag to be able to re-enable this *)
  92. ProtectModulesPointers = FALSE;
  93. CreateProcedureDescInfo = TRUE;
  94. WarningDynamicLoading = FALSE;
  95. SysvABI = {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention};
  96. SysvABIorWINAPI = {SyntaxTree.CCallingConvention, SyntaxTree.DarwinCCallingConvention, SyntaxTree.WinAPICallingConvention};
  97. TYPE
  98. Position=SyntaxTree.Position;
  99. SupportedInstructionProcedure* = PROCEDURE {DELEGATE} (CONST instr: IntermediateCode.Instruction; VAR moduleName,procedureName: ARRAY OF CHAR): BOOLEAN;
  100. SupportedImmediateProcedure* = PROCEDURE {DELEGATE} (CONST op: IntermediateCode.Operand): BOOLEAN;
  101. Operand = RECORD
  102. mode: SHORTINT;
  103. op: IntermediateCode.Operand;
  104. tag: IntermediateCode.Operand;
  105. extra: IntermediateCode.Operand; (* stores the step size of an array range *)
  106. dimOffset: LONGINT;
  107. END;
  108. Fixup= POINTER TO RECORD
  109. pc: LONGINT;
  110. nextFixup: Fixup;
  111. END;
  112. WriteBackCall = POINTER TO RECORD
  113. call: SyntaxTree.ProcedureCallDesignator;
  114. next: WriteBackCall;
  115. END;
  116. Label= OBJECT
  117. VAR
  118. fixups: Fixup;
  119. section: IntermediateCode.Section;
  120. pc: LONGINT;
  121. PROCEDURE &InitLabel(section: IntermediateCode.Section);
  122. BEGIN
  123. SELF.section := section; pc := -1;
  124. END InitLabel;
  125. PROCEDURE Resolve(pc: LONGINT);
  126. VAR at: LONGINT;
  127. BEGIN
  128. SELF.pc := pc;
  129. WHILE(fixups # NIL) DO
  130. at := fixups.pc;
  131. section.PatchAddress(at,pc);
  132. fixups := fixups.nextFixup;
  133. END;
  134. END Resolve;
  135. PROCEDURE AddFixup(at: LONGINT);
  136. VAR fixup: Fixup;
  137. BEGIN
  138. ASSERT(pc=-1);
  139. NEW(fixup); fixup.pc := at; fixup.nextFixup := fixups; fixups := fixup;
  140. END AddFixup;
  141. END Label;
  142. ConditionalBranch = PROCEDURE {DELEGATE}(label: Label; op1,op2: IntermediateCode.Operand);
  143. DeclarationVisitor =OBJECT(SyntaxTree.Visitor)
  144. VAR
  145. backend: IntermediateBackend;
  146. implementationVisitor: ImplementationVisitor;
  147. meta: MetaDataGenerator;
  148. system: Global.System;
  149. currentScope: SyntaxTree.Scope;
  150. module: Sections.Module;
  151. moduleSelf: SyntaxTree.Variable;
  152. dump: BOOLEAN;
  153. forceModuleBody: BOOLEAN;
  154. addressType: IntermediateCode.Type;
  155. PROCEDURE & Init(system: Global.System; implementationVisitor: ImplementationVisitor; backend: IntermediateBackend; forceModuleBody, dump: BOOLEAN);
  156. BEGIN
  157. currentScope := NIL; module := NIL; moduleSelf := NIL;
  158. SELF.system := system; SELF.implementationVisitor := implementationVisitor;
  159. SELF.dump := dump;
  160. SELF.backend := backend;
  161. SELF.forceModuleBody := forceModuleBody;
  162. addressType := IntermediateCode.GetType(system,system.addressType)
  163. END Init;
  164. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  165. BEGIN
  166. backend.Error(module.module.sourceName, position, Diagnostics.Invalid, s);
  167. END Error;
  168. PROCEDURE Type(x: SyntaxTree.Type);
  169. BEGIN
  170. x.Accept(SELF);
  171. END Type;
  172. (** types **)
  173. PROCEDURE VisitBasicType*(x: SyntaxTree.BasicType);
  174. BEGIN (* no code emission *) END VisitBasicType;
  175. PROCEDURE VisitCharacterType*(x: SyntaxTree.CharacterType);
  176. BEGIN (* no code emission *) END VisitCharacterType;
  177. PROCEDURE VisitIntegerType*(x: SyntaxTree.IntegerType);
  178. BEGIN (* no code emission *) END VisitIntegerType;
  179. PROCEDURE VisitFloatType*(x: SyntaxTree.FloatType);
  180. BEGIN (* no code emission *) END VisitFloatType;
  181. PROCEDURE VisitComplexType*(x: SyntaxTree.ComplexType);
  182. BEGIN (* no code emission *) END VisitComplexType;
  183. PROCEDURE VisitQualifiedType*(x: SyntaxTree.QualifiedType);
  184. VAR type: SyntaxTree.Type;
  185. BEGIN (* no further traversal to x.resolved necessary since type descriptor and code will be inserted at "original" position ? *)
  186. type := x.resolved;
  187. IF (type.typeDeclaration # NIL) & (type.typeDeclaration.scope.ownerModule # module.module) THEN
  188. meta.CheckTypeDeclaration(type);
  189. END;
  190. END VisitQualifiedType;
  191. PROCEDURE VisitStringType*(x: SyntaxTree.StringType);
  192. BEGIN (* no code emission *) END VisitStringType;
  193. PROCEDURE VisitArrayRangeType(x: SyntaxTree.RangeType);
  194. BEGIN (* no code emission *)
  195. END VisitArrayRangeType;
  196. PROCEDURE VisitArrayType*(x: SyntaxTree.ArrayType);
  197. BEGIN (* no code emission *) END VisitArrayType;
  198. PROCEDURE VisitPortType*(x: SyntaxTree.PortType);
  199. BEGIN (* no code emission *) END VisitPortType;
  200. PROCEDURE VisitMathArrayType*(x: SyntaxTree.MathArrayType);
  201. BEGIN
  202. meta.CheckTypeDeclaration(x);
  203. END VisitMathArrayType;
  204. PROCEDURE VisitPointerType*(x: SyntaxTree.PointerType);
  205. BEGIN
  206. meta.CheckTypeDeclaration(x);
  207. (* base type must not be visited => will be done via record type declaration, otherwise is done twice ! *)
  208. END VisitPointerType;
  209. PROCEDURE VisitRecordType*(x: SyntaxTree.RecordType);
  210. VAR name: ARRAY 256 OF CHAR; td: SyntaxTree.TypeDeclaration;
  211. BEGIN (* no code emission *)
  212. meta.CheckTypeDeclaration(x);
  213. IF (x.recordScope.ownerModule = module.module) & (x.isObject) THEN
  214. IF x.pointerType.typeDeclaration # NIL THEN
  215. td := x.pointerType.typeDeclaration
  216. ELSE
  217. td := x.typeDeclaration
  218. END;
  219. Global.GetSymbolName(td,name);
  220. (* code section for object *)
  221. END;
  222. Scope(x.recordScope);
  223. END VisitRecordType;
  224. PROCEDURE HasFlag(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR): BOOLEAN;
  225. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  226. BEGIN
  227. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  228. WHILE (this # NIL) & (this.identifier# id) DO
  229. this := this.nextModifier;
  230. END;
  231. RETURN this # NIL
  232. END HasFlag;
  233. PROCEDURE VisitCellType*(x: SyntaxTree.CellType);
  234. VAR port,adr: LONGINT; symbol: IntermediateCode.Section; op: IntermediateCode.Operand; capabilities: SET;
  235. BEGIN
  236. IF backend.cellsAreObjects THEN meta.CheckTypeDeclaration(x) END;
  237. capabilities := {};
  238. IF HasFlag(x.modifiers, Global.StringFloatingPoint) THEN INCL(capabilities, Global.FloatingPointCapability) END;
  239. IF HasFlag(x.modifiers, Global.StringVector) THEN INCL(capabilities, Global.VectorCapability) END;
  240. backend.SetCapabilities(capabilities);
  241. IF ~implementationVisitor.checker.SkipImplementation(x) THEN
  242. Scope(x.cellScope);
  243. END;
  244. END VisitCellType;
  245. PROCEDURE VisitProcedureType*(x: SyntaxTree.ProcedureType);
  246. BEGIN (* no code emission *) END VisitProcedureType;
  247. PROCEDURE VisitEnumerationType*(x: SyntaxTree.EnumerationType);
  248. BEGIN (* no code emission, exported enumeration type values should be included in symbol file *)
  249. END VisitEnumerationType;
  250. (* symbols *)
  251. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  252. BEGIN
  253. Procedure(x);
  254. END VisitProcedure;
  255. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  256. BEGIN
  257. Procedure(x);
  258. END VisitOperator;
  259. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  260. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, dim, i: LONGINT;
  261. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  262. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  263. BEGIN
  264. type := type.resolved;
  265. IF type IS SyntaxTree.RecordType THEN
  266. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  267. ELSIF (type IS SyntaxTree.ArrayType) THEN
  268. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  269. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  270. END;
  271. ELSIF type IS SyntaxTree.MathArrayType THEN
  272. WITH type: SyntaxTree.MathArrayType DO
  273. IF type.form = SyntaxTree.Open THEN
  274. RETURN TRUE
  275. ELSIF type.form = SyntaxTree.Static THEN
  276. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  277. END;
  278. END;
  279. END;
  280. RETURN FALSE
  281. END TypeNeedsInitialization;
  282. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  283. VAR variable: SyntaxTree.Variable;
  284. BEGIN
  285. variable := scope.firstVariable;
  286. WHILE variable # NIL DO
  287. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  288. IF variable.initializer # NIL THEN RETURN TRUE END;
  289. variable := variable.nextVariable;
  290. END;
  291. RETURN FALSE
  292. END ScopeNeedsInitialization;
  293. PROCEDURE SingleInitialize(CONST op: IntermediateCode.Operand; offset:LONGINT);
  294. VAR size: LONGINT;
  295. BEGIN
  296. size := offset - lastUpdated;
  297. IF size > 0 THEN
  298. irv.Emit(Reserve(x.position,size));
  299. END;
  300. irv.Emit(Data(x.position, op));
  301. lastUpdated := offset + ToMemoryUnits(system, op.type.sizeInBits);
  302. END SingleInitialize;
  303. PROCEDURE Initialize(type: SyntaxTree.Type; initializer: SyntaxTree.Expression; offset:LONGINT);
  304. VAR op: Operand; baseType: SyntaxTree.Type; variable: SyntaxTree.Variable; i: LONGINT; size:LONGINT;
  305. BEGIN
  306. IF type = NIL THEN RETURN ELSE type := type.resolved END;
  307. WITH type: SyntaxTree.RecordType DO
  308. baseType := type.baseType;
  309. IF baseType # NIL THEN
  310. baseType := baseType.resolved;
  311. IF baseType IS SyntaxTree.PointerType THEN
  312. baseType := baseType(SyntaxTree.PointerType).pointerBase
  313. END;
  314. Initialize(baseType,NIL, offset);
  315. END;
  316. variable := type.recordScope.firstVariable;
  317. WHILE variable # NIL DO
  318. Initialize(variable.type, variable.initializer, offset+ToMemoryUnits(system,variable.offsetInBits));
  319. variable := variable.nextVariable
  320. END;
  321. | type: SyntaxTree.ArrayType DO
  322. IF type.form = SyntaxTree.Static THEN
  323. baseType := type.arrayBase;
  324. IF TypeNeedsInitialization(baseType) THEN
  325. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  326. FOR i := 0 TO type.staticLength-1 DO
  327. Initialize(baseType,NIL,offset+i*size);
  328. END;
  329. END;
  330. END;
  331. | type: SyntaxTree.MathArrayType DO
  332. IF type.form = SyntaxTree.Open THEN
  333. dim := DynamicDim(type);
  334. baseType := SemanticChecker.ArrayBase(type,dim);
  335. imm := IntermediateCode.Immediate(addressType,dim);
  336. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathDimOffset);
  337. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  338. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  339. SingleInitialize(imm, offset + ToMemoryUnits(system, addressType.sizeInBits)* MathElementSizeOffset);
  340. (* flags remain empty (=0) for open array *)
  341. ELSIF type.form = SyntaxTree.Static THEN
  342. baseType := type.arrayBase;
  343. IF TypeNeedsInitialization(baseType) THEN
  344. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  345. ASSERT(type.staticLength < 1024*1024*1024);
  346. FOR i := 0 TO type.staticLength-1 DO
  347. Initialize(baseType,NIL,offset+i*size);
  348. END;
  349. END;
  350. END;
  351. ELSE
  352. IF initializer # NIL THEN
  353. implementationVisitor.Evaluate(initializer, op);
  354. SingleInitialize(op.op, offset);
  355. END;
  356. END;
  357. END Initialize;
  358. BEGIN
  359. IF x.externalName # NIL THEN RETURN END;
  360. IF (currentScope IS SyntaxTree.ModuleScope) OR (currentScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  361. (* code section for variable *)
  362. Global.GetSymbolSegmentedName(x,name);
  363. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  364. irv.SetExported(IsExported(x));
  365. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  366. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  367. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  368. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  369. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  370. FOR i := 0 TO DynamicDim(x.type)-1 DO
  371. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  372. END;
  373. ELSE
  374. lastUpdated:= 0;
  375. IF ((x.initializer # NIL) OR TypeNeedsInitialization(x.type)) THEN
  376. Initialize(x.type, x.initializer, 0);
  377. END;
  378. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  379. IF size > 0 THEN
  380. irv.Emit(Reserve(x.position,size));
  381. END;
  382. IF ~x.fixed THEN
  383. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  384. ELSE
  385. align := x.alignment;
  386. END;
  387. irv.SetPositionOrAlignment(x.fixed, align);
  388. meta.CheckTypeDeclaration(x.type);
  389. END;
  390. ELSIF currentScope IS SyntaxTree.RecordScope THEN
  391. ELSIF currentScope IS SyntaxTree.ProcedureScope THEN
  392. END;
  393. (* do not call Type(x.type) here as this must already performed in the type declaration section ! *)
  394. END VisitVariable;
  395. PROCEDURE VisitProperty*(x: SyntaxTree.Property);
  396. BEGIN
  397. VisitVariable(x)
  398. END VisitProperty;
  399. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  400. VAR name: Basic.SegmentedName; irv: IntermediateCode.Section; align, i, dim: LONGINT;
  401. size: LONGINT; lastUpdated: LONGINT; imm: IntermediateCode.Operand;
  402. BEGIN
  403. ASSERT(currentScope IS SyntaxTree.CellScope);
  404. Global.GetSymbolSegmentedName(x,name);
  405. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,x,dump);
  406. irv.SetExported(IsExported(x));
  407. irv.SetOffset(ToMemoryUnits(system,x.offsetInBits));
  408. IF (currentScope IS SyntaxTree.CellScope) & IsSemiDynamicArray(x.type) THEN
  409. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  410. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  411. irv := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  412. FOR i := 0 TO DynamicDim(x.type)-1 DO
  413. irv.Emit(Reserve(x.position, ToMemoryUnits(system, system.addressSize)));
  414. END;
  415. ELSE
  416. lastUpdated:= 0;
  417. size := ToMemoryUnits(system,system.SizeOf(x.type)) - lastUpdated;
  418. IF size > 0 THEN
  419. irv.Emit(Reserve(x.position,size));
  420. END;
  421. IF ~x.fixed THEN
  422. align := CommonAlignment(x.alignment, ToMemoryUnits(system, system.AlignmentOf(system.variableAlignment, x.type)));
  423. ELSE
  424. align := x.alignment;
  425. END;
  426. irv.SetPositionOrAlignment(x.fixed, align);
  427. meta.CheckTypeDeclaration(x.type);
  428. END;
  429. END VisitParameter;
  430. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  431. BEGIN
  432. Type(x.declaredType); (* => code in objects *)
  433. IF ~(x.declaredType IS SyntaxTree.QualifiedType) & (x.declaredType.resolved IS SyntaxTree.PointerType) THEN
  434. Type(x.declaredType.resolved(SyntaxTree.PointerType).pointerBase);
  435. END;
  436. END VisitTypeDeclaration;
  437. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  438. BEGIN
  439. IF (SyntaxTree.Public * x.access # {}) THEN
  440. implementationVisitor.VisitConstant(x);
  441. END;
  442. END VisitConstant;
  443. PROCEDURE Scope(x: SyntaxTree.Scope);
  444. VAR procedure: SyntaxTree.Procedure;
  445. constant: SyntaxTree.Constant;
  446. variable: SyntaxTree.Variable;
  447. prevScope: SyntaxTree.Scope; typeDeclaration: SyntaxTree.TypeDeclaration;
  448. cell: SyntaxTree.CellType;
  449. parameter: SyntaxTree.Parameter;
  450. property: SyntaxTree.Property;
  451. BEGIN
  452. prevScope := currentScope;
  453. currentScope := x;
  454. (* constants treated in implementation visitor *)
  455. WITH x: SyntaxTree.CellScope DO
  456. cell := x.ownerCell;
  457. parameter := cell.firstParameter;
  458. WHILE parameter # NIL DO
  459. VisitParameter(parameter);
  460. parameter := parameter.nextParameter;
  461. END;
  462. property := cell.firstProperty;
  463. WHILE property # NIL DO
  464. VisitProperty(property);
  465. property := property.nextProperty;
  466. END;
  467. ELSE
  468. END;
  469. typeDeclaration := x.firstTypeDeclaration;
  470. WHILE typeDeclaration # NIL DO
  471. VisitTypeDeclaration(typeDeclaration);
  472. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  473. END;
  474. variable := x.firstVariable;
  475. WHILE variable # NIL DO
  476. VisitVariable(variable);
  477. variable := variable.nextVariable;
  478. END;
  479. procedure := x.firstProcedure;
  480. WHILE procedure # NIL DO
  481. VisitProcedure(procedure);
  482. procedure := procedure.nextProcedure;
  483. END;
  484. constant := x.firstConstant;
  485. WHILE constant # NIL DO
  486. VisitConstant(constant);
  487. constant := constant.nextConstant;
  488. END;
  489. currentScope := prevScope;
  490. END Scope;
  491. PROCEDURE Parameters(first: SyntaxTree.Parameter);
  492. VAR parameter: SyntaxTree.Parameter;
  493. BEGIN
  494. parameter := first;
  495. WHILE parameter # NIL DO
  496. VisitParameter(parameter);
  497. parameter := parameter.nextParameter;
  498. END;
  499. END Parameters;
  500. PROCEDURE Procedure(x: SyntaxTree.Procedure);
  501. VAR scope: SyntaxTree.ProcedureScope;
  502. prevScope: SyntaxTree.Scope;
  503. inline, finalizer: BOOLEAN;
  504. procedureType: SyntaxTree.ProcedureType;
  505. pc: LONGINT;
  506. memorySize: Basic.Integer; stackSize: LONGINT;
  507. name,baseObject: Basic.SegmentedName; ir: IntermediateCode.Section;
  508. null,size,src,dest,fp,res: IntermediateCode.Operand;
  509. callingConvention: LONGINT;
  510. cellType: SyntaxTree.CellType;
  511. registerNumber: LONGINT;
  512. registerParameters: SIZE;
  513. registerClass: IntermediateCode.RegisterClass;
  514. type: IntermediateCode.Type;
  515. formalParameter: SyntaxTree.Parameter;
  516. recordType: SyntaxTree.RecordType;
  517. isModuleBody: BOOLEAN;
  518. parametersSize: LONGINT;
  519. position: LONGINT;
  520. variable: SyntaxTree.Variable;
  521. PROCEDURE Signature;
  522. VAR parameter: SyntaxTree.Parameter; procedureType: SyntaxTree.ProcedureType; returnType : SyntaxTree.Type;
  523. BEGIN
  524. procedureType := x.type(SyntaxTree.ProcedureType);
  525. returnType := procedureType.returnType;
  526. IF returnType # NIL THEN
  527. meta.CheckTypeDeclaration(returnType)
  528. END;
  529. parameter := procedureType.firstParameter;
  530. WHILE parameter # NIL DO
  531. meta.CheckTypeDeclaration(parameter.type); (* we have to re-export a type, i.e. it has to be present in the list of symbols *)
  532. parameter := parameter.nextParameter;
  533. END;
  534. END Signature;
  535. PROCEDURE CheckIntegerValue(x: SyntaxTree.Expression; VAR value: Basic.Integer): BOOLEAN;
  536. VAR result: BOOLEAN;
  537. BEGIN
  538. result := FALSE;
  539. IF x = SyntaxTree.invalidExpression THEN
  540. ELSIF (x.resolved # NIL) & (x.resolved IS SyntaxTree.IntegerValue) THEN
  541. result := TRUE;
  542. value := x.resolved(SyntaxTree.IntegerValue).value;
  543. ELSE
  544. Error(x.position,"expression is not an integer constant");
  545. END;
  546. RETURN result;
  547. END CheckIntegerValue;
  548. PROCEDURE HasValue(modifiers: SyntaxTree.Modifier; CONST name: ARRAY OF CHAR; VAR value: Basic.Integer): BOOLEAN;
  549. VAR this: SyntaxTree.Modifier; id: SyntaxTree.Identifier;
  550. BEGIN
  551. this := modifiers; id := SyntaxTree.NewIdentifier(name);
  552. WHILE (this # NIL) & (this.identifier # id) DO
  553. this := this.nextModifier;
  554. END;
  555. IF this # NIL THEN
  556. IF this.expression = NIL THEN
  557. Error(this.position,"expected expression value");
  558. ELSIF CheckIntegerValue(this.expression,value) THEN
  559. END;
  560. RETURN TRUE
  561. ELSE RETURN FALSE
  562. END;
  563. END HasValue;
  564. CONST DefaultDataMemorySize=512;
  565. BEGIN
  566. IF x.externalName # NIL THEN RETURN END;
  567. (*
  568. IF Trace & (dump # NIL) THEN dump.String("DeclarationVisitor:Procedure"); dump.Ln END;
  569. *)
  570. (* code section for this procedure *)
  571. position := x.position.start;
  572. scope := x.procedureScope;
  573. prevScope := currentScope;
  574. currentScope := scope;
  575. procedureType := x.type(SyntaxTree.ProcedureType);
  576. isModuleBody := x = module.module.moduleScope.bodyProcedure;
  577. implementationVisitor.temporaries.Clear;
  578. implementationVisitor.usedRegisters := NIL;
  579. implementationVisitor.registerUsageCount.Init;
  580. implementationVisitor.GetCodeSectionNameForSymbol(x, name);
  581. IF (scope.body # NIL) & (x.isInline) THEN
  582. inline := TRUE;
  583. ir := implementationVisitor.NewSection(module.allSections, Sections.InlineCodeSection, name,x,dump);
  584. ir.SetExported(IsExported(x));
  585. ELSIF (x.scope # NIL) & (x.scope IS SyntaxTree.CellScope) & (x.scope(SyntaxTree.CellScope).ownerCell.isCellNet)
  586. OR (x.scope # NIL) & (x.scope IS SyntaxTree.ModuleScope) & (x.scope(SyntaxTree.ModuleScope).ownerModule.isCellNet) THEN
  587. IF backend.cellsAreObjects THEN
  588. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name, x, dump);
  589. ir.SetExported(IsExported(x));
  590. ELSE
  591. RETURN; (* cellnet cannot be compiled for final static hardware *)
  592. END;
  593. ELSIF x = module.module.moduleScope.bodyProcedure THEN
  594. inline := FALSE;
  595. AddBodyCallStub(x);
  596. ir := implementationVisitor.NewSection(module.allSections, Sections.BodyCodeSection, name,x,dump);
  597. ir.SetExported(IsExported(x));
  598. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x = scope.outerScope(SyntaxTree.CellScope).bodyProcedure) THEN
  599. inline := FALSE;
  600. cellType := scope.outerScope(SyntaxTree.CellScope).ownerCell;
  601. IF ~HasValue(cellType.modifiers,Global.StringDataMemorySize,memorySize) THEN memorySize := DefaultDataMemorySize END;
  602. AddBodyCallStub(x);
  603. AddStackAllocation(x,memorySize);
  604. ir := implementationVisitor.NewSection(module.allSections,Sections.BodyCodeSection, name,x,dump);
  605. ir.SetExported(IsExported(x));
  606. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & (x.isConstructor) THEN
  607. inline := FALSE;
  608. Parameters(procedureType.firstParameter);
  609. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  610. ir.SetExported(IsExported(x));
  611. ELSE
  612. inline := FALSE;
  613. IF x.isEntry OR x.isExit THEN
  614. IF x.isEntry THEN
  615. ir := implementationVisitor.NewSection(module.allSections, Sections.EntryCodeSection, name,x,dump);
  616. ELSE
  617. ir := implementationVisitor.NewSection(module.allSections, Sections.ExitCodeSection, name,x,dump);
  618. END;
  619. ir.SetExported(TRUE);
  620. ELSE
  621. ir := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,x,dump);
  622. ir.SetExported(IsExported(x) OR SemanticChecker.InMethodTable(x));
  623. END;
  624. END;
  625. callingConvention := procedureType.callingConvention;
  626. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  627. parametersSize := ProcedureParametersSize(backend.system,x);
  628. ELSE
  629. parametersSize := 0;
  630. END;
  631. IF scope.body # NIL THEN
  632. IF implementationVisitor.emitLabels THEN ir.Emit(LabelInstruction(scope.body.position)) END;
  633. registerNumber := 0;
  634. IF ~inline THEN
  635. IF scope.lastVariable = NIL THEN
  636. stackSize := 0
  637. ELSE
  638. stackSize := scope.lastVariable.offsetInBits;
  639. IF stackSize <0 THEN stackSize := -stackSize END;
  640. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  641. END;
  642. (*
  643. ir.Emit(Nop(position)); (* placeholder for stack frame check *)
  644. ir.Emit(Nop(position)); (* placeholder for stack frame check (2) *)
  645. *)
  646. (*
  647. ir.Emit(Nop(position)); (* placeholder for fill *)
  648. *)
  649. IF (callingConvention # SyntaxTree.OberonCallingConvention) & (~(callingConvention IN SysvABI) OR (system.addressSize # 64)) THEN
  650. registerParameters := backend.NumberParameterRegisters(callingConvention);
  651. (* assumption: registers are passed left to right and left parameters are in registers *)
  652. formalParameter := procedureType.firstParameter;
  653. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  654. IF ~PassInRegister(formalParameter, callingConvention) THEN
  655. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  656. ELSE
  657. IF formalParameter.type.IsRecordType() THEN
  658. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  659. type := addressType;
  660. ELSE
  661. type := GetType(system, formalParameter.type);
  662. END;
  663. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention, type, registerNumber));
  664. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  665. IntermediateCode.InitMemory(dest,type,implementationVisitor.sp,ToMemoryUnits(system,formalParameter.offsetInBits - system.addressSize));
  666. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  667. implementationVisitor.ReleaseIntermediateOperand(src);
  668. INC(registerNumber);
  669. formalParameter := formalParameter.nextParameter;
  670. END;
  671. END;
  672. END;
  673. IF ~procedureType.noPAF THEN (* no procedure activation frame ! *)
  674. implementationVisitor.EmitEnter(ir,x.position,x,callingConvention,ToMemoryUnits(system,stackSize),registerNumber);
  675. END;
  676. pc := ir.pc-1;
  677. IF (callingConvention IN SysvABI) & (system.addressSize = 64) THEN
  678. registerParameters := backend.NumberParameterRegisters(callingConvention);
  679. (* assumption: registers are passed left to right and left parameters are in registers *)
  680. formalParameter := procedureType.firstParameter;
  681. WHILE (formalParameter # NIL) & (registerNumber < registerParameters) DO
  682. IF ~PassInRegister(formalParameter, callingConvention) THEN
  683. Error(formalParameter.position,"Calling convention error: cannot be passed as register");
  684. ELSE
  685. IF formalParameter.type.IsRecordType() THEN
  686. ASSERT (formalParameter.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter});
  687. type := addressType;
  688. ELSE
  689. type := GetType(system, formalParameter.type);
  690. END;
  691. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention, type, registerNumber));
  692. src := IntermediateCode.Register(type, registerClass, implementationVisitor.AcquireRegister(type, registerClass));
  693. implementationVisitor.currentScope := currentScope;
  694. variable := implementationVisitor.GetTemporaryVariable(formalParameter.type,FALSE,FALSE);
  695. formalParameter.SetOffset(variable.offsetInBits);
  696. IntermediateCode.InitMemory(dest,type,implementationVisitor.fp,ToMemoryUnits(system,formalParameter.offsetInBits));
  697. ir.Emit(Mov(Basic.invalidPosition,dest, src));
  698. implementationVisitor.ReleaseIntermediateOperand(src);
  699. INC(registerNumber);
  700. formalParameter := formalParameter.nextParameter;
  701. END;
  702. END;
  703. END;
  704. END;
  705. implementationVisitor.tagsAvailable := callingConvention = SyntaxTree.OberonCallingConvention;
  706. implementationVisitor.Body(scope.body,currentScope,ir,isModuleBody);
  707. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  708. IF scope.lastVariable # NIL THEN
  709. stackSize := scope.lastVariable.offsetInBits;
  710. IF stackSize <0 THEN stackSize := -stackSize END;
  711. Basic.Align(stackSize,system.AlignmentOf(system.parameterAlignment,system.byteType)); (* round up to parameter alignment *)
  712. END;
  713. END;
  714. IF ~inline & ~(procedureType.noPAF) & ~x.isEntry & ~x.isExit THEN
  715. IF ToMemoryUnits(system,stackSize) > 4*1024-256 THEN (* stack frame potentially larger than page size *) (*! get page size from backend *)
  716. (*! unnecessary with new implementation of ENTER -- should potentially be called by backend
  717. IF implementationVisitor.GetRuntimeProcedure(implementationVisitor.builtinsModuleName,"EnsureAllocatedStack",procedure,TRUE) THEN
  718. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,stackSize+256));
  719. ir.EmitAt(pc,Push(size));
  720. implementationVisitor.StaticCallOperand(result,procedure);
  721. ir.EmitAt(pc+1,Call(result.op,ProcedureParametersSize(system,procedure)));
  722. END;
  723. *)
  724. END;
  725. ir.EmitAt(pc(*+2*),implementationVisitor.Enter(x.position,callingConvention,ToMemoryUnits(system,stackSize))); (*!!*)
  726. IF stackSize > 0 THEN
  727. IF (stackSize MOD system.addressSize = 0) THEN
  728. null := IntermediateCode.Immediate(addressType,0);
  729. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  730. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-system.addressSize));
  731. size := IntermediateCode.Immediate(addressType,stackSize DIV system.addressSize);
  732. ELSE
  733. null := IntermediateCode.Immediate(int8,0);
  734. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  735. IntermediateCode.AddOffset(fp,ToMemoryUnits(system,-null.type.sizeInBits));
  736. size := IntermediateCode.Immediate(addressType,stackSize DIV null.type.sizeInBits);
  737. END;
  738. (*! should potentially be called by backend -- enter might initialize
  739. ir.EmitAt(pc+3,Fill(fp,null,size,TRUE));
  740. *)
  741. END;
  742. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  743. parametersSize := ProcedureParametersSize(backend.system,x);
  744. ELSE
  745. parametersSize := 0;
  746. END;
  747. IF (procedureType.returnType = NIL) OR (scope.body.code # NIL) THEN
  748. finalizer := FALSE;
  749. IF backend.cooperative & x.isFinalizer THEN
  750. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  751. Basic.ToSegmentedName("BaseTypes.Object", baseObject);
  752. GetRecordTypeName(recordType,name);
  753. finalizer := (name # baseObject) & (recordType.baseType = NIL);
  754. END;
  755. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  756. IF backend.cooperative THEN
  757. IF HasPointers (scope) THEN implementationVisitor.ResetVariables(scope); END;
  758. IF implementationVisitor.profile & ~isModuleBody THEN
  759. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE)
  760. END;
  761. ELSE
  762. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  763. END;
  764. implementationVisitor.EmitLeave(ir, x.position,x,callingConvention);
  765. IF finalizer THEN
  766. IF backend.hasLinkRegister THEN
  767. ir.Emit(Pop(Basic.invalidPosition, implementationVisitor.lr));
  768. END;
  769. Basic.ToSegmentedName("BaseTypes.Object.Finalize", name);
  770. IntermediateCode.InitAddress(dest, addressType, name , 0, 0);
  771. ir.Emit(Br(x.position,dest));
  772. ELSE
  773. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  774. END;
  775. ELSE
  776. IF ~scope.body.isUnchecked & ~backend.noRuntimeChecks THEN
  777. implementationVisitor.EmitTrap(x.position,ReturnTrap);
  778. END;
  779. implementationVisitor.SetLabel(implementationVisitor.exitLabel);
  780. IF backend.cooperative THEN
  781. IF HasPointers (scope) THEN
  782. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  783. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  784. ir.Emit(Result(x.position, res));
  785. ir.Emit(Push(x.position, res));
  786. implementationVisitor.ResetVariables(scope);
  787. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  788. ir.Emit(Pop(x.position, res));
  789. ir.Emit(Return(x.position, res));
  790. ELSE
  791. implementationVisitor.ResetVariables(scope);
  792. IF implementationVisitor.profile & ~isModuleBody THEN implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE) END;
  793. END;
  794. ELSIF implementationVisitor.profile & ~isModuleBody THEN
  795. IF ~SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  796. res := implementationVisitor.NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  797. ir.Emit(Result(x.position, res));
  798. ir.Emit(Push(x.position, res));
  799. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  800. ir.Emit(Pop(x.position, res));
  801. ir.Emit(Return(x.position, res));
  802. ELSE
  803. implementationVisitor.ProfilerEnterExit(implementationVisitor.numberProcedures-1, FALSE);
  804. END;
  805. END;
  806. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  807. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  808. ELSE
  809. IF backend.writeBarriers & HasPointers(scope) THEN implementationVisitor.ResetVariables2(scope,FALSE) END;
  810. ir.Emit(Nop(x.position));
  811. IF scope.body.isUnchecked OR backend.noRuntimeChecks THEN (* return from procedure in any case *)
  812. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  813. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  814. END;
  815. END;
  816. END
  817. END;
  818. ELSE (* force body for procedures *)
  819. implementationVisitor.EmitEnter(ir, x.position,x,callingConvention,0,0);
  820. implementationVisitor.Body(scope.body,currentScope,ir,x = module.module.moduleScope.bodyProcedure);
  821. (*IF implementationVisitor.usedRegisters # NIL THEN D.TraceBack END;*)
  822. implementationVisitor.EmitLeave(ir,x.position,x,callingConvention);
  823. ir.Emit(Exit(x.position,procedureType.pcOffset,callingConvention, parametersSize));
  824. END;
  825. Scope(scope);
  826. Signature;
  827. IF (x IS SyntaxTree.Operator) & x(SyntaxTree.Operator).isDynamic THEN implementationVisitor.RegisterDynamicOperator(x(SyntaxTree.Operator)) END;
  828. currentScope := prevScope;
  829. END Procedure;
  830. PROCEDURE AddBodyCallStub(bodyProcedure: SyntaxTree.Procedure); (* code that is only necessary for static linkers *)
  831. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope; name: Basic.SegmentedName;
  832. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  833. BEGIN
  834. ASSERT (bodyProcedure # NIL);
  835. procedureScope := SyntaxTree.NewProcedureScope(bodyProcedure.scope);
  836. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,SyntaxTree.NewIdentifier("@BodyStub"), procedureScope);
  837. procedure.SetScope(bodyProcedure.scope);
  838. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,bodyProcedure.scope));
  839. procedure.SetAccess(SyntaxTree.Hidden);
  840. Global.GetSymbolSegmentedName (procedure,name);
  841. ir := implementationVisitor.NewSection(module.allSections, Sections.InitCodeSection, name,procedure,dump);
  842. ir.SetExported(TRUE);
  843. Global.GetSymbolSegmentedName (bodyProcedure,name);
  844. IF ~meta.simple THEN
  845. implementationVisitor.currentScope := module.module.moduleScope;
  846. implementationVisitor.section := ir;
  847. implementationVisitor.PushSelfPointer();
  848. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Register",1);
  849. ELSIF backend.preregisterStatic THEN
  850. implementationVisitor.currentScope := module.module.moduleScope;
  851. implementationVisitor.section := ir;
  852. implementationVisitor.PushSelfPointer();
  853. implementationVisitor.CallThis(bodyProcedure.position,"Modules","Preregister",1);
  854. ELSE
  855. IntermediateCode.InitAddress(op, addressType, name, implementationVisitor.GetFingerprint(bodyProcedure), 0);
  856. ir.Emit(Call(bodyProcedure.position,op, 0));
  857. END;
  858. END AddBodyCallStub;
  859. PROCEDURE AddStackAllocation(symbol: SyntaxTree.Symbol; initStack: Basic.Integer); (* code that is only necessary for static linkers *)
  860. VAR name: Basic.SegmentedName;
  861. ir: IntermediateCode.Section; op: IntermediateCode.Operand;
  862. BEGIN
  863. Global.GetSymbolSegmentedName (symbol,name);
  864. Basic.RemoveSuffix(name);
  865. Basic.SuffixSegmentedName(name, Basic.MakeString("@StackAllocation"));
  866. ir := implementationVisitor.NewSection(module.allSections,Sections.EntryCodeSection,name,NIL,dump);
  867. ir.SetExported(TRUE);
  868. IntermediateCode.InitImmediate(op,addressType,initStack);
  869. ir.Emit(Mov(Basic.invalidPosition,implementationVisitor.sp,op));
  870. END AddStackAllocation;
  871. (** entry function to visit a complete module *)
  872. PROCEDURE Module(x: SyntaxTree.Module; module: Sections.Module);
  873. VAR
  874. ir: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; idstr: SyntaxTree.IdentifierString;
  875. hasDynamicOperatorDeclarations: BOOLEAN;
  876. operator: SyntaxTree.Operator;
  877. import: SyntaxTree.Import;
  878. PROCEDURE TypeNeedsInitialization(type: SyntaxTree.Type): BOOLEAN;
  879. BEGIN
  880. type := type.resolved;
  881. IF type IS SyntaxTree.RecordType THEN
  882. IF ScopeNeedsInitialization(type(SyntaxTree.RecordType).recordScope) THEN RETURN TRUE END;
  883. ELSIF (type IS SyntaxTree.ArrayType) THEN
  884. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  885. IF TypeNeedsInitialization(type(SyntaxTree.ArrayType).arrayBase) THEN RETURN TRUE END;
  886. END;
  887. ELSIF type IS SyntaxTree.MathArrayType THEN
  888. WITH type: SyntaxTree.MathArrayType DO
  889. IF type.form = SyntaxTree.Open THEN
  890. RETURN TRUE
  891. ELSIF type.form = SyntaxTree.Static THEN
  892. IF TypeNeedsInitialization(type.arrayBase) THEN RETURN TRUE END;
  893. END;
  894. END;
  895. END;
  896. RETURN FALSE
  897. END TypeNeedsInitialization;
  898. PROCEDURE ScopeNeedsInitialization(scope: SyntaxTree.Scope): BOOLEAN;
  899. VAR variable: SyntaxTree.Variable;
  900. BEGIN
  901. variable := scope.firstVariable;
  902. WHILE variable # NIL DO
  903. IF TypeNeedsInitialization(variable.type) THEN RETURN TRUE END;
  904. IF variable.initializer # NIL THEN RETURN TRUE END;
  905. variable := variable.nextVariable;
  906. END;
  907. RETURN FALSE
  908. END ScopeNeedsInitialization;
  909. BEGIN
  910. ASSERT(x # NIL); ASSERT(module # NIL);
  911. SELF.module := module;
  912. (* add import names to the generated Sections.Module *)
  913. import := x.moduleScope.firstImport;
  914. WHILE import # NIL DO
  915. import.module.GetName(idstr);
  916. module.imports.AddName(idstr);
  917. import := import.nextImport
  918. END;
  919. implementationVisitor.module := module;
  920. implementationVisitor.moduleScope := x.moduleScope;
  921. implementationVisitor.moduleSelf := moduleSelf;
  922. implementationVisitor.canBeLoaded := TRUE;
  923. meta.SetModule(module);
  924. IF (forceModuleBody OR ~meta.simple OR ScopeNeedsInitialization(x.moduleScope)) THEN
  925. EnsureBodyProcedure(x.moduleScope); (* currently needed in Oberon, remove ? *)
  926. END;
  927. IF backend.profile THEN
  928. EnsureBodyProcedure(x.moduleScope);
  929. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@ModuleId"));
  930. implementationVisitor.profileId := implementationVisitor.NewSection(module.allSections, Sections.VarSection, name,NIL,dump);
  931. implementationVisitor.profileId.Emit(Reserve(Basic.invalidPosition,ToMemoryUnits(system,system.SizeOf(system.longintType))));
  932. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@InitProfiler"));
  933. implementationVisitor.profileInit := implementationVisitor.NewSection(module.allSections, Sections.CodeSection, name,NIL,dump);
  934. implementationVisitor.EmitEnter(implementationVisitor.profileInit,Basic.invalidPosition,NIL,0,0,0);
  935. Global.GetModuleName(module.module,idstr);
  936. implementationVisitor.ProfilerAddModule(idstr);
  937. implementationVisitor.numberProcedures := 0;
  938. END;
  939. implementationVisitor.profile := backend.profile;
  940. (* check if there is at least one dynamic operator locally defined *)
  941. hasDynamicOperatorDeclarations := FALSE;
  942. operator := x.moduleScope.firstOperator;
  943. WHILE operator # NIL DO
  944. IF operator.isDynamic THEN hasDynamicOperatorDeclarations := TRUE END;
  945. operator := operator.nextOperator
  946. END;
  947. (* add operator initialization code section *)
  948. IF hasDynamicOperatorDeclarations THEN
  949. EnsureBodyProcedure(x.moduleScope);
  950. Global.GetModuleSegmentedName(module.module,name); Basic.SuffixSegmentedName(name, Basic.MakeString("@OperatorInitialization"));
  951. implementationVisitor.operatorInitializationCodeSection := implementationVisitor.NewSection(module.allSections, Sections.CodeSection,name, NIL, dump);
  952. implementationVisitor.EmitEnter(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0,0,0);
  953. END;
  954. Scope(x.moduleScope);
  955. IF hasDynamicOperatorDeclarations THEN
  956. implementationVisitor.EmitLeave(implementationVisitor.operatorInitializationCodeSection,Basic.invalidPosition,NIL,0);
  957. implementationVisitor.operatorInitializationCodeSection.Emit(Exit(Basic.invalidPosition,0,0,0));
  958. END;
  959. IF backend.profile THEN
  960. implementationVisitor.ProfilerPatchInit;
  961. END;
  962. END Module;
  963. END DeclarationVisitor;
  964. UsedArray*=POINTER TO ARRAY OF RECORD count: LONGINT; map: LONGINT; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass END;
  965. RegisterUsageCount*=OBJECT
  966. VAR used: UsedArray; count: LONGINT;
  967. PROCEDURE &Init;
  968. VAR i: LONGINT;
  969. BEGIN
  970. count := 0;
  971. IF used = NIL THEN NEW(used,64); END;
  972. FOR i := 0 TO LEN(used)-1 DO used[i].count := 0; used[i].map := i END;
  973. END Init;
  974. PROCEDURE Grow;
  975. VAR new: UsedArray; size,i: LONGINT;
  976. BEGIN
  977. size := LEN(used)*2;
  978. NEW(new,size);
  979. FOR i := 0 TO LEN(used)-1 DO
  980. new[i].count := used[i].count;
  981. new[i].type := used[i].type;
  982. new[i].map := used[i].map
  983. END;
  984. FOR i := LEN(used) TO LEN(new)-1 DO new[i].count := 0 END;
  985. used := new
  986. END Grow;
  987. PROCEDURE Next(type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  988. BEGIN
  989. INC(count);
  990. IF count = LEN(used) THEN Grow END;
  991. used[count].type := type;
  992. used[count].class := class;
  993. used[count].map := count;
  994. RETURN count;
  995. END Next;
  996. PROCEDURE IncUse(register: LONGINT);
  997. BEGIN
  998. INC(used[register].count);
  999. (*
  1000. IF (register = 1) & (count > 30) THEN
  1001. D.TraceBack;
  1002. END;
  1003. *)
  1004. END IncUse;
  1005. PROCEDURE DecUse(register: LONGINT);
  1006. BEGIN
  1007. DEC(used[register].count);
  1008. END DecUse;
  1009. PROCEDURE Map(register: LONGINT): LONGINT;
  1010. VAR map : LONGINT;
  1011. BEGIN
  1012. IF register > 0 THEN
  1013. map := used[register].map;
  1014. WHILE register # map DO register := map; map := used[register].map END;
  1015. END;
  1016. RETURN register
  1017. END Map;
  1018. PROCEDURE Use(register: LONGINT): LONGINT;
  1019. BEGIN
  1020. IF register< LEN(used) THEN
  1021. RETURN used[register].count
  1022. ELSE
  1023. RETURN 0
  1024. END
  1025. END Use;
  1026. END RegisterUsageCount;
  1027. RegisterEntry = POINTER TO RECORD
  1028. prev,next: RegisterEntry;
  1029. register: LONGINT;
  1030. registerClass: IntermediateCode.RegisterClass;
  1031. type: IntermediateCode.Type;
  1032. END;
  1033. VariableUse= ARRAY 32 OF SET; (* upper bound of 1024 temporary variables in a procedure .. should be enough for all times *)
  1034. Variables = OBJECT (Basic.List)
  1035. VAR
  1036. inUse: VariableUse;
  1037. registerIndex: LONGINT;
  1038. nameIndex: LONGINT;
  1039. PROCEDURE & Init;
  1040. VAR i: LONGINT;
  1041. BEGIN
  1042. InitList(16);
  1043. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1044. registerIndex := 1024;
  1045. nameIndex := 0;
  1046. END Init;
  1047. PROCEDURE Clear*;
  1048. VAR i: LONGINT;
  1049. BEGIN
  1050. Clear^;
  1051. FOR i := 0 TO LEN(inUse)-1 DO inUse[i] := {} END;
  1052. registerIndex := 1024;
  1053. nameIndex := 0;
  1054. END Clear;
  1055. PROCEDURE GetUID(): SyntaxTree.Identifier;
  1056. VAR string: SyntaxTree.IdentifierString ;
  1057. BEGIN
  1058. COPY("@hiddenIRVar",string);
  1059. Basic.AppendNumber(string, nameIndex); INC(nameIndex);
  1060. RETURN SyntaxTree.NewIdentifier(string);
  1061. END GetUID;
  1062. PROCEDURE GetUsage(VAR use: VariableUse);
  1063. BEGIN
  1064. use := inUse;
  1065. END GetUsage;
  1066. PROCEDURE SetUsage(CONST use: VariableUse);
  1067. BEGIN
  1068. inUse := use;
  1069. END SetUsage;
  1070. PROCEDURE GetVariable(i: LONGINT): SyntaxTree.Variable;
  1071. VAR any: ANY;
  1072. BEGIN
  1073. any := Get(i);
  1074. IF any = NIL THEN RETURN NIL ELSE RETURN any(SyntaxTree.Variable) END;
  1075. END GetVariable;
  1076. PROCEDURE SetVariable(pos: LONGINT; v: SyntaxTree.Variable);
  1077. BEGIN
  1078. Set(pos, v);
  1079. END SetVariable;
  1080. PROCEDURE Occupy(pos: LONGINT);
  1081. BEGIN
  1082. INCL(inUse[pos DIV 32], pos MOD 32);
  1083. END Occupy;
  1084. PROCEDURE Occupied(pos: LONGINT): BOOLEAN;
  1085. BEGIN
  1086. RETURN (pos MOD 32) IN inUse[pos DIV 32];
  1087. END Occupied;
  1088. PROCEDURE AddVariable(v: SyntaxTree.Variable);
  1089. BEGIN
  1090. Occupy(Length());
  1091. Add(v);
  1092. END AddVariable;
  1093. PROCEDURE CompatibleType(t1, t2: SyntaxTree.Type): BOOLEAN;
  1094. BEGIN
  1095. t1 := t1.resolved;
  1096. t2 := t2.resolved;
  1097. (*RETURN t1.SameType(t2); *)
  1098. RETURN
  1099. (t1.SameType(t2))
  1100. OR
  1101. SemanticChecker.IsPointerType(t1) & SemanticChecker.IsPointerType(t2)
  1102. OR
  1103. ~t1.NeedsTrace() & ~t2.NeedsTrace() & (t1.sizeInBits > 0) & (t1.sizeInBits = t2.sizeInBits)
  1104. OR
  1105. (t1 IS SyntaxTree.MathArrayType) & (t2 IS SyntaxTree.MathArrayType) &
  1106. (t1(SyntaxTree.MathArrayType).form = t2(SyntaxTree.MathArrayType).form) &
  1107. ( (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor)
  1108. OR
  1109. (t1(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  1110. (DynamicDim(t1) = DynamicDim(t2))
  1111. );
  1112. END CompatibleType;
  1113. PROCEDURE GetFreeVariable(type: SyntaxTree.Type; untraced: BOOLEAN; VAR pos: LONGINT): SyntaxTree.Variable;
  1114. VAR var : SyntaxTree.Variable; i: LONGINT;
  1115. BEGIN
  1116. pos := Length();
  1117. FOR i := 0 TO pos-1 DO
  1118. IF ~(Occupied(i)) THEN
  1119. var := GetVariable(i);
  1120. IF CompatibleType(type, var.type) & (var.untraced = untraced) (*& ~(var.type.NeedsTrace())*) THEN
  1121. pos := i;
  1122. Occupy(i);
  1123. RETURN var;
  1124. END;
  1125. END;
  1126. END;
  1127. RETURN NIL
  1128. END GetFreeVariable;
  1129. END Variables;
  1130. SymbolMap = POINTER TO RECORD
  1131. this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; next: SymbolMap;
  1132. isAddress: BOOLEAN;
  1133. END;
  1134. SymbolMapper = OBJECT
  1135. VAR
  1136. first: SymbolMap;
  1137. PROCEDURE & Init;
  1138. BEGIN
  1139. first := NIL;
  1140. END Init;
  1141. PROCEDURE Add(this: SyntaxTree.Symbol; to, tag: SyntaxTree.Expression; isAddress: BOOLEAN);
  1142. VAR new: SymbolMap;
  1143. BEGIN
  1144. NEW(new); new.this := this; new.to := to; new.tag := tag; new.isAddress := isAddress;
  1145. new.next := first; first := new;
  1146. END Add;
  1147. PROCEDURE Get(this: SyntaxTree.Symbol): SymbolMap;
  1148. VAR s: SymbolMap;
  1149. BEGIN
  1150. s := first;
  1151. WHILE (s # NIL) & (s.this # this) DO
  1152. s := s.next
  1153. END;
  1154. RETURN s
  1155. END Get;
  1156. END SymbolMapper;
  1157. ImplementationVisitor =OBJECT(SyntaxTree.Visitor)
  1158. VAR
  1159. system: Global.System;
  1160. section: IntermediateCode.Section;
  1161. module: Sections.Module;
  1162. moduleScope : SyntaxTree.ModuleScope; (* shortcut for module.module.moduleScope *)
  1163. awaitProcCounter, labelId, constId, caseId: LONGINT;
  1164. hiddenPointerType: SyntaxTree.RecordType; (* used as hidden pointer, for example for ARRAY OF ANY *)
  1165. delegatePointerType: SyntaxTree.RecordType; (* used for delegates, for example in ARRAY OF PROCEDURE{DELEGATE} *)
  1166. checker: SemanticChecker.Checker;
  1167. backend: IntermediateBackend;
  1168. meta: MetaDataGenerator;
  1169. position: Position;
  1170. moduleSelf: SyntaxTree.Variable;
  1171. (* variables for hand over of variables / temporary state *)
  1172. currentScope: SyntaxTree.Scope;
  1173. constantDeclaration : SyntaxTree.Symbol;
  1174. result: Operand; (* result of the most recent expression / statement *)
  1175. destination: IntermediateCode.Operand;
  1176. arrayDestinationTag: IntermediateCode.Operand;
  1177. arrayDestinationDimension:LONGINT;
  1178. currentLoop: Label; (* variable to hand over loop exit jump list *)
  1179. conditional: BOOLEAN;
  1180. trueLabel, falseLabel, exitLabel: Label;
  1181. locked: BOOLEAN;
  1182. (*
  1183. usedRegisters: Registers;
  1184. *)
  1185. registerUsageCount: RegisterUsageCount;
  1186. usedRegisters: RegisterEntry;
  1187. (* useful operands and types *)
  1188. nil,one,fp,sp,ap,lr,true,false: IntermediateCode.Operand;
  1189. bool,addressType,setType, sizeType, lenType, byteType: IntermediateCode.Type;
  1190. commentPrintout: Printout.Printer;
  1191. dump: Streams.Writer;
  1192. tagsAvailable : BOOLEAN;
  1193. supportedInstruction: SupportedInstructionProcedure;
  1194. supportedImmediate: SupportedImmediateProcedure;
  1195. inData: BOOLEAN; (* to prevent indirect reference to data within data sections, cf. VisitIntegerValue *)
  1196. emitLabels: BOOLEAN;
  1197. builtinsModuleName : SyntaxTree.IdentifierString;
  1198. indexCounter: LONGINT;
  1199. profile: BOOLEAN;
  1200. profileId, profileInit: IntermediateCode.Section;
  1201. profileInitPatchPosition: LONGINT;
  1202. numberProcedures: LONGINT;
  1203. procedureResultDesignator : SyntaxTree.Designator;
  1204. operatorInitializationCodeSection: IntermediateCode.Section;
  1205. fingerPrinter: FingerPrinter.FingerPrinter;
  1206. temporaries: Variables;
  1207. canBeLoaded : BOOLEAN;
  1208. currentIsInline: BOOLEAN;
  1209. currentMapper: SymbolMapper;
  1210. currentInlineExit: Label;
  1211. moduleBodySection: IntermediateCode.Section;
  1212. NeedDescriptor : BOOLEAN;
  1213. cooperativeSwitches: BOOLEAN;
  1214. lastSwitchPC: LONGINT;
  1215. isUnchecked: BOOLEAN;
  1216. PROCEDURE & Init(system: Global.System; checker: SemanticChecker.Checker; supportedInstructionProcedure: SupportedInstructionProcedure; supportedImmediateProcedure: SupportedImmediateProcedure; emitLabels: BOOLEAN; CONST runtime: SyntaxTree.IdentifierString; backend: IntermediateBackend);
  1217. BEGIN
  1218. SELF.system := system;
  1219. SELF.builtinsModuleName := runtime;
  1220. currentScope := NIL;
  1221. hiddenPointerType := NIL;
  1222. delegatePointerType := NIL;
  1223. awaitProcCounter := 0;
  1224. labelId := 0; constId := 0; labelId := 0;
  1225. SELF.checker := checker;
  1226. SELF.backend := backend;
  1227. position := Basic.invalidPosition;
  1228. conditional := FALSE;
  1229. locked := FALSE;
  1230. InitOperand(result,ModeUndefined);
  1231. addressType := IntermediateCode.GetType(system,system.addressType);
  1232. setType := IntermediateCode.GetType(system,system.setType);
  1233. sizeType := IntermediateCode.GetType(system, system.sizeType);
  1234. lenType := IntermediateCode.GetType(system, system.lenType);
  1235. byteType := IntermediateCode.GetType(system, system.byteType);
  1236. fp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.FP);
  1237. sp := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.SP);
  1238. ap := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.AP);
  1239. lr := IntermediateCode.Register(addressType,IntermediateCode.GeneralPurposeRegister,IntermediateCode.LR);
  1240. nil := IntermediateCode.Immediate(addressType,0);
  1241. one := IntermediateCode.Immediate(addressType,1);
  1242. IntermediateCode.InitOperand(destination);
  1243. tagsAvailable := TRUE;
  1244. supportedInstruction := supportedInstructionProcedure;
  1245. supportedImmediate := supportedImmediateProcedure;
  1246. inData := FALSE;
  1247. SELF.emitLabels := emitLabels;
  1248. IntermediateCode.InitOperand(arrayDestinationTag);
  1249. bool := IntermediateCode.GetType(system,system.booleanType);
  1250. IntermediateCode.InitImmediate(false,bool,0);
  1251. IntermediateCode.InitImmediate(true,bool,1);
  1252. indexCounter := 0;
  1253. NEW(registerUsageCount);
  1254. usedRegisters := NIL;
  1255. procedureResultDesignator := NIL;
  1256. NEW(fingerPrinter);
  1257. NEW(temporaries);
  1258. currentIsInline := FALSE;
  1259. NeedDescriptor := FALSE;
  1260. isUnchecked := backend.noRuntimeChecks;
  1261. END Init;
  1262. TYPE Context = RECORD
  1263. section: IntermediateCode.Section;
  1264. registerUsageCount: RegisterUsageCount;
  1265. usedRegisters: RegisterEntry;
  1266. temporaries: Variables;
  1267. END;
  1268. PROCEDURE SwitchContext(new: IntermediateCode.Section): Context;
  1269. VAR context: Context;
  1270. BEGIN
  1271. context.section := section;
  1272. context.registerUsageCount := registerUsageCount;
  1273. context.usedRegisters := usedRegisters;
  1274. context.temporaries := temporaries;
  1275. section := new;
  1276. NEW(registerUsageCount);
  1277. NEW(temporaries);
  1278. usedRegisters := NIL;
  1279. RETURN context;
  1280. END SwitchContext;
  1281. PROCEDURE ReturnToContext(context: Context);
  1282. BEGIN
  1283. section := context.section;
  1284. registerUsageCount := context.registerUsageCount;
  1285. usedRegisters := context.usedRegisters;
  1286. temporaries := context.temporaries;
  1287. END ReturnToContext;
  1288. PROCEDURE NewSection(list: Sections.SectionList; type: SHORTINT; CONST name: Basic.SegmentedName; syntaxTreeSymbol: SyntaxTree.Symbol; dump: BOOLEAN): IntermediateCode.Section;
  1289. VAR fp: SyntaxTree.FingerPrint; section: IntermediateCode.Section;
  1290. BEGIN
  1291. IF (syntaxTreeSymbol # NIL) & ~((syntaxTreeSymbol IS SyntaxTree.Procedure) & (syntaxTreeSymbol(SyntaxTree.Procedure).isInline)) THEN
  1292. fp := fingerPrinter.SymbolFP(syntaxTreeSymbol)
  1293. END;
  1294. section := IntermediateCode.NewSection(list, type, name, syntaxTreeSymbol, dump);
  1295. section.SetExported(IsExported(syntaxTreeSymbol));
  1296. RETURN section
  1297. END NewSection;
  1298. PROCEDURE AcquireRegister(CONST type: IntermediateCode.Type; class: IntermediateCode.RegisterClass): LONGINT;
  1299. VAR new: LONGINT;
  1300. BEGIN
  1301. new := registerUsageCount.Next(type,class);
  1302. UseRegister(new);
  1303. RETURN new
  1304. END AcquireRegister;
  1305. PROCEDURE GetFingerprintString(symbol: SyntaxTree.Symbol; VAR string: ARRAY OF CHAR);
  1306. VAR
  1307. fingerPrint: SyntaxTree.FingerPrint;
  1308. fingerPrintString: ARRAY 32 OF CHAR;
  1309. BEGIN
  1310. fingerPrint := fingerPrinter.SymbolFP(symbol);
  1311. string := "[";
  1312. Strings.IntToHexStr(fingerPrint.public, 8, fingerPrintString);
  1313. Strings.Append(string, fingerPrintString);
  1314. Strings.Append(string, "]");
  1315. END GetFingerprintString;
  1316. (** get the name for the code section that represens a certain symbol
  1317. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1318. PROCEDURE GetCodeSectionNameForSymbol(symbol: SyntaxTree.Symbol; VAR name: Basic.SegmentedName);
  1319. VAR string: ARRAY 32 OF CHAR;
  1320. BEGIN
  1321. Global.GetSymbolSegmentedName(symbol, name);
  1322. (* if the symbol is an operator, then append the fingerprint to the name *)
  1323. IF symbol IS SyntaxTree.Operator THEN
  1324. GetFingerprintString(symbol, string);
  1325. Basic.AppendToSegmentedName(name,string);
  1326. END
  1327. END GetCodeSectionNameForSymbol;
  1328. (** get the name for the code section that represens a certain symbol
  1329. (essentially the same as Global.GetSymbolName, apart from operators) **)
  1330. PROCEDURE GetCodeSectionNameForSymbolInScope(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope; VAR name: ARRAY OF CHAR);
  1331. VAR string: ARRAY 32 OF CHAR;
  1332. BEGIN
  1333. Global.GetSymbolNameInScope(symbol, scope, name);
  1334. (* if the symbol is an operator, then append the fingerprint to the name *)
  1335. IF symbol IS SyntaxTree.Operator THEN
  1336. GetFingerprintString(symbol, string);
  1337. Strings.Append(name, string);
  1338. END
  1339. END GetCodeSectionNameForSymbolInScope;
  1340. PROCEDURE TraceEnter(CONST s: ARRAY OF CHAR);
  1341. BEGIN
  1342. IF dump # NIL THEN
  1343. dump.String("enter "); dump.String(s); dump.Ln;
  1344. END;
  1345. END TraceEnter;
  1346. PROCEDURE TraceExit(CONST s: ARRAY OF CHAR);
  1347. BEGIN
  1348. IF dump # NIL THEN
  1349. dump.String("exit "); dump.String(s); dump.Ln;
  1350. END;
  1351. END TraceExit;
  1352. PROCEDURE Emit(instruction: IntermediateCode.Instruction);
  1353. VAR moduleName, procedureName: SyntaxTree.IdentifierString;
  1354. PROCEDURE CheckRegister(VAR op: IntermediateCode.Operand);
  1355. VAR i: LONGINT;
  1356. BEGIN
  1357. IF op.register >0 THEN IntermediateCode.SetRegister(op,registerUsageCount.Map(op.register)) END;
  1358. IF op.rule # NIL THEN
  1359. FOR i := 0 TO LEN(op.rule)-1 DO
  1360. CheckRegister(op.rule[i])
  1361. END;
  1362. END;
  1363. END CheckRegister;
  1364. BEGIN
  1365. CheckRegister(instruction.op1);
  1366. CheckRegister(instruction.op2);
  1367. CheckRegister(instruction.op3);
  1368. IF supportedInstruction(instruction,moduleName,procedureName) THEN section.Emit(instruction)
  1369. ELSE section.Emit(instruction);
  1370. EnsureSymbol(moduleName,procedureName); (* remainder for binary object file *)
  1371. END;
  1372. END Emit;
  1373. PROCEDURE EmitTrap (position: Position; trapNo: LONGINT);
  1374. BEGIN
  1375. IF backend.cooperative THEN
  1376. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1377. CallThis(position,"Runtime","Trap",1);
  1378. ELSE
  1379. Emit(Trap(position,trapNo));
  1380. END;
  1381. END EmitTrap;
  1382. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1383. VAR name: Basic.SegmentedName;
  1384. VAR op1, op2, reg: IntermediateCode.Operand;
  1385. VAR call, nocall: Label;
  1386. VAR parametersSize: LONGINT;
  1387. VAR prevSection: IntermediateCode.Section;
  1388. VAR prevDump: Streams.Writer;
  1389. VAR body: SyntaxTree.Body;
  1390. VAR procedureType: SyntaxTree.ProcedureType;
  1391. BEGIN
  1392. IF procedure # NIL THEN
  1393. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1394. ELSE procedureType := NIL;
  1395. END;
  1396. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1397. prevSection := SELF.section;
  1398. SELF.section := section;
  1399. prevDump := dump;
  1400. dump := section.comments;
  1401. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1402. IF backend.hasLinkRegister THEN
  1403. Emit(Push(Basic.invalidPosition, lr));
  1404. END;
  1405. Emit(Push(Basic.invalidPosition,fp));
  1406. IF procedure # NIL THEN
  1407. body := procedure.procedureScope.body;
  1408. ELSE
  1409. body := NIL;
  1410. END;
  1411. IF backend.cooperative THEN
  1412. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1413. GetCodeSectionNameForSymbol(procedure, name);
  1414. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1415. ELSE
  1416. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1417. END;
  1418. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1419. IntermediateCode.AddOffset(op1, 1);
  1420. Emit(Push(Basic.invalidPosition,op1));
  1421. Emit(Mov(Basic.invalidPosition,fp, sp));
  1422. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1423. NEW(call, section);
  1424. NEW(nocall, section);
  1425. reg := NewRegisterOperand(addressType);
  1426. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1427. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1428. BrltL(call, sp, reg);
  1429. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1430. BrgeL(nocall, sp, op2);
  1431. call.Resolve(section.pc);
  1432. Emit(Push(Basic.invalidPosition, reg));
  1433. ReleaseIntermediateOperand(reg);
  1434. parametersSize := ProcParametersSize(procedure);
  1435. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1436. Emit(Push(Basic.invalidPosition, op2));
  1437. CallThis(position, "Activities","ExpandStack",2);
  1438. Emit(Result(Basic.invalidPosition, sp));
  1439. nocall.Resolve(section.pc);
  1440. END;
  1441. ELSE
  1442. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1443. Emit(Push(Basic.invalidPosition, one)) ;
  1444. procedureType.SetParametersOffset(1);
  1445. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1446. END;
  1447. Emit(Mov(Basic.invalidPosition, fp, sp));
  1448. END;
  1449. END;
  1450. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1451. SELF.section := prevSection;
  1452. dump := prevDump;
  1453. END EmitEnter;
  1454. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1455. VAR op1,op2: IntermediateCode.Operand;
  1456. VAR instruction: IntermediateCode.Instruction;
  1457. BEGIN
  1458. IntermediateCode.InitNumber(op1,callconv);
  1459. IntermediateCode.InitNumber(op2,varSize);
  1460. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1461. RETURN instruction
  1462. END Enter;
  1463. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1464. VAR op1: IntermediateCode.Operand;
  1465. VAR instruction: IntermediateCode.Instruction;
  1466. BEGIN
  1467. IntermediateCode.InitNumber(op1,callconv);
  1468. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1469. RETURN instruction
  1470. END Leave;
  1471. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1472. VAR prevSection: IntermediateCode.Section;
  1473. VAR op2, size: IntermediateCode.Operand;
  1474. VAR body: SyntaxTree.Body;
  1475. BEGIN
  1476. prevSection := SELF.section;
  1477. SELF.section := section;
  1478. Emit(Leave(position, callconv));
  1479. IF procedure # NIL THEN
  1480. body := procedure.procedureScope.body;
  1481. ELSE
  1482. body := NIL;
  1483. END;
  1484. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1485. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1486. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1487. Emit(Add(position, sp, fp, op2));
  1488. ELSE
  1489. Emit(Mov(position, sp, fp));
  1490. END;
  1491. Emit(Pop(position, fp));
  1492. END;
  1493. SELF.section := prevSection;
  1494. END EmitLeave;
  1495. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1496. VAR m: SymbolMap;
  1497. BEGIN
  1498. position := x.position;
  1499. IF currentIsInline THEN
  1500. m := currentMapper.Get(x);
  1501. IF m # NIL THEN
  1502. (*
  1503. Printout.Info("mapping from", x);
  1504. Printout.Info("mapping to ", m.to);
  1505. *)
  1506. m.to.Accept(SELF);
  1507. op := result;
  1508. IF m.tag # NIL THEN
  1509. ReleaseIntermediateOperand(result.tag);
  1510. m.tag.Accept(SELF);
  1511. op.tag := result.op;
  1512. ReleaseIntermediateOperand(result.tag);
  1513. END;
  1514. RETURN
  1515. END;
  1516. END;
  1517. x.Accept(SELF);
  1518. op := result;
  1519. END Symbol;
  1520. PROCEDURE Expression(x: SyntaxTree.Expression);
  1521. BEGIN
  1522. position := x.position;
  1523. constantDeclaration := NIL;
  1524. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1525. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1526. END;
  1527. IF x.resolved # NIL THEN
  1528. x.resolved.Accept(SELF)
  1529. ELSE
  1530. x.Accept(SELF)
  1531. END;
  1532. (* check this, was commented out in ActiveCells3 *)
  1533. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1534. Error(x.position, "unsupported modifier");
  1535. END;
  1536. END Expression;
  1537. (*
  1538. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1539. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1540. BEGIN
  1541. temporaries.GetUsage(current);
  1542. FOR i := 0 TO LEN(current)-1 DO
  1543. set := current[i] - previous[i];
  1544. IF set # {} THEN
  1545. FOR j := 0 TO MAX(SET)-1 DO
  1546. IF j IN set THEN
  1547. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1548. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1549. Symbol(variable, op);
  1550. MakeMemory(tmp,op.op,addressType,0);
  1551. ReleaseOperand(op);
  1552. Emit(Mov(position,tmp, nil ) );
  1553. ReleaseIntermediateOperand(tmp);
  1554. END;
  1555. END;
  1556. END;
  1557. END;
  1558. END;
  1559. END ResetUsedTemporaries;
  1560. *)
  1561. PROCEDURE Statement(x: SyntaxTree.Statement);
  1562. VAR use: VariableUse;
  1563. BEGIN
  1564. temporaries.GetUsage(use);
  1565. position := x.position;
  1566. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1567. IF commentPrintout # NIL THEN
  1568. commentPrintout.Statement(x);
  1569. dump.Ln;
  1570. (*dump.Update;*)
  1571. END;
  1572. x.Accept(SELF);
  1573. (*
  1574. CheckRegistersFree();
  1575. *)
  1576. (*ResetUsedTemporaries(use);*)
  1577. temporaries.SetUsage(use);
  1578. END Statement;
  1579. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1580. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1581. *)
  1582. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1583. BEGIN
  1584. ASSERT(op.mode # IntermediateCode.Undefined);
  1585. IF op.mode = IntermediateCode.ModeMemory THEN
  1586. ReuseCopy(res,op);
  1587. ELSE
  1588. res := op;
  1589. UseIntermediateOperand(res);
  1590. END;
  1591. IntermediateCode.AddOffset(res,offset);
  1592. IntermediateCode.MakeMemory(res,type);
  1593. END MakeMemory;
  1594. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1595. VAR mem: IntermediateCode.Operand;
  1596. BEGIN
  1597. MakeMemory(mem,res,type,offset);
  1598. ReleaseIntermediateOperand(res);
  1599. res := mem;
  1600. END ToMemory;
  1601. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1602. VAR mem: IntermediateCode.Operand;
  1603. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1604. componentType: SyntaxTree.Type;
  1605. BEGIN
  1606. type := type.resolved;
  1607. IF operand.mode = ModeReference THEN
  1608. IF type IS SyntaxTree.RangeType THEN
  1609. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1610. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1611. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1612. ReleaseOperand(operand);
  1613. operand.op := firstOp;
  1614. operand.tag := lastOp;
  1615. operand.extra := stepOp;
  1616. ELSIF type IS SyntaxTree.ComplexType THEN
  1617. componentType := type(SyntaxTree.ComplexType).componentType;
  1618. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1619. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1620. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1621. ReleaseOperand(operand);
  1622. operand.op := firstOp;
  1623. operand.tag := lastOp
  1624. ELSE
  1625. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1626. ReleaseIntermediateOperand(operand.op);
  1627. operand.op := mem;
  1628. END;
  1629. operand.mode := ModeValue;
  1630. END;
  1631. ASSERT(operand.mode = ModeValue);
  1632. END LoadValue;
  1633. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1634. VAR prevConditional: BOOLEAN;
  1635. BEGIN
  1636. prevConditional := conditional;
  1637. conditional := FALSE;
  1638. InitOperand(result, ModeUndefined);
  1639. Expression(x);
  1640. op := result;
  1641. LoadValue(op,x.type.resolved);
  1642. conditional := prevConditional;
  1643. END Evaluate;
  1644. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1645. VAR prevConditional: BOOLEAN;
  1646. BEGIN
  1647. prevConditional := conditional;
  1648. conditional := FALSE;
  1649. InitOperand(result,ModeUndefined);
  1650. Expression(x);
  1651. op := result;
  1652. (*
  1653. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1654. *)
  1655. conditional := prevConditional;
  1656. END Designate;
  1657. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1658. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1659. BEGIN
  1660. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1661. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1662. conditional := TRUE;
  1663. trueLabel := trueL; falseLabel := falseL;
  1664. Expression(x);
  1665. trueL := trueLabel; falseL := falseLabel;
  1666. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1667. END Condition;
  1668. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1669. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1670. BEGIN
  1671. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1672. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1673. RETURN op
  1674. END NewRegisterOperand;
  1675. PROCEDURE UnuseRegister(register: LONGINT);
  1676. BEGIN
  1677. IF (register > 0) THEN
  1678. register := registerUsageCount.Map(register);
  1679. registerUsageCount.DecUse(register);
  1680. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1681. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1682. END;
  1683. IF registerUsageCount.Use(register)=0 THEN
  1684. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1685. Warning(position, "register cannot be removed");
  1686. END;
  1687. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1688. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1689. END;
  1690. ELSIF registerUsageCount.Use(register)<0 THEN
  1691. Warning(position, "register removed too often");
  1692. IF dump # NIL THEN
  1693. dump.String("register removed too often"); dump.Ln; dump.Update;
  1694. END;
  1695. END;
  1696. END;
  1697. END UnuseRegister;
  1698. PROCEDURE UseRegister(register: LONGINT);
  1699. BEGIN
  1700. IF (register > 0) THEN
  1701. register := registerUsageCount.Map(register);
  1702. registerUsageCount.IncUse(register);
  1703. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1704. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1705. END;
  1706. IF registerUsageCount.Use(register)=1 THEN
  1707. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1708. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1709. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1710. END;
  1711. END;
  1712. END;
  1713. END UseRegister;
  1714. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1715. BEGIN
  1716. UnuseRegister(op.register)
  1717. END ReleaseIntermediateOperand;
  1718. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1719. BEGIN
  1720. UseRegister(op.register)
  1721. END UseIntermediateOperand;
  1722. PROCEDURE ReleaseOperand(CONST op: Operand);
  1723. BEGIN
  1724. UnuseRegister(op.op.register);
  1725. UnuseRegister(op.tag.register);
  1726. UnuseRegister(op.extra.register);
  1727. END ReleaseOperand;
  1728. (* save registers marked in array "markedRegisters" to the stack
  1729. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1730. *)
  1731. PROCEDURE SaveRegisters();
  1732. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1733. BEGIN
  1734. entry := usedRegisters;
  1735. WHILE entry # NIL DO
  1736. type := registerUsageCount.used[entry.register].type;
  1737. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1738. Emit(Push(position,op));
  1739. entry := entry.next;
  1740. END;
  1741. END SaveRegisters;
  1742. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1743. BEGIN
  1744. saved := usedRegisters;
  1745. usedRegisters := NIL;
  1746. END ReleaseUsedRegisters;
  1747. (** remove parameter registers from used queue *)
  1748. PROCEDURE ReleaseParameterRegisters;
  1749. VAR entry,prev,next: RegisterEntry;
  1750. BEGIN
  1751. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1752. WHILE entry # NIL DO
  1753. next := entry.next;
  1754. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1755. registerUsageCount.DecUse(entry.register);
  1756. ASSERT(registerUsageCount.Use(entry.register)=0);
  1757. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1758. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1759. END;
  1760. ELSIF prev = NIL THEN
  1761. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1762. ELSE
  1763. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1764. END;
  1765. entry := next;
  1766. END;
  1767. END ReleaseParameterRegisters;
  1768. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1769. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1770. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1771. BEGIN
  1772. entry := saved;
  1773. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1774. entry := prev;
  1775. WHILE entry # NIL DO
  1776. prev := entry.prev;
  1777. type := entry.type;
  1778. class := entry.registerClass;
  1779. IntermediateCode.InitRegister(op,type,class,entry.register);
  1780. (*
  1781. new := registerUsageCount.Next(type,class);
  1782. registerUsageCount.Remap(entry.register,new);
  1783. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1784. dump.String("remap register "); dump.Int(entry.register,1);
  1785. dump.String("to "); dump.Int(new,1);
  1786. dump.String("with count "); dump.Int(registerUsageCount.Use(new),1); dump.Ln; dump.Update;
  1787. END;
  1788. entry.register := new;
  1789. *)
  1790. Emit(Pop(position,op));
  1791. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1792. entry := prev;
  1793. END;
  1794. (*
  1795. usedRegisters := saved;
  1796. *)
  1797. END RestoreRegisters;
  1798. PROCEDURE CheckRegistersFree;
  1799. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1800. BEGIN
  1801. IF usedRegisters # NIL THEN
  1802. r := usedRegisters;
  1803. WHILE r # NIL DO
  1804. warning := "register ";
  1805. Strings.AppendInt(warning, r.register);
  1806. Strings.Append(warning, " not released.");
  1807. Warning(position,warning);
  1808. r := r .next;
  1809. END;
  1810. END;
  1811. FOR i := 0 TO registerUsageCount.count-1 DO
  1812. IF registerUsageCount.used[i].count < 0 THEN
  1813. warning := "register ";
  1814. Strings.AppendInt(warning, i);
  1815. Strings.Append(warning, " unused too often.");
  1816. Warning(position,warning);
  1817. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1818. warning := "register ";
  1819. Strings.AppendInt(warning, i);
  1820. Strings.Append(warning, " not unused often enough.");
  1821. Warning(position,warning);
  1822. END;
  1823. END;
  1824. END CheckRegistersFree;
  1825. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1826. Otherwise allocate a new register.
  1827. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1828. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1829. BEGIN
  1830. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1831. UseIntermediateOperand(result);
  1832. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1833. UseIntermediateOperand(result);
  1834. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1835. END;
  1836. END Reuse2;
  1837. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1838. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1839. If not then allocate a new register.
  1840. Does NOT necessarily keep the content of src1 or src2 in result!
  1841. *)
  1842. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1843. BEGIN
  1844. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1845. UseIntermediateOperand(result);
  1846. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1847. UseIntermediateOperand(result);
  1848. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1849. result := alternative; alternative := emptyOperand;
  1850. UseIntermediateOperand(result);
  1851. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1852. END;
  1853. END Reuse2a;
  1854. (* like reuse2 but only one source *)
  1855. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1856. BEGIN
  1857. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1858. UseIntermediateOperand(result);
  1859. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1860. END;
  1861. END Reuse1;
  1862. (* like reuse2a but only one source *)
  1863. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1864. BEGIN
  1865. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1866. UseIntermediateOperand(result);
  1867. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1868. UseIntermediateOperand(result);
  1869. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1870. END;
  1871. END Reuse1a;
  1872. (* like reuse1 but guarantees that content of src1 is in result *)
  1873. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1874. BEGIN
  1875. IF ReusableRegister(src1) THEN
  1876. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1877. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1878. UseIntermediateOperand(result);
  1879. ELSE
  1880. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1881. Emit(Mov(position,result,src1));
  1882. END
  1883. END ReuseCopy;
  1884. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1885. BEGIN
  1886. IF ReusableRegister(src) THEN
  1887. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1888. ELSE
  1889. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1890. Emit(Mov(position,result,src));
  1891. ReleaseIntermediateOperand(src);
  1892. END
  1893. END TransferToRegister;
  1894. (** labels and branches **)
  1895. PROCEDURE NewLabel(): Label;
  1896. VAR label: Label;
  1897. BEGIN
  1898. NEW(label,section); RETURN label;
  1899. END NewLabel;
  1900. PROCEDURE SetLabel(label: Label);
  1901. BEGIN label.Resolve(section.pc);
  1902. END SetLabel;
  1903. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1904. BEGIN
  1905. ASSERT(label # NIL);
  1906. IF label.pc < 0 THEN (* label not yet set *)
  1907. label.AddFixup(section.pc);
  1908. END;
  1909. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1910. END LabelOperand;
  1911. PROCEDURE BrL(label: Label);
  1912. BEGIN
  1913. Emit(Br(position,LabelOperand(label)));
  1914. END BrL;
  1915. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1916. BEGIN
  1917. Emit(Brge(position,LabelOperand(label),left,right));
  1918. END BrgeL;
  1919. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1920. BEGIN
  1921. Emit(Brlt(position,LabelOperand(label),left,right));
  1922. END BrltL;
  1923. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1924. BEGIN
  1925. Emit(Breq(position,LabelOperand(label),left,right));
  1926. END BreqL;
  1927. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1928. BEGIN
  1929. Emit(Brne(position,LabelOperand(label),left,right));
  1930. END BrneL;
  1931. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1932. VAR new: IntermediateCode.Operand;
  1933. BEGIN
  1934. IF Trace THEN TraceEnter("Convert") END;
  1935. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1936. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1937. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1938. & (operand.offset = 0)
  1939. THEN
  1940. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1941. Emit(Conv(position,new,operand));
  1942. ELSE
  1943. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1944. Emit(Conv(position,new,operand));
  1945. ReleaseIntermediateOperand(operand);
  1946. END;
  1947. operand := new;
  1948. 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
  1949. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1950. ELSE
  1951. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1952. Emit(Conv(position,new,operand));
  1953. ReleaseIntermediateOperand(operand);
  1954. operand := new;
  1955. END;
  1956. IF Trace THEN TraceExit("Convert") END;
  1957. END Convert;
  1958. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1959. VAR exit: Label;
  1960. BEGIN
  1961. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1962. exit := NewLabel();
  1963. br(exit,left,right);
  1964. EmitTrap(position,trapNo);
  1965. SetLabel(exit);
  1966. END TrapC;
  1967. (** expressions *)
  1968. (** emit necessary runtime check for set elements **)
  1969. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1970. VAR max: IntermediateCode.Operand;
  1971. BEGIN
  1972. IF isUnchecked THEN RETURN END;
  1973. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1974. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1975. TrapC(BrgeL, max, o, SetElementTrap);
  1976. END;
  1977. END CheckSetElement;
  1978. (** the set that a range represents **)
  1979. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1980. VAR
  1981. operand: Operand;
  1982. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1983. BEGIN
  1984. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1985. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1986. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1987. one := IntermediateCode.Immediate(setType, 1);
  1988. Evaluate(x, operand);
  1989. Convert(operand.op, setType);
  1990. Convert(operand.tag, setType);
  1991. CheckSetElement(operand.op);
  1992. CheckSetElement(operand.tag);
  1993. (* create mask for lower bound
  1994. i.e. shift 11111111 to the left by the value of the lower bound
  1995. *)
  1996. Reuse1(temp, operand.op);
  1997. Emit(Shl(position,temp, allBits, operand.op));
  1998. ReleaseIntermediateOperand(operand.op);
  1999. operand.op := temp;
  2000. (* create mask for upper bound
  2001. i.e. shift 11111111 to the right by the difference between the
  2002. upper bound and the maximum number of set elements
  2003. *)
  2004. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2005. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2006. Reuse1(temp, operand.tag);
  2007. ELSE
  2008. Reuse1(temp, operand.tag);
  2009. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2010. Emit(Sub(position,temp, size, operand.tag));
  2011. END;
  2012. Emit(Shr(position,temp, allBits, operand.tag));
  2013. ReleaseIntermediateOperand(operand.tag);
  2014. operand.tag := temp;
  2015. Reuse2(resultingSet, operand.op, operand.tag);
  2016. (* intersect the two masks *)
  2017. Emit(And(position,resultingSet, operand.op, operand.tag));
  2018. ReleaseOperand(operand);
  2019. RETURN resultingSet
  2020. END SetFromRange;
  2021. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2022. VAR
  2023. res, operand: Operand;
  2024. temp, one, noBits, dest: IntermediateCode.Operand;
  2025. expression: SyntaxTree.Expression;
  2026. i: LONGINT;
  2027. BEGIN
  2028. IF Trace THEN TraceEnter("VisitSet") END;
  2029. dest := destination;
  2030. destination := emptyOperand;
  2031. noBits := IntermediateCode.Immediate(setType, 0);
  2032. one := IntermediateCode.Immediate(setType, 1);
  2033. (* start off with the empty set *)
  2034. InitOperand(res, ModeValue);
  2035. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2036. Emit(Mov(position,res.op, noBits));
  2037. FOR i := 0 TO x.elements.Length() - 1 DO
  2038. expression := x.elements.GetExpression(i);
  2039. IF expression IS SyntaxTree.RangeExpression THEN
  2040. (* range of set elements *)
  2041. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2042. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2043. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2044. ReleaseIntermediateOperand(temp)
  2045. ELSE
  2046. (* singelton element *)
  2047. Evaluate(expression, operand);
  2048. Convert(operand.op, setType);
  2049. CheckSetElement(operand.op);
  2050. (* create subset containing single element *)
  2051. Reuse1(temp, operand.op);
  2052. Emit(Shl(position,temp, one, operand.op));
  2053. ReleaseOperand(operand);
  2054. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2055. ReleaseIntermediateOperand(temp);
  2056. END
  2057. END;
  2058. result := res;
  2059. destination := dest;
  2060. IF Trace THEN TraceExit("VisitSet") END;
  2061. END VisitSet;
  2062. (* math arrays of the form [a,b,c]
  2063. x is a static array and thus does not provide any pointers
  2064. *)
  2065. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2066. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2067. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2068. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2069. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2070. element: SyntaxTree.IntegerValue;
  2071. BEGIN
  2072. numberElements := x.elements.Length();
  2073. expression := index.parameters.GetExpression(dim);
  2074. element := expression(SyntaxTree.IntegerValue);
  2075. FOR i := 0 TO numberElements-1 DO
  2076. expression := x.elements.GetExpression(i);
  2077. element.SetValue(i);
  2078. IF expression IS SyntaxTree.MathArrayExpression THEN
  2079. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2080. ELSE
  2081. Assign(index,expression);
  2082. END;
  2083. END;
  2084. END RecursiveAssignment;
  2085. BEGIN
  2086. (*static math array not providing pointers anyway *)
  2087. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2088. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2089. designator.SetType(variable.type);
  2090. dim := SemanticChecker.Dimension(x.type,{SyntaxTree.Static});
  2091. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2092. FOR i := 0 TO dim-1 DO
  2093. element := SyntaxTree.NewIntegerValue(x.position,0);
  2094. element.SetType(system.longintType);
  2095. index.parameters.AddExpression(element);
  2096. END;
  2097. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2098. RecursiveAssignment(x,0);
  2099. Expression(designator);
  2100. END VisitMathArrayExpression;
  2101. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2102. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2103. BEGIN
  2104. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2105. dest := destination; destination := emptyOperand;
  2106. IF x.operator = Scanner.Not THEN
  2107. IF conditional THEN
  2108. Condition(x.left,falseLabel,trueLabel)
  2109. ELSE
  2110. Evaluate(x.left,operand);
  2111. InitOperand(result,ModeValue);
  2112. Reuse1a(result.op,operand.op,dest);
  2113. Emit(Xor(position,result.op,operand.op,true));
  2114. ReleaseOperand(operand);
  2115. END;
  2116. ELSIF x.operator = Scanner.Minus THEN
  2117. Evaluate(x.left,operand);
  2118. InitOperand(result,ModeValue);
  2119. Reuse1a(result.op,operand.op,dest);
  2120. type := x.left.type.resolved;
  2121. IF type IS SyntaxTree.SetType THEN
  2122. Emit(Not(position,result.op,operand.op));
  2123. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2124. Reuse1(result.tag,operand.tag);
  2125. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2126. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2127. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2128. Emit(Neg(position,result.op,operand.op));
  2129. ELSE HALT(200)
  2130. END;
  2131. ReleaseOperand(operand);
  2132. ELSIF x.operator = Scanner.Address THEN
  2133. Designate(x.left,operand);
  2134. operand.mode := ModeValue;
  2135. t0 := x.left.type.resolved;
  2136. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2137. ReleaseIntermediateOperand(operand.op);
  2138. operand.op := operand.tag;
  2139. IntermediateCode.InitOperand(operand.tag);
  2140. END;
  2141. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2142. result := operand;
  2143. ELSE HALT(100)
  2144. END;
  2145. destination := dest;
  2146. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2147. END VisitUnaryExpression;
  2148. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2149. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2150. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2151. BEGIN
  2152. type := type.resolved;
  2153. originalType := type;
  2154. IF type IS SyntaxTree.PointerType THEN
  2155. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2156. END;
  2157. IF type IS SyntaxTree.ObjectType THEN
  2158. BrL(trueL);
  2159. ELSE
  2160. ASSERT(type IS SyntaxTree.RecordType);
  2161. (*
  2162. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2163. *)
  2164. ReuseCopy(left,tag);
  2165. right := TypeDescriptorAdr(type);
  2166. IF backend.cooperative THEN
  2167. repeatL := NewLabel();
  2168. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2169. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2170. END;
  2171. SetLabel(repeatL);
  2172. BreqL(trueL,left,right);
  2173. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2174. BrneL(repeatL,left,nil);
  2175. ELSIF meta.simple THEN
  2176. level := type(SyntaxTree.RecordType).Level();
  2177. (* get type desc tag of level relative to base tag *)
  2178. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2179. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2180. IntermediateCode.MakeMemory(left,addressType);
  2181. BreqL(trueL,left,right);
  2182. ELSE
  2183. level := type(SyntaxTree.RecordType).Level();
  2184. (* get type desc tag of level relative to base tag *)
  2185. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2186. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2187. IntermediateCode.MakeMemory(left,addressType);
  2188. BreqL(trueL,left,right);
  2189. END;
  2190. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2191. BrL(falseL);
  2192. END;
  2193. END TypeTest;
  2194. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2195. BEGIN
  2196. backend.Error(module.module.sourceName,position,Diagnostics.Invalid,s);
  2197. IF dump # NIL THEN
  2198. dump.String(s); dump.Ln;
  2199. END;
  2200. END Error;
  2201. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2202. BEGIN
  2203. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2204. IF dump # NIL THEN
  2205. dump.String(s); dump.Ln; dump.Update;
  2206. END;
  2207. END Warning;
  2208. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2209. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2210. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2211. operand:Operand;
  2212. BEGIN
  2213. previousSection := section;
  2214. Global.GetModuleName(mod,name);
  2215. Strings.Append(name,".@Trace");
  2216. Basic.ToSegmentedName(name, pooledName);
  2217. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2218. IF dump # NIL THEN dump := section.comments END;
  2219. IF backend.hasLinkRegister THEN
  2220. Emit(Push(Basic.invalidPosition, lr));
  2221. END;
  2222. variable := mod.moduleScope.firstVariable;
  2223. WHILE variable # NIL DO
  2224. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2225. Symbol(variable, operand);
  2226. register := operand.op;
  2227. CallTraceMethod(register, variable.type);
  2228. ReleaseIntermediateOperand(register);
  2229. END;
  2230. variable := variable.nextVariable;
  2231. END;
  2232. IF backend.hasLinkRegister THEN
  2233. Emit(Pop(Basic.invalidPosition, lr));
  2234. END;
  2235. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2236. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2237. Emit(Br(position,op));
  2238. INC(statCoopTraceModule, section.pc);
  2239. section := previousSection;
  2240. IF dump # NIL THEN dump := section.comments END;
  2241. END CreateTraceModuleMethod;
  2242. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2243. BEGIN
  2244. Emit (Push(position, dst));
  2245. Emit (Push(position, src));
  2246. CallThis(position,"GarbageCollector","Assign", 2);
  2247. END CallAssignPointer;
  2248. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2249. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2250. BEGIN
  2251. IF SemanticChecker.IsPointerType (type) THEN
  2252. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2253. ELSIF type.IsRecordType() THEN
  2254. Emit (Push(position,dst));
  2255. Emit (Push(position,src));
  2256. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2257. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2258. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2259. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2260. ELSIF IsStaticArray(type) THEN
  2261. size := StaticArrayNumElements(type);
  2262. base := StaticArrayBaseType(type);
  2263. IF base.IsRecordType() THEN
  2264. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2265. Emit (Push(position, dst));
  2266. Emit (Push(position, src));
  2267. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2268. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2269. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2270. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2271. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2272. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2273. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2274. Emit (Push(position, dst));
  2275. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2276. Emit (Push(position, src));
  2277. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2278. ELSE
  2279. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2280. Emit (Push(position, dst));
  2281. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2282. Emit (Push(position, src));
  2283. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2284. ASSERT(StaticArrayBaseType(type).IsPointer());
  2285. END;
  2286. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2287. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2288. Emit (Push(position, dst));
  2289. Emit (Push(position, src));
  2290. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2291. ELSE HALT(100); (* missing ? *)
  2292. END;
  2293. END CallAssignMethod;
  2294. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2295. VAR name: Basic.SegmentedName;
  2296. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2297. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2298. context: Context;
  2299. BEGIN
  2300. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2301. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2302. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2303. GetRecordTypeName (recordType,name);
  2304. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2305. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2306. IF dump # NIL THEN dump := section.comments END;
  2307. IF backend.hasLinkRegister THEN
  2308. Emit(Push(Basic.invalidPosition, lr));
  2309. END;
  2310. variable := recordType.recordScope.firstVariable;
  2311. WHILE variable # NIL DO
  2312. IF variable.NeedsTrace() THEN
  2313. dst := NewRegisterOperand (addressType);
  2314. src := NewRegisterOperand (addressType);
  2315. Emit (Mov(position, dst, parameter1));
  2316. Emit (Mov(position, src, parameter2));
  2317. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2318. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2319. CallAssignMethod(dst, src, variable.type);
  2320. ReleaseIntermediateOperand(src);
  2321. ReleaseIntermediateOperand(dst);
  2322. END;
  2323. variable := variable.nextVariable;
  2324. END;
  2325. recordBase := recordType.GetBaseRecord();
  2326. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2327. IF backend.hasLinkRegister THEN
  2328. Emit(Pop(Basic.invalidPosition, lr));
  2329. END;
  2330. GetRecordTypeName (recordBase,name);
  2331. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2332. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2333. Emit(Br(position,op));
  2334. ELSE
  2335. Emit(Exit(position,0,0, 0));
  2336. END;
  2337. IF ~recordType.isObject THEN
  2338. GetRecordTypeName (recordType,name);
  2339. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2340. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2341. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2342. NEW(registerUsageCount);
  2343. usedRegisters := NIL;
  2344. dst := NewRegisterOperand (addressType);
  2345. src := NewRegisterOperand (addressType);
  2346. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2347. Emit(Mov(position, dst, parameter1));
  2348. Emit(Mov(position, src, parameter2));
  2349. label := NewLabel();
  2350. SetLabel(label);
  2351. Emit(Push(position, dst));
  2352. Emit(Push(position, src));
  2353. GetRecordTypeName (recordType,name);
  2354. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2355. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2356. Emit(Call(position, op, 0));
  2357. Emit(Pop(position, src));
  2358. Emit(Pop(position, dst));
  2359. Emit(Add(position, dst, dst, ofs));
  2360. Emit(Add(position, src, src, ofs));
  2361. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2362. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2363. Emit(Exit(position,0,0, 0));
  2364. END;
  2365. INC(statCoopAssignProcedure, section.pc);
  2366. ReturnToContext(context);
  2367. IF dump # NIL THEN dump := section.comments END;
  2368. END CreateAssignProcedure;
  2369. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2370. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2371. BEGIN
  2372. IF IsUnsafePointer (type) THEN
  2373. skip := NewLabel();
  2374. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2375. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2376. BreqL (skip, op, nil);
  2377. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2378. SetLabel (skip);
  2379. ELSIF SemanticChecker.IsPointerType (type) THEN
  2380. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2381. CallThis(position,"GarbageCollector","Mark", 1);
  2382. ELSIF type.IsRecordType() THEN
  2383. Emit (Push(position,register));
  2384. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2385. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2386. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2387. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2388. ELSIF IsStaticArray(type) THEN
  2389. size := StaticArrayNumElements(type);
  2390. base := StaticArrayBaseType(type);
  2391. IF base.IsRecordType() THEN
  2392. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2393. Emit (Push(position, register));
  2394. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2395. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2396. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2397. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2398. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2399. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2400. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2401. Emit (Push(position, register));
  2402. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2403. ELSE
  2404. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2405. Emit (Push(position, register));
  2406. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2407. ASSERT(base.IsPointer());
  2408. END;
  2409. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2410. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2411. CallThis(position,"GarbageCollector","Mark", 1);
  2412. ELSE HALT(100); (* missing ? *)
  2413. END;
  2414. END CallTraceMethod;
  2415. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2416. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2417. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2418. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2419. BEGIN
  2420. previousSection := section;
  2421. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2422. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2423. GetRecordTypeName (recordType,name);
  2424. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2425. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2426. IF dump # NIL THEN dump := section.comments END;
  2427. IF backend.hasLinkRegister THEN
  2428. Emit(Push(Basic.invalidPosition, lr));
  2429. END;
  2430. variable := recordType.recordScope.firstVariable;
  2431. WHILE variable # NIL DO
  2432. IF variable.NeedsTrace() THEN
  2433. register := NewRegisterOperand (addressType);
  2434. Emit (Mov(position,register,parameter1));
  2435. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2436. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2437. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2438. END;
  2439. CallTraceMethod(register, variable.type);
  2440. ReleaseIntermediateOperand(register);
  2441. END;
  2442. variable := variable.nextVariable;
  2443. END;
  2444. recordBase := recordType.GetBaseRecord();
  2445. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2446. recordBase := recordBase.GetBaseRecord();
  2447. END;
  2448. IF recordBase # NIL THEN
  2449. IF backend.hasLinkRegister THEN
  2450. Emit(Pop(Basic.invalidPosition, lr));
  2451. END;
  2452. GetRecordTypeName (recordBase,name);
  2453. IF HasExplicitTraceMethod (recordBase) THEN
  2454. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2455. ELSE
  2456. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2457. END;
  2458. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2459. Emit(Br(position,op));
  2460. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2461. Emit(Exit(position,0,0,0));
  2462. ELSE
  2463. IF backend.hasLinkRegister THEN
  2464. Emit(Pop(Basic.invalidPosition, lr));
  2465. END;
  2466. IF recordType.isObject THEN
  2467. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2468. ELSE
  2469. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2470. END;
  2471. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2472. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2473. Emit(Br(position,op));
  2474. END;
  2475. IF ~recordType.isObject THEN
  2476. GetRecordTypeName (recordType,name);
  2477. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2478. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2479. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2480. NEW(registerUsageCount);
  2481. usedRegisters := NIL;
  2482. IF dump # NIL THEN dump := section.comments END;
  2483. register := NewRegisterOperand (addressType);
  2484. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2485. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2486. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2487. END;
  2488. Emit (Push(position,register));
  2489. GetRecordTypeName (recordType,name);
  2490. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2491. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2492. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2493. ReleaseIntermediateOperand(register);
  2494. Emit(Exit(position,0,0,0));
  2495. GetRecordTypeName (recordType,name);
  2496. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2497. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2498. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2499. NEW(registerUsageCount);
  2500. usedRegisters := NIL;
  2501. register := NewRegisterOperand (addressType);
  2502. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2503. Emit(Mov(position, register, parameter1));
  2504. label := NewLabel();
  2505. SetLabel(label);
  2506. Emit(Push(position, register));
  2507. GetRecordTypeName (recordType,name);
  2508. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2509. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2510. Emit(Call(position, op, 0));
  2511. Emit(Pop(position, register));
  2512. Emit(Add(position, register, register, ofs));
  2513. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2514. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2515. Emit(Exit(position,0,0,0));
  2516. END;
  2517. INC(statCoopTraceMethod, section.pc);
  2518. ReturnToContext(context);
  2519. IF dump # NIL THEN dump := section.comments END;
  2520. END CreateTraceMethod;
  2521. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2522. VAR name: Basic.SegmentedName;
  2523. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2524. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2525. context: Context;
  2526. BEGIN
  2527. IF recordType.isObject THEN RETURN END;
  2528. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2529. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2530. GetRecordTypeName (recordType,name);
  2531. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2532. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2533. IF dump # NIL THEN dump := section.comments END;
  2534. IF backend.hasLinkRegister THEN
  2535. Emit(Push(Basic.invalidPosition, lr));
  2536. END;
  2537. variable := recordType.recordScope.firstVariable;
  2538. WHILE variable # NIL DO
  2539. IF variable.NeedsTrace() THEN
  2540. dst := NewRegisterOperand (addressType);
  2541. Emit (Mov(position, dst, parameter1));
  2542. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2543. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2544. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2545. END;
  2546. CallResetProcedure(dst, nil, variable.type);
  2547. ReleaseIntermediateOperand(dst);
  2548. END;
  2549. variable := variable.nextVariable;
  2550. END;
  2551. recordBase := recordType.GetBaseRecord();
  2552. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2553. IF backend.hasLinkRegister THEN
  2554. Emit(Pop(Basic.invalidPosition, lr));
  2555. END;
  2556. GetRecordTypeName (recordBase,name);
  2557. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2558. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2559. Emit(Br(position,op));
  2560. ELSE
  2561. Emit(Exit(position,0,0, 0));
  2562. END;
  2563. GetRecordTypeName (recordType,name);
  2564. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2565. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2566. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2567. NEW(registerUsageCount);
  2568. usedRegisters := NIL;
  2569. dst := NewRegisterOperand (addressType);
  2570. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2571. Emit(Mov(position, dst, parameter1));
  2572. label := NewLabel();
  2573. SetLabel(label);
  2574. Emit(Push(position, dst));
  2575. GetRecordTypeName (recordType,name);
  2576. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2577. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2578. Emit(Call(position, op, 0));
  2579. Emit(Pop(position, dst));
  2580. Emit(Add(position, dst, dst, ofs));
  2581. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2582. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2583. Emit(Exit(position,0,0, 0));
  2584. INC(statCoopResetProcedure, section.pc);
  2585. ReturnToContext(context);
  2586. IF dump # NIL THEN dump := section.comments END;
  2587. END CreateResetProcedure;
  2588. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2589. VAR name: Basic.SegmentedName; context: Context;
  2590. BEGIN
  2591. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2592. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2593. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2594. IF dump # NIL THEN dump := section.comments END;
  2595. IF backend.hasLinkRegister THEN
  2596. Emit(Push(Basic.invalidPosition, lr));
  2597. END;
  2598. Emit(Push(position,fp));
  2599. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2600. ResetVariables(scope);
  2601. Emit(Pop(position,fp));
  2602. Emit(Exit(position,0,0, 0));
  2603. ReturnToContext(context);
  2604. IF dump # NIL THEN dump := section.comments END;
  2605. END CreateResetMethod;
  2606. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2607. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2608. BEGIN
  2609. IF SemanticChecker.IsPointerType (type) THEN
  2610. Emit (Push(position, dest));
  2611. CallThis(position,"GarbageCollector","Reset", 1);
  2612. ELSIF type.IsRecordType() THEN
  2613. Emit (Push(position, dest));
  2614. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2615. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2616. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2617. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2618. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2619. size := GetArrayLength(type, tag);
  2620. base := ArrayBaseType(type);
  2621. IF base.IsRecordType() THEN
  2622. Emit (Push(position, size));
  2623. Emit (Push(position, dest));
  2624. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2625. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2626. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2627. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2628. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2629. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2630. Emit (Push(position, size));
  2631. Emit (Push(position, dest));
  2632. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2633. ELSE
  2634. Emit (Push(position, size));
  2635. Emit (Push(position, dest));
  2636. CallThis(position,"GarbageCollector","ResetArray", 2);
  2637. ASSERT(ArrayBaseType(type).IsPointer());
  2638. END;
  2639. ReleaseIntermediateOperand(size);
  2640. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2641. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2642. Emit (Push(position, dest));
  2643. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2644. ELSE HALT(100); (* missing ? *)
  2645. END;
  2646. END CallResetProcedure;
  2647. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2648. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2649. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2650. VAR operand: Operand;
  2651. BEGIN
  2652. Symbol (symbol, operand);
  2653. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2654. ReleaseOperand(operand);
  2655. END Reset;
  2656. BEGIN
  2657. previousScope := currentScope;
  2658. currentScope := scope;
  2659. pc := section.pc;
  2660. variable := scope.firstVariable;
  2661. WHILE variable # NIL DO
  2662. IF variable.NeedsTrace() THEN
  2663. Reset (variable);
  2664. END;
  2665. variable := variable.nextVariable;
  2666. END;
  2667. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2668. WHILE parameter # NIL DO
  2669. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  2670. Reset (parameter);
  2671. END;
  2672. parameter := parameter.nextParameter;
  2673. END;
  2674. INC(statCoopResetVariables, section.pc - pc);
  2675. currentScope := previousScope;
  2676. END ResetVariables;
  2677. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  2678. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  2679. BEGIN
  2680. type := symbol.type.resolved;
  2681. SaveRegisters();ReleaseUsedRegisters(saved);
  2682. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  2683. Symbol(symbol, operand);
  2684. ToMemory(operand.op,addressType,0);
  2685. Emit(Push(position,operand.op));
  2686. IF refer THEN
  2687. CallThis(position,"Heaps","Refer",1);
  2688. ELSE
  2689. CallThis(position,"Heaps","Reset",1);
  2690. END;
  2691. ELSIF type.IsRecordType() THEN
  2692. Symbol(symbol, operand);
  2693. Emit(Push(position,operand.op));
  2694. Emit(Push(position,operand.tag)); (* type desc *)
  2695. IF refer THEN
  2696. CallThis(position,"Heaps","ReferRecord",2);
  2697. ELSE
  2698. CallThis(position,"Heaps","ResetRecord",2);
  2699. END;
  2700. ELSIF IsStaticArray(type) THEN
  2701. size := StaticArrayNumElements(type);
  2702. base := StaticArrayBaseType(type);
  2703. Symbol(symbol, operand);
  2704. arg := TypeDescriptorAdr(base);
  2705. Emit(Push(position,operand.op));
  2706. Emit(Push(position,arg));
  2707. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2708. ReleaseIntermediateOperand(arg);
  2709. IF refer THEN
  2710. CallThis(position,"Heaps","ReferArray",3);
  2711. ELSE
  2712. CallThis(position,"Heaps","ResetArray",3);
  2713. END;
  2714. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  2715. size := StaticMathArrayNumElements(type);
  2716. base := StaticMathArrayBaseType(type);
  2717. Symbol(symbol, operand);
  2718. arg := TypeDescriptorAdr(base);
  2719. Emit(Push(position,operand.op));
  2720. Emit(Push(position,arg));
  2721. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2722. ReleaseIntermediateOperand(arg);
  2723. IF refer THEN
  2724. CallThis(position,"Heaps","ReferArray",3);
  2725. ELSE
  2726. CallThis(position,"Heaps","ResetArray",3);
  2727. END;
  2728. ELSIF type IS SyntaxTree.MathArrayType THEN
  2729. Symbol(symbol, operand);
  2730. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  2731. Emit (Push(position, operand.op));
  2732. ELSE
  2733. Emit (Push(position, operand.tag));
  2734. END;
  2735. IF refer THEN
  2736. CallThis(position,"Heaps","ReferMathArray", 1);
  2737. ELSE
  2738. CallThis(position,"Heaps","ResetMathArray", 1);
  2739. END;
  2740. ELSIF type IS SyntaxTree.ProcedureType THEN
  2741. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  2742. Symbol(symbol, operand);
  2743. Emit (Push(position, operand.tag));
  2744. IF refer THEN
  2745. CallThis(position,"Heaps","Refer", 1);
  2746. ELSE
  2747. CallThis(position,"Heaps","Reset", 1);
  2748. END;
  2749. ELSE HALT(100); (* missing ? *)
  2750. END;
  2751. ReleaseOperand(operand);
  2752. RestoreRegisters(saved);
  2753. END Reset;
  2754. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  2755. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  2756. BEGIN
  2757. previousScope := currentScope;
  2758. currentScope := scope;
  2759. pc := section.pc;
  2760. IF ~ refer THEN
  2761. variable := scope.firstVariable;
  2762. prevOffset := MAX(SIZE);
  2763. WHILE variable # NIL DO
  2764. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2765. Reset (variable,refer);
  2766. prevOffset := variable.offsetInBits;
  2767. END;
  2768. variable := variable.nextVariable;
  2769. END;
  2770. END;
  2771. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2772. WHILE parameter # NIL DO
  2773. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  2774. Reset (parameter,refer);
  2775. END;
  2776. parameter := parameter.nextParameter;
  2777. END;
  2778. INC(statCoopResetVariables, section.pc - pc);
  2779. currentScope := previousScope;
  2780. END ResetVariables2;
  2781. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2782. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2783. VAR op: IntermediateCode.Operand; context: Context;
  2784. BEGIN
  2785. previousSection := section;
  2786. GetCodeSectionNameForSymbol(procedure, name);
  2787. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2788. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2789. IF dump # NIL THEN dump := section.comments END;
  2790. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2791. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2792. Emit(Data(position,op));
  2793. Emit(Data(position,nil));
  2794. IF HasPointers (procedure.procedureScope) THEN
  2795. GetCodeSectionNameForSymbol(procedure, name);
  2796. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2797. ELSE
  2798. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2799. END;
  2800. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2801. Emit(Data(position,op));
  2802. ReturnToContext(context);
  2803. IF dump # NIL THEN dump := section.comments END;
  2804. END CreateProcedureDescriptor;
  2805. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2806. VAR import: SyntaxTree.Import;
  2807. s: Basic.MessageString;
  2808. selfName: SyntaxTree.IdentifierString;
  2809. BEGIN
  2810. moduleScope.ownerModule.GetName(selfName);
  2811. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2812. module := moduleScope.ownerModule
  2813. ELSE
  2814. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2815. IF import = NIL THEN
  2816. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2817. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2818. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2819. s := "Module ";
  2820. Strings.Append(s,moduleName);
  2821. Strings.Append(s," cannot be imported.");
  2822. IF force THEN
  2823. Error(position,s);
  2824. ELSIF canBeLoaded THEN
  2825. IF WarningDynamicLoading THEN
  2826. Strings.Append(s, "=> no dynamic linking.");
  2827. Warning(position, s);
  2828. END;
  2829. canBeLoaded := FALSE;
  2830. END;
  2831. RETURN FALSE
  2832. ELSE
  2833. SELF.module.imports.AddName(moduleName)
  2834. END;
  2835. ELSIF import.module = NIL THEN (* already tried *)
  2836. RETURN FALSE
  2837. END;
  2838. module := import.module;
  2839. END;
  2840. RETURN TRUE
  2841. END AddImport;
  2842. (* needed for old binary object file format*)
  2843. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2844. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2845. BEGIN
  2846. IF AddImport(moduleName,module,TRUE) THEN
  2847. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2848. IF procedure = NIL THEN
  2849. s := "Instruction not supported on target, emulation procedure ";
  2850. Strings.Append(s,moduleName);
  2851. Strings.Append(s,".");
  2852. Strings.Append(s,procedureName);
  2853. Strings.Append(s," not present");
  2854. Error(position,s);
  2855. ELSE
  2856. StaticCallOperand(r,procedure);
  2857. ReleaseOperand(r);
  2858. fp := GetFingerprint(procedure);
  2859. END;
  2860. END;
  2861. END EnsureSymbol;
  2862. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2863. VAR exit: Label; trueL,falseL: Label;
  2864. BEGIN
  2865. trueL := NewLabel();
  2866. falseL := NewLabel();
  2867. exit := NewLabel();
  2868. Condition(x,trueL,falseL);
  2869. InitOperand(result,ModeValue);
  2870. SetLabel(trueL);
  2871. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2872. Emit(Mov(position,result.op,true));
  2873. BrL(exit);
  2874. SetLabel(falseL);
  2875. Emit(MovReplace(position,result.op,false));
  2876. SetLabel(exit);
  2877. END ConditionToValue;
  2878. PROCEDURE ValueToCondition(VAR op: Operand);
  2879. BEGIN
  2880. LoadValue(op,system.booleanType);
  2881. BrneL(trueLabel,op.op, false);
  2882. ReleaseOperand(op);
  2883. BrL(falseLabel);
  2884. END ValueToCondition;
  2885. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2886. VAR size: LONGINT;
  2887. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2888. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2889. BEGIN
  2890. ASSERT(type.form = SyntaxTree.Open);
  2891. baseType := type.arrayBase.resolved;
  2892. IF IsOpenArray(baseType) THEN
  2893. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2894. ELSE
  2895. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2896. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2897. END;
  2898. len := tag;
  2899. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2900. IntermediateCode.MakeMemory(len,addressType);
  2901. UseIntermediateOperand(len);
  2902. Reuse2(res,sizeOperand,len);
  2903. Emit(Mul(position,res,sizeOperand,len));
  2904. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2905. RETURN res
  2906. END GetArraySize;
  2907. BEGIN
  2908. type := type.resolved;
  2909. IF IsOpenArray(type) THEN
  2910. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2911. RETURN tag
  2912. ELSE
  2913. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2914. END;
  2915. ELSE
  2916. size := ToMemoryUnits(system,system.SizeOf(type));
  2917. RETURN IntermediateCode.Immediate(addressType,size)
  2918. END;
  2919. END GetDynamicSize;
  2920. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2921. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2922. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2923. BEGIN
  2924. ASSERT(type.form = SyntaxTree.Open);
  2925. baseType := type.arrayBase.resolved;
  2926. IF IsOpenArray(baseType) THEN
  2927. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2928. ELSE
  2929. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2930. END;
  2931. len := tag;
  2932. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2933. IntermediateCode.MakeMemory(len,addressType);
  2934. UseIntermediateOperand(len);
  2935. Reuse2(res,sizeOperand,len);
  2936. Emit(Mul(position,res,sizeOperand,len));
  2937. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2938. RETURN res
  2939. END GetLength;
  2940. BEGIN
  2941. type := type.resolved;
  2942. IF IsOpenArray(type) THEN
  2943. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2944. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2945. ELSIF type IS SyntaxTree.StringType THEN
  2946. RETURN tag;
  2947. ELSE
  2948. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2949. END;
  2950. END GetArrayLength;
  2951. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2952. VAR result: IntermediateCode.Operand;
  2953. BEGIN
  2954. IF backend.cooperative THEN
  2955. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2956. ELSE
  2957. MakeMemory(result, tag, addressType, 0);
  2958. END;
  2959. RETURN result
  2960. END GetSizeFromTag;
  2961. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2962. VAR parameter: SyntaxTree.Parameter;
  2963. BEGIN
  2964. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2965. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2966. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2967. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2968. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2969. END;
  2970. RETURN GetDynamicSize(e.type, tag);
  2971. END GetArrayOfBytesSize;
  2972. (*
  2973. to find imported symbol. not needed ?
  2974. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2975. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2976. BEGIN
  2977. IF AddImport(moduleName,importedModule,FALSE) THEN
  2978. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2979. RETURN symbol
  2980. ELSE
  2981. RETURN NIL
  2982. END
  2983. END SymbolByName;
  2984. *)
  2985. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  2986. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  2987. BEGIN
  2988. IF AddImport(moduleName,runtimeModule,force) THEN
  2989. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2990. IF procedure = NIL THEN
  2991. s := "Procedure ";
  2992. Strings.Append(s,moduleName);
  2993. Strings.Append(s,".");
  2994. Strings.Append(s,procedureName);
  2995. Strings.Append(s," not present");
  2996. Error(position,s);
  2997. RETURN FALSE
  2998. ELSE
  2999. RETURN TRUE
  3000. END;
  3001. ELSE RETURN FALSE
  3002. END;
  3003. END GetRuntimeProcedure;
  3004. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3005. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3006. s: Basic.MessageString;
  3007. BEGIN
  3008. Basic.InitSegmentedName(name);
  3009. name[0] := Basic.MakeString(moduleName);
  3010. name[1] := Basic.MakeString(typeName);
  3011. name[2] := -1;
  3012. IF AddImport(moduleName,importedModule, FALSE) THEN
  3013. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3014. IF symbol = NIL THEN
  3015. s := "type ";
  3016. Strings.Append(s,moduleName);
  3017. Strings.Append(s,".");
  3018. Strings.Append(s,typeName);
  3019. Strings.Append(s," not present");
  3020. Error(position,s);
  3021. END;
  3022. ELSE symbol := NIL;
  3023. END;
  3024. IF importedModule = moduleScope.ownerModule THEN
  3025. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3026. ELSE
  3027. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3028. END;
  3029. RETURN symbol
  3030. END GetTypeDescriptor;
  3031. (* 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. *)
  3032. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3033. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3034. pooledName: Basic.SegmentedName; size: LONGINT;
  3035. BEGIN
  3036. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3037. StaticCallOperand(result,procedure);
  3038. IF numberParameters < 0 THEN
  3039. size := ProcParametersSize(procedure);
  3040. ELSE
  3041. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3042. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3043. Error(position,"runtime call parameter count mismatch");
  3044. END;
  3045. END;
  3046. Emit(Call(position, result.op, size));
  3047. ReleaseOperand(result);
  3048. ELSE (* only static linking possible *)
  3049. ASSERT(numberParameters >= 0);
  3050. Basic.InitSegmentedName(pooledName);
  3051. pooledName[0] := Basic.MakeString(moduleName);
  3052. pooledName[1] := Basic.MakeString(procedureName);
  3053. pooledName[2] := -1;
  3054. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3055. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3056. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3057. END;
  3058. END CallThisChecked;
  3059. (* 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. *)
  3060. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3061. BEGIN
  3062. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3063. END CallThis;
  3064. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  3065. VAR
  3066. left,right: Operand;
  3067. leftSize, rightSize: IntermediateCode.Operand;
  3068. saved: RegisterEntry;
  3069. reg: IntermediateCode.Operand;
  3070. procedureName: SyntaxTree.IdentifierString;
  3071. BEGIN
  3072. procedureName := "CompareString";
  3073. SaveRegisters();ReleaseUsedRegisters(saved);
  3074. Designate(leftExpression,left);
  3075. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3076. Emit(Push(position,leftSize));
  3077. ReleaseIntermediateOperand(leftSize);
  3078. Emit(Push(position,left.op));
  3079. ReleaseOperand(left);
  3080. Designate(rightExpression,right);
  3081. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3082. Emit(Push(position,rightSize));
  3083. ReleaseIntermediateOperand(rightSize);
  3084. Emit(Push(position,right.op));
  3085. ReleaseOperand(right);
  3086. CallThis(position,builtinsModuleName,procedureName, 4);
  3087. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3088. Emit(Result(position,reg));
  3089. (*
  3090. AcquireThisRegister(int8,IntermediateCode.Result);
  3091. *)
  3092. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  3093. (*
  3094. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  3095. *)
  3096. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  3097. ReleaseIntermediateOperand(reg);
  3098. BrL(falseLabel);
  3099. END CompareString;
  3100. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3101. VAR
  3102. left,right: Operand;
  3103. leftSize, rightSize: IntermediateCode.Operand;
  3104. saved: RegisterEntry;
  3105. procedureName: SyntaxTree.IdentifierString;
  3106. BEGIN
  3107. procedureName := "CopyString";
  3108. SaveRegisters();ReleaseUsedRegisters(saved);
  3109. Designate(leftExpression,left);
  3110. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3111. Emit(Push(position,leftSize));
  3112. ReleaseIntermediateOperand(leftSize);
  3113. Emit(Push(position,left.op));
  3114. ReleaseOperand(left);
  3115. Designate(rightExpression,right);
  3116. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3117. Emit(Push(position,rightSize));
  3118. ReleaseIntermediateOperand(rightSize);
  3119. Emit(Push(position,right.op));
  3120. ReleaseOperand(right);
  3121. CallThis(position,builtinsModuleName,procedureName,4);
  3122. RestoreRegisters(saved);
  3123. END CopyString;
  3124. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3125. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3126. leftType,rightType: SyntaxTree.Type;
  3127. leftExpression,rightExpression : SyntaxTree.Expression;
  3128. componentType: IntermediateCode.Type;
  3129. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3130. size: LONGINT;
  3131. BEGIN
  3132. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3133. dest := destination; destination := emptyOperand;
  3134. leftType := x.left.type.resolved;
  3135. rightType := x.right.type.resolved;
  3136. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3137. CASE x.operator OF
  3138. Scanner.Or:
  3139. (* shortcut evaluation of left OR right *)
  3140. IF ~conditional THEN ConditionToValue(x);
  3141. ELSE
  3142. next := NewLabel();
  3143. Condition(x.left,trueLabel,next);
  3144. SetLabel(next);
  3145. Condition(x.right,trueLabel,falseLabel);
  3146. END;
  3147. |Scanner.And:
  3148. (* shortcut evaluation of left & right *)
  3149. IF ~conditional THEN ConditionToValue(x);
  3150. ELSE
  3151. next := NewLabel();
  3152. Condition(x.left,next,falseLabel);
  3153. SetLabel(next);
  3154. Condition(x.right,trueLabel,falseLabel);
  3155. END;
  3156. |Scanner.Is:
  3157. IF ~conditional THEN ConditionToValue(x);
  3158. ELSE
  3159. (* get type desc tag *)
  3160. IF IsPointerToRecord(leftType,recordType) THEN
  3161. Evaluate(x.left,left);
  3162. Dereference(left,recordType,IsUnsafePointer(leftType))
  3163. ELSE
  3164. Designate(x.left,left);
  3165. END;
  3166. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3167. ReleaseOperand(left);
  3168. END;
  3169. |Scanner.Plus:
  3170. Evaluate(x.left,left);
  3171. Evaluate(x.right,right);
  3172. IF leftType IS SyntaxTree.SetType THEN
  3173. InitOperand(result,ModeValue);
  3174. Reuse2a(result.op,left.op,right.op,dest);
  3175. Emit(Or(position,result.op,left.op,right.op));
  3176. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3177. InitOperand(result,ModeValue);
  3178. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3179. Reuse2(result.tag,left.tag,right.tag);
  3180. Emit(Add(position,result.op,left.op,right.op));
  3181. Emit(Add(position,result.tag,left.tag,right.tag))
  3182. ELSE
  3183. InitOperand(result,ModeValue);
  3184. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3185. AddInt(result.op, left.op, right.op) ;
  3186. ELSE
  3187. *)
  3188. Reuse2a(result.op,left.op,right.op,dest);
  3189. Emit(Add(position,result.op,left.op,right.op));
  3190. (*
  3191. END;
  3192. *)
  3193. END;
  3194. ReleaseOperand(left); ReleaseOperand(right);
  3195. |Scanner.Minus:
  3196. Evaluate(x.left,left);
  3197. Evaluate(x.right,right);
  3198. IF leftType IS SyntaxTree.SetType THEN
  3199. InitOperand(result,ModeValue);
  3200. Reuse1(result.op,right.op);
  3201. Emit(Not(position,result.op,right.op));
  3202. ReleaseOperand(right);
  3203. Emit(And(position,result.op,result.op,left.op));
  3204. ReleaseOperand(left);
  3205. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3206. InitOperand(result,ModeValue);
  3207. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3208. Reuse2(result.tag,left.tag,right.tag);
  3209. Emit(Sub(position,result.op,left.op,right.op));
  3210. Emit(Sub(position,result.tag,left.tag,right.tag));
  3211. ReleaseOperand(left); ReleaseOperand(right)
  3212. ELSE
  3213. InitOperand(result,ModeValue);
  3214. Reuse2a(result.op,left.op,right.op,dest);
  3215. Emit(Sub(position,result.op,left.op,right.op));
  3216. ReleaseOperand(left); ReleaseOperand(right);
  3217. END;
  3218. |Scanner.Times:
  3219. Evaluate(x.left,left);
  3220. Evaluate(x.right,right);
  3221. IF leftType IS SyntaxTree.SetType THEN
  3222. InitOperand(result,ModeValue);
  3223. Reuse2a(result.op,left.op,right.op,dest);
  3224. Emit(And(position,result.op,left.op,right.op));
  3225. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3226. InitOperand(result, ModeValue);
  3227. componentType := left.op.type;
  3228. (* TODO: review this *)
  3229. (*
  3230. result.op = left.op * right.op - left.tag * right.tag
  3231. result.tag = left.tag * right.op + left.op * right.tag
  3232. *)
  3233. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3234. Emit(Mul(position,result.op, left.op, right.op));
  3235. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3236. Emit(Mul(position,tempReg, left.tag, right.tag));
  3237. Emit(Sub(position,result.op, result.op, tempReg));
  3238. Reuse2(result.tag, left.tag, right.op);
  3239. Emit(Mul(position,result.tag, left.tag, right.op));
  3240. Emit(Mul(position,tempReg, left.op, right.tag));
  3241. Emit(Add(position,result.tag, result.tag, tempReg));
  3242. ReleaseIntermediateOperand(tempReg)
  3243. ELSE
  3244. InitOperand(result,ModeValue);
  3245. Reuse2a(result.op,left.op,right.op,dest);
  3246. Emit(Mul(position,result.op,left.op,right.op));
  3247. END;
  3248. ReleaseOperand(left); ReleaseOperand(right);
  3249. |Scanner.Div:
  3250. Evaluate(x.left,left);
  3251. Evaluate(x.right,right);
  3252. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3253. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3254. IF ~isUnchecked THEN
  3255. exit := NewLabel();
  3256. BrltL(exit,zero,right.op);
  3257. EmitTrap(position,NegativeDivisorTrap);
  3258. SetLabel(exit);
  3259. END;
  3260. END;
  3261. InitOperand(result,ModeValue);
  3262. Reuse2a(result.op,left.op,right.op,dest);
  3263. Emit(Div(position,result.op,left.op,right.op));
  3264. ReleaseOperand(left); ReleaseOperand(right);
  3265. |Scanner.Mod:
  3266. Evaluate(x.left,left);
  3267. Evaluate(x.right,right);
  3268. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3269. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3270. IF ~isUnchecked THEN
  3271. exit := NewLabel();
  3272. BrltL(exit,zero,right.op);
  3273. EmitTrap(position,NegativeDivisorTrap);
  3274. SetLabel(exit);
  3275. END;
  3276. END;
  3277. InitOperand(result,ModeValue);
  3278. Reuse2a(result.op,left.op,right.op,dest);
  3279. Emit(Mod(position,result.op,left.op,right.op));
  3280. ReleaseOperand(left); ReleaseOperand(right);
  3281. |Scanner.Slash:
  3282. Evaluate(x.left,left);
  3283. Evaluate(x.right,right);
  3284. IF leftType IS SyntaxTree.SetType THEN
  3285. InitOperand(result,ModeValue);
  3286. Reuse2a(result.op,left.op,right.op,dest);
  3287. Emit(Xor(position,result.op,left.op,right.op));
  3288. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3289. InitOperand(result,ModeValue);
  3290. componentType := left.op.type;
  3291. (* review this *)
  3292. (*
  3293. divisor = right.op * right.op + right.tag * right.tag
  3294. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3295. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3296. *)
  3297. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3298. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3299. Emit(Mul(position,tempReg, right.op, right.op));
  3300. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3301. Emit(Add(position,tempReg, tempReg, tempReg2));
  3302. result.op := tempReg2;
  3303. Emit(Mul(position,result.op, left.op, right.op));
  3304. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3305. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3306. Emit(Add(position,result.op, result.op, tempReg2));
  3307. Emit(Div(position,result.op, result.op, tempReg));
  3308. Reuse2(result.tag, left.tag, right.op);
  3309. Emit(Mul(position,result.tag, left.tag, right.op));
  3310. Emit(Mul(position,tempReg2, left.op, right.tag));
  3311. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3312. Emit(Div(position,result.tag, result.tag, tempReg));
  3313. ReleaseIntermediateOperand(tempReg);
  3314. ReleaseIntermediateOperand(tempReg2)
  3315. ELSE
  3316. InitOperand(result,ModeValue);
  3317. Reuse2a(result.op,left.op,right.op,dest);
  3318. Emit(Div(position,result.op,left.op,right.op));
  3319. END;
  3320. ReleaseOperand(left); ReleaseOperand(right);
  3321. |Scanner.Equal:
  3322. IF ~conditional THEN ConditionToValue(x);
  3323. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3324. CompareString(BreqL,x.left,x.right);
  3325. ELSE
  3326. Evaluate(x.left,left);
  3327. Evaluate(x.right,right);
  3328. IF leftType IS SyntaxTree.RangeType THEN
  3329. ASSERT(rightType IS SyntaxTree.RangeType);
  3330. BrneL(falseLabel, left.op, right.op); (* first *)
  3331. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3332. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3333. ReleaseOperand(left); ReleaseOperand(right);
  3334. BrL(trueLabel)
  3335. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3336. BrneL(falseLabel, left.op, right.op); (* first *)
  3337. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3338. ReleaseOperand(left); ReleaseOperand(right);
  3339. BrL(trueLabel)
  3340. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3341. (* TODO: review this *)
  3342. BrneL(falseLabel, left.op, right.op); (* real part *)
  3343. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3344. ReleaseOperand(left); ReleaseOperand(right);
  3345. BrL(trueLabel)
  3346. ELSE
  3347. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3348. ReleaseOperand(left); ReleaseOperand(right);
  3349. BrL(trueLabel);
  3350. END;
  3351. END;
  3352. |Scanner.LessEqual:
  3353. IF ~conditional THEN ConditionToValue(x);
  3354. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3355. CompareString(BrgeL,x.right,x.left);
  3356. ELSE
  3357. Evaluate(x.left,left);
  3358. Evaluate(x.right,right);
  3359. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3360. Reuse1(temp.op,right.op);
  3361. Emit(And(position,temp.op,left.op,right.op));
  3362. ReleaseOperand(right);
  3363. BreqL(trueLabel,temp.op,left.op);
  3364. BrL(falseLabel);
  3365. ReleaseOperand(temp);ReleaseOperand(left);
  3366. ELSE
  3367. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3368. ReleaseOperand(left); ReleaseOperand(right);
  3369. BrL(trueLabel);
  3370. END;
  3371. END;
  3372. |Scanner.Less:
  3373. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3374. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3375. leftExpression.SetType(system.booleanType);
  3376. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3377. rightExpression.SetType(system.booleanType);
  3378. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3379. leftExpression.SetType(system.booleanType);
  3380. Expression(leftExpression);
  3381. ELSIF ~conditional THEN ConditionToValue(x);
  3382. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3383. CompareString(BrltL,x.left,x.right);
  3384. ELSE
  3385. Evaluate(x.left,left);
  3386. Evaluate(x.right,right);
  3387. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3388. ReleaseOperand(left); ReleaseOperand(right);
  3389. BrL(trueLabel);
  3390. END;
  3391. |Scanner.Greater:
  3392. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3393. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3394. leftExpression.SetType(system.booleanType);
  3395. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3396. rightExpression.SetType(system.booleanType);
  3397. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3398. leftExpression.SetType(system.booleanType);
  3399. Expression(leftExpression);
  3400. ELSIF ~conditional THEN ConditionToValue(x);
  3401. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3402. CompareString(BrltL,x.right,x.left);
  3403. ELSE
  3404. Evaluate(x.left,left);
  3405. Evaluate(x.right,right);
  3406. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3407. ReleaseOperand(left); ReleaseOperand(right);
  3408. BrL(trueLabel);
  3409. END;
  3410. |Scanner.GreaterEqual:
  3411. IF ~conditional THEN ConditionToValue(x);
  3412. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3413. CompareString(BrgeL,x.left,x.right);
  3414. ELSE
  3415. Evaluate(x.left,left);
  3416. Evaluate(x.right,right);
  3417. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3418. Reuse1(temp.op,left.op);
  3419. Emit(And(position,temp.op,left.op,right.op));
  3420. ReleaseOperand(left);
  3421. BreqL(trueLabel, temp.op,right.op);
  3422. ReleaseOperand(temp); ReleaseOperand(right);
  3423. BrL(falseLabel);
  3424. ELSE
  3425. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3426. ReleaseOperand(left); ReleaseOperand(right);
  3427. BrL(trueLabel);
  3428. END;
  3429. END;
  3430. |Scanner.Unequal:
  3431. IF ~conditional THEN ConditionToValue(x);
  3432. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3433. CompareString(BrneL,x.left,x.right);
  3434. ELSE
  3435. Evaluate(x.left,left);
  3436. Evaluate(x.right,right);
  3437. IF leftType IS SyntaxTree.RangeType THEN
  3438. ASSERT(rightType IS SyntaxTree.RangeType);
  3439. BrneL(trueLabel, left.op, right.op); (* first *)
  3440. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3441. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3442. ReleaseOperand(left); ReleaseOperand(right);
  3443. BrL(falseLabel)
  3444. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3445. BrneL(trueLabel, left.op, right.op); (* first *)
  3446. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3447. ReleaseOperand(left); ReleaseOperand(right);
  3448. BrL(falseLabel)
  3449. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3450. (* TODO: review this *)
  3451. BrneL(trueLabel, left.op, right.op); (* real part *)
  3452. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3453. ReleaseOperand(left); ReleaseOperand(right);
  3454. BrL(falseLabel)
  3455. ELSE
  3456. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3457. ReleaseOperand(left); ReleaseOperand(right);
  3458. BrL(trueLabel);
  3459. END;
  3460. END;
  3461. |Scanner.In:
  3462. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3463. Evaluate(x.left,left);
  3464. Evaluate(x.right,right);
  3465. Convert(left.op,setType);
  3466. Convert(right.op,setType);
  3467. ReuseCopy(temp.op,right.op);
  3468. Emit(Shr(position,temp.op,temp.op,left.op));
  3469. ReleaseOperand(right); ReleaseOperand(left);
  3470. IntermediateCode.InitImmediate(one,setType,1);
  3471. Emit(And(position,temp.op,temp.op,one));
  3472. IF conditional THEN
  3473. IntermediateCode.InitImmediate(zero,setType,0);
  3474. BrneL(trueLabel,temp.op,zero);
  3475. ReleaseOperand(temp);
  3476. BrL(falseLabel);
  3477. ELSE
  3478. Convert(temp.op,bool);
  3479. result.mode := ModeValue;
  3480. result.op := temp.op;
  3481. result.tag := nil; (* may be left over from calls to evaluate *)
  3482. END;
  3483. ELSE
  3484. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3485. IF x.operator = Scanner.Questionmarks THEN
  3486. leftExpression := x.left;
  3487. rightExpression := x.right;
  3488. ELSE
  3489. leftExpression := x.right;
  3490. rightExpression := x.left;
  3491. END;
  3492. Evaluate(leftExpression, left);
  3493. Emit(Push(position,left.op));
  3494. ReleaseOperand(left);
  3495. Designate(rightExpression, right);
  3496. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3497. IF ~backend.cellsAreObjects THEN
  3498. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3499. END;
  3500. Emit(Push(position,right.op));
  3501. ReleaseOperand(right);
  3502. IF backend.cellsAreObjects THEN
  3503. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3504. ELSE
  3505. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3506. END;
  3507. InitOperand(result, ModeValue);
  3508. result.op := NewRegisterOperand(bool);
  3509. Emit(Result(position,result.op));
  3510. IF conditional THEN
  3511. IntermediateCode.InitImmediate(zero,setType,0);
  3512. BrneL(trueLabel,result.op,zero);
  3513. ReleaseOperand(result);
  3514. BrL(falseLabel);
  3515. END;
  3516. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3517. leftExpression := x.left;
  3518. rightExpression := x.right;
  3519. Evaluate(leftExpression, left);
  3520. Emit(Push(position,left.op));
  3521. ReleaseOperand(left);
  3522. Evaluate(rightExpression, right);
  3523. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3524. IF ~backend.cellsAreObjects THEN
  3525. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3526. END;
  3527. Emit(Push(position,right.op));
  3528. ReleaseOperand(right);
  3529. IF backend.cellsAreObjects THEN
  3530. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3531. ELSE
  3532. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3533. END;
  3534. InitOperand(result, ModeValue);
  3535. result.op := NewRegisterOperand(bool);
  3536. Emit(Result(position,result.op));
  3537. IF conditional THEN
  3538. IntermediateCode.InitImmediate(zero,setType,0);
  3539. BrneL(trueLabel,result.op,zero);
  3540. ReleaseOperand(result);
  3541. BrL(falseLabel);
  3542. END;
  3543. ELSE
  3544. HALT(100);
  3545. END;
  3546. END;
  3547. destination := dest;
  3548. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3549. END VisitBinaryExpression;
  3550. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3551. VAR localResult, operand: Operand;
  3552. BEGIN
  3553. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3554. InitOperand(localResult, ModeValue);
  3555. ASSERT(x.first # NIL);
  3556. Evaluate(x.first, operand);
  3557. localResult.op := operand.op;
  3558. ReleaseOperand(operand);
  3559. UseIntermediateOperand(localResult.op);
  3560. ASSERT(x.last # NIL);
  3561. Evaluate(x.last, operand);
  3562. localResult.tag := operand.op;
  3563. ReleaseOperand(operand);
  3564. UseIntermediateOperand(localResult.tag);
  3565. IF x.step # NIL THEN
  3566. Evaluate(x.step, operand);
  3567. localResult.extra := operand.op;
  3568. ReleaseOperand(operand);
  3569. UseIntermediateOperand(localResult.extra);
  3570. END;
  3571. result := localResult;
  3572. IF Trace THEN TraceExit("VisitRangeExpression") END
  3573. END VisitRangeExpression;
  3574. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3575. BEGIN
  3576. HALT(100); (* should never be evaluated *)
  3577. END VisitTensorRangeExpression;
  3578. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3579. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3580. BEGIN
  3581. IF Trace THEN TraceEnter("VisitConversion") END;
  3582. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3583. dest := destination; destination := emptyOperand;
  3584. Evaluate(x.expression,old);
  3585. InitOperand(result,ModeValue);
  3586. result.op := old.op;
  3587. ASSERT(result.op.mode # 0);
  3588. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3589. (* convert TO a complex number *)
  3590. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3591. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3592. ASSERT(result.op.mode # 0);
  3593. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3594. (* convert FROM a complex number TO a complex number*)
  3595. result.tag := old.tag;
  3596. ASSERT(result.tag.mode # 0);
  3597. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3598. ASSERT(result.tag.mode # 0)
  3599. ELSE
  3600. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3601. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3602. END
  3603. ELSE
  3604. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3605. ASSERT(result.op.mode # 0);
  3606. result.tag := old.tag; (*! probably never used *)
  3607. END;
  3608. destination := dest;
  3609. IF Trace THEN TraceExit("VisitConversion") END;
  3610. END VisitConversion;
  3611. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3612. BEGIN
  3613. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3614. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3615. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3616. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3617. END VisitTypeDeclaration;
  3618. (** designators (expressions) *)
  3619. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3620. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3621. BEGIN
  3622. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3623. IF x.left # NIL THEN Expression(x.left) END;
  3624. Symbol(x.symbol,result);
  3625. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3626. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3627. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3628. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3629. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3630. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3631. END;
  3632. END;
  3633. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3634. END VisitSymbolDesignator;
  3635. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3636. BEGIN
  3637. IF isUnchecked THEN RETURN END;
  3638. IF tagsAvailable THEN
  3639. TrapC(BrltL,index,length,IndexCheckTrap);
  3640. END;
  3641. END BoundCheck;
  3642. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3643. VAR d: IntermediateCode.Operand;
  3644. BEGIN
  3645. IF isUnchecked THEN RETURN END;
  3646. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3647. TrapC(op,dim,d,ArraySizeTrap);
  3648. ReleaseIntermediateOperand(d);
  3649. END DimensionCheck;
  3650. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3651. VAR
  3652. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3653. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3654. expression: SyntaxTree.Expression;
  3655. resultingType, leftType, baseType: SyntaxTree.Type;
  3656. skipLabel1: Label;
  3657. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3658. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3659. variableOp: Operand;
  3660. variable: SyntaxTree.Variable;
  3661. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3662. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3663. VAR e: SyntaxTree.Expression; i: LONGINT;
  3664. BEGIN
  3665. tensorFound := FALSE;
  3666. FOR i := 0 TO parameters.Length()-1 DO
  3667. e := parameters.GetExpression(i);
  3668. IF e IS SyntaxTree.TensorRangeExpression THEN
  3669. ASSERT(~tensorFound);
  3670. tensorFound := TRUE;
  3671. ELSIF e IS SyntaxTree.RangeExpression THEN
  3672. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3673. ELSE
  3674. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3675. END;
  3676. END;
  3677. END CountIndices;
  3678. BEGIN
  3679. ASSERT(tagsAvailable);
  3680. resultingType := x.type.resolved; (* resulting type *)
  3681. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3682. InitOperand(localResult, ModeReference);
  3683. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3684. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3685. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3686. (* a globally defined array destination tag is available -> use and invalidate it*)
  3687. localResult.tag := arrayDestinationTag;
  3688. IntermediateCode.InitOperand(arrayDestinationTag)
  3689. ELSE
  3690. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3691. (* the result is of array range type and thus does not provide any collectable pointers *)
  3692. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3693. Symbol(variable, variableOp);
  3694. ReuseCopy(localResult.tag, variableOp.op);
  3695. ReleaseOperand(variableOp);
  3696. END
  3697. END;
  3698. indexListSize := x.parameters.Length();
  3699. CountIndices(x.parameters);
  3700. (*ASSERT(tensorRangeCount <= 1);*)
  3701. (* designate the array to be indexed over, perform tensor range check if known *)
  3702. Designate(x.left, array);
  3703. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3704. Dereference(array, leftType,FALSE);
  3705. IF ~tensorFound THEN
  3706. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3707. END
  3708. END;
  3709. (* default base offset *)
  3710. srcDimOffset := 0;
  3711. destDimOffset := 0;
  3712. indexDim := 0;
  3713. (* use address of source array as basis *)
  3714. localResult.op := array.op;
  3715. UseIntermediateOperand(localResult.op);
  3716. (* go through the index list *)
  3717. FOR i := 0 TO indexListSize - 1 DO
  3718. expression := x.parameters.GetExpression(i);
  3719. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3720. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3721. srcDimOffset := -indexListSize;
  3722. destDimOffset := -suffixRanges;
  3723. ELSE
  3724. (* determine which dimension of source array is currently looked at *)
  3725. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3726. (* get the memory operand pointing to array descriptor dimension *)
  3727. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3728. (* make a reusable register from it *)
  3729. ReuseCopy(srcDim, tmp);
  3730. ReleaseIntermediateOperand(tmp);
  3731. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3732. ELSE
  3733. srcDim := IntermediateCode.Immediate(sizeType, i);
  3734. END;
  3735. (* get length and increment of source array for current dimension *)
  3736. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3737. Convert(sourceLength.op, sizeType);
  3738. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3739. Convert(sourceIncrement.op, sizeType);
  3740. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3741. ReleaseIntermediateOperand(srcDim);
  3742. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3743. (* SINGLE INDEX *)
  3744. Evaluate(expression, index);
  3745. ReleaseIntermediateOperand(index.tag);
  3746. index.tag := emptyOperand;
  3747. Convert(index.op, sizeType);
  3748. (* lower bound check *)
  3749. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3750. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3751. ELSIF isUnchecked THEN (* do nothing *)
  3752. ELSE
  3753. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3754. END;
  3755. (* upper bound check *)
  3756. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3757. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3758. ELSIF isUnchecked THEN (* do nothing *)
  3759. ELSE
  3760. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3761. END;
  3762. ReleaseOperand(sourceLength);
  3763. Convert(index.op, addressType);
  3764. summand := index.op;
  3765. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3766. (* RANGE OF INDICES *)
  3767. Evaluate(expression, range);
  3768. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3769. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3770. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3771. ReleaseOperand(range);
  3772. Convert(firstIndex, sizeType);
  3773. Convert(lastIndex, sizeType);
  3774. Convert(stepSize, sizeType);
  3775. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3776. if it is 'MAX(LONGINT)' *)
  3777. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3778. TransferToRegister(lastIndex, lastIndex);
  3779. skipLabel1 := NewLabel();
  3780. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3781. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3782. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3783. SetLabel(skipLabel1)
  3784. END;
  3785. (* check if step size is valid *)
  3786. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3787. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3788. ELSIF isUnchecked THEN (* do nothing *)
  3789. ELSE
  3790. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3791. END;
  3792. (* check lower bound check *)
  3793. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3794. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3795. ELSIF isUnchecked THEN (* do nothing *)
  3796. ELSE
  3797. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3798. END;
  3799. (* check upper bound check *)
  3800. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3801. (* statically open range: nothing to do *)
  3802. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3803. ASSERT(staticLastIndex < staticSourceLength)
  3804. ELSIF isUnchecked THEN (* do nothing *)
  3805. ELSE
  3806. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3807. END;
  3808. (* determine length of target array for current dimension *)
  3809. (* 1. incorporate last index: *)
  3810. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3811. (* last index is static *)
  3812. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3813. targetLength := sourceLength.op
  3814. ELSE
  3815. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3816. END;
  3817. UseIntermediateOperand(targetLength);
  3818. ELSE
  3819. (* targetLength := lastIndex + 1
  3820. Reuse1(targetLength, lastIndex);
  3821. *)
  3822. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3823. END;
  3824. ReleaseOperand(sourceLength);
  3825. ReleaseIntermediateOperand(lastIndex);
  3826. (* 2. incorporate first index: *)
  3827. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3828. (* first index and current target length are static *)
  3829. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3830. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3831. (* first index = 0: nothing to do *)
  3832. ELSE
  3833. (* targetLength := targetLength - firstIndex *)
  3834. TransferToRegister(targetLength, targetLength);
  3835. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3836. END;
  3837. (* clip negative lengths to 0 *)
  3838. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3839. IF staticTargetLength < 0 THEN
  3840. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3841. END
  3842. ELSE
  3843. skipLabel1 := NewLabel();
  3844. TransferToRegister(targetLength, targetLength);
  3845. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3846. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3847. SetLabel(skipLabel1)
  3848. END;
  3849. (* 3. incorporate index step size: *)
  3850. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3851. (*step size and current target length are static *)
  3852. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3853. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3854. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3855. (* step size = 1: nothing to do *)
  3856. ELSE
  3857. (* emit code for this:
  3858. targetLength := (targetLength-1) DIV stepSize +1;
  3859. *)
  3860. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3861. DivInt(targetLength, targetLength, stepSize);
  3862. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3863. END;
  3864. (* determine increment of target array for current dimension *)
  3865. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3866. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3867. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3868. (* step size = 1 *)
  3869. targetIncrement := sourceIncrement.op;
  3870. UseIntermediateOperand(targetIncrement)
  3871. ELSE
  3872. (* targetIncrement := sourceIncrement * stepSize *)
  3873. Reuse1(targetIncrement, stepSize);
  3874. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3875. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3876. END;
  3877. ReleaseIntermediateOperand(stepSize);
  3878. (* write length and increment of target array to descriptor *)
  3879. IF destDimOffset < 0 THEN
  3880. (* determine which dimension of target array is currently looked at *)
  3881. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3882. TransferToRegister(destDim, tmp);
  3883. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3884. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3885. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3886. ReleaseIntermediateOperand(destDim);
  3887. INC(destDimOffset);
  3888. ELSE
  3889. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3890. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3891. END;
  3892. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3893. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3894. INC(indexDim);
  3895. Convert(firstIndex, addressType);
  3896. TransferToRegister(summand, firstIndex);
  3897. ELSE HALT(100);
  3898. END;
  3899. (*
  3900. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3901. *)
  3902. Convert(sourceIncrement.op, addressType);
  3903. Convert(summand, addressType);
  3904. MulInt(summand, summand, sourceIncrement.op);
  3905. ReleaseIntermediateOperand(sourceIncrement.op);
  3906. AddInt(localResult.op, localResult.op, summand);
  3907. ReleaseIntermediateOperand(summand);
  3908. END
  3909. END;
  3910. result := localResult;
  3911. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3912. ReleaseIntermediateOperand(result.tag);
  3913. result.tag := TypeDescriptorAdr(resultingType);
  3914. ELSIF IsDelegate(resultingType) THEN
  3915. ReleaseIntermediateOperand(result.tag);
  3916. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3917. UseIntermediateOperand(result.tag);
  3918. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3919. ReleaseIntermediateOperand(result.tag);
  3920. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3921. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3922. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3923. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3924. (* finalize target array descriptor *)
  3925. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3926. (* write lengths and increments of target array for remaining dimensions *)
  3927. i := indexListSize;
  3928. WHILE indexDim < targetArrayDimensionality DO
  3929. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3930. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3931. ReleaseOperand(sourceLength);
  3932. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3933. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3934. ReleaseOperand(sourceIncrement);
  3935. INC(i); INC(indexDim);
  3936. END;
  3937. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3938. tmp := nil;
  3939. ELSE
  3940. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3941. END;
  3942. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3943. ReleaseIntermediateOperand(tmp);
  3944. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3945. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3946. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3947. ELSE
  3948. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3949. END;
  3950. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3951. ReleaseIntermediateOperand(tmp);
  3952. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3953. (* write dimensionality *)
  3954. IF targetArrayDimensionality # 0 THEN
  3955. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3956. END;
  3957. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3958. END;
  3959. ReleaseOperand(array);
  3960. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3961. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3962. END;
  3963. END MathIndexDesignator;
  3964. (* get the length of an array , trying to make use of static information *)
  3965. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3966. VAR res: IntermediateCode.Operand; size: LONGINT;
  3967. BEGIN
  3968. type := type.resolved;
  3969. IF type IS SyntaxTree.ArrayType THEN
  3970. WITH type: SyntaxTree.ArrayType DO
  3971. IF type.form = SyntaxTree.Static THEN
  3972. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3973. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3974. Evaluate(type.length, op);
  3975. ReleaseIntermediateOperand(op.tag);
  3976. RETURN op.op;*)
  3977. ELSE
  3978. res := tag;
  3979. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3980. IntermediateCode.MakeMemory(res,addressType);
  3981. UseIntermediateOperand(res);
  3982. RETURN res
  3983. END
  3984. END;
  3985. ELSE
  3986. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  3987. RETURN IntermediateCode.Immediate(addressType,size);
  3988. END;
  3989. END ArrayLength;
  3990. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  3991. BEGIN
  3992. IF IsImmediate(x) THEN
  3993. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  3994. ELSE
  3995. IF ~ReusableRegister(res) THEN
  3996. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  3997. ELSE
  3998. UseIntermediateOperand(res);
  3999. END;
  4000. Emit(Mov(position,res,x))
  4001. END;
  4002. END CopyInt;
  4003. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4004. BEGIN
  4005. ReleaseIntermediateOperand(res);
  4006. IF IsImmediate(x) & IsImmediate(y) THEN
  4007. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4008. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4009. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4010. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4011. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4012. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4013. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4014. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4015. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4016. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4017. UseIntermediateOperand(res);
  4018. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4019. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4020. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4021. UseIntermediateOperand(res);
  4022. ELSE
  4023. IF ~ReusableRegister(res) THEN
  4024. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4025. ELSE
  4026. UseIntermediateOperand(res);
  4027. END;
  4028. IF IsImmediate(x) & (x.intValue = 0) THEN
  4029. Emit(Mov(position,res,y))
  4030. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4031. Emit(Mov(position,res,x))
  4032. ELSE
  4033. Emit(Add(position,res, x, y));
  4034. END;
  4035. END;
  4036. END AddInt;
  4037. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4038. BEGIN
  4039. ReleaseIntermediateOperand(res);
  4040. IF IsImmediate(x) & IsImmediate(y) THEN
  4041. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4042. ELSE
  4043. IF ~ReusableRegister(res) THEN
  4044. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4045. ELSE UseIntermediateOperand(res);
  4046. END;
  4047. IF IsImmediate(x) & (x.intValue = 1) THEN
  4048. Emit(Mov(position,res,y))
  4049. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4050. Emit(Mov(position,res,x))
  4051. ELSE
  4052. Emit(Mul(position,res, x, y));
  4053. END;
  4054. END;
  4055. END MulInt;
  4056. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4057. BEGIN
  4058. ReleaseIntermediateOperand(res);
  4059. IF IsImmediate(x) & IsImmediate(y) THEN
  4060. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4061. ELSE
  4062. IF ~ReusableRegister(res) THEN
  4063. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4064. ELSE UseIntermediateOperand(res);
  4065. END;
  4066. IF IsImmediate(x) & (x.intValue = 1) THEN
  4067. Emit(Mov(position,res,y))
  4068. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4069. Emit(Mov(position,res,x))
  4070. ELSE
  4071. Emit(Div(position,res, x, y));
  4072. END;
  4073. END;
  4074. END DivInt;
  4075. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4076. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4077. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4078. BEGIN
  4079. type := x.left.type.resolved;
  4080. IF type IS SyntaxTree.StringType THEN
  4081. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4082. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4083. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4084. type := atype;
  4085. x.left.SetType(type);
  4086. END;
  4087. IntermediateCode.InitImmediate(res,addressType,0);
  4088. maxDim := x.parameters.Length()-1;
  4089. (*
  4090. computation rule:
  4091. a: ARRAY X,Y,Z OF Element with size S
  4092. a[i,j,k] -->
  4093. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4094. *)
  4095. FOR i := 0 TO maxDim DO
  4096. e := x.parameters.GetExpression(i);
  4097. Evaluate(e,index);
  4098. Convert(index.op,addressType);
  4099. AddInt(res, res, index.op);
  4100. IF i = 0 THEN
  4101. (*
  4102. ReuseCopy(res, index.op);
  4103. *)
  4104. Designate(x.left,array);
  4105. type := x.left.type.resolved;
  4106. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4107. Dereference(array, type, FALSE);
  4108. END;
  4109. (*
  4110. ELSE AddInt(res, res, index.op);
  4111. *)
  4112. END;
  4113. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4114. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4115. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4116. BoundCheck(index.op, length);
  4117. END;
  4118. ReleaseIntermediateOperand(length);
  4119. END;
  4120. ReleaseOperand(index);
  4121. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4122. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4123. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4124. MulInt(res,res,length);
  4125. END;
  4126. ReleaseIntermediateOperand(length);
  4127. END;
  4128. (* remaining open dimensions -- compute address *)
  4129. i := maxDim+1;
  4130. IF type IS SyntaxTree.ArrayType THEN
  4131. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4132. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4133. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4134. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4135. MulInt(res,res,length);
  4136. END;
  4137. ReleaseIntermediateOperand(length);
  4138. INC(i);
  4139. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4140. END;
  4141. END;
  4142. IF (type IS SyntaxTree.ArrayType) THEN
  4143. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4144. size := StaticSize(system, type);
  4145. IF size # 1 THEN
  4146. length := IntermediateCode.Immediate(addressType,size);
  4147. MulInt(res,res,length);
  4148. END;
  4149. ELSE
  4150. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4151. IF size # 1 THEN
  4152. length := IntermediateCode.Immediate(addressType,size);
  4153. MulInt(res,res,length);
  4154. END;
  4155. END;
  4156. END;
  4157. AddInt(res,res,array.op);
  4158. InitOperand(result,ModeReference);
  4159. result.op := res;
  4160. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4161. ReleaseIntermediateOperand(result.tag);
  4162. result.tag := TypeDescriptorAdr(type);
  4163. ELSIF IsDelegate(type) THEN
  4164. ReleaseIntermediateOperand(result.tag);
  4165. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4166. UseIntermediateOperand(result.tag);
  4167. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4168. ReleaseIntermediateOperand(result.tag);
  4169. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4170. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4171. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4172. END;
  4173. ReleaseOperand(array);
  4174. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4175. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4176. END;
  4177. END IndexDesignator;
  4178. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4179. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4180. BEGIN
  4181. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4182. dest := destination; destination := emptyOperand;
  4183. type := x.left.type.resolved;
  4184. IF type IS SyntaxTree.MathArrayType THEN
  4185. MathIndexDesignator(x);
  4186. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4187. IndexDesignator(x);
  4188. END;
  4189. destination := dest;
  4190. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4191. END VisitIndexDesignator;
  4192. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4193. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4194. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4195. procedure: SyntaxTree.Procedure;
  4196. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4197. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4198. BEGIN
  4199. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4200. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4201. parameters := expression.parameters;
  4202. moduleName := "FoxArrayBase";
  4203. procedureName := "CopyDescriptor";
  4204. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4205. SaveRegisters();ReleaseUsedRegisters(saved);
  4206. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4207. IF procedure = NIL THEN
  4208. s := "procedure ";
  4209. Strings.Append(s,moduleName);
  4210. Strings.Append(s,".");
  4211. Strings.Append(s,procedureName);
  4212. Strings.Append(s," not present");
  4213. Error(position,s);
  4214. ELSE
  4215. (* push address of temporary variable *)
  4216. Symbol(variable,destOperand);
  4217. Emit(Push(position,destOperand.op));
  4218. ReleaseOperand(destOperand);
  4219. (* push src *)
  4220. Evaluate(expression.left,srcOperand);
  4221. (*
  4222. Dereference(srcOperand,expression.type.resolved);
  4223. Emit(Push(position,srcOperand.tag));
  4224. *)
  4225. Emit(Push(position,srcOperand.op));
  4226. ReleaseOperand(srcOperand);
  4227. tensorFound := FALSE;
  4228. FOR i := 0 TO parameters.Length()-1 DO
  4229. e := parameters.GetExpression(i);
  4230. IF e IS SyntaxTree.TensorRangeExpression THEN
  4231. tensorFound := TRUE;
  4232. ELSIF e IS SyntaxTree.RangeExpression THEN
  4233. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4234. ELSE
  4235. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4236. END;
  4237. END;
  4238. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4239. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4240. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4241. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4242. StaticCallOperand(procOp,procedure);
  4243. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4244. ReleaseOperand(procOp);
  4245. END;
  4246. RestoreRegisters(saved);
  4247. END;
  4248. RETURN variable
  4249. END PrepareTensorDescriptor;
  4250. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4251. VAR
  4252. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4253. operand, tmpOperand, variableOp, variable2Op: Operand;
  4254. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4255. variable, variable2: SyntaxTree.Variable;
  4256. dim, i, size: LONGINT;
  4257. (* TODO: needed? *)
  4258. oldArrayDestinationTag: IntermediateCode.Operand;
  4259. oldArrayDestinationDimension: LONGINT;
  4260. position: Position;
  4261. saved: RegisterEntry;
  4262. arrayFlags: SET;
  4263. m, n: LONGINT;
  4264. PROCEDURE Pass(op: IntermediateCode.Operand);
  4265. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4266. BEGIN
  4267. IF numberRegister >= 0 THEN
  4268. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention,op.type,numberRegister));
  4269. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4270. Emit(Mov(position,parameterRegister, op));
  4271. ELSE
  4272. Emit(Push(position,op))
  4273. END
  4274. END Pass;
  4275. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4276. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4277. BEGIN
  4278. formalType := formalType.resolved; actualType := actualType.resolved;
  4279. IF IsOpenArray(formalType)THEN
  4280. IF actualType IS SyntaxTree.StringType THEN
  4281. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4282. RETURN;
  4283. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4284. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4285. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4286. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4287. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4288. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4289. ELSE
  4290. tmp := baseReg;
  4291. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4292. IntermediateCode.MakeMemory(tmp,addressType);
  4293. Pass((tmp));
  4294. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4295. END;
  4296. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4297. END;
  4298. END PushArrayLens;
  4299. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4300. BEGIN
  4301. CASE size OF
  4302. |2: INCL(flags,Size2Flag);
  4303. |3: INCL(flags,Size3Flag);
  4304. |4: INCL(flags,Size4Flag);
  4305. |5: INCL(flags,Size5Flag);
  4306. |6: INCL(flags,Size6Flag);
  4307. |7: INCL(flags,Size7Flag);
  4308. |8: INCL(flags,Size8Flag);
  4309. END;
  4310. END SetSmallArraySizeFlag;
  4311. BEGIN
  4312. IF Trace THEN TraceEnter("PushParameter") END;
  4313. position := expression.position;
  4314. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4315. type := expression.type.resolved;
  4316. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4317. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4318. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4319. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4320. );
  4321. (* TODO: needed? *)
  4322. oldArrayDestinationTag := arrayDestinationTag;
  4323. oldArrayDestinationDimension := arrayDestinationDimension;
  4324. IF IsArrayOfSystemByte(parameter.type) THEN
  4325. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4326. Designate(expression,operand);
  4327. ELSE
  4328. Evaluate(expression, tmpOperand);
  4329. (* array of system byte does not provide any pointers *)
  4330. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4331. Symbol(variable, operand);
  4332. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4333. Emit(Mov(position,tmp, tmpOperand.op));
  4334. ReleaseOperand(tmpOperand);
  4335. END;
  4336. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4337. ReleaseIntermediateOperand(operand.tag);
  4338. operand.tag := tmp;
  4339. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4340. Pass((operand.tag));
  4341. END;
  4342. Pass((operand.op));
  4343. ELSIF IsOpenArray(parameter.type) THEN
  4344. Designate(expression,operand);
  4345. baseReg := operand.tag;
  4346. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4347. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4348. END;
  4349. Pass((operand.op)); (* address of the array *)
  4350. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4351. (* case 1
  4352. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4353. *)
  4354. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4355. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4356. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4357. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4358. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4359. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4360. arrayDestinationTag := sp;
  4361. (* case 1b
  4362. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4363. *)
  4364. IF expression IS SyntaxTree.IndexDesignator THEN
  4365. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4366. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4367. arrayDestinationDimension := dim;
  4368. Designate(expression,operand);
  4369. (* case 1a
  4370. P(...,A,...) push: push array descriptor to stack
  4371. *)
  4372. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4373. Designate(expression,operand);
  4374. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4375. i := 0;
  4376. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4377. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4378. INC(i);
  4379. END;
  4380. type := expression.type.resolved;
  4381. WHILE (i<dim) DO (* remaining static dimensions *)
  4382. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4383. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4384. ReleaseOperand(tmpOperand);
  4385. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4386. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4387. ReleaseOperand(tmpOperand);
  4388. INC(i);
  4389. END;
  4390. dimOp := IntermediateCode.Immediate(addressType,dim);
  4391. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4392. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4393. (* case 1d
  4394. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4395. + case 1e
  4396. P(.. PT() ... );
  4397. *)
  4398. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4399. Designate(expression,operand);
  4400. Dereference(operand,type.resolved,FALSE);
  4401. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4402. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4403. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4404. (* case 1f
  4405. P(...,S,...) push: create array descriptor to S on stack
  4406. case 1g
  4407. P(... PS()...)
  4408. *)
  4409. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4410. Designate(expression,operand);
  4411. FOR i := 0 TO dim-1 DO
  4412. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4413. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4414. ReleaseOperand(tmpOperand);
  4415. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4416. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4417. ReleaseOperand(tmpOperand);
  4418. END;
  4419. (*******
  4420. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4421. *)
  4422. arrayFlags := {StaticFlag};
  4423. IF dim = 1 THEN
  4424. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4425. ReleaseOperand(tmpOperand);
  4426. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4427. m := LONGINT(tmpOperand.op.intValue);
  4428. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4429. ELSIF dim = 2 THEN
  4430. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4431. ReleaseOperand(tmpOperand);
  4432. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4433. m := LONGINT(tmpOperand.op.intValue);
  4434. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4435. ReleaseOperand(tmpOperand);
  4436. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4437. n := LONGINT(tmpOperand.op.intValue);
  4438. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4439. INCL(arrayFlags,SmallMatrixFlag);
  4440. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4441. END;
  4442. END;
  4443. (*******)
  4444. dimOp := IntermediateCode.Immediate(addressType,dim);
  4445. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4446. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4447. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4448. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4449. baseType := SemanticChecker.ArrayBase(type,dim);
  4450. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4451. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4452. ELSE HALT(100);
  4453. END;
  4454. (* case 2
  4455. procedure P([left args], var A: array [*,*] of Type, [right args])
  4456. *)
  4457. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4458. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4459. (* case 2b
  4460. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4461. push: push reference to pushed array descriptor
  4462. post: remove array descriptor.
  4463. *)
  4464. IF expression IS SyntaxTree.IndexDesignator THEN
  4465. descriptorType := GetMathArrayDescriptorType(dim);
  4466. (* range type : no allocation possible, should be untraced *)
  4467. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4468. Symbol(variable,variableOp);
  4469. arrayDestinationTag := variableOp.op;
  4470. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4471. arrayDestinationDimension := dim;
  4472. NeedDescriptor := TRUE;
  4473. Designate(expression,operand);
  4474. Pass((operand.tag));
  4475. NeedDescriptor := FALSE;
  4476. (* case 2a
  4477. P(...,A,...)
  4478. push: push reference to array descriptor on stack
  4479. *)
  4480. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4481. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4482. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4483. INC(i);
  4484. END;
  4485. IF i = dim THEN
  4486. Designate(expression,operand);
  4487. Pass((operand.tag));
  4488. ELSE (* open-static *)
  4489. type := expression.type.resolved;
  4490. descriptorType := GetMathArrayDescriptorType(dim);
  4491. (* static array , cannot be reallocated, untraced !*)
  4492. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4493. Symbol(variable,variableOp);
  4494. arrayDestinationTag := variableOp.op;
  4495. Designate(expression,operand);
  4496. FOR i := 0 TO dim-1 DO
  4497. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4498. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4499. ReleaseOperand(tmpOperand);
  4500. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4501. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4502. ReleaseOperand(tmpOperand);
  4503. END;
  4504. dimOp := IntermediateCode.Immediate(addressType,dim);
  4505. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4506. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4507. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4508. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4509. baseType := SemanticChecker.ArrayBase(type,dim);
  4510. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4511. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4512. Pass((arrayDestinationTag));
  4513. END;
  4514. (* case 2d
  4515. P(...,T,...) push: emit dimension check, push T
  4516. *)
  4517. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4518. Designate(expression,operand);
  4519. Dereference(operand,type.resolved,FALSE);
  4520. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4521. Pass((operand.tag));
  4522. (* case 2f
  4523. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4524. push: push reference to pushed array descriptor
  4525. post: remove array descriptor
  4526. *)
  4527. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4528. descriptorType := GetMathArrayDescriptorType(dim);
  4529. (* static array -- cannot be reallocatated, untraced *)
  4530. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4531. Symbol(variable,variableOp);
  4532. arrayDestinationTag := variableOp.op;
  4533. Designate(expression,operand);
  4534. FOR i := 0 TO dim-1 DO
  4535. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4536. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4537. ReleaseOperand(tmpOperand);
  4538. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4539. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4540. ReleaseOperand(tmpOperand);
  4541. END;
  4542. (*
  4543. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4544. *)
  4545. arrayFlags := {StaticFlag};
  4546. IF dim = 1 THEN
  4547. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4548. ReleaseOperand(tmpOperand);
  4549. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4550. m := LONGINT(tmpOperand.op.intValue);
  4551. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4552. ELSIF dim = 2 THEN
  4553. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4554. ReleaseOperand(tmpOperand);
  4555. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4556. m := LONGINT(tmpOperand.op.intValue);
  4557. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4558. ReleaseOperand(tmpOperand);
  4559. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4560. n := LONGINT(tmpOperand.op.intValue);
  4561. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4562. INCL(arrayFlags,SmallMatrixFlag);
  4563. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4564. END;
  4565. END;
  4566. (*******)
  4567. dimOp := IntermediateCode.Immediate(addressType,dim);
  4568. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4569. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4570. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4571. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4572. baseType := SemanticChecker.ArrayBase(type,dim);
  4573. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4574. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4575. Pass((arrayDestinationTag));
  4576. ELSE HALT(100);
  4577. END;
  4578. (* case 3
  4579. procedure P([left args], [const] A: array [?] of Type, [right args])
  4580. *)
  4581. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4582. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4583. (* case 3b
  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 -- cannot be reallocated *)
  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. Pass((operand.tag));
  4602. (* case 3a
  4603. P(...,A,...)
  4604. *)
  4605. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4606. i := 0;
  4607. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4608. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4609. INC(i);
  4610. END;
  4611. IF i = dim THEN
  4612. Designate(expression,operand);
  4613. Pass((operand.tag));
  4614. ELSE (* open-static *)
  4615. type := expression.type.resolved;
  4616. descriptorType := GetMathArrayDescriptorType(dim);
  4617. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4618. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4619. Symbol(variable,variableOp);
  4620. arrayDestinationTag := variableOp.op;
  4621. Designate(expression,operand);
  4622. FOR i := 0 TO dim-1 DO
  4623. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4624. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4625. ReleaseOperand(tmpOperand);
  4626. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4627. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4628. ReleaseOperand(tmpOperand);
  4629. END;
  4630. dimOp := IntermediateCode.Immediate(addressType,dim);
  4631. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4632. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4633. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4634. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4635. baseType := SemanticChecker.ArrayBase(type,dim);
  4636. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4637. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4638. Pass((arrayDestinationTag));
  4639. END;
  4640. (* case 3d
  4641. P(...,T,...)
  4642. case 3e
  4643. P(...,PT(...),...)
  4644. *)
  4645. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4646. Designate(expression,operand);
  4647. Dereference(operand,type.resolved,FALSE);
  4648. Pass((operand.tag));
  4649. (* case 3f
  4650. P(...,S,...)
  4651. case 3g
  4652. P(...,PS(...),...)
  4653. *)
  4654. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4655. descriptorType := GetMathArrayDescriptorType(dim);
  4656. (* static array does not need to be traced *)
  4657. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4658. Symbol(variable,variableOp);
  4659. arrayDestinationTag := variableOp.op;
  4660. Designate(expression,operand);
  4661. IF operand.op.type.length >1 THEN (* vector register *)
  4662. (* static array does not need to be traced *)
  4663. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4664. Symbol(variable2, variable2Op);
  4665. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4666. Emit(Mov(position,tmp, operand.op));
  4667. ReleaseOperand(operand);
  4668. Symbol(variable2, operand);
  4669. END;
  4670. FOR i := 0 TO dim-1 DO
  4671. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4672. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4673. ReleaseOperand(tmpOperand);
  4674. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4675. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4676. ReleaseOperand(tmpOperand);
  4677. END;
  4678. dimOp := IntermediateCode.Immediate(addressType,dim);
  4679. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4680. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4681. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4682. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4683. baseType := SemanticChecker.ArrayBase(type,dim);
  4684. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4685. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4686. Pass((arrayDestinationTag));
  4687. ELSE HALT(100);
  4688. END;
  4689. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4690. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4691. (* case 4b
  4692. P(...,A[a..b,c..d],...)
  4693. *)
  4694. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4695. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4696. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4697. Symbol(variable,variableOp);
  4698. LoadValue(variableOp,system.addressType);
  4699. ELSE
  4700. descriptorType := GetMathArrayDescriptorType(dim);
  4701. (* range array -- cannot be allocated *)
  4702. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4703. Symbol(variable,variableOp);
  4704. END;
  4705. arrayDestinationTag := variableOp.op;
  4706. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4707. arrayDestinationDimension := 0;
  4708. Designate(expression,operand);
  4709. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4710. Symbol(variable,variableOp);
  4711. ELSE
  4712. (* alias to range -- untraced *)
  4713. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4714. Symbol(variable,variableOp);
  4715. MakeMemory(tmp,variableOp.op,addressType,0);
  4716. Emit(Mov(position,tmp,operand.tag));
  4717. ReleaseIntermediateOperand(tmp);
  4718. END;
  4719. Pass((variableOp.op));
  4720. ReleaseOperand(variableOp);
  4721. (* case 4a
  4722. P(...,A,...)
  4723. *)
  4724. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4725. i := 0;
  4726. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4727. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4728. INC(i);
  4729. END;
  4730. IF i = dim THEN
  4731. Designate(expression,operand);
  4732. arrayDestinationTag := operand.tag;
  4733. ELSE (* open-static *)
  4734. type := expression.type.resolved;
  4735. descriptorType := GetMathArrayDescriptorType(dim);
  4736. (* static array -- untraced *)
  4737. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4738. Symbol(variable,variableOp);
  4739. arrayDestinationTag := variableOp.op;
  4740. Designate(expression,operand);
  4741. FOR i := 0 TO dim-1 DO
  4742. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4743. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4744. ReleaseOperand(tmpOperand);
  4745. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4746. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4747. ReleaseOperand(tmpOperand);
  4748. END;
  4749. dimOp := IntermediateCode.Immediate(addressType,dim);
  4750. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4751. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4752. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4753. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4754. baseType := SemanticChecker.ArrayBase(type,dim);
  4755. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4756. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4757. END;
  4758. (* tensor alias to open array -- untraced *)
  4759. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4760. Symbol(variable,variableOp);
  4761. MakeMemory(tmp,variableOp.op,addressType,0);
  4762. Emit(Mov(position,tmp,arrayDestinationTag));
  4763. ReleaseIntermediateOperand(tmp);
  4764. Pass((variableOp.op));
  4765. ReleaseOperand(variableOp);
  4766. (* case 4d
  4767. P(...,T,...)
  4768. *)
  4769. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4770. Designate(expression,operand);
  4771. Pass((operand.op));
  4772. (* case 4f
  4773. P(...,S,...)
  4774. *)
  4775. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4776. descriptorType := GetMathArrayDescriptorType(dim);
  4777. (* static array -- cannot be reallocated, untraced *)
  4778. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4779. Symbol(variable,variableOp);
  4780. arrayDestinationTag := variableOp.op;
  4781. Designate(expression,operand);
  4782. FOR i := 0 TO dim-1 DO
  4783. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4784. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4785. ReleaseOperand(tmpOperand);
  4786. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4787. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4788. ReleaseOperand(tmpOperand);
  4789. END;
  4790. dimOp := IntermediateCode.Immediate(addressType,dim);
  4791. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4792. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4793. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4794. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4795. baseType := SemanticChecker.ArrayBase(type,dim);
  4796. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4797. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4798. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4799. Symbol(variable,variableOp);
  4800. MakeMemory(tmp,variableOp.op,addressType,0);
  4801. Emit(Mov(position,tmp,arrayDestinationTag));
  4802. ReleaseIntermediateOperand(tmp);
  4803. Pass((variableOp.op));
  4804. ReleaseOperand(variableOp);
  4805. ELSE HALT(100);
  4806. END;
  4807. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4808. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4809. Designate(expression,operand);
  4810. IF operand.op.type.length > 1 THEN
  4811. Emit(Push(position, operand.op));
  4812. ELSE
  4813. size := system.SizeOf(type);
  4814. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4815. size := ToMemoryUnits(system,size);
  4816. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4817. arrayDestinationTag := sp;
  4818. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4819. END;
  4820. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4821. Designate(expression,operand);
  4822. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4823. (* static array no pointer *)
  4824. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4825. Symbol(variable,variableOp);
  4826. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4827. Emit(Mov(position,tmp,operand.op));
  4828. Emit(Push(position,variableOp.op));
  4829. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4830. Pass((operand.op));
  4831. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4832. END;
  4833. ELSE HALT(200)
  4834. END;
  4835. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4836. IF parameter.kind = SyntaxTree.VarParameter THEN
  4837. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4838. Designate(expression, operand);
  4839. Pass((operand.op));
  4840. ELSE
  4841. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4842. Evaluate(expression, operand);
  4843. Pass((operand.extra)); (* step *)
  4844. Pass((operand.tag)); (* last *)
  4845. Pass((operand.op)) (* first *)
  4846. END
  4847. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4848. IF parameter.kind = SyntaxTree.VarParameter THEN
  4849. Designate(expression, operand);
  4850. Pass((operand.op));
  4851. ELSE
  4852. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4853. Evaluate(expression, operand);
  4854. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  4855. IF (numberRegister > 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  4856. Pass((operand.tag)); (* imaginary part *)
  4857. Pass((operand.op)) (* real part *)
  4858. ELSE
  4859. (* pass complex as a whole in order to comply with the variable alignment of its components *)
  4860. size := ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,parameter.type));
  4861. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4862. tmp := sp;
  4863. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4864. Emit(Mov(position,tmp,operand.op)); (* real part *)
  4865. size := ToMemoryUnits(system,system.AlignmentOf(system.variableAlignment,componentType));
  4866. IntermediateCode.AddOffset(tmp,size);
  4867. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  4868. END
  4869. END
  4870. ELSE
  4871. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4872. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4873. Designate(expression,operand);
  4874. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4875. (* stack allocation *)
  4876. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4877. (*! parameter alignment to be discussed ... *)
  4878. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4879. size := type(SyntaxTree.StringType).length;
  4880. END;
  4881. IF backend.cooperative & parameter.NeedsTrace() THEN
  4882. dst := NewRegisterOperand (addressType);
  4883. Emit(Mov(position,dst, sp));
  4884. IntermediateCode.InitImmediate(null, byteType, 0);
  4885. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4886. ReleaseIntermediateOperand(dst);
  4887. SaveRegisters();ReleaseUsedRegisters(saved);
  4888. (* register dst has been freed before SaveRegisters already *)
  4889. CallAssignMethod(dst, operand.op, parameter.type);
  4890. RestoreRegisters(saved);
  4891. END;
  4892. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4893. ELSIF IsOpenArray(parameter.type) THEN
  4894. Designate(expression,operand);
  4895. baseReg := operand.tag;
  4896. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4897. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4898. END;
  4899. Pass((operand.op)); (* address of the array *)
  4900. ELSIF IsDelegate(parameter.type) THEN
  4901. Evaluate(expression,operand);
  4902. IF backend.cooperative & parameter.NeedsTrace() THEN
  4903. Emit(Push(position, nil));
  4904. dst := NewRegisterOperand (addressType);
  4905. Emit(Mov(position,dst, sp));
  4906. ReleaseIntermediateOperand(dst);
  4907. SaveRegisters();ReleaseUsedRegisters(saved);
  4908. Emit(Push(position, dst));
  4909. (* register dst has been freed before SaveRegisters already *)
  4910. Emit(Push(position, operand.tag));
  4911. CallThis(position,"GarbageCollector","Assign",2);
  4912. RestoreRegisters(saved);
  4913. ELSE
  4914. Pass((operand.tag));
  4915. END;
  4916. Pass((operand.op));
  4917. ELSE
  4918. Evaluate(expression,operand);
  4919. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4920. Emit(Push(position, nil));
  4921. dst := NewRegisterOperand (addressType);
  4922. Emit(Mov(position,dst, sp));
  4923. ReleaseIntermediateOperand(dst);
  4924. SaveRegisters();ReleaseUsedRegisters(saved);
  4925. Emit(Push(position, dst));
  4926. (* register dst has been freed before SaveRegisters already *)
  4927. Emit(Push(position, operand.op));
  4928. CallThis(position,"GarbageCollector","Assign",2);
  4929. RestoreRegisters(saved);
  4930. ELSE
  4931. Pass((operand.op));
  4932. END;
  4933. END;
  4934. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4935. Evaluate(expression,operand);
  4936. Pass((operand.op));
  4937. ELSE (* var parameter *)
  4938. Designate(expression,operand);
  4939. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4940. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4941. Pass((operand.tag));
  4942. END;
  4943. END;
  4944. Pass((operand.op));
  4945. END;
  4946. END;
  4947. (* TODO: needed? *)
  4948. arrayDestinationTag := oldArrayDestinationTag;
  4949. arrayDestinationDimension := oldArrayDestinationDimension;
  4950. IF needsParameterBackup THEN
  4951. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4952. ReuseCopy(parameterBackup, operand.op)
  4953. END;
  4954. ReleaseOperand(operand);
  4955. IF Trace THEN TraceExit("PushParameter") END;
  4956. END PushParameter;
  4957. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  4958. VAR prevConditional: BOOLEAN;
  4959. BEGIN
  4960. prevConditional := conditional;
  4961. conditional := FALSE;
  4962. 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
  4963. Expression(x.result); (* use register *)
  4964. END;
  4965. Statement(x.statement);
  4966. conditional := prevConditional;
  4967. IF x.result # NIL THEN Expression(x.result) END;
  4968. 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
  4969. ReleaseIntermediateOperand(result.op);
  4970. END;
  4971. END VisitStatementDesignator;
  4972. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4973. VAR
  4974. procedure: SyntaxTree.Procedure;
  4975. procedureType: SyntaxTree.ProcedureType;
  4976. wasInline: BOOLEAN;
  4977. actualParameters: SyntaxTree.ExpressionList;
  4978. formalParameter: SyntaxTree.Parameter;
  4979. actualParameter: SyntaxTree.Expression;
  4980. i: LONGINT;
  4981. localVariable: SyntaxTree.Variable;
  4982. variableDesignator, returnDesignator: SyntaxTree.Expression;
  4983. src, dest: Operand;
  4984. prevInlineExit : Label;
  4985. prevMapper: SymbolMapper;
  4986. tooComplex: BOOLEAN;
  4987. resultDesignator: SyntaxTree.Expression;
  4988. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  4989. BEGIN
  4990. IF e = NIL THEN RETURN TRUE
  4991. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  4992. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  4993. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  4994. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  4995. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  4996. ELSE RETURN FALSE
  4997. END;
  4998. END SimpleExpression;
  4999. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5000. BEGIN
  5001. RETURN checker.CanPassInRegister(type)
  5002. END FitsInRegister;
  5003. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5004. VAR
  5005. variable: SyntaxTree.Variable;
  5006. variableDesignator: SyntaxTree.Designator;
  5007. BEGIN
  5008. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5009. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5010. variableDesignator.SetType(type);
  5011. RETURN variableDesignator
  5012. END GetTemp;
  5013. BEGIN
  5014. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5015. wasInline := currentIsInline;
  5016. prevInlineExit := currentInlineExit;
  5017. prevMapper := currentMapper;
  5018. currentInlineExit := NewLabel();
  5019. tooComplex := FALSE;
  5020. NEW(currentMapper);
  5021. currentIsInline := TRUE;
  5022. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5023. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5024. formalParameter := procedureType.firstParameter;
  5025. actualParameters := x.parameters;
  5026. i := 0;
  5027. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5028. actualParameter := actualParameters.GetExpression(i);
  5029. IF actualParameter.resolved # NIL THEN
  5030. actualParameter := actualParameter.resolved
  5031. END;
  5032. (*
  5033. if expression is simple and can be passed immediately
  5034. or if type fits in register then we can proceed
  5035. otherwise we escape to ordinary procedure call.
  5036. *)
  5037. (* cases where the expression can be mapped identically *)
  5038. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5039. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5040. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5041. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5042. (*
  5043. Assign(variableDesignator, actualParameter);
  5044. *)
  5045. Evaluate(actualParameter, src);
  5046. Designate(variableDesignator, dest);
  5047. Emit(Mov(x.position, dest.op, src.op));
  5048. ReleaseOperand(dest);
  5049. ReleaseOperand(src);
  5050. (* the src operand should now have been completely released ! *)
  5051. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5052. ELSE tooComplex := TRUE
  5053. END;
  5054. (*
  5055. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5056. currentMapper.Add(formalParameter, actualParameter, NIL);
  5057. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5058. variableDesignator := GetTemp(system.addressType, FALSE);
  5059. Designate(actualParameter, src);
  5060. Designate(variableDesignator, dest);
  5061. IntermediateCode.MakeMemory(dest.op,addressType);
  5062. Emit(Mov(x.position, dest.op, src.op));
  5063. ReleaseOperand(dest);
  5064. IF src.tag.mode # IntermediateCode.Undefined THEN
  5065. tagDesignator := GetTemp(system.addressType, FALSE);
  5066. Designate(tagDesignator, dest);
  5067. IntermediateCode.MakeMemory(dest.op,addressType);
  5068. Emit(Mov(x.position, dest.op, src.op));
  5069. END;
  5070. ReleaseOperand(dest); ReleaseOperand(src);
  5071. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5072. END;
  5073. *)
  5074. formalParameter := formalParameter.nextParameter;
  5075. INC(i);
  5076. END;
  5077. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5078. IF resultDesignator # NIL THEN
  5079. returnDesignator := resultDesignator
  5080. ELSE
  5081. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5082. END;
  5083. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5084. END;
  5085. localVariable := procedure.procedureScope.firstVariable;
  5086. WHILE ~tooComplex & (localVariable # NIL) DO
  5087. variableDesignator := GetTemp(localVariable.type, FALSE);
  5088. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5089. localVariable := localVariable.nextVariable;
  5090. END;
  5091. IF ~tooComplex THEN
  5092. VisitStatementBlock(procedure.procedureScope.body);
  5093. SetLabel(currentInlineExit);
  5094. IF procedureType.returnType # NIL THEN
  5095. Designate(returnDesignator, result);
  5096. IF conditional THEN
  5097. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  5098. ValueToCondition(result)
  5099. END;
  5100. END;
  5101. END;
  5102. currentMapper := prevMapper;
  5103. currentInlineExit := prevInlineExit;
  5104. currentIsInline := wasInline;
  5105. RETURN ~tooComplex
  5106. END InlineProcedureCall;
  5107. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5108. VAR
  5109. parameters: SyntaxTree.ExpressionList;
  5110. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5111. designator: SyntaxTree.Designator;
  5112. procedureType: SyntaxTree.ProcedureType;
  5113. formalParameter: SyntaxTree.Parameter;
  5114. operand, returnValue: Operand;
  5115. reg, size, mask, dest: IntermediateCode.Operand;
  5116. saved,saved2: RegisterEntry;
  5117. symbol: SyntaxTree.Symbol;
  5118. variable: SyntaxTree.Variable;
  5119. i, parametersSize, returnTypeSize : LONGINT;
  5120. structuredReturnType: BOOLEAN;
  5121. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5122. tempVariableDesignator: SyntaxTree.Designator;
  5123. gap, alignment: LONGINT; (*fld*)
  5124. (* TODO: remove unnecessary backup variables *)
  5125. oldResult: Operand;
  5126. oldCurrentScope: SyntaxTree.Scope;
  5127. oldArrayDestinationTag: IntermediateCode.Operand;
  5128. oldArrayDestinationDimension: LONGINT;
  5129. oldConstantDeclaration: SyntaxTree.Symbol;
  5130. oldDestination: IntermediateCode.Operand;
  5131. oldCurrentLoop: Label;
  5132. oldConditional: BOOLEAN;
  5133. oldTrueLabel, oldFalseLabel: Label;
  5134. oldLocked: BOOLEAN;
  5135. usedRegisters,oldUsedRegisters: RegisterEntry;
  5136. return: IntermediateCode.Operand;
  5137. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5138. arg: IntermediateCode.Operand;
  5139. dummy: IntermediateCode.Operand;
  5140. recordType: SyntaxTree.RecordType;
  5141. operatorSelectionProcedureOperand: Operand;
  5142. operatorSelectionProcedure: SyntaxTree.Procedure;
  5143. fingerPrint: SyntaxTree.FingerPrint;
  5144. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5145. identifierNumber: LONGINT;
  5146. parameterRegisters: SIZE;
  5147. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5148. procedure: SyntaxTree.Procedure;
  5149. callingConvention: SyntaxTree.CallingConvention;
  5150. PROCEDURE BackupGlobalState;
  5151. BEGIN
  5152. oldResult := result;
  5153. oldCurrentScope := currentScope;
  5154. oldArrayDestinationTag := arrayDestinationTag;
  5155. oldArrayDestinationDimension := arrayDestinationDimension;
  5156. oldConstantDeclaration := constantDeclaration;
  5157. oldDestination := destination;
  5158. oldCurrentLoop := currentLoop;
  5159. oldConditional := conditional;
  5160. oldTrueLabel := trueLabel;
  5161. oldFalseLabel := falseLabel;
  5162. oldLocked := locked;
  5163. oldUsedRegisters := usedRegisters
  5164. END BackupGlobalState;
  5165. PROCEDURE RestoreGlobalState;
  5166. BEGIN
  5167. result := oldResult;
  5168. currentScope := oldCurrentScope;
  5169. arrayDestinationTag := oldArrayDestinationTag;
  5170. arrayDestinationDimension := oldArrayDestinationDimension;
  5171. constantDeclaration := oldConstantDeclaration;
  5172. destination := oldDestination;
  5173. currentLoop := oldCurrentLoop;
  5174. conditional := oldConditional;
  5175. trueLabel := oldTrueLabel;
  5176. falseLabel := oldFalseLabel;
  5177. locked := oldLocked;
  5178. usedRegisters := oldUsedRegisters
  5179. END RestoreGlobalState;
  5180. (** do preparations before parameter push for array-structured object types (ASOTs):
  5181. if ASOT is passed as VAR parameter:
  5182. - allocate temporary variable of math array type
  5183. - copy contents of ASOT to be passed to temporary variable
  5184. - use temporary variable as the actual parameter instead
  5185. - 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)
  5186. **)
  5187. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5188. VAR
  5189. expression: SyntaxTree.Expression;
  5190. BEGIN
  5191. IF actualParameter IS SyntaxTree.Designator THEN
  5192. designator := actualParameter(SyntaxTree.Designator);
  5193. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5194. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5195. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5196. ASSERT(checker # NIL);
  5197. checker.SetCurrentScope(currentScope);
  5198. (* allocate temporary variable *)
  5199. ASSERT(actualParameter.type # NIL);
  5200. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5201. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5202. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5203. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5204. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5205. ASSERT(tempVariableDesignator.type # NIL);
  5206. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5207. (* copy math array stored in actual parameter to temporary variable *)
  5208. BackupGlobalState;
  5209. AssignMathArray(tempVariableDesignator, actualParameter);
  5210. RestoreGlobalState;
  5211. (* use temporary variable as actual parameter instead of the original one *)
  5212. actualParameter := tempVariableDesignator;
  5213. (* create write-back call and store it in linked list *)
  5214. (* create new list entry *)
  5215. IF firstWriteBackCall = NIL THEN
  5216. NEW(firstWriteBackCall);
  5217. currentWriteBackCall := firstWriteBackCall
  5218. ELSE
  5219. ASSERT(currentWriteBackCall # NIL);
  5220. NEW(currentWriteBackCall.next);
  5221. currentWriteBackCall := currentWriteBackCall.next
  5222. END;
  5223. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5224. ASSERT(expression.type = NIL);
  5225. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5226. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5227. (* prepare writeback for any other "normal" indexer *)
  5228. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5229. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5230. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5231. Assign(tempVariableDesignator, actualParameter);
  5232. actualParameter := tempVariableDesignator;
  5233. IF firstWriteBackCall = NIL THEN
  5234. NEW(firstWriteBackCall);
  5235. currentWriteBackCall := firstWriteBackCall
  5236. ELSE
  5237. ASSERT(currentWriteBackCall # NIL);
  5238. NEW(currentWriteBackCall.next);
  5239. currentWriteBackCall := currentWriteBackCall.next
  5240. END;
  5241. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5242. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5243. END
  5244. END
  5245. END PrepareParameter;
  5246. BEGIN
  5247. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5248. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5249. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5250. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5251. IF InlineProcedureCall(x) THEN
  5252. RETURN
  5253. ELSE
  5254. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5255. END
  5256. END;
  5257. END;
  5258. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5259. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5260. callingConvention := procedureType.callingConvention;
  5261. dest := destination; destination := emptyOperand;
  5262. SaveRegisters();ReleaseUsedRegisters(saved);
  5263. parameters := x.parameters;
  5264. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5265. (* an operator is called *)
  5266. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5267. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5268. (* check if a dynamic operator call should be performed *)
  5269. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5270. ELSE
  5271. isCallOfDynamicOperator := FALSE
  5272. END;
  5273. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5274. Emit(Push(position, ap));
  5275. END;
  5276. alignment := procedureType.stackAlignment;
  5277. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5278. alignment := 16 (* bytes *);
  5279. END;
  5280. IF alignment > 1 THEN
  5281. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5282. Emit(Mov(position,reg, sp));
  5283. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5284. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5285. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5286. gap := 4*ToMemoryUnits(system,system.addressSize);
  5287. END;
  5288. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5289. gap := gap - 6*ToMemoryUnits(system,system.addressSize); (* the first 6 parameters are passed via registers in SysVABI *)
  5290. IF gap < 0 THEN
  5291. gap := 0
  5292. END;
  5293. ELSE
  5294. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5295. END;
  5296. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5297. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5298. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5299. Emit(And(position,sp, sp, mask));
  5300. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5301. Emit(Push(position,reg));
  5302. ReleaseIntermediateOperand(reg);
  5303. END;
  5304. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5305. (* align stack to 16-byte boundary *)
  5306. IntermediateCode.InitImmediate(mask,addressType,-16);
  5307. Emit(And(position,sp, sp, mask));
  5308. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5309. IF gap # 0 THEN
  5310. IntermediateCode.InitImmediate(size,addressType,gap);
  5311. Emit(Sub(position,sp,sp,size))
  5312. END;
  5313. END;
  5314. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5315. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5316. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5317. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5318. ELSE
  5319. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5320. END;
  5321. Evaluate(x.left, operand);
  5322. IF symbol IS SyntaxTree.Procedure THEN
  5323. IF (procedureType.selfParameter # NIL) THEN
  5324. Emit(Push(position,operand.tag));
  5325. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5326. Emit(Push(position,operand.tag));
  5327. ELSIF (procedureType.isDelegate) THEN
  5328. Emit(Push(position,operand.tag));
  5329. END;
  5330. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5331. IF (procedureType.selfParameter # NIL) THEN
  5332. Emit(Push(position,operand.tag));
  5333. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5334. Emit(Push(position,operand.tag));
  5335. END;
  5336. ELSE HALT(200);
  5337. END;
  5338. ReleaseIntermediateOperand(operand.tag);
  5339. operand.tag := emptyOperand;
  5340. (* determine if a structured return type is needed *)
  5341. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5342. IF structuredReturnType THEN
  5343. IF resultDesignator # NIL THEN
  5344. d := resultDesignator;
  5345. ELSE
  5346. (* temporary result that might be allocated, must potentially be traced *)
  5347. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5348. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5349. d.SetType(variable.type);
  5350. END;
  5351. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5352. Designate(d,returnValue);
  5353. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5354. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5355. Emit(Push(position,size));
  5356. Emit(Push(position,returnValue.op));
  5357. ReleaseOperand(returnValue);
  5358. ELSE*)
  5359. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5360. (*
  5361. END;
  5362. *)
  5363. END;
  5364. firstWriteBackCall := NIL; (* reset write-back call list *)
  5365. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5366. parameterRegisters := backend.NumberParameterRegisters(callingConvention);
  5367. passByRegister := parameterRegisters > 0;
  5368. registerNumber := 0;
  5369. formalParameter := procedureType.lastParameter;
  5370. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5371. actualParameter := parameters.GetExpression(i);
  5372. PrepareParameter(actualParameter, formalParameter);
  5373. IF passByRegister & (i < parameterRegisters) THEN
  5374. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5375. Error(actualParameter.position,"cannot be passed by register")
  5376. ELSE
  5377. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,i);
  5378. END;
  5379. INC(registerNumber);
  5380. ELSE
  5381. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5382. END;
  5383. formalParameter := formalParameter.prevParameter;
  5384. END;
  5385. IF passByRegister (* & (registerNumber > 0)*) & ~(callingConvention IN SysvABI) THEN
  5386. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5387. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5388. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5389. END;
  5390. ELSE
  5391. hasDynamicOperands := FALSE;
  5392. formalParameter := procedureType.firstParameter;
  5393. FOR i := 0 TO parameters.Length() - 1 DO
  5394. actualParameter := parameters.GetExpression(i);
  5395. IF formalParameter # NIL THEN (* TENTATIVE *)
  5396. PrepareParameter(actualParameter, formalParameter);
  5397. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5398. ASSERT(i < 2);
  5399. hasDynamicOperands := TRUE;
  5400. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5401. ELSE
  5402. IF passByRegister & (registerNumber > 0) THEN
  5403. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5404. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5405. END;
  5406. passByRegister := FALSE;
  5407. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5408. END;
  5409. formalParameter := formalParameter.nextParameter;
  5410. END;
  5411. END;
  5412. END;
  5413. IF symbol IS SyntaxTree.Procedure THEN
  5414. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5415. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5416. Emit(Push(position,reg));
  5417. ReleaseIntermediateOperand(reg);
  5418. END;
  5419. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5420. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5421. parametersSize := ParametersSize(system,procedureType, FALSE);
  5422. END;
  5423. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5424. (*
  5425. dynamic operator overloading:
  5426. first push parameters, regularly:
  5427. [self]
  5428. par1
  5429. par2
  5430. then push parameters for GetOperator
  5431. identifier
  5432. ptr1
  5433. tag
  5434. ptr2
  5435. tag
  5436. call GetOperatorRuntimeProc
  5437. call Operator
  5438. *)
  5439. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5440. (* push ID *)
  5441. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5442. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5443. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5444. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5445. formalParameter := procedureType.firstParameter;
  5446. FOR i := 0 TO parameters.Length() - 1 DO
  5447. IF formalParameter.access # SyntaxTree.Hidden THEN
  5448. ASSERT(i < 2);
  5449. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5450. (* push pointer *)
  5451. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5452. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5453. (* add dereference *)
  5454. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5455. (*! better: do refer to stack above than using parameter backups !!*)
  5456. ReleaseIntermediateOperand(parameterBackups[i]);
  5457. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5458. END;
  5459. Emit(Push(position,parameterBackups[i]));
  5460. ReleaseIntermediateOperand(parameterBackups[i]);
  5461. (* push typetag *)
  5462. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5463. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5464. arg := TypeDescriptorAdr(recordType);
  5465. Emit(Push(position,arg));
  5466. ELSE
  5467. (* push 'NonPointer' *)
  5468. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5469. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5470. (* push fingerprint *)
  5471. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5472. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5473. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5474. END
  5475. END;
  5476. formalParameter := formalParameter.nextParameter
  5477. END;
  5478. (* for unary operators: complete the information for the second parameter *)
  5479. IF procedureType.numberParameters < 2 THEN
  5480. (* push 'NonPointer' *)
  5481. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5482. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5483. (* push 'NoType' *)
  5484. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5485. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5486. END;
  5487. (* call operator selection procedure *)
  5488. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5489. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5490. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5491. ReleaseOperand(operatorSelectionProcedureOperand);
  5492. (* use the address that the operator selection procedure returned as the target address of the call *)
  5493. InitOperand(operand, ModeValue);
  5494. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5495. Emit(Result(position,operand.op))
  5496. END
  5497. END;
  5498. ReleaseParameterRegisters();
  5499. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5500. SaveRegisters();ReleaseUsedRegisters(saved2);
  5501. CallThis(position,"Objects","LeaveA2",0);
  5502. RestoreRegisters(saved2);
  5503. END;
  5504. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5505. Emit(Call(position,operand.op,0));
  5506. ELSE
  5507. Emit(Call(position,operand.op,parametersSize));
  5508. END;
  5509. ReleaseOperand(operand);
  5510. IF procedureType.noReturn THEN
  5511. EmitTrap(position,NoReturnTrap);
  5512. END;
  5513. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5514. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5515. Emit(Result(position,return));
  5516. END;
  5517. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5518. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5519. Emit(Push(position, return));
  5520. CallThis(position,"Objects","ReenterA2",0);
  5521. Emit(Pop(position, return));
  5522. ELSE
  5523. CallThis(position,"Objects","ReenterA2",0);
  5524. END;
  5525. END;
  5526. (* === return parameter space === *)
  5527. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5528. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5529. (* cleanup all space for all parameters *)
  5530. IF parametersSize < 32 THEN
  5531. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5532. parametersSize := 32
  5533. END;
  5534. size := IntermediateCode.Immediate(addressType,parametersSize);
  5535. Emit(Add(position,sp,sp,size))
  5536. END;
  5537. IF (callingConvention IN SysvABI) THEN
  5538. IF passByRegister THEN
  5539. IF parameters.Length() > parameterRegisters THEN
  5540. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5541. ELSE
  5542. parametersSize := 0
  5543. END;
  5544. ELSE
  5545. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5546. INC( parametersSize, (-parametersSize) MOD 16 )
  5547. END;
  5548. IF parametersSize > 0 THEN
  5549. size := IntermediateCode.Immediate(addressType,parametersSize);
  5550. Emit(Add(position,sp,sp,size))
  5551. END;
  5552. END;
  5553. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5554. IF structuredReturnType THEN
  5555. (* stack pointer rewinding done by callee
  5556. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5557. Emit(Add(position,sp,sp,size));
  5558. *)
  5559. RestoreRegisters(saved);
  5560. InitOperand(result,ModeReference);
  5561. Symbol(variable,result);
  5562. ELSE
  5563. RestoreRegisters(saved);
  5564. InitOperand(result,ModeValue);
  5565. result.op := return;
  5566. END;
  5567. END;
  5568. IF alignment > 1 THEN
  5569. Emit(Pop(position,sp));
  5570. END;
  5571. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5572. Emit(Pop(position, ap));
  5573. END;
  5574. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5575. ValueToCondition(result);
  5576. END;
  5577. destination := dest;
  5578. (* perform all write-back calls in the list *)
  5579. BackupGlobalState;
  5580. currentWriteBackCall := firstWriteBackCall;
  5581. WHILE currentWriteBackCall # NIL DO
  5582. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5583. currentWriteBackCall := currentWriteBackCall.next
  5584. END;
  5585. RestoreGlobalState;
  5586. (* TENATIVE *)
  5587. (*
  5588. IF isOperatorCall THEN
  5589. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5590. END;
  5591. *)
  5592. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5593. END VisitProcedureCallDesignator;
  5594. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5595. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5596. td: SyntaxTree.Symbol;
  5597. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5598. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5599. BEGIN
  5600. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5601. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5602. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5603. variable.SetType(system.anyType);
  5604. scope.AddVariable(variable);
  5605. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5606. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5607. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5608. typeDeclaration.SetScope(module.module.moduleScope);
  5609. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5610. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5611. END;
  5612. RETURN hiddenPointerType;
  5613. END GetHiddenPointerType;
  5614. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5615. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5616. BEGIN
  5617. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5618. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5619. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5620. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5621. scope.AddVariable(variable);
  5622. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5623. variable.SetType(system.anyType);
  5624. scope.AddVariable(variable);
  5625. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5626. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5627. typeDeclaration.SetDeclaredType(delegatePointerType);
  5628. typeDeclaration.SetScope(module.module.moduleScope);
  5629. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5630. delegatePointerType.SetState(SyntaxTree.Resolved);
  5631. END;
  5632. RETURN delegatePointerType
  5633. END GetDelegateType;
  5634. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5635. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5636. such as in VAR a: RECORD ... END;
  5637. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5638. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5639. *)
  5640. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5641. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5642. BEGIN (* no code emission *)
  5643. source := NIL;
  5644. x := x.resolved;
  5645. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5646. x := GetHiddenPointerType();
  5647. ELSIF IsDelegate(x) THEN
  5648. x := GetDelegateType();
  5649. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5650. ELSE HALT(200);
  5651. END;
  5652. td := x.typeDeclaration;
  5653. IF td = NIL THEN
  5654. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5655. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5656. ASSERT(td # NIL);
  5657. END;
  5658. GetCodeSectionNameForSymbol(td,name);
  5659. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5660. meta.CheckTypeDeclaration(x);
  5661. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5662. ELSE
  5663. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5664. END;
  5665. IF backend.cooperative OR meta.simple THEN
  5666. offset := 0;
  5667. ELSE
  5668. IF x IS SyntaxTree.CellType THEN
  5669. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5670. IF baseRecord = NIL THEN
  5671. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5672. ELSE
  5673. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5674. END;
  5675. ELSE
  5676. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5677. END;
  5678. END;
  5679. RETURN td
  5680. END GetBackendType;
  5681. BEGIN
  5682. (*td := t.typeDeclaration;*)
  5683. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5684. (*
  5685. IF t IS SyntaxTree.PointerType THEN
  5686. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5687. ELSE
  5688. source := GetBackendType(t);
  5689. END;
  5690. *)
  5691. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5692. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5693. IntermediateCode.SetOffset(res,offset);
  5694. (*
  5695. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5696. make memory should be used when tag is used, not earlier
  5697. *)
  5698. RETURN res
  5699. END TypeDescriptorAdr;
  5700. (*
  5701. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5702. VAR result: IntermediateCode.Operand;
  5703. BEGIN
  5704. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5705. operand.tag := TypeDescriptorAdr(operand.type);
  5706. IntermediateCode.MakeMemory(operand.tag,addressType);
  5707. UseIntermediateOperand(operand.tag);
  5708. END;
  5709. END MakeTypeTag;
  5710. *)
  5711. PROCEDURE ProfilerInit;
  5712. VAR reg: IntermediateCode.Operand;
  5713. BEGIN
  5714. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5715. Emit(Call(position,reg,0));
  5716. END ProfilerInit;
  5717. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5718. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5719. BEGIN
  5720. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5721. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5722. THEN
  5723. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5724. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5725. Emit(Push(position,reg));
  5726. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5727. Emit(Push(position,reg));
  5728. StaticCallOperand(result,procedure);
  5729. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5730. ReleaseOperand(result);
  5731. END;
  5732. END ProfilerEnterExit;
  5733. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5734. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5735. BEGIN
  5736. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5737. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5738. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5739. profileInit.Emit(Push(position,reg));
  5740. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5741. profileInit.Emit(Push(position,reg));
  5742. NEW(string, LEN(name)); COPY(name, string^);
  5743. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5744. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5745. sv.SetType(type);
  5746. Designate(sv,result);
  5747. profileInit.Emit(Push(position,result.tag));
  5748. profileInit.Emit(Push(position,result.op));
  5749. StaticCallOperand(result,procedure);
  5750. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5751. ReleaseOperand(result);
  5752. END;
  5753. END ProfilerAddProcedure;
  5754. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5755. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5756. BEGIN
  5757. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5758. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5759. profileInit.Emit(Push(position,reg));
  5760. profileInitPatchPosition := profileInit.pc;
  5761. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5762. NEW(string, LEN(name)); COPY(name, string^);
  5763. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5764. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5765. sv.SetType(type);
  5766. Designate(sv,result);
  5767. profileInit.Emit(Push(position,result.tag));
  5768. profileInit.Emit(Push(position,result.op));
  5769. StaticCallOperand(result,procedure);
  5770. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5771. ReleaseOperand(result);
  5772. END;
  5773. END ProfilerAddModule;
  5774. PROCEDURE ProfilerPatchInit;
  5775. VAR reg: IntermediateCode.Operand;
  5776. BEGIN
  5777. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5778. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5779. EmitLeave(profileInit,position,NIL,0);
  5780. profileInit.Emit(Exit(position,0,0,0));
  5781. END ProfilerPatchInit;
  5782. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5783. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5784. VAR
  5785. id: LONGINT;
  5786. leftType, rightType: SyntaxTree.Type;
  5787. procedureType: SyntaxTree.ProcedureType;
  5788. runtimeProcedure: SyntaxTree.Procedure;
  5789. runtimeProcedureOperand, operatorOperand: Operand;
  5790. kind: SET;
  5791. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5792. VAR
  5793. arg: IntermediateCode.Operand;
  5794. recordType: SyntaxTree.RecordType;
  5795. fingerPrint: SyntaxTree.FingerPrint;
  5796. BEGIN
  5797. IF type = NIL THEN
  5798. (* no type: push 'NoType' *)
  5799. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5800. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5801. ELSIF IsStrictlyPointerToRecord(type) THEN
  5802. (* pointer to record type: push typetag *)
  5803. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5804. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5805. arg := TypeDescriptorAdr(recordType);
  5806. ELSE
  5807. (* non-pointer to record type: push fingerprint *)
  5808. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5809. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5810. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5811. END;
  5812. operatorInitializationCodeSection.Emit(Push(position,arg))
  5813. END PushTypeInfo;
  5814. BEGIN
  5815. ASSERT(operatorInitializationCodeSection # NIL);
  5816. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5817. procedureType := operator.type(SyntaxTree.ProcedureType);
  5818. (* determine types *)
  5819. leftType := procedureType.firstParameter.type;
  5820. IF procedureType.numberParameters = 2 THEN
  5821. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5822. rightType := procedureType.firstParameter.nextParameter.type;
  5823. ELSE
  5824. rightType := NIL
  5825. END;
  5826. (* determine operator kind *)
  5827. IF IsStrictlyPointerToRecord(leftType) THEN
  5828. kind := {LhsIsPointer}
  5829. ELSE
  5830. kind := {}
  5831. END;
  5832. IF IsStrictlyPointerToRecord(rightType) THEN
  5833. kind := kind + {RhsIsPointer}
  5834. END;
  5835. IF kind # {} THEN (* TODO: to be removed later on *)
  5836. (* at least one of the types is a pointer to record *)
  5837. (* emit a code that registers this specific operator in the runtime *)
  5838. dump := operatorInitializationCodeSection.comments;
  5839. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5840. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5841. (* push ID *)
  5842. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5843. id := Global.GetSymbol(module.module.case, operator.name);
  5844. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5845. (* push kind *)
  5846. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5847. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5848. (* push type infos *)
  5849. PushTypeInfo(leftType);
  5850. PushTypeInfo(rightType);
  5851. (* push operator address *)
  5852. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5853. StaticCallOperand(operatorOperand, operator);
  5854. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5855. ReleaseOperand(operatorOperand);
  5856. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5857. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  5858. ReleaseOperand(runtimeProcedureOperand)
  5859. END
  5860. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5861. END
  5862. END RegisterDynamicOperator;
  5863. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5864. VAR
  5865. traceModule: SyntaxTree.Module;
  5866. procedure: SyntaxTree.Procedure;
  5867. procedureVariable: SyntaxTree.Variable;
  5868. s,msg: Basic.MessageString;
  5869. res: Operand;
  5870. i: LONGINT;
  5871. sv: SyntaxTree.StringValue;
  5872. type: SyntaxTree.Type;
  5873. recordType: SyntaxTree.RecordType;
  5874. printout: Printout.Printer;
  5875. stringWriter: Streams.StringWriter;
  5876. expression: SyntaxTree.Expression;
  5877. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5878. BEGIN
  5879. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5880. IF procedure = NIL THEN
  5881. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5882. END;
  5883. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5884. s := "procedure ";
  5885. Strings.Append(s,backend.traceModuleName);
  5886. Strings.Append(s,".");
  5887. Strings.Append(s,procedureName);
  5888. Strings.Append(s," not present");
  5889. Error(position,s);
  5890. RETURN FALSE
  5891. ELSE
  5892. RETURN TRUE
  5893. END;
  5894. END GetProcedure;
  5895. PROCEDURE CallProcedure;
  5896. VAR size: LONGINT;
  5897. BEGIN
  5898. IF procedure # NIL THEN
  5899. StaticCallOperand(result,procedure);
  5900. size := ProcParametersSize(procedure);
  5901. ELSE
  5902. Symbol(procedureVariable, result);
  5903. LoadValue(result, procedureVariable.type.resolved);
  5904. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5905. END;
  5906. Emit(Call(position,result.op,size));
  5907. END CallProcedure;
  5908. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5909. VAR res: Operand; string: SyntaxTree.String;
  5910. BEGIN
  5911. IF GetProcedure("String") THEN
  5912. NEW(string, LEN(s)); COPY(s, string^);
  5913. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5914. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5915. sv.SetType(type);
  5916. Designate(sv,res);
  5917. Emit(Push(position,res.tag));
  5918. Emit(Push(position,res.op));
  5919. ReleaseOperand(res);
  5920. CallProcedure;
  5921. END;
  5922. END String;
  5923. PROCEDURE Integer(op: IntermediateCode.Operand);
  5924. BEGIN
  5925. IF GetProcedure("Int") THEN
  5926. Emit(Push(position,op));
  5927. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5928. CallProcedure;
  5929. END;
  5930. END Integer;
  5931. PROCEDURE Float(op: IntermediateCode.Operand);
  5932. BEGIN
  5933. IF GetProcedure("HIntHex") THEN
  5934. Emit(Push(position,op));
  5935. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5936. CallProcedure;
  5937. END;
  5938. END Float;
  5939. PROCEDURE Set(op: IntermediateCode.Operand);
  5940. BEGIN
  5941. IF GetProcedure("Set") THEN
  5942. Emit(Push(position,op));
  5943. (*
  5944. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5945. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5946. *)
  5947. CallProcedure;
  5948. END;
  5949. END Set;
  5950. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5951. BEGIN
  5952. IF GetProcedure("Boolean") THEN
  5953. Emit(Push(position,op));
  5954. CallProcedure;
  5955. END;
  5956. END Boolean;
  5957. PROCEDURE Char(op: IntermediateCode.Operand);
  5958. BEGIN
  5959. IF GetProcedure("Char") THEN
  5960. Emit(Push(position,op));
  5961. CallProcedure;
  5962. END;
  5963. END Char;
  5964. PROCEDURE Address(op: IntermediateCode.Operand);
  5965. BEGIN
  5966. IF GetProcedure("Address") THEN
  5967. Emit(Push(position,op));
  5968. CallProcedure;
  5969. END;
  5970. END Address;
  5971. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  5972. VAR len: IntermediateCode.Operand;
  5973. BEGIN
  5974. IF GetProcedure("String") THEN
  5975. len := GetArrayLength(type, op.tag);
  5976. Emit(Push(position,len));
  5977. ReleaseIntermediateOperand(len);
  5978. Emit(Push(position,op.op));
  5979. CallProcedure;
  5980. END;
  5981. END StringOperand;
  5982. PROCEDURE Ln;
  5983. BEGIN
  5984. IF GetProcedure("Ln") THEN
  5985. CallProcedure;
  5986. END;
  5987. END Ln;
  5988. BEGIN
  5989. IF backend.traceModuleName = "" THEN RETURN END;
  5990. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  5991. IF GetProcedure("Enter") THEN
  5992. CallProcedure
  5993. END;
  5994. NEW(stringWriter,LEN(s));
  5995. FOR i := 0 TO x.Length()-1 DO
  5996. msg := "";
  5997. expression := x.GetExpression(i);
  5998. IF currentScope IS SyntaxTree.ProcedureScope THEN
  5999. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6000. ELSE
  6001. Global.GetModuleName(module.module, s);
  6002. END;
  6003. IF i = 0 THEN
  6004. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6005. stringWriter.String(":");
  6006. END;
  6007. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6008. IF ~(expression IS SyntaxTree.StringValue) THEN
  6009. printout.Expression(expression);
  6010. stringWriter.Get(s);
  6011. Strings.Append(msg,s);
  6012. Strings.Append(msg,"= ");
  6013. ELSE stringWriter.Get(s); (* remove from string writer *)
  6014. Strings.Append(msg, s);
  6015. END;
  6016. String(msg);
  6017. IF SemanticChecker.IsStringType(expression.type) THEN
  6018. Designate(expression,res);
  6019. StringOperand(res, expression.type);
  6020. ELSE
  6021. Evaluate(expression,res);
  6022. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6023. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6024. Convert(res.op,int64);
  6025. END;
  6026. Integer(res.op);
  6027. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6028. Boolean(res.op);
  6029. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6030. Set(res.op);
  6031. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6032. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6033. Convert(res.op,float64);
  6034. END;
  6035. Float(res.op);
  6036. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6037. Char(res.op);
  6038. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6039. Address(res.op);String("H");
  6040. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6041. Address(res.op);String("H");
  6042. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6043. Address(res.op);String("H");
  6044. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6045. Address(res.op);String("H");
  6046. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6047. String("NIL");
  6048. ELSE HALT(200);
  6049. END;
  6050. END;
  6051. ReleaseOperand(res);
  6052. String("; ");
  6053. END;
  6054. IF GetProcedure("Exit") THEN
  6055. CallProcedure
  6056. ELSE
  6057. Ln;
  6058. END;
  6059. END;
  6060. END SystemTrace;
  6061. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6062. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6063. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6064. BEGIN
  6065. type := type.resolved;
  6066. IF type IS SyntaxTree.RecordType THEN
  6067. WITH type: SyntaxTree.RecordType DO
  6068. baseType := type.baseType;
  6069. IF baseType # NIL THEN
  6070. baseType := baseType.resolved;
  6071. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6072. InitFields(baseType,adr,offset);
  6073. END;
  6074. variable := type.recordScope.firstVariable;
  6075. WHILE variable # NIL DO
  6076. IF variable.initializer # NIL THEN
  6077. Evaluate(variable.initializer,initializerOp);
  6078. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6079. Emit(Mov(position,mem,initializerOp.op));
  6080. ReleaseOperand(initializerOp);
  6081. ReleaseIntermediateOperand(mem);
  6082. END;
  6083. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6084. variable := variable.nextVariable
  6085. END;
  6086. END;
  6087. ELSIF type IS SyntaxTree.CellType THEN
  6088. WITH type: SyntaxTree.CellType DO
  6089. baseType := type.baseType;
  6090. IF baseType # NIL THEN
  6091. baseType := baseType.resolved;
  6092. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6093. InitFields(baseType,adr,offset);
  6094. END;
  6095. variable := type.cellScope.firstVariable;
  6096. WHILE variable # NIL DO
  6097. IF variable.initializer # NIL THEN
  6098. Evaluate(variable.initializer,initializerOp);
  6099. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6100. Emit(Mov(position,mem,initializerOp.op));
  6101. ReleaseOperand(initializerOp);
  6102. ReleaseIntermediateOperand(mem);
  6103. END;
  6104. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6105. variable := variable.nextVariable
  6106. END;
  6107. END;
  6108. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6109. WITH type: SyntaxTree.ArrayType DO
  6110. IF type.form = SyntaxTree.Static THEN
  6111. baseType := type.arrayBase;
  6112. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6113. FOR i := 0 TO type.staticLength-1 DO
  6114. InitFields(baseType,adr,offset+i*size);
  6115. END;
  6116. END;
  6117. END;
  6118. ELSIF type IS SyntaxTree.MathArrayType THEN
  6119. WITH type: SyntaxTree.MathArrayType DO
  6120. IF type.form = SyntaxTree.Open THEN
  6121. dim := DynamicDim(type);
  6122. imm := IntermediateCode.Immediate(addressType,dim);
  6123. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6124. baseType := SemanticChecker.ArrayBase(type,dim);
  6125. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6126. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6127. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6128. ReleaseIntermediateOperand(imm);
  6129. (* flags remain empty (=0) for open array *)
  6130. ELSIF type.form = SyntaxTree.Static THEN
  6131. baseType := type.arrayBase;
  6132. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6133. ASSERT(type.staticLength < 1024*1024*1024);
  6134. FOR i := 0 TO type.staticLength-1 DO
  6135. InitFields(baseType,adr,offset+i*size);
  6136. END;
  6137. END;
  6138. END;
  6139. END;
  6140. END InitFields;
  6141. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6142. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6143. saved: RegisterEntry;
  6144. BEGIN
  6145. type := variable.type.resolved;
  6146. IF (type IS SyntaxTree.MathArrayType) THEN
  6147. WITH type: SyntaxTree.MathArrayType DO
  6148. IF type.form = SyntaxTree.Open THEN
  6149. Symbol(variable,operand);
  6150. InitFields(type, operand.tag,0);
  6151. IF temporary THEN
  6152. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6153. END;
  6154. ELSIF type.form = SyntaxTree.Tensor THEN
  6155. IF temporary & backend.writeBarriers THEN
  6156. SaveRegisters();ReleaseUsedRegisters(saved);
  6157. Symbol(variable, operand);
  6158. Emit(Push(position,operand.op));
  6159. ReleaseOperand(operand);
  6160. Emit(Push(position,nil));
  6161. CallThis(position,"FoxArrayBase","Assign",2);
  6162. RestoreRegisters(saved);
  6163. ELSE
  6164. Symbol(variable, operand);
  6165. MakeMemory(tmp,operand.op,addressType,0);
  6166. ReleaseOperand(operand);
  6167. IF FALSE & temporary THEN
  6168. (* trick -- temporary object from array base *)
  6169. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6170. Symbol(symbol,operand);
  6171. MakeMemory(mem,operand.op,addressType,0);
  6172. ReleaseOperand(operand);
  6173. Emit(Mov(position,tmp, mem) );
  6174. ReleaseOperand(operand);
  6175. ELSE
  6176. Emit(Mov(position,tmp, nil ) );
  6177. END;
  6178. ReleaseIntermediateOperand(tmp)
  6179. END;
  6180. END;
  6181. END;
  6182. ELSE
  6183. Symbol(variable,operand);
  6184. IF variable.initializer # NIL THEN
  6185. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6186. reference.SetType(variable.type.resolved);
  6187. reference.SetAssignable(TRUE);
  6188. Assign(reference,variable.initializer);
  6189. ELSIF temporary THEN
  6190. IF SemanticChecker.IsPointerType(variable.type) THEN
  6191. IF backend.writeBarriers THEN
  6192. SaveRegisters();ReleaseUsedRegisters(saved);
  6193. Symbol(variable, operand);
  6194. Emit(Push(position,operand.op));
  6195. ReleaseOperand(operand);
  6196. Emit(Push(position,nil));
  6197. CallThis(position,"Heaps","Assign",2);
  6198. RestoreRegisters(saved);
  6199. ELSE
  6200. Symbol(variable, operand);
  6201. MakeMemory(tmp,operand.op,addressType,0);
  6202. ReleaseOperand(operand);
  6203. Emit(Mov(position,tmp, nil ) );
  6204. ReleaseIntermediateOperand(tmp);
  6205. END;
  6206. END;
  6207. END;
  6208. InitFields(type, operand.op,0);
  6209. ReleaseOperand(operand);
  6210. END;
  6211. END InitVariable;
  6212. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6213. VAR end: Label;
  6214. BEGIN
  6215. IF type.form = SyntaxTree.Tensor THEN
  6216. InitOperand(result,ModeValue);
  6217. ReuseCopy(result.op,base);
  6218. end := NewLabel();
  6219. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6220. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6221. SetLabel(end);
  6222. Convert(result.op,lenType);
  6223. ELSE
  6224. InitOperand(result,ModeValue);
  6225. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6226. END
  6227. END MathArrayDim;
  6228. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6229. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6230. BEGIN
  6231. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6232. MakeMemory(mem,base,addressType,offset);
  6233. Emit(Mov(position,mem,value));
  6234. ReleaseIntermediateOperand(mem);
  6235. END PutMathArrayField;
  6236. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6237. VAR mem: IntermediateCode.Operand;
  6238. BEGIN
  6239. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6240. MakeMemory(mem,base,addressType,offset);
  6241. Emit(Mov(position,mem,value));
  6242. ReleaseIntermediateOperand(mem);
  6243. END PutMathArrayFieldOffset;
  6244. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6245. BEGIN
  6246. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6247. MakeMemory(value,base,addressType,offset);
  6248. END GetMathArrayField;
  6249. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6250. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6251. BEGIN
  6252. IF incr THEN
  6253. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6254. ELSE
  6255. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6256. END;
  6257. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6258. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6259. ELSE
  6260. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6261. Emit(Mov(position,reg,dim));
  6262. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6263. Emit(Add(position,reg,reg,base));
  6264. MakeMemory(mem, reg, addressType, offset);
  6265. ReleaseIntermediateOperand(reg);
  6266. Emit(Mov(position,mem,value));
  6267. ReleaseIntermediateOperand(mem);
  6268. END;
  6269. END PutMathArrayLenOrIncr;
  6270. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6271. BEGIN
  6272. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6273. END PutMathArrayLength;
  6274. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6275. BEGIN
  6276. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6277. END PutMathArrayIncrement;
  6278. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6279. BEGIN
  6280. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6281. END GetMathArrayIncrement;
  6282. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6283. BEGIN
  6284. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6285. END GetMathArrayLength;
  6286. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6287. VAR dimOp: IntermediateCode.Operand;
  6288. BEGIN
  6289. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6290. GetMathArrayLength(type, operand, dimOp, check, result);
  6291. END GetMathArrayLengthAt;
  6292. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6293. VAR dimOp: IntermediateCode.Operand;
  6294. BEGIN
  6295. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6296. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6297. END GetMathArrayIncrementAt;
  6298. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6299. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6300. offset: LONGINT;
  6301. BEGIN
  6302. IF increment THEN
  6303. offset := MathIncrOffset;
  6304. ELSE
  6305. offset := MathLenOffset;
  6306. END;
  6307. INC(offset,operand.dimOffset*2);
  6308. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6309. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6310. END;
  6311. (* static dimension *)
  6312. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6313. IF check & (type.form = SyntaxTree.Tensor) THEN
  6314. DimensionCheck(operand.tag,dim,BrltL);
  6315. END;
  6316. val := SHORT(dim.intValue);
  6317. IF type.form # SyntaxTree.Tensor THEN
  6318. t := SemanticChecker.ArrayBase(type,val);
  6319. type := t.resolved(SyntaxTree.MathArrayType);
  6320. IF type.form = SyntaxTree.Static THEN
  6321. IF increment THEN
  6322. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6323. ELSE
  6324. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6325. END;
  6326. InitOperand(result,ModeValue);
  6327. result.op := res;
  6328. RETURN;
  6329. END;
  6330. END;
  6331. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6332. MakeMemory(res,operand.tag,addressType,offset);
  6333. (*
  6334. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6335. *)
  6336. InitOperand(result,ModeValue);
  6337. result.op := res;
  6338. ELSE
  6339. Convert(dim,addressType);
  6340. IF check THEN
  6341. IF type.form = SyntaxTree.Tensor THEN
  6342. DimensionCheck(operand.tag,dim,BrltL);
  6343. ELSIF isUnchecked THEN (* do nothing *)
  6344. ELSE
  6345. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6346. END;
  6347. END;
  6348. end := NewLabel(); next := NIL;
  6349. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6350. Emit(Mov(position,res,dim));
  6351. Convert(res,sizeType);
  6352. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6353. WHILE t IS SyntaxTree.MathArrayType DO
  6354. type := t(SyntaxTree.MathArrayType);
  6355. IF type.form = SyntaxTree.Static THEN
  6356. imm := IntermediateCode.Immediate(sizeType,val);
  6357. next := NewLabel();
  6358. BrneL(next,imm,res);
  6359. IF increment THEN
  6360. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6361. ELSE
  6362. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6363. END;
  6364. Emit(MovReplace(position,res,imm));
  6365. BrL(end);
  6366. ELSE hasDynamicPart := TRUE;
  6367. END;
  6368. t := type.arrayBase.resolved;
  6369. val := val + 1;
  6370. IF next # NIL THEN SetLabel(next) END;
  6371. END;
  6372. IF hasDynamicPart THEN
  6373. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6374. Emit(Mov(position,res2,dim));
  6375. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6376. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6377. Emit(Add(position,res2,res2,imm));
  6378. Emit(Add(position,res2,res2,operand.tag));
  6379. IntermediateCode.MakeMemory(res2,sizeType);
  6380. Emit(MovReplace(position,res,res2));
  6381. ReleaseIntermediateOperand(res2);
  6382. END;
  6383. SetLabel(end);
  6384. Convert(res,sizeType);
  6385. InitOperand(result,ModeValue);
  6386. result.op := res;
  6387. END;
  6388. END MathArrayLenOrIncr;
  6389. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6390. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6391. offset: LONGINT;
  6392. BEGIN
  6393. offset := operand.dimOffset+DynamicDim(type)-1;
  6394. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6395. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6396. val := SHORT(dim.intValue);
  6397. t := SemanticChecker.ArrayBase(type,val);
  6398. type := t.resolved(SyntaxTree.ArrayType);
  6399. IF type.form = SyntaxTree.Static THEN
  6400. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6401. ELSE
  6402. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6403. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6404. END;
  6405. UseIntermediateOperand(res);
  6406. InitOperand(result,ModeValue);
  6407. result.op := res;
  6408. ELSE
  6409. Convert(dim,addressType);
  6410. IF ~isUnchecked THEN
  6411. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6412. END;
  6413. end := NewLabel(); next := NIL;
  6414. (* ReuseCopy(dim,res); *)
  6415. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6416. Emit(Mov(position,res,dim));
  6417. Convert(res,sizeType);
  6418. Convert(res,sizeType);
  6419. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6420. WHILE t IS SyntaxTree.ArrayType DO
  6421. type := t(SyntaxTree.ArrayType);
  6422. IF type.form = SyntaxTree.Static THEN
  6423. imm := IntermediateCode.Immediate(sizeType,val);
  6424. next := NewLabel();
  6425. BrneL(next,imm,res);
  6426. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6427. Emit(MovReplace(position,res,imm));
  6428. BrL(end);
  6429. ELSE hasDynamicPart := TRUE;
  6430. END;
  6431. t := type.arrayBase.resolved;
  6432. val := val + 1;
  6433. IF next # NIL THEN SetLabel(next) END;
  6434. END;
  6435. IF hasDynamicPart THEN
  6436. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6437. Convert(res2,addressType);
  6438. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6439. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6440. Emit(Sub(position,res2,imm,res2));
  6441. Emit(Add(position,res2,res2,operand.tag));
  6442. IntermediateCode.MakeMemory(res2,sizeType);
  6443. Emit(MovReplace(position,res,res2));
  6444. ReleaseIntermediateOperand(res2);
  6445. END;
  6446. SetLabel(end);
  6447. Convert(res,sizeType);
  6448. InitOperand(result,ModeValue);
  6449. result.op := res;
  6450. END;
  6451. END ArrayLen;
  6452. (**
  6453. create a temporary variable in current scope
  6454. **)
  6455. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6456. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6457. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6458. BEGIN
  6459. IF ~register THEN
  6460. v := temporaries.GetFreeVariable(type, untraced, index);
  6461. ELSE
  6462. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6463. END;
  6464. scope := currentScope;
  6465. (*
  6466. variable := NIL; (* disable free variable managemenet for the time being -- does not work *)
  6467. *)
  6468. name := temporaries.GetUID();
  6469. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6470. variable.SetType(type);
  6471. variable.SetAccess(SyntaxTree.Hidden);
  6472. variable.SetUntraced(untraced);
  6473. IF v = NIL THEN
  6474. temporaries.AddVariable(variable);
  6475. IF ~register THEN
  6476. IF scope.lastVariable # NIL THEN
  6477. offset := scope.lastVariable.offsetInBits;
  6478. ELSE
  6479. offset := 0;
  6480. END;
  6481. DEC(offset,system.SizeOf(variable.type));
  6482. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6483. variable(SyntaxTree.Variable).SetOffset(offset);
  6484. scope.AddVariable(variable(SyntaxTree.Variable));
  6485. scope.EnterSymbol(variable, duplicate);
  6486. ASSERT(~duplicate);
  6487. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6488. ELSE
  6489. variable.SetUseRegister(TRUE);
  6490. variable(SyntaxTree.Variable).SetOffset(0);
  6491. END;
  6492. ELSE (* v # NIL *)
  6493. (* reuse slot for new variable, do not create new slot ! *)
  6494. temporaries.SetVariable(index, variable);
  6495. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6496. ASSERT(~register);
  6497. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6498. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6499. scope.EnterSymbol(variable, duplicate);
  6500. ASSERT(~duplicate);
  6501. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6502. END;
  6503. RETURN variable(SyntaxTree.Variable)
  6504. END GetTemporaryVariable;
  6505. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6506. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6507. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6508. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6509. i: LONGINT; duplicate: BOOLEAN;
  6510. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6511. VAR variable: SyntaxTree.Variable;
  6512. BEGIN
  6513. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6514. variable.SetType(type);
  6515. recordScope.AddVariable(variable);
  6516. END AddVariable;
  6517. BEGIN
  6518. name := "@ArrayDescriptor";
  6519. Basic.AppendNumber(name,dimensions);
  6520. identifier := SyntaxTree.NewIdentifier(name);
  6521. parentScope := module.module.moduleScope;
  6522. symbol := parentScope.FindSymbol(identifier);
  6523. IF symbol # NIL THEN
  6524. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6525. type := typeDeclaration.declaredType;
  6526. ELSE
  6527. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6528. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6529. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6530. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6531. recordType.SetTypeDeclaration(typeDeclaration);
  6532. recordType.SetState(SyntaxTree.Resolved);
  6533. typeDeclaration.SetDeclaredType(recordType);
  6534. AddVariable("@ptr",system.anyType);
  6535. AddVariable("@adr",system.addressType);
  6536. AddVariable("@flags",system.addressType);
  6537. AddVariable("@dim",system.addressType);
  6538. AddVariable("@elementSize",system.addressType);
  6539. FOR i := 0 TO dimensions-1 DO
  6540. name := "@len";
  6541. Basic.AppendNumber(name,i);
  6542. AddVariable(name,system.addressType);
  6543. name := "@incr";
  6544. Basic.AppendNumber(name,i);
  6545. AddVariable(name,system.addressType);
  6546. END;
  6547. parentScope.AddTypeDeclaration(typeDeclaration);
  6548. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6549. ASSERT(~duplicate);
  6550. type := recordType;
  6551. END;
  6552. RETURN type
  6553. END GetMathArrayDescriptorType;
  6554. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6555. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6556. BEGIN
  6557. type := GetMathArrayDescriptorType(dimensions);
  6558. Emit(Push(position,op.op));
  6559. (* push type descriptor *)
  6560. reg := TypeDescriptorAdr(type);
  6561. Emit(Push(position,reg));
  6562. ReleaseIntermediateOperand(reg);
  6563. (* push realtime flag: false by default *)
  6564. Emit(Push(position,false));
  6565. CallThis(position,"Heaps","NewRec",3);
  6566. END NewMathArrayDescriptor;
  6567. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6568. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6569. BEGIN
  6570. NEW(string, LEN(s)); COPY(s, string^);
  6571. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6572. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6573. sv.SetType(type);
  6574. Designate(sv,res);
  6575. Emit(Push(position,res.tag));
  6576. Emit(Push(position,res.op));
  6577. ReleaseOperand(res);
  6578. END PushConstString;
  6579. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6580. BEGIN
  6581. IF b THEN
  6582. Emit(Push(Basic.invalidPosition, true));
  6583. ELSE
  6584. Emit(Push(Basic.invalidPosition, false));
  6585. END;
  6586. END PushConstBoolean;
  6587. PROCEDURE PushConstSet(v: SET);
  6588. VAR value: SyntaxTree.Value; op: Operand;
  6589. BEGIN
  6590. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6591. value.SetType(system.setType);
  6592. Evaluate(value, op);
  6593. Emit(Push(Basic.invalidPosition, op.op));
  6594. ReleaseOperand(op);
  6595. END PushConstSet;
  6596. PROCEDURE PushConstInteger(v: LONGINT);
  6597. VAR value: SyntaxTree.Value; op: Operand;
  6598. BEGIN
  6599. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6600. value.SetType(system.longintType);
  6601. Evaluate(value, op);
  6602. Emit(Push(Basic.invalidPosition, op.op));
  6603. ReleaseOperand(op);
  6604. END PushConstInteger;
  6605. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6606. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6607. section: IntermediateCode.Section;
  6608. BEGIN
  6609. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6610. Global.GetSymbolSegmentedName(symbol, name);
  6611. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6612. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6613. procedure.SetScope(moduleScope);
  6614. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6615. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6616. procedure.SetAccess(SyntaxTree.Hidden);
  6617. currentScope := procedureScope;
  6618. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6619. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6620. RETURN section;
  6621. END OpenInitializer;
  6622. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6623. BEGIN
  6624. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6625. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6626. section := prev;
  6627. END CloseInitializer;
  6628. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6629. VAR name: SyntaxTree.IdentifierString;
  6630. variable: SyntaxTree.Variable;
  6631. parameter: SyntaxTree.Parameter;
  6632. type: SyntaxTree.Type;
  6633. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6634. BEGIN
  6635. InitOperand(op,ModeReference);
  6636. op.op := fp;
  6637. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6638. Dereference(op, x, FALSE);
  6639. result := op;
  6640. Symbol(symbol, op);
  6641. END Field;
  6642. PROCEDURE Direction(direction: LONGINT): SET;
  6643. BEGIN
  6644. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6645. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6646. ELSE HALT(100);
  6647. END;
  6648. END Direction;
  6649. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6650. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6651. BEGIN
  6652. Field(port, op);
  6653. ToMemory(op.op,addressType,0);
  6654. Emit(Push(Basic.invalidPosition, op.op));
  6655. ReleaseOperand(op);
  6656. Basic.GetString(modifier.identifier, name);
  6657. PushConstString(name);
  6658. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6659. ASSERT(SemanticChecker.IsStringType(value.type));
  6660. Designate(value, op);
  6661. Emit(Push(modifier.position, op.tag));
  6662. Emit(Push(modifier.position, op.op));
  6663. ReleaseOperand(op);
  6664. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6665. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6666. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6667. Evaluate(value, op);
  6668. Emit(Push(modifier.position, op.op));
  6669. ReleaseOperand(op);
  6670. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6671. ELSE
  6672. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6673. END;
  6674. END AddPortProperty;
  6675. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6676. VAR modifier: SyntaxTree.Modifier;
  6677. BEGIN
  6678. modifier := parameter.modifiers;
  6679. WHILE modifier # NIL DO
  6680. AddPortProperty(parameter,modifier, modifier.expression);
  6681. modifier := modifier.nextModifier;
  6682. END;
  6683. END AddPortProperties;
  6684. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6685. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6686. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6687. PROCEDURE PushLens(type: SyntaxTree.Type);
  6688. BEGIN
  6689. IF IsSemiDynamicArray(type) THEN
  6690. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6691. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6692. Emit(Push(Basic.invalidPosition, op.op));
  6693. ReleaseOperand(op);
  6694. INC(dim);
  6695. ELSIF IsStaticArray(type) THEN
  6696. len := len * type(SyntaxTree.ArrayType).staticLength;
  6697. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6698. INC(dim);
  6699. ELSE
  6700. baseType := type;
  6701. END;
  6702. END PushLens;
  6703. BEGIN
  6704. (* cell *)
  6705. IF parameter.type IS SyntaxTree.ArrayType THEN
  6706. type := parameter.type;
  6707. dim := 0;
  6708. len := 1;
  6709. PushLens(type);
  6710. portType := baseType.resolved(SyntaxTree.PortType);
  6711. ELSE
  6712. portType := parameter.type(SyntaxTree.PortType);
  6713. END;
  6714. PushSelfPointer();
  6715. (* port / array of ports *)
  6716. IF IsStaticArray(type) THEN
  6717. PushConstInteger(len);
  6718. END;
  6719. Field(parameter, op);
  6720. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6721. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6722. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6723. Designate(d, op);*)
  6724. Emit(Push(Basic.invalidPosition, op.op));
  6725. ReleaseOperand(op);
  6726. (* name *)
  6727. PushConstString(name);
  6728. (* inout *)
  6729. PushConstSet(Direction(portType.direction));
  6730. (* width *)
  6731. PushConstInteger(portType.sizeInBits);
  6732. IF parameter.type IS SyntaxTree.PortType THEN
  6733. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6734. AddPortProperties(parameter);
  6735. ELSIF IsStaticArray(type)THEN
  6736. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6737. ELSIF IsSemiDynamicArray(type) THEN
  6738. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6739. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6740. Emit(Add(position,reg, sp, size));
  6741. (* dim *)
  6742. PushConstInteger(dim);
  6743. (* len array *)
  6744. Emit(Push(position, reg));
  6745. ReleaseIntermediateOperand(reg);
  6746. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6747. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6748. Emit(Add(position, sp,sp, size));
  6749. ELSE
  6750. HALT(100);
  6751. END;
  6752. END Parameter;
  6753. BEGIN
  6754. IF backend.cellsAreObjects THEN
  6755. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6756. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6757. END;
  6758. parameter := x.firstParameter;
  6759. WHILE (parameter # NIL) DO
  6760. type := parameter.type.resolved;
  6761. WHILE (type IS SyntaxTree.ArrayType) DO
  6762. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6763. END;
  6764. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6765. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6766. Parameter(name,parameter);
  6767. END;
  6768. parameter := parameter.nextParameter;
  6769. END;
  6770. ELSE HALT(200)
  6771. END;
  6772. END AddPorts;
  6773. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6774. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6775. BEGIN
  6776. Symbol(cell,op);
  6777. ToMemory(op.op,addressType,0);
  6778. Emit(Push(position,op.op));
  6779. ReleaseOperand(op);
  6780. property.GetName(name);
  6781. (* does not work when inheritance is used:
  6782. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6783. *)
  6784. PushConstString(name);
  6785. IF (value # NIL) THEN
  6786. ASSERT(
  6787. SemanticChecker.IsStringType(property.type)
  6788. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6789. OR (property.type.resolved IS SyntaxTree.FloatType)
  6790. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6791. OR (property.type.resolved IS SyntaxTree.SetType)
  6792. );
  6793. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6794. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6795. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6796. Designate(d, op);
  6797. IF SemanticChecker.IsStringType(property.type) THEN
  6798. Emit(Push(Basic.invalidPosition, op.tag))
  6799. END;
  6800. Emit(Push(Basic.invalidPosition, op.op));
  6801. ReleaseOperand(op);
  6802. END;
  6803. IF value = NIL THEN
  6804. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6805. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6806. ASSERT(SemanticChecker.IsStringType(value.type));
  6807. Designate(value, op);
  6808. PushString(op, value.type);
  6809. ReleaseOperand(op);
  6810. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6811. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6812. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6813. Evaluate(value, op);
  6814. Emit(Push(property.position, op.op));
  6815. ReleaseOperand(op);
  6816. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6817. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6818. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6819. Evaluate(value, op);
  6820. Emit(Push(property.position, op.op));
  6821. ReleaseOperand(op);
  6822. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6823. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6824. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6825. Evaluate(value, op);
  6826. Emit(Push(property.position, op.op));
  6827. ReleaseOperand(op);
  6828. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6829. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6830. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6831. Evaluate(value, op);
  6832. Emit(Push(property.position, op.op));
  6833. ReleaseOperand(op);
  6834. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6835. ELSE
  6836. HALT(200);
  6837. END;
  6838. END AddProperty;
  6839. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6840. VAR symbol: SyntaxTree.Symbol;
  6841. BEGIN
  6842. WHILE modifier # NIL DO
  6843. symbol := cellType.FindProperty(modifier.identifier);
  6844. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6845. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6846. modifier := modifier.nextModifier;
  6847. END;
  6848. END AddModifiers;
  6849. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6850. VAR last: SyntaxTree.Modifier;
  6851. BEGIN
  6852. IF to = NIL THEN
  6853. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6854. ELSE
  6855. last := to;
  6856. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6857. last := last.nextModifier;
  6858. END;
  6859. IF last.identifier # this.identifier THEN
  6860. ASSERT(last.nextModifier = NIL);
  6861. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6862. END;
  6863. END;
  6864. END AppendModifier;
  6865. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6866. BEGIN
  6867. WHILE this # NIL DO
  6868. AppendModifier(to, this);
  6869. this := this.nextModifier;
  6870. END;
  6871. END AppendModifiers;
  6872. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6873. VAR base: SyntaxTree.Type;
  6874. BEGIN
  6875. AppendModifiers(to, c.modifiers);
  6876. base := c.GetBaseValueType();
  6877. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6878. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6879. END;
  6880. END AppendCellTypeModifiers;
  6881. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6882. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6883. BEGIN
  6884. Basic.GetString(modifier.identifier, name);
  6885. PushConstString(name);
  6886. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6887. ASSERT(SemanticChecker.IsStringType(value.type));
  6888. Designate(value, op);
  6889. PushString(op, value.type);
  6890. ReleaseOperand(op);
  6891. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6892. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6893. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6894. Evaluate(value, op);
  6895. Emit(Push(modifier.position, op.op));
  6896. ReleaseOperand(op);
  6897. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6898. ELSE
  6899. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6900. END;
  6901. END AddPortProperty;
  6902. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6903. BEGIN
  6904. WHILE modifier # NIL DO
  6905. AddPortProperty(modifier, modifier.expression);
  6906. modifier := modifier.nextModifier;
  6907. END;
  6908. END AddPortProperties;
  6909. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6910. VAR op: Operand;
  6911. BEGIN
  6912. Evaluate(p, op);
  6913. Emit(Push(p.position, op.op));
  6914. ReleaseOperand(op);
  6915. IF p IS SyntaxTree.Designator THEN
  6916. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6917. END;
  6918. END PushPort;
  6919. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6920. VAR tmp: IntermediateCode.Operand;
  6921. BEGIN
  6922. actualType := actualType.resolved;
  6923. IF actualType IS SyntaxTree.StringType THEN
  6924. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6925. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6926. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6927. ELSE
  6928. tmp := op.tag;
  6929. IntermediateCode.MakeMemory(tmp,addressType);
  6930. Emit(Push(position,tmp));
  6931. END;
  6932. Emit(Push(position,op.op))
  6933. END PushString;
  6934. (* conservative check if x is potentially on the heap, excluding the module heap
  6935. required for generational garbage collector
  6936. *)
  6937. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6938. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6939. BEGIN
  6940. RETURN TRUE;
  6941. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6942. passed by reference.
  6943. pos := x.position.start;
  6944. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6945. x := x(SyntaxTree.Designator).left;
  6946. END;
  6947. RETURN x # NIL;
  6948. *)
  6949. END OnHeap;
  6950. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  6951. VAR
  6952. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6953. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6954. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6955. tmp:IntermediateCode.Operand;
  6956. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6957. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6958. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6959. dest: IntermediateCode.Operand;
  6960. staticLength: LONGINT; itype: IntermediateCode.Type;
  6961. convert,isTensor: BOOLEAN;
  6962. recordType: SyntaxTree.RecordType;
  6963. baseType: SyntaxTree.Type;
  6964. flags: SET;
  6965. left: SyntaxTree.Expression;
  6966. call: SyntaxTree.Designator;
  6967. procedure: SyntaxTree.Procedure;
  6968. temporaryVariable: SyntaxTree.Variable;
  6969. dummy: IntermediateCode.Operand;
  6970. customBuiltin: SyntaxTree.CustomBuiltin;
  6971. isVarPar: ARRAY 3 OF BOOLEAN;
  6972. callsection: Sections.Section;
  6973. segmentedName: Basic.SegmentedName;
  6974. needsTrace: BOOLEAN;
  6975. n: ARRAY 256 OF CHAR;
  6976. modifier: SyntaxTree.Modifier;
  6977. previous, init: IntermediateCode.Section;
  6978. prevScope: SyntaxTree.Scope;
  6979. firstPar: LONGINT;
  6980. saved: RegisterEntry;
  6981. callingConvention: SyntaxTree.CallingConvention;
  6982. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  6983. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  6984. priority: IntermediateCode.Operand;
  6985. op,callop: Operand;
  6986. BEGIN
  6987. IF type = NIL THEN RETURN END;
  6988. type := type.resolved;
  6989. IF type IS SyntaxTree.PointerType THEN
  6990. type := type(SyntaxTree.PointerType).pointerBase.resolved
  6991. END;
  6992. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  6993. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  6994. recordScope := type(SyntaxTree.RecordType).recordScope;
  6995. IF recordScope.bodyProcedure # NIL THEN
  6996. procedure := recordScope.bodyProcedure;
  6997. body := procedure.procedureScope.body;
  6998. Emit(Push(position,self));
  6999. IF body.isActive THEN
  7000. StaticCallOperand(callop,procedure);
  7001. Emit(Push(position,callop.op));
  7002. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7003. Convert(priority,sizeType);
  7004. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7005. END;
  7006. Emit(Push(position,priority));
  7007. ReleaseIntermediateOperand(priority);
  7008. IF backend.cooperative THEN
  7009. Emit(Push(position,self));
  7010. CallThis(position,"Activities","Create",3)
  7011. ELSE
  7012. flags := 0;
  7013. IF body.isSafe THEN
  7014. flags := 1;
  7015. END;
  7016. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7017. Emit(Push(position,self));
  7018. CallThis(position,"Objects","CreateProcess",4)
  7019. END;
  7020. ELSE
  7021. Emit(Push(position,self));
  7022. StaticCallOperand(callop,procedure);
  7023. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7024. END;
  7025. Emit(Pop(position,self));
  7026. END;
  7027. END CallBodies;
  7028. PROCEDURE PushTD(type: SyntaxTree.Type);
  7029. VAR op: IntermediateCode.Operand;
  7030. BEGIN
  7031. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7032. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7033. ELSE
  7034. IF type.resolved IS SyntaxTree.PointerType THEN
  7035. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7036. END;
  7037. op := TypeDescriptorAdr(type.resolved);
  7038. Emit(Push(position,op));
  7039. END
  7040. END PushTD;
  7041. BEGIN
  7042. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7043. dest := destination; destination := emptyOperand;
  7044. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7045. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7046. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7047. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7048. CASE x.id OF
  7049. (* ---- COPY ----- *)
  7050. |Global.Copy:
  7051. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7052. (* ---- EXCL, INCL----- *)
  7053. |Global.Excl,Global.Incl:
  7054. Evaluate(p0,s0);
  7055. Evaluate(p1,s1);
  7056. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7057. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7058. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7059. END;
  7060. ReuseCopy(res,s0.op);
  7061. ReleaseOperand(s0);
  7062. Reuse1(tmp,s1.op);
  7063. ReleaseOperand(s1);
  7064. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7065. IF x.id = Global.Excl THEN
  7066. Emit(Not(position,tmp,tmp));
  7067. Emit(And(position,res,res,tmp));
  7068. ELSE
  7069. Emit(Or(position,res,res,tmp));
  7070. END;
  7071. ReleaseIntermediateOperand(tmp);
  7072. Designate(p0,s0);
  7073. ToMemory(s0.op,s1.op.type,0);
  7074. Emit(Mov(position,s0.op,res));
  7075. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7076. (* ---- DISPOSE ----- *)
  7077. |Global.Dispose:
  7078. Designate(p0,s0);
  7079. Emit(Push(position,s0.op));
  7080. ReleaseOperand(s0);
  7081. CallThis(position,"Runtime","Dispose", 1);
  7082. (* ---- GETPROCEDURE ----- *)
  7083. |Global.GetProcedure:
  7084. Designate(p0,s0);
  7085. PushString(s0,p0.type);
  7086. Designate(p1,s1);
  7087. PushString(s1,p1.type);
  7088. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7089. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7090. ELSE PushTD(procedureType.firstParameter.type)
  7091. END;
  7092. PushTD(procedureType.returnType);
  7093. Designate(p2,s2);
  7094. Emit(Push(position,s2.op));
  7095. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7096. CallThis(position,"Modules","GetProcedure", 7);
  7097. (* ---- ASH, LSH, ROT ----- *)
  7098. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7099. Evaluate(p0,s0);
  7100. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7101. (* make unsigned arguments in order to produced a logical shift *)
  7102. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7103. convert:= TRUE;
  7104. itype := s0.op.type;
  7105. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7106. Convert(s0.op,itype);
  7107. ELSE
  7108. convert := FALSE;
  7109. END;
  7110. END;
  7111. Evaluate(p1,s1);
  7112. IF IsIntegerConstant(p1,hint) THEN
  7113. ReuseCopy(reg,s0.op);
  7114. IF hint > 0 THEN
  7115. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7116. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7117. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7118. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7119. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7120. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7121. END;
  7122. ELSIF hint < 0 THEN
  7123. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7124. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7125. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7126. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7127. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7128. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7129. END;
  7130. END;
  7131. ReleaseOperand(s0); ReleaseOperand(s1);
  7132. ELSE
  7133. exit := NewLabel();
  7134. end := NewLabel();
  7135. ReuseCopy(reg,s0.op);
  7136. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7137. Reuse1(tmp,s1.op);
  7138. Emit(Neg(position,tmp,s1.op));
  7139. Convert(tmp,s1.op.type);
  7140. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7141. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7142. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7143. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7144. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7145. END;
  7146. ReleaseIntermediateOperand(tmp);
  7147. BrL(end);
  7148. SetLabel(exit);
  7149. ReuseCopy(tmp,s1.op);
  7150. Convert(tmp,s1.op.type);
  7151. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7152. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7153. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7154. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7155. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7156. END;
  7157. ReleaseIntermediateOperand(tmp);
  7158. SetLabel(end);
  7159. ReleaseOperand(s0); ReleaseOperand(s1);
  7160. END;
  7161. InitOperand(result,ModeValue);
  7162. IF convert THEN
  7163. itype := reg.type;
  7164. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7165. Convert(reg,itype);
  7166. END;
  7167. result.op := reg;
  7168. (* ---- CAP ----- *)
  7169. |Global.Cap:
  7170. Evaluate(p0,result);
  7171. ReuseCopy(reg,result.op);
  7172. ReleaseIntermediateOperand(result.op);
  7173. ignore := NewLabel();
  7174. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7175. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7176. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7177. SetLabel(ignore);
  7178. result.op := reg;
  7179. (* ---- CHR ----- *)
  7180. |Global.Chr, Global.Chr32:
  7181. Evaluate(p0,result);
  7182. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7183. |Global.Entier, Global.EntierH:
  7184. Evaluate(p0,result);
  7185. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7186. (* ---- MIN and MAX ----- *)
  7187. |Global.Max,Global.Min:
  7188. Evaluate(p0,s0);
  7189. Evaluate(p1,s1);
  7190. Reuse2(res,s0.op,s1.op);
  7191. else := NewLabel();
  7192. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7193. ELSE BrltL(else,s1.op,s0.op) END;
  7194. Emit(Mov(position,res,s0.op));
  7195. ReleaseOperand(s0);
  7196. end := NewLabel();
  7197. BrL(end);
  7198. SetLabel(else);
  7199. Emit(MovReplace(position,res,s1.op));
  7200. SetLabel(end);
  7201. ReleaseOperand(s1);
  7202. InitOperand(result,ModeValue);
  7203. result.op := res;
  7204. (* ---- ODD ----- *)
  7205. |Global.Odd:
  7206. IF ~conditional THEN
  7207. ConditionToValue(x)
  7208. ELSE
  7209. Evaluate(p0,result);
  7210. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7211. Reuse1(res,result.op);
  7212. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7213. ReleaseIntermediateOperand(result.op);
  7214. result.op := res;
  7215. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7216. ReleaseOperand(result);
  7217. BrL(falseLabel);
  7218. END;
  7219. (* ---- ORD ----- *)
  7220. |Global.Ord, Global.Ord32:
  7221. Evaluate(p0,result);
  7222. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7223. (* ---- SHORT, LONG ----- *)
  7224. |Global.Short, Global.Long:
  7225. Evaluate(p0,result);
  7226. IF x.type IS SyntaxTree.ComplexType THEN
  7227. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7228. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7229. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7230. ELSE
  7231. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7232. END
  7233. (* ---- HALT, SYSTEM.HALT----- *)
  7234. |Global.Halt, Global.systemHalt:
  7235. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7236. EmitTrap (position, val);
  7237. (* ---- ASSERT ----- *)
  7238. |Global.Assert:
  7239. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7240. trueL := NewLabel();
  7241. falseL := NewLabel();
  7242. Condition(p0,trueL,falseL);
  7243. IF p1 = NIL THEN val := AssertTrap
  7244. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7245. END;
  7246. SetLabel(falseL);
  7247. EmitTrap(position,val);
  7248. SetLabel(trueL);
  7249. END;
  7250. (*
  7251. Emit(TrapC(result.op,val);
  7252. *)
  7253. (* ---- INC, DEC----- *)
  7254. |Global.Inc,Global.Dec:
  7255. Expression(p0); adr := result.op;
  7256. LoadValue(result,p0.type); l := result;
  7257. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7258. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7259. END;
  7260. IF x.id = Global.Inc THEN
  7261. Emit(Add(position,l.op,l.op,r.op));
  7262. ELSE
  7263. Emit(Sub(position,l.op,l.op,r.op));
  7264. END;
  7265. ReleaseOperand(l); ReleaseOperand(r);
  7266. (* ---- LEN ----- *)
  7267. |Global.Len: (* dynamic length, static length done by checker *)
  7268. Designate(p0,operand);
  7269. IF p1 = NIL THEN
  7270. InitOperand(l,ModeValue);
  7271. l.op := IntermediateCode.Immediate(sizeType,0);
  7272. ELSE
  7273. Evaluate(p1,l);
  7274. END;
  7275. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7276. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7277. Dereference(operand, p0.type.resolved, FALSE);
  7278. END;
  7279. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7280. ReleaseOperand(operand); ReleaseOperand(l);
  7281. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7282. ASSERT(p1 # NIL);
  7283. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7284. Dereference(operand,p0.type.resolved,FALSE);
  7285. END;
  7286. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7287. ReleaseOperand(operand); ReleaseOperand(l);
  7288. ELSE HALT(100);
  7289. END;
  7290. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7291. (* ---- FIRST ---- *)
  7292. |Global.First:
  7293. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7294. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7295. ELSE
  7296. Designate(p0, result)
  7297. END
  7298. (* ---- LAST ---- *)
  7299. |Global.Last:
  7300. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7301. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7302. ELSE
  7303. Designate(p0, result);
  7304. (* make sure result.op is a register *)
  7305. tmp := result.op;
  7306. ReuseCopy(result.op, result.op);
  7307. ReleaseIntermediateOperand(tmp);
  7308. (* add offset to result.op *)
  7309. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7310. END
  7311. (* ---- STEP ---- *)
  7312. |Global.Step:
  7313. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7314. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7315. ELSE
  7316. Designate(p0, result);
  7317. (* make sure result.op is a register *)
  7318. tmp := result.op;
  7319. ReuseCopy(result.op, result.op);
  7320. ReleaseIntermediateOperand(tmp);
  7321. (* add offset to result.op *)
  7322. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7323. END
  7324. (* ---- RE ---- *)
  7325. |Global.Re:
  7326. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7327. Designate(p0, result)
  7328. ELSE
  7329. Evaluate(p0, result)
  7330. END
  7331. (* ---- IM ---- *)
  7332. |Global.Im:
  7333. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7334. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7335. Designate(p0, result);
  7336. (* make sure result.op is a register *)
  7337. tmp := result.op;
  7338. ReuseCopy(result.op, result.op);
  7339. ReleaseIntermediateOperand(tmp);
  7340. (* add offset to result.op *)
  7341. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7342. (* ---- ABS ----- *)
  7343. |Global.Abs:
  7344. Evaluate(p0,operand);
  7345. type := p0.type.resolved;
  7346. InitOperand(result,ModeValue);
  7347. Reuse1a(result.op,operand.op,dest);
  7348. Emit(Abs(position,result.op,operand.op));
  7349. ReleaseOperand(operand);
  7350. (* ---- WAIT ----- *)
  7351. |Global.Wait:
  7352. Evaluate(p0,operand);
  7353. Emit(Push(position,operand.op));
  7354. ReleaseOperand(operand);
  7355. CallThis(position,"Activities","Wait", 1);
  7356. (* ---- NEW ----- *)
  7357. |Global.New:
  7358. (*! the following code is only correct for "standard" Oberon calling convention *)
  7359. IF x.type # NIL THEN
  7360. type := x.type.resolved;
  7361. firstPar := 0;
  7362. ELSE
  7363. type := p0.type.resolved;
  7364. firstPar := 1;
  7365. END;
  7366. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7367. THEN
  7368. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7369. IF backend.cooperative THEN
  7370. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7371. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7372. IF recordType.isObject THEN
  7373. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7374. IF recordType.IsActive() THEN
  7375. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7376. END;
  7377. IF recordType.IsProtected() THEN
  7378. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7379. END;
  7380. ELSE
  7381. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7382. END;
  7383. END;
  7384. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7385. CallThis(position,"Runtime","New", 1);
  7386. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7387. Emit(Result(position, pointer));
  7388. exit := NewLabel();
  7389. BreqL(exit,pointer,nil);
  7390. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7391. GetRecordTypeName (recordType,name);
  7392. IF ~recordType.isObject THEN
  7393. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7394. END;
  7395. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7396. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7397. IF recordType.isObject THEN
  7398. IF recordType.IsProtected() THEN
  7399. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7400. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7401. END;
  7402. IF recordType.IsActive() THEN
  7403. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7404. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7405. END;
  7406. END;
  7407. END;
  7408. (* initialize fields *)
  7409. IF type(SyntaxTree.PointerType).isPlain THEN
  7410. size := 0;
  7411. ELSIF recordType.isObject THEN
  7412. size := BaseObjectTypeSize;
  7413. ELSE
  7414. size := BaseRecordTypeSize;
  7415. END;
  7416. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7417. (* call initializer *)
  7418. constructor := GetConstructor(recordType);
  7419. IF constructor # NIL THEN
  7420. (*! should be unified with ProcedureCallDesignator *)
  7421. Emit(Push(position,pointer));
  7422. ReleaseIntermediateOperand(pointer);
  7423. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7424. FOR i := firstPar TO x.parameters.Length()-1 DO
  7425. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7426. formalParameter := formalParameter.nextParameter;
  7427. END;
  7428. (* static call of the constructor *)
  7429. GetCodeSectionNameForSymbol(constructor,name);
  7430. ASSERT(~constructor.isInline);
  7431. IF constructor.scope.ownerModule # module.module THEN
  7432. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7433. ELSE
  7434. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7435. END;
  7436. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7437. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7438. Emit(Pop(position,pointer));
  7439. END;
  7440. (* call bodies *)
  7441. CallBodies(pointer,type);
  7442. SetLabel(exit);
  7443. needsTrace := p0.NeedsTrace();
  7444. IF needsTrace THEN ModifyAssignments(true) END;
  7445. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7446. Emit(Push(position, pointer));
  7447. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7448. Emit(Pop(position, pointer));
  7449. END;
  7450. Designate(p0,l);
  7451. IF needsTrace THEN
  7452. CallAssignPointer(l.op, pointer);
  7453. ELSE
  7454. ToMemory(l.op,addressType,0);
  7455. Emit(Mov(position,l.op,pointer));
  7456. END;
  7457. ReleaseIntermediateOperand(pointer);
  7458. ReleaseOperand(l);
  7459. IF needsTrace THEN ModifyAssignments(false) END;
  7460. ELSE (* not cooperative backend *)
  7461. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7462. IF temporaryVariable # NIL THEN
  7463. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7464. ELSE
  7465. Designate(p0,l);
  7466. END;
  7467. (* l.op contains address of pointer to record *)
  7468. Emit(Push(position,l.op)); (* address for use after syscall *)
  7469. Emit(Push(position,l.op));
  7470. ReleaseOperand(l);
  7471. (* push type descriptor *)
  7472. reg := TypeDescriptorAdr(recordType);
  7473. Emit(Push(position,reg));
  7474. ReleaseIntermediateOperand(reg);
  7475. (* push realtime flag *)
  7476. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7477. ELSE Emit(Push(position,false));
  7478. END;
  7479. CallThis(position,"Heaps","NewRec", 3);
  7480. (* check allocation success, if not successful then do not call initializers and bodies *)
  7481. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7482. Emit(Pop(position,pointer));
  7483. MakeMemory(reg,pointer,addressType,0);
  7484. ReleaseIntermediateOperand(pointer);
  7485. pointer := reg;
  7486. exit := NewLabel();
  7487. BreqL(exit,pointer,nil);
  7488. Emit(Push(position,pointer));
  7489. (* initialize fields *)
  7490. InitFields(recordType, pointer,0);
  7491. (* call initializer *)
  7492. constructor := GetConstructor(recordType);
  7493. IF constructor # NIL THEN
  7494. (*! should be unified with ProcedureCallDesignator *)
  7495. Emit(Push(position,pointer));
  7496. ReleaseIntermediateOperand(pointer);
  7497. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7498. FOR i := firstPar TO x.parameters.Length()-1 DO
  7499. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7500. formalParameter := formalParameter.nextParameter;
  7501. END;
  7502. (* static call of the constructor *)
  7503. GetCodeSectionNameForSymbol(constructor,name);
  7504. ASSERT(~constructor.isInline);
  7505. IF constructor.scope.ownerModule # module.module THEN
  7506. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7507. ELSE
  7508. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7509. END;
  7510. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7511. ELSE
  7512. ReleaseIntermediateOperand(pointer);
  7513. END;
  7514. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7515. Emit(Pop(position,pointer));
  7516. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7517. Designate(p0,l);
  7518. IF backend.writeBarriers & OnHeap(p0) THEN
  7519. SaveRegisters();ReleaseUsedRegisters(saved);
  7520. Emit(Push(position,l.op));
  7521. Emit(Push(position,pointer));
  7522. CallThis(position,"Heaps","Assign",2);
  7523. RestoreRegisters(saved);
  7524. ELSE
  7525. ToMemory(l.op,addressType,0);
  7526. Emit(Mov(position,l.op,pointer));
  7527. END;
  7528. ReleaseOperand(l);
  7529. result.tag := emptyOperand;
  7530. ELSIF (x.type # NIL) THEN
  7531. result := l; (* temporary variable is the result of NEW Type() *)
  7532. END;
  7533. (* call bodies *)
  7534. CallBodies(pointer,type);
  7535. ReleaseIntermediateOperand(pointer);
  7536. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7537. end := NewLabel();
  7538. BrL(end);
  7539. SetLabel(exit);
  7540. Designate(p0,l);
  7541. ToMemory(l.op,addressType,0);
  7542. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7543. ReleaseOperand(l);
  7544. SetLabel(end);
  7545. ELSE
  7546. SetLabel(exit);
  7547. END;
  7548. END;
  7549. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7550. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7551. IF ~backend.cooperative THEN (* simpler version *)
  7552. (*
  7553. push len0
  7554. push len1
  7555. push len2
  7556. push len_size
  7557. push len_adr
  7558. push tag
  7559. push static elements
  7560. push element size
  7561. push adr
  7562. *)
  7563. dim := 0;
  7564. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7565. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7566. parameter := x.parameters.GetExpression(i);
  7567. Evaluate(parameter,r);
  7568. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7569. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7570. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7571. END;
  7572. Emit(Push(position,r.op));
  7573. ReleaseOperand(r);
  7574. INC(dim);
  7575. END;
  7576. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7577. Emit(Mov(position, adr, sp));
  7578. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7579. Emit(Push(position, adr));
  7580. ReleaseIntermediateOperand(adr);
  7581. openDim := dim;
  7582. staticLength := 1;
  7583. IF type IS SyntaxTree.ArrayType THEN
  7584. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7585. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7586. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7587. END;
  7588. END;
  7589. IF SemanticChecker.ContainsPointer(type) THEN
  7590. tmp := TypeDescriptorAdr(type);
  7591. ELSE
  7592. tmp := nil;
  7593. END;
  7594. Emit(Push(position,tmp)); (* type descriptor *)
  7595. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7596. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7597. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7598. Designate(p0,l);
  7599. Emit(Push(position,l.op)); (* address *)
  7600. ReleaseOperand(l);
  7601. CallThis(position,"Heaps","NewArray", 6);
  7602. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7603. Emit(Add(position,sp,sp,tmp));
  7604. ELSE
  7605. dim := 0;
  7606. IntermediateCode.InitOperand(reg);
  7607. IF p1 # NIL THEN
  7608. FOR i := firstPar TO x.parameters.Length()-1 DO
  7609. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7610. parameter := x.parameters.GetExpression(i);
  7611. Evaluate(parameter,r);
  7612. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7613. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7614. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7615. END;
  7616. Emit(Push(position,r.op));
  7617. IF i=1 THEN
  7618. CopyInt(reg,r.op);
  7619. ELSE
  7620. MulInt(reg, reg, r.op);
  7621. END;
  7622. ReleaseOperand(r);
  7623. INC(dim);
  7624. END;
  7625. Convert(reg,addressType);
  7626. ELSE
  7627. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7628. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7629. END;
  7630. openDim := dim;
  7631. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7632. IF backend.cooperative THEN
  7633. size := ToMemoryUnits(system,system.SizeOf(type));
  7634. WHILE type IS SyntaxTree.ArrayType DO
  7635. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7636. END;
  7637. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7638. IF (size # 1) THEN
  7639. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7640. END;
  7641. Emit(Push(position,reg));
  7642. size := ToMemoryUnits(system,system.SizeOf(type));
  7643. IF (size # 1) THEN
  7644. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7645. END;
  7646. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7647. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7648. Emit(Push(position,reg));
  7649. ReleaseIntermediateOperand(reg);
  7650. CallThis(position,"Runtime","New", 1);
  7651. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7652. Emit(Result(position, pointer));
  7653. exit := NewLabel();
  7654. else := NewLabel();
  7655. BreqL(else,pointer,nil);
  7656. IF ~type.hasPointers THEN
  7657. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7658. ELSIF type IS SyntaxTree.RecordType THEN
  7659. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7660. ELSIF type IS SyntaxTree.ProcedureType THEN
  7661. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7662. ELSE
  7663. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7664. END;
  7665. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7666. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7667. 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))));
  7668. IF type IS SyntaxTree.RecordType THEN
  7669. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7670. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7671. ELSE
  7672. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7673. END;
  7674. i := openDim;
  7675. WHILE i > 0 DO
  7676. DEC (i);
  7677. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7678. END;
  7679. needsTrace := p0.NeedsTrace();
  7680. IF needsTrace THEN ModifyAssignments(true) END;
  7681. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7682. Emit(Push(position, pointer));
  7683. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7684. Emit(Pop(position, pointer));
  7685. END;
  7686. Designate(p0,l);
  7687. IF needsTrace THEN
  7688. CallAssignPointer(l.op, pointer);
  7689. ModifyAssignments(false);
  7690. ELSE
  7691. ToMemory(l.op,addressType,0);
  7692. Emit(Mov(position,l.op,pointer));
  7693. END;
  7694. ReleaseIntermediateOperand(pointer);
  7695. ReleaseOperand(l);
  7696. BrL(exit);
  7697. SetLabel(else);
  7698. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7699. Designate(p0,l);
  7700. IF needsTrace THEN
  7701. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7702. ELSE
  7703. ToMemory(l.op,addressType,0);
  7704. Emit(Mov(position,l.op,pointer));
  7705. END;
  7706. ReleaseOperand(l);
  7707. SetLabel(exit);
  7708. ELSE
  7709. (*! the following code is only correct for "standard" Oberon calling convention *)
  7710. IF SemanticChecker.ContainsPointer(type) THEN
  7711. IF type IS SyntaxTree.ArrayType THEN
  7712. staticLength := 1;
  7713. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7714. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7715. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7716. END;
  7717. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7718. MulInt(reg,reg,tmp);
  7719. END;
  7720. Designate(p0,l);
  7721. IF openDim > 0 THEN
  7722. Emit(Push(position,l.op)); (* address for use after syscall *)
  7723. END;
  7724. Emit(Push(position,l.op)); (* address *)
  7725. ReleaseOperand(l);
  7726. tmp := TypeDescriptorAdr(type);
  7727. Emit(Push(position,tmp)); (* type descriptor *)
  7728. ReleaseIntermediateOperand(tmp);
  7729. Emit(Push(position,reg)); (* number Elements *)
  7730. ReleaseIntermediateOperand(reg);
  7731. tmp := IntermediateCode.Immediate(addressType,dim);
  7732. Emit(Push(position,tmp)); (* dimensions *)
  7733. (* push realtime flag *)
  7734. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7735. ELSE Emit(Push(position,false));
  7736. END;
  7737. CallThis(position,"Heaps","NewArr",5)
  7738. ELSE
  7739. size := ToMemoryUnits(system,system.SizeOf(type));
  7740. IF (size # 1) THEN
  7741. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7742. (*
  7743. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7744. *)
  7745. END;
  7746. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7747. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7748. AddInt(reg, reg, tmp);
  7749. (*
  7750. Emit(Add(position,reg,reg,tmp));
  7751. *)
  7752. Designate(p0,l);
  7753. IF openDim >0 THEN
  7754. Emit(Push(position,l.op)); (* address for use after syscall *)
  7755. END;
  7756. Emit(Push(position,l.op)); (* address for syscall *)
  7757. ReleaseOperand(l); (* pointer address *)
  7758. Emit(Push(position,reg)); (* size *)
  7759. ReleaseIntermediateOperand(reg);
  7760. (* push realtime flag *)
  7761. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7762. ELSE Emit(Push(position,false));
  7763. END;
  7764. CallThis(position,"Heaps","NewSys", 3)
  7765. END;
  7766. IF openDim > 0 THEN
  7767. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7768. Emit(Pop(position,adr));
  7769. ToMemory(adr,addressType,0);
  7770. ReuseCopy(tmp,adr);
  7771. ReleaseIntermediateOperand(adr);
  7772. adr := tmp;
  7773. else := NewLabel();
  7774. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7775. i := openDim-1;
  7776. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7777. WHILE (i >= 0) DO
  7778. Emit(Pop(position,reg));
  7779. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7780. Emit(Mov(position,res,reg));
  7781. DEC(i);
  7782. END;
  7783. ReleaseIntermediateOperand(adr);
  7784. ReleaseIntermediateOperand(reg);
  7785. exit := NewLabel();
  7786. BrL(exit);
  7787. SetLabel(else);
  7788. (* else part: array could not be allocated *)
  7789. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7790. Emit(Add(position,sp,sp,tmp));
  7791. SetLabel(exit);
  7792. END;
  7793. END;
  7794. END;
  7795. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7796. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7797. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7798. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7799. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7800. callingConvention := procedureType.callingConvention;
  7801. left.SetType(procedure.type);
  7802. formalParameter := procedureType.firstParameter;
  7803. (* push array to allocate *)
  7804. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  7805. formalParameter :=formalParameter.nextParameter;
  7806. (* push length array *)
  7807. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  7808. (* push size *)
  7809. type := t0;
  7810. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7811. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7812. END;
  7813. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7814. Emit(Push(position,tmp));
  7815. (* *)
  7816. IF SemanticChecker.ContainsPointer(type) THEN
  7817. tmp := TypeDescriptorAdr(type);
  7818. ELSE
  7819. tmp := IntermediateCode.Immediate(addressType, 0);
  7820. END;
  7821. Emit(Push(position,tmp)); (* type descriptor *)
  7822. StaticCallOperand(result,procedure);
  7823. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7824. ReleaseOperand(result);
  7825. END;
  7826. (*
  7827. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7828. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7829. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7830. *)
  7831. ELSE
  7832. (*
  7833. push len0
  7834. push len1
  7835. push len2
  7836. push size
  7837. push len_adr
  7838. push element_size
  7839. push tag
  7840. push adr
  7841. *)
  7842. dim := 0;
  7843. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7844. isTensor := TRUE;
  7845. ELSE
  7846. isTensor := FALSE;
  7847. END;
  7848. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7849. IF ~isTensor THEN
  7850. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7851. END;
  7852. parameter := x.parameters.GetExpression(i);
  7853. Evaluate(parameter,r);
  7854. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7855. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7856. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7857. END;
  7858. Emit(Push(position,r.op));
  7859. ReleaseOperand(r);
  7860. INC(dim);
  7861. END;
  7862. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7863. Emit(Mov(position, adr, sp));
  7864. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7865. Emit(Push(position, adr));
  7866. ReleaseIntermediateOperand(adr);
  7867. openDim := dim;
  7868. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7869. IF isTensor THEN
  7870. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7871. ELSE
  7872. baseType := SemanticChecker.ArrayBase(type,openDim);
  7873. END;
  7874. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7875. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7876. IF SemanticChecker.ContainsPointer(baseType) THEN
  7877. tmp := TypeDescriptorAdr(baseType);
  7878. ELSE
  7879. tmp := nil;
  7880. END;
  7881. Emit(Push(position,tmp)); (* type descriptor *)
  7882. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7883. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7884. ELSE (* error message has already been emited *)
  7885. RETURN;
  7886. END;
  7887. Designate(p0,l);
  7888. IF isTensor THEN
  7889. Emit(Push(position,l.op)); (* address *)
  7890. ELSE
  7891. Emit(Push(position,l.tag)); (* address *)
  7892. END;
  7893. ReleaseOperand(l);
  7894. StaticCallOperand(result,procedure);
  7895. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7896. ReleaseOperand(result);
  7897. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7898. Emit(Add(position,sp,sp,tmp));
  7899. END;
  7900. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7901. THEN
  7902. IF ~backend.cellsAreObjects THEN RETURN END;
  7903. IF InCellScope(currentScope) THEN
  7904. PushSelfPointer()
  7905. ELSE
  7906. Emit(Push(position, nil));
  7907. END;
  7908. (* push temp address *)
  7909. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7910. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7911. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7912. (* l.op contains address of pointer to record *)
  7913. Emit(Push(position,l.op)); (* address for use after syscall *)
  7914. ReleaseOperand(l);
  7915. (* push type descriptor *)
  7916. reg := TypeDescriptorAdr(baseType);
  7917. Emit(Push(position,reg));
  7918. ReleaseIntermediateOperand(reg);
  7919. (* push name *)
  7920. (*Global.GetSymbolName(p0, n);*)
  7921. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7922. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7923. ELSE
  7924. Global.GetModuleName(module.module, n);
  7925. END;
  7926. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7927. (*type.typeDeclaration.GetName(n);*)
  7928. PushConstString(n);
  7929. (* push cellnet boolean *)
  7930. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7931. (* push engine boolean *)
  7932. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7933. (* allocate *)
  7934. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7935. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7936. (* l.op contains address of pointer to record *)
  7937. ToMemory(l.op,addressType,0);
  7938. (* l.op contains value of pointer to record *)
  7939. InitFields(baseType, l.op,0);
  7940. (* add capabilities *)
  7941. modifier := p0(SyntaxTree.Designator).modifiers;
  7942. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7943. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7944. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7945. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7946. END;
  7947. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7948. (*
  7949. modifier := baseType(SyntaxTree.CellType).modifiers;
  7950. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7951. modifier := p0(SyntaxTree.Designator).modifiers;
  7952. *)
  7953. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7954. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7955. (* l.op contains address of pointer to record *)
  7956. ToMemory(l.op,addressType,0);
  7957. (* l.op contains value of pointer to record *)
  7958. Emit(Push(position,l.op)); (* address for use after syscall *)
  7959. ReleaseOperand(l);
  7960. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7961. prevScope := currentScope;
  7962. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7963. previous := section;
  7964. section := init;
  7965. (* add ports *)
  7966. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7967. CloseInitializer(previous);
  7968. currentScope := prevScope;
  7969. Symbol(temporaryVariable,l);
  7970. ToMemory(l.op,addressType,0);
  7971. Emit(Push(position,l.op));
  7972. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  7973. (*
  7974. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  7975. IF constructor # NIL THEN
  7976. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7977. FOR i := 1 TO x.parameters.Length()-1 DO
  7978. p := x.parameters.GetExpression(i);
  7979. Global.GetSymbolName(parameter,name);
  7980. Evaluate(p, value);
  7981. ASSERT(value.type # NIL);
  7982. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  7983. par := instance.AddParameter(name);
  7984. par.SetInteger(value.integer);
  7985. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  7986. par := instance.AddParameter(name);
  7987. par.SetBoolean(value.boolean);
  7988. ELSE Error(x.position,NotYetImplemented)
  7989. END;
  7990. parameter := parameter.nextParameter
  7991. END;
  7992. END;
  7993. *)
  7994. (* call initializer *)
  7995. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  7996. IF constructor # NIL THEN
  7997. (*! should be unified with ProcedureCallDesignator *)
  7998. IF backend.cellsAreObjects THEN
  7999. Symbol(temporaryVariable,l);
  8000. ToMemory(l.op,addressType,0);
  8001. Emit(Push(position,l.op));
  8002. ReleaseOperand(l);
  8003. END;
  8004. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8005. FOR i := firstPar TO x.parameters.Length()-1 DO
  8006. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8007. formalParameter := formalParameter.nextParameter;
  8008. END;
  8009. (* static call of the constructor *)
  8010. Global.GetSymbolSegmentedName(constructor,name);
  8011. ASSERT(~constructor.isInline);
  8012. IF constructor.scope.ownerModule # module.module THEN
  8013. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8014. ELSE
  8015. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8016. END;
  8017. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8018. (*ELSE
  8019. ReleaseIntermediateOperand(pointer);*)
  8020. END;
  8021. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8022. ToMemory(l.op, addressType, 0);
  8023. Designate(p0,s0);
  8024. ToMemory(s0.op,addressType,0);
  8025. Emit(Mov(position,s0.op,l.op));
  8026. ReleaseOperand(l);
  8027. ReleaseOperand(s0);
  8028. result.tag := emptyOperand;
  8029. (* start *)
  8030. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8031. (* push cell *)
  8032. Symbol(temporaryVariable, l);
  8033. ToMemory(l.op,addressType,0);
  8034. Emit(Push(Basic.invalidPosition,l.op));
  8035. (* push delegate *)
  8036. Emit(Push(Basic.invalidPosition,l.op));
  8037. ReleaseOperand(l);
  8038. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8039. Emit(Push(position, s1.op));
  8040. ReleaseOperand(s1);
  8041. CallThis(position,"ActiveCellsRuntime","Start",3);
  8042. END;
  8043. (*IF temporaryVariable # NIL THEN
  8044. end := NewLabel();
  8045. BrL(end);
  8046. SetLabel(exit);
  8047. Designate(p0,l);
  8048. ToMemory(l.op,addressType,0);
  8049. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8050. ReleaseOperand(l);
  8051. SetLabel(end);
  8052. ELSE
  8053. SetLabel(exit);
  8054. END;
  8055. *)
  8056. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8057. ELSE (* no pointer to record, no pointer to array *)
  8058. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8059. (* ignore new statement *)
  8060. Warning(p0.position, "cannot run on final hardware");
  8061. ELSE
  8062. HALT(200);
  8063. END;
  8064. END;
  8065. (* ---- ADDRESSOF----- *)
  8066. |Global.systemAdr:
  8067. Designate(p0,s0);
  8068. s0.mode := ModeValue;
  8069. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8070. ReleaseIntermediateOperand(s0.op);
  8071. s0.op := s0.tag;
  8072. IntermediateCode.InitOperand(s0.tag);
  8073. END;
  8074. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8075. result := s0;
  8076. (* ---- BIT ----- *)
  8077. |Global.systemBit:
  8078. Evaluate(p0,s0);
  8079. ToMemory(s0.op,addressType,0);
  8080. ReuseCopy(res,s0.op);
  8081. ReleaseOperand(s0);
  8082. Evaluate(p1,s1);
  8083. Emit(Ror(position,res,res,s1.op));
  8084. ReleaseOperand(s1);
  8085. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8086. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8087. IF ~conditional THEN
  8088. InitOperand(result,ModeValue); result.op := res;
  8089. ELSE
  8090. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8091. BrL(falseLabel);
  8092. ReleaseIntermediateOperand(res);
  8093. END;
  8094. (* --- MSK ----*)
  8095. |Global.systemMsk:
  8096. Evaluate(p0,s0);
  8097. Evaluate(p1,s1);
  8098. ReuseCopy(res,s0.op);
  8099. ReleaseOperand(s0);
  8100. Emit(And(position,res,res,s1.op));
  8101. ReleaseOperand(s1);
  8102. InitOperand(result,ModeValue);
  8103. result.op := res;
  8104. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8105. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8106. Evaluate(p0,s0);
  8107. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8108. ReleaseOperand(s0);
  8109. InitOperand(result,ModeValue);
  8110. result.op := res;
  8111. (* ---- SYSTEM.GetStackPointer ----- *)
  8112. |Global.systemGetStackPointer:
  8113. InitOperand(result,ModeValue);
  8114. result.op := sp;
  8115. (* ---- SYSTEM.GetFramePointer ----- *)
  8116. |Global.systemGetFramePointer:
  8117. InitOperand(result,ModeValue);
  8118. result.op := fp;
  8119. (* ---- SYSTEM.GetActivity ----- *)
  8120. |Global.systemGetActivity:
  8121. ASSERT(backend.cooperative);
  8122. InitOperand(result,ModeValue);
  8123. result.op := ap;
  8124. (* ---- SYSTEM.SetStackPointer ----- *)
  8125. |Global.systemSetStackPointer:
  8126. Evaluate(p0,s0); (* *)
  8127. Emit(Mov(position,sp,s0.op));
  8128. ReleaseOperand(s0);
  8129. (* ---- SYSTEM.SetFramePointer ----- *)
  8130. |Global.systemSetFramePointer:
  8131. Evaluate(p0,s0); (* *)
  8132. Emit(Mov(position,fp,s0.op));
  8133. ReleaseOperand(s0);
  8134. (* ---- SYSTEM.Activity ----- *)
  8135. |Global.systemSetActivity:
  8136. ASSERT(backend.cooperative);
  8137. Evaluate(p0,s0); (* *)
  8138. Emit(Mov(position,ap,s0.op));
  8139. ReleaseOperand(s0);
  8140. (* ---- SYSTEM.VAL ----- *)
  8141. |Global.systemVal:
  8142. Expression(p1);
  8143. s1 := result;
  8144. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8145. IF s1.mode = ModeReference THEN
  8146. (* nothing to be done if not record type, just take over new type *)
  8147. IF (type IS SyntaxTree.RecordType) THEN
  8148. ReleaseIntermediateOperand(s1.tag);
  8149. s1.tag := TypeDescriptorAdr(type);
  8150. UseIntermediateOperand(s1.tag);
  8151. END;
  8152. result := s1;
  8153. ELSE (* copy over result to different type, may not use convert *)
  8154. itype := IntermediateCode.GetType(system,type);
  8155. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8156. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8157. Emit(Mov(position,s0.op,s1.op));
  8158. ReleaseOperand(s1);
  8159. InitOperand(result,ModeValue);
  8160. result.op := s0.op;
  8161. ELSE (* different size, must convert *)
  8162. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8163. Convert(s1.op, IntermediateCode.GetType(system,type));
  8164. result := s1;
  8165. END;
  8166. END;
  8167. (* ---- SYSTEM.GET ----- *)
  8168. |Global.systemGet:
  8169. Evaluate(p0,s0); (* adr *)
  8170. Designate(p1,s1); (* variable *)
  8171. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8172. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8173. Emit(Mov(position,s1.op,s0.op));
  8174. ReleaseOperand(s1);
  8175. ReleaseOperand(s0);
  8176. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8177. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8178. Evaluate(p0,s0); (* *)
  8179. Evaluate(p1,s1); (* variable *)
  8180. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8181. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8182. (* real part *)
  8183. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8184. Emit(Mov(position,res, s1.op));
  8185. ReleaseIntermediateOperand(res);
  8186. (* imaginary part *)
  8187. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8188. Emit(Mov(position,res, s1.tag));
  8189. ReleaseIntermediateOperand(res);
  8190. ReleaseOperand(s1);
  8191. ReleaseOperand(s0);
  8192. ELSE
  8193. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8194. ReleaseOperand(s0);
  8195. Emit(Mov(position,res,s1.op));
  8196. ReleaseIntermediateOperand(res);
  8197. ReleaseOperand(s1);
  8198. END;
  8199. (* ---- SYSTEM.MOVE ----- *)
  8200. |Global.systemMove:
  8201. Evaluate(p0,s0);
  8202. Evaluate(p1,s1);
  8203. Evaluate(p2,s2);
  8204. Emit(Copy(position,s1.op,s0.op,s2.op));
  8205. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8206. (* ---- SYSTEM.NEW ----- *)
  8207. |Global.systemNew:
  8208. Designate(p0,s0);
  8209. Emit(Push(position,s0.op));
  8210. ReleaseOperand(s0);
  8211. Evaluate(p1,s1);
  8212. Emit(Push(position,s1.op));
  8213. ReleaseOperand(s1);
  8214. (* push realtime flag: false by default *)
  8215. Emit(Push(position,false));
  8216. CallThis(position,"Heaps","NewSys",3);
  8217. (* ---- SYSTEM.CALL ----- *)
  8218. |Global.systemRef:
  8219. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8220. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8221. s0.mode := ModeValue;
  8222. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8223. result := s0
  8224. (* ---- INCR ----- *)
  8225. |Global.Incr:
  8226. Designate(p0,operand);
  8227. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8228. Dereference(operand,p0.type.resolved,FALSE);
  8229. END;
  8230. ASSERT(p1 # NIL);
  8231. Evaluate(p1,l);
  8232. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8233. ReleaseOperand(operand); ReleaseOperand(l);
  8234. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8235. (* ---- SUM ----- *)
  8236. |Global.Sum: HALT(200);
  8237. (* ---- ALL ----- *)
  8238. |Global.All: HALT(200);
  8239. (* ---- CAS ----- *)
  8240. |Global.Cas:
  8241. needsTrace := p0.NeedsTrace();
  8242. IF needsTrace THEN ModifyAssignments(true) END;
  8243. Designate(p0,s0);
  8244. Evaluate(p1,s1);
  8245. Evaluate(p2,s2);
  8246. IF needsTrace THEN
  8247. Emit(Push(position, s0.op));
  8248. Emit(Push(position, s1.op));
  8249. Emit(Push(position, s2.op));
  8250. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8251. ELSE
  8252. Emit(Cas(position,s0.op,s1.op,s2.op));
  8253. END;
  8254. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8255. IF needsTrace THEN ModifyAssignments(false) END;
  8256. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8257. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8258. IF conditional THEN
  8259. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8260. BrL(falseLabel);
  8261. ReleaseIntermediateOperand(res);
  8262. END;
  8263. (* ---- DIM ----- *)
  8264. |Global.Dim:
  8265. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8266. Designate(p0,s0);
  8267. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8268. Dereference(s0,p0.type.resolved,FALSE);
  8269. END;
  8270. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8271. ReleaseOperand(s0);
  8272. (* ---- RESHAPE ----- *)
  8273. |Global.Reshape:
  8274. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8275. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8276. left.SetType(procedure.type);
  8277. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8278. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8279. END;
  8280. (* ---- SYSTEM.TYPECODE ----- *)
  8281. |Global.systemTypeCode:
  8282. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8283. IF type.resolved IS SyntaxTree.PointerType THEN
  8284. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8285. END;
  8286. result.op := TypeDescriptorAdr(type);
  8287. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8288. result.mode := ModeValue;
  8289. (* ---- SYSTEM.TRACE ----- *)
  8290. |Global.systemTrace:
  8291. SystemTrace(x.parameters, x.position);
  8292. (* ----- CONNECT ------*)
  8293. |Global.Connect:
  8294. IF backend.cellsAreObjects THEN
  8295. PushPort(p0);
  8296. PushPort(p1);
  8297. IF p2 # NIL THEN
  8298. Evaluate(p2, s2);
  8299. Emit(Push(p2.position, s2.op));
  8300. ReleaseOperand(s2);
  8301. ELSE
  8302. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8303. END;
  8304. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8305. ELSE
  8306. Warning(x.position, "cannot run on final hardware");
  8307. END;
  8308. (* ----- DELEGATE ------*)
  8309. |Global.Delegate:
  8310. IF backend.cellsAreObjects THEN
  8311. PushPort(p0);
  8312. PushPort(p1);
  8313. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8314. ELSE
  8315. Warning(x.position, "cannot run on final hardware");
  8316. END;
  8317. (* ----- SEND ------*)
  8318. |Global.Send:
  8319. Evaluate(p0,s0);
  8320. Evaluate(p1,s1);
  8321. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8322. Emit(Push(position,s0.op));
  8323. Emit(Push(position,s1.op));
  8324. (*
  8325. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8326. *)
  8327. IF ~backend.cellsAreObjects THEN
  8328. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8329. END;
  8330. ReleaseOperand(s0);
  8331. ReleaseOperand(s1);
  8332. IF backend.cellsAreObjects THEN
  8333. CallThis(position,"ActiveCellsRuntime","Send",2);
  8334. ELSE
  8335. CallThis(position,ChannelModuleName,"Send",2);
  8336. END;
  8337. (* ----- RECEIVE ------*)
  8338. |Global.Receive:
  8339. Evaluate(p0,s0);
  8340. Emit(Push(position,s0.op));
  8341. Designate(p1,s1);
  8342. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8343. Emit(Push(position,s1.op));
  8344. IF p2 # NIL THEN
  8345. Designate(p2,s2);
  8346. Emit(Push(position,s2.op));
  8347. END;
  8348. (*
  8349. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8350. *)
  8351. IF ~backend.cellsAreObjects THEN
  8352. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8353. END;
  8354. ReleaseOperand(s0);
  8355. ReleaseOperand(s1);
  8356. ReleaseOperand(s2);
  8357. IF backend.cellsAreObjects THEN
  8358. IF p2 = NIL THEN
  8359. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8360. ELSE
  8361. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8362. END;
  8363. ELSE
  8364. IF p2 = NIL THEN
  8365. CallThis(position,ChannelModuleName,"Receive",2)
  8366. ELSE
  8367. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8368. END;
  8369. END;
  8370. | Global.systemSpecial:
  8371. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8372. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8373. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8374. (* determine if parameters are of the VAR kind *)
  8375. ASSERT(x.parameters.Length() <= 3);
  8376. formalParameter := procedureType.firstParameter;
  8377. FOR i := 0 TO x.parameters.Length() - 1 DO
  8378. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8379. formalParameter := formalParameter.nextParameter
  8380. END;
  8381. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8382. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8383. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8384. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8385. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8386. IF procedureType.returnType # NIL THEN
  8387. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8388. Emit(Result(position, res));
  8389. (*InitOperand(result,ModeValue);
  8390. result.op := res;
  8391. *)
  8392. IF ~conditional THEN
  8393. InitOperand(result,ModeValue); result.op := res;
  8394. ELSE
  8395. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8396. BrL(falseLabel);
  8397. ReleaseIntermediateOperand(res);
  8398. END;
  8399. END
  8400. ELSE (* function not yet implemented *)
  8401. Error(position,"not yet implemented");
  8402. END;
  8403. destination := dest;
  8404. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8405. END VisitBuiltinCallDesignator;
  8406. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8407. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8408. BEGIN
  8409. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8410. dest := destination; destination := emptyOperand;
  8411. Expression(x.left);
  8412. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8413. ELSIF isUnchecked THEN (* no check *)
  8414. ELSE
  8415. trueL := NewLabel();
  8416. falseL := NewLabel();
  8417. IF IsPointerToRecord(x.left.type,recordType) THEN
  8418. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8419. Emit(Mov(position,tag, result.op));
  8420. IF result.mode # ModeValue THEN
  8421. ptr := tag;
  8422. IntermediateCode.MakeMemory(ptr,addressType);
  8423. Emit(Mov(position,tag, ptr));
  8424. END;
  8425. IF ~backend.cooperative THEN
  8426. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8427. END;
  8428. IntermediateCode.MakeMemory(tag,addressType);
  8429. ELSE
  8430. tag := result.tag;
  8431. UseIntermediateOperand(tag);
  8432. END;
  8433. TypeTest(tag,x.type,trueL,falseL);
  8434. ReleaseIntermediateOperand(tag);
  8435. SetLabel(falseL);
  8436. EmitTrap(position,TypeCheckTrap);
  8437. SetLabel(trueL);
  8438. END;
  8439. destination := dest;
  8440. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8441. END VisitTypeGuardDesignator;
  8442. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8443. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8444. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8445. VAR label: Label; pc: LONGINT;
  8446. BEGIN
  8447. IF backend.cooperative & ~isUnchecked THEN
  8448. pc := section.pc;
  8449. label := NewLabel();
  8450. BrneL(label, operand.op, nil);
  8451. EmitTrap(position, NilPointerTrap);
  8452. SetLabel(label);
  8453. INC(statCoopNilCheck, section.pc - pc);
  8454. END;
  8455. END NilCheck;
  8456. BEGIN
  8457. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8458. ReuseCopy(dereferenced,operand.op);
  8459. ReleaseOperand(operand);
  8460. operand.mode := ModeReference;
  8461. operand.op := dereferenced;
  8462. operand.tag := dereferenced;
  8463. UseIntermediateOperand(operand.tag);
  8464. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8465. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8466. ReleaseIntermediateOperand(operand.tag);
  8467. operand.tag := TypeDescriptorAdr(type);
  8468. ELSE
  8469. IF ~backend.cooperative THEN
  8470. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8471. END;
  8472. IntermediateCode.MakeMemory(operand.tag,addressType);
  8473. END;
  8474. NilCheck(operand.op);
  8475. ELSIF type IS SyntaxTree.ArrayType THEN
  8476. IF isUnsafe THEN
  8477. NilCheck(operand.op);
  8478. ReleaseIntermediateOperand(operand.tag);
  8479. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8480. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8481. ELSE
  8482. operand.tag := emptyOperand;
  8483. END;
  8484. ELSE
  8485. NilCheck(operand.op);
  8486. IF backend.cooperative THEN
  8487. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8488. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8489. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8490. ELSE
  8491. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8492. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8493. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8494. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8495. END;
  8496. END;
  8497. ELSIF type IS SyntaxTree.MathArrayType THEN
  8498. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8499. IntermediateCode.MakeMemory(operand.op,addressType);
  8500. ELSE HALT(100);
  8501. END;
  8502. END Dereference;
  8503. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8504. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8505. BEGIN
  8506. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8507. dest := destination; destination := emptyOperand;
  8508. Evaluate(x.left,d);
  8509. type := x.type.resolved;
  8510. prevIsUnchecked := isUnchecked;
  8511. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8512. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8513. END;
  8514. Dereference(d,type,IsUnsafePointer(x.left.type));
  8515. isUnchecked := prevIsUnchecked;
  8516. result := d;
  8517. 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
  8518. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8519. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8520. END;
  8521. END;
  8522. destination := dest;
  8523. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8524. END VisitDereferenceDesignator;
  8525. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8526. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8527. BEGIN
  8528. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8529. dest := destination; destination := emptyOperand;
  8530. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8531. tag := result.op;
  8532. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8533. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8534. StaticCallOperand(result,procedure.super);
  8535. ReleaseIntermediateOperand(result.tag);
  8536. UseIntermediateOperand(tag); (* necessary ? *)
  8537. result.tag := tag;
  8538. destination := dest;
  8539. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8540. END VisitSupercallDesignator;
  8541. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8542. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8543. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8544. name: Basic.SegmentedName;
  8545. procedure: SyntaxTree.Procedure;
  8546. procedureType: SyntaxTree.ProcedureType;
  8547. BEGIN
  8548. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8549. dest := destination; destination := emptyOperand;
  8550. scope := currentScope;
  8551. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8552. scope := scope.outerScope;
  8553. END;
  8554. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8555. moduleSection := meta.ModuleSection();
  8556. IF backend.cooperative THEN
  8557. moduleOffset := 0;
  8558. ELSE
  8559. moduleOffset := moduleSection.pc;
  8560. END;
  8561. result.mode := ModeValue;
  8562. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8563. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8564. result.mode := ModeValue;
  8565. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8566. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8567. ELSE
  8568. GetBaseRegister(basereg,currentScope,scope);
  8569. InitOperand(result,ModeReference);
  8570. result.op := basereg;
  8571. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8572. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8573. parametersSize := ProcParametersSize(procedure);
  8574. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8575. IF backend.cooperative THEN
  8576. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8577. END;
  8578. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8579. MakeMemory(result.op, result.op, addressType, 0);
  8580. END;
  8581. (* tag must be loaded when dereferencing SELF pointer *)
  8582. END;
  8583. destination := dest;
  8584. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8585. END VisitSelfDesignator;
  8586. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8587. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8588. BEGIN
  8589. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8590. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8591. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8592. parameter := procedureType.returnParameter;
  8593. IF currentIsInline THEN
  8594. map := currentMapper.Get(NIL);
  8595. IF map # NIL THEN
  8596. Designate(map.to, result);
  8597. ELSE
  8598. HALT(200);
  8599. END;
  8600. RETURN;
  8601. END;
  8602. VisitParameter(parameter);
  8603. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8604. END VisitResultDesignator;
  8605. (** values *)
  8606. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8607. BEGIN
  8608. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8609. IF conditional THEN
  8610. IF x.value THEN BrL(trueLabel)
  8611. ELSE BrL(falseLabel)
  8612. END;
  8613. ELSE
  8614. InitOperand(result,ModeValue);
  8615. IF x.value THEN result.op := true ELSE result.op := false END;
  8616. END;
  8617. END VisitBooleanValue;
  8618. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8619. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8620. BEGIN
  8621. Global.GetModuleSegmentedName(module.module, name);
  8622. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8623. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8624. RETURN section
  8625. END GetDataSection;
  8626. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8627. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8628. BEGIN
  8629. type := vop.type;
  8630. data := GetDataSection();
  8631. pc := EnterImmediate(data,vop);
  8632. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8633. IntermediateCode.MakeMemory(vop, type);
  8634. END GetImmediateMem;
  8635. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8636. BEGIN
  8637. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8638. InitOperand(result,ModeValue);
  8639. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8640. IF ~supportedImmediate(result.op) &~inData THEN
  8641. GetImmediateMem(result.op)
  8642. END;
  8643. END VisitIntegerValue;
  8644. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8645. BEGIN
  8646. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8647. InitOperand(result,ModeValue);
  8648. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8649. END VisitCharacterValue;
  8650. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8651. BEGIN
  8652. IF Trace THEN TraceEnter("VisitSetValue") END;
  8653. InitOperand(result,ModeValue);
  8654. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  8655. END VisitSetValue;
  8656. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8657. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8658. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8659. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8660. BEGIN
  8661. numberElements := x.elements.Length();
  8662. FOR i := 0 TO numberElements-1 DO
  8663. expression := x.elements.GetExpression(i);
  8664. IF expression IS SyntaxTree.MathArrayExpression THEN
  8665. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8666. ELSE
  8667. inData := TRUE;
  8668. Evaluate(expression,op);
  8669. irv.Emit(Data(position,op.op));
  8670. inData := FALSE;
  8671. ReleaseOperand(op);
  8672. END;
  8673. END;
  8674. END RecursiveData;
  8675. BEGIN
  8676. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8677. IF ~TryConstantDeclaration() THEN
  8678. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8679. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8680. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8681. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8682. ELSE
  8683. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8684. END;
  8685. RecursiveData(x.array);
  8686. InitOperand(result,ModeReference);
  8687. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8688. END
  8689. END VisitMathArrayValue;
  8690. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8691. VAR constant: Sections.Section;
  8692. BEGIN
  8693. IF constantDeclaration = NIL THEN
  8694. RETURN FALSE
  8695. ELSE
  8696. (* Is a constant in this module: did we generate it already? *)
  8697. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8698. IF constant # NIL THEN
  8699. InitOperand(result,ModeReference);
  8700. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8701. RETURN TRUE;
  8702. END;
  8703. END;
  8704. RETURN FALSE
  8705. END TryConstantDeclaration;
  8706. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8707. BEGIN
  8708. constantDeclaration := x;
  8709. x.value.resolved.Accept(SELF);
  8710. END VisitConstant;
  8711. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8712. BEGIN
  8713. IF Trace THEN TraceEnter("VisitRealValue") END;
  8714. InitOperand(result,ModeValue);
  8715. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8716. END VisitRealValue;
  8717. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8718. VAR
  8719. componentType: SyntaxTree.Type;
  8720. BEGIN
  8721. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8722. ASSERT(x.type IS SyntaxTree.ComplexType);
  8723. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8724. InitOperand(result,ModeValue);
  8725. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8726. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8727. END VisitComplexValue;
  8728. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8729. VAR i: LONGINT; name: Basic.SegmentedName;
  8730. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8731. BEGIN
  8732. IF Trace THEN TraceEnter("VisitStringValue") END;
  8733. IF ~TryConstantDeclaration() THEN
  8734. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8735. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8736. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8737. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8738. ELSE
  8739. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8740. END;
  8741. FOR i := 0 TO x.length-1 DO
  8742. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8743. irv.Emit(Data(position,op));
  8744. END;
  8745. InitOperand(result,ModeReference);
  8746. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8747. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8748. END
  8749. END VisitStringValue;
  8750. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8751. BEGIN
  8752. IF Trace THEN TraceEnter("VisitNilValue") END;
  8753. InitOperand(result,ModeValue);
  8754. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8755. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8756. END VisitNilValue;
  8757. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8758. BEGIN
  8759. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8760. InitOperand(result,ModeValue);
  8761. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8762. END VisitEnumerationValue;
  8763. (** symbols *)
  8764. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8765. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8766. END VisitImport;
  8767. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8768. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8769. BEGIN
  8770. IF scope # baseScope THEN
  8771. (* left := [fp+8] *)
  8772. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8773. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8774. ReuseCopy(left,right);
  8775. ReleaseIntermediateOperand(right);
  8776. scope := scope.outerScope; DEC(level);
  8777. (* { left := [left+8] } *)
  8778. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8779. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8780. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8781. Emit(Mov(position,left,right));
  8782. scope := scope.outerScope; DEC(level);
  8783. END;
  8784. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8785. result := left;
  8786. ELSE
  8787. result := fp;
  8788. END;
  8789. END GetBaseRegister;
  8790. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8791. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8792. BEGIN
  8793. IF Trace THEN TraceEnter("VisitVariable"); END;
  8794. type := x.type.resolved;
  8795. IF (x.useRegister) THEN
  8796. InitOperand(result, ModeValue);
  8797. IF x.registerNumber < 0 THEN
  8798. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8799. reg := x.registerNumber;
  8800. ELSE
  8801. reg := registerUsageCount.Map(x.registerNumber);
  8802. UseRegister(reg);
  8803. END;
  8804. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8805. ELSIF x.externalName # NIL THEN
  8806. InitOperand(result,ModeReference);
  8807. Basic.ToSegmentedName(x.externalName^, name);
  8808. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8809. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8810. InitOperand(result,ModeReference);
  8811. GetBaseRegister(result.op,currentScope,x.scope);
  8812. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8813. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8814. InitOperand(result,ModeReference);
  8815. GetCodeSectionNameForSymbol(x,name);
  8816. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8817. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8818. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8819. InitOperand(result,ModeReference);
  8820. GetCodeSectionNameForSymbol(x,name);
  8821. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8822. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8823. ELSE (* field, left designator must have been emitted *)
  8824. ASSERT(result.mode = ModeReference);
  8825. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8826. ReuseCopy(temp,result.op);
  8827. ReleaseIntermediateOperand(result.op);
  8828. result.op := temp;
  8829. END;
  8830. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8831. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8832. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8833. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8834. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8835. END;
  8836. END;
  8837. END;
  8838. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8839. ValueToCondition(result);
  8840. ELSIF type IS SyntaxTree.ProcedureType THEN
  8841. ReleaseIntermediateOperand(result.tag);
  8842. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8843. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8844. UseIntermediateOperand(result.tag);
  8845. ELSE
  8846. result.tag := nil; (* nil *)
  8847. END;
  8848. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8849. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8850. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8851. ReleaseIntermediateOperand(result.tag);
  8852. Global.GetSymbolSegmentedName(x,name);
  8853. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8854. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8855. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8856. ELSE
  8857. END;
  8858. ELSE
  8859. ReleaseIntermediateOperand(result.tag);
  8860. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8861. END;
  8862. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8863. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8864. ReleaseIntermediateOperand(result.tag);
  8865. result.tag := result.op;
  8866. UseIntermediateOperand(result.tag);
  8867. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8868. IntermediateCode.MakeMemory(result.op,addressType);
  8869. END;
  8870. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8871. ReleaseIntermediateOperand(result.tag);
  8872. result.tag := TypeDescriptorAdr(type);
  8873. UseIntermediateOperand(result.tag);
  8874. (* tag for pointer type computed not here but during dereferencing *)
  8875. END;
  8876. IF Trace THEN TraceExit("VisitVariable") END;
  8877. END VisitVariable;
  8878. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8879. BEGIN
  8880. VisitVariable(property);
  8881. END VisitProperty;
  8882. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8883. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8884. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8885. BEGIN
  8886. type := x.type.resolved;
  8887. IF Trace THEN TraceEnter("VisitParameter") END;
  8888. IF x.ownerType IS SyntaxTree.CellType THEN
  8889. ptype := x.type.resolved;
  8890. IF backend.cellsAreObjects THEN
  8891. ASSERT(result.mode = ModeReference);
  8892. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8893. ReuseCopy(temp,result.op);
  8894. ReleaseIntermediateOperand(result.op);
  8895. result.op := temp;
  8896. END;
  8897. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8898. RETURN;
  8899. ELSE
  8900. InitOperand(result,ModeReference);
  8901. GetCodeSectionNameForSymbol(x,name);
  8902. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8903. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8904. RETURN;
  8905. END;
  8906. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8907. InitOperand(result,ModeReference);
  8908. GetCodeSectionNameForSymbol(x,name);
  8909. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8910. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8911. RETURN
  8912. ELSE
  8913. GetBaseRegister(basereg,currentScope,x.scope);
  8914. InitOperand(result,ModeReference);
  8915. result.op := basereg;
  8916. END;
  8917. IF IsOpenArray(type) THEN
  8918. result.tag := basereg;
  8919. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8920. IntermediateCode.MakeMemory(result.op,addressType);
  8921. IF Global.IsOberonProcedure(x.ownerType) THEN
  8922. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8923. UseIntermediateOperand(result.tag);
  8924. ELSE
  8925. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8926. END;
  8927. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8928. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8929. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8930. ELSIF IsStaticArray(type) THEN
  8931. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8932. IntermediateCode.MakeMemory(result.op,addressType);
  8933. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8934. ELSIF type IS SyntaxTree.MathArrayType THEN
  8935. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8936. WITH type: SyntaxTree.MathArrayType DO
  8937. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8938. IF type.form = SyntaxTree.Tensor THEN
  8939. ELSIF type.form = SyntaxTree.Open THEN
  8940. result.tag := result.op;
  8941. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8942. IntermediateCode.MakeMemory(result.op,addressType);
  8943. UseIntermediateOperand(result.tag);
  8944. ELSIF type.form = SyntaxTree.Static THEN
  8945. IF x.kind = SyntaxTree.ConstParameter THEN
  8946. IntermediateCode.MakeMemory(result.op,addressType);
  8947. END;
  8948. ELSE HALT(100)
  8949. END;
  8950. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8951. IF type.form = SyntaxTree.Tensor THEN
  8952. ToMemory(result.op,addressType,0);
  8953. ELSIF type.form = SyntaxTree.Open THEN
  8954. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8955. ReuseCopy(result.tag, mem);
  8956. ReleaseIntermediateOperand(mem);
  8957. ReleaseIntermediateOperand(result.op);
  8958. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8959. ELSIF type.form = SyntaxTree.Static THEN
  8960. IntermediateCode.MakeMemory(result.op,addressType);
  8961. ELSE HALT(100)
  8962. END;
  8963. ELSE HALT(100)
  8964. END;
  8965. END;
  8966. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8967. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8968. IntermediateCode.MakeMemory(result.op,addressType);
  8969. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8970. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8971. END;
  8972. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8973. ValueToCondition(result);
  8974. ELSIF type IS SyntaxTree.ProcedureType THEN
  8975. ReleaseIntermediateOperand(result.tag);
  8976. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8977. IF x.kind = SyntaxTree.VarParameter THEN
  8978. ReuseCopy(result.tag,result.op);
  8979. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  8980. IntermediateCode.MakeMemory(result.tag,addressType);
  8981. ELSE
  8982. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8983. UseIntermediateOperand(result.tag);
  8984. END;
  8985. ELSE
  8986. result.tag := nil;
  8987. END;
  8988. (* tag for pointer type computed not here but during dereferencing *)
  8989. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  8990. ReleaseIntermediateOperand(result.tag);
  8991. result.tag := basereg;
  8992. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  8993. IntermediateCode.MakeMemory(result.tag,addressType);
  8994. UseIntermediateOperand(result.tag);
  8995. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  8996. ReleaseIntermediateOperand(result.tag);
  8997. result.tag := TypeDescriptorAdr(type);
  8998. UseIntermediateOperand(result.tag);
  8999. END;
  9000. IF Trace THEN TraceExit("VisitParameter") END;
  9001. END VisitParameter;
  9002. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9003. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9004. BEGIN
  9005. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9006. (* left.p: left already emitted *)
  9007. tag := result.op; (* value of pointer to left *)
  9008. (* get type desc *)
  9009. tmp := result.tag;
  9010. IntermediateCode.MakeMemory(tmp,addressType);
  9011. (* get method adr *)
  9012. Reuse1(reg,tmp);
  9013. ReleaseIntermediateOperand(tmp);
  9014. IF backend.cooperative THEN
  9015. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9016. WHILE recordType.baseType # NIL DO
  9017. recordType := recordType.GetBaseRecord ();
  9018. END;
  9019. GetRecordTypeName (recordType,name);
  9020. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9021. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9022. offset := 0;
  9023. ELSE
  9024. offset := 2;
  9025. END;
  9026. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9027. ELSIF meta.simple THEN
  9028. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9029. ELSE
  9030. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9031. END;
  9032. InitOperand(operand,ModeReference);
  9033. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9034. operand.op := reg;
  9035. operand.tag := tag;
  9036. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9037. END DynamicCallOperand;
  9038. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9039. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9040. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9041. BEGIN
  9042. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9043. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9044. tag := operand.op;
  9045. ReleaseIntermediateOperand(operand.tag);
  9046. ELSE tag := nil
  9047. END;
  9048. IF x.isInline THEN
  9049. sectionType := Sections.InlineCodeSection;
  9050. ELSE
  9051. sectionType := Sections.CodeSection;
  9052. END;
  9053. IF x.externalName # NIL THEN
  9054. Basic.ToSegmentedName(x.externalName^, name);
  9055. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9056. ELSE
  9057. GetCodeSectionNameForSymbol(x, name);
  9058. IF (x.scope.ownerModule = module.module) THEN
  9059. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9060. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9061. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9062. IF source.pc = 0 THEN (* no code yet *)
  9063. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9064. END;
  9065. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9066. bits := x.procedureScope.body.code.inlineCode;
  9067. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9068. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9069. binary.CopyBits(bits, 0, bits.GetSize());
  9070. source.SetResolved(binary);
  9071. ELSE
  9072. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9073. END;
  9074. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9075. END;
  9076. InitOperand(operand,ModeValue);
  9077. operand.op := reg;
  9078. operand.tag := tag;
  9079. IF Trace THEN TraceExit("StaticCallOperand") END;
  9080. END StaticCallOperand;
  9081. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9082. (* handle expressions of the form designator.procedure or procedure *)
  9083. BEGIN
  9084. IF Trace THEN TraceEnter("VisitProcedure") END;
  9085. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9086. DynamicCallOperand(result,x);
  9087. ELSIF x.isInline THEN
  9088. StaticCallOperand(result,x);
  9089. ELSE
  9090. StaticCallOperand(result,x);
  9091. END;
  9092. IF Trace THEN TraceExit("VisitProcedure") END;
  9093. END VisitProcedure;
  9094. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9095. BEGIN
  9096. VisitProcedure(x);
  9097. END VisitOperator;
  9098. (** statements *)
  9099. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9100. BEGIN
  9101. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9102. Expression(x.call);
  9103. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9104. ReleaseOperand(result)
  9105. END;
  9106. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9107. END VisitProcedureCallStatement;
  9108. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9109. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9110. leftBase, rightBase: SyntaxTree.Type;
  9111. procedureName,s: SyntaxTree.IdentifierString;
  9112. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9113. size: LONGINT; rightKind: LONGINT;
  9114. dummy: IntermediateCode.Operand;
  9115. CONST moduleName = "FoxArrayBase";
  9116. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9117. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9118. BEGIN
  9119. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9120. IF base IS SyntaxTree.MathArrayType THEN
  9121. base := OpenArray(base(SyntaxTree.MathArrayType));
  9122. END;
  9123. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9124. result.SetArrayBase(base);
  9125. RETURN result
  9126. END OpenArray;
  9127. BEGIN
  9128. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9129. SaveRegisters();ReleaseUsedRegisters(saved);
  9130. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9131. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9132. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9133. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9134. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9135. IF leftType.form = SyntaxTree.Tensor THEN
  9136. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9137. ELSIF leftType.form = SyntaxTree.Open THEN
  9138. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9139. ELSIF leftType.form = SyntaxTree.Static THEN
  9140. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9141. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9142. END;
  9143. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9144. IF procedure = NIL THEN
  9145. s := "Instruction not supported on target, emulation procedure ";
  9146. Strings.Append(s,moduleName);
  9147. Strings.Append(s,".");
  9148. Strings.Append(s,procedureName);
  9149. Strings.Append(s," not present");
  9150. Error(position,s);
  9151. ELSE
  9152. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9153. parameter.SetType(leftType);
  9154. parameter.SetAccess(SyntaxTree.Internal);
  9155. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9156. parameter.SetKind(rightKind);
  9157. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9158. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9159. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9160. StaticCallOperand(result,procedure);
  9161. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  9162. ReleaseOperand(result);
  9163. END;
  9164. RestoreRegisters(saved);
  9165. END;
  9166. END AssignMathArray;
  9167. VAR modifyAssignmentCounter := 0: LONGINT;
  9168. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9169. VAR processor,mem,dst: IntermediateCode.Operand;
  9170. BEGIN
  9171. IF value.intValue = true.intValue THEN
  9172. INC(modifyAssignmentCounter);
  9173. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9174. modifyAssignmentsPC := section.pc;
  9175. ELSE
  9176. DEC(modifyAssignmentCounter);
  9177. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9178. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9179. END;
  9180. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9181. dst := NewRegisterOperand (addressType);
  9182. Emit(Mov(position,dst, processor));
  9183. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9184. Emit(Mov(position,mem, value));
  9185. ReleaseIntermediateOperand(dst);
  9186. END ModifyAssignments;
  9187. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9188. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9189. BEGIN
  9190. type := left.type.resolved;
  9191. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9192. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9193. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9194. IF procedureType.returnParameter = parameter THEN
  9195. (* this is the only case where the destination can be dynamically smaller than the source
  9196. in all other cases the dynamic size has to be taken
  9197. *)
  9198. IF backend.cooperative THEN
  9199. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9200. ELSE
  9201. MakeMemory(mem, tag, addressType, 0);
  9202. END;
  9203. RETURN mem;
  9204. END;
  9205. END;
  9206. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9207. END CopySize;
  9208. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9209. VAR
  9210. leftO, rightO: Operand;
  9211. arg,mem, sizeOp: IntermediateCode.Operand;
  9212. leftType, rightType, componentType, base: SyntaxTree.Type;
  9213. size: LONGINT;
  9214. parameters: SyntaxTree.ExpressionList;
  9215. procedure: SyntaxTree.Procedure;
  9216. call: SyntaxTree.ProcedureCallDesignator;
  9217. designator: SyntaxTree.Designator;
  9218. saved: RegisterEntry;
  9219. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9220. VAR procedureType: SyntaxTree.ProcedureType;
  9221. BEGIN
  9222. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9223. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9224. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9225. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9226. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9227. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9228. IF right.id = Global.Reshape THEN RETURN TRUE
  9229. END;
  9230. END;
  9231. END;
  9232. END;
  9233. RETURN FALSE
  9234. END CanPassAsResultParameter;
  9235. BEGIN
  9236. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9237. leftType := left.type.resolved; rightType:= right.type.resolved;
  9238. IF backend.cooperative & left.NeedsTrace() THEN
  9239. ModifyAssignments(true);
  9240. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9241. Designate(right, rightO);
  9242. Designate(left, leftO);
  9243. ASSERT(leftO.mode = ModeReference);
  9244. TransferToRegister(leftO.op, leftO.op);
  9245. TransferToRegister(rightO.op, rightO.op);
  9246. Emit(Push(position, leftO.op));
  9247. Emit(Push(position, rightO.op));
  9248. CallAssignMethod(leftO.op, rightO.op, left.type);
  9249. Emit(Pop(position, rightO.op));
  9250. Emit(Pop(position, leftO.op));
  9251. sizeOp := CopySize(left, leftO.tag);
  9252. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9253. ReleaseIntermediateOperand(sizeOp);
  9254. ReleaseOperand(leftO);
  9255. ReleaseOperand(rightO);
  9256. ELSE
  9257. Evaluate(right,rightO);
  9258. Designate(left,leftO);
  9259. ASSERT(leftO.mode = ModeReference);
  9260. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9261. (* copy procedure address first *)
  9262. MakeMemory(mem,leftO.op,addressType,0);
  9263. Emit(Mov(position,mem,rightO.op));
  9264. ReleaseIntermediateOperand(mem);
  9265. (* copy pointer address *)
  9266. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9267. CallAssignPointer(leftO.tag, rightO.tag);
  9268. ELSE
  9269. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9270. CallAssignPointer(leftO.op, rightO.op);
  9271. END;
  9272. ReleaseOperand(leftO);
  9273. ReleaseOperand(rightO);
  9274. END;
  9275. ModifyAssignments(false);
  9276. RETURN;
  9277. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9278. SaveRegisters();ReleaseUsedRegisters(saved);
  9279. IF SemanticChecker.IsPointerType(leftType) THEN
  9280. Evaluate(right,rightO);
  9281. Designate(left,leftO);
  9282. Emit(Push(position,leftO.op));
  9283. ReleaseOperand(leftO);
  9284. Emit(Push(position,rightO.op));
  9285. ReleaseOperand(rightO);
  9286. CallThis(position,"Heaps","Assign",2);
  9287. ELSIF leftType.IsRecordType() THEN
  9288. Designate(right,rightO);
  9289. Designate(left,leftO);
  9290. Emit(Push(position,leftO.op));
  9291. Emit(Push(position,leftO.tag)); (* type desc *)
  9292. ReleaseOperand(leftO);
  9293. Emit(Push(position,rightO.op));
  9294. ReleaseOperand(rightO);
  9295. CallThis(position,"Heaps","AssignRecord",3);
  9296. ELSIF IsStaticArray(leftType) THEN
  9297. size := StaticArrayNumElements(leftType);
  9298. base := StaticArrayBaseType(leftType);
  9299. Designate(right,rightO);
  9300. Designate(left,leftO);
  9301. Emit(Push(position,leftO.op));
  9302. ReleaseOperand(leftO);
  9303. arg := TypeDescriptorAdr(base);
  9304. Emit(Push(position,arg));
  9305. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9306. Emit(Push(position,rightO.op));
  9307. ReleaseOperand(rightO);
  9308. CallThis(position,"Heaps","AssignArray",4);
  9309. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9310. size := StaticMathArrayNumElements(leftType);
  9311. base := StaticMathArrayBaseType(leftType);
  9312. Designate(right,rightO);
  9313. Designate(left,leftO);
  9314. Emit(Push(position,leftO.op));
  9315. ReleaseOperand(leftO);
  9316. arg := TypeDescriptorAdr(base);
  9317. Emit(Push(position,arg));
  9318. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9319. Emit(Push(position,rightO.op));
  9320. ReleaseOperand(rightO);
  9321. CallThis(position,"Heaps","AssignArray",4);
  9322. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9323. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9324. Evaluate(right,rightO);
  9325. Designate(left,leftO);
  9326. MakeMemory(mem,leftO.op,addressType,0);
  9327. Emit(Mov(position,mem,rightO.op));
  9328. ReleaseIntermediateOperand(mem);
  9329. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9330. Emit (Push(position, leftO.tag));
  9331. ReleaseOperand(leftO);
  9332. Emit (Push(position, rightO.tag));
  9333. ReleaseOperand(rightO);
  9334. CallThis(position,"Heaps","Assign", 2);
  9335. ELSE HALT(100); (* missing ? *)
  9336. END;
  9337. RestoreRegisters(saved);
  9338. RETURN;
  9339. END;
  9340. IF CanPassAsResultParameter(right) THEN
  9341. procedureResultDesignator := left(SyntaxTree.Designator);
  9342. Expression(right);
  9343. procedureResultDesignator := NIL;
  9344. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9345. (* left <-- ALIAS OF right: zerocopy *)
  9346. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9347. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9348. designator.SetType(procedure.type);
  9349. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9350. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9351. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9352. END;
  9353. ELSIF leftType IS SyntaxTree.RangeType THEN
  9354. (* LHS is of array range type *)
  9355. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9356. Evaluate(right, rightO);
  9357. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9358. (* first *)
  9359. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9360. Emit(Mov(position,mem, rightO.op));
  9361. ReleaseIntermediateOperand(mem);
  9362. (* last *)
  9363. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9364. Emit(Mov(position,mem, rightO.tag));
  9365. ReleaseIntermediateOperand(mem);
  9366. (* step *)
  9367. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9368. Emit(Mov(position,mem, rightO.extra));
  9369. ReleaseIntermediateOperand(mem);
  9370. ReleaseOperand(rightO);
  9371. ReleaseOperand(leftO)
  9372. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9373. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9374. Evaluate(right, rightO);
  9375. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9376. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9377. (* real part *)
  9378. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9379. Emit(Mov(position,mem, rightO.op));
  9380. ReleaseIntermediateOperand(mem);
  9381. (* imaginary part *)
  9382. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9383. Emit(Mov(position,mem, rightO.tag));
  9384. ReleaseIntermediateOperand(mem);
  9385. ReleaseOperand(rightO);
  9386. ReleaseOperand(leftO)
  9387. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9388. OR (leftType IS SyntaxTree.PortType) THEN
  9389. (* rightO := leftO;*)
  9390. Evaluate(right,rightO);
  9391. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9392. Designate(left,leftO);
  9393. IF leftO.mode = ModeReference THEN
  9394. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9395. destination := mem;
  9396. ELSE
  9397. destination := leftO.op;
  9398. END;
  9399. ReleaseOperand(leftO);
  9400. IF destination.mode # IntermediateCode.Undefined THEN
  9401. Emit(Mov(position,destination,rightO.op));
  9402. END;
  9403. ReleaseOperand(rightO);
  9404. ReleaseIntermediateOperand(mem);
  9405. IntermediateCode.InitOperand(destination);
  9406. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9407. Evaluate(right,rightO);
  9408. Designate(left,leftO);
  9409. MakeMemory(mem,leftO.op,addressType,0);
  9410. Emit(Mov(position,mem,rightO.op));
  9411. ReleaseIntermediateOperand(mem);
  9412. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9413. (* delegate *)
  9414. (*
  9415. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9416. *)
  9417. Emit(Mov(position,leftO.tag,rightO.tag));
  9418. END;
  9419. ReleaseOperand(leftO);
  9420. ReleaseOperand(rightO);
  9421. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9422. Designate(right,rightO);
  9423. Designate(left,leftO);
  9424. sizeOp := CopySize(left, leftO.tag);
  9425. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9426. ReleaseIntermediateOperand(sizeOp);
  9427. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9428. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9429. IF (rightType IS SyntaxTree.StringType) THEN
  9430. CopyString(left,right);
  9431. 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
  9432. Designate(right,rightO);
  9433. Designate(left,leftO);
  9434. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9435. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9436. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9437. ELSE
  9438. HALT(201)
  9439. END;
  9440. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9441. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9442. Designate(right,rightO);
  9443. Designate(left,leftO);
  9444. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9445. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9446. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9447. ELSE
  9448. AssignMathArray(left,right);
  9449. END;
  9450. ELSE
  9451. HALT(200);
  9452. END;
  9453. END Assign;
  9454. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9455. BEGIN
  9456. IF Trace THEN TraceEnter("VisitAssignment") END;
  9457. Assign(x.left,x.right);
  9458. IF Trace THEN TraceExit("VisitAssignment") END;
  9459. END VisitAssignment;
  9460. PROCEDURE EmitCooperativeSwitch;
  9461. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9462. BEGIN
  9463. ASSERT (cooperativeSwitches);
  9464. pc := section.pc;
  9465. IF lastSwitchPC = section.pc THEN RETURN END;
  9466. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9467. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9468. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9469. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9470. INC(statCoopSwitch, section.pc - pc);
  9471. END EmitCooperativeSwitch;
  9472. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9473. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9474. BEGIN
  9475. p0 := communication.left; p1 := communication.right;
  9476. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9477. Evaluate(p0,s0);
  9478. Evaluate(p1,s1);
  9479. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9480. Emit(Push(position,s0.op));
  9481. Emit(Push(position,s1.op));
  9482. (*
  9483. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9484. *)
  9485. IF ~backend.cellsAreObjects THEN
  9486. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9487. END;
  9488. ReleaseOperand(s0);
  9489. ReleaseOperand(s1);
  9490. IF backend.cellsAreObjects THEN
  9491. CallThis(position,"ActiveCellsRuntime","Send",2);
  9492. ELSE
  9493. CallThis(position,ChannelModuleName,"Send",2);
  9494. END;
  9495. (* ----- RECEIVE ------*)
  9496. ELSE
  9497. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9498. tmp := p0; p0 := p1; p1 := tmp;
  9499. END;
  9500. Evaluate(p0,s0);
  9501. Emit(Push(position,s0.op));
  9502. Designate(p1,s1);
  9503. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9504. Emit(Push(position,s1.op));
  9505. (*
  9506. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9507. *)
  9508. IF ~backend.cellsAreObjects THEN
  9509. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9510. END;
  9511. ReleaseOperand(s0);
  9512. ReleaseOperand(s1);
  9513. IF backend.cellsAreObjects THEN
  9514. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9515. ELSE
  9516. CallThis(position,ChannelModuleName,"Receive",2)
  9517. END;
  9518. END;
  9519. END VisitCommunicationStatement;
  9520. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9521. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9522. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9523. VAR true, false: Label; condition, value: BOOLEAN;
  9524. BEGIN
  9525. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9526. IF condition THEN
  9527. true := NewLabel();
  9528. false := NewLabel();
  9529. Condition(if.condition,true,false);
  9530. SetLabel(true);
  9531. StatementSequence(if.statements);
  9532. BrL(end);
  9533. SetLabel(false);
  9534. ELSE
  9535. IF value THEN (* always true *)
  9536. escape := TRUE;
  9537. StatementSequence(if.statements);
  9538. (* no branch necessary -- rest skipped *)
  9539. END;
  9540. END;
  9541. END IfPart;
  9542. BEGIN
  9543. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9544. end := NewLabel();
  9545. elsifs := x.ElsifParts();
  9546. IfPart(x.ifPart);
  9547. FOR i := 0 TO elsifs-1 DO
  9548. IF ~escape THEN
  9549. elsif := x.GetElsifPart(i);
  9550. IfPart(elsif);
  9551. END;
  9552. END;
  9553. IF (x.elsePart # NIL) & ~escape THEN
  9554. StatementSequence(x.elsePart);
  9555. END;
  9556. SetLabel(end);
  9557. IF Trace THEN TraceExit("VisitIfStatement") END;
  9558. END VisitIfStatement;
  9559. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9560. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9561. BEGIN
  9562. (*IF x.variable.type.resolved = x.type.resolved THEN
  9563. (* always true, do nothing *)
  9564. ELSE*)
  9565. Designate(x.variable,res);
  9566. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9567. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9568. END;
  9569. trueL := NewLabel();
  9570. TypeTest(res.tag,x.type,trueL,falseL);
  9571. ReleaseOperand(res);
  9572. SetLabel(trueL);
  9573. StatementSequence(x.statements);
  9574. BrL(endL);
  9575. END WithPart;
  9576. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9577. VAR endL,falseL: Label;i: LONGINT;
  9578. BEGIN
  9579. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9580. endL := NewLabel();
  9581. FOR i := 0 TO x.WithParts()-1 DO
  9582. falseL := NewLabel();
  9583. WithPart(x.GetWithPart(i),falseL,endL);
  9584. SetLabel(falseL);
  9585. END;
  9586. IF x.elsePart = NIL THEN
  9587. IF ~isUnchecked THEN
  9588. EmitTrap(position,WithTrap);
  9589. END;
  9590. ELSE
  9591. StatementSequence(x.elsePart)
  9592. END;
  9593. SetLabel(endL);
  9594. IF Trace THEN TraceExit("VisitWithStatement") END;
  9595. END VisitWithStatement;
  9596. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9597. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9598. out,else: Label; label: Label;
  9599. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9600. symbol: SyntaxTree.Symbol;
  9601. BEGIN
  9602. (*! split case statement into if-elsif statements for large case label lists *)
  9603. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9604. range := x.max-x.min+1;
  9605. IF (range<0) OR (range > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9606. END;
  9607. size := LONGINT(range);
  9608. Evaluate(x.variable,var);
  9609. ReuseCopy(tmp,var.op);
  9610. ReleaseIntermediateOperand(var.op);
  9611. var.op := tmp;
  9612. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9613. Convert(var.op,addressType);
  9614. else := NewLabel();
  9615. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9616. (*
  9617. UniqueId(name,module.module,"case",caseId);
  9618. *)
  9619. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9620. Global.GetModuleSegmentedName(module.module, name);
  9621. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9622. symbol := SyntaxTree.NewSymbol(name[1]);
  9623. symbol.SetScope(moduleScope);
  9624. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9625. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9626. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9627. ReuseCopy(res,var.op);
  9628. ReleaseOperand(var);
  9629. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9630. Emit(Add(position,res,res,jmp));
  9631. IntermediateCode.MakeMemory(res,addressType);
  9632. Emit(Br(position,res));
  9633. ReleaseIntermediateOperand(res);
  9634. out := NewLabel();
  9635. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9636. part := x.GetCasePart(i);
  9637. constant := part.firstConstant;
  9638. label := NewLabel();
  9639. SetLabel(label);
  9640. WHILE(constant # NIL) DO (* case labels for this case part *)
  9641. FOR j := constant.min TO constant.max DO
  9642. fixups[j-x.min] := label;
  9643. END;
  9644. constant := constant.next;
  9645. END;
  9646. StatementSequence(part.statements);
  9647. BrL(out);
  9648. END;
  9649. SetLabel(else);
  9650. FOR i := 0 TO size-1 DO
  9651. IF fixups[i] = NIL THEN
  9652. fixups[i] := else;
  9653. END;
  9654. END;
  9655. IF x.elsePart # NIL THEN
  9656. StatementSequence(x.elsePart);
  9657. ELSIF ~isUnchecked THEN
  9658. EmitTrap(position,CaseTrap);
  9659. END;
  9660. SetLabel(out);
  9661. FOR i := 0 TO size-1 DO
  9662. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9663. section.Emit(Data(position,op));
  9664. END;
  9665. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9666. END VisitCaseStatement;
  9667. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9668. VAR start: Label; true,false: Label;
  9669. BEGIN
  9670. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9671. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9672. start := NewLabel();
  9673. true := NewLabel();
  9674. false := NewLabel();
  9675. SetLabel(start);
  9676. Condition(x.condition,true,false);
  9677. SetLabel(true);
  9678. StatementSequence(x.statements);
  9679. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9680. BrL(start);
  9681. SetLabel(false);
  9682. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9683. END VisitWhileStatement;
  9684. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9685. VAR false,true: Label;
  9686. BEGIN
  9687. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9688. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9689. true := NewLabel();
  9690. false := NewLabel();
  9691. SetLabel(false);
  9692. StatementSequence(x.statements);
  9693. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9694. Condition(x.condition,true,false);
  9695. SetLabel(true);
  9696. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9697. END VisitRepeatStatement;
  9698. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9699. VAR
  9700. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9701. temporaryVariable: SyntaxTree.Variable;
  9702. temporaryVariableDesignator : SyntaxTree.Designator;
  9703. BEGIN
  9704. IF Trace THEN TraceEnter("VisitForStatement") END;
  9705. true := NewLabel();
  9706. false := NewLabel();
  9707. start := NewLabel();
  9708. Assign(x.variable,x.from);
  9709. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9710. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9711. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9712. Assign(temporaryVariableDesignator,x.to);
  9713. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  9714. IF by > 0 THEN
  9715. cmp := Scanner.LessEqual
  9716. ELSE
  9717. cmp := Scanner.GreaterEqual
  9718. END;
  9719. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9720. binary.SetType(system.booleanType);
  9721. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9722. SetLabel(start);
  9723. Condition(binary,true,false);
  9724. SetLabel(true);
  9725. StatementSequence(x.statements);
  9726. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9727. binary.SetType(x.variable.type);
  9728. Assign(x.variable,binary);
  9729. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9730. BrL(start);
  9731. SetLabel(false);
  9732. IF Trace THEN TraceExit("VisitForStatement") END;
  9733. END VisitForStatement;
  9734. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9735. VAR prevLoop: Label;
  9736. BEGIN
  9737. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9738. prevLoop := currentLoop;
  9739. currentLoop := NewLabel();
  9740. StatementSequence(x.statements);
  9741. SetLabel(currentLoop);
  9742. currentLoop := prevLoop;
  9743. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9744. END VisitExitableBlock;
  9745. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9746. VAR prevLoop,start: Label;
  9747. BEGIN
  9748. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9749. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9750. start := NewLabel();
  9751. prevLoop := currentLoop;
  9752. SetLabel(start);
  9753. currentLoop := NewLabel();
  9754. StatementSequence(x.statements);
  9755. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9756. BrL(start);
  9757. SetLabel(currentLoop);
  9758. currentLoop := prevLoop;
  9759. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9760. END VisitLoopStatement;
  9761. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9762. VAR outer: SyntaxTree.Statement;
  9763. BEGIN
  9764. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9765. IF locked THEN (* r if we jump out of an exclusive block *)
  9766. outer := x.outer;
  9767. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9768. outer := outer.outer;
  9769. END;
  9770. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9771. Lock(FALSE);
  9772. END;
  9773. END;
  9774. BrL(currentLoop);
  9775. IF Trace THEN TraceExit("VisitExitStatement") END;
  9776. END VisitExitStatement;
  9777. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9778. VAR
  9779. expression, parameterDesignator: SyntaxTree.Expression;
  9780. type, componentType: SyntaxTree.Type;
  9781. res, right: Operand;
  9782. left, mem, reg: IntermediateCode.Operand;
  9783. parameter: SyntaxTree.Parameter;
  9784. procedure: SyntaxTree.Procedure;
  9785. procedureType: SyntaxTree.ProcedureType;
  9786. returnTypeOffset: LONGINT;
  9787. delegate: BOOLEAN;
  9788. map: SymbolMap;
  9789. callingConvention, parametersSize: LONGINT;
  9790. BEGIN
  9791. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9792. expression := x.returnValue;
  9793. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9794. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9795. IF currentIsInline THEN
  9796. IF expression # NIL THEN
  9797. map := currentMapper.Get(NIL);
  9798. IF map # NIL THEN
  9799. Assign(map.to, expression);
  9800. ELSE
  9801. Evaluate(expression,res);
  9802. Emit(Return(position,res.op));
  9803. ReleaseOperand(res);
  9804. END;
  9805. END;
  9806. BrL(currentInlineExit);
  9807. RETURN;
  9808. END;
  9809. IF expression # NIL THEN
  9810. type := expression.type.resolved;
  9811. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9812. IF locked THEN Lock(FALSE) END;
  9813. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9814. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9815. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9816. 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
  9817. (* return without structured return parameter *)
  9818. Evaluate(expression,res);
  9819. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9820. IF locked OR profile THEN
  9821. Emit(Push(position,res.op));
  9822. IF delegate THEN HALT(200) END;
  9823. ReleaseOperand(res);
  9824. IF locked THEN Lock(FALSE) END;
  9825. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9826. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9827. reg := NewRegisterOperand(res.op.type);
  9828. Emit(Pop(position,reg));
  9829. Emit(Return(position,reg));
  9830. ReleaseIntermediateOperand(reg);
  9831. ELSE
  9832. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9833. Emit(Return(position,res.op));
  9834. ReleaseOperand(res);
  9835. END;
  9836. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9837. THEN
  9838. (* return using structured return parameter *)
  9839. 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)
  9840. OR SemanticChecker.IsPointerType(type));
  9841. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9842. parameter :=procedureType.returnParameter;
  9843. ASSERT(parameter # NIL);
  9844. returnTypeOffset := parameter.offsetInBits;
  9845. (*
  9846. IF parameter# NIL THEN
  9847. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9848. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9849. ELSE
  9850. returnTypeOffset := system.offsetFirstParameter
  9851. END;
  9852. *)
  9853. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9854. IF type IS SyntaxTree.RangeType THEN
  9855. (* array range type *)
  9856. Evaluate(expression, right);
  9857. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9858. Emit(Mov(position,mem, right.op)); (* first *)
  9859. ReleaseIntermediateOperand(mem);
  9860. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9861. Emit(Mov(position,mem, right.tag)); (* last *)
  9862. ReleaseIntermediateOperand(mem);
  9863. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9864. Emit(Mov(position,mem, right.extra)); (* step *)
  9865. ReleaseIntermediateOperand(mem);
  9866. ReleaseOperand(right);
  9867. ELSIF type IS SyntaxTree.ComplexType THEN
  9868. Evaluate(expression, right);
  9869. componentType := type(SyntaxTree.ComplexType).componentType;
  9870. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9871. Emit(Mov(position,mem, right.op)); (* real part *)
  9872. ReleaseIntermediateOperand(mem);
  9873. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9874. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9875. ReleaseIntermediateOperand(mem);
  9876. ReleaseOperand(right);
  9877. ELSE (* covers cases: pointer / record / array *)
  9878. parameter := procedureType.returnParameter;
  9879. checker.SetCurrentScope(currentScope);
  9880. ASSERT(parameter # NIL);
  9881. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9882. Assign(parameterDesignator,expression);
  9883. END;
  9884. ReleaseIntermediateOperand(left);
  9885. IF locked THEN Lock(FALSE) END;
  9886. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9887. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9888. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9889. parameter := procedureType.returnParameter;
  9890. checker.SetCurrentScope(currentScope);
  9891. IF parameter = NIL THEN
  9892. Error(procedure.position, "structured return of parameter of procedure not found");
  9893. ELSE
  9894. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9895. Assign(parameterDesignator,expression);
  9896. END;
  9897. IF locked THEN Lock(FALSE) END;
  9898. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9899. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9900. ELSE
  9901. HALT(200);
  9902. END;
  9903. ELSE
  9904. IF locked THEN Lock(FALSE) END;
  9905. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9906. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9907. END;
  9908. IF backend.cooperative THEN
  9909. BrL(exitLabel);
  9910. ELSE
  9911. callingConvention := procedureType.callingConvention;
  9912. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  9913. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9914. ELSE
  9915. parametersSize := 0;
  9916. END;
  9917. EmitLeave(section, position,procedure, callingConvention);
  9918. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  9919. END;
  9920. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9921. END VisitReturnStatement;
  9922. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9923. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9924. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9925. statements: SyntaxTree.StatementSequence;
  9926. name, suffix: SyntaxTree.IdentifierString;
  9927. BEGIN
  9928. Strings.IntToStr(awaitProcCounter,suffix);
  9929. Strings.Concat("@AwaitProcedure",suffix,name);
  9930. identifier := SyntaxTree.NewIdentifier(name);
  9931. INC(awaitProcCounter);
  9932. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9933. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9934. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9935. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9936. procedure.SetAccess(SyntaxTree.Hidden);
  9937. procedure.SetScope(currentScope);
  9938. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9939. procedureType.SetReturnType(system.booleanType);
  9940. procedure.SetType(procedureType);
  9941. body := SyntaxTree.NewBody(x.position,procedureScope);
  9942. procedureScope.SetBody(body);
  9943. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9944. returnStatement.SetReturnValue(x.condition);
  9945. statements := SyntaxTree.NewStatementSequence();
  9946. statements.AddStatement(returnStatement);
  9947. body.SetStatementSequence(statements);
  9948. currentScope.AddProcedure(procedure);
  9949. RETURN procedure
  9950. END MakeAwaitProcedure;
  9951. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  9952. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9953. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9954. BEGIN
  9955. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9956. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9957. IF backend.cooperative THEN
  9958. start := NewLabel();
  9959. true := NewLabel();
  9960. false := NewLabel();
  9961. SetLabel(start);
  9962. Condition(x.condition,true,false);
  9963. SetLabel(false);
  9964. PushSelfPointer();
  9965. CallThis(position,"ExclusiveBlocks","Await",1);
  9966. BrL(start);
  9967. SetLabel(true);
  9968. PushSelfPointer();
  9969. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  9970. ELSE
  9971. proc := MakeAwaitProcedure(x);
  9972. Emit(Push(position,fp));
  9973. GetCodeSectionNameForSymbol(proc,name);
  9974. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9975. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  9976. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  9977. Emit(Call(position,call,ProcParametersSize(proc)));
  9978. Emit(Result(position,res));
  9979. (*
  9980. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9981. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  9982. *)
  9983. InitOperand(result,ModeValue);
  9984. result.op := res;
  9985. label := NewLabel();
  9986. BreqL(label, result.op, SELF.true);
  9987. ReleaseOperand(result);
  9988. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  9989. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  9990. Emit(Push(position,res));
  9991. Emit(Push(position,fp));
  9992. PushSelfPointer();
  9993. Emit(Push(position,nil));
  9994. CallThis(position,"Objects","Await",4);
  9995. SetLabel(label);
  9996. END;
  9997. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  9998. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  9999. END VisitAwaitStatement;
  10000. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  10001. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  10002. BEGIN
  10003. FOR i := 0 TO x.Length() - 1 DO
  10004. statement := x.GetStatement( i );
  10005. Statement(statement);
  10006. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  10007. END;
  10008. END StatementSequence;
  10009. PROCEDURE PushSelfPointer;
  10010. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  10011. procedureType: SyntaxTree.ProcedureType;
  10012. BEGIN
  10013. scope := currentScope;
  10014. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  10015. scope := scope.outerScope;
  10016. END;
  10017. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  10018. moduleSection := meta.ModuleSection();
  10019. IF backend.cooperative THEN
  10020. moduleOffset := 0;
  10021. ELSE
  10022. moduleOffset := moduleSection.pc;
  10023. END;
  10024. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  10025. ELSE
  10026. GetBaseRegister(op.op,currentScope,scope);
  10027. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10028. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10029. parametersSize := ProcParametersSize(procedure);
  10030. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  10031. IF backend.cooperative THEN
  10032. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  10033. END;
  10034. IntermediateCode.MakeMemory(op.op,addressType);
  10035. END;
  10036. Emit(Push(position,op.op));
  10037. ReleaseOperand(op);
  10038. END PushSelfPointer;
  10039. PROCEDURE Lock(lock: BOOLEAN);
  10040. BEGIN
  10041. IF Trace THEN TraceEnter("Lock") END;
  10042. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10043. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  10044. ASSERT(modifyAssignmentCounter = 0);
  10045. IF dump # NIL THEN
  10046. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  10047. dump.Ln;dump.Update;
  10048. END;
  10049. PushSelfPointer;
  10050. IF backend.cooperative THEN
  10051. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  10052. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  10053. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  10054. END;
  10055. ELSE
  10056. Emit(Push(position,true));
  10057. IF lock THEN CallThis(position,"Objects","Lock",2)
  10058. ELSE CallThis(position,"Objects","Unlock",2);
  10059. END;
  10060. END;
  10061. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10062. IF Trace THEN TraceExit("Lock") END;
  10063. END Lock;
  10064. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  10065. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  10066. BEGIN
  10067. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  10068. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10069. previouslyUnchecked := isUnchecked;
  10070. isUnchecked := isUnchecked OR x.isUnchecked;
  10071. previouslyCooperativeSwitches := cooperativeSwitches;
  10072. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  10073. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  10074. IF x.statements # NIL THEN
  10075. StatementSequence(x.statements);
  10076. END;
  10077. IF (x IS SyntaxTree.Body) THEN
  10078. IF (x(SyntaxTree.Body).finally # NIL) THEN
  10079. section.SetFinally(section.pc);
  10080. StatementSequence(x(SyntaxTree.Body).finally)
  10081. ELSIF x.isExclusive THEN
  10082. end := NewLabel();
  10083. BrL(end);
  10084. section.SetFinally(section.pc);
  10085. Lock(FALSE);
  10086. EmitTrap(position,RethrowTrap);
  10087. SetLabel(end);
  10088. END;
  10089. END;
  10090. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10091. isUnchecked := previouslyUnchecked;
  10092. cooperativeSwitches := previouslyCooperativeSwitches;
  10093. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10094. END VisitStatementBlock;
  10095. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10096. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10097. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10098. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10099. procedure: SyntaxTree.Procedure;
  10100. map: SymbolMap;
  10101. callingConvention, parametersSize: LONGINT;
  10102. BEGIN
  10103. scope := currentScope;
  10104. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10105. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10106. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10107. return := emptyOperand;
  10108. IF Trace THEN TraceEnter("VisitCode") END;
  10109. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10110. NEW(in, x.inRules.Length());
  10111. FOR i := 0 TO LEN(in)-1 DO
  10112. statement := x.inRules.GetStatement(i);
  10113. WITH statement: SyntaxTree.Assignment DO
  10114. Evaluate(statement.right, operand);
  10115. result := operand.op;
  10116. NEW(str, 64);
  10117. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10118. in[i] := result; IntermediateCode.SetString(in[i], str);
  10119. ReleaseIntermediateOperand(operand.tag);
  10120. END;
  10121. END;
  10122. ELSE in := NIL
  10123. END;
  10124. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10125. NEW(out, x.outRules.Length());
  10126. FOR i := 0 TO LEN(out)-1 DO
  10127. statement := x.outRules.GetStatement(i);
  10128. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10129. WITH statement: SyntaxTree.Assignment DO
  10130. Designate(statement.left, operand);
  10131. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10132. NEW(str, 64);
  10133. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10134. out[i] := result; IntermediateCode.SetString(out[i], str);
  10135. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10136. |statement: SyntaxTree.ReturnStatement DO
  10137. NEW(str, 64);
  10138. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10139. IF currentIsInline THEN
  10140. map := currentMapper.Get(NIL);
  10141. Designate(map.to, operand);
  10142. IF map.isAddress THEN
  10143. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10144. ELSE
  10145. result := operand.op;
  10146. END;
  10147. (*! only if it does not fit into register
  10148. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10149. *)
  10150. (*Evaluate(map.to, operand);*)
  10151. out[i] := result;
  10152. ELSE
  10153. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10154. END;
  10155. IntermediateCode.SetString(out[i], str);
  10156. ReleaseIntermediateOperand(operand.tag);
  10157. return := out[i];
  10158. ELSE
  10159. END;
  10160. END;
  10161. ELSE out := NIL
  10162. END;
  10163. Emit(Asm(x.position,x.sourceCode, in, out));
  10164. IF in # NIL THEN
  10165. FOR i := 0 TO LEN(in)-1 DO
  10166. ReleaseIntermediateOperand(in[i]);
  10167. END;
  10168. END;
  10169. IF out # NIL THEN
  10170. FOR i := 0 TO LEN(out)-1 DO
  10171. WITH statement: SyntaxTree.Assignment DO
  10172. ReleaseIntermediateOperand(out[i]);
  10173. |statement: SyntaxTree.ReturnStatement DO
  10174. (* release happens below *)
  10175. ELSE
  10176. END;
  10177. statement := x.outRules.GetStatement(i);
  10178. END;
  10179. END;
  10180. IF return.mode # IntermediateCode.Undefined THEN
  10181. IF currentIsInline THEN
  10182. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10183. Symbol(procedureType.returnParameter, par);
  10184. MakeMemory(mem, par.op, return.type, 0);
  10185. ReleaseOperand(par);
  10186. Emit(Mov(position, mem, return));
  10187. ReleaseIntermediateOperand(mem);
  10188. ELSE
  10189. Emit(Return(position,return));
  10190. END;
  10191. ReleaseIntermediateOperand(return);
  10192. IF currentIsInline THEN RETURN END;
  10193. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10194. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10195. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10196. ELSE
  10197. parametersSize := 0;
  10198. END;
  10199. EmitLeave(section, position,procedure, callingConvention);
  10200. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10201. END;
  10202. IF Trace THEN TraceExit("VisitCode") END;
  10203. END VisitCode;
  10204. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  10205. BEGIN
  10206. RETURN ProcedureParametersSize(system, procedure);
  10207. END ProcParametersSize;
  10208. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10209. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10210. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10211. const, call: IntermediateCode.Operand;
  10212. parameterDesignator: SyntaxTree.Expression;
  10213. saved: RegisterEntry;
  10214. name: Basic.SegmentedName;
  10215. BEGIN
  10216. IF Trace THEN TraceEnter("ParameterCopies") END;
  10217. parameter := x.firstParameter;
  10218. WHILE parameter # NIL DO
  10219. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10220. type := parameter.type.resolved;
  10221. IF IsOpenArray(type) THEN
  10222. VisitParameter(parameter);
  10223. op := result;
  10224. IF backend.cooperative & parameter.NeedsTrace() THEN
  10225. length := GetArrayLength(type, op.tag);
  10226. size := NewRegisterOperand(addressType);
  10227. base := ArrayBaseType(type);
  10228. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10229. Emit(Mul(position, size, length, const));
  10230. dst := NewRegisterOperand (addressType);
  10231. Emit(Mov(position, dst, size));
  10232. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10233. Emit(Sub(position,dst,sp,dst));
  10234. Emit(And(position,dst,dst,const));
  10235. Emit(Mov(position,sp,dst));
  10236. par := fp;
  10237. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10238. IntermediateCode.InitImmediate(null, byteType, 0);
  10239. Emit(Fill(position, dst, size, null));
  10240. ReleaseIntermediateOperand(dst);
  10241. ReleaseIntermediateOperand(length);
  10242. SaveRegisters();ReleaseUsedRegisters(saved);
  10243. (* register dst has been freed before SaveRegisters already *)
  10244. base := ArrayBaseType(type);
  10245. (* assign method of open array *)
  10246. IF base.IsRecordType() THEN
  10247. Emit (Push(position, length));
  10248. Emit (Push(position, dst));
  10249. Emit (Push(position, op.op));
  10250. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10251. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10252. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10253. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10254. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10255. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10256. Emit (Push(position,length));
  10257. Emit (Push(position, dst));
  10258. Emit (Push(position, length));
  10259. Emit (Push(position, op.op));
  10260. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10261. ELSE
  10262. Emit (Push(position, length));
  10263. Emit (Push(position, dst));
  10264. Emit (Push(position, length));
  10265. Emit (Push(position, op.op));
  10266. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10267. ASSERT(ArrayBaseType(type).IsPointer());
  10268. END;
  10269. RestoreRegisters(saved);
  10270. ELSE
  10271. temp := GetDynamicSize(type,op.tag);
  10272. ReuseCopy(size,temp);
  10273. ReleaseIntermediateOperand(temp);
  10274. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10275. Emit(Sub(position,size,sp,size));
  10276. Emit(And(position,size,size,const));
  10277. Emit(Mov(position,sp,size));
  10278. par := fp;
  10279. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10280. ReleaseIntermediateOperand(size);
  10281. size := GetDynamicSize(type,op.tag);
  10282. END;
  10283. Emit(Copy(position,sp,op.op,size));
  10284. ReleaseIntermediateOperand(size);
  10285. ReleaseOperand(op);
  10286. IntermediateCode.MakeMemory(par,addressType);
  10287. Emit(Mov(position,par,sp));
  10288. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10289. checker.SetCurrentScope(currentScope);
  10290. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10291. Assign(parameterDesignator,parameterDesignator);
  10292. END;
  10293. END;
  10294. parameter := parameter.nextParameter;
  10295. END;
  10296. IF Trace THEN TraceExit("ParameterCopies") END;
  10297. END ParameterCopies;
  10298. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10299. VAR x: SyntaxTree.Variable;
  10300. BEGIN
  10301. x := scope.firstVariable;
  10302. WHILE x # NIL DO
  10303. InitVariable(x,FALSE);
  10304. x := x.nextVariable;
  10305. END;
  10306. END InitVariables;
  10307. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10308. BEGIN
  10309. IF (symbol # NIL) THEN
  10310. RETURN fingerPrinter.SymbolFP(symbol).public
  10311. ELSE
  10312. RETURN 0
  10313. END;
  10314. END GetFingerprint;
  10315. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10316. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10317. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10318. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10319. name: Basic.SegmentedName;
  10320. offset: LONGINT;
  10321. BEGIN
  10322. IF Trace THEN TraceEnter("Body") END;
  10323. ReleaseUsedRegisters(saved); (* just in case ... *)
  10324. section := ir;
  10325. exitLabel := NewLabel ();
  10326. IF moduleBody THEN moduleBodySection := section END;
  10327. IF ir.comments # NIL THEN
  10328. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10329. commentPrintout.SingleStatement(TRUE);
  10330. dump := ir.comments;
  10331. ELSE
  10332. commentPrintout := NIL;
  10333. dump := NIL;
  10334. END;
  10335. prevScope := currentScope;
  10336. currentScope := scope;
  10337. lastSwitchPC := 0;
  10338. cooperativeSwitches := backend.cooperative;
  10339. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10340. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10341. IF x # NIL THEN
  10342. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10343. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10344. IF moduleBody THEN
  10345. ProfilerInit();
  10346. ELSE
  10347. Basic.SegmentedNameToString(ir.name, string);
  10348. ProfilerAddProcedure(numberProcedures,string);
  10349. ProfilerEnterExit(numberProcedures,TRUE);
  10350. END;
  10351. END;
  10352. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10353. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10354. END;
  10355. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10356. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10357. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10358. IF procedure = cellScope.bodyProcedure THEN
  10359. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10360. StaticCallOperand(op, cellScope.constructor);
  10361. Emit(Call(position,op.op,0));
  10362. END;
  10363. END;
  10364. END;
  10365. InitVariables(scope);
  10366. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10367. GetCodeSectionNameForSymbol(procedure, name);
  10368. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10369. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10370. IF ProtectModulesPointers THEN
  10371. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10372. ELSE
  10373. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10374. END;
  10375. IntermediateCode.SetOffset(right,offset); (* tag *)
  10376. IntermediateCode.InitMemory(left,addressType,fp,0);
  10377. Emit(Mov(position, left, right));
  10378. END;
  10379. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  10380. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10381. ParameterCopies(procedureType);
  10382. IF x.code = NIL THEN
  10383. VisitStatementBlock(x);
  10384. ELSE
  10385. VisitCode(x.code)
  10386. END;
  10387. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10388. IF ~backend.cooperative THEN
  10389. ProfilerEnterExit(numberProcedures,FALSE);
  10390. END;
  10391. INC(numberProcedures);
  10392. END;
  10393. END;
  10394. IF backend.cooperative THEN
  10395. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10396. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10397. END;
  10398. IF x # NIL THEN
  10399. SELF.position := x.position;
  10400. END;
  10401. CheckRegistersFree();
  10402. ASSERT(modifyAssignmentCounter = 0);
  10403. currentScope := prevScope;
  10404. IF Trace THEN TraceExit("Body") END;
  10405. END Body;
  10406. END ImplementationVisitor;
  10407. MetaDataGenerator=OBJECT
  10408. VAR
  10409. implementationVisitor: ImplementationVisitor;
  10410. declarationVisitor: DeclarationVisitor;
  10411. module: Sections.Module;
  10412. moduleName: ARRAY 128 OF CHAR;
  10413. moduleNamePool: Basic.HashTableInt;
  10414. moduleNamePoolSection: IntermediateCode.Section;
  10415. modulePointerSection: IntermediateCode.Section;
  10416. modulePointerSizePC: LONGINT;
  10417. modulePointerSectionOffset: LONGINT;
  10418. modulePointers: LONGINT;
  10419. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  10420. RecordBaseOffset: LONGINT;
  10421. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10422. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10423. TypeTags: LONGINT; (* type extension level support *)
  10424. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10425. patchInfoPC: LONGINT;
  10426. patchCRC: LONGINT;
  10427. CONST
  10428. EmptyBlockOffset = 2;
  10429. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10430. BEGIN
  10431. IF implementationVisitor.backend.cooperative THEN
  10432. TypeTags := MAX(LONGINT);
  10433. BaseTypesTableOffset := 0;
  10434. MethodTableOffset := 2;
  10435. TypeRecordBaseOffset := 0;
  10436. RecordBaseOffset := 0;
  10437. ELSIF simple THEN
  10438. TypeTags := 3; (* only 3 extensions allowed *)
  10439. BaseTypesTableOffset := 1;
  10440. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10441. TypeRecordBaseOffset := 0;
  10442. RecordBaseOffset := 1;
  10443. ELSE
  10444. TypeTags := 16;
  10445. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10446. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10447. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10448. (* change this when Heaps.HeapBlock is modified *)
  10449. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  10450. RecordBaseOffset := 8; (* addresses *)
  10451. ELSE
  10452. RecordBaseOffset := 9; (* addresses *)
  10453. END;
  10454. END;
  10455. SELF.simple := simple;
  10456. SELF.implementationVisitor := implementationVisitor;
  10457. SELF.declarationVisitor := declarationVisitor;
  10458. implementationVisitor.meta := SELF;
  10459. declarationVisitor.meta := SELF;
  10460. END InitMetaDataGenerator;
  10461. PROCEDURE SetModule(module: Sections.Module);
  10462. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10463. BEGIN
  10464. SELF.module := module;
  10465. Global.GetModuleName(module.module,moduleName);
  10466. Global.GetSymbolSegmentedName(module.module, name);
  10467. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  10468. NEW(moduleNamePool, 32);
  10469. (*! require GC protection *)
  10470. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10471. IF ProtectModulesPointers THEN
  10472. name := "Heaps.AnyPtr";
  10473. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10474. (* set base pointer *)
  10475. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10476. END;
  10477. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10478. modulePointers := 0;
  10479. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10480. AddPointer(moduleNamePoolSection, namePoolOffset);
  10481. END;
  10482. END SetModule;
  10483. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10484. BEGIN
  10485. IF ~implementationVisitor.backend.cooperative THEN
  10486. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10487. INC(modulePointers);
  10488. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10489. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10490. END;
  10491. END AddPointer;
  10492. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10493. BEGIN
  10494. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10495. END GetTypeRecordBaseOffset;
  10496. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10497. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10498. BEGIN
  10499. (* change this when Heaps.HeapBlock is modified *)
  10500. INC(dataAdrOffset,7);
  10501. Info(section,"headerAdr");
  10502. Address(section,0);
  10503. Info(section,"typeDesc");
  10504. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10505. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10506. NamedSymbol(section, name, symbol, 0, offset);
  10507. Info(section,"mark: LONGINT;");
  10508. Longint(section,-1);
  10509. Info(section,"refCount: LONGINT;");
  10510. Longint(section,0);
  10511. (*
  10512. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10513. *)
  10514. Info(section,"dataAdr-: ADDRESS");
  10515. Symbol(section,section, dataAdrOffset,0);
  10516. Info(section,"size-: SIZE");
  10517. Address(section,0);
  10518. Info(section,"nextMark: HeapBlock;");
  10519. Address(section,0);
  10520. END HeapBlock;
  10521. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10522. VAR i: LONGINT;
  10523. BEGIN
  10524. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10525. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10526. Info(section,"count*: LONGINT");
  10527. Longint(section,0);
  10528. Info(section,"locked*: BOOLEAN");
  10529. Longint(section,0);
  10530. Info(section,"awaitingLock*: ProcessQueue");
  10531. Address(section,0);
  10532. Address(section,0);
  10533. Info(section,"awaitingCond*: ProcessQueue");
  10534. Address(section,0);
  10535. Address(section,0);
  10536. Info(section,"lockedBy*: ANY");
  10537. Address(section,0);
  10538. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10539. Longint(section,1);
  10540. FOR i := 2 TO 6 DO
  10541. Longint(section,0);
  10542. END;
  10543. Info(section,"lock*: ANY");
  10544. Address(section,0);
  10545. END ProtectedHeapBlock;
  10546. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10547. BEGIN
  10548. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10549. END Info;
  10550. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10551. VAR op: IntermediateCode.Operand;
  10552. BEGIN
  10553. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10554. section.Emit(Data(Basic.invalidPosition,op));
  10555. END Address;
  10556. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10557. VAR op: IntermediateCode.Operand;
  10558. BEGIN
  10559. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10560. section.Emit(Data(Basic.invalidPosition,op));
  10561. END Size;
  10562. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  10563. VAR op: IntermediateCode.Operand;
  10564. BEGIN
  10565. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  10566. section.Emit(Data(Basic.invalidPosition,op));
  10567. END Set;
  10568. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10569. VAR op: IntermediateCode.Operand;
  10570. BEGIN
  10571. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10572. section.Emit(Data(Basic.invalidPosition,op));
  10573. END Longint;
  10574. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10575. VAR op,noOperand: IntermediateCode.Operand;
  10576. BEGIN
  10577. IntermediateCode.InitOperand(noOperand);
  10578. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10579. section.PatchOperands(pc,op,noOperand,noOperand);
  10580. END PatchAddress;
  10581. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10582. VAR op,noOperand: IntermediateCode.Operand;
  10583. BEGIN
  10584. IntermediateCode.InitOperand(noOperand);
  10585. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10586. section.PatchOperands(pc,op,noOperand,noOperand);
  10587. END PatchSize;
  10588. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10589. VAR op,noOperand: IntermediateCode.Operand;
  10590. BEGIN
  10591. IntermediateCode.InitOperand(noOperand);
  10592. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10593. section.PatchOperands(pc,op,noOperand,noOperand);
  10594. END PatchLongint;
  10595. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10596. VAR op, noOperand: IntermediateCode.Operand;
  10597. BEGIN
  10598. IntermediateCode.InitOperand(noOperand);
  10599. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10600. section.PatchOperands(pc,op,noOperand,noOperand);
  10601. END PatchSymbol;
  10602. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10603. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10604. BEGIN
  10605. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10606. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10607. section.Emit(Data(Basic.invalidPosition,op));
  10608. END Boolean;
  10609. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10610. VAR op: IntermediateCode.Operand;
  10611. BEGIN
  10612. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10613. section.Emit(Data(Basic.invalidPosition,op));
  10614. END Char;
  10615. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10616. VAR op: IntermediateCode.Operand;
  10617. BEGIN
  10618. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10619. section.Emit(Data(Basic.invalidPosition,op));
  10620. END Integer;
  10621. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10622. VAR i: LONGINT;
  10623. BEGIN
  10624. Info(section,str);
  10625. i := 0;
  10626. WHILE(str[i] # 0X) DO
  10627. Char(section,str[i]);
  10628. INC(i);
  10629. END;
  10630. Char(section,0X);
  10631. END String;
  10632. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10633. VAR s: Basic.SectionName;
  10634. BEGIN
  10635. StringPool.GetString(str, s);
  10636. String(section, s);
  10637. END String0;
  10638. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10639. VAR op: IntermediateCode.Operand;
  10640. BEGIN
  10641. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10642. IntermediateCode.SetOffset(op,realOffset);
  10643. section.Emit(Data(Basic.invalidPosition,op));
  10644. END NamedSymbol;
  10645. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10646. VAR op: IntermediateCode.Operand;
  10647. BEGIN
  10648. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10649. IntermediateCode.SetOffset(op,realOffset);
  10650. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10651. END NamedSymbolAt;
  10652. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10653. BEGIN
  10654. IF symbol= NIL THEN
  10655. Address( section, realOffset);
  10656. ASSERT(virtualOffset = 0);
  10657. ELSE
  10658. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10659. END;
  10660. END Symbol;
  10661. (* OutPointers delivers
  10662. {pointerOffset}
  10663. *)
  10664. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10665. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10666. BEGIN
  10667. type := type.resolved;
  10668. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10669. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10670. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10671. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10672. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10673. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10674. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10675. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10676. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10677. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10678. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10679. ELSIF (type IS SyntaxTree.RecordType) THEN
  10680. (* never treat a record like a pointer, even if the pointer field is set! *)
  10681. WITH type: SyntaxTree.RecordType DO
  10682. base := type.GetBaseRecord();
  10683. IF base # NIL THEN
  10684. Pointers(offset,symbol,section, base,numberPointers);
  10685. END;
  10686. variable := type.recordScope.firstVariable;
  10687. WHILE(variable # NIL) DO
  10688. IF ~(variable.untraced) THEN
  10689. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10690. END;
  10691. variable := variable.nextVariable;
  10692. END;
  10693. END;
  10694. ELSIF (type IS SyntaxTree.CellType) THEN
  10695. WITH type: SyntaxTree.CellType DO
  10696. base := type.GetBaseRecord();
  10697. IF base # NIL THEN
  10698. Pointers(offset,symbol,section, base,numberPointers);
  10699. END;
  10700. variable := type.cellScope.firstVariable;
  10701. WHILE(variable # NIL) DO
  10702. IF ~(variable.untraced) THEN
  10703. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10704. END;
  10705. variable := variable.nextVariable;
  10706. END;
  10707. property := type.firstProperty;
  10708. WHILE(property # NIL) DO
  10709. IF ~(property.untraced) THEN
  10710. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10711. END;
  10712. property := property.nextProperty;
  10713. END;
  10714. parameter := type.firstParameter;
  10715. WHILE(parameter # NIL) DO
  10716. IF ~(parameter.untraced) THEN
  10717. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10718. END;
  10719. parameter := parameter.nextParameter;
  10720. END;
  10721. END;
  10722. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10723. WITH type: SyntaxTree.ArrayType DO
  10724. IF type.form= SyntaxTree.Static THEN
  10725. n := type.staticLength;
  10726. base := type.arrayBase.resolved;
  10727. WHILE(base IS SyntaxTree.ArrayType) DO
  10728. type := base(SyntaxTree.ArrayType);
  10729. n := n* type.staticLength;
  10730. base := type.arrayBase.resolved;
  10731. END;
  10732. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10733. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10734. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10735. FOR i := 0 TO n-1 DO
  10736. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10737. END;
  10738. END;
  10739. ELSE
  10740. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10741. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10742. END;
  10743. END;
  10744. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10745. WITH type: SyntaxTree.MathArrayType DO
  10746. IF type.form = SyntaxTree.Static THEN
  10747. n := type.staticLength;
  10748. base := type.arrayBase.resolved;
  10749. WHILE(base IS SyntaxTree.MathArrayType) DO
  10750. type := base(SyntaxTree.MathArrayType);
  10751. n := n* type.staticLength;
  10752. base := type.arrayBase.resolved;
  10753. END;
  10754. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10755. IF SemanticChecker.ContainsPointer(base) THEN
  10756. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10757. FOR i := 0 TO n-1 DO
  10758. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10759. END;
  10760. END;
  10761. ELSE
  10762. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10763. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10764. END
  10765. END;
  10766. (* ELSE no pointers in type *)
  10767. END;
  10768. END Pointers;
  10769. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10770. VAR position,i: LONGINT; ch: CHAR;
  10771. BEGIN
  10772. IF pool.Has(index) THEN
  10773. RETURN pool.GetInt(index)
  10774. ELSE
  10775. position := source.pc;
  10776. pool.PutInt(index, position);
  10777. Info(source, name);
  10778. i := 0;
  10779. REPEAT
  10780. ch := name[i]; INC(i);
  10781. Char( source, ch);
  10782. UNTIL ch = 0X;
  10783. END;
  10784. RETURN position;
  10785. END EnterDynamicName;
  10786. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10787. VAR name: Basic.SectionName; position: LONGINT;
  10788. BEGIN
  10789. IF pool.Has(index) THEN
  10790. RETURN pool.GetInt(index)
  10791. ELSE
  10792. StringPool.GetString(index, name);
  10793. position := EnterDynamicName(source,name,index, pool);
  10794. END;
  10795. RETURN position;
  10796. END DynamicName;
  10797. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10798. VAR section: IntermediateCode.Section;
  10799. BEGIN
  10800. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10801. IF implementationVisitor.backend.cooperative THEN
  10802. Info(section, "TypeDescriptor");
  10803. Basic.ToSegmentedName("BaseTypes.Array", name);
  10804. NamedSymbol(section, name,NIL, 0, 0);
  10805. BasePointer(section);
  10806. offset := 0;
  10807. ELSE
  10808. IF ProtectModulesPointers THEN
  10809. HeapBlock(mName,typeName,section,2);
  10810. END;
  10811. Info(section, "HeapBlock");
  10812. IF ProtectModulesPointers THEN
  10813. Symbol(section,section,2,0);
  10814. ELSE
  10815. Address(section,0);
  10816. END;
  10817. Info(section, "TypeDescriptor");
  10818. Address(section,0);
  10819. offset := section.pc;
  10820. END;
  10821. RETURN section
  10822. END NamedBlock;
  10823. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10824. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10825. BEGIN
  10826. COPY(moduleName,name);
  10827. Strings.Append(name,suffix);
  10828. Basic.ToSegmentedName(name, pooledName);
  10829. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10830. END Block;
  10831. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10832. VAR name: Basic.SegmentedName;
  10833. BEGIN
  10834. Info(source,"ArrayHeader");
  10835. IF implementationVisitor.backend.cooperative THEN
  10836. sizePC := source.pc;
  10837. Address(source,0);
  10838. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10839. IF baseType # "" THEN
  10840. Basic.ToSegmentedName(baseType, name);
  10841. NamedSymbol(source, name,NIL, 0, 0);
  10842. ELSE
  10843. Address(source,0);
  10844. END;
  10845. Address(source,0);
  10846. ELSE
  10847. Address(source,0);
  10848. Address(source,0);
  10849. (* first pointer for GC *)
  10850. IF hasPointer THEN
  10851. (* points to first element in the array, this is NOT the base type descriptor *)
  10852. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10853. ELSE
  10854. Address(source,0);
  10855. END;
  10856. sizePC := source.pc;
  10857. Address(source,0);
  10858. Info(source,"array data");
  10859. END;
  10860. END ArrayBlock;
  10861. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10862. BEGIN
  10863. IF implementationVisitor.backend.cooperative THEN
  10864. PatchSize(section, pc, size);
  10865. PatchSize(section, pc + 3, size);
  10866. ELSE
  10867. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10868. PatchSize(section, pc, size);
  10869. END;
  10870. END PatchArray;
  10871. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10872. VAR
  10873. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10874. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10875. poolMap: Basic.HashTableInt;
  10876. namePool: IntermediateCode.Section;
  10877. namePoolOffset: LONGINT;
  10878. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10879. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10880. BEGIN
  10881. Basic.SegmentedNameToString(s1.name,n1);
  10882. Basic.SegmentedNameToString(s2.name,n2);
  10883. index := 0;
  10884. ch1 := n1[index];
  10885. ch2 := n2[index];
  10886. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10887. INC(index);
  10888. ch1 := n1[index];
  10889. ch2 := n2[index];
  10890. END;
  10891. RETURN ch1 < ch2;
  10892. END Compare;
  10893. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10894. VAR
  10895. i, j: LONGINT;
  10896. x, t: Sections.Section;
  10897. BEGIN
  10898. IF lo < hi THEN
  10899. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10900. WHILE i <= j DO
  10901. WHILE Compare(list[i], x) DO INC(i) END;
  10902. WHILE Compare(x, list[j]) DO DEC(j) END;
  10903. IF i <= j THEN
  10904. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10905. INC(i); DEC(j)
  10906. END
  10907. END;
  10908. IF lo < j THEN QuickSort(list, lo, j) END;
  10909. IF i < hi THEN QuickSort(list, i, hi) END
  10910. END;
  10911. END QuickSort;
  10912. (*
  10913. ExportDesc* = RECORD
  10914. fp*: ADDRESS;
  10915. name* {UNTRACED}: DynamicName;
  10916. adr*: ADDRESS;
  10917. exports*: LONGINT;
  10918. dsc* {UNTRACED}: ExportArray
  10919. END;
  10920. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10921. *)
  10922. PROCEDURE ExportDesc2(
  10923. source: IntermediateCode.Section;
  10924. namePool: IntermediateCode.Section;
  10925. fingerPrinter: FingerPrinter.FingerPrinter;
  10926. symbol: Sections.Section;
  10927. name: StringPool.Index;
  10928. VAR patchAdr: LONGINT
  10929. ): BOOLEAN;
  10930. VAR fingerPrint: SyntaxTree.FingerPrint;
  10931. BEGIN
  10932. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10933. & (symbol.type # Sections.InlineCodeSection)
  10934. THEN
  10935. *)
  10936. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  10937. & (symbol.type # Sections.ExitCodeSection)
  10938. & (symbol.type # Sections.InlineCodeSection))
  10939. THEN
  10940. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10941. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10942. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10943. Longint(source,fingerPrint.public);
  10944. ELSE
  10945. Longint(source, 0);
  10946. END;
  10947. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10948. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10949. Symbol(source, symbol,0,0);
  10950. patchAdr := source.pc;
  10951. Longint(source, 0);
  10952. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10953. Address(source,0);
  10954. END;
  10955. RETURN TRUE
  10956. ELSE
  10957. RETURN FALSE
  10958. END;
  10959. END ExportDesc2;
  10960. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10961. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10962. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  10963. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  10964. nextPatch: LONGINT;
  10965. TYPE
  10966. Scope = RECORD
  10967. elements: LONGINT;
  10968. gelements: LONGINT;
  10969. section: IntermediateCode.Section;
  10970. patchAdr: LONGINT;
  10971. arraySizePC: LONGINT;
  10972. beginPC: LONGINT; (* current scope start pc *)
  10973. END;
  10974. BEGIN
  10975. Basic.InitSegmentedName(prev);
  10976. olevel := -1;
  10977. scopes[0].section := source;
  10978. scopes[0].arraySizePC := MIN(LONGINT);
  10979. FOR s := 0 TO LEN(sections)-1 DO
  10980. symbol := sections[s];
  10981. 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
  10982. this := sections[s].name;
  10983. level := 0;
  10984. WHILE (level < LEN(this)) & (this[level] > 0) DO
  10985. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  10986. INC(level);
  10987. END;
  10988. WHILE level < olevel DO
  10989. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  10990. IF olevel > 0 THEN
  10991. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  10992. nextPatch := scopes[olevel-1].patchAdr+1;
  10993. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  10994. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  10995. END;
  10996. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  10997. DEC(olevel);
  10998. END;
  10999. IF (level < LEN(this)) & (this[level] > 0) THEN
  11000. IF level > olevel THEN
  11001. (*TRACE("opening",level); *)
  11002. IF scopes[level].section = NIL THEN
  11003. arrayName := ".@ExportArray";
  11004. Strings.AppendInt(arrayName, level);
  11005. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11006. AddPointer(scopes[level].section,offset);
  11007. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11008. END;
  11009. scopes[level].beginPC := scopes[level].section.pc;
  11010. olevel := level;
  11011. scopes[olevel].elements := 0;
  11012. END;
  11013. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  11014. sym := sections[s];
  11015. ELSE
  11016. sym := NIL;
  11017. END;
  11018. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  11019. THEN
  11020. INC(scopes[olevel].elements);
  11021. END;
  11022. (* enter string in scope *)
  11023. INC(level);
  11024. END;
  11025. END;
  11026. Basic.SegmentedNameToString(this, name);
  11027. prev := this;
  11028. END;
  11029. END;
  11030. WHILE 0 <= olevel DO
  11031. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11032. IF olevel > 0 THEN
  11033. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11034. nextPatch := scopes[olevel-1].patchAdr+1;
  11035. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11036. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11037. END;
  11038. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11039. DEC(olevel);
  11040. END;
  11041. level := 0;
  11042. WHILE (level < LEN(scopes)) DO
  11043. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  11044. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  11045. END;
  11046. INC(level);
  11047. END;
  11048. END Export;
  11049. BEGIN
  11050. NEW(fingerPrinter);
  11051. NEW(poolMap, 64);
  11052. (* 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 *)
  11053. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  11054. NEW(sectionArray, module.allSections.Length());
  11055. FOR i := 0 TO module.allSections.Length() - 1 DO
  11056. section := module.allSections.GetSection(i);
  11057. sectionArray[i] := section;
  11058. END;
  11059. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  11060. Export(sectionArray^);
  11061. END ExportDesc;
  11062. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11063. VAR
  11064. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11065. BEGIN
  11066. Info(source, "exception table offsets array descriptor");
  11067. size := 0;
  11068. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11069. Info(source, "exception table content");
  11070. FOR i := 0 TO module.allSections.Length() - 1 DO
  11071. p := module.allSections.GetSection(i);
  11072. IF p.type = Sections.CodeSection THEN
  11073. finallyPC := p(IntermediateCode.Section).finally;
  11074. IF finallyPC>=0 THEN
  11075. Symbol( source, p, 0,0);
  11076. Symbol( source, p, finallyPC, 0);
  11077. Symbol( source, p, finallyPC,0);
  11078. INC(size);
  11079. END;
  11080. END
  11081. END;
  11082. PatchArray(source,sizePC,size);
  11083. END ExceptionArray;
  11084. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11085. VAR i: LONGINT; ch: CHAR;
  11086. BEGIN
  11087. i := 0;
  11088. REPEAT
  11089. ch := name[i]; INC(i);
  11090. Char( section, ch);
  11091. UNTIL ch = 0X;
  11092. WHILE i < 32 DO
  11093. Char( section, 0X); INC(i);
  11094. END;
  11095. END Name;
  11096. PROCEDURE References(section: IntermediateCode.Section);
  11097. CONST
  11098. sfTypeNone = 0X;
  11099. sfTypeCHAR = 01X;
  11100. sfTypeCHAR8 = 02X;
  11101. sfTypeCHAR16 = 03X;
  11102. sfTypeCHAR32 = 04X;
  11103. sfTypeRANGE = 05X;
  11104. sfTypeSHORTINT = 06X;
  11105. sfTypeINTEGER = 07X;
  11106. sfTypeLONGINT = 08X;
  11107. sfTypeHUGEINT = 09X;
  11108. sfTypeWORD = 0AX;
  11109. sfTypeLONGWORD = 0BX;
  11110. sfTypeSIGNED8 = 0CX;
  11111. sfTypeSIGNED16 = 0DX;
  11112. sfTypeSIGNED32 = 0EX;
  11113. sfTypeSIGNED64 = 0FX;
  11114. sfTypeUNSIGNED8 = 10X;
  11115. sfTypeUNSIGNED16 = 11X;
  11116. sfTypeUNSIGNED32 = 12X;
  11117. sfTypeUNSIGNED64 = 13X;
  11118. sfTypeREAL = 14X;
  11119. sfTypeLONGREAL = 15X;
  11120. sfTypeCOMPLEX = 16X;
  11121. sfTypeLONGCOMPLEX = 17X;
  11122. sfTypeBOOLEAN = 18X;
  11123. sfTypeSET = 19X;
  11124. sfTypeANY = 1AX;
  11125. sfTypeOBJECT = 1BX;
  11126. sfTypeBYTE = 1CX;
  11127. sfTypeADDRESS = 1DX;
  11128. sfTypeSIZE = 1EX;
  11129. sfTypeIndirect = 1FX;
  11130. sfTypeRecord = 20X;
  11131. sfTypePointerToRecord = 21X;
  11132. sfTypePointerToArray = 22X;
  11133. sfTypeOpenArray = 23X;
  11134. sfTypeStaticArray = 24X;
  11135. sfTypeDynamicArray = 25X;
  11136. sfTypeMathStaticArray = 26X;
  11137. sfTypeMathOpenArray = 27X;
  11138. sfTypeMathTensor = 28X;
  11139. sfTypeProcedure = 29X;
  11140. sfTypeDelegate = 2AX;
  11141. sfTypeENUM = 2BX;
  11142. sfTypeCELL = 2CX;
  11143. sfTypePORT = 2DX;
  11144. sfIN = 0X;
  11145. sfOUT = 1X;
  11146. flagDelegate = 0;
  11147. flagConstructor = 1;
  11148. (* variable / parameter addressing modes *)
  11149. sfAbsolute = 0X; (* global vars *)
  11150. sfRelative = 1X; (* variables, value parameters *)
  11151. sfIndirect = 2X; (* var parameters *)
  11152. sfScopeBegin = 0F0X;
  11153. sfScopeEnd = 0F1X;
  11154. sfProcedure = 0F2X;
  11155. sfVariable = 0F3X;
  11156. sfTypeDeclaration = 0F4X;
  11157. sfModule = 0FFX;
  11158. RefInfo = TRUE;
  11159. VAR
  11160. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11161. indirectTypes: Basic.HashTable;
  11162. PROCEDURE CurrentIndex(): LONGINT;
  11163. VAR i: LONGINT;
  11164. BEGIN
  11165. FOR i := startPC TO section.pc -1 DO
  11166. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11167. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11168. END;
  11169. startPC := section.pc;
  11170. RETURN lastOffset;
  11171. END CurrentIndex;
  11172. (*
  11173. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11174. Module = sfModule prevSymbol:SIZE name:String Scope.
  11175. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11176. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11177. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11178. Type =
  11179. sfTypePointerToRecord
  11180. | sfTypePointerToArray Type
  11181. | sfTypeOpenArray Type
  11182. | sfTypeDynamicArray Type
  11183. | sfTypeStaticArray length:SIZE Type
  11184. | sfTypeMathOpenArray Type
  11185. | sfTypeMathStaticArray length:SIZE Type
  11186. | sfTypeMathTensor Type
  11187. | sfTypeRecord tdAdr:ADDRESS
  11188. | sfTypeProcedure {Parameter} return:Type
  11189. | sfTypeDelegate {Parameter} return:Type
  11190. | sfTypePort (sfIN | sfOUT)
  11191. | sfTypeBOOLEAN
  11192. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11193. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11194. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11195. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11196. | sfTypeWORD | sfTypeLONGWORD
  11197. | sfTypeREAL | sfTypeLONGREAL
  11198. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11199. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11200. | sfTypeIndirect offset:SIZE.
  11201. *)
  11202. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11203. VAR offset: SIZE;
  11204. BEGIN
  11205. IF indirectTypes.Has(type) THEN
  11206. offset := indirectTypes.GetInt(type);
  11207. Char(section, sfTypeIndirect);
  11208. Size(section, offset);
  11209. RETURN TRUE;
  11210. ELSE
  11211. indirectTypes.PutInt(type, CurrentIndex());
  11212. RETURN FALSE;
  11213. END;
  11214. END Indirect;
  11215. PROCEDURE NType(type: SyntaxTree.Type);
  11216. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11217. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11218. BEGIN
  11219. IF type = NIL THEN
  11220. Char(section, sfTypeNone)
  11221. ELSE
  11222. type := type.resolved;
  11223. size := type.sizeInBits;
  11224. WITH type:SyntaxTree.PointerType DO
  11225. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11226. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11227. Char(section, sfTypePointerToRecord);
  11228. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11229. ELSE
  11230. IF RefInfo THEN Info(section,"PointerToArray") END;
  11231. Char(section, sfTypePointerToArray);
  11232. NType(type.pointerBase);
  11233. END;
  11234. | type: SyntaxTree.ArrayType DO
  11235. IF ~Indirect(type) THEN
  11236. IF type.form = SyntaxTree.Open THEN
  11237. IF RefInfo THEN Info(section,"OpenArray") END;
  11238. Char(section, sfTypeOpenArray);
  11239. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11240. IF RefInfo THEN Info(section,"DynamicArray") END;
  11241. Char(section, sfTypeDynamicArray);
  11242. ELSIF type.form = SyntaxTree.Static THEN
  11243. IF RefInfo THEN Info(section,"StaticArray") END;
  11244. Char(section, sfTypeStaticArray);
  11245. Size(section, type.staticLength);
  11246. ELSE
  11247. HALT(100);
  11248. END;
  11249. NType(type.arrayBase);
  11250. END;
  11251. | type: SyntaxTree.MathArrayType DO
  11252. IF ~Indirect(type) THEN
  11253. IF type.form = SyntaxTree.Open THEN
  11254. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11255. Char(section, sfTypeMathOpenArray);
  11256. ELSIF type.form = SyntaxTree.Static THEN
  11257. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11258. Char(section, sfTypeMathStaticArray);
  11259. Size(section, type.staticLength);
  11260. ELSIF type.form = SyntaxTree.Tensor THEN
  11261. IF RefInfo THEN Info(section,"MathTensor") END;
  11262. Char(section, sfTypeMathTensor);
  11263. ELSE
  11264. HALT(100);
  11265. END;
  11266. NType(type.arrayBase);
  11267. END;
  11268. | type: SyntaxTree.RecordType DO
  11269. IF ~Indirect(type) THEN
  11270. IF type.pointerType # NIL (* OBJECT *) THEN
  11271. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11272. Char(section, sfTypePointerToRecord)
  11273. ELSE
  11274. IF RefInfo THEN Info(section,"Record") END;
  11275. Char(section, sfTypeRecord);
  11276. td := type.typeDeclaration;
  11277. IF RefInfo THEN Info(section,"TD") END;
  11278. IF (td # NIL) THEN
  11279. Global.GetSymbolSegmentedName(td,segmentedName);
  11280. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11281. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11282. ELSE
  11283. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11284. END;
  11285. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11286. Symbol(section, tir, 0, offset);
  11287. ELSE
  11288. Address(section, 0);
  11289. END;
  11290. END;
  11291. END;
  11292. | type: SyntaxTree.CellType DO
  11293. IF ~Indirect(type) THEN
  11294. IF RefInfo THEN Info(section,"Record") END;
  11295. Char(section, sfTypeRecord);
  11296. td := type.typeDeclaration;
  11297. IF RefInfo THEN Info(section,"TD") END;
  11298. IF (td # NIL) THEN
  11299. Global.GetSymbolSegmentedName(td,segmentedName);
  11300. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11301. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11302. ELSE
  11303. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11304. END;
  11305. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11306. Symbol(section, tir, 0, offset);
  11307. ELSE
  11308. Address(section, 0);
  11309. END;
  11310. END;
  11311. | type: SyntaxTree.PortType DO
  11312. Char(section, sfTypePORT);
  11313. IF type.direction = SyntaxTree.OutPort THEN
  11314. Char(section, sfOUT)
  11315. ELSE
  11316. Char(section, sfIN)
  11317. END;
  11318. | type: SyntaxTree.ProcedureType DO
  11319. IF ~Indirect(type) THEN
  11320. IF type.isDelegate THEN
  11321. Char(section, sfTypeDelegate);
  11322. ELSE
  11323. Char(section, sfTypeProcedure);
  11324. END;
  11325. parameter := type.firstParameter;
  11326. WHILE(parameter # NIL) DO
  11327. NParameter(parameter, -1);
  11328. parameter := parameter.nextParameter;
  11329. END;
  11330. NType(type.returnType);
  11331. END;
  11332. | type:SyntaxTree.EnumerationType DO
  11333. Char(section, sfTypeENUM);
  11334. | type: SyntaxTree.BasicType DO
  11335. WITH type: SyntaxTree.BooleanType DO
  11336. IF RefInfo THEN Info(section,"Boolean") END;
  11337. Char(section, sfTypeBOOLEAN);
  11338. | type: SyntaxTree.CharacterType DO
  11339. IF type = module.system.characterType THEN
  11340. IF RefInfo THEN Info(section,"CHAR") END;
  11341. Char(section, sfTypeCHAR);
  11342. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11343. IF RefInfo THEN Info(section,"CHAR8") END;
  11344. Char(section, sfTypeCHAR8)
  11345. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11346. IF RefInfo THEN Info(section,"CHAR16") END;
  11347. Char(section, sfTypeCHAR16);
  11348. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11349. IF RefInfo THEN Info(section,"CHAR32") END;
  11350. Char(section, sfTypeCHAR32);
  11351. ELSE
  11352. HALT(100);
  11353. END;
  11354. |type: SyntaxTree.IntegerType DO
  11355. IF type(SyntaxTree.IntegerType).signed THEN
  11356. IF (type = module.system.shortintType) THEN
  11357. IF RefInfo THEN Info(section,"SHORTINT") END;
  11358. Char(section, sfTypeSHORTINT)
  11359. ELSIF (type = module.system.integerType) THEN
  11360. IF RefInfo THEN Info(section,"INTEGER") END;
  11361. Char(section, sfTypeINTEGER)
  11362. ELSIF (type = module.system.longintType) THEN
  11363. IF RefInfo THEN Info(section,"LONGINT") END;
  11364. Char(section, sfTypeLONGINT)
  11365. ELSIF (type = module.system.hugeintType) THEN
  11366. IF RefInfo THEN Info(section,"HUGEINT") END;
  11367. Char(section, sfTypeHUGEINT)
  11368. ELSIF (type = module.system.wordType) THEN
  11369. IF RefInfo THEN Info(section,"WORD") END;
  11370. Char(section, sfTypeWORD)
  11371. ELSIF (type = module.system.longWordType) THEN
  11372. IF RefInfo THEN Info(section,"LONGWORD") END;
  11373. Char(section, sfTypeLONGWORD);
  11374. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11375. IF RefInfo THEN Info(section,"SIGNED8") END;
  11376. Char(section, sfTypeSIGNED8)
  11377. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11378. IF RefInfo THEN Info(section,"SIGNED16") END;
  11379. Char(section, sfTypeSIGNED16)
  11380. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11381. IF RefInfo THEN Info(section,"SIGNED32") END;
  11382. Char(section, sfTypeSIGNED32)
  11383. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11384. IF RefInfo THEN Info(section,"SIGNED64") END;
  11385. Char(section, sfTypeSIGNED64)
  11386. ELSE
  11387. HALT(100);
  11388. END
  11389. ELSE (* unsigned *)
  11390. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11391. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11392. Char(section, sfTypeUNSIGNED8)
  11393. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11394. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11395. Char(section, sfTypeUNSIGNED16)
  11396. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11397. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11398. Char(section, sfTypeUNSIGNED32)
  11399. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11400. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11401. Char(section, sfTypeUNSIGNED64)
  11402. ELSE
  11403. HALT(100)
  11404. END
  11405. END;
  11406. | type: SyntaxTree.FloatType DO
  11407. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11408. IF RefInfo THEN Info(section,"REAL") END;
  11409. Char(section, sfTypeREAL);
  11410. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11411. IF RefInfo THEN Info(section,"LONGREAL") END;
  11412. Char(section, sfTypeLONGREAL);
  11413. ELSE
  11414. HALT(100);
  11415. END;
  11416. |type: SyntaxTree.ComplexType DO
  11417. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11418. IF RefInfo THEN Info(section,"COMPLEX") END;
  11419. Char(section, sfTypeCOMPLEX);
  11420. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11421. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11422. Char(section, sfTypeLONGCOMPLEX);
  11423. ELSE
  11424. HALT(100);
  11425. END;
  11426. |type:SyntaxTree.SetType DO
  11427. IF RefInfo THEN Info(section,"SET") END;
  11428. Char(section, sfTypeSET);
  11429. |type:SyntaxTree.AnyType DO
  11430. IF RefInfo THEN Info(section,"ANY") END;
  11431. Char(section, sfTypeANY);
  11432. |type:SyntaxTree.ObjectType DO
  11433. IF RefInfo THEN Info(section,"OBJECT") END;
  11434. Char(section, sfTypeOBJECT);
  11435. |type:SyntaxTree.ByteType DO
  11436. IF RefInfo THEN Info(section,"BYTE") END;
  11437. Char(section, sfTypeBYTE);
  11438. |type:SyntaxTree.RangeType DO
  11439. IF RefInfo THEN Info(section,"RANGE") END;
  11440. Char(section, sfTypeRANGE)
  11441. |type:SyntaxTree.AddressType DO
  11442. IF RefInfo THEN Info(section,"ADDRESS") END;
  11443. Char(section, sfTypeADDRESS)
  11444. |type:SyntaxTree.SizeType DO
  11445. IF RefInfo THEN Info(section,"SIZE") END;
  11446. Char(section, sfTypeSIZE)
  11447. ELSE
  11448. HALT(100)
  11449. END;
  11450. ELSE HALT(101);
  11451. END;
  11452. END;
  11453. END NType;
  11454. (*
  11455. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11456. *)
  11457. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11458. VAR pos: LONGINT; type: SyntaxTree.Type;
  11459. BEGIN
  11460. IF RefInfo THEN Info(section, "Parameter") END;
  11461. Char(section, sfVariable);
  11462. Size(section, procOffset);
  11463. String0(section, parameter.name);
  11464. type := parameter.type.resolved;
  11465. IF parameter.kind = SyntaxTree.VarParameter THEN
  11466. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11467. ELSE Char(section, sfIndirect)
  11468. END;
  11469. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11470. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11471. Char(section, sfIndirect);
  11472. ELSE
  11473. Char(section, sfRelative);
  11474. END;
  11475. ELSE
  11476. Char(section, sfRelative);
  11477. END;
  11478. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11479. NType(parameter.type);
  11480. END NParameter;
  11481. (*
  11482. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11483. *)
  11484. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11485. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11486. flags: SET;
  11487. BEGIN
  11488. IF procedure.externalName # NIL THEN RETURN END;
  11489. IF RefInfo THEN Info(section, "Procedure") END;
  11490. pos := CurrentIndex();
  11491. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11492. Char(section, sfProcedure);
  11493. Size(section, scopeOffset);
  11494. String0(section,procedure.name);
  11495. s := module.allSections.FindBySymbol(procedure);
  11496. Symbol(section,s,0,0); (* start *)
  11497. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11498. flags := {};
  11499. IF procedureType.isDelegate THEN
  11500. INCL(flags, flagDelegate);
  11501. END;
  11502. IF procedure.isConstructor THEN
  11503. INCL(flags, flagConstructor);
  11504. END;
  11505. Set(section, flags);
  11506. IF RefInfo THEN Info(section, "Parameters") END;
  11507. parameter := procedureType.firstParameter;
  11508. WHILE(parameter # NIL) DO
  11509. NParameter(parameter, pos);
  11510. parameter := parameter.nextParameter;
  11511. END;
  11512. IF procedureType.returnParameter # NIL THEN
  11513. NParameter(procedureType.returnParameter, pos);
  11514. END;
  11515. IF procedureType.selfParameter # NIL THEN
  11516. NParameter(procedureType.selfParameter, pos);
  11517. END;
  11518. IF RefInfo THEN Info(section, "ReturnType") END;
  11519. NType(procedureType.returnType);
  11520. NScope(procedure.procedureScope, pos);
  11521. END NProcedure;
  11522. (*
  11523. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11524. *)
  11525. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11526. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11527. BEGIN
  11528. IF RefInfo THEN Info(section, "Variable") END;
  11529. pos := CurrentIndex();
  11530. Char(section, sfVariable);
  11531. Size(section, scopeOffset);
  11532. String0(section, variable.name);
  11533. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11534. Char(section, sfAbsolute);
  11535. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11536. NamedSymbol(section, sn,variable, 0,0);
  11537. ELSE
  11538. Char(section, sfRelative);
  11539. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11540. END;
  11541. NType(variable.type);
  11542. s := module.allSections.FindBySymbol(variable);
  11543. END NVariable;
  11544. (*
  11545. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11546. *)
  11547. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11548. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11549. BEGIN
  11550. IF typeDeclaration = NIL THEN RETURN END;
  11551. pos := CurrentIndex();
  11552. s := module.allSections.FindBySymbol(typeDeclaration);
  11553. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11554. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11555. Char(section, sfTypeDeclaration);
  11556. Size(section, scopeOffset);
  11557. String0(section, typeDeclaration.name);
  11558. declared := typeDeclaration.declaredType.resolved;
  11559. IF (declared IS SyntaxTree.PointerType) THEN
  11560. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11561. END;
  11562. WITH declared: SyntaxTree.RecordType DO
  11563. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11564. Symbol(section, s, 0, offset);
  11565. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11566. Basic.AppendToSegmentedName(name,".@Info");
  11567. s := module.allSections.FindByName(name);
  11568. IF s # NIL THEN (* does not work for coop *)
  11569. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11570. END;
  11571. NScope(declared.recordScope, pos);
  11572. |declared: SyntaxTree.CellType DO
  11573. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11574. Symbol(section, s, 0, offset);
  11575. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11576. Basic.AppendToSegmentedName(name,".@Info");
  11577. s := module.allSections.FindByName(name);
  11578. IF s # NIL THEN
  11579. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11580. END;
  11581. NScope(declared.cellScope, pos);
  11582. ELSE
  11583. Address(section, 0);
  11584. END;
  11585. END NTypeDeclaration;
  11586. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11587. VAR pos: LONGINT;
  11588. BEGIN
  11589. pos := CurrentIndex();
  11590. Char(section,sfModule);
  11591. Size(section, prevSymbol);
  11592. String0(section, module.name);
  11593. NScope(module.moduleScope, pos);
  11594. END NModule;
  11595. (*
  11596. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11597. *)
  11598. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11599. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11600. BEGIN
  11601. IF scope = NIL THEN RETURN END;
  11602. IF RefInfo THEN Info(section, "Scope") END;
  11603. Char(section, sfScopeBegin);
  11604. variable := scope.firstVariable;
  11605. WHILE (variable # NIL) DO
  11606. NVariable(variable, prevSymbol);
  11607. variable := variable.nextVariable;
  11608. END;
  11609. WITH scope: SyntaxTree.ModuleScope DO
  11610. bodyProcedure := scope.bodyProcedure;
  11611. |scope: SyntaxTree.RecordScope DO
  11612. bodyProcedure := scope.bodyProcedure;
  11613. ELSE
  11614. bodyProcedure := NIL;
  11615. END;
  11616. IF bodyProcedure # NIL THEN
  11617. NProcedure(bodyProcedure, prevSymbol)
  11618. END;
  11619. procedure := scope.firstProcedure;
  11620. WHILE procedure # NIL DO
  11621. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11622. procedure := procedure.nextProcedure;
  11623. END;
  11624. typeDeclaration := scope.firstTypeDeclaration;
  11625. WHILE typeDeclaration # NIL DO
  11626. NTypeDeclaration(typeDeclaration, prevSymbol);
  11627. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11628. END;
  11629. Char(section, sfScopeEnd); (* scope ends *)
  11630. END NScope;
  11631. BEGIN
  11632. NEW(indirectTypes, 32);
  11633. ArrayBlock(section,sizePC,"", FALSE);
  11634. startPC := section.pc;
  11635. NModule(module.module, -1);
  11636. PatchArray(section,sizePC,CurrentIndex());
  11637. END References;
  11638. (*
  11639. Command* = RECORD
  11640. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11641. name*: Name; (* name of the procedure *)
  11642. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11643. entryAdr* : ADDRESS; (* entry address of procedure *)
  11644. END;
  11645. *)
  11646. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11647. VAR
  11648. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11649. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11650. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11651. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11652. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11653. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11654. BEGIN
  11655. RETURN
  11656. (type = NIL) OR
  11657. (type.resolved IS SyntaxTree.RecordType) OR
  11658. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11659. (type.resolved IS SyntaxTree.AnyType);
  11660. END TypeAllowed;
  11661. BEGIN
  11662. numberParameters := procedureType.numberParameters;
  11663. RETURN
  11664. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11665. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11666. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11667. END GetProcedureAllowed;
  11668. PROCEDURE WriteType(type : SyntaxTree.Type);
  11669. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11670. name: Basic.SegmentedName; offset: LONGINT;
  11671. BEGIN
  11672. IF type = NIL THEN
  11673. Address(source,0);
  11674. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11675. Address(source,1);
  11676. ELSE
  11677. type := type.resolved;
  11678. IF type IS SyntaxTree.PointerType THEN
  11679. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11680. END;
  11681. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11682. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11683. name[0] := typeDeclaration.name; name[1] := -1;
  11684. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11685. ASSERT(section # NIL);
  11686. ELSE
  11687. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11688. (* TODO *)
  11689. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11690. END;
  11691. IF implementationVisitor.backend.cooperative THEN
  11692. offset := 0;
  11693. ELSE
  11694. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11695. END;
  11696. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11697. END;
  11698. END WriteType;
  11699. BEGIN
  11700. Info(source, "command array descriptor");
  11701. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11702. numberCommands := 0;
  11703. Info(source, "command array content");
  11704. FOR i := 0 TO module.allSections.Length() - 1 DO
  11705. p := module.allSections.GetSection(i);
  11706. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11707. procedure := p.symbol(SyntaxTree.Procedure);
  11708. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11709. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11710. procedure.GetName(name);
  11711. Name(source,name);
  11712. numberParameters := procedureType.numberParameters;
  11713. (* offset of type of first parameter *)
  11714. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11715. ELSE WriteType(procedureType.firstParameter.type)
  11716. END;
  11717. (* offset of type of return parameter *)
  11718. WriteType(procedureType.returnType);
  11719. (* command name *)
  11720. (* command code offset *)
  11721. Symbol(source,p,0,0);
  11722. INC(numberCommands);
  11723. IF Trace THEN
  11724. D.Ln;
  11725. END;
  11726. END;
  11727. END
  11728. END;
  11729. PatchArray(source,sizePC,numberCommands);
  11730. END CommandArray;
  11731. (* to prevent from double import of different module aliases *)
  11732. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11733. VAR i: SyntaxTree.Import;
  11734. BEGIN
  11735. i := module.module.moduleScope.firstImport;
  11736. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11737. i := i.nextImport;
  11738. END;
  11739. RETURN i = import
  11740. END IsFirstDirectOccurence;
  11741. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11742. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11743. BEGIN
  11744. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11745. ArrayBlock(source,pc,"", FALSE);
  11746. Info(source, "import module array data");
  11747. IF implementationVisitor.backend.cooperative THEN
  11748. offset := 0;
  11749. ELSE
  11750. IF module.system.addressType.sizeInBits = 64 THEN
  11751. (* change this when Heaps.HeapBlock is modified *)
  11752. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11753. ELSE
  11754. (* change this when Heaps.HeapBlock is modified *)
  11755. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11756. END;
  11757. END;
  11758. import := module.module.moduleScope.firstImport;
  11759. numberImports := 0;
  11760. WHILE import # NIL DO
  11761. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11762. Global.GetModuleSegmentedName(import.module,name);
  11763. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11764. NamedSymbol(source, name, NIL, 0, offset);
  11765. INC(numberImports);
  11766. END;
  11767. import := import.nextImport
  11768. END;
  11769. PatchArray(source,pc,numberImports);
  11770. END ImportsArray;
  11771. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11772. VAR
  11773. p: Sections.Section; sizePC, size, i: LONGINT;
  11774. BEGIN
  11775. Info(source, "Type info section");
  11776. size := 0;
  11777. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11778. FOR i := 0 TO module.allSections.Length() - 1 DO
  11779. p := module.allSections.GetSection(i);
  11780. WITH p: IntermediateCode.Section DO
  11781. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11782. Symbol(source,p,EmptyBlockOffset,0);
  11783. INC(size);
  11784. END;
  11785. END
  11786. END;
  11787. PatchArray(source,sizePC,size);
  11788. END TypeInfoSection;
  11789. (*
  11790. ProcTableEntry* = RECORD
  11791. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11792. noPtr*: LONGINT;
  11793. END;
  11794. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11795. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11796. *)
  11797. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11798. VAR
  11799. numberPointers: LONGINT;
  11800. procedure: SyntaxTree.Procedure;
  11801. BEGIN
  11802. Info(section,"pcFrom");
  11803. Symbol(section,procedureSection,0,0);
  11804. Info(section,"pcTo");
  11805. Symbol(section, procedureSection, procedureSection.pc, 0);
  11806. Info(section,"pointer to offsets array");
  11807. Symbol(section, section,section.pc+1,0);
  11808. Info(section,"offsets array");
  11809. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11810. PointerArray(section, procedure.procedureScope, numberPointers);
  11811. END ProcedureDescriptor;
  11812. (* only for tracing, the descriptor is otherwise not complete ! *)
  11813. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11814. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11815. BEGIN
  11816. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11817. name := procedureSection.name;
  11818. Basic.AppendToSegmentedName(name,".@Info");
  11819. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11820. Address(section,0);
  11821. Symbol(section,section,2,0);
  11822. (*
  11823. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11824. descSize: SIZE;
  11825. sentinel: ADDRESS; (* = MPO-4 *)
  11826. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11827. flags*: SET;
  11828. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11829. name*: Name;
  11830. END;
  11831. *)
  11832. Size(section, 0);
  11833. Address(section,0);
  11834. Address(section,0);
  11835. Set(section,{});
  11836. moduleSection := ModuleSection();
  11837. Symbol( section, moduleSection, moduleSection.pc,0);
  11838. IF procedureSection.symbol = NIL THEN
  11839. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11840. ELSE
  11841. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11842. END;
  11843. Name(section, infoName);
  11844. Size(section, 0);
  11845. RETURN section;
  11846. END MakeProcedureDescriptorTag;
  11847. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11848. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11849. BEGIN
  11850. name := procedureSection.name;
  11851. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11852. IF implementationVisitor.backend.cooperative THEN
  11853. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11854. Info(section, "TypeDescriptor");
  11855. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11856. NamedSymbol(dest, name,NIL, 0, 0);
  11857. BaseRecord(dest);
  11858. offset := 0;
  11859. ELSIF CreateProcedureDescInfo THEN
  11860. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11861. Address(dest,0);
  11862. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11863. offset := dest.pc;
  11864. ELSE
  11865. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11866. END;
  11867. ProcedureDescriptor(dest, procedureSection);
  11868. Symbol(section, dest, offset, 0);
  11869. END ProcedureDescriptorPointer;
  11870. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11871. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11872. BEGIN
  11873. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11874. numberProcs := 0;
  11875. FOR i := 0 TO module.allSections.Length() - 1 DO
  11876. destination := module.allSections.GetSection(i);
  11877. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11878. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11879. INC(numberProcs);
  11880. END
  11881. END;
  11882. PatchArray(section, sizePC, numberProcs);
  11883. END ProcedureDescriptorArray;
  11884. (*
  11885. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11886. VAR
  11887. next*: Module; (** once a module is published, all fields are read-only *)
  11888. name*: Name;
  11889. init, published: BOOLEAN;
  11890. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11891. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11892. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11893. command*: POINTER TO ARRAY OF Command;
  11894. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11895. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11896. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11897. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11898. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11899. data*, code*: Bytes;
  11900. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11901. export*: ExportDesc;
  11902. term*: TerminationHandler;
  11903. exTable*: ExceptionTable;
  11904. noProcs*: LONGINT;
  11905. firstProc*: ADDRESS; <- done by loader
  11906. maxPtrs*: LONGINT;
  11907. crc*: LONGINT;
  11908. *)
  11909. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11910. BEGIN
  11911. Info(section, "cycle");
  11912. Size(section,0);
  11913. Info(section, "references");
  11914. Size(section,0);
  11915. Info(section, "nextMarked");
  11916. Address(section,0);
  11917. Info(section, "nextWatched");
  11918. Address(section,0);
  11919. END BasePointer;
  11920. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11921. BEGIN
  11922. BasePointer(section);
  11923. Info(section, "action");
  11924. Address(section,0);
  11925. Info(section, "monitor");
  11926. Address(section,0);
  11927. END BaseObject;
  11928. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11929. BEGIN
  11930. BasePointer(section);
  11931. Info(section, "action");
  11932. Address(section,0);
  11933. Info(section, "monitor");
  11934. Address(section,0);
  11935. END BaseRecord;
  11936. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11937. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11938. pooledName: Basic.SegmentedName;
  11939. symbol: SyntaxTree.Symbol;
  11940. BEGIN
  11941. Global.GetModuleName(module.module,name);
  11942. Strings.Append(name,".@Module.@Descriptor");
  11943. Basic.ToSegmentedName(name, pooledName);
  11944. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11945. Symbol(section,descriptorSection,0,0);
  11946. Info(descriptorSection, "descriptor");
  11947. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11948. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11949. Address(descriptorSection,0);
  11950. Global.GetModuleName(module.module,name);
  11951. Strings.Append(name,".@Trace");
  11952. Basic.ToSegmentedName(name, pooledName);
  11953. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11954. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11955. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11956. END ModuleDescriptor;
  11957. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11958. VAR name: ARRAY 128 OF CHAR;
  11959. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11960. symbol: SyntaxTree.Symbol;
  11961. BEGIN
  11962. Global.GetModuleName(module.module,name);
  11963. Strings.Append(name,".@Module");
  11964. Basic.ToSegmentedName(name, pooledName);
  11965. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11966. moduleSection.SetExported(TRUE);
  11967. IF moduleSection.pc = 0 THEN
  11968. IF implementationVisitor.backend.cooperative THEN
  11969. Info(moduleSection, "descriptor");
  11970. ModuleDescriptor(moduleSection);
  11971. BaseObject(moduleSection);
  11972. implementationVisitor.CreateTraceModuleMethod(module.module);
  11973. ELSE
  11974. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  11975. Info(moduleSection, "HeapBlock");
  11976. Symbol(moduleSection,moduleSection,2,0);
  11977. Info(moduleSection, "TypeDescriptor");
  11978. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11979. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  11980. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  11981. END;
  11982. END;
  11983. RETURN moduleSection;
  11984. END ModuleSection;
  11985. PROCEDURE NewModuleInfo();
  11986. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  11987. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  11988. sectionName: Basic.SectionName;
  11989. CONST MPO=-40000000H;
  11990. BEGIN
  11991. (*
  11992. TypeDesc* = POINTER TO RECORD
  11993. descSize: SIZE;
  11994. sentinel: LONGINT; (* = MPO-4 *)
  11995. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11996. flags*: SET;
  11997. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11998. name*: Name;
  11999. refsOffset: SIZE;
  12000. END;
  12001. *)
  12002. (*name is missing prefixes sometimes*)
  12003. Global.GetModuleSegmentedName(module.module,name);
  12004. Basic.AppendToSegmentedName(name,".@Info");
  12005. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12006. IF ~implementationVisitor.backend.cooperative THEN
  12007. Info(source, "HeapBlock");
  12008. Address(source,0); (* an empty heap block prevents GC marking *)
  12009. Info(source, "TypeDescriptor");
  12010. Address(source,0);
  12011. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12012. END;
  12013. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12014. Address(source,MPO-4);
  12015. Info(source, "type tag pointer");
  12016. Address( source,0);
  12017. Info(source, "type flags");
  12018. flags := {};
  12019. Set( source, flags);
  12020. Info(source, "pointer to module");
  12021. moduleSection := ModuleSection();
  12022. Symbol( source, moduleSection, moduleSection.pc,0);
  12023. Info(source, "type name");
  12024. i := 0;
  12025. sectionName := "@Self";
  12026. (*
  12027. Global.GetSymbolSegmentedName(td,name);
  12028. Basic.SegmentedNameToString(name, sectionName);
  12029. *)
  12030. Name(source,sectionName);
  12031. patchInfoPC := source.pc;
  12032. Size(source, 0);
  12033. END NewModuleInfo;
  12034. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  12035. VAR
  12036. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  12037. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  12038. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  12039. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  12040. referenceSectionOffset : LONGINT;
  12041. name: Basic.SegmentedName; offset: LONGINT;
  12042. flags: SET;
  12043. BEGIN
  12044. NewModuleInfo();
  12045. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  12046. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  12047. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  12048. ImportsArray(importSection);
  12049. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  12050. CommandArray(commandsSection);
  12051. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  12052. ExceptionArray(exceptionSection);
  12053. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  12054. AddPointer(typeInfoSection, typeInfoSectionOffset);
  12055. TypeInfoSection(typeInfoSection);
  12056. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  12057. referenceSection.SetExported(TRUE);
  12058. References(referenceSection);
  12059. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  12060. ProcedureDescriptorArray(procTableSection, numberProcs);
  12061. IF ProtectModulesPointers THEN
  12062. name := "Heaps.AnyPtr";
  12063. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12064. (* set base pointer *)
  12065. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12066. END;
  12067. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12068. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12069. moduleSection := ModuleSection();
  12070. Info(moduleSection, "nextRoot*: RootObject");
  12071. Address(moduleSection,0);
  12072. Info(moduleSection, "next*: Module");
  12073. Address(moduleSection,0);
  12074. Info(moduleSection, "name*: Name");
  12075. Name(moduleSection,moduleName);
  12076. Info(moduleSection, "init, published: BOOLEAN");
  12077. Boolean(moduleSection,FALSE);
  12078. Boolean(moduleSection,FALSE);
  12079. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12080. Boolean(moduleSection,FALSE);
  12081. Boolean(moduleSection,FALSE);
  12082. Info(moduleSection, "refcnt*: LONGINT");
  12083. Longint(moduleSection,0);
  12084. Info(moduleSection, "sb*: ADDRESS");
  12085. Address(moduleSection,0);
  12086. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12087. Address(moduleSection,0);
  12088. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12089. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12090. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12091. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12092. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12093. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12094. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12095. Symbol(moduleSection,importSection,importSectionOffset,0);
  12096. Info(moduleSection, "procTable*: ProcTable");
  12097. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12098. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12099. Address(moduleSection,0);
  12100. Address(moduleSection,0);
  12101. Address(moduleSection,0);
  12102. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12103. Info(moduleSection, "export*: ExportDesc");
  12104. ExportDesc(moduleSection);
  12105. Info(moduleSection, "term*: TerminationHandler");
  12106. Address(moduleSection,0);
  12107. Info(moduleSection, "exTable*: ExceptionTable");
  12108. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12109. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12110. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12111. Info(moduleSection, "crc*: LONGINT");
  12112. patchCRC:= moduleSection.pc;
  12113. Longint(moduleSection, 0); (*! must be implemented *)
  12114. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12115. Info(moduleSection, "body*: ADDRESS");
  12116. Symbol(moduleSection, bodyProc, 0,0);
  12117. Info(moduleSection, "module flags");
  12118. flags := {};
  12119. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12120. Set( moduleSection, flags);
  12121. IF implementationVisitor.backend.cooperative THEN
  12122. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12123. Info(moduleSection, "monitor.owner");
  12124. Address(moduleSection,0);
  12125. Info(moduleSection, "monitor.nestingLevel");
  12126. Address(moduleSection,0);
  12127. Info(moduleSection, "monitor.blockedQueue");
  12128. Address(moduleSection,0); Address(moduleSection,0);
  12129. Info(moduleSection, "monitor.waitingQueue");
  12130. Address(moduleSection,0); Address(moduleSection,0);
  12131. Info(moduleSection, "monitor.waitingSentinel");
  12132. Address(moduleSection,0);
  12133. END;
  12134. END Module;
  12135. PROCEDURE PatchCRC(crc: LONGINT);
  12136. BEGIN
  12137. IF ~simple THEN
  12138. PatchLongint(ModuleSection(), patchCRC, crc);
  12139. END;
  12140. END PatchCRC;
  12141. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12142. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12143. BEGIN
  12144. ArrayBlock(source,pc,"",FALSE);
  12145. Info(source, "pointer offsets array data");
  12146. IF scope IS SyntaxTree.RecordScope THEN
  12147. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12148. ELSIF scope IS SyntaxTree.CellScope THEN
  12149. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12150. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12151. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12152. WHILE variable # NIL DO
  12153. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12154. symbol := module.allSections.FindBySymbol(variable);
  12155. ASSERT(symbol # NIL);
  12156. Pointers(0,symbol, source,variable.type,numberPointers);
  12157. END;
  12158. variable := variable.nextVariable;
  12159. END;
  12160. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12161. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12162. WHILE parameter # NIL DO
  12163. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  12164. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12165. END;
  12166. parameter := parameter.nextParameter;
  12167. END;
  12168. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12169. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12170. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12171. IF implementationVisitor.backend.preciseGC THEN
  12172. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12173. END;
  12174. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12175. END;
  12176. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12177. WHILE(variable # NIL) DO
  12178. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12179. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12180. END;
  12181. variable := variable.nextVariable
  12182. END;
  12183. END;
  12184. PatchArray(source,pc,numberPointers);
  12185. END PointerArray;
  12186. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12187. VAR
  12188. name: Basic.SegmentedName;
  12189. section: IntermediateCode.Section;
  12190. BEGIN
  12191. Global.GetSymbolSegmentedName(symbol,name);
  12192. Basic.AppendToSegmentedName(name,suffix);
  12193. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12194. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12195. Info(section, "HeapBlock");
  12196. Address(section,0); (* empty such that GC does not go on traversing *)
  12197. Info(section, suffix);
  12198. Address(section,0);
  12199. pc := section.pc;
  12200. RETURN section;
  12201. END SymbolSection;
  12202. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12203. VAR recordType: SyntaxTree.RecordType;
  12204. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12205. section: Sections.Section; cellType: SyntaxTree.CellType;
  12206. tdInfoOffset: LONGINT;
  12207. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12208. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12209. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12210. sectionName: Basic.SectionName;
  12211. CONST MPO=-40000000H;
  12212. BEGIN
  12213. (*
  12214. TypeDesc* = POINTER TO RECORD
  12215. descSize: SIZE;
  12216. sentinel: LONGINT; (* = MPO-4 *)
  12217. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12218. flags*: SET;
  12219. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12220. name*: Name;
  12221. refsOffset: SIZE;
  12222. END;
  12223. *)
  12224. (* source := module.sections.FindByName(...) *)
  12225. Global.GetSymbolSegmentedName(td,name);
  12226. Basic.AppendToSegmentedName(name,".@Info");
  12227. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12228. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12229. Address(source,0);
  12230. Info(source, "TypeDescriptor");
  12231. Address(source,0);
  12232. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12233. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12234. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12235. Info(source, "type tag pointer");
  12236. Symbol( source, tag, offset, 0);
  12237. Info(source, "type flags");
  12238. flags := {};
  12239. IF isProtected THEN INCL(flags,31) END;
  12240. Set( source, flags);
  12241. Info(source, "pointer to module");
  12242. moduleSection := ModuleSection();
  12243. Symbol( source, moduleSection, moduleSection.pc,0);
  12244. Info(source, "type name");
  12245. i := 0;
  12246. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12247. (*
  12248. Global.GetSymbolSegmentedName(td,name);
  12249. Basic.SegmentedNameToString(name, sectionName);
  12250. *)
  12251. Name(source,sectionName);
  12252. Size(source, 0);
  12253. RETURN source;
  12254. END NewTypeDescriptorInfo;
  12255. PROCEDURE NewTypeDescriptor;
  12256. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12257. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12258. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12259. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12260. CONST MPO=-40000000H;
  12261. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12262. VAR i: LONGINT;
  12263. PROCEDURE Td(record: SyntaxTree.RecordType);
  12264. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12265. BEGIN
  12266. IF record # NIL THEN
  12267. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12268. baseTD := record.typeDeclaration;
  12269. Global.GetSymbolSegmentedName(baseTD,name);
  12270. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12271. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12272. ELSE
  12273. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12274. END;
  12275. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12276. Symbol(source, tir, 0, offset);
  12277. IF reverse THEN Td(record.GetBaseRecord()) END;
  12278. END;
  12279. END Td;
  12280. BEGIN
  12281. Info(source, "tag table");
  12282. baseRecord := recordType;
  12283. i := 0;
  12284. WHILE baseRecord # NIL DO
  12285. INC(i);
  12286. baseRecord := baseRecord.GetBaseRecord();
  12287. END;
  12288. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12289. IF ~reverse THEN Td(recordType) END;
  12290. WHILE i < size DO
  12291. Address(source,0);
  12292. INC(i);
  12293. END;
  12294. IF reverse THEN Td(recordType) END;
  12295. END TdTable;
  12296. PROCEDURE MethodTable(reverse: BOOLEAN);
  12297. VAR i,methods: LONGINT;
  12298. BEGIN
  12299. Info(source, "method table");
  12300. IF recordType # NIL THEN
  12301. methods := recordType.recordScope.numberMethods;
  12302. IF reverse THEN
  12303. FOR i := methods-1 TO 0 BY -1 DO
  12304. procedure := recordType.recordScope.FindMethod(i);
  12305. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12306. NamedSymbol(source, name,procedure, 0,0);
  12307. END;
  12308. ELSE
  12309. FOR i := 0 TO methods-1 DO
  12310. procedure := recordType.recordScope.FindMethod(i);
  12311. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12312. NamedSymbol(source, name,procedure, 0,0);
  12313. END;
  12314. END;
  12315. END;
  12316. END MethodTable;
  12317. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12318. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12319. BEGIN
  12320. Info(source, "method table");
  12321. baseRecord := recordType;
  12322. WHILE baseRecord.baseType # NIL DO
  12323. baseRecord := baseRecord.GetBaseRecord ();
  12324. END;
  12325. GetRecordTypeName (baseRecord, name);
  12326. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12327. IF name = stackFrame THEN
  12328. start := 0;
  12329. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12330. baseRecord := recordType;
  12331. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12332. baseRecord := baseRecord.GetBaseRecord ();
  12333. END;
  12334. IF baseRecord # NIL THEN
  12335. GetRecordTypeName (baseRecord, name);
  12336. IF pointer & ~baseRecord.isObject THEN
  12337. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12338. END;
  12339. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12340. ELSIF recordType.isObject THEN
  12341. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12342. ELSIF pointer THEN
  12343. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12344. ELSE
  12345. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12346. END;
  12347. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12348. Symbol(source, tir, 0, 0);
  12349. start := 0;
  12350. baseRecord := recordType;
  12351. WHILE (baseRecord # NIL) DO
  12352. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12353. baseRecord := baseRecord.GetBaseRecord ();
  12354. END;
  12355. ELSE
  12356. (* explicit trace method: *)
  12357. procedure := recordType.recordScope.FindMethod(0);
  12358. IF ~procedure.isFinalizer THEN
  12359. Global.GetSymbolSegmentedName(procedure, name);
  12360. NamedSymbol(source, name,procedure, 0,0);
  12361. END;
  12362. start := 1;
  12363. END;
  12364. IF (name # stackFrame) & recordType.isObject THEN
  12365. baseRecord := recordType;
  12366. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12367. baseRecord := baseRecord.GetBaseRecord ();
  12368. END;
  12369. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12370. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12371. ELSE
  12372. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12373. END;
  12374. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12375. Symbol(source, tir, 0, 0);
  12376. END;
  12377. methods := recordType.recordScope.numberMethods;
  12378. FOR i := start TO methods-1 DO
  12379. procedure := recordType.recordScope.FindMethod(i);
  12380. IF ~procedure.isFinalizer THEN
  12381. Global.GetSymbolSegmentedName(procedure, name);
  12382. NamedSymbol(source, name,procedure, 0,0);
  12383. END;
  12384. END;
  12385. END CooperativeMethodTable;
  12386. BEGIN
  12387. Global.GetSymbolSegmentedName(td,name);
  12388. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12389. source.SetExported(IsExported(td));
  12390. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12391. IF implementationVisitor.backend.cooperative THEN
  12392. base := NIL;
  12393. baseRecord := recordType.GetBaseRecord();
  12394. IF baseRecord # NIL THEN
  12395. baseTD := baseRecord.typeDeclaration;
  12396. END;
  12397. IF ~recordType.isObject THEN
  12398. Info(source, "parent");
  12399. IF baseRecord # NIL THEN
  12400. Global.GetSymbolSegmentedName(baseTD,name);
  12401. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12402. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12403. ELSE
  12404. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12405. END;
  12406. Symbol(source, tir, 0, 0);
  12407. ELSE
  12408. Address(source,0);
  12409. END;
  12410. Info(source, "record size");
  12411. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12412. CooperativeMethodTable(FALSE);
  12413. base := source;
  12414. Global.GetSymbolSegmentedName(td,name);
  12415. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12416. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12417. source.SetExported(IsExported(td));
  12418. END;
  12419. Info(source, "parent");
  12420. IF baseRecord # NIL THEN
  12421. Global.GetSymbolSegmentedName(baseTD,name);
  12422. sym := baseTD;
  12423. IF ~recordType.isObject THEN
  12424. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12425. sym := NIL;
  12426. END;
  12427. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12428. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12429. ELSE
  12430. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12431. END;
  12432. Symbol(source, tir, 0, 0);
  12433. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12434. Address(source,0);
  12435. ELSE
  12436. IF recordType.isObject THEN
  12437. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12438. ELSE
  12439. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12440. END;
  12441. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12442. Symbol(source, tir, 0, 0);
  12443. END;
  12444. Info(source, "base record descriptor");
  12445. Symbol(source, base, 0, 0);
  12446. CooperativeMethodTable(TRUE);
  12447. IF recordType.hasPointers THEN
  12448. IF ~HasExplicitTraceMethod (recordType) THEN
  12449. implementationVisitor.CreateTraceMethod(recordType);
  12450. END;
  12451. implementationVisitor.CreateResetProcedure(recordType);
  12452. implementationVisitor.CreateAssignProcedure(recordType);
  12453. END;
  12454. ELSIF ~simple THEN
  12455. (*
  12456. MethodEnd = MPO
  12457. ---
  12458. methods (# methods)
  12459. ---
  12460. tags (16)
  12461. ---
  12462. TypeDesc = TypeInfoAdr
  12463. ---
  12464. td adr ---> rec size
  12465. ----
  12466. pointer offsets
  12467. ----
  12468. (padding)
  12469. -----
  12470. empty [2 addresses aligned]
  12471. empty
  12472. empty
  12473. numPtrs
  12474. ---
  12475. pointer offsets
  12476. ---
  12477. *)
  12478. Info(source, "MethodEnd = MPO");
  12479. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12480. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12481. MethodTable(TRUE);
  12482. TdTable(TypeTags, TRUE);
  12483. Info(source, "type descriptor info pointer");
  12484. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12485. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12486. IF (cellType # NIL) THEN
  12487. IF cellType.sizeInBits < 0 THEN
  12488. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12489. END;
  12490. Info(source, "cell size");
  12491. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12492. ELSE
  12493. Info(source, "record size");
  12494. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12495. END;
  12496. Info(source, "pointer offsets pointer");
  12497. padding := 1- source.pc MOD 2;
  12498. Symbol(source, source, source.pc+1+padding,0);
  12499. IF padding >0 THEN
  12500. Info(source, "padding");
  12501. FOR i := 1 TO padding DO Address(source,0) END;
  12502. END;
  12503. IF cellType # NIL THEN
  12504. PointerArray(source, cellType.cellScope, numberPointers);
  12505. ELSE
  12506. PointerArray(source, recordType.recordScope, numberPointers);
  12507. END;
  12508. ELSE
  12509. (*
  12510. simple:
  12511. td adr --> size
  12512. tag(1)
  12513. tag(2)
  12514. tag(3)
  12515. methods ->
  12516. *)
  12517. Info(source, "record size");
  12518. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12519. TdTable(TypeTags, FALSE);
  12520. MethodTable(FALSE);
  12521. END;
  12522. END NewTypeDescriptor;
  12523. BEGIN
  12524. x := x.resolved;
  12525. IF (x IS SyntaxTree.PointerType) THEN
  12526. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12527. END;
  12528. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12529. recordType := x(SyntaxTree.RecordType);
  12530. td := x.typeDeclaration;
  12531. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12532. ASSERT(td # NIL);
  12533. section := module.allSections.FindBySymbol(td); (* TODO *)
  12534. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12535. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12536. NewTypeDescriptor
  12537. END;
  12538. END;
  12539. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12540. cellType := x(SyntaxTree.CellType);
  12541. td := x.typeDeclaration;
  12542. section := module.allSections.FindBySymbol(td); (* TODO *)
  12543. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12544. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12545. NewTypeDescriptor
  12546. END;
  12547. END;
  12548. END
  12549. END CheckTypeDeclaration
  12550. END MetaDataGenerator;
  12551. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12552. VAR
  12553. trace-: BOOLEAN;
  12554. traceString-: SyntaxTree.IdentifierString;
  12555. traceModuleName-: SyntaxTree.IdentifierString;
  12556. profile-: BOOLEAN;
  12557. noRuntimeChecks: BOOLEAN;
  12558. simpleMetaData-: BOOLEAN;
  12559. noAsserts: BOOLEAN;
  12560. optimize-: BOOLEAN;
  12561. cooperative-: BOOLEAN;
  12562. preregisterStatic-: BOOLEAN;
  12563. dump-: Basic.Writer;
  12564. cellsAreObjects: BOOLEAN;
  12565. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12566. experiment: BOOLEAN;
  12567. PROCEDURE &InitIntermediateBackend*;
  12568. BEGIN
  12569. simpleMetaData := FALSE;
  12570. InitBackend;
  12571. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  12572. SetTraceModuleName(DefaultTraceModuleName);
  12573. END InitIntermediateBackend;
  12574. (* must be overwritten by actual backend, if parameter registers should be used *)
  12575. PROCEDURE NumberParameterRegisters*(callingConvention: SyntaxTree.CallingConvention): SIZE;
  12576. BEGIN
  12577. RETURN 0; (* default case: no parameter registers *)
  12578. END NumberParameterRegisters;
  12579. (* must be overwritten by actual backend, if parameter registers should be used *)
  12580. PROCEDURE ParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; index: LONGINT): LONGINT;
  12581. BEGIN
  12582. HALT(100); (* abstract *)
  12583. END ParameterRegister;
  12584. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12585. VAR
  12586. declarationVisitor: DeclarationVisitor;
  12587. implementationVisitor: ImplementationVisitor;
  12588. module: Sections.Module;
  12589. name, platformName: SyntaxTree.IdentifierString;
  12590. meta: MetaDataGenerator;
  12591. crc: CRC.CRC32Stream;
  12592. BEGIN
  12593. ResetError;
  12594. Global.GetSymbolName(x,name);
  12595. NEW(module,x,system); (* backend structures *)
  12596. Global.GetModuleName(x, name);
  12597. module.SetModuleName(name);
  12598. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  12599. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12600. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12601. declarationVisitor.Module(x,module);
  12602. IF ~meta.simple THEN
  12603. meta.Module(implementationVisitor.moduleBodySection);
  12604. END;
  12605. GetDescription(platformName);
  12606. module.SetPlatformName(platformName);
  12607. NEW(crc);
  12608. module.allSections.WriteRaw(crc);
  12609. crc.Update;
  12610. meta.PatchCRC(crc.GetCRC());
  12611. RETURN module
  12612. END GenerateIntermediate;
  12613. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12614. BEGIN RETURN TRUE
  12615. END SupportedImmediate;
  12616. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12617. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12618. END ProcessSyntaxTreeModule;
  12619. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12620. VAR
  12621. result: Sections.Module;
  12622. traceName: Basic.MessageString;
  12623. BEGIN
  12624. ASSERT(intermediateCodeModule IS Sections.Module);
  12625. result := intermediateCodeModule(Sections.Module);
  12626. IF trace THEN
  12627. traceName := "intermediate code trace: ";
  12628. Strings.Append(traceName,traceString);
  12629. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12630. IF (traceString="") OR (traceString="*") THEN
  12631. result.Dump(dump);
  12632. dump.Update
  12633. ELSE
  12634. Sections.DumpFiltered(dump, result, traceString);
  12635. END
  12636. END;
  12637. RETURN result
  12638. END ProcessIntermediateCodeModule;
  12639. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12640. BEGIN instructionSet := "Intermediate";
  12641. END GetDescription;
  12642. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  12643. BEGIN
  12644. SELF.simpleMetaData := simpleMetaData;
  12645. END SetSimpleMetaData;
  12646. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12647. BEGIN COPY(name, traceModuleName)
  12648. END SetTraceModuleName;
  12649. PROCEDURE DefineOptions*(options: Options.Options);
  12650. BEGIN
  12651. DefineOptions^(options);
  12652. options.Add(0X,"trace",Options.String);
  12653. options.Add(0X,"builtinsModule",Options.String);
  12654. options.Add(0X,"traceModule",Options.String);
  12655. options.Add(0X,"profile",Options.Flag);
  12656. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12657. options.Add(0X,"noAsserts",Options.Flag);
  12658. options.Add(0X,"metaData",Options.String);
  12659. options.Add('o',"optimize", Options.Flag);
  12660. options.Add(0X,"preregisterStatic", Options.Flag);
  12661. options.Add(0X,"cellsAreObjects", Options.Flag);
  12662. options.Add(0X,"preciseGC", Options.Flag);
  12663. options.Add(0X,"trackLeave", Options.Flag);
  12664. options.Add(0X,"writeBarriers", Options.Flag);
  12665. options.Add(0X,"experiment", Options.Flag);
  12666. END DefineOptions;
  12667. PROCEDURE GetOptions*(options: Options.Options);
  12668. VAR name,string: SyntaxTree.IdentifierString;
  12669. BEGIN
  12670. GetOptions^(options);
  12671. trace := options.GetString("trace",traceString);
  12672. profile := options.GetFlag("profile");
  12673. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12674. noAsserts := options.GetFlag("noAsserts");
  12675. cooperative := options.GetFlag("cooperative");
  12676. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12677. simpleMetaData := TRUE
  12678. END;
  12679. IF options.GetString("metaData",string) THEN
  12680. IF string = "simple" THEN simpleMetaData := TRUE
  12681. ELSIF string ="full" THEN simpleMetaData := FALSE
  12682. END;
  12683. END;
  12684. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  12685. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12686. optimize := options.GetFlag("optimize");
  12687. preregisterStatic := options.GetFlag("preregisterStatic");
  12688. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12689. preciseGC := options.GetFlag("preciseGC");
  12690. trackLeave := options.GetFlag("trackLeave");
  12691. writeBarriers := options.GetFlag("writeBarriers");
  12692. experiment := options.GetFlag("experiment");
  12693. END GetOptions;
  12694. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12695. BEGIN RETURN SymbolFileFormat.Get()
  12696. END DefaultSymbolFileFormat;
  12697. END IntermediateBackend;
  12698. (* ----------------------------------- register allocation ------------------------------------- *)
  12699. (* register mapping scheme
  12700. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12701. spill offset
  12702. part(n) --> ticket <--> physical register
  12703. spill offset
  12704. *)
  12705. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12706. emptyOperand: IntermediateCode.Operand;
  12707. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12708. statCoopResetVariables: LONGINT;
  12709. statCoopModifyAssignments: LONGINT;
  12710. modifyAssignmentsPC : LONGINT;
  12711. statCoopNilCheck: LONGINT;
  12712. statCoopSwitch: LONGINT;
  12713. statCoopAssignProcedure: LONGINT;
  12714. statCoopTraceMethod: LONGINT;
  12715. statCoopResetProcedure: LONGINT;
  12716. statCoopTraceModule: LONGINT;
  12717. PROCEDURE ResetStatistics*;
  12718. BEGIN
  12719. statCoopResetVariables := 0;
  12720. statCoopModifyAssignments := 0;
  12721. statCoopNilCheck:= 0;
  12722. statCoopSwitch:= 0;
  12723. statCoopAssignProcedure:= 0;
  12724. statCoopTraceMethod:= 0;
  12725. statCoopResetProcedure:= 0;
  12726. statCoopTraceModule:= 0;
  12727. END ResetStatistics;
  12728. PROCEDURE Statistics*;
  12729. BEGIN
  12730. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12731. TRACE(statCoopNilCheck, statCoopSwitch);
  12732. TRACE(statCoopAssignProcedure,
  12733. statCoopTraceMethod,
  12734. statCoopResetProcedure,
  12735. statCoopTraceModule)
  12736. END Statistics;
  12737. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12738. VAR h: LONGINT;
  12739. BEGIN
  12740. WHILE b # 0 DO
  12741. h := a MOD b;
  12742. a := b;
  12743. b := h;
  12744. END;
  12745. RETURN a
  12746. END GCD;
  12747. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12748. BEGIN
  12749. RETURN a*b DIV GCD(a,b)
  12750. END SCM;
  12751. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12752. BEGIN
  12753. (*TRACE(a,b);*)
  12754. IF a = 0 THEN RETURN b
  12755. ELSIF b = 0 THEN RETURN a
  12756. ELSE RETURN SCM(a,b)
  12757. END;
  12758. END CommonAlignment;
  12759. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12760. BEGIN
  12761. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12762. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12763. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12764. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12765. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12766. END
  12767. END PassBySingleReference;
  12768. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12769. BEGIN
  12770. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  12771. END PassInRegister;
  12772. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12773. VAR new: RegisterEntry;
  12774. BEGIN
  12775. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12776. IF queue = NIL THEN
  12777. queue := new
  12778. ELSE
  12779. new.next := queue;
  12780. IF queue#NIL THEN queue.prev := new END;
  12781. queue := new
  12782. END;
  12783. END AddRegisterEntry;
  12784. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12785. VAR this: RegisterEntry;
  12786. BEGIN
  12787. this := queue;
  12788. WHILE (this # NIL) & (this.register # register) DO
  12789. this := this.next;
  12790. END;
  12791. IF this = NIL THEN
  12792. RETURN FALSE
  12793. END;
  12794. ASSERT(this # NIL);
  12795. IF this = queue THEN queue := queue.next END;
  12796. IF this.prev # NIL THEN this.prev.next := this.next END;
  12797. IF this.next # NIL THEN this.next.prev := this.prev END;
  12798. RETURN TRUE
  12799. END RemoveRegisterEntry;
  12800. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12801. BEGIN ASSERT(cond);
  12802. END Assert;
  12803. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12804. BEGIN
  12805. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12806. END ReusableRegister;
  12807. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12808. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12809. BEGIN
  12810. procedure := moduleScope.bodyProcedure;
  12811. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12812. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12813. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12814. procedure.SetScope(moduleScope);
  12815. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12816. procedure.SetAccess(SyntaxTree.Hidden);
  12817. moduleScope.SetBodyProcedure(procedure);
  12818. moduleScope.AddProcedure(procedure);
  12819. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12820. END;
  12821. END EnsureBodyProcedure;
  12822. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12823. VAR import: SyntaxTree.Import;
  12824. selfName: SyntaxTree.IdentifierString;
  12825. module: SyntaxTree.Module;
  12826. BEGIN
  12827. scope.ownerModule.GetName(selfName);
  12828. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12829. module := scope.ownerModule
  12830. ELSE
  12831. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12832. IF import = NIL THEN
  12833. RETURN NIL
  12834. ELSIF import.module = NIL THEN
  12835. RETURN NIL
  12836. ELSE module := import.module
  12837. END;
  12838. END;
  12839. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12840. END GetSymbol;
  12841. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12842. BEGIN
  12843. op.mode := mode;
  12844. IntermediateCode.InitOperand(op.op);
  12845. IntermediateCode.InitOperand(op.tag);
  12846. IntermediateCode.InitOperand(op.extra);
  12847. op.dimOffset := 0;
  12848. END InitOperand;
  12849. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12850. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12851. BEGIN RETURN IntermediateCode.GetType(system, type)
  12852. END GetType;
  12853. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12854. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12855. BEGIN
  12856. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12857. (*
  12858. UniqueId(name,module,name,adr);
  12859. *)
  12860. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12861. constant.SetValue(value);
  12862. constant.SetAccess(SyntaxTree.Hidden);
  12863. module.moduleScope.AddConstant(constant);
  12864. constant.SetScope(module.moduleScope);
  12865. RETURN constant
  12866. END BuildConstant;
  12867. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12868. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12869. BEGIN
  12870. variable := scope.firstVariable;
  12871. WHILE variable # NIL DO
  12872. IF variable.NeedsTrace() THEN
  12873. RETURN TRUE;
  12874. END;
  12875. variable := variable.nextVariable;
  12876. END;
  12877. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12878. WHILE parameter # NIL DO
  12879. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  12880. RETURN TRUE;
  12881. END;
  12882. parameter := parameter.nextParameter;
  12883. END;
  12884. RETURN FALSE;
  12885. END HasPointers;
  12886. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12887. 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));
  12888. END IsVariableParameter;
  12889. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12890. VAR parameter: SyntaxTree.Parameter;
  12891. BEGIN
  12892. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12893. WHILE parameter # NIL DO
  12894. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12895. IF parameter.movable THEN RETURN TRUE END;
  12896. parameter := parameter.nextParameter;
  12897. END;
  12898. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12899. END HasVariableParameters;
  12900. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12901. BEGIN
  12902. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12903. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12904. END HasExplicitTraceMethod;
  12905. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12906. BEGIN
  12907. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12908. IF (expression IS SyntaxTree.IntegerValue) THEN
  12909. val := expression(SyntaxTree.IntegerValue).value;
  12910. RETURN TRUE
  12911. ELSE
  12912. RETURN FALSE
  12913. END;
  12914. END IsIntegerConstant;
  12915. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12916. BEGIN
  12917. IF val <= 0 THEN RETURN FALSE END;
  12918. exp := 0;
  12919. WHILE ~ODD(val) DO
  12920. val := val DIV 2;
  12921. INC(exp)
  12922. END;
  12923. RETURN val = 1
  12924. END PowerOf2;
  12925. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12926. VAR procedure: SyntaxTree.Procedure;
  12927. BEGIN
  12928. procedure := record.recordScope.constructor;
  12929. IF procedure = NIL THEN
  12930. record := record.GetBaseRecord();
  12931. IF record # NIL THEN
  12932. procedure := GetConstructor(record)
  12933. END;
  12934. END;
  12935. RETURN procedure;
  12936. END GetConstructor;
  12937. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12938. BEGIN
  12939. value := SHORT(op.intValue);
  12940. RETURN op.mode = IntermediateCode.ModeImmediate;
  12941. END IsIntegerImmediate;
  12942. (** whether a type strictily is a pointer to record or object type
  12943. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12944. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12945. BEGIN
  12946. IF type = NIL THEN
  12947. RETURN FALSE
  12948. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12949. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12950. ELSE
  12951. RETURN FALSE
  12952. END
  12953. END IsStrictlyPointerToRecord;
  12954. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12955. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12956. END IsUnsafePointer;
  12957. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12958. BEGIN type := type.resolved;
  12959. IF type IS SyntaxTree.PointerType THEN
  12960. type := type(SyntaxTree.PointerType).pointerBase;
  12961. type := type.resolved;
  12962. IF type IS SyntaxTree.RecordType THEN
  12963. recordType := type(SyntaxTree.RecordType);
  12964. RETURN TRUE
  12965. ELSE
  12966. RETURN FALSE
  12967. END
  12968. ELSIF type IS SyntaxTree.RecordType THEN
  12969. recordType := type(SyntaxTree.RecordType);
  12970. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  12971. ELSIF type IS SyntaxTree.ObjectType THEN
  12972. RETURN TRUE
  12973. ELSIF type IS SyntaxTree.AnyType THEN
  12974. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  12975. ELSE
  12976. RETURN FALSE
  12977. END;
  12978. END IsPointerToRecord;
  12979. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  12980. BEGIN
  12981. type := type.resolved;
  12982. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  12983. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  12984. END IsArrayOfSystemByte;
  12985. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  12986. BEGIN
  12987. IF type = NIL THEN RETURN FALSE END;
  12988. type := type.resolved;
  12989. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  12990. END IsOpenArray;
  12991. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  12992. BEGIN
  12993. IF type = NIL THEN RETURN FALSE END;
  12994. type := type.resolved;
  12995. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  12996. END IsSemiDynamicArray;
  12997. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  12998. BEGIN
  12999. IF type = NIL THEN RETURN FALSE END;
  13000. type := type.resolved;
  13001. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13002. END IsStaticArray;
  13003. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13004. BEGIN
  13005. IF type = NIL THEN RETURN FALSE END;
  13006. type := type.resolved;
  13007. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13008. END IsStaticMathArray;
  13009. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13010. BEGIN
  13011. WHILE (IsStaticMathArray(type)) DO
  13012. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13013. END;
  13014. RETURN type;
  13015. END StaticMathArrayBaseType;
  13016. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13017. VAR size: LONGINT;
  13018. BEGIN
  13019. size := 1;
  13020. WHILE (IsStaticArray(type)) DO
  13021. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  13022. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13023. END;
  13024. RETURN size;
  13025. END StaticArrayNumElements;
  13026. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13027. VAR size: LONGINT;
  13028. BEGIN
  13029. size := 1;
  13030. WHILE (IsStaticMathArray(type)) DO
  13031. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  13032. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13033. END;
  13034. RETURN size;
  13035. END StaticMathArrayNumElements;
  13036. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13037. BEGIN
  13038. WHILE (IsStaticArray(type)) DO
  13039. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13040. END;
  13041. RETURN type;
  13042. END StaticArrayBaseType;
  13043. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13044. BEGIN
  13045. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  13046. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13047. END;
  13048. RETURN type;
  13049. END ArrayBaseType;
  13050. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  13051. BEGIN
  13052. IF type = NIL THEN RETURN FALSE END;
  13053. type := type.resolved;
  13054. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  13055. END IsDelegate;
  13056. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  13057. VAR i: LONGINT;
  13058. BEGIN
  13059. i := 0; type := type.resolved;
  13060. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13061. INC(i);
  13062. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  13063. END;
  13064. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13065. INC(i);
  13066. type := type(SyntaxTree.MathArrayType).arrayBase;
  13067. IF type # NIL THEN type := type.resolved END;
  13068. END;
  13069. RETURN i
  13070. END DynamicDim;
  13071. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13072. BEGIN
  13073. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13074. type := type(SyntaxTree.ArrayType).arrayBase;
  13075. END;
  13076. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13077. type := type(SyntaxTree.MathArrayType).arrayBase;
  13078. END;
  13079. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13080. END StaticSize;
  13081. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13082. BEGIN
  13083. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13084. END IsImmediate;
  13085. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13086. BEGIN
  13087. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13088. END IsAddress;
  13089. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13090. BEGIN
  13091. RETURN (x.mode = IntermediateCode.ModeRegister);
  13092. END IsRegister;
  13093. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13094. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13095. BEGIN
  13096. typeDeclaration := recordType.typeDeclaration;
  13097. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13098. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13099. END GetRecordTypeName;
  13100. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13101. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13102. BEGIN
  13103. parSize := 0;
  13104. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13105. parameter := procedureType.returnParameter;
  13106. INC(parSize,system.SizeOfParameter(parameter));
  13107. parSize := parSize + (-parSize) MOD system.addressSize;
  13108. END;
  13109. parameter :=procedureType.lastParameter;
  13110. WHILE (parameter # NIL) DO
  13111. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  13112. INC(parSize, system.addressSize);
  13113. ELSE
  13114. INC(parSize,system.SizeOfParameter(parameter));
  13115. parSize := parSize + (-parSize) MOD system.addressSize;
  13116. END;
  13117. parameter := parameter.prevParameter;
  13118. END;
  13119. IF procedureType.selfParameter # NIL THEN
  13120. parameter := procedureType.selfParameter;
  13121. INC(parSize,system.SizeOfParameter(parameter));
  13122. parSize := parSize + (-parSize) MOD system.addressSize;
  13123. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13124. END; (* method => self pointer *)
  13125. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13126. RETURN ToMemoryUnits(system,parSize)
  13127. END ParametersSize;
  13128. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13129. BEGIN
  13130. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13131. END IsNested;
  13132. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13133. BEGIN
  13134. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13135. scope := scope.outerScope;
  13136. END;
  13137. RETURN scope # NIL;
  13138. END InCellScope;
  13139. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13140. BEGIN
  13141. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  13142. END ProcedureParametersSize;
  13143. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13144. VAR dataUnit: LONGINT;
  13145. BEGIN dataUnit := system.dataUnit;
  13146. ASSERT(size MOD system.dataUnit = 0);
  13147. RETURN LONGINT(size DIV system.dataUnit)
  13148. END ToMemoryUnits;
  13149. PROCEDURE Get*(): Backend.Backend;
  13150. VAR backend: IntermediateBackend;
  13151. BEGIN NEW(backend); RETURN backend
  13152. END Get;
  13153. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13154. VAR instruction: IntermediateCode.Instruction;
  13155. BEGIN
  13156. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13157. RETURN instruction
  13158. END Nop;
  13159. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13160. VAR instruction: IntermediateCode.Instruction;
  13161. BEGIN
  13162. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13163. RETURN instruction
  13164. END Mov;
  13165. (* like Mov but ensures that no new register will be allocated for dest *)
  13166. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13167. VAR instruction: IntermediateCode.Instruction;
  13168. BEGIN
  13169. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13170. RETURN instruction
  13171. END MovReplace;
  13172. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13173. VAR instruction: IntermediateCode.Instruction;
  13174. BEGIN
  13175. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13176. RETURN instruction
  13177. END Conv;
  13178. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13179. VAR instruction: IntermediateCode.Instruction;
  13180. BEGIN
  13181. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13182. RETURN instruction
  13183. END Call;
  13184. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13185. VAR op1, op2, op3: IntermediateCode.Operand;
  13186. VAR instruction: IntermediateCode.Instruction;
  13187. BEGIN
  13188. IntermediateCode.InitNumber(op1,pcOffset);
  13189. IntermediateCode.InitNumber(op2,callingConvention);
  13190. IntermediateCode.InitNumber(op3,unwind);
  13191. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13192. RETURN instruction
  13193. END Exit;
  13194. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13195. VAR instruction: IntermediateCode.Instruction;
  13196. BEGIN
  13197. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13198. RETURN instruction
  13199. END Return;
  13200. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13201. VAR instruction: IntermediateCode.Instruction;
  13202. BEGIN
  13203. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13204. RETURN instruction
  13205. END Result;
  13206. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13207. VAR op1: IntermediateCode.Operand;
  13208. VAR instruction: IntermediateCode.Instruction;
  13209. BEGIN
  13210. IntermediateCode.InitNumber(op1,nr);
  13211. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13212. RETURN instruction
  13213. END Trap;
  13214. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13215. VAR instruction: IntermediateCode.Instruction;
  13216. BEGIN
  13217. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13218. RETURN instruction
  13219. END Br;
  13220. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13221. VAR instruction: IntermediateCode.Instruction;
  13222. BEGIN
  13223. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13224. RETURN instruction
  13225. END Breq;
  13226. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13227. VAR instruction: IntermediateCode.Instruction;
  13228. BEGIN
  13229. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13230. RETURN instruction
  13231. END Brne;
  13232. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13233. VAR instruction: IntermediateCode.Instruction;
  13234. BEGIN
  13235. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13236. RETURN instruction
  13237. END Brge;
  13238. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13239. VAR instruction: IntermediateCode.Instruction;
  13240. BEGIN
  13241. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13242. RETURN instruction
  13243. END Brlt;
  13244. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13245. VAR instruction: IntermediateCode.Instruction;
  13246. BEGIN
  13247. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13248. RETURN instruction
  13249. END Pop;
  13250. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13251. VAR instruction: IntermediateCode.Instruction;
  13252. BEGIN
  13253. ASSERT(op.mode # IntermediateCode.Undefined);
  13254. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13255. RETURN instruction
  13256. END Push;
  13257. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13258. VAR instruction: IntermediateCode.Instruction;
  13259. BEGIN
  13260. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13261. RETURN instruction
  13262. END Neg;
  13263. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13264. VAR instruction: IntermediateCode.Instruction;
  13265. BEGIN
  13266. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13267. RETURN instruction
  13268. END Not;
  13269. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13270. VAR instruction: IntermediateCode.Instruction;
  13271. BEGIN
  13272. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13273. RETURN instruction
  13274. END Abs;
  13275. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13276. VAR instruction: IntermediateCode.Instruction;
  13277. BEGIN
  13278. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13279. ASSERT(~IsImmediate(instruction.op1));
  13280. RETURN instruction
  13281. END Mul;
  13282. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13283. VAR instruction: IntermediateCode.Instruction;
  13284. BEGIN
  13285. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13286. RETURN instruction
  13287. END Div;
  13288. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13289. VAR instruction: IntermediateCode.Instruction;
  13290. BEGIN
  13291. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13292. RETURN instruction
  13293. END Mod;
  13294. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13295. VAR instruction: IntermediateCode.Instruction;
  13296. BEGIN
  13297. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13298. RETURN instruction
  13299. END Sub;
  13300. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13301. VAR instruction: IntermediateCode.Instruction;
  13302. BEGIN
  13303. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13304. RETURN instruction
  13305. END Add;
  13306. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13307. VAR instruction: IntermediateCode.Instruction;
  13308. BEGIN
  13309. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13310. RETURN instruction
  13311. END And;
  13312. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13313. VAR instruction: IntermediateCode.Instruction;
  13314. BEGIN
  13315. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13316. RETURN instruction
  13317. END Or;
  13318. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13319. VAR instruction: IntermediateCode.Instruction;
  13320. BEGIN
  13321. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13322. RETURN instruction
  13323. END Xor;
  13324. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13325. VAR instruction: IntermediateCode.Instruction;
  13326. BEGIN
  13327. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13328. RETURN instruction
  13329. END Shl;
  13330. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13331. VAR instruction: IntermediateCode.Instruction;
  13332. BEGIN
  13333. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13334. RETURN instruction
  13335. END Shr;
  13336. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13337. VAR instruction: IntermediateCode.Instruction;
  13338. BEGIN
  13339. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13340. RETURN instruction
  13341. END Rol;
  13342. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13343. VAR instruction: IntermediateCode.Instruction;
  13344. BEGIN
  13345. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13346. RETURN instruction
  13347. END Ror;
  13348. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13349. VAR instruction: IntermediateCode.Instruction;
  13350. BEGIN
  13351. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13352. RETURN instruction
  13353. END Cas;
  13354. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13355. VAR instruction: IntermediateCode.Instruction;
  13356. BEGIN
  13357. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13358. RETURN instruction
  13359. END Copy;
  13360. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13361. VAR instruction: IntermediateCode.Instruction;
  13362. BEGIN
  13363. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13364. RETURN instruction
  13365. END Fill;
  13366. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13367. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13368. BEGIN
  13369. string := IntermediateCode.String(s);
  13370. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13371. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13372. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13373. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13374. RETURN instruction
  13375. END Asm;
  13376. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13377. VAR instruction: IntermediateCode.Instruction;
  13378. BEGIN
  13379. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13380. RETURN instruction
  13381. END Data;
  13382. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13383. VAR instruction: IntermediateCode.Instruction;
  13384. BEGIN
  13385. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13386. IntermediateCode.SetSubType(instruction, subtype);
  13387. RETURN instruction
  13388. END SpecialInstruction;
  13389. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13390. VAR op1: IntermediateCode.Operand;
  13391. VAR instruction: IntermediateCode.Instruction;
  13392. BEGIN
  13393. (*! generate a warning if size exceeds a certain limit *)
  13394. (*
  13395. ASSERT(bytes < 1000000); (* sanity check *)
  13396. *)
  13397. ASSERT(0 <= units); (* sanity check *)
  13398. IntermediateCode.InitNumber(op1,units);
  13399. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13400. RETURN instruction
  13401. END Reserve;
  13402. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13403. VAR op1: IntermediateCode.Operand;
  13404. VAR instruction: IntermediateCode.Instruction;
  13405. BEGIN
  13406. IntermediateCode.InitNumber(op1,position.start);
  13407. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13408. RETURN instruction
  13409. END LabelInstruction;
  13410. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13411. VAR pc: LONGINT;
  13412. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13413. BEGIN
  13414. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13415. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13416. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13417. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13418. IF instr.op1.type.form = IntermediateCode.Float THEN
  13419. RETURN instr.op1.floatValue = op.floatValue
  13420. ELSE
  13421. RETURN instr.op1.intValue = op.intValue
  13422. END;
  13423. END ProvidesValue;
  13424. BEGIN
  13425. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13426. pc := 0;
  13427. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13428. INC(pc);
  13429. END;
  13430. IF pc = data.pc THEN
  13431. data.Emit(Data(Basic.invalidPosition,vop));
  13432. END;
  13433. RETURN pc
  13434. END EnterImmediate;
  13435. PROCEDURE Init;
  13436. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13437. BEGIN
  13438. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13439. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13440. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13441. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13442. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13443. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13444. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13445. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13446. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13447. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13448. IntermediateCode.InitOperand(emptyOperand);
  13449. FOR i := 0 TO NumberSystemCalls-1 DO
  13450. name := "@SystemCall";
  13451. Basic.AppendNumber(name,i);
  13452. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13453. END;
  13454. END Init;
  13455. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13456. BEGIN
  13457. RETURN (symbol # NIL) & symbol.NeedsSection();
  13458. END IsExported;
  13459. BEGIN
  13460. Init;
  13461. END FoxIntermediateBackend.
  13462. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  13463. # Release.Build --path="/temp/obg/" Win32 ~
  13464. # Linker.Link --fileFormat=PE32 --fileName=A2H.exe --extension=GofW --displacement=401000H Builtins Trace Kernel32 Machine Heaps Modules Objects Kernel KernelLog Streams Commands Files WinFS Clock Dates Reals Strings Diagnostics BitSets StringPool ObjectFile GenericLinker Reflection Loader BootConsole ~
  13465. FStols.CloseFiles A2Z.exe ~
  13466. System.FreeDownTo FoxIntermediateBackend ~
  13467. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  13468. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  13469. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13470. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13471. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13472. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13473. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  13474. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  13475. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13476. GenericLinker.Mod Loader.Mod BootConsole.Mod