FoxIntermediateBackend.Mod 581 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924192519261927192819291930193119321933193419351936193719381939194019411942194319441945194619471948194919501951195219531954195519561957195819591960196119621963196419651966196719681969197019711972197319741975197619771978197919801981198219831984198519861987198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420252026202720282029203020312032203320342035203620372038203920402041204220432044204520462047204820492050205120522053205420552056205720582059206020612062206320642065206620672068206920702071207220732074207520762077207820792080208120822083208420852086208720882089209020912092209320942095209620972098209921002101210221032104210521062107210821092110211121122113211421152116211721182119212021212122212321242125212621272128212921302131213221332134213521362137213821392140214121422143214421452146214721482149215021512152215321542155215621572158215921602161216221632164216521662167216821692170217121722173217421752176217721782179218021812182218321842185218621872188218921902191219221932194219521962197219821992200220122022203220422052206220722082209221022112212221322142215221622172218221922202221222222232224222522262227222822292230223122322233223422352236223722382239224022412242224322442245224622472248224922502251225222532254225522562257225822592260226122622263226422652266226722682269227022712272227322742275227622772278227922802281228222832284228522862287228822892290229122922293229422952296229722982299230023012302230323042305230623072308230923102311231223132314231523162317231823192320232123222323232423252326232723282329233023312332233323342335233623372338233923402341234223432344234523462347234823492350235123522353235423552356235723582359236023612362236323642365236623672368236923702371237223732374237523762377237823792380238123822383238423852386238723882389239023912392239323942395239623972398239924002401240224032404240524062407240824092410241124122413241424152416241724182419242024212422242324242425242624272428242924302431243224332434243524362437243824392440244124422443244424452446244724482449245024512452245324542455245624572458245924602461246224632464246524662467246824692470247124722473247424752476247724782479248024812482248324842485248624872488248924902491249224932494249524962497249824992500250125022503250425052506250725082509251025112512251325142515251625172518251925202521252225232524252525262527252825292530253125322533253425352536253725382539254025412542254325442545254625472548254925502551255225532554255525562557255825592560256125622563256425652566256725682569257025712572257325742575257625772578257925802581258225832584258525862587258825892590259125922593259425952596259725982599260026012602260326042605260626072608260926102611261226132614261526162617261826192620262126222623262426252626262726282629263026312632263326342635263626372638263926402641264226432644264526462647264826492650265126522653265426552656265726582659266026612662266326642665266626672668266926702671267226732674267526762677267826792680268126822683268426852686268726882689269026912692269326942695269626972698269927002701270227032704270527062707270827092710271127122713271427152716271727182719272027212722272327242725272627272728272927302731273227332734273527362737273827392740274127422743274427452746274727482749275027512752275327542755275627572758275927602761276227632764276527662767276827692770277127722773277427752776277727782779278027812782278327842785278627872788278927902791279227932794279527962797279827992800280128022803280428052806280728082809281028112812281328142815281628172818281928202821282228232824282528262827282828292830283128322833283428352836283728382839284028412842284328442845284628472848284928502851285228532854285528562857285828592860286128622863286428652866286728682869287028712872287328742875287628772878287928802881288228832884288528862887288828892890289128922893289428952896289728982899290029012902290329042905290629072908290929102911291229132914291529162917291829192920292129222923292429252926292729282929293029312932293329342935293629372938293929402941294229432944294529462947294829492950295129522953295429552956295729582959296029612962296329642965296629672968296929702971297229732974297529762977297829792980298129822983298429852986298729882989299029912992299329942995299629972998299930003001300230033004300530063007300830093010301130123013301430153016301730183019302030213022302330243025302630273028302930303031303230333034303530363037303830393040304130423043304430453046304730483049305030513052305330543055305630573058305930603061306230633064306530663067306830693070307130723073307430753076307730783079308030813082308330843085308630873088308930903091309230933094309530963097309830993100310131023103310431053106310731083109311031113112311331143115311631173118311931203121312231233124312531263127312831293130313131323133313431353136313731383139314031413142314331443145314631473148314931503151315231533154315531563157315831593160316131623163316431653166316731683169317031713172317331743175317631773178317931803181318231833184318531863187318831893190319131923193319431953196319731983199320032013202320332043205320632073208320932103211321232133214321532163217321832193220322132223223322432253226322732283229323032313232323332343235323632373238323932403241324232433244324532463247324832493250325132523253325432553256325732583259326032613262326332643265326632673268326932703271327232733274327532763277327832793280328132823283328432853286328732883289329032913292329332943295329632973298329933003301330233033304330533063307330833093310331133123313331433153316331733183319332033213322332333243325332633273328332933303331333233333334333533363337333833393340334133423343334433453346334733483349335033513352335333543355335633573358335933603361336233633364336533663367336833693370337133723373337433753376337733783379338033813382338333843385338633873388338933903391339233933394339533963397339833993400340134023403340434053406340734083409341034113412341334143415341634173418341934203421342234233424342534263427342834293430343134323433343434353436343734383439344034413442344334443445344634473448344934503451345234533454345534563457345834593460346134623463346434653466346734683469347034713472347334743475347634773478347934803481348234833484348534863487348834893490349134923493349434953496349734983499350035013502350335043505350635073508350935103511351235133514351535163517351835193520352135223523352435253526352735283529353035313532353335343535353635373538353935403541354235433544354535463547354835493550355135523553355435553556355735583559356035613562356335643565356635673568356935703571357235733574357535763577357835793580358135823583358435853586358735883589359035913592359335943595359635973598359936003601360236033604360536063607360836093610361136123613361436153616361736183619362036213622362336243625362636273628362936303631363236333634363536363637363836393640364136423643364436453646364736483649365036513652365336543655365636573658365936603661366236633664366536663667366836693670367136723673367436753676367736783679368036813682368336843685368636873688368936903691369236933694369536963697369836993700370137023703370437053706370737083709371037113712371337143715371637173718371937203721372237233724372537263727372837293730373137323733373437353736373737383739374037413742374337443745374637473748374937503751375237533754375537563757375837593760376137623763376437653766376737683769377037713772377337743775377637773778377937803781378237833784378537863787378837893790379137923793379437953796379737983799380038013802380338043805380638073808380938103811381238133814381538163817381838193820382138223823382438253826382738283829383038313832383338343835383638373838383938403841384238433844384538463847384838493850385138523853385438553856385738583859386038613862386338643865386638673868386938703871387238733874387538763877387838793880388138823883388438853886388738883889389038913892389338943895389638973898389939003901390239033904390539063907390839093910391139123913391439153916391739183919392039213922392339243925392639273928392939303931393239333934393539363937393839393940394139423943394439453946394739483949395039513952395339543955395639573958395939603961396239633964396539663967396839693970397139723973397439753976397739783979398039813982398339843985398639873988398939903991399239933994399539963997399839994000400140024003400440054006400740084009401040114012401340144015401640174018401940204021402240234024402540264027402840294030403140324033403440354036403740384039404040414042404340444045404640474048404940504051405240534054405540564057405840594060406140624063406440654066406740684069407040714072407340744075407640774078407940804081408240834084408540864087408840894090409140924093409440954096409740984099410041014102410341044105410641074108410941104111411241134114411541164117411841194120412141224123412441254126412741284129413041314132413341344135413641374138413941404141414241434144414541464147414841494150415141524153415441554156415741584159416041614162416341644165416641674168416941704171417241734174417541764177417841794180418141824183418441854186418741884189419041914192419341944195419641974198419942004201420242034204420542064207420842094210421142124213421442154216421742184219422042214222422342244225422642274228422942304231423242334234423542364237423842394240424142424243424442454246424742484249425042514252425342544255425642574258425942604261426242634264426542664267426842694270427142724273427442754276427742784279428042814282428342844285428642874288428942904291429242934294429542964297429842994300430143024303430443054306430743084309431043114312431343144315431643174318431943204321432243234324432543264327432843294330433143324333433443354336433743384339434043414342434343444345434643474348434943504351435243534354435543564357435843594360436143624363436443654366436743684369437043714372437343744375437643774378437943804381438243834384438543864387438843894390439143924393439443954396439743984399440044014402440344044405440644074408440944104411441244134414441544164417441844194420442144224423442444254426442744284429443044314432443344344435443644374438443944404441444244434444444544464447444844494450445144524453445444554456445744584459446044614462446344644465446644674468446944704471447244734474447544764477447844794480448144824483448444854486448744884489449044914492449344944495449644974498449945004501450245034504450545064507450845094510451145124513451445154516451745184519452045214522452345244525452645274528452945304531453245334534453545364537453845394540454145424543454445454546454745484549455045514552455345544555455645574558455945604561456245634564456545664567456845694570457145724573457445754576457745784579458045814582458345844585458645874588458945904591459245934594459545964597459845994600460146024603460446054606460746084609461046114612461346144615461646174618461946204621462246234624462546264627462846294630463146324633463446354636463746384639464046414642464346444645464646474648464946504651465246534654465546564657465846594660466146624663466446654666466746684669467046714672467346744675467646774678467946804681468246834684468546864687468846894690469146924693469446954696469746984699470047014702470347044705470647074708470947104711471247134714471547164717471847194720472147224723472447254726472747284729473047314732473347344735473647374738473947404741474247434744474547464747474847494750475147524753475447554756475747584759476047614762476347644765476647674768476947704771477247734774477547764777477847794780478147824783478447854786478747884789479047914792479347944795479647974798479948004801480248034804480548064807480848094810481148124813481448154816481748184819482048214822482348244825482648274828482948304831483248334834483548364837483848394840484148424843484448454846484748484849485048514852485348544855485648574858485948604861486248634864486548664867486848694870487148724873487448754876487748784879488048814882488348844885488648874888488948904891489248934894489548964897489848994900490149024903490449054906490749084909491049114912491349144915491649174918491949204921492249234924492549264927492849294930493149324933493449354936493749384939494049414942494349444945494649474948494949504951495249534954495549564957495849594960496149624963496449654966496749684969497049714972497349744975497649774978497949804981498249834984498549864987498849894990499149924993499449954996499749984999500050015002500350045005500650075008500950105011501250135014501550165017501850195020502150225023502450255026502750285029503050315032503350345035503650375038503950405041504250435044504550465047504850495050505150525053505450555056505750585059506050615062506350645065506650675068506950705071507250735074507550765077507850795080508150825083508450855086508750885089509050915092509350945095509650975098509951005101510251035104510551065107510851095110511151125113511451155116511751185119512051215122512351245125512651275128512951305131513251335134513551365137513851395140514151425143514451455146514751485149515051515152515351545155515651575158515951605161516251635164516551665167516851695170517151725173517451755176517751785179518051815182518351845185518651875188518951905191519251935194519551965197519851995200520152025203520452055206520752085209521052115212521352145215521652175218521952205221522252235224522552265227522852295230523152325233523452355236523752385239524052415242524352445245524652475248524952505251525252535254525552565257525852595260526152625263526452655266526752685269527052715272527352745275527652775278527952805281528252835284528552865287528852895290529152925293529452955296529752985299530053015302530353045305530653075308530953105311531253135314531553165317531853195320532153225323532453255326532753285329533053315332533353345335533653375338533953405341534253435344534553465347534853495350535153525353535453555356535753585359536053615362536353645365536653675368536953705371537253735374537553765377537853795380538153825383538453855386538753885389539053915392539353945395539653975398539954005401540254035404540554065407540854095410541154125413541454155416541754185419542054215422542354245425542654275428542954305431543254335434543554365437543854395440544154425443544454455446544754485449545054515452545354545455545654575458545954605461546254635464546554665467546854695470547154725473547454755476547754785479548054815482548354845485548654875488548954905491549254935494549554965497549854995500550155025503550455055506550755085509551055115512551355145515551655175518551955205521552255235524552555265527552855295530553155325533553455355536553755385539554055415542554355445545554655475548554955505551555255535554555555565557555855595560556155625563556455655566556755685569557055715572557355745575557655775578557955805581558255835584558555865587558855895590559155925593559455955596559755985599560056015602560356045605560656075608560956105611561256135614561556165617561856195620562156225623562456255626562756285629563056315632563356345635563656375638563956405641564256435644564556465647564856495650565156525653565456555656565756585659566056615662566356645665566656675668566956705671567256735674567556765677567856795680568156825683568456855686568756885689569056915692569356945695569656975698569957005701570257035704570557065707570857095710571157125713571457155716571757185719572057215722572357245725572657275728572957305731573257335734573557365737573857395740574157425743574457455746574757485749575057515752575357545755575657575758575957605761576257635764576557665767576857695770577157725773577457755776577757785779578057815782578357845785578657875788578957905791579257935794579557965797579857995800580158025803580458055806580758085809581058115812581358145815581658175818581958205821582258235824582558265827582858295830583158325833583458355836583758385839584058415842584358445845584658475848584958505851585258535854585558565857585858595860586158625863586458655866586758685869587058715872587358745875587658775878587958805881588258835884588558865887588858895890589158925893589458955896589758985899590059015902590359045905590659075908590959105911591259135914591559165917591859195920592159225923592459255926592759285929593059315932593359345935593659375938593959405941594259435944594559465947594859495950595159525953595459555956595759585959596059615962596359645965596659675968596959705971597259735974597559765977597859795980598159825983598459855986598759885989599059915992599359945995599659975998599960006001600260036004600560066007600860096010601160126013601460156016601760186019602060216022602360246025602660276028602960306031603260336034603560366037603860396040604160426043604460456046604760486049605060516052605360546055605660576058605960606061606260636064606560666067606860696070607160726073607460756076607760786079608060816082608360846085608660876088608960906091609260936094609560966097609860996100610161026103610461056106610761086109611061116112611361146115611661176118611961206121612261236124612561266127612861296130613161326133613461356136613761386139614061416142614361446145614661476148614961506151615261536154615561566157615861596160616161626163616461656166616761686169617061716172617361746175617661776178617961806181618261836184618561866187618861896190619161926193619461956196619761986199620062016202620362046205620662076208620962106211621262136214621562166217621862196220622162226223622462256226622762286229623062316232623362346235623662376238623962406241624262436244624562466247624862496250625162526253625462556256625762586259626062616262626362646265626662676268626962706271627262736274627562766277627862796280628162826283628462856286628762886289629062916292629362946295629662976298629963006301630263036304630563066307630863096310631163126313631463156316631763186319632063216322632363246325632663276328632963306331633263336334633563366337633863396340634163426343634463456346634763486349635063516352635363546355635663576358635963606361636263636364636563666367636863696370637163726373637463756376637763786379638063816382638363846385638663876388638963906391639263936394639563966397639863996400640164026403640464056406640764086409641064116412641364146415641664176418641964206421642264236424642564266427642864296430643164326433643464356436643764386439644064416442644364446445644664476448644964506451645264536454645564566457645864596460646164626463646464656466646764686469647064716472647364746475647664776478647964806481648264836484648564866487648864896490649164926493649464956496649764986499650065016502650365046505650665076508650965106511651265136514651565166517651865196520652165226523652465256526652765286529653065316532653365346535653665376538653965406541654265436544654565466547654865496550655165526553655465556556655765586559656065616562656365646565656665676568656965706571657265736574657565766577657865796580658165826583658465856586658765886589659065916592659365946595659665976598659966006601660266036604660566066607660866096610661166126613661466156616661766186619662066216622662366246625662666276628662966306631663266336634663566366637663866396640664166426643664466456646664766486649665066516652665366546655665666576658665966606661666266636664666566666667666866696670667166726673667466756676667766786679668066816682668366846685668666876688668966906691669266936694669566966697669866996700670167026703670467056706670767086709671067116712671367146715671667176718671967206721672267236724672567266727672867296730673167326733673467356736673767386739674067416742674367446745674667476748674967506751675267536754675567566757675867596760676167626763676467656766676767686769677067716772677367746775677667776778677967806781678267836784678567866787678867896790679167926793679467956796679767986799680068016802680368046805680668076808680968106811681268136814681568166817681868196820682168226823682468256826682768286829683068316832683368346835683668376838683968406841684268436844684568466847684868496850685168526853685468556856685768586859686068616862686368646865686668676868686968706871687268736874687568766877687868796880688168826883688468856886688768886889689068916892689368946895689668976898689969006901690269036904690569066907690869096910691169126913691469156916691769186919692069216922692369246925692669276928692969306931693269336934693569366937693869396940694169426943694469456946694769486949695069516952695369546955695669576958695969606961696269636964696569666967696869696970697169726973697469756976697769786979698069816982698369846985698669876988698969906991699269936994699569966997699869997000700170027003700470057006700770087009701070117012701370147015701670177018701970207021702270237024702570267027702870297030703170327033703470357036703770387039704070417042704370447045704670477048704970507051705270537054705570567057705870597060706170627063706470657066706770687069707070717072707370747075707670777078707970807081708270837084708570867087708870897090709170927093709470957096709770987099710071017102710371047105710671077108710971107111711271137114711571167117711871197120712171227123712471257126712771287129713071317132713371347135713671377138713971407141714271437144714571467147714871497150715171527153715471557156715771587159716071617162716371647165716671677168716971707171717271737174717571767177717871797180718171827183718471857186718771887189719071917192719371947195719671977198719972007201720272037204720572067207720872097210721172127213721472157216721772187219722072217222722372247225722672277228722972307231723272337234723572367237723872397240724172427243724472457246724772487249725072517252725372547255725672577258725972607261726272637264726572667267726872697270727172727273727472757276727772787279728072817282728372847285728672877288728972907291729272937294729572967297729872997300730173027303730473057306730773087309731073117312731373147315731673177318731973207321732273237324732573267327732873297330733173327333733473357336733773387339734073417342734373447345734673477348734973507351735273537354735573567357735873597360736173627363736473657366736773687369737073717372737373747375737673777378737973807381738273837384738573867387738873897390739173927393739473957396739773987399740074017402740374047405740674077408740974107411741274137414741574167417741874197420742174227423742474257426742774287429743074317432743374347435743674377438743974407441744274437444744574467447744874497450745174527453745474557456745774587459746074617462746374647465746674677468746974707471747274737474747574767477747874797480748174827483748474857486748774887489749074917492749374947495749674977498749975007501750275037504750575067507750875097510751175127513751475157516751775187519752075217522752375247525752675277528752975307531753275337534753575367537753875397540754175427543754475457546754775487549755075517552755375547555755675577558755975607561756275637564756575667567756875697570757175727573757475757576757775787579758075817582758375847585758675877588758975907591759275937594759575967597759875997600760176027603760476057606760776087609761076117612761376147615761676177618761976207621762276237624762576267627762876297630763176327633763476357636763776387639764076417642764376447645764676477648764976507651765276537654765576567657765876597660766176627663766476657666766776687669767076717672767376747675767676777678767976807681768276837684768576867687768876897690769176927693769476957696769776987699770077017702770377047705770677077708770977107711771277137714771577167717771877197720772177227723772477257726772777287729773077317732773377347735773677377738773977407741774277437744774577467747774877497750775177527753775477557756775777587759776077617762776377647765776677677768776977707771777277737774777577767777777877797780778177827783778477857786778777887789779077917792779377947795779677977798779978007801780278037804780578067807780878097810781178127813781478157816781778187819782078217822782378247825782678277828782978307831783278337834783578367837783878397840784178427843784478457846784778487849785078517852785378547855785678577858785978607861786278637864786578667867786878697870787178727873787478757876787778787879788078817882788378847885788678877888788978907891789278937894789578967897789878997900790179027903790479057906790779087909791079117912791379147915791679177918791979207921792279237924792579267927792879297930793179327933793479357936793779387939794079417942794379447945794679477948794979507951795279537954795579567957795879597960796179627963796479657966796779687969797079717972797379747975797679777978797979807981798279837984798579867987798879897990799179927993799479957996799779987999800080018002800380048005800680078008800980108011801280138014801580168017801880198020802180228023802480258026802780288029803080318032803380348035803680378038803980408041804280438044804580468047804880498050805180528053805480558056805780588059806080618062806380648065806680678068806980708071807280738074807580768077807880798080808180828083808480858086808780888089809080918092809380948095809680978098809981008101810281038104810581068107810881098110811181128113811481158116811781188119812081218122812381248125812681278128812981308131813281338134813581368137813881398140814181428143814481458146814781488149815081518152815381548155815681578158815981608161816281638164816581668167816881698170817181728173817481758176817781788179818081818182818381848185818681878188818981908191819281938194819581968197819881998200820182028203820482058206820782088209821082118212821382148215821682178218821982208221822282238224822582268227822882298230823182328233823482358236823782388239824082418242824382448245824682478248824982508251825282538254825582568257825882598260826182628263826482658266826782688269827082718272827382748275827682778278827982808281828282838284828582868287828882898290829182928293829482958296829782988299830083018302830383048305830683078308830983108311831283138314831583168317831883198320832183228323832483258326832783288329833083318332833383348335833683378338833983408341834283438344834583468347834883498350835183528353835483558356835783588359836083618362836383648365836683678368836983708371837283738374837583768377837883798380838183828383838483858386838783888389839083918392839383948395839683978398839984008401840284038404840584068407840884098410841184128413841484158416841784188419842084218422842384248425842684278428842984308431843284338434843584368437843884398440844184428443844484458446844784488449845084518452845384548455845684578458845984608461846284638464846584668467846884698470847184728473847484758476847784788479848084818482848384848485848684878488848984908491849284938494849584968497849884998500850185028503850485058506850785088509851085118512851385148515851685178518851985208521852285238524852585268527852885298530853185328533853485358536853785388539854085418542854385448545854685478548854985508551855285538554855585568557855885598560856185628563856485658566856785688569857085718572857385748575857685778578857985808581858285838584858585868587858885898590859185928593859485958596859785988599860086018602860386048605860686078608860986108611861286138614861586168617861886198620862186228623862486258626862786288629863086318632863386348635863686378638863986408641864286438644864586468647864886498650865186528653865486558656865786588659866086618662866386648665866686678668866986708671867286738674867586768677867886798680868186828683868486858686868786888689869086918692869386948695869686978698869987008701870287038704870587068707870887098710871187128713871487158716871787188719872087218722872387248725872687278728872987308731873287338734873587368737873887398740874187428743874487458746874787488749875087518752875387548755875687578758875987608761876287638764876587668767876887698770877187728773877487758776877787788779878087818782878387848785878687878788878987908791879287938794879587968797879887998800880188028803880488058806880788088809881088118812881388148815881688178818881988208821882288238824882588268827882888298830883188328833883488358836883788388839884088418842884388448845884688478848884988508851885288538854885588568857885888598860886188628863886488658866886788688869887088718872887388748875887688778878887988808881888288838884888588868887888888898890889188928893889488958896889788988899890089018902890389048905890689078908890989108911891289138914891589168917891889198920892189228923892489258926892789288929893089318932893389348935893689378938893989408941894289438944894589468947894889498950895189528953895489558956895789588959896089618962896389648965896689678968896989708971897289738974897589768977897889798980898189828983898489858986898789888989899089918992899389948995899689978998899990009001900290039004900590069007900890099010901190129013901490159016901790189019902090219022902390249025902690279028902990309031903290339034903590369037903890399040904190429043904490459046904790489049905090519052905390549055905690579058905990609061906290639064906590669067906890699070907190729073907490759076907790789079908090819082908390849085908690879088908990909091909290939094909590969097909890999100910191029103910491059106910791089109911091119112911391149115911691179118911991209121912291239124912591269127912891299130913191329133913491359136913791389139914091419142914391449145914691479148914991509151915291539154915591569157915891599160916191629163916491659166916791689169917091719172917391749175917691779178917991809181918291839184918591869187918891899190919191929193919491959196919791989199920092019202920392049205920692079208920992109211921292139214921592169217921892199220922192229223922492259226922792289229923092319232923392349235923692379238923992409241924292439244924592469247924892499250925192529253925492559256925792589259926092619262926392649265926692679268926992709271927292739274927592769277927892799280928192829283928492859286928792889289929092919292929392949295929692979298929993009301930293039304930593069307930893099310931193129313931493159316931793189319932093219322932393249325932693279328932993309331933293339334933593369337933893399340934193429343934493459346934793489349935093519352935393549355935693579358935993609361936293639364936593669367936893699370937193729373937493759376937793789379938093819382938393849385938693879388938993909391939293939394939593969397939893999400940194029403940494059406940794089409941094119412941394149415941694179418941994209421942294239424942594269427942894299430943194329433943494359436943794389439944094419442944394449445944694479448944994509451945294539454945594569457945894599460946194629463946494659466946794689469947094719472947394749475947694779478947994809481948294839484948594869487948894899490949194929493949494959496949794989499950095019502950395049505950695079508950995109511951295139514951595169517951895199520952195229523952495259526952795289529953095319532953395349535953695379538953995409541954295439544954595469547954895499550955195529553955495559556955795589559956095619562956395649565956695679568956995709571957295739574957595769577957895799580958195829583958495859586958795889589959095919592959395949595959695979598959996009601960296039604960596069607960896099610961196129613961496159616961796189619962096219622962396249625962696279628962996309631963296339634963596369637963896399640964196429643964496459646964796489649965096519652965396549655965696579658965996609661966296639664966596669667966896699670967196729673967496759676967796789679968096819682968396849685968696879688968996909691969296939694969596969697969896999700970197029703970497059706970797089709971097119712971397149715971697179718971997209721972297239724972597269727972897299730973197329733973497359736973797389739974097419742974397449745974697479748974997509751975297539754975597569757975897599760976197629763976497659766976797689769977097719772977397749775977697779778977997809781978297839784978597869787978897899790979197929793979497959796979797989799980098019802980398049805980698079808980998109811981298139814981598169817981898199820982198229823982498259826982798289829983098319832983398349835983698379838983998409841984298439844984598469847984898499850985198529853985498559856985798589859986098619862986398649865986698679868986998709871987298739874987598769877987898799880988198829883988498859886988798889889989098919892989398949895989698979898989999009901990299039904990599069907990899099910991199129913991499159916991799189919992099219922992399249925992699279928992999309931993299339934993599369937993899399940994199429943994499459946994799489949995099519952995399549955995699579958995999609961996299639964996599669967996899699970997199729973997499759976997799789979998099819982998399849985998699879988998999909991999299939994999599969997999899991000010001100021000310004100051000610007100081000910010100111001210013100141001510016100171001810019100201002110022100231002410025100261002710028100291003010031100321003310034100351003610037100381003910040100411004210043100441004510046100471004810049100501005110052100531005410055100561005710058100591006010061100621006310064100651006610067100681006910070100711007210073100741007510076100771007810079100801008110082100831008410085100861008710088100891009010091100921009310094100951009610097100981009910100101011010210103101041010510106101071010810109101101011110112101131011410115101161011710118101191012010121101221012310124101251012610127101281012910130101311013210133101341013510136101371013810139101401014110142101431014410145101461014710148101491015010151101521015310154101551015610157101581015910160101611016210163101641016510166101671016810169101701017110172101731017410175101761017710178101791018010181101821018310184101851018610187101881018910190101911019210193101941019510196101971019810199102001020110202102031020410205102061020710208102091021010211102121021310214102151021610217102181021910220102211022210223102241022510226102271022810229102301023110232102331023410235102361023710238102391024010241102421024310244102451024610247102481024910250102511025210253102541025510256102571025810259102601026110262102631026410265102661026710268102691027010271102721027310274102751027610277102781027910280102811028210283102841028510286102871028810289102901029110292102931029410295102961029710298102991030010301103021030310304103051030610307103081030910310103111031210313103141031510316103171031810319103201032110322103231032410325103261032710328103291033010331103321033310334103351033610337103381033910340103411034210343103441034510346103471034810349103501035110352103531035410355103561035710358103591036010361103621036310364103651036610367103681036910370103711037210373103741037510376103771037810379103801038110382103831038410385103861038710388103891039010391103921039310394103951039610397103981039910400104011040210403104041040510406104071040810409104101041110412104131041410415104161041710418104191042010421104221042310424104251042610427104281042910430104311043210433104341043510436104371043810439104401044110442104431044410445104461044710448104491045010451104521045310454104551045610457104581045910460104611046210463104641046510466104671046810469104701047110472104731047410475104761047710478104791048010481104821048310484104851048610487104881048910490104911049210493104941049510496104971049810499105001050110502105031050410505105061050710508105091051010511105121051310514105151051610517105181051910520105211052210523105241052510526105271052810529105301053110532105331053410535105361053710538105391054010541105421054310544105451054610547105481054910550105511055210553105541055510556105571055810559105601056110562105631056410565105661056710568105691057010571105721057310574105751057610577105781057910580105811058210583105841058510586105871058810589105901059110592105931059410595105961059710598105991060010601106021060310604106051060610607106081060910610106111061210613106141061510616106171061810619106201062110622106231062410625106261062710628106291063010631106321063310634106351063610637106381063910640106411064210643106441064510646106471064810649106501065110652106531065410655106561065710658106591066010661106621066310664106651066610667106681066910670106711067210673106741067510676106771067810679106801068110682106831068410685106861068710688106891069010691106921069310694106951069610697106981069910700107011070210703107041070510706107071070810709107101071110712107131071410715107161071710718107191072010721107221072310724107251072610727107281072910730107311073210733107341073510736107371073810739107401074110742107431074410745107461074710748107491075010751107521075310754107551075610757107581075910760107611076210763107641076510766107671076810769107701077110772107731077410775107761077710778107791078010781107821078310784107851078610787107881078910790107911079210793107941079510796107971079810799108001080110802108031080410805108061080710808108091081010811108121081310814108151081610817108181081910820108211082210823108241082510826108271082810829108301083110832108331083410835108361083710838108391084010841108421084310844108451084610847108481084910850108511085210853108541085510856108571085810859108601086110862108631086410865108661086710868108691087010871108721087310874108751087610877108781087910880108811088210883108841088510886108871088810889108901089110892108931089410895108961089710898108991090010901109021090310904109051090610907109081090910910109111091210913109141091510916109171091810919109201092110922109231092410925109261092710928109291093010931109321093310934109351093610937109381093910940109411094210943109441094510946109471094810949109501095110952109531095410955109561095710958109591096010961109621096310964109651096610967109681096910970109711097210973109741097510976109771097810979109801098110982109831098410985109861098710988109891099010991109921099310994109951099610997109981099911000110011100211003110041100511006110071100811009110101101111012110131101411015110161101711018110191102011021110221102311024110251102611027110281102911030110311103211033110341103511036110371103811039110401104111042110431104411045110461104711048110491105011051110521105311054110551105611057110581105911060110611106211063110641106511066110671106811069110701107111072110731107411075110761107711078110791108011081110821108311084110851108611087110881108911090110911109211093110941109511096110971109811099111001110111102111031110411105111061110711108111091111011111111121111311114111151111611117111181111911120111211112211123111241112511126111271112811129111301113111132111331113411135111361113711138111391114011141111421114311144111451114611147111481114911150111511115211153111541115511156111571115811159111601116111162111631116411165111661116711168111691117011171111721117311174111751117611177111781117911180111811118211183111841118511186111871118811189111901119111192111931119411195111961119711198111991120011201112021120311204112051120611207112081120911210112111121211213112141121511216112171121811219112201122111222112231122411225112261122711228112291123011231112321123311234112351123611237112381123911240112411124211243112441124511246112471124811249112501125111252112531125411255112561125711258112591126011261112621126311264112651126611267112681126911270112711127211273112741127511276112771127811279112801128111282112831128411285112861128711288112891129011291112921129311294112951129611297112981129911300113011130211303113041130511306113071130811309113101131111312113131131411315113161131711318113191132011321113221132311324113251132611327113281132911330113311133211333113341133511336113371133811339113401134111342113431134411345113461134711348113491135011351113521135311354113551135611357113581135911360113611136211363113641136511366113671136811369113701137111372113731137411375113761137711378113791138011381113821138311384113851138611387113881138911390113911139211393113941139511396113971139811399114001140111402114031140411405114061140711408114091141011411114121141311414114151141611417114181141911420114211142211423114241142511426114271142811429114301143111432114331143411435114361143711438114391144011441114421144311444114451144611447114481144911450114511145211453114541145511456114571145811459114601146111462114631146411465114661146711468114691147011471114721147311474114751147611477114781147911480114811148211483114841148511486114871148811489114901149111492114931149411495114961149711498114991150011501115021150311504115051150611507115081150911510115111151211513115141151511516115171151811519115201152111522115231152411525115261152711528115291153011531115321153311534115351153611537115381153911540115411154211543115441154511546115471154811549115501155111552115531155411555115561155711558115591156011561115621156311564115651156611567115681156911570115711157211573115741157511576115771157811579115801158111582115831158411585115861158711588115891159011591115921159311594115951159611597115981159911600116011160211603116041160511606116071160811609116101161111612116131161411615116161161711618116191162011621116221162311624116251162611627116281162911630116311163211633116341163511636116371163811639116401164111642116431164411645116461164711648116491165011651116521165311654116551165611657116581165911660116611166211663116641166511666116671166811669116701167111672116731167411675116761167711678116791168011681116821168311684116851168611687116881168911690116911169211693116941169511696116971169811699117001170111702117031170411705117061170711708117091171011711117121171311714117151171611717117181171911720117211172211723117241172511726117271172811729117301173111732117331173411735117361173711738117391174011741117421174311744117451174611747117481174911750117511175211753117541175511756117571175811759117601176111762117631176411765117661176711768117691177011771117721177311774117751177611777117781177911780117811178211783117841178511786117871178811789117901179111792117931179411795117961179711798117991180011801118021180311804118051180611807118081180911810118111181211813118141181511816118171181811819118201182111822118231182411825118261182711828118291183011831118321183311834118351183611837118381183911840118411184211843118441184511846118471184811849118501185111852118531185411855118561185711858118591186011861118621186311864118651186611867118681186911870118711187211873118741187511876118771187811879118801188111882118831188411885118861188711888118891189011891118921189311894118951189611897118981189911900119011190211903119041190511906119071190811909119101191111912119131191411915119161191711918119191192011921119221192311924119251192611927119281192911930119311193211933119341193511936119371193811939119401194111942119431194411945119461194711948119491195011951119521195311954119551195611957119581195911960119611196211963119641196511966119671196811969119701197111972119731197411975119761197711978119791198011981119821198311984119851198611987119881198911990119911199211993119941199511996119971199811999120001200112002120031200412005120061200712008120091201012011120121201312014120151201612017120181201912020120211202212023120241202512026120271202812029120301203112032120331203412035120361203712038120391204012041120421204312044120451204612047120481204912050120511205212053120541205512056120571205812059120601206112062120631206412065120661206712068120691207012071120721207312074120751207612077120781207912080120811208212083120841208512086120871208812089120901209112092120931209412095120961209712098120991210012101121021210312104121051210612107121081210912110121111211212113121141211512116121171211812119121201212112122121231212412125121261212712128121291213012131121321213312134121351213612137121381213912140121411214212143121441214512146121471214812149121501215112152121531215412155121561215712158121591216012161121621216312164121651216612167121681216912170121711217212173121741217512176121771217812179121801218112182121831218412185121861218712188121891219012191121921219312194121951219612197121981219912200122011220212203122041220512206122071220812209122101221112212122131221412215122161221712218122191222012221122221222312224122251222612227122281222912230122311223212233122341223512236122371223812239122401224112242122431224412245122461224712248122491225012251122521225312254122551225612257122581225912260122611226212263122641226512266122671226812269122701227112272122731227412275122761227712278122791228012281122821228312284122851228612287122881228912290122911229212293122941229512296122971229812299123001230112302123031230412305123061230712308123091231012311123121231312314123151231612317123181231912320123211232212323123241232512326123271232812329123301233112332123331233412335123361233712338123391234012341123421234312344123451234612347123481234912350123511235212353123541235512356123571235812359123601236112362123631236412365123661236712368123691237012371123721237312374123751237612377123781237912380123811238212383123841238512386123871238812389123901239112392123931239412395123961239712398123991240012401124021240312404124051240612407124081240912410124111241212413124141241512416124171241812419124201242112422124231242412425124261242712428124291243012431124321243312434124351243612437124381243912440124411244212443124441244512446124471244812449124501245112452124531245412455124561245712458124591246012461124621246312464124651246612467124681246912470124711247212473124741247512476124771247812479124801248112482124831248412485124861248712488124891249012491124921249312494124951249612497124981249912500125011250212503125041250512506125071250812509125101251112512125131251412515125161251712518125191252012521125221252312524125251252612527125281252912530125311253212533125341253512536125371253812539125401254112542125431254412545125461254712548125491255012551125521255312554125551255612557125581255912560125611256212563125641256512566125671256812569125701257112572125731257412575125761257712578125791258012581125821258312584125851258612587125881258912590125911259212593125941259512596125971259812599126001260112602126031260412605126061260712608126091261012611126121261312614126151261612617126181261912620126211262212623126241262512626126271262812629126301263112632126331263412635126361263712638126391264012641126421264312644126451264612647126481264912650126511265212653126541265512656126571265812659126601266112662126631266412665126661266712668126691267012671126721267312674126751267612677126781267912680126811268212683126841268512686126871268812689126901269112692126931269412695126961269712698126991270012701127021270312704127051270612707127081270912710127111271212713127141271512716127171271812719127201272112722127231272412725127261272712728127291273012731127321273312734127351273612737127381273912740127411274212743127441274512746127471274812749127501275112752127531275412755127561275712758127591276012761127621276312764127651276612767127681276912770127711277212773127741277512776127771277812779127801278112782127831278412785127861278712788127891279012791127921279312794127951279612797127981279912800128011280212803128041280512806128071280812809128101281112812128131281412815128161281712818128191282012821128221282312824128251282612827128281282912830128311283212833128341283512836128371283812839128401284112842128431284412845128461284712848128491285012851128521285312854128551285612857128581285912860128611286212863128641286512866128671286812869128701287112872128731287412875128761287712878128791288012881128821288312884128851288612887128881288912890128911289212893128941289512896128971289812899129001290112902129031290412905129061290712908129091291012911129121291312914129151291612917129181291912920129211292212923129241292512926129271292812929129301293112932129331293412935129361293712938129391294012941129421294312944129451294612947129481294912950129511295212953129541295512956129571295812959129601296112962129631296412965129661296712968129691297012971129721297312974129751297612977129781297912980129811298212983129841298512986129871298812989129901299112992129931299412995129961299712998129991300013001130021300313004130051300613007130081300913010130111301213013130141301513016130171301813019130201302113022130231302413025130261302713028130291303013031130321303313034130351303613037130381303913040130411304213043130441304513046130471304813049130501305113052130531305413055130561305713058130591306013061130621306313064130651306613067130681306913070130711307213073130741307513076130771307813079130801308113082130831308413085130861308713088130891309013091130921309313094130951309613097130981309913100131011310213103131041310513106131071310813109131101311113112131131311413115131161311713118131191312013121131221312313124131251312613127131281312913130131311313213133131341313513136131371313813139131401314113142131431314413145131461314713148131491315013151131521315313154131551315613157131581315913160131611316213163131641316513166131671316813169131701317113172131731317413175131761317713178131791318013181131821318313184131851318613187131881318913190131911319213193131941319513196131971319813199132001320113202132031320413205132061320713208132091321013211132121321313214132151321613217132181321913220132211322213223132241322513226132271322813229132301323113232132331323413235132361323713238132391324013241132421324313244132451324613247132481324913250132511325213253132541325513256132571325813259132601326113262132631326413265132661326713268132691327013271132721327313274132751327613277132781327913280132811328213283132841328513286132871328813289132901329113292132931329413295132961329713298132991330013301133021330313304133051330613307133081330913310133111331213313133141331513316133171331813319133201332113322133231332413325133261332713328133291333013331133321333313334133351333613337133381333913340133411334213343133441334513346133471334813349133501335113352133531335413355133561335713358133591336013361133621336313364133651336613367133681336913370133711337213373133741337513376133771337813379133801338113382133831338413385133861338713388133891339013391133921339313394133951339613397133981339913400134011340213403134041340513406134071340813409134101341113412134131341413415134161341713418134191342013421134221342313424134251342613427134281342913430134311343213433134341343513436134371343813439134401344113442134431344413445134461344713448134491345013451134521345313454134551345613457134581345913460134611346213463134641346513466134671346813469134701347113472134731347413475134761347713478134791348013481134821348313484134851348613487134881348913490134911349213493134941349513496134971349813499135001350113502135031350413505135061350713508135091351013511135121351313514135151351613517135181351913520135211352213523135241352513526135271352813529135301353113532135331353413535135361353713538135391354013541135421354313544135451354613547135481354913550135511355213553135541355513556135571355813559135601356113562135631356413565135661356713568135691357013571135721357313574135751357613577135781357913580135811358213583135841358513586135871358813589135901359113592135931359413595135961359713598135991360013601136021360313604136051360613607136081360913610136111361213613136141361513616136171361813619136201362113622136231362413625136261362713628136291363013631136321363313634136351363613637136381363913640136411364213643136441364513646136471364813649136501365113652136531365413655136561365713658136591366013661136621366313664136651366613667136681366913670136711367213673136741367513676136771367813679136801368113682136831368413685136861368713688136891369013691136921369313694136951369613697136981369913700137011370213703137041370513706137071370813709137101371113712137131371413715137161371713718137191372013721137221372313724137251372613727137281372913730137311373213733137341373513736137371373813739137401374113742137431374413745137461374713748137491375013751137521375313754137551375613757137581375913760137611376213763137641376513766137671376813769137701377113772137731377413775137761377713778137791378013781137821378313784137851378613787137881378913790137911379213793137941379513796137971379813799138001380113802138031380413805138061380713808138091381013811138121381313814138151381613817138181381913820138211382213823138241382513826138271382813829138301383113832138331383413835138361383713838138391384013841138421384313844138451384613847138481384913850138511385213853138541385513856138571385813859138601386113862138631386413865138661386713868138691387013871138721387313874138751387613877138781387913880138811388213883138841388513886138871388813889138901389113892138931389413895138961389713898138991390013901139021390313904139051390613907139081390913910139111391213913139141391513916139171391813919139201392113922139231392413925139261392713928139291393013931139321393313934139351393613937139381393913940139411394213943139441394513946139471394813949139501395113952139531395413955139561395713958139591396013961139621396313964139651396613967139681396913970139711397213973139741397513976139771397813979139801398113982139831398413985139861398713988139891399013991139921399313994139951399613997139981399914000140011400214003140041400514006140071400814009140101401114012140131401414015140161401714018140191402014021140221402314024140251402614027140281402914030140311403214033140341403514036140371403814039140401404114042140431404414045140461404714048140491405014051140521405314054140551405614057140581405914060140611406214063140641406514066140671406814069140701407114072140731407414075140761407714078140791408014081140821408314084140851408614087140881408914090140911409214093140941409514096140971409814099141001410114102141031410414105141061410714108141091411014111141121411314114141151411614117141181411914120141211412214123141241412514126141271412814129141301413114132141331413414135141361413714138141391414014141141421414314144141451414614147141481414914150141511415214153141541415514156141571415814159141601416114162141631416414165141661416714168141691417014171141721417314174141751417614177141781417914180141811418214183141841418514186141871418814189141901419114192141931419414195141961419714198141991420014201142021420314204142051420614207142081420914210142111421214213142141421514216142171421814219142201422114222142231422414225142261422714228142291423014231142321423314234142351423614237142381423914240142411424214243142441424514246142471424814249142501425114252142531425414255142561425714258142591426014261142621426314264142651426614267142681426914270142711427214273142741427514276142771427814279142801428114282142831428414285142861428714288142891429014291142921429314294142951429614297142981429914300143011430214303143041430514306143071430814309143101431114312143131431414315143161431714318143191432014321143221432314324143251432614327143281432914330143311433214333143341433514336143371433814339143401434114342143431434414345143461434714348143491435014351143521435314354143551435614357143581435914360143611436214363143641436514366143671436814369143701437114372143731437414375143761437714378143791438014381143821438314384143851438614387143881438914390143911439214393143941439514396143971439814399144001440114402144031440414405144061440714408144091441014411144121441314414144151441614417144181441914420144211442214423144241442514426144271442814429144301443114432144331443414435144361443714438144391444014441144421444314444144451444614447144481444914450144511445214453144541445514456144571445814459144601446114462144631446414465144661446714468144691447014471144721447314474144751447614477144781447914480144811448214483144841448514486144871448814489144901449114492144931449414495144961449714498144991450014501145021450314504145051450614507145081450914510145111451214513145141451514516145171451814519145201452114522145231452414525145261452714528145291453014531145321453314534145351453614537145381453914540145411454214543145441454514546145471454814549145501455114552145531455414555145561455714558145591456014561145621456314564145651456614567145681456914570145711457214573145741457514576145771457814579145801458114582145831458414585145861458714588145891459014591145921459314594145951459614597145981459914600146011460214603146041460514606146071460814609146101461114612146131461414615146161461714618146191462014621146221462314624146251462614627146281462914630146311463214633146341463514636146371463814639146401464114642146431464414645146461464714648146491465014651146521465314654146551465614657146581465914660146611466214663146641466514666146671466814669146701467114672146731467414675146761467714678146791468014681146821468314684146851468614687146881468914690146911469214693146941469514696146971469814699147001470114702147031470414705147061470714708147091471014711147121471314714147151471614717147181471914720147211472214723147241472514726147271472814729147301473114732147331473414735147361473714738147391474014741147421474314744147451474614747147481474914750147511475214753147541475514756147571475814759147601476114762147631476414765147661476714768147691477014771147721477314774147751477614777147781477914780147811478214783147841478514786147871478814789147901479114792147931479414795147961479714798147991480014801148021480314804148051480614807148081480914810148111481214813148141481514816148171481814819148201482114822148231482414825148261482714828148291483014831148321483314834148351483614837148381483914840148411484214843148441484514846148471484814849148501485114852148531485414855148561485714858148591486014861148621486314864148651486614867
  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, 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, Streams.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 (~var.useRegister) & 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. VAR saved: RegisterEntry;
  1375. BEGIN
  1376. IF backend.cooperative THEN
  1377. ReleaseUsedRegisters(saved);
  1378. Emit(Push(position,IntermediateCode.Immediate(sizeType,trapNo)));
  1379. CallThis(position,"Runtime","Trap",1);
  1380. RestoreRegisterUse(saved);
  1381. ELSE
  1382. Emit(Trap(position,trapNo));
  1383. END;
  1384. END EmitTrap;
  1385. PROCEDURE EmitEnter (section: IntermediateCode.Section; position: Position; procedure: SyntaxTree.Procedure; callconv: LONGINT; varSize: LONGINT; numRegs: LONGINT);
  1386. VAR name: Basic.SegmentedName;
  1387. VAR op1, op2, reg: IntermediateCode.Operand;
  1388. VAR call, nocall: Label;
  1389. VAR parametersSize: LONGINT;
  1390. VAR prevSection: IntermediateCode.Section;
  1391. VAR prevDump: Streams.Writer;
  1392. VAR body: SyntaxTree.Body;
  1393. VAR procedureType: SyntaxTree.ProcedureType;
  1394. BEGIN
  1395. IF procedure # NIL THEN
  1396. procedureType := procedure.type(SyntaxTree.ProcedureType);
  1397. ELSE procedureType := NIL;
  1398. END;
  1399. ASSERT((procedure = NIL) OR ~procedureType.noPAF);
  1400. prevSection := SELF.section;
  1401. SELF.section := section;
  1402. prevDump := dump;
  1403. dump := section.comments;
  1404. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1405. IF backend.hasLinkRegister THEN
  1406. Emit(Push(Basic.invalidPosition, lr));
  1407. END;
  1408. Emit(Push(Basic.invalidPosition,fp));
  1409. IF procedure # NIL THEN
  1410. body := procedure.procedureScope.body;
  1411. ELSE
  1412. body := NIL;
  1413. END;
  1414. IF backend.cooperative THEN
  1415. IF (procedure # NIL) & (HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure)) THEN
  1416. GetCodeSectionNameForSymbol(procedure, name);
  1417. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  1418. ELSE
  1419. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  1420. END;
  1421. IntermediateCode.InitAddress(op1, addressType, name , 0, 0);
  1422. IntermediateCode.AddOffset(op1, 1);
  1423. Emit(Push(Basic.invalidPosition,op1));
  1424. Emit(Mov(Basic.invalidPosition,fp, sp));
  1425. IF (body # NIL) & (body.code = NIL) & ~procedure.procedureScope.body.isUnchecked THEN
  1426. NEW(call, section);
  1427. NEW(nocall, section);
  1428. reg := NewRegisterOperand(addressType);
  1429. IntermediateCode.InitImmediate(op1,addressType, varSize);
  1430. Emit(Sub(Basic.invalidPosition,reg, sp, op1));
  1431. BrltL(call, sp, reg);
  1432. IntermediateCode.InitMemory(op2, addressType,ap,ToMemoryUnits(system,system.addressSize*10));
  1433. BrgeL(nocall, sp, op2);
  1434. call.Resolve(section.pc);
  1435. Emit(Push(Basic.invalidPosition, reg));
  1436. ReleaseIntermediateOperand(reg);
  1437. parametersSize := ProcParametersSize(procedure);
  1438. IntermediateCode.InitImmediate(op2,addressType, parametersSize);
  1439. Emit(Push(Basic.invalidPosition, op2));
  1440. CallThis(position, "Activities","ExpandStack",2);
  1441. Emit(Result(Basic.invalidPosition, sp));
  1442. nocall.Resolve(section.pc);
  1443. END;
  1444. ELSE
  1445. IF backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1446. Emit(Push(Basic.invalidPosition, one)) ;
  1447. procedureType.SetParametersOffset(1);
  1448. ASSERT(system.GenerateParameterOffsets(procedure, procedure.level > 0));
  1449. END;
  1450. Emit(Mov(Basic.invalidPosition, fp, sp));
  1451. END;
  1452. END;
  1453. Emit(Enter(Basic.invalidPosition, callconv, varSize));
  1454. SELF.section := prevSection;
  1455. dump := prevDump;
  1456. END EmitEnter;
  1457. PROCEDURE Enter(position: Position; callconv: LONGINT; varSize: LONGINT): IntermediateCode.Instruction;
  1458. VAR op1,op2: IntermediateCode.Operand;
  1459. VAR instruction: IntermediateCode.Instruction;
  1460. BEGIN
  1461. IntermediateCode.InitNumber(op1,callconv);
  1462. IntermediateCode.InitNumber(op2,varSize);
  1463. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.enter,op1,op2,emptyOperand);
  1464. RETURN instruction
  1465. END Enter;
  1466. PROCEDURE Leave(position: Position; callconv: LONGINT): IntermediateCode.Instruction;
  1467. VAR op1: IntermediateCode.Operand;
  1468. VAR instruction: IntermediateCode.Instruction;
  1469. BEGIN
  1470. IntermediateCode.InitNumber(op1,callconv);
  1471. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.leave,op1,emptyOperand,emptyOperand);
  1472. RETURN instruction
  1473. END Leave;
  1474. PROCEDURE EmitLeave(section: IntermediateCode.Section; position: Basic.Position; procedure: SyntaxTree.Procedure; callconv: LONGINT);
  1475. VAR prevSection: IntermediateCode.Section;
  1476. VAR op2, size: IntermediateCode.Operand;
  1477. VAR body: SyntaxTree.Body;
  1478. BEGIN
  1479. prevSection := SELF.section;
  1480. SELF.section := section;
  1481. Emit(Leave(position, callconv));
  1482. IF procedure # NIL THEN
  1483. body := procedure.procedureScope.body;
  1484. ELSE
  1485. body := NIL;
  1486. END;
  1487. IF callconv # SyntaxTree.InterruptCallingConvention THEN
  1488. IF backend.cooperative OR backend.preciseGC & (body # NIL) & (body.code = NIL) THEN
  1489. IntermediateCode.InitImmediate(op2,addressType, ToMemoryUnits(system, system.addressSize));
  1490. Emit(Add(position, sp, fp, op2));
  1491. ELSE
  1492. Emit(Mov(position, sp, fp));
  1493. END;
  1494. Emit(Pop(position, fp));
  1495. END;
  1496. SELF.section := prevSection;
  1497. END EmitLeave;
  1498. PROCEDURE Symbol(x: SyntaxTree.Symbol; VAR op: Operand);
  1499. VAR m: SymbolMap;
  1500. BEGIN
  1501. position := x.position;
  1502. IF currentIsInline THEN
  1503. m := currentMapper.Get(x);
  1504. IF m # NIL THEN
  1505. (*
  1506. Printout.Info("mapping from", x);
  1507. Printout.Info("mapping to ", m.to);
  1508. *)
  1509. m.to.Accept(SELF);
  1510. op := result;
  1511. IF m.tag # NIL THEN
  1512. ReleaseIntermediateOperand(result.tag);
  1513. m.tag.Accept(SELF);
  1514. op.tag := result.op;
  1515. ReleaseIntermediateOperand(result.tag);
  1516. END;
  1517. RETURN
  1518. END;
  1519. END;
  1520. x.Accept(SELF);
  1521. op := result;
  1522. END Symbol;
  1523. PROCEDURE Expression(x: SyntaxTree.Expression);
  1524. BEGIN
  1525. position := x.position;
  1526. constantDeclaration := NIL;
  1527. IF (x IS SyntaxTree.SymbolDesignator) & (x(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Constant) THEN
  1528. constantDeclaration := x(SyntaxTree.SymbolDesignator).symbol;
  1529. END;
  1530. IF x.resolved # NIL THEN
  1531. x.resolved.Accept(SELF)
  1532. ELSE
  1533. x.Accept(SELF)
  1534. END;
  1535. (* check this, was commented out in ActiveCells3 *)
  1536. IF (x IS SyntaxTree.Designator) & (x(SyntaxTree.Designator).modifiers # NIL) & ~backend.cellsAreObjects THEN
  1537. Error(x.position, "unsupported modifier");
  1538. END;
  1539. END Expression;
  1540. (*
  1541. PROCEDURE ResetUsedTemporaries(previous: VariableUse);
  1542. VAR current: VariableUse; set: SET; i,j: LONGINT; variable: SyntaxTree.Variable; op: Operand; tmp: IntermediateCode.Operand;
  1543. BEGIN
  1544. temporaries.GetUsage(current);
  1545. FOR i := 0 TO LEN(current)-1 DO
  1546. set := current[i] - previous[i];
  1547. IF set # {} THEN
  1548. FOR j := 0 TO MAX(SET)-1 DO
  1549. IF j IN set THEN
  1550. variable := temporaries.GetVariable(i*MAX(SET)+j);
  1551. IF (variable.type.resolved IS SyntaxTree.MathArrayType) & (variable.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) THEN
  1552. Symbol(variable, op);
  1553. MakeMemory(tmp,op.op,addressType,0);
  1554. ReleaseOperand(op);
  1555. Emit(Mov(position,tmp, nil ) );
  1556. ReleaseIntermediateOperand(tmp);
  1557. END;
  1558. END;
  1559. END;
  1560. END;
  1561. END;
  1562. END ResetUsedTemporaries;
  1563. *)
  1564. PROCEDURE Statement(x: SyntaxTree.Statement);
  1565. VAR use: VariableUse;
  1566. BEGIN
  1567. temporaries.GetUsage(use);
  1568. position := x.position;
  1569. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  1570. IF commentPrintout # NIL THEN
  1571. commentPrintout.Statement(x);
  1572. dump.Ln;
  1573. (*dump.Update;*)
  1574. END;
  1575. x.Accept(SELF);
  1576. (*
  1577. CheckRegistersFree();
  1578. *)
  1579. (*ResetUsedTemporaries(use);*)
  1580. temporaries.SetUsage(use);
  1581. END Statement;
  1582. (* dereference op. If op is already a memory operand then use auxiliary register to dereference
  1583. result will be registered as a new use of operand, op is not released (op must be released by caller)
  1584. *)
  1585. PROCEDURE MakeMemory(VAR res: IntermediateCode.Operand; op: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1586. BEGIN
  1587. ASSERT(op.mode # IntermediateCode.Undefined);
  1588. IF op.mode = IntermediateCode.ModeMemory THEN
  1589. ReuseCopy(res,op);
  1590. ELSE
  1591. res := op;
  1592. UseIntermediateOperand(res);
  1593. END;
  1594. IntermediateCode.AddOffset(res,offset);
  1595. IntermediateCode.MakeMemory(res,type);
  1596. END MakeMemory;
  1597. PROCEDURE ToMemory(VAR res: IntermediateCode.Operand; type: IntermediateCode.Type; offset: LONGINT);
  1598. VAR mem: IntermediateCode.Operand;
  1599. BEGIN
  1600. MakeMemory(mem,res,type,offset);
  1601. ReleaseIntermediateOperand(res);
  1602. res := mem;
  1603. END ToMemory;
  1604. PROCEDURE LoadValue(VAR operand: Operand; type: SyntaxTree.Type);
  1605. VAR mem: IntermediateCode.Operand;
  1606. firstOp, lastOp, stepOp: IntermediateCode.Operand;
  1607. componentType: SyntaxTree.Type;
  1608. BEGIN
  1609. type := type.resolved;
  1610. IF operand.mode = ModeReference THEN
  1611. IF type IS SyntaxTree.RangeType THEN
  1612. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, system.lenType), 0);
  1613. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1614. MakeMemory(stepOp, operand.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  1615. ReleaseOperand(operand);
  1616. operand.op := firstOp;
  1617. operand.tag := lastOp;
  1618. operand.extra := stepOp;
  1619. ELSIF type IS SyntaxTree.ComplexType THEN
  1620. componentType := type(SyntaxTree.ComplexType).componentType;
  1621. ASSERT((componentType.SameType(system.realType)) OR (componentType.SameType(system.longrealType)));
  1622. MakeMemory(firstOp, operand.op, IntermediateCode.GetType(system, componentType), 0);
  1623. MakeMemory(lastOp, operand.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  1624. ReleaseOperand(operand);
  1625. operand.op := firstOp;
  1626. operand.tag := lastOp
  1627. ELSE
  1628. MakeMemory(mem,operand.op,IntermediateCode.GetType(system,type),0);
  1629. ReleaseIntermediateOperand(operand.op);
  1630. operand.op := mem;
  1631. END;
  1632. operand.mode := ModeValue;
  1633. END;
  1634. ASSERT(operand.mode = ModeValue);
  1635. END LoadValue;
  1636. PROCEDURE Evaluate(x: SyntaxTree.Expression; VAR op: Operand);
  1637. VAR prevConditional: BOOLEAN;
  1638. BEGIN
  1639. prevConditional := conditional;
  1640. conditional := FALSE;
  1641. InitOperand(result, ModeUndefined);
  1642. Expression(x);
  1643. op := result;
  1644. LoadValue(op,x.type.resolved);
  1645. conditional := prevConditional;
  1646. END Evaluate;
  1647. PROCEDURE Designate(x: SyntaxTree.Expression; VAR op: Operand);
  1648. VAR prevConditional: BOOLEAN;
  1649. BEGIN
  1650. prevConditional := conditional;
  1651. conditional := FALSE;
  1652. InitOperand(result,ModeUndefined);
  1653. Expression(x);
  1654. op := result;
  1655. (*
  1656. ASSERT((op.mode = ModeReference) OR (x.type.resolved IS SyntaxTree.NilType)); (* special case: winapi NIL parameter on references *)
  1657. *)
  1658. conditional := prevConditional;
  1659. END Designate;
  1660. PROCEDURE Condition(x: SyntaxTree.Expression; trueL,falseL: Label);
  1661. VAR prevTrue, prevFalse: Label; prevConditional: BOOLEAN;
  1662. BEGIN
  1663. ASSERT(trueL # NIL); ASSERT(falseL # NIL);
  1664. prevTrue := trueLabel; prevFalse := falseLabel; prevConditional := conditional;
  1665. conditional := TRUE;
  1666. trueLabel := trueL; falseLabel := falseL;
  1667. Expression(x);
  1668. trueL := trueLabel; falseL := falseLabel;
  1669. trueLabel := prevTrue;falseLabel := prevFalse;conditional := prevConditional;
  1670. END Condition;
  1671. PROCEDURE NewRegisterOperand(type: IntermediateCode.Type): IntermediateCode.Operand;
  1672. VAR op: IntermediateCode.Operand; reg: LONGINT;
  1673. BEGIN
  1674. reg := AcquireRegister(type,IntermediateCode.GeneralPurposeRegister);
  1675. IntermediateCode.InitRegister(op, type, IntermediateCode.GeneralPurposeRegister,reg);
  1676. RETURN op
  1677. END NewRegisterOperand;
  1678. PROCEDURE UnuseRegister(register: LONGINT);
  1679. BEGIN
  1680. IF (register > 0) THEN
  1681. register := registerUsageCount.Map(register);
  1682. registerUsageCount.DecUse(register);
  1683. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1684. dump.String("unuse register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1685. END;
  1686. IF registerUsageCount.Use(register)=0 THEN
  1687. IF ~RemoveRegisterEntry(usedRegisters,register) THEN
  1688. Warning(position, "register cannot be removed");
  1689. END;
  1690. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1691. dump.String("remove register from usedRegisters"); dump.Ln; dump.Update;
  1692. END;
  1693. ELSIF registerUsageCount.Use(register)<0 THEN
  1694. Warning(position, "register removed too often");
  1695. IF dump # NIL THEN
  1696. dump.String("register removed too often"); dump.Ln; dump.Update;
  1697. END;
  1698. END;
  1699. END;
  1700. END UnuseRegister;
  1701. PROCEDURE UseRegister(register: LONGINT);
  1702. BEGIN
  1703. IF (register > 0) THEN
  1704. register := registerUsageCount.Map(register);
  1705. registerUsageCount.IncUse(register);
  1706. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1707. dump.String("use register "); dump.Int(register,1); dump.String(": ");dump.Int(registerUsageCount.Use(register),1); dump.Ln; dump.Update;
  1708. END;
  1709. IF registerUsageCount.Use(register)=1 THEN
  1710. AddRegisterEntry(usedRegisters,register, registerUsageCount.used[register].class, registerUsageCount.used[register].type);
  1711. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1712. dump.String("add register to usedRegisters"); dump.Ln; dump.Update;
  1713. END;
  1714. END;
  1715. END;
  1716. END UseRegister;
  1717. PROCEDURE ReleaseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1718. BEGIN
  1719. UnuseRegister(op.register)
  1720. END ReleaseIntermediateOperand;
  1721. PROCEDURE UseIntermediateOperand(CONST op: IntermediateCode.Operand);
  1722. BEGIN
  1723. UseRegister(op.register)
  1724. END UseIntermediateOperand;
  1725. PROCEDURE ReleaseOperand(CONST op: Operand);
  1726. BEGIN
  1727. UnuseRegister(op.op.register);
  1728. UnuseRegister(op.tag.register);
  1729. UnuseRegister(op.extra.register);
  1730. END ReleaseOperand;
  1731. (* save registers marked in array "markedRegisters" to the stack
  1732. remove entries from array "markedRegisters" and save to array "saved" (=> recursion possible)
  1733. *)
  1734. PROCEDURE SaveRegisters();
  1735. VAR op: IntermediateCode.Operand; entry: RegisterEntry; type: IntermediateCode.Type;
  1736. BEGIN
  1737. entry := usedRegisters;
  1738. WHILE entry # NIL DO
  1739. type := registerUsageCount.used[entry.register].type;
  1740. IntermediateCode.InitRegister(op,entry.type,entry.registerClass, entry.register);
  1741. Emit(Push(position,op));
  1742. entry := entry.next;
  1743. END;
  1744. END SaveRegisters;
  1745. PROCEDURE ReleaseUsedRegisters(VAR saved: RegisterEntry);
  1746. BEGIN
  1747. saved := usedRegisters;
  1748. usedRegisters := NIL;
  1749. END ReleaseUsedRegisters;
  1750. (** remove parameter registers from used queue *)
  1751. PROCEDURE ReleaseParameterRegisters;
  1752. VAR entry,prev,next: RegisterEntry;
  1753. BEGIN
  1754. entry := usedRegisters; prev := NIL; usedRegisters := NIL;
  1755. WHILE entry # NIL DO
  1756. next := entry.next;
  1757. IF entry.registerClass.class = IntermediateCode.Parameter THEN
  1758. registerUsageCount.DecUse(entry.register);
  1759. ASSERT(registerUsageCount.Use(entry.register)=0);
  1760. IF TraceRegisterUsageCount & (dump# NIL) THEN
  1761. dump.String("unuse register "); dump.Int(entry.register,1); dump.Ln; dump.Update;
  1762. END;
  1763. ELSIF prev = NIL THEN
  1764. usedRegisters := entry; entry.prev := NIL; entry.next := NIL; prev := entry;
  1765. ELSE
  1766. prev.next := entry; entry.prev := prev; entry.next := NIL; prev:= entry;
  1767. END;
  1768. entry := next;
  1769. END;
  1770. END ReleaseParameterRegisters;
  1771. (* restore registers from array saved and re-enter into array markedRegisters (recursion possible) *)
  1772. PROCEDURE RestoreRegisters(CONST saved: RegisterEntry);
  1773. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1774. BEGIN
  1775. entry := saved;
  1776. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1777. entry := prev;
  1778. WHILE entry # NIL DO
  1779. prev := entry.prev;
  1780. type := entry.type;
  1781. class := entry.registerClass;
  1782. IntermediateCode.InitRegister(op,type,class,entry.register);
  1783. Emit(Pop(position,op));
  1784. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1785. entry := prev;
  1786. END;
  1787. END RestoreRegisters;
  1788. (* re-enter registers from array saved into array markedRegisters (recursion possible) *)
  1789. PROCEDURE RestoreRegisterUse(CONST saved: RegisterEntry);
  1790. VAR op: IntermediateCode.Operand; entry,prev: RegisterEntry; type: IntermediateCode.Type; class: IntermediateCode.RegisterClass;
  1791. BEGIN
  1792. entry := saved;
  1793. WHILE (entry # NIL) DO prev := entry; entry := entry.next END;
  1794. entry := prev;
  1795. WHILE entry # NIL DO
  1796. prev := entry.prev;
  1797. type := entry.type;
  1798. class := entry.registerClass;
  1799. IntermediateCode.InitRegister(op,type,class,entry.register);
  1800. Emit(Mov(position,op,op));
  1801. AddRegisterEntry(usedRegisters,entry.register,entry.registerClass, entry.type);
  1802. entry := prev;
  1803. END;
  1804. END RestoreRegisterUse;
  1805. PROCEDURE CheckRegistersFree;
  1806. VAR r: RegisterEntry; warning: ARRAY 128 OF CHAR; i: LONGINT;
  1807. BEGIN
  1808. IF usedRegisters # NIL THEN
  1809. r := usedRegisters;
  1810. WHILE r # NIL DO
  1811. warning := "register ";
  1812. Strings.AppendInt(warning, r.register);
  1813. Strings.Append(warning, " not released.");
  1814. Warning(position,warning);
  1815. r := r .next;
  1816. END;
  1817. END;
  1818. FOR i := 0 TO registerUsageCount.count-1 DO
  1819. IF registerUsageCount.used[i].count < 0 THEN
  1820. warning := "register ";
  1821. Strings.AppendInt(warning, i);
  1822. Strings.Append(warning, " unused too often.");
  1823. Warning(position,warning);
  1824. ELSIF registerUsageCount.used[i].count > 0 THEN (* should always coincide with cases above *)
  1825. warning := "register ";
  1826. Strings.AppendInt(warning, i);
  1827. Strings.Append(warning, " not unused often enough.");
  1828. Warning(position,warning);
  1829. END;
  1830. END;
  1831. END CheckRegistersFree;
  1832. (* Reuse2: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1833. Otherwise allocate a new register.
  1834. Does NOT necessarily keep the content of src1 or src2 in result! *)
  1835. PROCEDURE Reuse2(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand);
  1836. BEGIN
  1837. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1838. UseIntermediateOperand(result);
  1839. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1840. UseIntermediateOperand(result);
  1841. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass,AcquireRegister(src1.type, src1.registerClass));
  1842. END;
  1843. END Reuse2;
  1844. (* Reuse2a: reuse src1 or src2 for ongoing computation if src1 or src2, respectively, is a register.
  1845. Otherwise check if an alternative destination is available. If so, then take the alternative (which is not necessarily a register).
  1846. If not then allocate a new register.
  1847. Does NOT necessarily keep the content of src1 or src2 in result!
  1848. *)
  1849. PROCEDURE Reuse2a(VAR result: IntermediateCode.Operand; src1,src2: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1850. BEGIN
  1851. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1852. UseIntermediateOperand(result);
  1853. ELSIF ReusableRegister(src2) THEN IntermediateCode.InitRegister(result,src2.type,src2.registerClass, src2.register);
  1854. UseIntermediateOperand(result);
  1855. ELSIF alternative.mode # IntermediateCode.Undefined THEN
  1856. result := alternative; alternative := emptyOperand;
  1857. UseIntermediateOperand(result);
  1858. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1859. END;
  1860. END Reuse2a;
  1861. (* like reuse2 but only one source *)
  1862. PROCEDURE Reuse1(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1863. BEGIN
  1864. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1865. UseIntermediateOperand(result);
  1866. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1867. END;
  1868. END Reuse1;
  1869. (* like reuse2a but only one source *)
  1870. PROCEDURE Reuse1a(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand; VAR alternative: IntermediateCode.Operand);
  1871. BEGIN
  1872. IF ReusableRegister(src1) THEN IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1873. UseIntermediateOperand(result);
  1874. ELSIF alternative.mode # IntermediateCode.Undefined THEN result := alternative; alternative := emptyOperand;
  1875. UseIntermediateOperand(result);
  1876. ELSE IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1877. END;
  1878. END Reuse1a;
  1879. (* like reuse1 but guarantees that content of src1 is in result *)
  1880. PROCEDURE ReuseCopy(VAR result: IntermediateCode.Operand; src1: IntermediateCode.Operand);
  1881. BEGIN
  1882. IF ReusableRegister(src1) THEN
  1883. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, src1.register);
  1884. ASSERT((src1.mode = IntermediateCode.ModeRegister) & (src1.offset = 0));
  1885. UseIntermediateOperand(result);
  1886. ELSE
  1887. IntermediateCode.InitRegister(result,src1.type,src1.registerClass, AcquireRegister(src1.type, src1.registerClass));
  1888. Emit(Mov(position,result,src1));
  1889. END
  1890. END ReuseCopy;
  1891. PROCEDURE TransferToRegister(VAR result: IntermediateCode.Operand; src: IntermediateCode.Operand);
  1892. BEGIN
  1893. IF ReusableRegister(src) THEN
  1894. IntermediateCode.InitRegister(result,src.type,src.registerClass, src.register);
  1895. ELSE
  1896. IntermediateCode.InitRegister(result,src.type,src.registerClass, AcquireRegister(src.type, src.registerClass));
  1897. Emit(Mov(position,result,src));
  1898. ReleaseIntermediateOperand(src);
  1899. END
  1900. END TransferToRegister;
  1901. (** labels and branches **)
  1902. PROCEDURE NewLabel(): Label;
  1903. VAR label: Label;
  1904. BEGIN
  1905. NEW(label,section); RETURN label;
  1906. END NewLabel;
  1907. PROCEDURE SetLabel(label: Label);
  1908. BEGIN label.Resolve(section.pc);
  1909. END SetLabel;
  1910. PROCEDURE LabelOperand(label: Label): IntermediateCode.Operand;
  1911. BEGIN
  1912. ASSERT(label # NIL);
  1913. IF label.pc < 0 THEN (* label not yet set *)
  1914. label.AddFixup(section.pc);
  1915. END;
  1916. RETURN IntermediateCode.Address(addressType,label.section.name,GetFingerprint(label.section.symbol), label.pc);
  1917. END LabelOperand;
  1918. PROCEDURE BrL(label: Label);
  1919. BEGIN
  1920. Emit(Br(position,LabelOperand(label)));
  1921. END BrL;
  1922. PROCEDURE BrgeL(label: Label; left,right: IntermediateCode.Operand);
  1923. BEGIN
  1924. Emit(Brge(position,LabelOperand(label),left,right));
  1925. END BrgeL;
  1926. PROCEDURE BrltL(label: Label; left,right: IntermediateCode.Operand);
  1927. BEGIN
  1928. Emit(Brlt(position,LabelOperand(label),left,right));
  1929. END BrltL;
  1930. PROCEDURE BreqL(label: Label; left,right: IntermediateCode.Operand);
  1931. BEGIN
  1932. Emit(Breq(position,LabelOperand(label),left,right));
  1933. END BreqL;
  1934. PROCEDURE BrneL(label: Label; left,right: IntermediateCode.Operand);
  1935. BEGIN
  1936. Emit(Brne(position,LabelOperand(label),left,right));
  1937. END BrneL;
  1938. PROCEDURE Convert(VAR operand: IntermediateCode.Operand; type: IntermediateCode.Type);
  1939. VAR new: IntermediateCode.Operand;
  1940. BEGIN
  1941. IF Trace THEN TraceEnter("Convert") END;
  1942. IF IntermediateCode.TypeEquals(type,operand.type) THEN (* nothing to be done *)
  1943. ELSIF (operand.mode = IntermediateCode.ModeRegister) THEN
  1944. IF (type.sizeInBits = operand.type.sizeInBits) & (type.form IN IntermediateCode.Integer) & (operand.type.form IN IntermediateCode.Integer)
  1945. & (operand.offset = 0)
  1946. THEN
  1947. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,operand.register);
  1948. Emit(Conv(position,new,operand));
  1949. ELSE
  1950. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1951. Emit(Conv(position,new,operand));
  1952. ReleaseIntermediateOperand(operand);
  1953. END;
  1954. operand := new;
  1955. 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
  1956. IntermediateCode.InitImmediate(operand,type,operand.intValue);
  1957. ELSE
  1958. IntermediateCode.InitRegister(new,type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(type,IntermediateCode.GeneralPurposeRegister));
  1959. Emit(Conv(position,new,operand));
  1960. ReleaseIntermediateOperand(operand);
  1961. operand := new;
  1962. END;
  1963. IF Trace THEN TraceExit("Convert") END;
  1964. END Convert;
  1965. PROCEDURE TrapC(br: ConditionalBranch; left,right:IntermediateCode.Operand; trapNo: LONGINT);
  1966. VAR exit: Label;
  1967. BEGIN
  1968. Assert((left.mode # IntermediateCode.ModeImmediate) OR (right.mode # IntermediateCode.ModeImmediate),"trap emission with two immediates");
  1969. exit := NewLabel();
  1970. br(exit,left,right);
  1971. EmitTrap(position,trapNo);
  1972. SetLabel(exit);
  1973. END TrapC;
  1974. (** expressions *)
  1975. (** emit necessary runtime check for set elements **)
  1976. PROCEDURE CheckSetElement(o: IntermediateCode.Operand);
  1977. VAR max: IntermediateCode.Operand;
  1978. BEGIN
  1979. IF isUnchecked THEN RETURN END;
  1980. IF o.mode # IntermediateCode.ModeImmediate THEN (* otherwise it's the job of the checker *)
  1981. IntermediateCode.InitImmediate(max, setType, setType.sizeInBits (* number of bits in set *) -1);
  1982. TrapC(BrgeL, max, o, SetElementTrap);
  1983. END;
  1984. END CheckSetElement;
  1985. (** the set that a range represents **)
  1986. PROCEDURE SetFromRange(x: SyntaxTree.RangeExpression): IntermediateCode.Operand;
  1987. VAR
  1988. operand: Operand;
  1989. resultingSet, temp, size, allBits, noBits, one: IntermediateCode.Operand;
  1990. BEGIN
  1991. ASSERT((x.first # NIL) & (x.last # NIL)); (* ensured by the checker *)
  1992. allBits := IntermediateCode.Immediate(setType, -1); (* bit mask 111...11111 *)
  1993. noBits := IntermediateCode.Immediate(setType, 0); (* bit mask 0...0 *)
  1994. one := IntermediateCode.Immediate(setType, 1);
  1995. Evaluate(x, operand);
  1996. Convert(operand.op, setType);
  1997. Convert(operand.tag, setType);
  1998. CheckSetElement(operand.op);
  1999. CheckSetElement(operand.tag);
  2000. (* create mask for lower bound
  2001. i.e. shift 11111111 to the left by the value of the lower bound
  2002. *)
  2003. Reuse1(temp, operand.op);
  2004. Emit(Shl(position,temp, allBits, operand.op));
  2005. ReleaseIntermediateOperand(operand.op);
  2006. operand.op := temp;
  2007. (* create mask for upper bound
  2008. i.e. shift 11111111 to the right by the difference between the
  2009. upper bound and the maximum number of set elements
  2010. *)
  2011. IF (operand.tag.mode = IntermediateCode.ModeImmediate) & (operand.tag.symbol.name = "") THEN
  2012. IntermediateCode.InitImmediate(operand.tag, operand.tag.type, operand.op.type.sizeInBits - 1- operand.tag.intValue);
  2013. Reuse1(temp, operand.tag);
  2014. ELSE
  2015. Reuse1(temp, operand.tag);
  2016. IntermediateCode.InitImmediate(size, operand.tag.type, operand.op.type.sizeInBits - 1);
  2017. Emit(Sub(position,temp, size, operand.tag));
  2018. END;
  2019. Emit(Shr(position,temp, allBits, operand.tag));
  2020. ReleaseIntermediateOperand(operand.tag);
  2021. operand.tag := temp;
  2022. Reuse2(resultingSet, operand.op, operand.tag);
  2023. (* intersect the two masks *)
  2024. Emit(And(position,resultingSet, operand.op, operand.tag));
  2025. ReleaseOperand(operand);
  2026. RETURN resultingSet
  2027. END SetFromRange;
  2028. PROCEDURE VisitSet*(x: SyntaxTree.Set);
  2029. VAR
  2030. res, operand: Operand;
  2031. temp, one, noBits, dest: IntermediateCode.Operand;
  2032. expression: SyntaxTree.Expression;
  2033. i: LONGINT;
  2034. BEGIN
  2035. IF Trace THEN TraceEnter("VisitSet") END;
  2036. dest := destination;
  2037. destination := emptyOperand;
  2038. noBits := IntermediateCode.Immediate(setType, 0);
  2039. one := IntermediateCode.Immediate(setType, 1);
  2040. (* start off with the empty set *)
  2041. InitOperand(res, ModeValue);
  2042. IntermediateCode.InitRegister(res.op, setType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(setType, IntermediateCode.GeneralPurposeRegister));
  2043. Emit(Mov(position,res.op, noBits));
  2044. FOR i := 0 TO x.elements.Length() - 1 DO
  2045. expression := x.elements.GetExpression(i);
  2046. IF expression IS SyntaxTree.RangeExpression THEN
  2047. (* range of set elements *)
  2048. temp := SetFromRange(expression(SyntaxTree.RangeExpression));
  2049. ASSERT(IntermediateCode.TypeEquals(setType, temp.type));
  2050. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2051. ReleaseIntermediateOperand(temp)
  2052. ELSE
  2053. (* singelton element *)
  2054. Evaluate(expression, operand);
  2055. Convert(operand.op, setType);
  2056. CheckSetElement(operand.op);
  2057. (* create subset containing single element *)
  2058. Reuse1(temp, operand.op);
  2059. Emit(Shl(position,temp, one, operand.op));
  2060. ReleaseOperand(operand);
  2061. Emit(Or(position,res.op, res.op, temp)); (* unify subset with current set *)
  2062. ReleaseIntermediateOperand(temp);
  2063. END
  2064. END;
  2065. result := res;
  2066. destination := dest;
  2067. IF Trace THEN TraceExit("VisitSet") END;
  2068. END VisitSet;
  2069. (* math arrays of the form [a,b,c]
  2070. x is a static array and thus does not provide any pointers
  2071. *)
  2072. PROCEDURE VisitMathArrayExpression*(x: SyntaxTree.MathArrayExpression);
  2073. VAR variable: SyntaxTree.Variable; index: SyntaxTree.IndexDesignator; dim: LONGINT;
  2074. designator: SyntaxTree.Designator; i: LONGINT; element: SyntaxTree.IntegerValue;
  2075. PROCEDURE RecursiveAssignment(x: SyntaxTree.MathArrayExpression; dim: LONGINT);
  2076. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression;
  2077. element: SyntaxTree.IntegerValue;
  2078. BEGIN
  2079. numberElements := x.elements.Length();
  2080. expression := index.parameters.GetExpression(dim);
  2081. element := expression(SyntaxTree.IntegerValue);
  2082. FOR i := 0 TO numberElements-1 DO
  2083. expression := x.elements.GetExpression(i);
  2084. element.SetValue(i);
  2085. IF expression IS SyntaxTree.MathArrayExpression THEN
  2086. RecursiveAssignment(expression(SyntaxTree.MathArrayExpression),dim+1);
  2087. ELSE
  2088. Assign(index,expression);
  2089. END;
  2090. END;
  2091. END RecursiveAssignment;
  2092. PROCEDURE Dimension(): LONGINT;
  2093. VAR dim: LONGINT; expression: SyntaxTree.Expression;
  2094. BEGIN
  2095. dim := 0;
  2096. expression := x;
  2097. WHILE expression IS SyntaxTree.MathArrayExpression DO
  2098. expression := expression(SyntaxTree.MathArrayExpression).elements.GetExpression(0);
  2099. INC(dim);
  2100. END;
  2101. RETURN dim;
  2102. END Dimension;
  2103. BEGIN
  2104. (*static math array not providing pointers anyway *)
  2105. variable := GetTemporaryVariable(x.type, FALSE, FALSE (* untraced *));
  2106. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  2107. designator.SetType(variable.type);
  2108. dim := Dimension();
  2109. index := SyntaxTree.NewIndexDesignator(x.position,designator);
  2110. FOR i := 0 TO dim-1 DO
  2111. element := SyntaxTree.NewIntegerValue(x.position,0);
  2112. element.SetType(system.longintType);
  2113. index.parameters.AddExpression(element);
  2114. END;
  2115. index.SetType(SemanticChecker.ArrayBase(x.type,dim));
  2116. RecursiveAssignment(x,0);
  2117. Expression(designator);
  2118. END VisitMathArrayExpression;
  2119. PROCEDURE VisitUnaryExpression*(x: SyntaxTree.UnaryExpression);
  2120. VAR type,t0: SyntaxTree.Type; operand: Operand; dest: IntermediateCode.Operand;
  2121. BEGIN
  2122. IF Trace THEN TraceEnter("VisitUnaryExpression") END;
  2123. dest := destination; destination := emptyOperand;
  2124. IF x.operator = Scanner.Not THEN
  2125. IF conditional THEN
  2126. Condition(x.left,falseLabel,trueLabel)
  2127. ELSE
  2128. Evaluate(x.left,operand);
  2129. InitOperand(result,ModeValue);
  2130. Reuse1a(result.op,operand.op,dest);
  2131. Emit(Xor(position,result.op,operand.op,true));
  2132. ReleaseOperand(operand);
  2133. END;
  2134. ELSIF x.operator = Scanner.Minus THEN
  2135. Evaluate(x.left,operand);
  2136. InitOperand(result,ModeValue);
  2137. Reuse1a(result.op,operand.op,dest);
  2138. type := x.left.type.resolved;
  2139. IF type IS SyntaxTree.SetType THEN
  2140. Emit(Not(position,result.op,operand.op));
  2141. ELSIF (type IS SyntaxTree.ComplexType) THEN
  2142. Reuse1(result.tag,operand.tag);
  2143. Emit(Neg(position,result.op,operand.op)); (* real part *)
  2144. Emit(Neg(position,result.tag,operand.tag)) (* imaginary part *)
  2145. ELSIF (type IS SyntaxTree.NumberType) OR (type IS SyntaxTree.SizeType) OR (type IS SyntaxTree.AddressType) THEN
  2146. Emit(Neg(position,result.op,operand.op));
  2147. ELSE HALT(200)
  2148. END;
  2149. ReleaseOperand(operand);
  2150. ELSIF x.operator = Scanner.Address THEN
  2151. Designate(x.left,operand);
  2152. operand.mode := ModeValue;
  2153. t0 := x.left.type.resolved;
  2154. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  2155. ReleaseIntermediateOperand(operand.op);
  2156. operand.op := operand.tag;
  2157. IntermediateCode.InitOperand(operand.tag);
  2158. END;
  2159. Convert(operand.op,IntermediateCode.GetType(system,x.type));
  2160. result := operand;
  2161. ELSE HALT(100)
  2162. END;
  2163. destination := dest;
  2164. IF Trace THEN TraceExit("VisitUnaryExpression") END;
  2165. END VisitUnaryExpression;
  2166. (* test if e is of type type, side effect: result of evaluation of e stays in the operand *)
  2167. PROCEDURE TypeTest(tag: IntermediateCode.Operand; type: SyntaxTree.Type; trueL,falseL: Label);
  2168. VAR left,right: IntermediateCode.Operand; level,offset: LONGINT; repeatL: Label; originalType: SyntaxTree.Type;
  2169. BEGIN
  2170. type := type.resolved;
  2171. originalType := type;
  2172. IF type IS SyntaxTree.PointerType THEN
  2173. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  2174. END;
  2175. IF type IS SyntaxTree.ObjectType THEN
  2176. BrL(trueL);
  2177. ELSE
  2178. ASSERT(type IS SyntaxTree.RecordType);
  2179. (*
  2180. IntermediateCode.MakeMemory(tag,addressType); (*! already done during generation *)
  2181. *)
  2182. ReuseCopy(left,tag);
  2183. right := TypeDescriptorAdr(type);
  2184. IF backend.cooperative THEN
  2185. repeatL := NewLabel();
  2186. IF (originalType IS SyntaxTree.PointerType) & ~type(SyntaxTree.RecordType).isObject THEN
  2187. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,ToMemoryUnits(system,addressType.sizeInBits))));
  2188. END;
  2189. SetLabel(repeatL);
  2190. BreqL(trueL,left,right);
  2191. Emit(Mov(position,left,IntermediateCode.Memory(addressType,left,0)));
  2192. BrneL(repeatL,left,nil);
  2193. ELSIF meta.simple THEN
  2194. level := type(SyntaxTree.RecordType).Level();
  2195. (* get type desc tag of level relative to base tag *)
  2196. offset := (meta.BaseTypesTableOffset + level) * addressType.sizeInBits;
  2197. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2198. IntermediateCode.MakeMemory(left,addressType);
  2199. BreqL(trueL,left,right);
  2200. ELSE
  2201. level := type(SyntaxTree.RecordType).Level();
  2202. (* get type desc tag of level relative to base tag *)
  2203. offset := (meta.BaseTypesTableOffset - level) * addressType.sizeInBits;
  2204. IntermediateCode.AddOffset(left,ToMemoryUnits(system,offset));
  2205. IntermediateCode.MakeMemory(left,addressType);
  2206. BreqL(trueL,left,right);
  2207. END;
  2208. ReleaseIntermediateOperand(left); ReleaseIntermediateOperand(right);
  2209. BrL(falseL);
  2210. END;
  2211. END TypeTest;
  2212. PROCEDURE Error(position: Position; CONST s: ARRAY OF CHAR);
  2213. BEGIN
  2214. backend.Error(module.module.sourceName,position,Streams.Invalid,s);
  2215. IF dump # NIL THEN
  2216. dump.String(s); dump.Ln;
  2217. END;
  2218. END Error;
  2219. PROCEDURE Warning(position: Position; CONST s: ARRAY OF CHAR);
  2220. BEGIN
  2221. Basic.Warning(backend.diagnostics, module.module.sourceName,position, s);
  2222. IF dump # NIL THEN
  2223. dump.String(s); dump.Ln; dump.Update;
  2224. END;
  2225. END Warning;
  2226. PROCEDURE CreateTraceModuleMethod(mod: SyntaxTree.Module);
  2227. VAR name: Basic.SectionName; pooledName: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2228. VAR variable: SyntaxTree.Variable; register,op: IntermediateCode.Operand;
  2229. operand:Operand;
  2230. BEGIN
  2231. previousSection := section;
  2232. Global.GetModuleName(mod,name);
  2233. Strings.Append(name,".@Trace");
  2234. Basic.ToSegmentedName(name, pooledName);
  2235. section := NewSection(module.allSections, Sections.CodeSection, pooledName,NIL,TRUE);
  2236. IF dump # NIL THEN dump := section.comments END;
  2237. IF backend.hasLinkRegister THEN
  2238. Emit(Push(Basic.invalidPosition, lr));
  2239. END;
  2240. variable := mod.moduleScope.firstVariable;
  2241. WHILE variable # NIL DO
  2242. IF ~variable.untraced & variable.type.resolved.hasPointers THEN
  2243. Symbol(variable, operand);
  2244. register := operand.op;
  2245. CallTraceMethod(register, variable.type);
  2246. ReleaseIntermediateOperand(register);
  2247. END;
  2248. variable := variable.nextVariable;
  2249. END;
  2250. IF backend.hasLinkRegister THEN
  2251. Emit(Pop(Basic.invalidPosition, lr));
  2252. END;
  2253. Basic.ToSegmentedName ("Modules.Module.@Trace",pooledName);
  2254. IntermediateCode.InitAddress(op, addressType, pooledName , 0, 0);
  2255. Emit(Br(position,op));
  2256. INC(statCoopTraceModule, section.pc);
  2257. section := previousSection;
  2258. IF dump # NIL THEN dump := section.comments END;
  2259. END CreateTraceModuleMethod;
  2260. PROCEDURE CallAssignPointer(CONST dst (* address *) , src (* value *): IntermediateCode.Operand);
  2261. BEGIN
  2262. Emit (Push(position, dst));
  2263. Emit (Push(position, src));
  2264. CallThis(position,"GarbageCollector","Assign", 2);
  2265. END CallAssignPointer;
  2266. PROCEDURE CallAssignMethod(CONST dst (* address *) , src (* address *) : IntermediateCode.Operand; type: SyntaxTree.Type);
  2267. VAR name: Basic.SegmentedName; size: LONGINT; base: SyntaxTree.Type; op: IntermediateCode.Operand;
  2268. BEGIN
  2269. IF SemanticChecker.IsPointerType (type) THEN
  2270. CallAssignPointer(dst, IntermediateCode.Memory (addressType,src,0));
  2271. ELSIF type.IsRecordType() THEN
  2272. Emit (Push(position,dst));
  2273. Emit (Push(position,src));
  2274. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2275. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2276. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2277. Emit(Call(position,op, ToMemoryUnits(system, 2*system.addressSize)));
  2278. ELSIF IsStaticArray(type) THEN
  2279. size := StaticArrayNumElements(type);
  2280. base := StaticArrayBaseType(type);
  2281. IF base.IsRecordType() THEN
  2282. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2283. Emit (Push(position, dst));
  2284. Emit (Push(position, src));
  2285. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2286. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2287. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2288. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2289. Emit(Call(position,op,ToMemoryUnits(system, 3*system.addressSize)));
  2290. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2291. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2292. Emit (Push(position, dst));
  2293. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2294. Emit (Push(position, src));
  2295. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  2296. ELSE
  2297. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2298. Emit (Push(position, dst));
  2299. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2300. Emit (Push(position, src));
  2301. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  2302. ASSERT(StaticArrayBaseType(type).IsPointer());
  2303. END;
  2304. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2305. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2306. Emit (Push(position, dst));
  2307. Emit (Push(position, src));
  2308. CallThis(position,"GarbageCollector","AssignDelegate", 2);
  2309. ELSE HALT(100); (* missing ? *)
  2310. END;
  2311. END CallAssignMethod;
  2312. PROCEDURE CreateAssignProcedure (recordType: SyntaxTree.RecordType);
  2313. VAR name: Basic.SegmentedName;
  2314. VAR variable: SyntaxTree.Variable; src, dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2315. parameter1, parameter2, parameter0: IntermediateCode.Operand; label: Label;
  2316. context: Context;
  2317. BEGIN
  2318. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,3*addressType.sizeInBits));
  2319. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2320. parameter2 (* src *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2321. GetRecordTypeName (recordType,name);
  2322. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2323. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,TRUE));
  2324. IF dump # NIL THEN dump := section.comments END;
  2325. IF backend.hasLinkRegister THEN
  2326. Emit(Push(Basic.invalidPosition, lr));
  2327. END;
  2328. variable := recordType.recordScope.firstVariable;
  2329. WHILE variable # NIL DO
  2330. IF variable.NeedsTrace() THEN
  2331. dst := NewRegisterOperand (addressType);
  2332. src := NewRegisterOperand (addressType);
  2333. Emit (Mov(position, dst, parameter1));
  2334. Emit (Mov(position, src, parameter2));
  2335. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2336. IntermediateCode.AddOffset(src,ToMemoryUnits(system,variable.offsetInBits));
  2337. CallAssignMethod(dst, src, variable.type);
  2338. ReleaseIntermediateOperand(src);
  2339. ReleaseIntermediateOperand(dst);
  2340. END;
  2341. variable := variable.nextVariable;
  2342. END;
  2343. recordBase := recordType.GetBaseRecord();
  2344. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2345. IF backend.hasLinkRegister THEN
  2346. Emit(Pop(Basic.invalidPosition, lr));
  2347. END;
  2348. GetRecordTypeName (recordBase,name);
  2349. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2350. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2351. Emit(Br(position,op));
  2352. ELSE
  2353. Emit(Exit(position,0,0, 0));
  2354. END;
  2355. IF ~recordType.isObject THEN
  2356. GetRecordTypeName (recordType,name);
  2357. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2358. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2359. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2360. NEW(registerUsageCount);
  2361. usedRegisters := NIL;
  2362. dst := NewRegisterOperand (addressType);
  2363. src := NewRegisterOperand (addressType);
  2364. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2365. Emit(Mov(position, dst, parameter1));
  2366. Emit(Mov(position, src, parameter2));
  2367. label := NewLabel();
  2368. SetLabel(label);
  2369. Emit(Push(position, dst));
  2370. Emit(Push(position, src));
  2371. GetRecordTypeName (recordType,name);
  2372. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  2373. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2374. Emit(Call(position, op, 0));
  2375. Emit(Pop(position, src));
  2376. Emit(Pop(position, dst));
  2377. Emit(Add(position, dst, dst, ofs));
  2378. Emit(Add(position, src, src, ofs));
  2379. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2380. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2381. Emit(Exit(position,0,0, 0));
  2382. END;
  2383. INC(statCoopAssignProcedure, section.pc);
  2384. ReturnToContext(context);
  2385. IF dump # NIL THEN dump := section.comments END;
  2386. END CreateAssignProcedure;
  2387. PROCEDURE CallTraceMethod(CONST register: IntermediateCode.Operand; type: SyntaxTree.Type);
  2388. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; size: LONGINT; base: SyntaxTree.Type; skip: Label;
  2389. BEGIN
  2390. IF IsUnsafePointer (type) THEN
  2391. skip := NewLabel();
  2392. IntermediateCode.InitRegister(op, addressType, IntermediateCode.GeneralPurposeRegister, register.register);
  2393. Emit (Mov (position, op, IntermediateCode.Memory (addressType,register,0)));
  2394. BreqL (skip, op, nil);
  2395. CallTraceMethod (op,type.resolved(SyntaxTree.PointerType).pointerBase);
  2396. SetLabel (skip);
  2397. ELSIF SemanticChecker.IsPointerType (type) THEN
  2398. Emit (Push(position, IntermediateCode.Memory (addressType,register,0)));
  2399. CallThis(position,"GarbageCollector","Mark", 1);
  2400. ELSIF type.IsRecordType() THEN
  2401. Emit (Push(position,register));
  2402. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2403. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2404. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2405. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2406. ELSIF IsStaticArray(type) THEN
  2407. size := StaticArrayNumElements(type);
  2408. base := StaticArrayBaseType(type);
  2409. IF base.IsRecordType() THEN
  2410. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2411. Emit (Push(position, register));
  2412. GetRecordTypeName (base.resolved(SyntaxTree.RecordType), name);
  2413. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2414. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2415. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2416. Emit(Call(position, op, ToMemoryUnits(system, system.addressSize*2)));
  2417. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2418. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2419. Emit (Push(position, register));
  2420. CallThis(position,"GarbageCollector","MarkDelegateArray", 2);
  2421. ELSE
  2422. Emit (Push(position, IntermediateCode.Immediate (sizeType,size)));
  2423. Emit (Push(position, register));
  2424. CallThis(position,"GarbageCollector","MarkPointerArray", 2);
  2425. ASSERT(base.IsPointer());
  2426. END;
  2427. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2428. Emit (Push(position, IntermediateCode.Memory (addressType,register,ToMemoryUnits(system,addressType.sizeInBits))));
  2429. CallThis(position,"GarbageCollector","Mark", 1);
  2430. ELSE HALT(100); (* missing ? *)
  2431. END;
  2432. END CallTraceMethod;
  2433. PROCEDURE CreateTraceMethod (recordType: SyntaxTree.RecordType);
  2434. VAR name: Basic.SegmentedName; previousSection: IntermediateCode.Section;
  2435. VAR variable: SyntaxTree.Variable; register,op,ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2436. parameter0, parameter1: IntermediateCode.Operand; label: Label; context: Context;
  2437. BEGIN
  2438. previousSection := section;
  2439. parameter0 (* size *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2440. parameter1 (* address *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2441. GetRecordTypeName (recordType,name);
  2442. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2443. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2444. IF dump # NIL THEN dump := section.comments END;
  2445. IF backend.hasLinkRegister THEN
  2446. Emit(Push(Basic.invalidPosition, lr));
  2447. END;
  2448. variable := recordType.recordScope.firstVariable;
  2449. WHILE variable # NIL DO
  2450. IF variable.NeedsTrace() THEN
  2451. register := NewRegisterOperand (addressType);
  2452. Emit (Mov(position,register,parameter1));
  2453. IntermediateCode.AddOffset(register,ToMemoryUnits(system,variable.offsetInBits));
  2454. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2455. IntermediateCode.AddOffset(register,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2456. END;
  2457. CallTraceMethod(register, variable.type);
  2458. ReleaseIntermediateOperand(register);
  2459. END;
  2460. variable := variable.nextVariable;
  2461. END;
  2462. recordBase := recordType.GetBaseRecord();
  2463. WHILE (recordBase # NIL) & ~recordBase.hasPointers DO
  2464. recordBase := recordBase.GetBaseRecord();
  2465. END;
  2466. IF recordBase # NIL THEN
  2467. IF backend.hasLinkRegister THEN
  2468. Emit(Pop(Basic.invalidPosition, lr));
  2469. END;
  2470. GetRecordTypeName (recordBase,name);
  2471. IF HasExplicitTraceMethod (recordBase) THEN
  2472. Basic.SuffixSegmentedName (name, Basic.MakeString ("Trace"));
  2473. ELSE
  2474. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2475. END;
  2476. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2477. Emit(Br(position,op));
  2478. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  2479. Emit(Exit(position,0,0,0));
  2480. ELSE
  2481. IF backend.hasLinkRegister THEN
  2482. Emit(Pop(Basic.invalidPosition, lr));
  2483. END;
  2484. IF recordType.isObject THEN
  2485. Basic.ToSegmentedName ("BaseTypes.Object",name);
  2486. ELSE
  2487. Basic.ToSegmentedName ("BaseTypes.Record",name);
  2488. END;
  2489. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2490. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2491. Emit(Br(position,op));
  2492. END;
  2493. IF ~recordType.isObject THEN
  2494. GetRecordTypeName (recordType,name);
  2495. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  2496. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2497. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2498. NEW(registerUsageCount);
  2499. usedRegisters := NIL;
  2500. IF dump # NIL THEN dump := section.comments END;
  2501. register := NewRegisterOperand (addressType);
  2502. Emit (Mov(position,register,IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits))));
  2503. IF (recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain THEN
  2504. IntermediateCode.AddOffset(register,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2505. END;
  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, ToMemoryUnits(system, system.addressSize)));
  2511. ReleaseIntermediateOperand(register);
  2512. Emit(Exit(position,0,0,0));
  2513. GetRecordTypeName (recordType,name);
  2514. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2515. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2516. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2517. NEW(registerUsageCount);
  2518. usedRegisters := NIL;
  2519. register := NewRegisterOperand (addressType);
  2520. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2521. Emit(Mov(position, register, parameter1));
  2522. label := NewLabel();
  2523. SetLabel(label);
  2524. Emit(Push(position, register));
  2525. GetRecordTypeName (recordType,name);
  2526. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  2527. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2528. Emit(Call(position, op, 0));
  2529. Emit(Pop(position, register));
  2530. Emit(Add(position, register, register, ofs));
  2531. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2532. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2533. Emit(Exit(position,0,0,0));
  2534. END;
  2535. INC(statCoopTraceMethod, section.pc);
  2536. ReturnToContext(context);
  2537. IF dump # NIL THEN dump := section.comments END;
  2538. END CreateTraceMethod;
  2539. PROCEDURE CreateResetProcedure (recordType: SyntaxTree.RecordType);
  2540. VAR name: Basic.SegmentedName;
  2541. VAR variable: SyntaxTree.Variable; dst, op, ofs: IntermediateCode.Operand; recordBase: SyntaxTree.RecordType;
  2542. parameter1, parameter0: IntermediateCode.Operand; label: Label;
  2543. context: Context;
  2544. BEGIN
  2545. IF recordType.isObject THEN RETURN END;
  2546. parameter0 (* len *) := IntermediateCode.Memory(sizeType,sp,ToMemoryUnits(system,2*addressType.sizeInBits));
  2547. parameter1 (* dest *) := IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,1*addressType.sizeInBits));
  2548. GetRecordTypeName (recordType,name);
  2549. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2550. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2551. IF dump # NIL THEN dump := section.comments END;
  2552. IF backend.hasLinkRegister THEN
  2553. Emit(Push(Basic.invalidPosition, lr));
  2554. END;
  2555. variable := recordType.recordScope.firstVariable;
  2556. WHILE variable # NIL DO
  2557. IF variable.NeedsTrace() THEN
  2558. dst := NewRegisterOperand (addressType);
  2559. Emit (Mov(position, dst, parameter1));
  2560. IntermediateCode.AddOffset(dst,ToMemoryUnits(system,variable.offsetInBits));
  2561. IF recordType.isObject & ((recordType.pointerType = NIL) OR ~recordType.pointerType.isPlain) THEN
  2562. IntermediateCode.AddOffset(dst,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  2563. END;
  2564. CallResetProcedure(dst, nil, variable.type);
  2565. ReleaseIntermediateOperand(dst);
  2566. END;
  2567. variable := variable.nextVariable;
  2568. END;
  2569. recordBase := recordType.GetBaseRecord();
  2570. IF (recordBase # NIL) & recordBase.NeedsTrace() THEN
  2571. IF backend.hasLinkRegister THEN
  2572. Emit(Pop(Basic.invalidPosition, lr));
  2573. END;
  2574. GetRecordTypeName (recordBase,name);
  2575. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2576. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2577. Emit(Br(position,op));
  2578. ELSE
  2579. Emit(Exit(position,0,0, 0));
  2580. END;
  2581. GetRecordTypeName (recordType,name);
  2582. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2583. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2584. section := NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL);
  2585. NEW(registerUsageCount);
  2586. usedRegisters := NIL;
  2587. dst := NewRegisterOperand (addressType);
  2588. ofs := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(recordType)));
  2589. Emit(Mov(position, dst, parameter1));
  2590. label := NewLabel();
  2591. SetLabel(label);
  2592. Emit(Push(position, dst));
  2593. GetRecordTypeName (recordType,name);
  2594. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2595. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2596. Emit(Call(position, op, 0));
  2597. Emit(Pop(position, dst));
  2598. Emit(Add(position, dst, dst, ofs));
  2599. Emit(Sub(position, parameter0, parameter0, IntermediateCode.Immediate(sizeType, 1)));
  2600. BrneL(label, parameter0, IntermediateCode.Immediate(sizeType, 0));
  2601. Emit(Exit(position,0,0, 0));
  2602. INC(statCoopResetProcedure, section.pc);
  2603. ReturnToContext(context);
  2604. IF dump # NIL THEN dump := section.comments END;
  2605. END CreateResetProcedure;
  2606. PROCEDURE CreateResetMethod (scope: SyntaxTree.ProcedureScope);
  2607. VAR name: Basic.SegmentedName; context: Context;
  2608. BEGIN
  2609. GetCodeSectionNameForSymbol(scope.ownerProcedure, name);
  2610. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2611. context := SwitchContext(NewSection(module.allSections, Sections.CodeSection, name,NIL,dump # NIL));
  2612. IF dump # NIL THEN dump := section.comments END;
  2613. IF backend.hasLinkRegister THEN
  2614. Emit(Push(Basic.invalidPosition, lr));
  2615. END;
  2616. Emit(Push(position,fp));
  2617. Emit(Mov(position,fp, IntermediateCode.Memory(addressType,sp,ToMemoryUnits(system,addressType.sizeInBits * 2))));
  2618. ResetVariables(scope);
  2619. Emit(Pop(position,fp));
  2620. Emit(Exit(position,0,0, 0));
  2621. ReturnToContext(context);
  2622. IF dump # NIL THEN dump := section.comments END;
  2623. END CreateResetMethod;
  2624. PROCEDURE CallResetProcedure(dest, tag: IntermediateCode.Operand; type: SyntaxTree.Type);
  2625. VAR base: SyntaxTree.Type; op, size: IntermediateCode.Operand; name: Basic.SegmentedName;
  2626. BEGIN
  2627. IF SemanticChecker.IsPointerType (type) THEN
  2628. Emit (Push(position, dest));
  2629. CallThis(position,"GarbageCollector","Reset", 1);
  2630. ELSIF type.IsRecordType() THEN
  2631. Emit (Push(position, dest));
  2632. GetRecordTypeName (type.resolved(SyntaxTree.RecordType),name);
  2633. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2634. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2635. Emit(Call(position,op, ToMemoryUnits(system, system.addressSize)));
  2636. ELSIF type.resolved IS SyntaxTree.ArrayType THEN
  2637. size := GetArrayLength(type, tag);
  2638. base := ArrayBaseType(type);
  2639. IF base.IsRecordType() THEN
  2640. Emit (Push(position, size));
  2641. Emit (Push(position, dest));
  2642. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  2643. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  2644. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2645. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2646. Emit(Call(position,op,ToMemoryUnits(system, 2*system.addressSize)));
  2647. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  2648. Emit (Push(position, size));
  2649. Emit (Push(position, dest));
  2650. CallThis(position,"GarbageCollector","ResetDelegateArray", 2);
  2651. ELSE
  2652. Emit (Push(position, size));
  2653. Emit (Push(position, dest));
  2654. CallThis(position,"GarbageCollector","ResetArray", 2);
  2655. ASSERT(ArrayBaseType(type).IsPointer());
  2656. END;
  2657. ReleaseIntermediateOperand(size);
  2658. ELSIF type.resolved IS SyntaxTree.ProcedureType THEN
  2659. ASSERT(type.resolved(SyntaxTree.ProcedureType).isDelegate);
  2660. Emit (Push(position, dest));
  2661. CallThis(position,"GarbageCollector","ResetDelegate", 1);
  2662. ELSE HALT(100); (* missing ? *)
  2663. END;
  2664. END CallResetProcedure;
  2665. PROCEDURE ResetVariables (scope: SyntaxTree.ProcedureScope);
  2666. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT;
  2667. PROCEDURE Reset (symbol: SyntaxTree.Symbol);
  2668. VAR operand: Operand;
  2669. BEGIN
  2670. Symbol (symbol, operand);
  2671. CallResetProcedure(operand.op, operand.tag, symbol.type.resolved);
  2672. ReleaseOperand(operand);
  2673. END Reset;
  2674. BEGIN
  2675. previousScope := currentScope;
  2676. currentScope := scope;
  2677. pc := section.pc;
  2678. variable := scope.firstVariable;
  2679. WHILE variable # NIL DO
  2680. IF variable.NeedsTrace() THEN
  2681. Reset (variable);
  2682. END;
  2683. variable := variable.nextVariable;
  2684. END;
  2685. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2686. WHILE parameter # NIL DO
  2687. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  2688. Reset (parameter);
  2689. END;
  2690. parameter := parameter.nextParameter;
  2691. END;
  2692. INC(statCoopResetVariables, section.pc - pc);
  2693. currentScope := previousScope;
  2694. END ResetVariables;
  2695. PROCEDURE Reset (symbol: SyntaxTree.Symbol; refer: BOOLEAN);
  2696. VAR operand: Operand; type: SyntaxTree.Type; saved: RegisterEntry; size: SIZE; base: SyntaxTree.Type; arg: IntermediateCode.Operand;
  2697. BEGIN
  2698. type := symbol.type.resolved;
  2699. SaveRegisters();ReleaseUsedRegisters(saved);
  2700. IF SemanticChecker.IsPointerType(type) OR (type IS SyntaxTree.PortType) THEN
  2701. Symbol(symbol, operand);
  2702. ToMemory(operand.op,addressType,0);
  2703. Emit(Push(position,operand.op));
  2704. IF refer THEN
  2705. CallThis(position,"Heaps","Refer",1);
  2706. ELSE
  2707. CallThis(position,"Heaps","Reset",1);
  2708. END;
  2709. ELSIF type.IsRecordType() THEN
  2710. Symbol(symbol, operand);
  2711. Emit(Push(position,operand.op));
  2712. Emit(Push(position,operand.tag)); (* type desc *)
  2713. IF refer THEN
  2714. CallThis(position,"Heaps","ReferRecord",2);
  2715. ELSE
  2716. CallThis(position,"Heaps","ResetRecord",2);
  2717. END;
  2718. ELSIF IsStaticArray(type) THEN
  2719. size := StaticArrayNumElements(type);
  2720. base := StaticArrayBaseType(type);
  2721. Symbol(symbol, operand);
  2722. arg := TypeDescriptorAdr(base);
  2723. Emit(Push(position,operand.op));
  2724. Emit(Push(position,arg));
  2725. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2726. ReleaseIntermediateOperand(arg);
  2727. IF refer THEN
  2728. CallThis(position,"Heaps","ReferArray",3);
  2729. ELSE
  2730. CallThis(position,"Heaps","ResetArray",3);
  2731. END;
  2732. ELSIF IsStaticMathArray(type) THEN (* the representation of a static math array coincides with static array *)
  2733. size := StaticMathArrayNumElements(type);
  2734. base := StaticMathArrayBaseType(type);
  2735. Symbol(symbol, operand);
  2736. arg := TypeDescriptorAdr(base);
  2737. Emit(Push(position,operand.op));
  2738. Emit(Push(position,arg));
  2739. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  2740. ReleaseIntermediateOperand(arg);
  2741. IF refer THEN
  2742. CallThis(position,"Heaps","ReferArray",3);
  2743. ELSE
  2744. CallThis(position,"Heaps","ResetArray",3);
  2745. END;
  2746. ELSIF type IS SyntaxTree.MathArrayType THEN
  2747. Symbol(symbol, operand);
  2748. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  2749. Emit (Push(position, operand.op));
  2750. ELSE
  2751. Emit (Push(position, operand.tag));
  2752. END;
  2753. IF refer THEN
  2754. CallThis(position,"Heaps","ReferMathArray", 1);
  2755. ELSE
  2756. CallThis(position,"Heaps","ResetMathArray", 1);
  2757. END;
  2758. ELSIF type IS SyntaxTree.ProcedureType THEN
  2759. ASSERT(type(SyntaxTree.ProcedureType).isDelegate);
  2760. Symbol(symbol, operand);
  2761. Emit (Push(position, operand.tag));
  2762. IF refer THEN
  2763. CallThis(position,"Heaps","Refer", 1);
  2764. ELSE
  2765. CallThis(position,"Heaps","Reset", 1);
  2766. END;
  2767. ELSE HALT(100); (* missing ? *)
  2768. END;
  2769. ReleaseOperand(operand);
  2770. RestoreRegisters(saved);
  2771. END Reset;
  2772. PROCEDURE ResetVariables2 (scope: SyntaxTree.ProcedureScope; refer: BOOLEAN);
  2773. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter; previousScope: SyntaxTree.Scope; pc: LONGINT; prevOffset: SIZE;
  2774. BEGIN
  2775. previousScope := currentScope;
  2776. currentScope := scope;
  2777. pc := section.pc;
  2778. IF ~ refer THEN
  2779. variable := scope.firstVariable;
  2780. prevOffset := MAX(SIZE);
  2781. WHILE variable # NIL DO
  2782. IF variable.NeedsTrace() & (variable.offsetInBits # prevOffset) (* multiple temporaries *) THEN
  2783. Reset (variable,refer);
  2784. prevOffset := variable.offsetInBits;
  2785. END;
  2786. variable := variable.nextVariable;
  2787. END;
  2788. END;
  2789. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  2790. WHILE parameter # NIL DO
  2791. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) & ~IsOpenArray(parameter.type) THEN
  2792. Reset (parameter,refer);
  2793. END;
  2794. parameter := parameter.nextParameter;
  2795. END;
  2796. INC(statCoopResetVariables, section.pc - pc);
  2797. currentScope := previousScope;
  2798. END ResetVariables2;
  2799. PROCEDURE CreateProcedureDescriptor (procedure: SyntaxTree.Procedure);
  2800. VAR previousSection: IntermediateCode.Section; name: Basic.SegmentedName;
  2801. VAR op: IntermediateCode.Operand; context: Context;
  2802. BEGIN
  2803. previousSection := section;
  2804. GetCodeSectionNameForSymbol(procedure, name);
  2805. Basic.SuffixSegmentedName (name, Basic.MakeString ("@StackDescriptor"));
  2806. context := SwitchContext(NewSection(module.allSections, Sections.ConstSection, name,NIL,dump # NIL));
  2807. IF dump # NIL THEN dump := section.comments END;
  2808. Basic.ToSegmentedName ("BaseTypes.StackFrame",name);
  2809. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2810. Emit(Data(position,op));
  2811. Emit(Data(position,nil));
  2812. IF HasPointers (procedure.procedureScope) THEN
  2813. GetCodeSectionNameForSymbol(procedure, name);
  2814. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Reset"));
  2815. ELSE
  2816. Basic.ToSegmentedName ("BaseTypes.StackFrame.Reset",name);
  2817. END;
  2818. IntermediateCode.InitAddress(op, addressType, name , 0, 0);
  2819. Emit(Data(position,op));
  2820. ReturnToContext(context);
  2821. IF dump # NIL THEN dump := section.comments END;
  2822. END CreateProcedureDescriptor;
  2823. PROCEDURE AddImport(CONST moduleName: ARRAY OF CHAR; VAR module: SyntaxTree.Module; force: BOOLEAN): BOOLEAN;
  2824. VAR import: SyntaxTree.Import;
  2825. s: Basic.MessageString;
  2826. selfName: SyntaxTree.IdentifierString;
  2827. BEGIN
  2828. moduleScope.ownerModule.GetName(selfName);
  2829. IF (moduleName = selfName) & (moduleScope.ownerModule.context = Global.A2Name) THEN
  2830. module := moduleScope.ownerModule
  2831. ELSE
  2832. import := moduleScope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  2833. IF import = NIL THEN
  2834. import := SyntaxTree.NewImport(Basic.invalidPosition,SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier(moduleName),FALSE);
  2835. import.SetContext(SyntaxTree.NewIdentifier("A2"));
  2836. IF ~checker.AddImport(moduleScope.ownerModule,import) THEN
  2837. s := "Module ";
  2838. Strings.Append(s,moduleName);
  2839. Strings.Append(s," cannot be imported.");
  2840. IF force THEN
  2841. Error(position,s);
  2842. ELSIF canBeLoaded THEN
  2843. IF WarningDynamicLoading THEN
  2844. Strings.Append(s, "=> no dynamic linking.");
  2845. Warning(position, s);
  2846. END;
  2847. canBeLoaded := FALSE;
  2848. END;
  2849. RETURN FALSE
  2850. ELSE
  2851. SELF.module.imports.AddName(moduleName)
  2852. END;
  2853. ELSIF import.module = NIL THEN (* already tried *)
  2854. RETURN FALSE
  2855. END;
  2856. module := import.module;
  2857. END;
  2858. RETURN TRUE
  2859. END AddImport;
  2860. (* needed for old binary object file format*)
  2861. PROCEDURE EnsureSymbol(CONST moduleName,procedureName: SyntaxTree.IdentifierString);
  2862. VAR r: Operand; procedure: SyntaxTree.Procedure; module: SyntaxTree.Module; s: ARRAY 128 OF CHAR; fp: LONGINT;
  2863. BEGIN
  2864. IF AddImport(moduleName,module,TRUE) THEN
  2865. procedure := module.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  2866. IF procedure = NIL THEN
  2867. s := "Instruction not supported on target, emulation procedure ";
  2868. Strings.Append(s,moduleName);
  2869. Strings.Append(s,".");
  2870. Strings.Append(s,procedureName);
  2871. Strings.Append(s," not present");
  2872. Error(position,s);
  2873. ELSE
  2874. StaticCallOperand(r,procedure);
  2875. ReleaseOperand(r);
  2876. fp := GetFingerprint(procedure);
  2877. END;
  2878. END;
  2879. END EnsureSymbol;
  2880. PROCEDURE ConditionToValue(x: SyntaxTree.Expression);
  2881. VAR exit: Label; trueL,falseL: Label;
  2882. BEGIN
  2883. trueL := NewLabel();
  2884. falseL := NewLabel();
  2885. exit := NewLabel();
  2886. Condition(x,trueL,falseL);
  2887. InitOperand(result,ModeValue);
  2888. SetLabel(trueL);
  2889. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister,AcquireRegister(IntermediateCode.GetType(system,x.type),IntermediateCode.GeneralPurposeRegister));
  2890. Emit(Mov(position,result.op,true));
  2891. BrL(exit);
  2892. SetLabel(falseL);
  2893. Emit(MovReplace(position,result.op,false));
  2894. SetLabel(exit);
  2895. END ConditionToValue;
  2896. PROCEDURE ValueToCondition(VAR op: Operand);
  2897. BEGIN
  2898. LoadValue(op,system.booleanType);
  2899. BrneL(trueLabel,op.op, false);
  2900. ReleaseOperand(op);
  2901. BrL(falseLabel);
  2902. END ValueToCondition;
  2903. PROCEDURE GetDynamicSize(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2904. VAR size: LONGINT;
  2905. PROCEDURE GetArraySize(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2906. VAR baseType: SyntaxTree.Type; size: LONGINT; sizeOperand,len,res: IntermediateCode.Operand;
  2907. BEGIN
  2908. ASSERT(type.form = SyntaxTree.Open);
  2909. baseType := type.arrayBase.resolved;
  2910. IF IsOpenArray(baseType) THEN
  2911. sizeOperand := GetArraySize(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2912. ELSE
  2913. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  2914. sizeOperand := IntermediateCode.Immediate(addressType,size);
  2915. END;
  2916. len := tag;
  2917. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2918. IntermediateCode.MakeMemory(len,addressType);
  2919. UseIntermediateOperand(len);
  2920. Reuse2(res,sizeOperand,len);
  2921. Emit(Mul(position,res,sizeOperand,len));
  2922. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2923. RETURN res
  2924. END GetArraySize;
  2925. BEGIN
  2926. type := type.resolved;
  2927. IF IsOpenArray(type) THEN
  2928. IF tag.mode = IntermediateCode.ModeImmediate THEN (* special rule for winapi/c arrays *)
  2929. RETURN tag
  2930. ELSE
  2931. RETURN GetArraySize(type.resolved(SyntaxTree.ArrayType),0)
  2932. END;
  2933. ELSE
  2934. size := ToMemoryUnits(system,system.SizeOf(type));
  2935. RETURN IntermediateCode.Immediate(addressType,size)
  2936. END;
  2937. END GetDynamicSize;
  2938. PROCEDURE GetArrayLength(type: SyntaxTree.Type; tag: IntermediateCode.Operand):IntermediateCode.Operand;
  2939. PROCEDURE GetLength(type: SyntaxTree.ArrayType; offset: LONGINT):IntermediateCode.Operand;
  2940. VAR baseType: SyntaxTree.Type; sizeOperand,len,res: IntermediateCode.Operand;
  2941. BEGIN
  2942. ASSERT(type.form = SyntaxTree.Open);
  2943. baseType := type.arrayBase.resolved;
  2944. IF IsOpenArray(baseType) THEN
  2945. sizeOperand := GetLength(baseType(SyntaxTree.ArrayType),offset+system.addressSize);
  2946. ELSE
  2947. sizeOperand := IntermediateCode.Immediate(addressType,StaticArrayNumElements(baseType));
  2948. END;
  2949. len := tag;
  2950. IntermediateCode.AddOffset(len,ToMemoryUnits(system,offset));
  2951. IntermediateCode.MakeMemory(len,addressType);
  2952. UseIntermediateOperand(len);
  2953. Reuse2(res,sizeOperand,len);
  2954. Emit(Mul(position,res,sizeOperand,len));
  2955. ReleaseIntermediateOperand(sizeOperand); ReleaseIntermediateOperand(len);
  2956. RETURN res
  2957. END GetLength;
  2958. BEGIN
  2959. type := type.resolved;
  2960. IF IsOpenArray(type) THEN
  2961. ASSERT(tag.mode # IntermediateCode.ModeImmediate);
  2962. RETURN GetLength(type.resolved(SyntaxTree.ArrayType),0)
  2963. ELSIF type IS SyntaxTree.StringType THEN
  2964. RETURN tag;
  2965. ELSE
  2966. RETURN IntermediateCode.Immediate(addressType,StaticArrayNumElements(type))
  2967. END;
  2968. END GetArrayLength;
  2969. PROCEDURE GetSizeFromTag(tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2970. VAR result: IntermediateCode.Operand;
  2971. BEGIN
  2972. IF backend.cooperative THEN
  2973. MakeMemory(result, tag, addressType, ToMemoryUnits(system,system.addressSize));
  2974. ELSE
  2975. MakeMemory(result, tag, addressType, 0);
  2976. END;
  2977. RETURN result
  2978. END GetSizeFromTag;
  2979. PROCEDURE GetArrayOfBytesSize(e: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  2980. VAR parameter: SyntaxTree.Parameter;
  2981. BEGIN
  2982. IF (e IS SyntaxTree.SymbolDesignator) & (e(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  2983. parameter := e(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  2984. IF (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) & (parameter.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2985. ELSIF e IS SyntaxTree.DereferenceDesignator THEN
  2986. IF (e.type.resolved IS SyntaxTree.RecordType) THEN RETURN GetSizeFromTag(tag) END;
  2987. END;
  2988. RETURN GetDynamicSize(e.type, tag);
  2989. END GetArrayOfBytesSize;
  2990. (*
  2991. to find imported symbol. not needed ?
  2992. PROCEDURE SymbolByName(CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  2993. VAR importedModule: SyntaxTree.Module; symbol: SyntaxTree.Symbol;
  2994. BEGIN
  2995. IF AddImport(moduleName,importedModule,FALSE) THEN
  2996. symbol := importedModule.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  2997. RETURN symbol
  2998. ELSE
  2999. RETURN NIL
  3000. END
  3001. END SymbolByName;
  3002. *)
  3003. PROCEDURE GetRuntimeProcedure(CONST moduleName, procedureName: ARRAY OF CHAR; VAR procedure: SyntaxTree.Procedure; force: BOOLEAN): BOOLEAN;
  3004. VAR runtimeModule: SyntaxTree.Module; s: Basic.MessageString;
  3005. BEGIN
  3006. IF AddImport(moduleName,runtimeModule,force) THEN
  3007. procedure := runtimeModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  3008. IF procedure = NIL THEN
  3009. s := "Procedure ";
  3010. Strings.Append(s,moduleName);
  3011. Strings.Append(s,".");
  3012. Strings.Append(s,procedureName);
  3013. Strings.Append(s," not present");
  3014. Error(position,s);
  3015. RETURN FALSE
  3016. ELSE
  3017. RETURN TRUE
  3018. END;
  3019. ELSE RETURN FALSE
  3020. END;
  3021. END GetRuntimeProcedure;
  3022. PROCEDURE GetTypeDescriptor(CONST moduleName, typeName: ARRAY OF CHAR; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  3023. VAR importedModule: SyntaxTree.Module; source: IntermediateCode.Section; symbol: SyntaxTree.Symbol;
  3024. s: Basic.MessageString;
  3025. BEGIN
  3026. Basic.InitSegmentedName(name);
  3027. name[0] := Basic.MakeString(moduleName);
  3028. name[1] := Basic.MakeString(typeName);
  3029. name[2] := -1;
  3030. IF AddImport(moduleName,importedModule, FALSE) THEN
  3031. symbol := importedModule.moduleScope.FindTypeDeclaration(SyntaxTree.NewIdentifier(typeName));
  3032. IF symbol = NIL THEN
  3033. s := "type ";
  3034. Strings.Append(s,moduleName);
  3035. Strings.Append(s,".");
  3036. Strings.Append(s,typeName);
  3037. Strings.Append(s," not present");
  3038. Error(position,s);
  3039. END;
  3040. ELSE symbol := NIL;
  3041. END;
  3042. IF importedModule = moduleScope.ownerModule THEN
  3043. source := NewSection(module.allSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3044. ELSE
  3045. source := NewSection(module.importedSections, Sections.ConstSection, name, symbol, commentPrintout # NIL);
  3046. END;
  3047. RETURN symbol
  3048. END GetTypeDescriptor;
  3049. (* 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. *)
  3050. PROCEDURE CallThisChecked(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT; checkNumParameters: BOOLEAN);
  3051. VAR procedure: SyntaxTree.Procedure; result: Operand; reg: IntermediateCode.Operand; source: IntermediateCode.Section;
  3052. pooledName: Basic.SegmentedName; size: LONGINT;
  3053. BEGIN
  3054. IF GetRuntimeProcedure(moduleName,procedureName,procedure,numberParameters < 0) THEN (* ready for dynamic linking *)
  3055. StaticCallOperand(result,procedure);
  3056. IF numberParameters < 0 THEN
  3057. size := ProcParametersSize(procedure);
  3058. ELSE
  3059. size := ToMemoryUnits(system,numberParameters * system.addressSize);
  3060. IF checkNumParameters & (size # ProcParametersSize(procedure)) THEN
  3061. Error(position,"runtime call parameter count mismatch");
  3062. END;
  3063. END;
  3064. Emit(Call(position, result.op, size));
  3065. ReleaseOperand(result);
  3066. ELSE (* only static linking possible *)
  3067. ASSERT(numberParameters >= 0);
  3068. Basic.InitSegmentedName(pooledName);
  3069. pooledName[0] := Basic.MakeString(moduleName);
  3070. pooledName[1] := Basic.MakeString(procedureName);
  3071. pooledName[2] := -1;
  3072. source := NewSection(module.importedSections, Sections.CodeSection, pooledName, NIL,commentPrintout # NIL);
  3073. IntermediateCode.InitAddress(reg, addressType, pooledName , 0, 0);
  3074. Emit(Call(position,reg, ToMemoryUnits(system,numberParameters * system.addressSize)));
  3075. END;
  3076. END CallThisChecked;
  3077. (* 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. *)
  3078. PROCEDURE CallThis(position: Position; CONST moduleName, procedureName: ARRAY OF CHAR; numberParameters: LONGINT);
  3079. BEGIN
  3080. CallThisChecked(position, moduleName, procedureName, numberParameters,TRUE);
  3081. END CallThis;
  3082. PROCEDURE CompareString(br: ConditionalBranch; leftExpression,rightExpression: SyntaxTree.Expression);
  3083. VAR
  3084. left,right: Operand;
  3085. leftSize, rightSize: IntermediateCode.Operand;
  3086. saved: RegisterEntry;
  3087. reg: IntermediateCode.Operand;
  3088. procedureName: SyntaxTree.IdentifierString;
  3089. BEGIN
  3090. procedureName := "CompareString";
  3091. SaveRegisters();ReleaseUsedRegisters(saved);
  3092. Designate(leftExpression,left);
  3093. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3094. Emit(Push(position,leftSize));
  3095. ReleaseIntermediateOperand(leftSize);
  3096. Emit(Push(position,left.op));
  3097. ReleaseOperand(left);
  3098. Designate(rightExpression,right);
  3099. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3100. Emit(Push(position,rightSize));
  3101. ReleaseIntermediateOperand(rightSize);
  3102. Emit(Push(position,right.op));
  3103. ReleaseOperand(right);
  3104. CallThis(position,builtinsModuleName,procedureName, 4);
  3105. IntermediateCode.InitRegister(reg,int8,IntermediateCode.GeneralPurposeRegister,AcquireRegister(int8,IntermediateCode.GeneralPurposeRegister));
  3106. Emit(Result(position,reg));
  3107. (*
  3108. AcquireThisRegister(int8,IntermediateCode.Result);
  3109. *)
  3110. RestoreRegisters(saved); (* must be done before use of result, might be jumped over otherwise *)
  3111. (*
  3112. IntermediateCode.InitRegister(reg,int8,IntermediateCode.Result);
  3113. *)
  3114. br(trueLabel,reg,IntermediateCode.Immediate(int8,0));
  3115. ReleaseIntermediateOperand(reg);
  3116. BrL(falseLabel);
  3117. END CompareString;
  3118. PROCEDURE CopyString(leftExpression,rightExpression: SyntaxTree.Expression);
  3119. VAR
  3120. left,right: Operand;
  3121. leftSize, rightSize: IntermediateCode.Operand;
  3122. saved: RegisterEntry;
  3123. procedureName: SyntaxTree.IdentifierString;
  3124. BEGIN
  3125. procedureName := "CopyString";
  3126. SaveRegisters();ReleaseUsedRegisters(saved);
  3127. Designate(leftExpression,left);
  3128. leftSize := GetDynamicSize(leftExpression.type,left.tag);
  3129. Emit(Push(position,leftSize));
  3130. ReleaseIntermediateOperand(leftSize);
  3131. Emit(Push(position,left.op));
  3132. ReleaseOperand(left);
  3133. Designate(rightExpression,right);
  3134. rightSize := GetDynamicSize(rightExpression.type,right.tag);
  3135. Emit(Push(position,rightSize));
  3136. ReleaseIntermediateOperand(rightSize);
  3137. Emit(Push(position,right.op));
  3138. ReleaseOperand(right);
  3139. CallThis(position,builtinsModuleName,procedureName,4);
  3140. RestoreRegisters(saved);
  3141. END CopyString;
  3142. PROCEDURE VisitBinaryExpression*(x: SyntaxTree.BinaryExpression);
  3143. VAR left,right: Operand; temp: Operand; zero, one, tempReg, tempReg2: IntermediateCode.Operand;
  3144. leftType,rightType: SyntaxTree.Type;
  3145. leftExpression,rightExpression : SyntaxTree.Expression;
  3146. componentType: IntermediateCode.Type;
  3147. value: HUGEINT; exp: LONGINT;next,exit: Label; recordType: SyntaxTree.RecordType; dest: IntermediateCode.Operand;
  3148. size: LONGINT;
  3149. BEGIN
  3150. IF Trace THEN TraceEnter("VisitBinaryExpression") END;
  3151. dest := destination; destination := emptyOperand;
  3152. leftType := x.left.type.resolved;
  3153. rightType := x.right.type.resolved;
  3154. (* for "OR" and "&" the left and right expressions may not be emitted first <= shortcut evaluation *)
  3155. CASE x.operator OF
  3156. Scanner.Or:
  3157. (* shortcut evaluation of left OR right *)
  3158. IF ~conditional THEN ConditionToValue(x);
  3159. ELSE
  3160. next := NewLabel();
  3161. Condition(x.left,trueLabel,next);
  3162. SetLabel(next);
  3163. Condition(x.right,trueLabel,falseLabel);
  3164. END;
  3165. |Scanner.And:
  3166. (* shortcut evaluation of left & right *)
  3167. IF ~conditional THEN ConditionToValue(x);
  3168. ELSE
  3169. next := NewLabel();
  3170. Condition(x.left,next,falseLabel);
  3171. SetLabel(next);
  3172. Condition(x.right,trueLabel,falseLabel);
  3173. END;
  3174. |Scanner.Is:
  3175. IF ~conditional THEN ConditionToValue(x);
  3176. ELSE
  3177. (* get type desc tag *)
  3178. IF IsPointerToRecord(leftType,recordType) THEN
  3179. Evaluate(x.left,left);
  3180. Dereference(left,recordType,IsUnsafePointer(leftType))
  3181. ELSE
  3182. Designate(x.left,left);
  3183. END;
  3184. TypeTest(left.tag,x.right(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType.resolved,trueLabel,falseLabel);
  3185. ReleaseOperand(left);
  3186. END;
  3187. |Scanner.Plus:
  3188. Evaluate(x.left,left);
  3189. Evaluate(x.right,right);
  3190. IF leftType IS SyntaxTree.SetType THEN
  3191. InitOperand(result,ModeValue);
  3192. Reuse2a(result.op,left.op,right.op,dest);
  3193. Emit(Or(position,result.op,left.op,right.op));
  3194. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3195. InitOperand(result,ModeValue);
  3196. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3197. Reuse2(result.tag,left.tag,right.tag);
  3198. Emit(Add(position,result.op,left.op,right.op));
  3199. Emit(Add(position,result.tag,left.tag,right.tag))
  3200. ELSE
  3201. InitOperand(result,ModeValue);
  3202. (*! IF SemanticChecker.IsIntegerType(leftType) THEN
  3203. AddInt(result.op, left.op, right.op) ;
  3204. ELSE
  3205. *)
  3206. Reuse2a(result.op,left.op,right.op,dest);
  3207. Emit(Add(position,result.op,left.op,right.op));
  3208. (*
  3209. END;
  3210. *)
  3211. END;
  3212. ReleaseOperand(left); ReleaseOperand(right);
  3213. |Scanner.Minus:
  3214. Evaluate(x.left,left);
  3215. Evaluate(x.right,right);
  3216. IF leftType IS SyntaxTree.SetType THEN
  3217. InitOperand(result,ModeValue);
  3218. Reuse1(result.op,right.op);
  3219. Emit(Not(position,result.op,right.op));
  3220. ReleaseOperand(right);
  3221. Emit(And(position,result.op,result.op,left.op));
  3222. ReleaseOperand(left);
  3223. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3224. InitOperand(result,ModeValue);
  3225. Reuse2a(result.op,left.op,right.op,dest); (* TODO: review this *)
  3226. Reuse2(result.tag,left.tag,right.tag);
  3227. Emit(Sub(position,result.op,left.op,right.op));
  3228. Emit(Sub(position,result.tag,left.tag,right.tag));
  3229. ReleaseOperand(left); ReleaseOperand(right)
  3230. ELSE
  3231. InitOperand(result,ModeValue);
  3232. Reuse2a(result.op,left.op,right.op,dest);
  3233. Emit(Sub(position,result.op,left.op,right.op));
  3234. ReleaseOperand(left); ReleaseOperand(right);
  3235. END;
  3236. |Scanner.Times:
  3237. Evaluate(x.left,left);
  3238. Evaluate(x.right,right);
  3239. IF leftType IS SyntaxTree.SetType THEN
  3240. InitOperand(result,ModeValue);
  3241. Reuse2a(result.op,left.op,right.op,dest);
  3242. Emit(And(position,result.op,left.op,right.op));
  3243. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3244. InitOperand(result, ModeValue);
  3245. componentType := left.op.type;
  3246. (* TODO: review this *)
  3247. (*
  3248. result.op = left.op * right.op - left.tag * right.tag
  3249. result.tag = left.tag * right.op + left.op * right.tag
  3250. *)
  3251. result.op := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3252. Emit(Mul(position,result.op, left.op, right.op));
  3253. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3254. Emit(Mul(position,tempReg, left.tag, right.tag));
  3255. Emit(Sub(position,result.op, result.op, tempReg));
  3256. Reuse2(result.tag, left.tag, right.op);
  3257. Emit(Mul(position,result.tag, left.tag, right.op));
  3258. Emit(Mul(position,tempReg, left.op, right.tag));
  3259. Emit(Add(position,result.tag, result.tag, tempReg));
  3260. ReleaseIntermediateOperand(tempReg)
  3261. ELSE
  3262. InitOperand(result,ModeValue);
  3263. Reuse2a(result.op,left.op,right.op,dest);
  3264. Emit(Mul(position,result.op,left.op,right.op));
  3265. END;
  3266. ReleaseOperand(left); ReleaseOperand(right);
  3267. |Scanner.Div:
  3268. Evaluate(x.left,left);
  3269. Evaluate(x.right,right);
  3270. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3271. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3272. IF ~isUnchecked THEN
  3273. exit := NewLabel();
  3274. BrltL(exit,zero,right.op);
  3275. EmitTrap(position,NegativeDivisorTrap);
  3276. SetLabel(exit);
  3277. END;
  3278. END;
  3279. InitOperand(result,ModeValue);
  3280. Reuse2a(result.op,left.op,right.op,dest);
  3281. Emit(Div(position,result.op,left.op,right.op));
  3282. ReleaseOperand(left); ReleaseOperand(right);
  3283. |Scanner.Mod:
  3284. Evaluate(x.left,left);
  3285. Evaluate(x.right,right);
  3286. IF (x.type.resolved IS SyntaxTree.IntegerType) & (x.right.resolved = NIL) THEN (* divisor negative check *)
  3287. IntermediateCode.InitImmediate(zero,IntermediateCode.GetType(system,rightType),0);
  3288. IF ~isUnchecked THEN
  3289. exit := NewLabel();
  3290. BrltL(exit,zero,right.op);
  3291. EmitTrap(position,NegativeDivisorTrap);
  3292. SetLabel(exit);
  3293. END;
  3294. END;
  3295. InitOperand(result,ModeValue);
  3296. Reuse2a(result.op,left.op,right.op,dest);
  3297. Emit(Mod(position,result.op,left.op,right.op));
  3298. ReleaseOperand(left); ReleaseOperand(right);
  3299. |Scanner.Slash:
  3300. Evaluate(x.left,left);
  3301. Evaluate(x.right,right);
  3302. IF leftType IS SyntaxTree.SetType THEN
  3303. InitOperand(result,ModeValue);
  3304. Reuse2a(result.op,left.op,right.op,dest);
  3305. Emit(Xor(position,result.op,left.op,right.op));
  3306. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3307. InitOperand(result,ModeValue);
  3308. componentType := left.op.type;
  3309. (* review this *)
  3310. (*
  3311. divisor = right.op * right.op + right.tag * right.tag
  3312. result.op = (left.op * right.op + left.tag * right.tag) / divisor
  3313. result.tag = (left.tag * right.op - left.op * right.tag) / divisor
  3314. *)
  3315. tempReg := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3316. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister,AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3317. Emit(Mul(position,tempReg, right.op, right.op));
  3318. Emit(Mul(position,tempReg2, right.tag, right.tag));
  3319. Emit(Add(position,tempReg, tempReg, tempReg2));
  3320. result.op := tempReg2;
  3321. Emit(Mul(position,result.op, left.op, right.op));
  3322. tempReg2 := IntermediateCode.Register(componentType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(componentType,IntermediateCode.GeneralPurposeRegister));
  3323. Emit(Mul(position,tempReg2, left.tag, right.tag));
  3324. Emit(Add(position,result.op, result.op, tempReg2));
  3325. Emit(Div(position,result.op, result.op, tempReg));
  3326. Reuse2(result.tag, left.tag, right.op);
  3327. Emit(Mul(position,result.tag, left.tag, right.op));
  3328. Emit(Mul(position,tempReg2, left.op, right.tag));
  3329. Emit(Sub(position,result.tag, result.tag, tempReg2));
  3330. Emit(Div(position,result.tag, result.tag, tempReg));
  3331. ReleaseIntermediateOperand(tempReg);
  3332. ReleaseIntermediateOperand(tempReg2)
  3333. ELSE
  3334. InitOperand(result,ModeValue);
  3335. Reuse2a(result.op,left.op,right.op,dest);
  3336. Emit(Div(position,result.op,left.op,right.op));
  3337. END;
  3338. ReleaseOperand(left); ReleaseOperand(right);
  3339. |Scanner.Equal:
  3340. IF ~conditional THEN ConditionToValue(x);
  3341. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3342. CompareString(BreqL,x.left,x.right);
  3343. ELSE
  3344. Evaluate(x.left,left);
  3345. Evaluate(x.right,right);
  3346. IF leftType IS SyntaxTree.RangeType THEN
  3347. ASSERT(rightType IS SyntaxTree.RangeType);
  3348. BrneL(falseLabel, left.op, right.op); (* first *)
  3349. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3350. BrneL(falseLabel, left.extra, right.extra); (* step *)
  3351. ReleaseOperand(left); ReleaseOperand(right);
  3352. BrL(trueLabel)
  3353. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3354. BrneL(falseLabel, left.op, right.op); (* first *)
  3355. BrneL(falseLabel, left.tag, right.tag); (* last *)
  3356. ReleaseOperand(left); ReleaseOperand(right);
  3357. BrL(trueLabel)
  3358. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3359. (* TODO: review this *)
  3360. BrneL(falseLabel, left.op, right.op); (* real part *)
  3361. BrneL(falseLabel, left.tag, right.tag); (* imaginary part *)
  3362. ReleaseOperand(left); ReleaseOperand(right);
  3363. BrL(trueLabel)
  3364. ELSE
  3365. BrneL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3366. ReleaseOperand(left); ReleaseOperand(right);
  3367. BrL(trueLabel);
  3368. END;
  3369. END;
  3370. |Scanner.LessEqual:
  3371. IF ~conditional THEN ConditionToValue(x);
  3372. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3373. CompareString(BrgeL,x.right,x.left);
  3374. ELSE
  3375. Evaluate(x.left,left);
  3376. Evaluate(x.right,right);
  3377. IF leftType IS SyntaxTree.SetType THEN (* left subsetequal right: left \cap right = left *)
  3378. Reuse1(temp.op,right.op);
  3379. Emit(And(position,temp.op,left.op,right.op));
  3380. ReleaseOperand(right);
  3381. BreqL(trueLabel,temp.op,left.op);
  3382. BrL(falseLabel);
  3383. ReleaseOperand(temp);ReleaseOperand(left);
  3384. ELSE
  3385. BrltL(falseLabel,right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3386. ReleaseOperand(left); ReleaseOperand(right);
  3387. BrL(trueLabel);
  3388. END;
  3389. END;
  3390. |Scanner.Less:
  3391. IF leftType IS SyntaxTree.SetType THEN (* left < right <=> left <= right & left # right *)
  3392. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.LessEqual);
  3393. leftExpression.SetType(system.booleanType);
  3394. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3395. rightExpression.SetType(system.booleanType);
  3396. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3397. leftExpression.SetType(system.booleanType);
  3398. Expression(leftExpression);
  3399. ELSIF ~conditional THEN ConditionToValue(x);
  3400. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3401. CompareString(BrltL,x.left,x.right);
  3402. ELSE
  3403. Evaluate(x.left,left);
  3404. Evaluate(x.right,right);
  3405. BrgeL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3406. ReleaseOperand(left); ReleaseOperand(right);
  3407. BrL(trueLabel);
  3408. END;
  3409. |Scanner.Greater:
  3410. IF leftType IS SyntaxTree.SetType THEN (* left > right <=> left >= right & left # right *)
  3411. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.GreaterEqual);
  3412. leftExpression.SetType(system.booleanType);
  3413. rightExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.left,x.right,Scanner.Unequal);
  3414. rightExpression.SetType(system.booleanType);
  3415. leftExpression := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,leftExpression,rightExpression,Scanner.And);
  3416. leftExpression.SetType(system.booleanType);
  3417. Expression(leftExpression);
  3418. ELSIF ~conditional THEN ConditionToValue(x);
  3419. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3420. CompareString(BrltL,x.right,x.left);
  3421. ELSE
  3422. Evaluate(x.left,left);
  3423. Evaluate(x.right,right);
  3424. BrgeL(falseLabel, right.op,left.op); (* inverse evaluation to optimize jumps for true case *)
  3425. ReleaseOperand(left); ReleaseOperand(right);
  3426. BrL(trueLabel);
  3427. END;
  3428. |Scanner.GreaterEqual:
  3429. IF ~conditional THEN ConditionToValue(x);
  3430. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3431. CompareString(BrgeL,x.left,x.right);
  3432. ELSE
  3433. Evaluate(x.left,left);
  3434. Evaluate(x.right,right);
  3435. IF leftType IS SyntaxTree.SetType THEN (* left supsetequal right: left \cap right = right *)
  3436. Reuse1(temp.op,left.op);
  3437. Emit(And(position,temp.op,left.op,right.op));
  3438. ReleaseOperand(left);
  3439. BreqL(trueLabel, temp.op,right.op);
  3440. ReleaseOperand(temp); ReleaseOperand(right);
  3441. BrL(falseLabel);
  3442. ELSE
  3443. BrltL(falseLabel, left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3444. ReleaseOperand(left); ReleaseOperand(right);
  3445. BrL(trueLabel);
  3446. END;
  3447. END;
  3448. |Scanner.Unequal:
  3449. IF ~conditional THEN ConditionToValue(x);
  3450. ELSIF (leftType IS SyntaxTree.ArrayType) OR (leftType IS SyntaxTree.StringType) THEN (* string comparison *)
  3451. CompareString(BrneL,x.left,x.right);
  3452. ELSE
  3453. Evaluate(x.left,left);
  3454. Evaluate(x.right,right);
  3455. IF leftType IS SyntaxTree.RangeType THEN
  3456. ASSERT(rightType IS SyntaxTree.RangeType);
  3457. BrneL(trueLabel, left.op, right.op); (* first *)
  3458. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3459. BrneL(trueLabel, left.extra, right.extra); (* step *)
  3460. ReleaseOperand(left); ReleaseOperand(right);
  3461. BrL(falseLabel)
  3462. ELSIF IsDelegate(leftType) THEN (* delegate comparison *)
  3463. BrneL(trueLabel, left.op, right.op); (* first *)
  3464. BrneL(trueLabel, left.tag, right.tag); (* last *)
  3465. ReleaseOperand(left); ReleaseOperand(right);
  3466. BrL(falseLabel)
  3467. ELSIF leftType IS SyntaxTree.ComplexType THEN
  3468. (* TODO: review this *)
  3469. BrneL(trueLabel, left.op, right.op); (* real part *)
  3470. BrneL(trueLabel, left.tag, right.tag); (* imaginary part *)
  3471. ReleaseOperand(left); ReleaseOperand(right);
  3472. BrL(falseLabel)
  3473. ELSE
  3474. BreqL(falseLabel,left.op,right.op); (* inverse evaluation to optimize jumps for true case *)
  3475. ReleaseOperand(left); ReleaseOperand(right);
  3476. BrL(trueLabel);
  3477. END;
  3478. END;
  3479. |Scanner.In:
  3480. ASSERT(rightType.resolved IS SyntaxTree.SetType);
  3481. Evaluate(x.left,left);
  3482. Evaluate(x.right,right);
  3483. Convert(left.op,setType);
  3484. Convert(right.op,setType);
  3485. ReuseCopy(temp.op,right.op);
  3486. Emit(Shr(position,temp.op,temp.op,left.op));
  3487. ReleaseOperand(right); ReleaseOperand(left);
  3488. IntermediateCode.InitImmediate(one,setType,1);
  3489. Emit(And(position,temp.op,temp.op,one));
  3490. IF conditional THEN
  3491. IntermediateCode.InitImmediate(zero,setType,0);
  3492. BrneL(trueLabel,temp.op,zero);
  3493. ReleaseOperand(temp);
  3494. BrL(falseLabel);
  3495. ELSE
  3496. Convert(temp.op,bool);
  3497. result.mode := ModeValue;
  3498. result.op := temp.op;
  3499. result.tag := nil; (* may be left over from calls to evaluate *)
  3500. END;
  3501. ELSE
  3502. IF (x.operator = Scanner.Questionmarks) OR (x.operator = Scanner.LessLessQ) & (x.right.type.resolved IS SyntaxTree.PortType) THEN
  3503. IF x.operator = Scanner.Questionmarks THEN
  3504. leftExpression := x.left;
  3505. rightExpression := x.right;
  3506. ELSE
  3507. leftExpression := x.right;
  3508. rightExpression := x.left;
  3509. END;
  3510. Evaluate(leftExpression, left);
  3511. Emit(Push(position,left.op));
  3512. ReleaseOperand(left);
  3513. Designate(rightExpression, right);
  3514. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3515. IF ~backend.cellsAreObjects THEN
  3516. IF size # 1 THEN Error(x.right.position,"receive not implemented for complex data types") END;
  3517. END;
  3518. Emit(Push(position,right.op));
  3519. ReleaseOperand(right);
  3520. IF backend.cellsAreObjects THEN
  3521. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlocking",2);
  3522. ELSE
  3523. CallThis(position,ChannelModuleName,"ReceiveNonBlocking",2);
  3524. END;
  3525. InitOperand(result, ModeValue);
  3526. result.op := NewRegisterOperand(bool);
  3527. Emit(Result(position,result.op));
  3528. IF conditional THEN
  3529. IntermediateCode.InitImmediate(zero,setType,0);
  3530. BrneL(trueLabel,result.op,zero);
  3531. ReleaseOperand(result);
  3532. BrL(falseLabel);
  3533. END;
  3534. ELSIF (x.operator = Scanner.ExclamationMarks) OR (x.operator = Scanner.LessLessQ) & (x.left.type.resolved IS SyntaxTree.PortType) THEN
  3535. leftExpression := x.left;
  3536. rightExpression := x.right;
  3537. Evaluate(leftExpression, left);
  3538. Emit(Push(position,left.op));
  3539. ReleaseOperand(left);
  3540. Evaluate(rightExpression, right);
  3541. size := ToMemoryUnits(system,system.SizeOf(x.right.type));
  3542. IF ~backend.cellsAreObjects THEN
  3543. IF size # 1 THEN Error(x.right.position,"send not implemented for complex data types") END;
  3544. END;
  3545. Emit(Push(position,right.op));
  3546. ReleaseOperand(right);
  3547. IF backend.cellsAreObjects THEN
  3548. CallThis(position,"ActiveCellsRuntime","SendNonBlocking",2);
  3549. ELSE
  3550. CallThis(position,ChannelModuleName,"SendNonBlocking",2);
  3551. END;
  3552. InitOperand(result, ModeValue);
  3553. result.op := NewRegisterOperand(bool);
  3554. Emit(Result(position,result.op));
  3555. IF conditional THEN
  3556. IntermediateCode.InitImmediate(zero,setType,0);
  3557. BrneL(trueLabel,result.op,zero);
  3558. ReleaseOperand(result);
  3559. BrL(falseLabel);
  3560. END;
  3561. ELSE
  3562. HALT(100);
  3563. END;
  3564. END;
  3565. destination := dest;
  3566. IF Trace THEN TraceExit("VisitBinaryExpression") END;
  3567. END VisitBinaryExpression;
  3568. PROCEDURE VisitRangeExpression*(x: SyntaxTree.RangeExpression);
  3569. VAR localResult, operand: Operand;
  3570. BEGIN
  3571. IF Trace THEN TraceEnter("VisitRangeExpression") END;
  3572. InitOperand(localResult, ModeValue);
  3573. ASSERT(x.first # NIL);
  3574. Evaluate(x.first, operand);
  3575. localResult.op := operand.op;
  3576. ReleaseOperand(operand);
  3577. UseIntermediateOperand(localResult.op);
  3578. ASSERT(x.last # NIL);
  3579. Evaluate(x.last, operand);
  3580. localResult.tag := operand.op;
  3581. ReleaseOperand(operand);
  3582. UseIntermediateOperand(localResult.tag);
  3583. IF x.step # NIL THEN
  3584. Evaluate(x.step, operand);
  3585. localResult.extra := operand.op;
  3586. ReleaseOperand(operand);
  3587. UseIntermediateOperand(localResult.extra);
  3588. END;
  3589. result := localResult;
  3590. IF Trace THEN TraceExit("VisitRangeExpression") END
  3591. END VisitRangeExpression;
  3592. PROCEDURE VisitTensorRangeExpression*(x: SyntaxTree.TensorRangeExpression);
  3593. BEGIN
  3594. HALT(100); (* should never be evaluated *)
  3595. END VisitTensorRangeExpression;
  3596. PROCEDURE VisitConversion*(x: SyntaxTree.Conversion);
  3597. VAR old: Operand; dest: IntermediateCode.Operand; componentType: SyntaxTree.Type;
  3598. BEGIN
  3599. IF Trace THEN TraceEnter("VisitConversion") END;
  3600. ASSERT(~(x.expression.type.resolved IS SyntaxTree.RangeType));
  3601. dest := destination; destination := emptyOperand;
  3602. Evaluate(x.expression,old);
  3603. InitOperand(result,ModeValue);
  3604. result.op := old.op;
  3605. ASSERT(result.op.mode # 0);
  3606. IF x.type.resolved IS SyntaxTree.ComplexType THEN
  3607. (* convert TO a complex number *)
  3608. componentType := x.type.resolved(SyntaxTree.ComplexType).componentType;
  3609. Convert(result.op,IntermediateCode.GetType(system, componentType));
  3610. ASSERT(result.op.mode # 0);
  3611. IF x.expression.type.resolved IS SyntaxTree.ComplexType THEN
  3612. (* convert FROM a complex number TO a complex number*)
  3613. result.tag := old.tag;
  3614. ASSERT(result.tag.mode # 0);
  3615. Convert(result.tag,IntermediateCode.GetType(system, componentType));
  3616. ASSERT(result.tag.mode # 0)
  3617. ELSE
  3618. ASSERT(componentType IS SyntaxTree.FloatType); (* this excludes complex types based on integer types *)
  3619. result.tag := IntermediateCode.FloatImmediate(IntermediateCode.GetType(system, componentType), 0); (* the imaginary part is set to 0 *)
  3620. END
  3621. ELSE
  3622. Convert(result.op,IntermediateCode.GetType(system,x.type));
  3623. ASSERT(result.op.mode # 0);
  3624. result.tag := old.tag; (*! probably never used *)
  3625. END;
  3626. destination := dest;
  3627. IF Trace THEN TraceExit("VisitConversion") END;
  3628. END VisitConversion;
  3629. PROCEDURE VisitTypeDeclaration*(x: SyntaxTree.TypeDeclaration);
  3630. BEGIN
  3631. IF Trace THEN TraceEnter("VisitTypeDeclaration") END;
  3632. ASSERT((x.declaredType.resolved IS SyntaxTree.EnumerationType) OR (x.declaredType.resolved IS SyntaxTree.RecordType)
  3633. OR (x.declaredType.resolved IS SyntaxTree.PointerType) & (x.declaredType.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType));
  3634. IF Trace THEN TraceExit("VisitTypeDeclaration") END;
  3635. END VisitTypeDeclaration;
  3636. (** designators (expressions) *)
  3637. PROCEDURE VisitSymbolDesignator*(x: SyntaxTree.SymbolDesignator);
  3638. VAR ownerType, designatorType: SyntaxTree.RecordType;
  3639. BEGIN
  3640. IF Trace THEN TraceEnter("VisitSymbolDesignator") END;
  3641. IF x.left # NIL THEN Expression(x.left) END;
  3642. Symbol(x.symbol,result);
  3643. IF backend.cooperative & (x.symbol IS SyntaxTree.Variable) & (x.symbol.scope # NIL) & (x.symbol.scope IS SyntaxTree.RecordScope) THEN
  3644. ASSERT ((x.left # NIL) & (x.left.type.resolved IS SyntaxTree.RecordType));
  3645. ownerType := x.symbol.scope(SyntaxTree.RecordScope).ownerRecord;
  3646. designatorType := x.left.type.resolved(SyntaxTree.RecordType);
  3647. IF ~ownerType.isObject & designatorType.isObject & ~designatorType.pointerType.isPlain THEN
  3648. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  3649. END;
  3650. END;
  3651. IF Trace THEN TraceExit("VisitSymbolDesignator") END;
  3652. END VisitSymbolDesignator;
  3653. PROCEDURE BoundCheck(index,length: IntermediateCode.Operand);
  3654. BEGIN
  3655. IF isUnchecked THEN RETURN END;
  3656. IF tagsAvailable THEN
  3657. TrapC(BrltL,index,length,IndexCheckTrap);
  3658. END;
  3659. END BoundCheck;
  3660. PROCEDURE DimensionCheck(base,dim: IntermediateCode.Operand; op: ConditionalBranch );
  3661. VAR d: IntermediateCode.Operand;
  3662. BEGIN
  3663. IF isUnchecked THEN RETURN END;
  3664. MakeMemory(d,base,dim.type,ToMemoryUnits(system,MathDimOffset * addressType.sizeInBits));
  3665. TrapC(op,dim,d,ArraySizeTrap);
  3666. ReleaseIntermediateOperand(d);
  3667. END DimensionCheck;
  3668. PROCEDURE MathIndexDesignator(x: SyntaxTree.IndexDesignator);
  3669. VAR
  3670. index, range, array, sourceLength, sourceIncrement, localResult: Operand;
  3671. firstIndex, lastIndex, stepSize, summand, targetLength, targetIncrement, tmp, srcDim, destDim: IntermediateCode.Operand;
  3672. expression: SyntaxTree.Expression;
  3673. resultingType, leftType, baseType: SyntaxTree.Type;
  3674. skipLabel1: Label;
  3675. i, indexListSize, indexDim, srcDimOffset, destDimOffset, targetArrayDimensionality: LONGINT;
  3676. staticSourceLength, staticSourceIncrement, staticIndex, staticFirstIndex, staticLastIndex, staticStepSize, staticTargetLength: LONGINT;
  3677. variableOp: Operand;
  3678. variable: SyntaxTree.Variable;
  3679. prefixIndices, prefixRanges, suffixIndices, suffixRanges : LONGINT; tensorFound: BOOLEAN;
  3680. PROCEDURE CountIndices(parameters: SyntaxTree.ExpressionList);
  3681. VAR e: SyntaxTree.Expression; i: LONGINT;
  3682. BEGIN
  3683. tensorFound := FALSE;
  3684. FOR i := 0 TO parameters.Length()-1 DO
  3685. e := parameters.GetExpression(i);
  3686. IF e IS SyntaxTree.TensorRangeExpression THEN
  3687. ASSERT(~tensorFound);
  3688. tensorFound := TRUE;
  3689. ELSIF e IS SyntaxTree.RangeExpression THEN
  3690. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  3691. ELSE
  3692. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  3693. END;
  3694. END;
  3695. END CountIndices;
  3696. BEGIN
  3697. ASSERT(tagsAvailable);
  3698. resultingType := x.type.resolved; (* resulting type *)
  3699. leftType := x.left.type.resolved; (* type of array to be indexed over *)
  3700. InitOperand(localResult, ModeReference);
  3701. IF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3702. targetArrayDimensionality := resultingType(SyntaxTree.MathArrayType).Dimensionality();
  3703. IF arrayDestinationTag.mode # IntermediateCode.Undefined THEN
  3704. (* a globally defined array destination tag is available -> use and invalidate it*)
  3705. localResult.tag := arrayDestinationTag;
  3706. IntermediateCode.InitOperand(arrayDestinationTag)
  3707. ELSE
  3708. (* otherwise, create a temporary variable and use it to store the array destination tag *)
  3709. (* the result is of array range type and thus does not provide any collectable pointers *)
  3710. variable := GetTemporaryVariable(GetMathArrayDescriptorType(targetArrayDimensionality), FALSE, TRUE (* untraced *));
  3711. Symbol(variable, variableOp);
  3712. ReuseCopy(localResult.tag, variableOp.op);
  3713. ReleaseOperand(variableOp);
  3714. END
  3715. END;
  3716. indexListSize := x.parameters.Length();
  3717. CountIndices(x.parameters);
  3718. (*ASSERT(tensorRangeCount <= 1);*)
  3719. (* designate the array to be indexed over, perform tensor range check if known *)
  3720. Designate(x.left, array);
  3721. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  3722. Dereference(array, leftType,FALSE);
  3723. IF ~tensorFound THEN
  3724. DimensionCheck(array.tag, IntermediateCode.Immediate(sizeType, prefixRanges + prefixIndices), BreqL)
  3725. END
  3726. END;
  3727. (* default base offset *)
  3728. srcDimOffset := 0;
  3729. destDimOffset := 0;
  3730. indexDim := 0;
  3731. (* use address of source array as basis *)
  3732. localResult.op := array.op;
  3733. UseIntermediateOperand(localResult.op);
  3734. (* go through the index list *)
  3735. FOR i := 0 TO indexListSize - 1 DO
  3736. expression := x.parameters.GetExpression(i);
  3737. IF expression IS SyntaxTree.TensorRangeExpression THEN
  3738. (* Questionmark in A[x,*,?,x,*] encountered -- now have to count backwards from the end of source and destination *)
  3739. srcDimOffset := -indexListSize;
  3740. destDimOffset := -suffixRanges;
  3741. ELSE
  3742. (* determine which dimension of source array is currently looked at *)
  3743. IF srcDimOffset < 0 THEN (* tensor expression or the form a[?,i,j] *)
  3744. (* get the memory operand pointing to array descriptor dimension *)
  3745. GetMathArrayField(tmp, array.tag, MathDimOffset);
  3746. (* make a reusable register from it *)
  3747. ReuseCopy(srcDim, tmp);
  3748. ReleaseIntermediateOperand(tmp);
  3749. AddInt(srcDim, srcDim, IntermediateCode.Immediate(addressType, i + srcDimOffset));
  3750. ELSE
  3751. srcDim := IntermediateCode.Immediate(sizeType, i);
  3752. END;
  3753. (* get length and increment of source array for current dimension *)
  3754. GetMathArrayLength(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceLength);
  3755. Convert(sourceLength.op, sizeType);
  3756. GetMathArrayIncrement(leftType(SyntaxTree.MathArrayType), array, srcDim, FALSE, sourceIncrement);
  3757. Convert(sourceIncrement.op, sizeType);
  3758. (* release the dim operand, if dynamic. No register reuse to decrease register pressure *)
  3759. ReleaseIntermediateOperand(srcDim);
  3760. IF SemanticChecker.IsIntegerType(expression.type.resolved) THEN
  3761. (* SINGLE INDEX *)
  3762. Evaluate(expression, index);
  3763. ReleaseIntermediateOperand(index.tag);
  3764. index.tag := emptyOperand;
  3765. Convert(index.op, sizeType);
  3766. (* lower bound check *)
  3767. IF IsIntegerImmediate(index.op, staticIndex) THEN
  3768. ASSERT(staticIndex >= 0) (* ensured by the checker *)
  3769. ELSIF isUnchecked THEN (* do nothing *)
  3770. ELSE
  3771. TrapC(BrgeL, index.op, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3772. END;
  3773. (* upper bound check *)
  3774. IF IsIntegerImmediate(index.op, staticIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3775. ASSERT(staticIndex < staticSourceLength) (* ensured by checker *)
  3776. ELSIF isUnchecked THEN (* do nothing *)
  3777. ELSE
  3778. TrapC(BrltL, index.op, sourceLength.op, IndexCheckTrap)
  3779. END;
  3780. ReleaseOperand(sourceLength);
  3781. Convert(index.op, addressType);
  3782. summand := index.op;
  3783. ELSIF expression.type.resolved IS SyntaxTree.RangeType THEN
  3784. (* RANGE OF INDICES *)
  3785. Evaluate(expression, range);
  3786. firstIndex := range.op; UseIntermediateOperand(firstIndex);
  3787. lastIndex := range.tag; UseIntermediateOperand(lastIndex);
  3788. stepSize := range.extra; UseIntermediateOperand(stepSize);
  3789. ReleaseOperand(range);
  3790. Convert(firstIndex, sizeType);
  3791. Convert(lastIndex, sizeType);
  3792. Convert(stepSize, sizeType);
  3793. (* for dynamic upper bounds: add a runtime check, which repaces the upper bound with the largest valid index
  3794. if it is 'MAX(LONGINT)' *)
  3795. IF ~IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3796. TransferToRegister(lastIndex, lastIndex);
  3797. skipLabel1 := NewLabel();
  3798. BrneL(skipLabel1, lastIndex, IntermediateCode.Immediate(sizeType, MAX(LONGINT)));
  3799. Emit(MovReplace(position,lastIndex, sourceLength.op)); (* make sure that no new register is allocated *)
  3800. Emit(Sub(position,lastIndex, lastIndex, IntermediateCode.Immediate(sizeType, 1)));
  3801. SetLabel(skipLabel1)
  3802. END;
  3803. (* check if step size is valid *)
  3804. IF IsIntegerImmediate(stepSize, staticStepSize) THEN
  3805. ASSERT(staticStepSize >= 1) (* ensured by the checker *)
  3806. ELSIF isUnchecked THEN (* do nothing *)
  3807. ELSE
  3808. TrapC(BrgeL, stepSize, IntermediateCode.Immediate(sizeType, 1), IndexCheckTrap)
  3809. END;
  3810. (* check lower bound check *)
  3811. IF IsIntegerImmediate(firstIndex, staticFirstIndex) THEN
  3812. ASSERT(staticFirstIndex >= 0) (* ensured by the checker *)
  3813. ELSIF isUnchecked THEN (* do nothing *)
  3814. ELSE
  3815. TrapC(BrgeL, firstIndex, IntermediateCode.Immediate(sizeType, 0), IndexCheckTrap)
  3816. END;
  3817. (* check upper bound check *)
  3818. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3819. (* statically open range: nothing to do *)
  3820. ELSIF IsIntegerImmediate(lastIndex, staticLastIndex) & IsIntegerImmediate(sourceLength.op, staticSourceLength) THEN
  3821. ASSERT(staticLastIndex < staticSourceLength)
  3822. ELSIF isUnchecked THEN (* do nothing *)
  3823. ELSE
  3824. TrapC(BrltL, lastIndex, sourceLength.op, IndexCheckTrap)
  3825. END;
  3826. (* determine length of target array for current dimension *)
  3827. (* 1. incorporate last index: *)
  3828. IF IsIntegerImmediate(lastIndex, staticLastIndex) THEN
  3829. (* last index is static *)
  3830. IF IsIntegerImmediate(lastIndex, staticLastIndex) & (staticLastIndex = MAX(LONGINT)) THEN
  3831. targetLength := sourceLength.op
  3832. ELSE
  3833. targetLength := IntermediateCode.Immediate(sizeType, staticLastIndex + 1)
  3834. END;
  3835. UseIntermediateOperand(targetLength);
  3836. ELSE
  3837. (* targetLength := lastIndex + 1
  3838. Reuse1(targetLength, lastIndex);
  3839. *)
  3840. AddInt(targetLength, lastIndex, IntermediateCode.Immediate(sizeType, 1));
  3841. END;
  3842. ReleaseOperand(sourceLength);
  3843. ReleaseIntermediateOperand(lastIndex);
  3844. (* 2. incorporate first index: *)
  3845. IF IsIntegerImmediate(firstIndex, staticFirstIndex) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3846. (* first index and current target length are static *)
  3847. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength - staticFirstIndex)
  3848. ELSIF IsIntegerImmediate(firstIndex, staticFirstIndex) & (staticFirstIndex = 0) THEN
  3849. (* first index = 0: nothing to do *)
  3850. ELSE
  3851. (* targetLength := targetLength - firstIndex *)
  3852. TransferToRegister(targetLength, targetLength);
  3853. Emit(Sub(position,targetLength, targetLength, firstIndex))
  3854. END;
  3855. (* clip negative lengths to 0 *)
  3856. IF IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3857. IF staticTargetLength < 0 THEN
  3858. targetLength := IntermediateCode.Immediate(sizeType, 0)
  3859. END
  3860. ELSE
  3861. skipLabel1 := NewLabel();
  3862. TransferToRegister(targetLength, targetLength);
  3863. BrgeL(skipLabel1, targetLength, IntermediateCode.Immediate(sizeType, 0));
  3864. Emit(Mov(position,targetLength, IntermediateCode.Immediate(sizeType, 0)));
  3865. SetLabel(skipLabel1)
  3866. END;
  3867. (* 3. incorporate index step size: *)
  3868. IF IsIntegerImmediate(stepSize, staticStepSize) & IsIntegerImmediate(targetLength, staticTargetLength) THEN
  3869. (*step size and current target length are static *)
  3870. staticTargetLength := (staticTargetLength-1) DIV staticStepSize + 1;
  3871. targetLength := IntermediateCode.Immediate(sizeType, staticTargetLength)
  3872. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3873. (* step size = 1: nothing to do *)
  3874. ELSE
  3875. (* emit code for this:
  3876. targetLength := (targetLength-1) DIV stepSize +1;
  3877. *)
  3878. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, -1));
  3879. DivInt(targetLength, targetLength, stepSize);
  3880. AddInt(targetLength, targetLength, IntermediateCode.Immediate(sizeType, 1));
  3881. END;
  3882. (* determine increment of target array for current dimension *)
  3883. IF IsIntegerImmediate(sourceIncrement.op, staticSourceIncrement) & IsIntegerImmediate(stepSize, staticStepSize) THEN
  3884. targetIncrement := IntermediateCode.Immediate(sizeType, staticSourceIncrement * staticStepSize);
  3885. ELSIF IsIntegerImmediate(stepSize, staticStepSize) & (staticStepSize = 1) THEN
  3886. (* step size = 1 *)
  3887. targetIncrement := sourceIncrement.op;
  3888. UseIntermediateOperand(targetIncrement)
  3889. ELSE
  3890. (* targetIncrement := sourceIncrement * stepSize *)
  3891. Reuse1(targetIncrement, stepSize);
  3892. ASSERT((sourceIncrement.op.mode # IntermediateCode.ModeImmediate) OR (stepSize.mode # IntermediateCode.ModeImmediate));
  3893. MulInt(targetIncrement, sourceIncrement.op, stepSize);
  3894. END;
  3895. ReleaseIntermediateOperand(stepSize);
  3896. (* write length and increment of target array to descriptor *)
  3897. IF destDimOffset < 0 THEN
  3898. (* determine which dimension of target array is currently looked at *)
  3899. GetMathArrayField(tmp, localResult.tag, MathDimOffset);
  3900. TransferToRegister(destDim, tmp);
  3901. AddInt(destDim, destDim, IntermediateCode.Immediate(sizeType, (* indexDim + *) destDimOffset));
  3902. PutMathArrayLenOrIncr(localResult.tag, targetLength, destDim, FALSE);
  3903. PutMathArrayLenOrIncr(localResult.tag, targetIncrement, destDim, TRUE);
  3904. ReleaseIntermediateOperand(destDim);
  3905. INC(destDimOffset);
  3906. ELSE
  3907. PutMathArrayLength(localResult.tag, targetLength, indexDim);
  3908. PutMathArrayIncrement(localResult.tag , targetIncrement, indexDim);
  3909. END;
  3910. ReleaseIntermediateOperand(targetLength); targetLength := nil;
  3911. ReleaseIntermediateOperand(targetIncrement); targetIncrement := nil;
  3912. INC(indexDim);
  3913. Convert(firstIndex, addressType);
  3914. TransferToRegister(summand, firstIndex);
  3915. ELSE HALT(100);
  3916. END;
  3917. (*
  3918. ASSERT((summand.mode # IntermediateCode.ModeImmediate) OR (sourceIncrement.op.mode # IntermediateCode.ModeImmediate));
  3919. *)
  3920. Convert(sourceIncrement.op, addressType);
  3921. Convert(summand, addressType);
  3922. MulInt(summand, summand, sourceIncrement.op);
  3923. ReleaseIntermediateOperand(sourceIncrement.op);
  3924. AddInt(localResult.op, localResult.op, summand);
  3925. ReleaseIntermediateOperand(summand);
  3926. END
  3927. END;
  3928. result := localResult;
  3929. IF (resultingType IS SyntaxTree.RecordType) & (resultingType(SyntaxTree.RecordType).pointerType = NIL) THEN
  3930. ReleaseIntermediateOperand(result.tag);
  3931. result.tag := TypeDescriptorAdr(resultingType);
  3932. ELSIF IsDelegate(resultingType) THEN
  3933. ReleaseIntermediateOperand(result.tag);
  3934. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  3935. UseIntermediateOperand(result.tag);
  3936. ELSIF (resultingType IS SyntaxTree.ArrayType) & (resultingType(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  3937. ReleaseIntermediateOperand(result.tag);
  3938. IntermediateCode.InitImmediate(result.tag,addressType,resultingType(SyntaxTree.ArrayType).staticLength);
  3939. ELSIF (resultingType IS SyntaxTree.ArrayType) THEN
  3940. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+indexListSize-1;
  3941. ELSIF (resultingType IS SyntaxTree.MathArrayType) & ( (resultingType(SyntaxTree.MathArrayType).form # SyntaxTree.Static) OR NeedDescriptor) THEN
  3942. (* finalize target array descriptor *)
  3943. ASSERT(result.tag.mode # IntermediateCode.Undefined); (* tag has been already set in the beginning *)
  3944. (* write lengths and increments of target array for remaining dimensions *)
  3945. i := indexListSize;
  3946. WHILE indexDim < targetArrayDimensionality DO
  3947. GetMathArrayLengthAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE, sourceLength);
  3948. PutMathArrayLength(result.tag, sourceLength.op,indexDim);
  3949. ReleaseOperand(sourceLength);
  3950. GetMathArrayIncrementAt(leftType(SyntaxTree.MathArrayType),array,i,FALSE,sourceIncrement);
  3951. PutMathArrayIncrement(result.tag, sourceIncrement.op,indexDim);
  3952. ReleaseOperand(sourceIncrement);
  3953. INC(i); INC(indexDim);
  3954. END;
  3955. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3956. tmp := nil;
  3957. ELSE
  3958. GetMathArrayField(tmp,array.tag,MathPtrOffset);
  3959. END;
  3960. PutMathArrayField(result.tag, tmp, MathPtrOffset);
  3961. ReleaseIntermediateOperand(tmp);
  3962. IF leftType(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  3963. baseType := SemanticChecker.ArrayBase(resultingType, indexDim);
  3964. tmp := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  3965. ELSE
  3966. GetMathArrayField(tmp,array.tag, MathElementSizeOffset);
  3967. END;
  3968. PutMathArrayField(result.tag, tmp, MathElementSizeOffset);
  3969. ReleaseIntermediateOperand(tmp);
  3970. PutMathArrayField(result.tag, result.op, MathAdrOffset);
  3971. (* write dimensionality *)
  3972. IF targetArrayDimensionality # 0 THEN
  3973. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType, targetArrayDimensionality),MathDimOffset);
  3974. END;
  3975. PutMathArrayField(result.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{RangeFlag})),MathFlagsOffset);
  3976. END;
  3977. ReleaseOperand(array);
  3978. IF conditional & (resultingType.resolved IS SyntaxTree.BooleanType) THEN
  3979. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  3980. END;
  3981. END MathIndexDesignator;
  3982. (* get the length of an array , trying to make use of static information *)
  3983. PROCEDURE ArrayLength(type: SyntaxTree.Type; dim: LONGINT; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  3984. VAR res: IntermediateCode.Operand; size: LONGINT;
  3985. BEGIN
  3986. type := type.resolved;
  3987. IF type IS SyntaxTree.ArrayType THEN
  3988. WITH type: SyntaxTree.ArrayType DO
  3989. IF type.form = SyntaxTree.Static THEN
  3990. RETURN IntermediateCode.Immediate(addressType,type.staticLength);
  3991. (*ELSIF (type.form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  3992. Evaluate(type.length, op);
  3993. ReleaseIntermediateOperand(op.tag);
  3994. RETURN op.op;*)
  3995. ELSE
  3996. res := tag;
  3997. IntermediateCode.AddOffset(res,ToMemoryUnits(system,addressType.sizeInBits*(DynamicDim(type)-1)));
  3998. IntermediateCode.MakeMemory(res,addressType);
  3999. UseIntermediateOperand(res);
  4000. RETURN res
  4001. END
  4002. END;
  4003. ELSE
  4004. size := ToMemoryUnits(system,system.AlignedSizeOf(type));
  4005. RETURN IntermediateCode.Immediate(addressType,size);
  4006. END;
  4007. END ArrayLength;
  4008. PROCEDURE CopyInt(VAR res: IntermediateCode.Operand; x: IntermediateCode.Operand);
  4009. BEGIN
  4010. IF IsImmediate(x) THEN
  4011. IntermediateCode.InitImmediate(res,x.type,x.intValue);
  4012. ELSE
  4013. IF ~ReusableRegister(res) THEN
  4014. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4015. ELSE
  4016. UseIntermediateOperand(res);
  4017. END;
  4018. Emit(Mov(position,res,x))
  4019. END;
  4020. END CopyInt;
  4021. PROCEDURE AddInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4022. BEGIN
  4023. ReleaseIntermediateOperand(res);
  4024. IF IsImmediate(x) & IsImmediate(y) THEN
  4025. IntermediateCode.InitImmediate(res,x.type,x.intValue+y.intValue);
  4026. ELSIF IsAddress(x) & IsImmediate(y) THEN
  4027. IntermediateCode.InitAddress(res,x.type,x.symbol.name, x.symbol.fingerprint, x.symbolOffset);
  4028. IntermediateCode.AddOffset(res, LONGINT(y.intValue)+x.offset);
  4029. ELSIF IsAddress(y) & IsImmediate(x) THEN
  4030. IntermediateCode.InitAddress(res,y.type,y.symbol.name, y.symbol.fingerprint, y.symbolOffset);
  4031. IntermediateCode.AddOffset(res, LONGINT(x.intValue)+y.offset);
  4032. ELSIF IsRegister(x) & IsImmediate(y) THEN
  4033. IntermediateCode.InitRegister(res, x.type, x.registerClass, x.register);
  4034. IntermediateCode.AddOffset(res, x.offset + LONGINT(y.intValue));
  4035. UseIntermediateOperand(res);
  4036. ELSIF IsRegister(y) & IsImmediate(x) THEN
  4037. IntermediateCode.InitRegister(res, y.type, y.registerClass, y.register);
  4038. IntermediateCode.AddOffset(res, y.offset + LONGINT(x.intValue));
  4039. UseIntermediateOperand(res);
  4040. ELSE
  4041. IF ~ReusableRegister(res) THEN
  4042. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4043. ELSE
  4044. UseIntermediateOperand(res);
  4045. END;
  4046. IF IsImmediate(x) & (x.intValue = 0) THEN
  4047. Emit(Mov(position,res,y))
  4048. ELSIF IsImmediate(y) & (y.intValue=0) THEN
  4049. Emit(Mov(position,res,x))
  4050. ELSE
  4051. Emit(Add(position,res, x, y));
  4052. END;
  4053. END;
  4054. END AddInt;
  4055. PROCEDURE MulInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4056. BEGIN
  4057. ReleaseIntermediateOperand(res);
  4058. IF IsImmediate(x) & IsImmediate(y) THEN
  4059. IntermediateCode.InitImmediate(res,x.type,x.intValue*y.intValue);
  4060. ELSE
  4061. IF ~ReusableRegister(res) THEN
  4062. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4063. ELSE UseIntermediateOperand(res);
  4064. END;
  4065. IF IsImmediate(x) & (x.intValue = 1) THEN
  4066. Emit(Mov(position,res,y))
  4067. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4068. Emit(Mov(position,res,x))
  4069. ELSE
  4070. Emit(Mul(position,res, x, y));
  4071. END;
  4072. END;
  4073. END MulInt;
  4074. PROCEDURE DivInt(VAR res: IntermediateCode.Operand; x,y: IntermediateCode.Operand);
  4075. BEGIN
  4076. ReleaseIntermediateOperand(res);
  4077. IF IsImmediate(x) & IsImmediate(y) THEN
  4078. IntermediateCode.InitImmediate(res,x.type,x.intValue DIV y.intValue);
  4079. ELSE
  4080. IF ~ReusableRegister(res) THEN
  4081. IntermediateCode.InitRegister(res,x.type,IntermediateCode.GeneralPurposeRegister,AcquireRegister(x.type,IntermediateCode.GeneralPurposeRegister));
  4082. ELSE UseIntermediateOperand(res);
  4083. END;
  4084. IF IsImmediate(x) & (x.intValue = 1) THEN
  4085. Emit(Mov(position,res,y))
  4086. ELSIF IsImmediate(y) & (y.intValue=1) THEN
  4087. Emit(Mov(position,res,x))
  4088. ELSE
  4089. Emit(Div(position,res, x, y));
  4090. END;
  4091. END;
  4092. END DivInt;
  4093. PROCEDURE IndexDesignator(x: SyntaxTree.IndexDesignator);
  4094. VAR length,res: IntermediateCode.Operand; type,ttype: SyntaxTree.Type; maxDim: LONGINT; array:Operand;
  4095. index: Operand; e: SyntaxTree.Expression;i: LONGINT; size: LONGINT; atype: SyntaxTree.ArrayType;
  4096. BEGIN
  4097. type := x.left.type.resolved;
  4098. IF type IS SyntaxTree.StringType THEN
  4099. atype := SyntaxTree.NewArrayType(Basic.invalidPosition, NIL, SyntaxTree.Static);
  4100. atype.SetArrayBase(type(SyntaxTree.StringType).baseType);
  4101. atype.SetLength(Global.NewIntegerValue(system,Basic.invalidPosition, type(SyntaxTree.StringType).length));
  4102. type := atype;
  4103. x.left.SetType(type);
  4104. END;
  4105. IntermediateCode.InitImmediate(res,addressType,0);
  4106. maxDim := x.parameters.Length()-1;
  4107. (*
  4108. computation rule:
  4109. a: ARRAY X,Y,Z OF Element with size S
  4110. a[i,j,k] -->
  4111. ( ( ( ( i ) * Y + j ) * Z) + k) * S
  4112. *)
  4113. FOR i := 0 TO maxDim DO
  4114. e := x.parameters.GetExpression(i);
  4115. Evaluate(e,index);
  4116. Convert(index.op,addressType);
  4117. AddInt(res, res, index.op);
  4118. IF i = 0 THEN
  4119. (*
  4120. ReuseCopy(res, index.op);
  4121. *)
  4122. Designate(x.left,array);
  4123. type := x.left.type.resolved;
  4124. IF (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic) & backend.cellsAreObjects THEN
  4125. Dereference(array, type, FALSE);
  4126. END;
  4127. (*
  4128. ELSE AddInt(res, res, index.op);
  4129. *)
  4130. END;
  4131. IF (array.tag.mode # IntermediateCode.Undefined ) THEN
  4132. length := ArrayLength(type(SyntaxTree.ArrayType),array.dimOffset+i,array.tag);
  4133. IF ((length.mode # IntermediateCode.ModeImmediate) OR (index.op.mode # IntermediateCode.ModeImmediate)) & tagsAvailable THEN
  4134. BoundCheck(index.op, length);
  4135. END;
  4136. ReleaseIntermediateOperand(length);
  4137. END;
  4138. ReleaseOperand(index);
  4139. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4140. length := ArrayLength(type,array.dimOffset+i-1,array.tag);
  4141. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4142. MulInt(res,res,length);
  4143. END;
  4144. ReleaseIntermediateOperand(length);
  4145. END;
  4146. (* remaining open dimensions -- compute address *)
  4147. i := maxDim+1;
  4148. IF type IS SyntaxTree.ArrayType THEN
  4149. ttype := type(SyntaxTree.ArrayType).arrayBase.resolved;
  4150. WHILE (ttype IS SyntaxTree.ArrayType) & (ttype(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  4151. length := ArrayLength(ttype,array.dimOffset+i-1,array.tag);
  4152. IF (length.mode # IntermediateCode.ModeImmediate) OR (length.intValue # 1) THEN
  4153. MulInt(res,res,length);
  4154. END;
  4155. ReleaseIntermediateOperand(length);
  4156. INC(i);
  4157. ttype := ttype(SyntaxTree.ArrayType).arrayBase.resolved;
  4158. END;
  4159. END;
  4160. IF (type IS SyntaxTree.ArrayType) THEN
  4161. IF (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) THEN
  4162. size := StaticSize(system, type);
  4163. IF size # 1 THEN
  4164. length := IntermediateCode.Immediate(addressType,size);
  4165. MulInt(res,res,length);
  4166. END;
  4167. ELSE
  4168. size := StaticSize(system, type(SyntaxTree.ArrayType).arrayBase);
  4169. IF size # 1 THEN
  4170. length := IntermediateCode.Immediate(addressType,size);
  4171. MulInt(res,res,length);
  4172. END;
  4173. END;
  4174. END;
  4175. AddInt(res,res,array.op);
  4176. InitOperand(result,ModeReference);
  4177. result.op := res;
  4178. IF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  4179. ReleaseIntermediateOperand(result.tag);
  4180. result.tag := TypeDescriptorAdr(type);
  4181. ELSIF IsDelegate(type) THEN
  4182. ReleaseIntermediateOperand(result.tag);
  4183. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  4184. UseIntermediateOperand(result.tag);
  4185. ELSIF (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static) THEN
  4186. ReleaseIntermediateOperand(result.tag);
  4187. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  4188. ELSIF (type IS SyntaxTree.ArrayType) THEN
  4189. result.tag := array.tag; UseIntermediateOperand(result.tag); result.dimOffset := array.dimOffset+maxDim;
  4190. END;
  4191. ReleaseOperand(array);
  4192. IF (conditional) & (type.resolved IS SyntaxTree.BooleanType) THEN
  4193. ValueToCondition(result); (*! wrong as the result of an index designator is always an address *)
  4194. END;
  4195. END IndexDesignator;
  4196. PROCEDURE VisitIndexDesignator*(x: SyntaxTree.IndexDesignator);
  4197. VAR type: SyntaxTree.Type; dest: IntermediateCode.Operand;
  4198. BEGIN
  4199. IF Trace THEN TraceEnter("VisitIndexDesignator") END;
  4200. dest := destination; destination := emptyOperand;
  4201. type := x.left.type.resolved;
  4202. IF type IS SyntaxTree.MathArrayType THEN
  4203. MathIndexDesignator(x);
  4204. ELSE ASSERT((type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.StringType));
  4205. IndexDesignator(x);
  4206. END;
  4207. destination := dest;
  4208. IF Trace THEN TraceExit("VisitIndexDesignator") END;
  4209. END VisitIndexDesignator;
  4210. PROCEDURE PrepareTensorDescriptor(expression: SyntaxTree.IndexDesignator): SyntaxTree.Variable;
  4211. VAR variable: SyntaxTree.Variable; srcOperand,destOperand,procOp: Operand;
  4212. moduleName, procedureName: SyntaxTree.IdentifierString; arrayBase: SyntaxTree.Module; saved: RegisterEntry; s: Basic.MessageString;
  4213. procedure: SyntaxTree.Procedure;
  4214. parameters: SyntaxTree.ExpressionList; e: SyntaxTree.Expression;
  4215. prefixIndices, prefixRanges, suffixIndices, suffixRanges,i : LONGINT; tensorFound: BOOLEAN;
  4216. BEGIN
  4217. (* variable represents a newly allocaed range array in a tensor, this is allocated in CopyDescriptor and must thus not be untraced *)
  4218. variable := GetTemporaryVariable(expression.left.type, FALSE, FALSE (* untraced *));
  4219. parameters := expression.parameters;
  4220. moduleName := "FoxArrayBase";
  4221. procedureName := "CopyDescriptor";
  4222. IF AddImport(moduleName,arrayBase,TRUE) THEN
  4223. SaveRegisters();ReleaseUsedRegisters(saved);
  4224. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  4225. IF procedure = NIL THEN
  4226. s := "procedure ";
  4227. Strings.Append(s,moduleName);
  4228. Strings.Append(s,".");
  4229. Strings.Append(s,procedureName);
  4230. Strings.Append(s," not present");
  4231. Error(position,s);
  4232. ELSE
  4233. (* push address of temporary variable *)
  4234. Symbol(variable,destOperand);
  4235. Emit(Push(position,destOperand.op));
  4236. ReleaseOperand(destOperand);
  4237. (* push src *)
  4238. Evaluate(expression.left,srcOperand);
  4239. (*
  4240. Dereference(srcOperand,expression.type.resolved);
  4241. Emit(Push(position,srcOperand.tag));
  4242. *)
  4243. Emit(Push(position,srcOperand.op));
  4244. ReleaseOperand(srcOperand);
  4245. tensorFound := FALSE;
  4246. FOR i := 0 TO parameters.Length()-1 DO
  4247. e := parameters.GetExpression(i);
  4248. IF e IS SyntaxTree.TensorRangeExpression THEN
  4249. tensorFound := TRUE;
  4250. ELSIF e IS SyntaxTree.RangeExpression THEN
  4251. IF tensorFound THEN INC(suffixRanges) ELSE INC(prefixRanges) END;
  4252. ELSE
  4253. IF tensorFound THEN INC(suffixIndices) ELSE INC(prefixIndices) END;
  4254. END;
  4255. END;
  4256. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixIndices)));
  4257. Emit(Push(position,IntermediateCode.Immediate(sizeType,prefixRanges)));
  4258. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixIndices)));
  4259. Emit(Push(position,IntermediateCode.Immediate(sizeType,suffixRanges)));
  4260. StaticCallOperand(procOp,procedure);
  4261. Emit(Call(position,procOp.op,ProcParametersSize(procedure)));
  4262. ReleaseOperand(procOp);
  4263. END;
  4264. RestoreRegisters(saved);
  4265. END;
  4266. RETURN variable
  4267. END PrepareTensorDescriptor;
  4268. PROCEDURE PushParameter(expression: SyntaxTree.Expression; parameter: SyntaxTree.Parameter; callingConvention: LONGINT; needsParameterBackup: BOOLEAN; VAR parameterBackup: IntermediateCode.Operand; numberRegister: LONGINT);
  4269. VAR
  4270. type, descriptorType, baseType, componentType: SyntaxTree.Type;
  4271. operand, tmpOperand, variableOp, variable2Op: Operand;
  4272. baseReg, tmp, dimOp, null, dst: IntermediateCode.Operand;
  4273. variable, variable2: SyntaxTree.Variable;
  4274. dim, i, size: LONGINT;
  4275. (* TODO: needed? *)
  4276. oldArrayDestinationTag: IntermediateCode.Operand;
  4277. oldArrayDestinationDimension: LONGINT;
  4278. position: Position;
  4279. saved: RegisterEntry;
  4280. arrayFlags: SET;
  4281. m, n: LONGINT;
  4282. PROCEDURE Pass(op: IntermediateCode.Operand);
  4283. VAR registerClass: IntermediateCode.RegisterClass; parameterRegister: IntermediateCode.Operand;
  4284. BEGIN
  4285. IF numberRegister >= 0 THEN
  4286. IntermediateCode.InitParameterRegisterClass(registerClass, backend.ParameterRegister(callingConvention,op.type,numberRegister));
  4287. IntermediateCode.InitRegister(parameterRegister, op.type, registerClass, AcquireRegister(op.type, registerClass));
  4288. Emit(Mov(position,parameterRegister, op));
  4289. ELSE
  4290. Emit(Push(position,op))
  4291. END
  4292. END Pass;
  4293. PROCEDURE PushArrayLens(formalType,actualType: SyntaxTree.Type; dim: LONGINT);
  4294. VAR tmp: IntermediateCode.Operand; actualArrayBase: SyntaxTree.Type;
  4295. BEGIN
  4296. formalType := formalType.resolved; actualType := actualType.resolved;
  4297. IF IsOpenArray(formalType)THEN
  4298. IF actualType IS SyntaxTree.StringType THEN
  4299. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  4300. RETURN;
  4301. ELSIF (actualType IS SyntaxTree.MathArrayType) & (actualType(SyntaxTree.MathArrayType).form = SyntaxTree.Static) THEN
  4302. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.MathArrayType).staticLength)));
  4303. actualArrayBase := actualType(SyntaxTree.MathArrayType).arrayBase.resolved;
  4304. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  4305. Pass((IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  4306. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4307. ELSE
  4308. tmp := baseReg;
  4309. IntermediateCode.AddOffset(tmp,ToMemoryUnits(system,dim*system.addressSize));
  4310. IntermediateCode.MakeMemory(tmp,addressType);
  4311. Pass((tmp));
  4312. actualArrayBase := actualType(SyntaxTree.ArrayType).arrayBase.resolved;
  4313. END;
  4314. PushArrayLens(formalType(SyntaxTree.ArrayType).arrayBase.resolved, actualArrayBase,dim-1);
  4315. END;
  4316. END PushArrayLens;
  4317. PROCEDURE SetSmallArraySizeFlag(VAR flags: SET; size: LONGINT);
  4318. BEGIN
  4319. CASE size OF
  4320. |2: INCL(flags,Size2Flag);
  4321. |3: INCL(flags,Size3Flag);
  4322. |4: INCL(flags,Size4Flag);
  4323. |5: INCL(flags,Size5Flag);
  4324. |6: INCL(flags,Size6Flag);
  4325. |7: INCL(flags,Size7Flag);
  4326. |8: INCL(flags,Size8Flag);
  4327. END;
  4328. END SetSmallArraySizeFlag;
  4329. BEGIN
  4330. IF Trace THEN TraceEnter("PushParameter") END;
  4331. position := expression.position;
  4332. IF expression.resolved # NIL THEN expression := expression.resolved END;
  4333. type := expression.type.resolved;
  4334. ASSERT( ((type IS SyntaxTree.MathArrayType) = (parameter.type.resolved IS SyntaxTree.MathArrayType))
  4335. OR (type IS SyntaxTree.MathArrayType) & (parameter.type.resolved IS SyntaxTree.ArrayType)
  4336. & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static)
  4337. & (parameter.type.resolved(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  4338. );
  4339. (* TODO: needed? *)
  4340. oldArrayDestinationTag := arrayDestinationTag;
  4341. oldArrayDestinationDimension := arrayDestinationDimension;
  4342. IF IsArrayOfSystemByte(parameter.type) THEN
  4343. IF SemanticChecker.HasAddress(expression) OR (callingConvention = SyntaxTree.WinAPICallingConvention) & (expression IS SyntaxTree.NilValue) THEN
  4344. Designate(expression,operand);
  4345. ELSE
  4346. Evaluate(expression, tmpOperand);
  4347. (* array of system byte does not provide any pointers *)
  4348. variable := GetTemporaryVariable(expression.type, FALSE, FALSE);
  4349. Symbol(variable, operand);
  4350. MakeMemory(tmp,operand.op,tmpOperand.op.type,0);
  4351. Emit(Mov(position,tmp, tmpOperand.op));
  4352. ReleaseOperand(tmpOperand);
  4353. END;
  4354. tmp := GetArrayOfBytesSize(expression,operand.tag);
  4355. ReleaseIntermediateOperand(operand.tag);
  4356. operand.tag := tmp;
  4357. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4358. Pass((operand.tag));
  4359. END;
  4360. Pass((operand.op));
  4361. ELSIF IsOpenArray(parameter.type) THEN
  4362. Designate(expression,operand);
  4363. baseReg := operand.tag;
  4364. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4365. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4366. END;
  4367. Pass((operand.op)); (* address of the array *)
  4368. ELSIF parameter.type.resolved IS SyntaxTree.MathArrayType THEN
  4369. (* case 1
  4370. procedure P([left args], [const] A: array [*,*] of Type, [right args])
  4371. *)
  4372. IF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) &
  4373. (parameter.kind IN {SyntaxTree.ValueParameter, SyntaxTree.ConstParameter}) THEN
  4374. size := MathLenOffset + 2*SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4375. size := ToMemoryUnits(system,size*addressType.sizeInBits);
  4376. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4377. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4378. arrayDestinationTag := sp;
  4379. (* case 1b
  4380. P(...,A[a..b,c..d],...): push: push array range descriptor to stack
  4381. *)
  4382. IF expression IS SyntaxTree.IndexDesignator THEN
  4383. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4384. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4385. arrayDestinationDimension := dim;
  4386. Designate(expression,operand);
  4387. (* case 1a
  4388. P(...,A,...) push: push array descriptor to stack
  4389. *)
  4390. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4391. Designate(expression,operand);
  4392. Emit(Copy(position,arrayDestinationTag,operand.tag,IntermediateCode.Immediate(addressType,size)));
  4393. i := 0;
  4394. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4395. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4396. INC(i);
  4397. END;
  4398. type := expression.type.resolved;
  4399. WHILE (i<dim) DO (* remaining static dimensions *)
  4400. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4401. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4402. ReleaseOperand(tmpOperand);
  4403. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4404. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4405. ReleaseOperand(tmpOperand);
  4406. INC(i);
  4407. END;
  4408. dimOp := IntermediateCode.Immediate(addressType,dim);
  4409. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4410. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4411. (* case 1d
  4412. P(...,T,...) push: process left arguments, create array descriptor with given s of dimensions from T on stack
  4413. + case 1e
  4414. P(.. PT() ... );
  4415. *)
  4416. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4417. Designate(expression,operand);
  4418. Dereference(operand,type.resolved,FALSE);
  4419. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4420. Emit(Copy(position,sp(*arrayDestinationTag*),operand.tag,IntermediateCode.Immediate(addressType,size)));
  4421. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4422. (* case 1f
  4423. P(...,S,...) push: create array descriptor to S on stack
  4424. case 1g
  4425. P(... PS()...)
  4426. *)
  4427. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4428. Designate(expression,operand);
  4429. FOR i := 0 TO dim-1 DO
  4430. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4431. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4432. ReleaseOperand(tmpOperand);
  4433. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4434. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4435. ReleaseOperand(tmpOperand);
  4436. END;
  4437. (*******
  4438. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4439. *)
  4440. arrayFlags := {StaticFlag};
  4441. IF dim = 1 THEN
  4442. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4443. ReleaseOperand(tmpOperand);
  4444. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4445. m := LONGINT(tmpOperand.op.intValue);
  4446. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4447. ELSIF dim = 2 THEN
  4448. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4449. ReleaseOperand(tmpOperand);
  4450. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4451. m := LONGINT(tmpOperand.op.intValue);
  4452. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4453. ReleaseOperand(tmpOperand);
  4454. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4455. n := LONGINT(tmpOperand.op.intValue);
  4456. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4457. INCL(arrayFlags,SmallMatrixFlag);
  4458. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4459. END;
  4460. END;
  4461. (*******)
  4462. dimOp := IntermediateCode.Immediate(addressType,dim);
  4463. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4464. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4465. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4466. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4467. baseType := SemanticChecker.ArrayBase(type,dim);
  4468. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4469. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4470. ELSE HALT(100);
  4471. END;
  4472. (* case 2
  4473. procedure P([left args], var A: array [*,*] of Type, [right args])
  4474. *)
  4475. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4476. dim := SemanticChecker.Dimension(parameter.type.resolved,{SyntaxTree.Open});
  4477. (* case 2b
  4478. P(...,A[a..b,c..d],...) pre: emit range and push array range descriptor, memorize stack position
  4479. push: push reference to pushed array descriptor
  4480. post: remove array descriptor.
  4481. *)
  4482. IF expression IS SyntaxTree.IndexDesignator THEN
  4483. descriptorType := GetMathArrayDescriptorType(dim);
  4484. (* range type : no allocation possible, should be untraced *)
  4485. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4486. Symbol(variable,variableOp);
  4487. arrayDestinationTag := variableOp.op;
  4488. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4489. arrayDestinationDimension := dim;
  4490. NeedDescriptor := TRUE;
  4491. Designate(expression,operand);
  4492. Pass((operand.tag));
  4493. NeedDescriptor := FALSE;
  4494. (* case 2a
  4495. P(...,A,...)
  4496. push: push reference to array descriptor on stack
  4497. *)
  4498. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4499. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4500. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4501. INC(i);
  4502. END;
  4503. IF i = dim THEN
  4504. Designate(expression,operand);
  4505. Pass((operand.tag));
  4506. ELSE (* open-static *)
  4507. type := expression.type.resolved;
  4508. descriptorType := GetMathArrayDescriptorType(dim);
  4509. (* static array , cannot be reallocated, untraced !*)
  4510. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4511. Symbol(variable,variableOp);
  4512. arrayDestinationTag := variableOp.op;
  4513. Designate(expression,operand);
  4514. FOR i := 0 TO dim-1 DO
  4515. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4516. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4517. ReleaseOperand(tmpOperand);
  4518. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4519. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4520. ReleaseOperand(tmpOperand);
  4521. END;
  4522. dimOp := IntermediateCode.Immediate(addressType,dim);
  4523. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4524. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4525. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4526. PutMathArrayField(arrayDestinationTag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4527. baseType := SemanticChecker.ArrayBase(type,dim);
  4528. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4529. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4530. Pass((arrayDestinationTag));
  4531. END;
  4532. (* case 2d
  4533. P(...,T,...) push: emit dimension check, push T
  4534. *)
  4535. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4536. Designate(expression,operand);
  4537. Dereference(operand,type.resolved,FALSE);
  4538. DimensionCheck(operand.tag, IntermediateCode.Immediate(sizeType,dim),BreqL);
  4539. Pass((operand.tag));
  4540. (* case 2f
  4541. P(...,S,...) pre: allocate array descriptor on stack and memorize stack position
  4542. push: push reference to pushed array descriptor
  4543. post: remove array descriptor
  4544. *)
  4545. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4546. descriptorType := GetMathArrayDescriptorType(dim);
  4547. (* static array -- cannot be reallocatated, untraced *)
  4548. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4549. Symbol(variable,variableOp);
  4550. arrayDestinationTag := variableOp.op;
  4551. Designate(expression,operand);
  4552. FOR i := 0 TO dim-1 DO
  4553. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4554. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4555. ReleaseOperand(tmpOperand);
  4556. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4557. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4558. ReleaseOperand(tmpOperand);
  4559. END;
  4560. (*
  4561. identify the cases of small vector and matrices, used for optimizations in FoxArrayBase module (Alexey Morozov)
  4562. *)
  4563. arrayFlags := {StaticFlag};
  4564. IF dim = 1 THEN
  4565. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4566. ReleaseOperand(tmpOperand);
  4567. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4568. m := LONGINT(tmpOperand.op.intValue);
  4569. IF (m >= 2) & (m <= 8) THEN INCL(arrayFlags,SmallVectorFlag); SetSmallArraySizeFlag(arrayFlags,m); END;
  4570. ELSIF dim = 2 THEN
  4571. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,0,FALSE,tmpOperand);
  4572. ReleaseOperand(tmpOperand);
  4573. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4574. m := LONGINT(tmpOperand.op.intValue);
  4575. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,1,FALSE,tmpOperand);
  4576. ReleaseOperand(tmpOperand);
  4577. ASSERT(tmpOperand.op.mode = IntermediateCode.ModeImmediate);
  4578. n := LONGINT(tmpOperand.op.intValue);
  4579. IF (m >= 2) & (m <= 8) & (n >= 2) & (n <= 8) THEN
  4580. INCL(arrayFlags,SmallMatrixFlag);
  4581. IF m = n THEN SetSmallArraySizeFlag(arrayFlags,m); END;
  4582. END;
  4583. END;
  4584. (*******)
  4585. dimOp := IntermediateCode.Immediate(addressType,dim);
  4586. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4587. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4588. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4589. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,arrayFlags)),MathFlagsOffset);
  4590. baseType := SemanticChecker.ArrayBase(type,dim);
  4591. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4592. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4593. Pass((arrayDestinationTag));
  4594. ELSE HALT(100);
  4595. END;
  4596. (* case 3
  4597. procedure P([left args], [const] A: array [?] of Type, [right args])
  4598. *)
  4599. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind IN {SyntaxTree.ConstParameter,SyntaxTree.ValueParameter}) THEN
  4600. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4601. (* case 3b
  4602. P(...,A[a..b,c..d],...)
  4603. *)
  4604. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4605. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4606. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4607. Symbol(variable,variableOp);
  4608. LoadValue(variableOp,system.addressType);
  4609. ELSE
  4610. descriptorType := GetMathArrayDescriptorType(dim);
  4611. (* range -- cannot be reallocated *)
  4612. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4613. Symbol(variable,variableOp);
  4614. END;
  4615. arrayDestinationTag := variableOp.op;
  4616. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4617. arrayDestinationDimension := 0;
  4618. Designate(expression,operand);
  4619. Pass((operand.tag));
  4620. (* case 3a
  4621. P(...,A,...)
  4622. *)
  4623. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4624. i := 0;
  4625. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4626. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4627. INC(i);
  4628. END;
  4629. IF i = dim THEN
  4630. Designate(expression,operand);
  4631. Pass((operand.tag));
  4632. ELSE (* open-static *)
  4633. type := expression.type.resolved;
  4634. descriptorType := GetMathArrayDescriptorType(dim);
  4635. (* static array -- cannot be reallocated -- no pointer to be traced *)
  4636. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4637. Symbol(variable,variableOp);
  4638. arrayDestinationTag := variableOp.op;
  4639. Designate(expression,operand);
  4640. FOR i := 0 TO dim-1 DO
  4641. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4642. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4643. ReleaseOperand(tmpOperand);
  4644. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4645. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4646. ReleaseOperand(tmpOperand);
  4647. END;
  4648. dimOp := IntermediateCode.Immediate(addressType,dim);
  4649. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4650. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4651. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4652. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset); (* static flag ? *)
  4653. baseType := SemanticChecker.ArrayBase(type,dim);
  4654. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4655. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4656. Pass((arrayDestinationTag));
  4657. END;
  4658. (* case 3d
  4659. P(...,T,...)
  4660. case 3e
  4661. P(...,PT(...),...)
  4662. *)
  4663. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4664. Designate(expression,operand);
  4665. Dereference(operand,type.resolved,FALSE);
  4666. Pass((operand.tag));
  4667. (* case 3f
  4668. P(...,S,...)
  4669. case 3g
  4670. P(...,PS(...),...)
  4671. *)
  4672. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4673. descriptorType := GetMathArrayDescriptorType(dim);
  4674. (* static array does not need to be traced *)
  4675. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4676. Symbol(variable,variableOp);
  4677. arrayDestinationTag := variableOp.op;
  4678. Designate(expression,operand);
  4679. IF operand.op.type.length >1 THEN (* vector register *)
  4680. (* static array does not need to be traced *)
  4681. variable2 := GetTemporaryVariable(type, FALSE, TRUE (* untraced *));
  4682. Symbol(variable2, variable2Op);
  4683. MakeMemory(tmp,variable2Op.op,operand.op.type,0);
  4684. Emit(Mov(position,tmp, operand.op));
  4685. ReleaseOperand(operand);
  4686. Symbol(variable2, operand);
  4687. END;
  4688. FOR i := 0 TO dim-1 DO
  4689. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4690. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4691. ReleaseOperand(tmpOperand);
  4692. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4693. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4694. ReleaseOperand(tmpOperand);
  4695. END;
  4696. dimOp := IntermediateCode.Immediate(addressType,dim);
  4697. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4698. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4699. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4700. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4701. baseType := SemanticChecker.ArrayBase(type,dim);
  4702. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4703. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4704. Pass((arrayDestinationTag));
  4705. ELSE HALT(100);
  4706. END;
  4707. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor) & (parameter.kind = SyntaxTree.VarParameter) THEN
  4708. dim := SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static});
  4709. (* case 4b
  4710. P(...,A[a..b,c..d],...)
  4711. *)
  4712. IF (expression IS SyntaxTree.IndexDesignator) & (type.resolved(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  4713. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN (* indexer of form a[e,....,?] *)
  4714. variable := PrepareTensorDescriptor(expression(SyntaxTree.IndexDesignator));
  4715. Symbol(variable,variableOp);
  4716. LoadValue(variableOp,system.addressType);
  4717. ELSE
  4718. descriptorType := GetMathArrayDescriptorType(dim);
  4719. (* range array -- cannot be allocated *)
  4720. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4721. Symbol(variable,variableOp);
  4722. END;
  4723. arrayDestinationTag := variableOp.op;
  4724. ReuseCopy(arrayDestinationTag,arrayDestinationTag);
  4725. arrayDestinationDimension := 0;
  4726. Designate(expression,operand);
  4727. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4728. Symbol(variable,variableOp);
  4729. ELSE
  4730. (* alias to range -- untraced *)
  4731. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4732. Symbol(variable,variableOp);
  4733. MakeMemory(tmp,variableOp.op,addressType,0);
  4734. Emit(Mov(position,tmp,operand.tag));
  4735. ReleaseIntermediateOperand(tmp);
  4736. END;
  4737. Pass((variableOp.op));
  4738. ReleaseOperand(variableOp);
  4739. (* case 4a
  4740. P(...,A,...)
  4741. *)
  4742. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open THEN
  4743. i := 0;
  4744. WHILE (i< dim) & (type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Open) DO
  4745. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  4746. INC(i);
  4747. END;
  4748. IF i = dim THEN
  4749. Designate(expression,operand);
  4750. arrayDestinationTag := operand.tag;
  4751. ELSE (* open-static *)
  4752. type := expression.type.resolved;
  4753. descriptorType := GetMathArrayDescriptorType(dim);
  4754. (* static array -- untraced *)
  4755. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4756. Symbol(variable,variableOp);
  4757. arrayDestinationTag := variableOp.op;
  4758. Designate(expression,operand);
  4759. FOR i := 0 TO dim-1 DO
  4760. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4761. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4762. ReleaseOperand(tmpOperand);
  4763. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4764. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4765. ReleaseOperand(tmpOperand);
  4766. END;
  4767. dimOp := IntermediateCode.Immediate(addressType,dim);
  4768. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4769. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4770. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4771. PutMathArrayField(arrayDestinationTag,nil,MathFlagsOffset);
  4772. baseType := SemanticChecker.ArrayBase(type,dim);
  4773. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4774. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4775. END;
  4776. (* tensor alias to open array -- untraced *)
  4777. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4778. Symbol(variable,variableOp);
  4779. MakeMemory(tmp,variableOp.op,addressType,0);
  4780. Emit(Mov(position,tmp,arrayDestinationTag));
  4781. ReleaseIntermediateOperand(tmp);
  4782. Pass((variableOp.op));
  4783. ReleaseOperand(variableOp);
  4784. (* case 4d
  4785. P(...,T,...)
  4786. *)
  4787. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  4788. Designate(expression,operand);
  4789. Pass((operand.op));
  4790. (* case 4f
  4791. P(...,S,...)
  4792. *)
  4793. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4794. descriptorType := GetMathArrayDescriptorType(dim);
  4795. (* static array -- cannot be reallocated, untraced *)
  4796. variable := GetTemporaryVariable(descriptorType, FALSE, TRUE (* untraced *));
  4797. Symbol(variable,variableOp);
  4798. arrayDestinationTag := variableOp.op;
  4799. Designate(expression,operand);
  4800. FOR i := 0 TO dim-1 DO
  4801. GetMathArrayLengthAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4802. PutMathArrayLength(arrayDestinationTag,tmpOperand.op,i);
  4803. ReleaseOperand(tmpOperand);
  4804. GetMathArrayIncrementAt(type.resolved(SyntaxTree.MathArrayType),operand,i,FALSE,tmpOperand);
  4805. PutMathArrayIncrement(arrayDestinationTag,tmpOperand.op,i);
  4806. ReleaseOperand(tmpOperand);
  4807. END;
  4808. dimOp := IntermediateCode.Immediate(addressType,dim);
  4809. PutMathArrayField(arrayDestinationTag,dimOp,MathDimOffset);
  4810. PutMathArrayField(arrayDestinationTag,operand.op,MathAdrOffset);
  4811. PutMathArrayField(arrayDestinationTag,nil,MathPtrOffset);
  4812. PutMathArrayField(arrayDestinationTag,IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StaticFlag})),MathFlagsOffset);
  4813. baseType := SemanticChecker.ArrayBase(type,dim);
  4814. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.AlignedSizeOf(baseType)));
  4815. PutMathArrayField(arrayDestinationTag,tmp,MathElementSizeOffset);
  4816. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4817. Symbol(variable,variableOp);
  4818. MakeMemory(tmp,variableOp.op,addressType,0);
  4819. Emit(Mov(position,tmp,arrayDestinationTag));
  4820. ReleaseIntermediateOperand(tmp);
  4821. Pass((variableOp.op));
  4822. ReleaseOperand(variableOp);
  4823. ELSE HALT(100);
  4824. END;
  4825. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind = SyntaxTree.ValueParameter) THEN
  4826. ASSERT(type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  4827. Designate(expression,operand);
  4828. IF operand.op.type.length > 1 THEN
  4829. Emit(Push(position, operand.op));
  4830. ELSE
  4831. size := system.SizeOf(type);
  4832. Basic.Align(size,system.AlignmentOf(system.parameterAlignment,type));
  4833. size := ToMemoryUnits(system,size);
  4834. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4835. arrayDestinationTag := sp;
  4836. Emit(Copy(position,arrayDestinationTag,operand.op,IntermediateCode.Immediate(addressType,size)));
  4837. END;
  4838. ELSIF (parameter.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static) & (parameter.kind IN {SyntaxTree.VarParameter,SyntaxTree.ConstParameter}) THEN
  4839. Designate(expression,operand);
  4840. IF operand.op.type.length > 1 THEN (* need temporary to pass register *)
  4841. (* static array no pointer *)
  4842. variable := GetTemporaryVariable(parameter.type.resolved, FALSE, TRUE (* untraced *));
  4843. Symbol(variable,variableOp);
  4844. MakeMemory(tmp,variableOp.op,operand.op.type,0);
  4845. Emit(Mov(position,tmp,operand.op));
  4846. Emit(Push(position,variableOp.op));
  4847. ELSIF type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Static THEN
  4848. Pass((operand.op));
  4849. ELSE Error(position,"Forbidden non-static actual type. Conversion involved?");
  4850. END;
  4851. ELSE HALT(200)
  4852. END;
  4853. ELSIF parameter.type.resolved IS SyntaxTree.RangeType THEN
  4854. IF parameter.kind = SyntaxTree.VarParameter THEN
  4855. ASSERT(~(expression IS SyntaxTree.RangeExpression));
  4856. Designate(expression, operand);
  4857. Pass((operand.op));
  4858. ELSE
  4859. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4860. Evaluate(expression, operand);
  4861. Pass((operand.extra)); (* step *)
  4862. Pass((operand.tag)); (* last *)
  4863. Pass((operand.op)) (* first *)
  4864. END
  4865. ELSIF parameter.type.resolved IS SyntaxTree.ComplexType THEN
  4866. IF parameter.kind = SyntaxTree.VarParameter THEN
  4867. Designate(expression, operand);
  4868. Pass((operand.op));
  4869. ELSE
  4870. ASSERT((parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter));
  4871. Evaluate(expression, operand);
  4872. componentType := parameter.type.resolved(SyntaxTree.ComplexType).componentType;
  4873. IF (numberRegister > 0) OR (system.AlignmentOf(system.parameterAlignment,componentType) = system.AlignmentOf(system.variableAlignment,componentType)) THEN
  4874. Pass((operand.tag)); (* imaginary part *)
  4875. Pass((operand.op)) (* real part *)
  4876. ELSE
  4877. (* pass complex as a whole in order to comply with the variable alignment of its components *)
  4878. size := ToMemoryUnits(system,system.AlignmentOf(system.parameterAlignment,parameter.type));
  4879. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size)));
  4880. tmp := sp;
  4881. IntermediateCode.MakeMemory(tmp,operand.op.type);
  4882. Emit(Mov(position,tmp,operand.op)); (* real part *)
  4883. size := ToMemoryUnits(system,system.AlignmentOf(system.variableAlignment,componentType));
  4884. IntermediateCode.AddOffset(tmp,size);
  4885. Emit(Mov(position,tmp,operand.tag)); (* imaginary part *)
  4886. END
  4887. END
  4888. ELSE
  4889. IF (parameter.kind = SyntaxTree.ValueParameter) OR (parameter.kind = SyntaxTree.ConstParameter) & ~(parameter.type.resolved IS SyntaxTree.RecordType) & ~(parameter.type.resolved IS SyntaxTree.ArrayType) THEN
  4890. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(parameter.type) THEN
  4891. Designate(expression,operand);
  4892. size := ToMemoryUnits(system,system.SizeOf(parameter.type));
  4893. (* stack allocation *)
  4894. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,size + (-size) MOD (system.addressSize DIV system.dataUnit))));
  4895. (*! parameter alignment to be discussed ... *)
  4896. IF type IS SyntaxTree.StringType THEN (* source potentially shorter than destination *)
  4897. size := type(SyntaxTree.StringType).length;
  4898. END;
  4899. IF backend.cooperative & parameter.NeedsTrace() THEN
  4900. dst := NewRegisterOperand (addressType);
  4901. Emit(Mov(position,dst, sp));
  4902. IntermediateCode.InitImmediate(null, byteType, 0);
  4903. Emit(Fill(position, dst, IntermediateCode.Immediate(addressType,size), null));
  4904. ReleaseIntermediateOperand(dst);
  4905. SaveRegisters();ReleaseUsedRegisters(saved);
  4906. (* register dst has been freed before SaveRegisters already *)
  4907. CallAssignMethod(dst, operand.op, parameter.type);
  4908. RestoreRegisters(saved);
  4909. END;
  4910. IF operand.op.type.length > 1 THEN (* vector *)
  4911. MakeMemory(tmp,sp,operand.op.type,0);
  4912. Emit(Mov(position, tmp, operand.op));
  4913. ELSE
  4914. Emit(Copy(position,sp,operand.op,IntermediateCode.Immediate(addressType,size)));
  4915. END;
  4916. ELSIF IsOpenArray(parameter.type) THEN
  4917. Designate(expression,operand);
  4918. baseReg := operand.tag;
  4919. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4920. PushArrayLens(parameter.type,type,operand.dimOffset+DynamicDim(parameter.type)-1);
  4921. END;
  4922. Pass((operand.op)); (* address of the array *)
  4923. ELSIF IsDelegate(parameter.type) THEN
  4924. Evaluate(expression,operand);
  4925. IF backend.cooperative & parameter.NeedsTrace() THEN
  4926. Emit(Push(position, nil));
  4927. dst := NewRegisterOperand (addressType);
  4928. Emit(Mov(position,dst, sp));
  4929. ReleaseIntermediateOperand(dst);
  4930. SaveRegisters();ReleaseUsedRegisters(saved);
  4931. Emit(Push(position, dst));
  4932. (* register dst has been freed before SaveRegisters already *)
  4933. Emit(Push(position, operand.tag));
  4934. CallThis(position,"GarbageCollector","Assign",2);
  4935. RestoreRegisters(saved);
  4936. ELSE
  4937. Pass((operand.tag));
  4938. END;
  4939. Pass((operand.op));
  4940. ELSE
  4941. Evaluate(expression,operand);
  4942. IF backend.cooperative & parameter.NeedsTrace() & (operand.op.mode # IntermediateCode.ModeImmediate) THEN
  4943. Emit(Push(position, nil));
  4944. dst := NewRegisterOperand (addressType);
  4945. Emit(Mov(position,dst, sp));
  4946. ReleaseIntermediateOperand(dst);
  4947. SaveRegisters();ReleaseUsedRegisters(saved);
  4948. Emit(Push(position, dst));
  4949. (* register dst has been freed before SaveRegisters already *)
  4950. Emit(Push(position, operand.op));
  4951. CallThis(position,"GarbageCollector","Assign",2);
  4952. RestoreRegisters(saved);
  4953. ELSE
  4954. Pass((operand.op));
  4955. END;
  4956. END;
  4957. ELSIF expression IS SyntaxTree.NilValue THEN (* for special WinAPI rule *)
  4958. Evaluate(expression,operand);
  4959. Pass((operand.op));
  4960. ELSE (* var parameter *)
  4961. Designate(expression,operand);
  4962. IF (type IS SyntaxTree.RecordType) & (parameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  4963. IF callingConvention = SyntaxTree.OberonCallingConvention THEN
  4964. Pass((operand.tag));
  4965. END;
  4966. END;
  4967. Pass((operand.op));
  4968. END;
  4969. END;
  4970. (* TODO: needed? *)
  4971. arrayDestinationTag := oldArrayDestinationTag;
  4972. arrayDestinationDimension := oldArrayDestinationDimension;
  4973. IF needsParameterBackup THEN
  4974. (* IF dump # NIL THEN dump.String("backup parameter"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  4975. ReuseCopy(parameterBackup, operand.op)
  4976. END;
  4977. ReleaseOperand(operand);
  4978. IF Trace THEN TraceExit("PushParameter") END;
  4979. END PushParameter;
  4980. PROCEDURE VisitStatementDesignator*(x: SyntaxTree.StatementDesignator);
  4981. VAR prevConditional: BOOLEAN;
  4982. BEGIN
  4983. prevConditional := conditional;
  4984. conditional := FALSE;
  4985. 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
  4986. Expression(x.result); (* use register *)
  4987. END;
  4988. Statement(x.statement);
  4989. conditional := prevConditional;
  4990. IF x.result # NIL THEN Expression(x.result) END;
  4991. 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
  4992. ReleaseIntermediateOperand(result.op);
  4993. END;
  4994. END VisitStatementDesignator;
  4995. PROCEDURE InlineProcedureCall(x: SyntaxTree.ProcedureCallDesignator): BOOLEAN;
  4996. VAR
  4997. procedure: SyntaxTree.Procedure;
  4998. procedureType: SyntaxTree.ProcedureType;
  4999. wasInline: BOOLEAN;
  5000. actualParameters: SyntaxTree.ExpressionList;
  5001. formalParameter: SyntaxTree.Parameter;
  5002. actualParameter: SyntaxTree.Expression;
  5003. i: LONGINT;
  5004. localVariable: SyntaxTree.Variable;
  5005. variableDesignator, returnDesignator: SyntaxTree.Expression;
  5006. src, dest: Operand;
  5007. prevInlineExit : Label;
  5008. prevMapper: SymbolMapper;
  5009. tooComplex: BOOLEAN;
  5010. resultDesignator: SyntaxTree.Expression;
  5011. PROCEDURE SimpleExpression(e: SyntaxTree.Expression): BOOLEAN;
  5012. BEGIN
  5013. IF e = NIL THEN RETURN TRUE
  5014. ELSIF (e IS SyntaxTree.SymbolDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.SymbolDesignator).left)
  5015. ELSIF (e IS SyntaxTree.Value) THEN RETURN TRUE
  5016. ELSIF (e IS SyntaxTree.SelfDesignator) THEN RETURN TRUE
  5017. ELSIF (e IS SyntaxTree.ResultDesignator) THEN RETURN TRUE
  5018. ELSIF (e IS SyntaxTree.DereferenceDesignator) THEN RETURN SimpleExpression(e(SyntaxTree.DereferenceDesignator).left)
  5019. ELSE RETURN FALSE
  5020. END;
  5021. END SimpleExpression;
  5022. PROCEDURE FitsInRegister(type: SyntaxTree.Type): BOOLEAN;
  5023. BEGIN
  5024. RETURN checker.CanPassInRegister(type)
  5025. END FitsInRegister;
  5026. PROCEDURE GetTemp(type: SyntaxTree.Type; tryRegister: BOOLEAN): SyntaxTree.Expression;
  5027. VAR
  5028. variable: SyntaxTree.Variable;
  5029. variableDesignator: SyntaxTree.Designator;
  5030. BEGIN
  5031. variable := GetTemporaryVariable(type, tryRegister & FitsInRegister(type), FALSE (* untraced *));
  5032. variableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5033. variableDesignator.SetType(type);
  5034. RETURN variableDesignator
  5035. END GetTemp;
  5036. BEGIN
  5037. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5038. wasInline := currentIsInline;
  5039. prevInlineExit := currentInlineExit;
  5040. prevMapper := currentMapper;
  5041. currentInlineExit := NewLabel();
  5042. tooComplex := FALSE;
  5043. NEW(currentMapper);
  5044. currentIsInline := TRUE;
  5045. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5046. procedureType := procedure.type(SyntaxTree.ProcedureType);
  5047. formalParameter := procedureType.firstParameter;
  5048. actualParameters := x.parameters;
  5049. i := 0;
  5050. WHILE (i < actualParameters.Length()) & ~tooComplex DO
  5051. actualParameter := actualParameters.GetExpression(i);
  5052. IF actualParameter.resolved # NIL THEN
  5053. actualParameter := actualParameter.resolved
  5054. END;
  5055. (*
  5056. if expression is simple and can be passed immediately
  5057. or if type fits in register then we can proceed
  5058. otherwise we escape to ordinary procedure call.
  5059. *)
  5060. (* cases where the expression can be mapped identically *)
  5061. IF SimpleExpression(actualParameter) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.VarParameter}) THEN
  5062. currentMapper.Add(formalParameter, actualParameter, NIL,FALSE);
  5063. ELSIF FitsInRegister(actualParameter.type) & (formalParameter.kind IN {SyntaxTree.ConstParameter, SyntaxTree.ValueParameter}) THEN
  5064. variableDesignator := GetTemp(formalParameter.type, TRUE);
  5065. (*
  5066. Assign(variableDesignator, actualParameter);
  5067. *)
  5068. Evaluate(actualParameter, src);
  5069. Designate(variableDesignator, dest);
  5070. Emit(Mov(x.position, dest.op, src.op));
  5071. ReleaseOperand(dest);
  5072. ReleaseOperand(src);
  5073. (* the src operand should now have been completely released ! *)
  5074. currentMapper.Add(formalParameter, variableDesignator, NIL, FALSE);
  5075. ELSE tooComplex := TRUE
  5076. END;
  5077. (*
  5078. ELSIF (formalParameter.kind = SyntaxTree.ConstParameter) & IsSimple(actualParameter) THEN
  5079. currentMapper.Add(formalParameter, actualParameter, NIL);
  5080. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) OR formalParameter.type.IsComposite() & (formalParameter.kind = SyntaxTree.ConstParameter) THEN
  5081. variableDesignator := GetTemp(system.addressType, FALSE);
  5082. Designate(actualParameter, src);
  5083. Designate(variableDesignator, dest);
  5084. IntermediateCode.MakeMemory(dest.op,addressType);
  5085. Emit(Mov(x.position, dest.op, src.op));
  5086. ReleaseOperand(dest);
  5087. IF src.tag.mode # IntermediateCode.Undefined THEN
  5088. tagDesignator := GetTemp(system.addressType, FALSE);
  5089. Designate(tagDesignator, dest);
  5090. IntermediateCode.MakeMemory(dest.op,addressType);
  5091. Emit(Mov(x.position, dest.op, src.op));
  5092. END;
  5093. ReleaseOperand(dest); ReleaseOperand(src);
  5094. currentMapper.Add(formalParameter, variableDesignator, tagDesignator);
  5095. END;
  5096. *)
  5097. formalParameter := formalParameter.nextParameter;
  5098. INC(i);
  5099. END;
  5100. IF ~tooComplex & (procedureType.returnType # NIL) THEN
  5101. IF resultDesignator # NIL THEN
  5102. returnDesignator := resultDesignator
  5103. ELSE
  5104. returnDesignator := GetTemp(procedureType.returnType, TRUE);
  5105. END;
  5106. currentMapper.Add(NIL, returnDesignator, NIL, resultDesignator # NIL);
  5107. END;
  5108. localVariable := procedure.procedureScope.firstVariable;
  5109. WHILE ~tooComplex & (localVariable # NIL) DO
  5110. variableDesignator := GetTemp(localVariable.type, FALSE);
  5111. currentMapper.Add(localVariable, variableDesignator, NIL, FALSE);
  5112. localVariable := localVariable.nextVariable;
  5113. END;
  5114. IF ~tooComplex THEN
  5115. VisitStatementBlock(procedure.procedureScope.body);
  5116. SetLabel(currentInlineExit);
  5117. IF procedureType.returnType # NIL THEN
  5118. Designate(returnDesignator, result);
  5119. IF conditional THEN
  5120. ASSERT (procedureType.returnType.resolved IS SyntaxTree.BooleanType);
  5121. ValueToCondition(result)
  5122. END;
  5123. END;
  5124. END;
  5125. currentMapper := prevMapper;
  5126. currentInlineExit := prevInlineExit;
  5127. currentIsInline := wasInline;
  5128. RETURN ~tooComplex
  5129. END InlineProcedureCall;
  5130. PROCEDURE VisitProcedureCallDesignator*(x: SyntaxTree.ProcedureCallDesignator);
  5131. VAR
  5132. parameters: SyntaxTree.ExpressionList;
  5133. d, resultDesignator, actualParameter: SyntaxTree.Expression;
  5134. designator: SyntaxTree.Designator;
  5135. procedureType: SyntaxTree.ProcedureType;
  5136. formalParameter: SyntaxTree.Parameter;
  5137. operand, returnValue: Operand;
  5138. reg, size, mask, dest: IntermediateCode.Operand;
  5139. saved,saved2: RegisterEntry;
  5140. symbol: SyntaxTree.Symbol;
  5141. variable: SyntaxTree.Variable;
  5142. i, parametersSize, returnTypeSize : LONGINT;
  5143. structuredReturnType: BOOLEAN;
  5144. firstWriteBackCall, currentWriteBackCall: WriteBackCall;
  5145. tempVariableDesignator: SyntaxTree.Designator;
  5146. gap, alignment: LONGINT; (*fld*)
  5147. (* TODO: remove unnecessary backup variables *)
  5148. oldResult: Operand;
  5149. oldCurrentScope: SyntaxTree.Scope;
  5150. oldArrayDestinationTag: IntermediateCode.Operand;
  5151. oldArrayDestinationDimension: LONGINT;
  5152. oldConstantDeclaration: SyntaxTree.Symbol;
  5153. oldDestination: IntermediateCode.Operand;
  5154. oldCurrentLoop: Label;
  5155. oldConditional: BOOLEAN;
  5156. oldTrueLabel, oldFalseLabel: Label;
  5157. oldLocked: BOOLEAN;
  5158. usedRegisters,oldUsedRegisters: RegisterEntry;
  5159. return: IntermediateCode.Operand;
  5160. parameterBackups: ARRAY 2 OF IntermediateCode.Operand;
  5161. arg: IntermediateCode.Operand;
  5162. dummy: IntermediateCode.Operand;
  5163. recordType: SyntaxTree.RecordType;
  5164. operatorSelectionProcedureOperand: Operand;
  5165. operatorSelectionProcedure: SyntaxTree.Procedure;
  5166. fingerPrint: SyntaxTree.FingerPrint;
  5167. isCallOfDynamicOperator, hasDynamicOperands: BOOLEAN;
  5168. identifierNumber: LONGINT;
  5169. parameterRegisters: SIZE;
  5170. passByRegister: BOOLEAN; registerNumber,stackSize: LONGINT;
  5171. procedure: SyntaxTree.Procedure;
  5172. callingConvention: SyntaxTree.CallingConvention;
  5173. PROCEDURE BackupGlobalState;
  5174. BEGIN
  5175. oldResult := result;
  5176. oldCurrentScope := currentScope;
  5177. oldArrayDestinationTag := arrayDestinationTag;
  5178. oldArrayDestinationDimension := arrayDestinationDimension;
  5179. oldConstantDeclaration := constantDeclaration;
  5180. oldDestination := destination;
  5181. oldCurrentLoop := currentLoop;
  5182. oldConditional := conditional;
  5183. oldTrueLabel := trueLabel;
  5184. oldFalseLabel := falseLabel;
  5185. oldLocked := locked;
  5186. oldUsedRegisters := usedRegisters
  5187. END BackupGlobalState;
  5188. PROCEDURE RestoreGlobalState;
  5189. BEGIN
  5190. result := oldResult;
  5191. currentScope := oldCurrentScope;
  5192. arrayDestinationTag := oldArrayDestinationTag;
  5193. arrayDestinationDimension := oldArrayDestinationDimension;
  5194. constantDeclaration := oldConstantDeclaration;
  5195. destination := oldDestination;
  5196. currentLoop := oldCurrentLoop;
  5197. conditional := oldConditional;
  5198. trueLabel := oldTrueLabel;
  5199. falseLabel := oldFalseLabel;
  5200. locked := oldLocked;
  5201. usedRegisters := oldUsedRegisters
  5202. END RestoreGlobalState;
  5203. (** do preparations before parameter push for array-structured object types (ASOTs):
  5204. if ASOT is passed as VAR parameter:
  5205. - allocate temporary variable of math array type
  5206. - copy contents of ASOT to be passed to temporary variable
  5207. - use temporary variable as the actual parameter instead
  5208. - 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)
  5209. **)
  5210. PROCEDURE PrepareParameter(VAR actualParameter: SyntaxTree.Expression; formalParameter: SyntaxTree.Parameter);
  5211. VAR
  5212. expression: SyntaxTree.Expression;
  5213. BEGIN
  5214. IF actualParameter IS SyntaxTree.Designator THEN
  5215. designator := actualParameter(SyntaxTree.Designator);
  5216. IF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) & (actualParameter.type.resolved IS SyntaxTree.MathArrayType) THEN
  5217. (* actual parameter is an index read operator call on ASOT and formal parameter is of VAR kind *)
  5218. (* IF dump # NIL THEN dump.String("!!! BEGIN ASOT VAR parameter preparation"); dump.Ln; dump.Update END; *) (* TENTATIVE*)
  5219. ASSERT(checker # NIL);
  5220. checker.SetCurrentScope(currentScope);
  5221. (* allocate temporary variable *)
  5222. ASSERT(actualParameter.type # NIL);
  5223. ASSERT(actualParameter.type.resolved IS SyntaxTree.MathArrayType);
  5224. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5225. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5226. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5227. ASSERT(tempVariableDesignator IS SyntaxTree.SymbolDesignator);
  5228. ASSERT(tempVariableDesignator.type # NIL);
  5229. ASSERT(tempVariableDesignator.type.resolved IS SyntaxTree.MathArrayType);
  5230. (* copy math array stored in actual parameter to temporary variable *)
  5231. BackupGlobalState;
  5232. AssignMathArray(tempVariableDesignator, actualParameter);
  5233. RestoreGlobalState;
  5234. (* use temporary variable as actual parameter instead of the original one *)
  5235. actualParameter := tempVariableDesignator;
  5236. (* create write-back call and store it in linked list *)
  5237. (* create new list entry *)
  5238. IF firstWriteBackCall = NIL THEN
  5239. NEW(firstWriteBackCall);
  5240. currentWriteBackCall := firstWriteBackCall
  5241. ELSE
  5242. ASSERT(currentWriteBackCall # NIL);
  5243. NEW(currentWriteBackCall.next);
  5244. currentWriteBackCall := currentWriteBackCall.next
  5245. END;
  5246. expression := checker.NewIndexOperatorCall(Basic.invalidPosition, designator.relatedAsot, designator.relatedIndexList, tempVariableDesignator);
  5247. ASSERT(expression.type = NIL);
  5248. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5249. ELSIF (formalParameter.kind = SyntaxTree.VarParameter) & (designator.relatedAsot # NIL) THEN
  5250. (* prepare writeback for any other "normal" indexer *)
  5251. variable := GetTemporaryVariable(actualParameter.type.resolved, FALSE, TRUE (* untraced *));
  5252. tempVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, variable);
  5253. tempVariableDesignator.SetType(actualParameter.type.resolved);
  5254. Assign(tempVariableDesignator, actualParameter);
  5255. actualParameter := tempVariableDesignator;
  5256. IF firstWriteBackCall = NIL THEN
  5257. NEW(firstWriteBackCall);
  5258. currentWriteBackCall := firstWriteBackCall
  5259. ELSE
  5260. ASSERT(currentWriteBackCall # NIL);
  5261. NEW(currentWriteBackCall.next);
  5262. currentWriteBackCall := currentWriteBackCall.next
  5263. END;
  5264. expression := checker.NewObjectOperatorCall(Basic.invalidPosition, designator.relatedAsot, 0, designator.relatedIndexList, tempVariableDesignator);
  5265. currentWriteBackCall.call := expression(SyntaxTree.ProcedureCallDesignator);
  5266. END
  5267. END
  5268. END PrepareParameter;
  5269. BEGIN
  5270. IF Trace THEN TraceEnter("VisitProcedureCallDesignator") END;
  5271. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Procedure) THEN
  5272. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  5273. IF procedure.isOberonInline (* & (procedure.scope.ownerModule = module.module) *) THEN
  5274. IF InlineProcedureCall(x) THEN
  5275. RETURN
  5276. ELSE
  5277. Warning(x.position, "Inline call with complex parameters not yet implemented. Emitting ordinary procedure call.")
  5278. END
  5279. END;
  5280. END;
  5281. resultDesignator := procedureResultDesignator; procedureResultDesignator := NIL;
  5282. procedureType := x.left.type.resolved(SyntaxTree.ProcedureType);
  5283. callingConvention := procedureType.callingConvention;
  5284. dest := destination; destination := emptyOperand;
  5285. SaveRegisters();ReleaseUsedRegisters(saved);
  5286. parameters := x.parameters;
  5287. IF (x.left IS SyntaxTree.SymbolDesignator) & (x.left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Operator) THEN
  5288. (* an operator is called *)
  5289. (* IF dump # NIL THEN dump.String("*** begin of operator call ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5290. ASSERT(callingConvention = SyntaxTree.OberonCallingConvention);
  5291. (* check if a dynamic operator call should be performed *)
  5292. isCallOfDynamicOperator := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Operator).isDynamic;
  5293. ELSE
  5294. isCallOfDynamicOperator := FALSE
  5295. END;
  5296. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5297. Emit(Push(position, ap));
  5298. END;
  5299. alignment := procedureType.stackAlignment;
  5300. IF (callingConvention IN SysvABIorWINAPI) & (system.addressSize = 64) THEN
  5301. alignment := 16 (* bytes *);
  5302. END;
  5303. IF alignment > 1 THEN
  5304. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5305. Emit(Mov(position,reg, sp));
  5306. gap := ParametersSize(system, procedureType,FALSE); (* account for all parameters being pushed *)
  5307. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & (system.addressSize =64) THEN
  5308. IF gap < 4*ToMemoryUnits(system,system.addressSize) THEN (* in WINAPI 64bit there is at least space for four registers on the stack *)
  5309. gap := 4*ToMemoryUnits(system,system.addressSize);
  5310. END;
  5311. ELSIF (callingConvention IN SysvABI) & (system.addressSize =64) THEN
  5312. gap := gap - 6*ToMemoryUnits(system,system.addressSize); (* the first 6 parameters are passed via registers in SysVABI *)
  5313. IF gap < 0 THEN
  5314. gap := 0
  5315. END;
  5316. ELSE
  5317. gap := gap + ToMemoryUnits(system,system.offsetFirstParameter) (* Oberon CC: alignment at the BP in the stack frame *)
  5318. END;
  5319. gap := gap + ToMemoryUnits(system,system.addressSize); (* account for the additionally pushed stack pointer in any case *)
  5320. Emit(Sub(position,sp, sp, IntermediateCode.Immediate(addressType,gap)));
  5321. IntermediateCode.InitImmediate(mask,addressType,-alignment);
  5322. Emit(And(position,sp, sp, mask));
  5323. Emit(Add(position, sp, sp, IntermediateCode.Immediate(addressType, gap)));
  5324. Emit(Push(position,reg));
  5325. ReleaseIntermediateOperand(reg);
  5326. END;
  5327. IF (callingConvention IN SysvABI) & (system.addressSize = 32) THEN
  5328. (* align stack to 16-byte boundary *)
  5329. IntermediateCode.InitImmediate(mask,addressType,-16);
  5330. Emit(And(position,sp, sp, mask));
  5331. gap := (-ParametersSize( system, procedureType, FALSE )) MOD 16;
  5332. IF gap # 0 THEN
  5333. IntermediateCode.InitImmediate(size,addressType,gap);
  5334. Emit(Sub(position,sp,sp,size))
  5335. END;
  5336. END;
  5337. IF x.left IS SyntaxTree.SupercallDesignator THEN
  5338. symbol := x.left(SyntaxTree.SupercallDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5339. ELSIF x.left IS SyntaxTree.IndexDesignator THEN
  5340. symbol := x.left(SyntaxTree.IndexDesignator).left(SyntaxTree.SymbolDesignator).symbol;
  5341. ELSE
  5342. symbol := x.left(SyntaxTree.SymbolDesignator).symbol;
  5343. END;
  5344. Evaluate(x.left, operand);
  5345. IF symbol IS SyntaxTree.Procedure THEN
  5346. IF (procedureType.selfParameter # NIL) THEN
  5347. Emit(Push(position,operand.tag));
  5348. ELSIF x.left IS SyntaxTree.SupercallDesignator THEN
  5349. Emit(Push(position,operand.tag));
  5350. ELSIF (procedureType.isDelegate) THEN
  5351. Emit(Push(position,operand.tag));
  5352. END;
  5353. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5354. IF (procedureType.selfParameter # NIL) THEN
  5355. Emit(Push(position,operand.tag));
  5356. ELSIF (procedureType.isDelegate) THEN (* push self pointer only if procedure is a method *)
  5357. Emit(Push(position,operand.tag));
  5358. END;
  5359. ELSE HALT(200);
  5360. END;
  5361. ReleaseIntermediateOperand(operand.tag);
  5362. operand.tag := emptyOperand;
  5363. (* determine if a structured return type is needed *)
  5364. structuredReturnType := SemanticChecker.StructuredReturnType(procedureType);
  5365. IF structuredReturnType THEN
  5366. IF resultDesignator # NIL THEN
  5367. d := resultDesignator;
  5368. ELSE
  5369. (* temporary result that might be allocated, must potentially be traced *)
  5370. variable := GetTemporaryVariable(procedureType.returnType, FALSE, procedureType.hasUntracedReturn);
  5371. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,variable);
  5372. d.SetType(variable.type);
  5373. END;
  5374. (*IF (procedureType.returnType.resolved IS SyntaxTree.RecordType) THEN
  5375. Designate(d,returnValue);
  5376. returnTypeSize := system.SizeOf(procedureType.returnType.resolved);
  5377. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,returnTypeSize));
  5378. Emit(Push(position,size));
  5379. Emit(Push(position,returnValue.op));
  5380. ReleaseOperand(returnValue);
  5381. ELSE*)
  5382. PushParameter(d,procedureType.returnParameter,callingConvention, FALSE, dummy,-1)
  5383. (*
  5384. END;
  5385. *)
  5386. END;
  5387. firstWriteBackCall := NIL; (* reset write-back call list *)
  5388. IF callingConvention # SyntaxTree.OberonCallingConvention THEN
  5389. parameterRegisters := backend.NumberParameterRegisters(callingConvention);
  5390. passByRegister := parameterRegisters > 0;
  5391. registerNumber := 0;
  5392. formalParameter := procedureType.lastParameter;
  5393. FOR i := parameters.Length() - 1 TO 0 BY -1 DO
  5394. actualParameter := parameters.GetExpression(i);
  5395. PrepareParameter(actualParameter, formalParameter);
  5396. IF passByRegister & (i < parameterRegisters) THEN
  5397. IF ~PassInRegister(formalParameter,callingConvention) THEN
  5398. Error(actualParameter.position,"cannot be passed by register")
  5399. ELSE
  5400. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,i);
  5401. END;
  5402. INC(registerNumber);
  5403. ELSE
  5404. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5405. END;
  5406. formalParameter := formalParameter.prevParameter;
  5407. END;
  5408. IF passByRegister (* & (registerNumber > 0)*) & ~(callingConvention IN SysvABI) THEN
  5409. (* WINAPI: always (!) reserve 4 addresses for fastcall registers *)
  5410. stackSize := ToMemoryUnits(system,parameterRegisters*addressType.sizeInBits);
  5411. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5412. END;
  5413. ELSE
  5414. hasDynamicOperands := FALSE;
  5415. formalParameter := procedureType.firstParameter;
  5416. FOR i := 0 TO parameters.Length() - 1 DO
  5417. actualParameter := parameters.GetExpression(i);
  5418. IF formalParameter # NIL THEN (* TENTATIVE *)
  5419. PrepareParameter(actualParameter, formalParameter);
  5420. IF isCallOfDynamicOperator & IsStrictlyPointerToRecord(formalParameter.type) & (formalParameter.access # SyntaxTree.Hidden) THEN (* TODO: remove hidden parameters *)
  5421. ASSERT(i < 2);
  5422. hasDynamicOperands := TRUE;
  5423. PushParameter(actualParameter, formalParameter, callingConvention, TRUE, parameterBackups[i],-1)
  5424. ELSE
  5425. IF passByRegister & (registerNumber > 0) THEN
  5426. stackSize := ToMemoryUnits(system,registerNumber*addressType.sizeInBits);
  5427. Emit(Sub(position,sp,sp,IntermediateCode.Immediate(addressType,stackSize)));
  5428. END;
  5429. passByRegister := FALSE;
  5430. PushParameter(actualParameter, formalParameter, callingConvention, FALSE, dummy,-1);
  5431. END;
  5432. formalParameter := formalParameter.nextParameter;
  5433. END;
  5434. END;
  5435. END;
  5436. IF symbol IS SyntaxTree.Procedure THEN
  5437. IF IsNested(symbol(SyntaxTree.Procedure)) THEN
  5438. GetBaseRegister(reg,currentScope,symbol.scope); (* static link, may be fp or [fp+8] (if nested proc calls itself) *)
  5439. Emit(Push(position,reg));
  5440. ReleaseIntermediateOperand(reg);
  5441. END;
  5442. parametersSize := ProcParametersSize(symbol(SyntaxTree.Procedure));
  5443. ELSIF (symbol IS SyntaxTree.Variable) OR (symbol IS SyntaxTree.Parameter) THEN
  5444. parametersSize := ParametersSize(system,procedureType, FALSE);
  5445. END;
  5446. IF isCallOfDynamicOperator & hasDynamicOperands THEN
  5447. (*
  5448. dynamic operator overloading:
  5449. first push parameters, regularly:
  5450. [self]
  5451. par1
  5452. par2
  5453. then push parameters for GetOperator
  5454. identifier
  5455. ptr1
  5456. tag
  5457. ptr2
  5458. tag
  5459. call GetOperatorRuntimeProc
  5460. call Operator
  5461. *)
  5462. IF dump # NIL THEN dump.String("++++++++++ dynamic operator call ++++++++++"); dump.Ln; dump.Update END; (* TENTATIVE *)
  5463. (* push ID *)
  5464. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5465. ASSERT(x.left IS SyntaxTree.SymbolDesignator);
  5466. identifierNumber := Global.GetSymbol(module.module.case, x.left(SyntaxTree.SymbolDesignator).symbol.name);
  5467. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), identifierNumber)));
  5468. formalParameter := procedureType.firstParameter;
  5469. FOR i := 0 TO parameters.Length() - 1 DO
  5470. IF formalParameter.access # SyntaxTree.Hidden THEN
  5471. ASSERT(i < 2);
  5472. IF IsStrictlyPointerToRecord(formalParameter.type) THEN
  5473. (* push pointer *)
  5474. (* IF dump # NIL THEN dump.String("push pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5475. IF formalParameter.kind = SyntaxTree.VarParameter THEN
  5476. (* add dereference *)
  5477. (* IF dump # NIL THEN dump.String("dereference pointer"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5478. (*! better: do refer to stack above than using parameter backups !!*)
  5479. ReleaseIntermediateOperand(parameterBackups[i]);
  5480. MakeMemory(parameterBackups[i], parameterBackups[i], addressType, 0)
  5481. END;
  5482. Emit(Push(position,parameterBackups[i]));
  5483. ReleaseIntermediateOperand(parameterBackups[i]);
  5484. (* push typetag *)
  5485. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5486. recordType := formalParameter.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5487. arg := TypeDescriptorAdr(recordType);
  5488. Emit(Push(position,arg));
  5489. ELSE
  5490. (* push 'NonPointer' *)
  5491. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5492. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5493. (* push fingerprint *)
  5494. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5495. fingerPrint := fingerPrinter.TypeFP(formalParameter.type.resolved);
  5496. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public))) (* TODO: push the type's fingerprint *)
  5497. END
  5498. END;
  5499. formalParameter := formalParameter.nextParameter
  5500. END;
  5501. (* for unary operators: complete the information for the second parameter *)
  5502. IF procedureType.numberParameters < 2 THEN
  5503. (* push 'NonPointer' *)
  5504. (* IF dump # NIL THEN dump.String("push 'NonPointer'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5505. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NonPointer)));
  5506. (* push 'NoType' *)
  5507. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5508. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)));
  5509. END;
  5510. (* call operator selection procedure *)
  5511. IF GetRuntimeProcedure("FoxOperatorRuntime", "SelectOperator", operatorSelectionProcedure, TRUE) THEN
  5512. StaticCallOperand(operatorSelectionProcedureOperand, operatorSelectionProcedure);
  5513. Emit(Call(position,operatorSelectionProcedureOperand.op, ProcParametersSize( operatorSelectionProcedure)));
  5514. ReleaseOperand(operatorSelectionProcedureOperand);
  5515. (* use the address that the operator selection procedure returned as the target address of the call *)
  5516. InitOperand(operand, ModeValue);
  5517. operand.op := IntermediateCode.Register(addressType, IntermediateCode.GeneralPurposeRegister, AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  5518. Emit(Result(position,operand.op))
  5519. END
  5520. END;
  5521. ReleaseParameterRegisters();
  5522. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5523. SaveRegisters();ReleaseUsedRegisters(saved2);
  5524. CallThis(position,"Objects","LeaveA2",0);
  5525. RestoreRegisters(saved2);
  5526. END;
  5527. IF (callingConvention = SyntaxTree.WinAPICallingConvention) OR (callingConvention IN SysvABI) THEN
  5528. Emit(Call(position,operand.op,0));
  5529. ELSE
  5530. Emit(Call(position,operand.op,parametersSize));
  5531. END;
  5532. ReleaseOperand(operand);
  5533. IF procedureType.noReturn THEN
  5534. EmitTrap(position,NoReturnTrap);
  5535. END;
  5536. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5537. return := NewRegisterOperand(IntermediateCode.GetType(system,procedureType.returnType));
  5538. Emit(Result(position,return));
  5539. END;
  5540. IF ~(symbol IS SyntaxTree.Procedure) & backend.trackLeave & ~isUnchecked & (callingConvention IN {SyntaxTree.WinAPICallingConvention, SyntaxTree.CCallingConvention}) THEN
  5541. IF (procedureType.returnType # NIL) & ~structuredReturnType THEN
  5542. Emit(Push(position, return));
  5543. CallThis(position,"Objects","ReenterA2",0);
  5544. Emit(Pop(position, return));
  5545. ELSE
  5546. CallThis(position,"Objects","ReenterA2",0);
  5547. END;
  5548. END;
  5549. (* === return parameter space === *)
  5550. IF (callingConvention = SyntaxTree.WinAPICallingConvention) & passByRegister (* & (registerNumber > 0) *) THEN
  5551. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5552. (* cleanup all space for all parameters *)
  5553. IF parametersSize < 32 THEN
  5554. (* allocated space for all parameter registers -- this is the least we have to cleanup *)
  5555. parametersSize := 32
  5556. END;
  5557. size := IntermediateCode.Immediate(addressType,parametersSize);
  5558. Emit(Add(position,sp,sp,size))
  5559. END;
  5560. IF (callingConvention IN SysvABI) THEN
  5561. IF passByRegister THEN
  5562. IF parameters.Length() > parameterRegisters THEN
  5563. parametersSize := ToMemoryUnits(system,(parameters.Length()-parameterRegisters)*addressType.sizeInBits)
  5564. ELSE
  5565. parametersSize := 0
  5566. END;
  5567. ELSE
  5568. parametersSize := ToMemoryUnits(system,parameters.Length()*addressType.sizeInBits);
  5569. INC( parametersSize, (-parametersSize) MOD 16 )
  5570. END;
  5571. IF parametersSize > 0 THEN
  5572. size := IntermediateCode.Immediate(addressType,parametersSize);
  5573. Emit(Add(position,sp,sp,size))
  5574. END;
  5575. END;
  5576. IF (resultDesignator = NIL) & (procedureType.returnType # NIL) THEN
  5577. IF structuredReturnType THEN
  5578. (* stack pointer rewinding done by callee
  5579. size := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOfParameter(procedureType.returnParameter)));
  5580. Emit(Add(position,sp,sp,size));
  5581. *)
  5582. RestoreRegisters(saved);
  5583. InitOperand(result,ModeReference);
  5584. Symbol(variable,result);
  5585. ELSE
  5586. RestoreRegisters(saved);
  5587. InitOperand(result,ModeValue);
  5588. result.op := return;
  5589. END;
  5590. END;
  5591. IF alignment > 1 THEN
  5592. Emit(Pop(position,sp));
  5593. END;
  5594. IF backend.cooperative & (callingConvention = SyntaxTree.WinAPICallingConvention) THEN
  5595. Emit(Pop(position, ap));
  5596. END;
  5597. IF conditional & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.BooleanType) THEN
  5598. ValueToCondition(result);
  5599. END;
  5600. destination := dest;
  5601. (* perform all write-back calls in the list *)
  5602. BackupGlobalState;
  5603. currentWriteBackCall := firstWriteBackCall;
  5604. WHILE currentWriteBackCall # NIL DO
  5605. VisitProcedureCallDesignator(currentWriteBackCall.call);
  5606. currentWriteBackCall := currentWriteBackCall.next
  5607. END;
  5608. RestoreGlobalState;
  5609. (* TENATIVE *)
  5610. (*
  5611. IF isOperatorCall THEN
  5612. IF dump # NIL THEN dump.String("*** end of operator call ***"); dump.Ln; dump.Update END
  5613. END;
  5614. *)
  5615. IF Trace THEN TraceExit("VisitProcedureCallDesignator") END;
  5616. END VisitProcedureCallDesignator;
  5617. PROCEDURE TypeDescriptorAdr(t: SyntaxTree.Type): IntermediateCode.Operand;
  5618. VAR res: IntermediateCode.Operand; offset: LONGINT; name: Basic.SegmentedName;
  5619. td: SyntaxTree.Symbol;
  5620. PROCEDURE GetHiddenPointerType(): SyntaxTree.Type;
  5621. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5622. BEGIN
  5623. IF (hiddenPointerType = NIL) OR (hiddenPointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5624. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5625. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5626. variable.SetType(system.anyType);
  5627. scope.AddVariable(variable);
  5628. hiddenPointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5629. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@HdPtrDesc"));
  5630. typeDeclaration.SetDeclaredType(hiddenPointerType);
  5631. typeDeclaration.SetScope(module.module.moduleScope);
  5632. hiddenPointerType.SetTypeDeclaration(typeDeclaration);
  5633. hiddenPointerType.SetState(SyntaxTree.Resolved);
  5634. END;
  5635. RETURN hiddenPointerType;
  5636. END GetHiddenPointerType;
  5637. PROCEDURE GetDelegateType(): SyntaxTree.Type;
  5638. VAR scope: SyntaxTree.RecordScope; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration;
  5639. BEGIN
  5640. IF (delegatePointerType = NIL) OR (delegatePointerType.typeDeclaration.scope.ownerModule # module.module) THEN
  5641. scope := SyntaxTree.NewRecordScope(module.module.moduleScope);
  5642. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Procedure"));
  5643. variable.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,NIL));
  5644. scope.AddVariable(variable);
  5645. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Any"));
  5646. variable.SetType(system.anyType);
  5647. scope.AddVariable(variable);
  5648. delegatePointerType := SyntaxTree.NewRecordType(Basic.invalidPosition,NIL,scope);
  5649. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier("@Delegate"));
  5650. typeDeclaration.SetDeclaredType(delegatePointerType);
  5651. typeDeclaration.SetScope(module.module.moduleScope);
  5652. delegatePointerType.SetTypeDeclaration(typeDeclaration);
  5653. delegatePointerType.SetState(SyntaxTree.Resolved);
  5654. END;
  5655. RETURN delegatePointerType
  5656. END GetDelegateType;
  5657. PROCEDURE GetBackendType(x: SyntaxTree.Type; VAR offset: LONGINT; VAR name: Basic.SegmentedName): SyntaxTree.Symbol;
  5658. (* create anonymous type declaration for types that need a type descriptor but have been declared anonymously
  5659. such as in VAR a: RECORD ... END;
  5660. reason: type desciptors in Sections are then accessible via a type declaration symbol and for types
  5661. and variables, constants and procedures the same mechanism can be used for fixups etc.
  5662. *)
  5663. VAR source: Sections.Section;null: HUGEINT; td: SyntaxTree.TypeDeclaration;
  5664. op: IntermediateCode.Operand; baseRecord: SyntaxTree.RecordType;
  5665. BEGIN (* no code emission *)
  5666. source := NIL;
  5667. x := x.resolved;
  5668. IF (x IS SyntaxTree.AnyType) OR (x IS SyntaxTree.PointerType) THEN
  5669. x := GetHiddenPointerType();
  5670. ELSIF IsDelegate(x) THEN
  5671. x := GetDelegateType();
  5672. ELSIF (x IS SyntaxTree.RecordType) OR (x IS SyntaxTree.CellType) THEN
  5673. ELSE HALT(200);
  5674. END;
  5675. td := x.typeDeclaration;
  5676. IF td = NIL THEN
  5677. ASSERT(x(SyntaxTree.RecordType).pointerType # NIL);
  5678. td := x(SyntaxTree.RecordType).pointerType.resolved.typeDeclaration;
  5679. ASSERT(td # NIL);
  5680. END;
  5681. GetCodeSectionNameForSymbol(td,name);
  5682. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  5683. meta.CheckTypeDeclaration(x);
  5684. source := NewSection(module.allSections, Sections.ConstSection, name,td,commentPrintout # NIL);
  5685. ELSE
  5686. source := NewSection(module.importedSections, Sections.ConstSection,name,td,commentPrintout # NIL);
  5687. END;
  5688. IF backend.cooperative OR meta.simple THEN
  5689. offset := 0;
  5690. ELSE
  5691. IF x IS SyntaxTree.CellType THEN
  5692. baseRecord := x(SyntaxTree.CellType).GetBaseRecord();
  5693. IF baseRecord = NIL THEN
  5694. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(0));
  5695. ELSE
  5696. offset := ToMemoryUnits(system, meta.GetTypeRecordBaseOffset(baseRecord.recordScope.numberMethods)*system.addressSize);
  5697. END;
  5698. ELSE
  5699. offset := ToMemoryUnits(system,meta.GetTypeRecordBaseOffset(x(SyntaxTree.RecordType).recordScope.numberMethods)*system.addressSize);
  5700. END;
  5701. END;
  5702. RETURN td
  5703. END GetBackendType;
  5704. BEGIN
  5705. (*td := t.typeDeclaration;*)
  5706. td := GetBackendType(t,offset,name); (*! do not dereference a pointer here as the type descriptor for the pointer might be asked for *)
  5707. (*
  5708. IF t IS SyntaxTree.PointerType THEN
  5709. source := GetBackendType(t(SyntaxTree.PointerType).pointerBase.resolved);
  5710. ELSE
  5711. source := GetBackendType(t);
  5712. END;
  5713. *)
  5714. IntermediateCode.InitAddress(res, addressType, name, GetFingerprint(td), 0 (*
  5715. 1+t(SyntaxTree.RecordType).recordScope.numberMethods+16+1 *));
  5716. IntermediateCode.SetOffset(res,offset);
  5717. (*
  5718. IntermediateCode.MakeMemory(res,IntermediateCode.UnsignedInteger,addressType.sizeInBits);
  5719. make memory should be used when tag is used, not earlier
  5720. *)
  5721. RETURN res
  5722. END TypeDescriptorAdr;
  5723. (*
  5724. PROCEDURE MakeTypeTag(VAR operand: Operand);
  5725. VAR result: IntermediateCode.Operand;
  5726. BEGIN
  5727. IF operand.tag.mode = IntermediateCode.Undefined THEN
  5728. operand.tag := TypeDescriptorAdr(operand.type);
  5729. IntermediateCode.MakeMemory(operand.tag,addressType);
  5730. UseIntermediateOperand(operand.tag);
  5731. END;
  5732. END MakeTypeTag;
  5733. *)
  5734. PROCEDURE ProfilerInit;
  5735. VAR reg: IntermediateCode.Operand;
  5736. BEGIN
  5737. IntermediateCode.InitAddress(reg, addressType, profileInit.name , GetFingerprint(profileInit.symbol), 0);
  5738. Emit(Call(position,reg,0));
  5739. END ProfilerInit;
  5740. PROCEDURE ProfilerEnterExit(procedureNumber: LONGINT; enter: BOOLEAN);
  5741. VAR reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure;
  5742. BEGIN
  5743. IF enter & GetRuntimeProcedure("FoxProfiler","EnterProcedure",procedure,TRUE)
  5744. OR ~enter & GetRuntimeProcedure("FoxProfiler","ExitProcedure",procedure,TRUE)
  5745. THEN
  5746. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5747. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5748. Emit(Push(position,reg));
  5749. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5750. Emit(Push(position,reg));
  5751. StaticCallOperand(result,procedure);
  5752. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5753. ReleaseOperand(result);
  5754. END;
  5755. END ProfilerEnterExit;
  5756. PROCEDURE ProfilerAddProcedure(procedureNumber: LONGINT; CONST name: ARRAY OF CHAR);
  5757. VAR string: SyntaxTree.String; reg: IntermediateCode.Operand; result: Operand; procedure: SyntaxTree.Procedure; sv: SyntaxTree.StringValue;type: SyntaxTree.Type;
  5758. BEGIN
  5759. IF GetRuntimeProcedure("FoxProfiler","AddProcedure",procedure,TRUE) THEN
  5760. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5761. IntermediateCode.MakeMemory(reg, IntermediateCode.GetType(system,system.longintType));
  5762. profileInit.Emit(Push(position,reg));
  5763. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), procedureNumber);
  5764. profileInit.Emit(Push(position,reg));
  5765. NEW(string, LEN(name)); COPY(name, string^);
  5766. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5767. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5768. sv.SetType(type);
  5769. Designate(sv,result);
  5770. profileInit.Emit(Push(position,result.tag));
  5771. profileInit.Emit(Push(position,result.op));
  5772. StaticCallOperand(result,procedure);
  5773. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5774. ReleaseOperand(result);
  5775. END;
  5776. END ProfilerAddProcedure;
  5777. PROCEDURE ProfilerAddModule(CONST name: ARRAY OF CHAR);
  5778. VAR string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type; result: Operand; reg: IntermediateCode.Operand; procedure: SyntaxTree.Procedure;
  5779. BEGIN
  5780. IF GetRuntimeProcedure("FoxProfiler","AddModule",procedure,TRUE) THEN
  5781. IntermediateCode.InitAddress(reg, addressType, profileId.name , GetFingerprint(profileId.symbol), 0);
  5782. profileInit.Emit(Push(position,reg));
  5783. profileInitPatchPosition := profileInit.pc;
  5784. profileInit.Emit(Nop(position)); (* placeholder, will be patched by number of procedures *)
  5785. NEW(string, LEN(name)); COPY(name, string^);
  5786. sv := SyntaxTree.NewStringValue(Basic.invalidPosition, string);
  5787. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(name));
  5788. sv.SetType(type);
  5789. Designate(sv,result);
  5790. profileInit.Emit(Push(position,result.tag));
  5791. profileInit.Emit(Push(position,result.op));
  5792. StaticCallOperand(result,procedure);
  5793. profileInit.Emit(Call(position,result.op,ProcParametersSize(procedure)));
  5794. ReleaseOperand(result);
  5795. END;
  5796. END ProfilerAddModule;
  5797. PROCEDURE ProfilerPatchInit;
  5798. VAR reg: IntermediateCode.Operand;
  5799. BEGIN
  5800. IntermediateCode.InitImmediate(reg, IntermediateCode.GetType(system,system.longintType), numberProcedures);
  5801. profileInit.EmitAt(profileInitPatchPosition,Push(position,reg));
  5802. EmitLeave(profileInit,position,NIL,0);
  5803. profileInit.Emit(Exit(position,0,0,0));
  5804. END ProfilerPatchInit;
  5805. (** if operator can be overloaded dynamically, emit code that registers it in the runtime **)
  5806. PROCEDURE RegisterDynamicOperator(operator: SyntaxTree.Operator);
  5807. VAR
  5808. id: LONGINT;
  5809. leftType, rightType: SyntaxTree.Type;
  5810. procedureType: SyntaxTree.ProcedureType;
  5811. runtimeProcedure: SyntaxTree.Procedure;
  5812. runtimeProcedureOperand, operatorOperand: Operand;
  5813. kind: SET;
  5814. PROCEDURE PushTypeInfo(type: SyntaxTree.Type);
  5815. VAR
  5816. arg: IntermediateCode.Operand;
  5817. recordType: SyntaxTree.RecordType;
  5818. fingerPrint: SyntaxTree.FingerPrint;
  5819. BEGIN
  5820. IF type = NIL THEN
  5821. (* no type: push 'NoType' *)
  5822. (* IF dump # NIL THEN dump.String("push 'NoType'"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5823. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), NoType)
  5824. ELSIF IsStrictlyPointerToRecord(type) THEN
  5825. (* pointer to record type: push typetag *)
  5826. (* IF dump # NIL THEN dump.String("push typetag"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5827. recordType := type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  5828. arg := TypeDescriptorAdr(recordType);
  5829. ELSE
  5830. (* non-pointer to record type: push fingerprint *)
  5831. (* IF dump # NIL THEN dump.String("push fingerprint"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5832. fingerPrint := fingerPrinter.TypeFP(type.resolved);
  5833. arg := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), fingerPrint.public)
  5834. END;
  5835. operatorInitializationCodeSection.Emit(Push(position,arg))
  5836. END PushTypeInfo;
  5837. BEGIN
  5838. ASSERT(operatorInitializationCodeSection # NIL);
  5839. ASSERT(operator.type IS SyntaxTree.ProcedureType);
  5840. procedureType := operator.type(SyntaxTree.ProcedureType);
  5841. (* determine types *)
  5842. leftType := procedureType.firstParameter.type;
  5843. IF procedureType.numberParameters = 2 THEN
  5844. ASSERT(procedureType.firstParameter.nextParameter # NIL);
  5845. rightType := procedureType.firstParameter.nextParameter.type;
  5846. ELSE
  5847. rightType := NIL
  5848. END;
  5849. (* determine operator kind *)
  5850. IF IsStrictlyPointerToRecord(leftType) THEN
  5851. kind := {LhsIsPointer}
  5852. ELSE
  5853. kind := {}
  5854. END;
  5855. IF IsStrictlyPointerToRecord(rightType) THEN
  5856. kind := kind + {RhsIsPointer}
  5857. END;
  5858. IF kind # {} THEN (* TODO: to be removed later on *)
  5859. (* at least one of the types is a pointer to record *)
  5860. (* emit a code that registers this specific operator in the runtime *)
  5861. dump := operatorInitializationCodeSection.comments;
  5862. (* IF dump # NIL THEN dump.String("*** begin of operator registration ***"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5863. IF GetRuntimeProcedure("FoxOperatorRuntime", "RegisterOperator", runtimeProcedure, TRUE) THEN
  5864. (* push ID *)
  5865. (* IF dump # NIL THEN dump.String("push ID"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5866. id := Global.GetSymbol(module.module.case, operator.name);
  5867. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system, system.longintType), id)));
  5868. (* push kind *)
  5869. (* IF dump # NIL THEN dump.String("push kind"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5870. operatorInitializationCodeSection.Emit(Push(position,IntermediateCode.Immediate(setType, SYSTEM.VAL(LONGINT, kind))));
  5871. (* push type infos *)
  5872. PushTypeInfo(leftType);
  5873. PushTypeInfo(rightType);
  5874. (* push operator address *)
  5875. (* IF dump # NIL THEN dump.String("push operator address"); dump.Ln; dump.Update END; *) (* TENTATIVE *)
  5876. StaticCallOperand(operatorOperand, operator);
  5877. operatorInitializationCodeSection.Emit(Push(position,operatorOperand.op));
  5878. ReleaseOperand(operatorOperand);
  5879. StaticCallOperand(runtimeProcedureOperand, runtimeProcedure);
  5880. operatorInitializationCodeSection.Emit(Call(position,runtimeProcedureOperand.op, ProcParametersSize( runtimeProcedure)));
  5881. ReleaseOperand(runtimeProcedureOperand)
  5882. END
  5883. (* IF dump # NIL THEN dump.String("*** end of operator registration ***"); dump.Ln; dump.Update END *) (* TENTATIVE *)
  5884. END
  5885. END RegisterDynamicOperator;
  5886. PROCEDURE SystemTrace(x: SyntaxTree.ExpressionList; pos: Position);
  5887. VAR
  5888. traceModule: SyntaxTree.Module;
  5889. procedure: SyntaxTree.Procedure;
  5890. procedureVariable: SyntaxTree.Variable;
  5891. s,msg: Basic.MessageString;
  5892. res: Operand;
  5893. i: LONGINT;
  5894. sv: SyntaxTree.StringValue;
  5895. type: SyntaxTree.Type;
  5896. recordType: SyntaxTree.RecordType;
  5897. printout: Printout.Printer;
  5898. stringWriter: Streams.StringWriter;
  5899. expression: SyntaxTree.Expression;
  5900. PROCEDURE GetProcedure(CONST procedureName: ARRAY OF CHAR): BOOLEAN;
  5901. BEGIN
  5902. procedure := traceModule.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  5903. IF procedure = NIL THEN
  5904. procedureVariable := traceModule.moduleScope.FindVariable(SyntaxTree.NewIdentifier(procedureName));
  5905. END;
  5906. IF (procedure = NIL) & (procedureVariable = NIL) THEN
  5907. s := "procedure ";
  5908. Strings.Append(s,backend.traceModuleName);
  5909. Strings.Append(s,".");
  5910. Strings.Append(s,procedureName);
  5911. Strings.Append(s," not present");
  5912. Error(position,s);
  5913. RETURN FALSE
  5914. ELSE
  5915. RETURN TRUE
  5916. END;
  5917. END GetProcedure;
  5918. PROCEDURE CallProcedure;
  5919. VAR size: LONGINT;
  5920. BEGIN
  5921. IF procedure # NIL THEN
  5922. StaticCallOperand(result,procedure);
  5923. size := ProcParametersSize(procedure);
  5924. ELSE
  5925. Symbol(procedureVariable, result);
  5926. LoadValue(result, procedureVariable.type.resolved);
  5927. size := ParametersSize(system, procedureVariable.type.resolved(SyntaxTree.ProcedureType), FALSE);
  5928. END;
  5929. Emit(Call(position,result.op,size));
  5930. END CallProcedure;
  5931. PROCEDURE String(CONST s: ARRAY OF CHAR);
  5932. VAR res: Operand; string: SyntaxTree.String;
  5933. BEGIN
  5934. IF GetProcedure("String") THEN
  5935. NEW(string, LEN(s)); COPY(s, string^);
  5936. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  5937. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  5938. sv.SetType(type);
  5939. Designate(sv,res);
  5940. Emit(Push(position,res.tag));
  5941. Emit(Push(position,res.op));
  5942. ReleaseOperand(res);
  5943. CallProcedure;
  5944. END;
  5945. END String;
  5946. PROCEDURE Integer(op: IntermediateCode.Operand);
  5947. BEGIN
  5948. IF GetProcedure("Int") THEN
  5949. Emit(Push(position,op));
  5950. Emit(Push(position,IntermediateCode.Immediate(int32,1)));
  5951. CallProcedure;
  5952. END;
  5953. END Integer;
  5954. PROCEDURE Float(op: IntermediateCode.Operand);
  5955. BEGIN
  5956. IF GetProcedure("HIntHex") THEN
  5957. Emit(Push(position,op));
  5958. Emit(Push(position,IntermediateCode.Immediate(int32,16)));
  5959. CallProcedure;
  5960. END;
  5961. END Float;
  5962. PROCEDURE Set(op: IntermediateCode.Operand);
  5963. BEGIN
  5964. IF GetProcedure("Set") THEN
  5965. Emit(Push(position,op));
  5966. (*
  5967. Emit(Push(position,IntermediateCode.Immediate(int32,0))); (* ofs *)
  5968. Emit(Push(position,IntermediateCode.Immediate(int32,32))); (* n *)
  5969. *)
  5970. CallProcedure;
  5971. END;
  5972. END Set;
  5973. PROCEDURE Boolean(op: IntermediateCode.Operand);
  5974. BEGIN
  5975. IF GetProcedure("Boolean") THEN
  5976. Emit(Push(position,op));
  5977. CallProcedure;
  5978. END;
  5979. END Boolean;
  5980. PROCEDURE Char(op: IntermediateCode.Operand);
  5981. BEGIN
  5982. IF GetProcedure("Char") THEN
  5983. Emit(Push(position,op));
  5984. CallProcedure;
  5985. END;
  5986. END Char;
  5987. PROCEDURE Address(op: IntermediateCode.Operand);
  5988. BEGIN
  5989. IF GetProcedure("Address") THEN
  5990. Emit(Push(position,op));
  5991. CallProcedure;
  5992. END;
  5993. END Address;
  5994. PROCEDURE Size(op: IntermediateCode.Operand);
  5995. BEGIN
  5996. IF GetProcedure("Size") THEN
  5997. Emit(Push(position,op));
  5998. CallProcedure;
  5999. END;
  6000. END Size;
  6001. PROCEDURE StringOperand(op: Operand; type: SyntaxTree.Type);
  6002. VAR len: IntermediateCode.Operand;
  6003. BEGIN
  6004. IF GetProcedure("String") THEN
  6005. len := GetArrayLength(type, op.tag);
  6006. Emit(Push(position,len));
  6007. ReleaseIntermediateOperand(len);
  6008. Emit(Push(position,op.op));
  6009. CallProcedure;
  6010. END;
  6011. END StringOperand;
  6012. PROCEDURE Ln;
  6013. BEGIN
  6014. IF GetProcedure("Ln") THEN
  6015. CallProcedure;
  6016. END;
  6017. END Ln;
  6018. BEGIN
  6019. IF backend.traceModuleName = "" THEN RETURN END;
  6020. IF AddImport(backend.traceModuleName,traceModule,TRUE) THEN
  6021. IF GetProcedure("Enter") THEN
  6022. CallProcedure
  6023. END;
  6024. NEW(stringWriter,LEN(s));
  6025. FOR i := 0 TO x.Length()-1 DO
  6026. msg := "";
  6027. expression := x.GetExpression(i);
  6028. IF currentScope IS SyntaxTree.ProcedureScope THEN
  6029. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, s)
  6030. ELSE
  6031. Global.GetModuleName(module.module, s);
  6032. END;
  6033. IF i = 0 THEN
  6034. stringWriter.String(s); stringWriter.String("@"); stringWriter.Int(pos.start,1);
  6035. stringWriter.String(":");
  6036. END;
  6037. printout := Printout.NewPrinter(stringWriter,Printout.SourceCode,FALSE);
  6038. IF ~(expression IS SyntaxTree.StringValue) THEN
  6039. printout.Expression(expression);
  6040. stringWriter.Get(s);
  6041. Strings.Append(msg,s);
  6042. Strings.Append(msg,"= ");
  6043. ELSE stringWriter.Get(s); (* remove from string writer *)
  6044. Strings.Append(msg, s);
  6045. END;
  6046. String(msg);
  6047. IF SemanticChecker.IsStringType(expression.type) THEN
  6048. Designate(expression,res);
  6049. StringOperand(res, expression.type);
  6050. ELSE
  6051. Evaluate(expression,res);
  6052. IF expression.type.resolved IS SyntaxTree.IntegerType THEN
  6053. IF res.op.type.sizeInBits < IntermediateCode.Bits64 THEN
  6054. Convert(res.op,int64);
  6055. END;
  6056. Integer(res.op);
  6057. ELSIF expression.type.resolved IS SyntaxTree.BooleanType THEN
  6058. Boolean(res.op);
  6059. ELSIF expression.type.resolved IS SyntaxTree.SetType THEN
  6060. Set(res.op);
  6061. ELSIF expression.type.resolved IS SyntaxTree.FloatType THEN
  6062. IF res.op.type.sizeInBits = IntermediateCode.Bits32 THEN
  6063. Convert(res.op,float64);
  6064. END;
  6065. Float(res.op);
  6066. ELSIF (expression.type.resolved IS SyntaxTree.CharacterType) & (expression.type.resolved.sizeInBits = 8) THEN
  6067. Char(res.op);
  6068. ELSIF expression.type.resolved IS SyntaxTree.AddressType THEN
  6069. Address(res.op);String("H");
  6070. ELSIF expression.type.resolved IS SyntaxTree.SizeType THEN
  6071. Size(res.op);
  6072. ELSIF (expression.type.resolved IS SyntaxTree.PointerType) OR IsPointerToRecord(expression.type,recordType) THEN
  6073. Address(res.op);String("H");
  6074. ELSIF (expression.type.resolved IS SyntaxTree.ProcedureType) THEN
  6075. Address(res.op);String("H");
  6076. ELSIF expression.type.resolved IS SyntaxTree.NilType THEN
  6077. String("NIL");
  6078. ELSE HALT(200);
  6079. END;
  6080. END;
  6081. ReleaseOperand(res);
  6082. String("; ");
  6083. END;
  6084. IF GetProcedure("Exit") THEN
  6085. CallProcedure
  6086. ELSE
  6087. Ln;
  6088. END;
  6089. END;
  6090. END SystemTrace;
  6091. PROCEDURE InitFields(type: SyntaxTree.Type; CONST adr: IntermediateCode.Operand; offset: LONGINT);
  6092. VAR baseType: SyntaxTree.Type; imm,mem: IntermediateCode.Operand; dim,size: LONGINT;
  6093. variable: SyntaxTree.Variable; i: LONGINT; initializerOp: Operand;
  6094. BEGIN
  6095. type := type.resolved;
  6096. IF type IS SyntaxTree.RecordType THEN
  6097. WITH type: SyntaxTree.RecordType DO
  6098. baseType := type.baseType;
  6099. IF baseType # NIL THEN
  6100. baseType := baseType.resolved;
  6101. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6102. InitFields(baseType,adr,offset);
  6103. END;
  6104. variable := type.recordScope.firstVariable;
  6105. WHILE variable # NIL DO
  6106. IF variable.initializer # NIL THEN
  6107. Evaluate(variable.initializer,initializerOp);
  6108. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6109. Emit(Mov(position,mem,initializerOp.op));
  6110. ReleaseOperand(initializerOp);
  6111. ReleaseIntermediateOperand(mem);
  6112. END;
  6113. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6114. variable := variable.nextVariable
  6115. END;
  6116. END;
  6117. ELSIF type IS SyntaxTree.CellType THEN
  6118. WITH type: SyntaxTree.CellType DO
  6119. baseType := type.baseType;
  6120. IF baseType # NIL THEN
  6121. baseType := baseType.resolved;
  6122. IF baseType IS SyntaxTree.PointerType THEN baseType := baseType(SyntaxTree.PointerType).pointerBase END;
  6123. InitFields(baseType,adr,offset);
  6124. END;
  6125. variable := type.cellScope.firstVariable;
  6126. WHILE variable # NIL DO
  6127. IF variable.initializer # NIL THEN
  6128. Evaluate(variable.initializer,initializerOp);
  6129. MakeMemory(mem,adr,IntermediateCode.GetType(system,variable.type),offset+ ToMemoryUnits(system,variable.offsetInBits));
  6130. Emit(Mov(position,mem,initializerOp.op));
  6131. ReleaseOperand(initializerOp);
  6132. ReleaseIntermediateOperand(mem);
  6133. END;
  6134. InitFields(variable.type, adr, offset+ ToMemoryUnits(system,variable.offsetInBits));
  6135. variable := variable.nextVariable
  6136. END;
  6137. END;
  6138. ELSIF (type IS SyntaxTree.ArrayType) THEN
  6139. WITH type: SyntaxTree.ArrayType DO
  6140. IF type.form = SyntaxTree.Static THEN
  6141. baseType := type.arrayBase;
  6142. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6143. FOR i := 0 TO type.staticLength-1 DO
  6144. InitFields(baseType,adr,offset+i*size);
  6145. END;
  6146. END;
  6147. END;
  6148. ELSIF type IS SyntaxTree.MathArrayType THEN
  6149. WITH type: SyntaxTree.MathArrayType DO
  6150. IF type.form = SyntaxTree.Open THEN
  6151. dim := DynamicDim(type);
  6152. imm := IntermediateCode.Immediate(addressType,dim);
  6153. PutMathArrayFieldOffset(adr,imm,MathDimOffset,offset);
  6154. baseType := SemanticChecker.ArrayBase(type,dim);
  6155. IF baseType = NIL THEN size := 0 ELSE size := system.AlignedSizeOf(baseType) END;
  6156. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,size));
  6157. PutMathArrayFieldOffset(adr,imm,MathElementSizeOffset,offset);
  6158. ReleaseIntermediateOperand(imm);
  6159. (* flags remain empty (=0) for open array *)
  6160. ELSIF type.form = SyntaxTree.Static THEN
  6161. baseType := type.arrayBase;
  6162. size := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  6163. ASSERT(type.staticLength < 1024*1024*1024);
  6164. FOR i := 0 TO type.staticLength-1 DO
  6165. InitFields(baseType,adr,offset+i*size);
  6166. END;
  6167. END;
  6168. END;
  6169. END;
  6170. END InitFields;
  6171. PROCEDURE InitVariable(VAR variable: SyntaxTree.Variable; temporary: BOOLEAN);
  6172. VAR type: SyntaxTree.Type; operand: Operand; tmp, mem: IntermediateCode.Operand; reference: SyntaxTree.Expression; symbol: SyntaxTree.Symbol;
  6173. saved: RegisterEntry;
  6174. BEGIN
  6175. type := variable.type.resolved;
  6176. IF (type IS SyntaxTree.MathArrayType) THEN
  6177. WITH type: SyntaxTree.MathArrayType DO
  6178. IF type.form = SyntaxTree.Open THEN
  6179. Symbol(variable,operand);
  6180. InitFields(type, operand.tag,0);
  6181. IF temporary THEN
  6182. PutMathArrayField(operand.tag, IntermediateCode.Immediate(addressType,SYSTEM.VAL(LONGINT,{StackFlag})),MathFlagsOffset);
  6183. END;
  6184. ELSIF type.form = SyntaxTree.Tensor THEN
  6185. IF temporary & backend.writeBarriers THEN
  6186. SaveRegisters();ReleaseUsedRegisters(saved);
  6187. Symbol(variable, operand);
  6188. Emit(Push(position,operand.op));
  6189. ReleaseOperand(operand);
  6190. Emit(Push(position,nil));
  6191. CallThis(position,"FoxArrayBase","Assign",2);
  6192. RestoreRegisters(saved);
  6193. ELSE
  6194. Symbol(variable, operand);
  6195. MakeMemory(tmp,operand.op,addressType,0);
  6196. ReleaseOperand(operand);
  6197. IF FALSE & temporary THEN
  6198. (* trick -- temporary object from array base *)
  6199. symbol := GetSymbol(moduleScope,"FoxArrayBase","temporary");
  6200. Symbol(symbol,operand);
  6201. MakeMemory(mem,operand.op,addressType,0);
  6202. ReleaseOperand(operand);
  6203. Emit(Mov(position,tmp, mem) );
  6204. ReleaseOperand(operand);
  6205. ELSE
  6206. Emit(Mov(position,tmp, nil ) );
  6207. END;
  6208. ReleaseIntermediateOperand(tmp)
  6209. END;
  6210. END;
  6211. END;
  6212. ELSE
  6213. Symbol(variable,operand);
  6214. IF variable.initializer # NIL THEN
  6215. reference := SyntaxTree.NewSymbolDesignator(variable.initializer.position,NIL,variable);
  6216. reference.SetType(variable.type.resolved);
  6217. reference.SetAssignable(TRUE);
  6218. Assign(reference,variable.initializer);
  6219. ELSIF temporary THEN
  6220. IF SemanticChecker.IsPointerType(variable.type) THEN
  6221. IF backend.writeBarriers THEN
  6222. SaveRegisters();ReleaseUsedRegisters(saved);
  6223. Symbol(variable, operand);
  6224. Emit(Push(position,operand.op));
  6225. ReleaseOperand(operand);
  6226. Emit(Push(position,nil));
  6227. CallThis(position,"Heaps","Assign",2);
  6228. RestoreRegisters(saved);
  6229. ELSE
  6230. Symbol(variable, operand);
  6231. MakeMemory(tmp,operand.op,addressType,0);
  6232. ReleaseOperand(operand);
  6233. Emit(Mov(position,tmp, nil ) );
  6234. ReleaseIntermediateOperand(tmp);
  6235. END;
  6236. END;
  6237. END;
  6238. InitFields(type, operand.op,0);
  6239. ReleaseOperand(operand);
  6240. END;
  6241. END InitVariable;
  6242. PROCEDURE MathArrayDim(type: SyntaxTree.MathArrayType; CONST base: IntermediateCode.Operand; VAR result: Operand);
  6243. VAR end: Label;
  6244. BEGIN
  6245. IF type.form = SyntaxTree.Tensor THEN
  6246. InitOperand(result,ModeValue);
  6247. ReuseCopy(result.op,base);
  6248. end := NewLabel();
  6249. BreqL(end,result.op,IntermediateCode.Immediate(addressType,0));
  6250. Emit(MovReplace(position,result.op,IntermediateCode.Memory(addressType,result.op,ToMemoryUnits(system,MathDimOffset*addressType.sizeInBits))));
  6251. SetLabel(end);
  6252. Convert(result.op,lenType);
  6253. ELSE
  6254. InitOperand(result,ModeValue);
  6255. IntermediateCode.InitImmediate(result.op, lenType, SemanticChecker.Dimension(type,{SyntaxTree.Open, SyntaxTree.Static}));
  6256. END
  6257. END MathArrayDim;
  6258. PROCEDURE PutMathArrayField(base,value: IntermediateCode.Operand; fieldOffset: LONGINT);
  6259. VAR mem: IntermediateCode.Operand; offset: LONGINT;
  6260. BEGIN
  6261. offset := ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6262. MakeMemory(mem,base,addressType,offset);
  6263. Emit(Mov(position,mem,value));
  6264. ReleaseIntermediateOperand(mem);
  6265. END PutMathArrayField;
  6266. PROCEDURE PutMathArrayFieldOffset(base,value: IntermediateCode.Operand; fieldOffset, offset: LONGINT);
  6267. VAR mem: IntermediateCode.Operand;
  6268. BEGIN
  6269. offset := offset + ToMemoryUnits(system,fieldOffset*addressType.sizeInBits);
  6270. MakeMemory(mem,base,addressType,offset);
  6271. Emit(Mov(position,mem,value));
  6272. ReleaseIntermediateOperand(mem);
  6273. END PutMathArrayFieldOffset;
  6274. PROCEDURE GetMathArrayField(VAR value: IntermediateCode.Operand; base: IntermediateCode.Operand; offset: LONGINT);
  6275. BEGIN
  6276. offset := ToMemoryUnits(system,offset*addressType.sizeInBits);
  6277. MakeMemory(value,base,addressType,offset);
  6278. END GetMathArrayField;
  6279. PROCEDURE PutMathArrayLenOrIncr(CONST base,value,dim: IntermediateCode.Operand; incr: BOOLEAN);
  6280. VAR offset: LONGINT; reg,mem: IntermediateCode.Operand;
  6281. BEGIN
  6282. IF incr THEN
  6283. offset := ToMemoryUnits(system,MathIncrOffset*addressType.sizeInBits);
  6284. ELSE
  6285. offset := ToMemoryUnits(system,MathLenOffset*addressType.sizeInBits);
  6286. END;
  6287. IF dim.mode=IntermediateCode.ModeImmediate THEN
  6288. PutMathArrayField(base,value,offset + ToMemoryUnits(system,SHORT(dim.intValue) * 2 * addressType.sizeInBits));
  6289. ELSE
  6290. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6291. Emit(Mov(position,reg,dim));
  6292. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,2*addressType.sizeInBits))));
  6293. Emit(Add(position,reg,reg,base));
  6294. MakeMemory(mem, reg, addressType, offset);
  6295. ReleaseIntermediateOperand(reg);
  6296. Emit(Mov(position,mem,value));
  6297. ReleaseIntermediateOperand(mem);
  6298. END;
  6299. END PutMathArrayLenOrIncr;
  6300. PROCEDURE PutMathArrayLength(base,value: IntermediateCode.Operand; dim: LONGINT);
  6301. BEGIN
  6302. PutMathArrayField(base,value,MathLenOffset + dim * 2);
  6303. END PutMathArrayLength;
  6304. PROCEDURE PutMathArrayIncrement(base,value: IntermediateCode.Operand; dim: LONGINT);
  6305. BEGIN
  6306. PutMathArrayField(base,value,MathIncrOffset + dim * 2);
  6307. END PutMathArrayIncrement;
  6308. PROCEDURE GetMathArrayIncrement(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6309. BEGIN
  6310. MathArrayLenOrIncr(type,operand,dim,TRUE,check,result);
  6311. END GetMathArrayIncrement;
  6312. PROCEDURE GetMathArrayLength(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; check: BOOLEAN; VAR result: Operand);
  6313. BEGIN
  6314. MathArrayLenOrIncr(type,operand,dim,FALSE,check,result);
  6315. END GetMathArrayLength;
  6316. PROCEDURE GetMathArrayLengthAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6317. VAR dimOp: IntermediateCode.Operand;
  6318. BEGIN
  6319. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6320. GetMathArrayLength(type, operand, dimOp, check, result);
  6321. END GetMathArrayLengthAt;
  6322. PROCEDURE GetMathArrayIncrementAt(type: SyntaxTree.MathArrayType; CONST operand: Operand; dim: LONGINT; check: BOOLEAN; VAR result: Operand);
  6323. VAR dimOp: IntermediateCode.Operand;
  6324. BEGIN
  6325. dimOp := IntermediateCode.Immediate(sizeType, dim);
  6326. GetMathArrayIncrement(type, operand, dimOp, check, result);
  6327. END GetMathArrayIncrementAt;
  6328. PROCEDURE MathArrayLenOrIncr(type: SyntaxTree.MathArrayType; CONST operand: Operand; VAR dim: IntermediateCode.Operand; increment: BOOLEAN; check: BOOLEAN; VAR result: Operand );
  6329. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6330. offset: LONGINT;
  6331. BEGIN
  6332. IF increment THEN
  6333. offset := MathIncrOffset;
  6334. ELSE
  6335. offset := MathLenOffset;
  6336. END;
  6337. INC(offset,operand.dimOffset*2);
  6338. IF check & (type.form = SyntaxTree.Tensor) & ~isUnchecked THEN
  6339. TrapC(BrneL,operand.tag,IntermediateCode.Immediate(addressType,0),IndexCheckTrap);
  6340. END;
  6341. (* static dimension *)
  6342. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6343. IF check & (type.form = SyntaxTree.Tensor) THEN
  6344. DimensionCheck(operand.tag,dim,BrltL);
  6345. END;
  6346. val := SHORT(dim.intValue);
  6347. IF type.form # SyntaxTree.Tensor THEN
  6348. t := SemanticChecker.ArrayBase(type,val);
  6349. type := t.resolved(SyntaxTree.MathArrayType);
  6350. IF type.form = SyntaxTree.Static THEN
  6351. IF increment THEN
  6352. res := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,type.staticIncrementInBits));
  6353. ELSE
  6354. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6355. END;
  6356. InitOperand(result,ModeValue);
  6357. result.op := res;
  6358. RETURN;
  6359. END;
  6360. END;
  6361. offset := ToMemoryUnits(system, (val*2+offset)*addressType.sizeInBits);
  6362. MakeMemory(res,operand.tag,addressType,offset);
  6363. (*
  6364. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6365. *)
  6366. InitOperand(result,ModeValue);
  6367. result.op := res;
  6368. ELSE
  6369. Convert(dim,addressType);
  6370. IF check THEN
  6371. IF type.form = SyntaxTree.Tensor THEN
  6372. DimensionCheck(operand.tag,dim,BrltL);
  6373. ELSIF isUnchecked THEN (* do nothing *)
  6374. ELSE
  6375. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6376. END;
  6377. END;
  6378. end := NewLabel(); next := NIL;
  6379. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6380. Emit(Mov(position,res,dim));
  6381. Convert(res,sizeType);
  6382. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6383. WHILE t IS SyntaxTree.MathArrayType DO
  6384. type := t(SyntaxTree.MathArrayType);
  6385. IF type.form = SyntaxTree.Static THEN
  6386. imm := IntermediateCode.Immediate(sizeType,val);
  6387. next := NewLabel();
  6388. BrneL(next,imm,res);
  6389. IF increment THEN
  6390. imm := IntermediateCode.Immediate(sizeType,ToMemoryUnits(system,type.staticIncrementInBits));
  6391. ELSE
  6392. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6393. END;
  6394. Emit(MovReplace(position,res,imm));
  6395. BrL(end);
  6396. ELSE hasDynamicPart := TRUE;
  6397. END;
  6398. t := type.arrayBase.resolved;
  6399. val := val + 1;
  6400. IF next # NIL THEN SetLabel(next) END;
  6401. END;
  6402. IF hasDynamicPart THEN
  6403. IntermediateCode.InitRegister(res2,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6404. Emit(Mov(position,res2,dim));
  6405. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,2*ToMemoryUnits(system,addressType.sizeInBits))));
  6406. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6407. Emit(Add(position,res2,res2,imm));
  6408. Emit(Add(position,res2,res2,operand.tag));
  6409. IntermediateCode.MakeMemory(res2,sizeType);
  6410. Emit(MovReplace(position,res,res2));
  6411. ReleaseIntermediateOperand(res2);
  6412. END;
  6413. SetLabel(end);
  6414. Convert(res,sizeType);
  6415. InitOperand(result,ModeValue);
  6416. result.op := res;
  6417. END;
  6418. END MathArrayLenOrIncr;
  6419. PROCEDURE ArrayLen(type: SyntaxTree.ArrayType; VAR operand: Operand; VAR dim: IntermediateCode.Operand; VAR result: Operand );
  6420. VAR val: LONGINT; res,res2: IntermediateCode.Operand; end,next: Label; t: SyntaxTree.Type; imm: IntermediateCode.Operand; hasDynamicPart: BOOLEAN;
  6421. offset: LONGINT;
  6422. BEGIN
  6423. offset := operand.dimOffset+DynamicDim(type)-1;
  6424. IF dim.mode = IntermediateCode.ModeImmediate THEN
  6425. ASSERT(type.form IN {SyntaxTree.Open, SyntaxTree.SemiDynamic});
  6426. val := SHORT(dim.intValue);
  6427. t := SemanticChecker.ArrayBase(type,val);
  6428. type := t.resolved(SyntaxTree.ArrayType);
  6429. IF type.form = SyntaxTree.Static THEN
  6430. res := IntermediateCode.Immediate(addressType,type.staticLength);
  6431. ELSE
  6432. offset := ToMemoryUnits(system, (offset-val)*addressType.sizeInBits);
  6433. res := IntermediateCode.Memory(addressType,operand.tag,offset);
  6434. END;
  6435. UseIntermediateOperand(res);
  6436. InitOperand(result,ModeValue);
  6437. result.op := res;
  6438. ELSE
  6439. Convert(dim,addressType);
  6440. IF ~isUnchecked THEN
  6441. TrapC(BrltL,dim,IntermediateCode.Immediate(addressType,SemanticChecker.Dimension(type,{SyntaxTree.Open,SyntaxTree.Static})), IndexCheckTrap);
  6442. END;
  6443. end := NewLabel(); next := NIL;
  6444. (* ReuseCopy(dim,res); *)
  6445. IntermediateCode.InitRegister(res,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType, IntermediateCode.GeneralPurposeRegister));
  6446. Emit(Mov(position,res,dim));
  6447. Convert(res,sizeType);
  6448. Convert(res,sizeType);
  6449. t := type; val := operand.dimOffset; hasDynamicPart := FALSE;
  6450. WHILE t IS SyntaxTree.ArrayType DO
  6451. type := t(SyntaxTree.ArrayType);
  6452. IF type.form = SyntaxTree.Static THEN
  6453. imm := IntermediateCode.Immediate(sizeType,val);
  6454. next := NewLabel();
  6455. BrneL(next,imm,res);
  6456. imm := IntermediateCode.Immediate(sizeType,type.staticLength);
  6457. Emit(MovReplace(position,res,imm));
  6458. BrL(end);
  6459. ELSE hasDynamicPart := TRUE;
  6460. END;
  6461. t := type.arrayBase.resolved;
  6462. val := val + 1;
  6463. IF next # NIL THEN SetLabel(next) END;
  6464. END;
  6465. IF hasDynamicPart THEN
  6466. ReuseCopy(res2,dim); (* dim is now in register res2 *)
  6467. Convert(res2,addressType);
  6468. Emit(Mul(position,res2,res2,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,addressType.sizeInBits))));
  6469. imm := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,offset*addressType.sizeInBits));
  6470. Emit(Sub(position,res2,imm,res2));
  6471. Emit(Add(position,res2,res2,operand.tag));
  6472. IntermediateCode.MakeMemory(res2,sizeType);
  6473. Emit(MovReplace(position,res,res2));
  6474. ReleaseIntermediateOperand(res2);
  6475. END;
  6476. SetLabel(end);
  6477. Convert(res,sizeType);
  6478. InitOperand(result,ModeValue);
  6479. result.op := res;
  6480. END;
  6481. END ArrayLen;
  6482. (**
  6483. create a temporary variable in current scope
  6484. **)
  6485. PROCEDURE GetTemporaryVariable(type: SyntaxTree.Type; register: BOOLEAN; untraced: BOOLEAN): SyntaxTree.Variable;
  6486. VAR name: SyntaxTree.Identifier; variable, v: SyntaxTree.Variable;
  6487. scope: SyntaxTree.Scope; duplicate: BOOLEAN; offset, index: LONGINT;
  6488. BEGIN
  6489. IF ~register THEN
  6490. v := temporaries.GetFreeVariable(type, untraced, index);
  6491. ELSE
  6492. index := temporaries.registerIndex; INC(temporaries.registerIndex);
  6493. END;
  6494. scope := currentScope;
  6495. (*
  6496. variable := NIL; (* disable free variable managemenet for the time being -- does not work *)
  6497. *)
  6498. name := temporaries.GetUID();
  6499. variable := SyntaxTree.NewVariable(Basic.invalidPosition,name);
  6500. variable.SetType(type);
  6501. variable.SetAccess(SyntaxTree.Hidden);
  6502. variable.SetUntraced(untraced);
  6503. IF v = NIL THEN
  6504. temporaries.AddVariable(variable);
  6505. IF ~register THEN
  6506. IF scope.lastVariable # NIL THEN
  6507. offset := scope.lastVariable.offsetInBits;
  6508. ELSE
  6509. offset := 0;
  6510. END;
  6511. DEC(offset,system.SizeOf(variable.type));
  6512. Basic.Align(offset,-system.AlignmentOf(system.variableAlignment,variable.type));
  6513. variable(SyntaxTree.Variable).SetOffset(offset);
  6514. scope.AddVariable(variable(SyntaxTree.Variable));
  6515. scope.EnterSymbol(variable, duplicate);
  6516. ASSERT(~duplicate);
  6517. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6518. ELSE
  6519. variable.SetUseRegister(TRUE);
  6520. variable(SyntaxTree.Variable).SetOffset(0);
  6521. END;
  6522. ELSE (* v # NIL *)
  6523. (* reuse slot for new variable, do not create new slot ! *)
  6524. temporaries.SetVariable(index, variable);
  6525. (* ASSERT(v.scope = scope); can be violated in inline calls *)
  6526. ASSERT(~register);
  6527. variable(SyntaxTree.Variable).SetOffset(v.offsetInBits);
  6528. ASSERT(v.offsetInBits # 0);
  6529. scope.InsertVariable(variable(SyntaxTree.Variable), v);
  6530. scope.EnterSymbol(variable, duplicate);
  6531. ASSERT(~duplicate);
  6532. InitVariable(variable(SyntaxTree.Variable),TRUE);
  6533. END;
  6534. RETURN variable(SyntaxTree.Variable)
  6535. END GetTemporaryVariable;
  6536. PROCEDURE GetMathArrayDescriptorType(dimensions: LONGINT): SyntaxTree.Type;
  6537. VAR name: ARRAY 32 OF CHAR; symbol: SyntaxTree.Symbol; typeDeclaration: SyntaxTree.TypeDeclaration;
  6538. recordType: SyntaxTree.RecordType; type: SyntaxTree.Type;
  6539. recordScope: SyntaxTree.RecordScope; parentScope: SyntaxTree.Scope; identifier: SyntaxTree.Identifier;
  6540. i: LONGINT; duplicate: BOOLEAN;
  6541. PROCEDURE AddVariable(CONST name: ARRAY OF CHAR; type: SyntaxTree.Type);
  6542. VAR variable: SyntaxTree.Variable;
  6543. BEGIN
  6544. variable := SyntaxTree.NewVariable(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6545. variable.SetType(type);
  6546. recordScope.AddVariable(variable);
  6547. END AddVariable;
  6548. BEGIN
  6549. name := "@ArrayDescriptor";
  6550. Basic.AppendNumber(name,dimensions);
  6551. identifier := SyntaxTree.NewIdentifier(name);
  6552. parentScope := module.module.moduleScope;
  6553. symbol := parentScope.FindSymbol(identifier);
  6554. IF symbol # NIL THEN
  6555. typeDeclaration := symbol(SyntaxTree.TypeDeclaration);
  6556. type := typeDeclaration.declaredType;
  6557. ELSE
  6558. typeDeclaration := SyntaxTree.NewTypeDeclaration(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  6559. typeDeclaration.SetAccess(SyntaxTree.Hidden);
  6560. recordScope := SyntaxTree.NewRecordScope(parentScope);
  6561. recordType := SyntaxTree.NewRecordType( Basic.invalidPosition, parentScope, recordScope);
  6562. recordType.SetTypeDeclaration(typeDeclaration);
  6563. recordType.SetState(SyntaxTree.Resolved);
  6564. typeDeclaration.SetDeclaredType(recordType);
  6565. AddVariable("@ptr",system.anyType);
  6566. AddVariable("@adr",system.addressType);
  6567. AddVariable("@flags",system.addressType);
  6568. AddVariable("@dim",system.addressType);
  6569. AddVariable("@elementSize",system.addressType);
  6570. FOR i := 0 TO dimensions-1 DO
  6571. name := "@len";
  6572. Basic.AppendNumber(name,i);
  6573. AddVariable(name,system.addressType);
  6574. name := "@incr";
  6575. Basic.AppendNumber(name,i);
  6576. AddVariable(name,system.addressType);
  6577. END;
  6578. parentScope.AddTypeDeclaration(typeDeclaration);
  6579. parentScope.EnterSymbol(typeDeclaration,duplicate);
  6580. ASSERT(~duplicate);
  6581. type := recordType;
  6582. END;
  6583. RETURN type
  6584. END GetMathArrayDescriptorType;
  6585. PROCEDURE NewMathArrayDescriptor(op: Operand; dimensions: LONGINT);
  6586. VAR reg: IntermediateCode.Operand; type: SyntaxTree.Type;
  6587. BEGIN
  6588. type := GetMathArrayDescriptorType(dimensions);
  6589. Emit(Push(position,op.op));
  6590. (* push type descriptor *)
  6591. reg := TypeDescriptorAdr(type);
  6592. Emit(Push(position,reg));
  6593. ReleaseIntermediateOperand(reg);
  6594. (* push realtime flag: false by default *)
  6595. Emit(Push(position,false));
  6596. CallThis(position,"Heaps","NewRec",3);
  6597. END NewMathArrayDescriptor;
  6598. PROCEDURE PushConstString(CONST s: ARRAY OF CHAR);
  6599. VAR res: Operand; string: SyntaxTree.String; sv: SyntaxTree.StringValue; type: SyntaxTree.Type;
  6600. BEGIN
  6601. NEW(string, LEN(s)); COPY(s, string^);
  6602. sv := SyntaxTree.NewStringValue(Basic.invalidPosition,string);
  6603. type := SyntaxTree.NewStringType(Basic.invalidPosition,system.characterType,Strings.Length(s));
  6604. sv.SetType(type);
  6605. Designate(sv,res);
  6606. Emit(Push(position,res.tag));
  6607. Emit(Push(position,res.op));
  6608. ReleaseOperand(res);
  6609. END PushConstString;
  6610. PROCEDURE PushConstBoolean(b: BOOLEAN);
  6611. BEGIN
  6612. IF b THEN
  6613. Emit(Push(Basic.invalidPosition, true));
  6614. ELSE
  6615. Emit(Push(Basic.invalidPosition, false));
  6616. END;
  6617. END PushConstBoolean;
  6618. PROCEDURE PushConstSet(v: SET);
  6619. VAR value: SyntaxTree.Value; op: Operand;
  6620. BEGIN
  6621. value := SyntaxTree.NewSetValue(Basic.invalidPosition, v);
  6622. value.SetType(system.setType);
  6623. Evaluate(value, op);
  6624. Emit(Push(Basic.invalidPosition, op.op));
  6625. ReleaseOperand(op);
  6626. END PushConstSet;
  6627. PROCEDURE PushConstInteger(v: LONGINT);
  6628. VAR value: SyntaxTree.Value; op: Operand;
  6629. BEGIN
  6630. value := SyntaxTree.NewIntegerValue(Basic.invalidPosition, v);
  6631. value.SetType(system.longintType);
  6632. Evaluate(value, op);
  6633. Emit(Push(Basic.invalidPosition, op.op));
  6634. ReleaseOperand(op);
  6635. END PushConstInteger;
  6636. PROCEDURE OpenInitializer(symbol: SyntaxTree.Symbol; scope: SyntaxTree.Scope): IntermediateCode.Section;
  6637. VAR name: Basic.SegmentedName; procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  6638. section: IntermediateCode.Section;
  6639. BEGIN
  6640. procedureScope := SyntaxTree.NewProcedureScope(scope);
  6641. Global.GetSymbolSegmentedName(symbol, name);
  6642. Basic.SuffixSegmentedName(name, Basic.MakeString("@Initializer"));
  6643. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition, SyntaxTree.NewIdentifier(""), procedureScope);
  6644. procedure.SetScope(moduleScope);
  6645. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,scope));
  6646. procedure.type(SyntaxTree.ProcedureType).SetDelegate(TRUE);
  6647. procedure.SetAccess(SyntaxTree.Hidden);
  6648. currentScope := procedureScope;
  6649. section := NewSection(module.allSections, Sections.CodeSection, name, NIL,commentPrintout # NIL);
  6650. EmitEnter(section, Basic.invalidPosition,procedure,0,0,0);
  6651. RETURN section;
  6652. END OpenInitializer;
  6653. PROCEDURE CloseInitializer(prev: IntermediateCode.Section);
  6654. BEGIN
  6655. EmitLeave(section, Basic.invalidPosition, NIL, 0 );
  6656. Emit(Exit(Basic.invalidPosition,0 ,0, 0));
  6657. section := prev;
  6658. END CloseInitializer;
  6659. PROCEDURE AddPorts(cell: SyntaxTree.Symbol; x: SyntaxTree.CellType);
  6660. VAR name: SyntaxTree.IdentifierString;
  6661. variable: SyntaxTree.Variable;
  6662. parameter: SyntaxTree.Parameter;
  6663. type: SyntaxTree.Type;
  6664. PROCEDURE Field(symbol: SyntaxTree.Symbol; VAR op: Operand);
  6665. BEGIN
  6666. InitOperand(op,ModeReference);
  6667. op.op := fp;
  6668. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,2*addressType.sizeInBits));
  6669. Dereference(op, x, FALSE);
  6670. result := op;
  6671. Symbol(symbol, op);
  6672. END Field;
  6673. PROCEDURE Direction(direction: LONGINT): SET;
  6674. BEGIN
  6675. IF direction = SyntaxTree.OutPort THEN RETURN {0}
  6676. ELSIF direction = SyntaxTree.InPort THEN RETURN {1}
  6677. ELSE HALT(100);
  6678. END;
  6679. END Direction;
  6680. PROCEDURE AddPortProperty(port: SyntaxTree.Parameter; modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6681. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6682. BEGIN
  6683. Field(port, op);
  6684. ToMemory(op.op,addressType,0);
  6685. Emit(Push(Basic.invalidPosition, op.op));
  6686. ReleaseOperand(op);
  6687. Basic.GetString(modifier.identifier, name);
  6688. PushConstString(name);
  6689. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6690. ASSERT(SemanticChecker.IsStringType(value.type));
  6691. Designate(value, op);
  6692. Emit(Push(modifier.position, op.tag));
  6693. Emit(Push(modifier.position, op.op));
  6694. ReleaseOperand(op);
  6695. CallThis(position,"ActiveCellsRuntime","AddPortStringProperty",5);
  6696. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6697. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6698. Evaluate(value, op);
  6699. Emit(Push(modifier.position, op.op));
  6700. ReleaseOperand(op);
  6701. CallThis(position,"ActiveCellsRuntime","AddPortIntegerProperty",4);
  6702. ELSE
  6703. CallThis(position,"ActiveCellsRuntime","AddPortFlagProperty",3);
  6704. END;
  6705. END AddPortProperty;
  6706. PROCEDURE AddPortProperties(parameter: SyntaxTree.Parameter);
  6707. VAR modifier: SyntaxTree.Modifier;
  6708. BEGIN
  6709. modifier := parameter.modifiers;
  6710. WHILE modifier # NIL DO
  6711. AddPortProperty(parameter,modifier, modifier.expression);
  6712. modifier := modifier.nextModifier;
  6713. END;
  6714. END AddPortProperties;
  6715. PROCEDURE Parameter(name: ARRAY OF CHAR; parameter: SyntaxTree.Parameter);
  6716. VAR op : Operand; portType: SyntaxTree.PortType; baseType: SyntaxTree.Type;
  6717. size, reg: IntermediateCode.Operand; dim, len: LONGINT;
  6718. PROCEDURE PushLens(type: SyntaxTree.Type);
  6719. BEGIN
  6720. IF IsSemiDynamicArray(type) THEN
  6721. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6722. Evaluate(type(SyntaxTree.ArrayType).length, op);
  6723. Emit(Push(Basic.invalidPosition, op.op));
  6724. ReleaseOperand(op);
  6725. INC(dim);
  6726. ELSIF IsStaticArray(type) THEN
  6727. len := len * type(SyntaxTree.ArrayType).staticLength;
  6728. PushLens(type(SyntaxTree.ArrayType).arrayBase.resolved);
  6729. INC(dim);
  6730. ELSE
  6731. baseType := type;
  6732. END;
  6733. END PushLens;
  6734. BEGIN
  6735. (* cell *)
  6736. IF parameter.type IS SyntaxTree.ArrayType THEN
  6737. type := parameter.type;
  6738. dim := 0;
  6739. len := 1;
  6740. PushLens(type);
  6741. portType := baseType.resolved(SyntaxTree.PortType);
  6742. ELSE
  6743. portType := parameter.type(SyntaxTree.PortType);
  6744. END;
  6745. PushSelfPointer();
  6746. (* port / array of ports *)
  6747. IF IsStaticArray(type) THEN
  6748. PushConstInteger(len);
  6749. END;
  6750. Field(parameter, op);
  6751. (*left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6752. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(x);
  6753. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, parameter); d.SetType(parameter.type);
  6754. Designate(d, op);*)
  6755. Emit(Push(Basic.invalidPosition, op.op));
  6756. ReleaseOperand(op);
  6757. (* name *)
  6758. PushConstString(name);
  6759. (* inout *)
  6760. PushConstSet(Direction(portType.direction));
  6761. (* width *)
  6762. PushConstInteger(portType.sizeInBits);
  6763. IF parameter.type IS SyntaxTree.PortType THEN
  6764. CallThis(parameter.position,"ActiveCellsRuntime","AddPort",6);
  6765. AddPortProperties(parameter);
  6766. ELSIF IsStaticArray(type)THEN
  6767. CallThis(parameter.position,"ActiveCellsRuntime","AddStaticPortArray",7);
  6768. ELSIF IsSemiDynamicArray(type) THEN
  6769. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  6770. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,6*addressType.sizeInBits));
  6771. Emit(Add(position,reg, sp, size));
  6772. (* dim *)
  6773. PushConstInteger(dim);
  6774. (* len array *)
  6775. Emit(Push(position, reg));
  6776. ReleaseIntermediateOperand(reg);
  6777. CallThis(position,"ActiveCellsRuntime","AddPortArray",8);
  6778. size := IntermediateCode.Immediate(addressType, ToMemoryUnits(system,dim*addressType.sizeInBits));
  6779. Emit(Add(position, sp,sp, size));
  6780. ELSE
  6781. HALT(100);
  6782. END;
  6783. END Parameter;
  6784. BEGIN
  6785. IF backend.cellsAreObjects THEN
  6786. IF (x.baseType # NIL) & (x.baseType.resolved IS SyntaxTree.CellType) THEN
  6787. AddPorts(cell, x.baseType.resolved(SyntaxTree.CellType));
  6788. END;
  6789. parameter := x.firstParameter;
  6790. WHILE (parameter # NIL) DO
  6791. type := parameter.type.resolved;
  6792. WHILE (type IS SyntaxTree.ArrayType) DO
  6793. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  6794. END;
  6795. IF (type IS SyntaxTree.PortType) THEN (* port found *)
  6796. Global.GetSymbolNameInScope(parameter,x.cellScope,name);
  6797. Parameter(name,parameter);
  6798. END;
  6799. parameter := parameter.nextParameter;
  6800. END;
  6801. ELSE HALT(200)
  6802. END;
  6803. END AddPorts;
  6804. PROCEDURE AddProperty(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; property: SyntaxTree.Property; value: SyntaxTree.Expression);
  6805. VAR name: ARRAY 256 OF CHAR; op: Operand; left, d: SyntaxTree.Designator;
  6806. BEGIN
  6807. Symbol(cell,op);
  6808. ToMemory(op.op,addressType,0);
  6809. Emit(Push(position,op.op));
  6810. ReleaseOperand(op);
  6811. property.GetName(name);
  6812. (* does not work when inheritance is used:
  6813. Global.GetSymbolNameInScope(property, cellType.cellScope , name);
  6814. *)
  6815. PushConstString(name);
  6816. IF (value # NIL) THEN
  6817. ASSERT(
  6818. SemanticChecker.IsStringType(property.type)
  6819. OR (property.type.resolved IS SyntaxTree.IntegerType)
  6820. OR (property.type.resolved IS SyntaxTree.FloatType)
  6821. OR (property.type.resolved IS SyntaxTree.BooleanType)
  6822. OR (property.type.resolved IS SyntaxTree.SetType)
  6823. );
  6824. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,left,cell); left.SetType(system.anyType);
  6825. left := SyntaxTree.NewDereferenceDesignator(Basic.invalidPosition, left); left.SetType(cellType);
  6826. d := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, left, property); d.SetType(property.type);
  6827. Designate(d, op);
  6828. IF SemanticChecker.IsStringType(property.type) THEN
  6829. Emit(Push(Basic.invalidPosition, op.tag))
  6830. END;
  6831. Emit(Push(Basic.invalidPosition, op.op));
  6832. ReleaseOperand(op);
  6833. END;
  6834. IF value = NIL THEN
  6835. CallThis(position,"ActiveCellsRuntime","AddFlagProperty",3);
  6836. ELSIF SemanticChecker.IsStringType(property.type) THEN
  6837. ASSERT(SemanticChecker.IsStringType(value.type));
  6838. Designate(value, op);
  6839. PushString(op, value.type);
  6840. ReleaseOperand(op);
  6841. CallThis(position,"ActiveCellsRuntime","AddStringProperty",7);
  6842. ELSIF (property.type.resolved IS SyntaxTree.IntegerType) THEN
  6843. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6844. Evaluate(value, op);
  6845. Emit(Push(property.position, op.op));
  6846. ReleaseOperand(op);
  6847. CallThis(position,"ActiveCellsRuntime","AddIntegerProperty",5);
  6848. ELSIF (property.type.resolved IS SyntaxTree.BooleanType) THEN
  6849. ASSERT(value.type.resolved IS SyntaxTree.BooleanType);
  6850. Evaluate(value, op);
  6851. Emit(Push(property.position, op.op));
  6852. ReleaseOperand(op);
  6853. CallThis(position,"ActiveCellsRuntime","AddBooleanProperty",5);
  6854. ELSIF (property.type.resolved IS SyntaxTree.FloatType) THEN
  6855. ASSERT((value.type.resolved IS SyntaxTree.FloatType) & (value.type.resolved(SyntaxTree.FloatType).sizeInBits =64));
  6856. Evaluate(value, op);
  6857. Emit(Push(property.position, op.op));
  6858. ReleaseOperand(op);
  6859. CallThis(position,"ActiveCellsRuntime","AddRealProperty",-1); (* must import *)
  6860. ELSIF (property.type.resolved IS SyntaxTree.SetType) THEN
  6861. ASSERT((value.type.resolved IS SyntaxTree.SetType));
  6862. Evaluate(value, op);
  6863. Emit(Push(property.position, op.op));
  6864. ReleaseOperand(op);
  6865. CallThis(position,"ActiveCellsRuntime","AddSetProperty",-1); (* must import *)
  6866. ELSE
  6867. HALT(200);
  6868. END;
  6869. END AddProperty;
  6870. PROCEDURE AddModifiers(cellType: SyntaxTree.CellType; cell: SyntaxTree.Symbol; modifier: SyntaxTree.Modifier);
  6871. VAR symbol: SyntaxTree.Symbol;
  6872. BEGIN
  6873. WHILE modifier # NIL DO
  6874. symbol := cellType.FindProperty(modifier.identifier);
  6875. ASSERT ((symbol # NIL) & (symbol IS SyntaxTree.Property));
  6876. AddProperty(cellType, cell, symbol(SyntaxTree.Property), modifier.expression);
  6877. modifier := modifier.nextModifier;
  6878. END;
  6879. END AddModifiers;
  6880. PROCEDURE AppendModifier(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6881. VAR last: SyntaxTree.Modifier;
  6882. BEGIN
  6883. IF to = NIL THEN
  6884. to := SyntaxTree.NewModifier(this.position, this.identifier, this.expression);
  6885. ELSE
  6886. last := to;
  6887. WHILE (last.nextModifier # NIL) & (this.identifier # last.identifier) DO
  6888. last := last.nextModifier;
  6889. END;
  6890. IF last.identifier # this.identifier THEN
  6891. ASSERT(last.nextModifier = NIL);
  6892. last.SetNext(SyntaxTree.NewModifier(this.position, this.identifier, this.expression));
  6893. END;
  6894. END;
  6895. END AppendModifier;
  6896. PROCEDURE AppendModifiers(VAR to: SyntaxTree.Modifier; this: SyntaxTree.Modifier);
  6897. BEGIN
  6898. WHILE this # NIL DO
  6899. AppendModifier(to, this);
  6900. this := this.nextModifier;
  6901. END;
  6902. END AppendModifiers;
  6903. PROCEDURE AppendCellTypeModifiers(VAR to: SyntaxTree.Modifier; c: SyntaxTree.CellType);
  6904. VAR base: SyntaxTree.Type;
  6905. BEGIN
  6906. AppendModifiers(to, c.modifiers);
  6907. base := c.GetBaseValueType();
  6908. IF (base # NIL) & (base IS SyntaxTree.CellType) THEN
  6909. AppendCellTypeModifiers(to, base(SyntaxTree.CellType))
  6910. END;
  6911. END AppendCellTypeModifiers;
  6912. PROCEDURE AddPortProperty(modifier: SyntaxTree.Modifier; value: SyntaxTree.Expression);
  6913. VAR name: ARRAY 256 OF CHAR; op: Operand;
  6914. BEGIN
  6915. Basic.GetString(modifier.identifier, name);
  6916. PushConstString(name);
  6917. IF SemanticChecker.IsStringType(modifier.expression.type) THEN
  6918. ASSERT(SemanticChecker.IsStringType(value.type));
  6919. Designate(value, op);
  6920. PushString(op, value.type);
  6921. ReleaseOperand(op);
  6922. CallThisChecked(position,"ActiveCellsRuntime","AddPortStringProperty",4,FALSE);
  6923. ELSIF (modifier.expression.type.resolved IS SyntaxTree.IntegerType) THEN
  6924. ASSERT(value.type.resolved IS SyntaxTree.IntegerType);
  6925. Evaluate(value, op);
  6926. Emit(Push(modifier.position, op.op));
  6927. ReleaseOperand(op);
  6928. CallThisChecked(position,"ActiveCellsRuntime","AddPortIntegerProperty",3,FALSE);
  6929. ELSE
  6930. CallThisChecked(position,"ActiveCellsRuntime","AddPortFlagProperty",2,FALSE);
  6931. END;
  6932. END AddPortProperty;
  6933. PROCEDURE AddPortProperties(modifier: SyntaxTree.Modifier);
  6934. BEGIN
  6935. WHILE modifier # NIL DO
  6936. AddPortProperty(modifier, modifier.expression);
  6937. modifier := modifier.nextModifier;
  6938. END;
  6939. END AddPortProperties;
  6940. PROCEDURE PushPort(p: SyntaxTree.Expression);
  6941. VAR op: Operand;
  6942. BEGIN
  6943. Evaluate(p, op);
  6944. Emit(Push(p.position, op.op));
  6945. ReleaseOperand(op);
  6946. IF p IS SyntaxTree.Designator THEN
  6947. AddPortProperties(p(SyntaxTree.Designator).modifiers)
  6948. END;
  6949. END PushPort;
  6950. PROCEDURE PushString(op: Operand; actualType: SyntaxTree.Type);
  6951. VAR tmp: IntermediateCode.Operand;
  6952. BEGIN
  6953. actualType := actualType.resolved;
  6954. IF actualType IS SyntaxTree.StringType THEN
  6955. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.StringType).length)));
  6956. ELSIF actualType(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  6957. Emit(Push(position,IntermediateCode.Immediate(addressType,actualType(SyntaxTree.ArrayType).staticLength)));
  6958. ELSE
  6959. tmp := op.tag;
  6960. IntermediateCode.MakeMemory(tmp,addressType);
  6961. Emit(Push(position,tmp));
  6962. END;
  6963. Emit(Push(position,op.op))
  6964. END PushString;
  6965. (* conservative check if x is potentially on the heap, excluding the module heap
  6966. required for generational garbage collector
  6967. *)
  6968. PROCEDURE OnHeap(x: SyntaxTree.Expression): BOOLEAN;
  6969. VAR pos: LONGINT; y: SyntaxTree.Expression;
  6970. BEGIN
  6971. RETURN TRUE;
  6972. (*! find a conservative and simple algorithm. The following does, for example, not work for records on the stack
  6973. passed by reference.
  6974. pos := x.position.start;
  6975. WHILE (x # NIL) & ~(x IS SyntaxTree.DereferenceDesignator) & ~(x IS SyntaxTree.SelfDesignator) DO
  6976. x := x(SyntaxTree.Designator).left;
  6977. END;
  6978. RETURN x # NIL;
  6979. *)
  6980. END OnHeap;
  6981. PROCEDURE VisitBuiltinCallDesignator*(x: SyntaxTree.BuiltinCallDesignator);
  6982. VAR
  6983. p0,p1,p2,parameter: SyntaxTree.Expression; len,val: LONGINT; l,r: Operand; res,adr,reg: IntermediateCode.Operand; type, componentType: SyntaxTree.Type;
  6984. constructor: SyntaxTree.Procedure; s0,s1,s2: Operand; hint: HUGEINT;
  6985. i: LONGINT; formalParameter: SyntaxTree.Parameter;
  6986. tmp:IntermediateCode.Operand;
  6987. size: LONGINT; dim,openDim: LONGINT; pointer: IntermediateCode.Operand; t,t0,t1,t2: SyntaxTree.Type; trueL,falseL,ignore: Label;
  6988. exit,else,end: Label; procedureType: SyntaxTree.ProcedureType;
  6989. name: Basic.SegmentedName; symbol: Sections.Section; operand: Operand;
  6990. dest: IntermediateCode.Operand;
  6991. staticLength: LONGINT; itype: IntermediateCode.Type;
  6992. convert,isTensor: BOOLEAN;
  6993. recordType: SyntaxTree.RecordType;
  6994. baseType: SyntaxTree.Type;
  6995. flags: SET;
  6996. left: SyntaxTree.Expression;
  6997. call: SyntaxTree.Designator;
  6998. procedure: SyntaxTree.Procedure;
  6999. temporaryVariable: SyntaxTree.Variable;
  7000. dummy: IntermediateCode.Operand;
  7001. customBuiltin: SyntaxTree.CustomBuiltin;
  7002. isVarPar: ARRAY 3 OF BOOLEAN;
  7003. callsection: Sections.Section;
  7004. segmentedName: Basic.SegmentedName;
  7005. needsTrace: BOOLEAN;
  7006. n: ARRAY 256 OF CHAR;
  7007. modifier: SyntaxTree.Modifier;
  7008. previous, init: IntermediateCode.Section;
  7009. prevScope: SyntaxTree.Scope;
  7010. firstPar: LONGINT;
  7011. saved: RegisterEntry;
  7012. callingConvention: SyntaxTree.CallingConvention;
  7013. PROCEDURE CallBodies(self: IntermediateCode.Operand; type: SyntaxTree.Type);
  7014. VAR recordScope: SyntaxTree.RecordScope; procedure: SyntaxTree.Procedure; body: SyntaxTree.Body; flags: LONGINT;
  7015. priority: IntermediateCode.Operand;
  7016. op,callop: Operand;
  7017. BEGIN
  7018. IF type = NIL THEN RETURN END;
  7019. type := type.resolved;
  7020. IF type IS SyntaxTree.PointerType THEN
  7021. type := type(SyntaxTree.PointerType).pointerBase.resolved
  7022. END;
  7023. IF type IS SyntaxTree.MathArrayType THEN RETURN END;
  7024. CallBodies(self,type(SyntaxTree.RecordType).baseType);
  7025. recordScope := type(SyntaxTree.RecordType).recordScope;
  7026. IF recordScope.bodyProcedure # NIL THEN
  7027. procedure := recordScope.bodyProcedure;
  7028. body := procedure.procedureScope.body;
  7029. Emit(Push(position,self));
  7030. IF body.isActive THEN
  7031. StaticCallOperand(callop,procedure);
  7032. Emit(Push(position,callop.op));
  7033. IF body.priority # NIL THEN Evaluate(body.priority,op); priority := op.op;
  7034. Convert(priority,sizeType);
  7035. ELSE priority := IntermediateCode.Immediate(sizeType,0)
  7036. END;
  7037. Emit(Push(position,priority));
  7038. ReleaseIntermediateOperand(priority);
  7039. IF backend.cooperative THEN
  7040. Emit(Push(position,self));
  7041. CallThis(position,"Activities","Create",3)
  7042. ELSE
  7043. flags := 0;
  7044. IF body.isSafe THEN
  7045. flags := 1;
  7046. END;
  7047. Emit(Push(position,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.setType),flags)));
  7048. Emit(Push(position,self));
  7049. CallThis(position,"Objects","CreateProcess",4)
  7050. END;
  7051. ELSE
  7052. Emit(Push(position,self));
  7053. StaticCallOperand(callop,procedure);
  7054. Emit(Call(position,callop.op,ProcParametersSize(procedure)));
  7055. END;
  7056. Emit(Pop(position,self));
  7057. END;
  7058. END CallBodies;
  7059. PROCEDURE PushTD(type: SyntaxTree.Type);
  7060. VAR op: IntermediateCode.Operand;
  7061. BEGIN
  7062. IF type = NIL THEN Emit(Push(position,IntermediateCode.Immediate(addressType,0)))
  7063. ELSIF type.resolved IS SyntaxTree.AnyType THEN Emit(Push(position,IntermediateCode.Immediate(addressType,1)))
  7064. ELSE
  7065. IF type.resolved IS SyntaxTree.PointerType THEN
  7066. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  7067. END;
  7068. op := TypeDescriptorAdr(type.resolved);
  7069. Emit(Push(position,op));
  7070. END
  7071. END PushTD;
  7072. BEGIN
  7073. IF Trace THEN TraceEnter("VisitBuiltinCallDesignator") END;
  7074. dest := destination; destination := emptyOperand;
  7075. p0 := NIL; p1 := NIL; p2 := NIL; len := x.parameters.Length();
  7076. IF len > 0 THEN p0 := x.parameters.GetExpression(0); t0 := p0.type.resolved END;
  7077. IF len > 1 THEN p1 := x.parameters.GetExpression(1); t1 := p1.type.resolved END;
  7078. IF len > 2 THEN p2 := x.parameters.GetExpression(2); t2 := p2.type.resolved END;
  7079. CASE x.id OF
  7080. (* ---- COPY ----- *)
  7081. |Global.Copy:
  7082. CopyString(p1,p0); (* roles exchanged: COPY ( src => dest ) *)
  7083. (* ---- EXCL, INCL----- *)
  7084. |Global.Excl,Global.Incl:
  7085. Evaluate(p0,s0);
  7086. Evaluate(p1,s1);
  7087. Convert(s1.op,IntermediateCode.GetType(system,t0));
  7088. IF (s1.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7089. TrapC(BrltL,s1.op,IntermediateCode.Immediate(s1.op.type,t0.sizeInBits),IndexCheckTrap);
  7090. END;
  7091. ReuseCopy(res,s0.op);
  7092. ReleaseOperand(s0);
  7093. Reuse1(tmp,s1.op);
  7094. ReleaseOperand(s1);
  7095. Emit(Shl(position,tmp,IntermediateCode.Immediate(s1.op.type,1),s1.op));
  7096. IF x.id = Global.Excl THEN
  7097. Emit(Not(position,tmp,tmp));
  7098. Emit(And(position,res,res,tmp));
  7099. ELSE
  7100. Emit(Or(position,res,res,tmp));
  7101. END;
  7102. ReleaseIntermediateOperand(tmp);
  7103. Designate(p0,s0);
  7104. ToMemory(s0.op,s1.op.type,0);
  7105. Emit(Mov(position,s0.op,res));
  7106. ReleaseOperand(s0); ReleaseIntermediateOperand(res);
  7107. (* ---- DISPOSE ----- *)
  7108. |Global.Dispose:
  7109. Designate(p0,s0);
  7110. Emit(Push(position,s0.op));
  7111. ReleaseOperand(s0);
  7112. CallThis(position,"Runtime","Dispose", 1);
  7113. (* ---- GETPROCEDURE ----- *)
  7114. |Global.GetProcedure:
  7115. Designate(p0,s0);
  7116. PushString(s0,p0.type);
  7117. Designate(p1,s1);
  7118. PushString(s1,p1.type);
  7119. procedureType := p2.type.resolved(SyntaxTree.ProcedureType);
  7120. IF (procedureType.firstParameter = NIL) OR (procedureType.firstParameter.access = SyntaxTree.Hidden) THEN PushTD(NIL)
  7121. ELSE PushTD(procedureType.firstParameter.type)
  7122. END;
  7123. PushTD(procedureType.returnType);
  7124. Designate(p2,s2);
  7125. Emit(Push(position,s2.op));
  7126. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  7127. CallThis(position,"Modules","GetProcedure", 7);
  7128. (* ---- ASH, LSH, ROT ----- *)
  7129. |Global.Ash, Global.Asr, Global.Lsh, Global.Rot, Global.Ror:
  7130. Evaluate(p0,s0);
  7131. IF (x.id = Global.Lsh) OR (x.id = Global.Rot) OR (x.id = Global.Ror)THEN
  7132. (* make unsigned arguments in order to produced a logical shift *)
  7133. IF s0.op.type.form = IntermediateCode.SignedInteger THEN
  7134. convert:= TRUE;
  7135. itype := s0.op.type;
  7136. IntermediateCode.InitType(itype,IntermediateCode.UnsignedInteger,s0.op.type.sizeInBits);
  7137. Convert(s0.op,itype);
  7138. ELSE
  7139. convert := FALSE;
  7140. END;
  7141. END;
  7142. Evaluate(p1,s1);
  7143. IF IsIntegerConstant(p1,hint) THEN
  7144. ReuseCopy(reg,s0.op);
  7145. IF hint > 0 THEN
  7146. IntermediateCode.InitImmediate(s1.op,s1.op.type,hint);
  7147. IF x.id = Global.Ash THEN Emit(Shl(position,reg,s0.op,s1.op))
  7148. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,s0.op,s1.op))
  7149. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,s0.op,s1.op))
  7150. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,s0.op,s1.op))
  7151. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,s0.op,s1.op))
  7152. END;
  7153. ELSIF hint < 0 THEN
  7154. IntermediateCode.InitImmediate(s1.op,s1.op.type,-hint);
  7155. IF x.id = Global.Ash THEN Emit(Shr(position,reg,s0.op,s1.op));
  7156. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,s0.op,s1.op));
  7157. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,s0.op,s1.op));
  7158. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,s0.op,s1.op))
  7159. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,s0.op,s1.op))
  7160. END;
  7161. END;
  7162. ReleaseOperand(s0); ReleaseOperand(s1);
  7163. ELSE
  7164. exit := NewLabel();
  7165. end := NewLabel();
  7166. ReuseCopy(reg,s0.op);
  7167. BrgeL(exit,s1.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p1.type),0));
  7168. Reuse1(tmp,s1.op);
  7169. Emit(Neg(position,tmp,s1.op));
  7170. Convert(tmp,s1.op.type);
  7171. IF x.id = Global.Ash THEN Emit(Shr(position,reg,reg,tmp))
  7172. ELSIF x.id = Global.Lsh THEN Emit(Shr(position,reg,reg,tmp))
  7173. ELSIF x.id = Global.Rot THEN Emit(Ror(position,reg,reg,tmp))
  7174. ELSIF x.id = Global.Ror THEN Emit(Rol(position,reg,reg,tmp))
  7175. ELSIF x.id = Global.Asr THEN Emit(Shl(position,reg,reg,tmp))
  7176. END;
  7177. ReleaseIntermediateOperand(tmp);
  7178. BrL(end);
  7179. SetLabel(exit);
  7180. ReuseCopy(tmp,s1.op);
  7181. Convert(tmp,s1.op.type);
  7182. IF x.id = Global.Ash THEN Emit(Shl(position,reg,reg,tmp))
  7183. ELSIF x.id = Global.Lsh THEN Emit(Shl(position,reg,reg,tmp))
  7184. ELSIF x.id = Global.Rot THEN Emit(Rol(position,reg,reg,tmp))
  7185. ELSIF x.id = Global.Ror THEN Emit(Ror(position,reg,reg,tmp))
  7186. ELSIF x.id = Global.Asr THEN Emit(Shr(position,reg,reg,tmp))
  7187. END;
  7188. ReleaseIntermediateOperand(tmp);
  7189. SetLabel(end);
  7190. ReleaseOperand(s0); ReleaseOperand(s1);
  7191. END;
  7192. InitOperand(result,ModeValue);
  7193. IF convert THEN
  7194. itype := reg.type;
  7195. IntermediateCode.InitType(itype,IntermediateCode.SignedInteger,reg.type.sizeInBits);
  7196. Convert(reg,itype);
  7197. END;
  7198. result.op := reg;
  7199. (* ---- CAP ----- *)
  7200. |Global.Cap:
  7201. Evaluate(p0,result);
  7202. ReuseCopy(reg,result.op);
  7203. ReleaseIntermediateOperand(result.op);
  7204. ignore := NewLabel();
  7205. BrltL(ignore, reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("a")));
  7206. BrltL(ignore,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),ORD("z")),reg);
  7207. Emit(And(position,reg,reg,IntermediateCode.Immediate(IntermediateCode.GetType(system,system.characterType),5FH)));
  7208. SetLabel(ignore);
  7209. result.op := reg;
  7210. (* ---- CHR ----- *)
  7211. |Global.Chr, Global.Chr32:
  7212. Evaluate(p0,result);
  7213. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7214. |Global.Entier, Global.EntierH:
  7215. Evaluate(p0,result);
  7216. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7217. (* ---- MIN and MAX ----- *)
  7218. |Global.Max,Global.Min:
  7219. Evaluate(p0,s0);
  7220. Evaluate(p1,s1);
  7221. Reuse2(res,s0.op,s1.op);
  7222. else := NewLabel();
  7223. IF x.id = Global.Max THEN BrltL(else,s0.op,s1.op);
  7224. ELSE BrltL(else,s1.op,s0.op) END;
  7225. Emit(Mov(position,res,s0.op));
  7226. ReleaseOperand(s0);
  7227. end := NewLabel();
  7228. BrL(end);
  7229. SetLabel(else);
  7230. Emit(MovReplace(position,res,s1.op));
  7231. SetLabel(end);
  7232. ReleaseOperand(s1);
  7233. InitOperand(result,ModeValue);
  7234. result.op := res;
  7235. (* ---- ODD ----- *)
  7236. |Global.Odd:
  7237. IF ~conditional THEN
  7238. ConditionToValue(x)
  7239. ELSE
  7240. Evaluate(p0,result);
  7241. res := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7242. Reuse1(res,result.op);
  7243. Emit(And(position,res,result.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  7244. ReleaseIntermediateOperand(result.op);
  7245. result.op := res;
  7246. BreqL(trueLabel,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1),result.op);
  7247. ReleaseOperand(result);
  7248. BrL(falseLabel);
  7249. END;
  7250. (* ---- ORD ----- *)
  7251. |Global.Ord, Global.Ord32:
  7252. Evaluate(p0,result);
  7253. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7254. (* ---- SHORT, LONG ----- *)
  7255. |Global.Short, Global.Long:
  7256. Evaluate(p0,result);
  7257. IF x.type IS SyntaxTree.ComplexType THEN
  7258. componentType := x.type(SyntaxTree.ComplexType).componentType;
  7259. Convert(result.op, IntermediateCode.GetType(system, componentType));
  7260. Convert(result.tag, IntermediateCode.GetType(system, componentType));
  7261. ELSE
  7262. Convert(result.op,IntermediateCode.GetType(system,x.type));
  7263. END
  7264. (* ---- HALT, SYSTEM.HALT----- *)
  7265. |Global.Halt, Global.systemHalt:
  7266. val := LONGINT (p0.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7267. EmitTrap (position, val);
  7268. (* ---- ASSERT ----- *)
  7269. |Global.Assert:
  7270. IF ~backend.noAsserts & (p0.resolved = NIL) THEN
  7271. trueL := NewLabel();
  7272. falseL := NewLabel();
  7273. Condition(p0,trueL,falseL);
  7274. IF p1 = NIL THEN val := AssertTrap
  7275. ELSE val := LONGINT(p1.resolved(SyntaxTree.IntegerValue).value); (* TODO: fix explicit integer truncation *)
  7276. END;
  7277. SetLabel(falseL);
  7278. EmitTrap(position,val);
  7279. SetLabel(trueL);
  7280. END;
  7281. (*
  7282. Emit(TrapC(result.op,val);
  7283. *)
  7284. (* ---- INC, DEC----- *)
  7285. |Global.Inc,Global.Dec:
  7286. Expression(p0); adr := result.op;
  7287. LoadValue(result,p0.type); l := result;
  7288. IF p1 = NIL THEN r.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1);
  7289. ELSE Expression(p1); LoadValue(result,p1.type); r := result;
  7290. END;
  7291. IF x.id = Global.Inc THEN
  7292. Emit(Add(position,l.op,l.op,r.op));
  7293. ELSE
  7294. Emit(Sub(position,l.op,l.op,r.op));
  7295. END;
  7296. ReleaseOperand(l); ReleaseOperand(r);
  7297. (* ---- LEN ----- *)
  7298. |Global.Len: (* dynamic length, static length done by checker *)
  7299. Designate(p0,operand);
  7300. IF p1 = NIL THEN
  7301. InitOperand(l,ModeValue);
  7302. l.op := IntermediateCode.Immediate(sizeType,0);
  7303. ELSE
  7304. Evaluate(p1,l);
  7305. END;
  7306. IF p0.type.resolved IS SyntaxTree.ArrayType THEN
  7307. IF (p0.type.resolved(SyntaxTree.ArrayType).form= SyntaxTree.SemiDynamic) THEN
  7308. Dereference(operand, p0.type.resolved, FALSE);
  7309. END;
  7310. ArrayLen(p0.type.resolved(SyntaxTree.ArrayType),operand,l.op, result);
  7311. ReleaseOperand(operand); ReleaseOperand(l);
  7312. ELSIF p0.type.resolved IS SyntaxTree.MathArrayType THEN
  7313. ASSERT(p1 # NIL);
  7314. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7315. Dereference(operand,p0.type.resolved,FALSE);
  7316. END;
  7317. GetMathArrayLength(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op, TRUE, result);
  7318. ReleaseOperand(operand); ReleaseOperand(l);
  7319. ELSE HALT(100);
  7320. END;
  7321. Convert(result.op,IntermediateCode.GetType(system, x.type));
  7322. (* ---- FIRST ---- *)
  7323. |Global.First:
  7324. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7325. Evaluate(p0(SyntaxTree.RangeExpression).first, result)
  7326. ELSE
  7327. Designate(p0, result)
  7328. END
  7329. (* ---- LAST ---- *)
  7330. |Global.Last:
  7331. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7332. Evaluate(p0(SyntaxTree.RangeExpression).last, result)
  7333. ELSE
  7334. Designate(p0, result);
  7335. (* make sure result.op is a register *)
  7336. tmp := result.op;
  7337. ReuseCopy(result.op, result.op);
  7338. ReleaseIntermediateOperand(tmp);
  7339. (* add offset to result.op *)
  7340. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7341. END
  7342. (* ---- STEP ---- *)
  7343. |Global.Step:
  7344. IF p0 IS SyntaxTree.RangeExpression THEN (* optimization, could also work with designate *)
  7345. Evaluate(p0(SyntaxTree.RangeExpression).step, result)
  7346. ELSE
  7347. Designate(p0, result);
  7348. (* make sure result.op is a register *)
  7349. tmp := result.op;
  7350. ReuseCopy(result.op, result.op);
  7351. ReleaseIntermediateOperand(tmp);
  7352. (* add offset to result.op *)
  7353. IntermediateCode.AddOffset(result.op, 2 * ToMemoryUnits(system, system.SizeOf(system.longintType)))
  7354. END
  7355. (* ---- RE ---- *)
  7356. |Global.Re:
  7357. IF p0.type.resolved IS SyntaxTree.ComplexType THEN
  7358. Designate(p0, result)
  7359. ELSE
  7360. Evaluate(p0, result)
  7361. END
  7362. (* ---- IM ---- *)
  7363. |Global.Im:
  7364. ASSERT(p0.type.resolved IS SyntaxTree.ComplexType);
  7365. componentType := p0.type.resolved(SyntaxTree.ComplexType).componentType;
  7366. Designate(p0, result);
  7367. (* make sure result.op is a register *)
  7368. tmp := result.op;
  7369. ReuseCopy(result.op, result.op);
  7370. ReleaseIntermediateOperand(tmp);
  7371. (* add offset to result.op *)
  7372. IntermediateCode.AddOffset(result.op, ToMemoryUnits(system, system.SizeOf(componentType)));
  7373. (* ---- ABS ----- *)
  7374. |Global.Abs:
  7375. Evaluate(p0,operand);
  7376. type := p0.type.resolved;
  7377. InitOperand(result,ModeValue);
  7378. Reuse1a(result.op,operand.op,dest);
  7379. Emit(Abs(position,result.op,operand.op));
  7380. ReleaseOperand(operand);
  7381. (* ---- WAIT ----- *)
  7382. |Global.Wait:
  7383. Evaluate(p0,operand);
  7384. Emit(Push(position,operand.op));
  7385. ReleaseOperand(operand);
  7386. CallThis(position,"Activities","Wait", 1);
  7387. (* ---- NEW ----- *)
  7388. |Global.New:
  7389. (*! the following code is only correct for "standard" Oberon calling convention *)
  7390. IF x.type # NIL THEN
  7391. type := x.type.resolved;
  7392. firstPar := 0;
  7393. ELSE
  7394. type := p0.type.resolved;
  7395. firstPar := 1;
  7396. END;
  7397. IF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType)
  7398. THEN
  7399. recordType := type(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType);
  7400. IF backend.cooperative THEN
  7401. size := ToMemoryUnits(system,system.SizeOf(recordType));
  7402. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7403. IF recordType.isObject THEN
  7404. INC (size, BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7405. IF recordType.IsActive() THEN
  7406. INC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7407. END;
  7408. IF recordType.IsProtected() THEN
  7409. INC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits))
  7410. END;
  7411. ELSE
  7412. INC (size, BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7413. END;
  7414. END;
  7415. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  7416. CallThis(position,"Runtime","New", 1);
  7417. pointer := NewRegisterOperand(IntermediateCode.GetType(system, type));
  7418. Emit(Result(position, pointer));
  7419. exit := NewLabel();
  7420. BreqL(exit,pointer,nil);
  7421. IF ~type(SyntaxTree.PointerType).isPlain THEN
  7422. GetRecordTypeName (recordType,name);
  7423. IF ~recordType.isObject THEN
  7424. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  7425. END;
  7426. IntermediateCode.InitAddress(adr, addressType, name , 0, 0);
  7427. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),adr));
  7428. IF recordType.isObject THEN
  7429. IF recordType.IsProtected() THEN
  7430. DEC (size, MonitorTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7431. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,MonitorOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7432. END;
  7433. IF recordType.IsActive() THEN
  7434. DEC (size, ActionTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  7435. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ActionOffset * ToMemoryUnits(system,addressType.sizeInBits)), IntermediateCode.RegisterOffset(addressType,IntermediateCode.GeneralPurposeRegister,pointer.register,size)));
  7436. END;
  7437. END;
  7438. END;
  7439. (* initialize fields *)
  7440. IF type(SyntaxTree.PointerType).isPlain THEN
  7441. size := 0;
  7442. ELSIF recordType.isObject THEN
  7443. size := BaseObjectTypeSize;
  7444. ELSE
  7445. size := BaseRecordTypeSize;
  7446. END;
  7447. InitFields(recordType, pointer,size*ToMemoryUnits(system,addressType.sizeInBits));
  7448. (* call initializer *)
  7449. constructor := GetConstructor(recordType);
  7450. IF constructor # NIL THEN
  7451. (*! should be unified with ProcedureCallDesignator *)
  7452. Emit(Push(position,pointer));
  7453. ReleaseIntermediateOperand(pointer);
  7454. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7455. FOR i := firstPar TO x.parameters.Length()-1 DO
  7456. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7457. formalParameter := formalParameter.nextParameter;
  7458. END;
  7459. (* static call of the constructor *)
  7460. GetCodeSectionNameForSymbol(constructor,name);
  7461. ASSERT(~constructor.isInline);
  7462. IF constructor.scope.ownerModule # module.module THEN
  7463. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7464. ELSE
  7465. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7466. END;
  7467. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor) - ToMemoryUnits(system,addressType.sizeInBits)));
  7468. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7469. Emit(Pop(position,pointer));
  7470. END;
  7471. (* call bodies *)
  7472. CallBodies(pointer,type);
  7473. SetLabel(exit);
  7474. needsTrace := p0.NeedsTrace();
  7475. IF needsTrace THEN ModifyAssignments(true) END;
  7476. IF ~type(SyntaxTree.PointerType).isDisposable THEN
  7477. Emit(Push(position, pointer));
  7478. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7479. Emit(Pop(position, pointer));
  7480. END;
  7481. Designate(p0,l);
  7482. IF needsTrace THEN
  7483. CallAssignPointer(l.op, pointer);
  7484. ELSE
  7485. ToMemory(l.op,addressType,0);
  7486. Emit(Mov(position,l.op,pointer));
  7487. END;
  7488. ReleaseIntermediateOperand(pointer);
  7489. ReleaseOperand(l);
  7490. IF needsTrace THEN ModifyAssignments(false) END;
  7491. ELSE (* not cooperative backend *)
  7492. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7493. IF temporaryVariable # NIL THEN
  7494. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7495. ELSE
  7496. Designate(p0,l);
  7497. END;
  7498. (* l.op contains address of pointer to record *)
  7499. Emit(Push(position,l.op)); (* address for use after syscall *)
  7500. Emit(Push(position,l.op));
  7501. ReleaseOperand(l);
  7502. (* push type descriptor *)
  7503. reg := TypeDescriptorAdr(recordType);
  7504. Emit(Push(position,reg));
  7505. ReleaseIntermediateOperand(reg);
  7506. (* push realtime flag *)
  7507. IF type.resolved.isRealtime THEN Emit(Push(position,true));
  7508. ELSE Emit(Push(position,false));
  7509. END;
  7510. CallThis(position,"Heaps","NewRec", 3);
  7511. (* check allocation success, if not successful then do not call initializers and bodies *)
  7512. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7513. Emit(Pop(position,pointer));
  7514. MakeMemory(reg,pointer,addressType,0);
  7515. ReleaseIntermediateOperand(pointer);
  7516. pointer := reg;
  7517. exit := NewLabel();
  7518. BreqL(exit,pointer,nil);
  7519. Emit(Push(position,pointer));
  7520. (* initialize fields *)
  7521. InitFields(recordType, pointer,0);
  7522. (* call initializer *)
  7523. constructor := GetConstructor(recordType);
  7524. IF constructor # NIL THEN
  7525. (*! should be unified with ProcedureCallDesignator *)
  7526. Emit(Push(position,pointer));
  7527. ReleaseIntermediateOperand(pointer);
  7528. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  7529. FOR i := firstPar TO x.parameters.Length()-1 DO
  7530. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  7531. formalParameter := formalParameter.nextParameter;
  7532. END;
  7533. (* static call of the constructor *)
  7534. GetCodeSectionNameForSymbol(constructor,name);
  7535. ASSERT(~constructor.isInline);
  7536. IF constructor.scope.ownerModule # module.module THEN
  7537. symbol := NewSection(module.importedSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7538. ELSE
  7539. symbol := NewSection(module.allSections, Sections.CodeSection, name,constructor,commentPrintout # NIL);
  7540. END;
  7541. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  7542. ELSE
  7543. ReleaseIntermediateOperand(pointer);
  7544. END;
  7545. IntermediateCode.InitRegister(pointer,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7546. Emit(Pop(position,pointer));
  7547. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7548. Designate(p0,l);
  7549. IF backend.writeBarriers & OnHeap(p0) THEN
  7550. SaveRegisters();ReleaseUsedRegisters(saved);
  7551. Emit(Push(position,l.op));
  7552. Emit(Push(position,pointer));
  7553. CallThis(position,"Heaps","Assign",2);
  7554. RestoreRegisters(saved);
  7555. ELSE
  7556. ToMemory(l.op,addressType,0);
  7557. Emit(Mov(position,l.op,pointer));
  7558. END;
  7559. ReleaseOperand(l);
  7560. result.tag := emptyOperand;
  7561. ELSIF (x.type # NIL) THEN
  7562. result := l; (* temporary variable is the result of NEW Type() *)
  7563. END;
  7564. (* call bodies *)
  7565. CallBodies(pointer,type);
  7566. ReleaseIntermediateOperand(pointer);
  7567. IF (temporaryVariable # NIL) & (x.type = NIL) THEN
  7568. end := NewLabel();
  7569. BrL(end);
  7570. SetLabel(exit);
  7571. Designate(p0,l);
  7572. ToMemory(l.op,addressType,0);
  7573. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  7574. ReleaseOperand(l);
  7575. SetLabel(end);
  7576. ELSE
  7577. SetLabel(exit);
  7578. END;
  7579. END;
  7580. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.ArrayType) THEN
  7581. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  7582. IF ~backend.cooperative THEN (* simpler version *)
  7583. (*
  7584. push len0
  7585. push len1
  7586. push len2
  7587. push len_size
  7588. push len_adr
  7589. push tag
  7590. push static elements
  7591. push element size
  7592. push adr
  7593. *)
  7594. dim := 0;
  7595. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7596. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7597. parameter := x.parameters.GetExpression(i);
  7598. Evaluate(parameter,r);
  7599. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7600. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7601. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7602. END;
  7603. Emit(Push(position,r.op));
  7604. ReleaseOperand(r);
  7605. INC(dim);
  7606. END;
  7607. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7608. Emit(Mov(position, adr, sp));
  7609. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7610. Emit(Push(position, adr));
  7611. ReleaseIntermediateOperand(adr);
  7612. openDim := dim;
  7613. staticLength := 1;
  7614. IF type IS SyntaxTree.ArrayType THEN
  7615. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7616. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7617. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7618. END;
  7619. END;
  7620. IF SemanticChecker.ContainsPointer(type) THEN
  7621. tmp := TypeDescriptorAdr(type);
  7622. ELSE
  7623. tmp := nil;
  7624. END;
  7625. Emit(Push(position,tmp)); (* type descriptor *)
  7626. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* static length *)
  7627. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(type));
  7628. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength))); (* element size *)
  7629. Designate(p0,l);
  7630. Emit(Push(position,l.op)); (* address *)
  7631. ReleaseOperand(l);
  7632. CallThis(position,"Heaps","NewArray", 6);
  7633. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7634. Emit(Add(position,sp,sp,tmp));
  7635. ELSE
  7636. dim := 0;
  7637. IntermediateCode.InitOperand(reg);
  7638. IF p1 # NIL THEN
  7639. FOR i := firstPar TO x.parameters.Length()-1 DO
  7640. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7641. parameter := x.parameters.GetExpression(i);
  7642. Evaluate(parameter,r);
  7643. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7644. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7645. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7646. END;
  7647. Emit(Push(position,r.op));
  7648. IF i=1 THEN
  7649. CopyInt(reg,r.op);
  7650. ELSE
  7651. MulInt(reg, reg, r.op);
  7652. END;
  7653. ReleaseOperand(r);
  7654. INC(dim);
  7655. END;
  7656. Convert(reg,addressType);
  7657. ELSE
  7658. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7659. Emit(Mov(position,reg,IntermediateCode.Immediate(addressType,1)));
  7660. END;
  7661. openDim := dim;
  7662. ASSERT(~(type IS SyntaxTree.ArrayType) OR (type(SyntaxTree.ArrayType).form = SyntaxTree.Static));
  7663. IF backend.cooperative THEN
  7664. size := ToMemoryUnits(system,system.SizeOf(type));
  7665. WHILE type IS SyntaxTree.ArrayType DO
  7666. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7667. END;
  7668. size := size DIV ToMemoryUnits(system,system.SizeOf(type));
  7669. IF (size # 1) THEN
  7670. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7671. END;
  7672. Emit(Push(position,reg));
  7673. size := ToMemoryUnits(system,system.SizeOf(type));
  7674. IF (size # 1) THEN
  7675. MulInt(reg,reg,IntermediateCode.Immediate(addressType,size));
  7676. END;
  7677. AddInt(reg, reg, IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize)));
  7678. (*Emit(Add(position,reg,reg,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(BaseArrayTypeSize + openDim)* system.addressSize))));*)
  7679. Emit(Push(position,reg));
  7680. ReleaseIntermediateOperand(reg);
  7681. CallThis(position,"Runtime","New", 1);
  7682. pointer := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  7683. Emit(Result(position, pointer));
  7684. exit := NewLabel();
  7685. else := NewLabel();
  7686. BreqL(else,pointer,nil);
  7687. IF ~type.hasPointers THEN
  7688. Basic.ToSegmentedName ("BaseTypes.Array",name);
  7689. ELSIF type IS SyntaxTree.RecordType THEN
  7690. Basic.ToSegmentedName ("BaseTypes.RecordArray",name);
  7691. ELSIF type IS SyntaxTree.ProcedureType THEN
  7692. Basic.ToSegmentedName ("BaseTypes.DelegateArray",name);
  7693. ELSE
  7694. Basic.ToSegmentedName ("BaseTypes.PointerArray",name);
  7695. END;
  7696. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,0),IntermediateCode.Address(addressType,name,0,0)));
  7697. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,LengthOffset * system.addressSize))));
  7698. 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))));
  7699. IF type IS SyntaxTree.RecordType THEN
  7700. GetRecordTypeName(type(SyntaxTree.RecordType),name);
  7701. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),IntermediateCode.Address(addressType,name,0,0)));
  7702. ELSE
  7703. Emit(Mov(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,DescriptorOffset * system.addressSize)),nil));
  7704. END;
  7705. i := openDim;
  7706. WHILE i > 0 DO
  7707. DEC (i);
  7708. Emit(Pop(position,IntermediateCode.Memory(addressType,pointer,ToMemoryUnits(system,(BaseArrayTypeSize + i)* system.addressSize))));
  7709. END;
  7710. needsTrace := p0.NeedsTrace();
  7711. IF needsTrace THEN ModifyAssignments(true) END;
  7712. IF ~p0.type.resolved(SyntaxTree.PointerType).isDisposable THEN
  7713. Emit(Push(position, pointer));
  7714. CallThisChecked(position,"GarbageCollector","Watch",0,FALSE);
  7715. Emit(Pop(position, pointer));
  7716. END;
  7717. Designate(p0,l);
  7718. IF needsTrace THEN
  7719. CallAssignPointer(l.op, pointer);
  7720. ModifyAssignments(false);
  7721. ELSE
  7722. ToMemory(l.op,addressType,0);
  7723. Emit(Mov(position,l.op,pointer));
  7724. END;
  7725. ReleaseIntermediateOperand(pointer);
  7726. ReleaseOperand(l);
  7727. BrL(exit);
  7728. SetLabel(else);
  7729. Emit(Add(position,sp,sp,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,(openDim+1)*system.addressSize))));
  7730. Designate(p0,l);
  7731. IF needsTrace THEN
  7732. CallResetProcedure(l.op,l.tag,p0.type.resolved);
  7733. ELSE
  7734. ToMemory(l.op,addressType,0);
  7735. Emit(Mov(position,l.op,pointer));
  7736. END;
  7737. ReleaseOperand(l);
  7738. SetLabel(exit);
  7739. ELSE
  7740. (*! the following code is only correct for "standard" Oberon calling convention *)
  7741. IF SemanticChecker.ContainsPointer(type) THEN
  7742. IF type IS SyntaxTree.ArrayType THEN
  7743. staticLength := 1;
  7744. WHILE (type IS SyntaxTree.ArrayType) DO (* static array *)
  7745. staticLength := staticLength * type(SyntaxTree.ArrayType).staticLength;
  7746. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  7747. END;
  7748. tmp := IntermediateCode.Immediate(reg.type,staticLength);
  7749. MulInt(reg,reg,tmp);
  7750. END;
  7751. Designate(p0,l);
  7752. IF openDim > 0 THEN
  7753. Emit(Push(position,l.op)); (* address for use after syscall *)
  7754. END;
  7755. Emit(Push(position,l.op)); (* address *)
  7756. ReleaseOperand(l);
  7757. tmp := TypeDescriptorAdr(type);
  7758. Emit(Push(position,tmp)); (* type descriptor *)
  7759. ReleaseIntermediateOperand(tmp);
  7760. Emit(Push(position,reg)); (* number Elements *)
  7761. ReleaseIntermediateOperand(reg);
  7762. tmp := IntermediateCode.Immediate(addressType,dim);
  7763. Emit(Push(position,tmp)); (* dimensions *)
  7764. (* push realtime flag *)
  7765. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7766. ELSE Emit(Push(position,false));
  7767. END;
  7768. CallThis(position,"Heaps","NewArr",5)
  7769. ELSE
  7770. size := ToMemoryUnits(system,system.SizeOf(type));
  7771. IF (size # 1) THEN
  7772. MulInt(reg, reg, IntermediateCode.Immediate(addressType,size));
  7773. (*
  7774. Emit(Mul(position,reg,reg,IntermediateCode.Immediate(addressType,size))); (*! optimize the multiplication of immediate operands *)
  7775. *)
  7776. END;
  7777. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,ArrayDimTable * system.addressSize+ system.addressSize+ system.addressSize * 2 * (openDim DIV 2)));
  7778. (* DIV 2 term for some strange alignment, don't understand it at the moment - copied from PCC *)
  7779. AddInt(reg, reg, tmp);
  7780. (*
  7781. Emit(Add(position,reg,reg,tmp));
  7782. *)
  7783. Designate(p0,l);
  7784. IF openDim >0 THEN
  7785. Emit(Push(position,l.op)); (* address for use after syscall *)
  7786. END;
  7787. Emit(Push(position,l.op)); (* address for syscall *)
  7788. ReleaseOperand(l); (* pointer address *)
  7789. Emit(Push(position,reg)); (* size *)
  7790. ReleaseIntermediateOperand(reg);
  7791. (* push realtime flag *)
  7792. IF (p0.type.resolved.isRealtime) THEN Emit(Push(position,true));
  7793. ELSE Emit(Push(position,false));
  7794. END;
  7795. CallThis(position,"Heaps","NewSys", 3)
  7796. END;
  7797. IF openDim > 0 THEN
  7798. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7799. Emit(Pop(position,adr));
  7800. ToMemory(adr,addressType,0);
  7801. ReuseCopy(tmp,adr);
  7802. ReleaseIntermediateOperand(adr);
  7803. adr := tmp;
  7804. else := NewLabel();
  7805. BreqL(else,adr,IntermediateCode.Immediate(addressType,0));
  7806. i := openDim-1;
  7807. IntermediateCode.InitRegister(reg,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7808. WHILE (i >= 0) DO
  7809. Emit(Pop(position,reg));
  7810. IntermediateCode.InitMemory(res,addressType,adr,ToMemoryUnits(system,ArrayDimTable* system.addressSize + system.addressSize*((openDim-1)-i)));
  7811. Emit(Mov(position,res,reg));
  7812. DEC(i);
  7813. END;
  7814. ReleaseIntermediateOperand(adr);
  7815. ReleaseIntermediateOperand(reg);
  7816. exit := NewLabel();
  7817. BrL(exit);
  7818. SetLabel(else);
  7819. (* else part: array could not be allocated *)
  7820. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,openDim*system.addressSize));
  7821. Emit(Add(position,sp,sp,tmp));
  7822. SetLabel(exit);
  7823. END;
  7824. END;
  7825. END;
  7826. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  7827. IF t1 IS SyntaxTree.MathArrayType THEN (* NEW(a, array) *)
  7828. IF GetRuntimeProcedure("FoxArrayBase","AllocateTensorX",procedure,TRUE) THEN
  7829. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  7830. procedureType := procedure.type(SyntaxTree.ProcedureType);
  7831. callingConvention := procedureType.callingConvention;
  7832. left.SetType(procedure.type);
  7833. formalParameter := procedureType.firstParameter;
  7834. (* push array to allocate *)
  7835. PushParameter(p0, formalParameter, callingConvention, FALSE, dummy,-1);
  7836. formalParameter :=formalParameter.nextParameter;
  7837. (* push length array *)
  7838. PushParameter(p1, formalParameter, callingConvention, FALSE, dummy,-1);
  7839. (* push size *)
  7840. type := t0;
  7841. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  7842. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7843. END;
  7844. tmp := IntermediateCode.Immediate(IntermediateCode.GetType(system, system.sizeType),ToMemoryUnits(system,system.SizeOf(type))); (* alignment *)
  7845. Emit(Push(position,tmp));
  7846. (* *)
  7847. IF SemanticChecker.ContainsPointer(type) THEN
  7848. tmp := TypeDescriptorAdr(type);
  7849. ELSE
  7850. tmp := IntermediateCode.Immediate(addressType, 0);
  7851. END;
  7852. Emit(Push(position,tmp)); (* type descriptor *)
  7853. StaticCallOperand(result,procedure);
  7854. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7855. ReleaseOperand(result);
  7856. END;
  7857. (*
  7858. designator := SyntaxTree.NewIdentifierDesignator(InvalidPosition, Global.ArrayBaseName);
  7859. designator := SyntaxTree.NewSelectorDesignator(InvalidPosition, designator, SyntaxTree.NewIdentifier(InvalidPosition, "AllocateTensorX"));
  7860. result := ResolveExpression(SyntaxTree.NewParameterDesignator(InvalidPosition, designator, actualParameters));
  7861. *)
  7862. ELSE
  7863. (*
  7864. push len0
  7865. push len1
  7866. push len2
  7867. push size
  7868. push len_adr
  7869. push element_size
  7870. push tag
  7871. push adr
  7872. *)
  7873. dim := 0;
  7874. IF type(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  7875. isTensor := TRUE;
  7876. ELSE
  7877. isTensor := FALSE;
  7878. END;
  7879. FOR i := x.parameters.Length()-1 TO firstPar BY -1 DO
  7880. IF ~isTensor THEN
  7881. type := type(SyntaxTree.MathArrayType).arrayBase.resolved;
  7882. END;
  7883. parameter := x.parameters.GetExpression(i);
  7884. Evaluate(parameter,r);
  7885. IF (r.op.mode # IntermediateCode.ModeImmediate) & ~isUnchecked THEN
  7886. IntermediateCode.InitImmediate(tmp,IntermediateCode.GetType(system,parameter.type),0);
  7887. TrapC(BrgeL,r.op,tmp,ArraySizeTrap);
  7888. END;
  7889. Emit(Push(position,r.op));
  7890. ReleaseOperand(r);
  7891. INC(dim);
  7892. END;
  7893. IntermediateCode.InitRegister(adr,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  7894. Emit(Mov(position, adr, sp));
  7895. Emit(Push(position, IntermediateCode.Immediate(sizeType, dim)));
  7896. Emit(Push(position, adr));
  7897. ReleaseIntermediateOperand(adr);
  7898. openDim := dim;
  7899. ASSERT(~(type IS SyntaxTree.MathArrayType) OR (type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Static,SyntaxTree.Tensor}));
  7900. IF isTensor THEN
  7901. baseType := SemanticChecker.ArrayBase(type,MAX(LONGINT));
  7902. ELSE
  7903. baseType := SemanticChecker.ArrayBase(type,openDim);
  7904. END;
  7905. staticLength := ToMemoryUnits(system,system.AlignedSizeOf(baseType));
  7906. Emit(Push(position, IntermediateCode.Immediate(sizeType, staticLength)));
  7907. IF SemanticChecker.ContainsPointer(baseType) THEN
  7908. tmp := TypeDescriptorAdr(baseType);
  7909. ELSE
  7910. tmp := nil;
  7911. END;
  7912. Emit(Push(position,tmp)); (* type descriptor *)
  7913. IF isTensor & GetRuntimeProcedure ("FoxArrayBase","AllocateTensorA", procedure, TRUE) THEN
  7914. ELSIF GetRuntimeProcedure ("FoxArrayBase","AllocateArrayA", procedure, TRUE) THEN
  7915. ELSE (* error message has already been emited *)
  7916. RETURN;
  7917. END;
  7918. Designate(p0,l);
  7919. IF isTensor THEN
  7920. Emit(Push(position,l.op)); (* address *)
  7921. ELSE
  7922. Emit(Push(position,l.tag)); (* address *)
  7923. END;
  7924. ReleaseOperand(l);
  7925. StaticCallOperand(result,procedure);
  7926. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  7927. ReleaseOperand(result);
  7928. tmp := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,dim*system.addressSize));
  7929. Emit(Add(position,sp,sp,tmp));
  7930. END;
  7931. ELSIF (type IS SyntaxTree.PointerType) & (type(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.CellType)
  7932. THEN
  7933. IF ~backend.cellsAreObjects THEN RETURN END;
  7934. IF InCellScope(currentScope) THEN
  7935. PushSelfPointer()
  7936. ELSE
  7937. Emit(Push(position, nil));
  7938. END;
  7939. (* push temp address *)
  7940. baseType := type(SyntaxTree.PointerType).pointerBase.resolved;
  7941. temporaryVariable := GetTemporaryVariable(type, FALSE, FALSE (* untraced *));
  7942. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7943. (* l.op contains address of pointer to record *)
  7944. Emit(Push(position,l.op)); (* address for use after syscall *)
  7945. ReleaseOperand(l);
  7946. (* push type descriptor *)
  7947. reg := TypeDescriptorAdr(baseType);
  7948. Emit(Push(position,reg));
  7949. ReleaseIntermediateOperand(reg);
  7950. (* push name *)
  7951. (*Global.GetSymbolName(p0, n);*)
  7952. IF currentScope IS SyntaxTree.ProcedureScope THEN
  7953. Global.GetSymbolName(currentScope(SyntaxTree.ProcedureScope).ownerProcedure, n)
  7954. ELSE
  7955. Global.GetModuleName(module.module, n);
  7956. END;
  7957. Strings.Append(n,"@"); Strings.AppendInt(n, p0.position.start);
  7958. (*type.typeDeclaration.GetName(n);*)
  7959. PushConstString(n);
  7960. (* push cellnet boolean *)
  7961. PushConstBoolean(baseType(SyntaxTree.CellType).isCellNet);
  7962. (* push engine boolean *)
  7963. PushConstBoolean(baseType(SyntaxTree.CellType).FindProperty(Global.NameEngine) # NIL);
  7964. (* allocate *)
  7965. CallThis(position,"ActiveCellsRuntime","Allocate",7);
  7966. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7967. (* l.op contains address of pointer to record *)
  7968. ToMemory(l.op,addressType,0);
  7969. (* l.op contains value of pointer to record *)
  7970. InitFields(baseType, l.op,0);
  7971. (* add capabilities *)
  7972. modifier := p0(SyntaxTree.Designator).modifiers;
  7973. IF (p0 IS SyntaxTree.SymbolDesignator) & (p0(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Variable) THEN
  7974. (*modifier := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers;*)
  7975. AppendModifiers(modifier, p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Variable).modifiers );
  7976. (* AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);*)
  7977. END;
  7978. AppendCellTypeModifiers(modifier, baseType(SyntaxTree.CellType));
  7979. (*
  7980. modifier := baseType(SyntaxTree.CellType).modifiers;
  7981. AddProperties(baseType(SyntaxTree.CellType), temporaryVariable, baseType(SyntaxTree.CellType).firstProperty);
  7982. modifier := p0(SyntaxTree.Designator).modifiers;
  7983. *)
  7984. AddModifiers(baseType(SyntaxTree.CellType), temporaryVariable, modifier);
  7985. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  7986. (* l.op contains address of pointer to record *)
  7987. ToMemory(l.op,addressType,0);
  7988. (* l.op contains value of pointer to record *)
  7989. Emit(Push(position,l.op)); (* address for use after syscall *)
  7990. ReleaseOperand(l);
  7991. CallThis(position,"ActiveCellsRuntime","FinishedProperties",1);
  7992. prevScope := currentScope;
  7993. init := OpenInitializer(temporaryVariable, baseType(SyntaxTree.CellType).cellScope);
  7994. previous := section;
  7995. section := init;
  7996. (* add ports *)
  7997. AddPorts(temporaryVariable, baseType(SyntaxTree.CellType));
  7998. CloseInitializer(previous);
  7999. currentScope := prevScope;
  8000. Symbol(temporaryVariable,l);
  8001. ToMemory(l.op,addressType,0);
  8002. Emit(Push(position,l.op));
  8003. Emit(Call(position,IntermediateCode.Address(addressType, init.name, 0, 0), ToMemoryUnits(system, addressType.sizeInBits)));
  8004. (*
  8005. constructor := type(SyntaxTree.CellType).cellScope.constructor;
  8006. IF constructor # NIL THEN
  8007. parameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8008. FOR i := 1 TO x.parameters.Length()-1 DO
  8009. p := x.parameters.GetExpression(i);
  8010. Global.GetSymbolName(parameter,name);
  8011. Evaluate(p, value);
  8012. ASSERT(value.type # NIL);
  8013. IF value.type.resolved IS SyntaxTree.IntegerType THEN
  8014. par := instance.AddParameter(name);
  8015. par.SetInteger(value.integer);
  8016. ELSIF value.type.resolved IS SyntaxTree.BooleanType THEN
  8017. par := instance.AddParameter(name);
  8018. par.SetBoolean(value.boolean);
  8019. ELSE Error(x.position,NotYetImplemented)
  8020. END;
  8021. parameter := parameter.nextParameter
  8022. END;
  8023. END;
  8024. *)
  8025. (* call initializer *)
  8026. constructor := baseType(SyntaxTree.CellType).cellScope.constructor (*GetConstructor(p0.type.resolved(SyntaxTree.PointerType).pointerBase.resolved(SyntaxTree.RecordType))*);
  8027. IF constructor # NIL THEN
  8028. (*! should be unified with ProcedureCallDesignator *)
  8029. IF backend.cellsAreObjects THEN
  8030. Symbol(temporaryVariable,l);
  8031. ToMemory(l.op,addressType,0);
  8032. Emit(Push(position,l.op));
  8033. ReleaseOperand(l);
  8034. END;
  8035. formalParameter := constructor.type(SyntaxTree.ProcedureType).firstParameter;
  8036. FOR i := firstPar TO x.parameters.Length()-1 DO
  8037. PushParameter(x.parameters.GetExpression(i), formalParameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  8038. formalParameter := formalParameter.nextParameter;
  8039. END;
  8040. (* static call of the constructor *)
  8041. Global.GetSymbolSegmentedName(constructor,name);
  8042. ASSERT(~constructor.isInline);
  8043. IF constructor.scope.ownerModule # module.module THEN
  8044. symbol := NewSection(module.importedSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8045. ELSE
  8046. symbol := NewSection(module.allSections, Sections.CodeSection, name, constructor, commentPrintout # NIL);
  8047. END;
  8048. Emit(Call(position,IntermediateCode.Address(addressType, symbol.name, GetFingerprint(constructor), 0),ProcParametersSize(constructor)));
  8049. (*ELSE
  8050. ReleaseIntermediateOperand(pointer);*)
  8051. END;
  8052. Symbol(temporaryVariable,l); (*Designate(temporaryVariable,l)*)
  8053. ToMemory(l.op, addressType, 0);
  8054. Designate(p0,s0);
  8055. ToMemory(s0.op,addressType,0);
  8056. Emit(Mov(position,s0.op,l.op));
  8057. ReleaseOperand(l);
  8058. ReleaseOperand(s0);
  8059. result.tag := emptyOperand;
  8060. (* start *)
  8061. IF baseType(SyntaxTree.CellType).cellScope.bodyProcedure # NIL THEN
  8062. (* push cell *)
  8063. Symbol(temporaryVariable, l);
  8064. ToMemory(l.op,addressType,0);
  8065. Emit(Push(Basic.invalidPosition,l.op));
  8066. (* push delegate *)
  8067. Emit(Push(Basic.invalidPosition,l.op));
  8068. ReleaseOperand(l);
  8069. StaticCallOperand(s1,baseType(SyntaxTree.CellType).cellScope.bodyProcedure);
  8070. Emit(Push(position, s1.op));
  8071. ReleaseOperand(s1);
  8072. CallThis(position,"ActiveCellsRuntime","Start",3);
  8073. END;
  8074. (*IF temporaryVariable # NIL THEN
  8075. end := NewLabel();
  8076. BrL(end);
  8077. SetLabel(exit);
  8078. Designate(p0,l);
  8079. ToMemory(l.op,addressType,0);
  8080. Emit(Mov(position,l.op,nil)); (* write NIL to adr *)
  8081. ReleaseOperand(l);
  8082. SetLabel(end);
  8083. ELSE
  8084. SetLabel(exit);
  8085. END;
  8086. *)
  8087. (*Error(p0.position,"cannot be allocated in runtime yet");*)
  8088. ELSE (* no pointer to record, no pointer to array *)
  8089. IF ~backend.cellsAreObjects & (type IS SyntaxTree.CellType) THEN
  8090. (* ignore new statement *)
  8091. Warning(p0.position, "cannot run on final hardware");
  8092. ELSE
  8093. HALT(200);
  8094. END;
  8095. END;
  8096. (* ---- ADDRESSOF----- *)
  8097. |Global.systemAdr:
  8098. Designate(p0,s0);
  8099. s0.mode := ModeValue;
  8100. IF (t0 IS SyntaxTree.MathArrayType) & (t0(SyntaxTree.MathArrayType).form = SyntaxTree.Open) THEN
  8101. ReleaseIntermediateOperand(s0.op);
  8102. s0.op := s0.tag;
  8103. IntermediateCode.InitOperand(s0.tag);
  8104. END;
  8105. Convert(s0.op,IntermediateCode.GetType(system,x.type));
  8106. result := s0;
  8107. (* ---- BIT ----- *)
  8108. |Global.systemBit:
  8109. Evaluate(p0,s0);
  8110. ToMemory(s0.op,addressType,0);
  8111. ReuseCopy(res,s0.op);
  8112. ReleaseOperand(s0);
  8113. Evaluate(p1,s1);
  8114. Emit(Ror(position,res,res,s1.op));
  8115. ReleaseOperand(s1);
  8116. Emit(And(position,res,res,IntermediateCode.Immediate(IntermediateCode.GetType(system,p0.type),1)));
  8117. Convert(res,IntermediateCode.GetType(system,system.booleanType));
  8118. IF ~conditional THEN
  8119. InitOperand(result,ModeValue); result.op := res;
  8120. ELSE
  8121. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8122. BrL(falseLabel);
  8123. ReleaseIntermediateOperand(res);
  8124. END;
  8125. (* --- MSK ----*)
  8126. |Global.systemMsk:
  8127. Evaluate(p0,s0);
  8128. Evaluate(p1,s1);
  8129. ReuseCopy(res,s0.op);
  8130. ReleaseOperand(s0);
  8131. Emit(And(position,res,res,s1.op));
  8132. ReleaseOperand(s1);
  8133. InitOperand(result,ModeValue);
  8134. result.op := res;
  8135. (* ---- SYSTEM.GET8|16|32|64 ----- *)
  8136. |Global.systemGet8, Global.systemGet16, Global.systemGet32, Global.systemGet64:
  8137. Evaluate(p0,s0);
  8138. MakeMemory(res,s0.op,IntermediateCode.GetType(system,x.type),0);
  8139. ReleaseOperand(s0);
  8140. InitOperand(result,ModeValue);
  8141. result.op := res;
  8142. (* ---- SYSTEM.GetStackPointer ----- *)
  8143. |Global.systemGetStackPointer:
  8144. InitOperand(result,ModeValue);
  8145. result.op := sp;
  8146. (* ---- SYSTEM.GetFramePointer ----- *)
  8147. |Global.systemGetFramePointer:
  8148. InitOperand(result,ModeValue);
  8149. result.op := fp;
  8150. (* ---- SYSTEM.GetActivity ----- *)
  8151. |Global.systemGetActivity:
  8152. ASSERT(backend.cooperative);
  8153. InitOperand(result,ModeValue);
  8154. result.op := ap;
  8155. (* ---- SYSTEM.SetStackPointer ----- *)
  8156. |Global.systemSetStackPointer:
  8157. Evaluate(p0,s0); (* *)
  8158. Emit(Mov(position,sp,s0.op));
  8159. ReleaseOperand(s0);
  8160. (* ---- SYSTEM.SetFramePointer ----- *)
  8161. |Global.systemSetFramePointer:
  8162. Evaluate(p0,s0); (* *)
  8163. Emit(Mov(position,fp,s0.op));
  8164. ReleaseOperand(s0);
  8165. (* ---- SYSTEM.Activity ----- *)
  8166. |Global.systemSetActivity:
  8167. ASSERT(backend.cooperative);
  8168. Evaluate(p0,s0); (* *)
  8169. Emit(Mov(position,ap,s0.op));
  8170. ReleaseOperand(s0);
  8171. (* ---- SYSTEM.VAL ----- *)
  8172. |Global.systemVal:
  8173. Expression(p1);
  8174. s1 := result;
  8175. type :=p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8176. IF s1.mode = ModeReference THEN
  8177. (* nothing to be done if not record type, just take over new type *)
  8178. IF (type IS SyntaxTree.RecordType) THEN
  8179. ReleaseIntermediateOperand(s1.tag);
  8180. s1.tag := TypeDescriptorAdr(type);
  8181. UseIntermediateOperand(s1.tag);
  8182. END;
  8183. result := s1;
  8184. ELSE (* copy over result to different type, may not use convert *)
  8185. itype := IntermediateCode.GetType(system,type);
  8186. IF itype.sizeInBits = s1.op.type.sizeInBits THEN
  8187. IntermediateCode.InitRegister(s0.op,itype,IntermediateCode.GeneralPurposeRegister,AcquireRegister(itype,IntermediateCode.GeneralPurposeRegister));
  8188. Emit(Mov(position,s0.op,s1.op));
  8189. ReleaseOperand(s1);
  8190. InitOperand(result,ModeValue);
  8191. result.op := s0.op;
  8192. ELSE (* different size, must convert *)
  8193. (*! this is not very clean, should we forbid conversions between operands with different sizes or should we implement a cutting move ??? *)
  8194. Convert(s1.op, IntermediateCode.GetType(system,type));
  8195. result := s1;
  8196. END;
  8197. END;
  8198. (* ---- SYSTEM.GET ----- *)
  8199. |Global.systemGet:
  8200. Evaluate(p0,s0); (* adr *)
  8201. Designate(p1,s1); (* variable *)
  8202. ToMemory(s0.op,IntermediateCode.GetType(system,p1.type),0);
  8203. ToMemory(s1.op,IntermediateCode.GetType(system,p1.type),0);
  8204. Emit(Mov(position,s1.op,s0.op));
  8205. ReleaseOperand(s1);
  8206. ReleaseOperand(s0);
  8207. (* ---- SYSTEM.PUT 8|16|32|64 ----- *)
  8208. |Global.systemPut, Global.systemPut64, Global.systemPut32, Global.systemPut16, Global.systemPut8:
  8209. Evaluate(p0,s0); (* *)
  8210. Evaluate(p1,s1); (* variable *)
  8211. IF p1.type.resolved IS SyntaxTree.ComplexType THEN
  8212. componentType := p1.type.resolved(SyntaxTree.ComplexType).componentType;
  8213. (* real part *)
  8214. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), 0);
  8215. Emit(Mov(position,res, s1.op));
  8216. ReleaseIntermediateOperand(res);
  8217. (* imaginary part *)
  8218. MakeMemory(res, s0.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  8219. Emit(Mov(position,res, s1.tag));
  8220. ReleaseIntermediateOperand(res);
  8221. ReleaseOperand(s1);
  8222. ReleaseOperand(s0);
  8223. ELSE
  8224. MakeMemory(res,s0.op,IntermediateCode.GetType(system,p1.type),0);
  8225. ReleaseOperand(s0);
  8226. Emit(Mov(position,res,s1.op));
  8227. ReleaseIntermediateOperand(res);
  8228. ReleaseOperand(s1);
  8229. END;
  8230. (* ---- SYSTEM.MOVE ----- *)
  8231. |Global.systemMove:
  8232. Evaluate(p0,s0);
  8233. Evaluate(p1,s1);
  8234. Evaluate(p2,s2);
  8235. Emit(Copy(position,s1.op,s0.op,s2.op));
  8236. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8237. (* ---- SYSTEM.NEW ----- *)
  8238. |Global.systemNew:
  8239. Designate(p0,s0);
  8240. Emit(Push(position,s0.op));
  8241. ReleaseOperand(s0);
  8242. Evaluate(p1,s1);
  8243. Emit(Push(position,s1.op));
  8244. ReleaseOperand(s1);
  8245. (* push realtime flag: false by default *)
  8246. Emit(Push(position,false));
  8247. CallThis(position,"Heaps","NewSys",3);
  8248. (* ---- SYSTEM.CALL ----- *)
  8249. |Global.systemRef:
  8250. Basic.ToSegmentedName(p0(SyntaxTree.StringValue).value^, segmentedName);
  8251. callsection := NewSection(module.allSections, Sections.CodeSection, segmentedName, NIL,commentPrintout # NIL);
  8252. s0.mode := ModeValue;
  8253. IntermediateCode.InitAddress(s0.op, addressType, callsection.name, 0, 0);
  8254. result := s0
  8255. (* ---- INCR ----- *)
  8256. |Global.Incr:
  8257. Designate(p0,operand);
  8258. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8259. Dereference(operand,p0.type.resolved,FALSE);
  8260. END;
  8261. ASSERT(p1 # NIL);
  8262. Evaluate(p1,l);
  8263. GetMathArrayIncrement(p0.type.resolved(SyntaxTree.MathArrayType),operand, l.op,TRUE, result);
  8264. ReleaseOperand(operand); ReleaseOperand(l);
  8265. Convert(result.op,IntermediateCode.GetType(system, x.type));
  8266. (* ---- SUM ----- *)
  8267. |Global.Sum: HALT(200);
  8268. (* ---- ALL ----- *)
  8269. |Global.All: HALT(200);
  8270. (* ---- CAS ----- *)
  8271. |Global.Cas:
  8272. needsTrace := p0.NeedsTrace();
  8273. IF needsTrace THEN ModifyAssignments(true) END;
  8274. Designate(p0,s0);
  8275. Evaluate(p1,s1);
  8276. Evaluate(p2,s2);
  8277. IF needsTrace THEN
  8278. Emit(Push(position, s0.op));
  8279. Emit(Push(position, s1.op));
  8280. Emit(Push(position, s2.op));
  8281. CallThis(position,"GarbageCollector","CompareAndSwap",3);
  8282. ELSE
  8283. Emit(Cas(position,s0.op,s1.op,s2.op));
  8284. END;
  8285. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8286. IF needsTrace THEN ModifyAssignments(false) END;
  8287. res := NewRegisterOperand(IntermediateCode.GetType(system, p0.type));
  8288. Emit(Result(position, res)); result.op := res; result.mode := ModeValue;
  8289. IF conditional THEN
  8290. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8291. BrL(falseLabel);
  8292. ReleaseIntermediateOperand(res);
  8293. END;
  8294. (* ---- DIM ----- *)
  8295. |Global.Dim:
  8296. ASSERT(~SemanticChecker.IsArrayStructuredObjectType(p0.type));
  8297. Designate(p0,s0);
  8298. IF p0.type.resolved(SyntaxTree.MathArrayType).form = SyntaxTree.Tensor THEN
  8299. Dereference(s0,p0.type.resolved,FALSE);
  8300. END;
  8301. MathArrayDim(p0.type.resolved(SyntaxTree.MathArrayType),s0.tag,result);
  8302. ReleaseOperand(s0);
  8303. (* ---- RESHAPE ----- *)
  8304. |Global.Reshape:
  8305. IF GetRuntimeProcedure("FoxArrayBase","Reshape",procedure,TRUE) THEN
  8306. left := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition,NIL,procedure);
  8307. left.SetType(procedure.type);
  8308. call := SyntaxTree.NewProcedureCallDesignator(position,left(SyntaxTree.Designator),x.parameters);
  8309. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  8310. END;
  8311. (* ---- SYSTEM.TYPECODE ----- *)
  8312. |Global.systemTypeCode:
  8313. type := p0(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.TypeDeclaration).declaredType;
  8314. IF type.resolved IS SyntaxTree.PointerType THEN
  8315. type := type.resolved(SyntaxTree.PointerType).pointerBase;
  8316. END;
  8317. result.op := TypeDescriptorAdr(type);
  8318. Convert(result.op, IntermediateCode.GetType(system,x.type));
  8319. result.mode := ModeValue;
  8320. (* ---- SYSTEM.TRACE ----- *)
  8321. |Global.systemTrace:
  8322. SystemTrace(x.parameters, x.position);
  8323. (* ----- CONNECT ------*)
  8324. |Global.Connect:
  8325. IF backend.cellsAreObjects THEN
  8326. PushPort(p0);
  8327. PushPort(p1);
  8328. IF p2 # NIL THEN
  8329. Evaluate(p2, s2);
  8330. Emit(Push(p2.position, s2.op));
  8331. ReleaseOperand(s2);
  8332. ELSE
  8333. Emit(Push(Basic.invalidPosition, IntermediateCode.Immediate(int32, -1)));
  8334. END;
  8335. CallThis(position,"ActiveCellsRuntime","Connect",3);
  8336. ELSE
  8337. Warning(x.position, "cannot run on final hardware");
  8338. END;
  8339. (* ----- DELEGATE ------*)
  8340. |Global.Delegate:
  8341. IF backend.cellsAreObjects THEN
  8342. PushPort(p0);
  8343. PushPort(p1);
  8344. CallThis(position,"ActiveCellsRuntime","Delegate",2);
  8345. ELSE
  8346. Warning(x.position, "cannot run on final hardware");
  8347. END;
  8348. (* ----- SEND ------*)
  8349. |Global.Send:
  8350. Evaluate(p0,s0);
  8351. Evaluate(p1,s1);
  8352. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8353. Emit(Push(position,s0.op));
  8354. Emit(Push(position,s1.op));
  8355. (*
  8356. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8357. *)
  8358. IF ~backend.cellsAreObjects THEN
  8359. IF size # 1 THEN Error(p1.position,"send not implemented for complex data types") END;
  8360. END;
  8361. ReleaseOperand(s0);
  8362. ReleaseOperand(s1);
  8363. IF backend.cellsAreObjects THEN
  8364. CallThis(position,"ActiveCellsRuntime","Send",2);
  8365. ELSE
  8366. CallThis(position,ChannelModuleName,"Send",2);
  8367. END;
  8368. (* ----- RECEIVE ------*)
  8369. |Global.Receive:
  8370. Evaluate(p0,s0);
  8371. Emit(Push(position,s0.op));
  8372. Designate(p1,s1);
  8373. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  8374. Emit(Push(position,s1.op));
  8375. IF p2 # NIL THEN
  8376. Designate(p2,s2);
  8377. Emit(Push(position,s2.op));
  8378. END;
  8379. (*
  8380. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  8381. *)
  8382. IF ~backend.cellsAreObjects THEN
  8383. IF size # 1 THEN Error(p1.position,"receive not implemented for complex data types") END;
  8384. END;
  8385. ReleaseOperand(s0);
  8386. ReleaseOperand(s1);
  8387. ReleaseOperand(s2);
  8388. IF backend.cellsAreObjects THEN
  8389. IF p2 = NIL THEN
  8390. CallThis(position,"ActiveCellsRuntime","Receive",2)
  8391. ELSE
  8392. CallThis(position,"ActiveCellsRuntime","ReceiveNonBlockingVar",3)
  8393. END;
  8394. ELSE
  8395. IF p2 = NIL THEN
  8396. CallThis(position,ChannelModuleName,"Receive",2)
  8397. ELSE
  8398. CallThis(position,ChannelModuleName,"ReceiveNonBlockingVar",3)
  8399. END;
  8400. END;
  8401. | Global.systemSpecial:
  8402. customBuiltin := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.CustomBuiltin);
  8403. ASSERT(customBuiltin.type IS SyntaxTree.ProcedureType);
  8404. procedureType := customBuiltin.type(SyntaxTree.ProcedureType);
  8405. (* determine if parameters are of the VAR kind *)
  8406. ASSERT(x.parameters.Length() <= 3);
  8407. formalParameter := procedureType.firstParameter;
  8408. FOR i := 0 TO x.parameters.Length() - 1 DO
  8409. isVarPar[i] := formalParameter.kind = SyntaxTree.VarParameter;
  8410. formalParameter := formalParameter.nextParameter
  8411. END;
  8412. IF p0 # NIL THEN IF isVarPar[0] THEN Designate(p0, s0) ELSE Evaluate(p0,s0) END ELSE InitOperand(s0, ModeValue) END;
  8413. IF p1 # NIL THEN IF isVarPar[1] THEN Designate(p1, s1) ELSE Evaluate(p1,s1) END ELSE InitOperand(s1, ModeValue) END;
  8414. IF p2 # NIL THEN IF isVarPar[2] THEN Designate(p2, s2) ELSE Evaluate(p2,s2) END ELSE InitOperand(s2, ModeValue) END;
  8415. Emit(SpecialInstruction(x.position, customBuiltin.subType,s0.op, s1.op, s2.op));
  8416. ReleaseOperand(s0); ReleaseOperand(s1); ReleaseOperand(s2);
  8417. IF procedureType.returnType # NIL THEN
  8418. res := NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  8419. Emit(Result(position, res));
  8420. (*InitOperand(result,ModeValue);
  8421. result.op := res;
  8422. *)
  8423. IF ~conditional THEN
  8424. InitOperand(result,ModeValue); result.op := res;
  8425. ELSE
  8426. BreqL(trueLabel,IntermediateCode.Immediate(res.type,1),res);
  8427. BrL(falseLabel);
  8428. ReleaseIntermediateOperand(res);
  8429. END;
  8430. END
  8431. ELSE (* function not yet implemented *)
  8432. Error(position,"not yet implemented");
  8433. END;
  8434. destination := dest;
  8435. IF Trace THEN TraceExit("VisitBuiltinCallDesignator") END;
  8436. END VisitBuiltinCallDesignator;
  8437. PROCEDURE VisitTypeGuardDesignator*(x: SyntaxTree.TypeGuardDesignator);
  8438. VAR trueL,falseL: Label; recordType: SyntaxTree.RecordType; dest,tag,ptr: IntermediateCode.Operand;
  8439. BEGIN
  8440. IF Trace THEN TraceEnter("VisitTypeGuardDesignator") END;
  8441. dest := destination; destination := emptyOperand;
  8442. Expression(x.left);
  8443. IF x.left.type.resolved = x.type.resolved THEN (* always true: do nothing *)
  8444. ELSIF isUnchecked THEN (* no check *)
  8445. ELSE
  8446. trueL := NewLabel();
  8447. falseL := NewLabel();
  8448. IF IsPointerToRecord(x.left.type,recordType) THEN
  8449. IntermediateCode.InitRegister(tag,addressType,IntermediateCode.GeneralPurposeRegister,AcquireRegister(addressType,IntermediateCode.GeneralPurposeRegister));
  8450. Emit(Mov(position,tag, result.op));
  8451. IF result.mode # ModeValue THEN
  8452. ptr := tag;
  8453. IntermediateCode.MakeMemory(ptr,addressType);
  8454. Emit(Mov(position,tag, ptr));
  8455. END;
  8456. IF ~backend.cooperative THEN
  8457. IntermediateCode.AddOffset(tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8458. END;
  8459. IntermediateCode.MakeMemory(tag,addressType);
  8460. ELSE
  8461. tag := result.tag;
  8462. UseIntermediateOperand(tag);
  8463. END;
  8464. TypeTest(tag,x.type,trueL,falseL);
  8465. ReleaseIntermediateOperand(tag);
  8466. SetLabel(falseL);
  8467. EmitTrap(position,TypeCheckTrap);
  8468. SetLabel(trueL);
  8469. END;
  8470. destination := dest;
  8471. IF Trace THEN TraceExit("VisitTypeGuardDesignator") END;
  8472. END VisitTypeGuardDesignator;
  8473. PROCEDURE Dereference(VAR operand: Operand; type: SyntaxTree.Type; isUnsafe: BOOLEAN);
  8474. VAR dereferenced: IntermediateCode.Operand; arrayDataOffset: LONGINT;
  8475. PROCEDURE NilCheck(CONST op: IntermediateCode.Operand);
  8476. VAR label: Label; pc: LONGINT;
  8477. BEGIN
  8478. IF backend.cooperative & ~isUnchecked THEN
  8479. pc := section.pc;
  8480. label := NewLabel();
  8481. BrneL(label, operand.op, nil);
  8482. EmitTrap(position, NilPointerTrap);
  8483. SetLabel(label);
  8484. INC(statCoopNilCheck, section.pc - pc);
  8485. END;
  8486. END NilCheck;
  8487. BEGIN
  8488. LoadValue(operand,system.addressType); (* in case operand is not a value yet *)
  8489. ReuseCopy(dereferenced,operand.op);
  8490. ReleaseOperand(operand);
  8491. operand.mode := ModeReference;
  8492. operand.op := dereferenced;
  8493. operand.tag := dereferenced;
  8494. UseIntermediateOperand(operand.tag);
  8495. IF (type=NIL) OR (type IS SyntaxTree.RecordType)OR (type IS SyntaxTree.CellType) THEN
  8496. IF isUnsafe & ((type = NIL) OR ~type(SyntaxTree.RecordType).isObject) THEN
  8497. ReleaseIntermediateOperand(operand.tag);
  8498. operand.tag := TypeDescriptorAdr(type);
  8499. ELSE
  8500. IF ~backend.cooperative THEN
  8501. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,-addressType.sizeInBits));
  8502. END;
  8503. IntermediateCode.MakeMemory(operand.tag,addressType);
  8504. END;
  8505. NilCheck(operand.op);
  8506. ELSIF type IS SyntaxTree.ArrayType THEN
  8507. IF isUnsafe THEN
  8508. NilCheck(operand.op);
  8509. ReleaseIntermediateOperand(operand.tag);
  8510. IF type(SyntaxTree.ArrayType).form = SyntaxTree.Static THEN
  8511. IntermediateCode.InitImmediate(operand.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8512. ELSE
  8513. operand.tag := emptyOperand;
  8514. END;
  8515. ELSE
  8516. NilCheck(operand.op);
  8517. IF backend.cooperative THEN
  8518. arrayDataOffset := (BaseArrayTypeSize + DynamicDim(type)) * addressType.sizeInBits;
  8519. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8520. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,BaseArrayTypeSize*system.addressSize));
  8521. ELSE
  8522. arrayDataOffset := DynamicDim(type) * addressType.sizeInBits + 3 * addressType.sizeInBits;
  8523. INC(arrayDataOffset, (-arrayDataOffset) MOD ArrayAlignment); (* round up to multiple of ArrayAlignment to ensure that first array element is aligned at 0 MOD ArrayAlignment *)
  8524. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,arrayDataOffset));
  8525. IntermediateCode.AddOffset(operand.tag,ToMemoryUnits(system,ArrayDimTable*system.addressSize))
  8526. END;
  8527. END;
  8528. ELSIF type IS SyntaxTree.MathArrayType THEN
  8529. IntermediateCode.AddOffset(operand.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8530. IntermediateCode.MakeMemory(operand.op,addressType);
  8531. ELSE HALT(100);
  8532. END;
  8533. END Dereference;
  8534. PROCEDURE VisitDereferenceDesignator*(x: SyntaxTree.DereferenceDesignator);
  8535. VAR type: SyntaxTree.Type; d: Operand; dest: IntermediateCode.Operand;prevIsUnchecked: BOOLEAN;
  8536. BEGIN
  8537. IF Trace THEN TraceEnter("VisitDereferenceDesignator") END;
  8538. dest := destination; destination := emptyOperand;
  8539. Evaluate(x.left,d);
  8540. type := x.type.resolved;
  8541. prevIsUnchecked := isUnchecked;
  8542. IF (x.left # NIL) & (x.left IS SyntaxTree.SelfDesignator) THEN
  8543. isUnchecked := TRUE; (* avoid NIL-pointer-check for SELF pointer *)
  8544. END;
  8545. Dereference(d,type,IsUnsafePointer(x.left.type));
  8546. isUnchecked := prevIsUnchecked;
  8547. result := d;
  8548. 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
  8549. IF (type IS SyntaxTree.RecordType) & ~type(SyntaxTree.RecordType).isObject THEN
  8550. IntermediateCode.AddOffset(result.op,BaseRecordTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8551. END;
  8552. END;
  8553. destination := dest;
  8554. IF Trace THEN TraceExit("VisitDereferenceDesignator") END;
  8555. END VisitDereferenceDesignator;
  8556. PROCEDURE VisitSupercallDesignator*(x: SyntaxTree.SupercallDesignator);
  8557. VAR procedure: SyntaxTree.Procedure; tag: IntermediateCode.Operand; dest: IntermediateCode.Operand;
  8558. BEGIN
  8559. IF Trace THEN TraceEnter("VisitSupercallDesignator") END;
  8560. dest := destination; destination := emptyOperand;
  8561. Designate(x.left(SyntaxTree.SymbolDesignator).left,result);
  8562. tag := result.op;
  8563. (*ReleaseIntermediateOperand(result.tag); not necessary -- done in StaticCallOperand *)
  8564. procedure := x.left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Procedure);
  8565. StaticCallOperand(result,procedure.super);
  8566. ReleaseIntermediateOperand(result.tag);
  8567. UseIntermediateOperand(tag); (* necessary ? *)
  8568. result.tag := tag;
  8569. destination := dest;
  8570. IF Trace THEN TraceExit("VisitSupercallDesignator") END;
  8571. END VisitSupercallDesignator;
  8572. PROCEDURE VisitSelfDesignator*(x: SyntaxTree.SelfDesignator);
  8573. VAR basereg: IntermediateCode.Operand; scope: SyntaxTree.Scope; dest: IntermediateCode.Operand;
  8574. moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT;
  8575. name: Basic.SegmentedName;
  8576. procedure: SyntaxTree.Procedure;
  8577. procedureType: SyntaxTree.ProcedureType;
  8578. BEGIN
  8579. IF Trace THEN TraceEnter("VisitSelfDesignator") END;
  8580. dest := destination; destination := emptyOperand;
  8581. scope := currentScope;
  8582. WHILE (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.ProcedureScope) DO
  8583. scope := scope.outerScope;
  8584. END;
  8585. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  8586. moduleSection := meta.ModuleSection();
  8587. IF backend.cooperative THEN
  8588. moduleOffset := 0;
  8589. ELSE
  8590. moduleOffset := moduleSection.pc;
  8591. END;
  8592. result.mode := ModeValue;
  8593. result.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  8594. ELSIF (scope.outerScope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8595. result.mode := ModeValue;
  8596. Global.GetSymbolSegmentedName(scope.outerScope(SyntaxTree.CellScope).ownerCell.typeDeclaration, name);
  8597. result.op := IntermediateCode.Address(addressType, name, 0, moduleOffset);
  8598. ELSE
  8599. GetBaseRegister(basereg,currentScope,scope);
  8600. InitOperand(result,ModeReference);
  8601. result.op := basereg;
  8602. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  8603. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8604. parametersSize := ProcParametersSize(procedure);
  8605. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  8606. IF backend.cooperative THEN
  8607. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,addressType.sizeInBits));
  8608. END;
  8609. IF ~(x.type.resolved.IsPointer() OR (x.type.resolved IS SyntaxTree.CellType) & backend.cellsAreObjects) THEN (* var par ! *)
  8610. MakeMemory(result.op, result.op, addressType, 0);
  8611. END;
  8612. (* tag must be loaded when dereferencing SELF pointer *)
  8613. END;
  8614. destination := dest;
  8615. IF Trace THEN TraceExit("VisitSelfDesignator") END;
  8616. END VisitSelfDesignator;
  8617. PROCEDURE VisitResultDesignator*(x: SyntaxTree.ResultDesignator);
  8618. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; map: SymbolMap;
  8619. BEGIN
  8620. IF Trace THEN TraceEnter("VisitResultDesignator") END;
  8621. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  8622. procedureType := procedure.type(SyntaxTree.ProcedureType);
  8623. parameter := procedureType.returnParameter;
  8624. IF currentIsInline THEN
  8625. map := currentMapper.Get(NIL);
  8626. IF map # NIL THEN
  8627. Designate(map.to, result);
  8628. ELSE
  8629. HALT(200);
  8630. END;
  8631. RETURN;
  8632. END;
  8633. VisitParameter(parameter);
  8634. IF Trace THEN TraceExit("VisitResultDesignator") END;
  8635. END VisitResultDesignator;
  8636. (** values *)
  8637. PROCEDURE VisitBooleanValue*(x: SyntaxTree.BooleanValue);
  8638. BEGIN
  8639. IF Trace THEN TraceEnter("VisitBooleanValue") END;
  8640. IF conditional THEN
  8641. IF x.value THEN BrL(trueLabel)
  8642. ELSE BrL(falseLabel)
  8643. END;
  8644. ELSE
  8645. InitOperand(result,ModeValue);
  8646. IF x.value THEN result.op := true ELSE result.op := false END;
  8647. END;
  8648. END VisitBooleanValue;
  8649. PROCEDURE GetDataSection*(): IntermediateCode.Section;
  8650. VAR name: Basic.SegmentedName; section: IntermediateCode.Section;
  8651. BEGIN
  8652. Global.GetModuleSegmentedName(module.module, name);
  8653. Basic.SuffixSegmentedName(name,Basic.MakeString("@Immediates"));
  8654. section := NewSection(module.allSections, Sections.ConstSection, name,NIL, dump # NIL);
  8655. RETURN section
  8656. END GetDataSection;
  8657. PROCEDURE GetImmediateMem(VAR vop: IntermediateCode.Operand);
  8658. VAR data: IntermediateCode.Section;pc: LONGINT; type: IntermediateCode.Type;
  8659. BEGIN
  8660. type := vop.type;
  8661. data := GetDataSection();
  8662. pc := EnterImmediate(data,vop);
  8663. IntermediateCode.InitAddress(vop, addressType, data.name, 0, pc);
  8664. IntermediateCode.MakeMemory(vop, type);
  8665. END GetImmediateMem;
  8666. PROCEDURE VisitIntegerValue*(x: SyntaxTree.IntegerValue);
  8667. BEGIN
  8668. IF Trace THEN TraceEnter("VisitIntegerValue") END;
  8669. InitOperand(result,ModeValue);
  8670. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8671. IF ~supportedImmediate(result.op) &~inData THEN
  8672. GetImmediateMem(result.op)
  8673. END;
  8674. END VisitIntegerValue;
  8675. PROCEDURE VisitCharacterValue*(x: SyntaxTree.CharacterValue);
  8676. BEGIN
  8677. IF Trace THEN TraceEnter("VisitCharacterValue") END;
  8678. InitOperand(result,ModeValue);
  8679. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),ORD(x.value));
  8680. END VisitCharacterValue;
  8681. PROCEDURE VisitSetValue*(x: SyntaxTree.SetValue);
  8682. BEGIN
  8683. IF Trace THEN TraceEnter("VisitSetValue") END;
  8684. InitOperand(result,ModeValue);
  8685. IntermediateCode.InitImmediate(result.op,IntermediateCode.GetType(system,x.type),SYSTEM.VAL(Basic.Integer,x.value));
  8686. END VisitSetValue;
  8687. PROCEDURE VisitMathArrayValue*(x: SyntaxTree.MathArrayValue);
  8688. VAR irv: IntermediateCode.Section; name:Basic.SegmentedName;
  8689. PROCEDURE RecursiveData(x: SyntaxTree.MathArrayExpression);
  8690. VAR numberElements,i: LONGINT; expression: SyntaxTree.Expression; op: Operand;
  8691. BEGIN
  8692. numberElements := x.elements.Length();
  8693. FOR i := 0 TO numberElements-1 DO
  8694. expression := x.elements.GetExpression(i);
  8695. IF expression IS SyntaxTree.MathArrayExpression THEN
  8696. RecursiveData(expression(SyntaxTree.MathArrayExpression));
  8697. ELSE
  8698. inData := TRUE;
  8699. Evaluate(expression,op);
  8700. irv.Emit(Data(position,op.op));
  8701. inData := FALSE;
  8702. ReleaseOperand(op);
  8703. END;
  8704. END;
  8705. END RecursiveData;
  8706. BEGIN
  8707. IF Trace THEN TraceEnter("VisitMathArrayValue") END;
  8708. IF ~TryConstantDeclaration() THEN
  8709. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8710. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8711. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8712. irv := NewSection(module.allSections,Sections.ConstSection,name,constantDeclaration,commentPrintout # NIL);
  8713. ELSE
  8714. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8715. END;
  8716. RecursiveData(x.array);
  8717. InitOperand(result,ModeReference);
  8718. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8719. END
  8720. END VisitMathArrayValue;
  8721. PROCEDURE TryConstantDeclaration(): BOOLEAN;
  8722. VAR constant: Sections.Section;
  8723. BEGIN
  8724. IF constantDeclaration = NIL THEN
  8725. RETURN FALSE
  8726. ELSE
  8727. (* Is a constant in this module: did we generate it already? *)
  8728. constant := module.allSections.FindBySymbol(constantDeclaration); (*TODO*)
  8729. IF constant # NIL THEN
  8730. InitOperand(result,ModeReference);
  8731. IntermediateCode.InitAddress(result.op,addressType,constant.name,GetFingerprint(constant.symbol), 0);
  8732. RETURN TRUE;
  8733. END;
  8734. END;
  8735. RETURN FALSE
  8736. END TryConstantDeclaration;
  8737. PROCEDURE VisitConstant*(x: SyntaxTree.Constant);
  8738. BEGIN
  8739. constantDeclaration := x;
  8740. x.value.resolved.Accept(SELF);
  8741. END VisitConstant;
  8742. PROCEDURE VisitRealValue*(x: SyntaxTree.RealValue);
  8743. BEGIN
  8744. IF Trace THEN TraceEnter("VisitRealValue") END;
  8745. InitOperand(result,ModeValue);
  8746. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,x.type),x.value);
  8747. END VisitRealValue;
  8748. PROCEDURE VisitComplexValue*(x: SyntaxTree.ComplexValue);
  8749. VAR
  8750. componentType: SyntaxTree.Type;
  8751. BEGIN
  8752. IF Trace THEN TraceEnter("VisitComplexValue") END;
  8753. ASSERT(x.type IS SyntaxTree.ComplexType);
  8754. componentType := x.type(SyntaxTree.ComplexType).componentType;
  8755. InitOperand(result,ModeValue);
  8756. IntermediateCode.InitFloatImmediate(result.op,IntermediateCode.GetType(system,componentType),x.realValue); (* real part *)
  8757. IntermediateCode.InitFloatImmediate(result.tag,IntermediateCode.GetType(system,componentType),x.imagValue); (* imaginary part *)
  8758. END VisitComplexValue;
  8759. PROCEDURE VisitStringValue*(x: SyntaxTree.StringValue);
  8760. VAR i: LONGINT; name: Basic.SegmentedName;
  8761. irv: IntermediateCode.Section; op: IntermediateCode.Operand;
  8762. BEGIN
  8763. IF Trace THEN TraceEnter("VisitStringValue") END;
  8764. IF ~TryConstantDeclaration() THEN
  8765. IF constantDeclaration = NIL THEN constantDeclaration:=BuildConstant(module.module,x,constId) END;
  8766. GetCodeSectionNameForSymbol(constantDeclaration,name);
  8767. IF (constantDeclaration.scope = NIL) OR (constantDeclaration.scope.ownerModule = module.module) THEN
  8768. irv := NewSection(module.allSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8769. ELSE
  8770. irv := NewSection(module.importedSections, Sections.ConstSection, name,constantDeclaration,commentPrintout # NIL);
  8771. END;
  8772. FOR i := 0 TO x.length-1 DO
  8773. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(system,system.characterType),ORD(x.value[i]));
  8774. irv.Emit(Data(position,op));
  8775. END;
  8776. InitOperand(result,ModeReference);
  8777. IntermediateCode.InitAddress(result.op, addressType, irv.name, GetFingerprint(irv.symbol), 0);
  8778. result.tag := IntermediateCode.Immediate(addressType,x.length);
  8779. END
  8780. END VisitStringValue;
  8781. PROCEDURE VisitNilValue*(x: SyntaxTree.NilValue);
  8782. BEGIN
  8783. IF Trace THEN TraceEnter("VisitNilValue") END;
  8784. InitOperand(result,ModeValue);
  8785. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8786. result.tag := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),0);
  8787. END VisitNilValue;
  8788. PROCEDURE VisitEnumerationValue*(x: SyntaxTree.EnumerationValue);
  8789. BEGIN
  8790. IF Trace THEN TraceEnter("VisitEnumerationValue") END;
  8791. InitOperand(result,ModeValue);
  8792. result.op := IntermediateCode.Immediate(IntermediateCode.GetType(system,x.type),x.value);
  8793. END VisitEnumerationValue;
  8794. (** symbols *)
  8795. PROCEDURE VisitImport*(x: SyntaxTree.Import);
  8796. BEGIN (* nothing to be done, might however be called via some designator module.procedure *)
  8797. END VisitImport;
  8798. PROCEDURE GetBaseRegister(VAR result: IntermediateCode.Operand; scope,baseScope: SyntaxTree.Scope);
  8799. VAR left,right: IntermediateCode.Operand;level: LONGINT;
  8800. BEGIN
  8801. IF scope # baseScope THEN
  8802. (* left := [fp+8] *)
  8803. IntermediateCode.InitMemory(right,addressType,fp,ToMemoryUnits(system,2*addressType.sizeInBits));
  8804. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8805. ReuseCopy(left,right);
  8806. ReleaseIntermediateOperand(right);
  8807. scope := scope.outerScope; DEC(level);
  8808. (* { left := [left+8] } *)
  8809. IntermediateCode.InitMemory(right,addressType,left,ToMemoryUnits(system,2*addressType.sizeInBits));
  8810. IF backend.cooperative OR backend.preciseGC THEN IntermediateCode.AddOffset (right, ToMemoryUnits(system,addressType.sizeInBits)) END;
  8811. WHILE (scope # baseScope) & (scope IS SyntaxTree.ProcedureScope) DO
  8812. Emit(Mov(position,left,right));
  8813. scope := scope.outerScope; DEC(level);
  8814. END;
  8815. ASSERT((scope = baseScope) OR (baseScope = NIL));
  8816. result := left;
  8817. ELSE
  8818. result := fp;
  8819. END;
  8820. END GetBaseRegister;
  8821. PROCEDURE VisitVariable*(x: SyntaxTree.Variable);
  8822. VAR symbol: Sections.Section; type: SyntaxTree.Type; recordType: SyntaxTree.RecordType; name: Basic.SegmentedName; temp: IntermediateCode.Operand; reg: LONGINT;
  8823. BEGIN
  8824. IF Trace THEN TraceEnter("VisitVariable"); END;
  8825. type := x.type.resolved;
  8826. IF (x.useRegister) THEN
  8827. InitOperand(result, ModeValue);
  8828. IF x.registerNumber < 0 THEN
  8829. x.SetRegisterNumber(AcquireRegister(IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister));
  8830. reg := x.registerNumber;
  8831. ELSE
  8832. reg := registerUsageCount.Map(x.registerNumber);
  8833. UseRegister(reg);
  8834. END;
  8835. IntermediateCode.InitRegister(result.op,IntermediateCode.GetType(system, type),IntermediateCode.GeneralPurposeRegister,reg);
  8836. ELSIF x.externalName # NIL THEN
  8837. InitOperand(result,ModeReference);
  8838. Basic.ToSegmentedName(x.externalName^, name);
  8839. IntermediateCode.InitAddress(result.op, addressType, name, 0, 0);
  8840. ELSIF (x.scope IS SyntaxTree.ProcedureScope) THEN (* local variable (potentially via nested procedure) *)
  8841. InitOperand(result,ModeReference);
  8842. GetBaseRegister(result.op,currentScope,x.scope);
  8843. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8844. ELSIF (x.scope = moduleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN (* global variable *)
  8845. InitOperand(result,ModeReference);
  8846. GetCodeSectionNameForSymbol(x,name);
  8847. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8848. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8849. ELSIF x.scope IS SyntaxTree.ModuleScope THEN (* global variable in imported module *)
  8850. InitOperand(result,ModeReference);
  8851. GetCodeSectionNameForSymbol(x,name);
  8852. symbol := NewSection(module.importedSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8853. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0)
  8854. ELSE (* field, left designator must have been emitted *)
  8855. ASSERT(result.mode = ModeReference);
  8856. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8857. ReuseCopy(temp,result.op);
  8858. ReleaseIntermediateOperand(result.op);
  8859. result.op := temp;
  8860. END;
  8861. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8862. IF backend.cooperative & (x.scope IS SyntaxTree.RecordScope) THEN
  8863. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  8864. IF recordType.isObject & ~recordType.pointerType.isPlain THEN
  8865. IntermediateCode.AddOffset(result.op,BaseObjectTypeSize * ToMemoryUnits(system,addressType.sizeInBits));
  8866. END;
  8867. END;
  8868. END;
  8869. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  8870. ValueToCondition(result);
  8871. ELSIF type IS SyntaxTree.ProcedureType THEN
  8872. ReleaseIntermediateOperand(result.tag);
  8873. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  8874. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  8875. UseIntermediateOperand(result.tag);
  8876. ELSE
  8877. result.tag := nil; (* nil *)
  8878. END;
  8879. ELSIF (type IS SyntaxTree.ArrayType) THEN
  8880. IF type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic THEN
  8881. IF (x.scope IS SyntaxTree.ModuleScope) OR (x.scope IS SyntaxTree.CellScope) & ~backend.cellsAreObjects THEN
  8882. ReleaseIntermediateOperand(result.tag);
  8883. Global.GetSymbolSegmentedName(x,name);
  8884. Basic.SuffixSegmentedName (name, Basic.MakeString ("@len"));
  8885. symbol := NewSection(module.allSections, Sections.VarSection, name,NIL ,commentPrintout # NIL);
  8886. IntermediateCode.InitAddress(result.tag, addressType, symbol.name,0 , 0);
  8887. ELSE
  8888. END;
  8889. ELSE
  8890. ReleaseIntermediateOperand(result.tag);
  8891. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8892. END;
  8893. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  8894. IF type(SyntaxTree.MathArrayType).form IN {SyntaxTree.Open} THEN
  8895. ReleaseIntermediateOperand(result.tag);
  8896. result.tag := result.op;
  8897. UseIntermediateOperand(result.tag);
  8898. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8899. IntermediateCode.MakeMemory(result.op,addressType);
  8900. END;
  8901. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType = NIL) THEN
  8902. ReleaseIntermediateOperand(result.tag);
  8903. result.tag := TypeDescriptorAdr(type);
  8904. UseIntermediateOperand(result.tag);
  8905. (* tag for pointer type computed not here but during dereferencing *)
  8906. END;
  8907. IF Trace THEN TraceExit("VisitVariable") END;
  8908. END VisitVariable;
  8909. PROCEDURE VisitProperty*(property: SyntaxTree.Property);
  8910. BEGIN
  8911. VisitVariable(property);
  8912. END VisitProperty;
  8913. PROCEDURE VisitParameter*(x: SyntaxTree.Parameter);
  8914. VAR type: SyntaxTree.Type; basereg, mem: IntermediateCode.Operand; parameter: SyntaxTree.Parameter;adr: LONGINT; symbol: Sections.Section;
  8915. name: Basic.SegmentedName; parameterType, ptype: SyntaxTree.Type; len,inc: LONGINT; temp: IntermediateCode.Operand;
  8916. BEGIN
  8917. type := x.type.resolved;
  8918. IF Trace THEN TraceEnter("VisitParameter") END;
  8919. IF x.ownerType IS SyntaxTree.CellType THEN
  8920. ptype := x.type.resolved;
  8921. IF backend.cellsAreObjects THEN
  8922. ASSERT(result.mode = ModeReference);
  8923. IF result.op.mode = IntermediateCode.ModeMemory THEN
  8924. ReuseCopy(temp,result.op);
  8925. ReleaseIntermediateOperand(result.op);
  8926. result.op := temp;
  8927. END;
  8928. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8929. RETURN;
  8930. ELSE
  8931. InitOperand(result,ModeReference);
  8932. GetCodeSectionNameForSymbol(x,name);
  8933. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8934. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8935. RETURN;
  8936. END;
  8937. ELSIF ~backend.cellsAreObjects & (currentScope IS SyntaxTree.ProcedureScope) & (currentScope(SyntaxTree.ProcedureScope).ownerProcedure.isConstructor) & (currentScope.outerScope IS SyntaxTree.CellScope) THEN
  8938. InitOperand(result,ModeReference);
  8939. GetCodeSectionNameForSymbol(x,name);
  8940. symbol := NewSection(module.allSections, Sections.VarSection, name,x,commentPrintout # NIL);
  8941. IntermediateCode.InitAddress(result.op, addressType, symbol.name, GetFingerprint(symbol.symbol), 0);
  8942. RETURN
  8943. ELSE
  8944. GetBaseRegister(basereg,currentScope,x.scope);
  8945. InitOperand(result,ModeReference);
  8946. result.op := basereg;
  8947. END;
  8948. IF IsOpenArray(type) THEN
  8949. result.tag := basereg;
  8950. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8951. IntermediateCode.MakeMemory(result.op,addressType);
  8952. IF Global.IsOberonProcedure(x.ownerType) THEN
  8953. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+addressType.sizeInBits));
  8954. UseIntermediateOperand(result.tag);
  8955. ELSE
  8956. IntermediateCode.InitImmediate(result.tag,addressType,MAX(LONGINT)); (* non-Oberon procedure => unbounded array length *)
  8957. END;
  8958. ELSIF IsStaticArray(type) & (x.kind = SyntaxTree.ValueParameter) THEN
  8959. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8960. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8961. ELSIF IsStaticArray(type) THEN
  8962. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8963. IntermediateCode.MakeMemory(result.op,addressType);
  8964. IntermediateCode.InitImmediate(result.tag,addressType,type(SyntaxTree.ArrayType).staticLength);
  8965. ELSIF type IS SyntaxTree.MathArrayType THEN
  8966. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8967. WITH type: SyntaxTree.MathArrayType DO
  8968. IF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  8969. IF type.form = SyntaxTree.Tensor THEN
  8970. ELSIF type.form = SyntaxTree.Open THEN
  8971. result.tag := result.op;
  8972. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8973. IntermediateCode.MakeMemory(result.op,addressType);
  8974. UseIntermediateOperand(result.tag);
  8975. ELSIF type.form = SyntaxTree.Static THEN
  8976. IF x.kind = SyntaxTree.ConstParameter THEN
  8977. IntermediateCode.MakeMemory(result.op,addressType);
  8978. END;
  8979. ELSE HALT(100)
  8980. END;
  8981. ELSIF x.kind = SyntaxTree.VarParameter THEN
  8982. IF type.form = SyntaxTree.Tensor THEN
  8983. ToMemory(result.op,addressType,0);
  8984. ELSIF type.form = SyntaxTree.Open THEN
  8985. MakeMemory(mem, result.op, addressType, 0); (* offset already added above *)
  8986. ReuseCopy(result.tag, mem);
  8987. ReleaseIntermediateOperand(mem);
  8988. ReleaseIntermediateOperand(result.op);
  8989. MakeMemory(result.op, result.tag, addressType, ToMemoryUnits(system,MathAdrOffset*addressType.sizeInBits));
  8990. ELSIF type.form = SyntaxTree.Static THEN
  8991. IntermediateCode.MakeMemory(result.op,addressType);
  8992. ELSE HALT(100)
  8993. END;
  8994. ELSE HALT(100)
  8995. END;
  8996. END;
  8997. ELSIF (x.kind = SyntaxTree.VarParameter) OR (x.kind = SyntaxTree.ConstParameter) & (type IS SyntaxTree.RecordType) THEN
  8998. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  8999. IntermediateCode.MakeMemory(result.op,addressType);
  9000. ELSIF (x.kind = SyntaxTree.ValueParameter) OR (x.kind = SyntaxTree.ConstParameter) THEN
  9001. IntermediateCode.AddOffset(result.op,ToMemoryUnits(system,x.offsetInBits));
  9002. END;
  9003. IF conditional & (x.type.resolved IS SyntaxTree.BooleanType) THEN
  9004. ValueToCondition(result);
  9005. ELSIF type IS SyntaxTree.ProcedureType THEN
  9006. ReleaseIntermediateOperand(result.tag);
  9007. IF type(SyntaxTree.ProcedureType).isDelegate THEN
  9008. IF x.kind = SyntaxTree.VarParameter THEN
  9009. ReuseCopy(result.tag,result.op);
  9010. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,system.addressSize));
  9011. IntermediateCode.MakeMemory(result.tag,addressType);
  9012. ELSE
  9013. IntermediateCode.InitMemory(result.tag,addressType,result.op,ToMemoryUnits(system,system.addressSize));
  9014. UseIntermediateOperand(result.tag);
  9015. END;
  9016. ELSE
  9017. result.tag := nil;
  9018. END;
  9019. (* tag for pointer type computed not here but during dereferencing *)
  9020. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & (x.kind IN {SyntaxTree.VarParameter, SyntaxTree.ConstParameter}) & ~(x.selfParameter) THEN
  9021. ReleaseIntermediateOperand(result.tag);
  9022. result.tag := basereg;
  9023. IntermediateCode.AddOffset(result.tag,ToMemoryUnits(system,x.offsetInBits+system.addressSize));
  9024. IntermediateCode.MakeMemory(result.tag,addressType);
  9025. UseIntermediateOperand(result.tag);
  9026. ELSIF (type IS SyntaxTree.RecordType) & (type(SyntaxTree.RecordType).pointerType= NIL) & ((x.kind = SyntaxTree.ValueParameter) OR x.selfParameter) THEN
  9027. ReleaseIntermediateOperand(result.tag);
  9028. result.tag := TypeDescriptorAdr(type);
  9029. UseIntermediateOperand(result.tag);
  9030. END;
  9031. IF Trace THEN TraceExit("VisitParameter") END;
  9032. END VisitParameter;
  9033. PROCEDURE DynamicCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9034. VAR tag,reg,tmp: IntermediateCode.Operand; offset: LONGINT; recordType: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName;
  9035. BEGIN
  9036. IF Trace THEN TraceEnter("DynamicCallOperand") END;
  9037. (* left.p: left already emitted *)
  9038. tag := result.op; (* value of pointer to left *)
  9039. (* get type desc *)
  9040. tmp := result.tag;
  9041. IntermediateCode.MakeMemory(tmp,addressType);
  9042. (* get method adr *)
  9043. Reuse1(reg,tmp);
  9044. ReleaseIntermediateOperand(tmp);
  9045. IF backend.cooperative THEN
  9046. recordType := x.scope(SyntaxTree.RecordScope).ownerRecord;
  9047. WHILE recordType.baseType # NIL DO
  9048. recordType := recordType.GetBaseRecord ();
  9049. END;
  9050. GetRecordTypeName (recordType,name);
  9051. Basic.ToSegmentedName ("BaseTypes.StackFrame",stackFrame);
  9052. IF (name = stackFrame) OR HasExplicitTraceMethod (recordType) THEN
  9053. offset := 0;
  9054. ELSE
  9055. offset := 2;
  9056. END;
  9057. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber + offset)))));
  9058. ELSIF meta.simple THEN
  9059. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset + x.methodNumber)))));
  9060. ELSE
  9061. Emit(Add(position,reg,tmp,IntermediateCode.Immediate(addressType, ToMemoryUnits(system,system.addressSize *(meta.MethodTableOffset - x.methodNumber)))));
  9062. END;
  9063. InitOperand(operand,ModeReference);
  9064. (* then operand.op contains the method adr and operand.tag contains the potential self pointer value *)
  9065. operand.op := reg;
  9066. operand.tag := tag;
  9067. IF Trace THEN TraceExit("DynamicCallOperand") END;
  9068. END DynamicCallOperand;
  9069. PROCEDURE StaticCallOperand(VAR operand: Operand; x: SyntaxTree.Procedure);
  9070. VAR source: IntermediateCode.Section; tag,reg: IntermediateCode.Operand; name:Basic.SegmentedName; sectionType: SHORTINT;
  9071. binary: BinaryCode.Section; bits: SyntaxTree.BinaryCode;
  9072. BEGIN
  9073. IF Trace THEN TraceEnter("StaticCallOperand") END;
  9074. IF x.type(SyntaxTree.ProcedureType).isDelegate THEN
  9075. tag := operand.op;
  9076. ReleaseIntermediateOperand(operand.tag);
  9077. ELSE tag := nil
  9078. END;
  9079. IF x.isInline THEN
  9080. sectionType := Sections.InlineCodeSection;
  9081. ELSE
  9082. sectionType := Sections.CodeSection;
  9083. END;
  9084. IF x.externalName # NIL THEN
  9085. Basic.ToSegmentedName(x.externalName^, name);
  9086. IntermediateCode.InitAddress(reg, addressType, name, 0, 0);
  9087. ELSE
  9088. GetCodeSectionNameForSymbol(x, name);
  9089. IF (x.scope.ownerModule = module.module) THEN
  9090. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9091. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.sourceCode # NIL) THEN
  9092. source := NewSection(module.allSections, sectionType, name,x,commentPrintout # NIL);
  9093. IF source.pc = 0 THEN (* no code yet *)
  9094. source.Emit(Asm(position,x.procedureScope.body.code.sourceCode,NIL,NIL));
  9095. END;
  9096. ELSIF (sectionType = Sections.InlineCodeSection) & (x.procedureScope.body.code.inlineCode # NIL) THEN
  9097. bits := x.procedureScope.body.code.inlineCode;
  9098. source := NewSection(module.allSections, sectionType, name, x, commentPrintout # NIL);
  9099. binary := BinaryCode.NewBinarySection(source.type, system.codeUnit, name, FALSE, FALSE);
  9100. binary.CopyBits(bits, 0, bits.GetSize());
  9101. source.SetResolved(binary);
  9102. ELSE
  9103. source := NewSection(module.importedSections, sectionType, name,x,commentPrintout # NIL);
  9104. END;
  9105. IntermediateCode.InitAddress(reg, addressType, source.name , GetFingerprint(source.symbol), 0);
  9106. END;
  9107. InitOperand(operand,ModeValue);
  9108. operand.op := reg;
  9109. operand.tag := tag;
  9110. IF Trace THEN TraceExit("StaticCallOperand") END;
  9111. END StaticCallOperand;
  9112. PROCEDURE VisitProcedure*(x: SyntaxTree.Procedure);
  9113. (* handle expressions of the form designator.procedure or procedure *)
  9114. BEGIN
  9115. IF Trace THEN TraceEnter("VisitProcedure") END;
  9116. IF (x.type(SyntaxTree.ProcedureType).isDelegate) & ~SemanticChecker.IsStaticProcedure(x) & ~(result.tag.mode = IntermediateCode.ModeImmediate) THEN
  9117. DynamicCallOperand(result,x);
  9118. ELSIF x.isInline THEN
  9119. StaticCallOperand(result,x);
  9120. ELSE
  9121. StaticCallOperand(result,x);
  9122. END;
  9123. IF Trace THEN TraceExit("VisitProcedure") END;
  9124. END VisitProcedure;
  9125. PROCEDURE VisitOperator*(x: SyntaxTree.Operator);
  9126. BEGIN
  9127. VisitProcedure(x);
  9128. END VisitOperator;
  9129. (** statements *)
  9130. PROCEDURE VisitProcedureCallStatement*(x: SyntaxTree.ProcedureCallStatement);
  9131. BEGIN
  9132. IF Trace THEN TraceEnter("VisitProcedureCallStatement") END;
  9133. Expression(x.call);
  9134. IF (x.call.type # NIL) THEN (* WINAPI call: procedure returning unused value *)
  9135. ReleaseOperand(result)
  9136. END;
  9137. IF Trace THEN TraceExit("VisitProcedureCallStatement") END;
  9138. END VisitProcedureCallStatement;
  9139. PROCEDURE AssignMathArray(left,right: SyntaxTree.Expression);
  9140. VAR leftType, rightType: SyntaxTree.MathArrayType;
  9141. leftBase, rightBase: SyntaxTree.Type;
  9142. procedureName,s: SyntaxTree.IdentifierString;
  9143. arrayBase: SyntaxTree.Module; saved: RegisterEntry; procedure: SyntaxTree.Procedure; parameter: SyntaxTree.Parameter;
  9144. size: LONGINT; rightKind: LONGINT;
  9145. dummy: IntermediateCode.Operand;
  9146. CONST moduleName = "FoxArrayBase";
  9147. PROCEDURE OpenArray(from: SyntaxTree.MathArrayType): SyntaxTree.MathArrayType;
  9148. VAR result: SyntaxTree.MathArrayType; base: SyntaxTree.Type;
  9149. BEGIN
  9150. base := from(SyntaxTree.MathArrayType).arrayBase.resolved;
  9151. IF base IS SyntaxTree.MathArrayType THEN
  9152. base := OpenArray(base(SyntaxTree.MathArrayType));
  9153. END;
  9154. result := SyntaxTree.NewMathArrayType(left.position,currentScope,SyntaxTree.Open);
  9155. result.SetArrayBase(base);
  9156. RETURN result
  9157. END OpenArray;
  9158. BEGIN
  9159. IF AddImport(moduleName,arrayBase,TRUE) THEN
  9160. SaveRegisters();ReleaseUsedRegisters(saved);
  9161. leftType := left.type.resolved(SyntaxTree.MathArrayType);
  9162. rightType := right.type.resolved(SyntaxTree.MathArrayType);
  9163. leftBase := SemanticChecker.ArrayBase(leftType,MAX(LONGINT));
  9164. rightBase := SemanticChecker.ArrayBase(rightType,MAX(LONGINT));
  9165. ASSERT(leftBase.resolved.SameType(rightBase.resolved));
  9166. IF leftType.form = SyntaxTree.Tensor THEN
  9167. procedureName := "CopyTensor"; rightKind := SyntaxTree.ValueParameter;
  9168. ELSIF leftType.form = SyntaxTree.Open THEN
  9169. procedureName := "CopyArray"; rightKind := SyntaxTree.VarParameter;
  9170. ELSIF leftType.form = SyntaxTree.Static THEN
  9171. procedureName := "CopyArray";rightKind := SyntaxTree.VarParameter;
  9172. leftType := OpenArray(leftType); (* necessary since copy procedure presumes an open array *)
  9173. END;
  9174. procedure := arrayBase.moduleScope.FindProcedure(SyntaxTree.NewIdentifier(procedureName));
  9175. IF procedure = NIL THEN
  9176. s := "Instruction not supported on target, emulation procedure ";
  9177. Strings.Append(s,moduleName);
  9178. Strings.Append(s,".");
  9179. Strings.Append(s,procedureName);
  9180. Strings.Append(s," not present");
  9181. Error(position,s);
  9182. ELSE
  9183. parameter := SyntaxTree.NewParameter(left.position,procedure.type(SyntaxTree.ProcedureType),SyntaxTree.NewIdentifier("temp"), SyntaxTree.VarParameter);
  9184. parameter.SetType(leftType);
  9185. parameter.SetAccess(SyntaxTree.Internal);
  9186. PushParameter(left,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9187. parameter.SetKind(rightKind);
  9188. PushParameter(right,parameter,SyntaxTree.OberonCallingConvention, FALSE, dummy,-1);
  9189. size := ToMemoryUnits(system,system.SizeOf(rightBase));
  9190. Emit(Push(position,IntermediateCode.Immediate(sizeType,size)));
  9191. StaticCallOperand(result,procedure);
  9192. Emit(Call(position,result.op,ProcParametersSize(procedure)));
  9193. ReleaseOperand(result);
  9194. END;
  9195. RestoreRegisters(saved);
  9196. END;
  9197. END AssignMathArray;
  9198. VAR modifyAssignmentCounter := 0: LONGINT;
  9199. PROCEDURE ModifyAssignments(CONST value: IntermediateCode.Operand);
  9200. VAR processor,mem,dst: IntermediateCode.Operand;
  9201. BEGIN
  9202. IF value.intValue = true.intValue THEN
  9203. INC(modifyAssignmentCounter);
  9204. IF (modifyAssignmentCounter > 1) THEN RETURN END;
  9205. modifyAssignmentsPC := section.pc;
  9206. ELSE
  9207. DEC(modifyAssignmentCounter);
  9208. IF (modifyAssignmentCounter > 0) THEN RETURN END;
  9209. INC(statCoopModifyAssignments , section.pc - modifyAssignmentsPC);
  9210. END;
  9211. IntermediateCode.InitMemory (processor, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, ProcessorOffset * addressType.sizeInBits));
  9212. dst := NewRegisterOperand (addressType);
  9213. Emit(Mov(position,dst, processor));
  9214. IntermediateCode.InitMemory(mem,bool, dst, 0);
  9215. Emit(Mov(position,mem, value));
  9216. ReleaseIntermediateOperand(dst);
  9217. END ModifyAssignments;
  9218. PROCEDURE CopySize(left: SyntaxTree.Expression; tag: IntermediateCode.Operand): IntermediateCode.Operand;
  9219. VAR type: SyntaxTree.Type; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; mem: IntermediateCode.Operand;
  9220. BEGIN
  9221. type := left.type.resolved;
  9222. IF (type IS SyntaxTree.RecordType) & (left IS SyntaxTree.SymbolDesignator) & (left(SyntaxTree.SymbolDesignator).symbol IS SyntaxTree.Parameter) THEN
  9223. parameter := left(SyntaxTree.SymbolDesignator).symbol(SyntaxTree.Parameter);
  9224. procedureType := parameter.ownerType.resolved(SyntaxTree.ProcedureType);
  9225. IF procedureType.returnParameter = parameter THEN
  9226. (* this is the only case where the destination can be dynamically smaller than the source
  9227. in all other cases the dynamic size has to be taken
  9228. *)
  9229. IF backend.cooperative THEN
  9230. MakeMemory(mem, tag, addressType, ToMemoryUnits(system,system.addressSize));
  9231. ELSE
  9232. MakeMemory(mem, tag, addressType, 0);
  9233. END;
  9234. RETURN mem;
  9235. END;
  9236. END;
  9237. RETURN IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(type)));
  9238. END CopySize;
  9239. PROCEDURE Assign(left,right: SyntaxTree.Expression);
  9240. VAR
  9241. leftO, rightO: Operand;
  9242. arg,mem, sizeOp: IntermediateCode.Operand;
  9243. leftType, rightType, componentType, base: SyntaxTree.Type;
  9244. size: LONGINT;
  9245. parameters: SyntaxTree.ExpressionList;
  9246. procedure: SyntaxTree.Procedure;
  9247. call: SyntaxTree.ProcedureCallDesignator;
  9248. designator: SyntaxTree.Designator;
  9249. saved: RegisterEntry;
  9250. PROCEDURE CanPassAsResultParameter(right: SyntaxTree.Expression): BOOLEAN;
  9251. VAR procedureType: SyntaxTree.ProcedureType;
  9252. BEGIN
  9253. IF SemanticChecker.ReturnedAsParameter(right.type) THEN
  9254. IF right IS SyntaxTree.ProcedureCallDesignator THEN
  9255. procedureType := right(SyntaxTree.ProcedureCallDesignator).left.type.resolved(SyntaxTree.ProcedureType);
  9256. RETURN procedureType.callingConvention = SyntaxTree.OberonCallingConvention
  9257. ELSIF right IS SyntaxTree.BuiltinCallDesignator THEN
  9258. WITH right: SyntaxTree.BuiltinCallDesignator DO
  9259. IF right.id = Global.Reshape THEN RETURN TRUE
  9260. END;
  9261. END;
  9262. END;
  9263. END;
  9264. RETURN FALSE
  9265. END CanPassAsResultParameter;
  9266. BEGIN
  9267. ASSERT(left.type # NIL); ASSERT(right.type # NIL);
  9268. leftType := left.type.resolved; rightType:= right.type.resolved;
  9269. IF backend.cooperative & left.NeedsTrace() THEN
  9270. ModifyAssignments(true);
  9271. IF (leftType IS SyntaxTree.RecordType) OR IsStaticArray(leftType) THEN
  9272. Designate(right, rightO);
  9273. Designate(left, leftO);
  9274. ASSERT(leftO.mode = ModeReference);
  9275. TransferToRegister(leftO.op, leftO.op);
  9276. TransferToRegister(rightO.op, rightO.op);
  9277. Emit(Push(position, leftO.op));
  9278. Emit(Push(position, rightO.op));
  9279. CallAssignMethod(leftO.op, rightO.op, left.type);
  9280. Emit(Pop(position, rightO.op));
  9281. Emit(Pop(position, leftO.op));
  9282. sizeOp := CopySize(left, leftO.tag);
  9283. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9284. ReleaseIntermediateOperand(sizeOp);
  9285. ReleaseOperand(leftO);
  9286. ReleaseOperand(rightO);
  9287. ELSE
  9288. Evaluate(right,rightO);
  9289. Designate(left,leftO);
  9290. ASSERT(leftO.mode = ModeReference);
  9291. IF (leftType IS SyntaxTree.ProcedureType) THEN
  9292. (* copy procedure address first *)
  9293. MakeMemory(mem,leftO.op,addressType,0);
  9294. Emit(Mov(position,mem,rightO.op));
  9295. ReleaseIntermediateOperand(mem);
  9296. (* copy pointer address *)
  9297. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9298. CallAssignPointer(leftO.tag, rightO.tag);
  9299. ELSE
  9300. ASSERT(system.SizeOf(left.type) = system.addressSize);
  9301. CallAssignPointer(leftO.op, rightO.op);
  9302. END;
  9303. ReleaseOperand(leftO);
  9304. ReleaseOperand(rightO);
  9305. END;
  9306. ModifyAssignments(false);
  9307. RETURN;
  9308. ELSIF backend.writeBarriers & left.NeedsTrace() & OnHeap(left) & ~((leftType IS SyntaxTree.MathArrayType) & ~IsStaticMathArray(leftType)) THEN
  9309. SaveRegisters();ReleaseUsedRegisters(saved);
  9310. IF SemanticChecker.IsPointerType(leftType) THEN
  9311. Evaluate(right,rightO);
  9312. Designate(left,leftO);
  9313. Emit(Push(position,leftO.op));
  9314. ReleaseOperand(leftO);
  9315. Emit(Push(position,rightO.op));
  9316. ReleaseOperand(rightO);
  9317. CallThis(position,"Heaps","Assign",2);
  9318. ELSIF leftType.IsRecordType() THEN
  9319. Designate(right,rightO);
  9320. Designate(left,leftO);
  9321. Emit(Push(position,leftO.op));
  9322. Emit(Push(position,leftO.tag)); (* type desc *)
  9323. ReleaseOperand(leftO);
  9324. Emit(Push(position,rightO.op));
  9325. ReleaseOperand(rightO);
  9326. CallThis(position,"Heaps","AssignRecord",3);
  9327. ELSIF IsStaticArray(leftType) THEN
  9328. size := StaticArrayNumElements(leftType);
  9329. base := StaticArrayBaseType(leftType);
  9330. Designate(right,rightO);
  9331. Designate(left,leftO);
  9332. Emit(Push(position,leftO.op));
  9333. ReleaseOperand(leftO);
  9334. arg := TypeDescriptorAdr(base);
  9335. Emit(Push(position,arg));
  9336. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9337. Emit(Push(position,rightO.op));
  9338. ReleaseOperand(rightO);
  9339. CallThis(position,"Heaps","AssignArray",4);
  9340. ELSIF IsStaticMathArray(leftType) THEN (* the representation of a static math array coincides with static array *)
  9341. size := StaticMathArrayNumElements(leftType);
  9342. base := StaticMathArrayBaseType(leftType);
  9343. Designate(right,rightO);
  9344. Designate(left,leftO);
  9345. Emit(Push(position,leftO.op));
  9346. ReleaseOperand(leftO);
  9347. arg := TypeDescriptorAdr(base);
  9348. Emit(Push(position,arg));
  9349. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9350. Emit(Push(position,rightO.op));
  9351. ReleaseOperand(rightO);
  9352. CallThis(position,"Heaps","AssignArray",4);
  9353. ELSIF leftType IS SyntaxTree.ProcedureType THEN
  9354. ASSERT(leftType(SyntaxTree.ProcedureType).isDelegate);
  9355. Evaluate(right,rightO);
  9356. Designate(left,leftO);
  9357. MakeMemory(mem,leftO.op,addressType,0);
  9358. Emit(Mov(position,mem,rightO.op));
  9359. ReleaseIntermediateOperand(mem);
  9360. IntermediateCode.MakeAddress(leftO.tag, addressType);
  9361. Emit (Push(position, leftO.tag));
  9362. ReleaseOperand(leftO);
  9363. Emit (Push(position, rightO.tag));
  9364. ReleaseOperand(rightO);
  9365. CallThis(position,"Heaps","Assign", 2);
  9366. ELSE HALT(100); (* missing ? *)
  9367. END;
  9368. RestoreRegisters(saved);
  9369. RETURN;
  9370. END;
  9371. IF CanPassAsResultParameter(right) THEN
  9372. procedureResultDesignator := left(SyntaxTree.Designator);
  9373. Expression(right);
  9374. procedureResultDesignator := NIL;
  9375. ELSIF (right IS SyntaxTree.UnaryExpression) & (right(SyntaxTree.UnaryExpression).operator = Scanner.Alias) THEN
  9376. (* left <-- ALIAS OF right: zerocopy *)
  9377. IF GetRuntimeProcedure("FoxArrayBase","ZeroCopy",procedure,TRUE) THEN
  9378. designator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, procedure);
  9379. designator.SetType(procedure.type);
  9380. parameters := SyntaxTree.NewExpressionList(); parameters.AddExpression(right(SyntaxTree.UnaryExpression).left); parameters.AddExpression(left);
  9381. call := SyntaxTree.NewProcedureCallDesignator(position,designator(SyntaxTree.Designator),parameters);
  9382. VisitProcedureCallDesignator(call(SyntaxTree.ProcedureCallDesignator));
  9383. END;
  9384. ELSIF leftType IS SyntaxTree.RangeType THEN
  9385. (* LHS is of array range type *)
  9386. ASSERT(rightType IS SyntaxTree.RangeType); (* ensured by the checker *)
  9387. Evaluate(right, rightO);
  9388. Designate(left, leftO);(* The order is crucial. Do not reorder emission of left and right *)
  9389. (* first *)
  9390. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 0);
  9391. Emit(Mov(position,mem, rightO.op));
  9392. ReleaseIntermediateOperand(mem);
  9393. (* last *)
  9394. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9395. Emit(Mov(position,mem, rightO.tag));
  9396. ReleaseIntermediateOperand(mem);
  9397. (* step *)
  9398. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9399. Emit(Mov(position,mem, rightO.extra));
  9400. ReleaseIntermediateOperand(mem);
  9401. ReleaseOperand(rightO);
  9402. ReleaseOperand(leftO)
  9403. ELSIF leftType IS SyntaxTree.ComplexType THEN
  9404. ASSERT(leftType.SameType(rightType)); (* ensured by the checker *)
  9405. Evaluate(right, rightO);
  9406. Designate(left, leftO); (* The order is crucial. Do not reorder emission of left and right *)
  9407. componentType := leftType(SyntaxTree.ComplexType).componentType;
  9408. (* real part *)
  9409. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), 0);
  9410. Emit(Mov(position,mem, rightO.op));
  9411. ReleaseIntermediateOperand(mem);
  9412. (* imaginary part *)
  9413. MakeMemory(mem, leftO.op, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9414. Emit(Mov(position,mem, rightO.tag));
  9415. ReleaseIntermediateOperand(mem);
  9416. ReleaseOperand(rightO);
  9417. ReleaseOperand(leftO)
  9418. ELSIF (leftType IS SyntaxTree.BasicType) OR (leftType IS SyntaxTree.PointerType) OR (leftType IS SyntaxTree.EnumerationType)
  9419. OR (leftType IS SyntaxTree.PortType) THEN
  9420. (* rightO := leftO;*)
  9421. Evaluate(right,rightO);
  9422. (* DO NOT REORDER EMISSION OF LEFT AND RIGHT OPERAND *)
  9423. Designate(left,leftO);
  9424. IF leftO.mode = ModeReference THEN
  9425. MakeMemory(mem,leftO.op,IntermediateCode.GetType(system,left.type),0);
  9426. destination := mem;
  9427. ELSE
  9428. destination := leftO.op;
  9429. END;
  9430. ReleaseOperand(leftO);
  9431. IF destination.mode # IntermediateCode.Undefined THEN
  9432. Emit(Mov(position,destination,rightO.op));
  9433. END;
  9434. ReleaseOperand(rightO);
  9435. ReleaseIntermediateOperand(mem);
  9436. IntermediateCode.InitOperand(destination);
  9437. ELSIF (leftType IS SyntaxTree.ProcedureType) THEN
  9438. Evaluate(right,rightO);
  9439. Designate(left,leftO);
  9440. MakeMemory(mem,leftO.op,addressType,0);
  9441. Emit(Mov(position,mem,rightO.op));
  9442. ReleaseIntermediateOperand(mem);
  9443. IF leftType(SyntaxTree.ProcedureType).isDelegate THEN
  9444. (* delegate *)
  9445. (*
  9446. MakeMemory(leftO.tag,leftO.tag,addressType); no! is already memory
  9447. *)
  9448. Emit(Mov(position,leftO.tag,rightO.tag));
  9449. END;
  9450. ReleaseOperand(leftO);
  9451. ReleaseOperand(rightO);
  9452. ELSIF (leftType IS SyntaxTree.RecordType) THEN
  9453. Designate(right,rightO);
  9454. Designate(left,leftO);
  9455. sizeOp := CopySize(left, leftO.tag);
  9456. Emit(Copy(position,leftO.op,rightO.op,sizeOp));
  9457. ReleaseIntermediateOperand(sizeOp);
  9458. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9459. ELSIF (leftType IS SyntaxTree.ArrayType) THEN
  9460. IF (rightType IS SyntaxTree.StringType) THEN
  9461. CopyString(left,right);
  9462. 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
  9463. Designate(right,rightO);
  9464. Designate(left,leftO);
  9465. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9466. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9467. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9468. ELSE
  9469. HALT(201)
  9470. END;
  9471. ELSIF (leftType IS SyntaxTree.MathArrayType) THEN
  9472. IF (leftType(SyntaxTree.MathArrayType).staticLength # 0) & (rightType IS SyntaxTree.MathArrayType) & (rightType(SyntaxTree.MathArrayType).staticLength # 0) THEN
  9473. Designate(right,rightO);
  9474. Designate(left,leftO);
  9475. size := ToMemoryUnits(system,system.SizeOf(rightType));
  9476. IF IntermediateCode.IsVectorRegister(leftO.op) THEN
  9477. MakeMemory(mem, rightO.op, leftO.op.type,0);
  9478. Emit(Mov(position, leftO.op, mem));
  9479. ReleaseIntermediateOperand(mem);
  9480. ELSE
  9481. Emit(Copy(position,leftO.op, rightO.op, IntermediateCode.Immediate(addressType,size)));
  9482. END;
  9483. ReleaseOperand(leftO); ReleaseOperand(rightO);
  9484. ELSE
  9485. AssignMathArray(left,right);
  9486. END;
  9487. ELSE
  9488. HALT(200);
  9489. END;
  9490. END Assign;
  9491. PROCEDURE VisitAssignment*(x: SyntaxTree.Assignment);
  9492. BEGIN
  9493. IF Trace THEN TraceEnter("VisitAssignment") END;
  9494. Assign(x.left,x.right);
  9495. IF Trace THEN TraceExit("VisitAssignment") END;
  9496. END VisitAssignment;
  9497. PROCEDURE EmitCooperativeSwitch;
  9498. VAR quantum, offset, zero: IntermediateCode.Operand; skip: Label; pc: LONGINT;
  9499. BEGIN
  9500. ASSERT (cooperativeSwitches);
  9501. pc := section.pc;
  9502. IF lastSwitchPC = section.pc THEN RETURN END;
  9503. IntermediateCode.InitMemory (quantum, IntermediateCode.SignedIntegerType(addressType.sizeInBits), ap, ToMemoryUnits(system, QuantumOffset * addressType.sizeInBits));
  9504. IntermediateCode.InitImmediate(offset, quantum.type, section.pc - lastSwitchPC); IntermediateCode.InitImmediate(zero, quantum.type, 0);
  9505. Emit(Sub(position,quantum,quantum, offset)); skip := NewLabel(); BrgeL(skip, quantum, zero);
  9506. lastSwitchPC := section.pc; CallThis(position,"Activities","Switch",0); SetLabel(skip);
  9507. INC(statCoopSwitch, section.pc - pc);
  9508. END EmitCooperativeSwitch;
  9509. PROCEDURE VisitCommunicationStatement*(communication: SyntaxTree.CommunicationStatement);
  9510. VAR p0,p1,tmp: SyntaxTree.Expression; s0,s1: Operand; size: LONGINT;
  9511. BEGIN
  9512. p0 := communication.left; p1 := communication.right;
  9513. IF (communication.op = Scanner.ExclamationMark) OR (communication.op = Scanner.LessLess) & (communication.left.type.resolved IS SyntaxTree.PortType) THEN
  9514. Evaluate(p0,s0);
  9515. Evaluate(p1,s1);
  9516. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9517. Emit(Push(position,s0.op));
  9518. Emit(Push(position,s1.op));
  9519. (*
  9520. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9521. *)
  9522. IF ~backend.cellsAreObjects THEN
  9523. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"send not implemented for complex data types") END;
  9524. END;
  9525. ReleaseOperand(s0);
  9526. ReleaseOperand(s1);
  9527. IF backend.cellsAreObjects THEN
  9528. CallThis(position,"ActiveCellsRuntime","Send",2);
  9529. ELSE
  9530. CallThis(position,ChannelModuleName,"Send",2);
  9531. END;
  9532. (* ----- RECEIVE ------*)
  9533. ELSE
  9534. IF (communication.op = Scanner.LessLess) & (communication.right.type.resolved IS SyntaxTree.PortType) THEN
  9535. tmp := p0; p0 := p1; p1 := tmp;
  9536. END;
  9537. Evaluate(p0,s0);
  9538. Emit(Push(position,s0.op));
  9539. Designate(p1,s1);
  9540. size := ToMemoryUnits(system,system.SizeOf(p1.type));
  9541. Emit(Push(position,s1.op));
  9542. (*
  9543. Emit(Push(position,IntermediateCode.Immediate(addressType,size)));
  9544. *)
  9545. IF ~backend.cellsAreObjects THEN
  9546. IF size > ToMemoryUnits(system, system.addressSize) THEN Error(p1.position,"receive not implemented for complex data types") END;
  9547. END;
  9548. ReleaseOperand(s0);
  9549. ReleaseOperand(s1);
  9550. IF backend.cellsAreObjects THEN
  9551. CallThis(position,"ActiveCellsRuntime","Receive",2);
  9552. ELSE
  9553. CallThis(position,ChannelModuleName,"Receive",2)
  9554. END;
  9555. END;
  9556. END VisitCommunicationStatement;
  9557. PROCEDURE VisitIfStatement*(x: SyntaxTree.IfStatement);
  9558. VAR end: Label; i,elsifs: LONGINT; elsif: SyntaxTree.IfPart; escape: BOOLEAN;
  9559. PROCEDURE IfPart(if: SyntaxTree.IfPart);
  9560. VAR true, false: Label; condition, value: BOOLEAN;
  9561. BEGIN
  9562. condition := ~SemanticChecker.IsBooleanValue(if.condition, value);
  9563. IF condition THEN
  9564. true := NewLabel();
  9565. false := NewLabel();
  9566. Condition(if.condition,true,false);
  9567. SetLabel(true);
  9568. StatementSequence(if.statements);
  9569. BrL(end);
  9570. SetLabel(false);
  9571. ELSE
  9572. IF value THEN (* always true *)
  9573. escape := TRUE;
  9574. StatementSequence(if.statements);
  9575. (* no branch necessary -- rest skipped *)
  9576. END;
  9577. END;
  9578. END IfPart;
  9579. BEGIN
  9580. IF Trace THEN TraceEnter("VisitIfStatement") END;
  9581. end := NewLabel();
  9582. elsifs := x.ElsifParts();
  9583. IfPart(x.ifPart);
  9584. FOR i := 0 TO elsifs-1 DO
  9585. IF ~escape THEN
  9586. elsif := x.GetElsifPart(i);
  9587. IfPart(elsif);
  9588. END;
  9589. END;
  9590. IF (x.elsePart # NIL) & ~escape THEN
  9591. StatementSequence(x.elsePart);
  9592. END;
  9593. SetLabel(end);
  9594. IF Trace THEN TraceExit("VisitIfStatement") END;
  9595. END VisitIfStatement;
  9596. PROCEDURE WithPart(x: SyntaxTree.WithPart; VAR falseL, endL: Label);
  9597. VAR trueL: Label; res: Operand; recordType: SyntaxTree.RecordType;
  9598. BEGIN
  9599. (*IF x.variable.type.resolved = x.type.resolved THEN
  9600. (* always true, do nothing *)
  9601. ELSE*)
  9602. Designate(x.variable,res);
  9603. IF IsPointerToRecord(x.variable.type,recordType) THEN
  9604. Dereference(res,recordType,IsUnsafePointer(x.variable.type))
  9605. END;
  9606. trueL := NewLabel();
  9607. TypeTest(res.tag,x.type,trueL,falseL);
  9608. ReleaseOperand(res);
  9609. SetLabel(trueL);
  9610. StatementSequence(x.statements);
  9611. BrL(endL);
  9612. END WithPart;
  9613. PROCEDURE VisitWithStatement*(x: SyntaxTree.WithStatement);
  9614. VAR endL,falseL: Label;i: LONGINT;
  9615. BEGIN
  9616. IF Trace THEN TraceEnter("VisitWithStatement") END;
  9617. endL := NewLabel();
  9618. FOR i := 0 TO x.WithParts()-1 DO
  9619. falseL := NewLabel();
  9620. WithPart(x.GetWithPart(i),falseL,endL);
  9621. SetLabel(falseL);
  9622. END;
  9623. IF x.elsePart = NIL THEN
  9624. IF ~isUnchecked THEN
  9625. EmitTrap(position,WithTrap);
  9626. END;
  9627. ELSE
  9628. StatementSequence(x.elsePart)
  9629. END;
  9630. SetLabel(endL);
  9631. IF Trace THEN TraceExit("VisitWithStatement") END;
  9632. END VisitWithStatement;
  9633. PROCEDURE VisitCaseStatement*(x: SyntaxTree.CaseStatement);
  9634. VAR var: Operand; jmp,res,op,tmp: IntermediateCode.Operand; range, j: Basic.Integer; i,size: LONGINT; part: SyntaxTree.CasePart; constant: SyntaxTree.CaseConstant;
  9635. out,else: Label; label: Label;
  9636. fixups: POINTER TO ARRAY OF Label; section: IntermediateCode.Section; name: Basic.SegmentedName; string: ARRAY 32 OF CHAR;
  9637. symbol: SyntaxTree.Symbol;
  9638. BEGIN
  9639. (*! split case statement into if-elsif statements for large case label lists *)
  9640. IF Trace THEN TraceEnter("VisitCaseStatement") END;
  9641. range := x.max-x.min+1;
  9642. IF (range<0) OR (range > 1024*1024) THEN Error(x.position,"implementation restriction: case table size too large"); RETURN
  9643. END;
  9644. size := LONGINT(range);
  9645. Evaluate(x.variable,var);
  9646. ReuseCopy(tmp,var.op);
  9647. ReleaseIntermediateOperand(var.op);
  9648. var.op := tmp;
  9649. Emit(Sub(position,var.op,var.op,IntermediateCode.Immediate(IntermediateCode.GetType(system,x.variable.type),x.min)));
  9650. Convert(var.op,addressType);
  9651. else := NewLabel();
  9652. BrgeL(else,var.op,IntermediateCode.Immediate(addressType,size));
  9653. (*
  9654. UniqueId(name,module.module,"case",caseId);
  9655. *)
  9656. string := "@case"; Basic.AppendNumber(string, caseId); INC(caseId);
  9657. Global.GetModuleSegmentedName(module.module, name);
  9658. Basic.SuffixSegmentedName(name,Basic.MakeString(string));
  9659. symbol := SyntaxTree.NewSymbol(name[1]);
  9660. symbol.SetScope(moduleScope);
  9661. NEW(fixups,size); FOR i := 0 TO size-1 DO fixups[i] := NIL END;
  9662. section := NewSection(module.allSections, Sections.ConstSection,name,SyntaxTree.NewSymbol(name[1]),commentPrintout # NIL);
  9663. IntermediateCode.InitAddress(jmp, addressType, section.name, GetFingerprint(section.symbol), 0);
  9664. ReuseCopy(res,var.op);
  9665. ReleaseOperand(var);
  9666. Emit(Mul(position,res,res,IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.addressSize))));
  9667. Emit(Add(position,res,res,jmp));
  9668. IntermediateCode.MakeMemory(res,addressType);
  9669. Emit(Br(position,res));
  9670. ReleaseIntermediateOperand(res);
  9671. out := NewLabel();
  9672. FOR i := 0 TO x.caseParts.Length()-1 DO (* case parts *)
  9673. part := x.GetCasePart(i);
  9674. constant := part.firstConstant;
  9675. label := NewLabel();
  9676. SetLabel(label);
  9677. WHILE(constant # NIL) DO (* case labels for this case part *)
  9678. FOR j := constant.min TO constant.max DO
  9679. fixups[j-x.min] := label;
  9680. END;
  9681. constant := constant.next;
  9682. END;
  9683. StatementSequence(part.statements);
  9684. BrL(out);
  9685. END;
  9686. SetLabel(else);
  9687. FOR i := 0 TO size-1 DO
  9688. IF fixups[i] = NIL THEN
  9689. fixups[i] := else;
  9690. END;
  9691. END;
  9692. IF x.elsePart # NIL THEN
  9693. StatementSequence(x.elsePart);
  9694. ELSIF ~isUnchecked THEN
  9695. EmitTrap(position,CaseTrap);
  9696. END;
  9697. SetLabel(out);
  9698. FOR i := 0 TO size-1 DO
  9699. IntermediateCode.InitAddress(op, addressType, fixups[i].section.name, GetFingerprint(fixups[i].section.symbol), fixups[i].pc);
  9700. section.Emit(Data(position,op));
  9701. END;
  9702. IF Trace THEN TraceExit("VisitCaseStatement") END;
  9703. END VisitCaseStatement;
  9704. PROCEDURE VisitWhileStatement*(x: SyntaxTree.WhileStatement);
  9705. VAR start: Label; true,false: Label;
  9706. BEGIN
  9707. IF Trace THEN TraceEnter("VisitWhileStatement") END;
  9708. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9709. start := NewLabel();
  9710. true := NewLabel();
  9711. false := NewLabel();
  9712. SetLabel(start);
  9713. Condition(x.condition,true,false);
  9714. SetLabel(true);
  9715. StatementSequence(x.statements);
  9716. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9717. BrL(start);
  9718. SetLabel(false);
  9719. IF Trace THEN TraceExit("VisitWhileStatement") END;
  9720. END VisitWhileStatement;
  9721. PROCEDURE VisitRepeatStatement*(x: SyntaxTree.RepeatStatement);
  9722. VAR false,true: Label;
  9723. BEGIN
  9724. IF Trace THEN TraceEnter("VisitRepeatStatement") END;
  9725. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9726. true := NewLabel();
  9727. false := NewLabel();
  9728. SetLabel(false);
  9729. StatementSequence(x.statements);
  9730. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9731. Condition(x.condition,true,false);
  9732. SetLabel(true);
  9733. IF Trace THEN TraceExit("VisitRepeatStatement") END;
  9734. END VisitRepeatStatement;
  9735. PROCEDURE VisitForStatement*(x: SyntaxTree.ForStatement);
  9736. VAR
  9737. binary: SyntaxTree.BinaryExpression; start,true,false : Label; cmp: LONGINT; by: HUGEINT;
  9738. temporaryVariable: SyntaxTree.Variable;
  9739. temporaryVariableDesignator : SyntaxTree.Designator;
  9740. BEGIN
  9741. IF Trace THEN TraceEnter("VisitForStatement") END;
  9742. true := NewLabel();
  9743. false := NewLabel();
  9744. start := NewLabel();
  9745. Assign(x.variable,x.from);
  9746. temporaryVariable := GetTemporaryVariable(x.variable.type, FALSE, FALSE);
  9747. temporaryVariableDesignator := SyntaxTree.NewSymbolDesignator(Basic.invalidPosition, NIL, temporaryVariable);
  9748. temporaryVariableDesignator.SetType(x.variable.type.resolved);
  9749. Assign(temporaryVariableDesignator,x.to);
  9750. IF x.by = NIL THEN by := 1 ELSE by := x.by.resolved(SyntaxTree.IntegerValue).value END;
  9751. IF by > 0 THEN
  9752. cmp := Scanner.LessEqual
  9753. ELSE
  9754. cmp := Scanner.GreaterEqual
  9755. END;
  9756. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,temporaryVariableDesignator,cmp);
  9757. binary.SetType(system.booleanType);
  9758. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9759. SetLabel(start);
  9760. Condition(binary,true,false);
  9761. SetLabel(true);
  9762. StatementSequence(x.statements);
  9763. binary := SyntaxTree.NewBinaryExpression(Basic.invalidPosition,x.variable,x.by,Scanner.Plus);
  9764. binary.SetType(x.variable.type);
  9765. Assign(x.variable,binary);
  9766. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9767. BrL(start);
  9768. SetLabel(false);
  9769. IF Trace THEN TraceExit("VisitForStatement") END;
  9770. END VisitForStatement;
  9771. PROCEDURE VisitExitableBlock*(x: SyntaxTree.ExitableBlock);
  9772. VAR prevLoop: Label;
  9773. BEGIN
  9774. IF Trace THEN TraceEnter("VisitExitableBlock") END;
  9775. prevLoop := currentLoop;
  9776. currentLoop := NewLabel();
  9777. StatementSequence(x.statements);
  9778. SetLabel(currentLoop);
  9779. currentLoop := prevLoop;
  9780. IF Trace THEN TraceExit("VisitExitableBlock") END;
  9781. END VisitExitableBlock;
  9782. PROCEDURE VisitLoopStatement*(x: SyntaxTree.LoopStatement);
  9783. VAR prevLoop,start: Label;
  9784. BEGIN
  9785. IF Trace THEN TraceEnter("VisitLoopStatement") END;
  9786. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9787. start := NewLabel();
  9788. prevLoop := currentLoop;
  9789. SetLabel(start);
  9790. currentLoop := NewLabel();
  9791. StatementSequence(x.statements);
  9792. IF cooperativeSwitches THEN EmitCooperativeSwitch END;
  9793. BrL(start);
  9794. SetLabel(currentLoop);
  9795. currentLoop := prevLoop;
  9796. IF Trace THEN TraceExit("VisitLoopStatement") END;
  9797. END VisitLoopStatement;
  9798. PROCEDURE VisitExitStatement*(x: SyntaxTree.ExitStatement);
  9799. VAR outer: SyntaxTree.Statement;
  9800. BEGIN
  9801. IF Trace THEN TraceEnter("VisitExitStatement") END;
  9802. IF locked THEN (* r if we jump out of an exclusive block *)
  9803. outer := x.outer;
  9804. WHILE ~(outer IS SyntaxTree.ExitableBlock) & ~((outer IS SyntaxTree.StatementBlock) & outer(SyntaxTree.StatementBlock).isExclusive) DO
  9805. outer := outer.outer;
  9806. END;
  9807. IF ~(outer IS SyntaxTree.ExitableBlock) THEN
  9808. Lock(FALSE);
  9809. END;
  9810. END;
  9811. BrL(currentLoop);
  9812. IF Trace THEN TraceExit("VisitExitStatement") END;
  9813. END VisitExitStatement;
  9814. PROCEDURE VisitReturnStatement*(x: SyntaxTree.ReturnStatement);
  9815. VAR
  9816. expression, parameterDesignator: SyntaxTree.Expression;
  9817. type, componentType: SyntaxTree.Type;
  9818. res, right: Operand;
  9819. left, mem, reg: IntermediateCode.Operand;
  9820. parameter: SyntaxTree.Parameter;
  9821. procedure: SyntaxTree.Procedure;
  9822. procedureType: SyntaxTree.ProcedureType;
  9823. returnTypeOffset: LONGINT;
  9824. delegate: BOOLEAN;
  9825. map: SymbolMap;
  9826. callingConvention, parametersSize: LONGINT;
  9827. BEGIN
  9828. IF Trace THEN TraceEnter("VisitReturnStatement") END;
  9829. expression := x.returnValue;
  9830. procedure := currentScope(SyntaxTree.ProcedureScope).ownerProcedure;
  9831. procedureType := procedure.type(SyntaxTree.ProcedureType);
  9832. IF currentIsInline THEN
  9833. IF expression # NIL THEN
  9834. map := currentMapper.Get(NIL);
  9835. IF map # NIL THEN
  9836. Assign(map.to, expression);
  9837. ELSE
  9838. Evaluate(expression,res);
  9839. Emit(Return(position,res.op));
  9840. ReleaseOperand(res);
  9841. END;
  9842. END;
  9843. BrL(currentInlineExit);
  9844. RETURN;
  9845. END;
  9846. IF expression # NIL THEN
  9847. type := expression.type.resolved;
  9848. IF (expression IS SyntaxTree.ResultDesignator) THEN
  9849. IF locked THEN Lock(FALSE) END;
  9850. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9851. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9852. (* "RETURN RESULT" -> no assignment, it is assumed that result has been written to return parameter via structured return type *)
  9853. 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
  9854. (* return without structured return parameter *)
  9855. Evaluate(expression,res);
  9856. delegate := (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate);
  9857. IF locked OR profile THEN
  9858. Emit(Push(position,res.op));
  9859. IF delegate THEN HALT(200) END;
  9860. ReleaseOperand(res);
  9861. IF locked THEN Lock(FALSE) END;
  9862. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9863. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9864. reg := NewRegisterOperand(res.op.type);
  9865. Emit(Pop(position,reg));
  9866. Emit(Return(position,reg));
  9867. ReleaseIntermediateOperand(reg);
  9868. ELSE
  9869. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9870. Emit(Return(position,res.op));
  9871. ReleaseOperand(res);
  9872. END;
  9873. ELSIF (type IS SyntaxTree.RecordType) OR (type IS SyntaxTree.ArrayType) OR (type IS SyntaxTree.RangeType) OR (type IS SyntaxTree.ComplexType) OR type.IsPointer()
  9874. THEN
  9875. (* return using structured return parameter *)
  9876. 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)
  9877. OR SemanticChecker.IsPointerType(type));
  9878. (* parameter := currentScope(SyntaxTree.ProcedureScope).FindParameter(Global.ReturnParameterName); *)
  9879. parameter :=procedureType.returnParameter;
  9880. ASSERT(parameter # NIL);
  9881. returnTypeOffset := parameter.offsetInBits;
  9882. (*
  9883. IF parameter# NIL THEN
  9884. returnTypeOffset := parameter.offsetInBits + system.SizeOfParameter(parameter);
  9885. INC(returnTypeOffset,(-returnTypeOffset) MOD system.AlignmentOf(system.parameterAlignment,parameter.type));
  9886. ELSE
  9887. returnTypeOffset := system.offsetFirstParameter
  9888. END;
  9889. *)
  9890. left := IntermediateCode.Memory(addressType,fp,ToMemoryUnits(system,returnTypeOffset));
  9891. IF type IS SyntaxTree.RangeType THEN
  9892. (* array range type *)
  9893. Evaluate(expression, right);
  9894. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 0);
  9895. Emit(Mov(position,mem, right.op)); (* first *)
  9896. ReleaseIntermediateOperand(mem);
  9897. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9898. Emit(Mov(position,mem, right.tag)); (* last *)
  9899. ReleaseIntermediateOperand(mem);
  9900. MakeMemory(mem, left, IntermediateCode.GetType(system, system.lenType), 2 * ToMemoryUnits(system, system.SizeOf(system.lenType)));
  9901. Emit(Mov(position,mem, right.extra)); (* step *)
  9902. ReleaseIntermediateOperand(mem);
  9903. ReleaseOperand(right);
  9904. ELSIF type IS SyntaxTree.ComplexType THEN
  9905. Evaluate(expression, right);
  9906. componentType := type(SyntaxTree.ComplexType).componentType;
  9907. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), 0);
  9908. Emit(Mov(position,mem, right.op)); (* real part *)
  9909. ReleaseIntermediateOperand(mem);
  9910. MakeMemory(mem, left, IntermediateCode.GetType(system, componentType), ToMemoryUnits(system, system.SizeOf(componentType)));
  9911. Emit(Mov(position,mem, right.tag)); (* imaginary part *)
  9912. ReleaseIntermediateOperand(mem);
  9913. ReleaseOperand(right);
  9914. ELSE (* covers cases: pointer / record / array *)
  9915. parameter := procedureType.returnParameter;
  9916. checker.SetCurrentScope(currentScope);
  9917. ASSERT(parameter # NIL);
  9918. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9919. Assign(parameterDesignator,expression);
  9920. END;
  9921. ReleaseIntermediateOperand(left);
  9922. IF locked THEN Lock(FALSE) END;
  9923. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9924. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9925. ELSIF (type IS SyntaxTree.MathArrayType) OR (type IS SyntaxTree.ProcedureType) THEN
  9926. parameter := procedureType.returnParameter;
  9927. checker.SetCurrentScope(currentScope);
  9928. IF parameter = NIL THEN
  9929. Error(procedure.position, "structured return of parameter of procedure not found");
  9930. ELSE
  9931. parameterDesignator := checker.NewSymbolDesignator(expression.position,NIL,parameter);
  9932. Assign(parameterDesignator,expression);
  9933. END;
  9934. IF locked THEN Lock(FALSE) END;
  9935. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9936. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9937. ELSE
  9938. HALT(200);
  9939. END;
  9940. ELSE
  9941. IF locked THEN Lock(FALSE) END;
  9942. IF backend.writeBarriers & HasPointers(procedure.procedureScope) THEN ResetVariables2(procedure.procedureScope,FALSE) END;
  9943. IF ~backend.cooperative & profile THEN ProfilerEnterExit(numberProcedures,FALSE) END;
  9944. END;
  9945. IF backend.cooperative THEN
  9946. BrL(exitLabel);
  9947. ELSE
  9948. callingConvention := procedureType.callingConvention;
  9949. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  9950. parametersSize := ProcedureParametersSize(backend.system,procedure);
  9951. ELSE
  9952. parametersSize := 0;
  9953. END;
  9954. EmitLeave(section, position,procedure, callingConvention);
  9955. Emit(Exit(position,procedure.type(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  9956. END;
  9957. IF Trace THEN TraceExit("VisitReturnStatement") END;
  9958. END VisitReturnStatement;
  9959. PROCEDURE MakeAwaitProcedure(x: SyntaxTree.AwaitStatement): SyntaxTree.Procedure;
  9960. VAR procedure: SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType; procedureScope: SyntaxTree.ProcedureScope;
  9961. identifier: SyntaxTree.Identifier; body: SyntaxTree.Body; returnStatement : SyntaxTree.ReturnStatement;
  9962. statements: SyntaxTree.StatementSequence;
  9963. name, suffix: SyntaxTree.IdentifierString;
  9964. BEGIN
  9965. Strings.IntToStr(awaitProcCounter,suffix);
  9966. Strings.Concat("@AwaitProcedure",suffix,name);
  9967. identifier := SyntaxTree.NewIdentifier(name);
  9968. INC(awaitProcCounter);
  9969. ASSERT(currentScope IS SyntaxTree.ProcedureScope);
  9970. procedureScope := SyntaxTree.NewProcedureScope(currentScope);
  9971. ASSERT(procedureScope.outerScope IS SyntaxTree.ProcedureScope);
  9972. procedure := SyntaxTree.NewProcedure(x.position,identifier,procedureScope);
  9973. procedure.SetAccess(SyntaxTree.Hidden);
  9974. procedure.SetScope(currentScope);
  9975. procedureType := SyntaxTree.NewProcedureType(x.position,currentScope);
  9976. procedureType.SetReturnType(system.booleanType);
  9977. procedure.SetType(procedureType);
  9978. body := SyntaxTree.NewBody(x.position,procedureScope);
  9979. procedureScope.SetBody(body);
  9980. returnStatement := SyntaxTree.NewReturnStatement(x.position,body);
  9981. returnStatement.SetReturnValue(x.condition);
  9982. statements := SyntaxTree.NewStatementSequence();
  9983. statements.AddStatement(returnStatement);
  9984. body.SetStatementSequence(statements);
  9985. currentScope.AddProcedure(procedure);
  9986. RETURN procedure
  9987. END MakeAwaitProcedure;
  9988. PROCEDURE VisitAwaitStatement*(x: SyntaxTree.AwaitStatement);
  9989. VAR proc: SyntaxTree.Procedure; res: IntermediateCode.Operand; symbol: Sections.Section;
  9990. call: IntermediateCode.Operand; label, start, true, false: Label; name: Basic.SegmentedName;
  9991. BEGIN
  9992. IF Trace THEN TraceEnter("VisitAwaitStatement") END;
  9993. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  9994. IF backend.cooperative THEN
  9995. start := NewLabel();
  9996. true := NewLabel();
  9997. false := NewLabel();
  9998. SetLabel(start);
  9999. Condition(x.condition,true,false);
  10000. SetLabel(false);
  10001. PushSelfPointer();
  10002. CallThis(position,"ExclusiveBlocks","Await",1);
  10003. BrL(start);
  10004. SetLabel(true);
  10005. PushSelfPointer();
  10006. CallThis(position,"ExclusiveBlocks","FinalizeAwait",1);
  10007. ELSE
  10008. proc := MakeAwaitProcedure(x);
  10009. Emit(Push(position,fp));
  10010. GetCodeSectionNameForSymbol(proc,name);
  10011. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10012. IntermediateCode.InitAddress(call,addressType,name, GetFingerprint(proc), 0);
  10013. res := NewRegisterOperand(IntermediateCode.GetType(system,system.booleanType));
  10014. Emit(Call(position,call,ProcParametersSize(proc)));
  10015. Emit(Result(position,res));
  10016. (*
  10017. AcquireThisRegister(IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10018. IntermediateCode.InitRegister(res,IntermediateCode.GetType(system,system.booleanType),IntermediateCode.Result);
  10019. *)
  10020. InitOperand(result,ModeValue);
  10021. result.op := res;
  10022. label := NewLabel();
  10023. BreqL(label, result.op, SELF.true);
  10024. ReleaseOperand(result);
  10025. symbol := NewSection(module.allSections, Sections.CodeSection, name,proc,commentPrintout # NIL);
  10026. IntermediateCode.InitAddress(res, addressType, name,GetFingerprint(proc), 0);
  10027. Emit(Push(position,res));
  10028. Emit(Push(position,fp));
  10029. PushSelfPointer();
  10030. Emit(Push(position,nil));
  10031. CallThis(position,"Objects","Await",4);
  10032. SetLabel(label);
  10033. END;
  10034. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10035. IF Trace THEN TraceExit("VisitAwaitStatement") END;
  10036. END VisitAwaitStatement;
  10037. PROCEDURE StatementSequence(x: SyntaxTree.StatementSequence);
  10038. VAR statement: SyntaxTree.Statement; i: LONGINT; (* pos: LONGINT; *)
  10039. BEGIN
  10040. FOR i := 0 TO x.Length() - 1 DO
  10041. statement := x.GetStatement( i );
  10042. Statement(statement);
  10043. IF cooperativeSwitches & (section.pc - lastSwitchPC > 1000) THEN EmitCooperativeSwitch END;
  10044. END;
  10045. END StatementSequence;
  10046. PROCEDURE PushSelfPointer;
  10047. VAR scope: SyntaxTree.Scope; op: Operand; moduleSection: IntermediateCode.Section; moduleOffset, parametersSize: LONGINT; procedure: SyntaxTree.Procedure;
  10048. procedureType: SyntaxTree.ProcedureType;
  10049. BEGIN
  10050. scope := currentScope;
  10051. WHILE(scope.outerScope IS SyntaxTree.ProcedureScope) DO
  10052. scope := scope.outerScope;
  10053. END;
  10054. IF scope.outerScope IS SyntaxTree.ModuleScope THEN
  10055. moduleSection := meta.ModuleSection();
  10056. IF backend.cooperative THEN
  10057. moduleOffset := 0;
  10058. ELSE
  10059. moduleOffset := moduleSection.pc;
  10060. END;
  10061. op.op := IntermediateCode.Address(addressType, moduleSection.name, GetFingerprint(moduleSection.symbol), moduleOffset);
  10062. ELSE
  10063. GetBaseRegister(op.op,currentScope,scope);
  10064. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10065. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10066. parametersSize := ProcParametersSize(procedure);
  10067. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits)*(procedureType.parametersOffset+1)+parametersSize);
  10068. IF backend.cooperative THEN
  10069. IntermediateCode.AddOffset(op.op,ToMemoryUnits(system,addressType.sizeInBits));
  10070. END;
  10071. IntermediateCode.MakeMemory(op.op,addressType);
  10072. END;
  10073. Emit(Push(position,op.op));
  10074. ReleaseOperand(op);
  10075. END PushSelfPointer;
  10076. PROCEDURE Lock(lock: BOOLEAN);
  10077. BEGIN
  10078. IF Trace THEN TraceEnter("Lock") END;
  10079. IF profile THEN ProfilerEnterExit(numberProcedures, FALSE) END;
  10080. CheckRegistersFree(); (* no register may be in use as operands should not be preserved over the lock / unlock boundary *)
  10081. ASSERT(modifyAssignmentCounter = 0);
  10082. IF dump # NIL THEN
  10083. IF lock THEN dump.String("lock") ELSE dump.String("unlock") END;
  10084. dump.Ln;dump.Update;
  10085. END;
  10086. PushSelfPointer;
  10087. IF backend.cooperative THEN
  10088. Emit(Push(position,IntermediateCode.Immediate(sizeType, 1)));
  10089. IF lock THEN CallThis(position,"ExclusiveBlocks","Enter",2)
  10090. ELSE CallThis(position,"ExclusiveBlocks","Exit",2);
  10091. END;
  10092. ELSE
  10093. Emit(Push(position,true));
  10094. IF lock THEN CallThis(position,"Objects","Lock",2)
  10095. ELSE CallThis(position,"Objects","Unlock",2);
  10096. END;
  10097. END;
  10098. IF profile THEN ProfilerEnterExit(numberProcedures, TRUE) END;
  10099. IF Trace THEN TraceExit("Lock") END;
  10100. END Lock;
  10101. PROCEDURE VisitStatementBlock*(x: SyntaxTree.StatementBlock);
  10102. VAR previouslyUnchecked, previouslyCooperativeSwitches: BOOLEAN; end: Label;
  10103. BEGIN
  10104. IF Trace THEN TraceEnter("VisitStatementBlock") END;
  10105. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10106. previouslyUnchecked := isUnchecked;
  10107. isUnchecked := isUnchecked OR x.isUnchecked;
  10108. previouslyCooperativeSwitches := cooperativeSwitches;
  10109. cooperativeSwitches := cooperativeSwitches & ~x.isUncooperative;
  10110. IF x.isExclusive THEN Lock(TRUE); ASSERT(~locked); locked := TRUE; END;
  10111. IF x.statements # NIL THEN
  10112. StatementSequence(x.statements);
  10113. END;
  10114. IF (x IS SyntaxTree.Body) THEN
  10115. IF (x(SyntaxTree.Body).finally # NIL) THEN
  10116. section.SetFinally(section.pc);
  10117. StatementSequence(x(SyntaxTree.Body).finally)
  10118. ELSIF x.isExclusive THEN
  10119. end := NewLabel();
  10120. BrL(end);
  10121. section.SetFinally(section.pc);
  10122. Lock(FALSE);
  10123. EmitTrap(position,RethrowTrap);
  10124. SetLabel(end);
  10125. END;
  10126. END;
  10127. IF x.isExclusive THEN Lock(FALSE); ASSERT(locked); locked := FALSE; END;
  10128. isUnchecked := previouslyUnchecked;
  10129. cooperativeSwitches := previouslyCooperativeSwitches;
  10130. IF Trace THEN TraceExit("VisitStatementBlock") END;
  10131. END VisitStatementBlock;
  10132. PROCEDURE VisitCode*(x: SyntaxTree.Code);
  10133. VAR (* inline: Sections.CellNet; symbol: SyntaxTree.Symbol; *)
  10134. in, out: IntermediateCode.Rules; statement: SyntaxTree.Statement; i: LONGINT; operand,par: Operand; str: POINTER TO ARRAY OF CHAR;
  10135. result, mem: IntermediateCode.Operand; scope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; return: IntermediateCode.Operand;
  10136. procedure: SyntaxTree.Procedure;
  10137. map: SymbolMap;
  10138. callingConvention, parametersSize: LONGINT;
  10139. BEGIN
  10140. scope := currentScope;
  10141. WHILE ~(scope IS SyntaxTree.ProcedureScope) DO scope := scope.outerScope END;
  10142. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10143. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10144. return := emptyOperand;
  10145. IF Trace THEN TraceEnter("VisitCode") END;
  10146. IF (x.inRules # NIL) & (x.inRules.Length()>0) THEN
  10147. NEW(in, x.inRules.Length());
  10148. FOR i := 0 TO LEN(in)-1 DO
  10149. statement := x.inRules.GetStatement(i);
  10150. WITH statement: SyntaxTree.Assignment DO
  10151. Evaluate(statement.right, operand);
  10152. result := operand.op;
  10153. NEW(str, 64);
  10154. Basic.GetString(statement.left(SyntaxTree.IdentifierDesignator).identifier, str^);
  10155. in[i] := result; IntermediateCode.SetString(in[i], str);
  10156. ReleaseIntermediateOperand(operand.tag);
  10157. END;
  10158. END;
  10159. ELSE in := NIL
  10160. END;
  10161. IF (x.outRules # NIL) & (x.outRules.Length()>0) THEN
  10162. NEW(out, x.outRules.Length());
  10163. FOR i := 0 TO LEN(out)-1 DO
  10164. statement := x.outRules.GetStatement(i);
  10165. IF statement IS SyntaxTree.StatementBlock THEN statement := statement(SyntaxTree.StatementBlock).statements.GetStatement(0) END;
  10166. WITH statement: SyntaxTree.Assignment DO
  10167. Designate(statement.left, operand);
  10168. MakeMemory(result, operand.op, IntermediateCode.GetType(system,statement.left.type) , 0);
  10169. NEW(str, 64);
  10170. Basic.GetString(statement.right(SyntaxTree.IdentifierDesignator).identifier, str^);
  10171. out[i] := result; IntermediateCode.SetString(out[i], str);
  10172. ReleaseOperand(operand); (* implicit increase of use of operand.op in MakeMemory *)
  10173. |statement: SyntaxTree.ReturnStatement DO
  10174. NEW(str, 64);
  10175. Basic.GetString(statement.returnValue(SyntaxTree.IdentifierDesignator).identifier, str^);
  10176. IF currentIsInline THEN
  10177. map := currentMapper.Get(NIL);
  10178. Designate(map.to, operand);
  10179. IF map.isAddress THEN
  10180. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10181. ELSE
  10182. result := operand.op;
  10183. END;
  10184. (*! only if it does not fit into register
  10185. MakeMemory(result, operand.op, IntermediateCode.GetType(system,map.to.type) , 0);
  10186. *)
  10187. (*Evaluate(map.to, operand);*)
  10188. out[i] := result;
  10189. ELSE
  10190. out[i] :=NewRegisterOperand(IntermediateCode.GetType(system, procedureType.returnType));
  10191. END;
  10192. IntermediateCode.SetString(out[i], str);
  10193. ReleaseIntermediateOperand(operand.tag);
  10194. return := out[i];
  10195. ELSE
  10196. END;
  10197. END;
  10198. ELSE out := NIL
  10199. END;
  10200. Emit(Asm(x.position,x.sourceCode, in, out));
  10201. IF in # NIL THEN
  10202. FOR i := 0 TO LEN(in)-1 DO
  10203. ReleaseIntermediateOperand(in[i]);
  10204. END;
  10205. END;
  10206. IF out # NIL THEN
  10207. FOR i := 0 TO LEN(out)-1 DO
  10208. WITH statement: SyntaxTree.Assignment DO
  10209. ReleaseIntermediateOperand(out[i]);
  10210. |statement: SyntaxTree.ReturnStatement DO
  10211. (* release happens below *)
  10212. ELSE
  10213. END;
  10214. statement := x.outRules.GetStatement(i);
  10215. END;
  10216. END;
  10217. IF return.mode # IntermediateCode.Undefined THEN
  10218. IF currentIsInline THEN
  10219. ELSIF SemanticChecker.ReturnedAsParameter(procedureType.returnType) THEN
  10220. Symbol(procedureType.returnParameter, par);
  10221. MakeMemory(mem, par.op, return.type, 0);
  10222. ReleaseOperand(par);
  10223. Emit(Mov(position, mem, return));
  10224. ReleaseIntermediateOperand(mem);
  10225. ELSE
  10226. Emit(Return(position,return));
  10227. END;
  10228. ReleaseIntermediateOperand(return);
  10229. IF currentIsInline THEN RETURN END;
  10230. callingConvention := procedureType(SyntaxTree.ProcedureType).callingConvention;
  10231. IF callingConvention = SyntaxTree.WinAPICallingConvention THEN
  10232. parametersSize := ProcedureParametersSize(backend.system,procedure);
  10233. ELSE
  10234. parametersSize := 0;
  10235. END;
  10236. EmitLeave(section, position,procedure, callingConvention);
  10237. Emit(Exit(position,procedureType(SyntaxTree.ProcedureType).pcOffset,callingConvention, parametersSize));
  10238. END;
  10239. IF Trace THEN TraceExit("VisitCode") END;
  10240. END VisitCode;
  10241. PROCEDURE ProcParametersSize(procedure: SyntaxTree.Procedure): LONGINT;
  10242. BEGIN
  10243. RETURN ProcedureParametersSize(system, procedure);
  10244. END ProcParametersSize;
  10245. PROCEDURE ParameterCopies(x: SyntaxTree.ProcedureType);
  10246. VAR parameter: SyntaxTree.Parameter; type, base: SyntaxTree.Type;
  10247. op: Operand; temp,size,par,dst, length,null: IntermediateCode.Operand;
  10248. const, call: IntermediateCode.Operand;
  10249. parameterDesignator: SyntaxTree.Expression;
  10250. saved: RegisterEntry;
  10251. name: Basic.SegmentedName;
  10252. BEGIN
  10253. IF Trace THEN TraceEnter("ParameterCopies") END;
  10254. parameter := x.firstParameter;
  10255. WHILE parameter # NIL DO
  10256. IF parameter.kind = SyntaxTree.ValueParameter THEN
  10257. type := parameter.type.resolved;
  10258. IF IsOpenArray(type) THEN
  10259. VisitParameter(parameter);
  10260. op := result;
  10261. IF backend.cooperative & parameter.NeedsTrace() THEN
  10262. length := GetArrayLength(type, op.tag);
  10263. size := NewRegisterOperand(addressType);
  10264. base := ArrayBaseType(type);
  10265. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,system.SizeOf(base)));
  10266. Emit(Mul(position, size, length, const));
  10267. dst := NewRegisterOperand (addressType);
  10268. Emit(Mov(position, dst, size));
  10269. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10270. Emit(Sub(position,dst,sp,dst));
  10271. Emit(And(position,dst,dst,const));
  10272. Emit(Mov(position,sp,dst));
  10273. par := fp;
  10274. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10275. IntermediateCode.InitImmediate(null, byteType, 0);
  10276. Emit(Fill(position, dst, size, null));
  10277. ReleaseIntermediateOperand(dst);
  10278. ReleaseIntermediateOperand(length);
  10279. SaveRegisters();ReleaseUsedRegisters(saved);
  10280. (* register dst has been freed before SaveRegisters already *)
  10281. base := ArrayBaseType(type);
  10282. (* assign method of open array *)
  10283. IF base.IsRecordType() THEN
  10284. Emit (Push(position, length));
  10285. Emit (Push(position, dst));
  10286. Emit (Push(position, op.op));
  10287. GetRecordTypeName (base.resolved(SyntaxTree.RecordType),name);
  10288. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Array"));
  10289. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Assign"));
  10290. IntermediateCode.InitAddress(call, addressType, name , 0, 0);
  10291. Emit(Call(position,call,ToMemoryUnits(system, 3*system.addressSize)));
  10292. ELSIF base.resolved IS SyntaxTree.ProcedureType THEN (* array of delegates *)
  10293. Emit (Push(position,length));
  10294. Emit (Push(position, dst));
  10295. Emit (Push(position, length));
  10296. Emit (Push(position, op.op));
  10297. CallThis(position,"GarbageCollector","AssignDelegateArray", 4);
  10298. ELSE
  10299. Emit (Push(position, length));
  10300. Emit (Push(position, dst));
  10301. Emit (Push(position, length));
  10302. Emit (Push(position, op.op));
  10303. CallThis(position,"GarbageCollector","AssignPointerArray", 4);
  10304. ASSERT(ArrayBaseType(type).IsPointer());
  10305. END;
  10306. RestoreRegisters(saved);
  10307. ELSE
  10308. temp := GetDynamicSize(type,op.tag);
  10309. ReuseCopy(size,temp);
  10310. ReleaseIntermediateOperand(temp);
  10311. const := IntermediateCode.Immediate(addressType,ToMemoryUnits(system,-system.addressSize)); (* alignment *)
  10312. Emit(Sub(position,size,sp,size));
  10313. Emit(And(position,size,size,const));
  10314. Emit(Mov(position,sp,size));
  10315. par := fp;
  10316. IntermediateCode.AddOffset(par,ToMemoryUnits(system,parameter.offsetInBits));
  10317. ReleaseIntermediateOperand(size);
  10318. size := GetDynamicSize(type,op.tag);
  10319. END;
  10320. Emit(Copy(position,sp,op.op,size));
  10321. ReleaseIntermediateOperand(size);
  10322. ReleaseOperand(op);
  10323. IntermediateCode.MakeMemory(par,addressType);
  10324. Emit(Mov(position,par,sp));
  10325. ELSIF (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) THEN
  10326. checker.SetCurrentScope(currentScope);
  10327. parameterDesignator := checker.NewSymbolDesignator(position,NIL,parameter);
  10328. Assign(parameterDesignator,parameterDesignator);
  10329. END;
  10330. END;
  10331. parameter := parameter.nextParameter;
  10332. END;
  10333. IF Trace THEN TraceExit("ParameterCopies") END;
  10334. END ParameterCopies;
  10335. PROCEDURE InitVariables(scope: SyntaxTree.Scope);
  10336. VAR x: SyntaxTree.Variable;
  10337. BEGIN
  10338. x := scope.firstVariable;
  10339. WHILE x # NIL DO
  10340. InitVariable(x,FALSE);
  10341. x := x.nextVariable;
  10342. END;
  10343. END InitVariables;
  10344. PROCEDURE GetFingerprint(symbol: SyntaxTree.Symbol): LONGINT;
  10345. BEGIN
  10346. IF (symbol # NIL) THEN
  10347. RETURN fingerPrinter.SymbolFP(symbol).public
  10348. ELSE
  10349. RETURN 0
  10350. END;
  10351. END GetFingerprint;
  10352. PROCEDURE Body(x: SyntaxTree.Body; scope: SyntaxTree.Scope; ir: IntermediateCode.Section; moduleBody: BOOLEAN);
  10353. VAR prevScope: SyntaxTree.Scope; procedureType: SyntaxTree.ProcedureType; procedure: SyntaxTree.Procedure;
  10354. cellScope: SyntaxTree.CellScope; op: Operand; string: SyntaxTree.IdentifierString;
  10355. saved: RegisterEntry; left, right: IntermediateCode.Operand;
  10356. name: Basic.SegmentedName;
  10357. offset: LONGINT;
  10358. BEGIN
  10359. IF Trace THEN TraceEnter("Body") END;
  10360. ReleaseUsedRegisters(saved); (* just in case ... *)
  10361. section := ir;
  10362. exitLabel := NewLabel ();
  10363. IF moduleBody THEN moduleBodySection := section END;
  10364. IF ir.comments # NIL THEN
  10365. commentPrintout := Printout.NewPrinter(ir.comments,Printout.SourceCode,FALSE);
  10366. commentPrintout.SingleStatement(TRUE);
  10367. dump := ir.comments;
  10368. ELSE
  10369. commentPrintout := NIL;
  10370. dump := NIL;
  10371. END;
  10372. prevScope := currentScope;
  10373. currentScope := scope;
  10374. lastSwitchPC := 0;
  10375. cooperativeSwitches := backend.cooperative;
  10376. procedure := scope(SyntaxTree.ProcedureScope).ownerProcedure;
  10377. procedureType := procedure.type(SyntaxTree.ProcedureType);
  10378. IF x # NIL THEN
  10379. IF emitLabels THEN Emit(LabelInstruction(x.position)) END;
  10380. IF profile & (x.code = NIL) THEN (* do not profile assembler code sections *)
  10381. IF moduleBody THEN
  10382. ProfilerInit();
  10383. ELSE
  10384. Basic.SegmentedNameToString(ir.name, string);
  10385. ProfilerAddProcedure(numberProcedures,string);
  10386. ProfilerEnterExit(numberProcedures,TRUE);
  10387. END;
  10388. END;
  10389. IF moduleBody & (operatorInitializationCodeSection # NIL) THEN
  10390. Emit(Call(position,IntermediateCode.Address(addressType, operatorInitializationCodeSection.name, GetFingerprint(operatorInitializationCodeSection.symbol), 0), 0))
  10391. END;
  10392. section.SetPositionOrAlignment(procedure.fixed, procedure.alignment);
  10393. IF (scope.outerScope # NIL) & (scope.outerScope IS SyntaxTree.CellScope) THEN
  10394. cellScope := scope.outerScope(SyntaxTree.CellScope);
  10395. IF procedure = cellScope.bodyProcedure THEN
  10396. IF (cellScope.constructor # NIL) & ~backend.cellsAreObjects THEN
  10397. StaticCallOperand(op, cellScope.constructor);
  10398. Emit(Call(position,op.op,0));
  10399. END;
  10400. END;
  10401. END;
  10402. InitVariables(scope);
  10403. IF backend.preciseGC & (x.code = NIL) & (~procedureType.noPAF) & ~procedure.isEntry & ~procedure.isExit THEN
  10404. GetCodeSectionNameForSymbol(procedure, name);
  10405. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Descriptor"));
  10406. IntermediateCode.InitAddress(right, addressType, name, 0, 0);
  10407. IF ProtectModulesPointers THEN
  10408. offset := ToMemoryUnits(module.system,meta.RecordBaseOffset*module.system.addressSize)+1;
  10409. ELSE
  10410. offset := ToMemoryUnits(module.system, 2 * module.system.addressSize)+1;
  10411. END;
  10412. IntermediateCode.SetOffset(right,offset); (* tag *)
  10413. IntermediateCode.InitMemory(left,addressType,fp,0);
  10414. Emit(Mov(position, left, right));
  10415. END;
  10416. IF HasPointers (procedure.procedureScope) & backend.writeBarriers THEN ResetVariables2(procedure.procedureScope,TRUE) END;
  10417. (* must be done after the descriptor is there, otherwise copied parameters are forgotten to be traced *)
  10418. ParameterCopies(procedureType);
  10419. IF x.code = NIL THEN
  10420. VisitStatementBlock(x);
  10421. ELSE
  10422. VisitCode(x.code)
  10423. END;
  10424. IF profile & (x.code = NIL) & ~moduleBody THEN (* do not profile assembler code sections *)
  10425. IF ~backend.cooperative THEN
  10426. ProfilerEnterExit(numberProcedures,FALSE);
  10427. END;
  10428. INC(numberProcedures);
  10429. END;
  10430. END;
  10431. IF backend.cooperative THEN
  10432. IF HasPointers (procedure.procedureScope) THEN CreateResetMethod (procedure.procedureScope) END;
  10433. IF HasPointers (procedure.procedureScope) OR HasVariableParameters (procedure.procedureScope) OR IsNested (procedure) THEN CreateProcedureDescriptor (procedure) END;
  10434. END;
  10435. IF x # NIL THEN
  10436. SELF.position := x.position;
  10437. END;
  10438. CheckRegistersFree();
  10439. ASSERT(modifyAssignmentCounter = 0);
  10440. currentScope := prevScope;
  10441. IF Trace THEN TraceExit("Body") END;
  10442. END Body;
  10443. END ImplementationVisitor;
  10444. MetaDataGenerator=OBJECT
  10445. VAR
  10446. implementationVisitor: ImplementationVisitor;
  10447. declarationVisitor: DeclarationVisitor;
  10448. module: Sections.Module;
  10449. moduleName: ARRAY 128 OF CHAR;
  10450. moduleNamePool: Basic.HashTableInt;
  10451. moduleNamePoolSection: IntermediateCode.Section;
  10452. modulePointerSection: IntermediateCode.Section;
  10453. modulePointerSizePC: LONGINT;
  10454. modulePointerSectionOffset: LONGINT;
  10455. modulePointers: LONGINT;
  10456. simple: BOOLEAN; (* simple = no module loading, no reflection *)
  10457. RecordBaseOffset: LONGINT;
  10458. MethodTableOffset: LONGINT; (* method table offset from zero *)
  10459. BaseTypesTableOffset: LONGINT; (* table with all record extensions offset *)
  10460. TypeTags: LONGINT; (* type extension level support *)
  10461. TypeRecordBaseOffset: LONGINT; (* offset of type zero offset (without method entries) *)
  10462. patchInfoPC: LONGINT;
  10463. patchCRC: LONGINT;
  10464. CONST
  10465. EmptyBlockOffset = 2;
  10466. PROCEDURE &InitMetaDataGenerator(implementationVisitor: ImplementationVisitor; declarationVisitor: DeclarationVisitor; simple: BOOLEAN);
  10467. BEGIN
  10468. IF implementationVisitor.backend.cooperative THEN
  10469. TypeTags := MAX(LONGINT);
  10470. BaseTypesTableOffset := 0;
  10471. MethodTableOffset := 2;
  10472. TypeRecordBaseOffset := 0;
  10473. RecordBaseOffset := 0;
  10474. ELSIF simple THEN
  10475. TypeTags := 3; (* only 3 extensions allowed *)
  10476. BaseTypesTableOffset := 1;
  10477. MethodTableOffset := BaseTypesTableOffset+TypeTags;
  10478. TypeRecordBaseOffset := 0;
  10479. RecordBaseOffset := 1;
  10480. ELSE
  10481. TypeTags := 16;
  10482. BaseTypesTableOffset := -2; (* typeInfo and size field *)
  10483. MethodTableOffset := -TypeTags+BaseTypesTableOffset;
  10484. TypeRecordBaseOffset := TypeTags + 2; (* MPO, typeInfo *)
  10485. (* change this when Heaps.HeapBlock is modified *)
  10486. IF implementationVisitor.system.addressType.sizeInBits = 64 THEN
  10487. RecordBaseOffset := 8; (* addresses *)
  10488. ELSE
  10489. RecordBaseOffset := 9; (* addresses *)
  10490. END;
  10491. END;
  10492. SELF.simple := simple;
  10493. SELF.implementationVisitor := implementationVisitor;
  10494. SELF.declarationVisitor := declarationVisitor;
  10495. implementationVisitor.meta := SELF;
  10496. declarationVisitor.meta := SELF;
  10497. END InitMetaDataGenerator;
  10498. PROCEDURE SetModule(module: Sections.Module);
  10499. VAR namePoolOffset, offset: LONGINT; name: Basic.SegmentedName;
  10500. BEGIN
  10501. SELF.module := module;
  10502. Global.GetModuleName(module.module,moduleName);
  10503. Global.GetSymbolSegmentedName(module.module, name);
  10504. IF ReflectionSupport & ~simple & ~implementationVisitor.backend.cooperative THEN
  10505. NEW(moduleNamePool, 32);
  10506. (*! require GC protection *)
  10507. modulePointerSection := Block("Heaps","ArrayBlockDesc",".@ModulePointerArray", modulePointerSectionOffset);
  10508. IF ProtectModulesPointers THEN
  10509. name := "Heaps.AnyPtr";
  10510. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10511. (* set base pointer *)
  10512. NamedSymbolAt(modulePointerSection, modulePointerSectionOffset -1, name, NIL, 0, offset);
  10513. END;
  10514. ArrayBlock(modulePointerSection, modulePointerSizePC, "", TRUE);
  10515. modulePointers := 0;
  10516. moduleNamePoolSection := Block("Heaps","SystemBlockDesc",".@ModuleNamePool", namePoolOffset);
  10517. AddPointer(moduleNamePoolSection, namePoolOffset);
  10518. END;
  10519. END SetModule;
  10520. PROCEDURE AddPointer(section: IntermediateCode.Section; offset: LONGINT);
  10521. BEGIN
  10522. IF ~implementationVisitor.backend.cooperative THEN
  10523. NamedSymbol(modulePointerSection, section.name, NIL, offset, 0);
  10524. INC(modulePointers);
  10525. (* optimization hint: this can be done once at the end but for consistency of the first tests we keep it like this *)
  10526. PatchSize(modulePointerSection, modulePointerSizePC, modulePointers);
  10527. END;
  10528. END AddPointer;
  10529. PROCEDURE GetTypeRecordBaseOffset(numberMethods: LONGINT): LONGINT;
  10530. BEGIN
  10531. IF implementationVisitor.backend.cooperative OR simple THEN RETURN 0 ELSE RETURN TypeRecordBaseOffset + numberMethods END;
  10532. END GetTypeRecordBaseOffset;
  10533. PROCEDURE HeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10534. VAR offset: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol;
  10535. BEGIN
  10536. (* change this when Heaps.HeapBlock is modified *)
  10537. INC(dataAdrOffset,7);
  10538. Info(section,"headerAdr");
  10539. Address(section,0);
  10540. Info(section,"typeDesc");
  10541. symbol := implementationVisitor.GetTypeDescriptor(moduleName,typeName, name);
  10542. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  10543. NamedSymbol(section, name, symbol, 0, offset);
  10544. Info(section,"mark: LONGINT;");
  10545. Longint(section,-1);
  10546. Info(section,"refCount: LONGINT;");
  10547. Longint(section,0);
  10548. (*
  10549. IF module.system.addressType.sizeInBits = 64 THEN Longint(section, 0); INC(dataAdrOffset); END;
  10550. *)
  10551. Info(section,"dataAdr-: ADDRESS");
  10552. Symbol(section,section, dataAdrOffset,0);
  10553. Info(section,"size-: SIZE");
  10554. Address(section,0);
  10555. Info(section,"nextMark: HeapBlock;");
  10556. Address(section,0);
  10557. END HeapBlock;
  10558. PROCEDURE ProtectedHeapBlock(CONST moduleName, typeName: ARRAY OF CHAR; section: IntermediateCode.Section; dataAdrOffset: LONGINT);
  10559. VAR i: LONGINT;
  10560. BEGIN
  10561. INC(dataAdrOffset,14); (*! change this when changing data structure below *)
  10562. HeapBlock(moduleName,typeName,section,dataAdrOffset);
  10563. Info(section,"count*: LONGINT");
  10564. Longint(section,0);
  10565. Info(section,"locked*: BOOLEAN");
  10566. Longint(section,0);
  10567. Info(section,"awaitingLock*: ProcessQueue");
  10568. Address(section,0);
  10569. Address(section,0);
  10570. Info(section,"awaitingCond*: ProcessQueue");
  10571. Address(section,0);
  10572. Address(section,0);
  10573. Info(section,"lockedBy*: ANY");
  10574. Address(section,0);
  10575. Info(section,"waitingPriorities*: ARRAY NumPriorities OF LONGINT");
  10576. Longint(section,1);
  10577. FOR i := 2 TO 6 DO
  10578. Longint(section,0);
  10579. END;
  10580. Info(section,"lock*: ANY");
  10581. Address(section,0);
  10582. END ProtectedHeapBlock;
  10583. PROCEDURE Info(section: IntermediateCode.Section; CONST s: ARRAY OF CHAR);
  10584. BEGIN
  10585. IF section.comments # NIL THEN section.comments.String(s); section.comments.Ln; section.comments.Update END;
  10586. END Info;
  10587. PROCEDURE Address(section: IntermediateCode.Section; value: ADDRESS);
  10588. VAR op: IntermediateCode.Operand;
  10589. BEGIN
  10590. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10591. section.Emit(Data(Basic.invalidPosition,op));
  10592. END Address;
  10593. PROCEDURE Size(section: IntermediateCode.Section; value: SIZE);
  10594. VAR op: IntermediateCode.Operand;
  10595. BEGIN
  10596. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10597. section.Emit(Data(Basic.invalidPosition,op));
  10598. END Size;
  10599. PROCEDURE Set(section: IntermediateCode.Section; value: Basic.Set);
  10600. VAR op: IntermediateCode.Operand;
  10601. BEGIN
  10602. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.setType),SYSTEM.VAL(Basic.Integer,value));
  10603. section.Emit(Data(Basic.invalidPosition,op));
  10604. END Set;
  10605. PROCEDURE Longint(section: IntermediateCode.Section; value: LONGINT);
  10606. VAR op: IntermediateCode.Operand;
  10607. BEGIN
  10608. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10609. section.Emit(Data(Basic.invalidPosition,op));
  10610. END Longint;
  10611. PROCEDURE PatchAddress(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10612. VAR op,noOperand: IntermediateCode.Operand;
  10613. BEGIN
  10614. IntermediateCode.InitOperand(noOperand);
  10615. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),value);
  10616. section.PatchOperands(pc,op,noOperand,noOperand);
  10617. END PatchAddress;
  10618. PROCEDURE PatchSize(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10619. VAR op,noOperand: IntermediateCode.Operand;
  10620. BEGIN
  10621. IntermediateCode.InitOperand(noOperand);
  10622. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.sizeType),value);
  10623. section.PatchOperands(pc,op,noOperand,noOperand);
  10624. END PatchSize;
  10625. PROCEDURE PatchLongint(section: IntermediateCode.Section; pc: LONGINT; value: LONGINT);
  10626. VAR op,noOperand: IntermediateCode.Operand;
  10627. BEGIN
  10628. IntermediateCode.InitOperand(noOperand);
  10629. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.longintType),value);
  10630. section.PatchOperands(pc,op,noOperand,noOperand);
  10631. END PatchLongint;
  10632. PROCEDURE PatchSymbol(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10633. VAR op, noOperand: IntermediateCode.Operand;
  10634. BEGIN
  10635. IntermediateCode.InitOperand(noOperand);
  10636. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10637. section.PatchOperands(pc,op,noOperand,noOperand);
  10638. END PatchSymbol;
  10639. PROCEDURE Boolean(section: IntermediateCode.Section; value: BOOLEAN);
  10640. VAR op: IntermediateCode.Operand; intValue: LONGINT;
  10641. BEGIN
  10642. IF value = FALSE THEN intValue := 0 ELSE intValue :=1 END;
  10643. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.booleanType),intValue);
  10644. section.Emit(Data(Basic.invalidPosition,op));
  10645. END Boolean;
  10646. PROCEDURE Char(section: IntermediateCode.Section; char: CHAR);
  10647. VAR op: IntermediateCode.Operand;
  10648. BEGIN
  10649. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.characterType),ORD(char));
  10650. section.Emit(Data(Basic.invalidPosition,op));
  10651. END Char;
  10652. PROCEDURE Integer(section: IntermediateCode.Section; int: LONGINT);
  10653. VAR op: IntermediateCode.Operand;
  10654. BEGIN
  10655. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.integerType),int);
  10656. section.Emit(Data(Basic.invalidPosition,op));
  10657. END Integer;
  10658. PROCEDURE String(section: IntermediateCode.Section; CONST str: ARRAY OF CHAR);
  10659. VAR i: LONGINT;
  10660. BEGIN
  10661. Info(section,str);
  10662. i := 0;
  10663. WHILE(str[i] # 0X) DO
  10664. Char(section,str[i]);
  10665. INC(i);
  10666. END;
  10667. Char(section,0X);
  10668. END String;
  10669. PROCEDURE String0(section: IntermediateCode.Section; str: StringPool.Index);
  10670. VAR s: Basic.SectionName;
  10671. BEGIN
  10672. StringPool.GetString(str, s);
  10673. String(section, s);
  10674. END String0;
  10675. PROCEDURE NamedSymbol(section: IntermediateCode.Section; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10676. VAR op: IntermediateCode.Operand;
  10677. BEGIN
  10678. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10679. IntermediateCode.SetOffset(op,realOffset);
  10680. section.Emit(Data(Basic.invalidPosition,op));
  10681. END NamedSymbol;
  10682. PROCEDURE NamedSymbolAt(section: IntermediateCode.Section; pc: LONGINT; name: Basic.SegmentedName; symbol: SyntaxTree.Symbol; virtualOffset, realOffset: LONGINT);
  10683. VAR op: IntermediateCode.Operand;
  10684. BEGIN
  10685. IntermediateCode.InitAddress(op, IntermediateCode.GetType(module.system, module.system.addressType), name,implementationVisitor.GetFingerprint(symbol), virtualOffset);
  10686. IntermediateCode.SetOffset(op,realOffset);
  10687. section.EmitAt(pc, Data(Basic.invalidPosition,op));
  10688. END NamedSymbolAt;
  10689. PROCEDURE Symbol(section: IntermediateCode.Section; symbol: Sections.Section; virtualOffset, realOffset: LONGINT);
  10690. BEGIN
  10691. IF symbol= NIL THEN
  10692. Address( section, realOffset);
  10693. ASSERT(virtualOffset = 0);
  10694. ELSE
  10695. NamedSymbol(section, symbol.name, symbol.symbol, virtualOffset, realOffset)
  10696. END;
  10697. END Symbol;
  10698. (* OutPointers delivers
  10699. {pointerOffset}
  10700. *)
  10701. PROCEDURE Pointers(offset: LONGINT; symbol: Sections.Section; section: IntermediateCode.Section; type: SyntaxTree.Type; VAR numberPointers: LONGINT);
  10702. VAR variable: SyntaxTree.Variable; i,n,size: LONGINT; base: SyntaxTree.Type; property: SyntaxTree.Property; parameter: SyntaxTree.Parameter;
  10703. BEGIN
  10704. type := type.resolved;
  10705. IF (type IS SyntaxTree.AnyType) OR (type IS SyntaxTree.ObjectType) THEN
  10706. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10707. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10708. ELSIF (type IS SyntaxTree.PortType) & implementationVisitor.backend.cellsAreObjects THEN
  10709. Symbol(section, symbol, 0, offset); INC(numberPointers);
  10710. ELSIF (type IS SyntaxTree.PointerType) & type.NeedsTrace() THEN
  10711. Symbol(section, symbol, 0, (offset )); INC(numberPointers);
  10712. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1);D.Ln; END;
  10713. ELSIF (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate) THEN
  10714. Symbol(section, symbol, 0, (offset )+ToMemoryUnits(module.system,module.system.addressSize)); INC(numberPointers);
  10715. IF Trace THEN D.Str("ptr at offset="); D.Int(offset+ToMemoryUnits(module.system,module.system.addressSize),1); END;
  10716. ELSIF (type IS SyntaxTree.RecordType) THEN
  10717. (* never treat a record like a pointer, even if the pointer field is set! *)
  10718. WITH type: SyntaxTree.RecordType DO
  10719. base := type.GetBaseRecord();
  10720. IF base # NIL THEN
  10721. Pointers(offset,symbol,section, base,numberPointers);
  10722. END;
  10723. variable := type.recordScope.firstVariable;
  10724. WHILE(variable # NIL) DO
  10725. IF ~(variable.untraced) THEN
  10726. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10727. END;
  10728. variable := variable.nextVariable;
  10729. END;
  10730. END;
  10731. ELSIF (type IS SyntaxTree.CellType) THEN
  10732. WITH type: SyntaxTree.CellType DO
  10733. base := type.GetBaseRecord();
  10734. IF base # NIL THEN
  10735. Pointers(offset,symbol,section, base,numberPointers);
  10736. END;
  10737. variable := type.cellScope.firstVariable;
  10738. WHILE(variable # NIL) DO
  10739. IF ~(variable.untraced) THEN
  10740. Pointers(offset+ToMemoryUnits(module.system,variable.offsetInBits), symbol, section, variable.type,numberPointers);
  10741. END;
  10742. variable := variable.nextVariable;
  10743. END;
  10744. property := type.firstProperty;
  10745. WHILE(property # NIL) DO
  10746. IF ~(property.untraced) THEN
  10747. Pointers(offset+ToMemoryUnits(module.system,property.offsetInBits), symbol, section, property.type,numberPointers);
  10748. END;
  10749. property := property.nextProperty;
  10750. END;
  10751. parameter := type.firstParameter;
  10752. WHILE(parameter # NIL) DO
  10753. IF ~(parameter.untraced) THEN
  10754. Pointers(offset+ToMemoryUnits(module.system,parameter.offsetInBits), symbol, section, parameter.type,numberPointers);
  10755. END;
  10756. parameter := parameter.nextParameter;
  10757. END;
  10758. END;
  10759. ELSIF (type IS SyntaxTree.ArrayType) THEN
  10760. WITH type: SyntaxTree.ArrayType DO
  10761. IF type.form= SyntaxTree.Static THEN
  10762. n := type.staticLength;
  10763. base := type.arrayBase.resolved;
  10764. WHILE(base IS SyntaxTree.ArrayType) DO
  10765. type := base(SyntaxTree.ArrayType);
  10766. n := n* type.staticLength;
  10767. base := type.arrayBase.resolved;
  10768. END;
  10769. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10770. IF SemanticChecker.ContainsPointer(base) & base.NeedsTrace() THEN
  10771. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10772. FOR i := 0 TO n-1 DO
  10773. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10774. END;
  10775. END;
  10776. ELSE
  10777. Symbol( section, symbol, 0, (offset )); INC(numberPointers);
  10778. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10779. END;
  10780. END;
  10781. ELSIF (type IS SyntaxTree.MathArrayType) THEN
  10782. WITH type: SyntaxTree.MathArrayType DO
  10783. IF type.form = SyntaxTree.Static THEN
  10784. n := type.staticLength;
  10785. base := type.arrayBase.resolved;
  10786. WHILE(base IS SyntaxTree.MathArrayType) DO
  10787. type := base(SyntaxTree.MathArrayType);
  10788. n := n* type.staticLength;
  10789. base := type.arrayBase.resolved;
  10790. END;
  10791. size := ToMemoryUnits(module.system,module.system.AlignedSizeOf(base));
  10792. IF SemanticChecker.ContainsPointer(base) THEN
  10793. ASSERT(n<1000000); (* not more than one million pointers on the stack ... *)
  10794. FOR i := 0 TO n-1 DO
  10795. Pointers(offset+i*size, symbol, section, base,numberPointers);
  10796. END;
  10797. END;
  10798. ELSE
  10799. Symbol(section, symbol, 0, (offset )); INC(numberPointers); (* GC relevant pointer is at offset 0 *)
  10800. IF Trace THEN D.Str("ptr at offset="); D.Int(offset,1); D.Ln; END;
  10801. END
  10802. END;
  10803. (* ELSE no pointers in type *)
  10804. END;
  10805. END Pointers;
  10806. PROCEDURE EnterDynamicName(source: IntermediateCode.Section; CONST name: ARRAY OF CHAR; index: LONGINT; pool: Basic.HashTableInt): LONGINT;
  10807. VAR position,i: LONGINT; ch: CHAR;
  10808. BEGIN
  10809. IF pool.Has(index) THEN
  10810. RETURN pool.GetInt(index)
  10811. ELSE
  10812. position := source.pc;
  10813. pool.PutInt(index, position);
  10814. Info(source, name);
  10815. i := 0;
  10816. REPEAT
  10817. ch := name[i]; INC(i);
  10818. Char( source, ch);
  10819. UNTIL ch = 0X;
  10820. END;
  10821. RETURN position;
  10822. END EnterDynamicName;
  10823. PROCEDURE DynamicName(source: IntermediateCode.Section; index: StringPool.Index; pool: Basic.HashTableInt): LONGINT;
  10824. VAR name: Basic.SectionName; position: LONGINT;
  10825. BEGIN
  10826. IF pool.Has(index) THEN
  10827. RETURN pool.GetInt(index)
  10828. ELSE
  10829. StringPool.GetString(index, name);
  10830. position := EnterDynamicName(source,name,index, pool);
  10831. END;
  10832. RETURN position;
  10833. END DynamicName;
  10834. PROCEDURE NamedBlock(CONST mName, typeName: ARRAY OF CHAR; name: Basic.SegmentedName; VAR offset: LONGINT): IntermediateCode.Section;
  10835. VAR section: IntermediateCode.Section;
  10836. BEGIN
  10837. section := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  10838. IF implementationVisitor.backend.cooperative THEN
  10839. Info(section, "TypeDescriptor");
  10840. Basic.ToSegmentedName("BaseTypes.Array", name);
  10841. NamedSymbol(section, name,NIL, 0, 0);
  10842. BasePointer(section);
  10843. offset := 0;
  10844. ELSE
  10845. IF ProtectModulesPointers THEN
  10846. HeapBlock(mName,typeName,section,2);
  10847. END;
  10848. Info(section, "HeapBlock");
  10849. IF ProtectModulesPointers THEN
  10850. Symbol(section,section,2,0);
  10851. ELSE
  10852. Address(section,0);
  10853. END;
  10854. Info(section, "TypeDescriptor");
  10855. Address(section,0);
  10856. offset := section.pc;
  10857. END;
  10858. RETURN section
  10859. END NamedBlock;
  10860. PROCEDURE Block(CONST mName, typeName, suffix: ARRAY OF CHAR; VAR offset: LONGINT): IntermediateCode.Section;
  10861. VAR name: ARRAY 128 OF CHAR; pooledName: Basic.SegmentedName;
  10862. BEGIN
  10863. COPY(moduleName,name);
  10864. Strings.Append(name,suffix);
  10865. Basic.ToSegmentedName(name, pooledName);
  10866. RETURN NamedBlock(mName, typeName, pooledName, offset);
  10867. END Block;
  10868. PROCEDURE ArrayBlock(source: IntermediateCode.Section; VAR sizePC: LONGINT; CONST baseType: ARRAY OF CHAR; hasPointer: BOOLEAN);
  10869. VAR name: Basic.SegmentedName;
  10870. BEGIN
  10871. Info(source,"ArrayHeader");
  10872. IF implementationVisitor.backend.cooperative THEN
  10873. sizePC := source.pc;
  10874. Address(source,0);
  10875. NamedSymbol(source,source.name,NIL,0,ToMemoryUnits(implementationVisitor.system,(BaseArrayTypeSize + 1)*implementationVisitor.addressType.sizeInBits));
  10876. IF baseType # "" THEN
  10877. Basic.ToSegmentedName(baseType, name);
  10878. NamedSymbol(source, name,NIL, 0, 0);
  10879. ELSE
  10880. Address(source,0);
  10881. END;
  10882. Address(source,0);
  10883. ELSE
  10884. Address(source,0);
  10885. Address(source,0);
  10886. (* first pointer for GC *)
  10887. IF hasPointer THEN
  10888. (* points to first element in the array, this is NOT the base type descriptor *)
  10889. NamedSymbol(source,source.name, NIL,source.pc+2,0);
  10890. ELSE
  10891. Address(source,0);
  10892. END;
  10893. sizePC := source.pc;
  10894. Address(source,0);
  10895. Info(source,"array data");
  10896. END;
  10897. END ArrayBlock;
  10898. PROCEDURE PatchArray(section: IntermediateCode.Section; pc: LONGINT; size: LONGINT);
  10899. BEGIN
  10900. IF implementationVisitor.backend.cooperative THEN
  10901. PatchSize(section, pc, size);
  10902. PatchSize(section, pc + 3, size);
  10903. ELSE
  10904. PatchSize(section, pc-3, size); (* actually only for arrays with pointers, but does not harm... *)
  10905. PatchSize(section, pc, size);
  10906. END;
  10907. END PatchArray;
  10908. PROCEDURE ExportDesc(source: IntermediateCode.Section);
  10909. VAR
  10910. i: LONGINT; section: Sections.Section; fingerPrinter : FingerPrinter.FingerPrinter;
  10911. sectionArray: POINTER TO ARRAY OF Sections.Section;
  10912. poolMap: Basic.HashTableInt;
  10913. namePool: IntermediateCode.Section;
  10914. namePoolOffset: LONGINT;
  10915. PROCEDURE Compare(VAR s1, s2: Sections.Section): BOOLEAN;
  10916. VAR n1, n2: Basic.SectionName; index: LONGINT; ch1, ch2: CHAR;
  10917. BEGIN
  10918. Basic.SegmentedNameToString(s1.name,n1);
  10919. Basic.SegmentedNameToString(s2.name,n2);
  10920. index := 0;
  10921. ch1 := n1[index];
  10922. ch2 := n2[index];
  10923. WHILE (ch1 # 0X) & (ch1 = ch2) DO
  10924. INC(index);
  10925. ch1 := n1[index];
  10926. ch2 := n2[index];
  10927. END;
  10928. RETURN ch1 < ch2;
  10929. END Compare;
  10930. PROCEDURE QuickSort(VAR list: ARRAY OF Sections.Section; lo, hi: LONGINT);
  10931. VAR
  10932. i, j: LONGINT;
  10933. x, t: Sections.Section;
  10934. BEGIN
  10935. IF lo < hi THEN
  10936. i := lo; j := hi; x:= list[(lo+hi) DIV 2];
  10937. WHILE i <= j DO
  10938. WHILE Compare(list[i], x) DO INC(i) END;
  10939. WHILE Compare(x, list[j]) DO DEC(j) END;
  10940. IF i <= j THEN
  10941. t := list[i]; list[i] := list[j]; list[j] := t; (* swap i and j *)
  10942. INC(i); DEC(j)
  10943. END
  10944. END;
  10945. IF lo < j THEN QuickSort(list, lo, j) END;
  10946. IF i < hi THEN QuickSort(list, i, hi) END
  10947. END;
  10948. END QuickSort;
  10949. (*
  10950. ExportDesc* = RECORD
  10951. fp*: ADDRESS;
  10952. name* {UNTRACED}: DynamicName;
  10953. adr*: ADDRESS;
  10954. exports*: LONGINT;
  10955. dsc* {UNTRACED}: ExportArray
  10956. END;
  10957. ExportArray* = POINTER {UNSAFE} TO ARRAY OF ExportDesc;
  10958. *)
  10959. PROCEDURE ExportDesc2(
  10960. source: IntermediateCode.Section;
  10961. namePool: IntermediateCode.Section;
  10962. fingerPrinter: FingerPrinter.FingerPrinter;
  10963. symbol: Sections.Section;
  10964. name: StringPool.Index;
  10965. VAR patchAdr: LONGINT
  10966. ): BOOLEAN;
  10967. VAR fingerPrint: SyntaxTree.FingerPrint;
  10968. BEGIN
  10969. (*IF (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection)
  10970. & (symbol.type # Sections.InlineCodeSection)
  10971. THEN
  10972. *)
  10973. IF (symbol = NIL) OR ( (implementationVisitor.backend.cooperative) & (symbol.symbol = NIL) OR (symbol.symbol # NIL) & (symbol.type # Sections.InitCodeSection) & (symbol.type # Sections.EntryCodeSection)
  10974. & (symbol.type # Sections.ExitCodeSection)
  10975. & (symbol.type # Sections.InlineCodeSection))
  10976. THEN
  10977. IF (symbol = NIL) OR (symbol # NIL) & (symbol.type # Sections.InlineCodeSection) THEN
  10978. IF (symbol # NIL) & (symbol.symbol # NIL) THEN
  10979. fingerPrint := fingerPrinter.SymbolFP(symbol.symbol);
  10980. Longint(source,fingerPrint.public);
  10981. ELSE
  10982. Longint(source, 0);
  10983. END;
  10984. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0);END;
  10985. Symbol(source, namePool, DynamicName(namePool, name, poolMap), 0); (* reference to dynamic name *)
  10986. Symbol(source, symbol,0,0);
  10987. patchAdr := source.pc;
  10988. Longint(source, 0);
  10989. IF module.system.addressType.sizeInBits = 64 THEN Longint(source, 0); END;
  10990. Address(source,0);
  10991. END;
  10992. RETURN TRUE
  10993. ELSE
  10994. RETURN FALSE
  10995. END;
  10996. END ExportDesc2;
  10997. PROCEDURE Export(CONST sections: ARRAY OF Sections.Section);
  10998. VAR level, olevel, s: LONGINT; prev, this: Basic.SegmentedName; name: ARRAY 256 OF CHAR;
  10999. scopes: ARRAY LEN(prev)+1 OF Scope; arrayName: ARRAY 32 OF CHAR;
  11000. sym: Sections.Section; offset: LONGINT; symbol: Sections.Section;
  11001. nextPatch: LONGINT;
  11002. TYPE
  11003. Scope = RECORD
  11004. elements: LONGINT;
  11005. gelements: LONGINT;
  11006. section: IntermediateCode.Section;
  11007. patchAdr: LONGINT;
  11008. arraySizePC: LONGINT;
  11009. beginPC: LONGINT; (* current scope start pc *)
  11010. END;
  11011. BEGIN
  11012. Basic.InitSegmentedName(prev);
  11013. olevel := -1;
  11014. scopes[0].section := source;
  11015. scopes[0].arraySizePC := MIN(LONGINT);
  11016. FOR s := 0 TO LEN(sections)-1 DO
  11017. symbol := sections[s];
  11018. 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
  11019. this := sections[s].name;
  11020. level := 0;
  11021. WHILE (level < LEN(this)) & (this[level] > 0) DO
  11022. WHILE (level < LEN(this)) & (this[level] > 0) & (prev[level] = this[level]) DO
  11023. INC(level);
  11024. END;
  11025. WHILE level < olevel DO
  11026. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11027. IF olevel > 0 THEN
  11028. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11029. nextPatch := scopes[olevel-1].patchAdr+1;
  11030. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11031. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11032. END;
  11033. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11034. DEC(olevel);
  11035. END;
  11036. IF (level < LEN(this)) & (this[level] > 0) THEN
  11037. IF level > olevel THEN
  11038. (*TRACE("opening",level); *)
  11039. IF scopes[level].section = NIL THEN
  11040. arrayName := ".@ExportArray";
  11041. Strings.AppendInt(arrayName, level);
  11042. scopes[level].section := Block("Heaps","SystemBlockDesc",arrayName,offset);
  11043. AddPointer(scopes[level].section,offset);
  11044. ArrayBlock(scopes[level].section,scopes[level].arraySizePC,"Modules.ExportDesc", FALSE);
  11045. END;
  11046. scopes[level].beginPC := scopes[level].section.pc;
  11047. olevel := level;
  11048. scopes[olevel].elements := 0;
  11049. END;
  11050. IF (level = LEN(this)-1) OR (this[level+1] <= 0) THEN
  11051. sym := sections[s];
  11052. ELSE
  11053. sym := NIL;
  11054. END;
  11055. IF ExportDesc2(scopes[level].section, namePool, fingerPrinter, sym, this[level], scopes[level].patchAdr)
  11056. THEN
  11057. INC(scopes[olevel].elements);
  11058. END;
  11059. (* enter string in scope *)
  11060. INC(level);
  11061. END;
  11062. END;
  11063. Basic.SegmentedNameToString(this, name);
  11064. prev := this;
  11065. END;
  11066. END;
  11067. WHILE 0 <= olevel DO
  11068. (*TRACE("closing",olevel,scopes[olevel].elements); *)
  11069. IF olevel > 0 THEN
  11070. PatchLongint(scopes[olevel-1].section,scopes[olevel-1].patchAdr, scopes[olevel].elements);
  11071. nextPatch := scopes[olevel-1].patchAdr+1;
  11072. IF module.system.addressType.sizeInBits = 64 THEN INC(nextPatch) END;
  11073. PatchSymbol(scopes[olevel-1].section,nextPatch, scopes[olevel].section.name, scopes[olevel].section.symbol, scopes[olevel].beginPC, 0);
  11074. END;
  11075. scopes[olevel].gelements := scopes[olevel].gelements + scopes[olevel].elements;
  11076. DEC(olevel);
  11077. END;
  11078. level := 0;
  11079. WHILE (level < LEN(scopes)) DO
  11080. IF (scopes[level].section # NIL) & (scopes[level].arraySizePC # MIN(LONGINT)) THEN
  11081. PatchArray(scopes[level].section, scopes[level].arraySizePC, scopes[level].gelements);
  11082. END;
  11083. INC(level);
  11084. END;
  11085. END Export;
  11086. BEGIN
  11087. NEW(fingerPrinter);
  11088. NEW(poolMap, 64);
  11089. (* 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 *)
  11090. namePool := Block("Heaps","SystemBlockDesc",".@NamePool",namePoolOffset);
  11091. NEW(sectionArray, module.allSections.Length());
  11092. FOR i := 0 TO module.allSections.Length() - 1 DO
  11093. section := module.allSections.GetSection(i);
  11094. sectionArray[i] := section;
  11095. END;
  11096. QuickSort(sectionArray^,0,module.allSections.Length()-1);
  11097. Export(sectionArray^);
  11098. END ExportDesc;
  11099. PROCEDURE ExceptionArray(source: IntermediateCode.Section);
  11100. VAR
  11101. p: Sections.Section; finallyPC, sizePC, size, i: LONGINT;
  11102. BEGIN
  11103. Info(source, "exception table offsets array descriptor");
  11104. size := 0;
  11105. ArrayBlock(source,sizePC,"Modules.ExceptionTableEntry", FALSE);
  11106. Info(source, "exception table content");
  11107. FOR i := 0 TO module.allSections.Length() - 1 DO
  11108. p := module.allSections.GetSection(i);
  11109. IF p.type = Sections.CodeSection THEN
  11110. finallyPC := p(IntermediateCode.Section).finally;
  11111. IF finallyPC>=0 THEN
  11112. Symbol( source, p, 0,0);
  11113. Symbol( source, p, finallyPC, 0);
  11114. Symbol( source, p, finallyPC,0);
  11115. INC(size);
  11116. END;
  11117. END
  11118. END;
  11119. PatchArray(source,sizePC,size);
  11120. END ExceptionArray;
  11121. PROCEDURE Name(section: IntermediateCode.Section; CONST name: ARRAY OF CHAR);
  11122. VAR i: LONGINT; ch: CHAR;
  11123. BEGIN
  11124. i := 0;
  11125. REPEAT
  11126. ch := name[i]; INC(i);
  11127. Char( section, ch);
  11128. UNTIL ch = 0X;
  11129. WHILE i < 32 DO
  11130. Char( section, 0X); INC(i);
  11131. END;
  11132. END Name;
  11133. PROCEDURE References(section: IntermediateCode.Section);
  11134. CONST
  11135. sfTypeNone = 0X;
  11136. sfTypeCHAR = 01X;
  11137. sfTypeCHAR8 = 02X;
  11138. sfTypeCHAR16 = 03X;
  11139. sfTypeCHAR32 = 04X;
  11140. sfTypeRANGE = 05X;
  11141. sfTypeSHORTINT = 06X;
  11142. sfTypeINTEGER = 07X;
  11143. sfTypeLONGINT = 08X;
  11144. sfTypeHUGEINT = 09X;
  11145. sfTypeWORD = 0AX;
  11146. sfTypeLONGWORD = 0BX;
  11147. sfTypeSIGNED8 = 0CX;
  11148. sfTypeSIGNED16 = 0DX;
  11149. sfTypeSIGNED32 = 0EX;
  11150. sfTypeSIGNED64 = 0FX;
  11151. sfTypeUNSIGNED8 = 10X;
  11152. sfTypeUNSIGNED16 = 11X;
  11153. sfTypeUNSIGNED32 = 12X;
  11154. sfTypeUNSIGNED64 = 13X;
  11155. sfTypeREAL = 14X;
  11156. sfTypeLONGREAL = 15X;
  11157. sfTypeCOMPLEX = 16X;
  11158. sfTypeLONGCOMPLEX = 17X;
  11159. sfTypeBOOLEAN = 18X;
  11160. sfTypeSET = 19X;
  11161. sfTypeANY = 1AX;
  11162. sfTypeOBJECT = 1BX;
  11163. sfTypeBYTE = 1CX;
  11164. sfTypeADDRESS = 1DX;
  11165. sfTypeSIZE = 1EX;
  11166. sfTypeIndirect = 1FX;
  11167. sfTypeRecord = 20X;
  11168. sfTypePointerToRecord = 21X;
  11169. sfTypePointerToArray = 22X;
  11170. sfTypeOpenArray = 23X;
  11171. sfTypeStaticArray = 24X;
  11172. sfTypeDynamicArray = 25X;
  11173. sfTypeMathStaticArray = 26X;
  11174. sfTypeMathOpenArray = 27X;
  11175. sfTypeMathTensor = 28X;
  11176. sfTypeProcedure = 29X;
  11177. sfTypeDelegate = 2AX;
  11178. sfTypeENUM = 2BX;
  11179. sfTypeCELL = 2CX;
  11180. sfTypePORT = 2DX;
  11181. sfIN = 0X;
  11182. sfOUT = 1X;
  11183. flagDelegate = 0;
  11184. flagConstructor = 1;
  11185. (* variable / parameter addressing modes *)
  11186. sfAbsolute = 0X; (* global vars *)
  11187. sfRelative = 1X; (* variables, value parameters *)
  11188. sfIndirect = 2X; (* var parameters *)
  11189. sfScopeBegin = 0F0X;
  11190. sfScopeEnd = 0F1X;
  11191. sfProcedure = 0F2X;
  11192. sfVariable = 0F3X;
  11193. sfTypeDeclaration = 0F4X;
  11194. sfModule = 0FFX;
  11195. RefInfo = TRUE;
  11196. VAR
  11197. s: Sections.Section; sizePC, i, startPC, lastOffset: LONGINT;
  11198. indirectTypes: Basic.HashTable;
  11199. PROCEDURE CurrentIndex(): LONGINT;
  11200. VAR i: LONGINT;
  11201. BEGIN
  11202. FOR i := startPC TO section.pc -1 DO
  11203. ASSERT (section.instructions[i].opcode = IntermediateCode.data);
  11204. INC(lastOffset, ToMemoryUnits(module.system, section.instructions[i].op1.type.sizeInBits));
  11205. END;
  11206. startPC := section.pc;
  11207. RETURN lastOffset;
  11208. END CurrentIndex;
  11209. (*
  11210. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11211. Module = sfModule prevSymbol:SIZE name:String Scope.
  11212. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11213. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfIndirect offset:SIZE | sfRelative offset:SIZE) Type.
  11214. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11215. Type =
  11216. sfTypePointerToRecord
  11217. | sfTypePointerToArray Type
  11218. | sfTypeOpenArray Type
  11219. | sfTypeDynamicArray Type
  11220. | sfTypeStaticArray length:SIZE Type
  11221. | sfTypeMathOpenArray Type
  11222. | sfTypeMathStaticArray length:SIZE Type
  11223. | sfTypeMathTensor Type
  11224. | sfTypeRecord tdAdr:ADDRESS
  11225. | sfTypeProcedure {Parameter} return:Type
  11226. | sfTypeDelegate {Parameter} return:Type
  11227. | sfTypePort (sfIN | sfOUT)
  11228. | sfTypeBOOLEAN
  11229. | sfTypeCHAR | sfTypeCHAR8 | sfTypeCHAR16 | sfTypeCHAR32
  11230. | sfTypeSHORTINT | sfTypeINTEGER | sfTypeLONGINT | sfTypeHUGEINT
  11231. | sfTypeSIGNED8 | sfTypeSIGNED16 | sfTypeSIGNED32 | sfTypeSIGNED64
  11232. | sfTypeUNSIGNED8 | sfTypeUNSIGNED16 | sfTypeUNSIGNED32 | sfTypeUNSIGNED64
  11233. | sfTypeWORD | sfTypeLONGWORD
  11234. | sfTypeREAL | sfTypeLONGREAL
  11235. | sfTypeCOMPLEX | sfTypeLONGCOMPLEX
  11236. | sfTypeSET | sfTypeANY | sfTypeOBJECT | sfTypeBYTE | sfTypeADDRESS | sfTypeSIZE
  11237. | sfTypeIndirect offset:SIZE.
  11238. *)
  11239. PROCEDURE Indirect(type: SyntaxTree.Type): BOOLEAN;
  11240. VAR offset: SIZE;
  11241. BEGIN
  11242. IF indirectTypes.Has(type) THEN
  11243. offset := indirectTypes.GetInt(type);
  11244. Char(section, sfTypeIndirect);
  11245. Size(section, offset);
  11246. RETURN TRUE;
  11247. ELSE
  11248. indirectTypes.PutInt(type, CurrentIndex());
  11249. RETURN FALSE;
  11250. END;
  11251. END Indirect;
  11252. PROCEDURE NType(type: SyntaxTree.Type);
  11253. VAR size: SIZE; td: SyntaxTree.TypeDeclaration; tir: Sections.Section;
  11254. segmentedName: Basic.SegmentedName; offset: LONGINT; parameter: SyntaxTree.Parameter;
  11255. BEGIN
  11256. IF type = NIL THEN
  11257. Char(section, sfTypeNone)
  11258. ELSE
  11259. type := type.resolved;
  11260. size := type.sizeInBits;
  11261. WITH type:SyntaxTree.PointerType DO
  11262. IF type.pointerBase.resolved IS SyntaxTree.RecordType THEN
  11263. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11264. Char(section, sfTypePointerToRecord);
  11265. (*! do we ever need the pointer base? NType(type.pointerBase);*)
  11266. ELSE
  11267. IF RefInfo THEN Info(section,"PointerToArray") END;
  11268. Char(section, sfTypePointerToArray);
  11269. NType(type.pointerBase);
  11270. END;
  11271. | type: SyntaxTree.ArrayType DO
  11272. IF ~Indirect(type) THEN
  11273. IF type.form = SyntaxTree.Open THEN
  11274. IF RefInfo THEN Info(section,"OpenArray") END;
  11275. Char(section, sfTypeOpenArray);
  11276. ELSIF type.form = SyntaxTree.SemiDynamic THEN
  11277. IF RefInfo THEN Info(section,"DynamicArray") END;
  11278. Char(section, sfTypeDynamicArray);
  11279. ELSIF type.form = SyntaxTree.Static THEN
  11280. IF RefInfo THEN Info(section,"StaticArray") END;
  11281. Char(section, sfTypeStaticArray);
  11282. Size(section, type.staticLength);
  11283. ELSE
  11284. HALT(100);
  11285. END;
  11286. NType(type.arrayBase);
  11287. END;
  11288. | type: SyntaxTree.MathArrayType DO
  11289. IF ~Indirect(type) THEN
  11290. IF type.form = SyntaxTree.Open THEN
  11291. IF RefInfo THEN Info(section,"MathOpenArray") END;
  11292. Char(section, sfTypeMathOpenArray);
  11293. ELSIF type.form = SyntaxTree.Static THEN
  11294. IF RefInfo THEN Info(section,"MathStaticArray") END;
  11295. Char(section, sfTypeMathStaticArray);
  11296. Size(section, type.staticLength);
  11297. ELSIF type.form = SyntaxTree.Tensor THEN
  11298. IF RefInfo THEN Info(section,"MathTensor") END;
  11299. Char(section, sfTypeMathTensor);
  11300. ELSE
  11301. HALT(100);
  11302. END;
  11303. NType(type.arrayBase);
  11304. END;
  11305. | type: SyntaxTree.RecordType DO
  11306. IF ~Indirect(type) THEN
  11307. IF type.pointerType # NIL (* OBJECT *) THEN
  11308. IF RefInfo THEN Info(section,"PointerToRecord") END;
  11309. Char(section, sfTypePointerToRecord)
  11310. ELSE
  11311. IF RefInfo THEN Info(section,"Record") END;
  11312. Char(section, sfTypeRecord);
  11313. td := type.typeDeclaration;
  11314. IF RefInfo THEN Info(section,"TD") END;
  11315. IF (td # NIL) THEN
  11316. Global.GetSymbolSegmentedName(td,segmentedName);
  11317. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11318. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11319. ELSE
  11320. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11321. END;
  11322. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(type(SyntaxTree.RecordType).recordScope.numberMethods)*module.system.addressSize);
  11323. Symbol(section, tir, 0, offset);
  11324. ELSE
  11325. Address(section, 0);
  11326. END;
  11327. END;
  11328. END;
  11329. | type: SyntaxTree.CellType DO
  11330. IF ~Indirect(type) THEN
  11331. IF RefInfo THEN Info(section,"Record") END;
  11332. Char(section, sfTypeRecord);
  11333. td := type.typeDeclaration;
  11334. IF RefInfo THEN Info(section,"TD") END;
  11335. IF (td # NIL) THEN
  11336. Global.GetSymbolSegmentedName(td,segmentedName);
  11337. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  11338. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11339. ELSE
  11340. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, segmentedName,td,declarationVisitor.dump);
  11341. END;
  11342. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11343. Symbol(section, tir, 0, offset);
  11344. ELSE
  11345. Address(section, 0);
  11346. END;
  11347. END;
  11348. | type: SyntaxTree.PortType DO
  11349. Char(section, sfTypePORT);
  11350. IF type.direction = SyntaxTree.OutPort THEN
  11351. Char(section, sfOUT)
  11352. ELSE
  11353. Char(section, sfIN)
  11354. END;
  11355. | type: SyntaxTree.ProcedureType DO
  11356. IF ~Indirect(type) THEN
  11357. IF type.isDelegate THEN
  11358. Char(section, sfTypeDelegate);
  11359. ELSE
  11360. Char(section, sfTypeProcedure);
  11361. END;
  11362. parameter := type.firstParameter;
  11363. WHILE(parameter # NIL) DO
  11364. NParameter(parameter, -1);
  11365. parameter := parameter.nextParameter;
  11366. END;
  11367. NType(type.returnType);
  11368. END;
  11369. | type:SyntaxTree.EnumerationType DO
  11370. Char(section, sfTypeENUM);
  11371. | type: SyntaxTree.BasicType DO
  11372. WITH type: SyntaxTree.BooleanType DO
  11373. IF RefInfo THEN Info(section,"Boolean") END;
  11374. Char(section, sfTypeBOOLEAN);
  11375. | type: SyntaxTree.CharacterType DO
  11376. IF type = module.system.characterType THEN
  11377. IF RefInfo THEN Info(section,"CHAR") END;
  11378. Char(section, sfTypeCHAR);
  11379. ELSIF (type = module.system.characterType8) OR (type.sizeInBits= 8) THEN
  11380. IF RefInfo THEN Info(section,"CHAR8") END;
  11381. Char(section, sfTypeCHAR8)
  11382. ELSIF (type = module.system.characterType16) OR (type.sizeInBits= 16) THEN
  11383. IF RefInfo THEN Info(section,"CHAR16") END;
  11384. Char(section, sfTypeCHAR16);
  11385. ELSIF (type = module.system.characterType32) OR (type.sizeInBits = 32) THEN
  11386. IF RefInfo THEN Info(section,"CHAR32") END;
  11387. Char(section, sfTypeCHAR32);
  11388. ELSE
  11389. HALT(100);
  11390. END;
  11391. |type: SyntaxTree.IntegerType DO
  11392. IF type(SyntaxTree.IntegerType).signed THEN
  11393. IF (type = module.system.shortintType) THEN
  11394. IF RefInfo THEN Info(section,"SHORTINT") END;
  11395. Char(section, sfTypeSHORTINT)
  11396. ELSIF (type = module.system.integerType) THEN
  11397. IF RefInfo THEN Info(section,"INTEGER") END;
  11398. Char(section, sfTypeINTEGER)
  11399. ELSIF (type = module.system.longintType) THEN
  11400. IF RefInfo THEN Info(section,"LONGINT") END;
  11401. Char(section, sfTypeLONGINT)
  11402. ELSIF (type = module.system.hugeintType) THEN
  11403. IF RefInfo THEN Info(section,"HUGEINT") END;
  11404. Char(section, sfTypeHUGEINT)
  11405. ELSIF (type = module.system.wordType) THEN
  11406. IF RefInfo THEN Info(section,"WORD") END;
  11407. Char(section, sfTypeWORD)
  11408. ELSIF (type = module.system.longWordType) THEN
  11409. IF RefInfo THEN Info(section,"LONGWORD") END;
  11410. Char(section, sfTypeLONGWORD);
  11411. ELSIF (type = Global.Integer8) OR (type.sizeInBits = 8 ) THEN
  11412. IF RefInfo THEN Info(section,"SIGNED8") END;
  11413. Char(section, sfTypeSIGNED8)
  11414. ELSIF (type = Global.Integer16) OR (type.sizeInBits = 16 ) THEN
  11415. IF RefInfo THEN Info(section,"SIGNED16") END;
  11416. Char(section, sfTypeSIGNED16)
  11417. ELSIF (type = Global.Integer32) OR (type.sizeInBits = 32 ) THEN
  11418. IF RefInfo THEN Info(section,"SIGNED32") END;
  11419. Char(section, sfTypeSIGNED32)
  11420. ELSIF (type = Global.Integer64) OR (type.sizeInBits = 64 ) THEN
  11421. IF RefInfo THEN Info(section,"SIGNED64") END;
  11422. Char(section, sfTypeSIGNED64)
  11423. ELSE
  11424. HALT(100);
  11425. END
  11426. ELSE (* unsigned *)
  11427. IF (type = Global.Unsigned8) OR (type.sizeInBits = 8 ) THEN
  11428. IF RefInfo THEN Info(section,"UNSIGNED8") END;
  11429. Char(section, sfTypeUNSIGNED8)
  11430. ELSIF (type = Global.Unsigned16) OR (type.sizeInBits = 16 ) THEN
  11431. IF RefInfo THEN Info(section,"UNSIGNED16") END;
  11432. Char(section, sfTypeUNSIGNED16)
  11433. ELSIF (type = Global.Unsigned32) OR (type.sizeInBits = 32 ) THEN
  11434. IF RefInfo THEN Info(section,"UNSIGNED32") END;
  11435. Char(section, sfTypeUNSIGNED32)
  11436. ELSIF (type = Global.Unsigned64) OR (type.sizeInBits = 64 ) THEN
  11437. IF RefInfo THEN Info(section,"UNSIGNED64") END;
  11438. Char(section, sfTypeUNSIGNED64)
  11439. ELSE
  11440. HALT(100)
  11441. END
  11442. END;
  11443. | type: SyntaxTree.FloatType DO
  11444. IF (type = module.system.realType) OR (type.sizeInBits = 32) THEN
  11445. IF RefInfo THEN Info(section,"REAL") END;
  11446. Char(section, sfTypeREAL);
  11447. ELSIF (type = module.system.longrealType) OR (type.sizeInBits = 64) THEN
  11448. IF RefInfo THEN Info(section,"LONGREAL") END;
  11449. Char(section, sfTypeLONGREAL);
  11450. ELSE
  11451. HALT(100);
  11452. END;
  11453. |type: SyntaxTree.ComplexType DO
  11454. IF (type = module.system.complexType) OR (type.sizeInBits = 64) THEN
  11455. IF RefInfo THEN Info(section,"COMPLEX") END;
  11456. Char(section, sfTypeCOMPLEX);
  11457. ELSIF (type = module.system.longcomplexType) OR (type.sizeInBits = 12) THEN
  11458. IF RefInfo THEN Info(section,"LONGCOMPLEX") END;
  11459. Char(section, sfTypeLONGCOMPLEX);
  11460. ELSE
  11461. HALT(100);
  11462. END;
  11463. |type:SyntaxTree.SetType DO
  11464. IF RefInfo THEN Info(section,"SET") END;
  11465. Char(section, sfTypeSET);
  11466. |type:SyntaxTree.AnyType DO
  11467. IF RefInfo THEN Info(section,"ANY") END;
  11468. Char(section, sfTypeANY);
  11469. |type:SyntaxTree.ObjectType DO
  11470. IF RefInfo THEN Info(section,"OBJECT") END;
  11471. Char(section, sfTypeOBJECT);
  11472. |type:SyntaxTree.ByteType DO
  11473. IF RefInfo THEN Info(section,"BYTE") END;
  11474. Char(section, sfTypeBYTE);
  11475. |type:SyntaxTree.RangeType DO
  11476. IF RefInfo THEN Info(section,"RANGE") END;
  11477. Char(section, sfTypeRANGE)
  11478. |type:SyntaxTree.AddressType DO
  11479. IF RefInfo THEN Info(section,"ADDRESS") END;
  11480. Char(section, sfTypeADDRESS)
  11481. |type:SyntaxTree.SizeType DO
  11482. IF RefInfo THEN Info(section,"SIZE") END;
  11483. Char(section, sfTypeSIZE)
  11484. ELSE
  11485. HALT(100)
  11486. END;
  11487. ELSE HALT(101);
  11488. END;
  11489. END;
  11490. END NType;
  11491. (*
  11492. Parameter = sfVariable prevSymbol:SIZE name:STRING (sfIndirec|sfRelative) offset:SIZE Type.
  11493. *)
  11494. PROCEDURE NParameter(parameter: SyntaxTree.Parameter; procOffset: LONGINT);
  11495. VAR pos: LONGINT; type: SyntaxTree.Type;
  11496. BEGIN
  11497. IF RefInfo THEN Info(section, "Parameter") END;
  11498. Char(section, sfVariable);
  11499. Size(section, procOffset);
  11500. String0(section, parameter.name);
  11501. type := parameter.type.resolved;
  11502. IF parameter.kind = SyntaxTree.VarParameter THEN
  11503. IF IsOpenArray(type) THEN Char(section, sfRelative)
  11504. ELSE Char(section, sfIndirect)
  11505. END;
  11506. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  11507. IF (type IS SyntaxTree.RecordType) OR IsStaticArray(type) THEN
  11508. Char(section, sfIndirect);
  11509. ELSE
  11510. Char(section, sfRelative);
  11511. END;
  11512. ELSE
  11513. Char(section, sfRelative);
  11514. END;
  11515. Size(section, ToMemoryUnits(module.system,parameter.offsetInBits));
  11516. NType(parameter.type);
  11517. END NParameter;
  11518. (*
  11519. Procedure = sfProcedure prevSymbol:SIZE name:STRING from:ADDRESS to:ADDRESS {Parameter} returnType:Type Scope.
  11520. *)
  11521. PROCEDURE NProcedure(procedure: SyntaxTree.Procedure; scopeOffset: LONGINT);
  11522. VAR s: Sections.Section; procedureType: SyntaxTree.ProcedureType; parameter: SyntaxTree.Parameter; pos: LONGINT;
  11523. flags: SET;
  11524. BEGIN
  11525. IF procedure.externalName # NIL THEN RETURN END;
  11526. IF RefInfo THEN Info(section, "Procedure") END;
  11527. pos := CurrentIndex();
  11528. procedureType := procedure.type.resolved(SyntaxTree.ProcedureType);
  11529. Char(section, sfProcedure);
  11530. Size(section, scopeOffset);
  11531. String0(section,procedure.name);
  11532. s := module.allSections.FindBySymbol(procedure);
  11533. Symbol(section,s,0,0); (* start *)
  11534. Symbol(section,s,s(IntermediateCode.Section).pc,0); (* end *)
  11535. flags := {};
  11536. IF procedureType.isDelegate THEN
  11537. INCL(flags, flagDelegate);
  11538. END;
  11539. IF procedure.isConstructor THEN
  11540. INCL(flags, flagConstructor);
  11541. END;
  11542. Set(section, flags);
  11543. IF RefInfo THEN Info(section, "Parameters") END;
  11544. parameter := procedureType.firstParameter;
  11545. WHILE(parameter # NIL) DO
  11546. NParameter(parameter, pos);
  11547. parameter := parameter.nextParameter;
  11548. END;
  11549. IF procedureType.returnParameter # NIL THEN
  11550. NParameter(procedureType.returnParameter, pos);
  11551. END;
  11552. IF procedureType.selfParameter # NIL THEN
  11553. NParameter(procedureType.selfParameter, pos);
  11554. END;
  11555. IF RefInfo THEN Info(section, "ReturnType") END;
  11556. NType(procedureType.returnType);
  11557. NScope(procedure.procedureScope, pos);
  11558. END NProcedure;
  11559. (*
  11560. Variable = sfVariable prevSymbol:SIZE name:STRING (sfAbsolute address:ADDRESS| sfRelative offset:SIZE) Type.
  11561. *)
  11562. PROCEDURE NVariable(variable: SyntaxTree.Variable; scopeOffset: LONGINT);
  11563. VAR s: Sections.Section; sn: Basic.SegmentedName; pos: LONGINT;
  11564. BEGIN
  11565. IF RefInfo THEN Info(section, "Variable") END;
  11566. pos := CurrentIndex();
  11567. Char(section, sfVariable);
  11568. Size(section, scopeOffset);
  11569. String0(section, variable.name);
  11570. IF (variable.scope # NIL) & (variable.scope IS SyntaxTree.ModuleScope) THEN
  11571. Char(section, sfAbsolute);
  11572. implementationVisitor.GetCodeSectionNameForSymbol(variable, sn);
  11573. NamedSymbol(section, sn,variable, 0,0);
  11574. ELSE
  11575. Char(section, sfRelative);
  11576. Size(section, ToMemoryUnits(module.system,variable.offsetInBits));
  11577. END;
  11578. NType(variable.type);
  11579. s := module.allSections.FindBySymbol(variable);
  11580. END NVariable;
  11581. (*
  11582. TypeDeclaration = sfTypeDeclaration prevSymbol:SIZE name:STRING td:ADDRESS Scope.
  11583. *)
  11584. PROCEDURE NTypeDeclaration(typeDeclaration: SyntaxTree.TypeDeclaration; scopeOffset: LONGINT);
  11585. VAR declared: SyntaxTree.Type; s: Sections.Section; offset: LONGINT; name: Basic.SegmentedName; pos: LONGINT;
  11586. BEGIN
  11587. IF typeDeclaration = NIL THEN RETURN END;
  11588. pos := CurrentIndex();
  11589. s := module.allSections.FindBySymbol(typeDeclaration);
  11590. IF s = NIL THEN RETURN END; (*! duplicate, what to do? *)
  11591. IF RefInfo THEN Info(section, "TypeDeclaration") END;
  11592. Char(section, sfTypeDeclaration);
  11593. Size(section, scopeOffset);
  11594. String0(section, typeDeclaration.name);
  11595. declared := typeDeclaration.declaredType.resolved;
  11596. IF (declared IS SyntaxTree.PointerType) THEN
  11597. declared := declared(SyntaxTree.PointerType).pointerBase.resolved;
  11598. END;
  11599. WITH declared: SyntaxTree.RecordType DO
  11600. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(declared.recordScope.numberMethods)*module.system.addressSize);
  11601. Symbol(section, s, 0, offset);
  11602. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11603. Basic.AppendToSegmentedName(name,".@Info");
  11604. s := module.allSections.FindByName(name);
  11605. IF s # NIL THEN (* does not work for coop *)
  11606. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11607. END;
  11608. NScope(declared.recordScope, pos);
  11609. |declared: SyntaxTree.CellType DO
  11610. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(0)*module.system.addressSize);
  11611. Symbol(section, s, 0, offset);
  11612. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11613. Basic.AppendToSegmentedName(name,".@Info");
  11614. s := module.allSections.FindByName(name);
  11615. IF s # NIL THEN
  11616. PatchSize(s(IntermediateCode.Section), patchInfoPC, pos);
  11617. END;
  11618. NScope(declared.cellScope, pos);
  11619. ELSE
  11620. Address(section, 0);
  11621. END;
  11622. END NTypeDeclaration;
  11623. PROCEDURE NModule(module: SyntaxTree.Module; prevSymbol: LONGINT);
  11624. VAR pos: LONGINT;
  11625. BEGIN
  11626. pos := CurrentIndex();
  11627. Char(section,sfModule);
  11628. Size(section, prevSymbol);
  11629. String0(section, module.name);
  11630. NScope(module.moduleScope, pos);
  11631. END NModule;
  11632. (*
  11633. Scope = sfScopeBegin {Variable} {Procedure} {TypeDeclaration} sfScopeEnd.
  11634. *)
  11635. PROCEDURE NScope(scope: SyntaxTree.Scope; prevSymbol: LONGINT);
  11636. VAR bodyProcedure, procedure: SyntaxTree.Procedure; variable: SyntaxTree.Variable; typeDeclaration: SyntaxTree.TypeDeclaration; pos: LONGINT;
  11637. BEGIN
  11638. IF scope = NIL THEN RETURN END;
  11639. IF RefInfo THEN Info(section, "Scope") END;
  11640. Char(section, sfScopeBegin);
  11641. variable := scope.firstVariable;
  11642. WHILE (variable # NIL) DO
  11643. NVariable(variable, prevSymbol);
  11644. variable := variable.nextVariable;
  11645. END;
  11646. WITH scope: SyntaxTree.ModuleScope DO
  11647. bodyProcedure := scope.bodyProcedure;
  11648. |scope: SyntaxTree.RecordScope DO
  11649. bodyProcedure := scope.bodyProcedure;
  11650. ELSE
  11651. bodyProcedure := NIL;
  11652. END;
  11653. IF bodyProcedure # NIL THEN
  11654. NProcedure(bodyProcedure, prevSymbol)
  11655. END;
  11656. procedure := scope.firstProcedure;
  11657. WHILE procedure # NIL DO
  11658. IF (procedure # bodyProcedure) & ~procedure.isInline THEN NProcedure(procedure, prevSymbol) END;
  11659. procedure := procedure.nextProcedure;
  11660. END;
  11661. typeDeclaration := scope.firstTypeDeclaration;
  11662. WHILE typeDeclaration # NIL DO
  11663. NTypeDeclaration(typeDeclaration, prevSymbol);
  11664. typeDeclaration := typeDeclaration.nextTypeDeclaration;
  11665. END;
  11666. Char(section, sfScopeEnd); (* scope ends *)
  11667. END NScope;
  11668. BEGIN
  11669. NEW(indirectTypes, 32);
  11670. ArrayBlock(section,sizePC,"", FALSE);
  11671. startPC := section.pc;
  11672. NModule(module.module, -1);
  11673. PatchArray(section,sizePC,CurrentIndex());
  11674. END References;
  11675. (*
  11676. Command* = RECORD
  11677. (* Fields exported for initialization by loader/linker only! Consider read-only! *)
  11678. name*: Name; (* name of the procedure *)
  11679. argTdAdr*, retTdAdr* : ADDRESS; (* address of type descriptors of argument and return type, 0 if no type *)
  11680. entryAdr* : ADDRESS; (* entry address of procedure *)
  11681. END;
  11682. *)
  11683. PROCEDURE CommandArray(source: IntermediateCode.Section);
  11684. VAR
  11685. p: Sections.Section; sizePC, numberCommands: LONGINT;
  11686. procedure : SyntaxTree.Procedure; procedureType: SyntaxTree.ProcedureType;
  11687. name: SyntaxTree.IdentifierString; numberParameters, i: LONGINT;
  11688. (* Returns TRUE if the built-in function GETPROCEDURE can be used with this procedure type *)
  11689. PROCEDURE GetProcedureAllowed() : BOOLEAN;
  11690. PROCEDURE TypeAllowed(type : SyntaxTree.Type) : BOOLEAN;
  11691. BEGIN
  11692. RETURN
  11693. (type = NIL) OR
  11694. (type.resolved IS SyntaxTree.RecordType) OR
  11695. (type.resolved IS SyntaxTree.PointerType) & (type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType) OR
  11696. (type.resolved IS SyntaxTree.AnyType);
  11697. END TypeAllowed;
  11698. BEGIN
  11699. numberParameters := procedureType.numberParameters;
  11700. RETURN
  11701. (numberParameters = 0) & TypeAllowed(procedureType.returnType) OR
  11702. (numberParameters = 1) & TypeAllowed(procedureType.firstParameter.type) & TypeAllowed(procedureType.returnType) OR
  11703. (numberParameters = 1) & (procedureType.firstParameter.type.resolved IS SyntaxTree.AnyType) & (procedureType.returnType # NIL) & (procedureType.returnType.resolved IS SyntaxTree.AnyType);
  11704. END GetProcedureAllowed;
  11705. PROCEDURE WriteType(type : SyntaxTree.Type);
  11706. VAR typeDeclaration: SyntaxTree.TypeDeclaration; section: Sections.Section;
  11707. name: Basic.SegmentedName; offset: LONGINT;
  11708. BEGIN
  11709. IF type = NIL THEN
  11710. Address(source,0);
  11711. ELSIF (type.resolved IS SyntaxTree.AnyType) OR (type.resolved IS SyntaxTree.ObjectType) THEN
  11712. Address(source,1);
  11713. ELSE
  11714. type := type.resolved;
  11715. IF type IS SyntaxTree.PointerType THEN
  11716. type := type(SyntaxTree.PointerType).pointerBase.resolved;
  11717. END;
  11718. typeDeclaration := type.typeDeclaration; (* must be non-nil *)
  11719. IF (typeDeclaration.scope = NIL) OR (typeDeclaration.scope.ownerModule = module.module) THEN
  11720. name[0] := typeDeclaration.name; name[1] := -1;
  11721. section := module.allSections.FindBySymbol(type.typeDeclaration); (*TODO*)
  11722. ASSERT(section # NIL);
  11723. ELSE
  11724. Global.GetSymbolSegmentedName(typeDeclaration,name);
  11725. (* TODO *)
  11726. section := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,typeDeclaration, source.comments # NIL);
  11727. END;
  11728. IF implementationVisitor.backend.cooperative THEN
  11729. offset := 0;
  11730. ELSE
  11731. offset := 1 + type(SyntaxTree.RecordType).recordScope.numberMethods+16+1;
  11732. END;
  11733. Symbol(source,section, 0, ToMemoryUnits(module.system,offset*module.system.addressSize));
  11734. END;
  11735. END WriteType;
  11736. BEGIN
  11737. Info(source, "command array descriptor");
  11738. ArrayBlock(source,sizePC,"Modules.Command", FALSE);
  11739. numberCommands := 0;
  11740. Info(source, "command array content");
  11741. FOR i := 0 TO module.allSections.Length() - 1 DO
  11742. p := module.allSections.GetSection(i);
  11743. IF (p.symbol # NIL) & (p.symbol IS SyntaxTree.Procedure) THEN
  11744. procedure := p.symbol(SyntaxTree.Procedure);
  11745. procedureType := procedure.type(SyntaxTree.ProcedureType);
  11746. IF (SyntaxTree.PublicWrite IN procedure.access) & ~(procedure.isInline) & ~(procedureType.isDelegate) & GetProcedureAllowed() THEN
  11747. procedure.GetName(name);
  11748. Name(source,name);
  11749. numberParameters := procedureType.numberParameters;
  11750. (* offset of type of first parameter *)
  11751. IF (numberParameters = 0 ) THEN WriteType(NIL)
  11752. ELSE WriteType(procedureType.firstParameter.type)
  11753. END;
  11754. (* offset of type of return parameter *)
  11755. WriteType(procedureType.returnType);
  11756. (* command name *)
  11757. (* command code offset *)
  11758. Symbol(source,p,0,0);
  11759. INC(numberCommands);
  11760. IF Trace THEN
  11761. D.Ln;
  11762. END;
  11763. END;
  11764. END
  11765. END;
  11766. PatchArray(source,sizePC,numberCommands);
  11767. END CommandArray;
  11768. (* to prevent from double import of different module aliases *)
  11769. PROCEDURE IsFirstDirectOccurence(import: SyntaxTree.Import): BOOLEAN; (*! inefficient *)
  11770. VAR i: SyntaxTree.Import;
  11771. BEGIN
  11772. i := module.module.moduleScope.firstImport;
  11773. WHILE (i # NIL) & ((i.module # import.module) OR ~i.direct) DO
  11774. i := i.nextImport;
  11775. END;
  11776. RETURN i = import
  11777. END IsFirstDirectOccurence;
  11778. PROCEDURE ImportsArray(source: IntermediateCode.Section);
  11779. VAR import: SyntaxTree.Import ; pc: LONGINT;name: Basic.SegmentedName; numberImports: LONGINT; offset: LONGINT;
  11780. BEGIN
  11781. (* strictly speaking this needs to be a pointer array but by the construction of module loading, this references are not required *)
  11782. ArrayBlock(source,pc,"", FALSE);
  11783. Info(source, "import module array data");
  11784. IF implementationVisitor.backend.cooperative THEN
  11785. offset := 0;
  11786. ELSE
  11787. IF module.system.addressType.sizeInBits = 64 THEN
  11788. (* change this when Heaps.HeapBlock is modified *)
  11789. offset := ToMemoryUnits(module.system, 18* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11790. ELSE
  11791. (* change this when Heaps.HeapBlock is modified *)
  11792. offset := ToMemoryUnits(module.system, 23* module.system.addressSize) (* Module pointer offset -- cf. ModuleSection(), how to encode generically correct? *);
  11793. END;
  11794. END;
  11795. import := module.module.moduleScope.firstImport;
  11796. numberImports := 0;
  11797. WHILE import # NIL DO
  11798. IF import.direct & ~Global.IsSystemModule(import.module) & IsFirstDirectOccurence(import) THEN
  11799. Global.GetModuleSegmentedName(import.module,name);
  11800. Basic.SuffixSegmentedName(name, StringPool.GetIndex1("@Module"));
  11801. NamedSymbol(source, name, NIL, 0, offset);
  11802. INC(numberImports);
  11803. END;
  11804. import := import.nextImport
  11805. END;
  11806. PatchArray(source,pc,numberImports);
  11807. END ImportsArray;
  11808. PROCEDURE TypeInfoSection(source: IntermediateCode.Section);
  11809. VAR
  11810. p: Sections.Section; sizePC, size, i: LONGINT;
  11811. BEGIN
  11812. Info(source, "Type info section");
  11813. size := 0;
  11814. ArrayBlock(source,sizePC,"Modules.TypeDesc", FALSE);
  11815. FOR i := 0 TO module.allSections.Length() - 1 DO
  11816. p := module.allSections.GetSection(i);
  11817. WITH p: IntermediateCode.Section DO
  11818. IF Basic.SegmentedNameEndsWith(p.name,"@Info") THEN
  11819. Symbol(source,p,EmptyBlockOffset,0);
  11820. INC(size);
  11821. END;
  11822. END
  11823. END;
  11824. PatchArray(source,sizePC,size);
  11825. END TypeInfoSection;
  11826. (*
  11827. ProcTableEntry* = RECORD
  11828. pcFrom*, pcLimit*, pcStatementBegin*, pcStatementEnd*: ADDRESS;
  11829. noPtr*: LONGINT;
  11830. END;
  11831. ProcTable* = POINTER TO ARRAY OF ProcTableEntry;
  11832. PtrTable* = POINTER TO ARRAY OF ADDRESS;
  11833. *)
  11834. PROCEDURE ProcedureDescriptor(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11835. VAR
  11836. numberPointers: LONGINT;
  11837. procedure: SyntaxTree.Procedure;
  11838. BEGIN
  11839. Info(section,"pcFrom");
  11840. Symbol(section,procedureSection,0,0);
  11841. Info(section,"pcTo");
  11842. Symbol(section, procedureSection, procedureSection.pc, 0);
  11843. Info(section,"pointer to offsets array");
  11844. Symbol(section, section,section.pc+1,0);
  11845. Info(section,"offsets array");
  11846. procedure := procedureSection.symbol(SyntaxTree.Procedure);
  11847. PointerArray(section, procedure.procedureScope, numberPointers);
  11848. END ProcedureDescriptor;
  11849. (* only for tracing, the descriptor is otherwise not complete ! *)
  11850. PROCEDURE MakeProcedureDescriptorTag(procedureSection: IntermediateCode.Section): IntermediateCode.Section;
  11851. VAR section: IntermediateCode.Section; infoName: Basic.SectionName; offset: LONGINT; moduleSection: IntermediateCode.Section; name: Basic.SegmentedName;
  11852. BEGIN
  11853. (* mini pseudo type tag that only refers to the information data for debugging purposes -- then the descriptor in the GC can be identified *)
  11854. name := procedureSection.name;
  11855. Basic.AppendToSegmentedName(name,".@Info");
  11856. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11857. Address(section,0);
  11858. Symbol(section,section,2,0);
  11859. (*
  11860. TypeDesc* = POINTER TO RECORD (* ug: adapt constant TypeDescRecSize if this type is changed !!! *)
  11861. descSize: SIZE;
  11862. sentinel: ADDRESS; (* = MPO-4 *)
  11863. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  11864. flags*: SET;
  11865. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  11866. name*: Name;
  11867. END;
  11868. *)
  11869. Size(section, 0);
  11870. Address(section,0);
  11871. Address(section,0);
  11872. Set(section,{});
  11873. moduleSection := ModuleSection();
  11874. Symbol( section, moduleSection, moduleSection.pc,0);
  11875. IF procedureSection.symbol = NIL THEN
  11876. Basic.SegmentedNameToString(procedureSection.name, infoName);
  11877. ELSE
  11878. Global.GetSymbolNameInScope(procedureSection.symbol, module.module.moduleScope, infoName);
  11879. END;
  11880. Name(section, infoName);
  11881. Size(section, 0);
  11882. RETURN section;
  11883. END MakeProcedureDescriptorTag;
  11884. PROCEDURE ProcedureDescriptorPointer(section: IntermediateCode.Section; procedureSection: IntermediateCode.Section);
  11885. VAR dest: IntermediateCode.Section; name: Basic.SegmentedName; offset: LONGINT;
  11886. BEGIN
  11887. name := procedureSection.name;
  11888. Basic.SuffixSegmentedName(name, Basic.MakeString("@Descriptor"));
  11889. IF implementationVisitor.backend.cooperative THEN
  11890. dest := IntermediateCode.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11891. Info(section, "TypeDescriptor");
  11892. Basic.ToSegmentedName("BaseTypes.Pointer", name);
  11893. NamedSymbol(dest, name,NIL, 0, 0);
  11894. BaseRecord(dest);
  11895. offset := 0;
  11896. ELSIF CreateProcedureDescInfo THEN
  11897. dest := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL, declarationVisitor.dump);
  11898. Address(dest,0);
  11899. Symbol(dest, MakeProcedureDescriptorTag(procedureSection),2,0);
  11900. offset := dest.pc;
  11901. ELSE
  11902. dest := NamedBlock("Heaps","SystemBlock",name,offset);
  11903. END;
  11904. ProcedureDescriptor(dest, procedureSection);
  11905. Symbol(section, dest, offset, 0);
  11906. END ProcedureDescriptorPointer;
  11907. PROCEDURE ProcedureDescriptorArray(section: IntermediateCode.Section; VAR numberProcs: LONGINT);
  11908. VAR sizePC, i: LONGINT; destination: Sections.Section;
  11909. BEGIN
  11910. ArrayBlock(section, sizePC,"Modules.ProcedureDesc.@Pointer",FALSE);
  11911. numberProcs := 0;
  11912. FOR i := 0 TO module.allSections.Length() - 1 DO
  11913. destination := module.allSections.GetSection(i);
  11914. IF (destination.type IN {Sections.CodeSection, Sections.BodyCodeSection}) & (destination.symbol # NIL) & (destination.symbol IS SyntaxTree.Procedure) & ~destination.symbol(SyntaxTree.Procedure).isInline THEN
  11915. ProcedureDescriptorPointer(section, destination(IntermediateCode.Section));
  11916. INC(numberProcs);
  11917. END
  11918. END;
  11919. PatchArray(section, sizePC, numberProcs);
  11920. END ProcedureDescriptorArray;
  11921. (*
  11922. Module* = OBJECT (Heaps.RootObject) (* cf. Linker0 & Heaps.WriteType *)
  11923. VAR
  11924. next*: Module; (** once a module is published, all fields are read-only *)
  11925. name*: Name;
  11926. init, published: BOOLEAN;
  11927. refcnt*: LONGINT; (* counts loaded modules that import this module *)
  11928. sb*: ADDRESS; <- should be zero as the static base in generic object file is indeed 0 !
  11929. entry*: POINTER TO ARRAY OF ADDRESS; <- not needed in new loader
  11930. command*: POINTER TO ARRAY OF Command;
  11931. ptrAdr*: POINTER TO ARRAY OF ADDRESS;
  11932. typeInfo*: POINTER TO ARRAY OF TypeDesc;
  11933. module*: POINTER TO ARRAY OF Module; <---- currently done by loader
  11934. procTable*: ProcTable; (* information inserted by loader, removed after use in Publish *)
  11935. ptrTable*: PtrTable; (* information inserted by loader, removed after use in Publish *)
  11936. data*, code*: Bytes;
  11937. staticTypeDescs* (* ug *), refs*: Bytes; <- staticTypeDescs in data section, refs currently unsupported
  11938. export*: ExportDesc;
  11939. term*: TerminationHandler;
  11940. exTable*: ExceptionTable;
  11941. noProcs*: LONGINT;
  11942. firstProc*: ADDRESS; <- done by loader
  11943. maxPtrs*: LONGINT;
  11944. crc*: LONGINT;
  11945. *)
  11946. PROCEDURE BasePointer (section: IntermediateCode.Section);
  11947. BEGIN
  11948. Info(section, "cycle");
  11949. Size(section,0);
  11950. Info(section, "references");
  11951. Size(section,0);
  11952. Info(section, "nextMarked");
  11953. Address(section,0);
  11954. Info(section, "nextWatched");
  11955. Address(section,0);
  11956. END BasePointer;
  11957. PROCEDURE BaseObject (section: IntermediateCode.Section);
  11958. BEGIN
  11959. BasePointer(section);
  11960. Info(section, "action");
  11961. Address(section,0);
  11962. Info(section, "monitor");
  11963. Address(section,0);
  11964. END BaseObject;
  11965. PROCEDURE BaseRecord (section: IntermediateCode.Section);
  11966. BEGIN
  11967. BasePointer(section);
  11968. Info(section, "action");
  11969. Address(section,0);
  11970. Info(section, "monitor");
  11971. Address(section,0);
  11972. END BaseRecord;
  11973. PROCEDURE ModuleDescriptor(section: IntermediateCode.Section);
  11974. VAR descriptorSection: IntermediateCode.Section; name: ARRAY 128 OF CHAR;
  11975. pooledName: Basic.SegmentedName;
  11976. symbol: SyntaxTree.Symbol;
  11977. BEGIN
  11978. Global.GetModuleName(module.module,name);
  11979. Strings.Append(name,".@Module.@Descriptor");
  11980. Basic.ToSegmentedName(name, pooledName);
  11981. descriptorSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  11982. Symbol(section,descriptorSection,0,0);
  11983. Info(descriptorSection, "descriptor");
  11984. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  11985. NamedSymbol(descriptorSection, pooledName,symbol, 0, 0);
  11986. Address(descriptorSection,0);
  11987. Global.GetModuleName(module.module,name);
  11988. Strings.Append(name,".@Trace");
  11989. Basic.ToSegmentedName(name, pooledName);
  11990. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11991. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",pooledName);
  11992. NamedSymbol(descriptorSection, pooledName,NIL, 0, 0);
  11993. END ModuleDescriptor;
  11994. PROCEDURE ModuleSection(): IntermediateCode.Section;
  11995. VAR name: ARRAY 128 OF CHAR;
  11996. moduleSection: IntermediateCode.Section; offset: LONGINT; pooledName: Basic.SegmentedName;
  11997. symbol: SyntaxTree.Symbol;
  11998. BEGIN
  11999. Global.GetModuleName(module.module,name);
  12000. Strings.Append(name,".@Module");
  12001. Basic.ToSegmentedName(name, pooledName);
  12002. moduleSection := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, pooledName,NIL,declarationVisitor.dump);
  12003. moduleSection.SetExported(TRUE);
  12004. IF moduleSection.pc = 0 THEN
  12005. IF implementationVisitor.backend.cooperative THEN
  12006. Info(moduleSection, "descriptor");
  12007. ModuleDescriptor(moduleSection);
  12008. BaseObject(moduleSection);
  12009. implementationVisitor.CreateTraceModuleMethod(module.module);
  12010. ELSE
  12011. ProtectedHeapBlock("Heaps","ProtRecBlockDesc",moduleSection,2);
  12012. Info(moduleSection, "HeapBlock");
  12013. Symbol(moduleSection,moduleSection,2,0);
  12014. Info(moduleSection, "TypeDescriptor");
  12015. symbol := implementationVisitor.GetTypeDescriptor("Modules","Module", pooledName);
  12016. offset := ToMemoryUnits(module.system,(TypeRecordBaseOffset + 1 (*= numberMethods*))*module.system.addressSize);
  12017. NamedSymbol(moduleSection, pooledName,symbol, 0, offset);
  12018. END;
  12019. END;
  12020. RETURN moduleSection;
  12021. END ModuleSection;
  12022. PROCEDURE NewModuleInfo();
  12023. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12024. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12025. sectionName: Basic.SectionName;
  12026. CONST MPO=-40000000H;
  12027. BEGIN
  12028. (*
  12029. TypeDesc* = POINTER TO RECORD
  12030. descSize: SIZE;
  12031. sentinel: LONGINT; (* = MPO-4 *)
  12032. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12033. flags*: SET;
  12034. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12035. name*: Name;
  12036. refsOffset: SIZE;
  12037. END;
  12038. *)
  12039. (*name is missing prefixes sometimes*)
  12040. Global.GetModuleSegmentedName(module.module,name);
  12041. Basic.AppendToSegmentedName(name,".@Info");
  12042. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12043. IF ~implementationVisitor.backend.cooperative THEN
  12044. Info(source, "HeapBlock");
  12045. Address(source,0); (* an empty heap block prevents GC marking *)
  12046. Info(source, "TypeDescriptor");
  12047. Address(source,0);
  12048. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12049. END;
  12050. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12051. Address(source,MPO-4);
  12052. Info(source, "type tag pointer");
  12053. Address( source,0);
  12054. Info(source, "type flags");
  12055. flags := {};
  12056. Set( source, flags);
  12057. Info(source, "pointer to module");
  12058. moduleSection := ModuleSection();
  12059. Symbol( source, moduleSection, moduleSection.pc,0);
  12060. Info(source, "type name");
  12061. i := 0;
  12062. sectionName := "@Self";
  12063. (*
  12064. Global.GetSymbolSegmentedName(td,name);
  12065. Basic.SegmentedNameToString(name, sectionName);
  12066. *)
  12067. Name(source,sectionName);
  12068. patchInfoPC := source.pc;
  12069. Size(source, 0);
  12070. END NewModuleInfo;
  12071. PROCEDURE Module(bodyProc: IntermediateCode.Section);
  12072. VAR
  12073. moduleSection, pointerSection, importSection, emptyArraySection, exceptionSection, commandsSection,
  12074. typeInfoSection, procTableSection, referenceSection : IntermediateCode.Section;
  12075. emptyArraySectionOffset, pointerSectionOffset, importSectionOffset, numberPointers,
  12076. exceptionSectionOffset, commandsSectionOffset, typeInfoSectionOffset, procTableSectionOffset, maxPointers, numberProcs,temp,
  12077. referenceSectionOffset : LONGINT;
  12078. name: Basic.SegmentedName; offset: LONGINT;
  12079. flags: SET;
  12080. BEGIN
  12081. NewModuleInfo();
  12082. pointerSection := Block("Heaps","SystemBlockDesc",".@PointerArray",pointerSectionOffset);
  12083. PointerArray(pointerSection,module.module.moduleScope, numberPointers);
  12084. importSection := Block("Heaps","SystemBlockDesc",".@ImportsArray",importSectionOffset);
  12085. ImportsArray(importSection);
  12086. commandsSection := Block("Heaps","SystemBlockDesc",".@CommandArray",commandsSectionOffset);
  12087. CommandArray(commandsSection);
  12088. exceptionSection := Block("Heaps","SystemBlockDesc",".@ExceptionArray",exceptionSectionOffset);
  12089. ExceptionArray(exceptionSection);
  12090. typeInfoSection := Block("Heaps","SystemBlockDesc",".@TypeInfoArray",typeInfoSectionOffset);
  12091. AddPointer(typeInfoSection, typeInfoSectionOffset);
  12092. TypeInfoSection(typeInfoSection);
  12093. referenceSection := Block("Heaps","SystemBlockDesc",".@References",referenceSectionOffset);
  12094. referenceSection.SetExported(TRUE);
  12095. References(referenceSection);
  12096. procTableSection := Block("Heaps","SystemBlockDesc",".@ProcTable",procTableSectionOffset);
  12097. ProcedureDescriptorArray(procTableSection, numberProcs);
  12098. IF ProtectModulesPointers THEN
  12099. name := "Heaps.AnyPtr";
  12100. offset := ToMemoryUnits(module.system,TypeRecordBaseOffset*module.system.addressSize);
  12101. (* set base pointer *)
  12102. NamedSymbolAt(procTableSection, procTableSectionOffset -1 , name, NIL, 0, offset);
  12103. END;
  12104. emptyArraySection := Block("Heaps","SystemBlockDesc",".@EmptyArray",emptyArraySectionOffset);
  12105. ArrayBlock(emptyArraySection,temp,"", FALSE);
  12106. moduleSection := ModuleSection();
  12107. Info(moduleSection, "nextRoot*: RootObject");
  12108. Address(moduleSection,0);
  12109. Info(moduleSection, "next*: Module");
  12110. Address(moduleSection,0);
  12111. Info(moduleSection, "name*: Name");
  12112. Name(moduleSection,moduleName);
  12113. Info(moduleSection, "init, published: BOOLEAN");
  12114. Boolean(moduleSection,FALSE);
  12115. Boolean(moduleSection,FALSE);
  12116. Info(moduleSection,"filler"); (*! introduce alignment! *)
  12117. Boolean(moduleSection,FALSE);
  12118. Boolean(moduleSection,FALSE);
  12119. Info(moduleSection, "refcnt*: LONGINT");
  12120. Longint(moduleSection,0);
  12121. Info(moduleSection, "sb*: ADDRESS");
  12122. Address(moduleSection,0);
  12123. Info(moduleSection, "entry*: POINTER TO ARRAY OF ADDRESS");
  12124. Address(moduleSection,0);
  12125. Info(moduleSection, "command*: POINTER TO ARRAY OF Command");
  12126. Symbol(moduleSection,commandsSection,commandsSectionOffset,0);
  12127. Info(moduleSection, "ptrAdr*: POINTER TO ARRAY OF ADDRESS");
  12128. Symbol(moduleSection,pointerSection,pointerSectionOffset,0);
  12129. Info(moduleSection, "typeInfo*: POINTER TO ARRAY OF TypeDesc");
  12130. Symbol(moduleSection,typeInfoSection,typeInfoSectionOffset,0);
  12131. Info(moduleSection, "module*: POINTER TO ARRAY OF Module");
  12132. Symbol(moduleSection,importSection,importSectionOffset,0);
  12133. Info(moduleSection, "procTable*: ProcTable");
  12134. Symbol(moduleSection,procTableSection,procTableSectionOffset,0);
  12135. Info(moduleSection, "data*, code*, staticTypeDescs*, refs*: Bytes");
  12136. Address(moduleSection,0);
  12137. Address(moduleSection,0);
  12138. Address(moduleSection,0);
  12139. Symbol(moduleSection,referenceSection,referenceSectionOffset,0);
  12140. Info(moduleSection, "export*: ExportDesc");
  12141. ExportDesc(moduleSection);
  12142. Info(moduleSection, "term*: TerminationHandler");
  12143. Address(moduleSection,0);
  12144. Info(moduleSection, "exTable*: ExceptionTable");
  12145. Symbol(moduleSection,exceptionSection,exceptionSectionOffset,0);
  12146. Info(moduleSection,"internal: POINTER TO ARRAY OF Pointer");
  12147. Symbol(moduleSection, modulePointerSection, modulePointerSectionOffset, 0);
  12148. Info(moduleSection, "crc*: LONGINT");
  12149. patchCRC:= moduleSection.pc;
  12150. Longint(moduleSection, 0); (*! must be implemented *)
  12151. IF module.system.addressType.sizeInBits = 64 THEN Longint(moduleSection, 0); END; (* padding *)
  12152. Info(moduleSection, "body*: ADDRESS");
  12153. Symbol(moduleSection, bodyProc, 0,0);
  12154. Info(moduleSection, "module flags");
  12155. flags := {};
  12156. IF implementationVisitor.backend.preciseGC THEN INCL(flags,0) END;
  12157. Set( moduleSection, flags);
  12158. IF implementationVisitor.backend.cooperative THEN
  12159. PatchSymbol(moduleSection,MonitorOffset,moduleSection.name,NIL,moduleSection.pc,0);
  12160. Info(moduleSection, "monitor.owner");
  12161. Address(moduleSection,0);
  12162. Info(moduleSection, "monitor.nestingLevel");
  12163. Address(moduleSection,0);
  12164. Info(moduleSection, "monitor.blockedQueue");
  12165. Address(moduleSection,0); Address(moduleSection,0);
  12166. Info(moduleSection, "monitor.waitingQueue");
  12167. Address(moduleSection,0); Address(moduleSection,0);
  12168. Info(moduleSection, "monitor.waitingSentinel");
  12169. Address(moduleSection,0);
  12170. END;
  12171. END Module;
  12172. PROCEDURE PatchCRC(crc: LONGINT);
  12173. BEGIN
  12174. IF ~simple THEN
  12175. PatchLongint(ModuleSection(), patchCRC, crc);
  12176. END;
  12177. END PatchCRC;
  12178. PROCEDURE PointerArray(source: IntermediateCode.Section; scope: SyntaxTree.Scope; VAR numberPointers: LONGINT);
  12179. VAR variable: SyntaxTree.Variable; pc: LONGINT; symbol: Sections.Section; parameter: SyntaxTree.Parameter; parametersSize: LONGINT;
  12180. BEGIN
  12181. ArrayBlock(source,pc,"",FALSE);
  12182. Info(source, "pointer offsets array data");
  12183. IF scope IS SyntaxTree.RecordScope THEN
  12184. Pointers(0,symbol, source,scope(SyntaxTree.RecordScope).ownerRecord,numberPointers);
  12185. ELSIF scope IS SyntaxTree.CellScope THEN
  12186. Pointers(0, symbol, source, scope(SyntaxTree.CellScope).ownerCell, numberPointers);
  12187. ELSIF scope IS SyntaxTree.ModuleScope THEN
  12188. variable := scope(SyntaxTree.ModuleScope).firstVariable;
  12189. WHILE variable # NIL DO
  12190. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12191. symbol := module.allSections.FindBySymbol(variable);
  12192. ASSERT(symbol # NIL);
  12193. Pointers(0,symbol, source,variable.type,numberPointers);
  12194. END;
  12195. variable := variable.nextVariable;
  12196. END;
  12197. ELSIF scope IS SyntaxTree.ProcedureScope THEN
  12198. parameter := scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12199. WHILE parameter # NIL DO
  12200. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN (* immutable or variable parameters do not need tracing *)
  12201. Pointers(ToMemoryUnits(module.system,parameter.offsetInBits), NIL, source, parameter.type, numberPointers);
  12202. END;
  12203. parameter := parameter.nextParameter;
  12204. END;
  12205. IF scope(SyntaxTree.ProcedureScope).ownerProcedure.type(SyntaxTree.ProcedureType).isDelegate THEN
  12206. parametersSize := implementationVisitor.ProcParametersSize(scope(SyntaxTree.ProcedureScope).ownerProcedure);
  12207. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12208. IF implementationVisitor.backend.preciseGC THEN
  12209. INC(parametersSize,ToMemoryUnits(module.system,module.system.addressSize));
  12210. END;
  12211. Symbol(source, NIL, 0, parametersSize); INC(numberPointers);
  12212. END;
  12213. variable := scope(SyntaxTree.ProcedureScope).firstVariable;
  12214. WHILE(variable # NIL) DO
  12215. IF ~(variable.untraced) & (variable.externalName = NIL) THEN
  12216. Pointers(ToMemoryUnits(module.system,variable.offsetInBits), NIL, source, variable.type, numberPointers);
  12217. END;
  12218. variable := variable.nextVariable
  12219. END;
  12220. END;
  12221. PatchArray(source,pc,numberPointers);
  12222. END PointerArray;
  12223. PROCEDURE SymbolSection(symbol: SyntaxTree.Symbol; CONST suffix: ARRAY OF CHAR; VAR pc: LONGINT): IntermediateCode.Section;
  12224. VAR
  12225. name: Basic.SegmentedName;
  12226. section: IntermediateCode.Section;
  12227. BEGIN
  12228. Global.GetSymbolSegmentedName(symbol,name);
  12229. Basic.AppendToSegmentedName(name,suffix);
  12230. section := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name, NIL,declarationVisitor.dump);
  12231. HeapBlock("Heaps","SystemBlockDesc", section, 2);
  12232. Info(section, "HeapBlock");
  12233. Address(section,0); (* empty such that GC does not go on traversing *)
  12234. Info(section, suffix);
  12235. Address(section,0);
  12236. pc := section.pc;
  12237. RETURN section;
  12238. END SymbolSection;
  12239. PROCEDURE CheckTypeDeclaration(x: SyntaxTree.Type);
  12240. VAR recordType: SyntaxTree.RecordType;
  12241. tir, tdInfo: IntermediateCode.Section; op: IntermediateCode.Operand; name: Basic.SegmentedName; td: SyntaxTree.TypeDeclaration;
  12242. section: Sections.Section; cellType: SyntaxTree.CellType;
  12243. tdInfoOffset: LONGINT;
  12244. PROCEDURE NewTypeDescriptorInfo(tag: Sections.Section; offset: LONGINT; isProtected: BOOLEAN): IntermediateCode.Section;
  12245. VAR name: Basic.SegmentedName;source: IntermediateCode.Section;
  12246. moduleSection: IntermediateCode.Section; i: LONGINT; flags: SET;
  12247. sectionName: Basic.SectionName;
  12248. CONST MPO=-40000000H;
  12249. BEGIN
  12250. (*
  12251. TypeDesc* = POINTER TO RECORD
  12252. descSize: SIZE;
  12253. sentinel: LONGINT; (* = MPO-4 *)
  12254. tag*: ADDRESS; (* pointer to static type descriptor, only used by linker and loader *)
  12255. flags*: SET;
  12256. mod*: Module; (* hint only, because module may have been freed (at Heaps.ModOfs) *)
  12257. name*: Name;
  12258. refsOffset: SIZE;
  12259. END;
  12260. *)
  12261. (* source := module.sections.FindByName(...) *)
  12262. Global.GetSymbolSegmentedName(td,name);
  12263. Basic.AppendToSegmentedName(name,".@Info");
  12264. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12265. Info(source, "HeapBlock"); (* an empty heap block prevents GC marking *)
  12266. Address(source,0);
  12267. Info(source, "TypeDescriptor");
  12268. Address(source,0);
  12269. ASSERT(source.pc = EmptyBlockOffset); (* sanity check *)
  12270. Info(source, "type info size"); Address(source, 6*ToMemoryUnits(module.system,module.system.addressSize)+32);
  12271. Info(source, "sentinel"); Address(source,MPO-4); (* should be removed ?? *)
  12272. Info(source, "type tag pointer");
  12273. Symbol( source, tag, offset, 0);
  12274. Info(source, "type flags");
  12275. flags := {};
  12276. IF isProtected THEN INCL(flags,31) END;
  12277. Set( source, flags);
  12278. Info(source, "pointer to module");
  12279. moduleSection := ModuleSection();
  12280. Symbol( source, moduleSection, moduleSection.pc,0);
  12281. Info(source, "type name");
  12282. i := 0;
  12283. Global.GetSymbolNameInScope(td, module.module.moduleScope, sectionName);
  12284. (*
  12285. Global.GetSymbolSegmentedName(td,name);
  12286. Basic.SegmentedNameToString(name, sectionName);
  12287. *)
  12288. Name(source,sectionName);
  12289. Size(source, 0);
  12290. RETURN source;
  12291. END NewTypeDescriptorInfo;
  12292. PROCEDURE NewTypeDescriptor;
  12293. VAR name: Basic.SegmentedName; op: IntermediateCode.Operand; source, base: IntermediateCode.Section;
  12294. procedure: SyntaxTree.Procedure; baseRecord: SyntaxTree.RecordType;
  12295. baseTD: SyntaxTree.TypeDeclaration; sym: SyntaxTree.Symbol;
  12296. numberPointers: LONGINT; padding, i, tdInfoOffset: LONGINT;
  12297. CONST MPO=-40000000H;
  12298. PROCEDURE TdTable(size: LONGINT; reverse: BOOLEAN);
  12299. VAR i: LONGINT;
  12300. PROCEDURE Td(record: SyntaxTree.RecordType);
  12301. VAR baseTD: SyntaxTree.TypeDeclaration; name: Basic.SegmentedName; offset: LONGINT;
  12302. BEGIN
  12303. IF record # NIL THEN
  12304. IF ~reverse THEN Td(record.GetBaseRecord()) END;
  12305. baseTD := record.typeDeclaration;
  12306. Global.GetSymbolSegmentedName(baseTD,name);
  12307. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12308. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12309. ELSE
  12310. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12311. END;
  12312. offset := ToMemoryUnits(module.system,GetTypeRecordBaseOffset(record.recordScope.numberMethods)*module.system.addressSize);
  12313. Symbol(source, tir, 0, offset);
  12314. IF reverse THEN Td(record.GetBaseRecord()) END;
  12315. END;
  12316. END Td;
  12317. BEGIN
  12318. Info(source, "tag table");
  12319. baseRecord := recordType;
  12320. i := 0;
  12321. WHILE baseRecord # NIL DO
  12322. INC(i);
  12323. baseRecord := baseRecord.GetBaseRecord();
  12324. END;
  12325. IF i > size THEN implementationVisitor.Error(x.position,"maximal extension level exceeded") END;
  12326. IF ~reverse THEN Td(recordType) END;
  12327. WHILE i < size DO
  12328. Address(source,0);
  12329. INC(i);
  12330. END;
  12331. IF reverse THEN Td(recordType) END;
  12332. END TdTable;
  12333. PROCEDURE MethodTable(reverse: BOOLEAN);
  12334. VAR i,methods: LONGINT;
  12335. BEGIN
  12336. Info(source, "method table");
  12337. IF recordType # NIL THEN
  12338. methods := recordType.recordScope.numberMethods;
  12339. IF reverse THEN
  12340. FOR i := methods-1 TO 0 BY -1 DO
  12341. procedure := recordType.recordScope.FindMethod(i);
  12342. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12343. NamedSymbol(source, name,procedure, 0,0);
  12344. END;
  12345. ELSE
  12346. FOR i := 0 TO methods-1 DO
  12347. procedure := recordType.recordScope.FindMethod(i);
  12348. implementationVisitor.GetCodeSectionNameForSymbol(procedure, name);
  12349. NamedSymbol(source, name,procedure, 0,0);
  12350. END;
  12351. END;
  12352. END;
  12353. END MethodTable;
  12354. PROCEDURE CooperativeMethodTable(pointer: BOOLEAN);
  12355. VAR baseRecord: SyntaxTree.RecordType; name, stackFrame: Basic.SegmentedName; i,start,methods: LONGINT;
  12356. BEGIN
  12357. Info(source, "method table");
  12358. baseRecord := recordType;
  12359. WHILE baseRecord.baseType # NIL DO
  12360. baseRecord := baseRecord.GetBaseRecord ();
  12361. END;
  12362. GetRecordTypeName (baseRecord, name);
  12363. Basic.ToSegmentedName ("BaseTypes.StackFrame", stackFrame);
  12364. IF name = stackFrame THEN
  12365. start := 0;
  12366. ELSIF ~HasExplicitTraceMethod(recordType) THEN
  12367. baseRecord := recordType;
  12368. WHILE (baseRecord # NIL) & ~baseRecord.hasPointers DO
  12369. baseRecord := baseRecord.GetBaseRecord ();
  12370. END;
  12371. IF baseRecord # NIL THEN
  12372. GetRecordTypeName (baseRecord, name);
  12373. IF pointer & ~baseRecord.isObject THEN
  12374. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12375. END;
  12376. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Trace"));
  12377. ELSIF recordType.isObject THEN
  12378. Basic.ToSegmentedName ("BaseTypes.Object.@Trace",name);
  12379. ELSIF pointer THEN
  12380. Basic.ToSegmentedName ("BaseTypes.Pointer.Trace",name);
  12381. ELSE
  12382. Basic.ToSegmentedName ("BaseTypes.Record.@Trace",name);
  12383. END;
  12384. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12385. Symbol(source, tir, 0, 0);
  12386. start := 0;
  12387. baseRecord := recordType;
  12388. WHILE (baseRecord # NIL) DO
  12389. IF HasExplicitTraceMethod(baseRecord) THEN start := 1 END;
  12390. baseRecord := baseRecord.GetBaseRecord ();
  12391. END;
  12392. ELSE
  12393. (* explicit trace method: *)
  12394. procedure := recordType.recordScope.FindMethod(0);
  12395. IF ~procedure.isFinalizer THEN
  12396. Global.GetSymbolSegmentedName(procedure, name);
  12397. NamedSymbol(source, name,procedure, 0,0);
  12398. END;
  12399. start := 1;
  12400. END;
  12401. IF (name # stackFrame) & recordType.isObject THEN
  12402. baseRecord := recordType;
  12403. WHILE (baseRecord # NIL) & (baseRecord.recordScope.finalizer = NIL) DO
  12404. baseRecord := baseRecord.GetBaseRecord ();
  12405. END;
  12406. IF (baseRecord = NIL) OR (baseRecord.recordScope.finalizer = NIL) THEN
  12407. Basic.ToSegmentedName ("BaseTypes.Object.Finalize",name);
  12408. ELSE
  12409. Global.GetSymbolSegmentedName(baseRecord.recordScope.finalizer, name);
  12410. END;
  12411. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12412. Symbol(source, tir, 0, 0);
  12413. END;
  12414. methods := recordType.recordScope.numberMethods;
  12415. FOR i := start TO methods-1 DO
  12416. procedure := recordType.recordScope.FindMethod(i);
  12417. IF ~procedure.isFinalizer THEN
  12418. Global.GetSymbolSegmentedName(procedure, name);
  12419. NamedSymbol(source, name,procedure, 0,0);
  12420. END;
  12421. END;
  12422. END CooperativeMethodTable;
  12423. BEGIN
  12424. Global.GetSymbolSegmentedName(td,name);
  12425. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,td,declarationVisitor.dump);
  12426. source.SetExported(IsExported(td));
  12427. IF (cellType # NIL) THEN recordType := cellType.GetBaseRecord() END;
  12428. IF implementationVisitor.backend.cooperative THEN
  12429. base := NIL;
  12430. baseRecord := recordType.GetBaseRecord();
  12431. IF baseRecord # NIL THEN
  12432. baseTD := baseRecord.typeDeclaration;
  12433. END;
  12434. IF ~recordType.isObject THEN
  12435. Info(source, "parent");
  12436. IF baseRecord # NIL THEN
  12437. Global.GetSymbolSegmentedName(baseTD,name);
  12438. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12439. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12440. ELSE
  12441. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,baseTD,declarationVisitor.dump);
  12442. END;
  12443. Symbol(source, tir, 0, 0);
  12444. ELSE
  12445. Address(source,0);
  12446. END;
  12447. Info(source, "record size");
  12448. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12449. CooperativeMethodTable(FALSE);
  12450. base := source;
  12451. Global.GetSymbolSegmentedName(td,name);
  12452. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12453. source := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12454. source.SetExported(IsExported(td));
  12455. END;
  12456. Info(source, "parent");
  12457. IF baseRecord # NIL THEN
  12458. Global.GetSymbolSegmentedName(baseTD,name);
  12459. sym := baseTD;
  12460. IF ~recordType.isObject THEN
  12461. Basic.SuffixSegmentedName (name, Basic.MakeString ("@Pointer"));
  12462. sym := NIL;
  12463. END;
  12464. IF (baseTD.scope = NIL) OR (baseTD.scope.ownerModule = module.module) THEN
  12465. tir := implementationVisitor.NewSection(module.allSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12466. ELSE
  12467. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,sym,declarationVisitor.dump);
  12468. END;
  12469. Symbol(source, tir, 0, 0);
  12470. ELSIF (recordType.pointerType # NIL) & recordType.pointerType.isPlain THEN
  12471. Address(source,0);
  12472. ELSE
  12473. IF recordType.isObject THEN
  12474. Basic.ToSegmentedName ("BaseTypes.Object",name);
  12475. ELSE
  12476. Basic.ToSegmentedName ("BaseTypes.Record",name);
  12477. END;
  12478. tir := implementationVisitor.NewSection(module.importedSections, Sections.ConstSection, name,NIL,declarationVisitor.dump);
  12479. Symbol(source, tir, 0, 0);
  12480. END;
  12481. Info(source, "base record descriptor");
  12482. Symbol(source, base, 0, 0);
  12483. CooperativeMethodTable(TRUE);
  12484. IF recordType.hasPointers THEN
  12485. IF ~HasExplicitTraceMethod (recordType) THEN
  12486. implementationVisitor.CreateTraceMethod(recordType);
  12487. END;
  12488. implementationVisitor.CreateResetProcedure(recordType);
  12489. implementationVisitor.CreateAssignProcedure(recordType);
  12490. END;
  12491. ELSIF ~simple THEN
  12492. (*
  12493. MethodEnd = MPO
  12494. ---
  12495. methods (# methods)
  12496. ---
  12497. tags (16)
  12498. ---
  12499. TypeDesc = TypeInfoAdr
  12500. ---
  12501. td adr ---> rec size
  12502. ----
  12503. pointer offsets
  12504. ----
  12505. (padding)
  12506. -----
  12507. empty [2 addresses aligned]
  12508. empty
  12509. empty
  12510. numPtrs
  12511. ---
  12512. pointer offsets
  12513. ---
  12514. *)
  12515. Info(source, "MethodEnd = MPO");
  12516. IntermediateCode.InitImmediate(op,IntermediateCode.GetType(module.system, module.system.addressType),MPO);
  12517. source(IntermediateCode.Section).Emit(Data(Basic.invalidPosition,op));
  12518. MethodTable(TRUE);
  12519. TdTable(TypeTags, TRUE);
  12520. Info(source, "type descriptor info pointer");
  12521. tdInfo := NewTypeDescriptorInfo(source,source.pc+1,recordType.IsProtected());
  12522. Symbol(source, tdInfo,EmptyBlockOffset,0);
  12523. IF (cellType # NIL) THEN
  12524. IF cellType.sizeInBits < 0 THEN
  12525. ASSERT(module.system.GenerateVariableOffsets(cellType.cellScope));
  12526. END;
  12527. Info(source, "cell size");
  12528. Address(source, ToMemoryUnits(module.system,cellType.sizeInBits));
  12529. ELSE
  12530. Info(source, "record size");
  12531. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12532. END;
  12533. Info(source, "pointer offsets pointer");
  12534. padding := 1- source.pc MOD 2;
  12535. Symbol(source, source, source.pc+1+padding,0);
  12536. IF padding >0 THEN
  12537. Info(source, "padding");
  12538. FOR i := 1 TO padding DO Address(source,0) END;
  12539. END;
  12540. IF cellType # NIL THEN
  12541. PointerArray(source, cellType.cellScope, numberPointers);
  12542. ELSE
  12543. PointerArray(source, recordType.recordScope, numberPointers);
  12544. END;
  12545. ELSE
  12546. (*
  12547. simple:
  12548. td adr --> size
  12549. tag(1)
  12550. tag(2)
  12551. tag(3)
  12552. methods ->
  12553. *)
  12554. Info(source, "record size");
  12555. Address(source, ToMemoryUnits(module.system,module.system.SizeOf(recordType)));
  12556. TdTable(TypeTags, FALSE);
  12557. MethodTable(FALSE);
  12558. END;
  12559. END NewTypeDescriptor;
  12560. BEGIN
  12561. x := x.resolved;
  12562. IF (x IS SyntaxTree.PointerType) THEN
  12563. x := x(SyntaxTree.PointerType).pointerBase.resolved;
  12564. END;
  12565. IF (x IS SyntaxTree.RecordType) THEN (* enter: insert only if not already inserted *)
  12566. recordType := x(SyntaxTree.RecordType);
  12567. td := x.typeDeclaration;
  12568. IF td = NIL THEN td := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  12569. ASSERT(td # NIL);
  12570. section := module.allSections.FindBySymbol(td); (* TODO *)
  12571. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12572. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12573. NewTypeDescriptor
  12574. END;
  12575. END;
  12576. ELSIF (x IS SyntaxTree.CellType) & implementationVisitor.backend.cellsAreObjects THEN
  12577. cellType := x(SyntaxTree.CellType);
  12578. td := x.typeDeclaration;
  12579. section := module.allSections.FindBySymbol(td); (* TODO *)
  12580. IF (section = NIL) OR (section(IntermediateCode.Section).pc = 0) THEN
  12581. IF (td.scope = NIL) OR (td.scope.ownerModule = module.module) THEN
  12582. NewTypeDescriptor
  12583. END;
  12584. END;
  12585. END
  12586. END CheckTypeDeclaration
  12587. END MetaDataGenerator;
  12588. IntermediateBackend*= OBJECT (IntermediateCode.IntermediateBackend)
  12589. VAR
  12590. trace-: BOOLEAN;
  12591. traceString-: SyntaxTree.IdentifierString;
  12592. traceModuleName-: SyntaxTree.IdentifierString;
  12593. profile-: BOOLEAN;
  12594. noRuntimeChecks: BOOLEAN;
  12595. simpleMetaData-: BOOLEAN;
  12596. noAsserts: BOOLEAN;
  12597. optimize-: BOOLEAN;
  12598. cooperative-: BOOLEAN;
  12599. preregisterStatic-: BOOLEAN;
  12600. dump-: Basic.Writer;
  12601. cellsAreObjects: BOOLEAN;
  12602. preciseGC, trackLeave, writeBarriers: BOOLEAN;
  12603. experiment: BOOLEAN;
  12604. PROCEDURE &InitIntermediateBackend*;
  12605. BEGIN
  12606. simpleMetaData := FALSE;
  12607. InitBackend;
  12608. SetBuiltinsModuleName(DefaultBuiltinsModuleName);
  12609. SetTraceModuleName(DefaultTraceModuleName);
  12610. END InitIntermediateBackend;
  12611. (* must be overwritten by actual backend, if parameter registers should be used *)
  12612. PROCEDURE NumberParameterRegisters*(callingConvention: SyntaxTree.CallingConvention): SIZE;
  12613. BEGIN
  12614. RETURN 0; (* default case: no parameter registers *)
  12615. END NumberParameterRegisters;
  12616. (* must be overwritten by actual backend, if parameter registers should be used *)
  12617. PROCEDURE ParameterRegister*(callingConvention: SyntaxTree.CallingConvention; type: IntermediateCode.Type; index: LONGINT): LONGINT;
  12618. BEGIN
  12619. HALT(100); (* abstract *)
  12620. END ParameterRegister;
  12621. PROCEDURE GenerateIntermediate*(x: SyntaxTree.Module; supportedInstruction: SupportedInstructionProcedure; supportedImmediate: SupportedImmediateProcedure): Sections.Module;
  12622. VAR
  12623. declarationVisitor: DeclarationVisitor;
  12624. implementationVisitor: ImplementationVisitor;
  12625. module: Sections.Module;
  12626. name, platformName: SyntaxTree.IdentifierString;
  12627. meta: MetaDataGenerator;
  12628. crc: CRC.CRC32Stream;
  12629. BEGIN
  12630. ResetError;
  12631. Global.GetSymbolName(x,name);
  12632. NEW(module,x,system); (* backend structures *)
  12633. Global.GetModuleName(x, name);
  12634. module.SetModuleName(name);
  12635. NEW(implementationVisitor,system,checker,supportedInstruction, supportedImmediate, Compiler.FindPC IN flags, builtinsModuleName, SELF);
  12636. NEW(declarationVisitor,system,implementationVisitor,SELF,Compiler.ForceModuleBodies IN flags,trace & (Compiler.Info IN flags));
  12637. NEW(meta, implementationVisitor, declarationVisitor,simpleMetaData);
  12638. declarationVisitor.Module(x,module);
  12639. IF ~meta.simple THEN
  12640. meta.Module(implementationVisitor.moduleBodySection);
  12641. END;
  12642. GetDescription(platformName);
  12643. module.SetPlatformName(platformName);
  12644. NEW(crc);
  12645. module.allSections.WriteRaw(crc);
  12646. crc.Update;
  12647. meta.PatchCRC(crc.GetCRC());
  12648. RETURN module
  12649. END GenerateIntermediate;
  12650. PROCEDURE SupportedImmediate*(CONST op: IntermediateCode.Operand): BOOLEAN;
  12651. BEGIN RETURN TRUE
  12652. END SupportedImmediate;
  12653. PROCEDURE ProcessSyntaxTreeModule*(syntaxTreeModule: SyntaxTree.Module): Formats.GeneratedModule;
  12654. BEGIN RETURN ProcessIntermediateCodeModule(GenerateIntermediate(syntaxTreeModule, SupportedInstruction, SupportedImmediate))
  12655. END ProcessSyntaxTreeModule;
  12656. PROCEDURE ProcessIntermediateCodeModule*(intermediateCodeModule: Formats.GeneratedModule): Formats.GeneratedModule;
  12657. VAR
  12658. result: Sections.Module;
  12659. traceName: Basic.MessageString;
  12660. BEGIN
  12661. ASSERT(intermediateCodeModule IS Sections.Module);
  12662. result := intermediateCodeModule(Sections.Module);
  12663. IF trace THEN
  12664. traceName := "intermediate code trace: ";
  12665. Strings.Append(traceName,traceString);
  12666. dump := Basic.GetWriter(Basic.GetDebugWriter(traceName));
  12667. IF (traceString="") OR (traceString="*") THEN
  12668. result.Dump(dump);
  12669. dump.Update
  12670. ELSE
  12671. Sections.DumpFiltered(dump, result, traceString);
  12672. END
  12673. END;
  12674. RETURN result
  12675. END ProcessIntermediateCodeModule;
  12676. PROCEDURE GetDescription*(VAR instructionSet: ARRAY OF CHAR);
  12677. BEGIN instructionSet := "Intermediate";
  12678. END GetDescription;
  12679. PROCEDURE SetSimpleMetaData*(simpleMetaData: BOOLEAN);
  12680. BEGIN
  12681. SELF.simpleMetaData := simpleMetaData;
  12682. END SetSimpleMetaData;
  12683. PROCEDURE SetTraceModuleName(CONST name: ARRAY OF CHAR);
  12684. BEGIN COPY(name, traceModuleName)
  12685. END SetTraceModuleName;
  12686. PROCEDURE DefineOptions*(options: Options.Options);
  12687. BEGIN
  12688. DefineOptions^(options);
  12689. options.Add(0X,"trace",Options.String);
  12690. options.Add(0X,"builtinsModule",Options.String);
  12691. options.Add(0X,"traceModule",Options.String);
  12692. options.Add(0X,"profile",Options.Flag);
  12693. options.Add(0X,"noRuntimeChecks",Options.Flag);
  12694. options.Add(0X,"noAsserts",Options.Flag);
  12695. options.Add(0X,"metaData",Options.String);
  12696. options.Add('o',"optimize", Options.Flag);
  12697. options.Add(0X,"preregisterStatic", Options.Flag);
  12698. options.Add(0X,"cellsAreObjects", Options.Flag);
  12699. options.Add(0X,"preciseGC", Options.Flag);
  12700. options.Add(0X,"trackLeave", Options.Flag);
  12701. options.Add(0X,"writeBarriers", Options.Flag);
  12702. options.Add(0X,"experiment", Options.Flag);
  12703. END DefineOptions;
  12704. PROCEDURE GetOptions*(options: Options.Options);
  12705. VAR name,string: SyntaxTree.IdentifierString;
  12706. BEGIN
  12707. GetOptions^(options);
  12708. trace := options.GetString("trace",traceString);
  12709. profile := options.GetFlag("profile");
  12710. noRuntimeChecks := options.GetFlag("noRuntimeChecks");
  12711. noAsserts := options.GetFlag("noAsserts");
  12712. cooperative := options.GetFlag("cooperative");
  12713. IF options.GetString("objectFile",string) & (string = "Minos") THEN
  12714. simpleMetaData := TRUE
  12715. END;
  12716. IF options.GetString("metaData",string) THEN
  12717. IF string = "simple" THEN simpleMetaData := TRUE
  12718. ELSIF string ="full" THEN simpleMetaData := FALSE
  12719. END;
  12720. END;
  12721. IF options.GetString("builtinsModule",name) THEN SetBuiltinsModuleName(name) END;
  12722. IF options.GetString("traceModule",name) THEN SetTraceModuleName(name) END;
  12723. optimize := options.GetFlag("optimize");
  12724. preregisterStatic := options.GetFlag("preregisterStatic");
  12725. cellsAreObjects := options.GetFlag("cellsAreObjects");
  12726. preciseGC := options.GetFlag("preciseGC");
  12727. trackLeave := options.GetFlag("trackLeave");
  12728. writeBarriers := options.GetFlag("writeBarriers");
  12729. experiment := options.GetFlag("experiment");
  12730. END GetOptions;
  12731. PROCEDURE DefaultSymbolFileFormat*(): Formats.SymbolFileFormat;
  12732. BEGIN RETURN SymbolFileFormat.Get()
  12733. END DefaultSymbolFileFormat;
  12734. END IntermediateBackend;
  12735. (* ----------------------------------- register allocation ------------------------------------- *)
  12736. (* register mapping scheme
  12737. virtual register number --> register mapping = part(0) --> ticket <--> physical register
  12738. spill offset
  12739. part(n) --> ticket <--> physical register
  12740. spill offset
  12741. *)
  12742. VAR int8-, int16-, int32-, int64-, uint8-, uint16-, uint32-, uint64-, float32-, float64-: IntermediateCode.Type;
  12743. emptyOperand: IntermediateCode.Operand;
  12744. systemCalls: ARRAY NumberSystemCalls OF SyntaxTree.Symbol;
  12745. statCoopResetVariables: LONGINT;
  12746. statCoopModifyAssignments: LONGINT;
  12747. modifyAssignmentsPC : LONGINT;
  12748. statCoopNilCheck: LONGINT;
  12749. statCoopSwitch: LONGINT;
  12750. statCoopAssignProcedure: LONGINT;
  12751. statCoopTraceMethod: LONGINT;
  12752. statCoopResetProcedure: LONGINT;
  12753. statCoopTraceModule: LONGINT;
  12754. PROCEDURE ResetStatistics*;
  12755. BEGIN
  12756. statCoopResetVariables := 0;
  12757. statCoopModifyAssignments := 0;
  12758. statCoopNilCheck:= 0;
  12759. statCoopSwitch:= 0;
  12760. statCoopAssignProcedure:= 0;
  12761. statCoopTraceMethod:= 0;
  12762. statCoopResetProcedure:= 0;
  12763. statCoopTraceModule:= 0;
  12764. END ResetStatistics;
  12765. PROCEDURE Statistics*;
  12766. BEGIN
  12767. TRACE(statCoopResetVariables, statCoopModifyAssignments);
  12768. TRACE(statCoopNilCheck, statCoopSwitch);
  12769. TRACE(statCoopAssignProcedure,
  12770. statCoopTraceMethod,
  12771. statCoopResetProcedure,
  12772. statCoopTraceModule)
  12773. END Statistics;
  12774. PROCEDURE GCD(a,b: LONGINT): LONGINT;
  12775. VAR h: LONGINT;
  12776. BEGIN
  12777. WHILE b # 0 DO
  12778. h := a MOD b;
  12779. a := b;
  12780. b := h;
  12781. END;
  12782. RETURN a
  12783. END GCD;
  12784. PROCEDURE SCM(a,b: LONGINT): LONGINT;
  12785. BEGIN
  12786. RETURN a*b DIV GCD(a,b)
  12787. END SCM;
  12788. PROCEDURE CommonAlignment(a,b: LONGINT): LONGINT;
  12789. BEGIN
  12790. (*TRACE(a,b);*)
  12791. IF a = 0 THEN RETURN b
  12792. ELSIF b = 0 THEN RETURN a
  12793. ELSE RETURN SCM(a,b)
  12794. END;
  12795. END CommonAlignment;
  12796. PROCEDURE PassBySingleReference(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12797. BEGIN
  12798. IF parameter.kind = SyntaxTree.ValueParameter THEN RETURN FALSE
  12799. ELSIF parameter.kind = SyntaxTree.ConstParameter THEN
  12800. RETURN (parameter.type.resolved IS SyntaxTree.RecordType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12801. ELSIF parameter.kind = SyntaxTree.VarParameter THEN
  12802. RETURN ~(parameter.type.resolved IS SyntaxTree.ArrayType) & ~(parameter.type.resolved IS SyntaxTree.MathArrayType) OR (parameter.type.resolved IS SyntaxTree.ArrayType) & (callingConvention IN SysvABIorWINAPI)
  12803. END
  12804. END PassBySingleReference;
  12805. PROCEDURE PassInRegister(parameter: SyntaxTree.Parameter; callingConvention: SyntaxTree.CallingConvention): BOOLEAN;
  12806. BEGIN
  12807. RETURN ~parameter.type.IsComposite() OR PassBySingleReference(parameter,callingConvention)
  12808. END PassInRegister;
  12809. PROCEDURE AddRegisterEntry(VAR queue: RegisterEntry; register: LONGINT; class: IntermediateCode.RegisterClass; type: IntermediateCode.Type);
  12810. VAR new: RegisterEntry;
  12811. BEGIN
  12812. NEW(new); new.register := register; new.registerClass := class; new.type := type; new.next := NIL; new.prev := NIL;
  12813. IF queue = NIL THEN
  12814. queue := new
  12815. ELSE
  12816. new.next := queue;
  12817. IF queue#NIL THEN queue.prev := new END;
  12818. queue := new
  12819. END;
  12820. END AddRegisterEntry;
  12821. PROCEDURE RemoveRegisterEntry(VAR queue: RegisterEntry; register: LONGINT): BOOLEAN;
  12822. VAR this: RegisterEntry;
  12823. BEGIN
  12824. this := queue;
  12825. WHILE (this # NIL) & (this.register # register) DO
  12826. this := this.next;
  12827. END;
  12828. IF this = NIL THEN
  12829. RETURN FALSE
  12830. END;
  12831. ASSERT(this # NIL);
  12832. IF this = queue THEN queue := queue.next END;
  12833. IF this.prev # NIL THEN this.prev.next := this.next END;
  12834. IF this.next # NIL THEN this.next.prev := this.prev END;
  12835. RETURN TRUE
  12836. END RemoveRegisterEntry;
  12837. PROCEDURE Assert(cond: BOOLEAN; CONST reason: ARRAY OF CHAR);
  12838. BEGIN ASSERT(cond);
  12839. END Assert;
  12840. PROCEDURE ReusableRegister(op: IntermediateCode.Operand): BOOLEAN;
  12841. BEGIN
  12842. RETURN (op.mode = IntermediateCode.ModeRegister) & (op.register > 0) & (op.offset = 0);
  12843. END ReusableRegister;
  12844. PROCEDURE EnsureBodyProcedure(moduleScope: SyntaxTree.ModuleScope);
  12845. VAR procedure: SyntaxTree.Procedure; procedureScope: SyntaxTree.ProcedureScope;
  12846. BEGIN
  12847. procedure := moduleScope.bodyProcedure;
  12848. IF procedure = NIL THEN (* artificially add body procedure if not existing. Really needed? *)
  12849. procedureScope := SyntaxTree.NewProcedureScope(moduleScope);
  12850. procedure := SyntaxTree.NewProcedure(Basic.invalidPosition,Global.ModuleBodyName, procedureScope);
  12851. procedure.SetScope(moduleScope);
  12852. procedure.SetType(SyntaxTree.NewProcedureType(Basic.invalidPosition,moduleScope));
  12853. procedure.SetAccess(SyntaxTree.Hidden);
  12854. moduleScope.SetBodyProcedure(procedure);
  12855. moduleScope.AddProcedure(procedure);
  12856. procedureScope.SetBody(SyntaxTree.NewBody(Basic.invalidPosition,procedureScope)); (* empty body *)
  12857. END;
  12858. END EnsureBodyProcedure;
  12859. PROCEDURE GetSymbol*(scope: SyntaxTree.ModuleScope; CONST moduleName, symbolName: ARRAY OF CHAR): SyntaxTree.Symbol;
  12860. VAR import: SyntaxTree.Import;
  12861. selfName: SyntaxTree.IdentifierString;
  12862. module: SyntaxTree.Module;
  12863. BEGIN
  12864. scope.ownerModule.GetName(selfName);
  12865. IF (moduleName = selfName) & (scope.ownerModule.context = Global.A2Name) THEN
  12866. module := scope.ownerModule
  12867. ELSE
  12868. import := scope.ImportByModuleName(SyntaxTree.NewIdentifier(moduleName),SyntaxTree.NewIdentifier("A2"));
  12869. IF import = NIL THEN
  12870. RETURN NIL
  12871. ELSIF import.module = NIL THEN
  12872. RETURN NIL
  12873. ELSE module := import.module
  12874. END;
  12875. END;
  12876. RETURN module.moduleScope.FindSymbol(SyntaxTree.NewIdentifier(symbolName));
  12877. END GetSymbol;
  12878. PROCEDURE InitOperand(VAR op: Operand; mode: SHORTINT);
  12879. BEGIN
  12880. op.mode := mode;
  12881. IntermediateCode.InitOperand(op.op);
  12882. IntermediateCode.InitOperand(op.tag);
  12883. IntermediateCode.InitOperand(op.extra);
  12884. op.dimOffset := 0;
  12885. END InitOperand;
  12886. (* TODO: remove this, and redirect calls to 'IntermediateCode.GetType' directly *)
  12887. PROCEDURE GetType*(system: Global.System; type: SyntaxTree.Type): IntermediateCode.Type;
  12888. BEGIN RETURN IntermediateCode.GetType(system, type)
  12889. END GetType;
  12890. PROCEDURE BuildConstant(module: SyntaxTree.Module; value: SyntaxTree.Value; VAR adr: LONGINT): SyntaxTree.Constant;
  12891. VAR name: SyntaxTree.IdentifierString; constant: SyntaxTree.Constant;
  12892. BEGIN
  12893. name := "@const"; Basic.AppendNumber(name, adr); INC(adr);
  12894. (*
  12895. UniqueId(name,module,name,adr);
  12896. *)
  12897. constant := SyntaxTree.NewConstant(Basic.invalidPosition,SyntaxTree.NewIdentifier(name));
  12898. constant.SetValue(value);
  12899. constant.SetAccess(SyntaxTree.Hidden);
  12900. module.moduleScope.AddConstant(constant);
  12901. constant.SetScope(module.moduleScope);
  12902. RETURN constant
  12903. END BuildConstant;
  12904. PROCEDURE HasPointers (scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12905. VAR variable: SyntaxTree.Variable; parameter: SyntaxTree.Parameter;
  12906. BEGIN
  12907. variable := scope.firstVariable;
  12908. WHILE variable # NIL DO
  12909. IF variable.NeedsTrace() THEN
  12910. RETURN TRUE;
  12911. END;
  12912. variable := variable.nextVariable;
  12913. END;
  12914. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12915. WHILE parameter # NIL DO
  12916. IF parameter.NeedsTrace() & ~IsVariableParameter(parameter) & (parameter.kind # SyntaxTree.ConstParameter) THEN
  12917. RETURN TRUE;
  12918. END;
  12919. parameter := parameter.nextParameter;
  12920. END;
  12921. RETURN FALSE;
  12922. END HasPointers;
  12923. PROCEDURE IsVariableParameter (parameter: SyntaxTree.Parameter): BOOLEAN;
  12924. 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));
  12925. END IsVariableParameter;
  12926. PROCEDURE HasVariableParameters(scope: SyntaxTree.ProcedureScope): BOOLEAN;
  12927. VAR parameter: SyntaxTree.Parameter;
  12928. BEGIN
  12929. parameter := scope.ownerProcedure.type(SyntaxTree.ProcedureType).firstParameter;
  12930. WHILE parameter # NIL DO
  12931. IF IsVariableParameter (parameter) THEN RETURN TRUE END;
  12932. IF parameter.movable THEN RETURN TRUE END;
  12933. parameter := parameter.nextParameter;
  12934. END;
  12935. RETURN scope.ownerProcedure.type(SyntaxTree.ProcedureType).returnParameter # NIL;
  12936. END HasVariableParameters;
  12937. PROCEDURE HasExplicitTraceMethod(recordType: SyntaxTree.RecordType): BOOLEAN;
  12938. BEGIN
  12939. IF (recordType.pointerType # NIL) & ~recordType.pointerType.isPlain THEN RETURN FALSE END;
  12940. RETURN (recordType.recordScope.firstProcedure # NIL) & Basic.StringEqual (Basic.MakeString ("Trace"), recordType.recordScope.firstProcedure.name);
  12941. END HasExplicitTraceMethod;
  12942. PROCEDURE IsIntegerConstant(expression: SyntaxTree.Expression; VAR val: HUGEINT): BOOLEAN;
  12943. BEGIN
  12944. IF expression.resolved # NIL THEN expression := expression.resolved END;
  12945. IF (expression IS SyntaxTree.IntegerValue) THEN
  12946. val := expression(SyntaxTree.IntegerValue).value;
  12947. RETURN TRUE
  12948. ELSE
  12949. RETURN FALSE
  12950. END;
  12951. END IsIntegerConstant;
  12952. PROCEDURE PowerOf2*(val: HUGEINT; VAR exp: LONGINT): BOOLEAN;
  12953. BEGIN
  12954. IF val <= 0 THEN RETURN FALSE END;
  12955. exp := 0;
  12956. WHILE ~ODD(val) DO
  12957. val := val DIV 2;
  12958. INC(exp)
  12959. END;
  12960. RETURN val = 1
  12961. END PowerOf2;
  12962. PROCEDURE GetConstructor(record: SyntaxTree.RecordType): SyntaxTree.Procedure;
  12963. VAR procedure: SyntaxTree.Procedure;
  12964. BEGIN
  12965. procedure := record.recordScope.constructor;
  12966. IF procedure = NIL THEN
  12967. record := record.GetBaseRecord();
  12968. IF record # NIL THEN
  12969. procedure := GetConstructor(record)
  12970. END;
  12971. END;
  12972. RETURN procedure;
  12973. END GetConstructor;
  12974. PROCEDURE IsIntegerImmediate(CONST op: IntermediateCode.Operand; VAR value: LONGINT): BOOLEAN;
  12975. BEGIN
  12976. value := SHORT(op.intValue);
  12977. RETURN op.mode = IntermediateCode.ModeImmediate;
  12978. END IsIntegerImmediate;
  12979. (** whether a type strictily is a pointer to record or object type
  12980. (however, the basic type <<OBJECT>> is explicitly excluded) **)
  12981. PROCEDURE IsStrictlyPointerToRecord(type: SyntaxTree.Type): BOOLEAN;
  12982. BEGIN
  12983. IF type = NIL THEN
  12984. RETURN FALSE
  12985. ELSIF type.resolved IS SyntaxTree.PointerType THEN
  12986. RETURN type.resolved(SyntaxTree.PointerType).pointerBase.resolved IS SyntaxTree.RecordType
  12987. ELSE
  12988. RETURN FALSE
  12989. END
  12990. END IsStrictlyPointerToRecord;
  12991. PROCEDURE IsUnsafePointer(type: SyntaxTree.Type): BOOLEAN;
  12992. BEGIN RETURN (type # NIL) & (type.resolved IS SyntaxTree.PointerType) & type.resolved(SyntaxTree.PointerType).isUnsafe
  12993. END IsUnsafePointer;
  12994. PROCEDURE IsPointerToRecord(type: SyntaxTree.Type; VAR recordType: SyntaxTree.RecordType): BOOLEAN;
  12995. BEGIN type := type.resolved;
  12996. IF type IS SyntaxTree.PointerType THEN
  12997. type := type(SyntaxTree.PointerType).pointerBase;
  12998. type := type.resolved;
  12999. IF type IS SyntaxTree.RecordType THEN
  13000. recordType := type(SyntaxTree.RecordType);
  13001. RETURN TRUE
  13002. ELSE
  13003. RETURN FALSE
  13004. END
  13005. ELSIF type IS SyntaxTree.RecordType THEN
  13006. recordType := type(SyntaxTree.RecordType);
  13007. RETURN type(SyntaxTree.RecordType).pointerType # NIL
  13008. ELSIF type IS SyntaxTree.ObjectType THEN
  13009. RETURN TRUE
  13010. ELSIF type IS SyntaxTree.AnyType THEN
  13011. RETURN TRUE (*! potentially is a pointer to record, treat it this way?? *)
  13012. ELSE
  13013. RETURN FALSE
  13014. END;
  13015. END IsPointerToRecord;
  13016. PROCEDURE IsArrayOfSystemByte(type: SyntaxTree.Type): BOOLEAN;
  13017. BEGIN
  13018. type := type.resolved;
  13019. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open)
  13020. & (type(SyntaxTree.ArrayType).arrayBase.resolved IS SyntaxTree.ByteType);
  13021. END IsArrayOfSystemByte;
  13022. PROCEDURE IsOpenArray(type: SyntaxTree.Type): BOOLEAN;
  13023. BEGIN
  13024. IF type = NIL THEN RETURN FALSE END;
  13025. type := type.resolved;
  13026. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Open);
  13027. END IsOpenArray;
  13028. PROCEDURE IsSemiDynamicArray(type: SyntaxTree.Type): BOOLEAN;
  13029. BEGIN
  13030. IF type = NIL THEN RETURN FALSE END;
  13031. type := type.resolved;
  13032. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.SemiDynamic);
  13033. END IsSemiDynamicArray;
  13034. PROCEDURE IsStaticArray(type: SyntaxTree.Type): BOOLEAN;
  13035. BEGIN
  13036. IF type = NIL THEN RETURN FALSE END;
  13037. type := type.resolved;
  13038. RETURN (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form = SyntaxTree.Static);
  13039. END IsStaticArray;
  13040. PROCEDURE IsStaticMathArray(type: SyntaxTree.Type): BOOLEAN;
  13041. BEGIN
  13042. IF type = NIL THEN RETURN FALSE END;
  13043. type := type.resolved;
  13044. RETURN (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form = SyntaxTree.Static);
  13045. END IsStaticMathArray;
  13046. PROCEDURE StaticMathArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13047. BEGIN
  13048. WHILE (IsStaticMathArray(type)) DO
  13049. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13050. END;
  13051. RETURN type;
  13052. END StaticMathArrayBaseType;
  13053. PROCEDURE StaticArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13054. VAR size: LONGINT;
  13055. BEGIN
  13056. size := 1;
  13057. WHILE (IsStaticArray(type)) DO
  13058. size := size * type.resolved(SyntaxTree.ArrayType).staticLength;
  13059. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13060. END;
  13061. RETURN size;
  13062. END StaticArrayNumElements;
  13063. PROCEDURE StaticMathArrayNumElements(type: SyntaxTree.Type): LONGINT;
  13064. VAR size: LONGINT;
  13065. BEGIN
  13066. size := 1;
  13067. WHILE (IsStaticMathArray(type)) DO
  13068. size := size * type.resolved(SyntaxTree.MathArrayType).staticLength;
  13069. type := type.resolved(SyntaxTree.MathArrayType).arrayBase;
  13070. END;
  13071. RETURN size;
  13072. END StaticMathArrayNumElements;
  13073. PROCEDURE StaticArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13074. BEGIN
  13075. WHILE (IsStaticArray(type)) DO
  13076. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13077. END;
  13078. RETURN type;
  13079. END StaticArrayBaseType;
  13080. PROCEDURE ArrayBaseType(type: SyntaxTree.Type): SyntaxTree.Type;
  13081. BEGIN
  13082. WHILE (type.resolved IS SyntaxTree.ArrayType) DO
  13083. type := type.resolved(SyntaxTree.ArrayType).arrayBase;
  13084. END;
  13085. RETURN type;
  13086. END ArrayBaseType;
  13087. PROCEDURE IsDelegate(type: SyntaxTree.Type): BOOLEAN;
  13088. BEGIN
  13089. IF type = NIL THEN RETURN FALSE END;
  13090. type := type.resolved;
  13091. RETURN (type IS SyntaxTree.ProcedureType) & (type(SyntaxTree.ProcedureType).isDelegate)
  13092. END IsDelegate;
  13093. PROCEDURE DynamicDim(type:SyntaxTree.Type): LONGINT;
  13094. VAR i: LONGINT;
  13095. BEGIN
  13096. i := 0; type := type.resolved;
  13097. WHILE(type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13098. INC(i);
  13099. type := type(SyntaxTree.ArrayType).arrayBase.resolved;
  13100. END;
  13101. WHILE(type # NIL) & (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13102. INC(i);
  13103. type := type(SyntaxTree.MathArrayType).arrayBase;
  13104. IF type # NIL THEN type := type.resolved END;
  13105. END;
  13106. RETURN i
  13107. END DynamicDim;
  13108. PROCEDURE StaticSize(system: Global.System; type: SyntaxTree.Type): LONGINT;
  13109. BEGIN
  13110. WHILE (type IS SyntaxTree.ArrayType) & (type(SyntaxTree.ArrayType).form # SyntaxTree.Static) DO
  13111. type := type(SyntaxTree.ArrayType).arrayBase;
  13112. END;
  13113. WHILE (type IS SyntaxTree.MathArrayType) & (type(SyntaxTree.MathArrayType).form # SyntaxTree.Static) DO
  13114. type := type(SyntaxTree.MathArrayType).arrayBase;
  13115. END;
  13116. RETURN ToMemoryUnits(system,system.AlignedSizeOf(type));
  13117. END StaticSize;
  13118. PROCEDURE IsImmediate(x: IntermediateCode.Operand): BOOLEAN;
  13119. BEGIN
  13120. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name = "");
  13121. END IsImmediate;
  13122. PROCEDURE IsAddress(x: IntermediateCode.Operand): BOOLEAN;
  13123. BEGIN
  13124. RETURN (x.mode = IntermediateCode.ModeImmediate) & (x.symbol.name # "")
  13125. END IsAddress;
  13126. PROCEDURE IsRegister(x: IntermediateCode.Operand): BOOLEAN;
  13127. BEGIN
  13128. RETURN (x.mode = IntermediateCode.ModeRegister);
  13129. END IsRegister;
  13130. PROCEDURE GetRecordTypeName(recordType: SyntaxTree.RecordType; VAR name: Basic.SegmentedName);
  13131. VAR typeDeclaration: SyntaxTree.TypeDeclaration;
  13132. BEGIN
  13133. typeDeclaration := recordType.typeDeclaration;
  13134. IF typeDeclaration = NIL THEN typeDeclaration := recordType.pointerType.resolved.typeDeclaration END; (* for compatibility with paco *)
  13135. Global.GetSymbolSegmentedName(typeDeclaration,name);
  13136. END GetRecordTypeName;
  13137. PROCEDURE ParametersSize(system: Global.System; procedureType: SyntaxTree.ProcedureType; isNested: BOOLEAN): LONGINT;
  13138. VAR parSize: LONGINT; parameter: SyntaxTree.Parameter;
  13139. BEGIN
  13140. parSize := 0;
  13141. IF SemanticChecker.StructuredReturnType(procedureType) THEN
  13142. parameter := procedureType.returnParameter;
  13143. INC(parSize,system.SizeOfParameter(parameter));
  13144. parSize := parSize + (-parSize) MOD system.addressSize;
  13145. END;
  13146. parameter :=procedureType.lastParameter;
  13147. WHILE (parameter # NIL) DO
  13148. IF procedureType.callingConvention IN SysvABIorWINAPI THEN
  13149. INC(parSize, system.addressSize);
  13150. ELSE
  13151. INC(parSize,system.SizeOfParameter(parameter));
  13152. parSize := parSize + (-parSize) MOD system.addressSize;
  13153. END;
  13154. parameter := parameter.prevParameter;
  13155. END;
  13156. IF procedureType.selfParameter # NIL THEN
  13157. parameter := procedureType.selfParameter;
  13158. INC(parSize,system.SizeOfParameter(parameter));
  13159. parSize := parSize + (-parSize) MOD system.addressSize;
  13160. ELSIF procedureType.isDelegate THEN INC(parSize,system.addressSize)
  13161. END; (* method => self pointer *)
  13162. IF isNested THEN INC(parSize,system.addressSize) END; (* nested procedure => static base *)
  13163. RETURN ToMemoryUnits(system,parSize)
  13164. END ParametersSize;
  13165. PROCEDURE IsNested(procedure: SyntaxTree.Procedure): BOOLEAN;
  13166. BEGIN
  13167. RETURN (procedure.scope IS SyntaxTree.ProcedureScope) & (procedure.externalName = NIL);
  13168. END IsNested;
  13169. PROCEDURE InCellScope(scope: SyntaxTree.Scope): BOOLEAN;
  13170. BEGIN
  13171. WHILE (scope # NIL) & ~(scope IS SyntaxTree.CellScope) DO
  13172. scope := scope.outerScope;
  13173. END;
  13174. RETURN scope # NIL;
  13175. END InCellScope;
  13176. PROCEDURE ProcedureParametersSize*(system: Global.System; procedure: SyntaxTree.Procedure): LONGINT;
  13177. BEGIN
  13178. RETURN ParametersSize(system,procedure.type(SyntaxTree.ProcedureType), IsNested(procedure));
  13179. END ProcedureParametersSize;
  13180. PROCEDURE ToMemoryUnits*(system: Global.System; size: SIZE): LONGINT;
  13181. VAR dataUnit: LONGINT;
  13182. BEGIN dataUnit := system.dataUnit;
  13183. ASSERT(size MOD system.dataUnit = 0);
  13184. RETURN LONGINT(size DIV system.dataUnit)
  13185. END ToMemoryUnits;
  13186. PROCEDURE Get*(): Backend.Backend;
  13187. VAR backend: IntermediateBackend;
  13188. BEGIN NEW(backend); RETURN backend
  13189. END Get;
  13190. PROCEDURE Nop(position: Basic.Position):IntermediateCode.Instruction;
  13191. VAR instruction: IntermediateCode.Instruction;
  13192. BEGIN
  13193. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.nop,emptyOperand,emptyOperand,emptyOperand);
  13194. RETURN instruction
  13195. END Nop;
  13196. PROCEDURE Mov(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13197. VAR instruction: IntermediateCode.Instruction;
  13198. BEGIN
  13199. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,emptyOperand);
  13200. RETURN instruction
  13201. END Mov;
  13202. (* like Mov but ensures that no new register will be allocated for dest *)
  13203. PROCEDURE MovReplace(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13204. VAR instruction: IntermediateCode.Instruction;
  13205. BEGIN
  13206. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.mov,dest,src,dest);
  13207. RETURN instruction
  13208. END MovReplace;
  13209. PROCEDURE Conv(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13210. VAR instruction: IntermediateCode.Instruction;
  13211. BEGIN
  13212. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.conv,dest,src,emptyOperand);
  13213. RETURN instruction
  13214. END Conv;
  13215. PROCEDURE Call*(position: Basic.Position;op: IntermediateCode.Operand; parSize: LONGINT): IntermediateCode.Instruction;
  13216. VAR instruction: IntermediateCode.Instruction;
  13217. BEGIN
  13218. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.call,op,IntermediateCode.Number(parSize),emptyOperand);
  13219. RETURN instruction
  13220. END Call;
  13221. PROCEDURE Exit(position: Basic.Position;pcOffset: LONGINT; callingConvention, unwind: LONGINT): IntermediateCode.Instruction;
  13222. VAR op1, op2, op3: IntermediateCode.Operand;
  13223. VAR instruction: IntermediateCode.Instruction;
  13224. BEGIN
  13225. IntermediateCode.InitNumber(op1,pcOffset);
  13226. IntermediateCode.InitNumber(op2,callingConvention);
  13227. IntermediateCode.InitNumber(op3,unwind);
  13228. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.exit,op1,op2,op3);
  13229. RETURN instruction
  13230. END Exit;
  13231. PROCEDURE Return(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13232. VAR instruction: IntermediateCode.Instruction;
  13233. BEGIN
  13234. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.return,res,emptyOperand,emptyOperand);
  13235. RETURN instruction
  13236. END Return;
  13237. PROCEDURE Result*(position: Basic.Position;res: IntermediateCode.Operand): IntermediateCode.Instruction;
  13238. VAR instruction: IntermediateCode.Instruction;
  13239. BEGIN
  13240. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.result,res,emptyOperand,emptyOperand);
  13241. RETURN instruction
  13242. END Result;
  13243. PROCEDURE Trap(position: Basic.Position;nr: LONGINT): IntermediateCode.Instruction;
  13244. VAR op1: IntermediateCode.Operand;
  13245. VAR instruction: IntermediateCode.Instruction;
  13246. BEGIN
  13247. IntermediateCode.InitNumber(op1,nr);
  13248. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.trap,op1,emptyOperand,emptyOperand);
  13249. RETURN instruction
  13250. END Trap;
  13251. PROCEDURE Br(position: Basic.Position;dest: IntermediateCode.Operand): IntermediateCode.Instruction;
  13252. VAR instruction: IntermediateCode.Instruction;
  13253. BEGIN
  13254. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.br,dest,emptyOperand,emptyOperand);
  13255. RETURN instruction
  13256. END Br;
  13257. PROCEDURE Breq(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13258. VAR instruction: IntermediateCode.Instruction;
  13259. BEGIN
  13260. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.breq,dest,left,right);
  13261. RETURN instruction
  13262. END Breq;
  13263. PROCEDURE Brne(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13264. VAR instruction: IntermediateCode.Instruction;
  13265. BEGIN
  13266. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brne,dest,left,right);
  13267. RETURN instruction
  13268. END Brne;
  13269. PROCEDURE Brge(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13270. VAR instruction: IntermediateCode.Instruction;
  13271. BEGIN
  13272. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brge,dest,left,right);
  13273. RETURN instruction
  13274. END Brge;
  13275. PROCEDURE Brlt(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13276. VAR instruction: IntermediateCode.Instruction;
  13277. BEGIN
  13278. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.brlt,dest,left,right);
  13279. RETURN instruction
  13280. END Brlt;
  13281. PROCEDURE Pop*(position: Basic.Position;op:IntermediateCode.Operand): IntermediateCode.Instruction;
  13282. VAR instruction: IntermediateCode.Instruction;
  13283. BEGIN
  13284. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.pop,op,emptyOperand,emptyOperand);
  13285. RETURN instruction
  13286. END Pop;
  13287. PROCEDURE Push*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13288. VAR instruction: IntermediateCode.Instruction;
  13289. BEGIN
  13290. ASSERT(op.mode # IntermediateCode.Undefined);
  13291. IntermediateCode.InitInstruction(instruction, position, IntermediateCode.push,op,emptyOperand,emptyOperand);
  13292. RETURN instruction
  13293. END Push;
  13294. PROCEDURE Neg(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13295. VAR instruction: IntermediateCode.Instruction;
  13296. BEGIN
  13297. IntermediateCode.InitInstruction(instruction,position, IntermediateCode.neg,dest,src,emptyOperand);
  13298. RETURN instruction
  13299. END Neg;
  13300. PROCEDURE Not(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13301. VAR instruction: IntermediateCode.Instruction;
  13302. BEGIN
  13303. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.not,dest,src,emptyOperand);
  13304. RETURN instruction
  13305. END Not;
  13306. PROCEDURE Abs(position: Basic.Position;dest,src: IntermediateCode.Operand): IntermediateCode.Instruction;
  13307. VAR instruction: IntermediateCode.Instruction;
  13308. BEGIN
  13309. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.abs,dest,src,emptyOperand);
  13310. RETURN instruction
  13311. END Abs;
  13312. PROCEDURE Mul(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13313. VAR instruction: IntermediateCode.Instruction;
  13314. BEGIN
  13315. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mul,dest,left,right);
  13316. ASSERT(~IsImmediate(instruction.op1));
  13317. RETURN instruction
  13318. END Mul;
  13319. PROCEDURE Div(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13320. VAR instruction: IntermediateCode.Instruction;
  13321. BEGIN
  13322. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.div,dest,left,right);
  13323. RETURN instruction
  13324. END Div;
  13325. PROCEDURE Mod(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13326. VAR instruction: IntermediateCode.Instruction;
  13327. BEGIN
  13328. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.mod,dest,left,right);
  13329. RETURN instruction
  13330. END Mod;
  13331. PROCEDURE Sub(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13332. VAR instruction: IntermediateCode.Instruction;
  13333. BEGIN
  13334. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.sub,dest,left,right);
  13335. RETURN instruction
  13336. END Sub;
  13337. PROCEDURE Add(position: Basic.Position;dest: IntermediateCode.Operand; left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13338. VAR instruction: IntermediateCode.Instruction;
  13339. BEGIN
  13340. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.add,dest,left,right);
  13341. RETURN instruction
  13342. END Add;
  13343. PROCEDURE And(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13344. VAR instruction: IntermediateCode.Instruction;
  13345. BEGIN
  13346. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.and,dest,left,right);
  13347. RETURN instruction
  13348. END And;
  13349. PROCEDURE Or(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13350. VAR instruction: IntermediateCode.Instruction;
  13351. BEGIN
  13352. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.or,dest,left,right);
  13353. RETURN instruction
  13354. END Or;
  13355. PROCEDURE Xor(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13356. VAR instruction: IntermediateCode.Instruction;
  13357. BEGIN
  13358. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.xor,dest,left,right);
  13359. RETURN instruction
  13360. END Xor;
  13361. PROCEDURE Shl(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13362. VAR instruction: IntermediateCode.Instruction;
  13363. BEGIN
  13364. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shl,dest,left, IntermediateCode.ToUnsigned(right));
  13365. RETURN instruction
  13366. END Shl;
  13367. PROCEDURE Shr(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13368. VAR instruction: IntermediateCode.Instruction;
  13369. BEGIN
  13370. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.shr,dest,left, IntermediateCode.ToUnsigned(right));
  13371. RETURN instruction
  13372. END Shr;
  13373. PROCEDURE Rol(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13374. VAR instruction: IntermediateCode.Instruction;
  13375. BEGIN
  13376. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.rol,dest,left, IntermediateCode.ToUnsigned(right));
  13377. RETURN instruction
  13378. END Rol;
  13379. PROCEDURE Ror(position: Basic.Position;dest,left,right: IntermediateCode.Operand): IntermediateCode.Instruction;
  13380. VAR instruction: IntermediateCode.Instruction;
  13381. BEGIN
  13382. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.ror,dest,left, IntermediateCode.ToUnsigned(right));
  13383. RETURN instruction
  13384. END Ror;
  13385. PROCEDURE Cas(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13386. VAR instruction: IntermediateCode.Instruction;
  13387. BEGIN
  13388. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.cas,dest,src,size);
  13389. RETURN instruction
  13390. END Cas;
  13391. PROCEDURE Copy(position: Basic.Position;dest,src,size: IntermediateCode.Operand): IntermediateCode.Instruction;
  13392. VAR instruction: IntermediateCode.Instruction;
  13393. BEGIN
  13394. ASSERT(~IntermediateCode.IsVectorRegister(dest));
  13395. ASSERT(~IntermediateCode.IsVectorRegister(src));
  13396. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.copy,dest,src,size);
  13397. RETURN instruction
  13398. END Copy;
  13399. PROCEDURE Fill(position: Basic.Position;dest,size, value: IntermediateCode.Operand): IntermediateCode.Instruction;
  13400. VAR instruction: IntermediateCode.Instruction;
  13401. BEGIN
  13402. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.fill,dest,size,value);
  13403. RETURN instruction
  13404. END Fill;
  13405. PROCEDURE Asm(position: Basic.Position;s: SyntaxTree.SourceCode; inRules, outRules: IntermediateCode.Rules): IntermediateCode.Instruction;
  13406. VAR instruction: IntermediateCode.Instruction; string, o1, o2: IntermediateCode.Operand;
  13407. BEGIN
  13408. string := IntermediateCode.String(s);
  13409. (*IntermediateCode.SetIntValue(string,position); (* for error reporting *)*)
  13410. IF inRules # NIL THEN IntermediateCode.InitRule(o1, inRules) ELSE o1 := emptyOperand END;
  13411. IF outRules # NIL THEN IntermediateCode.InitRule(o2, outRules) ELSE o2 := emptyOperand END;
  13412. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.asm,string,o1,o2);
  13413. RETURN instruction
  13414. END Asm;
  13415. PROCEDURE Data*(position: Basic.Position;op: IntermediateCode.Operand): IntermediateCode.Instruction;
  13416. VAR instruction: IntermediateCode.Instruction;
  13417. BEGIN
  13418. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.data,op,emptyOperand,emptyOperand);
  13419. RETURN instruction
  13420. END Data;
  13421. PROCEDURE SpecialInstruction(position: Basic.Position;subtype: SHORTINT; op1,op2,op3: IntermediateCode.Operand): IntermediateCode.Instruction;
  13422. VAR instruction: IntermediateCode.Instruction;
  13423. BEGIN
  13424. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.special,op1,op2,op3);
  13425. IntermediateCode.SetSubType(instruction, subtype);
  13426. RETURN instruction
  13427. END SpecialInstruction;
  13428. PROCEDURE Reserve(position: Basic.Position;units: LONGINT): IntermediateCode.Instruction;
  13429. VAR op1: IntermediateCode.Operand;
  13430. VAR instruction: IntermediateCode.Instruction;
  13431. BEGIN
  13432. (*! generate a warning if size exceeds a certain limit *)
  13433. (*
  13434. ASSERT(bytes < 1000000); (* sanity check *)
  13435. *)
  13436. ASSERT(0 <= units); (* sanity check *)
  13437. IntermediateCode.InitNumber(op1,units);
  13438. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.reserve,op1,emptyOperand,emptyOperand);
  13439. RETURN instruction
  13440. END Reserve;
  13441. PROCEDURE LabelInstruction(position: Basic.Position): IntermediateCode.Instruction;
  13442. VAR op1: IntermediateCode.Operand;
  13443. VAR instruction: IntermediateCode.Instruction;
  13444. BEGIN
  13445. IntermediateCode.InitNumber(op1,position.start);
  13446. IntermediateCode.InitInstruction(instruction,position,IntermediateCode.label,op1,emptyOperand,emptyOperand);
  13447. RETURN instruction
  13448. END LabelInstruction;
  13449. PROCEDURE EnterImmediate*(data: IntermediateCode.Section; CONST vop: IntermediateCode.Operand): LONGINT;
  13450. VAR pc: LONGINT;
  13451. PROCEDURE ProvidesValue(CONST instr: IntermediateCode.Instruction; op: IntermediateCode.Operand): BOOLEAN;
  13452. BEGIN
  13453. IF instr.opcode # IntermediateCode.data THEN RETURN FALSE END;
  13454. ASSERT(instr.op1.mode = IntermediateCode.ModeImmediate);
  13455. IF instr.op1.type.sizeInBits # op.type.sizeInBits THEN RETURN FALSE END;
  13456. IF instr.op1.type.form # op.type.form THEN RETURN FALSE END;
  13457. IF instr.op1.type.form = IntermediateCode.Float THEN
  13458. RETURN instr.op1.floatValue = op.floatValue
  13459. ELSE
  13460. RETURN instr.op1.intValue = op.intValue
  13461. END;
  13462. END ProvidesValue;
  13463. BEGIN
  13464. ASSERT(vop.mode = IntermediateCode.ModeImmediate);
  13465. pc := 0;
  13466. WHILE (pc<data.pc) & ~ProvidesValue(data.instructions[pc],vop) DO
  13467. INC(pc);
  13468. END;
  13469. IF pc = data.pc THEN
  13470. data.Emit(Data(Basic.invalidPosition,vop));
  13471. END;
  13472. RETURN pc
  13473. END EnterImmediate;
  13474. PROCEDURE Init;
  13475. VAR i: LONGINT; name: SyntaxTree.IdentifierString;
  13476. BEGIN
  13477. int8 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits8);
  13478. int16 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits16);
  13479. int32 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits32);
  13480. int64 := IntermediateCode.NewType(IntermediateCode.SignedInteger,IntermediateCode.Bits64);
  13481. uint8 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits8);
  13482. uint16 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits16);
  13483. uint32 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits32);
  13484. uint64 := IntermediateCode.NewType(IntermediateCode.UnsignedInteger,IntermediateCode.Bits64);
  13485. float32 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits32);
  13486. float64 := IntermediateCode.NewType(IntermediateCode.Float,IntermediateCode.Bits64);
  13487. IntermediateCode.InitOperand(emptyOperand);
  13488. FOR i := 0 TO NumberSystemCalls-1 DO
  13489. name := "@SystemCall";
  13490. Basic.AppendNumber(name,i);
  13491. systemCalls[i] := SyntaxTree.NewSymbol(SyntaxTree.NewIdentifier(name));
  13492. END;
  13493. END Init;
  13494. PROCEDURE IsExported(symbol: SyntaxTree.Symbol): BOOLEAN;
  13495. BEGIN
  13496. RETURN (symbol # NIL) & symbol.NeedsSection();
  13497. END IsExported;
  13498. BEGIN
  13499. Init;
  13500. END FoxIntermediateBackend.
  13501. Compiler.Compile -p=Win32 FoxIntermediateBackend.Mod ~
  13502. # Release.Build --path="/temp/obg/" Win32 ~
  13503. # 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 ~
  13504. FStols.CloseFiles A2Z.exe ~
  13505. System.FreeDownTo FoxIntermediateBackend ~
  13506. Compiler.Compile -p=Win32 --destPath=/temp/obg/ --traceModule=Trace
  13507. I386.Builtins.Mod Trace.Mod Windows.I386.Kernel32.Mod Windows.I386.Machine.Mod Heaps.Mod
  13508. Modules.Mod Windows.I386.Objects.Mod Windows.Kernel.Mod KernelLog.Mod Plugins.Mod Streams.Mod Pipes.Mod
  13509. Commands.Mod I386.Reals.Mod Reflection.Mod TrapWriters.Mod CRC.Mod SystemVersion.Mod
  13510. Windows.I386.Traps.Mod Locks.Mod Windows.Clock.Mod Disks.Mod Files.Mod Dates.Mod Strings.Mod UTF8Strings.Mod
  13511. FileTrapWriter.Mod Caches.Mod DiskVolumes.Mod OldDiskVolumes.Mod RAMVolumes.Mod DiskFS.Mod OldDiskFS.Mod
  13512. OberonFS.Mod FATVolumes.Mod FATFiles.Mod ISO9660Volumes.Mod ISO9660Files.Mod Windows.User32.Mod
  13513. Windows.WinTrace.Mod Windows.ODBC.Mod Windows.Shell32.Mod Windows.SQL.Mod Windows.WinFS.Mod
  13514. RelativeFileSystem.Mod BitSets.Mod Diagnostics.Mod StringPool.Mod ObjectFile.Mod
  13515. GenericLinker.Mod Loader.Mod BootConsole.Mod